Stochastic atmospheric assistance and the use of emergency staging sites by migrants

Numerous animals move vast distances through media with stochastic dynamic properties. Avian migrants must cope with variable wind speeds and directions en route, which potentially jeopardize fine-tuned migration routes and itineraries. We show how unpredictable winds affect flight times and the use of an intermediate staging site by red knots (Calidris canutus canutus) migrating from west Africa to the central north Siberian breeding areas via the German Wadden Sea. A dynamic migration model incorporating wind conditions during flight shows that flight durations between Mauritania and the Wadden Sea vary between 2 and 8 days. The number of birds counted at the only known intermediate staging site on the French Atlantic coast was strongly positively correlated with simulated flight times. In addition, particularly light-weight birds occurred at this location. These independent results support the idea that stochastic wind conditions are the main driver of the use of this intermediate stopover site as an emergency staging area. Because of the ubiquity of stochastically varying media, we expect such emergency habitats to exist in many other migratory systems, both airborne and oceanic. Our model provides a tool to quantify the effect of winds and currents en route.

Threshold dynamic time warping for spatial activity recognition

Non-invasive spatial activity recognition is a difficult task, complicated by variation in how the same activities are conducted and furthermore by noise introduced by video tracking procedures. In this paper we propose an algorithm based on dynamic time warping (DTW) as a viable method with which to quantify segmented spatial activity sequences from a video tracking system. DTW is a widely used technique for optimally aligning or warping temporal sequences through minimisation of the distance between their components. The proposed algorithm threshold DTW (TDTW) is capable of accurate spatial sequence distance quantification and is shown using a three class spatial data set to be more robust and accurate than DTW and the discrete hidden markov model (HMM). We also evaluate the application of a band dynamic programming (DP) constraint to TDTW in order to reduce extraneous warping between sequences and to reduce the computation complexity of the approach. Results show that application of a band DP constraint to TDTW improves runtime performance significantly, whilst still maintaining a high precision and recall.

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.

Dwell-time and run-time control for DC mass rapid transit railways

Dwell times at stations and inter-station run times are the two major operational parameters to maintain train schedule in railway service. Current practices on dwell-time and run-time control are that they are only optimal with respect to certain nominal traffic conditions, but not necessarily the current service demand. The advantages of dwell-time and run-time control on trains are therefore not fully considered. The application of a dynamic programming approach, with the aid of an event-based model, to devise an optimal set of dwell times and run times for trains under given operational constraints over a regional level is presented. Since train operation is interactive and of multi-attributes, dwell-time and run-time coordination among trains is a multi-dimensional problem. The computational demand on devising trains' instructions, a prime concern in real-time applications, is excessively high. To properly reduce the computational demand in the provision of appropriate dwell times and run times for trains, a DC railway line is divided into a number of regions and each region is controlled by a dwell- time and run-time controller. The performance and feasibility of the controller in formulating the dwell-time and run-time solutions for real-time applications are demonstrated through simulations.

Optimal traffic control at railway junctions

Conflict occurs when two or more trains approach the same junction within a specified time. Such conflicts result in delays. Current practices to assign the right of way at junctions achieve orderly and safe passage of the trains, but do not attempt to reduce the delays. A traffic controller developed in the paper assigns right of way to impose minimum total weighted delay on the trains. The traffic flow model and the optimisation technique used in this controller are described. Simulation studies of the performance of the controller are given.

A Taxonomy of image matching techniques for stereo vision

Stereo vision is a method of depth perception, in which depth information is inferred from two (or more) images of a scene, taken from different perspectives. Applications of stereo vision include aerial photogrammetry, autonomous vehicle guidance, robotics, industrial automation and stereomicroscopy. A key issue in stereo vision is that of image matching, or identifying corresponding points in a stereo pair. The difference in the positions of corresponding points in image coordinates is termed the parallax or disparity. When the orientation of the two cameras is known, corresponding points may be projected back to find the location of the original object point in world coordinates. Matching techniques are typically categorised according to the nature of the matching primitives they use and the matching strategy they employ. This report provides a detailed taxonomy of image matching techniques, including area based, transform based, feature based, phase based, hybrid, relaxation based, dynamic programming and object space methods. A number of area based matching metrics as well as the rank and census transforms were implemented, in order to investigate their suitability for a real-time stereo sensor for mining automation applications. The requirements of this sensor were speed, robustness, and the ability to produce a dense depth map. The Sum of Absolute Differences matching metric was the least computationally expensive; however, this metric was the most sensitive to radiometric distortion. Metrics such as the Zero Mean Sum of Absolute Differences and Normalised Cross Correlation were the most robust to this type of distortion but introduced additional computational complexity. The rank and census transforms were found to be robust to radiometric distortion, in addition to having low computational complexity. They are therefore prime candidates for a matching algorithm for a stereo sensor for real-time mining applications. A number of issues came to light during this investigation which may merit further work. These include devising a means to evaluate and compare disparity results of different matching algorithms, and finding a method of assigning a level of confidence to a match. Another issue of interest is the possibility of statistically combining the results of different matching algorithms, in order to improve robustness.

Optimal-stopping control for airborne collision avoidance and return-to-course flight

This paper considers an aircraft collision avoidance design problem that also incorporates design of the aircraft’s return-to-course flight. This control design problem is formulated as a non-linear optimal-stopping control problem; a formulation that does not require a prior knowledge of time taken to perform the avoidance and return-to-course manoeuvre. A dynamic programming solution to the avoidance and return-to-course problem is presented, before a Markov chain numerical approximation technique is described. Simulation results are presented that illustrate the proposed collision avoidance and return-to-course flight approach.