Integration of modular process simulators under the Generalized Disjunctive Programming framework for the structural flowsheet optimization

The optimization of chemical processes where the flowsheet topology is not kept fixed is a challenging discrete-continuous optimization problem. Usually, this task has been performed through equation based models. This approach presents several problems, as tedious and complicated component properties estimation or the handling of huge problems (with thousands of equations and variables). We propose a GDP approach as an alternative to the MINLP models coupled with a flowsheet program. The novelty of this approach relies on using a commercial modular process simulator where the superstructure is drawn directly on the graphical use interface of the simulator. This methodology takes advantage of modular process simulators (specially tailored numerical methods, reliability, and robustness) and the flexibility of the GDP formulation for the modeling and solution. The optimization tool proposed is successfully applied to the synthesis of a methanol plant where different alternatives are available for the streams, equipment and process conditions.

Constraint qualifications in linear vector semi-infinite optimization

Linear vector semi-infinite optimization deals with the simultaneous minimization of finitely many linear scalar functions subject to infinitely many linear constraints. This paper provides characterizations of the weakly efficient, efficient, properly efficient and strongly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The global constraint qualifications are illustrated on a collection of selected applications.

Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty

The multiobjective optimization model studied in this paper deals with simultaneous minimization of finitely many linear functions subject to an arbitrary number of uncertain linear constraints. We first provide a radius of robust feasibility guaranteeing the feasibility of the robust counterpart under affine data parametrization. We then establish dual characterizations of robust solutions of our model that are immunized against data uncertainty by way of characterizing corresponding solutions of robust counterpart of the model. Consequently, we present robust duality theorems relating the value of the robust model with the corresponding value of its dual problem.

Development and programming of Geophonino: A low cost Arduino-based seismic recorder for vertical geophones

The commercial data acquisition systems used for seismic exploration are usually expensive equipment. In this work, a low cost data acquisition system (Geophonino) has been developed for recording seismic signals from a vertical geophone. The signal goes first through an instrumentation amplifier, INA155, which is suitable for low amplitude signals like the seismic noise, and an anti-aliasing filter based on the MAX7404 switched-capacitor filter. After that, the amplified and filtered signal is digitized and processed by Arduino Due and registered in an SD memory card. Geophonino is configured for continuous registering, where the sampling frequency, the amplitude gain and the registering time are user-defined. The complete prototype is an open source and open hardware system. It has been tested by comparing the registered signals with the ones obtained through different commercial data recording systems and different kind of geophones. The obtained results show good correlation between the tested measurements, presenting Geophonino as a low-cost alternative system for seismic data recording.

A universal language for continuous network simulation /

Typescript.

Uniform Convergence of the Newton Method for Aubin Continuous Maps

* This work was supported by National Science Foundation grant DMS 9404431.

A decision support system for waste collection management and its potential improvement with Radio-Frequency Identification Technology (RFID)

Due to vigorous globalisation and product proliferation in recent years, more waste has been produced by the soaring manufacturing activities. This has contributed to the significant need for an efficient waste management system to ensure, with all efforts, the waste is properly treated for recycling or disposed. This paper presents a Decision Support System (DSS) framework, based on Constraint Logic Programming (CLP), for the collection management of industrial waste (of all kinds) and discusses the potential employment of Radio-Frequency Identification Technology (RFID) to improve several critical procedures involved in managing waste collection. This paper also demonstrates a widely distributed and semi-structured network of waste producing enterprises (e.g. manufacturers) and waste processing enterprises (i.e. waste recycling/treatment stations) improving their operations planning by means of using the proposed DSS. The potential RFID applications to update and validate information in a continuous manner to bring value-added benefits to the waste collection business are also presented. © 2012 Inderscience Enterprises Ltd.

Transactions and schema evolution in a persistent object-oriented programming system

Applications are subject of a continuous evolution process with a profound impact on their underlining data model, hence requiring frequent updates in the applications' class structure and database structure as well. This twofold problem, schema evolution and instance adaptation, usually known as database evolution, is addressed in this thesis. Additionally, we address concurrency and error recovery problems with a novel meta-model and its aspect-oriented implementation. Modern object-oriented databases provide features that help programmers deal with object persistence, as well as all related problems such as database evolution, concurrency and error handling. In most systems there are transparent mechanisms to address these problems, nonetheless the database evolution problem still requires some human intervention, which consumes much of programmers' and database administrators' work effort. Earlier research works have demonstrated that aspect-oriented programming (AOP) techniques enable the development of flexible and pluggable systems. In these earlier works, the schema evolution and the instance adaptation problems were addressed as database management concerns. However, none of this research was focused on orthogonal persistent systems. We argue that AOP techniques are well suited to address these problems in orthogonal persistent systems. Regarding the concurrency and error recovery, earlier research showed that only syntactic obliviousness between the base program and aspects is possible. Our meta-model and framework follow an aspect-oriented approach focused on the object-oriented orthogonal persistent context. The proposed meta-model is characterized by its simplicity in order to achieve efficient and transparent database evolution mechanisms. Our meta-model supports multiple versions of a class structure by applying a class versioning strategy. Thus, enabling bidirectional application compatibility among versions of each class structure. That is to say, the database structure can be updated because earlier applications continue to work, as well as later applications that have only known the updated class structure. The specific characteristics of orthogonal persistent systems, as well as a metadata enrichment strategy within the application's source code, complete the inception of the meta-model and have motivated our research work. To test the feasibility of the approach, a prototype was developed. Our prototype is a framework that mediates the interaction between applications and the database, providing them with orthogonal persistence mechanisms. These mechanisms are introduced into applications as an {\it aspect} in the aspect-oriented sense. Objects do not require the extension of any super class, the implementation of an interface nor contain a particular annotation. Parametric type classes are also correctly handled by our framework. However, classes that belong to the programming environment must not be handled as versionable due to restrictions imposed by the Java Virtual Machine. Regarding concurrency support, the framework provides the applications with a multithreaded environment which supports database transactions and error recovery. The framework keeps applications oblivious to the database evolution problem, as well as persistence. Programmers can update the applications' class structure because the framework will produce a new version for it at the database metadata layer. Using our XML based pointcut/advice constructs, the framework's instance adaptation mechanism is extended, hence keeping the framework also oblivious to this problem. The potential developing gains provided by the prototype were benchmarked. In our case study, the results confirm that mechanisms' transparency has positive repercussions on the programmer's productivity, simplifying the entire evolution process at application and database levels. The meta-model itself also was benchmarked in terms of complexity and agility. Compared with other meta-models, it requires less meta-object modifications in each schema evolution step. Other types of tests were carried out in order to validate prototype and meta-model robustness. In order to perform these tests, we used an OO7 small size database due to its data model complexity. Since the developed prototype offers some features that were not observed in other known systems, performance benchmarks were not possible. However, the developed benchmark is now available to perform future performance comparisons with equivalent systems. In order to test our approach in a real world scenario, we developed a proof-of-concept application. This application was developed without any persistence mechanisms. Using our framework and minor changes applied to the application's source code, we added these mechanisms. Furthermore, we tested the application in a schema evolution scenario. This real world experience using our framework showed that applications remains oblivious to persistence and database evolution. In this case study, our framework proved to be a useful tool for programmers and database administrators. Performance issues and the single Java Virtual Machine concurrent model are the major limitations found in the framework.

Auxin And Physical Constraint Exerted By The Perianth Promote Androgynophore Bending In Passiflora Mucronata L. (passifloraceae).

The androgynophore column, a distinctive floral feature in passion flowers, is strongly crooked or bent in many Passiflora species pollinated by bats. This is a floral feature that facilitates the adaptation to bat pollination. Crooking or bending of plant organs are generally caused by environmental stimulus (e.g. mechanical barriers) and might involve the differential distribution of auxin. Our aim was to study the role of the perianth organs and the effect of auxin in bending of the androgynophore of the bat-pollinated species Passiflora mucronata. Morpho-anatomical characterisation of the androgynophore, including measurements of curvature angles and cell sizes both at the dorsal (convex) and ventral (concave) sides of the androgynophore, was performed on control flowers, flowers from which perianth organs were partially removed and flowers treated either with auxin (2,4-dichlorophenoxyacetic acid; 2,4-D) or with an inhibitor of auxin polar transport (naphthylphthalamic acid; NPA). Asymmetric growth of the androgynophore column, leading to bending, occurs at a late stage of flower development. Removing the physical constraint exerted by perianth organs or treatment with NPA significantly reduced androgynophore bending. Additionally, the androgynophores of plants treated with 2,4-D were more curved when compared to controls. There was a larger cellular expansion at the dorsal side of the androgynophores of plants treated with 2,4-D and in both sides of the androgynophores of plants treated with NPA. This study suggests that the physical constraint exerted by perianth and auxin redistribution promotes androgynophore bending in P. mucronata and might be related to the evolution of chiropterophily in the genus Passiflora.

Chronic Continuous Exenatide Infusion Does Not Cause Pancreatic Inflammation And Ductal Hyperplasia In Non-human Primates.

In this study, we aimed to evaluate the effects of exenatide (EXE) treatment on exocrine pancreas of nonhuman primates. To this end, 52 baboons (Papio hamadryas) underwent partial pancreatectomy, followed by continuous infusion of EXE or saline (SAL) for 14 weeks. Histological analysis, immunohistochemistry, Computer Assisted Stereology Toolbox morphometry, and immunofluorescence staining were performed at baseline and after treatment. The EXE treatment did not induce pancreatitis, parenchymal or periductal inflammatory cell accumulation, ductal hyperplasia, or dysplastic lesions/pancreatic intraepithelial neoplasia. At study end, Ki-67-positive (proliferating) acinar cell number did not change, compared with baseline, in either group. Ki-67-positive ductal cells increased after EXE treatment (P = 0.04). However, the change in Ki-67-positive ductal cell number did not differ significantly between the EXE and SAL groups (P = 0.13). M-30-positive (apoptotic) acinar and ductal cell number did not change after SAL or EXE treatment. No changes in ductal density and volume were observed after EXE or SAL. Interestingly, by triple-immunofluorescence staining, we detected c-kit (a marker of cell transdifferentiation) positive ductal cells co-expressing insulin in ducts only in the EXE group at study end, suggesting that EXE may promote the differentiation of ductal cells toward a β-cell phenotype. In conclusion, 14 weeks of EXE treatment did not exert any negative effect on exocrine pancreas, by inducing either pancreatic inflammation or hyperplasia/dysplasia in nonhuman primates.

AVERAGE CONTINUOUS CONTROL OF PIECEWISE DETERMINISTIC MARKOV PROCESSES

This paper deals with the long run average continuous control problem of piecewise deterministic Markov processes (PDMPs) taking values in a general Borel space and with compact action space depending on the state variable. The control variable acts on the jump rate and transition measure of the PDMP, and the running and boundary costs are assumed to be positive but not necessarily bounded. Our first main result is to obtain an optimality equation for the long run average cost in terms of a discrete-time optimality equation related to the embedded Markov chain given by the postjump location of the PDMP. Our second main result guarantees the existence of a feedback measurable selector for the discrete-time optimality equation by establishing a connection between this equation and an integro-differential equation. Our final main result is to obtain some sufficient conditions for the existence of a solution for a discrete-time optimality inequality and an ordinary optimal feedback control for the long run average cost using the so-called vanishing discount approach. Two examples are presented illustrating the possible applications of the results developed in the paper.

A FIRST CONSTRAINT ON THE THICK DISK SCALE LENGTH: DIFFERENTIAL RADIAL ABUNDANCES IN K GIANTS AT GALACTOCENTRIC RADII 4, 8, AND 12 kpc

Based on high-resolution spectra obtained with the MIKE spectrograph on the Magellan telescopes, we present detailed elemental abundances for 20 red giant stars in the outer Galactic disk, located at Galactocentric distances between 9 and 13 kpc. The outer disk sample is complemented with samples of red giants from the inner Galactic disk and the solar neighborhood, analyzed using identical methods. For Galactocentric distances beyond 10 kpc, we only find chemical patterns associated with the local thin disk, even for stars far above the Galactic plane. Our results show that the relative densities of the thick and thin disks are dramatically different from the solar neighborhood, and we therefore suggest that the radial scale length of the thick disk is much shorter than that of the thin disk. We make a first estimate of the thick disk scale length of L(thick) = 2.0 kpc, assuming L(thin) = 3.8 kpc for the thin disk. We suggest that radial migration may explain the lack of radial age, metallicity, and abundance gradients in the thick disk, possibly also explaining the link between the thick disk and the metal-poor bulge.

Scalable continuous-variable entanglement of light beams produced by optical parametric oscillators

We show that scalable multipartite entanglement among light fields may be generated by optical parametric oscillators (OPOs). The tripartite entanglement existent among the three bright beams produced by a single OPO-pump, signal, and idler-is scalable to a system of many OPOs by pumping them in cascade with the same optical field. This latter serves as an entanglement distributor. The special case of two OPOs is studied, as it is shown that the resulting five bright beams share genuine multipartite entanglement. In addition, the structure of entanglement distribution among the fields can be manipulated to some degree by tuning the incident pump power. The scalability to many fields is straightforward, allowing an alternative implementation of a multipartite quantum information network with continuous variables.

Continuous structural transitions in quasi-one-dimensional classical Wigner crystals

We study the structural phase transitions in confined systems of strongly interacting particles. We consider infinite quasi-one-dimensional systems with different pairwise repulsive interactions in the presence of an external confinement following a power law. Within the framework of Landau's theory, we find the necessary conditions to observe continuous transitions and demonstrate that the only allowed continuous transition is between the single-and the double-chain configurations and that it only takes place when the confinement is parabolic. We determine analytically the behavior of the system at the transition point and calculate the critical exponents. Furthermore, we perform Monte Carlo simulations and find a perfect agreement between theory and numerics.