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

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

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

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

Exploring subtle land use and land cover changes: a framework for future landscape studies

UMR AMAP, équipe 3International audienceLand cover and land use changes can have a wide variety of ecological effects, including significant impacts on soils and water quality. In rural areas, even subtle changes in farming practices can affect landscape features and functions, and consequently the environment. Fine-scale analyses have to be performed to better understand the land cover change processes. At the same time, models of land cover change have to be developed in order to anticipate where changes are more likely to occur next. Such predictive information is essential to propose and implement sustainable and efficient environmental policies. Future landscape studies can provide a framework to forecast how land use and land cover changes is likely to react differently to subtle changes. This paper proposes a four step framework to forecast landscape futures at fine scales by coupling scenarios and landscape modelling approaches. This methodology has been tested on two contrasting agricultural landscapes located in the United States and France, to identify possible landscape changes based on forecasting and backcasting agriculture intensification scenarios. Both examples demonstrate that relatively subtle land cover and land use changes can have a large impact on future landscapes. Results highlight how such subtle changes have to be considered in term of quantity, location, and frequency of land use and land cover to appropriately assess environmental impacts on water pollution (France) and soil erosion (US). The results highlight opportunities for improvements in landscape modelling

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry

In this paper, we design parallel write-efficient geometric algorithms that perform asymptotically fewer writes than standard algorithms for the same problem. This is motivated by emerging non-volatile memory technologies with read performance being close to that of random access memory but writes being significantly more expensive in terms of energy and latency. We design algorithms for planar Delaunay triangulation, $k$-d trees, and static and dynamic augmented trees. Our algorithms are designed in the recently introduced Asymmetric Nested-Parallel Model, which captures the parallel setting in which there is a small symmetric memory where reads and writes are unit cost as well as a large asymmetric memory where writes are $\omega$ times more expensive than reads. In designing these algorithms, we introduce several techniques for obtaining write-efficiency, including DAG tracing, prefix doubling, reconstruction-based rebalancing and $\alpha$-labeling, which we believe will be useful for designing other parallel write-efficient algorithms

"The only vaccine that we really question is the new vaccine": A qualitative exploration of the social and behavioural drivers of human papillomavirus (HPV) vaccination in Tonga.

INTRODUCTION: Human papillomavirus (HPV) vaccination is crucial for cervical cancer elimination, particularly in the Pacific where screening and treatment are limited. The HPV vaccine was introduced through schools in Tonga in November 2022 for adolescent girls. Despite high routine childhood vaccine coverage in Tonga, uptake of the HPV vaccine has been slow. This study explored the social and behavioural drivers of HPV and routine childhood vaccination in Tonga to inform tailored strategies to increase vaccine uptake. METHODS: We conducted qualitative interviews and focus groups in Nuku'alofa between June and October 2023 with parents (n = 32), adolescent girls (n = 24), teachers (n = 15), nurses (n = 7), and immunization staff (n = 5). Data were analysed thematically and mapped to the World Health Organization's Behavioural and Social Drivers of vaccination framework. RESULTS: Parents, teachers, and girls had limited knowledge of the HPV vaccine. Some feared it would encourage promiscuity or impact fertility. While trust in routine childhood vaccines was high, participants felt the COVID-19 pandemic had reduced confidence in new vaccines. Some vaccinated girls felt the HPV vaccine offered protection whereas others were afraid of side effects. Practical barriers included non-standardised consent forms that had to be returned to schools, the vaccine rollout timing, and school participation. CONCLUSION: Providing youth, parents and teachers with accurate, culturally appropriate information and supporting teachers to discuss vaccination and facilitate consent may improve HPV vaccine uptake in Tonga

Compressed Indexes for String Searching in Labeled Graphs

Storing and searching large labeled graphs is indeed becoming a key issue in the design of space/time efficient online platforms indexing modern social networks or knowledge graphs. But, as far as we know, all these results are limited to design compressed graph indexes which support basic access operations onto the link structure of the input graph, such as: given a node u, return the adjacency list of u. This paper takes inspiration from the Facebook Unicorn's platform and proposes some compressed-indexing schemes for large graphs whose nodes are labeled with strings of variable length - i.e., node's attributes such as user's (nick-)name - that support sophisticated search operations which involve both the linked structure of the graph and the string content of its nodes. An extensive experimental evaluation over real social networks will show the time and space efficiency of the proposed indexing schemes and their query processing algorithms