Advanced Materials Research Vols. 998-999

Abstract: Considering two goals of market share and location cost, this article builds a bi-objective location model. NSGA-II is utilized to acquire a Pareto non-dominated solution set. According to actual conditions such as cost constraints, decision-makers can choose solutions from non-dominated solution set. Furthermore, an approach based on Technique for Ordering Preferences by Similarity to Ideal Solution (TOPSIS) and minimum system’s cost under set covering are used to find out two reasonable solutions from the non-dominated solution set for decision-makers.

Abstract: Video steganalysis takes effect when videos corrupted by the target steganography method are available. Nevertheless, classical classifiers deteriorate in the opposite case. This paper presents a method to cope with the problem of steganography method mismatch for the detection of motion vector (MV) based steganography. Firstly, Adding-or-Subtracting-One (AoSO) feature against MV based steganography and Transfer Component Analysis (TCA) for domain adaptation are revisited. Distributions of AoSO feature against various MV based steganography methods are illustrated, followed by the potential effect of TCA based AoSO feature. Finally, experiments are carried out on various cases of steganography method mismatch. Performance results demonstrate that TCA+AoSO feature significantly outperforms AoSO feature, and is more favorable for real-world applications.

Abstract: The understanding of the temporal patterns of individual human interactions is essential in explaining many characteristics of human behavior. The instant communication tool QQ is developing rapidly on the network in recent years. Based on the QQ group communication records provided by some volunteers, this paper investigates the statistics of the inter-event intervals between two consecutive messages. The result shows that they follow power-law distribution. And there are obvious positive correlation between the activity of QQ group and the power-law exponent of inter-event time distribution. In further study, we find that the distribution displays a strong bursty property yet weak memory effects, then we analysis the distribution of the number of events in a bursty period.

Abstract: Connection management uses hash table. Hash function and data structure are both the bottleneck technology. For balancing computation cost and uniformity of hash function, three new hash functions were devised——the Random number Mapping Xor (RMX) function based on random number table mapping, the Segment Sampling Xor (SSX) function and Byte by Byte Shift Xor (BBSX) function based on segment generation and bit operations. The results show that these three functions are all better than IPSX on uniformity. This paper analyzed memory access performance and miss rate of multiple slots hash table, and presented the technical idea for shorting packet process time in connection management. Simulation is described.

Abstract: by using network simulation software GNS3 and VirtualBox virtual machine to build a portable network operation platform, we have put forward network case establishment and built specific practical network cases that have been applied in teaching, which has changed “static image projection” of network cases’ theoretical classes to “dynamic demo” and provided a complete technical reference for students’ practical training.

Abstract: A transmission method , combining both the bit error diversity and joint network-channel coding, was proposed for multiple-user multiple-hop multiple-relay networks. In the poposed method, an interleaver was designed for the bit error diversity and a novel protocol was devised for random linear network coding. The proposed method as well as other two methods—Method I without channel code and protection and Method II only with protection, was analyzed by deriving performance expressions in terms of packet error rate (PER) and throughput. Moreover, simulations further prove the superiority of the proposed method. Numerical results show that the proposed method gains an improvement in PER compared with Method I & II and keeps highest throughput within certain range of SNR.

Abstract: The existing road network privacy protection models do not consider the density of the user and the road length. To solve this problem, we propose a Euclidean distance-based road network privacy protection model. First, we put the projection distance of sections in the road network context as the actual distance between two users located in this section. For users in different sections, we put the sum of distance with respect to the length of sections as the relative position between them. Secondly, combining traditional anonymity models and road network characteristics, we propose the road network (k, l)-anonymous model and design algorithms to implement it. Finally, we use the experimental verify performance of the algorithm. Theoretical analysis and experimental results show that the algorithm is correct and effective.

Abstract: A improved genetic algorithm is proposed to QoS routing optimization. By improving coding schemes, fitness function designs, selection schemes, crossover schemes and variations, the proposed method can effectively reduce computational complexity and improve coding accuracy. Simulations are carried out to compare our algorithm with the traditional genetic algorithms. Experimental results show that our algorithm converges quickly and is reliable. Hence, our method vastly outperforms the traditional algorithms.

Abstract: This paper presented a model with overload function for cascading failure. The main differences with respect to previous models are as follows: overload function is defined for each node, according to the value of overload function, one node has th ree states: success, overload, failure. After the load decreases, an overloaded node can be success again. The evolution of topology is replaced by the evolution of value of overload function during the process of cascading failure. It’s needless to delete the failure nodes and its edges, the load will avoid the failure nodes automat ically and the decrease of network performance will be reflected by network efficiency. An evaluation method of node importance considering cascading failure is proposed, and its algorithm is presented. A new definition of node importance is proposed. The most important node is the one who see failure results in the largest decrease of networks efficiency at the end of cascading. The evaluation method can help us to find some potential critical nodes which are sensitive to the efficiency of networks but not so important intuitively. Final example verifies its efficiency and feasibility.

Abstract: This paper proposed a novel method to extract bilingual translation pairs from the web. Based on the observation that translation pairs tend to appear collectively on the web, a recursive process is used to extract high quality translation pairs from the web. First query the search engine with some seed data and crawl the returned pages. Then identify the Collective Translation Pair Block (CTPB) which contains the collective translation pairs using a heuristic evaluation method. After the CTPB has been identified, a PAT tree is employed to generate the extraction patterns automatically. Then a ranking SVM model is used to re-rank these patterns based on the F measure. The top 10 patterns are adopted to extract the translation pairs with the help of surface pattern. At last in order to get the high quality extraction translation, the extracted translation pairs are verified by a SVM classifier based on the translation relevant between the source and the target language.