نتایج جستجو برای: true density
تعداد نتایج: 535432 فیلتر نتایج به سال:
Forty computer.simulated populations were analysed to derive fonnulae for estimating den.5ity of populations from a set of distances from sample points to the nearest member, from that member to its neighbour and from that neighbour to its nearest neighbour. Distances may be truncated or unlimited. The formulae were applied to data from 11 paper.dot and 18 field populations in a total of 37 exp...
Historical forest conditions are often used to inform contemporary management goals because historical forests are considered to be resilient to ecological disturbances. The General Land Office (GLO) surveys of the late 19th and early 20th centuries provide regionally quasi-contiguous data sets of historical forests across much of the Western United States. Multiple methods exist for estimating...
Density conditions for wavelet systems with arbitrary sampling points to be frames are studied. We show that for a wavelet system generated by admissible functions and irregular affine lattices to be a frame, the sampling points must have a positive lower Beurling density. The same is true for wavelet systems with arbitrary sampling points and nice generating functions.
In this paper, we analyze the robustness for low-density parity-check (LDPC) codes over the Gilbert-Elliott (GE) channel. For this purpose we propose a density evolution method for the case where LDPC decoder uses the mismatched parameters for the GE channel. Using this method, we derive the region of tuples of true parameters and mismatched decoding parameters for the GE channel, where the dec...
A limitation common to all sequential Monte Carlo algorithms is the computational demand of accurately describing an arbitrary distribution, which may preclude real-time implementation for some systems. We propose using interpolation to construct a high accuracy approximation to the importance density. The surrogate density can then be efficiently evaluated in place of sampling the true importa...
We prove that for a densest packing of more than three d–balls, d ≥ 3, where the density is measured by parametric density, the convex hull of their centers is either linear (a sausage) or at least 3–dimensional. This is also true for restrictions to lattice packings. The proofs require a Lagrange–type theorem from number theory and Minkowski’s theory of mixed volumes.
We establish limit theory for the Grenander estimator of a monotone density near zero. In particular we consider the situation when the true density f(0) is unbounded at zero, with different rates of growth to infinity. In the course of our study we develop new switching relations using tools from convex analysis. The theory is applied to a problem involving mixtures.
Biomedical scientific communities increasingly articulate concern about the unsustainable status quo of traditional publishing paradigms [2], feeding an ongoing debate and consideration of alternative publishing models [3]. Seizing an opportune moment to contribute to the ongoing assessment and refinement of scholarly publishing in biomedical education, research, and patient care, an energetic ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید