296 research outputs found
Population prevalence of edentulism and its association with depression and self-rated health
Edentulism is associated with various adverse health outcomes but treatment options in low- and middle-income countries (LMICs) are limited. Data on its prevalence and its effect on mental health and overall-health is lacking, especially from LMICs. Self-reported data on complete edentulism obtained by standardized questionnaires on 201,953 adults aged ≥18 years from 50 countries which participated in the World Health Survey (WHS) 2002-2004 were analyzed. Age and sex-standarized edentulism prevalence ranged from 0.1% (95% CI = 0.0-0.3) (Myanmar) to 14.5% (95% CI = 13.1-15.9) (Zimbabwe), and 2.1% (95% CI = 1.5-3.0) (Ghana) to 32.3% (95% CI = 29.0-35.8) (Brazil) in the younger and older age groups respectively. Edentulism was significantly associated with depression (OR 1.57, 95% CI = 1.23-2.00) and poor self-rated health (OR 1.38, 95% CI = 1.03-1.83) in the younger group with no significant associations in the older age group. Our findings highlight the edentulism-related health loss in younger persons from LMICs. The relative burden of edentulism is likely to grow as populations age and live longer. Given its life-long nature and common risk factors with other NCDs, edentulism surveillance and prevention should be an integral part of the global agenda of NCD control
Monadic Intersection Types, Relationally (Extended Version)
We extend intersection types to a computational -calculus with
algebraic operations \`a la Plotkin and Power. We achieve this by considering
monadic intersections, whereby computational effects appear not only in the
operational semantics, but also in the type system. Since in the effectful
setting termination is not anymore the only property of interest, we want to
analyze the interactive behavior of typed programs with the environment.
Indeed, our type system is able to characterize the natural notion of
observation, both in the finite and in the infinitary setting, and for a wide
class of effects, such as output, cost, pure and probabilistic nondeterminism,
and combinations thereof. The main technical tool is a novel combination of
syntactic techniques with abstract relational reasoning, which allows us to
lift all the required notions, e.g. of typability and logical relation, to the
monadic setting
Reachability for dynamic parametric processes
In a dynamic parametric process every subprocess may spawn arbitrarily many,
identical child processes, that may communicate either over global variables,
or over local variables that are shared with their parent.
We show that reachability for dynamic parametric processes is decidable under
mild assumptions. These assumptions are e.g. met if individual processes are
realized by pushdown systems, or even higher-order pushdown systems. We also
provide algorithms for subclasses of pushdown dynamic parametric processes,
with complexity ranging between NP and DEXPTIME.Comment: 31 page
Syntactically and semantically regular languages of lambda-terms coincide through logical relations
A fundamental theme in automata theory is regular languages of words and
trees, and their many equivalent definitions. Salvati has proposed a
generalization to regular languages of simply typed -terms, defined
using denotational semantics in finite sets.
We provide here some evidence for its robustness. First, we give an
equivalent syntactic characterization that naturally extends the seminal work
of Hillebrand and Kanellakis connecting regular languages of words and
syntactic -definability. Second, we show that any finitary extensional
model of the simply typed -calculus, when used in Salvati's
definition, recognizes exactly the same class of languages of -terms
as the category of finite sets does.
The proofs of these two results rely on logical relations and can be seen as
instances of a more general construction of a categorical nature, inspired by
previous categorical accounts of logical relations using the gluing
construction.Comment: The proofs on "finitely pointable" CCCs in versions 1 and 2 were
wrong; we now make slightly weaker claims on well-pointed locally finite
CCCs. New in this version: added reference [3] and official DOI (proceedings
of CSL 2024
Near-Optimal Scheduling for LTL with Future Discounting
We study the search problem for optimal schedulers for the linear temporal
logic (LTL) with future discounting. The logic, introduced by Almagor, Boker
and Kupferman, is a quantitative variant of LTL in which an event in the far
future has only discounted contribution to a truth value (that is a real number
in the unit interval [0, 1]). The precise problem we study---it naturally
arises e.g. in search for a scheduler that recovers from an internal error
state as soon as possible---is the following: given a Kripke frame, a formula
and a number in [0, 1] called a margin, find a path of the Kripke frame that is
optimal with respect to the formula up to the prescribed margin (a truly
optimal path may not exist). We present an algorithm for the problem; it works
even in the extended setting with propositional quality operators, a setting
where (threshold) model-checking is known to be undecidable
LIPIcs
Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. Nonetheless there is surprisingly little language and verification support to build distributed systems based on fault-tolerant algorithms. In this paper, we present some of the challenges that a designer has to overcome to implement a fault-tolerant distributed system. Then we review different models that have been proposed to reason about distributed algorithms and sketch how such a model can form the basis for a domain-specific programming language. Adopting a high-level programming model can simplify the programmer's life and make the code amenable to automated verification, while still compiling to efficiently executable code. We conclude by summarizing the current status of an ongoing language design and implementation project that is based on this idea
- …