?
Algorithms for Searching Paths in Huge Graphs
Journal of Mathematical Sciences. 2015. Vol. 211. No. 3. P. 413-417.
Various approaches for data storing and processing are investigated in the article. New algorithm to find paths in a huge graph is introduced.
Priority areas:
IT and mathematics
Language:
English
Zimina E., Shmid A., Новопашин М. А., Data Science. Information Technology and Nanotechnology 2018, CEUR workshop proceedings 2018 No. 2212 P. 112-118
The article includes the observation of the cloud services and technologies usage.
The article contains a review of mathematical analysis of cardiac information using cloud
technology, which produces storage, analysis and forecasting on the basis of owned data. In
addition, the authors consider the possibility of integrating cloud technologies with external
systems. The massive use of mobile devices for ...
Added: August 27, 2019
Chernyshev S. V., Cherepanov E. A., Pankratiev E. V. et al., Journal of Mathematical Sciences 2005 Vol. 128 No. 6 P. 3487-3495
Added: January 27, 2014
Golubtsov P., Automatic Documentation and Mathematical Linguistics 2018 Vol. 52 No. 4 P. 203-213
The procedure of transition from a priori to a posteriori information for a linear experiment in the context of Big Data systems is considered. At first glance, this process is fundamentally sequential, namely: as a result of observation, a priori information is transformed into a posteriori information, which is later interpreted as a priori for ...
Added: January 18, 2019
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
Franch m., Les Ulis : EDP Sciences, 2016
ITM Web of Conferences is an Open Access publication series dedicated to archiving conference proceedings dealing with all the aspects related to information technology, computer science and mathematics. The aims and scope of the journal cover the whole spectrum of pure and applied mathematics, software engineering, human-computer interaction, and the study of organizations and information technology.
ITM ...
Added: February 15, 2018
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
[б.и.], 2014
Full texts of third international conference on data analytics are presented. ...
Added: October 13, 2014
Gorbunov A. A., Isaev E., Samodurov V., Radio Physics and Radio Astronomy 2017 Т. 22 № 4 С. 270-275
In the process of astronomical observations are collected vast amounts of data. BSA (Big Scanning Antenna) LPI used in the study of impulse phenomena, daily logs 87.5 GB of data (32 TB per year). Experts classified 83096 individual observations (on the segment of the study July 2012 - October 2013). Over 75% of the sample ...
Added: October 15, 2017
CEUR Workshop Proceedings, 2019
Added: October 31, 2019
Golubtsov P., Automatic Documentation and Mathematical Linguistics 2018 Vol. 52 No. 2 P. 73-79
This paper addresses the problem of transforming the optimal linear estimation procedure in such a way that separate fragments of initial data are processed individually and concurrently. A representation of intermediate information is proposed that allows an algorithm to concurrently extract this information from each initial data set, combine it, and use it for estimation. ...
Added: January 23, 2019
Shmid A., Zimina E., Новопашин М. А. et al., Physiotherapy Research and Reports, Open Access Text, UK 2018 No. 1(2) P. 1-4
The idea of forced external synchronization of the heart dynamics by the canonical FPU spectrum with a purpose to lower the rate of its desynchronization in some pathological cases has been hypothesized by the authors. It was concluded that a heart being a multi resonant distributed dynamic ion containing system may be resonantly influenced by ...
Added: August 2, 2019
Proceedings of the Russian-French Workshop in Big Data and Applications. October 12–13, 2017, Moscow
M. : Higher School of Economics Publishing House, 2018
Added: January 23, 2019
Switzerland : Springer, 2019
This book constitutes the refereed proceedings of the 11th International Conference on Intelligent Data Processing, IDP 2016, held in Barcelona, Spain, in October 2016.
The 11 revised full papers were carefully reviewed and selected from 52 submissions. The papers of this volume are organized in topical sections on machine learning theory with applications; intelligent data processing in life ...
Added: February 8, 2020
Gorbunov A. A., Isaev E., Samodurov V., Journal of Physics: Conference Series 2018 Vol. 945 No. 1 P. 1-4
In the process of astronomical observations collected vast amounts of data. BSA (Big Scanning Antenna) LPI used in the study of impulse phenomena, daily logs 87.5 GB of data (32 TB per year). These data have important implications for both short-and long-term monitoring of various classes of radio sources (including radio transients of different nature), ...
Added: October 15, 2017
Зимина Е. Ю., Статистика и Экономика 2018 Т. 15 № 2 С. 30-37
The article includes the observation of the cluster analysis of medical
data on the example of the cardiac data. One of the main effective
and commonly used Data Mining methods that applied to the large
amounts of information (for example, mathematical economics) are
clustering methods: the search for signs of similarity between objects
in the study of the subject area ...
Added: May 29, 2018
Bliznets Ivan, Cygan M., Komosa P. et al., ACM Transactions on Computation Theory 2018 Vol. 10 No. 2 P. 1-32
The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free—that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from the point of ...
Added: October 30, 2018
Красноярск : ИВМ СО РАН, 2013
Труды Пятой Международной конференции «Системный анализ и информационные технологии» САИТ-2013 (19–25 сентября 2013 г., г.Красноярск, Россия): ...
Added: November 18, 2013
Babash A. V., М. : ИНФРА-М, РИОР, 2013
Пособие предназначено для студентов высших учебных заведений, обучающихся по специальности «Прикладная информатика (в экономике)». Оно также содержит методический материал для ряда инновационных курсов лекций по профилю «Информационная безопасность» и может быть использовано и для блока дисциплин этого профиля. Ряд представленных результатов полезен специалистам и аспирантам, специализирующихся в указанной области. ...
Added: January 14, 2014
Parinov A., Научно-техническая информация. Серия 2: Информационные процессы и системы 2014
В статье рассматриваются сочетания базовых структур данных локального хранилища системы поддержки принятия решений FCART и приводятся временные характеристики при использовании больших объемов данных. ...
Added: November 19, 2013
Barcelona : IEEE, 2017
International Conference on Control, Decision and Information Technologies. ...
Added: January 17, 2018
Vostrikov A. V., Borisov N., Abrameshin A. E., Качество. Инновации. Образование 2013 № 8 (99) С. 61-65
In work research of numerical stability of earlier reduced scheme of numerical integration of system of the linear ordinary differential equations developed by authors is conducted. The received condition of numerical stability of the reducing scheme proves possibility of use of this scheme in practice. Operability of the reduced scheme was tested on a real ...
Added: September 9, 2013
Malyshev D., Дискретный анализ и исследование операций 2012 Т. 19 № 4 С. 66-72
Рассматривается конструктивный подход к формированию новых случаев эффективной разрешимости задачи о независимом множестве в семействе наследственных частей множества графов Free({P5,C5}). Именно, доказывается, что если эта задача полиномиально разрешима в классе Free({P5,C5,G}), то для любого графа H, который может быть индуктивно получен из G применением к текущему графу сложения с K1 или умножения на K1, эта ...
Added: August 31, 2012
Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35-45
Added: October 17, 2014
Yasnitsky L., Ваулева С. В., Сафонова Д. Н. et al., Всероссийский криминологический журнал 2015 Т. 9 № 3 С. 423-430
Modern criminalists do not share a common opinion regarding the choice of parameters which could be used to work out a system of characteristics to differentiate a maniac killer from an ordinary person. This hinders the development of efficient software for investigation purposes. The paper describes the experience of developing a neural network that can ...
Added: October 1, 2015