Modeling and Analysis of Intelligence Assurance System Based on the Complex Networks Theory

Author(s):  
Han Shu-Jian ◽  
Zhu Li ◽  
Li Zheng
2012 ◽  
Vol 22 (02) ◽  
pp. 1250025 ◽  
Author(s):  
N. CORSON ◽  
M. A. AZIZ-ALAOUI ◽  
R. GHNEMAT ◽  
S. BALEV ◽  
C. BERTELLE

The aim of this paper is to contribute to the modeling and analysis of complex systems, taking into account the nature of complexity at different stages of the system life-cycle: from its genesis to its evolution. Therefore, some structural aspects of the complexity dynamics are highlighted, leading (i) to implement the morphogenesis of emergent complex network structures, and (ii) to control some synchronization phenomena within complex networks. Specific applications are proposed to illustrate these two aspects, in urban dynamics and in neural networks.


2014 ◽  
Vol 65 ◽  
pp. 1-9 ◽  
Author(s):  
Xinli Fang ◽  
Qiang Yang ◽  
Wenjun Yan

2021 ◽  
pp. 57-70
Author(s):  
Till Becker ◽  
Darja Wagner-Kampik

AbstractThe methodology to model systems as graphs or networks already exists for a long time. The availability of information technology and computational power has led to a renaissance of the network modeling approach. Scientists have collected data and started to create huge models of complex networks from various domains. Manufacturing and logistics benefits from this development, because material flow systems are predetermined to be modeled as networks. This chapter revisits selected advances in network modeling and analysis in manufacturing and logistics that have been achieved in the last decade. It presents the basic modeling concept, the transition from static to dynamic and stochastic models, and a collection of examples how network models can be applied to contribute to solving problems in planning and control of logistic systems.


2010 ◽  
Vol 13 (01) ◽  
pp. 3-17 ◽  
Author(s):  
CHUAN SHI ◽  
ZHENYU YAN ◽  
YI WANG ◽  
YANAN CAI ◽  
BIN WU

Network model recently becomes a popular tool for studying complex systems. Detecting meaningful communities in complex networks, as an important task in network modeling and analysis, has attracted great interests in various research areas. This paper proposes a genetic algorithm with a special encoding schema for community detection in complex networks. The algorithm employs a metric, named modularity Q as the fitness function and applies a special locus-based adjacency encoding schema to represent the community partitions. The encoding schema enables the algorithm to determine the number of communities adaptively and automatically, which provides great flexibility to the detection process. In addition, the schema also significantly reduces the search space. Extensive experiments demonstrate the effectiveness of the proposed algorithm.


Author(s):  
Reuven Cohen ◽  
Shlomo Havlin
Keyword(s):  

1981 ◽  
Vol 64 (10) ◽  
pp. 18-27
Author(s):  
Yoshio Hamamatsu ◽  
Katsuhiro Nakada ◽  
Ikuo Kaji ◽  
Osamu Doi

Sign in / Sign up

Export Citation Format

Share Document