917 resultados para Approximate Inverse
Resumo:
Cover title.
Resumo:
Based on the 1947 Directory of Industrial Eestablishments prepared by the Virginia State Chamber of Commerce, and intended as an aid in the use of the annual directory. Transparent overlay map, in pocket.
Resumo:
Contract no. AF40(600)-804. AEDC TN-60-181. Arnold Engineering Development Center, Arnold Air Force Station, Tennessee. Air Research and Development Command, United States Air Force."
Resumo:
Mode of access: Internet.
Resumo:
Thèse--Faculté des sciences de Paris, 1840.
Resumo:
Mode of access: Internet.
Resumo:
Includes index.
Resumo:
"Contract N7 onr-358, T. O. I., NR-041-032."
Resumo:
Research carried out under Naval Ship Systems Command, General Hydromechanics Research Program, subproject SR 009 01 01, administered by the Naval Ship Research and Development Center, contract no. N00014-67-A-0220-0003.
Resumo:
Performing organization: Dept. of Statistics, University of Michigan.
Resumo:
Mode of access: Internet.
Resumo:
"Purdue Research Foundation. Research project no.1255. Project Ae-25. This research was supported by the National Advisory Committee for Aeronautics, Washington, D.C., under Contract no. NAW-6465."
Resumo:
The focus of the present work is the well-known feature of the probability density function (PDF) transport equations in turbulent flows-the inverse parabolicity of the equations. While it is quite common in fluid mechanics to interpret equations with direct (forward-time) parabolicity as diffusive (or as a combination of diffusion, convection and reaction), the possibility of a similar interpretation for equations with inverse parabolicity is not clear. According to Einstein's point of view, a diffusion process is associated with the random walk of some physical or imaginary particles, which can be modelled by a Markov diffusion process. In the present paper it is shown that the Markov diffusion process directly associated with the PDF equation represents a reasonable model for dealing with the PDFs of scalars but it significantly underestimates the diffusion rate required to simulate turbulent dispersion when the velocity components are considered.
Resumo:
An inverse methodology for the design of biologically loaded radio-frequency (RF) coils for magnetic resonance imaging applications is described. Free space time-harmonic electromagnetic Green's functions and de-emphasized B-1 target fields are used to calculate the current density on the coil cylinder. In theory, with the B-1 field de-emphasized in the middle of the RF transverse plane, the calculated current distribution can generate an internal magnetic field that can reduce the central overemphasis effect caused by field/tissue interactions at high frequencies. The current distribution of a head coil operating at 4 T (170 MHz) is calculated using an inverse methodology with de-emphasized B-1. target fields. An in-house finite-difference time-domain routine is employed to evaluate B-1 field and signal intensity inside a homogenous cylindrical phantom and then a complete human head model. A comparison with a conventional RF birdcage coil is carried out and demonstrates that this method can help in decreasing the normal bright region caused by field/tissue interactions in head images at 170 MHz and higher field strengths.
Resumo:
Quantile computation has many applications including data mining and financial data analysis. It has been shown that an is an element of-approximate summary can be maintained so that, given a quantile query d (phi, is an element of), the data item at rank [phi N] may be approximately obtained within the rank error precision is an element of N over all N data items in a data stream or in a sliding window. However, scalable online processing of massive continuous quantile queries with different phi and is an element of poses a new challenge because the summary is continuously updated with new arrivals of data items. In this paper, first we aim to dramatically reduce the number of distinct query results by grouping a set of different queries into a cluster so that they can be processed virtually as a single query while the precision requirements from users can be retained. Second, we aim to minimize the total query processing costs. Efficient algorithms are developed to minimize the total number of times for reprocessing clusters and to produce the minimum number of clusters, respectively. The techniques are extended to maintain near-optimal clustering when queries are registered and removed in an arbitrary fashion against whole data streams or sliding windows. In addition to theoretical analysis, our performance study indicates that the proposed techniques are indeed scalable with respect to the number of input queries as well as the number of items and the item arrival rate in a data stream.