Studies on two-phase co-current air/non-Newtonian shear-thinning fluid flows in inclined smooth pipes

In this work. co-current flow characteristics of air/non-Newtonian liquid systems in inclined smooth pipes are studied experimentally and theoretically using transparent tubes of 20, 40 and 60 turn in diameter. Each tube includes two 10 m lone pipe branches connected by a U-bend that is capable of being inclined to any angle, from a completely horizontal to a fully vertical position. The flow rate of each phase is varied over a wide range. The studied flow phenomena are bubbly, plug flow, slug flow, churn flow and annular flow. These are observed and recorded by a high flow. stratified flow. -speed camera over a wide range of operating conditions. The effects of the liquid phase properties, the inclination angle and the pipe diameter on two-phase flow characteristics are systematically studied. The Heywood-Charles model for horizontal flow was modified to accommodate stratified flow in inclined pipes, taking into account the average void fraction and pressure drop of the mixture flow of a gas/non-Newtonian liquid. The pressure drop gradient model of Taitel and Barnea for a gas/Newtonian liquid slug flow was extended to include liquids possessing shear-thinning flow behaviour in inclined pipes. The comparison of the predicted values with the experimental data shows that the models presented here provide a reasonable estimate of the average void fraction and the corresponding pressure drop for the mixture flow of a gas/ non-Newtonian liquid. (C) 2007 Elsevier Ltd. All rights reserved.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Design,optimization and in vivo evaluation of non-viral vectors for gene therapy. Applications in ocular disorders

227 págs.

Assessing the sustainability of brackish water aquaculture systems in the Philippines. Working Paper 4: Aquaculture and poverty - a case study of five coastal communities in the Philippines

After reviewing the rather thin literature on the subject, we investigate the relationship between aquaculture and poverty based on a case study of five coastal communities in the Philippines. The analysis relies on a data set collated through a questionnaire survey of 148 households randomly selected in these five communities. The methodological approach combines the qualitative analysis of how this relationship is perceived by the surveyed households and a quantitative analysis of the levels and determinants of poverty and inequality in these communities. There is overwhelming evidence that aquaculture benefits the poor in important ways and that it is perceived very positively by the poor and non-poor alike. In particular, the poor derive a relatively larger share of their income from aquaculture than the rich, and a lowering of the poverty line only reinforces this result. Further, a Gini decomposition exercise shows unambiguously that aquaculture represents an inequality-reducing source of income. We believe that the pro-poor character of brackish water aquaculture in the study areas is explained by the fact that the sector provides employment to a large number of unskilled workers in communities characterized by large surpluses of labour. Our results also suggest that the analysis of the relationship between aquaculture and poverty should not focus exclusively on the socio-economic status of the farm operator/owner, as has often been the case in the past. [PDF contains 51 pages]

FTT-MA: A Flexible Time-Triggered Middleware Architecture for Time Sensitive, Resource-Aware AmI Systems

There is an increasing number of Ambient Intelligence (AmI) systems that are time-sensitive and resource-aware. From healthcare to building and even home/office automation, it is now common to find systems combining interactive and sensing multimedia traffic with relatively simple sensors and actuators (door locks, presence detectors, RFIDs, HVAC, information panels, etc.). Many of these are today known as Cyber-Physical Systems (CPS). Quite frequently, these systems must be capable of (1) prioritizing different traffic flows (process data, alarms, non-critical data, etc.), (2) synchronizing actions in several distributed devices and, to certain degree, (3) easing resource management (e.g., detecting faulty nodes, managing battery levels, handling overloads, etc.). This work presents FTT-MA, a high-level middleware architecture aimed at easing the design, deployment and operation of such AmI systems. FTT-MA ensures that both functional and non-functional aspects of the applications are met even during reconfiguration stages. The paper also proposes a methodology, together with a design tool, to create this kind of systems. Finally, a sample case study is presented that illustrates the use of the middleware and the methodology proposed in the paper.

Investigation on average void fraction for air/non-Newtonian power-law fluids two-phase flow in downward inclined pipes

The present work has been carried out to investigate on the average void fraction of gas/non-Newtonian fluids flow in downward inclined pipes. The influences of pipe inclination angle on the average void fraction were studied experimentally. A simple correlation, which incorporated the method of Vlachos et al. for gas/Newtonain fluid horizontal flow, the correction factor of Farooqi and Richardson and the pipe inclination angle, was proposed to predict the average void fraction of gas/non-Newtonian power-law stratified flow in downward inclined pipes. The correlation was based on 470 data points covering a wide range of flow rates for different systems at diverse angles. A good agreement was obtained between theory and data and the fitting results could describe the majority of the experimental data within ±20%.

Nonlinear oscillations in discrete and continuous systems

The first thesis topic is a perturbation method for resonantly coupled nonlinear oscillators. By successive near-identity transformations of the original equations, one obtains new equations with simple structure that describe the long time evolution of the motion. This technique is related to two-timing in that secular terms are suppressed in the transformation equations. The method has some important advantages. Appropriate time scalings are generated naturally by the method, and don't need to be guessed as in two-timing. Furthermore, by continuing the procedure to higher order, one extends (formally) the time scale of valid approximation. Examples illustrate these claims. Using this method, we investigate resonance in conservative, non-conservative and time dependent problems. Each example is chosen to highlight a certain aspect of the method.

The second thesis topic concerns the coupling of nonlinear chemical oscillators. The first problem is the propagation of chemical waves of an oscillating reaction in a diffusive medium. Using two-timing, we derive a nonlinear equation that determines how spatial variations in the phase of the oscillations evolves in time. This result is the key to understanding the propagation of chemical waves. In particular, we use it to account for certain experimental observations on the Belusov-Zhabotinskii reaction.

Next, we analyse the interaction between a pair of coupled chemical oscillators. This time, we derive an equation for the phase shift, which measures how much the oscillators are out of phase. This result is the key to understanding M. Marek's and I. Stuchl's results on coupled reactor systems. In particular, our model accounts for synchronization and its bifurcation into rhythm splitting.

Finally, we analyse large systems of coupled chemical oscillators. Using a continuum approximation, we demonstrate mechanisms that cause auto-synchronization in such systems.

Analog VLSI-based, neuromorphic sensorimotor systems: modeling the primate oculomotor system

Using neuromorphic analog VLSI techniques for modeling large neural systems has several advantages over software techniques. By designing massively-parallel analog circuit arrays which are ubiquitous in neural systems, analog VLSI models are extremely fast, particularly when local interactions are important in the computation. While analog VLSI circuits are not as flexible as software methods, the constraints posed by this approach are often very similar to the constraints faced by biological systems. As a result, these constraints can offer many insights into the solutions found by evolution. This dissertation describes a hardware modeling effort to mimic the primate oculomotor system which requires both fast sensory processing and fast motor control. A one-dimensional hardware model of the primate eye has been built which simulates the physical dynamics of the biological system. It is driven by analog VLSI circuits mimicking brainstem and cortical circuits that control eye movements. In this framework, a visually-triggered saccadic system is demonstrated which generates averaging saccades. In addition, an auditory localization system, based on the neural circuits of the barn owl, is used to trigger saccades to acoustic targets in parallel with visual targets. Two different types of learning are also demonstrated on the saccadic system using floating-gate technology allowing the non-volatile storage of analog parameters directly on the chip. Finally, a model of visual attention is used to select and track moving targets against textured backgrounds, driving both saccadic and smooth pursuit eye movements to maintain the image of the target in the center of the field of view. This system represents one of the few efforts in this field to integrate both neuromorphic sensory processing and motor control in a closed-loop fashion.

A dynamical systems analysis of vortex pinch-off

Vortex rings constitute the main structure in the wakes of a wide class of swimming and flying animals, as well as in cardiac flows and in the jets generated by some moss and fungi. However, there is a physical limit, determined by an energy maximization principle called the Kelvin-Benjamin principle, to the size that axisymmetric vortex rings can achieve. The existence of this limit is known to lead to the separation of a growing vortex ring from the shear layer feeding it, a process known as `vortex pinch-off', and characterized by the dimensionless vortex formation number. The goal of this thesis is to improve our understanding of vortex pinch-off as it relates to biological propulsion, and to provide future researchers with tools to assist in identifying and predicting pinch-off in biological flows.

To this end, we introduce a method for identifying pinch-off in starting jets using the Lagrangian coherent structures in the flow, and apply this criterion to an experimentally generated starting jet. Since most naturally occurring vortex rings are not circular, we extend the definition of the vortex formation number to include non-axisymmetric vortex rings, and find that the formation number for moderately non-axisymmetric vortices is similar to that of circular vortex rings. This suggests that naturally occurring vortex rings may be modeled as axisymmetric vortex rings. Therefore, we consider the perturbation response of the Norbury family of axisymmetric vortex rings. This family is chosen to model vortex rings of increasing thickness and circulation, and their response to prolate shape perturbations is simulated using contour dynamics. Finally, the response of more realistic models for vortex rings, constructed from experimental data using nested contours, to perturbations which resemble those encountered by forming vortices more closely, is simulated using contour dynamics. In both families of models, a change in response analogous to pinch-off is found as members of the family with progressively thicker cores are considered. We posit that this analogy may be exploited to understand and predict pinch-off in complex biological flows, where current methods are not applicable in practice, and criteria based on the properties of vortex rings alone are necessary.

Theoretical studies of novel organic systems : biradicals, polyradicals, and conducting polymers

Chapter 1

Cyclobutanediyl has been studied in both its singlet and triplet states by ab initio electronic structure theory. The triplet, which is the ground state of the molecule, exists in both C_(2h) and C_(2v) forms, which interconvert via a C_s transition state. For the singlet, only a C_(2h) form is found. It passes, via a C_s transition state, onto the C_(2v) surface on which bicyclobutane is the only minimum. The ring-flipping (inversion) process in bicyclobutane includes the singlet biradical as an intermediate, and involves a novel, nonleast motion pathway. Semiclassical periodic orbit theory indicates that the various minima on both the singlet and triplet surfaces can interconvert via quantum mechanical tunneling.

Chapter 2

The dimethylenepolycyclobutadienes (n) are the non-Kekulé analogues of the classical acenes. Application of a variety of theoretical methods reveals several novel features of such structures. Most interesting is the emergence of a parity rule. When n is even, n is predicted to be a singlet, with n disjoint NBMOs. When n is odd, theory predicts a triplet ground state with (n+1) NBMOs that are not fully disjoint.

Chapter 3

Bi(cyclobutadienyl) (2), the cyclobutadiene analogue of biphenyl, and its homologues tri- (3) and tetra(cyclobutadienyl) (4) have been studied using electronic structure theory. Ab initio calculations on 2 reveal that the central bond is a true double bond, and that the structure is best thought of as two allyl radicals plus an ethylene. The singlet and triplet states are essentially degenerate. Trimer 3 is two allyls plus a dimethylenecyclobutanediyl, while 4 is two coplanar bi(cyclobutadienyl) units connected by a single bond. For both 3 and 4, the quintet, triplet, and singlet states are essentially degenerate, indicating that they are tetraradicals. The infinite polymer, polycyclobutadiene, has been studied by HMO, EHCO, and VEH methods. Several geometries based on the structures of 3 and 4 have been studied, and the band structures are quite intriguing. A novel crossing between the valence and conduction bands produces a small band gap and a high density of states at the Fermi level.

Chapter 4

At the level of Hückel theory, polyfulvene has a HOCO-LUCO degeneracy much like that seen in polyacetylene. Higher levels of theory remove the degeneracy, but the band gap (E_g) is predicted to be significantly smaller than analogous structures such as polythiophene and polypyrrole at the fulvenoid geometry. An alternative geometry, which we have termed quinoid, is also conceivable for polyfulvene, and it is predicted to have a much larger E_g. The effects of benzannelation to produce analogues of polyisothianaphthene have been evaluated. We propose a new model for such structures based on conventional orbital mixing arguments. Several of the proposed structures have quite interesting properties, which suggest that they are excellent candidates for conducting polymers.

Chapter 5

Theoretical studies of polydimethylenecyclobutene and polydiisopropylidene- cyclobutene reveal that, because of steric crowding, they cannot achieve a planar, fully conjugated structure in either their undoped or doped states. Rather, the structure consists of essentially orthogonal hexatriene units. Such a structure is incompatible with conventional conduction mechanisms involving polarons and bipolarons.

Control of dynamical systems with temporal logic specifications

This thesis is motivated by safety-critical applications involving autonomous air, ground, and space vehicles carrying out complex tasks in uncertain and adversarial environments. We use temporal logic as a language to formally specify complex tasks and system properties. Temporal logic specifications generalize the classical notions of stability and reachability that are studied in the control and hybrid systems communities. Given a system model and a formal task specification, the goal is to automatically synthesize a control policy for the system that ensures that the system satisfies the specification. This thesis presents novel control policy synthesis algorithms for optimal and robust control of dynamical systems with temporal logic specifications. Furthermore, it introduces algorithms that are efficient and extend to high-dimensional dynamical systems.

The first contribution of this thesis is the generalization of a classical linear temporal logic (LTL) control synthesis approach to optimal and robust control. We show how we can extend automata-based synthesis techniques for discrete abstractions of dynamical systems to create optimal and robust controllers that are guaranteed to satisfy an LTL specification. Such optimal and robust controllers can be computed at little extra computational cost compared to computing a feasible controller.

The second contribution of this thesis addresses the scalability of control synthesis with LTL specifications. A major limitation of the standard automaton-based approach for control with LTL specifications is that the automaton might be doubly-exponential in the size of the LTL specification. We introduce a fragment of LTL for which one can compute feasible control policies in time polynomial in the size of the system and specification. Additionally, we show how to compute optimal control policies for a variety of cost functions, and identify interesting cases when this can be done in polynomial time. These techniques are particularly relevant for online control, as one can guarantee that a feasible solution can be found quickly, and then iteratively improve on the quality as time permits.

The final contribution of this thesis is a set of algorithms for computing feasible trajectories for high-dimensional, nonlinear systems with LTL specifications. These algorithms avoid a potentially computationally-expensive process of computing a discrete abstraction, and instead compute directly on the system's continuous state space. The first method uses an automaton representing the specification to directly encode a series of constrained-reachability subproblems, which can be solved in a modular fashion by using standard techniques. The second method encodes an LTL formula as mixed-integer linear programming constraints on the dynamical system. We demonstrate these approaches with numerical experiments on temporal logic motion planning problems with high-dimensional (10+ states) continuous systems.

Formal methods for control synthesis in partially observed environments : application to autonomous robotic manipulation

Modern robots are increasingly expected to function in uncertain and dynamically challenging environments, often in proximity with humans. In addition, wide scale adoption of robots requires on-the-fly adaptability of software for diverse application. These requirements strongly suggest the need to adopt formal representations of high level goals and safety specifications, especially as temporal logic formulas. This approach allows for the use of formal verification techniques for controller synthesis that can give guarantees for safety and performance. Robots operating in unstructured environments also face limited sensing capability. Correctly inferring a robot's progress toward high level goal can be challenging.

This thesis develops new algorithms for synthesizing discrete controllers in partially known environments under specifications represented as linear temporal logic (LTL) formulas. It is inspired by recent developments in finite abstraction techniques for hybrid systems and motion planning problems. The robot and its environment is assumed to have a finite abstraction as a Partially Observable Markov Decision Process (POMDP), which is a powerful model class capable of representing a wide variety of problems. However, synthesizing controllers that satisfy LTL goals over POMDPs is a challenging problem which has received only limited attention.

This thesis proposes tractable, approximate algorithms for the control synthesis problem using Finite State Controllers (FSCs). The use of FSCs to control finite POMDPs allows for the closed system to be analyzed as finite global Markov chain. The thesis explicitly shows how transient and steady state behavior of the global Markov chains can be related to two different criteria with respect to satisfaction of LTL formulas. First, the maximization of the probability of LTL satisfaction is related to an optimization problem over a parametrization of the FSC. Analytic computation of gradients are derived which allows the use of first order optimization techniques.

The second criterion encourages rapid and frequent visits to a restricted set of states over infinite executions. It is formulated as a constrained optimization problem with a discounted long term reward objective by the novel utilization of a fundamental equation for Markov chains - the Poisson equation. A new constrained policy iteration technique is proposed to solve the resulting dynamic program, which also provides a way to escape local maxima.

The algorithms proposed in the thesis are applied to the task planning and execution challenges faced during the DARPA Autonomous Robotic Manipulation - Software challenge.