Adaptive Simulated Annealing (ASA) is a C-language code that finds the best global fit of a nonlinear cost-function over a D-dimensional space. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems. These many OPTIONS help ensure that ASA can be used robustly across many classes of systems. Ke ywords: simulated annealing, nonlinear systems Most rece...

Prediction of image sequences is widely used inimage processing and transmission schemes such as Differential Pulse Code Modulation (DPCM).Traditional linear prediction employs linear predictors for simplicity. The nonlinear Volterra predictor can be used as an alternative to linear predictor to account for the nonlinear components in the image signals. The proposed quadratic predictor is more ...

The numerical code for calculating the shielding current density in the high-Tc superconductor is developed by using the element-free Galerkin method. The behavior of the shielding current density is expressed by the integro-differential equations. In order to solve the initial-boundaryvalue problem of the equations, the equivalent weak form is derived. Since the form satisfies the essential b...

We introduce Gradient Particle Magnetohydrodynamics (GPM), a new Lagrangian method for magnetohydrodynamics based on gradients corrected for the locally disordered particle distribution. The development of a numerical code for MHD simulation using the GPM algorithm is outlined. Validation tests simulating linear and nonlinear sound waves, linear MHD waves, advection of magnetic fields in a magn...

This paper presents a method for fast time-domain simulation of analog systems with nonlinear parameters. Specifically, the paper focuses on analog-to-digital converters (ADC). The method creates compiled-code simulators based on symbolic analysis. Code is optimized using loop invariant elimination and constant folding. Circuits are described as structural macromodels. Non-linear parameters are...

Existing methods for bar code signal reconstruction is based on either the local approach or the regularization approach with total variation penalty. We formulate the problem explicitly in terms of change points of the 0-1 step function. The bar code is then reconstructed by solving the nonlinear least squares problem subject to linear inequality constraints, with starting values provided by t...

We show in this paper that thirdand fourth-order low storage Runge-Kutta algorithms can be built specifically for quadratic nonlinear operators, at the expense of roughly doubling the time needed for evaluating the temporal derivatives. The resulting algorithms are especially well suited for computational fluid dynamics. Examples are given for the Hénon-Heiles Hamiltonian system and, in one and...

A numerical code that solves self-consistent radio-frequency (RF) sheathplasma interactions in the ion cyclotron range of frequencies is developed based on a nonlinear finite element technique. The present code solves for plasma waves based on the cold plasma model subject to a sheath boundary condition. The finite element procedure has been implemented for oneand two-dimensional analyses using...

We consider codes in the Hamming association scheme Hn (q) with interesting metric properties. We describe how a uniformly packed linear code C determines a pair of dual subschemes. The existence of this pair of sub schemes is used to establish restrictions on the possible distances between codewords in the dual code C.L. These restrictions also apply to arbitrary codes with degree e + 1 and st...

Whenever information is transmitted across a channel, errors are likely to occur. Since Shannon’s groundbreaking paper [36], coding theorists have sought to construct codes that have many codewords, that are easy to encode and decode, and that correct errors. While the main tools used in coding theory have traditionally been those of combinatorics and group theory, this volume is dedicated to c...