This paper focuses on the localization methods for multiple sources received by widely separated arrays. The conventional two-step methods extract measurement parameters and then estimate the positions from them. In the contrast to the conventional two-step methods, direct position determination (DPD) localizes transmitters directly from original sensor outputs without estimating intermediate p...

Image registration is a very important problem in computer vision and medical image processing. Numerous algorithms for registering multi-modal image data have been reported in these areas. Robustness as well as computational e ciency are prime factors of importance in image data registration. In this paper, a robust and e cient algorithm for estimating the transformation between two image data...

We consider a broad class of systems of implicit differential-algebraic equations (DAEs) including the equations of mechanical systems with holonomic and nonholonomic constraints. We approximate numerically the solution to these DAEs by applying a class of super partitioned additive Runge-Kutta (SPARK) methods. Several properties of the SPARK coefficients, satisfied by the combination of Lobatt...

Adjoint Algorithms are a powerful way to obtain the gradients that are needed in Scientific Computing. Automatic Differentiation can build Adjoint Algorithms automatically by source transformation of the direct algorithm. The specific structure of Adjoint Algorithms strongly relies on reversal of the sequence of computations made by the direct algorithm. This reversal problem is at the same tim...

25 Langridge, J. I., Evans, A. M., Ghosh, D., Walton, T. J., Brenton, A. G., Harris, F. M. and Newton, R. P. (1991) Anal. Chim. Acta 247, 177-185 26 Langridge, J. I. , Brenton, A. G., Walton, T. J., Harris, F. M. and Newton, R. P. (1993) Rapid Commun. Mass Spectrom. 7,293-303 27 Newton, R. P., Walton, T. J., Brenton, A. G., Kingston, E. E. and Harris, F. M. (1989) Rapid Commun. Mass Spectrom. 3...

In this paper, we precise the asymptotic behaviour of Newton polygons of L-functions associated to character sums, coming from certain n variable Laurent polynomials. In order to do this, we use the free sum on convex polytopes. This operation allows the determination of the limit of generic Newton polygons for the sum ∆ = ∆1 ⊕ ∆2 when we know the limit of generic Newton polygons for each facto...

bainitic transformation at low transformation temperatures leads to a microstructure involving fine plates of bainitic ferrite and thin films of retained austenite. this microstructure has shown ultimate tensile strength of about 2.2 gpa, noticeable uniform elongation in the range of 5 to 30%, hardness values of about 600 to 670 hv and impact toughness in the range of 30 to 40 mpa m1/2. with ca...

‎In this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎The proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the Newton equation system‎, ‎by using an inexact Newton direction‎. ‎Furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

Fuzzy Newton-Cotes method for integration of fuzzy functions that was proposed by Ahmady in [1]. In this paper we construct error estimate of fuzzy Newton-Cotes method such as fuzzy Trapezoidal rule and fuzzy Simpson rule by using Taylor's series. The corresponding error terms are proven by two theorems. We prove that the fuzzy Trapezoidal rule is accurate for fuzzy polynomial of degree one and...

than through the language and experience of a doctor and author like Anton Pavlovič Čechov, in whose work and biography I have been interested for many years. The idea of putting my own thoughts into a foreign language has always fascinated me – to create reality out of the unfamiliar, much like with a photograph, which is transforming reality twice and thereby renders it clearer. Against the r...