Data base manipulation for assessment of multiresource suitability and land change

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

Diffusion coefficients for multi-step persistent random walks on lattices

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

Partitioning Complex Networks via Size-constrained Clustering

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

Is dark matter an extra-dimensional effect?

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

Deterministic Entanglement of Assistance and Monogamy Constraints

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\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

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

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

Mars Soil-Based Resource Processing and Planetary Protection

The ability to extract and process resources at the site of exploration into products and services, commonly referred to as In Situ Resource Utilization (ISRU), can have significant benefits for robotic and human exploration missions. In particular, the ability to use in situ resources to make propellants, fuel cell reactants, and life support consumables has been shown in studies to significantly reduce mission mass, cost, and risk, while enhancing or enabling missions not possible without the incorporation of ISRU. In December 2007, NASA completed the Mars Human Design Reference Architecture (DRA) 5.0 study. For the first time in a large scale Mars architecture study, water from Mars soil was considered as a potential resource. At the time of the study, knowledge of water resources (their form, concentration, and distribution) was extremely limited. Also, due to lack of understanding of how to apply planetary protection rules and requirements to ISRU soil-based excavation and processing, an extremely conservative approach was incorporated where only the top several centimeters of ultraviolet (UV) radiated soil could be processed (assumed to be 3% water by mass). While results of the Mars DRA 5.0 study showed that combining atmosphere processing to make oxygen and methane with soil processing to extract water provided the lowest mission mass, atmosphere processing to convert carbon dioxide (CO2) into oxygen was baselined for the mission since it was the lowest power and risk option. With increased knowledge and further clarification of Mars planetary protection rules, and the recent release of the Mars Exploration Program Analysis Group (MEPAG) report on "Special Regions and the Human Exploration of Mars", it is time to reexamine potential water resources on Mars, options for soil processing to extract water, and the implications with respect to planetary protection and Special Regions on Mars

Load-Balancing for Parallel Delaunay Triangulations

Computing the Delaunay triangulation (DT) of a given point set in $\mathbb{R}^D$ is one of the fundamental operations in computational geometry. Recently, Funke and Sanders (2017) presented a divide-and-conquer DT algorithm that merges two partial triangulations by re-triangulating a small subset of their vertices - the border vertices - and combining the three triangulations efficiently via parallel hash table lookups. The input point division should therefore yield roughly equal-sized partitions for good load-balancing and also result in a small number of border vertices for fast merging. In this paper, we present a novel divide-step based on partitioning the triangulation of a small sample of the input points. In experiments on synthetic and real-world data sets, we achieve nearly perfectly balanced partitions and small border triangulations. This almost cuts running time in half compared to non-data-sensitive division schemes on inputs exhibiting an exploitable underlying structure.Comment: Short version submitted to EuroPar 201

Persistence effects in deterministic diffusion

In systems which exhibit deterministic diffusion, the gross parameter dependence of the diffusion coefficient can often be understood in terms of random walk models. Provided the decay of correlations is fast enough, one can ignore memory effects and approximate the diffusion coefficient according to dimensional arguments. By successively including the effects of one and two steps of memory on this approximation, we examine the effects of ``persistence'' on the diffusion coefficients of extended two-dimensional billiard tables and show how to properly account for these effects, using walks in which a particle undergoes jumps in different directions with probabilities that depend on where they came from.Comment: 7 pages, 7 figure