Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process： generation, diffusion, and dissipation of the congestion. In this account, we ...
详细信息
Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process： generation, diffusion, and dissipation of the congestion. In this account, we present a function that represents the extent of congestion on a given node. This approach is different from existing fimctions based on betweenness centrality. By introducing the concept of ＇delay time＇, we designate an intergradation between permanent removal and nonremoval. We also construct an evaluation fimction of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability and packet generation speed on congestion propagation. Also, we uncover the relationship between the cascade dynamics and some properties of the network such as structure and size.
Vehicular ad hoc networks (VANET) have many new characteristics unlike tranditional network, such as centriclessness, mobility and multi-hop transmission, which invalidate conventional key managements. The fast develo...
详细信息
Vehicular ad hoc networks (VANET) have many new characteristics unlike tranditional network, such as centriclessness, mobility and multi-hop transmission, which invalidate conventional key managements. The fast development and successful application of trusted computing technology provide a potential solution to achieve effective authentication and trust evaluation. According to the VANET with self-organization, a new authentication and trust evaluation framework was proposed based on trusted computing technology, the concepts of "trusted attribute" and "trusted grade" were introduced, and the key management architecture as well as authentication process of mobile node were explained in detail. Moreover, the potential real application of the presented framework was discussed, and the trust evaluation method and its argumentation in the presented framework were given.
Thih paper proposed an intrusion detection system framework adapt to load characteristic under IPv6/4 environment; it uses decision-tree-based classification method, under guidance of a certain flow, creates dynamical...
详细信息
Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a pro...
详细信息
Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is based on analyzing multiple sequence alignments derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are combined into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imbal- anced data learning problem. A novel undersampling method is proposed on distance-based maximal entropy in the feature space of Support Vector Machine （SVM）. The overall precision is about 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein but also in the machine learning system on general im- balanced datasets.
According to the security features of WiMAX-based wireless communication network, a fresh new wireless communication authentication protocol called WCAP was advanced and designed adopting the dual-key authentication s...
详细信息
We present a novel object localization approach based on the Global Structure Constraint model (GSC) and Optimal Algorithm. In GSC, Objects are described as constellations of points satisfied with their specific globa...
详细信息
Aiming at the dynamic policy trigger problem in policy based network management, this thesis first introduces the uncertain information generated by onepoint coverage random sets theory and also the unified framework ...
详细信息
In this paper, we mainly discuss the relationship between the extended Pawlak flow graph (EFG) with granular computing (GrC), and develop a both simple and concrete model for EFG using GrC. The distinct advantage is t...
详细信息
IEEE802.16, as a wireless MAN broadband access standard, defines a flexible QoS mechanism in MAC layer for wild variety classes of services. However, it dose not define specific admission control strategy and scheduli...
详细信息
Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman c...
详细信息
Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.
暂无评论