100,559 research outputs found

    T. Ballarini, Paolo, 1968

    No full text
    Ménard Jacques E. T. Ballarini, Paolo, 1968. In: Revue des Sciences Religieuses, tome 45, fascicule 2, 1971. p. 175

    Trasvalutazione dei valori e ontologia giuridica. L'ordine giuridico moderno di fronte alla Politica del governo planetario di Nietzsche

    No full text
    A partire da Nietzsche il piano della comprensione del mondo è indicato nella esclusiva fattualità. Su questo piano il diritto assume come compito prioritario l'oltrepassamento della ontologia, qualificata una finzione attuata a scopi di dominio. Dal punto di vista della fattualità l'ontologia e le sue rappresentazioni si rivelano modi e forme di assoggettamento a destini della necessità. Oltrepassare l'ontologia significa così per il diritto garantire condizioni di esistenza nelle quali l'uomo è soggetto in quanto non assoggettato a modi e forme di destino della necessità

    γδ T-Cell Immunophenotype for the Study of Human Aging

    No full text
    Flow cytometry serves as a crucial tool in immunology, allowing for the detailed analysis of immune cell populations. γδ T cells, a subset of T cells, play pivotal roles in immune surveillance and immune aging. Assessing the phenotype and functional capabilities of γδ T cells isolated from whole blood or tissue within the context of human aging yields invaluable insights into the dynamic changes affecting immune function, tissue homeostasis, susceptibility to infections, and inflammatory response

    Letter, [Author unclear] to Paulina T. Merritt

    No full text
    Handwritten letter to Paulina Merritt from an unknown author, October 1, 1876.

    Efficient Parallel Statistical Model Checking of Biochemical Networks

    Get PDF
    We consider the problem of verifying stochastic models of biochemical networks against behavioral properties expressed in temporal logic terms. Exact probabilistic verification approaches such as, for example, CSL/PCTL model checking, are undermined by a huge computational demand which rule them out for most real case studies. Less demanding approaches, such as statistical model checking, estimate the likelihood that a property is satisfied by sampling executions out of the stochastic model. We propose a methodology for efficiently estimating the likelihood that a LTL property P holds of a stochastic model of a biochemical network. As with other statistical verification techniques, the methodology we propose uses a stochastic simulation algorithm for generating execution samples, however there are three key aspects that improve the efficiency: first, the sample generation is driven by on-the-fly verification of P which results in optimal overall simulation time. Second, the confidence interval estimation for the probability of P to hold is based on an efficient variant of the Wilson method which ensures a faster convergence. Third, the whole methodology is designed according to a parallel fashion and a prototype software tool has been implemented that performs the sampling/verification process in parallel over an HPC architecture

    Taming the complexity of biological pathways through parallel computing

    No full text
    Biological systems are characterised by a large number of interacting entities whose dynamics is described by a number of reaction equations. Mathematical methods for modelling biological systems are mostly based on a centralised solution approach: the modelled system is described as a whole and the solution technique, normally the integration of a system of ordinary differential equations (ODEs) or the simulation of a stochastic model, is commonly computed in a centralised fashion. In recent times, research efforts moved towards the definition of parallel/distributed algorithms as a means to tackle the complexity of biological models analysis. In this article, we present a survey on the progresses of such parallelisation efforts describing the most promising results so far obtained

    The relevance of topology in parallel simulation of biological networks

    No full text
    Important achievements in traditional biology have deepened the knowledge about living systems leading to an extensive identification of parts-list of the cell as well as of the interactions among biochemical species responsible for cell's regulation. Such an expanding knowledge also introduces new issues. For example, the increasing comprehension of the interdependencies between pathways (pathways cross-talk) has resulted, on one hand, in the growth of informational complexity, on the other, in a strong lack of information coherence. The overall grand challenge remains unchanged: to be able to assemble the knowledge of every "piece” of a system in order to figure out the behavior of the whole (integrative approach). In light of these considerations, high performance computing plays a fundamental role in the context of in-silico biology. Stochastic simulation is a renowned analysis tool, which, although widely used, is subject to stringent computational requirements, in particular when dealing with heterogeneous and high dimensional systems. Here, we introduce and discuss a methodology aimed at alleviating the burden of simulating complex biological networks. Such a method, which springs from graph theory, is based on the principle of fragmenting the computational space of a simulation trace and delegating the computation of fragments to a number of parallel processes
    corecore