60 research outputs found

    On paths-based criteria for polynomial time complexity in proof-nets

    Get PDF
    Girard's Light linear logic (LLL) characterized polynomial time in the proof-as-program paradigm with a bound on cut elimination. This logic relied on a stratification principle and a "one-door" principle which were generalized later respectively in the systems L^4 and L^3a. Each system was brought with its own complex proof of Ptime soundness. In this paper we propose a broad sufficient criterion for Ptime soundness for linear logic subsystems, based on the study of paths inside the proof-nets, which factorizes proofs of soundness of existing systems and may be used for future systems. As an additional gain, our bound stands for any reduction strategy whereas most bounds in the literature only stand for a particular strategy.Comment: Long version of a conference pape

    A tracker alignment framework for augmented reality

    Get PDF
    To achieve accurate registration, the transformations which locate the tracking system components with respect to the environment must be known. These transformations relate the base of the tracking system to the virtual world and the tracking system's sensor to the graphics display. In this paper we present a unified, general calibration method for calculating these transformations. A user is asked to align the display with objects in the real world. Using this method, the sensor to display and tracker base to world transformations can be determined with as few as three measurements

    Typing a Core Binary Field Arithmetic in a Light Logic

    Full text link
    We design a library for binary field arithmetic and we supply a core API which is completely developed in DLAL, extended with a fix point formula. Since DLAL is a restriction of linear logic where only functional programs with polynomial evaluation cost can be typed, we obtain the core of a functional programming setting for binary field arithmetic with built-in polynomial complexity

    A feasible algorithm for typing in Elementary Affine Logic

    Full text link
    We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant without sharing and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time.Comment: 20 page

    An Elementary Affine λ-Calculus with Multithreading and Side Effects

    Get PDF
    International audienceLinear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main contributions are as follows. First, we introduce a modal call-by-value λ-calculus with multithreading and side effects. Second, we provide a combinatorial proof of termination in elementary time for the language. Third, we introduce an elementary affine type system that guarantees the standard subject reduction and progress properties. Finally, we illustrate the programming of iterative functions with side effects in the presented formalism

    Logic Programming and Logarithmic Space

    Full text link
    We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic) computation is given via a synctactic restriction, using an encoding of words that derives from proof theory. We show that the acceptance of a word by an observation (the counterpart of a program in the encoding) can be decided within logarithmic space, by reducing this problem to the acyclicity of a graph. We show moreover that observations are as expressive as two-ways multi-heads finite automata, a kind of pointer machines that is a standard model of logarithmic space computation

    Acceptability and Feasibility of the Telehealth Bariatric Behavioral Intervention to Increase Physical Activity: Protocol for a Single-Case Experimental Study

    Get PDF
    Background: Regular physical activity (PA) is recommended to optimize weight and health outcomes in patients who have undergone metabolic and bariatric surgery (MBS). However, >70% of patients have low PA levels before MBS that persist after MBS. Although behavioral interventions delivered face-to-face have shown promise for increasing PA among patients who have undergone MBS, many may experience barriers, preventing enrollment into and adherence to such interventions. Delivering PA behavior change interventions via telehealth to patients who have undergone MBS may be an effective strategy to increase accessibility and reach, as well as adherence. Objective: This paper reports the protocol for a study that aims to assess the feasibility and acceptability of the protocol or methods and the Telehealth Bariatric Behavioral Intervention (TELE-BariACTIV). The intervention is designed to increase moderate-to-vigorous intensity PA (MVPA) in patients awaiting bariatric surgery and is guided by a multitheory approach and a patient perspective. Another objective is to estimate the effect of the TELE-BariACTIV intervention on presurgical MVPA to determine the appropriate sample size for a multicenter trial. Methods: This study is a multicenter trial using a repeated (ABAB’A) single-case experimental design. The A phases are observational phases without intervention (A1=pre-MBS phase; A2=length personalized according to the MBS date; A3=7 months post-MBS phase). The B phases are interventional phases with PA counseling (B1=6 weekly pre-MBS sessions; B2=3 monthly sessions starting 3 months after MBS). The target sample size is set to 12. Participants are inactive adults awaiting sleeve gastrectomy who have access to a computer with internet and an interface with a camera. The participants are randomly allocated to a 1- or 2-week baseline period (A1). Protocol and intervention feasibility and acceptability (primary outcomes) will be assessed by recording missing data, refusal, recruitment, retention, attendance, and attrition rates, as well as via web-based acceptability questionnaires and semistructured interviews. Data collected via accelerometry (7-14 days) on 8 occasions and via questionnaires on 10 occasions will be analyzed to estimate the effect of the intervention on MVPA. Generalization measures assessing the quality of life, anxiety and depressive symptoms, and theory-based constructs (ie, motivational regulations for PA, self-efficacy to overcome barriers to PA, basic psychological needs satisfaction and frustration, PA enjoyment, and social support for PA; secondary outcomes for a future large-scale trial) will be completed via web-based questionnaires on 6-10 occasions. The institutional review board provided ethics approval for the study in June 2021. Results: Recruitment began in September 2021, and all the participants were enrolled (n=12). Data collection is expected to end in fall 2023, depending on the MBS date of the recruited participants. Conclusions: The TELE-BariACTIV intervention has the potential for implementation across multiple settings owing to its collaborative construction that can be offered remotely

    Incidence and clinical impact of infective endocarditis after transcatheter aortic valve implantation

    Get PDF
    Aims: To describe the characteristics of infective endocarditis (IE) after transcatheter aortic valve implantation (TAVI). Methods and results: This study was performed using the GAMES database, a national prospective registry of consecutive patients with IE in 26 Spanish hospitals. Of the 739 cases of IE diagnosed during the study, 1.3% were post-TAVI IE, and these 10 cases, contributed by five centres, represented 1.1% of the 952 TAVIs performed. Mean age was 80 years. All valves were implanted transfemorally. IE appeared a median of 139 days after implantation. The mean age-adjusted Charlson comorbidity index was 5.45. Chronic kidney disease was frequent (five patients), as were atrial fibrillation (five patients), chronic obstructive pulmonary disease (four patients), and ischaemic heart disease (four patients). Six patients presented aortic valve involvement, and four only mitral valve involvement; the latter group had a higher percentage of prosthetic mitral valves (0% vs. 50%). Vegetations were found in seven cases, and four presented embolism. One patient underwent surgery. Five patients died during follow-up: two of these patients died during the admission in which the valve was implanted. Conclusions: IE is a rare but severe complication after TAVI which affects about 1% of patients and entails a relatively high mortality rate. IE occurred during the first year in nine of the 10 patients

    Deep Brain Stimulation of Nucleus Accumbens Region in Alcoholism Affects Reward Processing

    Get PDF
    The influence of bilateral deep brain stimulation (DBS) of the nucleus nucleus (NAcc) on the processing of reward in a gambling paradigm was investigated using H2[15O]-PET (positron emission tomography) in a 38-year-old man treated for severe alcohol addiction. Behavioral data analysis revealed a less risky, more careful choice behavior under active DBS compared to DBS switched off. PET showed win- and loss-related activations in the paracingulate cortex, temporal poles, precuneus and hippocampus under active DBS, brain areas that have been implicated in action monitoring and behavioral control. Except for the temporal pole these activations were not seen when DBS was deactivated. These findings suggest that DBS of the NAcc may act partially by improving behavioral control
    corecore