816 research outputs found

    2-Edge-Connectivity and 2-Vertex-Connectivity with Fault Containment

    Get PDF
    Self-stabilization for non-masking fault-tolerant distributed system has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 2-edge-connectivity and 2-vertex-connectivity of an asynchronous distributed computer network. It is based on a self-stabilizing depth-first search, and is not a composite algorithm in the sense that it is not composed of a number of self-stabilizing algorithms that run concurrently. The time and space complexities of the algorithm are the same as those of the underlying self-stabilizing depth-first search algorithm

    Survey of Distributed Decision

    Get PDF
    We survey the recent distributed computing literature on checking whether a given distributed system configuration satisfies a given boolean predicate, i.e., whether the configuration is legal or illegal w.r.t. that predicate. We consider classical distributed computing environments, including mostly synchronous fault-free network computing (LOCAL and CONGEST models), but also asynchronous crash-prone shared-memory computing (WAIT-FREE model), and mobile computing (FSYNC model)

    Self-Stabilization in the Distributed Systems of Finite State Machines

    Get PDF
    The notion of self-stabilization was first proposed by Dijkstra in 1974 in his classic paper. The paper defines a system as self-stabilizing if, starting at any, possibly illegitimate, state the system can automatically adjust itself to eventually converge to a legitimate state in finite amount of time and once in a legitimate state it will remain so unless it incurs a subsequent transient fault. Dijkstra limited his attention to a ring of finite-state machines and provided its solution for self-stabilization. In the years following his introduction, very few papers were published in this area. Once his proposal was recognized as a milestone in work on fault tolerance, the notion propagated among the researchers rapidly and many researchers in the distributed systems diverted their attention to it. The investigation and use of self-stabilization as an approach to fault-tolerant behavior under a model of transient failures for distributed systems is now undergoing a renaissance. A good number of works pertaining to self-stabilization in the distributed systems were proposed in the yesteryears most of which are very recent. This report surveys all previous works available in the literature of self-stabilizing systems

    Self-Stabilizing Computation of 3-Edge-Connected Components

    Get PDF

    Finding 3-edge-connected components in parallel

    Get PDF
    A parallel algorithm for finding 3-edge-connected components of an undirected graph on a CRCW PRAM is presented. The time and work complexity of this algorithm is O(logn) and O((m+n)loglogn), respectively, where n is the number of vertices and m is the number of edges in the input graph. The algorithm is based on ear decomposition and reduction of 3-edge-connectivity to 1-vertex-connectivity. This is the first 3-edge-connected component algorithm of a parallel model

    Improved I/O-efficient algorithms for solving graph connectivity, biconnectivity problems.

    Get PDF

    A Distributed Algorithm for Finding Separation Pairs in a Computer Network

    Get PDF
    One of the main problems in graph theory is graph connectivity which is often studied for network reliability problems.It can be studied from two aspects, vertex-connectivity and edge-connectivity. Vertex connectivity is the smallest number of vertices whose deletion will cause a connected graph to be disconnected. We focus our work on finding separation pairs of a graph which is the set of pairs of vertices that deleting them would disconnect a graph. Finding separation pairs can be used in solving vertex-connectivity problem and finding the triconnected components of the graph. The algorithms presented during the past are non-linear or if linear, very complicated. This work is based on Tarjan and Hopcroft\u27s paper which uses Depth-First Search and finds the separation pairs in linear time. Our goal is to present an algorithm that finds the separation pairs in an asynchronous distributed computer network using distributed Depth-First search (DDFS)

    Efectos y mecanismos psicológicos de los programas basados en mindfulness y compasión: un estudio empleando la tarea de parpadeo atencional emocional y análisis de redes

    Get PDF
    Tesis inédita de la Universidad Complutense de Madrid, Facultad de Psicología, leída el 28/01/2021. Tesis formato europeo (compendio de artículos)Social and scientific interest in meditation effects has increased exponentially over the past three decades (Bernstein et al., 2019). The rising popularity of meditation practices may be best explained by the well-validated standardized formats of the Meditation-Based Programs (MBPs; Creswell, 2017). However, the scope of scientific research has been focused almost exclusively on mindfulness meditation, whereas other forms of meditation have not received the scientific attention they deserve (Dahl & Davidson, 2019), as is the case of compassion meditation (Kirby et al., 2017). Although research on compassion meditation is still scarce, some studies suggest that mindfulness and compassion meditation may yield different psychological effects and mechanisms (Brito-Pons et al., 2018; Fox et al., 2016; Singer & Engert, 2019). Despite the wide range of research on meditation benefits to date, few studies have attempted to empirically examine the mechanisms of change through which meditation produces its effects (Van Dam et al., 2018). Thus, we still do not know exactly how and why meditation works. Theoretical and empirical models of meditation have emphasized the central role of attentional control as the entry door for the rest of the mechanisms (Malinowski, 2013; Tang et al., 2015). More specifically, the study of attentional bias towards emotional stimuli is postulated as a key mechanism for understanding the effects of meditation practice on psychological distress and well-being (De Raedt et al., 2012; Garland et al., 2015a; Kiken & Shook, 2012; Vago & Nakamura, 2011). Despite widespread agreement on the need to expand research on underlying mechanisms of change in psychological interventions, the adequacy of standard statistical approaches to analyze such mechanisms is under debate (Hofmann et al., 2020). As an alternative to traditional mediation models (Hayes, 2009), the relationship between the outcomes and mechanisms of change can be also studied using a network approach (Borsboom & Cramer, 2013). The network approach may be particularly informative of structural psychological changes within individuals after participating in a standardized meditation program...En las últimas tres décadas se ha producido un incremento del interés científico y social sobre los efectos de la práctica de meditación (Bernstein et al., 2019). Una de las razones principales para explicar el aumento de popularidad de la meditación es el formato estandarizado y validado de los denominados Programas Basados en Meditación (MBPs; Creswell, 2017). La investigación científica se ha enfocado casi exclusivamente en la práctica de mindfulness, y otras formas de meditación no han recibido la atención científica que merecen (Dahl & Davidson, 2019), como es el caso de la práctica de compasión (Kirby et al., 2017). Aunque la investigación todavía es escasa, algunos estudios sugieren que la práctica de mindfulness y compasión podrían producir diferentes efectos y mecanismos psicológicos (Brito-Pons et al., 2018; Fox et al., 2016; Singer & Engert, 2019). A pesar del amplio número de investigaciones sobre los beneficios de la meditación, pocos estudios han tratado de examinar empíricamente los mecanismos de cambio a través de los cuales la meditación produce dichos efectos (Van Dam et al., 2018), y todavía desconocemos con exactitud cómo y porqué funciona la meditación. Modelos teóricos y empíricos sobre el funcionamiento de la meditación han enfatizado el papel central que desempeña el control atencional como la puerta de entrada para el resto de mecanismos (Malinowski, 2013; Tang et al., 2015). En concreto, el estudio de los sesgos atencionales hacia estímulos emocionales se postula como un mecanismo clave para entender los efectos de la práctica de meditación en el funcionamiento psicológico (De Raedt et al., 2012; Garland et al., 2015a; Kiken & Shook, 2012; Vago & Nakamura, 2011). A pesar del acuerdo generalizado sobre la necesidad de incrementar la investigación sobre los mecanismos de cambio de las intervenciones psicológicas, el procedimiento estadístico para analizar dichos mecanismos es controvertido (Hofmann et al., 2020). Como alternativa a los modelos mediacionales tradicionales (Hayes, 2009), la relación entre los efectos y mecanismos de cambio puede ser estudiada empleando una aproximación en red (Borsboom & Cramer, 2013)...Fac. de PsicologíaTRUEunpu
    corecore