Design of SPR systems with dynamic compensators and output variable structure control

This paper presents necessary and sufficient conditions for the following problem: given a linear time invariant plant G(s) = N(s)D(s)-1 = C(sI - A]-1B, with m inputs, p outputs, p > m, rank(C) = p, rank(B) = rank(CB) = m, £nd a tandem dynamic controller Gc(s) = D c(s)-1Nc(s) = Cc(sI - A c)-1Bc + Dc, with p inputs and m outputs and a constant output feedback matrix Ko ε ℝm×p such that the feedback system is Strictly Positive Real (SPR). It is shown that this problem has solution if and only if all transmission zeros of the plant have negative real parts. When there exists solution, the proposed method firstly obtains Gc(s) in order to all transmission zeros of Gc(s)G(s) present negative real parts and then Ko is found as the solution of some Linear Matrix Inequalities (LMIs). Then, taking into account this result, a new LMI based design for output Variable Structure Control (VSC) of uncertain dynamic plants is presented. The method can consider the following design specifications: matched disturbances or nonlinearities of the plant, output constraints, decay rate and matched and nonmatched plant uncertainties. © 2006 IEEE.

Proceedings of the Twentieth Annual Biochemical Engineering Symposium

The 20th Annual Biochemical Engineering Symposium was held at Kansas State University on April 21,1990. The objectives of the symposium were to provide: (i) a forum for informal discussion of biochemical engineering research being conducted at the participating institutions and (ii) an opportunity for students to present and publish their work. Twenty-eight papers presented at the symposium are included in this proceedings. Some of the papers describe the progress of ongoing projects, and others contain the results of completed projects. Only brief summaries are given of the papers that will be published in full elsewhere. The program of the symposium and a list of the participants are included in the proceedings. ContentsCell Separations and Recycle Using an Inclined Settler, Ching-Yuan Lee, Robert H. Davis and Robert A. Sclafani Micromixing and Metabolism in Bioreactors: Characterization of a 14 L Fermenter, K.S. Wenger and E.H. Dunlop Production, Purification, and Hydrolysis Kinetics of Wild-Type and Mutant Glucoamylases from Aspergillus Awamori, Ufuk Bakir, Paul D. Oates, Hsiu-Mei Chen and Peter J. Reilly Dynamic Modeling of the Immune System, Barry Vant-Hull and Dhinakar S. Kompala Dynamic Modeling of Active Transport Across a Biological Cell: A Stochastic Approach, B.C. Shen, S.T. Chou, Y.Y. Chiu and L.T. Fan Electrokinetic Isolation of Bacterial Vesicles and Ribosomes, Debra T.L. Hawker, Robert H. Davis, Paul W. Todd, and Robert Lawson Application of Dynamic Programming for Fermentative Ethanol Production by Zymomonas mobilis, Sheyla L. Rivera and M. Nazmul Karim Biodegradation of PCP by Pseudomonas cepacia, R. Rayavarapu, S.K. Banerji, and R.K. Bajpai Modeling the Bioremediation of Contaminated Soil Aggregates: a Phenomenological Approach, S. Dhawan, L.E. Erickson and L.T. Fan Biospecific Adsorption of Glucoamylase-I from Aspergillus niger on Raw Starch, Bipin K. Dalmia and Zivko L. Nikolov Overexpression in Recombinant Mammalian Cells: Effect on Growth Rate and Genetic Instability, Jeffrey A. Kern and Dhinakar S. Kompala Structured Mathematical Modeling of Xylose Fermentation, A.K. Hilaly, M.N. Karim, I. C. Linden and S. Lastick A New Culture Medium for Carbon-limited Growth of Bacillus thuringiensis, W. -M. Liu and R.K. Bajpai Determination of Sugars and Sugar Alcohols by High Performance Ion Chromatography, T. J. Paskach, H.-P. Lieker, P.J. Reilly, and K. Thielecke Characterization of Poly-Asp Tailed B-Galactosidase, M.Q. Niederauer, C.E. Glatz, l.A. Suominen, C.F. Ford, and M.A. Rougvie Computation of Conformations and Energies of cr-Glucosyl Disaccharides, Jing Zepg, Michael K. Dowd, and Peter J. Reilly Pentachlorophenol Interactions with Soil, Shein-Ming Wei, Shankha K. Banerji, and Rakesh K. Bajpai Oxygen Transfer to Viscous Liquid Media in Three-Phase Fluidized Beds of Floating Bubble Freakers, Y. Kang, L.T. Fan, B.T. Min and S.D. Kim Studies on the Invitro Development of Chick Embryo, A. Venkatraman and T. Panda The Evolution of a Silicone Based Phase-Separated Gravity-Independent Bioreactor, Peter E. Villeneuve and Eric H. Dunlop Biodegradation of Diethyl Phthalate, Guorong Zhang, Kenneth F. Reardon and Vincent G. Murphy Microcosm Treatability of Soil Contaminated with Petroleum Hydrocarbons, P. Tuitemwong, S. Dhawan, B.M. Sly, L.E. Erickson and J.R. Schlup

Dynamic partitioning in the array language OL/2 /

"January, 1971."

Dynamic breast MRI: Image registration and its impact on enhancement curve estimation

A novel algorithm for performing registration of dynamic contrast-enhanced (DCE) MRI data of the breast is presented. It is based on an algorithm known as iterated dynamic programming originally devised to solve the stereo matching problem. Using artificially distorted DCE-MRI breast images it is shown that the proposed algorithm is able to correct for movement and distortions over a larger range than is likely to occur during routine clinical examination. In addition, using a clinical DCE-MRI data set with an expertly labeled suspicious region, it is shown that the proposed algorithm significantly reduces the variability of the enhancement curves at the pixel level yielding more pronounced uptake and washout phases.

Normal ECG Recognition for Express-Diagnostics Based on Scale-Space Representation and Dynamic Matching

A novel approach of normal ECG recognition based on scale-space signal representation is proposed. The approach utilizes curvature scale-space signal representation used to match visual objects shapes previously and dynamic programming algorithm for matching CSS representations of ECG signals. Extraction and matching processes are fast and experimental results show that the approach is quite robust for preliminary normal ECG recognition.

A mixture density network approach to modelling and exploiting uncertainty in nonlinear control problems

In nonlinear and stochastic control problems, learning an efficient feed-forward controller is not amenable to conventional neurocontrol methods. For these approaches, estimating and then incorporating uncertainty in the controller and feed-forward models can produce more robust control results. Here, we introduce a novel inversion-based neurocontroller for solving control problems involving uncertain nonlinear systems which could also compensate for multi-valued systems. The approach uses recent developments in neural networks, especially in the context of modelling statistical distributions, which are applied to forward and inverse plant models. Provided that certain conditions are met, an estimate of the intrinsic uncertainty for the outputs of neural networks can be obtained using the statistical properties of networks. More generally, multicomponent distributions can be modelled by the mixture density network. Based on importance sampling from these distributions a novel robust inverse control approach is obtained. This importance sampling provides a structured and principled approach to constrain the complexity of the search space for the ideal control law. The developed methodology circumvents the dynamic programming problem by using the predicted neural network uncertainty to localise the possible control solutions to consider. A nonlinear multi-variable system with different delays between the input-output pairs is used to demonstrate the successful application of the developed control algorithm. The proposed method is suitable for redundant control systems and allows us to model strongly non-Gaussian distributions of control signal as well as processes with hysteresis. © 2004 Elsevier Ltd. All rights reserved.

Performance of the Equivalent Reservoir Modelling Technique for Multi-Reservoir Hydropower Systems

This paper investigates the validity of a simplified equivalent reservoir representation of a multi-reservoir hydroelectric system for modelling its optimal operation for power maximization. This simplification, proposed by Arvanitidis and Rosing (IEEE Trans Power Appar Syst 89(2):319-325, 1970), imputes a potential energy equivalent reservoir with energy inflows and outflows. The hydroelectric system is also modelled for power maximization considering individual reservoir characteristics without simplifications. Both optimization models employed MINOS package for solution of the non-linear programming problems. A comparison between total optimized power generation over the planning horizon by the two methods shows that the equivalent reservoir is capable of producing satisfactory power estimates with less than 6% underestimation. The generation and total reservoir storage trajectories along the planning horizon obtained by equivalent reservoir method, however, presented significant discrepancies as compared to those found in the detailed modelling. This study is motivated by the fact that Brazilian generation system operations are based on the equivalent reservoir method as part of the power dispatch procedures. The potential energy equivalent reservoir is an alternative which eliminates problems with the dimensionality of state variables in a dynamic programming model.

Protein sequence threading, the alignment problem, and a two-step strategy

Conventionally, protein structure prediction via threading relies on some nonoptimal method to align a protein sequence to each member of a library of known structures. We show how a score function (force field) can be modified so as to allow the direct application of a dynamic programming algorithm to the problem. This involves an approximation whose damage can be minimized by an optimization process during score function parameter determination. The method is compared to sequence to structure alignments using a more conventional pair-wise score function and the frozen approximation. The new method produces results comparable to the frozen approximation, but is faster and has fewer adjustable parameters. It is also free of memory of the template's original amino acid sequence, and does not suffer from a problem of nonconvergence, which can be shown to occur with the frozen approximation. Alignments generated by the simplified score function can then be ranked using a second score function with the approximations removed. (C) 1999 John Wiley & Sons, Inc.

Optimal reserve management and sovereign debt

Most models currently used to determine optimal foreign reserve holdings take the level of international debt as given. However, given the sovereign`s willingness-to-pay incentive problems, reserve accumulation may reduce sustainable debt levels. In addition, assuming constant debt levels does not allow addressing one of the puzzles behind using reserves as a means to avoid the negative effects of crisis: why do not sovereign countries reduce their sovereign debt instead? To study the joint decision of holding sovereign debt and reserves, we construct a stochastic dynamic equilibrium model calibrated to a sample of emerging markets. We obtain that the reserve accumulation does not play a quantitatively important role in this model. In fact, we find the optimal policy is not to hold reserves at all. This finding is robust to considering interest rate shocks, sudden stops, contingent reserves and reserve dependent output costs. (c) 2008 Elsevier B.V. All rights reserved.

Factorization by invariant embedding of elliptic problems: circular and star-shaped domains

Dissertação apresentada para obtenção do grau de Doutor em Matemática na especialidade de Equações Diferenciais, pela Universidade Nova de Lisboa,Faculdade de Ciências e Tecnologia

A General and Intuitive Envelope Theorem

We present an envelope theorem for establishing first-order conditions in decision problems involving continuous and discrete choices. Our theorem accommodates general dynamic programming problems, even with unbounded marginal utilities. And, unlike classical envelope theorems that focus only on differentiating value functions, we accommodate other endogenous functions such as default probabilities and interest rates. Our main technical ingredient is how we establish the differentiability of a function at a point: we sandwich the function between two differentiable functions from above and below. Our theory is widely applicable. In unsecured credit models, neither interest rates nor continuation values are globally differentiable. Nevertheless, we establish an Euler equation involving marginal prices and values. In adjustment cost models, we show that first-order conditions apply universally, even if optimal policies are not (S,s). Finally, we incorporate indivisible choices into a classic dynamic insurance analysis.

Programació d'aplicacions bioinformàtiques

Avui en dia la biologia aporta grans quantitats de dades que només la informàtica pot tractar. Les aplicacions bioinformàtiques són la més important eina d’anàlisi i comparació que tenim per entendre la vida i aconseguir desxifrar aquestes dades. Aquest projecte centra el seu esforç en l’estudi de les aplicacions dedicades a l’alineament de seqüències genètiques, i més concretament a dos algoritmes, basats en programació dinàmica i òptims: el Needleman&Wunsch i el Smith&Waterman. Amb l’objectiu de millorar el rendiment d’aquests algoritmes per a alineaments de seqüències grans, proposem diferents versions d’implementació. Busquem millorar rendiments en temps i espai. Per a aconseguir millorar els resultats aprofitem el paral·lelisme. Els resultats dels anàlisis de les versions els comparem per obtenir les dades necessàries per valorar cost, guany i rendiment.

Chroma binary similarity and local alignment applied to cover song identification

We present a new technique for audio signal comparison based on tonal subsequence alignment and its application to detect cover versions (i.e., different performances of the same underlying musical piece). Cover song identification is a task whose popularity has increased in the Music Information Retrieval (MIR) community along in the past, as it provides a direct and objective way to evaluate music similarity algorithms.This article first presents a series of experiments carried outwith two state-of-the-art methods for cover song identification.We have studied several components of these (such as chroma resolution and similarity, transposition, beat tracking or Dynamic Time Warping constraints), in order to discover which characteristics would be desirable for a competitive cover song identifier. After analyzing many cross-validated results, the importance of these characteristics is discussed, and the best-performing ones are finally applied to the newly proposed method. Multipleevaluations of this one confirm a large increase in identificationaccuracy when comparing it with alternative state-of-the-artapproaches.

Parameterized expectations approach; Some practical issues

We discuss some practical issues related to the use of the Parameterized Expectations Approach (PEA) for solving non-linear stochastic dynamic models with rational expectations. This approach has been applied in models of macroeconomics, financial economics, economic growth, contracttheory, etc. It turns out to be a convenient algorithm, especially when there is a large number of state variables and stochastic shocks in the conditional expectations. We discuss some practical issues having to do with the application of the algorithm, and we discuss a Fortran program for implementing the algorithm that is available through the internet.We discuss these issues in a battery of six examples.

Network revenue management with product-specific no-shows

Revenue management practices often include overbooking capacity to account for customerswho make reservations but do not show up. In this paper, we consider the network revenuemanagement problem with no-shows and overbooking, where the show-up probabilities are specificto each product. No-show rates differ significantly by product (for instance, each itinerary andfare combination for an airline) as sale restrictions and the demand characteristics vary byproduct. However, models that consider no-show rates by each individual product are difficultto handle as the state-space in dynamic programming formulations (or the variable space inapproximations) increases significantly. In this paper, we propose a randomized linear program tojointly make the capacity control and overbooking decisions with product-specific no-shows. Weestablish that our formulation gives an upper bound on the optimal expected total profit andour upper bound is tighter than a deterministic linear programming upper bound that appearsin the existing literature. Furthermore, we show that our upper bound is asymptotically tightin a regime where the leg capacities and the expected demand is scaled linearly with the samerate. We also describe how the randomized linear program can be used to obtain a bid price controlpolicy. Computational experiments indicate that our approach is quite fast, able to scale to industrialproblems and can provide significant improvements over standard benchmarks.