Computational Complexity of Atomic Chemical Reaction Networks

Informally, a chemical reaction network is "atomic" if each reaction may be interpreted as the rearrangement of indivisible units of matter. There are several reasonable definitions formalizing this idea. We investigate the computational complexity of deciding whether a given network is atomic according to each of these definitions. Our first definition, primitive atomic, which requires each reaction to preserve the total number of atoms, is to shown to be equivalent to mass conservation. Since it is known that it can be decided in polynomial time whether a given chemical reaction network is mass-conserving, the equivalence gives an efficient algorithm to decide primitive atomicity. Another definition, subset atomic, further requires that all atoms are species. We show that deciding whether a given network is subset atomic is in $\textsf{NP}$, and the problem "is a network subset atomic with respect to a given atom set" is strongly $\textsf{NP}$-$\textsf{Complete}$. A third definition, reachably atomic, studied by Adleman, Gopalkrishnan et al., further requires that each species has a sequence of reactions splitting it into its constituent atoms. We show that there is a $\textbf{polynomial-time algorithm}$ to decide whether a given network is reachably atomic, improving upon the result of Adleman et al. that the problem is $\textbf{decidable}$. We show that the reachability problem for reachably atomic networks is $\textsf{Pspace}$-$\textsf{Complete}$. Finally, we demonstrate equivalence relationships between our definitions and some special cases of another existing definition of atomicity due to Gnacadja

Analyzing probabilistic pushdown automata

The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdown automata and their subclasses.V článku je podán přehled známých výsledků o pravděpodobnostních zásobníkových automatech a některých jejich podtřídách

Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

Rewriting Systems for Reachability in Vector Addition Systems with Pairs

15 pagesInternational audienceWe adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting systems and strategies, that allow us to obtain reachability equivalence results between some classes of VASP and VASS. Reachability for the later is well known be equivalent to reachability in Petri nets. VASP generalize also Branching Extension of VASS (BVASS) for which it is unknown if they are more expressive than VASS. We consider here a more restricted notion of reachability for VASP than that for BVASS. However the reachability decision problem corresponding is already equivalent to decidability of the provability in Multiplicative and Exponential Linear Logic (MELL), a question left open for more than 20 years

Proteome-based plasma biomarkers for Alzheimer's disease

Alzheimer's disease is a common and devastating disease for which there is no readily available biomarker to aid diagnosis or to monitor disease progression. Biomarkers have been sought in CSF but no previous study has used two-dimensional gel electrophoresis coupled with mass spectrometry to seek biomarkers in peripheral tissue. We performed a case-control study of plasma using this proteomics approach to identify proteins that differ in the disease state relative to aged controls. For discovery-phase proteomics analysis, 50 people with Alzheimer's dementia were recruited through secondary services and 50 normal elderly controls through primary care. For validation purposes a total of 511 subjects with Alzheimer's disease and other neurodegenerative diseases and normal elderly controls were examined. Image analysis of the protein distribution of the gels alone identifies disease cases with 56% sensitivity and 80% specificity. Mass spectrometric analysis of the changes observed in two-dimensional electrophoresis identified a number of proteins previously implicated in the disease pathology, including complement factor H (CFH) precursor and α-2-macroglobulin (α- 2M). Using semi-quantitative immunoblotting, the elevation of CFH and α- 2M was shown to be specific for Alzheimer's disease and to correlate with disease severity although alternative assays would be necessary to improve sensitivity and specificity. These findings suggest that blood may be a rich source for biomarkers of Alzheimer's disease and that CFH, together with other proteins such as α- 2M may be a specific markers of this illness. © 2006 The Author(s).link_to_subscribed_fulltex

Comprehending Isabelle/HOL's consistency

The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc overloading of constants. It turns out that the interaction between the standard HOL type definitions and the Isabelle-specific ad hoc overloading is problematic for the logical consistency. In previous work, we have argued that standard HOL semantics is no longer appropriate for capturing this interaction, and have proved consistency using a nonstandard semantics. The use of an exotic semantics makes that proof hard to digest by the community. In this paper, we prove consistency by proof-theoretic means—following the healthy intuition of definitions as abbreviations, realized in HOLC, a logic that augments HOL with comprehension types. We hope that our new proof settles the Isabelle/HOL consistency problem once and for all. In addition, HOLC offers a framework for justifying the consistency of new deduction schemas that address practical user needs

Small but crucial : the novel small heat shock protein Hsp21 mediates stress adaptation and virulence in Candida albicans

Peer reviewedPublisher PD

Enhancement of immune response of HBsAg loaded poly(L-lactic acid) microspheres against Hepatitis B through incorporation of alum and chitosan

Purpose: Poly (L-lactic acid) (PLA) microparticles encapsulating Hepatitis B surface antigen (HBsAg) with alum and chitosan were investigated for their potential as a vaccine delivery system. Methods: The microparticles, prepared using a water-in-oil-in-water (w/o/w) double emulsion solvent evaporation method with polyvinyl alcohol (PVA) or chitosan as the external phase stabilising agent showed a significant increase in the encapsulation efficiency of the antigen. Results: PLA-Alum and PLA-chitosan microparticles induced HBsAg serum specific IgG antibody responses significantly higher than PLA only microparticles and free antigen following subcutaneous administration. Chitosan not only imparted a positive charge to the surface of the microparticles but was also able to increase the serum specific IgG antibody responses significantly. Conclusions: The cytokine assays showed that the serum IgG antibody response induced is different according to the formulation, indicated by the differential levels of interleukin 4 (IL-4), interleukin 6 (IL-6) and interferon gamma (IFN-γ). The microparticles eliciting the highest IgG antibody response did not necessarily elicit the highest levels of the cytokines IL-4, IL-6 and IFN-γ