A New Evaluation Method of Node Importance in Directed Weighted Complex Networks
|
|
- Arlene Richards
- 6 years ago
- Views:
Transcription
1 Journal of Systems Science and Information Aug., 2017, Vol. 5, No. 4, pp DOI: /JSSI A New Evaluation Method of Node Importance in Directed Weighted Complex Networks Yu WANG School of Management, University of Shanghai for Science and Technology, Shanghai , China @qq.com Jinli GUO School of Management, University of Shanghai for Science and Technology, Shanghai , China phd5816@163.com Han LIU Trade and Technology Department, Xijing University, Xi an , China Abstract Current researches on node importance evaluation mainly focus on undirected and unweighted networks, which fail to reflect the real world in a comprehensive and objective way. Based on directed weighted complex network models, the paper introduces the concept of in-weight intensity of nodes and thereby presents a new method to identify key nodes by using an importance evaluation matrix. The method not only considers the direction and weight of edges, but also takes into account the position importance of nodes and the importance contributions of adjacent nodes. Finally, the paper applies the algorithm to a microblog-forwarding network composed of 34 users, then compares the evaluation results with traditional methods. The experiment shows that the method proposed can effectively evaluate the node importance in directed weighted networks. Keywords contribution directed weighted complex network; node importance; in-weight intensity; importance 1 Introduction With the deep study of complex networks, how to guarantee the reliability and invulnerability of networks has become an important research subject [1]. Currently, the research on the node importance evaluation mainly focus on undirected and unweighted networks [2 6],which only contains a qualitative description on whether there are interactions between nodes, rather than describing how strong the interactions are. However, most of the networks in reality are directed and weighted [3], such as web page networks, citation networks, and food chain networks, etc. In these networks, the interactions between nodes have a clear direction and may not be reciprocal. Therefore, it has a certain practical significance to evaluate the node importance in the directed weighted networks. It helps to find the weak links in the networks, seek key Received June 10, 2016, accepted December 19, 2016 Supported by the National Natural Science Foundation of China ( ) The corresponding author
2 368 WANG Y, GUO J L, LIU H. nodes and cope with random attacks and deliberate attacks effectively, thereby improving the reliability of the whole network [7]. In recent years, researchers have proposed many valuable evaluation methods of node importance, including analysis methods of social network, systems science and information search area. Among them, methods of social network analysis are on the basis of the thinking that significance is equivalent to importance. Common indices include degree centrality [8],betweenness centrality [9], closeness centrality [10], eigenvector centrality and the cumulative nomination, etc. However, according to [11], Jin, et al. thought that the methods only consider a certain attribute of nodes, and it is too one-sided to reflect the node importance accurately and fully. For example, the degree centrality method is so plain that only the local structure around a node needs to be known, while ignoring the global structure of the network. It seems that the betweenness centrality, in a global sense, could well measure the node importance. The more the shortest paths passing the node are, the more important the node become. Nevertheless, it is not applicable to large-scale complex networks as it has a highly complicated algorithm. Methods of systems science analysis are on the basis of the idea that destructiveness is equivalent importance. The methods can reflect the node importance by measuring the damage of deleting nodes upon the network connection. Typical methods include the node delete method of minimum spanning tree number [12], the node contraction method [5], the shortest path method [13], etc. For instance, the node contraction method focuses on the geometric position of nodes in the networks. However, in case contractions of multiple nodes make the network topological structure identical, all nodes in the networks will have the same importance. Methods of information search analysis study the importance of the page nodes by analyzing the connection relationships between pages. Typical methods include PageRank algorithm [14], HITS algorithm [15], etc. The methods tend to be more effective to evaluate the node importance in directed networks, but it does not apply to undirected networks. The above methods can be used under the relevant background, which have great guidance and reference significance. However, these methods are mostly based on undirected and unweighted networks. Also they fail to consider the importance contribution of adjacent nodes, ignoring the interdependent relationship between nodes. In theory, the node importance not only depends on their own attributes like degree and betweenness, it is also closely related to the importance of adjacent nodes. Based on the above considerations, the paper puts forward a new method to identify key nodes in the directed weighted networks by using an importance evaluation matrix. The method not only considers the positions of nodes and the importance contributions of adjacent nodes, but also relates to the direction and weights of edges, making node importance evaluation more practically significant. In Section 2, the paper constructs a directed weighted network model and uses the node efficiency to characterize the role of nodes in network information circulation. In Section 3, the paper introduces the concept of the in-weight intensity of nodes. Thereby the importance evaluation matrix constructed by the in-weight intensity and the node efficiency could reflect nodes local importance. Then, the paper presents a specific evaluation algorithm. In Section 4, in order to verify the effectiveness of the method, the paper carries out an empirical analysis and compares that with traditional indices. Finally, a summary is given in Section 5.
3 A New Evaluation Method of Node Importance in Directed Weighted Complex Networks Directed Weighted Complex Network Model Many network models (including small-world networks and BA evolution networks) have ignored the directivity of networks. In fact, many important networks are directed in real world, including telephone networks and metabolic networks. Unweighted networks may only reflect the simple connection mode between nodes, making the research not in-depth and comprehensive. In view of this, the paper describes a directed weighted network model. The model not only considers the directivity of interactions between nodes, but also depicts the strength of the interactions with edge weights, thereby presenting the network structures more objectively and completely. Definition 2.1 Directed weighted Network G =(V,E,W). In this definition, V = {v 1,v 2,,v n } is the set of nodes. E = {e 1,e 2,,e n } V V, is the set of edges. v i V (i = 1, 2,,n) represents a node in the network, (v i,v j ) E represents a directed edge from node v i to v j, W expresses the weight matrix of directed edges, w ij expresses weights (or connection strength) of a directed edge (v i,v j ); similarly, w ji expresses weights of a directed edge (v j,v i ). If node v i and node v j are not connected, we will consider w ij =0,w ji = 0. Generally, for any v i,weconsiderw ii =0. w 11 w 1n w 21 w 2n W =..... (1). w n1 w nn In the paper, we study directed graphs, so the weight matrix is generally asymmetric, namely, w ij w ji. Definition 2.2 The efficiencyi k of node k is defined as I k = 1 n 1 n i=1,i k 1 d ki. (2) Where, n is the total number of nodes in the network, d ki is the distance from node v k to node v i. From the definition of I k, we can learn that the node efficiency characterizes the average difficulty from one node to other nodes, and reflects the contributions that a node makes to the network information transmission. The greater the efficiency is, the more important position the node may have during the transmission process. Thus, the efficiency, to a certain extent, can reflect the global importance of nodes. 3 NodeImportanceEvaluationMethod 3.1 Construction of Importance Evaluation Matrix A complex network is a unified whole that contains a large number of nodes. There exist complicated interactions and interdependencies between nodes. For instance, although the bridge connecting node has quite small degree, it is noticeably relied on in the network, that is to say, other nodes make great importance contributions to the node. As a result, the node has a higher importance. Therefore, it is inaccurate to determine the node importance relying
4 370 WANG Y, GUO J L, LIU H. only on one index. In [16], Zhao, et al. raised a node importance contribution matrix method, in which a node contributed its initial importance, characterized by betweenness, to its adjacent nodes evenly with the base of degree. However, it is improper that the importance contributions of a node are inversely proportional to the degree. Moreover, the method is only applicable to undirected and unweighted networks, which is not practical. In order to overcome the above defects, aiming at directed weighted networks, the paper puts forward a new method for the node importance ranking. The method uses the node efficiency to indicate the location of nodes in networks, namely global importance. Considering the directions and weights of edges, the paper introduces the in-weight intensity to determine the importance contribution ratio between adjacent nodes. Thus the importance contribution matrix constructed therefrom can reflect nodes local importance. Definition 3.1 In-weight intensity of node v i. For the weighted network G =(V,E,W), in-weight intensity of node v i refers to the sum of weights on the directed edges pointing to node v i : n r i = w xi, (3) x=1 where n is the total number of nodes in the network. As can be seen from the definition, a node s in-weight intensity, to a certain extent, can characterize its local importance. In order to simplify the algorithm, the paper only considers the importance contributions of some adjacent nodes that point to the node to be evaluated. The reason is that compared with out-edges, in-edges of a node may provide more valuable importance contribution information. In a directed weighted network G, we can build its adjacency matrix A =[a ij ], where 1, (v i,v j ) / E, a ij = (4) 0, (v i,v j ) E. If node v j points to node v i, the importance contribution ratio of the adjacent node v j to node v i will be r i n c ij = x=1 r, a ji =1, xa jx (5) 0, a ji =0. Then it is extended to all nodes to get the matrix: 1 c 12 c 1n c 21 1 c 2n H NICM = (6). c n1 c n2 1 Definition 3.2 The matrix H NICM is called the node importance contribution matrix for directed weighted networks. In [7], Zhou, et al. also used the importance contribution ratio to construct the node importance contribution matrix. However, [7] is different from the method specified in the paper essentially. First of all, the former is just applicable to undirected and unweighted networks;
5 A New Evaluation Method of Node Importance in Directed Weighted Complex Networks 371 but the paper is dedicated to directed weighted networks. Moreover, in [7], the importance contribution ratio of node v j is dj k,whered j is the degree of node v j, k is the average degree of the network. While in the paper, when node v j points to node v i, c ij denotes the ratio of r i r to the sum of in-weight intensity of all adjacent nodes that node v j points to, i.e., i. n x=1 rxajx Different from [7], when our model degenerates into an undirected and unweighted network model, c ij refers to the ratio of degree d i to the sum of degree of all adjacent nodes of node v j, d i.e., i nx=1 d xa jx. The Equation (2) shows that the node efficiency reflects node s position information in some extent. Therefore, the paper selects the node efficiency as the initial importance value of H NICM, then uses Equation (6) to get the node importance evaluation matrix H: I 1 I 2 c 12 I n c 1n I 1 c 21 I 2 I n c 2n H = , (7). I 1 c n1 I 2 c n2 I n where the element H ij refers to the importance contribution value of node v j to node v i.ascan be seen from Equation (5) and (7), when a ji = 1, the importance contribution value of node v j r to node v i is H ij = I i j n. The contribution value depends not only on the efficiency of x=1 rxajx node v j, but also on the ratio of r i to the sum of in-weight intensity of all adjacent nodes that node v j points to. The greater I j and the ratio, the higher the importance contribution value. From the Equations (2) and (7), the importance C i of node v i is defined as C i = I i n j=1,j i I j c ij. (8) The C i represents the product of I i times the sum of importance contributions of all adjacent nodes pointing to node v i. From Equation (8), the importance index integrates nodes global importance and local importance, which can improve the accuracy of evaluation. 3.2 Node Importance Evaluation Algorithm The existing evaluation algorithms mainly compare the changes of network performance before and after removing nodes. Nevertheless, the removal of nodes may cause the network to be split up. The situation should be discriminated, and it is hard to clarify that. Here we consider the importance contribution of adjacent nodes and the node efficiency altogether, which means making use of the node s in-weight intensity and position information. The specific algorithm steps for the evaluation method are as follows: Input The weight matrix W = [w ij ] and adjacency matrix A = [a ij ] of the directed weighted network; Output The importance C i of node v i. Begin: Step 0 Calculate the shortest distance between all pairs of nodes Dis =[d ij ]//Floyd algorithm;
6 372 WANG Y, GUO J L, LIU H. Step 1 Determine the node importance contribution matrix H NICM : According to the adjacency matrix A =[a ij ], we can determine all adjacent nodes pointing to v i, and other adjacent nodes that these adjacent nodes point to. According to the weight matrix W =[w ij ], we can also determine the in-weight intensity of node v i and other adjacent nodes (for i =1to n), then fill them in H NICM according to Equations (5) and (6); Step 2 Determine the node importance evaluation matrix H: according to the Dis, we can determine the efficiency I i, and multiply the elements in i-th column of H NICM by I i.the products will serve as the i-th column of H (for i =1ton); Step 3 Calculate each node s importance: According to Equation (8), the importance C i of each node can be calculated (for i =1ton). End. 4 The Analysis of Experimental Results In order to verify the validity of the method herein, the paper takes Sina Microblog for example, using a microblog-forwarding network between friends to evaluate users importance. In the microblog-forwarding network, nodes represent the network users, directed edges express the following relations among users, and the weights on directed edges represents the amount of microblog forwarded. Figure 1 is a typical microblog-forwarding network form. Assuming there are 4 user nodes, A and B are followed mutually. If A follows C, B may also follows C; similarly, if B follows D, A may also follows D. The Arabic numerals on the directed edges represent the amount of users microblog forwarded. For example, the Arabic numerals 4 means that A forwards 4 pieces of microblogs from C. According to the algorithm steps mentioned above, the typical network form is analyzed experimentally to illustrate the effectiveness of the proposed method. The evaluation results are shown in Table 1. Figure 1 A typical microblogging network form Table 1 The node importance in the network shown in Figure 1 Node In-degree In-weight intensity r Efficiency I Importance C A B C D It can be learnt from Table 1 that, the in-degree index ignores the weights of edges, so the evaluation results lack objectiveness. For example, the in-degrees of nodes A and B are both 1, but their importances are clearly different. Although the efficiency can well reflect
7 A New Evaluation Method of Node Importance in Directed Weighted Complex Networks 373 nodes roles in the information transmission, it fails to consider the importance contributions of adjacent nodes. For instance, the efficiencies of nodes C and D are both While using the evaluation index C proposed in the paper, we can see obviously that the importance is different (C C =0.3500,C D =0.3898). The index not only embodies the in-weight intensity and node efficiency, but also shows the impact of adjacent nodes. Therefore, the node importance can be distinguished even better. In order to further verify the effectiveness of the method, the paper selects a sample of 38 users from University of Shanghai for Science and Technology for investigation. After excluding the objects not registered in Sina Microblog, we obtain a microblog-forwarding network composed of 34 users as shown in Figure 2. According to the algorithm proposed herein and the programs written in Matlab, each evaluation index is computed and shown in Table 2. Figure 2 Microblogging forwarded network constituted by 34 users As can be seen from Table 2, using different evaluation indices can get different ranking of node importance. The in-degree index only considers the directions of edges and ignores the weights on the edges, making the results quite rough and inaccurate. Likewise, simply using the in-weight intensity also cannot well measure the nodeimportance.forexample, the in-degrees of node v 7, v 19,andv 30 are all 3, the in-weight intensity values are all 13. They seem to have the same importance, but in fact, the two indices ignore the global position of nodes and the impact of adjacent nodes on them. Obviously, the three nodes are in different positions, and accordingly their importance has significant disparity (C v7 =0.1613,C v19 =0.1806,C v30 =0.0468). As mentioned above, the efficiency also makes the results biased as its failure to consider the weights of edges and the importance contribution of adjacent nodes. For example, the node v 5 has the largest efficiency value However, hence concluding that v 5 is the most important node, is very one-sided. From Table 2, C v5 = is relatively small. C v21 = and C v29 = are both greater than C v5, which is consistent with the actual situation. Using
8 374 WANG Y, GUO J L, LIU H. the algorithm herein we can derive that, the most important node in the microblog-forwarding network is v 23,forC v23 = = max(c v1,c v2,c v3,,c v34 ). Table 2 The node importance in the network shown in Figure 2 Node In-degree r I C Node In-degree r I C v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v Conclusion Based on actual circumstances, the paper proposes an evaluation method of node importance in directed weighted networks. Considering the directions and weights of edges, and the dependency relations among adjacent nodes, the paper improves the importance contribution matrix. Thereby, using the improved index C can better identify key nodes in the networks. Through experimental analysis, it also proves that, compared with traditional methods, the method proposed can make the evaluation results more practical. In order to simplify the calculation, H NICM only defines the importance contribution of indegree adjacent nodes; that is, if node v j points to v i,thenv j will have importance contribution to v i, but regardless of the contribution of node v i to node v j. Consequently, how to extend the matrix, making it also reflect the importance contribution of out-degree adjacent nodes, or even the dependencies among all nodes, will be the author s study task next. References [1] Xiong W M, Liu Y H. On the reliability of communication networks. Journal of China Institute of Communications, 1990, 11(4): [2] Peng X Z, Yao H, Zhang Z H, et al. Invulnerability of scale-free network against critical node failures based on a renewed cascading failure model. Systems Engineering and Electronics, 2013, 35(9):
9 A New Evaluation Method of Node Importance in Directed Weighted Complex Networks 375 [3] Landherr A, Friedl B, Heidemann J. A critical review of centrality measures in social networks. Business & Information Systems Engineering, 2010, 2(6): [4] Kermarrec A M, Merrer E L, Sericola B, et al. Second order centrality: Distributed assessment of nodes criticity in complex networks. Computer Communications, 2010, 34(5): [5] Tan Y J, Wu J, Deng H Z. Evaluation method for node importance based on node contraction in complex networks. Systems Engineering Theory & Practice, 2006, 11(11): [6] Liu R R, Jia C X, Zhang J L, et al. Robustness of interdependent networks under several intentional attack strategies. Journal of University of Shanghai for Science and Technology, 2012, 34(3): [7] Zhou X, Zhang F M, Li K W, et al. Finding vital node by node importance evaluation matrix in complex networks. Acta Physica Sinica, 2012, 61(5): 1 7. [8] Yang K, Zhang N, Su S Q. Node centrality on individual microblog user network. Journal of University of Shanghai for Science and Technology, 2015, 37(1): [9] Shen D, Li J H, Xiong J S, et al. A cascading failure model of double layer complex networks based on betweenness. Complex Systems and Complexity Science, 2014, 11(3): [10] Sabidussi G. The centrality index of a graph. Psychometrika, 1966, 31(4): [11] Jin J, Xu K, Xiong N, et al. Multi-index evaluation algorithm based on principal component analysis for node importance in complex networks. IET Networks, 2012, 1(3): [12] Chen Y, Hu A Q, Hu X. Evaluation method for node importance in communication networks. Journal of China Institute of Communications, 2004, 25(8): [13] Rao Y P, Lin J Y, Hou D T. Evaluation method for network invulnerability based on shortest route number. Journal of China Institute of Communications, 2009, 30(4): [14] Luo H L. Remanufacturing closed-loop supply chain model with uncertain demand. Science and Technology Management Research, 2012, 2(2): [15] Guo Y H, Ma J H, Wang G H. Modeling and analysis of recycling and remanufacturing systems by using repeated game model. Industrial Engineering Journal, 2011, 14(5): [16] Zhao Y H, Wang Z L, Zheng J, et al. Finding most vital node by node importance contribution matrix in communication networks. Journal of Beijing University of Aeronautics and Astronautics, 2009, 35(9):
An improved PageRank algorithm for Social Network User s Influence research Peng Wang, Xue Bo*, Huamin Yang, Shuangzi Sun, Songjiang Li
3rd International Conference on Mechatronics and Industrial Informatics (ICMII 2015) An improved PageRank algorithm for Social Network User s Influence research Peng Wang, Xue Bo*, Huamin Yang, Shuangzi
More informationWarship Power System Survivability Evaluation Based on Complex Network Theory Huiying He1,a, Hongjiang Li1, Shaochang Chen1 and Hao Xiong1,2,b
International Industrial Informatics and Computer Engineering Conference (IIICEC 05) Warship Power System Survivability Evaluation Based on Complex Network Theory Huiying He,a, Hongjiang Li, Shaochang
More informationThe Gene Modular Detection of Random Boolean Networks by Dynamic Characteristics Analysis
Journal of Materials, Processing and Design (2017) Vol. 1, Number 1 Clausius Scientific Press, Canada The Gene Modular Detection of Random Boolean Networks by Dynamic Characteristics Analysis Xueyi Bai1,a,
More informationQuality Assessment of Power Dispatching Data Based on Improved Cloud Model
Quality Assessment of Power Dispatching Based on Improved Cloud Model Zhaoyang Qu, Shaohua Zhou *. School of Information Engineering, Northeast Electric Power University, Jilin, China Abstract. This paper
More informationRoad Network Traffic Congestion Evaluation Simulation Model based on Complex Network Chao Luo
6th International Conference on Machinery, Materials, Environment, Biotechnology and Computer (MMEBC 26) Road Network Traffic Congestion Evaluation Simulation Model based on Complex Network Chao Luo Department
More informationIntuitionistic Fuzzy Petri Nets for Knowledge Representation and Reasoning
Intuitionistic Fuzzy Petri Nets for Knowledge Representation and Reasoning Meng Fei-xiang 1 Lei Ying-jie 1 Zhang Bo 1 Shen Xiao-yong 1 Zhao Jing-yu 2 1 Air and Missile Defense College Air Force Engineering
More informationmanufacturing process.
Send Orders for Reprints to reprints@benthamscience.ae The Open Automation and Control Systems Journal, 2014, 6, 203-207 203 Open Access Identifying Method for Key Quality Characteristics in Series-Parallel
More informationA hierarchical network model for network topology design using genetic algorithm
A hierarchical network model for network topology design using genetic algorithm Chunlin Wang 1, Ning Huang 1,a, Shuo Zhang 2, Yue Zhang 1 and Weiqiang Wu 1 1 School of Reliability and Systems Engineering,
More informationAn Improved Method of Vehicle Driving Cycle Construction: A Case Study of Beijing
International Forum on Energy, Environment and Sustainable Development (IFEESD 206) An Improved Method of Vehicle Driving Cycle Construction: A Case Study of Beijing Zhenpo Wang,a, Yang Li,b, Hao Luo,
More informationComprehensive analysis and evaluation of big data for main transformer equipment based on PCA and Apriority
IOP Conference Series: Earth and Environmental Science PAPER OPEN ACCESS Comprehensive analysis and evaluation of big data for main transformer equipment based on PCA and Apriority To cite this article:
More informationFUZZY C-MEANS ALGORITHM BASED ON PRETREATMENT OF SIMILARITY RELATIONTP
Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications & Algorithms 14 (2007) 103-111 Copyright c 2007 Watam Press FUZZY C-MEANS ALGORITHM BASED ON PRETREATMENT OF SIMILARITY RELATIONTP
More informationEvaluation method of node importance for power grid considering inflow and outflow power
J. Mod. Power Syst. Clean Energy (2017) 5(5):696 703 DOI 10.1007/s40565-016-0234-3 Evaluation method of node importance for power grid considering inflow and outflow power Huifang WAN 1, Zhengbo SHAN 1,
More informationA REASONING COMPONENT S CONSTRUCTION FOR PLANNING REGIONAL AGRICULTURAL ADVANTAGEOUS INDUSTRY DEVELOPMENT
A REASONING COMPONENT S CONSTRUCTION FOR PLANNING REGIONAL AGRICULTURAL ADVANTAGEOUS INDUSTRY DEVELOPMENT Yue Fan 1, Yeping Zhu 1*, 1 Agricultural Information Institute, Chinese Academy of Agricultural
More informationHigh Capacity Reversible Watermarking Scheme for 2D Vector Maps
Scheme for 2D Vector Maps 1 Information Management Department, China National Petroleum Corporation, Beijing, 100007, China E-mail: jxw@petrochina.com.cn Mei Feng Research Institute of Petroleum Exploration
More informationPrim Algorithm Based on Heap for Finding Minimal Spanning Tree of Ventilation Network. Buchuan Wang & Qinglong Liu & Wenbin Wu
International Conference on Applied Science and Engineering Innovation (ASEI 2015) Prim Algorithm Based on Heap for Finding Minimal Spanning Tree of Ventilation Network Buchuan Wang & Qinglong Liu & Wenbin
More informationDeadlock Avoidance Based on Graph Theory
, pp.353-362 http://dx.doi.org/10.14257/ijunesst.2016.9.2.34 Deadlock Avoidance Based on Graph Theory Biyuan Yao, Jianhua Yin * and Wei Wu College of Information Science and Technology, Hainan University
More informationAn Adaptive Threshold LBP Algorithm for Face Recognition
An Adaptive Threshold LBP Algorithm for Face Recognition Xiaoping Jiang 1, Chuyu Guo 1,*, Hua Zhang 1, and Chenghua Li 1 1 College of Electronics and Information Engineering, Hubei Key Laboratory of Intelligent
More informationCHAOTIC ANT SYSTEM OPTIMIZATION FOR PATH PLANNING OF THE MOBILE ROBOTS
CHAOTIC ANT SYSTEM OPTIMIZATION FOR PATH PLANNING OF THE MOBILE ROBOTS Xu Mingle and You Xiaoming Shanghai University of Engineering Science, Shanghai, China ABSTRACT This paper presents an improved ant
More informationA PMU-Based Three-Step Controlled Separation with Transient Stability Considerations
Title A PMU-Based Three-Step Controlled Separation with Transient Stability Considerations Author(s) Wang, C; Hou, Y Citation The IEEE Power and Energy Society (PES) General Meeting, Washington, USA, 27-31
More informationBig Data and Fans Economy Oriented Star Node Mining Improved Algorithm in Social Networks Based on Acquaintance Immunization
Journal of Physics: Conference Series PAPER OPEN ACCESS Big Data and Fans Economy Oriented Star Node Mining Improved Algorithm in Social Networks Based on Acquaintance Immunization To cite this article:
More informationResearch on Community Structure in Bus Transport Networks
Commun. Theor. Phys. (Beijing, China) 52 (2009) pp. 1025 1030 c Chinese Physical Society and IOP Publishing Ltd Vol. 52, No. 6, December 15, 2009 Research on Community Structure in Bus Transport Networks
More informationAn Improved Fault Diagnosis Method for Hierarchical Graph with Radar Systems
An Improved Fault Diagnosis Method for Hierarchical Graph with Radar Systems Huijie Zhang, Shulin Tian, Zhen Liu, Bin Long, Quan Zhou School of Automation Engineering University of Electronic Science and
More informationA Feature Selection Method to Handle Imbalanced Data in Text Classification
A Feature Selection Method to Handle Imbalanced Data in Text Classification Fengxiang Chang 1*, Jun Guo 1, Weiran Xu 1, Kejun Yao 2 1 School of Information and Communication Engineering Beijing University
More informationComparative analyses for the performance of Rational Rose and Visio in software engineering teaching
Journal of Physics: Conference Series PAPER OPEN ACCESS Comparative analyses for the performance of Rational Rose and Visio in software engineering teaching To cite this article: Zhaojun Yu and Zhan Xiong
More informationComponent connectivity of crossed cubes
Component connectivity of crossed cubes School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Abstract: Let G = (V, E) be a connected graph. A r-component
More informationRETRACTED ARTICLE. Web-Based Data Mining in System Design and Implementation. Open Access. Jianhu Gong 1* and Jianzhi Gong 2
Send Orders for Reprints to reprints@benthamscience.ae The Open Automation and Control Systems Journal, 2014, 6, 1907-1911 1907 Web-Based Data Mining in System Design and Implementation Open Access Jianhu
More informationA Data Classification Algorithm of Internet of Things Based on Neural Network
A Data Classification Algorithm of Internet of Things Based on Neural Network https://doi.org/10.3991/ijoe.v13i09.7587 Zhenjun Li Hunan Radio and TV University, Hunan, China 278060389@qq.com Abstract To
More informationA study on reliability of high-speed passenger transport network based on complex network analysis 1
Acta Technica 61 No. 4A/2016), 25 38 c 2017 Institute of Thermomechanics CAS, v.v.i. A study on reliability of high-speed passenger transport network based on complex network analysis 1 Xu Zhang 2, Bingzhi
More informationA Balancing Algorithm in Wireless Sensor Network Based on the Assistance of Approaching Nodes
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com A Balancing Algorithm in Wireless Sensor Network Based on the Assistance of Approaching Nodes 1,* Chengpei Tang, 1 Jiao Yin, 1 Yu Dong 1
More informationVideo Inter-frame Forgery Identification Based on Optical Flow Consistency
Sensors & Transducers 24 by IFSA Publishing, S. L. http://www.sensorsportal.com Video Inter-frame Forgery Identification Based on Optical Flow Consistency Qi Wang, Zhaohong Li, Zhenzhen Zhang, Qinglong
More informationEvaluation of Meta-Search Engine Merge Algorithms
2008 International Conference on Internet Computing in Science and Engineering Evaluation of Meta-Search Engine Merge Algorithms Chunshuang Liu, Zhiqiang Zhang,2, Xiaoqin Xie 2, TingTing Liang School of
More informationResearch on Design and Application of Computer Database Quality Evaluation Model
Research on Design and Application of Computer Database Quality Evaluation Model Abstract Hong Li, Hui Ge Shihezi Radio and TV University, Shihezi 832000, China Computer data quality evaluation is the
More informationResearch on the New Image De-Noising Methodology Based on Neural Network and HMM-Hidden Markov Models
Research on the New Image De-Noising Methodology Based on Neural Network and HMM-Hidden Markov Models Wenzhun Huang 1, a and Xinxin Xie 1, b 1 School of Information Engineering, Xijing University, Xi an
More informationFace Recognition Based on LDA and Improved Pairwise-Constrained Multiple Metric Learning Method
Journal of Information Hiding and Multimedia Signal Processing c 2016 ISSN 2073-4212 Ubiquitous International Volume 7, Number 5, September 2016 Face Recognition ased on LDA and Improved Pairwise-Constrained
More informationTHE KNOWLEDGE MANAGEMENT STRATEGY IN ORGANIZATIONS. Summer semester, 2016/2017
THE KNOWLEDGE MANAGEMENT STRATEGY IN ORGANIZATIONS Summer semester, 2016/2017 SOCIAL NETWORK ANALYSIS: THEORY AND APPLICATIONS 1. A FEW THINGS ABOUT NETWORKS NETWORKS IN THE REAL WORLD There are four categories
More informationUAV Motion-Blurred Image Restoration Using Improved Continuous Hopfield Network Image Restoration Algorithm
Journal of Information Hiding and Multimedia Signal Processing c 207 ISSN 2073-422 Ubiquitous International Volume 8, Number 4, July 207 UAV Motion-Blurred Image Restoration Using Improved Continuous Hopfield
More informationThe Research of Delay Characteristics in CAN Bus Networked Control System
Journal of Computational Information Systems 9: 18 (2013) 7517 7523 Available at http://www.jofcis.com The Research of Delay Characteristics in CAN Bus Networked Control System Yi WANG 1, Liren HE 2, Ming
More informationAttack Vulnerability of Network with Duplication-Divergence Mechanism
Commun. Theor. Phys. (Beijing, China) 48 (2007) pp. 754 758 c International Academic Publishers Vol. 48, No. 4, October 5, 2007 Attack Vulnerability of Network with Duplication-Divergence Mechanism WANG
More informationA Compatible Public Service Platform for Multi-Electronic Certification Authority
Applied Mechanics and Materials Submitted: 2014-04-26 ISSN: 1662-7482, Vol. 610, pp 579-583 Accepted: 2014-05-26 doi:10.4028/www.scientific.net/amm.610.579 Online: 2014-08-11 2014 Trans Tech Publications,
More informationAdaptive Zoom Distance Measuring System of Camera Based on the Ranging of Binocular Vision
Adaptive Zoom Distance Measuring System of Camera Based on the Ranging of Binocular Vision Zhiyan Zhang 1, Wei Qian 1, Lei Pan 1 & Yanjun Li 1 1 University of Shanghai for Science and Technology, China
More informationresult, it is very important to design a simulation system for dynamic laser scanning
3rd International Conference on Multimedia Technology(ICMT 2013) Accurate and Fast Simulation of Laser Scanning Imaging Luyao Zhou 1 and Huimin Ma Abstract. In order to design a more accurate simulation
More informationVisual Working Efficiency Analysis Method of Cockpit Based On ANN
Visual Working Efficiency Analysis Method of Cockpit Based On ANN Yingchun CHEN Commercial Aircraft Corporation of China,Ltd Dongdong WEI Fudan University Dept. of Mechanics an Science Engineering Gang
More informationOn Reduct Construction Algorithms
1 On Reduct Construction Algorithms Yiyu Yao 1, Yan Zhao 1 and Jue Wang 2 1 Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 {yyao, yanzhao}@cs.uregina.ca 2 Laboratory
More informationStudy on the Quantitative Vulnerability Model of Information System based on Mathematical Modeling Techniques. Yunzhi Li
Applied Mechanics and Materials Submitted: 2014-08-05 ISSN: 1662-7482, Vols. 651-653, pp 1953-1957 Accepted: 2014-08-06 doi:10.4028/www.scientific.net/amm.651-653.1953 Online: 2014-09-30 2014 Trans Tech
More informationProximity Prestige using Incremental Iteration in Page Rank Algorithm
Indian Journal of Science and Technology, Vol 9(48), DOI: 10.17485/ijst/2016/v9i48/107962, December 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Proximity Prestige using Incremental Iteration
More informationAn Improved k-shell Decomposition for Complex Networks Based on Potential Edge Weights
International Journal of Applied Mathematical Sciences ISSN 0973-0176 Volume 9, Number 2 (2016), pp. 163-168 Research India Publications http://www.ripublication.com An Improved k-shell Decomposition for
More informationVirtual Interaction System Based on Optical Capture
Sensors & Transducers 203 by IFSA http://www.sensorsportal.com Virtual Interaction System Based on Optical Capture Peng CHEN, 2 Xiaoyang ZHOU, 3 Jianguang LI, Peijun WANG School of Mechanical Engineering,
More informationEFFICIENT ATTRIBUTE REDUCTION ALGORITHM
EFFICIENT ATTRIBUTE REDUCTION ALGORITHM Zhongzhi Shi, Shaohui Liu, Zheng Zheng Institute Of Computing Technology,Chinese Academy of Sciences, Beijing, China Abstract: Key words: Efficiency of algorithms
More informationDesign and Implementation of Agricultural Information Resources Vertical Search Engine Based on Nutch
619 A publication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 51, 2016 Guest Editors: Tichun Wang, Hongyang Zhang, Lei Tian Copyright 2016, AIDIC Servizi S.r.l., ISBN 978-88-95608-43-3; ISSN 2283-9216 The
More informationResearch on the Wood Cell Contour Extraction Method Based on Image Texture and Gray-scale Information.
, pp. 65-74 http://dx.doi.org/0.457/ijsip.04.7.6.06 esearch on the Wood Cell Contour Extraction Method Based on Image Texture and Gray-scale Information Zhao Lei, Wang Jianhua and Li Xiaofeng 3 Heilongjiang
More informationApplication of Improved Lzc Algorithm in the Discrimination of Photo and Text ChengJing Ye 1, a, Donghai Zeng 2,b
2016 International Conference on Information Engineering and Communications Technology (IECT 2016) ISBN: 978-1-60595-375-5 Application of Improved Lzc Algorithm in the Discrimination of Photo and Text
More informationStudy and Design of CAN / LIN Hybrid Network of Automotive Body. Peng Huang
Advanced Materials Research Online: 2014-06-30 ISSN: 1662-8985, Vol. 940, pp 469-474 doi:10.4028/www.scientific.net/amr.940.469 2014 Trans Tech Publications, Switzerland Study and Design of CAN / LIN Hybrid
More informationDesign of Fault Diagnosis System of FPSO Production Process Based on MSPCA
2009 Fifth International Conference on Information Assurance and Security Design of Fault Diagnosis System of FPSO Production Process Based on MSPCA GAO Qiang, HAN Miao, HU Shu-liang, DONG Hai-jie ianjin
More informationSharp lower bound for the total number of matchings of graphs with given number of cut edges
South Asian Journal of Mathematics 2014, Vol. 4 ( 2 ) : 107 118 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Sharp lower bound for the total number of matchings of graphs with given number of cut
More informationNetworks in economics and finance. Lecture 1 - Measuring networks
Networks in economics and finance Lecture 1 - Measuring networks What are networks and why study them? A network is a set of items (nodes) connected by edges or links. Units (nodes) Individuals Firms Banks
More informationUtilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS
Key Engineering Materials Online: 2009-10-08 ISSN: 1662-9795, Vols. 419-420, pp 557-560 doi:10.4028/www.scientific.net/kem.419-420.557 2010 Trans Tech Publications, Switzerland Utilizing Restricted Direction
More informationResearch on Correction and Optimization of Post-processing Imaging of Structure with Non-planar Interface Using Full Matrix Data of Ultrasonic Array
19 th World Conference on Non-Destructive Testing 2016 Research on Correction and Optimiation of Post-processing Imaging of Structure with Non-planar Interface Using Full Matrix Data of Ultrasonic Array
More informationA Multi-party Decision Hot-standby Model
TELKOMNIKA Indonesian Journal of Electrical Engineering Vol.12, No.4, April 2014, pp. 3247 ~ 3252 DOI: http://dx.doi.org/10.11591/telkomnika.v12i4.4887 3247 A Multi-party Decision Hot-standby Model Congdong
More informationA priority based dynamic bandwidth scheduling in SDN networks 1
Acta Technica 62 No. 2A/2017, 445 454 c 2017 Institute of Thermomechanics CAS, v.v.i. A priority based dynamic bandwidth scheduling in SDN networks 1 Zun Wang 2 Abstract. In order to solve the problems
More informationCentrality Book. cohesion.
Cohesion The graph-theoretic terms discussed in the previous chapter have very specific and concrete meanings which are highly shared across the field of graph theory and other fields like social network
More informationTest Analysis of Serial Communication Extension in Mobile Nodes of Participatory Sensing System Xinqiang Tang 1, Huichun Peng 2
International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 2015) Test Analysis of Serial Communication Extension in Mobile Nodes of Participatory Sensing System Xinqiang
More informationAero-engine PID parameters Optimization based on Adaptive Genetic Algorithm. Yinling Wang, Huacong Li
International Conference on Applied Science and Engineering Innovation (ASEI 215) Aero-engine PID parameters Optimization based on Adaptive Genetic Algorithm Yinling Wang, Huacong Li School of Power and
More informationDeduction and Logic Implementation of the Fractal Scan Algorithm
Deduction and Logic Implementation of the Fractal Scan Algorithm Zhangjin Chen, Feng Ran, Zheming Jin Microelectronic R&D center, Shanghai University Shanghai, China and Meihua Xu School of Mechatronical
More informationThe Design and Implementation of Workflow Simulation based on the Theory of Discrete Event
The Design and Implementation of Workflow Simulation based on the Theory of Discrete Event Kehe Wu 1,a, Shuo Shi 1,b, Gang Ma 1,c and Shengzhuang Wang 1,d 1 School of North China Electric Power University,
More informationFinite Element Analysis and Structure Optimal Design of the Column of Deep-Hole Drilling Machine
Vol. 5, No. 5; October 2011 Finite Element Analysis and Structure Optimal Design of the Column of Deep-Hole Drilling Machine Baohui Li College of Mechanical Engineering, University of Shanghai for Science
More informationThe Promotion Channel Investigation of BIM Technology Application
2016 International Conference on Manufacturing Construction and Energy Engineering (MCEE) ISBN: 978-1-60595-374-8 The Promotion Channel Investigation of BIM Technology Application Yong Li, Jia-Chuan Qin,
More informationThe Research of Collision Detection Algorithm Based on Separating axis Theorem
The Research of Collision Detection lgorithm Based on Separating axis Theorem bstract Cheng Liang a, Xiaojian Liu School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China a
More informationThe Analysis of the Loss Rate of Information Packet of Double Queue Single Server in Bi-directional Cable TV Network
Applied Mechanics and Materials Submitted: 2014-06-18 ISSN: 1662-7482, Vol. 665, pp 674-678 Accepted: 2014-07-31 doi:10.4028/www.scientific.net/amm.665.674 Online: 2014-10-01 2014 Trans Tech Publications,
More informationText Clustering Incremental Algorithm in Sensitive Topic Detection
International Journal of Information and Communication Sciences 2018; 3(3): 88-95 http://www.sciencepublishinggroup.com/j/ijics doi: 10.11648/j.ijics.20180303.12 ISSN: 2575-1700 (Print); ISSN: 2575-1719
More informationInversion of Array Induction Logs and Its Application
2007 Petroleum Science Vol.4 No.3 Inversion of Array Induction Logs and Its Application Gao Jie 1, Zhao Aibin 2, Peng Fei 1 and Li Hongqi 1 (1. School of Resources and Information, China University of
More informationTrust4All: a Trustworthy Middleware Platform for Component Software
Proceedings of the 7th WSEAS International Conference on Applied Informatics and Communications, Athens, Greece, August 24-26, 2007 124 Trust4All: a Trustworthy Middleware Platform for Component Software
More informationCitation for the original published paper (version of record):
http://www.diva-portal.org This is the published version of a paper published in Procedia Engineering. Citation for the original published paper (version of record): Zhang, D., Lu, J., Wang, L., Li, J.
More informationSupplementary Material : Partial Sum Minimization of Singular Values in RPCA for Low-Level Vision
Supplementary Material : Partial Sum Minimization of Singular Values in RPCA for Low-Level Vision Due to space limitation in the main paper, we present additional experimental results in this supplementary
More informationRestricted edge connectivity and restricted connectivity of graphs
Restricted edge connectivity and restricted connectivity of graphs Litao Guo School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Xiaofeng Guo
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Study on secure data storage based on cloud computing ABSTRACT KEYWORDS
[Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 22 BioTechnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(22), 2014 [13778-13783] Study on secure data storage based on cloud computing
More informationDevelopment of a Rapid Design System for Aerial Work Truck Subframe with UG Secondary Development Framework
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 2961 2965 Advanced in Control Engineering and Information Science Development of a Rapid Design System for Aerial Work Truck Subframe
More informationMulti-Step Segmentation Method Based on Adaptive Thresholds for Chinese Calligraphy Characters
Journal of Information Hiding and Multimedia Signal Processing c 2018 ISSN 2073-4212 Ubiquitous International Volume 9, Number 2, March 2018 Multi-Step Segmentation Method Based on Adaptive Thresholds
More informationExtracting Information from Complex Networks
Extracting Information from Complex Networks 1 Complex Networks Networks that arise from modeling complex systems: relationships Social networks Biological networks Distinguish from random networks uniform
More informationSPATIOTEMPORAL INDEXING MECHANISM BASED ON SNAPSHOT-INCREMENT
SPATIOTEMPORAL INDEXING MECHANISM BASED ON SNAPSHOT-INCREMENT L. Lin a, Y. Z. Cai a, b, Z. Xu a a School of Resource and Environment Science,Wuhan university, Wuhan China 430079, lilin@telecarto.com b
More informationFault Diagnosis of Wind Turbine Based on ELMD and FCM
Send Orders for Reprints to reprints@benthamscience.ae 76 The Open Mechanical Engineering Journal, 24, 8, 76-72 Fault Diagnosis of Wind Turbine Based on ELMD and FCM Open Access Xianjin Luo * and Xiumei
More informationSTUDY OF THE DEVELOPMENT OF THE STRUCTURE OF THE NETWORK OF SOFIA SUBWAY
STUDY OF THE DEVELOPMENT OF THE STRUCTURE OF THE NETWORK OF SOFIA SUBWAY ИЗСЛЕДВАНЕ НА РАЗВИТИЕТО НА СТРУКТУРАТА НА МЕТРОМРЕЖАТА НА СОФИЙСКИЯ МЕТОПОЛИТЕН Assoc. Prof. PhD Stoilova S., MSc. eng. Stoev V.,
More informationFSRM Feedback Algorithm based on Learning Theory
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 699-703 699 FSRM Feedback Algorithm based on Learning Theory Open Access Zhang Shui-Li *, Dong
More informationPerformance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances
Performance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances Minzhong Liu, Xiufen Zou, Yu Chen, Zhijian Wu Abstract In this paper, the DMOEA-DD, which is an improvement of DMOEA[1,
More informationDesign of student information system based on association algorithm and data mining technology. CaiYan, ChenHua
5th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering (ICMMCCE 2017) Design of student information system based on association algorithm and data mining technology
More informationFastCluster: a graph theory based algorithm for removing redundant sequences
J. Biomedical Science and Engineering, 2009, 2, 621-625 doi: 10.4236/jbise.2009.28090 Published Online December 2009 (http://www.scirp.org/journal/jbise/). FastCluster: a graph theory based algorithm for
More informationRecognition of Human Body Movements Trajectory Based on the Three-dimensional Depth Data
Preprints of the 19th World Congress The International Federation of Automatic Control Recognition of Human Body s Trajectory Based on the Three-dimensional Depth Data Zheng Chang Qing Shen Xiaojuan Ban
More informationFACE RECOGNITION FROM A SINGLE SAMPLE USING RLOG FILTER AND MANIFOLD ANALYSIS
FACE RECOGNITION FROM A SINGLE SAMPLE USING RLOG FILTER AND MANIFOLD ANALYSIS Jaya Susan Edith. S 1 and A.Usha Ruby 2 1 Department of Computer Science and Engineering,CSI College of Engineering, 2 Research
More informationTime Series Clustering Ensemble Algorithm Based on Locality Preserving Projection
Based on Locality Preserving Projection 2 Information & Technology College, Hebei University of Economics & Business, 05006 Shijiazhuang, China E-mail: 92475577@qq.com Xiaoqing Weng Information & Technology
More informationControllability of Complex Power Networks
Network and Communication Technologies; Vol. 3, No. 1; 018 ISSN 197-064X E-ISSN 197-0658 Published by Canadian Center of Science and Education Controllability of Complex Power Networks Guohua Zhang 1,
More informationDetecting and Analyzing Communities in Social Network Graphs for Targeted Marketing
Detecting and Analyzing Communities in Social Network Graphs for Targeted Marketing Gautam Bhat, Rajeev Kumar Singh Department of Computer Science and Engineering Shiv Nadar University Gautam Buddh Nagar,
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationA New Method Of VPN Based On LSP Technology
2nd Joint International Information Technology, Mechanical and Electronic Engineering Conference (JIMEC 2017) A New Method Of VPN Based On LSP Technology HaiJun Qing 1, 2 1, 2, ChaoXiang Liang, LiPing
More informationThe Comparative Study of Machine Learning Algorithms in Text Data Classification*
The Comparative Study of Machine Learning Algorithms in Text Data Classification* Wang Xin School of Science, Beijing Information Science and Technology University Beijing, China Abstract Classification
More informationThe Design of Supermarket Electronic Shopping Guide System Based on ZigBee Communication
The Design of Supermarket Electronic Shopping Guide System Based on ZigBee Communication Yujie Zhang, Liang Han, and Yuanyuan Zhang College of Electrical and Information Engineering, Shaanxi University
More informationResearch on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a
International Conference on Education Technology, Management and Humanities Science (ETMHS 2015) Research on Applications of Data Mining in Electronic Commerce Xiuping YANG 1, a 1 Computer Science Department,
More informationAn Improved Frequent Pattern-growth Algorithm Based on Decomposition of the Transaction Database
Algorithm Based on Decomposition of the Transaction Database 1 School of Management Science and Engineering, Shandong Normal University,Jinan, 250014,China E-mail:459132653@qq.com Fei Wei 2 School of Management
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 informationGraphGAN: Graph Representation Learning with Generative Adversarial Nets
The 32 nd AAAI Conference on Artificial Intelligence (AAAI 2018) New Orleans, Louisiana, USA GraphGAN: Graph Representation Learning with Generative Adversarial Nets Hongwei Wang 1,2, Jia Wang 3, Jialin
More informationResearch on Two - Way Interactive Communication and Information System Design Analysis Dong Xu1, a
5th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering (ICMMCCE 2017) Research on Two - Way Interactive Communication and Information System Design Analysis Dong Xu1,
More informationOn the Expansion of Access Bandwidth of Manufacturing Cloud Core Network
1288 JOURNAL OF SOFTWARE, VOL. 9, NO. 5, MAY 2014 On the Expansion of Access Bandwidth of Manufacturing Cloud Core Network Hongyao Ju Zhejiang Textile & Fashion College, NingBo 315211, P.R.China Email:
More information