The rapid development of quantum technology and the continuous improvement of quantum computing efficiency， especially the emergence of Shor algorithm and Grover algorithm， greatly threaten the security of traditional public key cipher and symmetric cipher. The block cipher PFP algorithm designed based on Feistel structure was analyzed. First， the linear transformation P of the round function was fused into the periodic functions in the Feistel structure， then four 5-round periodic functions of PFP were obtained， two rounds more than periodic functions in general Feistel structure， which was verified through experiments. Furthermore， by using quantum Grover and Simon algorithms， with a 5-round periodic function as the distinguisher， the security of 9， 10-round PFP was evaluated by analyzing the characteristics of PFP key arrangement algorithm. The time complexity required for key recovery is 2²⁶， 2^38.5， the quantum resource required is 193， 212 qubits， and the 58， 77 bits key can be restored， which are superior to the existing impossible differential analysis results.

As Radio Frequency IDentification （RFID） technology and wireless sensors become increasingly common， the need of secure data transmitted and processed by such devices with limited resources leads to the emergence and growth of lightweight ciphers. Characterized by their small key sizes and limited number of encryption rounds， precise security evaluation of lightweight ciphers is needed before putting into service. The differential and linear characteristics of full-round Shadow algorithm were analyzed for lightweight ciphers’ security requirements. Firstly， a concept of second difference was proposed to describe the differential characteristic more clearly， the existence of a full-round differential characteristic with probability 1 in the algorithm was proved， and the correctness of differential characteristic was verified through experiments. Secondly， a full-round linear characteristic was provided. It was proved that with giving a set of Shadow-32 （or Shadow-64） plain ciphertexts， it is possible to obtain 8 （or 16） bits of key information， and its correctness was experimentally verified. Thirdly， based on the linear equation relationship between plaintexts， ciphertexts and round keys， the number of equations and independent variables of the quadratic Boolean function were estimated. After that， the computational complexity of solving the initial key was calculated to be {\mathrm{2}}^{\mathrm{63.4}} . Finally， the structural features of Shadow algorithm were summarized， and the focus of future research was provided. Besides， differential and linear characteristic analysis of full-round Shadow algorithm provides preference for the differential and linear analysis of other lightweight ciphers.

Aiming at the problem of neglecting some narrow roads due to the formation constraints in the multi-UAV （Unmanned Aerial Vehicle） cooperative trajectory planning, a Fast Particle Swarm Optimization method based on Adaptive Distributed Model Predictive Control (ADMPC-FPSO) was proposed. In the method, the formation strategy combining leader-follower method and virtual structure method was used to construct adaptive virtual formation guidance points to complete the cooperative formation control task. According to the idea of model predictive control, combined with the distributed control method, the cooperative trajectory planning was transformed into a rolling online optimization problem, and the minimum distance and other performance indicators were used as cost functions. By designing the evaluation function criterion, the variable weight fast particle swarm optimization algorithm was used to solve the problem. The simulation results show that the proposed algorithm can effectively realize the multi-UAV cooperative trajectory planning, can quickly complete the adaptive formation transformation according to the environmental changes, and has lower cost than the traditional formation strategy.

Dynamic geometry software is widely applied to geometric constraint constructions because it is dynamic and intuitive. Aiming at a problem that the data structures in the field of dynamic geometry lack reusable abstract descriptions,a design method of the dynamic geometric software domain model was proposed. Firstly,the basic context boundaries were identified and outlined by means of domain analysis. Then,a dynamic geometry software core domain model was designed through the domain model. Finally,the dynamic geometry software was decoupled in both vertical and horizontal dimensions during the architecture modeling process. Experimental results show that the dynamic geometry software developed by using the design method of the proposed domain model can correctly deal with the graphic degradation situation at a critical position. The domain knowledge expressed by the model is applicable to 2D and 3D dynamic geometry software at the same time,and can design the layout and interaction for different devices respectively,thus a high-level reuse of the domain knowledge is achieved.

By the combination of fuzzy particle swarm optimization algorithm based on receding horizon control and improved artificial potential field, an on-line path planning method for achieving fixed-wing Unmanned Aerial Vehicle (UAV) path planning in uncertain environment was proposed. Firstly, the minimum circumscribed circle fitting was performed on the convex polygonal obstacles. Then, aiming at the static obstacles, the path planning problem was transformed into a series of on-line sub-problems in the time domain window, and the fuzzy particle swarm algorithm was applied to optimize and solve the sub-problems in real time, realizing the static obstacle avoidance. When there were dynamic obstacles in the environment, the improved artificial potential field was used to accomplish the dynamic obstacle avoidance by adjusting the path. In order to meet the dynamic constraints of fixed-wing UAV, a collision detection method for fixed-wing UAV was proposed to judge whether the obstacles were real threat sources or not in advance and reduce the flight cost by decreasing the turning frequency and range. The simulation results show that, the proposed method can effectively improve the planning speed, stability and real-time obstacle avoidance ability of fixed-wing UAV path planning, and it overcomes the shortcoming of easy to falling into local optimum in traditional artificial potential field method.

Focusing on the causality problem of conjunctive queries with inequalities in databases, the resilience computation was introduced and implemented. In order to reduce the computational time complexity in path conjunctive queries with inequalities, a Dynamic Programming for Resilience (DPResi) algorithm was proposed. Firstly, according to the properties of path conjunctive queries with inequalities and the max-flow Min-Cut theorem, the Min-Cut algorithm with polynomial time complexity was implemented. Then by compiling the lineage expression of a Boolean conjunctive query with inequality into a lineage graph, the problem of resilience was transformed into the computation of the shortest distance in lineage graph. Combining inclusion property with optimal substructure of the lineage graph, DPResi algorithm with linear time complexity was implemented by applying the idea of dynamic programming. Extensive experiments were carried out on the TPC-H datasets. The experimental results show that DPResi algorithm greatly improves the efficiency of resilience computation and has good scalability compared with Min-Cut algorithm.

The robustness of a trading model means that the model's profitability curve is less volatile and does not fluctuate significantly. To solve the problem of robustness of an algorithmic trading model based on Support Vector Regression (SVR), several strategies to derive a unified trading model and a portfolio diversification method were proposed. Firstly, the algorithm trade model based on SVR was introduced. Then, based on the commonly used indicators, a number of derived indicators were constructed for short term forecasting of stock prices. The typical patterns of recent price movements, overbought/oversold market conditions, and divergence of market conditions were characterized by these indicators. These indicators were normalized and used to train the trading model so that the model can be generalized to different stocks. Finally, a portfolio diversification method was designed. In the portfolio, the correlation between various stocks, sometimes leads to great investment losses; because the price of the stock with strong correlation changes in the same direction. If the trading model doesn't predict the price trend correctly, then stop loss will be triggered, and these stocks will cause loss in a mutual accelerated manner. Stocks were clustered into different categories according to the similarity, and a diversified portfolio was formed by selecting a number of stocks from different clustered categories. The similarity of stocks, was defined as the similarity of the recent profit curves on different stocks by trading models.Experiments were carried out on the data of 900 stocks for 10 years. The experimental results show that the transaction model can obtain excess profit rate over time deposit, and the annualized profit rate is 8.06%. The maximum drawdown of the trading model was reduced from 13.23% to 5.32%, and the Sharp ratio increased from 81.23% to 88.79%. The volatility of the profit margin curve of the trading model decreased, which means that the robustness of the trading model was improved.

Since the efficiency of rule mining and validity of recommendation are not high in personalized friends recommendation based on association rules, an improved association rule algorithm based on bitmap and hashing, namely BHA, was proposed. The mining time of frequent 2-itemsets was decreased by introducing hashing technique in this algorithm, and the irrelevant candidates were compressed to decrease the traversal of data by using bitmap and relevant properties. In addition, on the basis of BHA, a friend recommendation algorithm named STA was proposed based on similarity and trust. The problem of no displayed trust relationship in microblog was resolved effectively through trust defined by similarity of out-degree and in-degree; meanwhile, the defect of the similarity recommendation without considering users' hierarchy distance was remedied. Experiments were conducted on the user data of Sina microblog. In the comparison experiment of digging efficiency, the average minging time of BHA was only 47% of the modified AprioriTid; in the comparison experiment of availability in friend recommendation with SNFRBOAR (Social Network Friends Recommendation algorithm Based On Association Rules), the precision and recall of BHA were increased by 15.2% and 9.8% respectively. The theoretical analysis and simulation results show that STA can effectively decrease average time of mining rules, and improve the validity of friend recommendation.

It is difficult for entity search and question answering over text corpora to join cues from multiple documents to process relationship-centric search tasks, although structured querying over knowledge base can resolve such problem, but it still suffers from poor recall because of the heterogeneity and incompleteness of knowledge base. To address these problems, the knowledge graph was extended with information from textual corpora and a corresponding triple pattern with textual phrases was designed for uniform query of knowledge graph and textual corpora. Accordingly, a model for automatic query relaxation and scoring query answers (tuples of entities) was proposed, and an efficient top- k query processing strategy was put forward. Comparison experiments were conducted with two classical methods on three different benchmarks including entity search, entity-relationship search and complex entity-relationship queries using a combination of the Yago knowledge graph and the entity-annotated ClueWeb '09 corpus. The experimental results show that the entity-relationship search system with query relaxation over extended knowledge base outperforms the comparison systems with a big margin, the Mean Average Precision (MAP) are improved by more than 27%, 37%, 64% respectively on the three benchmarks.

A big data benchmark is needed eagerly by customers, industry and academia, to evaluate big data systems, improve current techniques and develop new techniques. A number of prominent works in last several years were reviewed. Their characteristics were introduced and the shortcomings were analyzed. Based on that, some suggestions on building a new big data benchmark are provided, including: 1) component based benchmarks as well as end-to-end benchmarks should be used in combination to test different tools inside the system and test the system as a whole, while component benchmarks are ingredients of the whole big data benchmark suite; 2) workloads should be enriched with complex analytics to encompass different application requirements, besides SQL queries; 3) other than performance metrics (response time and throughput), some other metrics should also be considered, including scalability, fault tolerance, energy saving and security.

Aiming at the problem that the traditional wavelet transform, curverlet transform and contourlet transform are unable to provide the optimal sparse representation of image and can not obtain the better enhancement effect, an image enhancement algorithm based on Shearlet transform was proposed. The image was decomposed into low frequency components and high frequency components by Shearlet transform. Firstly, Multi-Scale Retinex (MSR) was used to enhance the low frequency components of Shearlet decomposition to remove the effect of illumination on image; secondly, the threshold denoising was used to suppress noise at high frequency coefficients of each scale. Finally, the fuzzy contrast enhancement method was used to the reconstruction image to improve the overall contrast of image. The experimental results show that proposed algorithm can significantly improve the image visual effect, and it has more image texture details and anti-noise capabilities. The image definition, the entropy and the Peak Signal-to-Noise Ratio (PSNR) are improved to a certain extent compared with the Histogram Equalization (HE), MSR and Fuzzy contrast enhancement in Non-Subsampled Contourlet Domain (NSCT_fuzzy) algorithms. The operation time reduces to about one half of MSR and one tenth of NSCT_fuzzy.

A Multi-Start Tabu Search (MSTS) algorithm was proposed for the maximum cut problem to improve the solution quality. The proposed algorithm included two key components, one of which was tabu search used to identify high-quality local optimal solutions and the other of which was the multi-start strategy used for the global exploration. Firstly, a local optimum solution was acquired by tabu search component. Secondly, new starting solution was produced by multi-start strategy and then tabu search procedure was restarted. Based on the random greediness, the proposed multi-start strategy integrated the constructive and perturbation methods to produce new starting solutions, thus escaping from being trapped in local optimum and finding higher quality solutions. Experiments on 21 standard maximum cut benchmark instances and comparisons with several state-of-the-art algorithms show that 18 best solutions was obtained by MSTS, higher than compared algorithms. The experimental results indicate that the proposed algorithm outperforms the reference algorithms in terms of the solution quality.

In order to understand and explain the transmission mechanism, based on propagation behavior and topology structure characteristics of enterprise marketing network and Susceptible-Infected-Removed (SIR) model, the paper introduced the indexes of node transmission rate and edge weight, and then established transmission dynamics model of enterprise marketing network. The enterprise marketing network epidemic threshold was analyzed and simulated. The results indicate that the bigger the indexes of node transmission rate and the edge weight are, the smaller the propagation threshold is, which is more helpful for product and product information transmission. Finally, the authors put forward a few suggestions from the perspectives of reducing the spread of critical value and improving actual propagation rate.

The technology of Digital Time-Stamping (DTS) is widely used in digital signature, electronic commerce and patents and property right protection of various software and hardware. For some unreliable networks, of which the network situation is poor, the net speed changes greatly and the net links are usually intermittent, there is no necessary technological means to guarantee the normal and effective operation of DTS service. According to the characteristics of the unreliable networks, a new time-stamping scheme was proposed. In the scheme, it did not need to communicate with Time Stamp Authority (TSA) each time when a time-stamping service was required. The local trusted platform would offer the time-stamping service itself. A new DTS service protocol based on Trusted Platform Module (TPM) was also proposed under the circumstances of unreliable networks. The results of the security analysis of the protocol show that the protocol is secure and the time error in the protocol can be kept under control. The adaptability of the protocol for the unreliable network is excellent.

For enhancing the usability of the authentication and evaluation protocol for mobile terminal trusted network access and reducing the overload of network communication and terminal calculation, a lightweight authentication and evaluation protocol was proposed. Depending on the authentication shared key and platform configuration information at the first access time, the both parties of communication could complete quick authentication and evaluation without trusted third party. The proposed protocol reduced the times of data switch and computing task, it not only ensured the security attributes of authentication and integrity verification, but also enhanced the privacy of platform configuring information and the ability of avoiding replay attack. The security and performance analysis shows that the proposed protocol adapts to mobile trusted access for wireless network.