نتایج جستجو برای: log line

تعداد نتایج: 486124  

Journal: :Monthly Notices of the Royal Astronomical Society 2021

We analyze the rest-optical emission-line ratios of z~1.5 galaxies drawn from MOSFIRE Deep Evolution Field (MOSDEF) survey. Using composite spectra we investigate mass-metallicity relation (MZR) at and measure its evolution to z=0. When using gas-phase metallicities based on N2 line ratio, find that MZR z=0 depends stellar mass, evolving by $\Delta\rm log(\rm O/H)\sim0.25$ dex $M_*<10^{9.75}M_{...

1991
Steven Fortune Victor Milenkovic

We analyze the behavior of two line arrangement algorithms, a sweepline algorithm and an incremental algorithm, in approximate arithmetic. The algorithms have running times O(n 2 log n) and O(n 2) respectively. We show that each of these algorithms can be implemented to have O(nn) relative error. This means that each algorithm produces an arrangement realized by a set of pseudolines so that eac...

Journal: :Scholarpedia 2007
Walter J. Freeman

Figure 1: Distributions of the numbers of connections at varying distances are schematized in log-log coordinates. The straight line indicates power-law 1/f. Scale­free dynamics of neocortex are characterized by hierarchical self-similarities of patterns of synaptic connectivity and spatiotemporal neural activity, seen in power-law distributions of structural and functional parameters and in ra...

2007
T. Hagerup H. Jung

We describe randomized parallel CREW PRAM algorithms for building trapezoidal diagrams of line segments in the plane. For general segments, we give an algorithm requiring optimal O(A + n logn) expected work and optimal O(logn) time, where A is the number of intersecting pairs of segments. If the segments form a simple chain, we give an algorithm requiring optimal O(n) expected work and O(logn l...

2011
Mojtaba Nouri Bygi Mohammad Ghodsi

In this paper, we consider the problem of computing the weak visibility (WV ) of a query line segment inside a simple polygon. Our algorithm first preprocesses the polygon and creates data structures from which any WV query is answered efficiently in an output sensitive manner. In our solution, the preprocessing is performed in time O(n log n) and the size of the constructed data structure is O...

Journal: :Optics express 2012
Jeffrey R Chen Kenji Numata Stewart T Wu

We report new modeling and error reduction methods for differential-absorption optical-depth (DAOD) measurements of atmospheric constituents using direct-detection integrated-path differential-absorption lidars. Errors from laser frequency noise are quantified in terms of the line center fluctuation and spectral line shape of the laser pulses, revealing relationships verified experimentally. A ...

2007
M. C. Jones

On the positive half-line, there are two natural, and complementary, analogues of the single notion of symmetry of distributions on the real line. One is the R-symmetry recently proposed and investigated by Mudholkar and Wang (2007); the other is the ‘log-symmetry’ investigated here. Log-symmetry can be thought of either in terms of a random variable having the same distribution as its reciproc...

Journal: :Nord. J. Comput. 1994
Sven Schuierer

The kernel of a polygon P is the set of all points that see the interior of P . It can be computed as the intersection of the halfplanes that are to the left of the edges of P . We present an O(log log n) time CRCW-PRAM algorithm using n/log log n processors to compute a representation of the kernel of P that allows to answer point containment and line intersection queries efficiently. Our appr...

Journal: :Transactions of the American Mathematical Society 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید