Abstract Restoring levels of genetic diversity in small and declining populations is increasingly being considered biodiversity conservation. Evidence-based management requires assessment risks benefits crossing populations. Because are challenging to assess experimentally, e.g. through multi-generational crosses, decision-support approaches utilize proxy risk factors such as time since separat...

Nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. In this work we introduce this concept in an $S$-poset, aposet with an action of a posemigroup $S$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $S$-net. Using $S$-nets and itsconvergency we...

The lag model proposed by Olsen and Coakley is incorporated into the baseline two-equation k-ω turbulence model to simulate the transonic and supersonic turbulent separated flow. The performances of the lagged k-ω turbulence model is assessed by computing two transonic airfoil flow cases, the RAE2822 Case 10 and the 18% thick double circular arc airfoil, and a separated nozzle flow. The computa...

Let S be a set of n points in < d. We present an algorithm that uses the well-separated pair decomposition and computes the minimum spanning tree of S under any Lp or polyhedral metric. It has an expected running time of O(n logn) for uniform distributions. Experimentalresults show that this approachis practical. Under a variety of input distributions, the resultingimplementation is robust and ...

We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in < d. We show how this leads to a deterministic optimal O(logn) time parallel algorithm for nding the k-nearest-neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parall...