In a Distributed Computing System (DCS), the failure of one or more system components causes the degradation in its effectiveness to complete a given task as opposed to a complete network breakdown. This paper address...
详细信息
In a Distributed Computing System (DCS), the failure of one or more system components causes the degradation in its effectiveness to complete a given task as opposed to a complete network breakdown. This paper addresses the issue of degraded system effectiveness evaluation by introducing two static measures, namely, Distributed Program Performance Index (DPP1) and Distributed System Performance Index (DSPI). These metrics can be used to compare networks with different features for application execution. It can be used to determine if the network with high reliability and bw capacity, or low reliability and high capacity is better for a given program execution. An algorithm is also developed for computing these indices, and a is shown to be not only efficient, but general enough to compute many other existing measures such as computer networks, distributed systems, transaction based systems, etc.
We investigate the problem of finding the best solution satisfying all but k of the given constraints, for an abstract class of optimization problems introduced by Sharir and Welzl-the so-called LP-type problems. We g...
详细信息
We investigate the problem of finding the best solution satisfying all but k of the given constraints, for an abstract class of optimization problems introduced by Sharir and Welzl-the so-called LP-type problems. We give a general algorithm and discuss its efficient implementations for specific geometric problems. For instance, for the problem of computing the smallest circle enclosing all but k of the given n points in the plane, we obtain an O(n log n + k(3)n(epsilon)) algorithm;this improves previous results for k small compared with n but moderately growing. We also establish some results concerning general properties of LP-type problems.
We construct a general algorithm generating the analytic eigenfunctions as well as eigenvalues of one-dimensional stationary Schrodinger Hamiltonians. Both exact and quasi-exact Hamiltonians enter our formalism but we...
详细信息
We construct a general algorithm generating the analytic eigenfunctions as well as eigenvalues of one-dimensional stationary Schrodinger Hamiltonians. Both exact and quasi-exact Hamiltonians enter our formalism but we focus on quasi-exact interactions for which no such general approach has been considered before. In particular we concentrate on a generalized sextic oscillator but also on the Lame and the screened Coulomb potentials. (C) 2002 Elsevier Science (USA).
This paper presents a simple, accurate and flexible general algorithm for the study of a great number of beams vibration problems. The approach is developed based on the Rayleigh-Ritz method with characteristic orthog...
详细信息
This paper presents a simple, accurate and flexible general algorithm for the study of a great number of beams vibration problems. The approach is developed based on the Rayleigh-Ritz method with characteristic orthogonal polynomial shape functions. It allows the inclusion of a number of complicating effects such as varying cross-sections, presence of an arbitrarily placed concentrated mass, ends elastically restrained against rotation and translation and presence of an axial, tensile force. Several cases are treated to show the simplicity and great flexibility of this approach, in the determination of frequencies. To demonstrate the accuracy of the present approach natural frequency coefficients are given for beams, from which comparison results are available. New results are also given for tapered beams with several complicating effects. (C) 1998 Elsevier Science Ltd. All rights reserved.
General algorithms, Viewed as transducers, are introduced for computing rational expressions with continued fraction expansions. Moreover, expansions of some algebraic numbers, like (3)root 2 or those related to primi...
详细信息
General algorithms, Viewed as transducers, are introduced for computing rational expressions with continued fraction expansions. Moreover, expansions of some algebraic numbers, like (3)root 2 or those related to primitive matrices are considered. (C) 1998 Academic Press.
The mathematical tools, a universal algorithm, and a program for the calculation and construction of titration curves in titrimetric analysis are presented.
The mathematical tools, a universal algorithm, and a program for the calculation and construction of titration curves in titrimetric analysis are presented.
We present a general algorithm to compute off-shell, one-loop multigluon Green functions using bosonic string amplitudes. We identify and parametrize the regions in the space of moduli of one loop Riemann surfaces tha...
详细信息
We present a general algorithm to compute off-shell, one-loop multigluon Green functions using bosonic string amplitudes. We identify and parametrize the regions in the space of moduli of one loop Riemann surfaces that contribute to the field theory limit of string amplitudes. Each of these regions can be precisely associated with a Feynman-like scalar graph with cubic and quartic vertices, whose lines represent the joint propagation of ghosts and gluons. We give a procedure to compute the contribution of each graph to a gluon Green function, for arbitrarily polarized off-shell gluons, reducible and irreducible diagrams, planar and non-planar topologies. Explicit examples are given For up to six gluons. (C) 2001 Published by Elsevier Science B.V.
Pulsed electron-electron double resonance techniques such as the four-pulse double electron-electron resonance experiment measure a dipolar evolution function of the sample. For a sample consisting of spin-carrying na...
详细信息
Pulsed electron-electron double resonance techniques such as the four-pulse double electron-electron resonance experiment measure a dipolar evolution function of the sample. For a sample consisting of spin-carrying nanoobjects, this function is the product of a form factor, corresponding to the internal structure of the nanoobject, and a background factor, corresponding to the distribution of nanoobjects in space. The form factor contains information on the spin-to-spin distance distribution within the nanoobject and on the average number of spins per nanoobject, while the background factor depends on constraints, such as a confinement of the nanoobjects to a two-dimensional layer. Separation of the dipolar evolution function into these two contributions and extraction of the spin-to-spin distance distribution require numerically stable mathematical algorithms that can handle data for different classes of samples, e.g., spin-labelled biomacromolecules and synthetic materials. Furthermore, experimental imperfections such as the limited excitation bandwidth of microwave pulses need to be considered. The software package DeerAnalysis2006 provides access to a comprehensive set of tools for such data analysis within a common user interface. This interface allows for several tests of the reliability and precision of the extracted information. User-supplied models for the spin-to-spin distance distribution within a certain class of nanoobjects can be added to an existing library and be fitted with a universal algorithm.
We propose a discrete denoising algorithm, that, based on the observation of, the output of a known Discrete Memoryless Channel (DMC), estimates the input sequence to minimize a given fidelity, criterion. The algorith...
详细信息
ISBN:
(纸本)0780376293
We propose a discrete denoising algorithm, that, based on the observation of, the output of a known Discrete Memoryless Channel (DMC), estimates the input sequence to minimize a given fidelity, criterion. The algorithm is universal in the sense that it requires no knowledge of the input sequence or its statistical properties. Yet, asymptotically it performs as well as the optimum denoiser that knows the input sequence distribution. The, proposed denoising algorithm is practical, and can be implemented in O(nlogn) time and O(n(2/3) log n) storage complexity. Extensions to the case of delay-constrained denoising, and to the case of channel uncertainty, are briefly discussed.
This paper presents a template-based English-Chinese translation system characterized by two important features: Fast Optimal Parsing algorithm (FOPA) and Universal algorithm of Matching and Replacing Templates (UAAMT...
详细信息
ISBN:
(纸本)9780769529301
This paper presents a template-based English-Chinese translation system characterized by two important features: Fast Optimal Parsing algorithm (FOPA) and Universal algorithm of Matching and Replacing Templates (UAAMT). First, the FOPA parses an English sentence into an optimal parse tree or template structure quickly. Second, the UAMRT matches each source template with the optimal structure and replaces it with the corresponding target template. The basic idea of the template-based system is to represent all translation knowledge in uniform templates which can be shown as context-free grammar rules. It then translates an English sentence into Chinese with FOPA and UAMRT System evaluation shows encouraging and promising results for quality and speed, and the system may perform better by adding more templates without any other changes.
暂无评论