Complex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics
|
|
- Buddy Anderson
- 7 years ago
- Views:
Transcription
1 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 , China 2 School of Information Science and Technology, Shijiazhuang Tiedao University, Shijiazhuang, Hebei , China zhaowb @gmail.com, zhaozx@stdu.edu.cn Abstract. With rapid development of complex networks, it is difficult to only use figures and charts for their management and planning. Visualization technology can offers an effective approach to understand the structure and characteristics of complex networks, so as to mine more valuable information. This paper presents a complex network visualization method, which is based on smoothed-particle hydrodynamics (SPH) and Voronoi diagram. Using statistical characteristics of complex network, this method determines the position of complex network nodes in a two-dimensional plane, and divides this plane into Voronoi diagram, then analyzes the structure and characteristics of complex network. In this paper, the experiment analyzes engineering software format conversion network and realizes its visualization. Keywords: complex network, visualization technology, Voronoi diagram, layout algorithm, smoothed-particle hydrodynamics. 1 Introduction In recent years, with rapid development of various information systems, such as World Wide Web [1], telecommunications network, mobile communications network, etc, the scale of data increases gradually, consequently, traditional technology and method cannot meet the management and operation of these complex networks [2, 3]. By research of web network, social network, biological network, etc, it is found that these networks have some properties in common, such as self-organization, selfsimilarity, attractor, small world [4], scale-free network [5], etc, so a network which has more or all properties is called complex network. Due to the complexity of complex network structure, it is difficult to understand complex network with figures and charts, and to express a lot of information contained in complex network. Visualization method can expresses complex network conveniently and intuitively. The research of complex network further promotes the development of network visualization technology, and simultaneously put forward higher demand for visualization technology. With intuitive accurate display of network, complex network visualization is helpful for understanding its internal structure and mining 55
2 valuable information [6]. This paper introduces the research of complex network visualization and provides a visualization method of complex network which is based on Voronoi diagram and smoothed-particle hydrodynamics (SPH). 2 Related Works Complex network visualization can express complex network conveniently and intuitively. Its research involves complex system, graph theory, statistics, data mining, information visualization, human-machine interaction, etc. Layout algorithm attracts more concern in complex network visualization. Classic layout algorithms include ring layout algorithm, orthogonal layout algorithm, hierarchical layout algorithm, tree graph layout algorithm, etc. These algorithms have better layout for simple network which has less nodes, but they are not suitable for network which has more nodes and heterogeneous connection. Force-directed algorithm (FDA) [7, 8] was provided by P. Eades in Its basic idea is that a graph is considered as a physical system, which takes node as steel ring, edge as spring, the system is set at the initial state, so the force of spring causes the movement of steel ring, when the total energy of the system decreases into the minimum value, the movement stops. T. M. J. Fruchterman and E. M. Reingold provided an improved FDA algorithm, FR algorithm [9], which follows that nodes which are connected by edges should be close to each other but not too close. D. S. Chan and K. S. Chua propose an ODL algorithm [10], which is different from traditional Force-directed algorithm, it uses ranking algorithm to reduce the complexity of algorithm and improve efficiency, so as to meet large complex network. A. Ahmed provided a 2.5-dimentional visualization method for scale-free network [11], which puts different level nodes in appropriate plane and uses improved Fast FDA algorithm in each plane, so as to get good visualization effect. 3 Voronoi Diagram of Complex Network This paper presents a complex network visualization method, which determines the position of network nodes in the two-dimensional plane with SPH algorithm, and divides this plane into Voronoi diagram. 3.1 Layout Algorithm With SPH layout algorithm, visualization method arranges network nodes by the statistical characteristics of complex network and determines their position in the twodimensional plane with point-by-point insertion method. SPH algorithm is a widely used mesh-free method, which is used in many fields. Its basic idea is the fluid is divided into a set of discrete particles. These particles have 56
3 a spatial distance, over which their properties are "smoothed" by a kernel function. This means that the physical quantity of any particle can be obtained by summing the relevant properties of all the particles which lie within the range of the kernel [12]. In this paper, the nodes of complex network are considered as a series of particles which own quality, speed and energy, their distribution is calculated in a two-dimensional plane. Discrete SPH function is as follow: N 1 u( x) = [ u( xi ) + w( x xi, h)] (1) N i= 1 Where, w(x-x i,h) is the interpolation kernel function of the relevance between node x and x i as well as control factor h, h determines the size of the kernel function s influence domain. This paper adopts B splint function as the kernel function. 3.2 Neighbor particle search Neighbour particle search is an important and the most time-consuming step in SPH method. Each particle can interact with other particles in computation, so neighbour particle search is a N 2 problem. SPH method commonly adopts two neighbour search algorithms: linear search method and tree search method. These algorithms have their own advantages and disadvantages, linear search method is simple but inefficient, and tree search method is efficient but more complex. RNN algorithm is a nearest neighbour search algorithm based on Voronoi diagram [13]. This paper adopts RNN algorithm as neighbour particle search algorithm, Figure 1 show particle d i s influence domain and particles in its influence domain. d i (a) Particle d i s influence domain (b) Particles in Particle d i s influence domain Fig.1. Particles d i s influence domain and particles in its influence domain 3.3 Visualization Method The proposed complex network visualization method includes the following steps: (1) According to complex network, its statistical characteristics are determined, such as directed or undirected, the number of nodes, the number of edges, average degree, average path length, clustering coefficient and so on; 57
4 (2) Nodes of complex network are ranged by node degree in descending order, and their positions are determined with SPH layout algorithm in the two-dimensional plane; (3) According to the positions of nodes in complex network, the plane is divided into Voronoi diagram. 4 Experiment Experiment takes engineering software as research subject, selects two-dimensional and three-dimensional graphic design software, engineering simulation software and data document processing software, and statistics their input and output formats. Engineering software format conversion network is a network which takes data formats as network nodes and is based on the conversion relationship between data formats of engineering software. Engineering software format conversion network is defined as G=(V, E), which can express topological relationship between engineering software data formats. The node set of engineering software data formats is V={v i i=1,2,,n}, if data format v i V can be converted to data format v j V, a directed edge e(v i, v j ) is create in network graph. Matrix W is the adjacency matrix of network graph G. if a directed edge exist between v i and v j, w ij =1, otherwise w ij =0. According to statistical data formats and conversion relationship, experiment construct engineering software format conversion network, as shown in Figure 2. Fig.2. Engineering software format conversion network Fig.3. the relationship between average path length and the number of nodes Experiment analyzes the statistical characteristics of engineering software format conversion network, such as average path length, clustering coefficient and degree distribution. Table 1 show nodes number, average path length, clustering coefficient and network diameter. Table 1. The basic index of engineering software format conversion network Node Number Average Path Length Clustering Coefficient Network Diameter
5 Figure 3 show the relationship between average path length and nodes number. The curve s growth become gradually slow, it indicates engineering software format conversion network follows small world property. Fig.4. the relationship between clustering coefficient and the number of nodes Fig.5. the distribution curve of nodes degree Fig.6. the distribution of nodes cumulative degree Fig.7. the fitting curve of nodes cumulative degree Figure 4 show the relationship between clustering coefficient and the number of nodes. When the number of nodes increases, clustering coefficient of network fluctuates in small-scale. Therefore, clustering coefficient is irrelevant to network scale. 59
6 Figure 5 show the probability distribution of nodes degree. Nodes whose degree is less than 180, account for about 90% of the total number of nodes. The average of nodes degree is The degree of nodes can express the importance of nodes in a sense. Nodes which have higher degree are less, but they are the key node of network. The cumulative probability distribution is used to describe nodes degree, as shown in the Figure 6. The cumulative degree of nodes in engineering software format conversion network follows exponential distribution. Through curve fitting, the result is as shown in Figure 7. Nodes cumulative degree follows exponential distribution curve P(k)=0.7502e k. Figure 8 show Voronoi diagram of engineering software format conversion network. Data formats are divided into several clustering, this shows the proposed visualization method is effective. The distribution of some clustering is denser, and the distribution of other clustering is sparser. This is because denser clustering contains more data formats which can be interconverted, and conversely sparse clustering contains less data formats. In Voronoi diagram the neighbouring relationship between data formats can directly reflect their conversion relationship. Data formats which can be converted into more data formats locate at centre of their distribution, conversely, other data formats locate at edge of their distribution. Fig.8. Voronoi diagram of engineering software format conversion network 5 Conclusion and future work Visualization technology offers an effective method for researching complex network, and makes analysis of complex network more flexible and diversified. This paper proposes a visualization method of complex network which is based on Voronoi diagram and smoothed-particle hydrodynamics (SPH). According to statistical characteristics of complex network, this method uses SPH layout algorithm to 60
7 determine the position of complex network s nodes in two-dimensional plane and divides this plane into Voronoi diagram. Experiment takes engineering software format conversion relationship as research subject, achieves its complex network visualization and analyzes its structure and properties. At present, complex network mainly focuses on the structure and characteristics of static complex network, but these structure and characteristics cannot precisely describes continuing evolution of complex network in reality. In future, we will study how to achieve visualization of complex network in dynamic evolution process, and provide an effective visualization method to analysis dynamic complex network. Acknowledgments. This study is funded by the National Natural Science Foundation of China under Grant No References 1. Albert R, Jeong H, Barabási A L.: Diameter of the world-wide web. J. Nature. vol. 401, No. 6749, pp (1999) 2. Faloutsos M, Faloutsos P, Faloutsos C.: On power-law relationship of the Internet topology. J. ACM SIGCOMM Computer Communication Review. vol. 29, No. 4, pp (1999) 3. Barabási A L, Bonabeau E.: Scale-free networks. J. Scientific American. vol. 288, pp (2003) 4. Watts D J, Strogatz S H.: Collective dynamics of smallworld networks. J. Nature. Vol. 393, pp (1998) 5. Barabási A L, Albert R.: Emergence of scaling in random networks. J. Science. Vol. 286, No. 5439, pp (1999) 6. Adel Ahmed, Tim Dywer, Seok-hee Hong, Colin Murray, Le Song, Ying Xin Wu.: Visualisation and Analysis of Large and Complex Scale-free Networks. In: EUROGRAPHICS-IEEE VGTC Symposium on Visualization, pp (2005) 7. Eades P.: A heuristic for graph drawing. J. Congressus Nutnerantiunt. Vol. 42, pp (1984) 8. Kamada T, Kawai S.: An Algorithm for Drawing General Undirected Graphs. J. Information Processing Letters. Vol. 31, pp (1989) 9. Fruchterman, T M J, Reingold, E M.: Graph drawing by force-directed placement. J. Software-Practice and Experience. Vol. 21, No. 11, pp (1991) 10. Chan D, Chua K, Leckiem C, Parhars A.: Visualisation of Power-Law Network Topologies. In: 11th IEEE International Conference on Networks (ICON2003), Sydney, Australia, pp (2003) 11. Quigley A, Eades P.: FADE: Graph drawing, clustering, and visual abstraction. In: International Symposium on Graph Drawing (GD2000), Springer, Vol. 1984/2001,pp (2000) 12. Liu G. R, Liu M. B.: Smoothed Particle Hydrodynamics: a meshfree particle method. Singapore: World Scientific (2003) 13. Ioana Stanoi, Mirek Riedewald, Divyakant Agrawal, Amr EI Abbadi.: Discovery of influence sets in frequently updated databases. Proc. Int. Conf. on Very Large Databases (VLDB), pp (2001) 61
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
More informationUSING 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 natarajan.meghanathan@jsums.edu
More informationVisual Analysis Tool for Bipartite Networks
Visual Analysis Tool for Bipartite Networks Kazuo Misue Department of Computer Science, University of Tsukuba, 1-1-1 Tennoudai, Tsukuba, 305-8573 Japan misue@cs.tsukuba.ac.jp Abstract. To find hidden features
More informationInformation Visualization of Attributed Relational Data
Information Visualization of Attributed Relational Data Mao Lin Huang Department of Computer Systems Faculty of Information Technology University of Technology, Sydney PO Box 123 Broadway, NSW 2007 Australia
More informationHow 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
More informationDatabase Modeling and Visualization Simulation technology Based on Java3D Hongxia Liu
International Conference on Information Sciences, Machinery, Materials and Energy (ICISMME 05) Database Modeling and Visualization Simulation technology Based on Java3D Hongxia Liu Department of Electronic
More informationApplying Social Network Analysis to the Information in CVS Repositories
Applying Social Network Analysis to the Information in CVS Repositories Luis Lopez-Fernandez, Gregorio Robles, Jesus M. Gonzalez-Barahona GSyC, Universidad Rey Juan Carlos {llopez,grex,jgb}@gsyc.escet.urjc.es
More informationOpen Access Research on Application of Neural Network in Computer Network Security Evaluation. Shujuan Jin *
Send Orders for Reprints to reprints@benthamscience.ae 766 The Open Electrical & Electronic Engineering Journal, 2014, 8, 766-771 Open Access Research on Application of Neural Network in Computer Network
More informationComplex Networks Analysis: Clustering Methods
Complex Networks Analysis: Clustering Methods Nikolai Nefedov Spring 2013 ISI ETH Zurich nefedov@isi.ee.ethz.ch 1 Outline Purpose to give an overview of modern graph-clustering methods and their applications
More informationLoad balancing in a heterogeneous computer system by self-organizing Kohonen network
Bull. Nov. Comp. Center, Comp. Science, 25 (2006), 69 74 c 2006 NCC Publisher Load balancing in a heterogeneous computer system by self-organizing Kohonen network Mikhail S. Tarkov, Yakov S. Bezrukov Abstract.
More informationDistributed Dynamic Load Balancing for Iterative-Stencil Applications
Distributed Dynamic Load Balancing for Iterative-Stencil Applications G. Dethier 1, P. Marchot 2 and P.A. de Marneffe 1 1 EECS Department, University of Liege, Belgium 2 Chemical Engineering Department,
More informationInet-3.0: Internet Topology Generator
Inet-3.: Internet Topology Generator Jared Winick Sugih Jamin {jwinick,jamin}@eecs.umich.edu CSE-TR-456-2 Abstract In this report we present version 3. of Inet, an Autonomous System (AS) level Internet
More informationEffects 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,
More informationChapter 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
More informationGraph 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
More informationTemporal Visualization and Analysis of Social Networks
Temporal Visualization and Analysis of Social Networks Peter A. Gloor*, Rob Laubacher MIT {pgloor,rjl}@mit.edu Yan Zhao, Scott B.C. Dynes *Dartmouth {yan.zhao,sdynes}@dartmouth.edu Abstract This paper
More informationTowards Modelling The Internet Topology The Interactive Growth Model
Towards Modelling The Internet Topology The Interactive Growth Model Shi Zhou (member of IEEE & IEE) Department of Electronic Engineering Queen Mary, University of London Mile End Road, London, E1 4NS
More informationDECENTRALIZED 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
More informationStrategies for Optimizing Public Train Transport Networks in China: Under a Viewpoint of Complex Networks
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
More informationA 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
More informationGraph/Network Visualization
Graph/Network Visualization Data model: graph structures (relations, knowledge) and networks. Applications: Telecommunication systems, Internet and WWW, Retailers distribution networks knowledge representation
More informationA comparative study of social network analysis tools
Membre de Membre de A comparative study of social network analysis tools David Combe, Christine Largeron, Előd Egyed-Zsigmond and Mathias Géry International Workshop on Web Intelligence and Virtual Enterprises
More informationGraphs over Time Densification Laws, Shrinking Diameters and Possible Explanations
Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations Jurij Leskovec, CMU Jon Kleinberg, Cornell Christos Faloutsos, CMU 1 Introduction What can we do with graphs? What patterns
More informationGENERATING 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
More informationGraph Mining Techniques for Social Media Analysis
Graph Mining Techniques for Social Media Analysis Mary McGlohon Christos Faloutsos 1 1-1 What is graph mining? Extracting useful knowledge (patterns, outliers, etc.) from structured data that can be represented
More informationMethodology for Emulating Self Organizing Maps for Visualization of Large Datasets
Methodology for Emulating Self Organizing Maps for Visualization of Large Datasets Macario O. Cordel II and Arnulfo P. Azcarraga College of Computer Studies *Corresponding Author: macario.cordel@dlsu.edu.ph
More informationEnterprise Organization and Communication Network
Enterprise Organization and Communication Network Hideyuki Mizuta IBM Tokyo Research Laboratory 1623-14, Shimotsuruma, Yamato-shi Kanagawa-ken 242-8502, Japan E-mail: e28193@jp.ibm.com Fusashi Nakamura
More informationTopic Maps Visualization
Topic Maps Visualization Bénédicte Le Grand, Laboratoire d'informatique de Paris 6 Introduction Topic maps provide a bridge between the domains of knowledge representation and information management. Topics
More informationA SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS INTRODUCTION
A SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS Kyoungjin Park Alper Yilmaz Photogrammetric and Computer Vision Lab Ohio State University park.764@osu.edu yilmaz.15@osu.edu ABSTRACT Depending
More informationResearch 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
More informationModelingandSimulationofthe OpenSourceSoftware Community
ModelingandSimulationofthe OpenSourceSoftware Community Yongqin Gao, GregMadey Departmentof ComputerScience and Engineering University ofnotre Dame ygao,gmadey@nd.edu Vince Freeh Department of ComputerScience
More informationATM 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
More informationResearch on Clustering Analysis of Big Data Yuan Yuanming 1, 2, a, Wu Chanle 1, 2
Advanced Engineering Forum Vols. 6-7 (2012) pp 82-87 Online: 2012-09-26 (2012) Trans Tech Publications, Switzerland doi:10.4028/www.scientific.net/aef.6-7.82 Research on Clustering Analysis of Big Data
More informationSolving Geometric Problems with the Rotating Calipers *
Solving Geometric Problems with the Rotating Calipers * Godfried Toussaint School of Computer Science McGill University Montreal, Quebec, Canada ABSTRACT Shamos [1] recently showed that the diameter of
More informationWireless 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
More informationSurvey On: Nearest Neighbour Search With Keywords In Spatial Databases
Survey On: Nearest Neighbour Search With Keywords In Spatial Databases SayaliBorse 1, Prof. P. M. Chawan 2, Prof. VishwanathChikaraddi 3, Prof. Manish Jansari 4 P.G. Student, Dept. of Computer Engineering&
More informationHandling the Complexity of RDF Data: Combining List and Graph Visualization
Handling the Complexity of RDF Data: Combining List and Graph Visualization Philipp Heim and Jürgen Ziegler (University of Duisburg-Essen, Germany philipp.heim, juergen.ziegler@uni-due.de) Abstract: An
More informationEmail Spam Detection Using Customized SimHash Function
International Journal of Research Studies in Computer Science and Engineering (IJRSCSE) Volume 1, Issue 8, December 2014, PP 35-40 ISSN 2349-4840 (Print) & ISSN 2349-4859 (Online) www.arcjournals.org Email
More informationAn Efficient Load Balancing Technology in CDN
Issue 2, Volume 1, 2007 92 An Efficient Load Balancing Technology in CDN YUN BAI 1, BO JIA 2, JIXIANG ZHANG 3, QIANGGUO PU 1, NIKOS MASTORAKIS 4 1 College of Information and Electronic Engineering, University
More informationA Simultaneous Solution for General Linear Equations on a Ring or Hierarchical Cluster
Acta Technica Jaurinensis Vol. 3. No. 1. 010 A Simultaneous Solution for General Linear Equations on a Ring or Hierarchical Cluster G. Molnárka, N. Varjasi Széchenyi István University Győr, Hungary, H-906
More informationAn Alternative Web Search Strategy? Abstract
An Alternative Web Search Strategy? V.-H. Winterer, Rechenzentrum Universität Freiburg (Dated: November 2007) Abstract We propose an alternative Web search strategy taking advantage of the knowledge on
More informationThe 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
More informationPUBLIC 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
More informationEfficient Search in Gnutella-like Small-World Peerto-Peer
Efficient Search in Gnutella-like Small-World Peerto-Peer Systems * Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao School of Computer, National University of Defense Technology, 410073 Changsha, China
More informationA MULTI-MODEL DOCKING EXPERIMENT OF DYNAMIC SOCIAL NETWORK SIMULATIONS ABSTRACT
A MULTI-MODEL DOCKING EXPERIMENT OF DYNAMIC SOCIAL NETWORK SIMULATIONS Jin Xu Yongqin Gao Jeffrey Goett Gregory Madey Dept. of Comp. Science University of Notre Dame Notre Dame, IN 46556 Email: {jxu, ygao,
More informationData Mining. Cluster Analysis: Advanced Concepts and Algorithms
Data Mining Cluster Analysis: Advanced Concepts and Algorithms Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 1 More Clustering Methods Prototype-based clustering Density-based clustering Graph-based
More informationContinuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information
Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Eric Hsueh-Chan Lu Chi-Wei Huang Vincent S. Tseng Institute of Computer Science and Information Engineering
More informationThe 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
More informationhttp://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
More informationGraph theoretic approach to analyze amino acid network
Int. J. Adv. Appl. Math. and Mech. 2(3) (2015) 31-37 (ISSN: 2347-2529) Journal homepage: www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Graph theoretic approach to
More informationAnalysis of Internet Topologies
Analysis of Internet Topologies Ljiljana Trajković ljilja@cs.sfu.ca Communication Networks Laboratory http://www.ensc.sfu.ca/cnl School of Engineering Science Simon Fraser University, Vancouver, British
More informationVisualization of Social Networks in Stata by Multi-dimensional Scaling
Visualization of Social Networks in Stata by Multi-dimensional Scaling Rense Corten Department of Sociology/ICS Utrecht University The Netherlands r.corten@uu.nl April 12, 2010 1 Introduction Social network
More informationTemporal 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
More informationExperiments on the local load balancing algorithms; part 1
Experiments on the local load balancing algorithms; part 1 Ştefan Măruşter Institute e-austria Timisoara West University of Timişoara, Romania maruster@info.uvt.ro Abstract. In this paper the influence
More informationThe Research and Application of Multi-Firewall Technology in Enterprise Network Security
, pp. 53-6 http://dx.doi.org/0.457/ijsia.05.9.5.6 The Research and Application of Multi-Firewall Technology in Enterprise Network Security Jing Li College of Information Engineering, Qingdao University,
More informationCollapse by Cascading Failures in Hybrid Attacked Regional Internet
Collapse by Cascading Failures in Hybrid Attacked Regional Internet Ye Xu and Zhuo Wang College of Information Science and Engineering, Shenyang Ligong University, Shenyang China xuy.mail@gmail.com Abstract
More informationProtein Protein Interaction Networks
Functional Pattern Mining from Genome Scale Protein Protein Interaction Networks Young-Rae Cho, Ph.D. Assistant Professor Department of Computer Science Baylor University it My Definition of Bioinformatics
More informationAn Analysis on Density Based Clustering of Multi Dimensional Spatial Data
An Analysis on Density Based Clustering of Multi Dimensional Spatial Data K. Mumtaz 1 Assistant Professor, Department of MCA Vivekanandha Institute of Information and Management Studies, Tiruchengode,
More informationGreedy Routing on Hidden Metric Spaces as a Foundation of Scalable Routing Architectures
Greedy Routing on Hidden Metric Spaces as a Foundation of Scalable Routing Architectures Dmitri Krioukov, kc claffy, and Kevin Fall CAIDA/UCSD, and Intel Research, Berkeley Problem High-level Routing is
More informationFault 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
More informationGraph Visualization U. Dogrusoz and G. Sander Tom Sawyer Software, 804 Hearst Avenue, Berkeley, CA 94710, USA info@tomsawyer.com Graph drawing, or layout, is the positioning of nodes (objects) and the
More informationCurrent Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary
Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:
More informationIntroduction 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
More informationTOPAS: a Web-based Tool for Visualization of Mapping Algorithms
TOPAS: a Web-based Tool for Visualization of Mapping Algorithms 0. G. Monakhov, 0. J. Chunikhin, E. B. Grosbein Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division of
More informationPower Efficiency Metrics for Geographical Routing In Multihop Wireless Networks
Power Efficiency Metrics for Geographical Routing In Multihop Wireless Networks Gowthami.A, Lavanya.R Abstract - A number of energy-aware routing protocols are proposed to provide the energy efficiency
More informationDistance Degree Sequences for Network Analysis
Universität Konstanz Computer & Information Science Algorithmics Group 15 Mar 2005 based on Palmer, Gibbons, and Faloutsos: ANF A Fast and Scalable Tool for Data Mining in Massive Graphs, SIGKDD 02. Motivation
More informationInternational journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer.
RESEARCH ARTICLE ISSN: 2321-7758 GLOBAL LOAD DISTRIBUTION USING SKIP GRAPH, BATON AND CHORD J.K.JEEVITHA, B.KARTHIKA* Information Technology,PSNA College of Engineering & Technology, Dindigul, India Article
More informationGEOMI: GEOmetry for Maximum Insight
GEOMI: GEOmetry for Maximum Insight Adel Ahmed 1,2, Tim Dwyer 3, Michael Forster 1, Xiaoyan Fu 1, Joshua Ho 2, Seok-Hee Hong 1,2, Dirk Koschützki 5, Colin Murray 1,2, Nikola S. Nikolov 1,4, Ronnie Taib
More informationOpen Source Software Developer and Project Networks
Open Source Software Developer and Project Networks Matthew Van Antwerp and Greg Madey University of Notre Dame {mvanantw,gmadey}@cse.nd.edu Abstract. This paper outlines complex network concepts and how
More informationScale-free user-network approach to telephone network traffic analysis
Scale-free user-network approach to telephone network traffic analysis Yongxiang Xia,* Chi K. Tse, WaiM.Tam, Francis C. M. Lau, and Michael Small Department of Electronic and Information Engineering, Hong
More informationCan Twitter Predict Royal Baby's Name?
Summary Can Twitter Predict Royal Baby's Name? Bohdan Pavlyshenko Ivan Franko Lviv National University,Ukraine, b.pavlyshenko@gmail.com In this paper, we analyze the existence of possible correlation between
More informationApplication of Virtual Instrumentation for Sensor Network Monitoring
Application of Virtual Instrumentation for Sensor etwor Monitoring COSTATI VOLOSECU VICTOR MALITA Department of Automatics and Applied Informatics Politehnica University of Timisoara Bd. V. Parvan nr.
More informationCluster Analysis: Advanced Concepts
Cluster Analysis: Advanced Concepts and dalgorithms Dr. Hui Xiong Rutgers University Introduction to Data Mining 08/06/2006 1 Introduction to Data Mining 08/06/2006 1 Outline Prototype-based Fuzzy c-means
More informationA Locality Enhanced Scheduling Method for Multiple MapReduce Jobs In a Workflow Application
2012 International Conference on Information and Computer Applications (ICICA 2012) IPCSIT vol. 24 (2012) (2012) IACSIT Press, Singapore A Locality Enhanced Scheduling Method for Multiple MapReduce Jobs
More informationVisualising Class Distribution on Self-Organising Maps
Visualising Class Distribution on Self-Organising Maps Rudolf Mayer, Taha Abdel Aziz, and Andreas Rauber Institute for Software Technology and Interactive Systems Vienna University of Technology Favoritenstrasse
More informationComponent visualization methods for large legacy software in C/C++
Annales Mathematicae et Informaticae 44 (2015) pp. 23 33 http://ami.ektf.hu Component visualization methods for large legacy software in C/C++ Máté Cserép a, Dániel Krupp b a Eötvös Loránd University mcserep@caesar.elte.hu
More informationCluster 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
More informationData Mining Cluster Analysis: Basic Concepts and Algorithms. Lecture Notes for Chapter 8. Introduction to Data Mining
Data Mining Cluster Analysis: Basic Concepts and Algorithms Lecture Notes for Chapter 8 by Tan, Steinbach, Kumar 1 What is Cluster Analysis? Finding groups of objects such that the objects in a group will
More informationEfficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation
Efficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation Sunil Karthick.M PG Scholar Department of ECE Kongu Engineering College Perundurau-638052 Venkatachalam.S Assistant Professor
More informationHIGH DIMENSIONAL UNSUPERVISED CLUSTERING BASED FEATURE SELECTION ALGORITHM
HIGH DIMENSIONAL UNSUPERVISED CLUSTERING BASED FEATURE SELECTION ALGORITHM Ms.Barkha Malay Joshi M.E. Computer Science and Engineering, Parul Institute Of Engineering & Technology, Waghodia. India Email:
More informationCharacterizing and Modelling Clustering Features in AS-Level Internet Topology
Characterizing and Modelling Clustering Features in AS-Level Topology Yan Li, Jun-Hong Cui, Dario Maggiorini and Michalis Faloutsos yan.li@uconn.edu, jcui@engr.uconn.edu, dario@dico.unimi.it, michalis@cs.ucr.edu
More informationSpace-filling Techniques in Visualizing Output from Computer Based Economic Models
Space-filling Techniques in Visualizing Output from Computer Based Economic Models Richard Webber a, Ric D. Herbert b and Wei Jiang bc a National ICT Australia Limited, Locked Bag 9013, Alexandria, NSW
More informationHierarchical Data Visualization
Hierarchical Data Visualization 1 Hierarchical Data Hierarchical data emphasize the subordinate or membership relations between data items. Organizational Chart Classifications / Taxonomies (Species and
More informationarxiv:cs.dm/0204001 v1 30 Mar 2002
A Steady State Model for Graph Power Laws David Eppstein Joseph Wang arxiv:cs.dm/0000 v 0 Mar 00 Abstract Power law distribution seems to be an important characteristic of web graphs. Several existing
More informationSurvey of Software Fault Localization for Web Application
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Swati
More informationA Review And Evaluations Of Shortest Path Algorithms
A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing
More informationCS 207 - Data Science and Visualization Spring 2016
CS 207 - Data Science and Visualization Spring 2016 Professor: Sorelle Friedler sorelle@cs.haverford.edu An introduction to techniques for the automated and human-assisted analysis of data sets. These
More informationIJCSES Vol.7 No.4 October 2013 pp.165-168 Serials Publications BEHAVIOR PERDITION VIA MINING SOCIAL DIMENSIONS
IJCSES Vol.7 No.4 October 2013 pp.165-168 Serials Publications BEHAVIOR PERDITION VIA MINING SOCIAL DIMENSIONS V.Sudhakar 1 and G. Draksha 2 Abstract:- Collective behavior refers to the behaviors of individuals
More informationSubgraph 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,
More informationSuperViz: An Interactive Visualization of Super-Peer P2P Network
SuperViz: An Interactive Visualization of Super-Peer P2P Network Anthony (Peiqun) Yu pqyu@cs.ubc.ca Abstract: The Efficient Clustered Super-Peer P2P network is a novel P2P architecture, which overcomes
More informationSecurity-Aware Beacon Based Network Monitoring
Security-Aware Beacon Based Network Monitoring Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Graduate School of Informatics, Kyoto University, Kyoto, Japan Email: {sasaki, liang, nag}@amp.i.kyoto-u.ac.jp
More informationAnalysis of Internet Topologies: A Historical View
Analysis of Internet Topologies: A Historical View Mohamadreza Najiminaini, Laxmi Subedi, and Ljiljana Trajković Communication Networks Laboratory http://www.ensc.sfu.ca/cnl Simon Fraser University Vancouver,
More informationNEW GENERATION OF COMPUTER AIDED DESIGN IN SPACE PLANNING METHODS A SURVEY AND A PROPOSAL
NEW GENERATION OF COMPUTER AIDED DESIGN IN SPACE PLANNING METHODS A SURVEY AND A PROPOSAL YING-CHUN HSU, ROBERT J. KRAWCZYK Illinois Institute of Technology, Chicago, IL USA Email address: hsuying1@iit.edu
More informationA Novel Method to Improve Resolution of Satellite Images Using DWT and Interpolation
A Novel Method to Improve Resolution of Satellite Images Using DWT and Interpolation S.VENKATA RAMANA ¹, S. NARAYANA REDDY ² M.Tech student, Department of ECE, SVU college of Engineering, Tirupati, 517502,
More informationThe Shape of the Network. The Shape of the Internet. Why study topology? Internet topologies. Early work. More on topologies..
The Shape of the Internet Slides assembled by Jeff Chase Duke University (thanks to and ) The Shape of the Network Characterizing shape : AS-level topology: who connects to whom Router-level topology:
More informationCONCEPTUAL 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
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationHow To Find Influence Between Two Concepts In A Network
2014 UKSim-AMSS 16th International Conference on Computer Modelling and Simulation Influence Discovery in Semantic Networks: An Initial Approach Marcello Trovati and Ovidiu Bagdasar School of Computing
More informationVisualization of Breast Cancer Data by SOM Component Planes
International Journal of Science and Technology Volume 3 No. 2, February, 2014 Visualization of Breast Cancer Data by SOM Component Planes P.Venkatesan. 1, M.Mullai 2 1 Department of Statistics,NIRT(Indian
More informationA ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING IN LEO SATELLITE CONSTELLATION NETWORK. Received September 2012; revised January 2013
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 10, October 2013 pp. 4139 4149 A ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING
More information