1,808 research outputs found

    Revising the ERDS\u2794: Goals, Opposition and Resolution

    Get PDF

    Explicit linear kernels via dynamic programming

    Get PDF
    Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with the result of Bodlaender et al. [FOCS 2009] on graphs of bounded genus, then generalized by Fomin et al. [SODA 2010] to graphs excluding a fixed minor, and by Kim et al. [ICALP 2013] to graphs excluding a fixed topological minor. Typically, these results guarantee the existence of linear or polynomial kernels on sparse graph classes for problems satisfying some generic conditions but, mainly due to their generality, it is not clear how to derive from them constructive kernels with explicit constants. In this paper we make a step toward a fully constructive meta-kernelization theory on sparse graphs. Our approach is based on a more explicit protrusion replacement machinery that, instead of expressibility in CMSO logic, uses dynamic programming, which allows us to find an explicit upper bound on the size of the derived kernels. We demonstrate the usefulness of our techniques by providing the first explicit linear kernels for rr-Dominating Set and rr-Scattered Set on apex-minor-free graphs, and for Planar-\mathcal{F}-Deletion on graphs excluding a fixed (topological) minor in the case where all the graphs in \mathcal{F} are connected.Comment: 32 page

    ERDS: Emerging Risks Detection Support : 2007 project report

    Get PDF
    Rapport over het detecteren van risico's met de veiligheid van voeding. Aan de hand van het melamineschandaal wordt gekeken hoe in een vroegtijdig stadium risico's onderkend kunnen worde

    Compiling ER Specifications into Declarative Programs

    Full text link
    This paper proposes an environment to support high-level database programming in a declarative programming language. In order to ensure safe database updates, all access and update operations related to the database are generated from high-level descriptions in the entity- relationship (ER) model. We propose a representation of ER diagrams in the declarative language Curry so that they can be constructed by various tools and then translated into this representation. Furthermore, we have implemented a compiler from this representation into a Curry program that provides access and update operations based on a high-level API for database programming.Comment: Paper presented at the 17th Workshop on Logic-based Methods in Programming Environments (WLPE2007

    The mixing time of the switch Markov chains: a unified approach

    Get PDF
    Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results were proved on rapidly mixing Markov chains on unconstrained, bipartite, and directed sequences, using different mechanisms. The aim of this paper is to unify these approaches. We will illustrate the strength of the unified method by showing that on any PP-stable family of unconstrained/bipartite/directed degree sequences the switch Markov chain is rapidly mixing. This is a common generalization of every known result that shows the rapid mixing nature of the switch Markov chain on a region of degree sequences. Two applications of this general result will be presented. One is an almost uniform sampler for power-law degree sequences with exponent γ>1+3\gamma>1+\sqrt{3}. The other one shows that the switch Markov chain on the degree sequence of an Erd\H{o}s-R\'enyi random graph G(n,p)G(n,p) is asymptotically almost surely rapidly mixing if pp is bounded away from 0 and 1 by at least 5lognn1\frac{5\log n}{n-1}.Comment: Clarification

    Earliest Remembered Dreams versus Recent Remembered Dreams

    Get PDF
    This study is to compare the effects of working with Earliest Remembered Dreams (ERD) of individuals to more recent remembered dreams (RRD). A limited body of research examining the characteristics of ERDs (Bulkeley et al. 2005) suggests that many individuals remember a dream from between the age of 3-12 years, and these dreams very often vivid and intense and therefore might facilitate an exploration of salient aspects of the dreamer's early emotional life. However ERDs have never been compared with RRDs to examine if differences exist in their therapeutic value. Each participant was involved in one session with an ERD and one session with an RRD, using the Hill (1996, 2004) model of dream work. The session outcome of these sessions was compared. The study shows that the ERDs reported were 4 times more likely to be nightmares and 2.6 times more likely to be recurrent dreams when compared to RRDs. In terms of session outcome, working with both ERDs and RRDs were found to be equally effective, however the salience of the dream was a significant predictor of the benefit reported by clients
    corecore