A finite element method for stochastic dynamic programming is developed. The computational method is valid for a general class of optimal control problems that are nonlinear and perturbed by general Markov noise in continuous time, including jump Poisson noise. Stability and convergence of the method are verified and its storage utilization efficiency over the traditional finite difference meth...

In this paper, a calculation method for the tangential velocity solution of radar target based on linear vector is proposed. It makes full use advantage high precision radial measurement radar, and realizes accurate computation target. Based actual capability continuous wave (CW) accuracy analyzed. The feasibility analysis verified by simulation experiment measured data shooting range.

In FM algorithm initial partitioning matrix of the given circuit is assigned randomly, as a result for larger circuit having hundred or more nodes will take long time to arrive at the final partition if the initial partitioning matrix is close to the final partitioning then the computation time (iteration) required is small . Here we have proposed novel approach to arrive at initial partitionin...

Due to the significant communication overhead incurred in the presence of a rapidly updated stream, centralised approaches are becoming less realistic for large scale distributed processing, especially when complicated continuous queries such as window aggregation and joins between streams and relations are processed. This paper proposes techniques to evaluate stream queries in more generic dis...

The discrete-time epidemic model is investigated, which is obtained using the Euler method. It is verified that there exist some dynamical behaviors in this model, such as transcritical bifurcation, flip bifurcation, Hopf bifurcation, and chaos. The numerical simulations, including bifurcation diagrams and computation of Lyapunov exponents, not only show the consistence with the theoretical ana...

A stationary Markov chain model of the agent-based computation system EMAS is presented. The primary goal of the model is better understanding the behavior of this class of systems as well as their constraints. The ergodicity of this chain can be verified for the particular case of EMAS, thus implying an asymptotic guarantee of success (the ability of finding all solutions of the global optimiz...

We present a normalization-by-evaluation (NbE) algorithm for System F with βη-equality, the simplest impredicative type theory with computation on the type level. Values are kept abstract and requirements on values are kept to a minimum, allowing many different implementations of the algorithm. The algorithm is verified through a general model construction using typed applicative structures, ca...

We devise and analyze a simple numerical method for the approximation of large bending isometries. The discretization employs a discrete Kirchhoff triangle to deal with second order derivatives and convergence of discrete solutions to minimizers of the continuous formulation is proved. Unconditional stability and convergence of an iterative scheme for the computation of discrete minimizers that...

We present a normalization-by-evaluation (NbE) algorithm for System F with βη-equality, the simplest impredicative type theory with computation on the type level. Values are kept abstract and requirements on values are kept to a minimum, allowing many different implementations of the algorithm. The algorithm is verified through a general model construction using typed applicative structures, ca...

This research compares the author’s experience in programming algebra in Haskell and in Agda (currently the former experience is large, and the latter is small). There are discussed certain hopes and doubts related to the dependently typed and verified programming of symbolic computation. This concerns the 1) author’s experience history, 2) algebraic class hierarchy design, 3) proof cost overhe...