The computer simulation program of a practical scale reverse electrodialysis process has been developed based on the program for saline water electrodialysis. The program is applied to compute the performance of an industrial-scale reverse electrodialysis stack (effective membrane area S = 1 m × 1 m = 1 m2, cell pair number N = 300 pairs). The stack operatingconditions are optimized. Seaw...

The LOD2 Stack is an integrated distribution of aligned tools which support the whole life cycle of Linked Data from extraction, authoring/creation via enrichment, interlinking, fusing to maintenance. The LOD2 Stack comprises new and substantially extended existing tools from the LOD2 project partners and third parties. The stack is designed to be versatile; for all functionality we define clea...

In this paper we give a construction of algebraic (Artin) stacks Pd,g,n endowed with a modular map onto the moduli stack of pointed stable curves Mg,n, for g ≥ 3. The stacks Pd,g,n are smooth, irreducible and have dimension 4g − 3+n. They yield a geometrically meaningful compactification of the degree d universal Picard stack over Mg,n, parametrizing n-pointed smooth curves together with a degr...

Interpretation Abstract Interpretation examples partial evaluation and assert Show low overhead of tabling in meta interpreter due to how tables are implemented as triesInterpretation examples partial evaluation and assert Show low overhead of tabling in meta interpreter due to how tables are implemented as tries CHAPTER META PROGRAMMING AI of a Simple Nested Procedural Language see warren xsb ...

Fuel cells with a PtAu/C anode and a Pr-doped Mn(2)O(3)/C cathode were stacked without using a bipolar plate, and their discharge properties were investigated in a methanol aqueous solution bubbled with air. A three-cell stack exhibited a stack voltage of 2330 mV and a power output of 21 mW.

Embedded speciications in object-oriented (OO) languages such as Eiiel and Sather are based on a rigorous approach towards validation, compatibility and reusability of sequential programs. The underlying method of \design-by-contract" is based on Hoare logic for which concurrency extensions exist. However concurrent OO languages are still in their infancy. They have inherently imperative facets...

We study sorting machines consisting of a stack and a pop stack in series, with or without a queue between them. While there are, a priori, four such machines, only two are essentially different: a pop stack followed directly by a stack, and a pop stack followed by a queue and then by a stack. In the former case, we obtain complete answers for the basis and enumeration of the sortable permutati...

This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in ...