A Note on Shor’s Quantum Algorithm

Introduction Factoring integers is generally thought to behard on a classical computer. But it is now heldthat prime factorization can be accomplished inpolynomial time on a quantum computer. This re-markable work is due to Shor[1]. For a given num-ber n, he gave a quantum computer algorithm forfinding the order r of an element x (mod n) insteadof giving a quantum computer algorithm for factor-ing n directly. The indirect algorithm is feasiblebecause factorization can be reduced to finding th…     

Geometrical design of blade＇s surface and boundary control of Navier-Stokes equations

In this article a new principle of geometric design for blade＇s surface of an impeller is provided. This is an optimal control problem for the boundary geometric shape of flow and the control variable is the surface of the blade. We give a minimal functional depending on the geometry of the blade＇s surface and such that the flow＇s loss achieves minimum. The existence of the solution of the optimal control problem is proved and the Euler-Lagrange equations for the surface of the blade are derived. In addition, under a new curvilinear coordinate system, the flow domain between the two blades becomes a fixed hexahedron, and the surface as a mapping from a bounded domain in R2 into R3 , is explicitly appearing in the objective functional. The Navier-Stokes equations, which include the mapping in their coefficients, can be computed by using operator splitting algorithm. Furthermore, derivatives of the solution of Navier- Stokes equations with respect to the mapping satisfy linearized Navier-Stokes equations which can be solved by using operator splitting algorithms too. Hence, a conjugate gradient method can be used to solve the optimal control problem.     

Adaptive Identification of Logging Lithology Based on VPSO-ENN Hybrid Algorithm

Particle swarm optimization (PSO) was modified by variation method of particle velocity, and a variation PSO (VPSO) algorithm was proposed to overcome the shortcomings of PSO, such as premature convergence and local optimization. The VPSO algorithm is combined with Elman neural network (ENN) to form a VPSO-ENN hybrid algorithm. Compared with the hybrid algorithm of genetic algorithm (GA) and BP neural network (GA-BP), VPSO-ENN has less adjustable parameters, faster convergence speed and higher identification precision in the numerical experiment. A system for identifying logging parameters was established based on VPSO-ENN. The results of an engineering case indicate that the intelligent identification system is effective in the lithology identification.     

Application of Grey Multi-hierarchy Decision to Evaluation of Stock Quality

In order to evaluate stock quality scientifically, a synthetic evaluation system of stock quality is proposed on the basis of fuzzy set theory and grey multi-hierarchy decision method. Then the evaluation system is applied to an example. The results show that the evaluation system can overcome the errors of expert＇s subjective judgment.     

Development of an Autonomous Flight Control System for Small Size Unmanned Helicopter Based on Dynamical Model

It is devoted to the development of an autonomous flight control system for small size unmanned helicopter based on dynamical model. At first, the mathematical model of a small size helicopter is described. After that simple but effective MTCV control algorithm was proposed. The whole flight control algorithm is composed of two parts: orientation controller based on the model for rotation dynamics and a robust position controller for a double integrator. The MTCV block is also used to achieve translation velocity control. To demonstrate the performance of the presented algorithm, simulation results and results achieved in real flight experiments were presented.     

Analysis of interaction factors between two piles

A rigorous analytical method is presented for calculating the interaction factor between two identical piles subjected to vertical loads. Following the technique proposed by Muki and Sternberg, the problem is decomposed into an extended soil mass and two fictitious piles characterized respectively by Young＇s modulus of the soil and that of the difference between the pile and soil. The unknown axial forces along fictitious piles are determined by solving a Fredholm integral equation of the second kind, which imposes the compatibility condition that the axial strains of the fictitious piles are equal to those corresponding to the centroidal axes of the extended soil. The real pile forces and displacements can subequally be calculated based on the determined fictitious pile forces, and finally, the validity of the proposed approach and desired pile interaction factors may be obtained. Results confirm the portray the influence of the governing parameters on the pile interaction.     

Delay Restoration of Single-Track Railway Rescheduling

On the basis of analysis of the principle of delay restoration in a disturbed schedule, a heuristic algorithm for rescheduling trains is developed by restoring the total delay of the disturbed schedule. A discrete event topologic model is derived from the original undisturbed train diagram and a back propagation analysis method is used to label the maximum buffer time of each point in the model. In order to analyze the principle of delay restoration, the concept of critical delay is developed from the labeled maximum buffer time. The critical delay is the critical point of successful delay restoration. All the disturbed trains are classified into the strong-delayed trains and the weak-delayed trains by the criterion of the critical delay. Only the latter, in which actual delay is less than its critical delay, can be adjusted to a normal running state during time horizon considered. The heuristic algorithm is used to restore all the disturbed trains according to their critical details. The cores of the algorithm are the iterative repair technique and two repair methods for the two kinds of trains. The algorithm searches iteratively the space of possible conflicts caused by disturbed trains using an earfiest-delay-first heuristics and always attempts to repair the earliest constraint violation. The algorithm adjusts the weak-delayed trains directly back to the normal running state using the buffer time of the original train diagram. For the strong-delayed trains,the algorithm uses an utility function with some weighted attributes to determine the dynamic priority of the trains, and resolves the conflict according to the calculated dynamic priority. In the end, the experimental results show that the algorithm produces ＂good enough＂ schedules effectively and efficiently in disturbed situations.     

Fault Detection Observer Design for LSFDJ： A Factorization Approach

Based on a new special co-inner-outer factorization, a factorization approach for design fault detection observer for LSFDJ was proposed. It is a simple state-space method and can deal with time varying LSFDJ with sensor noise and sensor faults. The performance of the fault detection observer is optimized in an H∞ setting,where the ratio between the gains from disturbance and fault to residual respectively is minimized. The design parameters of the detection observer were given in terms of the solution to the Riccati differential equation with jumps.     

Simplified Group Search Optimizer Algorithm for Large Scale Global Optimization

A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.     

An Image Retrieval Method Based on Color and Texture Features

The technique of image retrieval is widely used in science experiment, military affairs, public security,advertisement, family entertainment, library and so on. The existing algorithms are mostly based on the characteristics of color, texture, shape and space relationship. This paper introduced an image retrieval algorithm, which is based on the matching of weighted EMD(Earth Mover‘s Distance) distance and texture distance. EMD distance is the distance between the histograms of two images in HSV(Hue, Saturation, Value) color space, and texture distance is the L1 distance between the texture spectra of two images. The experimental results show that the retrieval rate can be increased obviously by using the proposed algorithm.     

Genome-wide profiling identifies Saccharomyces cerevisiae response in PKC-SLT2 signaling and glycogen metabolic pathways to antifungal compound calcofluor white

Fungal infection remains a major problem worldwide, yet treatment options are limited owing to the lack of effective drugs, the significant toxicity of available compounds, and the emergence of drug resistance. The low toxicity of calcofluor white （CFW） is an attractive antifungal compound for its known inhibitive effects on trichophyton rubrum and candida albicans growth. However, the efficacy of CFW is limited in most cases. In order to search for effective means to improve its efficacy, using saccharomyces cerevisiae as a model, we have used microarrays to examine the cell＇s response when treated with CFW on the genome scale. We found that both the PKC-SLT2 （i.e, protein kinase C-mitogen activated protein kinase） and the glycogen metabolic pathways are activated upon CFW treatment. These results suggest that the key components in these pathways could be targeted by other drugs to counter the cell＇s compensative response, thus to further substantiate the inhibitive effect of CFW on fungal growth, which may lead to treatment regimens with improved efficacy of this compound in clinical applications.     

THE PARALLEL RECURSIVE AP ADAPTIVE ALGORITHM BASED ON VOLTERRA SERIES

Aiming at the nonlinear system identification problem, a parallel recursive affine projection （AP） adaptive algorithm for the nonlinear system based on Volterra series is presented in this paper. The algorithm identifies in parallel the Volterra kernel of each order, recursively estimate the inverse of the autocorrelation matrix for the Volterra input of each order, and remarkably improve the convergence speed of the identification process compared with the NLMS and conventional AP adaptive algorithm based on Volterra ,series. Simulation results indicate that the proposed method in this paper is efficient.     

Weak Isomorphism of Finite Group

On the basis of the quasi-isomorphism of finite groups, a new mapping, weak isomorphism, from a finite group to another finite group is defined. Let G and H be two finite groups and G be weak-isomorphic to H. Then G≌H if G satisfies one of the following conditions. 1） G is a finite Abelian group. 2） The order of G is p^3. 3 ） The order of G is p^n＋1 and G has a cyclic normal subgroup N = 〈a〉 of order p^n. 4） G is a nilpotent group and if p^││G│, then for any P ∈ Sylp （G）, P has a cyclic maximal subgroup, where p is a prime; 5） G is a maximal class group of order p4（p〉3）.     

DESIGN OF A DIGITAL SIGNATURE SCHEME BASED ON FACTORING AND DISCRETE LOGARITHMS

Objective Focusing on the security problem of authentication and confidentiality in the context of computer networks, a digital signature scheme was proposed based on the public key cryptosystem. Methods Firstly,the course of digital signature based on the public key cryptosystem was given. Then, RSA and ELGamal schemes were described respectively. They were the basis of the proposed scheme. Generalized ELGamal type signature schemes were listed. After comparing with each other, one scheme, whose Signature equation was (m r)x=j s modФ(p) , was adopted in the designing. Results Based on two well-known cryptographic assumptions, the factorization and the discrete logarithms, a digital signature scheme was presented. It must be required that s“ was not equal to p‘q“ in the signing procedure, because attackers could forge the signatures with high probabilities if the discrete logarithms modulo a large prime were solvable. The variable public key “e“ is used instead of the invariable parameter “3“ in Ham‘s signature scheme to enhance the security. One generalized ELGamal type scheme made the proposed scheme escape one multiplicative inverse operation in the signing procedure and one modular exponentiation in the verification procedure.Conclusion The presented scheme obtains the security that Harn‘s scheme was originally claimed. It is secure if the factorization and the discrete logarithms are simultaneously unsolvable.     

Research on an Algorithm of Shape from Shading

Shape from shading(SFS)is an important domain in computer vision. The paper presented an improved algorithm of shape from shading based on a single image according to an existed one. The presented algorithm enhanced the boundary constraints to eliminate the rotation distortion on the border of reconstructed object and introduced the factor of brightness error to weaken the influence irradiance equation‘s nonlinearity on reconstructed errors. The reconstructed results verify the performance improvement in terms of accuracy by the input image of a synthetic image and a real image of weld.     

An Experimental Comparative Study on Three Classification Algorithms

Classification algorithm is orc of the key techniques to affect text automatic classification system‘s performance, play an important role in automatic classification research area. This paper comparatively analyzed kNN. VSM and hybrid classification algorithm presented by our research group. Some 2000 pieces of Internet news provided by ChinalnfoBank are used in the experiment. The result shows that the hybrid algorithm‘s performance presented by the groups is superior to the other two allzorithms.     

Optimization of PERT Network and Compression of Time

In the traditional methods of program evaluation and review technique （PERT） network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not considered as well as its time risk. The authors of this paper use the theory of dependent-chance programming to establish a new model about compression of time for project and multi-objective network optimization, which can overcome the shortages of traditional methods and realize the optimization of PERT network directly. By calculating an example with genetic algorithms, the following conclusions are drawn： （ 1 ） compression of time is restricted by cost ratio and completion probability of project; （2） activities with maximal standard difference of duration and minimal cost will be compressed in order of precedence; （3） there is no optimal solutions but noninferior solutions between chance and cost, and the most optimal node time depends on decision-maker＇s preference.     

Phase Behaviors in Bi-phase Simulation of Powder Segregation in Metal Injection Molding

Powder segregation induced by mold filling is an important phenomenon that affects the final quality of metal injection molding （MIM）. The prediction of segregation in MIM requires a bi-phase flow model to describe distinctly the flows of metallic powder and polymer binder. Viscous behaviors for the flows of each phase should hence be determined. The coefficient of interaction between the flows of two phases should also be evaluated. However, only viscosity of the mixed feedstock is measurable by capillary tests. Wall sticking is supposed in the traditional model for capillary tests, while the wall slip is important to be taken into account in MIM injection. Objective of the present paper is to introduce the slip effect in bi-phase simulation, and search the suitable way to determine the viscous behaviors for each phase with the consideration of wall slip in capillary tests. Analytical and numerical methods were proposed to realize such a specific purpose. The proposed method is based on the mass conservation between the capillary flows in mono-phase model for the mixed feedstock and in bi-phase model for the flows of two phases. Examples of the bi-phase simulation in MIM were realized with the software developed by research team. The results show evident segregation, which is valuable for improving the mould designs.     

Dynamic model of underwater snake-like robot using Kane’s method

In this paper, a dynamic model for an underwater snake-like robot is developed based on Kane＇s dynamic equations. This methodology allows construction of the dynamic model simply and incrementally. The partial velocity is deduced. The forces which contribute to dynamics are determined by Kane＇s approach. The generalized active forces and the generalized inertia forces are deduced. The model developed in this paper includes inertia force, inertia moment, gravity, control torques, and three major hydrodynamic forces： added mass, profile drag and buoyancy. The equations of hydrodynamic forces are deduced. Kane＇s method provides a direct approach for incorporating external environmental forces into the model. The dynamic model developed in this paper is obtained in a closed form which is well suited for control purposes. It is also computationally efficient and has physical insight into what forces really influence the system dynamics. The simulation result shows that the proposed method is feasible.     

Real-Time Method for Detecting Harmonic and Reactive Currents of Single-Phase Circuits

According to the characteristics of single-phase circuits and demand of using active filter for real-time detecting harmonic and reactive currents, a detecting method based on Fryze＇s power definition is proposed. The results of theoretical analysis and simula- tion show that the proposed method is effective in realtime detecting of instantaneous harmonic and reactive currents in single-phase circuits. When only detecting the total reactive currents, this method does not need a phase-locked loop circuit, and it also can be used in some special applications to provide different compensations on the ground of different requirements of electric network. Compared with the other methods based on the theory of instantaneous reactive power, this method is simple and easy to realize.