Strategies for Optimizing Public Train Transport Networks in China: Under a Viewpoint of Complex Networks
|
|
|
- Dorthy Robinson
- 9 years ago
- Views:
Transcription
1 Strategies for Optimizing Public Train Transport Networks in China: Under a Viewpoint of Complex Networks Zhichong ZHAO, Jie LIU Research Centre of Nonlinear Science, College of Science, Wuhan University of Science and Engineering, Wuhan, China [email protected] Abstract: Under a viewpoint of complex networks, a new method for optimizing public train transport networks (PTTNs) in China, named Betweenness + Efficiency combinatorial method, is proposed in this paper. Take the Chinese Train Transport Net as an illustration. Firstly, we constructed related networks and analyzed some basic statistical properties. It was founded that these networks are positive-degree-correlation complex networks, which is between regular networks and small-world networks. Secondly, a new method, which connects betweenness centralization and global efficiency, was suggested to choose new lines of train transport designing. Numerical experiments verified: all the suggested lines added by our method can improve the global efficiency of existed PTTNs. Add a single line leading the global efficiencies up to 4.69%, and if integrated the six lines will leading the global efficiency up to 15%. This research can be referred by experts majored in such typical fields. Keywords: complex networks; betweenness + efficiency combinatorial analysis method; betweenness; efficiency 1 Introduction As an interdisciplinary subject, complex networks have received tremendous recent interest from the scientific community because of their flexibility and generality in the description of the natural and manmade systems. Recently, both the small-world networks [1] and the scalefree network [2] appear in statistical physics, which set off a wave of research about complex networks [3-6]. Rail transport plays a very important role in national life and economic development, many researchers have built a variety of railway networks to study the nature of this particular transport system, by a large number of empirical studies, the researchers found that railway express network has a typical complex system structure and feature, this discovery laid a solid foundation in the study of the characteristics and the topology properties of the railway express system [3-6]. Recently, W. Zhao, who had pointed out the methods of construction real network, usually set the site as a node and the track as an edge. Their statistical studies have shown that, the average clustering coefficient of the railway networks is approximately zero and have a typical tree-network structure [7]. Similarly, this paper intends to study the Chinese Railway Express network using complex network theory. First of all, set the operating sites as a node, the line of linking the two sites as an edge, constructed the Chinese Railway Express network, in order to optimize the Express network structure, we constructed the national railway transportation network in the same way according to the existing railway networks and long-term planning. This paper will analyzed some basic characters of these two networks. In addition, to improve the efficiency of the CTTNs, this paper proposes a new betweenness + efficiency combinatorial analysis method. 2 Network Construction and Its Characteristics 2.1 Network Construction Reference to the national railway line and the CTTNs diagram (Figure 1) (where the orange line in the picture represent the Chinese Train Transport Network) [12], by considering the existing operational site as node, the railway line as edge, a network to reflect the actual link of the railway line is achieved. In the following analysis, we call them the whole railway networks and CTTNs, separately. The former one contains 385 nodes, 1379 edges, and there are three connected sub-sets. We will discard the railways in Hainan and Taiwan Province, so we can ensure that the remaining part of the railway network is a connected graph; the latter contains 170 nodes, 532 edges (discarded the isolated nodes Zhuhai and Putian) and this treatment has no effect for optimizing the network. In addition, Figure 2 shows the 2008 version of the national railway planning diagram [12]. We can calculate the relevant figures of the two networks, Figure 3 and Figure 4 show the topology diagram of the Figure 1 which contains two networks. 140
2 Figure 1. The national railway line and the CTTNs diagram of China Figure 3. The topology diagram of Chinese Train Transport Networks (up) and the railway networks (down) Figure 2. The national railway planning diagram of China 2.2 Basic Characters of the Networks Figure 4 shows the degree distribution diagram of the railway networks and the CTTNs. It can be seen; there are only four cases of node degree values, and the node degree value of 2 accounts for the vast majority. This shows that the structure of the CTTNs is very simple, generally close to hand in hand or chain network. In contrast, the degree distribution of the national railway network is more complex, but there exist a certain difference with random networks of the same scale. It is a realistic type of network that between the random networks and rule networks. Table 1 shows some basic characters of the CTTNs (Figure 3 up) and the railway network (Figure 3 down). It reveals two types of interconnected transport network s typical characteristics and contacts (in fact, except two isolated base, the CTTNs can be regarded as a connected sub-networks of the railway network). It can be found that, the CTTNs is a special network between the rule networks and the small-world networks, P(k) P(k) k k Figure 4. The degree distribution diagram of Chinese Train Transport Networks (up) and the railway networks (down) 141
3 Table 1. Basic characters of the railway networks and the CTTNs Network Character The total number of nodes N, edges L The CTTNs (1) 168 nodes, 532 lines The railway networks (2) 385 nodes, 1379 lines The largest connected sub-set of (2) 373 nodes, 1351 lines Diameter D Characterstic path length CPL Average clustering coefficients C degree-degree assortaticity coefficents r Global efficiency E Betweenness centralization Bn Closeness centralization Cc \ and its clustering coefficient is , the average path length is , the network diameter is 37, the global efficiency is , degree of correlation coefficient is , the average betweenness is ; while the railway network s clustering coefficient is higher (0.2176), the average path length, network diameter is shorter ( and 31, respectively), the global efficiency is , degree of correlation coefficient is positive (0.0534), the average betweenness is slightly larger ( ). The CTTNs s clustering coefficient is far below the average clustering coefficient of the railway network, and this fact could be interpreted as: CTTNs s structure is similar to thin rule network, the partly reason for this design is to ensure the express network have the breadth of coverage area. The data of Table 1 showed that there is little difference between CTTNs s average path length and the railway network s, which can also illustrate CTTNs more complete and scientific. However, by comparing the specific value of the global efficiency, it is easy to find that the global efficiency of the existing Express network did not reach the efficiency of the railway network. This shows the network does not maximize being exploited. While the fact which can not be overlooked is that China s railway network s global efficiency is lower compared with developed countries. The reason is due to the history of the national economic planning and construction and the existing network extremely dependent on the passenger network. 2.3 Network Structure Characteristics: Robustness & Fragility Recently, W. Zhao and some other researchers had pointed out [7] that, the average clustering coefficient of the network close to zero. They believe that such rail Geo-Network is a tree-like network, which means the net-work is likely disconnected. They further pointed out that the railway system with this structure, a paralysis of a particular site may result the global system disruption. This paper established railway network and the CTTNs, the two networks have lower average clustering coefficient, but still much greater than the same size of random network. The node betweenness of the two networks were (CTTNs) and (railway network), and this means the express network have more tolerant of line fault occurs than the railway network, that is, the CTTNs has a certain robustness. These two types of network can not be overlooked fragility because they have higher mean betweenness. 3 Betweenness + Efficiency Combinatorial Method Research -- Take the Optimization of the CTTNs as an Example In order to improve the efficiency of CTTNs, designers can take full advantage of the existing transport network to increase some operating sites and lines; they can also establish new operational sites and lines based on the long-term planning of China s railway construction, and gradually improve the operational efficiency and safety of the railway network and the Express network. In general, by calculating the key characteristics of the transformation network and comparing with the existing Express network, we can make some of the more practical construction and development strategy. That is, based on the existing transport network line s distribution and structure, from the point of larger node betweenness s operating sites, add appropriate new express line and site operations, and gradually increase the efficiency of CTTNs. By definition, node betweenness of transport network can reflect the importance of the node (Express site), generally, the bigger of the node betweenness, the more shortest path that across the node, the node have a transportation hub effect in the network. Link betweenness of transport network can reflect the importance of the link (Express route), the link play a bridge role in the network. By calculating: the pre-23 sites which node betweenness is the biggest are Fuyang, Shangqiu, Haozhou, Xiangtang, Hengshui, Bazhou, Macheng, Huangchuan, Heze, Liaocheng, Jiujiang, Nanchang, Baoji, Beijing, Hua Shan, Xi'an, Zhengzhou, Beijing South, Xianyang, Ji an, Ganzhou, Zhuzhou, Tianjin West. Taking the 23 largest sites above-mentioned as the key points, we can try to expand the network. Further, we can calculate the characteristics of the network, and give some preliminary effective strategies to improve the network structure. For example, calculate the global effi- 142
4 ciency of the network, if the efficiency of the Express Network increased, then add this line as the Chinese train transport route; calculate the global clustering coefficients, if the clustering coefficients of the Express Network increased, then add this line as the Chinese train transport route. This will ensure a better connectivity of the network. Usually, we can analysis the global efficiency. Adding the following few routes, analysis the feasibility of opening the relevant express line. Table 2 shows the change of the specific characteristics of the case. Through careful calculation, we can see all the suggested lines added by our method can improve the global efficiency of existed PTTNs. Add a single line leading the global efficiencies up to 4.69%, and if integrated the six lines will leading the global efficiency up to 15%. This research can be referred by experts majored in such typical fields. 4 Conclusions As one of the important parts of the railway network, the Express network is directly related to the steady increase of healthy operation of the national economy and people s living standard. From the perspective of complex networks, the analysis about the network of railway operations related to efficiency, safety and other aspects, is a novel transport network analysis and research method and has a very important basic theoretical significance and a potential application value. This article from complex network analysis perspective, proposes the Betweenness + Efficiency combinatorial method, which is used to optimize the transport network planning study. Using CTTNs in order to optimize the expansion of the network transformation analysis as an example, this article describes the feasibility and superiority of proposing the analysis method. This paper not only analyzes the basic characteristics of such networks, and reveals that the existing rail network and the CTTNs is a special class of artificial networks between the regular networks and the small-world networks; but also further proposes the Betweenness + Efficiency combinatorial method to guide operational planning and construction of the network. Numerical studies have shown that the program proposed in this paper will enable that the operations network transformed obtains a certain increase of overall efficiency. Especially the transformation strategy of the merger of more than one added line is able to express the overall efficiency of the network significantly. This paper s findings undoubtedly have an important reference value for the further optimizing planning and construction of express network in China. Certainly, the result of this study is just the initial exploration for such a real problem, and need further in-depth refinement. It should be pointed out that for the Table 2. The change of the specific characteristics of different cases Specific additional lines (E\ ) r D CPL C Bn Cn The CTTNs (not add any new lines) Jiujiang-Huangshi-Wuchang-Hanyang-Changjiangbu- Suizhou-Xiangfan-Danjiang-Shiyan-Ankang-Xi an Heze-Xinxiang-Jiaozuo-Yueshan-Houma-Xi an Hefei-Huangchuan-Xinyang-Nanyang-Baofeng-Xi an Litang-Liuzhou-Huaihua-Gushou-Zhangjiajie-himenxian -Zhicheng-Jingmen-Xuancheng-Xiangfan-Nanyang-Baof eng-luoyang-yueshan-changzhibei- Yuci Huaihua - Chongqing - Suining - Chengdu Chongqing - Dazhou - Ankang Xi an Integrated six suggested lines E= = E= = E= =0.045 E= = E= = E= = E = = r= r= r= r= r= < 0 r= < r= r = Remark 1: The calculations of the network s efficiency after adding some new lines, are all based on the original network after adding a single new line. ENew EcnTrainTransport Remark 2: the relative changes value of the network s global efficiency is defined as:, E represent the efficiency of the new and the original Express Network respectively. represents the increase of index value, represents the reduction of index value. E New, EcnTrainTransport cntraintransport E\ - Global efficiency(efficiency\rate of change), r- Degree-degr assortaticity coefficients, D- Diameter, CPL- Characteristic path length, C- Average clustering coefficients, Bn- Betweenness centralization, Cn- Closeness centralization 143
5 lack of more detailed data, the study of the paper have some obvious deficiencies in following aspects: first, this object of study is the CTTNs, which has a simple network structure, strong characteristics of the artificial networks. The network operational efficiency analysis, optimization to improve strategies, and the betweenness analysis, is inevitable with a strong artificial enumeration features. That is not enough scientific reasonable. Second, when it verifies the network is whether to improve transport efficiency or not by analyzing the features of the original network, it fails to analysis comprehensively to obtain the corresponding changes in other digital features. Finally, the improve analysis about operating network remains at the theoretical level because of the lack of some important factors analysis and related data. This paper merely analyzes the simple case that the physical network s sites and sides all have no right and undirected, and do not have detailed analysis about the objective existence of the real line, the site capacity constraint limits and other factors. The three aspects mentioned above need to be further studied, when we get more relevant data, use related analysis methods of empowerment, directed complex transportation network, which will be considered in our next study. References [1] D. J. Watts., S. H. Strogatz., Collective dynamics of small-world [J], Nature, : [2] A-L Barabasi., R. Albert., Emergence of scaling in random networks [J], Science, : [3] Eli Ben-Naim., Hans F., Zoltan Toroczkai., Complex networks. Lectures in Physics, [J]. Springer-Verlag. Heidelberg. V 650. (2004). [4] Amaral, L. A. N., Ottino, J. M., Complex networks-augmenting the framework for the study of complex systems [J]. Eur. Phys. J. B., : [5] X. -F. Wang., Complex networks: Topology, dynamics and synchronization [J]. Int J. Bifurcation and Chaos, , (5): [6] X. F. Wang., G. Chen., Complex Networks: Small-world, Scale- Free and Beyond [J], IEEE Circuits and Systems Magazine, , (1): [7] Zhao Wei., et al., The study of propertie s of Chinese railway passenger transport network, Acta Phys. Sin. 2006, (08), In Chinese. [8] Chinese Train Designing net: tllwjs/tlwgh_6.html, [9] Liu Jie., Lu J-A., A Small Scientific Collaboration Complex Networks and Its Analysis, Complex Systems and Complexity Science, 2004.(3): (In Chinese) 144
Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network
, pp.273-284 http://dx.doi.org/10.14257/ijdta.2015.8.5.24 Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network Gengxin Sun 1, Sheng Bin 2 and
GENERATING AN ASSORTATIVE NETWORK WITH A GIVEN DEGREE DISTRIBUTION
International Journal of Bifurcation and Chaos, Vol. 18, o. 11 (2008) 3495 3502 c World Scientific Publishing Company GEERATIG A ASSORTATIVE ETWORK WITH A GIVE DEGREE DISTRIBUTIO JI ZHOU, XIAOKE XU, JIE
Scientific Collaboration Networks in China s System Engineering Subject
, pp.31-40 http://dx.doi.org/10.14257/ijunesst.2013.6.6.04 Scientific Collaboration Networks in China s System Engineering Subject Sen Wu 1, Jiaye Wang 1,*, Xiaodong Feng 1 and Dan Lu 1 1 Dongling School
Effects of node buffer and capacity on network traffic
Chin. Phys. B Vol. 21, No. 9 (212) 9892 Effects of node buffer and capacity on network traffic Ling Xiang( 凌 翔 ) a), Hu Mao-Bin( 胡 茂 彬 ) b), and Ding Jian-Xun( 丁 建 勋 ) a) a) School of Transportation Engineering,
Complex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics
Complex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics Zhao Wenbin 1, Zhao Zhengxu 2 1 School of Instrument Science and Engineering, Southeast University, Nanjing, Jiangsu
Structural constraints in complex networks
Structural constraints in complex networks Dr. Shi Zhou Lecturer of University College London Royal Academy of Engineering / EPSRC Research Fellow Part 1. Complex networks and three key topological properties
ATM Network Performance Evaluation And Optimization Using Complex Network Theory
ATM Network Performance Evaluation And Optimization Using Complex Network Theory Yalin LI 1, Bruno F. Santos 2 and Richard Curran 3 Air Transport and Operations Faculty of Aerospace Engineering The Technical
A discussion of Statistical Mechanics of Complex Networks P. Part I
A discussion of Statistical Mechanics of Complex Networks Part I Review of Modern Physics, Vol. 74, 2002 Small Word Networks Clustering Coefficient Scale-Free Networks Erdös-Rényi model cover only parts
Correlation analysis of topology of stock volume of Chinese Shanghai and Shenzhen 300 index
3rd International Conference on Mechatronics and Industrial Informatics (ICMII 2015) Correlation analysis of topology of stock volume of Chinese Shanghai and Shenzhen 300 index Yiqi Wang a, Zhihui Yangb*
Research Article A Comparison of Online Social Networks and Real-Life Social Networks: A Study of Sina Microblogging
Mathematical Problems in Engineering, Article ID 578713, 6 pages http://dx.doi.org/10.1155/2014/578713 Research Article A Comparison of Online Social Networks and Real-Life Social Networks: A Study of
Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm
, pp. 99-108 http://dx.doi.org/10.1457/ijfgcn.015.8.1.11 Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm Wang DaWei and Wang Changliang Zhejiang Industry Polytechnic College
USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS
USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS Natarajan Meghanathan Jackson State University, 1400 Lynch St, Jackson, MS, USA [email protected]
ModelingandSimulationofthe OpenSourceSoftware Community
ModelingandSimulationofthe OpenSourceSoftware Community Yongqin Gao, GregMadey Departmentof ComputerScience and Engineering University ofnotre Dame ygao,[email protected] Vince Freeh Department of ComputerScience
PUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS
Vol. 36 (2005) ACTA PHYSICA POLONICA B No 5 PUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS Julian Sienkiewicz and Janusz
Chapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks
Chapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks Imre Varga Abstract In this paper I propose a novel method to model real online social networks where the growing
DECENTRALIZED SCALE-FREE NETWORK CONSTRUCTION AND LOAD BALANCING IN MASSIVE MULTIUSER VIRTUAL ENVIRONMENTS
DECENTRALIZED SCALE-FREE NETWORK CONSTRUCTION AND LOAD BALANCING IN MASSIVE MULTIUSER VIRTUAL ENVIRONMENTS Markus Esch, Eric Tobias - University of Luxembourg MOTIVATION HyperVerse project Massive Multiuser
Seismic vulnerability assessment of power transmission networks using complex-systems based methodologies
Seismic vulnerability assessment of power transmission networks using complex-systems based methodologies J.A. Buritica & S. Tesfamariam University of British Columbia Okanagan Campus, Kelowna, Canada
Load Balancing Algorithm Based on Services
Journal of Information & Computational Science 10:11 (2013) 3305 3312 July 20, 2013 Available at http://www.joics.com Load Balancing Algorithm Based on Services Yufang Zhang a, Qinlei Wei a,, Ying Zhao
Introduction to Networks and Business Intelligence
Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep 17th, 2015 Outline Network Science A Random History Network Analysis Network Topological
Fault Analysis in Software with the Data Interaction of Classes
, pp.189-196 http://dx.doi.org/10.14257/ijsia.2015.9.9.17 Fault Analysis in Software with the Data Interaction of Classes Yan Xiaobo 1 and Wang Yichen 2 1 Science & Technology on Reliability & Environmental
Telecom Data processing and analysis based on Hadoop
COMPUTER MODELLING & NEW TECHNOLOGIES 214 18(12B) 658-664 Abstract Telecom Data processing and analysis based on Hadoop Guofan Lu, Qingnian Zhang *, Zhao Chen Wuhan University of Technology, Wuhan 4363,China
KNOWLEDGE NETWORK SYSTEM APPROACH TO THE KNOWLEDGE MANAGEMENT
KNOWLEDGE NETWORK SYSTEM APPROACH TO THE KNOWLEDGE MANAGEMENT ZHONGTUO WANG RESEARCH CENTER OF KNOWLEDGE SCIENCE AND TECHNOLOGY DALIAN UNIVERSITY OF TECHNOLOGY DALIAN CHINA CONTENTS 1. KNOWLEDGE SYSTEMS
Cluster detection algorithm in neural networks
Cluster detection algorithm in neural networks David Meunier and Hélène Paugam-Moisy Institute for Cognitive Science, UMR CNRS 5015 67, boulevard Pinel F-69675 BRON - France E-mail: {dmeunier,hpaugam}@isc.cnrs.fr
Modeling of Knowledge Transfer in logistics Supply Chain Based on System Dynamics
, pp.377-388 http://dx.doi.org/10.14257/ijunesst.2015.8.12.38 Modeling of Knowledge Transfer in logistics Supply Chain Based on System Dynamics Yang Bo School of Information Management Jiangxi University
Complex Networks Analysis: Clustering Methods
Complex Networks Analysis: Clustering Methods Nikolai Nefedov Spring 2013 ISI ETH Zurich [email protected] 1 Outline Purpose to give an overview of modern graph-clustering methods and their applications
arxiv:physics/0601033 v1 6 Jan 2006
Analysis of telephone network traffic based on a complex user network Yongxiang Xia, Chi K. Tse, Francis C. M. Lau, Wai Man Tam, Michael Small arxiv:physics/0601033 v1 6 Jan 2006 Department of Electronic
Bioinformatics: Network Analysis
Bioinformatics: Network Analysis Graph-theoretic Properties of Biological Networks COMP 572 (BIOS 572 / BIOE 564) - Fall 2013 Luay Nakhleh, Rice University 1 Outline Architectural features Motifs, modules,
Research on the UHF RFID Channel Coding Technology based on Simulink
Vol. 6, No. 7, 015 Research on the UHF RFID Channel Coding Technology based on Simulink Changzhi Wang Shanghai 0160, China Zhicai Shi* Shanghai 0160, China Dai Jian Shanghai 0160, China Li Meng Shanghai
Open Access Research on Application of Neural Network in Computer Network Security Evaluation. Shujuan Jin *
Send Orders for Reprints to [email protected] 766 The Open Electrical & Electronic Engineering Journal, 2014, 8, 766-771 Open Access Research on Application of Neural Network in Computer Network
Option 1: empirical network analysis. Task: find data, analyze data (and visualize it), then interpret.
Programming project Task Option 1: empirical network analysis. Task: find data, analyze data (and visualize it), then interpret. Obtaining data This project focuses upon cocktail ingredients. Data was
The Combination Forecasting Model of Auto Sales Based on Seasonal Index and RBF Neural Network
, pp.67-76 http://dx.doi.org/10.14257/ijdta.2016.9.1.06 The Combination Forecasting Model of Auto Sales Based on Seasonal Index and RBF Neural Network Lihua Yang and Baolin Li* School of Economics and
Evolution Feature Oriented Model Driven Product Line Engineering Approach for Synergistic and Dynamic Service Evolution in Clouds
Evolution Feature Oriented Model Driven Product Line Engineering Approach for Synergistic and Dynamic Service Evolution in Clouds Zhe Wang, Xiaodong Liu, Kevin Chalmers School of Computing Edinburgh Napier
Quality of Service Routing Network and Performance Evaluation*
Quality of Service Routing Network and Performance Evaluation* Shen Lin, Cui Yong, Xu Ming-wei, and Xu Ke Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 {shenlin, cy, xmw,
Method of Fault Detection in Cloud Computing Systems
, pp.205-212 http://dx.doi.org/10.14257/ijgdc.2014.7.3.21 Method of Fault Detection in Cloud Computing Systems Ying Jiang, Jie Huang, Jiaman Ding and Yingli Liu Yunnan Key Lab of Computer Technology Application,
Enterprise Computer Network Reliability Analysis
, pp. 285-294 http://dx.doi.org/10.14257/ijmue.2015.10.1.28 Enterprise Computer Networ Reliability Analysis Yongfeng Cui, Wei Liu and Ya Li School of Science and Technology, Zhouou Normal University, Zhouou
An approach of detecting structure emergence of regional complex network of entrepreneurs: simulation experiment of college student start-ups
An approach of detecting structure emergence of regional complex network of entrepreneurs: simulation experiment of college student start-ups Abstract Yan Shen 1, Bao Wu 2* 3 1 Hangzhou Normal University,
A MEASURE OF GLOBAL EFFICIENCY IN NETWORKS. Aysun Aytac 1, Betul Atay 2. Faculty of Science Ege University 35100, Bornova, Izmir, TURKEY
International Journal of Pure and Applied Mathematics Volume 03 No. 05, 6-70 ISSN: 3-8080 (printed version); ISSN: 34-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/0.73/ijpam.v03i.5
The Influence of Stressful Life Events of College Students on Subjective Well-Being: The Mediation Effect of the Operational Effectiveness
Open Journal of Social Sciences, 2016, 4, 70-76 Published Online June 2016 in SciRes. http://www.scirp.org/journal/jss http://dx.doi.org/10.4236/jss.2016.46008 The Influence of Stressful Life Events of
The Topology of Large-Scale Engineering Problem-Solving Networks
The Topology of Large-Scale Engineering Problem-Solving Networks by Dan Braha 1, 2 and Yaneer Bar-Yam 2, 3 1 Faculty of Engineering Sciences Ben-Gurion University, P.O.Box 653 Beer-Sheva 84105, Israel
The Application Research of Ant Colony Algorithm in Search Engine Jian Lan Liu1, a, Li Zhu2,b
3rd International Conference on Materials Engineering, Manufacturing Technology and Control (ICMEMTC 2016) The Application Research of Ant Colony Algorithm in Search Engine Jian Lan Liu1, a, Li Zhu2,b
Ethernet. Ethernet Frame Structure. Ethernet Frame Structure (more) Ethernet: uses CSMA/CD
Ethernet dominant LAN technology: cheap -- $20 for 100Mbs! first widely used LAN technology Simpler, cheaper than token rings and ATM Kept up with speed race: 10, 100, 1000 Mbps Metcalfe s Etheret sketch
Fluctuations in airport arrival and departure traffic: A network analysis
Fluctuations in airport arrival and departure traffic: A network analysis Li Shan-Mei( 李 善 梅 ) a), Xu Xiao-Hao( 徐 肖 豪 ) b), and Meng Ling-Hang( 孟 令 航 ) a) a) School of Computer Science and Technology,
Graph models for the Web and the Internet. Elias Koutsoupias University of Athens and UCLA. Crete, July 2003
Graph models for the Web and the Internet Elias Koutsoupias University of Athens and UCLA Crete, July 2003 Outline of the lecture Small world phenomenon The shape of the Web graph Searching and navigation
The Key Technology Research of Virtual Laboratory based On Cloud Computing Ling Zhang
International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015) The Key Technology Research of Virtual Laboratory based On Cloud Computing Ling Zhang Nanjing Communications
Research on the Income Volatility of Listed Banks in China: Based on the Fair Value Measurement
Research on the Income Volatility of Listed Banks in China: Based on the Fair Value Measurement Pingsheng Sun, Xiaoyan Liu & Yuan Cao School of Economics and Management, North China Electric Power University,
A Novel Routing and Data Transmission Method for Stub Network of Internet of Things based on Percolation
IEEE INFOCO 2011 Workshop on 2CN-2011 A Novel Routing and Data Transmission ethod for Stub Network of Internet of Things based on Percolation Xiangming Li, Jihua Lu, Jie Yang, and Jianping An School of
The Network Structure of Hard Combinatorial Landscapes
The Network Structure of Hard Combinatorial Landscapes Marco Tomassini 1, Sebastien Verel 2, Gabriela Ochoa 3 1 University of Lausanne, Lausanne, Switzerland 2 University of Nice Sophia-Antipolis, France
CONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW
CONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW 1 XINQIN GAO, 2 MINGSHUN YANG, 3 YONG LIU, 4 XIAOLI HOU School of Mechanical and Precision Instrument Engineering, Xi'an University
Network Load Balancing Using Ant Colony Optimization
Network Load Balancing Using Ant Colony Optimization Mr. Ujwal Namdeo Abhonkar 1, Mr. Swapnil Mohan Phalak 2, Mrs. Pooja Ujwal Abhonkar 3 1,3 Lecturer in Computer Engineering Department 2 Lecturer in Information
Social and Economic Networks: Lecture 1, Networks?
Social and Economic Networks: Lecture 1, Networks? Alper Duman Izmir University Economics, February 26, 2013 Conventional economics assume that all agents are either completely connected or totally isolated.
How To Understand The Network Of A Network
Roles in Networks Roles in Networks Motivation for work: Let topology define network roles. Work by Kleinberg on directed graphs, used topology to define two types of roles: authorities and hubs. (Each
1. Introduction Gene regulation Genomics and genome analyses Hidden markov model (HMM)
1. Introduction Gene regulation Genomics and genome analyses Hidden markov model (HMM) 2. Gene regulation tools and methods Regulatory sequences and motif discovery TF binding sites, microrna target prediction
Complex Network Analysis of Brain Connectivity: An Introduction LABREPORT 5
Complex Network Analysis of Brain Connectivity: An Introduction LABREPORT 5 Fernando Ferreira-Santos 2012 Title: Complex Network Analysis of Brain Connectivity: An Introduction Technical Report Authors:
Distributed Computing over Communication Networks: Topology. (with an excursion to P2P)
Distributed Computing over Communication Networks: Topology (with an excursion to P2P) Some administrative comments... There will be a Skript for this part of the lecture. (Same as slides, except for today...
Management Systems 10 Electrical Safety Audit 14 PPE 20 Arc Mitigation 22 Hazard Assessment 26
Management Systems 10 Electrical Safety Audit 14 PPE 20 Arc Mitigation 22 Hazard Assessment 26 Assessing The Hazards Of High and Low Voltage Single-Phase Arc-Flash By Albert Marroquin One common question
http://www.elsevier.com/copyright
This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author s institution, sharing
Level 2 Routing: LAN Bridges and Switches
Level 2 Routing: LAN Bridges and Switches Norman Matloff University of California at Davis c 2001, N. Matloff September 6, 2001 1 Overview In a large LAN with consistently heavy traffic, it may make sense
Small Joint-stock Commercial Bank Lending to Small Business Risk Analysis
Small Joint-stock Commercial Bank Lending to Small Business Risk Analysis WANG Shuying, YAN Chao School of Management, Zhengzhou University, P.R.China, 450001 [email protected] Abstract: in China
QoS EVALUATION OF CLOUD SERVICE ARCHITECTURE BASED ON ANP
QoS EVALUATION OF CLOUD SERVICE ARCHITECTURE BASED ON ANP Mingzhe Wang School of Automation Huazhong University of Science and Technology Wuhan 430074, P.R.China E-mail: [email protected] Yu Liu School
A Unified Network Performance Measure with Importance Identification and the Ranking of Network Components
A Unified Network Performance Measure with Importance Identification and the Ranking of Network Components Qiang Qiang and Anna Nagurney Department of Finance and Operations Management Isenberg School
Load Balancing Routing Algorithm among Multiple Gateways in MANET with Internet Connectivity
Load Balancing Routing Algorithm among Multiple Gateways in MANET with Internet Connectivity Yonghang Yan*, Linlin Ci*, Ruiping Zhang**, Zhiming Wang* *School of Computer Science, Beiing Institute of Technology,
Web Application Regression Testing: A Session Based Test Case Prioritization Approach
Web Application Regression Testing: A Session Based Test Case Prioritization Approach Mojtaba Raeisi Nejad Dobuneh 1, Dayang Norhayati Abang Jawawi 2, Mohammad V. Malakooti 3 Faculty and Head of Department
Sensors & Transducers 2015 by IFSA Publishing, S. L. http://www.sensorsportal.com
Sensors & Transducers 2015 by IFSA Publishing, S. L. http://www.sensorsportal.com A Dynamic Deployment Policy of Slave Controllers for Software Defined Network Yongqiang Yang and Gang Xu College of Computer
Data Exploration with GIS Viewsheds and Social Network Analysis
Data Exploration with GIS Viewsheds and Social Network Analysis Giles Oatley 1, Tom Crick 1 and Ray Howell 2 1 Department of Computing, Cardiff Metropolitan University, UK 2 Faculty of Business and Society,
MALLET-Privacy Preserving Influencer Mining in Social Media Networks via Hypergraph
MALLET-Privacy Preserving Influencer Mining in Social Media Networks via Hypergraph Janani K 1, Narmatha S 2 Assistant Professor, Department of Computer Science and Engineering, Sri Shakthi Institute of
Random forest algorithm in big data environment
Random forest algorithm in big data environment Yingchun Liu * School of Economics and Management, Beihang University, Beijing 100191, China Received 1 September 2014, www.cmnt.lv Abstract Random forest
Temporal Dynamics of Scale-Free Networks
Temporal Dynamics of Scale-Free Networks Erez Shmueli, Yaniv Altshuler, and Alex Sandy Pentland MIT Media Lab {shmueli,yanival,sandy}@media.mit.edu Abstract. Many social, biological, and technological
Big Data: Opportunities and Challenges for Complex Networks
Big Data: Opportunities and Challenges for Complex Networks Jinhu Lü Academy of Mathematics and Systems Science Chinese Academy of Sciences IWCSN, Vancouver, 13 Dec 2013 1 Thanks To Prof. Ljiljana j Trajkovic
Subgraph Patterns: Network Motifs and Graphlets. Pedro Ribeiro
Subgraph Patterns: Network Motifs and Graphlets Pedro Ribeiro Analyzing Complex Networks We have been talking about extracting information from networks Some possible tasks: General Patterns Ex: scale-free,
Algorithms for representing network centrality, groups and density and clustered graph representation
COSIN IST 2001 33555 COevolution and Self-organization In dynamical Networks Algorithms for representing network centrality, groups and density and clustered graph representation Deliverable Number: D06
Circuits 1 M H Miller
Introduction to Graph Theory Introduction These notes are primarily a digression to provide general background remarks. The subject is an efficient procedure for the determination of voltages and currents
Research on Credibility Measurement Method of Data In Big Data
Journal of Information Hiding and Multimedia Signal Processing c 2016 ISSN 2073-4212 Ubiquitous International Volume 7, Number 4, July 2016 Research on Credibility Measurement Method of Data In Big Data
Fault-Tolerant Routing Algorithm for BSN-Hypercube Using Unsafety Vectors
Journal of omputational Information Systems 7:2 (2011) 623-630 Available at http://www.jofcis.com Fault-Tolerant Routing Algorithm for BSN-Hypercube Using Unsafety Vectors Wenhong WEI 1,, Yong LI 2 1 School
Network Intrusion Detection System and Its Cognitive Ability based on Artificial Immune Model WangLinjing1, ZhangHan2
3rd International Conference on Machinery, Materials and Information Technology Applications (ICMMITA 2015) Network Intrusion Detection System and Its Cognitive Ability based on Artificial Immune Model
IC05 Introduction on Networks &Visualization Nov. 2009. <[email protected]>
IC05 Introduction on Networks &Visualization Nov. 2009 Overview 1. Networks Introduction Networks across disciplines Properties Models 2. Visualization InfoVis Data exploration
Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration
Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration 1 Harish H G, 2 Dr. R Girisha 1 PG Student, 2 Professor, Department of CSE, PESCE Mandya (An Autonomous Institution under
DATA ANALYSIS IN PUBLIC SOCIAL NETWORKS
International Scientific Conference & International Workshop Present Day Trends of Innovations 2012 28 th 29 th May 2012 Łomża, Poland DATA ANALYSIS IN PUBLIC SOCIAL NETWORKS Lubos Takac 1 Michal Zabovsky
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering
A TOPOLOGICAL ANALYSIS OF THE OPEN SOURCE SOFTWARE DEVELOPMENT COMMUNITY
A TOPOLOGICAL ANALYSIS OF THE OPEN SOURCE SOFTWARE DEVELOPMENT COMMUNITY Jin Xu,Yongqin Gao, Scott Christley & Gregory Madey Department of Computer Science and Engineering University of Notre Dame Notre
Task Scheduling in Hadoop
Task Scheduling in Hadoop Sagar Mamdapure Munira Ginwala Neha Papat SAE,Kondhwa SAE,Kondhwa SAE,Kondhwa Abstract Hadoop is widely used for storing large datasets and processing them efficiently under distributed
