Applied Mechanics and Materials Vols. 556-562

Abstract: Routers are the key equipments connecting Wan, LAN and Internet network, and are the main part of the Internet. The reliability and security of routers is very important to the network performance and information data security. The analysis and research on the technologies of router security and protection is the core issue for network security. This paper mainly aims at providing a series of test and analysis on the vulnerabilities of Tenda wireless routers. Technically, it’s very difficult to crack the WPA /WPA2 wireless encryption. In this paper, we use the related vulnerabilities of wireless routers, and open Wifi Protection Setup (WPS) and Quick Security Settings (QSS) to get router PIN code, which can help us bypass the WPA/WPA2 encryption and, realizesd the router attack.

Abstract: TransactionEvent is one of the five events defined in EPCGlobal standard. As TransactionEvent lasts for a long period and processes large data, it has a higher demand of real-time. The process of the TransactionEvent in the Internet of Things is complex. In order to overcome these disadvantages, this paper proposes a non-integrated program. This program will ensure the TransactionEvent processing efficiency, reliability and real time. In the end of this paper, the article will implement a prototype system of a commercial IoT to verify this method.

Abstract: Affected with various factors in wartime, the time during which the transport vehicles of military supplies pass through a certain section of a route is an uncertain parameter, whose optimization objective functions and constraints cannot be defined and solved through the traditional method of deterministic planning. In response to the problem, a routing optimization model is put forward herein for the timing uncertainty of wartime transportation and a method is devised for the Improved Genetic Algorithm to solve the routing optimization model with respect to timing uncertainty. Examples are also cited to verify the rationality of the algorithm as well as the correctness of the model.

Abstract: Dynamic evolving characteristic is the key of modeling internetware architecture. However, it is lack of formal description and theoretical analysis for model dynamic evolution for the moment, a new kind of internetware dynamic evolving modeling method based on Seal-Calculus of process algebra is presented and formalized analysis is conducted for evolving process in practical applications, which is convenient to express obviously and strictly the dynamic process of the system, providing a new means and theoretical basis.

Abstract: HR performance appraisal system is a hotspot of current research.In order to carry out the performance appraisal successfully in the multi-format group enterprises,it needs to solve the problems such as:high investment,long development time,not adapt to the enterprise,etc. Proceeding from the demand and background of the existing mobile officing,this paper used view technologies and push technology which is independent research and development, put forward and realized a system model based on collaboration OA system and supported HR performance appraisal,this paper also take out successful application test.This system allows the user to conduct efficient,lightweight and mobile performance appraisal anytime and anywhere.

Abstract: The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a multicast tree is the selection of the root of the shared tree or the core point. Therefore, the algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. The core selection function in this algorithm achieves a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance.

Abstract: As the computer science is developing rapidly, the search of technology of graphs has emerged in logic, linguistics, chemistry, electronics and some other fields of science. Especially with the rapid development of network technology as well as the appearance of parallel computer, parallel processing is brought into an unprecedented prosperity. And graphs traversal also starts playing a vital role. Breadth-first-search is a fundamental problem of graph theory as well as a heated problem. The parallelization of breadth-first-search has been a tough problem yet to be solved.

Abstract: Reverse Nearest Neighbour (RNN) queries play an important role in applications such as internet of vehicles, decision support systems, profile based marketing and so on. Recently, more attention has been paid to the problem of efficient distributed RNN computation in mobile cloud computing environment. A major downside of the existing RNN is its inherent sequential nature and using in-memory algorithm, which limits its applicability to massive data. In this paper, we propose a novel distributed caching based method to efficiently improve the performance of the RNN calculation in a distributed environment. Extensive experiments using both real and synthetic datasets demonstrated that our proposed methods are the state-of-the-art algorithms in scalable RNN queries.

Abstract: With the fast development of computer network services, the needs of every service is developing. To guarantee a effective computer network service we should improve the key quality of service (QoS) of each computer network service. Related QoS evaluating indexes mainly include throughput, delay time and packet loss of network. A optimizing method offers a theory support to a better computer network service quality and dynamic optimization is one of the most popular theoretical tools to study resource allocation and task scheduling problems in computer systems and computer networks. This text mainly introduces Markov decision process and Markov decision Petri nets.

Abstract: Redundant traffic is refers to the network between the two nodes of the same content repeated more than once. We can provide better user behavior analysis and personalized services for the net users by analyzing of the network packets into the application layer, analyzing of network resource location and the size of the volume of data accurately and researching the characteristics of the network redundancy flow which can provide references for the evolution of the network technology especially for the CNGI’s new standards and protocols.