Allocation of Clusters of Objects on Topological Graphs of High Cardinality; Key Engineering Materials; Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015)
| Parent link: | Key Engineering Materials: Scientific Journal Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015).— 2016.— [P. 952-956] |
|---|---|
| 1. Verfasser: | |
| Körperschaft: | |
| Weitere Verfasser: | |
| Zusammenfassung: | Title screen Distributed systems containing hundreds or thousands of objects, are generally constructed in the form of hierarchical structures. In these structures, the lower level objects in the subset are combined for connecting to centers. Existing algorithms are not able to successfully meet the challenges of structuring on the sets of such dimension. Therefore, new algorithms suitable for solving the problems of structuring on the sets containing thousands of objects are necessary. The authors developed an algorithm to form objects clusters for high cardinality sets, with up to a thousand or more objects located in a given area. The algorithm is developed with the help of graph theory, design and analysis of algorithms efficiency, compact partitions theory, compact sets of objects and their clusters. Geographical location of a set of objects of a distributed system is considered as a topological graph. To improve the efficiency of the algorithm of forming compact sets and clusters allocation the concept of the zone of active search for nearby vertices is introduced. That enables the possibility to replace a matrix of distances between the vertices to list of vertices incidents formed on the basis of active search zone. An algorithm for the approximate solution of clusters allocation of topological graph objects represented by a list of vertices incidents is developed. The algorithm recurrently increases the cardinality of compact sets for each object and analyzes acquired clusters. Algorithm description is accompanied by an example. Режим доступа: по договору с организацией-держателем ресурса |
| Sprache: | Englisch |
| Veröffentlicht: |
2016
|
| Schriftenreihe: | Information Technology, Data and Signal Processing |
| Schlagworte: | |
| Online-Zugang: | http://dx.doi.org/10.4028/www.scientific.net/KEM.685.952 |
| Format: | Elektronisch Buchkapitel |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=646584 |
MARC
| LEADER | 00000nla2a2200000 4500 | ||
|---|---|---|---|
| 001 | 646584 | ||
| 005 | 20260708161140.0 | ||
| 035 | |a (RuTPU)RU\TPU\network\11720 | ||
| 035 | |a RU\TPU\network\11712 | ||
| 090 | |a 646584 | ||
| 100 | |a 20160303a2016 k y0engy50 ba | ||
| 101 | 0 | |a eng | |
| 105 | |a y z 100zy | ||
| 135 | |a drcn ---uucaa | ||
| 181 | 0 | |a i | |
| 182 | 0 | |a b | |
| 200 | 1 | |a Allocation of Clusters of Objects on Topological Graphs of High Cardinality |f A. Pogrebnoy, A. V. Pogrebnoy | |
| 203 | |a Text |c electronic | ||
| 225 | 1 | |a Information Technology, Data and Signal Processing | |
| 300 | |a Title screen | ||
| 330 | |a Distributed systems containing hundreds or thousands of objects, are generally constructed in the form of hierarchical structures. In these structures, the lower level objects in the subset are combined for connecting to centers. Existing algorithms are not able to successfully meet the challenges of structuring on the sets of such dimension. Therefore, new algorithms suitable for solving the problems of structuring on the sets containing thousands of objects are necessary. The authors developed an algorithm to form objects clusters for high cardinality sets, with up to a thousand or more objects located in a given area. The algorithm is developed with the help of graph theory, design and analysis of algorithms efficiency, compact partitions theory, compact sets of objects and their clusters. Geographical location of a set of objects of a distributed system is considered as a topological graph. To improve the efficiency of the algorithm of forming compact sets and clusters allocation the concept of the zone of active search for nearby vertices is introduced. That enables the possibility to replace a matrix of distances between the vertices to list of vertices incidents formed on the basis of active search zone. An algorithm for the approximate solution of clusters allocation of topological graph objects represented by a list of vertices incidents is developed. The algorithm recurrently increases the cardinality of compact sets for each object and analyzes acquired clusters. Algorithm description is accompanied by an example. | ||
| 333 | |a Режим доступа: по договору с организацией-держателем ресурса | ||
| 461 | 0 | |0 (RuTPU)RU\TPU\network\11477 |t Key Engineering Materials |o Scientific Journal | |
| 463 | 0 | |0 (RuTPU)RU\TPU\network\11478 |t Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015) |o The IV International Conference, April 21-24, 2015, Tomsk, Russia |o [proceedings] |f National Research Tomsk Polytechnic University (TPU) ; ed. N. V. Martyushev, A. M. Bogdan |v [P. 952-956] |d 2016 | |
| 610 | 1 | |a электронный ресурс | |
| 610 | 1 | |a труды учёных ТПУ | |
| 610 | 1 | |a накопление | |
| 610 | 1 | |a объекты | |
| 610 | 1 | |a кластеры | |
| 610 | 1 | |a плотность | |
| 610 | 1 | |a топологические графы | |
| 700 | 1 | |a Pogrebnoy |b A. | |
| 701 | 1 | |a Pogrebnoy |b A. V. |c specialist in the field of Informatics and computer engineering |c Associate Professor of Tomsk Polytechnic University, candidate of technical sciences |f 1973- |g Aleksandr Vladimirovich |3 (RuTPU)RU\TPU\pers\33679 |9 17310 | |
| 712 | 0 | 2 | |a Томский политехнический университет |b Институт кибернетики, ИК |c 2010-2017 |9 27025 |
| 801 | 2 | |a RU |b 63413507 |c 20160303 |g RCR | |
| 856 | 4 | |u http://dx.doi.org/10.4028/www.scientific.net/KEM.685.952 | |
| 942 | |c CF | ||