Due to the enormous harm of virus propagation,research regarding virus immunizations still absolutely necessary.In comparison to current researches,a new virus immunization method the hierarchical virus immunization m...Due to the enormous harm of virus propagation,research regarding virus immunizations still absolutely necessary.In comparison to current researches,a new virus immunization method the hierarchical virus immunization method(HVIM) for community networks is proposed.Based on the virus transmission dynamic model SusceptibleInfectious-Removed and SusceptibleRemoved(SIRSR),HVIM considered the influence of external factors on the spread of viruses and only needs a portion of the network structure to be able to carry out immunization.Another pro for HVIM is that it is scalable and suitable for parallel computing which is a requirement in the big data era.Finally,a simulation dataset and a real dataset were used to run experiments,and the results of simulation showed that HVIM obviously is superior to others on the aspect of immunity.展开更多
This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the...This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the channel allocation model with interference constraints. Then we focus on the use of evolutionary algorithms to solve the optimal allocation distribution. We further consider that the search time can be reduced by means of parallel computing, and then a parallel algorithm based APO is proposed. In contrast with the existing algorithms, we decompose the allocation vector into a number of sub-vectors and search for optimal allocation distribution of sub-vector in parallel. In order to speed up converged rate and improve converged value, some typical operations of evolutionary algorithms are modified by two novel operators. Finally, simulation results show that the proposed algorithm drastically outperform other optimal solutions in term of the network utilization.展开更多
With increasingly complex website structure and continuously advancing web technologies,accurate user clicks recognition from massive HTTP data,which is critical for web usage mining,becomes more difficult.In this pap...With increasingly complex website structure and continuously advancing web technologies,accurate user clicks recognition from massive HTTP data,which is critical for web usage mining,becomes more difficult.In this paper,we propose a dependency graph model to describe the relationships between web requests.Based on this model,we design and implement a heuristic parallel algorithm to distinguish user clicks with the assistance of cloud computing technology.We evaluate the proposed algorithm with real massive data.The size of the dataset collected from a mobile core network is 228.7GB.It covers more than three million users.The experiment results demonstrate that the proposed algorithm can achieve higher accuracy than previous methods.展开更多
A multi-beam chirp sonar based on IP connections and DSP processing nodes was proposed and designed to provide an expandable system with high-speed processing and mass-storage of real-time signals for multi-beam profi...A multi-beam chirp sonar based on IP connections and DSP processing nodes was proposed and designed to provide an expandable system with high-speed processing and mass-storage of real-time signals for multi-beam profiling sonar.The system was designed for seabed petroleum pipeline detection and orientation,and can receive echo signals and process the data in real time,refreshing the display 10 times per second.Every node of the chirp sonar connects with data processing nodes through TCP/IP. Merely by adding nodes,the system’s processing ability can be increased proportionately without changing the software.System debugging and experimental testing proved the system to be practical and stable.This design provides a new method for high speed active sonar.展开更多
One of the key challenges in largescale network simulation is the huge computation demand in fine-grained traffic simulation.Apart from using high-performance computing facilities and parallelism techniques,an alterna...One of the key challenges in largescale network simulation is the huge computation demand in fine-grained traffic simulation.Apart from using high-performance computing facilities and parallelism techniques,an alternative is to replace the background traffic by simplified abstract models such as fluid flows.This paper suggests a hybrid modeling approach for background traffic,which combines ON/OFF model with TCP activities.The ON/OFF model is to characterize the application activities,and the ordinary differential equations(ODEs) based on fluid flows is to describe the TCP congestion avoidance functionality.The apparent merits of this approach are(1) to accurately capture the traffic self-similarity at source level,(2) properly reflect the network dynamics,and(3) efficiently decrease the computational complexity.The experimental results show that the approach perfectly makes a proper trade-off between accuracy and complexity in background traffic simulation.展开更多
基金supported by China 973 Program (2014CB340600)NSF(60903175,61272405, 61272033,and 61272451)University Innovation Foundation(2013TS102 and 2013TS106)
文摘Due to the enormous harm of virus propagation,research regarding virus immunizations still absolutely necessary.In comparison to current researches,a new virus immunization method the hierarchical virus immunization method(HVIM) for community networks is proposed.Based on the virus transmission dynamic model SusceptibleInfectious-Removed and SusceptibleRemoved(SIRSR),HVIM considered the influence of external factors on the spread of viruses and only needs a portion of the network structure to be able to carry out immunization.Another pro for HVIM is that it is scalable and suitable for parallel computing which is a requirement in the big data era.Finally,a simulation dataset and a real dataset were used to run experiments,and the results of simulation showed that HVIM obviously is superior to others on the aspect of immunity.
基金supported in part by the National Natural Science Foundation under Grant No.61072069National Science and Technology Major Project of the Ministry of Science and Technology of China under Grant No.2012ZX03003012
文摘This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the channel allocation model with interference constraints. Then we focus on the use of evolutionary algorithms to solve the optimal allocation distribution. We further consider that the search time can be reduced by means of parallel computing, and then a parallel algorithm based APO is proposed. In contrast with the existing algorithms, we decompose the allocation vector into a number of sub-vectors and search for optimal allocation distribution of sub-vector in parallel. In order to speed up converged rate and improve converged value, some typical operations of evolutionary algorithms are modified by two novel operators. Finally, simulation results show that the proposed algorithm drastically outperform other optimal solutions in term of the network utilization.
基金supported in part by the Fundamental Research Funds for the Central Universities under Grant No.2013RC0114111 Project of China under Grant No.B08004
文摘With increasingly complex website structure and continuously advancing web technologies,accurate user clicks recognition from massive HTTP data,which is critical for web usage mining,becomes more difficult.In this paper,we propose a dependency graph model to describe the relationships between web requests.Based on this model,we design and implement a heuristic parallel algorithm to distinguish user clicks with the assistance of cloud computing technology.We evaluate the proposed algorithm with real massive data.The size of the dataset collected from a mobile core network is 228.7GB.It covers more than three million users.The experiment results demonstrate that the proposed algorithm can achieve higher accuracy than previous methods.
基金the National High Technology Project of China Foundation under Grant No.2002AA602230-1
文摘A multi-beam chirp sonar based on IP connections and DSP processing nodes was proposed and designed to provide an expandable system with high-speed processing and mass-storage of real-time signals for multi-beam profiling sonar.The system was designed for seabed petroleum pipeline detection and orientation,and can receive echo signals and process the data in real time,refreshing the display 10 times per second.Every node of the chirp sonar connects with data processing nodes through TCP/IP. Merely by adding nodes,the system’s processing ability can be increased proportionately without changing the software.System debugging and experimental testing proved the system to be practical and stable.This design provides a new method for high speed active sonar.
基金supported by the Science and Technology Project of Zhejiang Province(No. 2014C01051)the National High Technology Development 863 Program of China( No.2015AA011901)
文摘One of the key challenges in largescale network simulation is the huge computation demand in fine-grained traffic simulation.Apart from using high-performance computing facilities and parallelism techniques,an alternative is to replace the background traffic by simplified abstract models such as fluid flows.This paper suggests a hybrid modeling approach for background traffic,which combines ON/OFF model with TCP activities.The ON/OFF model is to characterize the application activities,and the ordinary differential equations(ODEs) based on fluid flows is to describe the TCP congestion avoidance functionality.The apparent merits of this approach are(1) to accurately capture the traffic self-similarity at source level,(2) properly reflect the network dynamics,and(3) efficiently decrease the computational complexity.The experimental results show that the approach perfectly makes a proper trade-off between accuracy and complexity in background traffic simulation.
