检索结果-内蒙古大学图书馆

arXiv 2023年

作者： Jafari, Mahboobeh Sadeghi, Delaram Shoeibi, Afshin Alinejad-Rokny, Hamid Beheshti, Amin García, David López Chen, Zhaolin Acharya, U. Rajendra Gorriz, Juan M. Internship in BioMedical Machine Learning Lab The Graduate School of Biomedical Engineering UNSW Sydney SydneyNSW2052 Australia Data Science and Computational Intelligence Institute University of Granada Spain BioMedical Machine Learning Lab The Graduate School of Biomedical Engineering UNSW Sydney SydneyNSW2052 Australia UNSW Data Science Hub The University of New South Wales SydneyNSW2052 Australia Health Data Analytics Program Centre for Applied Artificial Intelligence Macquarie University Sydney2109 Australia Data Science Lab School of Computing Macquarie University SydneyNSW2109 Australia Monash University Melbourne Australia School of Mathematics Physics and Computing University of Southern Queensland Springfield Australia Department of Psychiatry University of Cambridge United Kingdom

Schizophrenia (SZ) is a prevalent mental disorder characterized by cognitive, emotional, and behavioral changes. Symptoms of SZ include hallucinations, illusions, delusions, lack of motivation, and difficulties in concentration. While the exact causes of SZ remain unproven, factors such as brain injuries, stress, and psychotropic drugs have been implicated in its development. SZ can be classified into different types, including paranoid, disorganized, catatonic, undifferentiated, and residual. Diagnosing SZ involves employing various tools, including clinical interviews, physical examinations, psychological evaluations, the Diagnostic and Statistical Manual of Mental Disorders (DSM), and neuroimaging techniques. Electroencephalography (EEG) recording is a significant functional neuroimaging modality that provides valuable insights into brain function during SZ. However, EEG signal analysis poses challenges for neurologists and scientists due to the presence of artifacts, long-term recordings, and the utilization of multiple channels. To address these challenges, researchers have introduced artificial intelligence (AI) techniques, encompassing conventional machine learning (ML) and deep learning (DL) methods, to aid in SZ diagnosis. This study reviews papers focused on SZ diagnosis utilizing EEG signals and AI methods. The introduction section provides a comprehensive explanation of SZ diagnosis methods and intervention techniques. Subsequently, review papers in this field are discussed, followed by an introduction to the AI methods employed for SZ diagnosis and a summary of relevant papers presented in tabular form. Additionally, this study reports on the most significant challenges encountered in SZ diagnosis, as identified through a review of papers in this field. Future directions to overcome these challenges are also addressed. The discussion section examines the specific details of each paper, culminating in the presentation of conclusions and findings. © 2023,

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Opinion dynamics on tie-decay networks

引用

Physical Review Research 2021年第2期3卷 023249-023249页

作者： Kashin Sugishita Mason A. Porter Mariano Beguerisse-Díaz Naoki Masuda Department of Mathematics State University of New York at Buffalo Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo New York 14260-5030 USA and Faculty of Science and Engineering Waseda University 169-8555 Tokyo Japan

In social networks, interaction patterns typically change over time. We study opinion dynamics on tie-decay networks in which tie strength increases instantaneously when there is an interaction and decays exponentially between interactions. Specifically, we formulate continuous-time Laplacian dynamics and a discrete-time DeGroot model of opinion dynamics on these tie-decay networks, and we carry out numerical computations for the continuous-time Laplacian dynamics. We examine the speed of convergence by studying the spectral gaps of combinatorial Laplacian matrices of tie-decay networks. First, we compare the spectral gaps of the Laplacian matrices of tie-decay networks that we construct from empirical data with the spectral gaps for corresponding randomized and aggregate networks. We find that the spectral gaps for the empirical networks tend to be smaller than those for the randomized and aggregate networks. Second, we study the spectral gap as a function of the tie-decay rate and time. Intuitively, we expect small tie-decay rates to lead to fast convergence because the influence of each interaction between two nodes lasts longer for smaller decay rates. Moreover, as time progresses and more interactions occur, we expect eventual convergence. However, we demonstrate that the spectral gap need not decrease monotonically with respect to the decay rate or increase monotonically with respect to time. Our results highlight the importance of the interplay between the times that edges strengthen and decay in temporal networks.

关键词： Network structure Social networks Consensus & non-consensus models

来源：评论

学校读者我要写书评

暂无评论

Randomizing hypergraphs preserving degree correlation and local clustering

arXiv

引用

arXiv 2021年

作者： Nakajima, Kazuki Shudo, Kazuyuki Masuda, Naoki Department of Mathematical and Computing Science Tokyo Institute of Technology Japan Department of Mathematics State University of New York Buffalo United States Computational and Data-Enabled Science and Engineering Program State University of New York Buffalo United States Faculty of Science and Engineering Waseda University Japan

Many complex systems involve direct interactions among more than two entities and can be represented by hypergraphs, in which hyperedges encode higher-order interactions among an arbitrary number of nodes. To analyze structures and dynamics of given hypergraphs, a solid practice is to compare them with those for randomized hypergraphs that preserve some specific properties of the original hypergraphs. In the present study, we propose a family of such reference models for hypergraphs, called the hyper dk-series, by extending the so-called dk-series for dyadic networks to the case of hypergraphs. The hyper dk-series preserves up to the individual node’s degree, node’s degree correlation, node’s redundancy coefficient, and/or the hyperedge’s size depending on the parameter values. Furthermore, we numerically find that higher-order hyper dk-series more accurately preserves the shortest path length and degree distribution of the one-mode projection of the original hypergraph, which the method does not intend to preserve. We also apply the hyper dk-series to numerical simulations of epidemic spreading and evolutionary game dynamics on empirical social hypergraphs. We find that the hyperedge’s size affects these dynamics more than any of the node’s properties and that the node’s degree correlation and redundancy in the empirical hypergraphs promote cooperation. Copyright © 2021, The Authors. All rights reserved.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Finite-size effects on the convergence time in continuous-opinion dynamics

引用

Physical Review E 2021年第1期104卷 014309-014309页

作者： Hang-Hyun Jo Naoki Masuda Department of Physics The Catholic University of Korea Bucheon 14662 Republic of Korea Department of Mathematics State University of New York at Buffalo Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo New York 14260-5030 USA

We study finite-size effects on the convergence time in a continuous-opinion dynamics model. In the model, each individual's opinion is represented by a real number on a finite interval, e.g., [0,1], and a uniformly randomly chosen individual updates its opinion by partially mimicking the opinion of a uniformly randomly chosen neighbor. We numerically find that the characteristic time to the convergence increases as the system size increases according to a particular functional form in the case of lattice networks. In contrast, unless the individuals perfectly copy the opinion of their neighbors in each opinion updating, the convergence time is approximately independent of the system size in the case of regular random graphs, uncorrelated scale-free networks, and complete graphs. We also provide a mean-field analysis of the model to understand the case of the complete graph.

关键词： Complex systems Nonequilibrium statistical mechanics Social systems Homogeneous networks Scale free & inhomogeneous networks Social dynamics Master equation Monte Carlo methods Network Models

来源：评论

学校读者我要写书评

暂无评论

Epidemic dynamics on metapopulation networks with node2vec mobility

arXiv

引用

arXiv 2021年

作者： Meng, Lingqi Masuda, Naoki Department of Mathematics State University of New York BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program State University of New York BuffaloNY14260-5030 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

Metapopulation models have been a powerful tool for both theorizing and simulating epidemic dynamics. In a metapopulation model, one considers a network composed of subpopulations and their pairwise connections, and individuals are assumed to migrate from one subpopulation to another obeying a given mobility rule. While how different mobility rules affect epidemic dynamics in metapopulation models has been studied, there have been relatively few efforts on comparison of the effects of simple (i.e., unbiased) random walks and more complex mobility rules. Here we study a susceptible-infectious-susceptible (SIS) dynamics in a metapopulation model, in which individuals obey a parametric second-order random-walk mobility rule called the node2vec. We map the second-order mobility rule of the node2vec to a first-order random walk in a network whose each node is a directed edge connecting a pair of subpopulations and then derive the epidemic threshold. For various networks, we find that the epidemic threshold is large (therefore, epidemic spreading tends to be suppressed) when the individuals infrequently backtrack or infrequently visit the common neighbors of the currently visited and the last visited subpopulations than when the individuals obey the simple random walk. The amount of change in the epidemic threshold induced by the node2vec mobility is in general not as large as, but is sometimes comparable with, the one induced by the change in the diffusion rate for individuals. Copyright © 2021, The Authors. All rights reserved.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Higher-order rich-club phenomenon in collaborative research grant networks

arXiv

引用

arXiv 2022年

作者： Nakajima, Kazuki Shudo, Kazuyuki Masuda, Naoki Department of Mathematical and Computing Science Tokyo Institute of Technology Meguro-ku Tokyo152-8552 Japan Department of Mathematics State University of New York at Buffalo Buffalo14260 United States Academic Center for Computing and Media Studies Kyoto University Sakyo-ku Kyoto606-8501 Japan Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo14260 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

Modern scientific work, including writing papers and submitting research grant proposals, increasingly involves researchers from different institutions. In grant collaborations, it is known that institutions involved in many collaborations tend to densely collaborate with each other, forming rich clubs. Here we investigate higher-order rich-club phenomena in networks of collaborative research grants among institutions and their associations with research impact. Using publicly available data from the National science Foundation in the US, we construct a bipartite network of institutions and collaborative grants, which distinguishes among the collaboration with different numbers of institutions. By extending the concept and algorithms of the rich club for dyadic networks to the case of bipartite networks, we find rich clubs both in the entire bipartite network and the bipartite subnetwork induced by the collaborative grants involving a given number of institutions up to five. We also find that the collaborative grants within rich clubs tend to be more productive in a per-dollar sense than the control. Our results highlight advantages of collaborative grants among the institutions in the rich clubs. Copyright © 2022, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accuracy of a one-dimensional reduction of dynamical systems on networks

arXiv

引用

arXiv 2021年

作者： Kundu, Prosenjit Kori, Hiroshi Masuda, Naoki Department of Mathematics State University of New York BuffaloNY14260-2900 United States Department of Complexity Science and Engineering The University of Tokyo Chiba277-8561 Japan Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY14260-5030 United States

Resilience is an ability of a system with which the system can adjust its activity to maintain its functionality when it is perturbed. To study resilience of dynamics on networks, Gao et al. [Nature, 530, 307 (2016)] proposed a theoretical framework to reduce dynamical systems on networks, which are high dimensional in general, to one-dimensional dynamical systems. The accuracy of this one-dimensional reduction relies on several assumption in addition to the assumption that the network has a negligible degree correlation. In the present study, we analyze the accuracy of the one-dimensional reduction assuming networks without degree correlation. We do so mainly through examining the validity of the individual assumptions underlying the method. Across five dynamical system models, we find that the accuracy of the one-dimensional reduction hinges on the spread of the equilibrium value of the state variable across the nodes in most cases. Specifically, the one-dimensional reduction tends to be accurate when the dispersion of the node's state is small. We also find that the correlation between the node's state and the node's degree, which is common for various dynamical systems on networks, is unrelated to the accuracy of the one-dimensional reduction. © 2021, CC BY.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Temporal motifs in patent opposition and collaboration networks

arXiv

引用

arXiv 2021年

作者： Liu, Penghang Masuda, Naoki Kito, Tomomi Sarıyüce, Ahmet Erdem Department of Computer Science and Engineering State University of New York at Buffalo BuffaloNY United States Department of Mathematics State University of New York at Buffalo BuffaloNY United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY United States Faculty of Science and Engineering Waseda University Tokyo Japan

Patents are intellectual properties that reflect innovative activities of companies and organizations. The literature is rich with the studies that analyze the citations among the patents and the collaboration relations among companies that own the patents. However, the adversarial relations between the patent owners are not as well investigated. One proxy to model such relations is the patent opposition, which is a legal activity in which a company challenges the validity of a patent. Characterizing the patent oppositions, collaborations, and the interplay between them can help better understand the companies’ business strategies. Temporality matters in this context as the order and frequency of oppositions and collaborations characterize their interplay. In this study, we construct a two-layer temporal network to model the patent oppositions and collaborations among the companies. We utilize temporal motifs to analyze the oppositions and collaborations from structural and temporal perspectives. We first characterize the frequent motifs in patent oppositions and investigate how often the companies of different sizes attack other companies. We show that large companies tend to engage in opposition with multiple companies. Then we analyze the temporal interplay between collaborations and oppositions. We find that two adversarial companies are more likely to collaborate in the future than two collaborating companies oppose each other in the future. © 2021, CC BY.

关键词： Patents and inventions

来源：评论

学校读者我要写书评

暂无评论

Finite-size effects on the convergence time in continuous-opinion dynamics

arXiv

引用

arXiv 2021年

作者： Jo, Hang-Hyun Masuda, Naoki Department of Physics The Catholic University of Korea Bucheon14662 Korea Republic of Department of Mathematics State University of New York at Buffalo 14260-2900 United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo 14260-5030 United States

We study finite-size effects on the convergence time in a continuous-opinion dynamics model. In the model, each individual's opinion is represented by a real number on a finite interval, e.g., [0;1], and a uniformly randomly chosen individual updates its opinion by partially mimicking the opinion of a uniformly randomly chosen neighbor. We numerically find that the characteristic time to the convergence increases as the system size increases according to a particular functional form in the case of lattice networks. In contrast, unless the individuals perfectly copy the opinion of their neighbors in each opinion updating, the convergence time is approximately independent of the system size in the case of regular random graphs, uncorrelated scale-free networks, and complete graphs. We also provide a mean-field analysis of the model to understand the case of the complete graph. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Gillespie algorithms for stochastic multiagent dynamics in populations and networks

arXiv

引用

arXiv 2021年

作者： Masuda, Naoki Vestergaard, Christian L. Department of Mathematics State University of New York at Buffalo NY United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo NY United States Decision and Bayesian Computation Department of Neuroscience Cnrs Umr 3571 Department of Computational Biology Cnrs Usr 3756 Institut Pasteur Paris France

Many multiagent dynamics, including various collective dynamics occurring on networks, can be modeled as a stochastic process in which the agents in the system change their state over time in interaction with each other. The Gillespie algorithms are popular algorithms that exactly simulate such stochastic multiagent dynamics when each state change is driven by a discrete event, the dynamics is defined in continuous time, and the stochastic law of event occurrence is governed by independent Poisson processes. In the first main part of this volume, we provide a tutorial on the Gillespie algorithms focusing on simulation of social multiagent dynamics occurring in populations and networks. We do not assume advanced knowledge of mathematics (or computer science or physics). We clarify why one should use the continuous-time models and the Gillespie algorithms in many cases, instead of easier-to-understand discrete-time models. In the remainder of this volume, we review recent extensions of the Gillespie algorithms aiming to add more reality to the model (i.e., non-Poissonian cases) or to speed up the simulations. © 2021, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：