摘要：Traditional parafoil homing usually uses a point as object. As the mobility of parafoil is limited by its glide ratio and wind, in some cases when the parafoil scatter area is large, or the glide ratio of parafoil is small, the deviation of its landing point to object point will be arduous to control. Accordingly, during these situations, when parafoil is used in recovery of spacecraft or satellite, the landing area of parafoil can be set as a rectangle, and the object of parafoil can be set as a line segment. The thesis of this work is designing an algorithm for parafoil homing using line segment as object. The algorithm of wind velocity and direction calculation in different flying segments was also investigated. The algorithm designed navigates the parafoil to land into the predestined area and largely reduce the probability of recovery loads falling to unwanted area to damage houses and people.

摘要：In recent years, rapid developments of quantum computer are witnessed in both the hardware and the algorithm domains, making it necessary to have an updated review of some major techniques and applications in quantum algorithm *** this survey as well as tutorial article, the authors ?rst present an overview of the development of quantum algorithms, then investigate ?ve important techniques: Quantum phase estimation, linear combination of unitaries, quantum linear solver, Grover search, and quantum walk, together with their applications in quantum state preparation, quantum machine learning, and quantum search. In the end, the authors collect some open problems in?uencing the development of future quantum algorithms.

摘要：In the imaging observation system, imaging task scheduling is an important topic. Most scholars study the imaging task scheduling from the perspective of static priority, and only a few from the perspective of dynamic priority. However,the priority of the imaging task is dynamic in actual engineering. To supplement the research on imaging observation, this paper proposes the task priority model, dynamic scheduling strategy and Heuristic algorithm. At first, this paper analyzes the relevant theoretical basis of imaging observation, decomposes the task priority into four parts, including target priority, imaging task priority, track, telemetry & control(TT&C)requirement priority and data transmission requirement priority, summarizes the attribute factors that affect the above four types of priority in detail, and designs the corresponding priority model. Then, this paper takes the emergency tasks scheduling problem as the background, proposes the dynamic scheduling strategy and heuristic algorithm. Finally, the task priority model,dynamic scheduling strategy and heuristic algorithm are verified by experiments.

摘要：This study concerns with the design optimization of steel skeletal structures thereby utilizing both a real-life specification provisions and ready steel profiles named hot-rolled I sections. For this purpose, the enhanced genetic algorithm methodology named EGAwMP is utilized as an optimization tool. The evolutionary search mechanism of EGAwMP is constituted on the basis of generational genetic algorithm (GGA). The exploration capacity of EGAwMP is improved in a way of dividing an entire population into sub-populations and using of a radial basis neural network for dynamically adjustment of EGAwMP’s genetic operator parameters. In order to improve the exploitation capability of EGAwMP, the proposed neural network implementation is also utilized for prediction of more accurate design variables associating with a new design strategy, design codes of which are based on the provisions of LRFD_AISC V3 specification. EGAwMP is applied to determine the real-life ready steel profiles for the optimal design of skeletal structures with 105, 200, 444, and 942 members. EGAwMP accomplishes to increase the quality degrees of optimum designations Furthermore, the importance of using the real-life steel profiles and design codes is also demonstrated. Consequently, EGAwMP is suggested as a design optimization tool for the real-life steel skeletal structures.

摘要：ＡＮＥＷＧＥＮＥＲＡＬＩＺＥＤＧＲＡＤＩＥＮＴＰＲＯＪＥＣＴＩＯＮＴＹＰＥＡＬＧＯＲＩＴＨＭＦＯＲＬＩＮＥＡＲＬＹＣＯＮＳＴＲＡＩＮＥＤＰＲＯＢＬＥＭＳＺＥＮＧＱＩＮＧＧＵＡＮＧＡｂｓｔｒａｃｔ．Ｉｎｔｈｉｓｐａｐｅｒ，ｗｅｐｒｏｖｉｄｅａｎｅｗｇ...

摘要：A computing model employing the immune and genetic algorithm (IGA) for the optimization of part design is presented. This model operates on a population of points in search space simultaneously, not on just one point. It uses the objective function itself, not derivative or any other additional information and guarantees the fast convergence toward the global optimum. This method avoids some weak points in genetic algorithm, such as inefficient to some local searching problems and its convergence is too early. Based on this model, an optimal design support system (IGBODS) is *** has been used in practice and the result shows that this model has great advantage than traditional one and promises good application in optimal design.

摘要：A geometric algorithm for Tilted-Camera Perspective（TCP）projec-tion is proposed in this paper based on the principle of perspective ***-cording to that,the difference between TCP projection and External Perspective（EXP）projection is *** is put forward prerequisites making these twoprojections were compatible,and some examples are given.

摘要：In this paper, the topological pressure is preserved under some semi conjugates, and a formula of computing topological pressure by use of periodic points for positively expansive continuous map with specification is given.

摘要：Based on the brief introduction of the principles of wavelet analysis, this paper gives a summary of several typical wavelet bases from the point of view of perfect reconstruction of signals and emphasizes that designing wavelet bases which are used to decompose the signal into a two-band form is equivalent to designing a two-band filter bank with perfect or nearly perfect property. The generating algorithm corresponding to Daubechies bases and some simulated results are also given in the paper.

摘要：Differential evolution (DE) algorithm has been shown to be a simple and efficient evolutionary algorithm for global optimization over continuous spaces, and has been widely used in both benchmark test functions and real-world applications. This paper introduces a novel mutation operator, without using the scaling factor F, a conventional control parameter, and this mutation can generate multiple trial vectors by incorporating different weighted values at each generation, which can make the best of the selected multiple parents to improve the probability of generating a better offspring. In addition, in order to enhance the capacity of adaptation, a new and adaptive control parameter, i.e. the crossover rate CR, is presented and when one variable is beyond its boundary, a repair rule is also applied in this paper. The proposed algorithm ADE is validated on several constrained engineering design optimization problems reported in the specialized literature. Compared with respect to algorithms representative of the state-of-the-art in the area, the experimental results show that ADE can obtain good solutions on a test set of constrained optimization problems in engineering design.