Academic literature on the topic 'Lower density bound'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Lower density bound.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Lower density bound"

1

Rush, J. A. "A lower bound on packing density." Inventiones Mathematicae 98, no. 3 (1989): 499–509. http://dx.doi.org/10.1007/bf01393834.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Erdahl, R. M., and B. Jin. "The lower bound method for reduced density matrices." Journal of Molecular Structure: THEOCHEM 527, no. 1-3 (2000): 207–20. http://dx.doi.org/10.1016/s0166-1280(00)00494-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weinberg, David H., Jordi Miralda‐Escude, Lars Hernquist, and Neal Katz. "A Lower Bound on the Cosmic Baryon Density." Astrophysical Journal 490, no. 2 (1997): 564–70. http://dx.doi.org/10.1086/304893.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Geng. "Optimal density lower bound on nonisentropic gas dynamics." Journal of Differential Equations 268, no. 7 (2020): 4017–28. http://dx.doi.org/10.1016/j.jde.2019.10.017.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mowchenko, J. T. "A lower bound on channel density after global routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 8, no. 5 (1989): 574–77. http://dx.doi.org/10.1109/43.24886.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kozma, Robert Thijs, and Jenő Szirmai. "New horoball packing density lower bound in hyperbolic 5-space." Geometriae Dedicata 206, no. 1 (2019): 1–25. http://dx.doi.org/10.1007/s10711-019-00473-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Seungho, Jinhyoung Lee, and Hyunseok Jeong. "Entropic Lower Bound for Distinguishability of Quantum States." Advances in Mathematical Physics 2015 (2015): 1–5. http://dx.doi.org/10.1155/2015/683658.

Full text
Abstract:
For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are all pure, acquiring the entropic lower bound requires only the density operator and the number of the possible states. This entropic bound shows a relation between the von Neumann entropy and the distinguishability.
APA, Harvard, Vancouver, ISO, and other styles
8

KOBAYASHI, MITSUO. "A NEW SERIES FOR THE DENSITY OF ABUNDANT NUMBERS." International Journal of Number Theory 10, no. 01 (2014): 73–84. http://dx.doi.org/10.1142/s1793042113500814.

Full text
Abstract:
A natural number n is called abundant if the sum of proper divisors of n exceeds n. In 1933 Behrend determined bounds for the natural density d𝒜 of abundant numbers, with subsequent improvements leading to the 1998 bounds of Deléglise, 0.2474 < d𝒜 < 0.2480. We present a new infinite series expression for the density of abundant numbers which can be used to calculate an improved lower bound.
APA, Harvard, Vancouver, ISO, and other styles
9

Rama, S. Kalyana, and Tapobrata Sarkar. "Holographic principle during inflation and a lower bound on density fluctuations." Physics Letters B 450, no. 1-3 (1999): 55–60. http://dx.doi.org/10.1016/s0370-2693(99)00114-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Naudts, Jan. "Escort Density Operators and Generalized Quantum Information Measures." Open Systems & Information Dynamics 12, no. 01 (2005): 13–22. http://dx.doi.org/10.1007/s11080-005-0483-5.

Full text
Abstract:
Parameterized families of density operators are studied. A generalization of the lower bound of Cramér and Rao is formulated. It involves escort density operators. The notion of ϕ-exponential family is introduced. This family, together with its escort, optimizes the generalized lower bound. It also satisfies a maximum entropy principle and exhibits a thermodynamic structure in which entropy and free energy are related by Legendre transform.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Lower density bound"

1

Nguyen, Quoc Khanh. "On using a zero lower bound on the physical density in Material DistributionTopology Optimization." Thesis, Umeå universitet, Institutionen för datavetenskap, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-147917.

Full text
Abstract:
Material distribution topology optimization methods aim to place optimally material within a given domain or space. These methos use a socalled material indicator function r to determine for each point within the design domain whether it contains material (r 1) or void (r 0). The most common topology optimization problem is the minimum compliance problem. This thesis studies the problem to minimize the compliance of a cantilever beam subject to a given load. The displacement of the beam is governed by a differential equation. Here, we use the finite element method to solve this continuous prob
APA, Harvard, Vancouver, ISO, and other styles
2

Yin, Feng, Carsten Fritsche, Fredrik Gustafsson, and Abdelhak M. Zoubir. "TOA-Based Robust Wireless Geolocation and Cramér-Rao Lower Bound Analysis in Harsh LOS/NLOS Environments." Linköpings universitet, Reglerteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-92694.

Full text
Abstract:
We consider time-of-arrival based robust geolocation in harsh line-of-sight/non-line-of-sight environments. Herein, we assume the probability density function (PDF) of the measurement error to be completely unknown and develop an iterative algorithm for robust position estimation. The iterative algorithm alternates between a PDF estimation step, which approximates the exact measurement error PDF (albeit unknown) under the current parameter estimate via adaptive kernel density estimation, and a parameter estimation step, which resolves a position estimate from the approximate log-likelihood fun
APA, Harvard, Vancouver, ISO, and other styles
3

Piovano, Paulo. "Evolution and Regularity Results for Epitaxially Strained Thin Films and Material Voids." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/96.

Full text
Abstract:
In this dissertation we study free boundary problems that model the evolution of interfaces in the presence of elasticity, such as thin film profiles and material void boundaries. These problems are characterized by the competition between the elastic bulk energy and the anisotropic surface energy. First, we consider the evolution equation with curvature regularization that models the motion of a two-dimensional thin film by evaporation-condensation on a rigid substrate. The film is strained due to the mismatch between the crystalline lattices of the two materials and anisotropy is taken into
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Yi Zeng, and 王益人. "On Minimax Lower Bounds in Estimating Density and Its Derivatives." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/13730754538502786535.

Full text
Abstract:
碩士<br>國立中正大學<br>數理統計研究所<br>84<br>Some linear minimax risk problems of estimating a density and its derivatives at boundary points have been discussed by Cheng, Fan and Marron(1996). In this article we give a conjecture given there and provided some closely related results.
APA, Harvard, Vancouver, ISO, and other styles
5

Coufal, David. "Jádrové metody v částicových filtrech." Doctoral thesis, 2018. http://www.nusl.cz/ntk/nusl-389580.

Full text
Abstract:
Kernel Methods in Particle Filtering David Coufal Doctoral thesis - abstract The thesis deals with the use of kernel density estimates in particle filtering. In particular, it examines the convergence of the kernel density estimates to the filtering densities. The estimates are constructed on the basis of an out- put from particle filtering. It is proved theoretically that using the standard kernel density estimation methodology is effective in the context of particle filtering, although particle filtering does not produce random samples from the filtering densities. The main theoretical resul
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Lower density bound"

1

United States. National Aeronautics and Space Administration., ed. Lower bound on reliability for Weibull distribution when shape parameter is not estimated accurately. National Aeronautics and Space Administration, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Lower density bound"

1

Percus, J. K. "Lower Bound Aspects of Fermion Density Functionals." In Condensed Matter Theories. Springer US, 1992. http://dx.doi.org/10.1007/978-1-4615-3352-8_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rosina, M., B. Golli, and R. M. Erdahl. "A Lower Bound to the Ground State Energy of a Boson System with Fermion Source." In Density Matrices and Density Functionals. Springer Netherlands, 1987. http://dx.doi.org/10.1007/978-94-009-3855-7_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Erdahl, Robert M. "The Lower Bound Method for Density Matrices and Semidefinite Programming." In Reduced-Density-Matrix Mechanics: With Application to Many-Electron Atoms and Molecules. John Wiley & Sons, Inc., 2007. http://dx.doi.org/10.1002/9780470106600.ch4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Elia, Nicola, and Emilio Frazzoli. "Quantized Stabilization of Two-Input Linear Systems: A Lower Bound on the Minimal Quantization Density." In Hybrid Systems: Computation and Control. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45873-5_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Heule, Marijn, and Hans van Maaren. "Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming." In Theory and Applications of Satisfiability Testing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11499107_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kirousis, Lefteris M., and Lefteris M. Stamatiou. "The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements." In Computational Complexity and Statistical Physics. Oxford University Press, 2005. http://dx.doi.org/10.1093/oso/9780195177374.003.0015.

Full text
Abstract:
One of the most challenging problems in probability and complexity theory is to establish and determine the satisfiability threshold, or phase transition, for random 3-SAT instances: Boolean formulas consisting of clauses with exactly k literals. As the previous part of the volume has explored, empirical observations suggest that there exists a critical ratio of the number of clauses to the number of variables, such that almost all randomly generated formulas with a higher ratio are unsatisfiable while almost all randomly generated formulas with a lower ratio are satisfiable. The statement that such a crossover point really exists is called the satisfiability threshold conjecture. Experiments hint at such a direction, but as far as theoretical work is concerned, progress has been difficult. In an important advance, Friedgut [177] showed that the phase transition is a sharp one, though without proving that it takes place at a “fixed” ratio for large formulas. Otherwise, rigorous proofs have focused on providing successively better upper and lower bounds for the value of the (conjectured) threshold. In this chapter, our goal is to review the series of improvements of upper bounds for 3-SAT and the techniques leading to these. We give only a passing reference to the improvements of the lower bounds as they rely on significantly different techniques, one of which is discussed in the next chapter. Let ϕ be a random k-SAT formula constructed by selecting, uniformly and with replacement, ra clauses from the set of all possible clauses with k literals (no variable repetitions allowed within a clause) over n variables. It has been experimentally observed that as the numbers m, n of variables and clauses tend to infinity while the ratio or clause density m/n is fixed to a constant a, the property of satisfiability exhibits a phase transition. For the case of 3-SAT, when a is greater than a number that has been experimentally determined to be approximately α &lt; 4.27, then almost all random 3-SAT formulas are unsatisfiable; that is, the fraction of unsatisfiable formulas tends to 1.
APA, Harvard, Vancouver, ISO, and other styles
7

Pieczonka, Tadeusz. "Sintering Behavior: Al–SiC Compacts in Different Atmospheres." In Encyclopedia of Aluminum and Its Alloys. CRC Press, 2019. http://dx.doi.org/10.1201/9781351045636-140000292.

Full text
Abstract:
The effect of sintering atmosphere on densification of Al–SiC compacts was investigated. Dimensional changes were monitored in situ in a dilatometer in flowing nitrogen, nitrogen/hydrogen mixture (95/5 by volume), and argon. Two grades of SiC powder were used—F240 characterized by large particles and FCN13 with very fine particles. Mixtures containing 10 and 30 vol.% of SiC reinforcement were prepared in a Turbula mixer. Green compacts of about 80% of theoretical density were made of each mixture. For comparison, compacts made of pure aluminum powder were also investigated. It was shown that nitrogen is the only sintering atmosphere producing shrinkage. This ceramic constituent lowers the sintering densification. Metallographic examinations of sintered composites revealed that sintering of compacts occurs in the presence of a liquid phase exclusively in nitrogen. The melt appearing in Al–SiC compacts is capable to wet the solid phases, which makes shrinkage possible and is beneficial for metal/ceramic bond formation.
APA, Harvard, Vancouver, ISO, and other styles
8

Demopoulos, Demetrios D., and Moshe Y. Vardi. "The Phase Transition in the Random HornSAT Problem." In Computational Complexity and Statistical Physics. Oxford University Press, 2005. http://dx.doi.org/10.1093/oso/9780195177374.003.0017.

Full text
Abstract:
This chapter presents a study of the satisfiability of random Horn formulas and a search for a phase transition. In the past decade, phase transitions or sharp thresholds, have been studied intensively in combinatorial problems. Although the idea of thresholds in a combinatorial context was introduced as early as 1960 [147], in recent years it has been a major subject of research in the communities of theoretical computer science, artificial intelligence, and statistical physics. As is apparent throughout this volume, phase transitions have been observed in numerous combinatorial problems, both for the probability that an instance of a problem has a solution and for the computational cost of solving an instance. In a few cases (2-SAT, 3-XORSAT, 1-in-k SAT) the existence and location of these phase transitions have also been formally proven [7, 94, 101, 131, 156, 202]. The problem at the center of this research is that of 3-satisfiability (3-SAT). An instance of 3-SAT consists of a conjunction of clauses, where each clause is a disjunction of three literals. The goal is to find a truth assignment that satisfies all clauses. The density of a 3-S AT instance is the ratio of the number of clauses to the number of Boolean variables. We call the number of variables the size of the instance. Experimental studies [110, 395, 397, 466, 469] have shown that there is a shift in the probability of satisfiability of random 3-S AT instances, from 1 to 0, located at around density 4.27 (this is also called the crossover point}. So far, in spite of much progress in obtaining rigorous bounds on the threshold location, highlighted in the previous chapters, there is no mathematical proof of a phase transition taking place at that density [1, 132, 177]. Experimental studies also show a peak of the computational complexity around the crossover point. In Kirkpatrick and Selman [319], finite-size scaling techniques were used to suggest a phase transition at the crossover point. Later, in Coafra et al. [96], experiments showed that a phase transition of the running time from polynomial in the instance size to exponential is solver-dependent, and for several different solvers this transition occurs at a density lower than the crossover point.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Lower density bound"

1

Wang, Jinru, and Yuan Zhou. "The Lower Bound of Density Estimation for Biased Data in Sobolev Spaces." In 2nd International Conference On Systems Engineering and Modeling. Atlantis Press, 2013. http://dx.doi.org/10.2991/icsem.2013.163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

George, Yaniv, Itsik Bergel, and Ephraim Zehavi. "Novel lower bound on the ergodic rate density of random ad-hoc networks." In 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC 2013). IEEE, 2013. http://dx.doi.org/10.1109/spawc.2013.6612116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Abrahão, Felipe S., Klaus Wehmuth, and Artur Ziviani. "Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3149.

Full text
Abstract:
We study emergent information in populations of randomly generated networked computable systems that follow a Susceptible-Infected-Susceptible contagion (or infection) model of imitation of the fittest neighbor. These networks have a scale-free degree distribution in the form of a power-law following the Barabási-Albert model. We show that there is a lower bound for the stationary prevalence (or average density of infected nodes) that triggers an unlimited increase of the expected emergent algorithmic complexity (or information) of a node as the population size grows.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Jun Jason, Wenfan Zhou, Narayan Kovvali, Antonia Papandreou-Suppappola, and Aditi Chattopadhyay. "On the Use of the Posterior Crame´r-Rao Lower Bound for Damage Estimation in Structural Health Management." In ASME 2009 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. ASMEDC, 2009. http://dx.doi.org/10.1115/smasis2009-1454.

Full text
Abstract:
The use of the posterior Crame´r-Rao lower bound (PCRLB) as a lower bound for the mean-squared estimation error (MSEE) of progressive damage is investigated. The estimation problem is formulated in terms of a stochastic dynamic system model that describes the random evolution of damage and provides measurement uncertainty. Based on whether the system is linear or nonlinear, sequential Monte Carlo techniques are used to approximate the posterior probability density function and thus obtain the damage state estimate. The resulting MSEE is compared to the lower bound offered by the PCRLB that is
APA, Harvard, Vancouver, ISO, and other styles
5

Horng, Jeng-Haur, Shin-Yuh Chern, Chih-Hsien Chen, and Ming-Yao Ku. "Study of Microcontact Model for Hard Particles Between Rough Surfaces." In World Tribology Congress III. ASMEDC, 2005. http://dx.doi.org/10.1115/wtc2005-63618.

Full text
Abstract:
Particles are often presented at contact interfaces. In this study, a three-body microcontact model Considering of hard particles and rough surfaces is proposed in order to understand the effects of particles between surfaces on contact characteristics. Both transitional surface-to-surface and particle-to-surface two-body microcontact simulations can be obtained according to the simplification of this model. In the three-body contact situation, the curves of contact area ratio versus dimensionless load are located in the range between two straight lines. The surface-to-surface two-body contact
APA, Harvard, Vancouver, ISO, and other styles
6

Dawes, J., and D. S. Pepper. "A COMPARISON OF THE BINDING OF ANTITHROMBIN III AND HEPARIN COFACTOR II TO HEPARINS, NATURALLY OCCURRING GLYCOSAMINOGLYCANS AND OTHER SULPHATED POLYMERS." In XIth International Congress on Thrombosis and Haemostasis. Schattauer GmbH, 1987. http://dx.doi.org/10.1055/s-0038-1642827.

Full text
Abstract:
Antithrombin III (ATIII) and heparin cofactor II (HCII) are currently thought to be the most important protein mediators of the anticoagulant and antithrombotic activities of glycosamino-glycans. A simple, quantitative method for assessing the affinity of a protein for a sulphated polymer in the liquid phase, based on competition with immobilised heparin, has been developed. Using this technique, the binding of ATIII and HCII to a wide range of glycosaminoglycans and other sulphated polymers have been compared, and the contributions to binding of size, degree of sulphation and backbone structu
APA, Harvard, Vancouver, ISO, and other styles
7

Jackson, Dane N., and Barton L. Smith. "Theoretical Parameter Study of Aerodynamic Vectoring Particle Sorting." In ASME 2006 2nd Joint U.S.-European Fluids Engineering Summer Meeting Collocated With the 14th International Conference on Nuclear Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/fedsm2006-98283.

Full text
Abstract:
A new particle sorting technique called Aerodynamic Vectoring Particle Separation (AVPS) has recently been shown to be effective at sorting particles without particles contacting surfaces. The technique relies on turning a free jet sharply without extended control surfaces. The flow turning results in a balance of particle inertia and several forces (pressure, drag, added mass, body) that depend on particle size and density. The present paper describes a theoretical study of particle sorting in a turning flow. The purpose of this study is to extend AVPS to parameter spaces other than those tha
APA, Harvard, Vancouver, ISO, and other styles
8

Chuang, T. J., and S. M. Hsu. "Dynamic Analysis of Sliding Contacts at Head-Disk Interface." In ASME/STLE 2002 International Joint Tribology Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/2002-trib-0261.

Full text
Abstract:
As magnetic data storage technology moves towards higher areal data density with higher rotational speeds and lower flying heights, the propensity of severe sliding contacts at the head-disk interface is bound to increase. The tribological performance of the head-disk interface will have significant impact on the durability and service life of the hard disk drive (HDD). A 3D finite element model is constructed to simulate the high speed impact event of a slider on the disk surface. For a given design of the disk with known layer thicknesses and properties, as well as that of the slider with it
APA, Harvard, Vancouver, ISO, and other styles
9

Huang, Song, Zhiping Chen, and Wenqiang Su. "The Fatigue Threshold Computation of Steel in Hydrogen Environment by Shakedown Analysis." In ASME 2017 Pressure Vessels and Piping Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/pvp2017-65432.

Full text
Abstract:
In this paper, the fatigue threshold of steel servicing in hydrogen environment is studied by means of shakedown analysis. First of all, the application of shakedown analysis on the fatigue threshold prediction is reviewed briefly. Secondly, the classical static shakedown theorem for elasto-perfectly plastic structure is modified to take hydrogen’s effect into consideration. In the proposed method, the effect of hydrogen is described by a yield stress associated with hydrogen concentration and hydrogen content in metal is assumed to be composed of the hydrogen in lattice sites and in reversibl
APA, Harvard, Vancouver, ISO, and other styles
10

Chu, Rong-Shiuan, Yang Zhao, and Arun Majumdar. "Characterization of Carbon Nanotube Array Based Thermal Interface Material After Bonding Process." In 2010 14th International Heat Transfer Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/ihtc14-22989.

Full text
Abstract:
Vertically Aligned Carbon Nanotube (CNT) Arrays are promising to use as advanced thermal interface material. While possessing high thermal conductivity for an individual tube, carbon nanotube array based thermal interface materials (TIMs) fell short of expectations due to poor CNTs-target surface contacts. Investigations suggested that the overall resistance can be potentially reduced to less than 1 m2-K/MW by increasing the number of tubes to target surface contacts. This paper use chromium/gold/indium assisted thermal pressure-bonding to enhance contacts. A CNT array with 12.7% areal density
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!