We propose the adaptive S-method-based technique for imaging of SAR and ISAR targets. This approach can be applied in the 1D and 2D modes. It is a postprocessing technique, since the first stage is the standard radar imaging with the 2D Fourier transform. In addition, selection of the adaptive parameter in this technique is efficient and can be performed based on simple rules in real time. The ...

The Taylor series method is of general applicability and it is the standard to which we can compare the accuracy of the various other numerical methods for solving an I. V. P. It can be devised to have any specified degree of accuracy. Theorem (Taylor Series Method of Order n) Assume that f(t,y) is continuous and satisfies a Lipschits condition in the variable y, and consider the I. V. P. (init...

1 Goal SPEM (S-system Parameter Estimation Method) package allows for the computation of parameters in the n-gene S-system from time series data. 2 Introduction Biological systems are composed of interacting components [1]. The process of the expression and the interactions of these components are nonlinear. S-systems have a power law formalism which is general enough to capture the base of the...

In this thesis, we focus on design of a highly e cient parallel algorithm for solving the radiosity method. The presented parallel algorithm is based on the progressive radiosity method. We use asynchronous message passing model in combination with communication-thread in order to overlap communication with computation. This approach allows us to take a di erent numerical approach to the proble...

Stein’s method provides a way of bounding the distance of a probability distribution to a target distribution μ. Here we develop Stein’s method for the class of discrete Gibbs measures with a density e , where V is the energy function. Using size bias couplings, we treat an example of Gibbs convergence for strongly correlated random variables due to Chayes and Klein [Helv. Phys. Acta 67 (1994) ...

In 1981, S. Maslov has proposed a new iterative method for solving propositional satissability problems. The 1981{87 results related to this method were described in the present book. In this chapter, we brieey recall the origins of Maslov's method, and describe further results and ideas related to this method. 1. 1979{81: The Origins of S. Maslov's Iterative Method 1.1. Freedom of choice is ne...

We extend the TSE [14] timing analysis algorithm into the symbolic domain, that is, we allow symbolic variables to be used to specify unknown parameters of the model (essentially, unknown delays) and verification algorithms which are capable of identifying not just failure or success, but also the constraints on these symbolic variables which will ensure successful verification. The two main co...

Recently, there have been many studies on artificial neural network models with nonequilibrium dynamics. For example, Ishii et al.’s model, which is an improvement version of Kaneko’s globally coupled map (GCM) model, is called globally coupled map using the symmetric map (SGCM). A new learning method for S-GCM is proposed in this paper. In the proposed method, we use modified saprse matrix for...

Fixed point equations X = f (X) over ω-continuous semirings are a natural mathematical foundation of interprocedural program analysis. Generic algorithms for solving these equations are based on Kleene’s theorem, which states that the sequence 0, f (0), f (f (0)), . . . converges to the least fixed point. However, this approach is often inefficient. We report on recent work in which we extend N...