Observation of implicit complexity by non confluence

We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of cons-free programs, the class of programs with an interpretation, and the class of programs with a quasi-interpretation together with a termination proof by the product path ordering. They all correspond to PTIME. We prove that adding non confluence to the rules leads to respectively PTIME, NPTIME and PSPACE. Our thesis is that the separation of the classes is actually a witness of the intentional properties of the initial classes of programs

The term risk: etymology, legal definition and various traits

open5noThe etymology of the term risk and its legal qualification and definitions are reported in this article; decription of the various traits of the term risk used in food safety management (acceptable risk, current risk, emerging risk, crude risk, unrestricted risk, perceived risk, real risk, residual risk, reduced risk, baseline risk, serious risk, major technological risk, etc.) are presented and discussed.openLiuzzo G.; Bentley S.; Giacometti F.; Bonfante E.; Serraino A.Liuzzo G.; Bentley S.; Giacometti F.; Bonfante E.; Serraino A

Resource Control for Synchronous Cooperative Threads

We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a \emph{synchronous} model of interaction based on cooperative threads whose execution proceeds in synchronous rounds called instants. Our contribution is a system of compositional static analyses to guarantee that each instant terminates and to bound the size of the values computed by the system as a function of the size of its parameters at the beginning of the instant. Our method generalises an approach designed for first-order functional languages that relies on a combination of standard termination techniques for term rewriting systems and an analysis of the size of the computed values based on the notion of quasi-interpretation. We show that these two methods can be combined to obtain an explicit polynomial bound on the resources needed for the execution of the system during an instant. As a second contribution, we introduce a virtual machine and a related bytecode thus producing a precise description of the resources needed for the execution of a system. In this context, we present a suitable control flow analysis that allows to formulte the static analyses for resource control at byte code level

Exceptional response to immunotherapy in association with radiotherapy in patient with breast metastasis from urothelial carcinoma: A case report

Most common sites of metastasis of urothelial carcinoma (UC) are lungs, liver, lymph nodes and bone. Pembrolizumab, a humanized monoclonal antibody directed against programmed cell death protein-1 (PD-1), represents an effective second-line therapy for advanced UC. Radiotherapy has been shown to induce a mechanism of immunogenic cell death (ICD) resulting in immune memory and advantageous systemic effects. We present the first case of breast metastasis (BM) from a UC described in literature who had an exceptional response to second-line therapy with pembrolizumab in association with radiotherapy, showing the efficacy of combining immunotherapy and radiotherapy even in patients with atypical metastatic sites

Complexity Bounds for Ordinal-Based Termination

`What more than its truth do we know if we have a proof of a theorem in a given formal system?' We examine Kreisel's question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program running times. Our main tool for this are length function theorems, which provide complexity bounds on the use of well quasi orders. We illustrate how to prove such theorems in the simple yet until now untreated case of ordinals. We show how to apply this new theorem to derive complexity bounds on programs when they are proven to terminate thanks to a ranking function into some ordinal.Comment: Invited talk at the 8th International Workshop on Reachability Problems (RP 2014, 22-24 September 2014, Oxford

Truffle genomics and post-genomics to understand the symbiotc life-style

International audienc

Volumetric and anatomical MRI for hypoxic-ischemic encephalopathy: relationship to hypothermia therapy and neurosensory impairments.

OBJECTIVE: To relate volumetric magnetic resonance imaging (MRI) findings to hypothermia therapy and neurosensory impairments. STUDY DESIGN: Newborns \u3e or =36 weeks\u27 gestation with hypoxic-ischemic encephalopathy who participated in the National Institute of Child Health and Human Development hypothermia randomized trial at our center were eligible. We determined the relationship between hypothermia treatment and usual care (control) to absolute and relative cerebral tissue volumes. Furthermore, we correlated brain volumes with death or neurosensory impairments at 18 to 22 months. RESULT: Both treatment groups were comparable before randomization. Total brain tissue volumes did not differ in relation to treatment assignment. However, relative volumes of subcortical white matter were significantly larger in hypothermia-treated than control infants. Furthermore, relative total brain volumes correlated significantly with death or neurosensory impairments. Relative volumes of the cortical gray and subcortical white matter also correlated significantly with Bayley Scales psychomotor development index. CONCLUSION: Selected volumetric MRI findings correlated with hypothermia therapy and neurosensory impairments. Larger studies using MRI brain volumes as a secondary outcome measure are needed