Effect of thermal alkaline pretreatment on the anaerobic digestion of wasted activated sludge

The effect of alkaline pretreatment of waste-activated sludge, using two models to study the sequential hydrolysis rates of suspended (Sanders' surface model) and dissolved (Goel's saturation model) solids, on the mesophilic and thermophilic anaerobic digestion rate is evaluated. The pretreatment, which reduces the size of the solids, increases the reaction rate by increasing the surface area and the specific surface hydrolysis constant (K(SBK)); at thermophilic conditions from 0.45 x 10(-3) kg m(-2) d(-1) for the fresh sludge to 0.74 x 10(-3) kg m(-2) d(-1) for the pretreated sludge and at mesophilic conditions these values are 0.28 x 10(-3) kg m(-2) d(-1) and 0.47 x 10(-3) kg m(-2) d(-1) confirming the usefulness of a pretreatment for solids reduction. But for soluble solids, the thermoalkaline pretreatment decreases the reaction rates by inducing a competitive inhibition on the thermophilic anaerobic digestion rate while in the mesophilic range, a non-competitive inhibition is observed. A mathematical simulation of the consecutive reactions, suspended solids to dissolved solids and to methane in staged anaerobic thermophilic-mesophilic digestion, shows that with 4% suspended solids concentration it is better not to use a thermoalkaline pretreatment because overall solids reduction and total methane production are not as good as without pretreatment.     

Maintaining strong mutual visibility of an evader moving over the reduced visibility graph

In this paper, we address the problem of determining whether a mobile robot, called the pursuer, is able to maintain strong mutual visibility (a visibility notion between regions over a convex partition of the environment) of an antagonist agent, called the evader. We frame the problem as a non cooperative game. We consider the case in which the pursuer and the evader move at bounded speed, traveling in a known polygonal environment with or without holes, and in which there are no restrictions as to the distance that might separate the agents. Unlike our previous efforts (Murrieta-Cid et al. in Int J Robot Res 26:233–253, 2007), we give special attention to the combinatorial problem that arises when searching for a solution through visiting several locations in an environment with obstacles. In this paper we take a step further, namely, we assume an antagonistic evader who moves continuously and unpredictably, but with a constraint over its set of admissible motion policies, as the evader moves in the shortest-path roadmap, also called the reduced visibility graph (RVG). The pursuer does not know which among the possible paths over the RVG the evader will choose, but the pursuer is free to move within all the environment. We provide a constructive method to solve the decision problem of determining whether or not the pursuer is able to maintain strong mutual visibility of the evader. This method is based on an algorithm that computes the safe areas (areas that keep evader surveillance) at all times. We prove decidability of this problem, and provide a complexity measure to this evader surveillance game; both contributions hold for any general polygonal environment that might or not contain holes. All our algorithms have been implemented and we show simulation results.     

On intranode impairments and engineering rules for an optical label switching router supporting an FSK/IM labeling scheme

This paper presents a study on intranode impairments and engineering rules for a label switching router supporting intensity modulated (IM) optical payload data signals labeled by using frequency-shift key (FSK) modulation. Engineering rules and design guidelines are presented regarding the choice of system parameters such as IM extinction ratio, FSK frequency deviation, alignment of optical filtering stages, label swapping, and node cascadability. The presented rules are derived from insights obtained from computer simulations and experimental validation for a 10-Gb/s IM payload signal.     

Hybrid RSOA and fibre Raman amplified long reach feeder link for WiMAX-on-fibre

A distributed fibre Raman amplified long reach optical access feeder link using a reflective semiconductor optical amplifier in the remote base station is experimentally demonstrated for supporting WiMAX-over-fibre transmission. The measured values for the error vector magnitude for quadrature phase shift keying and 16-ary quadrature amplitude modulation after 40 km of fibre transmission meet the IEEE 820.16 standard requirements.     

Biofuels in Spain: Market penetration analysis and competitiveness in the automotive fuel market

For several years the European Union (E.U.) has been promoting the use of biofuels due to their potential benefits such as the reduction of dependence on foreign energy imports (the raw materials can be produced within the E.U.), the more stable fossil fuel prices (they can replace fossil fuels on the market), the greenhouse gas (GHG) reduction (biofuels’ raw materials fix CO₂ from the atmosphere) and the fact that they can represent an additional source of income for the primary sector (biofuels’ raw materials are vegetables that can be grown and harvested).Despite the public aids (direct and indirect), biofuels are not competitive with fossil fuels at present, but it is possible that in the future the environment conditions change and biofuels might become competitive. It is difficult to assess whether this will happen or not, but it is possible to make an assessment of a future situation.This article presents two analyses with one objective: to determine if biofuels might become competitive in the future. The first analysis examines the dependencies of two quotations which have a strong relationship with fuels: the crude oil quotation and the CO₂ bond quotation. The analysis of these relationships may help to forecast the future competitiveness of biofuels. For instance, biofuels’ future competitiveness will be higher if their raw material costs are not related to crude oil quotations or if they are related in a negative way (the higher the crude oil quotations the lower the raw material biofuels’ cost). The second analysis focuses on the market penetration of biofuels in the Spanish market. There are data related to biofuels monthly consumption in Spain since 2007 and it is possible to know if biofuels are gaining market quota since then.     

Poly(sulphopropylbetaines): 1. Synthesis and characterization

The synthesis of aromatic and aliphatic poly(sulphopropylbetaines) is described within the series of vinylpyridines and tertiary amino-methacrylates. Two complementary strategies were used: (a) preparation and free radical polymerization in aqueous solution (60°C, 4,4'-azobiscyanovaleric acid) of the monomers; (b) heterogeneous quaternization of preformed poly(vinylpyridines) and poly(tertiary amino-methacrylates) by 1,3-propanesultone in propylene carbonate or tetramethylene sulphone solution (120°C). The high molecular weight poly (zwitterions) ($\text{10}{}^5\text{<}\text{M}\text{?}{}_{\mathrm{W}}\text{< 5 × 10}{}^6$) were characterized by ultra-violet and ¹H nuclear magnetic resonance spectroscopy, and their water affinity at 20°C was estimated by water vapour absorption measurements.     

Predicate Synthesis for Correcting Faulty Conjectures: The Proof Planning Paradigm

The synthesis of programs as well as other synthetic tasks often end up with an unprovable, partially false conjecture. A successful subsequent synthesis attempt depends on determining why the conjecture is faulty and how it can be corrected. Hence, it is highly desirable to have an automated means for detecting and correcting faulty conjectures.We introduce a method for patching faulty conjectures. The method is based on abduction and performs its task during an attempt to prove a given conjecture. On input X. G(X), the method builds a definition for a corrective predicate, P(X), such that X. P(X) G(X) is a theorem. The synthesis of a corrective predicate is guided by the constructive principle of formulae as types, relating inference with computation.We take the construction of a corrective predicate as a program transformation task. The method consists of a collection of construction commands. A construction command is a small program that makes use of one or more program editing commands, geared towards building recursive, equational procedures.A synthesised corrective predicate is guaranteed to be correct, turning a faulty conjecture into a theorem. Whether conditional or not, it will be well-defined. If recursive, it will also be terminating.Our method is amenable to mechanisation, but careful search guidance is required for making a productive use of the failure of a proof. A failed proof attempt quickly yields a huge, possibly infinite, deduction tree, giving rise to exponentially many abductive explanations. We suggest that a proof planning approach can structure the task of correcting a formula in such a way as to allow significant automation, while dramatically restricting the search space.     

A Method for Patching Interleaving-Replay Attacks in Faulty Security Protocols

The verification of security protocols has attracted a lot of interest in the formal methods community, yielding two main verification approaches: i) state exploration, e.g. FDR [Gavin Lowe. Breaking and fixing the needham-schroeder public-key protocol using FDR. In TACAs'96: Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems, pages 147–166, London, UK, 1996. Springer-Verlag] and OFMC [A.D. Basin, S. Mödersheim, and L. Viganò. An on-the-fly model-checker for security protocol analysis. In D. Gollmann and E. Snekkenes, editors, ESORICS'03: 8th European Symposium on Research in Computer Security, number 2808 in Lecture Notes in Computer Science, pages 253–270, Gjøvik, Norway, 2003. Springer-Verlag]; and ii) theorem proving, e.g. the Isabelle inductive method [Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal in Computer Security, 6(1-2):85–128, 1998] and Coral [G. Steel, A. Bundy, and M. Maidl. Attacking the asokan-ginzboorg protocol for key distribution in an ad-hoc bluetooth network using coral. In H. König, M. Heiner, and A. Wolisz, editors, IFIP TC6 /WG 6.1: Proceedings of 23rd IFIP International Conference on Formal Techniques for Networked and Distributed Systems, volume 2767, pages 1–10, Berlin, Germany, 2003. FORTE 2003 (work in progress papers)]. Complementing formal methods, Abadi and Needham's principles aim to guide the design of security protocols in order to make them simple and, hopefully, correct [M. Abadi and R. Needham. Prudent engineering practice for cryptographic protocols. IEEE Transactions on Software Engineering, 22(1):6–15, 1996]. We are interested in a problem related to verification but far less explored: the correction of faulty security protocols. Experience has shown that the analysis of counterexamples or failed proof attempts often holds the key to the completion of proofs and for the correction of a faulty model. In this paper, we introduce a method for patching faulty security protocols that are susceptible to an interleaving-replay attack. Our method makes use of Abadi and Needham's principles for the prudent engineering practice for cryptographic protocols in order to guide the location of the fault in a protocol as well as the proposition of candidate patches. We have run a test on our method with encouraging results. The test set includes 21 faulty security protocols borrowed from the Clark-Jacob library [J. Clark and J. Jacob. A survey of authentication protocol literature: Version 1.0. Technical report, Department of Computer Science, University of York, November 1997. A complete specification of the Clark-Jacob library in CAPSL is available at http://www.cs.sri.com/millen/capsl/].