?
Differences in Structural Connectomes between Typically Developing and Autism Groups
P. 1-15.
Petrov D., Dodonova Y., Zhukov L. E.
We study dierences in structural connectomes between typically developing and autism spectrum disorders individuals with machine learning techniques using connection weights and network metrics as features. We build linear SVM classier with accuracy score 0:64 and report 16 features (seven connection weights and nine network node centralities) best distinguishing these two groups.
In book
St. Petersburg : Институт проблем передачи информации им. А.А. Харкевича РАН, 2015
Petrov D., Dodonova Y., Zhukov L. E. et al., , in : PRNI 2016. The 6th International Workshop on Pattern Recognition in Neuroimaging. Trento, Italy, June 22nd – 24th, 2016. : NY : IEEE, 2016. P. 1-4.
The structural connectome classification is a challenging task due to a small sample size and high dimensionality of feature space. In this paper, we propose a new data prepossessing method that combines geometric and topological connectome normalization and significantly improves classification results. We validate this approach by performing classification between autism spectrum disorder and normal ...
Added: March 5, 2017
Meunier D., Pascarella A., Altukhov D. et al., Neuroimage 2020 Vol. 219 No. october P. 1-13
Recent years have witnessed a massive push towards reproducible research in neuroscience. Unfortunately, this endeavor is often challenged by the large diversity of tools used, project-specific custom code and the difficulty to track all user-defined parameters. NeuroPycon is an open-source multi-modal brain data analysis toolkit which provides Python-based template pipelines for advanced multi-processing of MEG, ...
Added: November 12, 2020
Sirotkin D., Журнал Средневолжского математического общества 2017 Т. 19 № 2 С. 98-104
В данной работе вводится некоторый класс замен подграфов в графах, причем замены из этого класса сохраняют $k$-раскрашиваемость. Каждое такое локальное преобразование графов определяется некоторым шаблоном – набором разбиений множества на его подмножества. Показывается, что заменяющий подграф существует для любого шаблона, а также приводится оценка на количество его вершин от размера шаблона. Данный результат является основным ...
Added: August 23, 2017
Shitov Y., / Cornell University. Series math "arxiv.org". 2014. No. 1409.1530.
We give an example of two n-by-n chess positions, A and B, such that (1) there is a sequence of legal chess moves leading from A to B; (2) the length of this sequence cannot be less than exp(cn). ...
Added: October 30, 2014
Beckermann B., Kalyagin V., Matos A. C. et al., Constructive Approximation 2013 Vol. 37 No. 1 P. 101-134
We prove existence and uniqueness of a solution to the problem of minimizing the logarithmic energy of vector potentials associated to a d-tuple of positive measures supported on closed subsets of the complex plane. The assumptions we make on the interaction matrix are weaker than the usual ones, and we also let the masses of ...
Added: February 3, 2013
Чжо М. А., Sidorenko V., Бучирин В. Г. et al., , in : 2019 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus). : M. : IEEE, 2019. P. 2148-2151.
This paper discusses the application of genetic algorithms for the scheduling of electric rolling stock maintenance. The main objective is to improve the automated train scheduling system of uniformity maintenance process with a variety of maintenance resources, including the limited resources. The methods of graph theory and Bellman principle allow us to get the entire ...
Added: August 13, 2019
Sidorenko V., Чжо М. А., В кн. : ХХV международная научная конференция «Проблемы управления безопасностью сложных систем». : М. : РГГУ, 2017. С. 554-557.
This article focuses on a sequencing approach for the night arrangement of subway trains compositions. In this paper, we developed an algorithm for transforming the adjacency matrix of a simple graph into the adjacency matrix of a "dense" graph. ...
Added: March 9, 2018
Lin F., Lee H., Kuo W. et al., Frontiers in Psychology 2021 Vol. 11 Article 547353
While univariate functional magnetic resonance imaging (fMRI) data analysis methods have been utilized successfully to map brain areas associated with cognitive and emotional functions during viewing of naturalistic stimuli such as movies, multivariate methods might provide the means to study how brain structures act in concert as networks during free viewing of movie clips. Here, ...
Added: March 10, 2021
М. : Изд-во механико-математического факультета МГУ, 2016
Сборник содержит материалы XII Международного семинара «Дискретная математика и ее приложения» имени академика О.Б. Лупанова, проходившего на механико-математическом факультете МГУ имени М. В. Ломоносова с 20 по 25 июня 2016 г. при поддержке Российского фонда фундаментальных исследований (проект 16–01–20345). Для студентов, аспирантов и научных работников в области дискретной математики и математической кибернетики. ...
Added: August 29, 2016
Springer, 2016
This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7–11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in ...
Added: October 4, 2018
Springer, 2018
This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, ...
Added: October 23, 2018
Додонова Ю., Петров Д., Zhukov L. E., В кн. : "Информационные технологии и системы 2015" 39-я междисциплинарная школа-конференция 7 – 11 сентября, Олимпийская деревня, Сочи, Россия. : St. Petersburg : Институт проблем передачи информации им. А.А. Харкевича РАН, 2015. С. 1-13.
Comparison of the kernel effectiveness of SVM classifier to distinguish gender based on the structural connectome ...
Added: March 5, 2017
Золотенкова Г. В., Rogachev A., Пиголкин Ю. И. et al., Современные технологии в медицине 2022 Т. 14 № 1 С. 15-24
The aim of the study was to assess the capabilities of age determination (age group) at death using classification techniques by histomorphometric characteristics of osseous and cartilaginous tissue aging.
Materials and Methods. The study material was a database containing the findings of morphometric researches of osseous and cartilaginous tissue histologic specimens from 294 categorized male corpses ...
Added: May 25, 2022
Shitov Y., Theoretical Computer Science 2017 Vol. 660 P. 102-104
Let G be a simple graph whose vertices are partitioned into two subsets, called ‘filled’ vertices and ‘empty’ vertices. A vertex v is said to be forced by a filled vertex u if v is a unique empty neighbor of u. If we can fill all the vertices of G by repeatedly filling the forced ones, then we call an initial set of filled vertices a ...
Added: December 19, 2016
Kovalenko K., Romance M., Vasilyeva E. et al., Chaos, Solitons and Fractals 2022 Vol. 162 Article 112397
Identifying the most influential nodes in networked systems is of vital importance to optimize their function and control. Several scalar metrics have been proposed to that effect, but the recent shift in focus towards network structures which go beyond a simple collection of dyadic interactions has rendered them void of performance guarantees. We here introduce ...
Added: January 31, 2023
NY : IEEE, 2016
This paper aims to tackle the problem of brain network classification with machine learning algorithms using spectra of networks’ matrices. Two approaches are discussed: first, linear and tree-based models are trained on the vectors of sorted eigenvalues of the adjacency matrix, the Laplacian matrix and the normalized Laplacian; next, SVM classifier is trained with kernels ...
Added: December 9, 2016
Sidorenko V., Чжо М. А., В кн. : Труды пятой научно-технической конференции «Интеллектуальные системы управления на железнодорожном транспорте. Компьютерное и математическое моделирование. (ИСУЖТ-2016)». : М. : ОАО "НИИАС", 2016. С. 131-134.
При решении задач автоматизации управления транспортными системами графовые модели применяются для решения широкого круга задач:
моделирования топологии транспортной системы;
формализованного описания технологических процессов, протекающих в системе;
разработки алгоритмов управления, реализуемых средствами автоматизации;
решения задач оптимального управления.
В данной работе авторы приводят результаты, полученные в области автоматизации управления движением поездов метрополитена на кафедре «Управление и защита информации» Московского государственного университета путей ...
Added: March 15, 2018
Springer, 2022
The 21 full papers presented together with 6 invited abstracts lectures and 2 tutorial abstracts in this volume were carefully reviewed and selected from 88 submissions. The conference focuses on the following topics: Mathematical programming, bi-level and global optimization, integer programming and combinatorial optimization, approximation algorithms with theoretical guarantees and approximation schemes, heuristics and meta-heuristics, ...
Added: July 7, 2022
М. : МАКС Пресс, 2017
The collection represents proceedings of the XVIII international conference “Problems of Theoretical Cybernetics” (Penza, 19–23 June, 2017), that is sponsored by Russian Foundation for Basic Research (project N 17-01-20217-г). The conference subject area includes: control systems synthesis, complexity, reliability, and diagnostics; automata; computer languages and programming; graph theory; combinatorics; coding theory; theory of pattern recognition; ...
Added: August 25, 2017
Shitov Y., American Mathematical Monthly 2016 Vol. 123 No. 1 P. 71-77
We present an infinite sequence of pairs (An, Bn) of chess positions on an n × n board such that (1) there is a legal sequence of chess moves leading from An to Bn and (2) any legal sequence leading from An to Bn contains at least exp(n + o(n)) moves. ...
Added: February 23, 2016
Anton Kocheturov, Pardalos P. M., Karakitsiou A., Annals of Operations Research 2019 Vol. 276 No. 1-2 P. 5-34
This survey paper attempts to cover a broad range of topics related to computational
biomedicine. The field has been attracting great attention due to a number of benefits it can
provide the society with. New technological and theoretical advances have made it possible
to progress considerably. Traditionally, problems emerging in this field are challenging from
many perspectives. In this ...
Added: May 22, 2018
Korepanova N., Kuznetsov S., Karachunskiy A., , in : Analysis of Images, Social Networks and Texts Third International Conference, AIST 2014, Yekaterinburg, Russia, April 10-12, 2014, Revised Selected Papers. Vol. 439.: Berlin : Springer, 2014. P. 101-110.
Added: November 13, 2014
Rubchinskiy A., М. : Директ-Медиа, 2014
Предлагаемое пособие посвящено дискретным математическим моделям – в первую очередь, решению разнообразных стандартных задач, в которых надо что-то посчитать, найти, построить и т.д., но не доказать. Особое внимание уделяется технологии ручной реализации алгоритмов. Аудитория предполагаемого пособия вполне определена. Она состоит из студентов бакалавриата и магистратуры, обучающихся по специальностям, попадающим между точными, естественными и инженерными науками, ...
Added: October 20, 2017
Piperski A., Yearbook of the Poznan Linguistic Meeting 2015 Vol. 1 P. 89-102
This article introduces a new measure of linguistic complexity which is based on the dual nature of the linguistic sign. Complexity is analyzed as consisting of three components, namely the conceptual complexity (complexity of the signified), the formal complexity (complexity of the signifier) and the form-meaning correspondence complexity. I describe a way of plotting the ...
Added: March 13, 2016