Private Set Intersection （PSI） is an important solution for privacy information sharing. A fair multi-party PSI protocol based on cloud server was proposed for the unfairness caused by the existing protocols in which the parties involved do not have simultaneous access to the calculation results. Firstly， the storage of a sub-share of the private information in Garbled Bloom Filter （GBF） was accomplished by using hash mapping. Secondly， in order to avoid the leakage of the index value of each party’s set element during the interaction， combined with Oblivious Transfer （OT） technique， the share replacement of the stored information was realized. Finally， the bit-by-bit calculation was performed by the cloud server， and the results were returned to each party at the same time to ensure the fairness of each party’s access to the results. The correctness and security analysis of the protocol shows that the proposed protocol can achieve the fairness of the parties in obtaining the intersection results， and can resist the collusion of parties with the cloud server. The performance analysis shows that both of the computational complexity and the communication complexity of the proposed protocol are independent of the total number of elements contained in the set of participants. Under the same conditions， compared with Multi-party PSI protocol （MPSI）， practical multiparty maliciously-secure PSI protocol （PSImple） and Private Intersection Sum algorithm （PI-Sum）， the proposed protocol has less storage overhead， communication overhead and running time.

Aiming at the problems of precise parking， punctuality， comfort and energy consumption in the process of Automatic Train Operation （ATO）， an optimization method of ATO speed curve based on GAPSO （Genetic Algorithm and Particle Swarm Optimization） algorithm was proposed. Firstly， a multi-objective optimization model of train ATO operation was established， the train passing through the neutral zone with power cutoff and coasting was included in the control strategy， and the operation control strategy was analyzed. Secondly， Particle Swarm Optimization （PSO） algorithm was improved， the nonlinear dynamic inertia weight and the improved acceleration coefficient were adopted， and the genetic operator was integrated into it to form a brand-new GAPSO algorithm， and the superiority of GAPSO algorithm in global search and local search ability as well as convergence speed was verified. Finally， GAPSO algorithm was used to optimize the operating mode changing points， and a set of operating mode changing point speeds satisfying multi-objective optimization was obtained， thereby obtaining the optimal target speed curve. Simulation experimental results show that under the premise that the overall running time meets the requirements of punctuality， the optimization method can make the energy consumption reduced by 13.29%， the comfort increased by 26.62%， and the parking error reduced by 21.62%. Therefore， the optimized train target speed curve can meet the multi-objective requirements， and this method provides a feasible solution for train ATO multi-objective optimization.

Compressed sensing mainly contains random projection and reconstruction. Because of lower convergence speed of iterative shrinkage algorithm and the lacking of direction of traditional 2-dimensional wavelet transform， random projection was implemented by using Permute Discrete Cosine Transform （PDCT）， and the gradient projection was used for reconstruction. Based on the simplification of computation complexity， the transformation coefficients in the dual-tree complex wavelet domain were improved by iteration. Finally， the reconstructed image was obtained by the inverse transform. In the experiments， the reconstruction results of DT CWT （Dual-Tree Complex Wavelet Transform） and bi-orthogonal wavelet were compared with the same reconstruction algorithm， and the former is better than the latter in image detail and smoothness with higher Peak Signal-to-Noise Ratio （PSNR） of 1.5 dB. In the same sparse domain， gradient projection converges faster than iterative shrinkage algorithm. And in the same sparse domain and random projection， PDCT has a slightly higher PSNR than the structural random matrix.

To improve the speed of image reconstruction based on fan-beam Filtered Back Projection (FBP), a new optimized fast reconstruction method was proposed for polar back-projection algorithm. According to the symmetry feature of trigonometric function, the preprocessing projection datum were back-projected on the polar coordinates at the same time. During the back-projection data coordinate transformation, the computation of bilinear interpolation could be reduced by using the symmetry of the pixel position parameters. The experimental result shows that, compared with the traditional convolution back-projection algorithm, the speed of reconstruction can be improved more than eight times by the proposed method without sacrificing image quality. The new method is also applicable to 3D cone-beam reconstruction, and can be extended to multilayer spiral three-dimensional reconstruction.

The current disadvantages of Mobile Ad Hoc Network (MANET) test method include simple model, high cost and difficult duplicate. In this paper, a large-scale MANET hybrid emulation testing method based on NS2 (LHEN) was proposed to solve these problems. By making use of simulation function of NS2, the authors could complete encapsulation and decapsulation of real packets and virtual packets with Tap agent, thus they could achieve the communication between virtual environment and real environment through network objects and NS2 real-time scheduler. A real node movement could be emulated by controlling network wireless signal strength, and then a real network environment was established. Finally, the authors constructed a large scale MANET respectively for contrast experiments through method of hybrid emulation and simulation. The experimental results show that the performance is almost consistent and mean difference value is lower than 18.7%, which means LHEN is able to be applied in some indicators test and verification for a large scale MANET.

Software security measurement is critical to the development of software and improvement of software security. Based on the entropy and attack surface proposed by Manadhata et al. (MANADHATA P K, TAN K M C, MAXION R A, et al. An approach to measuring a system's attack surface, CMU-CS-07-146. Pittsburgh: Carnegie Mellon University, 2007; MANADHATA P K, WING J M. An attack surface metric. IEEE Transactions on Software Engineering, 2011, 37(3): 371-386), a method of software security measurement was used to assess the threat of the software's resources and provide the threat weight of these resources. Based on the threat weight, the attack surface metric was calculated for determining whether a software product is secure in design, or in what aspect the software product can be improved. The method is demonstrated in a case to show that, when using the method, the probable security threats can be found as early as possible to prevent from producing the software products that may have vulnerabilities, and the directions for the improvement of software security are pointed out clearly.

To solve the location-allocation problem of logistics network with respect to fast fashion products under a pre-sale strategy, a bi-level programming model capturing the behaviors of online retailers and customers was proposed to minimize a total cost arising in the service of the logistics network. Common interests of the online retailer and the customer were considered synthetically. According to the characteristics of proposed model, an interactive fuzzy algorithm was adopted to determine locations, allocations, service plans of warehouse and third-party logistics enterprises. A case study was conducted to validate the feasibility of the proposed model and algorithm. The results reveal that the central warehouse should be located in a place close to areas of dense demand and the online retailers should provide a small amount of third-party logistics enterprices for customer selection.

To solve the problem that video driver for C64X Digital Signal Processor (DSP) family can not be used in RAW capture mode, the authors designed a data interface between DM642 and the high definition sensor of Charge-Coupled Device (CCD), and analyzed and modified the video driver of standard format. After being optimized, the video driver could be used in RAW capture mode. Applications had been developed based on multilevel buffer management framework. At last, the capture speed achieves the minimum speed of 15 frame per second.

Concerning the power consumption of routers based on Network on Chip (NoC), the key factors that influence the router power consumption were studied on the systematic level, such as the number of virtual channels, the depth of buffer and the width of flit. A method of reducing power consumption was presented by incorporating various key factors of power consumption and making the virtual channels share the switch input port. And then a NoC-based router with low-power consumption was implemented. The experimental results show that the designed router has lower power consumption in comparison with the Alpha 21364 router and the IBM InfiniBand router.

An improved DV-Hop localization algorithm was proposed by analyzing the deficiencies of rang-free DV-Hop algorithm in terms of localization accuracy and coverage rate. It has been set that the beacon nodes information only within a limited number of hops could be received by the unknown nodes, and only through the collinearity inspection the effectiveness of beacon nodes could be verified, and the nodes with a number of three or more can take part in locating. The minimum mean square error criteria, normalized weighting and Total Least Squares (TLS) methods were used to locate the unknown nodes respectively. Then the located unknown nodes were upgraded to beacon nodes, with the initial positioning beacon nodes to locate other unknown nodes. The simulation results show that compared with the original algorithm and the existing improved algorithm, this improved algorithm has significantly improved the localization accuracy and the coverage rate.

To remedy the defects of the traditional sparse matrix construction algorithm in Low Density Parity Check (LDPC) code which is hard to be fulfilled or the obtained results are not satisfactory, a new parity-check matrix searching algorithm was proposed based on two-generation tree structure. This algorithm used the data of tree structure, and could more reasonably the skipping relations of the non-zero elements in the rows and lines of the sparse check matrix. Combined with Ant Colony Algorithm (ACA) which has advantages in path seeking, the proposed algorithm is simple and easy to realize. Furthermore, it is easy to apply the algorithm to the irregular code, when importing the outside information to the code.

Parameterization is the basic principle of 3D games modeling and the crucial technique in surface fitting. A new algorithm for mesh parameterization was proposed. Attach a convex boundary for non-convex mesh and then parameterize the interior vertices based on mean value coordinate method. This algorithm was applied to the modeling module of game engine, and the experimental results demonstrate the feasibility and efficiency of the method.

In allusion to the complex requirement of query, a new video retrieval model based on multimodal information fusion was brought forward in this paper. It included multi-models like text retrieval, image query, semantic features extraction, and used relational algebra expression to fuse these multimodal information. Experimental results demonstrate that our method could fully utilize the advantages of multimodal information fusion based on relational expression in video retrieval, and achieve good performance on complex semantic video retrieval.

Ad Hoc network has particular characteristics. In this paper, a new trust evaluation scheme based on clustering was proposed. Each node chooses one node that has the highest value as its cluster head. It is proven in theory and in experiment that this algorithm is more secure then other schemes for clustering based Ad Hoc networks.

Ad Hoc networks have attracted more and more attention recently due to its character of self-organization. However，this character brings big challenges to it in the field of security. Key management is one of most importance things in security service. A new distributed coloring-based clustering method was introduced. Based on it, a hybrid key management scheme using the TGDH algorithm was proposed. The good performance of this strategy was proved by theoretical analysis.