Cell module and fuel conditioner development

The efforts performed to develop a phosphoric acid fuel cell (PAFC) stack design having a 10 kW power rating for operation at higher than atmospheric pressure based on the existing Mark II design configuration are described. The work involves: (1) Performance of pertinent functional analysis, trade studies and thermodynamic cycle analysis for requirements definition and system operating parameter selection purposes, (2) characterization of fuel cell materials and components, and performance testing and evaluation of the repeating electrode components, (3) establishment of the state-of-the-art manufacturing technology for all fuel cell components at Westinghouse and the fabrication of short stacks of various sites, and (4) development of a 10 kW PAFC stack design for higher pressure operation utilizing the top down systems engineering approach

Gas cooled fuel cell systems technology development

The work performed during the Second Logical Unit of Work of a multi-year program designed to develop a phosphoric acid fuel cell (PAFC) for electric utility power plant application is discussed. The Second Logical Unit of Work, which covers the period May 14, 1983 through May 13, 1984, was funded by the U.S. Department of Energy, Office of Fossil Energy, Morgantown Energy Technology Center, and managed by the NASA Lewis Research Center

Gas cooled fuel cell systems technology development

The first phase of a planned multiphase program to develop a Phosphoric is addressed. This report describes the efforts performed that culminated in the: (1) Establishment of the preliminary design requirements and system conceptual design for the nominally rated 375 kW PAFC module and is interfacing power plant systems; (2) Establishment of PAFC component and stack performance, endurance, and design parameter data needed for design verification for power plant application; (3) Improvement of the existing PAFC materials data base and establishment of materials specifications and process procedes for the cell components; and (4) Testing of 122 subscale cell atmospheric test for 110,000 cumulative test hours, 12 subscale cell pressurized tests for 15,000 cumulative test hours, and 12 pressurized stack test for 10,000 cumulative test hours

Markov chain aggregation and its application to rule-based modelling

Rule-based modelling allows to represent molecular interactions in a compact and natural way. The underlying molecular dynamics, by the laws of stochastic chemical kinetics, behaves as a continuous-time Markov chain. However, this Markov chain enumerates all possible reaction mixtures, rendering the analysis of the chain computationally demanding and often prohibitive in practice. We here describe how it is possible to efficiently find a smaller, aggregate chain, which preserves certain properties of the original one. Formal methods and lumpability notions are used to define algorithms for automated and efficient construction of such smaller chains (without ever constructing the original ones). We here illustrate the method on an example and we discuss the applicability of the method in the context of modelling large signalling pathways

Static Safety for an Actor Dedicated Process Calculus by Abstract Interpretation

The actor model eases the definition of concurrent programs with non uniform behaviors. Static analysis of such a model was previously done in a data-flow oriented way, with type systems. This approach was based on constraint set resolution and was not able to deal with precise properties for communications of behaviors. We present here a new approach, control-flow oriented, based on the abstract interpretation framework, able to deal with communication of behaviors. Within our new analyses, we are able to verify most of the previous properties we observed as well as new ones, principally based on occurrence counting

Nowoczesne rozwiązania telefonicznych central abonenckich. Przegląd Zagadnień Łączności, 1963, nr 6 (21)

Opracowania na podstawie artykułó

Combinatorial Complexity and Compositional Drift in Protein Interaction Networks

The assembly of molecular machines and transient signaling complexes does not typically occur under circumstances in which the appropriate proteins are isolated from all others present in the cell. Rather, assembly must proceed in the context of large-scale protein-protein interaction (PPI) networks that are characterized both by conflict and combinatorial complexity. Conflict refers to the fact that protein interfaces can often bind many different partners in a mutually exclusive way, while combinatorial complexity refers to the explosion in the number of distinct complexes that can be formed by a network of binding possibilities. Using computational models, we explore the consequences of these characteristics for the global dynamics of a PPI network based on highly curated yeast two-hybrid data. The limited molecular context represented in this data-type translates formally into an assumption of independent binding sites for each protein. The challenge of avoiding the explicit enumeration of the astronomically many possibilities for complex formation is met by a rule-based approach to kinetic modeling. Despite imposing global biophysical constraints, we find that initially identical simulations rapidly diverge in the space of molecular possibilities, eventually sampling disjoint sets of large complexes. We refer to this phenomenon as “compositional drift”. Since interaction data in PPI networks lack detailed information about geometric and biological constraints, our study does not represent a quantitative description of cellular dynamics. Rather, our work brings to light a fundamental problem (the control of compositional drift) that must be solved by mechanisms of assembly in the context of large networks. In cases where drift is not (or cannot be) completely controlled by the cell, this phenomenon could constitute a novel source of phenotypic heterogeneity in cell populations

Automatic Verification of Erlang-Style Concurrency

This paper presents an approach to verify safety properties of Erlang-style, higher-order concurrent programs automatically. Inspired by Core Erlang, we introduce Lambda-Actor, a prototypical functional language with pattern-matching algebraic data types, augmented with process creation and asynchronous message-passing primitives. We formalise an abstract model of Lambda-Actor programs called Actor Communicating System (ACS) which has a natural interpretation as a vector addition system, for which some verification problems are decidable. We give a parametric abstract interpretation framework for Lambda-Actor and use it to build a polytime computable, flow-based, abstract semantics of Lambda-Actor programs, which we then use to bootstrap the ACS construction, thus deriving a more accurate abstract model of the input program. We have constructed Soter, a tool implementation of the verification method, thereby obtaining the first fully-automatic, infinite-state model checker for a core fragment of Erlang. We find that in practice our abstraction technique is accurate enough to verify an interesting range of safety properties. Though the ACS coverability problem is Expspace-complete, Soter can analyse these verification problems surprisingly efficiently.Comment: 12 pages plus appendix, 4 figures, 1 table. The tool is available at http://mjolnir.cs.ox.ac.uk/soter

Stochastic fragments: A framework for the exact reduction of the stochastic semantics of rule-based models

In this paper, we propose an abstract interpretation-based framework for reducing the state space of stochastic semantics for protein protein interaction networks. Our approach consists in quotienting the state space of networks. Yet interestingly, we do not apply the widelyused strong lumpability criterion which imposes that two equivalent states behave similarly with respect to the quotient, but a weak version of it. More precisely, our framework detects and proves some invariants about the dynamics of the system: indeed the quotient of the state space is such that the probability of being in a given state knowing that this state is in a given equivalence class, is an invariant of the semantics. Then we introduce an individual-based stochastic semantics (where each agent is identified by a unique identifier) for the programs of a rulebased language (namely Kappa) and we use our abstraction framework for deriving a sound population-based semantics and a sound fragments based semantics, which give the distribution of the traces respectively for the number of instances of molecular species and for the number of instances of partially defined molecular species. These partially defined species are chosen automatically thanks to a dependency analysis which is also described in the paper