?
Буферизация и сжатие данных при хранении мультиграфа
С. 76–78.
Polyakov I. V., Chepovskiy A.
In this paper we propose an approach for compact storaging of a certain type of graphs. We use preprocessing algorithms which can significantly increase the data density on the disc and reduce the required number of disk accesses required to perform fundamental operations with the graph.
In book
М., Протвино: Институт физико-технической информатики, 2016.
Alexander Karnaukhov, Artem Idelevich, Alexey Rolich et al., , in: 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY).: IEEE, 2023. P. 189–193.
Data transmission over low-speed networks is a subject of global research interest, with a specific focus on overcoming limitations in satellite communication channels. However, little research has addressed the impact of compression on data transmission efficiency in heterogeneous networks using satellite links, especially in the context of the Internet of Remote Things and under poor ...
Added: November 4, 2023
Nesterenko A., , in: Supplementary Proceedings of the 5th International Conference on Analysis of Images, Social Networks and Texts (AIST-SUP 2016), Yekaterinburg, Russia, April 7-9, 2016.Vol. 1710.: Aachen: CEUR Workshop Proceedings, 2016.
Added: November 3, 2020
Polyakov I. V., Chepovskiy A., Chepovskiy A., Journal of Mathematical Sciences 2020 Vol. 245 P. 197–201
In this paper we propose an approach for compact storage of big graphs. We
propose the preprocessing algorithms of a certain type of graphs which can
signi cantly increase the data density on the disc and increase performance
of fundamental operations with graphs. ...
Added: January 30, 2020
Chepovskiy A., Lobanova S., Business Informatics 2017 Vol. 42 No. 4 P. 64–73
A method for detecting intersecting and nested communities in graphs of interacting objects of different nature is proposed and implemented. For this, two classical algorithms are taken: a hierarchical agglomerate and based on the search for k -cliques. The presented combined method is based on their consistent application. In addition, parametric options are developed that ...
Added: August 2, 2019
Казаков А. Я., Zhikhareva A., Пасечник П. А., Информационные технологии и вычислительные системы 2018 № 3 С. 59–68
Problems of data compression are under consideration. Different modifications of the Byte Pair Encoding
(BPE) algorithm are discussed. A comparative analysis of the obtained results is made from the point of
view of the set of factors — the compression ratio of data and the time spent on the coding. ...
Added: May 3, 2019
Polyakov I. V., Chepovskiy A., Chepovskiy A., Фундаментальная и прикладная математика 2016 Т. 21 № 4 С. 125–132
В статье рассматриваются методы сжатия данных для хранения графов больших размеров. Предлагаются алгоритмы препроцессинга графа специальной структуры для повышения плотности записи данных и повышения эффективности выполнения базовых операций с графами. ...
Added: December 23, 2017
Казаков А. Я., Жихарева А.А., Пасечник П. А., Вестник Санкт-Петербургского государственного университета технологии и дизайна. Серия 1: Естественные и технические науки 2017 № 3 С. 3–9
Обсуждаются задачи сжатия больших объемов данных с целью передачи их по каналам связи, либо с целью их долгосрочного хранения. Предложены несколько модификаций одного из алгоритмов сжатия данных — метода Byte Pair Encoding (BPE). Проведен сравнительный анализ полученных результатов с точки зрения совокупности факторов — коэффициента сжатия данных и времени, затраченного на кодирование. ...
Added: October 8, 2017
Коломейченко М. И., Polyakov I. V., Chepovskiy A., В кн.: Труды Международной научной конференции Московского физико-технического института (государственного университета) и Института физико-технической информатики (SCVRT1516).: М., Протвино: Институт физико-технической информатики, 2016. С. 93–97.
This paper describes an automatic graph layout ”peacock’s tail”, which is based on force-directed graph drawing algorithm. Also presented its modified faster version called ”fast peacock’s tail.” This approach proved its efficiency on big social network graphs. ...
Added: November 20, 2016
Fursov K., Kadyrova A., , in: Supplementary Proceedings of the 5th International Conference on Analysis of Images, Social Networks and Texts (AIST-SUP 2016), Yekaterinburg, Russia, April 7-9, 2016.Vol. 1710.: Aachen: CEUR Workshop Proceedings, 2016. P. 51–61.
The term of advanced technology is primarily associated with computer electronics and microelectronics actively developing since 1960s. Although there is no single conventional definition of the notion or specific class of technology that is associated with it, discussions on what may be considered as technical advancements in the current perspective evolve over time. As long ...
Added: October 24, 2016
Fursov K., Kadyrova A., Scientometrics 2017 Vol. 111 No. 3 P. 1947–1963
Since early 1960s, there has been a growing interest in the emergence and development of new technologies accompanied by a strong wish from decision makers to govern related processes at the corporate and national levels. One of the key categories that appeared to set up analytical and regulatory frameworks was the ‘advanced technology’ category. Primarily ...
Added: October 15, 2016
Avdoshin S. M., Набебин А. А., М.: ДМК Пресс, 2017.
The textbook contains necessary information about universal and classical algebras, systems of axioms for the basic algebraic structures (groupoid, monoid, semi-groups, groups, partial orders, rings, fields). The basic cryptographic algorithms are described. Error-correcting codes - linear, cyclic, BCH are considered. Algorithms for designing of such codes are given. Many examples are shown. It is put ...
Added: August 19, 2016
Maslov V. P., Nazaikinskii V. E., Mathematical notes 2016 Vol. 99 No. 3 P. 616–618
Added: July 7, 2016
Kutuzov A. B., , in: Information Retrieval. 9th Russian Summer School, RuSSIR 2015, Saint Petersburg, Russia, August 24-28, 2015, Revised Selected PapersVol. 573.: Switzerland: Springer, 2016. Ch. 6 P. 320–331.
The present paper deals with word sense induction from lexical co-occurrence graphs. We construct such graphs on large Russian corpora and then apply the data to cluster the results of Mail.ru search according to meanings in the query. We compare different methods of performing such clustering and different source corpora. Models of applying distributional semantics ...
Added: December 25, 2015
Коломейченко М. И., Polyakov I. V., Chepovskiy A., В кн.: Труды Международной научной конференции Resilience2014 Международного Центра по ядерной безопасности Института физико-технической информатики.: М., Протвино: Институт физико-технической информатики, 2015. С. 139–143.
This paper describes the architecture of software for networks storage, analysis and visualization. The article presents a description of network downloading module, describes the specially designed variety data storages. Besides it describes signicant implementation details and usage principles of network downloading module and storages. ...
Added: November 29, 2015
Kolomeychenko M. I., Chepovskiy A.A., Chepovskiy A.M., Journal of Mathematical Sciences 2015 Vol. 211 No. 3 P. 310–318
In this paper we propose an algorithm for finding subgraphs with adjusted properties of large social networks. The description of computational experi-ment which confirms the effectiveness of the proposed algorithm is given. ...
Added: October 24, 2015