A Parallel Quantum Algorithm for the Satisfiability Problem

In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found.

Fuzzy adaptive genetic algorithm based on auto-regulating fuzzy rules

There are defects such as the low convergence rate and premature phenomenon on the performance of simple genetic algorithms （SGA） as the values of crossover probability （Pc） and mutation probability （Pro） are fixed. To solve the problems, the fuzzy control method and the genetic algorithms were systematically integrated to create a kind of improved fuzzy adaptive genetic algorithm （FAGA） based on the auto-regulating fuzzy rules （ARFR-FAGA）. By using the fuzzy control method, the values of Pc and Pm were adjusted according to the evolutional process, and the fuzzy rules were optimized by another genetic algorithm. Experimental results in solving the function optimization problems demonstrate that the convergence rate and solution quality of ARFR-FAGA exceed those of SGA, AGA and fuzzy adaptive genetic algorithm based on expertise （EFAGA） obviously in the global search.

Intelligent Machine Theory--A Key Approach to Initiate the Age of Designing Thinking Computers

The purpose of this paper is to introduce an unknown method for finding a real possible x value of any degree polynomial equation and to show how this can be applied to make computers which are at least x1000 （one thousand times） faster than today＇s existing highest speed computers. Since one of the Milennium Prize Problems offered by Claymath asks about whether P （Deterministic Polynomial） is equal to NP （Non-Deterministic Polynomial） （what that means informally is that whether we can design a computer which can quickly solve a certain complicated problem can also verify the solution quickly （and vice versa）. Fortunately, the answer to P vs. NP problem based on my findings in certain algebraic algorythms is yes although there have been many people who claimed the answer is no. What that means is that humans can make machines that work very fast and close to human intelligence in the identification of, say, certain proteins and amino acids, in case my theory is proven to be a fact. This paper is therefore an initial stage of planting the first seeds of the process, in terms of describing how exactly this can happen, theoretically of course, since everything in Science begins with a theory based on the outcome of a hypothesis.

Doppler shift based stable clustering scheme for mobile ad hoc networks

This paper addresses the clustering problem for mobile ad hoc networks. In the proposed scheme, Doppler shift associated with received signals is used to estimate the relative speed between aelnster head and its members. With the estimated speed, a node can predict its stay time in every nearby cluster. In the initial clustering stage, a node joins a duster that can provide it with the longest stay time in order to reduce the number of re-affiliations. In the cluster maintaining stage, strategies are designed to help node cope with connection break caused by channel fading and node mobility. Simulation results show that the proposed clustering scheme can reduce the number of re-affiliations and the average disconnection time compared with previous schemes.

Incorporate Energy Strategy into Particle Swarm Optimizer Algorithm

The issue of optimizing the dynamic parameters in Particle Swarm Optimizer (PSO) is addressed in this paper. An algorithm is designed which makes all particles originally endowed with a certain level energy, what here we define as EPSO (Energy Strategy PSO). During the iterative process of PSO algorithm, the Inertia Weight is updated according to the calculation of the particle's energy. The portion ratio of the current residual energy to the initial endowed energy is used as the parameter Inertia Weight which aims to update the particles' velocity efficiently. By the simulation in a graph theoritical and a functional optimization problem respectively, it could be easily found that the rate of convergence in EPSO is obviously increased.

Theoretical Considerations of Laminar Flame Speed as a Function of Initial Conditions and Basic Kinetic Properties with Respect to the Safety Problem

The Zeldovich-Frank-Kamenetskii solution for the flame velocity of a planar front with one-step overall chemical reaction was enhanced. The assumption that the consumption rate depends exclusively on a chemical component was removed. Instead, the reaction rate was considered to be dependent on all reactants of an overall reaction. The new formulation was applied to obtain the activation energy and the pre-exponential factor of a set of hydrogen-air mixtures.

一种耦合的主/次特征对提取神经网络算法

目前,基于神经网络的主成分分析算法大多属于非耦合算法,这类算法普遍存在着所谓的"速度—稳定"问题.近年来所提出的几个耦合算法较好地解决了该类算法存在的"速度—稳定"问题.然而,现有耦合算法还存在推导过程相对繁琐、计算复杂度高等问题.本文基于一种信息准则,通过牛顿方法并进行改进计算,导出了两种耦合学习算法,并运用Jacobian矩阵分析了算法收敛性.相比于现有的耦合算法,导出的两种算法计算更加快捷,并且不需要对逆Hessian矩阵进行估计.仿真实验验证了提出算法的良好性能.

Local Stability for an Inverse Coefficient Problem of a Fractional Diffusion Equation

Time-fractional diffusion equations are of great interest and importance on describing the power law decay for diffusion in porous media. In this paper, to identify the diffusion rate, i.e., the heterogeneity of medium, the authors consider an inverse coefficient problem utilizing finite measurements and obtain a local HSlder type conditional stability based upon two Carleman estimates for the corresponding differential equations of integer orders.

Speedup in adiabatic evolution based quantum algorithms

In this context,we study three different strategies to improve the time complexity of the widely used adiabatic evolution algorithms when solving a particular class of quantum search problems where both the initial and final Hamiltonians are one-dimensional projector Hamiltonians on the corresponding ground state.After some simple analysis,we find the time complexity improvement is always accompanied by the increase of some other "complexities" that should be considered.But this just gives the implication that more feasibilities can be achieved in adiabatic evolution based quantum algorithms over the circuit model,even though the equivalence between the two has been shown.In addition,we also give a rough comparison between these different models for the speedup of the problem.

Vehicle's fuel consumption of car-following models

Many car-following models with their own merits have been proposed to explore various traffic problems,but researchers have rarely used vehicle's performance to evaluate them.In this paper,we study each vehicle's fuel consumption of the optimal velocity model,full velocity difference model,full velocity and acceleration difference model and the car-following model with consideration of the traffic interruption probability under two traffic situations,respectively.The numerical results show that the car-following model with consideration of traffic interruption probability can reduce vehicle's fuel consumption in the two studied traffic situations and thus improve the vehicle's fuel economy.

Algebraic solution of differential geometric guidance command and time delay control

According to the three-dimensional geometry of the engagement,the explicit algebraic expression of differential geometric guidance command(DGGC)is proposed.Compared with the existing solutions,the algebraic solution is much simpler and better for the further research of the characteristics of DGGC.Time delay control(TDC)is a useful method to tackle the uncertainty problem of a control system.Based on TDC,taking the target maneuvering acceleration as a disturbance,the estimation algorithm of the target maneuvering acceleration is presented,which can be introduced in DGGC to improve its performance.Then,the augmented DGGC(ADGGC)is obtained.The numerical simulation of intercepting a high maneuvering target is conducted to demonstrate the effectiveness of ADGGC.

Reply to “Comment on ‘A numerical investigation of the acoustic mode waves in a deviated borehole penetrating a transversely isotropic formation' ”

We appreciate the comment from Horne,Miller and Wang on the paper‘A numerical investigation of the acoustic mode waves in a deviated borehole penetrating a transversely isotropic formation’by Liu et al.（2015）[1],for the opportunity to consider and clarify the group and phase velocity issue in sonic logging with a deviated borehole penetrating a VTI formation.We re-read the paper by Liu et al.[1]and did some numerical tests and analyses.

Low power and high write speed SEU tolerant SRAM data cell design

As feature size scales down, reliability issues like single event upset(SEU) have become serious for circuit and system designers, especially for those who work on memory and latch designs. In this paper, an improved SEU tolerant data cell design based on the Quatro-10 T cell is proposed. The introduced cell enhances the capability of SEU tolerance by weakening the key transistors in the feedback loop to block the effects of transient fault. Simulation results show that our proposed design achieves obvious higher resilience to SEU and better performance on speed and power dissipation at the expense of an increased area. The proposed cell is a fully SEU immune design with an amount of critical charge at least 7 times more than the Quatro-10 T cell and has the lowest Power Delay Product. It shows that our design is very suitable in high-performance circuit and system design.

Modeling and Simulation for Urban Rail Traffic Problem Based on Cellular Automata

Based on the Nagel-Schreckenberg model, we propose a new cellular automata model to simulate the urban rail traffic flow under moving block system and present a new minimum instantaneous distance formula under pure moving block. We also analyze the characteristics of the urban rail traffic flow under the influence of train density, station dwell times, the length of train, and the train velocity. Train delays can be decreased effectively through flexible departure intervals according to the preceding train type before its departure. The results demonstrate that a suitable adjustment of the current train velocity based on the following train velocity can greatly shorten the minimum departure intervals and then increase the capacity of rail transit.

Dynamic conducting crack propagation in piezoelectric materials:Mode-II problem

This paper studies the dynamic conducting crack propagation in piezoelectric solids under suddenly in-plane shear loading. Based on the integral transform methods and the Wiener-Hopf technique, the resulting mixed boundary value problem is solved. The analytical solutions of the dynamic stress intensity factor and dynamic electric displacement intensity factor for the Mode II case are derived. Furthermore, the numerical results are presented to illustrate the characteristics of the dynamic crack propagation. It is shown that the universal functions for the dynamic stress and electric displacement intensity factors vanish if the crack propagation speed equals the generalized Rayleigh speed. The results indicate that the defined electro-mechanical coupling coefficient is of great importance to the universal functions and stress intensity factor history.

A LINE SEARCH FILTER INEXACT SQP METHOD FOR NONLINEAR EQUALITY CONSTRAINED OPTIMIZATION

This paper proposes an inexact SQP method in association with line search filter technique for solving nonlinear equality constrained optimization. For large-scale applications, it is expensive to get an exact search direction, and hence the authors use an inexact method that finds an approximate solution satisfying some appropriate conditions. The global convergence of the proposed algorithm is established by using line search filter technique. The second-order correction step is used to overcome the Maratos effect, while the line search filter inexact SQP method has q-superlinear local convergence rate. Finally, the results of numerical experiments indicate that the proposed method is efficient for the given test problems.

A Dwindling Filter Algorithm with a Modified Subproblem for Nonlinear Inequality Constrained Optimization

The authors propose a dwindling filter algorithm with Zhou's modified subproblem for nonlinear inequality constrained optimization.The feasibility restoration phase,which is always used in the traditional filter method,is not needed.Under mild conditions,global convergence and local superlinear convergence rates are obtained.Numerical results demonstrate that the new algorithm is effective.

Peristaltic transport of pseudoplastic fluid in a curved channel with wall properties and slip conditions

Effects of wall properties and slip condition on the peristaltic flow of an incompressible pseudoplastic fluid in a curved channel are studied. Series solution of the governing problem is obtained after applying long wavelength and low Reynolds number approximations. The results are validated with the numerical solutions through the built-in routine for solving nonlinear boundary value problems via software Mathematica. The variations of different parameters on axial velocity are carefully analyzed. Behaviors of embedding parameters on the dimensionless stream function are also discussed. It is noted that the axial velocity and size of trapped bolus increases with an increase in slip parameter. It is also observed that the profiles of axial velocity are not symmetric about the central line of the curved channel which is different from the case of planar channel.

An effective description of a periodic one-dimensional hopping model

The periodic one-dimensional hopping model is useful for studying the motion of microscopic particles in the thermal noise environment. Based on the explicit formulations of mean velocity, mean first passage time and effective diffusion constant, a general N internal states or even infinite internal states model can be approximated by a one state model that retains the basic properties of the original process. This effective description aids the analysis of biochemical and biophysical problems. This effective description also implies that, to some extent, many processes can be well described by simple two-state models, or even one-state models.