Applied Mechanics and Materials Vols. 380-384

Abstract: With the constant development of the information technology and the constant promotion of the military demand, The intellectual level of IETM which was an important technological means to the Armament Maintenance & Support Information will be one of the focal points studies of IETM project field in the future. The process data module which have very important function to the intelligence of IETM is the important data module to the human-computer interaction in IETM system. So, it will solves the problem of realizing the system of intellectual IETM from the angle of process data module. Through the theoretical research of the process data module and intellectual IETM correctly, This text propose the intellectual IETM system modeling on the basis of the process data module in order to establish the theoretical foundation for the research of intellectual IETM of our country.

Abstract: Query-oriented multi-document summarization (QMDS) attempts to generate a concise piece of text byextracting sentences from a target document collection, with the aim of not only conveying the key content of that corpus, also, satisfying the information needs expressed by that query. Due to its great applicable value, QMDS has been intensively studied in recent decades. Three properties are supposed crucial for a good summary, i.e., relevance, prestige and low redundancy (orso-called diversity). Unfortunately, most existing work either disregarded the concern of diversity, or handled it with non-optimized heuristics, usually based on greedy sentences election. Inspired by the manifold-ranking process, which deals with query-biased prestige, and DivRank algorithm which captures query-independent diversity ranking, in this paper, we propose a novel biased diversity ranking model, named ManifoldDivRank, for query-sensitive summarization tasks. The top-ranked sentences discovered by our algorithm not only enjoy query-oriented high prestige, more importantly, they are dissimilar with each other. Experimental results on DUC2005and DUC2006 benchmark data sets demonstrate the effectiveness of our proposal.

Abstract: Nowadays, the internet of things (IOT) has attracted the attention of the researchers. As a key technology of the Internet of Things, RFID (Radio Frequency Identification) has also attracted the interest of industry and academia. One of the most important issues for the applications of the IOT based on RFID is security. In order to promote the development of IOT based on RFID, first of all, we briefly introduce the IOT system components and work process based on RFID, and then we deeply analyze the security threats in the IOT based on RFID, by the means of these analysis we discuss the current countermeasures for the security threats of RFID. Aiming at the RFID system, the corresponding technologies are raised such as Tag killing, Tag sleeping and blocker Tag; and the authentication based on HASH is the main method aiming at the communication process.

Abstract: Emergency plan modeling is the foundation of the work for digitizing emergency plans. On the basis of analyzing the content and structure of the existing urban rail transit emergency plans, a formalization method for emergency plans based on ontology is put forward. The core terms of emergency plans are extracted and classified. The relationships between various concepts are concluded. Combined with related concepts of ontology five meta-words, the ontology model of emergency plans is constructed. The emergency plan system from a subway company is presented as a real world case to establish the semantic model, providing the feasibility of the method proposed.

Abstract: UWASNs are deployed in environments of sea and shallow water, which are composed of many nodes that communicate through acoustic wave. The preliminary problem in UWASNs different with on land WSNs is the severe demand of delay time constrain. It becomes a crucial problem that how to reduce unnecessary path that waste time. In this proposed paper, we present an energy efficient protocol with low delay time. Orient constraint factor is a constitute element of this proposed protocol, which instructs node how to select the next hop from neighbor nodes. The orient constrain factor is composed of the distances of source node, neighbor nodes and destination node (commonly pointed to sink node). Simulations show that this protocol can efficiently reduce the delay time and hold a high level of energy efficient.

Abstract: In order to solve the RFID authentication protocols, a new mutual authentication protocol based on Hash for the lightweight RFID system is proposed in this paper. Compared with several RFID authentication protocols with the similar structure, the proposed protocol can effectively solve the privacy and security of the RFID system, and it has significant performance advantages. It greatly reduces the amount storage and computation of tags.

Abstract: Bottom-up algorithm, which is one of the two probabilistic Top-k query algorithms, was improved. The core of the bottomup algorithm is the iteration on the three courses of bounding, pruning,and refining towards the objects and instances. The main contribution is to change the iteration on instances of objects one by one into iterating all the instances of objects from the superior to the inferior;and to transform the condition and sequence of pruning in order to make the pruning more effective. Theoretical analysis and experimental results show that the algorithm efficiency could be obviously increased by about 20%.

Abstract: This paper studies effective task scheduling problem in the process of grid computing. Generally, task scheduling in the process of grid computing can be realized in shorter time, which guarantees the efficiency of task scheduling in grid computing. Traditional algorithm can not fully consider the resources load balance in calculating task scheduling in grid computing, resulting in network resources idleness. Finally, it can't reasonably use network resources. In order to avoid the above defects, this paper proposes a task scheduling method in grid computing based on double fitness particle swarm optimization algorithm. In the process of grid computing, channel perception method is applied to forecast the amount of grid computing tasks in the channel so as to provide the basis for task scheduling in grid computing. Realize task scheduling in grid computing by the use of double fitness particle swarm optimization algorithm. Experimental results show that under the condition of larger tasks of grid computing, the performance of task scheduling in grid computing by using the algorithm presented in this paper is superior to the traditional particle swarm optimization algorithm and can get ideal task scheduling result.

Abstract: Aiming at the problems of guarantee equipment deficiency and poor versatility in airborne digital image transmission system, and adopting ATE design ideas, this paper presents a design scheme of integrated control and support platform based on VME bus architecture. With the technology of software radio and software function modules, the design realizes the universal support of multi-type digital image transmission system. Adopting the technology of virtual system, software designs which are hierarchical, modular and interface, it realizes the integrated control of test system. The practice has proved that this support platform has the advantage of stable operation, good versatility, strong practicality and broad application prospects.

Abstract: In order to improve the performance of the query optimization for the distribute database, an improved query optimization algorithm was proposed based on the genetic algorithm. The query execution cost model based on the genetic algorithm was proposed in this paper. The distributed database was emerged in the 70's of the last century and developed with the progress of the computer technology and network technology, the distributed database was the database system which is distributed storage dispersedly in physics and with centralized processing in mathematic logic. Because the storage points were not uniform, the structure of the distributed database is much more complicated than the centralized database. Both the genetic algorithm and the dynamic exhaustive planning algorithm were taken in the query simulation for the performance comparison. The result shows that the genetic query optimization method in this paper has better performance in the distributed database query application. The case study and the simulation result show that the algorithm can get a satisfactory optimization result in a few iterations and the query optimization algorithm based on the genetic method has nice performance of the query optimization property, and the consumption and costs of the query is reduced to the minimum. The method which this paper proposed has good application performance and is valuable to put into practice.