نتایج جستجو برای: height functions
تعداد نتایج: 588368 فیلتر نتایج به سال:
We study analytic forms in Fourier space of one-dimensional heightheight correlation functions for self-affine rough surfaces. Comparisons with complex systems suggest three alternative models. However, only the model Cl(k) m (1 + a]#-(r+2H) permits analytic calculation of important surface roughness quantities (i.e. surface width) for roughness exponents in range 0 5 HI 1. Furthermore, the imp...
This study presents a low-cost, extremely practical, and easy-to-operate composite instrument for measuring height. This instrument uses the level-, distance-, and heightmeasuring devices typically employed in construction works for further integration. Because most instruments used in construction and architecture are expensive and have only single functions, the system developed in this study...
One of the most important issues in forest biometrics is the use of allometric functions to estimate the tree height by using diameter-height models. Measuring the total height of trees is usually a complex and time-consuming process. In allometric functions, the diameter is measured directly but the height of the tree is an estimate of an allometric model, which will be more accurate if the cr...
The connective constant μ(G) of an infinite transitive graph G is the exponential growth rate of the number of self-avoiding walks from a given origin. In earlier work of Grimmett and Li, a locality theorem was proved for connective constants, namely, that the connective constants of two graphs are close in value whenever the graphs agree on a large ball around the origin. A condition of the th...
quantifying spatial structure is one of the most important components, describing natural ecosystems and their biodiversity. in this study, a set of indices and functions related to spatial structure using 102 established plots with an area of 1000 m2 were presented. to achieve spatial structure of carpinus-fagus type, a set of indices (clark & evans, uniform angle, shannon-wiener, mingling and...
Tries are very simple general purpose data structures for information retrieval. A crucial parameter of a trie is its height. In the worst case the height is unbounded when the trie is built over a set of n strings. Analytical investigations have shown that the average height under many random sources is logarithmic in n. Experimental studies of trie height suggest that this holds for non-rando...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید