We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...

We prove a localized non blow-up theorem of the Beale–Kato–Majda type for solution 3D incompressible Euler equations.

In this paper we derive a criterion for the breakdown of classical solutions to the incompressible magnetohydrodynamic equations with zero viscosity and positive resistivity in R3. This result is analogous to the celebrated Beale-KatoMajda’s breakdown criterion for the inviscid Eluer equations of incompressible fluids. In R2 we establish global weak solutions to the magnetohydrodynamic equation...

We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances. The program is illustrated on the mean and variance. One encounters delayed Mellin transform equations, which we solve by inspection. Interestingly, th...

A comprehensive model evaluation has been conducted for MM5-CMAQ for the period of 1–10 July 1999 of the Southern Oxidants Study episode with a coarse-grid horizontal spacing of 32-km and a nested fine-grid spacing of 8-km. Meteorological and chemical predictions from simulations with both grids are compared with observations from both routine monitoring networks (e.g., CASTNet, IMPROVE, and AI...

The search for a simple, cheap, and reliable method of serum uric acid estimation has continued ever since the classic thread test of Garrod (1854); for many years Folin's phosphotungstic acid method and its numerous modifications have been employed (Folin, 1930; Brown, 1945; Caraway, 1955; Beale, 1954; Henry, Sobel, and Kim, 1957; Archibald, 1957). While the technique is easy, the method is ne...

The particle swarm optimization algorithm (PSO) is a widely used swarm-based natural inspired algorithm. However, it suffers search stagnation from being trapped into sub-optimal solution in an problem. This paper proposes novel hybrid (SDPSO) to improve its performance on local searches. merges two strategies, the static exploitation (SE, velocity updating strategy considering inertia-free vel...