883 resultados para applications in logistics


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Part I:

The earth's core is generally accepted to be composed primarily of iron, with an admixture of other elements. Because the outer core is observed not to transmit shear waves at seismic frequencies, it is known to be liquid or primarily liquid. A new equation of state is presented for liquid iron, in the form of parameters for the 4th order Birch-Murnaghan and Mie-Grüneisen equations of state. The parameters were constrained by a set of values for numerous properties compiled from the literature. A detailed theoretical model is used to constrain the P-T behavior of the heat capacity, based on recent advances in the understanding of the interatomic potentials for transition metals. At the reference pressure of 105 Pa and temperature of 1811 K (the normal melting point of Fe), the parameters are: ρ = 7037 kg/m3, KS0 = 110 GPa, KS' = 4.53, KS" = -.0337 GPa-1, and γ = 2.8, with γ α ρ-1.17. Comparison of the properties predicted by this model with the earth model PREM indicates that the outer core is 8 to 10 % less dense than pure liquid Fe at the same conditions. The inner core is also found to be 3 to 5% less dense than pure liquid Fe, supporting the idea of a partially molten inner core. The density deficit of the outer core implies that the elements dissolved in the liquid Fe are predominantly of lower atomic weight than Fe. Of the candidate light elements favored by researchers, only sulfur readily dissolves into Fe at low pressure, which means that this element was almost certainly concentrated in the core at early times. New melting data are presented for FeS and FeS2 which indicate that the FeS2 is the S-hearing liquidus solid phase at inner core pressures. Consideration of the requirement that the inner core boundary be observable by seismological means and the freezing behavior of solutions leads to the possibility that the outer core may contain a significant fraction of solid material. It is found that convection in the outer core is not hindered if the solid particles are entrained in the fluid flow. This model for a core of Fe and S admits temperatures in the range 3450K to 4200K at the top of the core. An all liquid Fe-S outer core would require a temperature of about 4900 K at the top of the core.

Part II.

The abundance of uses for organic compounds in the modern world results in many applications in which these materials are subjected to high pressures. This leads to the desire to be able to describe the behavior of these materials under such conditions. Unfortunately, the number of compounds is much greater than the number of experimental data available for many of the important properties. In the past, one approach that has worked well is the calculation of appropriate properties by summing the contributions from the organic functional groups making up molecules of the compounds in question. A new set of group contributions for the molar volume, volume thermal expansivity, heat capacity, and the Rao function is presented for functional groups containing C, H, and O. This set is, in most cases, limited in application to low molecular liquids. A new technique for the calculation of the pressure derivative of the bulk modulus is also presented. Comparison with data indicates that the presented technique works very well for most low molecular hydrocarbon liquids and somewhat less well for oxygen-bearing compounds. A similar comparison of previous results for polymers indicates that the existing tabulations of group contributions for this class of materials is in need of revision. There is also evidence that the Rao function contributions for polymers and low molecular compounds are somewhat different.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Network biology is conceptualized as an interdisciplinary field, lying at the intersection among graph theory, statistical mechanics and biology. Great efforts have been made to promote the concept of network biology and its various applications in life s

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The book contains invited lectures and selected contributions presented at the Enzo Levi and XVII Annual Meeting of the Fluid Dynamic Division of the Mexican Physical Society in 2011.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The simultaneous control of residual stress and resistivity of polysilicon thin films by adjusting the deposition parameters and annealing conditions is studied. In situ boron doped polysilicon thin films deposited at 520 ℃ by low pressure chemical vapor deposition (LPCVD) are amorphous with relatively large compressive residual stress and high resistivity. Annealing the amorphous films in a temperature range of 600-800 ℃ gives polysilicon films nearly zero-stress and relatively low resistivity. The low residual stress and low resistivity make the polysilicon films attractive for potential applications in micro-electro-mechanical-systems (MEMS) devices, especially in high resonance frequency (high-f) and high quality factor (high-Q MEMS resonators. In addition, polysilicon thin films deposited at 570 ℃ and those without the post annealing process have low resistivities of 2-5 mΩ·cm. These reported approaches avoid the high temperature annealing process (> 1000℃), and the promising properties of these films make them suitable for high-Q and high-f MEMS devices.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Lee M.H., Qualitative Modelling of Linear Networks in Engineering Applications, in Proc. ECAI?2000, 14th European Conf. on Artificial Intelligence, Berlin, August 19th - 25th 2000, pp161-5.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Nearest neighbor retrieval is the task of identifying, given a database of objects and a query object, the objects in the database that are the most similar to the query. Retrieving nearest neighbors is a necessary component of many practical applications, in fields as diverse as computer vision, pattern recognition, multimedia databases, bioinformatics, and computer networks. At the same time, finding nearest neighbors accurately and efficiently can be challenging, especially when the database contains a large number of objects, and when the underlying distance measure is computationally expensive. This thesis proposes new methods for improving the efficiency and accuracy of nearest neighbor retrieval and classification in spaces with computationally expensive distance measures. The proposed methods are domain-independent, and can be applied in arbitrary spaces, including non-Euclidean and non-metric spaces. In this thesis particular emphasis is given to computer vision applications related to object and shape recognition, where expensive non-Euclidean distance measures are often needed to achieve high accuracy. The first contribution of this thesis is the BoostMap algorithm for embedding arbitrary spaces into a vector space with a computationally efficient distance measure. Using this approach, an approximate set of nearest neighbors can be retrieved efficiently - often orders of magnitude faster than retrieval using the exact distance measure in the original space. The BoostMap algorithm has two key distinguishing features with respect to existing embedding methods. First, embedding construction explicitly maximizes the amount of nearest neighbor information preserved by the embedding. Second, embedding construction is treated as a machine learning problem, in contrast to existing methods that are based on geometric considerations. The second contribution is a method for constructing query-sensitive distance measures for the purposes of nearest neighbor retrieval and classification. In high-dimensional spaces, query-sensitive distance measures allow for automatic selection of the dimensions that are the most informative for each specific query object. It is shown theoretically and experimentally that query-sensitivity increases the modeling power of embeddings, allowing embeddings to capture a larger amount of the nearest neighbor structure of the original space. The third contribution is a method for speeding up nearest neighbor classification by combining multiple embedding-based nearest neighbor classifiers in a cascade. In a cascade, computationally efficient classifiers are used to quickly classify easy cases, and classifiers that are more computationally expensive and also more accurate are only applied to objects that are harder to classify. An interesting property of the proposed cascade method is that, under certain conditions, classification time actually decreases as the size of the database increases, a behavior that is in stark contrast to the behavior of typical nearest neighbor classification systems. The proposed methods are evaluated experimentally in several different applications: hand shape recognition, off-line character recognition, online character recognition, and efficient retrieval of time series. In all datasets, the proposed methods lead to significant improvements in accuracy and efficiency compared to existing state-of-the-art methods. In some datasets, the general-purpose methods introduced in this thesis even outperform domain-specific methods that have been custom-designed for such datasets.