23,643 research outputs found

    Diffusion coefficients for multi-step persistent random walks on lattices

    Full text link
    We calculate the diffusion coefficients of persistent random walks on lattices, where the direction of a walker at a given step depends on the memory of a certain number of previous steps. In particular, we describe a simple method which enables us to obtain explicit expressions for the diffusion coefficients of walks with two-step memory on different classes of one-, two- and higher-dimensional lattices.Comment: 27 pages, 2 figure

    Data base manipulation for assessment of multiresource suitability and land change

    Get PDF
    Progress is reported in three tasks which support the overall objectives of renewable resources inventory task of the AgRISTARS program. In the first task, the geometric correction algorithms of the Master Data Processor were investigated to determine the utility of data corrected by this processor for U.S. Forest Service uses. The second task involved investigation of logic to form blobs as a precursor step to automatic change detection involving two dates of LANDSAT data. Some routine procedures for selecting BLOB (spatial averaging) parameters were developed. In the third task, a major effort was made to develop land suitability modeling approches for timber, grazing, and wildlife habitat in support of resource planning efforts on the San Juan National Forest

    Partitioning Complex Networks via Size-constrained Clustering

    Full text link
    The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until the graph is small enough to be partitioned by some other algorithm. A partition of the input graph is then constructed by successively transferring the solution to the next finer graph and applying a local search algorithm to improve the current solution. In this paper, we describe a novel approach to partition graphs effectively especially if the networks have a highly irregular structure. More precisely, our algorithm provides graph coarsening by iteratively contracting size-constrained clusterings that are computed using a label propagation algorithm. The same algorithm that provides the size-constrained clusterings can also be used during uncoarsening as a fast and simple local search algorithm. Depending on the algorithm's configuration, we are able to compute partitions of very high quality outperforming all competitors, or partitions that are comparable to the best competitor in terms of quality, hMetis, while being nearly an order of magnitude faster on average. The fastest configuration partitions the largest graph available to us with 3.3 billion edges using a single machine in about ten minutes while cutting less than half of the edges than the fastest competitor, kMetis

    Modifying gravity with the Aether: an alternative to Dark Matter

    Get PDF
    There is evidence that Newton and Einstein's theories of gravity cannot explain the dynamics of a universe made up solely of baryons and radiation. To be able to understand the properties of galaxies, clusters of galaxies and the universe on the whole it has become commonplace to invoke the presence of dark matter. An alternative approach is to modify the gravitational field equations to accommodate observations. We propose a new class of gravitational theories in which we add a new degree of freedom, the Aether, in the form of a vector field that is coupled covariantly, but non-minimally, with the space-time metric. We explore the Newtonian and non-Newtonian limits, discuss the conditions for these theories to be consistent and explore their effect on cosmology.Comment: Updated version: Notation improved - TG

    Is dark matter an extra-dimensional effect?

    Get PDF
    We investigate the possibility that the observed behavior of test particles outside galaxies, which is usually explained by assuming the presence of dark matter, is the result of the dynamical evolution of particles in higher dimensional space-times. Hence, dark matter may be a direct consequence of the presence of an extra force, generated by the presence of extra-dimensions, which modifies the dynamic law of motion, but does not change the intrinsic properties of the particles, like, for example, the mass (inertia). We discuss in some detail several possible particular forms for the extra force, and the acceleration law of the particles is derived. Therefore, the constancy of the galactic rotation curves may be considered as an empirical evidence for the existence of the extra dimensions.Comment: 11 pages, no figures, accepted for publication in MPLA; references adde

    How rare are diffusive rare events?

    Full text link
    We study the time until first occurrence, the first-passage time, of rare density fluctuations in diffusive systems. We approach the problem using a model consisting of many independent random walkers on a lattice. The existence of spatial correlations makes this problem analytically intractable. However, for a mean-field approximation in which the walkers can jump anywhere in the system, we obtain a simple asymptotic form for the mean first-passage time to have a given number k of particles at a distinguished site. We show numerically, and argue heuristically, that for large enough k, the mean-field results give a good approximation for first-passage times for systems with nearest-neighbour dynamics, especially for two and higher spatial dimensions. Finally, we show how the results change when density fluctuations anywhere in the system, rather than at a specific distinguished site, are considered.Comment: 6 pages, 5 figures. Accepted for publication in Europhysics Letters (http://www.iop.org/EJ/journal/EPL

    Radiation-induced nucleic acid synthesis in L cells under energy deprivation

    Get PDF
    Radiation induced nucleic acid synthesis in energy deprived L cell

    Deterministic Entanglement of Assistance and Monogamy Constraints

    Full text link
    Certain quantum information tasks require entanglement of assistance, namely a reduction of a tripartite entangled state to a bipartite entangled state via local measurements. We establish that 'concurrence of assistance' (CoA) identifies capabilities and limitations to producing pure bipartite entangled states from pure tripartite entangled states and prove that CoA is an entanglement monotone for (2Ă—2Ă—n)(2\times2\times n)-dimensional pure states. Moreover, if the CoA for the pure tripartite state is at least as large as the concurrence of the desired pure bipartite state, then the former may be transformed to the latter via local operations and classical communication, and we calculate the maximum probability for this transformation when this condition is not met.Comment: 5 pages, no figure

    Occurrence of normal and anomalous diffusion in polygonal billiard channels

    Full text link
    From extensive numerical simulations, we find that periodic polygonal billiard channels with angles which are irrational multiples of pi generically exhibit normal diffusion (linear growth of the mean squared displacement) when they have a finite horizon, i.e. when no particle can travel arbitrarily far without colliding. For the infinite horizon case we present numerical tests showing that the mean squared displacement instead grows asymptotically as t log t. When the unit cell contains accessible parallel scatterers, however, we always find anomalous super-diffusion, i.e. power-law growth with an exponent larger than 1. This behavior cannot be accounted for quantitatively by a simple continuous-time random walk model. Instead, we argue that anomalous diffusion correlates with the existence of families of propagating periodic orbits. Finally we show that when a configuration with parallel scatterers is approached there is a crossover from normal to anomalous diffusion, with the diffusion coefficient exhibiting a power-law divergence.Comment: 9 pages, 15 figures. Revised after referee reports: redrawn figures, additional comments. Some higher quality figures available at http://www.fis.unam.mx/~dsander

    Invasive Wild pigs as primary nest predators for Wild turkeys

    Get PDF
    Depredation of wild turkey (Meleagris gallopavo) nests is a leading cause of reduced recruitment for the recovering and iconic game species. invasive wild pigs (Sus scrofa) are known to depredate nests, and have been expanding throughout the distributed range of wild turkeys in north America. We sought to gain better insight on the magnitude of wild pigs depredating wild turkey nests. We constructed simulated wild turkey nests throughout the home ranges of 20 GPS-collared wild pigs to evaluate nest depredation relative to three periods within the nesting season (i.e., early, peak, and late) and two nest densities (moderate = 12.5-25 nests/km2, high = 25-50 nests/km2) in south-central Texas, USA during March–June 2016. Overall, the estimated probability of nest depredation by wild pigs was 0.3, equivalent to native species of nest predators in the study area (e.g., gray fox [Urocyon cinereoargenteus], raccoon [Procyon lotor], and coyote [Canis latrans]). female wild pigs exhibited a constant rate of depredation regardless of nesting period or density of nests. However, male wild pigs increased their rate of depredation in areas with higher nest densities. Management efforts should remove wild pigs to reduce nest failure in wild turkey populations especially where recruitment is low
    • …
    corecore