The certification testing of method Strand space model is the most representative in the methods of theorem provingsecurity protocol analysis .Using the strand space model theory Analysis and design Formalization to the problem of intermediator attacks in n‐s public key protocol ,and prove it . Compared with the original technique ,The approach is more formal .Protocol analysis personnel can be very convenient formanual analysis ,and more conducive to the realization of protocol analysisautomation tools .

Consumers are faced with many complicated problems in fitting clothes in the Internet and the entity shop. By combining the things of internet with virtual reality technology, we collected the consumer information to construct a virtual scene and provided personalized shopping experience for consumers. It greatly stimulated consumer desire to buy and improved the transaction amount. Keywords: Things of Internet, Wireless Sensor, Virtual Reality Technology, Individual Experience, Customer Relationship Management, Radio Frequency Identification, Cloud Computing

合适的参数能够提高和声搜索算法的性能和收敛速度。详细介绍了和声搜索算法的流程,并总结了每个参数对算法的作用及参数变化对算法的影响。针对如何选取参数才能达到提高算法性能的目的,通过参数调整的方法,利用4个基准函数对算法进行仿真实验,实验结果表明,较高的HMCR、PAR和HMS取较小的值能使函数得到较优值。

There are a lot of EPC information in EPC Network, these information are sent to the upper progress after handled by Savant middleware. So how to improve the efficency is becoming the concern of researchers. This paper expatiated the architecture and the working principle of the Savant middleware and analyzed the process of Savant deal with the EPC information , Based on the formal model and analysis , a new method of Savant handle EPC based on FSP was presented. The superiority, safety and validity of the method was checked by LTSA tool.

The existing Forensics model already could not satisfy the need of the computer forensics.Key technology which can implement Forensics Model was studied in this paper.Honeypot forensics,IDS,Ontology technologies were combined effectively in order to obtain forensics data beforehand.A complete dynamic forensics system which can replay computer crime was designed.Non-repeated varying probability packet marking scheme was proposed.The paper proposed dynamic forensics model based on ontology and context information.The efficiency and accuracy of spam filtering are improved.

In this paper, we propose a hybrid shuffled frog-leaping algorithm (HSFLA) for solving the multi-objective flexible job shop scheduling problem. Three minimization objectives – the maximum completion time (makespan), the total workload of all machines, and the workload of the critical machine are considered simultaneously. In the proposed algorithm, several approaches are presented to construct the initial population with a high level of quality. Then each frog in the population is assigned to a corresponding memeplex according to the number of individuals who dominate it and then the number of frogs who are dominated by it. In the memetic evolution process, two crossover operators are presented to share information among the best frogs and the worst frog. Meanwhile, several local search methods are embedded in the algorithm to enhance the exploitation capability. Experimental results on the well-known benchmark instances and comparisons with other recently published algorithms show the efficiency and effectiveness of the proposed algorithm.

In this study, we propose a tabu search algorithm for solving the task scheduling problem in peer-to-peer networking system. The communication costs for given tasks are considered in the proposed algorithm. The operating sequences among tasks are also discussed, which make the problem more realistic. The objective is to minimize the completion time of all tasks. Experimental results on several random generated cases verified the efficiency and effectiveness of the proposed algorithm.

Solving difficulties in kernel technologies are the critical issue in developing Internet of things(IoT).The technologies related to IoT,such as RFID,wireless sensor network and semantic grid;as well as by margining multiple key technologies to solve difficult applicable problems are researched in focus.Semantic grid integrates the machine readable of semantic Web and powerful computing capability of grid technology;and semantic P2P technology solves the communication bottleneck due to information overload.These make the deployment of sensor nodes easier and the sensor network can be expandable.Information semantic interaction and sharing in IoT are implemented by adopting ontology technology;this makes proper and prompt understanding of the information in IoT.

The main problems existing in Internet of things(IoT) application field are analyzed,and the current safety status of IoT is pointed out.The features of security demand for IoT is analyzed,and the relevant solutions to various security problems are given.By adopting the ontology-based cross-domain authorization management model,the difficulty for authorization of different main subject is solved,and the security of the application field for IoTs is guaranteed.

This paper proposed an improved Tor system.It is not only guarantee the identity of sender but also guarantee the identity of receiver.According to the idea of Crowds and multicast,a novel system is proposed in the paper.

In this study, we propose a genetic algorithm for solving the job-shop scheduling problem with fuzzy makespan. The solution in the proposed algorithm is represented by a string of discrete values. The crossover and mutation operators are designed to make the proposed algorithm with high quality exploration and exploitation capability. Experimental results on several random generated cases verified the efficiency and effectiveness of the proposed algorithm.

The compression function is wildly used via many kinds of iterations in the construction of the modern hash function intended for use with standard digital signatures following the hash-and-sign mode. Some variants of second-preimage resistance(SPR)[1] assumptions of the keyless compression function, called c-SPR, r-SPR and e-SPR, have been put forth by Halevi and Krawczyk[2], in order to obtain higher security properties for the dedicated-key hash function by iteration. In this paper, we compare one variant, called c-SPR, with CRn (n', n) which has been raised by Mironov[3]. We give several different schemes of the dedicated-key compression functions firstly, the relations between c-SPR and CRn (n', n) differ in different schemes. In the second part of this paper, we provide a full picture of the relations between c-SPR and CRn (n', n), and give the additional restrictions that ensure c-SPR of the keyless compression function to be the necessary or sufficient conditions of CRn (n', n) of the dedicated-key compression function separately.

Some variants of second-preimage resistance(SPR) [1] assumptions of the keyless compression function, called c-SPR, r-SPR and e-SPR, have been put forth by Halevi and Krawczyk [2], in order to obtain more secure properties for the dedicated-key hash function. In this paper, we provide a full picture of the relation between r-SPR and other two security properties, Universal e-SPR and CR0 (n + b, n), and obtain two sufficient conditions of r-SPR, our contributions are twofold. Firstly, we extend the definition of the e-SPR property into the more general situation, called Universal e-SPR, we point out that for the keyless compression function, the Universal e-SPR property implies r-SPR. In the second part of this paper, we extend the analysis into the dedicated-key compression function, we point CRn (n + b, n) and CR0 (n + b, n) are c-SPR and r-SPR as for the keyless compression and hash functions. We continue analyze the dedicated-key compression family hk (c, m) = h(c, m ⊕ k) used by Bellare and Rogaway to construct TCR hash function via iterations on the SPR-like assumption [2], and get the conclusion that CR0 (n + b, n) in the case of hk (c, m) implies r-SPR of keyless compression function, that is, CR0 (n + b, n) is more secure than the r-SPR property for this specific scheme.

The formal specification and consistency verification of complex real-time component systems' behavior can efficiently improve the systems' reusability,correctness and reliability.This paper analyzed the timed behavior protocol and the other mainstream formal specification methods of real-time behavior used in academia and industry.Based on the analysis we gave the substitution theory and the consistency verification algorithm based on timed behavior protocol,which can support complex real-time component based systems' development.

In this paper, an effective artificial bee colony (ABC) algorithm is proposed for solving the flexible job shop scheduling problems. The total flow time criterion was considered. In the proposed algorithm, tabu search (TS) heuristic is introduced to perform local search for employed bee, onlookers, and scout bees. Meanwhile, an external Pareto archive set is employed to record enough non-dominated solutions for the problem considered. Experimental results on five well-known benchmarks show the efficiency of the proposed hybrid algorithm. It is concluded that the proposed algorithm is superior to the very recent algorithms in term of both search quality and computational efficiency.

Effective trust model on non-strcut Peer-to-Peer network is of benefit to enhance the safe performance and ministrant quality. A dynamic trust model is proposed in this paper.the model resolved mainly about the peer's online time has no regularity,and the problem that the peer supply good files is unstable,is a dynamic trust model based on the peer's online time and the true service ability,the value to the peer's online time is dynamic,the value to the peer's true service ability is also dynamic,the model proves that it could enhance the P2P network's safety features and service quality by simulation experiment.

Energy Consumption Interaction Automata (ECIA) is presented to model cyber-physical systems' interaction behavior and energy consumption constraint information. The component-interaction automata is an excellent model for specifying architecture and behavior information, but fails to depict energy consumption constraint information in cyber-physical systems. ECIA extends the description ability of component interaction automata by binding each action with an energy consumption interval. ECIA models of cyber-physical systems can be composed together based on the ECIA composition definition we presented in this paper. Applications of ECIA, such as specifying and verifying components' interaction properties in the design stage of developing component-based cyber-physical systems, are discussed. An example is given to demonstrate how ECIA can be used to analyze the energy-related properties of components' behavior in cyber-physical systems.

In recent years, there is a growing interest on the research and deployment of MANET (Mobile Ad Hoc Networks) technology for vehicular communication. Routing is crucial to the success of VANET (Vehicular Ad hoc Networks) applications, which is complicated by the fact that VANETs are highly mobile, and sometimes partitioned. Greedy forwarding is a primary and critical routing strategy for Vehicular Ad Hoc Networks. This paper proposed an analysis of the greedy forwarding routing protocol for Vehicular Ad Hoc Networks which is very important to improve the performance of greedy forwarding. And this paper is one beneficial and important component of the greedy forwarding routing protocol in Vehicular Ad Hoc Networks. Finally the analysis is validated by comparing simulation and analysis result.

In this paper, a hybrid Pareto-based harmony search (HS) algorithm was proposed for solving the bi-criteria flexible job shop scheduling problem (FJSP). The two objectives were considered concurrently, i.e., to minimize the maximal completion time and to minimize the total workload of all machines. The discrete harmony search (DHS) was developed, which combined detailed designed crossover and mutant operators to obtain both convergence capability and population diversity. An external Pareto archive with non-dominated sorting method was created to store the non-dominated solutions found so far, so that to obtain the near Pareto front solutions. Experimental results based on the two well-known benchmarks conclude that our hybrid algorithm is superior to the other most recently approaches in terms of both solution quality and computational complexity.

With introduction of ant colony algorithm idea,this paper constructed an ant colony algorithm and confidence in a combination of the node selection mechanism(AntTrust).This mechanism not only can increase the response rate in the early period,but also can increased download success rates after the trust is established.The mechanism is simulated on the query-cycle-simulator platform and the effectiveness of the mechanism is excellent.