Climatic and human influences on water resources in low atolls

Low, small islands have water supply problems amongst the most critical in the world. Fresh groundwater, the major source of water in many atolls, is vulnerable to natural and human-induced changes. Storm surges, droughts and over-extraction cause seawater intrusion. Settlements and agricultural activities can rapidly pollute shallow groundwaters. Limited land areas restrict freshwater quantities, which are especially vulnerable during frequent ENSO-related droughts. Demand for freshwater is increasing due to population growth and urbanisation. Water use for traditional crops often competes with water supplies for communities. This paper analyses the impact of frequent severe droughts on the quality and quantity of fresh groundwater in a low, atoll, Tarawa, in the Republic of Kiribati. We also examine the impacts of groundwater harvesting on traditional subsistence crops such as coconuts and of landuse on water quality. Strategies for reducing risks from climate variations and human impacts and increasing resilience are discussed. (Résumé d'auteur

Sustainable development of water resources in small island nations of the pacific

This paper uses examples from the Pacific to discuss sustainable water management in small islands. Population centres in small islands have water supply problems that are amongst the most critical in the world. Limited land areas severely restrict surface water storages. Freshwater is extremely vulnerable to natural processes and human activities. Limited land areas also restrict freshwater quantities, particularly in frequent ENSO-related droughts. Demand for water is increasing due to both natural population growth and to growing urbanisation. There are few water professionals in many small island nations, policy and institutional frameworks are deficient and community participation in water management is minimal. Water use for agriculture competes with community water supplies. Limited resources and geographic isolation restrict the potential for irrigated crop exports so that reliance on aid is systemic. At the core of water management problems are land tenure and the conflict between the requirements of urbanised societies and the traditional values and rights of subsistence communities. Reforms of governance and the provision of knowledge to communities are critical. Long-term partnerships are needed which promote self-reliance. Multi Agent Systems offer potential for reducing conflicts over water. Regional organisations, able to foster self-support, can play a crucial role in developing island-adopted and owned solutions. (Résumé d'auteur

On R-trees with low query complexity

The R-tree is a well-known bounding-volume hierarchy that is suitable for storing geometric data on secondary memory. Unfortu- nately, no good analysis of its query time exists. We describe a new algo- rithm to construct an R-tree for a set of planar objects that has provably good query complexity for point location queries and range queries with ranges of small width. For certain important special cases, our bounds are optimal. We also show how to update the structure dynamically, and we generalize our results to higher-dimensional spaces

Locked and Unlocked Polygonal Chains in 3D

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called locked. While there are open chains in 3D that are locked, we show that if an open chain has a simple orthogonal projection onto some plane, it can be straightened. For closed chains, we show that there are unknotted but locked closed chains, and we provide an algorithm for convexifying a planar simple polygon in 3D with a polynomial number of moves.Comment: To appear in Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, Jan. 199

Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search

The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\mathcal{H}$ over locality-sensitive hash functions that partition space. For a collection of $n$ points, after preprocessing, the query time is dominated by $O(n^{\rho} \log n)$ evaluations of hash functions from $\mathcal{H}$ and $O(n^{\rho})$ hash table lookups and distance computations where $\rho \in (0,1)$ is determined by the locality-sensitivity properties of $\mathcal{H}$. It follows from a recent result by Dahlgaard et al. (FOCS 2017) that the number of locality-sensitive hash functions can be reduced to $O(\log^2 n)$, leaving the query time to be dominated by $O(n^{\rho})$ distance computations and $O(n^{\rho} \log n)$ additional word-RAM operations. We state this result as a general framework and provide a simpler analysis showing that the number of lookups and distance computations closely match the Indyk-Motwani framework, making it a viable replacement in practice. Using ideas from another locality-sensitive hashing framework by Andoni and Indyk (SODA 2006) we are able to reduce the number of additional word-RAM operations to $O(n^\rho)$.Comment: 15 pages, 3 figure

Algorithms for Stable Matching and Clustering in a Grid

We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stably matched to cluster centers, as prioritized by their distances, so that each cluster center is apportioned a set of points of equal area. We show that, for a discretization of the problem to an $n\times n$ grid of pixels with $k$ centers, the problem can be solved in time $O(n^2 \log^5 n)$, and we experiment with two slower but more practical algorithms and a hybrid method that switches from one of these algorithms to the other to gain greater efficiency than either algorithm alone. We also show how to combine geometric stable matchings with a $k$-means clustering algorithm, so as to provide a geometric political-districting algorithm that views distance in economic terms, and we experiment with weighted versions of stable $k$-means in order to improve the connectivity of the resulting clusters.Comment: 23 pages, 12 figures. To appear (without the appendices) at the 18th International Workshop on Combinatorial Image Analysis, June 19-21, 2017, Plovdiv, Bulgari

Computing the Fréchet Distance with a Retractable Leash

All known algorithms for the Fréchet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fréchet distance between polygonal curves in (Formula presented.) under polyhedral distance functions (e.g., (Formula presented.) and (Formula presented.)). We also get a (Formula presented.)-approximation of the Fréchet distance under the Euclidean metric, in quadratic time for any fixed (Formula presented.). For the exact Euclidean case, our framework currently yields an algorithm with running time (Formula presented.). However, we conjecture that it may eventually lead to a faster exact algorithm

Mutations in SRD5B1 (AKR1D1), the gene encoding δ 4-3-oxosteroid 5β-reductase, in hepatitis and liver failure in infancy

Background: A substantial group of patients with cholestatic liver disease in infancy excrete, as the major urinary bile acids, the glycine and taurine conjugates of 7α-hydroxy-3-oxo-4-cholenoic acid and 7α,12α -dihydroxy-3-oxo-4-cholenoic acid. It has been proposed that some (but not all) of these have mutations in the gene encoding Δ4-3-oxosteroid 5β-reductase (SRD5B1; AKR1D1, OMIM 604741). Aims: Our aim was to identify mutations in the SRD5B1 gene in patients in whom chenodeoxycholic acid and cholic acid were absent or present at low concentrations in plasma and urine, as these seemed strong candidates for genetic 5β-reductase deficiency. Patients and subjects: We studied three patients with neonatal onset cholestatic liver disease and normal γ-glutamyl transpeptidase in whom 3-oxo-Δ4 bile acids were the major bile acids in urine and plasma and saturated bile acids were at low concentration or undetectable. Any base changes detected in SRD5B1 were sought in the parents and siblings and in 50 ethnically matched control subjects. Methods: DNA was extracted from blood and the nine exons of SRD5B1 were amplified and sequenced. Restriction enzymes were used to screen the DNA of parents, siblings, and controls. Results: Mutations in the SRD5B1 gene were identified in all three children. Patient MS was homozygous for a missense mutation (662 C>T) causing a Pro198Leu amino acid substitution; patient BH was homozygous for a single base deletion (511 delT) causing a frame shift and a premature stop codon in exon 5; and patient RM was homozygous for a missense mutation (385 C>T) causing a Leu106Phe amino acid substitution. All had liver biopsies showing a giant cell hepatitis; in two, prominent extramedullary haemopoiesis was noted. MS was cured by treatment with chenodeoxycholic acid and cholic acid; BH showed initial improvement but then deteriorated and required liver transplantation; RM had advanced liver disease when treatment was started and also progressed to liver failure. Conclusions: Analysis of blood samples for SRD5B1 mutations can be used to diagnose genetic 5β-reductase deficiency and distinguish these patients from those who have another cause of 3-oxo-Δ4 bile aciduria, for example, severe liver damage. Patients with genetic 5β-reductase deficiency may respond well to treatment with chenodeoxycholic acid and cholic acid if liver disease is not too advanced

Developing serious games for cultural heritage: a state-of-the-art review

Although the widespread use of gaming for leisure purposes has been well documented, the use of games to support cultural heritage purposes, such as historical teaching and learning, or for enhancing museum visits, has been less well considered. The state-of-the-art in serious game technology is identical to that of the state-of-the-art in entertainment games technology. As a result, the field of serious heritage games concerns itself with recent advances in computer games, real-time computer graphics, virtual and augmented reality and artificial intelligence. On the other hand, the main strengths of serious gaming applications may be generalised as being in the areas of communication, visual expression of information, collaboration mechanisms, interactivity and entertainment. In this report, we will focus on the state-of-the-art with respect to the theories, methods and technologies used in serious heritage games. We provide an overview of existing literature of relevance to the domain, discuss the strengths and weaknesses of the described methods and point out unsolved problems and challenges. In addition, several case studies illustrating the application of methods and technologies used in cultural heritage are presented

Combining remote sensing and household level data for regional scale analysis of land cover change in the Brazilian Amazon

Land cover change in the Brazilian Amazon depends on the spatial variability of political, socioeconomic and biophysical factors, as well as on the land use history and its actors. A regional scale analysis was made in Rondônia State to identify possible differences in land cover change connected to spatial policies of land occupation, size and year of establishment of properties, accessibility measures and soil fertility. The analysis was made based on remote sensing data and household level data gathered with a questionnaire. Both types of analyses indicate that the highest level of total deforestation is found inside agrarian projects, especially in those established more than 20 years ago. Even though deforestation rates are similar inside and outside official settlements, inside agrarian projects forest depletion can exceed 50% at the property level within 10–14 years after establishment. The data indicate that both small-scale and medium to large-scale farmers contribute to deforestation processes in Rondônia State encouraged by spatial policies of land occupation, which provide better accessibility to forest fringes where soil fertility and forest resources are important determinants of location choic