Reasoning about embedded dependencies using inclusion dependencies

The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions

On Matrices, Automata, and Double Counting

Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables M, with the same constraint defined by a finite-state automaton A on each row of M and a global cardinality constraint gcc on each column of M. We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the gcc constraints from the automaton A. The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We evaluate the impact of our methods on a large set of nurse rostering problem instances

Tractable Combinations of Global Constraints

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. Previous work has focused on the development of efficient propagators for individual constraints. In this paper, we identify a new tractable class of constraint problems involving global constraints of unbounded arity. To do so, we combine structural restrictions with the observation that some important types of global constraint do not distinguish between large classes of equivalent solutions.Comment: To appear in proceedings of CP'13, LNCS 8124. arXiv admin note: text overlap with arXiv:1307.179

Designer diatom episomes delivered by bacterial conjugation.

Eukaryotic microalgae hold great promise for the bioproduction of fuels and higher value chemicals. However, compared with model genetic organisms such as Escherichia coli and Saccharomyces cerevisiae, characterization of the complex biology and biochemistry of algae and strain improvement has been hampered by the inefficient genetic tools. To date, many algal species are transformable only via particle bombardment, and the introduced DNA is integrated randomly into the nuclear genome. Here we describe the first nuclear episomal vector for diatoms and a plasmid delivery method via conjugation from Escherichia coli to the diatoms Phaeodactylum tricornutum and Thalassiosira pseudonana. We identify a yeast-derived sequence that enables stable episome replication in these diatoms even in the absence of antibiotic selection and show that episomes are maintained as closed circles at copy number equivalent to native chromosomes. This highly efficient genetic system facilitates high-throughput functional characterization of algal genes and accelerates molecular phytoplankton research

A Port Graph Rewriting Approach to Relational Database Modelling

International audienceWe present new algorithms to compute the Syntactic Closure and the Minimal Cover of a set of functional dependencies, using strategic port graph rewriting. We specify a Visual Domain Specific Language to model relational database schemata as port graphs, and provide an extension to port graph rewriting rules. Using these rules we implement strategies to compute a syntactic closure, analyse it and find minimal covers, essential for schema normalisation. The graph program provides a visual description of the computation steps coupled with analysis features not available in other approaches. We prove soundness and completeness of the computed closure. This methodology is implemented in PORGY

Computer aided synthesis: a game theoretic approach

In this invited contribution, we propose a comprehensive introduction to game theory applied in computer aided synthesis. In this context, we give some classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illustrative examples as well as intuitions on the proofs.Comment: Invitation contribution for conference "Developments in Language Theory" (DLT 2017

Associations of hemoglobin A1c with cognition reduced for long diabetes duration

IntroductionAssociations of some risk factors with poor cognition, identified prior to age 75, are reduced or reversed in very old age. The Protected Survivor Model predicts this interaction due to enhanced survival of those with extended risk factor duration. In a younger sample, this study examines the association of cognition with the mean hemoglobin A1c risk factor over the time at risk, according to its duration.MethodsThe interaction of mean hemoglobin A1c (averageâ =â 9.8%), evaluated over duration (averageâ =â 116.8â months), was examined for overall cognition and three cognitive domains in a sample of 150 â youngâ oldâ veterans (mean ageâ =â 70) with type 2 diabetes.ResultsThe predicted interactions were significant for overall cognition and attention, but not executive functions/language and memory.DiscussionFindings extend the Protected Survivor Model to a â youngâ oldâ sample, from the very old. This model suggests focusing on individuals with good cognition despite prolonged high risk when seeking protective factors.Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/152553/1/trc2jtrci201911009.pd