Results 1 - 10 of 58710
Results 1 - 10 of 58710. Search took: 0.054 seconds
|Sort by: date | relevance|
[en] A systolic array for realization of the new algorithm of second kind Fredgolm's integral equation with Toeplitz type kernel numerical solution is proposed. The calculations efficiency coefficient is determined for each structure which allows to estimate the efficiency of processor elements equipment performance
[en] We investigate the influence of superpositional wave function oscillations on the performance of Shor's quantum algorithm for factorization of integers. It is shown that wave function oscillations can modify the required quantum interference. This undesirable effect can be routinely eliminated using a resonant pulse implementation of quantum computation, but requires special analysis for nonresonant implementations. We also discuss the influence of this effect on implementation of other quantum algorithms. (c) 2000 The American Physical Society
[en] Aiming at the high time complexity of the decoding phase in the traditional image enlargement methods based on fractal coding, a novel image magnification algorithm is proposed in this paper, which has the advantage of iteration-free decoding, by using the similarity analogy between an image and its zoom-out and zoom-in. A new pixel selection technique is also presented to further improve the performance of the proposed method. Furthermore, by combining some existing fractal zooming techniques, an efficient image magnification algorithm is obtained, which can provides the image quality as good as the state of the art while greatly decrease the time complexity of the decoding phase.
[en] The main goal of the paper was to develop algorithms and methods for computation of basic sums, the mathematical objects of great importance in computational materials science having applications to description of the representative volume element (RVE) and to the effective properties of 2D composites. The previously used algorithm had the exponential complexity. We propose a linearly complex algorithm. All the presented algorithms can be easily implemented in modern scientific computing packages, while maintaining both efficient calculations and a high level of abstraction. The proposed approach is applied to derivation of a polynomial approximation of the effective conductivity formula for 2D random material with non-overlapping circular inclusions with normally distributed radii. The obtained formulas are applied to the optimal packing problem of disks on the plane.
[en] In this paper, an algorithm is introduced to overcome the difficulty caused by the reducibility of some algebraic varieties which express the hypotheses of theorems to be proved. The problem arose as one used algebraic methods for automated theorem proving. Here we show that the difficulty could be overcome if one uses the mutual pseudo division to replace or complete the pseudo division in Wu's method which has had great success in this field. (author). 7 refs
[en] The Moessbauer absorption line area 'A' is expressed as a product of two terms: A = AL.ST, where 'AL' is linearly dependent of the number of resonant nuclei corresponding to the considered absorption line and 'ST' is the saturation term for that line. An iterative algorithm to evaluate ST term is developed. The application in Moessbauer Phase Analysis of this method is discussed. (author)