Dynamic strength of the interaction between lung surfactant protein D (SP-D) and saccharide ligands
DEFF Research Database (Denmark)
Thormann, Esben; Dreyer, Jakob K; Simonsen, Adam C
2007-01-01
In order to investigate the dynamic strength of the interaction between lung surfactant protein D (SP-D) and different sugars, maltose, mannose, glucose, and galactose, we have used an atomic force microscope to monitor the interaction on a single molecule scale. The experiment is performed...... by measuring the rupture force when the SP-D-sugar bond is subjected to a continuously increasing force. Under these dynamic conditions, SP-D binds strongest to d-mannose and weakest to maltose and d-galactose. These results differ from equilibrium measurements wherein SP-D exhibits preference for maltose...
Directory of Open Access Journals (Sweden)
Sean F. Monaghan
2016-11-01
Full Text Available Abstract Background Acute respiratory distress syndrome (ARDS remains a common organ dysfunction in the critically ill patient. Mechanisms for its development have focused on immune mediated causes, aspects of our understanding are not complete, and we lack biomarkers. Design, setting, and subjects Blood and bronchial alveolar lavage fluid (BAL from humans (n = 10–13 with ARDS and controls (n = 5–10 as well as a murine model of ARDS (n = 5–6 with controls (n = 6–7 were studied. Methods ARDS was induced in mice by hemorrhagic shock (day 1 followed by poly-microbial sepsis (day 2. Samples were then collected on the third day after the animals were euthanized. Ex vivo experiments used splenocytes from animals with ARDS cultured with and without soluble programmed death receptor-1 (sPD-1. Results Levels of sPD-1 are increased in both the serum (11,429.3 pg/mL(SD 2133.3 vs. 8061.4(SD 4187.8, p = 0.036 and bronchial alveolar lavage (BAL fluid (6,311.1 pg/mL(SD 3758.0 vs. 90.7 pg/mL(SD 202.8, p = 0.002 of humans with ARDS. Similar results are seen in the serum (9396.1 pg/mL(SD 1546.0 vs. 3464.5 pg/mL(SD 2511.8, p = 0.001 and BAL fluid (2891.7 pg/mL(SD 868.1 vs. 1385.9 pg/mL(SD 927.8, p = 0.012 of mice. sPD-1 levels in murine blood (AUC = 1(1–1, p = 0.006, murine BAL fluid (AUC = 0.905(0.717–1.093, p = 0.015, and human BAL (AUC = 1(1–1, p = 0.001 fluid predicted ARDS. To assess the importance of sPD-1 in ARDS, ex vivo experiments were undertaken. BAL fluid from mice with ARDS dampens the TNF-α production compared to cells cultured with BAL lacking sPD-1 (2.7 pg/mL(SD 3.8 vs. 52.38 pg/mL(SD 25.1, p = 0.002. Conclusions This suggests sPD-1 is elevated in critical illness and may represent a potential biomarker for ARDS. In addition, sPD-1 has an anti-inflammatory mechanism in conditions of marked stress and aids in the resolution of severe inflammation. sPD-1 could be used to not only diagnose ARDS
Streeck, W.
2014-01-01
As part of its continuing series on the European Left, The Current Moment publishes an article by Wolfgang Streeck on the SPD under Merkel. Wolfgang Streeck is a director at the Max Planck Institute for the Study of Societies in Cologne, Germany. Widley recognized in Germany and abroad for his work in sociology and political economy, Wolfgang Streeck’s most recent book is published this month in English with Verso, under the title Buying Time: The Delayed Crisis of Democratic Capitalism.
Kohler, Susanna
2016-06-01
Editors note:This week were in Boulder, Colorado at the 47th meeting of the AAS Solar Physics Division (SPD). Follow along to catch some of the latest news from the field of solar physics!Todays press conference provided an excellent overview of some of the highlights of this weeks SPD meeting. Four speakers provided their views on some of the hottest topics in solar physics at the moment, including stealth coronal mass ejections (CMEs), sunspot formation, long-term solar-activity trends, and the largest solar telescope ever built.Stealth CMEsSolar and Heliospheric Observatory (SOHO) composite image of a coronal mass ejection. [ESA/NASA/SOHO]First up, Nathalia Alzate (Aberystwyth University) talked about recent success in solving the mystery of so-called stealth CMEs, massive solar storms that dont exhibit the usual clues to their origin. Most CMEs have low-coronal signatures like flares, filament eruptions, jets, etc. that reveal the origin of the CME at the Sun. But stealth CMEs appear without warning, and seem to have no evidence of low-coronal signatures.But are these signatures not there? Or could we just be missing them? Alzate and her collaborator Huw Morgan used advanced image processing techniques to search for low-coronal signatures associated with 40 CMEs that have been classified as stealth CMEs. Their techniques enhance the observed structure down to fine spatial scales, and help reveal very faint dynamic events.Sure enough, these processing techniques consistently revealed low-coronal signatures for every single supposed stealth CME they examined. This suggests that all CMEs exhibit some signatures in the low corona its only a matter of being able to process the images well enough to detect them!Spectacular Sunspot SimulationsStill image from a simulation studying sunspot formation. Compare to the cover image of sunspot observations! [Feng Chen, Matthias Rempel, Yuhong Fan]Next up, Feng Chen (High Altitude Observatory) described recent computational
Kohler, Susanna
2016-06-01
Editors note:This week were in Boulder, Colorado at the47th meeting of the AAS Solar Physics Division (SPD). Follow along to catch some of the latest news from the field of solar physics!Yesterdayspress conference was titled Preparing for the 2017 Great American Eclipse. Four speakers highlighted both outreach and research projects that are planned for the eclipse that will cross the continental United States on August 21st next year.Eclipse from High AltitudeFirst up, Angela Des Jardins (Montana Space Grant Consortium) introduced us to the nationwide Eclipse Ballooning Project.An eclipse as seen from the ISS. Being up high gives you a very different perspective on eclipses! [NASA]The last total solar eclipse in the continental United States was in 1979, and people were told to stay inside and watch from their TVs! For the next total solar eclipse in the US, we want the opposite: for everyone to be outdoors and in the path of totality to watch (with eclipse glasses lets be safe)! This eclipse is a fantastic educational opportunity, and a way to reach an enormous audience.And what better way to experience the eclipse than to be involved? The Eclipse Ballooning Project is involving more than 50 student teams from 30 states to fly high-altitude balloons at 20 locations along the total eclipse path. These balloons will send live videos and images from the edge of space to the NASA website.Why? Being someplace high up provides an entirely different view for an eclipse! Instead of looking up to watch the Moon slide in front of the Sun, you can look down to watch the Moons shadow race across the Earths surface at thousands of miles per hour. This unique perspective is rare, and has certainly never been covered live. This will be an awesome addition to other coverage of the eclipse!At Maximum TotalityThe next speaker, Gordon Emslie, described the outreach efforts planned at his institution, Western Kentucky University (WKU). The location where the eclipse totality will
DEFF Research Database (Denmark)
Greisen, S R; Rasmussen, T K; Stengaard-Pedersen, K
2014-01-01
/mL) RA were increased compared with HV (median 0.04 ng/mL, IQR 0.04-0.04 ng/mL) (all p inversely with TSS at 3-5 years (r = -0.468, p ..., and the inverse correlation with TSS suggest that sPD-1 is an important mediator in inflammatory and radiographic disease progression....
Kohler, Susanna
2016-06-01
Editors note: This week were in Boulder, Colorado at the 47th meeting of the AAS Solar Physics Division (SPD). Follow along to catch some of the latest news from the field of solar physics!The 2016 SPD meeting was launched this morning from the University of Colorado Boulder campus. Two of the hot topics at this years meeting include celebration of the recent move of the National Solar Observatorys headquarters to Boulder, and discussion of the future Daniel K. Inouye Solar Telescope (DKIST, formerly the Advanced Technology Solar Telescope, ATST). DKIST, planned for a 2019 completion in Hawaii, is the next big telescope on the horizon for solar physics.Todays press conference had an interesting focus: instruments providing new high-energy observations of the Sun. Representatives from four different instruments were here to talk about some of the latest X-ray solar observations.GRIPSThe GRIPS payload flew at 130,000 ft over Antarctica on a giant balloon in January 2016. [NASA/Albert Shih]First up, Albert Shih (NASA Goddard) described the Gamma-Ray Imager/Polarimeter for Solar flares, or GRIPS. GRIPS is a balloon-borne instrument designed to detect X-rays and gamma rays emitted during solar flares. Up to tens of a percent of the energy in solar flares is emitted in the form of accelerated particles, but the physics behind this process is not well understood. GRIPS observes where the highest-energy particles are accelerated, in an effort to learn more about the process.GRIPS was launched on 19 January, 2016 and flew for roughly 12 days gathering ~1 million seconds of data! The logistics of this instruments flight are especially interesting, since it was launched from Antarctica and carried by a balloon at a whopping elevation of 130,000 ft (to get high enough that the atmosphere doesnt absorb all the photons GRIPS is trying to observe). Though the data from the mission has been retrieved, the bulk of the hardware remains where it landed at the end of January. It must
The ALICE Silicon Pixel Detector System (SPD)
Kluge, A; Antinori, Federico; Burns, M; Cali, I A; Campbell, M; Caselle, M; Ceresa, S; Dima, R; Elias, D; Fabris, D; Krivda, Marian; Librizzi, F; Manzari, Vito; Morel, M; Moretto, Sandra; Osmic, F; Pappalardo, G S; Pepato, Adriano; Pulvirenti, A; Riedler, P; Riggi, F; Santoro, R; Stefanini, G; Torcato De Matos, C; Turrisi, R; Tydesjo, H; Viesti, G; PH-EP
2007-01-01
The ALICE silicon pixel detector (SPD) comprises the two innermost layers of the ALICE inner tracker system. The SPD includes 120 detector modules (half-staves) each consisting of 10 ALICE pixel chips bump bonded to two silicon sensors and one multi-chip read-out module. Each pixel chip contains 8192 active cells, so that the total number of pixel cells in the SPD is ≈ 107. The on-detector read-out is based on a multi-chip-module containing 4 ASICs and an optical transceiver module. The constraints on material budget and detector module dimensions are very demanding.
Introduction to dynamic programming
Cooper, Leon; Rodin, E Y
1981-01-01
Introduction to Dynamic Programming provides information pertinent to the fundamental aspects of dynamic programming. This book considers problems that can be quantitatively formulated and deals with mathematical models of situations or phenomena that exists in the real world.Organized into 10 chapters, this book begins with an overview of the fundamental components of any mathematical optimization model. This text then presents the details of the application of dynamic programming to variational problems. Other chapters consider the application of dynamic programming to inventory theory, Mark
Report of International NanoSPD Steering Committee and statistics on recent NanoSPD activities
2014-08-01
Abstract. The Université de Lorraine in Metz, France, is the selected site for the 6th International Conference on Nanomaterials by Severe Plastic Deformation (NanoSPD6) following a series of five earlier conferences. This introductory paper reports on several major developments in NanoSPD activities as well as on very recent NanoSPD citation data which confirm the continued growth and expansion of this important research area. Close attention is given to the topics of workshops, conferences and seminars organized during these last three years as well as on books and reviews published prior to the NanoSPD6 conference. A special concern of the committee is in introducing and discussing the appropriate terminology to be applied in this new field of materials science and engineering.
Backsplash Testbeam results for the SPD
Aguiló, E; Calvo, M; Garrido, L; Gascón, D; Graciani, R; Graugès-Pous, E; Peralta, D; Vilasís, X; Xirgu, X
2004-01-01
A small fraction of the cascade developed in a calorimeter by the primary particle is emitted backward as radiation often called backsplash. A testbeam with electrons and pions has been done to complete previous studies of the effect of backsplash on the SPD (Scintillator Pad Detector), positioned just before the Preshower and ECAL system. The measurements and their comparison with GEANT3 and EGS4 simulations are presented in this note.
Introduction to stochastic dynamic programming
Ross, Sheldon M; Lukacs, E
1983-01-01
Introduction to Stochastic Dynamic Programming presents the basic theory and examines the scope of applications of stochastic dynamic programming. The book begins with a chapter on various finite-stage models, illustrating the wide range of applications of stochastic dynamic programming. Subsequent chapters study infinite-stage models: discounting future returns, minimizing nonnegative costs, maximizing nonnegative returns, and maximizing the long-run average return. Each of these chapters first considers whether an optimal policy need exist-providing counterexamples where appropriate-and the
Dynamic programming models and applications
Denardo, Eric V
2003-01-01
Introduction to sequential decision processes covers use of dynamic programming in studying models of resource allocation, methods for approximating solutions of control problems in continuous time, production control, more. 1982 edition.
Secure Dynamic Program Repartitioning
DEFF Research Database (Denmark)
Hansen, Rene Rydhoff; Probst, Christian
2005-01-01
Secure program partitioning has been introduced as a language-based technique to allow the distribution of data and computation across mutualy untrusted hosts, while at the same time guaranteeing the protection of confidential data. Programs that have been annotated with security types...... are automaticaly partitioned by the compiler. The main drawback in this setting is that both the trust hierarchy and the set of hosts are fixed once the program has been partitioned. This paper suggests an enhanced version of the partitioning framework, where the trust relation stil remains fixed...
Linking surfactant protein SP-D and IL-13
DEFF Research Database (Denmark)
Qaseem, Asif S; Sonar, Sanchaita; Mahajan, Lakshna
2012-01-01
of allergen-IgE interaction, histamine release by sensitised mast cells, downregulation of specific IgE production, suppression of pulmonary and peripheral eosinophilia, inhibition of mechanisms that cause airway remodelling, and induction of apoptosis in sensitised eosinophils. SP-D can also shift helper T......Surfactant protein D (SP-D) is an innate immune molecule that plays a protective role against lung infection, allergy, asthma and inflammation. In vivo experiments with murine models have shown that SP-D can protect against allergic challenge via a range of mechanisms including inhibition...... cell polarisation following in vivo allergenic challenge, from pathogenic Th2 to a protective Th1 cytokine response. Interestingly, SP-D gene deficient (-/-) mice show an IL-13 over-expressing phenotype. IL-13 has been shown to be involved in the development of asthma. Transgenic mice over...
Mun, Soo-Hyun
2011-12-31
This paper aimed to examine the debate over the fertility decline in the German Empire, focusing on the role of the SPD. During the German Empire, the fertility rate dramatically declined and the growing awareness of a continuous decline in the birth rate prompted a massive debate among politicians, doctors, sociologists, and feminist activists. The fertility decline was negatively evaluated and generated consciousness of crisis. However, it was not the only way to face this new phenomenon. Indeed, the use of birth control among the upper class was interpreted as a part of a modernizing process. As the same phenomenon reached the working class, it suddenly became a social problem and was attributed to the SPD. The debate over the fertility decline in imperial German society ridden with a fierce class conflict was developed into a weapon against the SPD. Contrary to the assumption of conservative politicians, the SPD had no clear-cut position on this issue. Except for a few politicians like Kautsky and the doctors who came into frequent contact with the workers, the "birth strike" was not listed as the main interest of the SPD. Even Clara Zetkin, the leader of the Social Democratic women's organization viewed it as a concern of the individual person which could not be incorporated in the party program. The women's organization of the SPD put priority on class conflict rather than issues specific to women. As a result, the debate over the birth rate decline within the SPD was not led by the women themselves. There could have been various means to stimulate the birth rate. Improvement in the welfare system, such as tax relief for large families, better housing conditions, and substantial maternity protection, could have been feasible solutions to the demographic crisis. However, Germany chose to respond to this crisis by imposing legal sanctions against birth control. In addition to paragraphs 218-220 of the German criminal law enacted in 1872 which prescribed penal
Knudsen, Lars; Ochs, Matthias; Mackay, Rosemarie; Townsend, Paul; Deb, Roona; Mühlfeld, Christian; Richter, Joachim; Gilbert, Fabian; Hawgood, Samuel; Reid, Kenneth; Clark, Howard
2007-10-03
Surfactant protein D (SP-D) deficient mice develop emphysema-like pathology associated with focal accumulations of foamy alveolar macrophages, an excess of surfactant phospholipids in the alveolar space and both hypertrophy and hyperplasia of alveolar type II cells. These findings are associated with a chronic inflammatory state. Treatment of SP-D deficient mice with a truncated recombinant fragment of human SP-D (rfhSP-D) has been shown to decrease the lipidosis and alveolar macrophage accumulation as well as production of proinflammatory chemokines. The aim of this study was to investigate if rfhSP-D treatment reduces the structural abnormalities in parenchymal architecture and type II cells characteristic of SP-D deficiency. SP-D knock-out mice, aged 3 weeks, 6 weeks and 9 weeks were treated with rfhSP-D for 9, 6 and 3 weeks, respectively. All mice were sacrificed at age 12 weeks and compared to both PBS treated SP-D deficient and wild-type groups. Lung structure was quantified by design-based stereology at the light and electron microscopic level. Emphasis was put on quantification of emphysema, type II cell changes and intracellular surfactant. Data were analysed with two sided non-parametric Mann-Whitney U-test. After 3 weeks of treatment, alveolar number was higher and mean alveolar size was smaller compared to saline-treated SP-D knock-out controls. There was no significant difference concerning these indices of pulmonary emphysema within rfhSP-D treated groups. Type II cell number and size were smaller as a consequence of treatment. The total volume of lamellar bodies per type II cell and per lung was smaller after 6 weeks of treatment. Treatment of SP-D deficient mice with rfhSP-D leads to a reduction in the degree of emphysema and a correction of type II cell hyperplasia and hypertrophy. This supports the concept that rfhSP-D might become a therapeutic option in diseases that are characterized by decreased SP-D levels in the lung.
Directory of Open Access Journals (Sweden)
Mühlfeld Christian
2007-10-01
Full Text Available Abstract Background Surfactant protein D (SP-D deficient mice develop emphysema-like pathology associated with focal accumulations of foamy alveolar macrophages, an excess of surfactant phospholipids in the alveolar space and both hypertrophy and hyperplasia of alveolar type II cells. These findings are associated with a chronic inflammatory state. Treatment of SP-D deficient mice with a truncated recombinant fragment of human SP-D (rfhSP-D has been shown to decrease the lipidosis and alveolar macrophage accumulation as well as production of proinflammatory chemokines. The aim of this study was to investigate if rfhSP-D treatment reduces the structural abnormalities in parenchymal architecture and type II cells characteristic of SP-D deficiency. Methods SP-D knock-out mice, aged 3 weeks, 6 weeks and 9 weeks were treated with rfhSP-D for 9, 6 and 3 weeks, respectively. All mice were sacrificed at age 12 weeks and compared to both PBS treated SP-D deficient and wild-type groups. Lung structure was quantified by design-based stereology at the light and electron microscopic level. Emphasis was put on quantification of emphysema, type II cell changes and intracellular surfactant. Data were analysed with two sided non-parametric Mann-Whitney U-test. Main Results After 3 weeks of treatment, alveolar number was higher and mean alveolar size was smaller compared to saline-treated SP-D knock-out controls. There was no significant difference concerning these indices of pulmonary emphysema within rfhSP-D treated groups. Type II cell number and size were smaller as a consequence of treatment. The total volume of lamellar bodies per type II cell and per lung was smaller after 6 weeks of treatment. Conclusion Treatment of SP-D deficient mice with rfhSP-D leads to a reduction in the degree of emphysema and a correction of type II cell hyperplasia and hypertrophy. This supports the concept that rfhSP-D might become a therapeutic option in diseases that are
DEFF Research Database (Denmark)
Sørensen, Grith Lykke; Hoegh, Silje V; Leth-Larsen, Rikke
2009-01-01
and multimeric SP-D appeared with distinct patterns of disulphide crosslinking, which partly changed according to interconversion between the structural forms. Solid phase assays demonstrated that trimeric SP-D subunits showed greater binding to LPS and PGN, but lower binding to mannan and LTA, than SP......-D multimers. Trimeric SP-D subunits also showed greater binding to endogenous lipoproteins: LDL, oxLDL, and HDL, than multimeric SP-D. In conclusion, purified trimeric and multimeric SP-D represent separate and only partly interconvertible molecular populations with distinct biochemical properties....
Dynamical genetic programming in XCSF.
Preen, Richard J; Bull, Larry
2013-01-01
A number of representation schemes have been presented for use within learning classifier systems, ranging from binary encodings to artificial neural networks. This paper presents results from an investigation into using a temporally dynamic symbolic representation within the XCSF learning classifier system. In particular, dynamical arithmetic networks are used to represent the traditional condition-action production system rules to solve continuous-valued reinforcement learning problems and to perform symbolic regression, finding competitive performance with traditional genetic programming on a number of composite polynomial tasks. In addition, the network outputs are later repeatedly sampled at varying temporal intervals to perform multistep-ahead predictions of a financial time series.
Dynamic Programming on Nominal Graphs
Directory of Open Access Journals (Sweden)
Nicklas Hoch
2015-04-01
Full Text Available Many optimization problems can be naturally represented as (hyper graphs, where vertices correspond to variables and edges to tasks, whose cost depends on the values of the adjacent variables. Capitalizing on the structure of the graph, suitable dynamic programming strategies can select certain orders of evaluation of the variables which guarantee to reach both an optimal solution and a minimal size of the tables computed in the optimization process. In this paper we introduce a simple algebraic specification with parallel composition and restriction whose terms up to structural axioms are the graphs mentioned above. In addition, free (unrestricted vertices are labelled with variables, and the specification includes operations of name permutation with finite support. We show a correspondence between the well-known tree decompositions of graphs and our terms. If an axiom of scope extension is dropped, several (hierarchical terms actually correspond to the same graph. A suitable graphical structure can be found, corresponding to every hierarchical term. Evaluating such a graphical structure in some target algebra yields a dynamic programming strategy. If the target algebra satisfies the scope extension axiom, then the result does not depend on the particular structure, but only on the original graph. We apply our approach to the parking optimization problem developed in the ASCENS e-mobility case study, in collaboration with Volkswagen. Dynamic programming evaluations are particularly interesting for autonomic systems, where actual behavior often consists of propagating local knowledge to obtain global knowledge and getting it back for local decisions.
Charter of the Sandia National Laboratories Sandia Postdoctoral Development (SPD) Association.
Energy Technology Data Exchange (ETDEWEB)
McBride, Amber Alane Fisher; McBride, Amber Alane Fisher; Rodgers, Theron; Dong, Wen; Juan, Pierre-Alexandre; Barkholtz, Heather; Alley, William Morgan; Wolk, Benjamin Matthew; Vane, Zachary Phillips; Priye, Aashish; Ball, Cameron Scott; McBride, Amber Alane Fisher
2017-03-01
The SNL SPD Association represents all personnel that are classified as Postdoctoral Appointees at Sandia National Laboratories. The purpose of the SNL SPD Association is to address the needs and concerns of Postdoctoral Appointees within Sandia National Laboratories.
Energy Technology Data Exchange (ETDEWEB)
McBride, Amber Alane Fisher; McBride, Amber Alane Fisher; Rodgers, Theron; Dong, Wen; Juan, Pierre-Alexandre; Barkholtz, Heather; Alley, William Morgan; Wolk, Benjamin Matthew; Vane, Zachary Phillips; Priye, Aashish; Ball, Cameron Scott
2017-03-01
The purpose of this document is to define the rules of governance for the Sandia Postdoctoral Development (SPD) Association. This includes election procedures for filling vacancies on the SPD board, an all-purpose voting procedure, and definitions for the roles and responsibilities of each SPD board member. The voting procedures can also be used to amend the by-laws, as well as to create, dissolve, or consolidate vacant SPD board positions.
Serum-surfactant SP-D correlates inversely to lung function in cystic fibrosis
DEFF Research Database (Denmark)
Olesen, Hanne Vebert; Holmskov, Uffe; Schiøtz, Peter Oluf
2010-01-01
BACKGROUND: Cystic fibrosis (CF) affects the lungs causing infections and inflammation. Surfactant protein D (SP-D) is an innate defense lectin primarily secreted in the lungs. We investigated the influence of the SP-D Met11Thr polymorphism on CF lung function; and serum SP-D as a marker for CF...
Programming an interpreter using molecular dynamics
Bergstra, J.A.; Middelburg, C.A.
2007-01-01
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation developed in the setting of \\PGA, which bears on the use of dynamic data structures in programming. We consider the
In vitro evaluation of anticancer effect and neurotoxicity of Styrylpyrone derivative (SPD)
Yip, Chee-Wai; Nagaoka, Yasuo; Nor, Norefrina Shafinaz Md.; Ibrahim, Nazlina
2016-11-01
The increasing number of death due to cancer emphasizes the need of novel anticancer agents. Styrylpyrone derivative (SPD) was previously found to have potential anticancer action towards many types of cancer. Some of the SPD-anticancer mechanisms were elucidated as induction of cancer cell apoptosis. However, more understanding on cancer cell type specific action of SPD-anticancer effects needs to be evaluated. HCT-116 cell line, a type of human colon carcinoma, was used to study SPD-anticancer effect. It was found that SPD concentration as low as 0.25 µM was able to inhibit 80% growth of cancer cells. IC50 value of SPD for HCT-116 was found to be 0.038 µM. Neurotoxicity test, carried out to determine the adverse effect of SPD towards nerve cells, gives CC50 value as 4.88 µM, thus concluded it to be a neurotoxic compound.
Descent of the Silicon Pixel Detector (SPD) for ALICE Experiment
2007-01-01
The Silicon Pixel Detector (SPD) constitutes the two innermost layers of the ALICE Inner Tracking System (ITS) at radii of 3.9 cm and 7.6 cm, respectively. It is a fundamental element for the determination of the position of the primary vertex as well as for the measurement of the impact parameter of secondary tracks originating from the weak decays of strange, charm and beauty particles.
Dynamic Programming Applications in Water Resources
Yakowitz, Sidney
1982-08-01
The central intention of this survey is to review dynamic programming models for water resource problems and to examine computational techniques which have been used to obtain solutions to these problems. Problem areas surveyed here include aqueduct design, irrigation system control, project development, water quality maintenance, and reservoir operations analysis. Computational considerations impose severe limitation on the scale of dynamic programming problems which can be solved. Inventive numerical techniques for implementing dynamic programming have been applied to water resource problems. Discrete dynamic programming, differential dynamic programming, state incremental dynamic programming, and Howard's policy iteration method are among the techniques reviewed. Attempts have been made to delineate the successful applications, and speculative ideas are offered toward attacking problems which have not been solved satisfactorily.
Boundary detection via dynamic programming
Udupa, Jayaram K.; Samarasekera, Supun; Barrett, William A.
1992-09-01
This paper reports a new method for detecting optimal boundaries in multidimensional scene data via dynamic programming (DP). In its current form the algorithm detects 2-D contours on slices and differs from other reported DP-based algorithms in an essential way in that it allows freedom in 2-D for finding optimal contour paths (as opposed to a single degree of freedom in the published methods). The method is being successfully used in segmenting object boundaries in a variety of medical applications including orbital volume from CT images (for craniofacial surgical planning), segmenting bone in MR images for kinematic analysis of the joints of the foot, segmenting the surface of the brain from the inner surface of the cranial vault, segmenting pituitary gland tumor for following the effect of a drug on the tumor, segmenting the boundaries of the heart in MR images, and segmenting the olfactory bulb for verifying hypotheses related to the size of this bulb in certain disease states.
Program Complex For Cyclotron Beam Dynamic Simulations
Glazov, A A; Karamysheva, G A; Lisenkova, O E
2004-01-01
The program complex in MATLAB intended for particle dynamic simulations is described. Programming in an easy-to-use environment permits creation of models in a short space of time. Advanced graphical tools of MATLAB give good visualization features to created models. The beam dynamic modelling results by the example of two different cyclotron designs are presented.
Microwave processes in the SPD-ATON stationary plasma thruster
Energy Technology Data Exchange (ETDEWEB)
Kirdyashev, K. P., E-mail: kpk@ms.ire.rssi.ru [Russian Academy of Sciences, Kotelnikov Institute of Radio Engineering and Electronics (Fryazino Branch) (Russian Federation)
2016-09-15
Results of experimental studies of microwave processes accompanying plasma acceleration in the SPD-ATON stationary plasma thruster are presented. Specific features of the generation of microwave oscillations in both the acceleration channel and the plasma flow outgoing from the thruster are analyzed on the basis of local measurements of the spectra of the plasma wave fields. Mechanisms for generation of microwave oscillations are considered with allowance for the inhomogeneity of the electron density and magnetic field behind the edge of the acceleration channel. The effect of microwave oscillations on the electron transport and the formation of the discharge current in the acceleration channel is discussed.
Addressing Dynamic Issues of Program Model Checking
Lerda, Flavio; Visser, Willem
2001-01-01
Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking difficult: the complexity of their state and the dynamic nature of many programs. Here we address both these issues within the context of the Java PathFinder (JPF) model checker. Firstly, we will show how the state of a Java program can be encoded efficiently and how this encoding can be exploited to improve model checking. Next we show how to use symmetry reductions to alleviate some of the problems introduced by the dynamic nature of Java programs. Lastly, we show how distributed model checking of a dynamic program can be achieved, and furthermore, how dynamic partitions of the state space can improve model checking. We support all our findings with results from applying these techniques within the JPF model checker.
[Cloning and expression of human sPD-1-Fc in Cos-7 cells].
Li, Bin; Liu, Chao-qi; Wang, Jian-zhi; Shi, Ji-jing; Lv, Bai-rui; Qin, Xiao-lin
2011-06-01
To investigate human soluble PD-1 (sPD-1) biological activity sPD-1 gene be cloned and expressed in eucaryote cells. sPD-1 gene was amplified from human PBMC mRNA by RT-PCR and cloned into eucaryotic expression vector pSG5-Fc. And the positive recombinant plasmid pSG5-Fc -sPD-1 was screened by enzyme digestion and sequencing.The correct sequencing of the recombinant plasmid pSG5-Fc-sPD-1 was transfected into COS-7 cells. The expressed recombinant protein in the supernatant was concentrated with protein A-agarose and analyzed by Western blot. The binding activity to PD-L1 which was expressed with prokaryotic cells was detected with Co-IP. The human sPD-1 fragment was obtained through RT-PCR. The plasmid pSG5-Fc-sPD-1 was constructed by double enzyme digestion and ligation of vector pSG5-Fc and fragment sPD-1. Sequenced sPD-1 gene was coincident with the theoretical sequence. sPD-1-Fc fusion protein in the supernatant was expressed in COS-7 cells and identified by Western blot. The activity of recombinant fusion protein sPD-1-Fc bound to PD-L1 had been detected with Co-IP. The human sPD-1 has been cloned and expressed in eucaryote cells successfully. The sPD-1-Fc fusion protein can be effective in binding to PD-L1, which can be used for further research in the function and clinical application of sPD-1.
Surfactant protein D (SP-D) serum levels in patients with community-acquired pneumonia
DEFF Research Database (Denmark)
Leth-Larsen, Rikke; Nordenbaek, Claudia; Tornoe, Ida
2003-01-01
blood samples from 61 patients hospitalized for community-acquired pneumonia of suspected bacterial origin. On the day of admission to the hospital the serum SP-D concentration was significantly lower than that in healthy subjects. On day 5, the SP-D concentration had increased on average three times...... the concentration on admission and then slowly declined toward normal levels. CRP was measured simultaneously but no correlation was observed between concentrations of SP-D and CRP. The results show a wide range of serum SP-D concentration in healthy volunteers and indicate that significant changes occur during...
Rule of Thumb and Dynamic Programming
Lettau, M.; Uhlig, H.F.H.V.S.
1995-01-01
This paper studies the relationships between learning about rules of thumb (represented by classifier systems) and dynamic programming. Building on a result about Markovian stochastic approximation algorithms, we characterize all decision functions that can be asymptotically obtained through
Dynamic Programming: An Introduction by Example
Zietz, Joachim
2007-01-01
The author introduces some basic dynamic programming techniques, using examples, with the help of the computer algebra system "Maple". The emphasis is on building confidence and intuition for the solution of dynamic problems in economics. To integrate the material better, the same examples are used to introduce different techniques. One covers the…
Integrating Pareto Optimization into Dynamic Programming
Directory of Open Access Journals (Sweden)
Thomas Gatter
2016-01-01
Full Text Available Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other. Recently, it was shown that Pareto optimization seamlessly integrates with algebraic dynamic programming: when scoring schemes A and B can correctly evaluate the search space via dynamic programming, then so can Pareto optimization with respect to A and B. However, the integration of Pareto optimization into dynamic programming opens a wide range of algorithmic alternatives, which we study in substantial detail in this article, using real-world applications in biosequence analysis, a field where dynamic programming is ubiquitous. Our results are two-fold: (1 We introduce the operation of a “Pareto algebra product” in the dynamic programming framework of Bellman’s GAP. Users of this framework can now ask for Pareto optimization with a single keystroke. Careful evaluation of the implementation alternatives by means of an extended Bellman’s GAP compiler demonstrates the dependence of the best implementation choice on the application at hand. (2 We extract from our experiments several pieces of advice to programmers who do not use a system such as Bellman’s GAP, but who choose to hand-craft their dynamic programming recurrences, incorporating Pareto optimization from scratch.
DEFF Research Database (Denmark)
Knudsen, Lars; Ochs, Katharina; Boxler, Laura
2013-01-01
lines expressing either Met(11) or Thr(11) SP-D under the control of the ubiquitously expressed pROSA26 promoter in C57Bl/6 SP-D deficient mice (DKO) was created. Both Met(11) (142 ± 52 ng mL(-1) ) and Thr(11) (228 ± 76 ng mL(-1) ) mice lines expressed human SP-D at almost similar levels. According......Surfactant protein D (SP-D) is part of the innate immune system involved in lung homeostasis. SP-D knockout mice show accumulations of foamy alveolar macrophages, alveolar lipoproteinosis and pulmonary emphysema. Three single nucleotide polymorphisms (SNPs) have been described in the coding...... sequence of the human SP-D gene SFTPD. Clinical studies showed that the SNP SFTPD with a nucleotide change from A to C resulting in a Met to Thr substitution at position 11 in the protein (Met(11)Thr), is relevant. This study set out to create a humanised mouse model of the Met(11)Thr SNP. Transgenic mice...
SP-D as a biomarker for COPD in the Lebanese population
DEFF Research Database (Denmark)
Akiki, Zeina; Fakih, Dalia; Jounblat, Rania
2014-01-01
Background: Surfactant protein D (SP-D), a promising systemic biomarker of chronic obstructive pulmonary disease (COPD) was never evaluated in the Lebanese population. Objective: The validity of serum SP-D as a biomarker for COPD, in comparison with C-reactive protein (CRP) and fibrinogen...... (GOLD 2013), and blood collection were performed. Serum SP-D and CRP, and plasma fibrinogen levels were measured by ELISA. Associations between biological markers with lung function parameters and COPD were estimated by spearman correlation and logistic regression models respectively. Results: Median......-COPD values (aOR=1.8, 1.49-2.16) and SP-D levels above the median value (aOR=3.51, 1.21-10.1) were significantly and independently associated with COPD in patients and healthy controls aged 40 years or above. No associations were found between CRP, fibrinogen levels and COPD, or between SP-D levels and lung...
The role of SP-D in human colonic inflammatory bowel disease and in murine DSS induced colitis
DEFF Research Database (Denmark)
Nexøe, Anders Bathum; Pilecki, Bartosz; Leicht von Huth, Sebastian
Background: Inflammatory bowel diseases (IBD) are disorders of the gastrointestinal tract. Surfactant protein D (SP-D) is expressed in the intestinal epithelium and is essential for innate host defence and regulation of inflammatory responses. Genetic variations of SP-D are associated with clinical...... IBD but SP-D effects in disease development are unknown. We hypothesized that SP-D ameliorates IBD inflammation. Methods: Surgical specimens from IBD patients including Crohn’s disease (CD) (n=9) and ulcerative colitis (UC) (n=18) were scored for expression of SP-D and inflammatory activity. C57BL6...... the restitution phase. Conclusion: Although anti-inflammatory effects of SP-D were limited in DSS-induced inflammation in mice, a positive correlation between inflammatory activity and immunoscore for SP-D in IBD patients supports an anti-inflammatory role of SP-D in clinical disease....
Program of Research in Structures and Dynamics
1988-01-01
The Structures and Dynamics Program was first initiated in 1972 with the following two major objectives: to provide a basic understanding and working knowledge of some key areas pertinent to structures, solid mechanics, and dynamics technology including computer aided design; and to provide a comprehensive educational and research program at the NASA Langley Research Center leading to advanced degrees in the structures and dynamics areas. During the operation of the program the research work was done in support of the activities of both the Structures and Dynamics Division and the Loads and Aeroelasticity Division. During the period of 1972 to 1986 the Program provided support for two full-time faculty members, one part-time faculty member, three postdoctoral fellows, one research engineer, eight programmers, and 28 graduate research assistants. The faculty and staff of the program have published 144 papers and reports, and made 70 presentations at national and international meetings, describing their research findings. In addition, they organized and helped in the organization of 10 workshops and national symposia in the structures and dynamics areas. The graduate research assistants and the students enrolled in the program have written 20 masters theses and 2 doctoral dissertations. The overall progress is summarized.
Planar multibody dynamics formulation, programming and applications
Nikravesh, Parviz E
2007-01-01
Introduction Multibody Mechanical Systems Types of Analyses Methods of Formulation Computer Programming Application Examples Unit System Remarks Preliminaries Reference Axes Scalars and Vectors Matrices Vector, Array, and Matrix Differentiation Equations and Expressions Remarks Problems Fundamentals of Kinematics A Particle Kinematics of a Rigid Body Definitions Remarks Problems Fundamentals of Dynamics Newton's Laws of Motion Dynamics of a Body Force Elements Applied Forces Reaction Force Remarks Problems Point-Coordinates: Kinematics Multipoint
Configuring Airspace Sectors with Approximate Dynamic Programming
Bloem, Michael; Gupta, Pramod
2010-01-01
In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.
Dynamic Programming Based Segmentation in Biomedical Imaging.
Ungru, Kathrin; Jiang, Xiaoyi
2017-01-01
Many applications in biomedical imaging have a demand on automatic detection of lines, contours, or boundaries of bones, organs, vessels, and cells. Aim is to support expert decisions in interactive applications or to include it as part of a processing pipeline for automatic image analysis. Biomedical images often suffer from noisy data and fuzzy edges. Therefore, there is a need for robust methods for contour and line detection. Dynamic programming is a popular technique that satisfies these requirements in many ways. This work gives a brief overview over approaches and applications that utilize dynamic programming to solve problems in the challenging field of biomedical imaging.
Lung Surfactant Protein D (SP-D) Response and Regulation During Acute and Chronic Lung Injury
DEFF Research Database (Denmark)
Gaunsbaek, Maria Quisgaard; Rasmussen, Karina Juhl; Beers, Michael F.
2013-01-01
BACKGROUND: Surfactant protein D (SP-D) is a collection that plays important roles in modulating host defense functions and maintaining phospholipid homeostasis in the lung. The aim of current study was to characterize comparatively the SP-D response in bronchoalveolar lavage (BAL) and serum...... in three murine models of lung injury, using a validated ELISA technology for estimation of SP-D levels. METHODS: Mice were exposed to lipopolysaccharide, bleomycin, or Pneumocystis carinii (Pc) and sacrificed at different time points. RESULTS: In lipopolysaccharide-challenged mice, the level of SP...
The Dynamic Geometrisation of Computer Programming
Sinclair, Nathalie; Patterson, Margaret
2018-01-01
The goal of this paper is to explore dynamic geometry environments (DGE) as a type of computer programming language. Using projects created by secondary students in one particular DGE, we analyse the extent to which the various aspects of computational thinking--including both ways of doing things and particular concepts--were evident in their…
Approximate Dynamic Programming by Practical Examples
Mes, Martijn R.K.; Perez Rivera, Arturo Eduardo; Boucherie, Richard; van Dijk, Nico M.
2017-01-01
Computing the exact solution of an MDP model is generally difficult and possibly intractable for realistically sized problem instances. A powerful technique to solve the large scale discrete time multistage stochastic control processes is Approximate Dynamic Programming (ADP). Although ADP is used
Microsoft Dynamics NAV 7 programming cookbook
Raul, Rakesh
2013-01-01
Written in the style of a cookbook. Microsoft Dynamics NAV 7 Programming Cookbook is full of recipes to help you get the job done.If you are a junior / entry-level NAV developer then the first half of the book is designed primarily for you. You may or may not have any experience programming. It focuses on the basics of NAV programming.If you are a mid-level NAV developer, you will find these chapters explain how to think outside of the NAV box when building solutions. There are also recipes that senior developers will find useful.
Stochastic control theory dynamic programming principle
Nisio, Makiko
2015-01-01
This book offers a systematic introduction to the optimal stochastic control theory via the dynamic programming principle, which is a powerful tool to analyze control problems. First we consider completely observable control problems with finite horizons. Using a time discretization we construct a nonlinear semigroup related to the dynamic programming principle (DPP), whose generator provides the Hamilton–Jacobi–Bellman (HJB) equation, and we characterize the value function via the nonlinear semigroup, besides the viscosity solution theory. When we control not only the dynamics of a system but also the terminal time of its evolution, control-stopping problems arise. This problem is treated in the same frameworks, via the nonlinear semigroup. Its results are applicable to the American option price problem. Zero-sum two-player time-homogeneous stochastic differential games and viscosity solutions of the Isaacs equations arising from such games are studied via a nonlinear semigroup related to DPP (the min-ma...
Role of SpdA in Cell Spreading and Phagocytosis in Dictyostelium.
Directory of Open Access Journals (Sweden)
Marco Dias
Full Text Available Dictyostelium discoideum is a widely used model to study molecular mechanisms controlling cell adhesion, cell spreading on a surface, and phagocytosis. In this study we isolated and characterize a new mutant created by insertion of a mutagenic vector in the heretofore uncharacterized spdA gene. SpdA-ins mutant cells produce an altered, slightly shortened version of the SpdA protein. They spread more efficiently than WT cells when allowed to adhere to a glass substrate, and phagocytose particles more efficiently. On the contrary, a functional spdA knockout mutant where a large segment of the gene was deleted phagocytosed less efficiently and spread less efficiently on a substrate. These phenotypes were highly dependent on the cellular density, and were most visible at high cell densities, where secreted quorum-sensing factors inhibiting cell motility, spreading and phagocytosis are most active. These results identify the involvement of SpdA in the control of cell spreading and phagocytosis. The underlying molecular mechanisms, as well as the exact link between SpdA and cell spreading, remain to be established.
Dynamic Economic Dispatch Menggunakan Quadratic Programming
Directory of Open Access Journals (Sweden)
Zainal Abidin
2012-09-01
Full Text Available Economic dispatch (ED dapat diterapkan untuk mengatasi masalah penjadwalan pembangkit secara optimal ekonomi, namum jika digunakan pada sistem dengan beban dalam rentang waktu tertentu, akan ada beberapa pembangkitan yang melewati batas dari parameter ramp rate pembangkit. Dengan parameter ramp rate, ED tidak dapat diselesaikan pada satu level beban. Dynamic economic dispatch (DED merupakan pengembangan dari economic dispatch konvensional karena memperhitungkan batasan ramp rate dari unit pembangkit. DED dapat digunakan untuk menentukan pembagian pembebanan unit pembangkit secara ekonomis dalam rentang waktu tertentu tanpa melanggar batasan ramp rate dari unit pembangkit. Pada tugas akhir ini digunakan quadratic programming untuk menyelesaikan dynamic economic dispatch. Hasil simulasi menunjukkan bahwa quadratic programming yang digunakan dapat menyelesaikan DED tanpa melanggar parameter ramp rate yang ditentukan. Pada percobaan dengan 3-unit pembangkit pada 4 profil beban berbeda dan percobaan dengan 10-unit pembangkit menujukkan bahwa parameter ramp rate menyebabkan pembagian pembebanan pada satu waktu tertentu akan mempengaruhi pembagian pembebanan pada waktu lain serta terdapat variasi pembangkitan yang berbeda antara economic dispatch dan dynamic economic dispatch. Parameter ramp rate juga menyebabkan total biaya pembangkitan pada dynamic economic dispatch menjadi lebih mahal jika dibandingkan dengan economic dispatch.
Joint Chance-Constrained Dynamic Programming
Ono, Masahiro; Kuwata, Yoshiaki; Balaram, J. Bob
2012-01-01
This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.
Sandia Dynamic Materials Program Strategic Plan.
Energy Technology Data Exchange (ETDEWEB)
Flicker, Dawn Gustine [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Benage, John F. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Desjarlais, Michael P. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Knudson, Marcus D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Leifeste, Gordon T. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lemke, Raymond W. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Mattsson, Thomas [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Wise, Jack L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2017-05-01
Materials in nuclear and conventional weapons can reach multi-megabar pressures and 1000s of degree temperatures on timescales ranging from microseconds to nanoseconds. Understanding the response of complex materials under these conditions is important for designing and assessing changes to nuclear weapons. In the next few decades, a major concern will be evaluating the behavior of aging materials and remanufactured components. The science to enable the program to underwrite decisions quickly and confidently on use, remanufacturing, and replacement of these materials will be critical to NNSA’s new Stockpile Responsiveness Program. Material response is also important for assessing the risks posed by adversaries or proliferants. Dynamic materials research, which refers to the use of high-speed experiments to produce extreme conditions in matter, is an important part of NNSA’s Stockpile Stewardship Program.
The role of SP-D in human colonic inflammatory bowel disease and in murine DSS induced colitis
DEFF Research Database (Denmark)
Nexøe, Anders Bathum; Pilecki, Bartosz; Leicht von Huth, Sebastian
IBD but SP-D effects in disease development are unknown. We hypothesized that SP-D ameliorates IBD inflammation. Methods: Surgical specimens from IBD patients including Crohn’s disease (CD) (n=9) and ulcerative colitis (UC) (n=18) were scored for expression of SP-D and inflammatory activity. C57BL6......&E-stained tissue was scored for histologic damage. Immunohistochemical stainings were used to quantify the mucosal thickness, epithelial apoptosis, crypt cell proliferation and infiltration of inflammatory cells. Results: Surgical specimens from IBD patients showed a significant positive correlation between...... the restitution phase. Conclusion: Although anti-inflammatory effects of SP-D were limited in DSS-induced inflammation in mice, a positive correlation between inflammatory activity and immunoscore for SP-D in IBD patients supports an anti-inflammatory role of SP-D in clinical disease....
An insight into the immune roles of surfactant proteins, SP-A and SP-D
Directory of Open Access Journals (Sweden)
Annapurna eNayak
2012-06-01
Full Text Available Pulmonary surfactant proteins, SP-A and SP-D, are hydrophilic collagen-containing calcium-dependent lectins, which appear to have a range of innate immune functions at pulmonary as well as extrapulmonary sites. These proteins bind to target ligands on pathogens, allergens and apoptotic cells via C-terminal carbohydrate recognition domains while the collagen region brings about the effector functions. SP-A and SP-D deals with various pathogens triggering a range of innate immune mechanisms such as agglutination/aggregation, enhancement of phagocytosis and killing reactions, and growth inhibition. SP-A and SP-D have also been involved in the control of pulmonary inflammation including allergy and asthma, and hence, they are likely to central issues in a range of pathological situations. There is also emerging evidence to suggest that SP-A and SP-D are capable of linking innate immunity with adaptive immunity that includes modulation of dendritic cell function and helper T cell polarisation. It is clear now that SP-A and SP-D are potent innate immune molecules in the lungs. This review is a summary of their immunological properties in general and their importance in human health and disease.
LIU, Tongzhu; SHEN, Aizong; HU, Xiaojian; TONG, Guixian; GU, Wei
2017-01-01
Background: We aimed to apply collaborative business intelligence (BI) system to hospital supply, processing and distribution (SPD) logistics management model. Methods: We searched Engineering Village database, China National Knowledge Infrastructure (CNKI) and Google for articles (Published from 2011 to 2016), books, Web pages, etc., to understand SPD and BI related theories and recent research status. For the application of collaborative BI technology in the hospital SPD logistics management model, we realized this by leveraging data mining techniques to discover knowledge from complex data and collaborative techniques to improve the theories of business process. Results: For the application of BI system, we: (i) proposed a layered structure of collaborative BI system for intelligent management in hospital logistics; (ii) built data warehouse for the collaborative BI system; (iii) improved data mining techniques such as supporting vector machines (SVM) and swarm intelligence firefly algorithm to solve key problems in hospital logistics collaborative BI system; (iv) researched the collaborative techniques oriented to data and business process optimization to improve the business processes of hospital logistics management. Conclusion: Proper combination of SPD model and BI system will improve the management of logistics in the hospitals. The successful implementation of the study requires: (i) to innovate and improve the traditional SPD model and make appropriate implement plans and schedules for the application of BI system according to the actual situations of hospitals; (ii) the collaborative participation of internal departments in hospital including the department of information, logistics, nursing, medical and financial; (iii) timely response of external suppliers. PMID:28828316
Liu, Tongzhu; Shen, Aizong; Hu, Xiaojian; Tong, Guixian; Gu, Wei
2017-06-01
We aimed to apply collaborative business intelligence (BI) system to hospital supply, processing and distribution (SPD) logistics management model. We searched Engineering Village database, China National Knowledge Infrastructure (CNKI) and Google for articles (Published from 2011 to 2016), books, Web pages, etc., to understand SPD and BI related theories and recent research status. For the application of collaborative BI technology in the hospital SPD logistics management model, we realized this by leveraging data mining techniques to discover knowledge from complex data and collaborative techniques to improve the theories of business process. For the application of BI system, we: (i) proposed a layered structure of collaborative BI system for intelligent management in hospital logistics; (ii) built data warehouse for the collaborative BI system; (iii) improved data mining techniques such as supporting vector machines (SVM) and swarm intelligence firefly algorithm to solve key problems in hospital logistics collaborative BI system; (iv) researched the collaborative techniques oriented to data and business process optimization to improve the business processes of hospital logistics management. Proper combination of SPD model and BI system will improve the management of logistics in the hospitals. The successful implementation of the study requires: (i) to innovate and improve the traditional SPD model and make appropriate implement plans and schedules for the application of BI system according to the actual situations of hospitals; (ii) the collaborative participation of internal departments in hospital including the department of information, logistics, nursing, medical and financial; (iii) timely response of external suppliers.
Eradication of Ebola Based on Dynamic Programming
Directory of Open Access Journals (Sweden)
Jia-Ming Zhu
2016-01-01
Full Text Available This paper mainly studies the eradication of the Ebola virus, proposing a scientific system, including three modules for the eradication of Ebola virus. Firstly, we build a basic model combined with nonlinear incidence rate and maximum treatment capacity. Secondly, we use the dynamic programming method and the Dijkstra Algorithm to set up M-S (storage and several delivery locations in West Africa. Finally, we apply the previous results to calculate the total cost, production cost, storage cost, and shortage cost.
Granular contact dynamics using mathematical programming methods
DEFF Research Database (Denmark)
Krabbenhoft, K.; Lyamin, A. V.; Huang, J.
2012-01-01
A class of variational formulations for discrete element analysis of granular media is presented. These formulations lead naturally to convex mathematical programs that can be solved using standard and readily available tools. In contrast to traditional discrete element analysis, the present...... is developed and it is concluded that the associated sliding rule, in the context of granular contact dynamics, may be viewed as an artifact of the time discretization and that the use of an associated flow rule at the particle scale level generally is physically acceptable. (C) 2012 Elsevier Ltd. All rights...
Runway Scheduling Using Generalized Dynamic Programming
Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar
2011-01-01
A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.
Automated Flight Routing Using Stochastic Dynamic Programming
Ng, Hok K.; Morando, Alex; Grabbe, Shon
2010-01-01
Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.
An enzyme-linked immunosorbent assay (ELISA) for quantification of mouse surfactant protein D (SP-D)
DEFF Research Database (Denmark)
Hansen, Soren; Schmidt, Vivi; Steffensen, Maria Abildgaard
2008-01-01
Surfactant protein D (SP-D) is a pattern recognition molecule of the collectin family of C-type lectins. It is found in the airways and at mucosal surfaces. SP-D is part of the innate immune system where it neutralizes and leads to elimination of microorganisms. It regulates the functions of othe...
A Dynamic Programming Approach to Constrained Portfolios
DEFF Research Database (Denmark)
Kraft, Holger; Steffensen, Mogens
2013-01-01
This paper studies constrained portfolio problems that may involve constraints on the probability or the expected size of a shortfall of wealth or consumption. Our first contribution is that we solve the problems by dynamic programming, which is in contrast to the existing literature that applies...... the martingale method. More precisely, we construct the non-separable value function by formalizing the optimal constrained terminal wealth to be a (conjectured) contingent claim on the optimal non-constrained terminal wealth. This is relevant by itself, but also opens up the opportunity to derive new solutions...... to constrained problems. As a second contribution, we thus derive new results for non-strict constraints on the shortfall of intermediate wealth and/or consumption....
Pareto optimization in algebraic dynamic programming.
Saule, Cédric; Giegerich, Robert
2015-01-01
Pareto optimization combines independent objectives by computing the Pareto front of its search space, defined as the set of all solutions for which no other candidate solution scores better under all objectives. This gives, in a precise sense, better information than an artificial amalgamation of different scores into a single objective, but is more costly to compute. Pareto optimization naturally occurs with genetic algorithms, albeit in a heuristic fashion. Non-heuristic Pareto optimization so far has been used only with a few applications in bioinformatics. We study exact Pareto optimization for two objectives in a dynamic programming framework. We define a binary Pareto product operator [Formula: see text] on arbitrary scoring schemes. Independent of a particular algorithm, we prove that for two scoring schemes A and B used in dynamic programming, the scoring scheme [Formula: see text] correctly performs Pareto optimization over the same search space. We study different implementations of the Pareto operator with respect to their asymptotic and empirical efficiency. Without artificial amalgamation of objectives, and with no heuristics involved, Pareto optimization is faster than computing the same number of answers separately for each objective. For RNA structure prediction under the minimum free energy versus the maximum expected accuracy model, we show that the empirical size of the Pareto front remains within reasonable bounds. Pareto optimization lends itself to the comparative investigation of the behavior of two alternative scoring schemes for the same purpose. For the above scoring schemes, we observe that the Pareto front can be seen as a composition of a few macrostates, each consisting of several microstates that differ in the same limited way. We also study the relationship between abstract shape analysis and the Pareto front, and find that they extract information of a different nature from the folding space and can be meaningfully combined.
DEFF Research Database (Denmark)
Fleck, Oliver; Fahnøe, Ulrik; Løvschal, Katrine Vyff
2017-01-01
In fission yeast, the small, intrinsically disordered protein S-phase delaying protein 1 (Spd1) blocks DNA replication and causes checkpoint activation at least in part, by inhibiting the enzyme ribonucleotide reductase, which is responsible for the synthesis of DNA. The CRL4(Cdt2) E3 ubiquitin...... triphosphate (dNTP) pools; yet we find that Spd1 and Spd2 together inhibit DNA replication upon Cdt2 depletion. To directly test whether this block of replication was solely due to insufficient dNTP levels, we established a deoxy-nucleotide salvage pathway in fission yeast by expressing the human nucleoside...... ribonucleotide reductase. However, salvage completely failed to rescue S phase delay, checkpoint activation, and damage sensitivity, which was caused by CRL4(Cdt2) inactivation, suggesting that Spd1-in addition to repressing dNTP synthesis-together with Spd2, can inhibit other replication functions. We propose...
Implementing a Dynamic Street-Children's Program: Successes and ...
African Journals Online (AJOL)
Implementing a Dynamic Street-Children's Program: Successes and Challenges. ... the influence that early childhood dynamics of parentchild, parent-parent and ... they can influence the child's behaviour in both positive and negative ways.
Common genetic variants of surfactant protein-D (SP-D are associated with type 2 diabetes.
Directory of Open Access Journals (Sweden)
Neus Pueyo
Full Text Available CONTEXT: Surfactant protein-D (SP-D is a primordial component of the innate immune system intrinsically linked to metabolic pathways. We aimed to study the association of single nucleotide polymorphisms (SNPs affecting SP-D with insulin resistance and type 2 diabetes (T2D. RESEARCH DESIGN AND METHODS: We evaluated a common genetic variant located in the SP-D coding region (rs721917, Met(31Thr in a sample of T2D patients and non-diabetic controls (n = 2,711. In a subset of subjects (n = 1,062, this SNP was analyzed in association with circulating SP-D concentrations, insulin resistance, and T2D. This SNP and others were also screened in the publicly available Genome Wide Association (GWA database of the Meta-Analyses of Glucose and Insulin-related traits Consortium (MAGIC. RESULTS: We found the significant association of rs721917 with circulating SP-D, parameters of insulin resistance and T2D. Indeed, G carriers showed decreased circulating SP-D (p = 0.004, decreased fasting glucose (p = 0.0002, glycated hemoglobin (p = 0.0005, and 33% (p = 0.002 lower prevalence of T2D, estimated under a dominant model, especially among women. Interestingly, these differences remained significant after controlling for origin, age, gender, and circulating SP-D. Moreover, this SNP and others within the SP-D genomic region (i.e. rs10887344 were significantly associated with quantitative measures of glucose homeostasis, insulin sensitivity, and T2D, according to GWAS datasets from MAGIC. CONCLUSIONS: SP-D gene polymorphisms are associated with insulin resistance and T2D. These associations are independent of circulating SP-D concentrations.
Spatial cluster detection using dynamic programming
Directory of Open Access Journals (Sweden)
Sverchkov Yuriy
2012-03-01
Full Text Available Abstract Background The task of spatial cluster detection involves finding spatial regions where some property deviates from the norm or the expected value. In a probabilistic setting this task can be expressed as finding a region where some event is significantly more likely than usual. Spatial cluster detection is of interest in fields such as biosurveillance, mining of astronomical data, military surveillance, and analysis of fMRI images. In almost all such applications we are interested both in the question of whether a cluster exists in the data, and if it exists, we are interested in finding the most accurate characterization of the cluster. Methods We present a general dynamic programming algorithm for grid-based spatial cluster detection. The algorithm can be used for both Bayesian maximum a-posteriori (MAP estimation of the most likely spatial distribution of clusters and Bayesian model averaging over a large space of spatial cluster distributions to compute the posterior probability of an unusual spatial clustering. The algorithm is explained and evaluated in the context of a biosurveillance application, specifically the detection and identification of Influenza outbreaks based on emergency department visits. A relatively simple underlying model is constructed for the purpose of evaluating the algorithm, and the algorithm is evaluated using the model and semi-synthetic test data. Results When compared to baseline methods, tests indicate that the new algorithm can improve MAP estimates under certain conditions: the greedy algorithm we compared our method to was found to be more sensitive to smaller outbreaks, while as the size of the outbreaks increases, in terms of area affected and proportion of individuals affected, our method overtakes the greedy algorithm in spatial precision and recall. The new algorithm performs on-par with baseline methods in the task of Bayesian model averaging. Conclusions We conclude that the dynamic
Spatial cluster detection using dynamic programming.
Sverchkov, Yuriy; Jiang, Xia; Cooper, Gregory F
2012-03-25
The task of spatial cluster detection involves finding spatial regions where some property deviates from the norm or the expected value. In a probabilistic setting this task can be expressed as finding a region where some event is significantly more likely than usual. Spatial cluster detection is of interest in fields such as biosurveillance, mining of astronomical data, military surveillance, and analysis of fMRI images. In almost all such applications we are interested both in the question of whether a cluster exists in the data, and if it exists, we are interested in finding the most accurate characterization of the cluster. We present a general dynamic programming algorithm for grid-based spatial cluster detection. The algorithm can be used for both Bayesian maximum a-posteriori (MAP) estimation of the most likely spatial distribution of clusters and Bayesian model averaging over a large space of spatial cluster distributions to compute the posterior probability of an unusual spatial clustering. The algorithm is explained and evaluated in the context of a biosurveillance application, specifically the detection and identification of Influenza outbreaks based on emergency department visits. A relatively simple underlying model is constructed for the purpose of evaluating the algorithm, and the algorithm is evaluated using the model and semi-synthetic test data. When compared to baseline methods, tests indicate that the new algorithm can improve MAP estimates under certain conditions: the greedy algorithm we compared our method to was found to be more sensitive to smaller outbreaks, while as the size of the outbreaks increases, in terms of area affected and proportion of individuals affected, our method overtakes the greedy algorithm in spatial precision and recall. The new algorithm performs on-par with baseline methods in the task of Bayesian model averaging. We conclude that the dynamic programming algorithm performs on-par with other available methods for
Directory of Open Access Journals (Sweden)
Marine L B Hillaire
Full Text Available The emergence of influenza viruses resistant to existing classes of antiviral drugs raises concern and there is a need for novel antiviral agents that could be used therapeutically or prophylacticaly. Surfactant protein D (SP-D belongs to the family of C-type lectins which are important effector molecules of the innate immune system with activity against bacteria and viruses, including influenza viruses. In the present study we evaluated the potential of recombinant porcine SP-D as an antiviral agent against influenza A viruses (IAVs in vitro. To determine the range of antiviral activity, thirty IAVs of the subtypes H1N1, H3N2 and H5N1 that originated from birds, pigs and humans were selected and tested for their sensitivity to recombinant SP-D. Using these viruses it was shown by hemagglutination inhibition assay, that recombinant porcine SP-D was more potent than recombinant human SP-D and that especially higher order oligomeric forms of SP-D had the strongest antiviral activity. Porcine SP-D was active against a broad range of IAV strains and neutralized a variety of H1N1 and H3N2 IAVs, including 2009 pandemic H1N1 viruses. Using tissue sections of ferret and human trachea, we demonstrated that recombinant porcine SP-D prevented attachment of human seasonal H1N1 and H3N2 virus to receptors on epithelial cells of the upper respiratory tract. It was concluded that recombinant porcine SP-D holds promise as a novel antiviral agent against influenza and further development and evaluation in vivo seems warranted.
Directory of Open Access Journals (Sweden)
Oliver Fleck
2017-04-01
Full Text Available In fission yeast, the small, intrinsically disordered protein S-phase delaying protein 1 (Spd1 blocks DNA replication and causes checkpoint activation at least in part, by inhibiting the enzyme ribonucleotide reductase, which is responsible for the synthesis of DNA. The CRL4Cdt2 E3 ubiquitin ligase mediates degradation of Spd1 and the related protein Spd2 at S phase of the cell cycle. We have generated a conditional allele of CRL4Cdt2, by expressing the highly unstable substrate-recruiting protein Cdt2 from a repressible promoter. Unlike Spd1, Spd2 does not regulate deoxynucleotide triphosphate (dNTP pools; yet we find that Spd1 and Spd2 together inhibit DNA replication upon Cdt2 depletion. To directly test whether this block of replication was solely due to insufficient dNTP levels, we established a deoxy-nucleotide salvage pathway in fission yeast by expressing the human nucleoside transporter human equilibrative nucleoside transporter 1 (hENT1 and the Drosophila deoxynucleoside kinase. We present evidence that this salvage pathway is functional, as 2 µM of deoxynucleosides in the culture medium is able to rescue the growth of two different temperature-sensitive alleles controlling ribonucleotide reductase. However, salvage completely failed to rescue S phase delay, checkpoint activation, and damage sensitivity, which was caused by CRL4Cdt2 inactivation, suggesting that Spd1—in addition to repressing dNTP synthesis—together with Spd2, can inhibit other replication functions. We propose that this inhibition works at the point of the replication clamp proliferating cell nuclear antigen, a co-factor for DNA replication.
Directory of Open Access Journals (Sweden)
Beers Michael F
2008-01-01
Full Text Available Abstract Background Surfactant protein D (SP-D, an innate immune molecule, plays an important protective role during airway inflammation. Deficiency of this molecule induces emphysematous changes in murine lungs, but its significance in human COPD remains unclear. Methods We collected bronchoalveolar lavage fluid from 20 subjects with varying degrees of COPD (8 former smokers and 12 current smokers and 15 asymptomatic healthy control subjects (5 never smokers, 3 remote former smokers, and 7 current smokers. All subjects underwent a complete medical history and pulmonary function testing. SP-D was measured by Enzyme-Linked ImmunoSorbent Assay. Statistical analysis was performed using nonparametric methods and multivariable linear regression for control of confounding. The effect of corticosteroid treatment on SP-D synthesis was studied in vitro using an established model of isolated type II alveolar epithelial cell culture. Results Among former smokers, those with COPD had significantly lower SP-D levels than healthy subjects (median 502 and 1067 ng/mL, respectively, p = 0.01. In a multivariable linear regression model controlling for age, sex, race, and pack-years of tobacco, COPD was independently associated with lower SP-D levels (model coefficient -539, p = 0.04 and inhaled corticosteroid use was independently associated with higher SP-D levels (398, p = 0.046. To support the hypothesis that corticosteroids increase SP-D production we used type II alveolar epithelial cells isolated from adult rat lungs. These cells responded to dexamethasone treatment by a significant increase of SP-D mRNA (p = 0.041 and protein (p = 0.037 production after 4 days of culture. Conclusion Among former smokers, COPD is associated with lower levels of SP-D and inhaled corticosteroid use is associated with higher levels of SP-D in the lung. Dexamethasone induced SP-D mRNA and protein expression in isolated epithelial cells in vitro. Given the importance of this
The role of SP-D in human colonic inflammatory bowel disease and in murine DSS induced colitis
DEFF Research Database (Denmark)
Nexøe, Anders Bathum; Pilecki, Bartosz; Leicht von Huth, Sebastian
Sftpd+/+ and Sftpd-/- littermate mice were subjected to drinking water (control), 1.5% DSS for 7 days or 1% DSS for 7 days followed by 3 days of water. Weight loss and stool were monitored daily. Colonic levels of inflammatory markers (TNF-α, IFN-γ, CCL-2 and IL-6) were measured by ELISA. H...... the restitution phase. Conclusion: Although anti-inflammatory effects of SP-D were limited in DSS-induced inflammation in mice, a positive correlation between inflammatory activity and immunoscore for SP-D in IBD patients supports an anti-inflammatory role of SP-D in clinical disease....
A dynamic programming approach to adaptive fractionation.
Ramakrishnan, Jagdish; Craft, David; Bortfeld, Thomas; Tsitsiklis, John N
2012-03-07
We conduct a theoretical study of various solution methods for the adaptive fractionation problem. The two messages of this paper are as follows: (i) dynamic programming (DP) is a useful framework for adaptive radiation therapy, particularly adaptive fractionation, because it allows us to assess how close to optimal different methods are, and (ii) heuristic methods proposed in this paper are near-optimal, and therefore, can be used to evaluate the best possible benefit of using an adaptive fraction size. The essence of adaptive fractionation is to increase the fraction size when the tumor and organ-at-risk (OAR) are far apart (a 'favorable' anatomy) and to decrease the fraction size when they are close together. Given that a fixed prescribed dose must be delivered to the tumor over the course of the treatment, such an approach results in a lower cumulative dose to the OAR when compared to that resulting from standard fractionation. We first establish a benchmark by using the DP algorithm to solve the problem exactly. In this case, we characterize the structure of an optimal policy, which provides guidance for our choice of heuristics. We develop two intuitive, numerically near-optimal heuristic policies, which could be used for more complex, high-dimensional problems. Furthermore, one of the heuristics requires only a statistic of the motion probability distribution, making it a reasonable method for use in a realistic setting. Numerically, we find that the amount of decrease in dose to the OAR can vary significantly (5-85%) depending on the amount of motion in the anatomy, the number of fractions and the range of fraction sizes allowed. In general, the decrease in dose to the OAR is more pronounced when: (i) we have a high probability of large tumor-OAR distances, (ii) we use many fractions (as in a hyper-fractionated setting) and (iii) we allow large daily fraction size deviations.
DEFF Research Database (Denmark)
Sorensen, G.L.; Hjelmborg, J.V.B.; Leth-Larsen, R.
2006-01-01
of the present study was to describe the association between serum SP-D and weight, waist circumference or BMI, and furthermore to observe body weight development in SP-D-deficient (Spd-/-) mice. As a part of the Danish population-based twin study (GEMINAKAR) on the metabolic syndrome, we analysed 1476 Danish...... twins for serum SP-D and investigated associations with weight, waist circumference and BMI by multiple regression analysis. Serum SP-D was significantly and inversely associated with weight (P = 0.001) and waist circumference in men (P ...Surfactant protein D (SP-D) is a key regulator of pathogen-induced inflammation. SP-D is further involved in lipid homeostasis in mouse lung and circulation and recent data have demonstrated that the body mass index (BMI; in kg/m(2)) is influenced by genes in common with SP-D. The objective...
Recursive Estimation of the Stein Center of SPD Matrices & its Applications.
Salehian, Hesamoddin; Cheng, Guang; Vemuri, Baba C; Ho, Jeffrey
2013-12-01
Symmetric positive-definite (SPD) matrices are ubiquitous in Computer Vision, Machine Learning and Medical Image Analysis. Finding the center/average of a population of such matrices is a common theme in many algorithms such as clustering, segmentation, principal geodesic analysis, etc. The center of a population of such matrices can be defined using a variety of distance/divergence measures as the minimizer of the sum of squared distances/divergences from the unknown center to the members of the population. It is well known that the computation of the Karcher mean for the space of SPD matrices which is a negatively-curved Riemannian manifold is computationally expensive. Recently, the LogDet divergence-based center was shown to be a computationally attractive alternative. However, the LogDet-based mean of more than two matrices can not be computed in closed form, which makes it computationally less attractive for large populations. In this paper we present a novel recursive estimator for center based on the Stein distance - which is the square root of the LogDet divergence - that is significantly faster than the batch mode computation of this center. The key theoretical contribution is a closed-form solution for the weighted Stein center of two SPD matrices, which is used in the recursive computation of the Stein center for a population of SPD matrices. Additionally, we show experimental evidence of the convergence of our recursive Stein center estimator to the batch mode Stein center. We present applications of our recursive estimator to K-means clustering and image indexing depicting significant time gains over corresponding algorithms that use the batch mode computations. For the latter application, we develop novel hashing functions using the Stein distance and apply it to publicly available data sets, and experimental results have shown favorable comparisons to other competing methods.
ALPprolog --- A New Logic Programming Method for Dynamic Domains
Drescher, Conrad; Thielscher, Michael
2011-01-01
Logic programming is a powerful paradigm for programming autonomous agents in dynamic domains, as witnessed by languages such as Golog and Flux. In this work we present ALPprolog, an expressive, yet efficient, logic programming language for the online control of agents that have to reason about incomplete information and sensing actions.
SPD-based Logistics Management Model of Medical Consumables in Hospitals.
Liu, Tongzhu; Shen, Aizong; Hu, Xiaojian; Tong, Guixian; Gu, Wei; Yang, Shanlin
2016-10-01
With the rapid development of health services, the progress of medical science and technology, and the improvement of materials research, the consumption of medical consumables (MCs) in medical activities has increased in recent years. However, owing to the lack of effective management methods and the complexity of MCs, there are several management problems including MC waste, low management efficiency, high management difficulty, and frequent medical accidents. Therefore, there is urgent need for an effective logistics management model to handle these problems and challenges in hospitals. We reviewed books and scientific literature (by searching the articles published from 2010 to 2015 in Engineering Village database) to understand supply chain related theories and methods and performed field investigations in hospitals across many cities to determine the actual state of MC logistics management of hospitals in China. We describe the definition, physical model, construction, and logistics operation processes of the supply, processing, and distribution (SPD) of MC logistics because of the traditional SPD model. With the establishment of a supply-procurement platform and a logistics lean management system, we applied the model to the MC logistics management of Anhui Provincial Hospital with good effects. The SPD model plays a critical role in optimizing the logistics procedures of MCs, improving the management efficiency of logistics, and reducing the costs of logistics of hospitals in China.
SPD-based Logistics Management Model of Medical Consumables in Hospitals
LIU, Tongzhu; SHEN, Aizong; HU, Xiaojian; TONG, Guixian; GU, Wei; YANG, Shanlin
2016-01-01
Background: With the rapid development of health services, the progress of medical science and technology, and the improvement of materials research, the consumption of medical consumables (MCs) in medical activities has increased in recent years. However, owing to the lack of effective management methods and the complexity of MCs, there are several management problems including MC waste, low management efficiency, high management difficulty, and frequent medical accidents. Therefore, there is urgent need for an effective logistics management model to handle these problems and challenges in hospitals. Methods: We reviewed books and scientific literature (by searching the articles published from 2010 to 2015 in Engineering Village database) to understand supply chain related theories and methods and performed field investigations in hospitals across many cities to determine the actual state of MC logistics management of hospitals in China. Results: We describe the definition, physical model, construction, and logistics operation processes of the supply, processing, and distribution (SPD) of MC logistics because of the traditional SPD model. With the establishment of a supply-procurement platform and a logistics lean management system, we applied the model to the MC logistics management of Anhui Provincial Hospital with good effects. Conclusion: The SPD model plays a critical role in optimizing the logistics procedures of MCs, improving the management efficiency of logistics, and reducing the costs of logistics of hospitals in China. PMID:27957435
Approximate Dynamic Programming Solving the Curses of Dimensionality
Powell, Warren B
2011-01-01
Praise for the First Edition "Finally, a book devoted to dynamic programming and written using the language of operations research (OR)! This beautiful book fills a gap in the libraries of OR specialists and practitioners."-Computing Reviews This new edition showcases a focus on modeling and computation for complex classes of approximate dynamic programming problems Understanding approximate dynamic programming (ADP) is vital in order to develop practical and high-quality solutions to complex industrial problems, particularly when those problems involve making decisions in the presence of unce
Directory of Open Access Journals (Sweden)
Balasubramanian Ram
1988-01-01
Full Text Available This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.
DEFF Research Database (Denmark)
Wu, Y P; Liu, Z H; Wei, R
2009-01-01
Pulmonary SP-D is a defence lectin promoting clearance of viral infections. SP-D is recognized to bind the S protein of SARS-CoV and enhance phagocytosis. Moreover, systemic SP-D is widely used as a biomarker of alveolar integrity. We investigated the relation between plasma SP-D, SARS-type pneum...
Dynamic Programming Algorithms in Speech Recognition
Directory of Open Access Journals (Sweden)
Titus Felix FURTUNA
2008-01-01
Full Text Available In a system of speech recognition containing words, the recognition requires the comparison between the entry signal of the word and the various words of the dictionary. The problem can be solved efficiently by a dynamic comparison algorithm whose goal is to put in optimal correspondence the temporal scales of the two words. An algorithm of this type is Dynamic Time Warping. This paper presents two alternatives for implementation of the algorithm designed for recognition of the isolated words.
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
Energy Technology Data Exchange (ETDEWEB)
Groer, Christopher S [ORNL; Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL
2012-10-01
It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.
Programming the dynamics of biochemical reaction networks.
Simmel, Friedrich C
2013-01-22
The development of complex self-organizing molecular systems for future nanotechnology requires not only robust formation of molecular structures by self-assembly but also precise control over their temporal dynamics. As an exquisite example of such control, in this issue of ACS Nano, Fujii and Rondelez demonstrate a particularly compact realization of a molecular "predator-prey" ecosystem consisting of only three DNA species and three enzymes. The system displays pronounced oscillatory dynamics, in good agreement with the predictions of a simple theoretical model. Moreover, its considerable modularity also allows for ecological studies of competition and cooperation within molecular networks.
Modelling of windmill induction generators in dynamic simulation programs
DEFF Research Database (Denmark)
Akhmatov, Vladislav; Knudsen, Hans
1999-01-01
For AC networks with large amounts of induction generators-in case of e.g. windmills-the paper demonstrates a significant discrepancy in the simulated voltage recovery after faults in weak networks, when comparing result obtained with dynamic stability programs and transient programs, respectively...
Dynamic Learning Objects to Teach Java Programming Language
Narasimhamurthy, Uma; Al Shawkani, Khuloud
2010-01-01
This article describes a model for teaching Java Programming Language through Dynamic Learning Objects. The design of the learning objects was based on effective learning design principles to help students learn the complex topic of Java Programming. Visualization was also used to facilitate the learning of the concepts. (Contains 1 figure and 2…
Dynamic Economic Dispatch Menggunakan Quadratic Programming
Zainal Abidin; Imam Robandi; Rony Seto Wibowo
2012-01-01
Economic dispatch (ED) dapat diterapkan untuk mengatasi masalah penjadwalan pembangkit secara optimal ekonomi, namum jika digunakan pada sistem dengan beban dalam rentang waktu tertentu, akan ada beberapa pembangkitan yang melewati batas dari parameter ramp rate pembangkit. Dengan parameter ramp rate, ED tidak dapat diselesaikan pada satu level beban. Dynamic economic dispatch (DED) merupakan pengembangan dari economic dispatch konvensional karena memperhitungkan batasan ramp rate dari unit p...
The application of dynamic programming in production planning
Wu, Run
2017-05-01
Nowadays, with the popularity of the computers, various industries and fields are widely applying computer information technology, which brings about huge demand for a variety of application software. In order to develop software meeting various needs with most economical cost and best quality, programmers must design efficient algorithms. A superior algorithm can not only soul up one thing, but also maximize the benefits and generate the smallest overhead. As one of the common algorithms, dynamic programming algorithms are used to solving problems with some sort of optimal properties. When solving problems with a large amount of sub-problems that needs repetitive calculations, the ordinary sub-recursive method requires to consume exponential time, and dynamic programming algorithm can reduce the time complexity of the algorithm to the polynomial level, according to which we can conclude that dynamic programming algorithm is a very efficient compared to other algorithms reducing the computational complexity and enriching the computational results. In this paper, we expound the concept, basic elements, properties, core, solving steps and difficulties of the dynamic programming algorithm besides, establish the dynamic programming model of the production planning problem.
Qualification of a computer program for drill string dynamics
Energy Technology Data Exchange (ETDEWEB)
Stone, C.M.; Carne, T.G.; Caskey, B.C.
1985-01-01
A four point plan for the qualification of the GEODYN drill string dynamics computer program is described. The qualification plan investigates both modal response and transient response of a short drill string subjected to simulated cutting loads applied through a polycrystalline diamond compact (PDC) bit. The experimentally based qualification shows that the analytical techniques included in Phase 1 GEODYN correctly simulate the dynamic response of the bit-drill string system. 6 refs., 8 figs.
Approximate dynamic programming solving the curses of dimensionality
Powell, Warren B
2007-01-01
Warren B. Powell, PhD, is Professor of Operations Research and Financial Engineering at Princeton University, where he is founder and Director of CASTLE Laboratory, a research unit that works with industrial partners to test new ideas found in operations research. The recipient of the 2004 INFORMS Fellow Award, Dr. Powell has authored over 100 refereed publications on stochastic optimization, approximate dynamic programming, and dynamic resource management.
Energy Technology Data Exchange (ETDEWEB)
Iblyaminova, A. D., E-mail: a.iblyaminova@mail.ioffe.ru; Avdeeva, G. F.; Aruev, P. N.; Bakharev, N. N.; Gusev, V. K.; Zabrodsky, V. V.; Kurskiev, G. S.; Minaev, V. B.; Miroshnikov, I. V.; Patrov, M. I.; Petrov, Yu. V.; Sakharov, N. V.; Tolstyakov, S. Yu.; Shchegolev, P. B. [Russian Academy of Sciences, Ioffe Institute (Russian Federation)
2016-10-15
Radiation losses from the plasma of the Globus-M tokamak are studied by means of SPD silicon photodiodes developed at the Ioffe Institute, Russian Academy of Sciences. The results from measurements of radiation losses in regimes with ohmic and neutral beam injection heating of plasmas with different isotope compositions are presented. The dependence of the radiation loss power on the plasma current and plasma–wall distance is investigated. The radiation power in different spectral ranges is analyzed by means of an SPD spectrometric module. Results of measurements of radiation losses before and after tokamak vessel boronization are presented. The time evolution of the sensitivity of the SPD photodiode during its two-year exploitation in Globus-M is analyzed.
Directory of Open Access Journals (Sweden)
Leticia Labrador
2013-05-01
Full Text Available Pairing of homologous chromosomes during early meiosis is essential to prevent the formation of aneuploid gametes. Chromosome pairing includes a step of homology search followed by the stabilization of homolog interactions by the synaptonemal complex (SC. These events coincide with dramatic changes in nuclear organization and rapid chromosome movements that depend on cytoskeletal motors and are mediated by SUN-domain proteins on the nuclear envelope, but how chromosome mobility contributes to the pairing process remains poorly understood. We show that defects in the mitochondria-localizing protein SPD-3 cause a defect in homolog pairing without impairing nuclear reorganization or SC assembly, which results in promiscuous installation of the SC between non-homologous chromosomes. Preventing SC assembly in spd-3 mutants does not improve homolog pairing, demonstrating that SPD-3 is required for homology search at the start of meiosis. Pairing center regions localize to SUN-1 aggregates at meiosis onset in spd-3 mutants; and pairing-promoting proteins, including cytoskeletal motors and polo-like kinase 2, are normally recruited to the nuclear envelope. However, quantitative analysis of SUN-1 aggregate movement in spd-3 mutants demonstrates a clear reduction in mobility, although this defect is not as severe as that seen in sun-1(jf18 mutants, which also show a stronger pairing defect, suggesting a correlation between chromosome-end mobility and the efficiency of pairing. SUN-1 aggregate movement is also impaired following inhibition of mitochondrial respiration or dynein knockdown, suggesting that mitochondrial function is required for motor-driven SUN-1 movement. The reduced chromosome-end mobility of spd-3 mutants impairs coupling of SC assembly to homology recognition and causes a delay in meiotic progression mediated by HORMA-domain protein HTP-1. Our work reveals how chromosome mobility impacts the different early meiotic events that promote
The Functional Programming Language R and the Paradigm of Dynamic Scientific Programming
Trancón y Widemann, B.; Bolz, C.F.; Grelck, C.
2013-01-01
R is an environment and functional programming language for statistical data analysis and visualization. Largely unknown to the functional programming community, it is popular and influential in many empirical sciences. Due to its integrated combination of dynamic and reflective scripting on one
Dynamic Programming Approach for Exact Decision Rule Optimization
Amin, Talha
2013-01-01
This chapter is devoted to the study of an extension of dynamic programming approach that allows sequential optimization of exact decision rules relative to the length and coverage. It contains also results of experiments with decision tables from UCI Machine Learning Repository. © Springer-Verlag Berlin Heidelberg 2013.
optimum workforce-size model using dynamic programming approach
African Journals Online (AJOL)
DJFLEX
This paper presents an optimum workforce-size model which determines the minimum number of excess workers (overstaffing) as well as the minimum total recruitment cost during a specified planning horizon. The model is an extension of other existing dynamic programming models for manpower planning in the sense ...
Optimum workforce-size model using dynamic programming approach
African Journals Online (AJOL)
Abstract. This paper presents an optimum workforce-size model which determines the minimum number of excess workers (overstaffing) as well as the minimum total recruitment cost during a specified planning horizon. The model is an extension of other existing dynamic programming models for manpower planning in the ...
A stochastic dynamic programming model for stream water quality ...
Indian Academy of Sciences (India)
This paper deals with development of a seasonal fraction-removal policy model for waste load allocation in streams addressing uncertainties due to randomness and fuzziness. A stochastic dynamic programming (SDP) model is developed to arrive at the steady-state seasonal fraction-removal policy. A fuzzy decision model ...
Fast and Cache-Oblivious Dynamic Programming with Local Dependencies
DEFF Research Database (Denmark)
Bille, Philip; Stöckel, Morten
2012-01-01
-oblivious algorithm for this type of local dynamic programming suitable for comparing large-scale strings. Our algorithm outperforms the previous state-of-the-art solutions. Surprisingly, our new simple algorithm is competitive with a complicated, optimized, and tuned implementation of the best cache-aware algorithm...
Dynamic Frames Based Verification Method for Concurrent Java Programs
Mostowski, Wojciech
2016-01-01
In this paper we discuss a verification method for concurrent Java programs based on the concept of dynamic frames. We build on our earlier work that proposes a new, symbolic permission system for concurrent reasoning and we provide the following new contributions. First, we describe our approach
Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration
Directory of Open Access Journals (Sweden)
Alberto Policriti
2009-10-01
Full Text Available We begin by reviewing a technique to approximate the dynamics of stochastic programs --written in a stochastic process algebra-- by a hybrid system, suitable to capture a mixed discrete/continuous evolution. In a nutshell, the discrete dynamics is kept stochastic while the continuous evolution is given in terms of ODEs, and the overall technique, therefore, naturally associates a Piecewise Deterministic Markov Process with a stochastic program. The speciﬁc contribution in this work consists in an increase of the ﬂexibility of the translation scheme, obtained by allowing a dynamic reconﬁguration of the degree of discreteness/continuity of the semantics. We also discuss the relationships of this approach with other hybrid simulation strategies for biochemical systems.
Intensive Research Program on Advances in Nonsmooth Dynamics 2016
Jeffrey, Mike; Lázaro, J; Olm, Josep
2017-01-01
This volume contains extended abstracts outlining selected talks and other selected presentations given by participants throughout the "Intensive Research Program on Advances in Nonsmooth Dynamics 2016", held at the Centre de Recerca Matemàtica (CRM) in Barcelona from February 1st to April 29th, 2016. They include brief research articles reporting new results, descriptions of preliminary work or open problems, and outlines of prominent discussion sessions. The articles are all the result of direct collaborations initiated during the research program. The topic is the theory and applications of Nonsmooth Dynamics. This includes systems involving elements of: impacting, switching, on/off control, hybrid discrete-continuous dynamics, jumps in physical properties, and many others. Applications include: electronics, climate modeling, life sciences, mechanics, ecology, and more. Numerous new results are reported concerning the dimensionality and robustness of nonsmooth models, shadowing variables, numbers of limit...
The application of the dynamic programming method in investment optimization
Directory of Open Access Journals (Sweden)
Petković Nina
2016-01-01
Full Text Available This paper deals with the problem of investment in Measuring Transformers Factory in Zajecar and the application of the dynamic programming method as one of the methods used in business process optimization. Dynamic programming is a special case of nonlinear programming that is widely applicable to nonlinear systems in economics. Measuring Transformers Factory in Zajecar was founded in 1969. It manufactures electrical equipment, primarily low and medium voltage current measuring transformers, voltage transformers, bushings, etc. The company offers a wide range of products and for this paper's needs the company's management selected three products for each of which optimal investment costing was made. The purpose was to see which product would be the most profitable and thus proceed with the manufacturing and selling of that particular product or products.
Development of geometry of forming tools for extrusion of strip sheet by SPD process
Rusz, S.; Salajka, M.; Džugan, J.; Hilšer, O.; Bořuta, J.; Pastrňák, M.; Švec, J.
2017-02-01
On VSB -Technical University of Ostrava developed a method that uses the principle of severe plastic deformation to refine the structure and enhance mechanical properties of sheet metal strips. The greatest importance in practice represents an increase in yield strength and ultimate strength of sheet metal strips. The DRECE method (Dual Rolls Equal Channel Extrusion) is a newly developed method. Severe plastic deformation results in a high degree of the material deformation. The method can be used to produce metallic materials with a very fine grain structure. The paper analyses the effects of the values of angles of the newly developed forming tools on the achievement of mechanical properties in selected carbon steels by SPD process. The one type of steels (Ck55) was verified experimentally. Experiments were performed on the sheet metal strip with dimensions 58 (width) × 2 (thickness) × 1000 (length) mm with different inclination angle α.
Valiev, R. Z.; Langdon, T. G.
2017-05-01
The 7th International Conference on Nanomaterials by Severe Plastic Deformation (NanoSPD7) is hosted by the University of Sydney (Australia) following a series of earlier conferences: in Moscow (1999), Vienna (2002), Fukuoka (2005), Goslar (2008), Nanjing (2011) and Metz (2014). This introductory paper reports on several major developments in NanoSPD activities as well as on recent NanoSPD citation data which illustrate the growth and expansion of this important research area for the time period following the conference in Metz. Close attention is given to topics of nanostructuring of metals by SPD processing for advanced properties and on new trends in developing SPD techniques for practical applications. A special concern of the committee is the appropriate terminology that is used in this new field of science and engineering as well as the innovation potential of recent applied studies and developments.
Effect of SPD surface layer on plasma nitriding of Ti–6Al–4V alloy
Energy Technology Data Exchange (ETDEWEB)
Farokhzadeh, K.; Qian, J.; Edrisy, A., E-mail: edrisy@uwindsor.ca
2014-01-01
A severe plastic deformation (SPD) surface layer was introduced by shot peening to enhance the nitriding kinetics in low-temperature (600 °C) plasma nitriding of Ti–6Al–4V alloy. The effect of this pretreatment on the nitrided microstructures and phase compositions was investigated by analytical microscopy techniques e.g. scanning and transmission electron microscopy (SEM, TEM) and X-ray diffraction (XRD) analysis. Microstructural investigations revealed the formation of a compound layer consisting of a 0.6 µm thick nanocrystalline TiN layer followed by a 0.5 µm thick layer of Ti{sub 2}N with a larger grain size (0.1–0.5 µm). The development of TiN nanograins was attributed to accelerated nitriding kinetics due to the increased preferential nucleation sites in the SPD layer. Furthermore, the thickness of nitrogen diffusion zone (DZ) increased by 50% in the pretreated plasma nitrided alloy when compared with that of the untreated one. This is likely promoted by an increase in density of subsurface microstructural defects, such as twins and grain boundaries. The sliding behaviour and interfacial adhesion of the nitrided surfaces were evaluated by micro-scratch tests within a load range of 1–20 N. Compared with untreated-plasma-nitrided alloy, the pretreated nitrided surfaces exhibited a higher load bearing capacity and better interfacial bonding. They exhibited no chipping or spallation, even after multiple sliding passes at the highest applied load of 20 N in contrary to the untreated plasma nitrided surfaces.
Indentation Size Effect (ISE) in Copper Subjected to Severe Plastic Deformation (SPD)
Gale, Joshua D.; Achuthan, Ajit; Morrison, David J.
2014-05-01
The characteristic length scale of deformation in copper specimens subjected to severe plastic deformation (SPD) through surface mechanical attrition treatment (SMAT) was studied with indentation experiments. Annealed copper disks were shot peened with 6-mm diameter tungsten carbide spheres with an average velocity of 2.3 m/s for 15 minutes in a vibrating chamber. The SMAT-treated specimens were cross-sectioned, and the exposed face was studied under nanoindentation in order to determine the effect of dislocation density on surface hardness and indentation size effect (ISE). Since the specimen preparation of the exposed face involved mechanical polishing, which in turn introduced additional SPD on the indenting face, the effect of mechanical polishing on hardness measurement was investigated first. To this end, the mechanically polished specimens were subjected to various durations of electrochemical polishing. Hardness measurements on these specimens showed that the effect of mechanical polishing was substantial for both microindentation and nanoindentation, the impact being significantly larger for nanoindentation. Consequently, the measured depth of influence of the SMAT process, determined on specimens subjected to longer durations of electrochemical polishing, shows larger values compared to those previously reported in the literature. The ISE shows a bilinear relationship between the square of hardness and the reciprocal of indentation depth. The slope of this behavior, corresponding to smaller indentation loads, which is a measure of the ISE associated with a strain gradient, shows a power-law relationship with an increase in the distance away from the SMAT surface, instead of the constant value expected with the Nix-Gao type model.
M.L.B. Hillaire (Marine); M. van Eijk (Martin); S.E. Trierum (Stella); D.A.J. van Riel (Debby); X. Saelens (Xavier); R.A. Romijn (Roland); W. Hemrika (Wieger); R.A.M. Fouchier (Ron); T. Kuiken (Thijs); A.D.M.E. Osterhaus (Albert); H.P. Haagsman (Henk); G.F. Rimmelzwaan (Guus)
2011-01-01
textabstractThe emergence of influenza viruses resistant to existing classes of antiviral drugs raises concern and there is a need for novel antiviral agents that could be used therapeutically or prophylacticaly. Surfactant protein D (SP-D) belongs to the family of C-type lectins which are important
Hillaire, M.L.B.|info:eu-repo/dai/nl/341413933; van Eijk, M.|info:eu-repo/dai/nl/255160216; Trierum, S.E.; van Riel, D.; Saelens, X.; Romijn, R.A.P.|info:eu-repo/dai/nl/26228359X; Hemrika, W.|info:eu-repo/dai/nl/121631362; Fouchier, R.A.M.; Kuiken, T.; Osterhaus, A.D.M.E.|info:eu-repo/dai/nl/074960172; Haagsman, H.P.|info:eu-repo/dai/nl/069273278; Rimmelzwaan, G.F.
2011-01-01
The emergence of influenza viruses resistant to existing classes of antiviral drugs raises concern and there is a need for novel antiviral agents that could be used therapeutically or prophylacticaly. Surfactant protein D (SP-D) belongs to the family of Ctype lectins which are important effector
2012-10-29
... Employment and Training Administration Verizon Business Networks Services, Inc., Senior Analyst, Service..., 2012, applicable to workers and former workers of Verizon Business Network Services, Inc., Senior... hereby issued as follows: ] All workers of Verizon Business Network Services, Inc., Senior Analyst...
Adaptive Dynamic Programming for Control Algorithms and Stability
Zhang, Huaguang; Luo, Yanhong; Wang, Ding
2013-01-01
There are many methods of stable controller design for nonlinear systems. In seeking to go beyond the minimum requirement of stability, Adaptive Dynamic Programming for Control approaches the challenging topic of optimal control for nonlinear systems using the tools of adaptive dynamic programming (ADP). The range of systems treated is extensive; affine, switched, singularly perturbed and time-delay nonlinear systems are discussed as are the uses of neural networks and techniques of value and policy iteration. The text features three main aspects of ADP in which the methods proposed for stabilization and for tracking and games benefit from the incorporation of optimal control methods: • infinite-horizon control for which the difficulty of solving partial differential Hamilton–Jacobi–Bellman equations directly is overcome, and proof provided that the iterative value function updating sequence converges to the infimum of all the value functions obtained by admissible control law sequences; • finite-...
Adaptive dynamic programming with applications in optimal control
Liu, Derong; Wang, Ding; Yang, Xiong; Li, Hongliang
2017-01-01
This book covers the most recent developments in adaptive dynamic programming (ADP). The text begins with a thorough background review of ADP making sure that readers are sufficiently familiar with the fundamentals. In the core of the book, the authors address first discrete- and then continuous-time systems. Coverage of discrete-time systems starts with a more general form of value iteration to demonstrate its convergence, optimality, and stability with complete and thorough theoretical analysis. A more realistic form of value iteration is studied where value function approximations are assumed to have finite errors. Adaptive Dynamic Programming also details another avenue of the ADP approach: policy iteration. Both basic and generalized forms of policy-iteration-based ADP are studied with complete and thorough theoretical analysis in terms of convergence, optimality, stability, and error bounds. Among continuous-time systems, the control of affine and nonaffine nonlinear systems is studied using the ADP app...
Fast unambiguous stereo matching using reliability-based dynamic programming.
Gong, Minglun; Yang, Yee-Hong
2005-06-01
An efficient unambiguous stereo matching technique is presented in this paper. Our main contribution is to introduce a new reliability measure to dynamic programming approaches in general. For stereo vision application, the reliability of a proposed match on a scanline is defined as the cost difference between the globally best disparity assignment that includes the match and the globally best assignment that does not include the match. A reliability-based dynamic programming algorithm is derived accordingly, which can selectively assign disparities to pixels when the corresponding reliabilities exceed a given threshold. The experimental results show that the new approach can produce dense (> 70 percent of the unoccluded pixels) and reliable (error rate < 0.5 percent) matches efficiently (< 0.2 sec on a 2GHz P4) for the four Middlebury stereo data sets.
GLOBEC (Global Ocean Ecosystems Dynamics: Northwest Atlantic program
1991-01-01
The specific objective of the meeting was to plan an experiment in the Northwestern Atlantic to study the marine ecosystem and its role, together with that of climate and physical dynamics, in determining fisheries recruitment. The underlying focus of the GLOBEC initiative is to understand the marine ecosystem as it related to marine living resources and to understand how fluctuation in these resources are driven by climate change and exploitation. In this sense the goal is a solid scientific program to provide basic information concerning major fisheries stocks and the environment that sustains them. The plan is to attempt to reach this understanding through a multidisciplinary program that brings to bear new techniques as disparate as numerical fluid dynamic models of ocean circulation, molecular biology and modern acoustic imaging. The effort will also make use of the massive historical data sets on fisheries and the state of the climate in a coordinated manner.
Systems and methods for interpolation-based dynamic programming
Rockwood, Alyn
2013-01-03
Embodiments of systems and methods for interpolation-based dynamic programming. In one embodiment, the method includes receiving an object function and a set of constraints associated with the objective function. The method may also include identifying a solution on the objective function corresponding to intersections of the constraints. Additionally, the method may include generating an interpolated surface that is in constant contact with the solution. The method may also include generating a vector field in response to the interpolated surface.
Affine Monotonic and Risk-Sensitive Models in Dynamic Programming
Bertsekas, Dimitri
2016-01-01
In this paper we consider a broad class of infinite horizon discrete-time optimal control models that involve a nonnegative cost function and an affine mapping in their dynamic programming equation. They include as special cases classical models such as stochastic undiscounted nonnegative cost problems, stochastic multiplicative cost problems, and risk-sensitive problems with exponential cost. We focus on the case where the state space is finite and the control space has some compactness prop...
Application of a Dynamic Programming Algorithm for Weapon Target Assignment
2016-02-01
responsible for its safe custody. UNCLASSIFIED UNCLASSIFIED Application of a Dynamic Programming Algorithm for Weapon Target Assignment...the technique used. As a precaution , such techniques are generally referred to as suboptimal. As mentioned above, an exact solution can only be...Skovde, Sweden, 2010. [5] K. C. Jha, “Very Large-Scale Neighborhood Search Heuristics for Combinatorial Optimization Problems,” University of Florida
Dynamic Programming Approach for Construction of Association Rule Systems
Alsolami, Fawaz
2016-11-18
In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. The association rule set is optimized in two stages, first for minimum cardinality and then for minimum length of rules. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work as well as obtained results for length.
Page 1 On Some Applications of Dynamic Programming to ...
Indian Academy of Sciences (India)
However for values of M which are not multiples of 10, the method of dynamic programming has to be used. (ii) As M increases, f. (M) also increases. This is expected since as. M increases the maximum entropy must increase. (iii) We find that if pi > p; then m; 2 mi. That this is true always can be seen as follows: (p; logs mi + ...
DYNAMIC PROGRAMMING – EFFICIENT TOOL FOR POWER SYSTEM EXPANSION PLANNING
Directory of Open Access Journals (Sweden)
SIMO A.
2015-03-01
Full Text Available The paper isfocusing on dynamic programming use for power system expansion planning (EP – transmission network (TNEP and distribution network (DNEP. The EP problem has been approached from the retrospective and prospective point of view. To achieve this goal, the authors are developing two software-tools in Matlab environment. Two techniques have been tackled: particle swarm optimization (PSO and genetic algorithms (GA. The case study refers to Test 25 buses test power system developed within the Power Systems Department.
SEWER NETWORK DISCHARGE OPTIMIZATION USING THE DYNAMIC PROGRAMMING
Directory of Open Access Journals (Sweden)
Viorel MINZU
2015-12-01
Full Text Available It is necessary to adopt an optimal control that allows an efficient usage of the existing sewer networks, in order to avoid the building of new retention facilities. The main objective of the control action is to minimize the overflow volume of a sewer network. This paper proposes a method to apply a solution obtained by discrete dynamic programming through a realistic closed loop system.
Nation-Building Modeling and Resource Allocation Via Dynamic Programming
2014-09-01
provides the ability to inform strategic resource alloca- tion decisions during ongoing nation– building operations. Historical examples may be modeled and...against moving to a peaceful state. 5.3 Model Including Violence Since enemy action information is not readily obtainable in nation– building oper...NATION– BUILDING MODELING AND RESOURCE ALLOCATION VIA DYNAMIC PROGRAMMING DISSERTATION Cade M. Saie, Major, USA AFIT–DS–ENS–14–S–18 DEPARTMENT OF THE
A report of advancements in structural dynamic technology resulting from Saturn 5 programs
1970-01-01
Two volume report on practical aspects of structural dynamic analysis in Saturn 5 program is described. Volume 1 is oriented toward program managers of future structural dynamic programs. Volume 2, oriented toward technical leaders of programs, discusses methods and procedures used in Saturn 5 program.
Application of dynamic programming to control khuzestan water resources system
Jamshidi, M.; Heidari, M.
1977-01-01
An approximate optimization technique based on discrete dynamic programming called discrete differential dynamic programming (DDDP), is employed to obtain the near optimal operation policies of a water resources system in the Khuzestan Province of Iran. The technique makes use of an initial nominal state trajectory for each state variable, and forms corridors around the trajectories. These corridors represent a set of subdomains of the entire feasible domain. Starting with such a set of nominal state trajectories, improvements in objective function are sought within the corridors formed around them. This leads to a set of new nominal trajectories upon which more improvements may be sought. Since optimization is confined to a set of subdomains, considerable savings in memory and computer time are achieved over that of conventional dynamic programming. The Kuzestan water resources system considered in this study is located in southwest Iran, and consists of two rivers, three reservoirs, three hydropower plants, and three irrigable areas. Data and cost benefit functions for the analysis were obtained either from the historical records or from similar studies. ?? 1977.
Programmed subcellular release to study the dynamics of cell detachment
Wildt, Bridget
Cell detachment is central to a broad range of physio-pathological changes however there are no quantitative methods to study this process. Here we report programmed subcellular release, a method for spatially and temporally controlled cellular detachment and present the first quantitative results of the detachment dynamics of 3T3 fibroblasts at the subcellular level. Programmed subcellular release is an in vitro technique designed to trigger the detachment of distinct parts of a single cell from a patterned substrate with both spatial and temporal control. Subcellular release is achieved by plating cells on an array of patterned gold electrodes created by standard microfabrication techniques. The electrodes are biochemically functionalized with an adhesion-promoting RGD peptide sequence that is attached to the gold electrode via a thiol linkage. Each electrode is electrically isolated so that a subcellular section of a single cell spanning multiple electrodes can be released independently. Upon application of a voltage pulse to a single electrode, RGD-thiol molecules on an individual electrode undergo rapid electrochemical desorption that leads to subsequent cell contraction. The dynamics of cell contraction are found to have characteristic induction and contraction times. This thesis presents the first molecular inhibition studies conducted using programmed subcellular release verifying that this technique can be used to study complex signaling pathways critical to cell motility. Molecular level dynamics of focal adhesion proteins and actin stress fibers provide some insight into the complexities associated with triggered cell detachment. In addition to subcellular release, the programmed release of alkanethiols provides a tool for to study the spatially and temporally controlled release of small molecules or particles from individually addressable gold electrodes. Here we report on experiments which determine the dynamics of programmed release using fluorophore
Dynamic programming algorithms as quantum circuits: symmetric function realization
Maslov, Dmitri A.
2004-08-01
The work starts with a general idea of how to realize a dynamic programming algorithm as a quantum circuit. This realization is not tied to a specific design model, technology or a class of dynamic algorithms, it shows an approach for such synthesis. As an illustration of the efficiency of this approach, the class of all multiple-output symmetric functions is realized in a dynamic programming algorithm manner as a reversible circuit of Toffoli type elements (NOT, CNOT, and Toffoli gates). The garbage and quantum cost (found based on Barenco et al. paper) of the presented implementation are calculated and compared to the costs of previously described reversible synthesis methods. The summary of results of this comparison is as follows. The quantum cost of the proposed method is less than the quantum cost of any other reported systematic approach. The garbage is usually lower, except for comparison with the synthesis methods, whose primary goal is synthesis with theoretically minimal garbage. The presented algorithm application to the symmetric function synthesis results in circuits suitable for quantum technology realizations.
Supplier selection and order lot sizing using dynamic programming
Directory of Open Access Journals (Sweden)
M. M. Moqri
2011-04-01
Full Text Available In this paper, we consider a multi-period integrated supplier selection and order lot sizing problem where a single buyer plans to purchase a single product in multiple periods from several qualified suppliers who are able to provide the required product with the needed quality in a timely manner. Product price and order cost differs among different suppliers. Buyer’s demand for the product is deterministic and varies for different time periods. The problem is to determine how much product from which supplier must be ordered in each period such that buyer’s demand is satisfied without violating some side constraints. We have developed a mathematical programming model to deal with this problem, and proposed a forward dynamic programming approach to obtain optimal solutions in reasonable amount of time even for large scale problems. Finally, a numerical example is conducted in which solutions obtained from the proposed dynamic programming algorithm is compared with solutions from the branch-and-bound algorithm. Through the numerical example we have shown the efficiency of our algorithm.
2015-06-01
This report assesses the impacts of a prototype of Dynamic Speed Harmonization (SPD-HARM) with Queue : Warning (Q-WARN), which are two component applications of the Intelligent Network Flow Optimization : (INFLO) bundle. The assessment is based on an...
Heuristic reusable dynamic programming: efficient updates of local sequence alignment.
Hong, Changjin; Tewfik, Ahmed H
2009-01-01
Recomputation of the previously evaluated similarity results between biological sequences becomes inevitable when researchers realize errors in their sequenced data or when the researchers have to compare nearly similar sequences, e.g., in a family of proteins. We present an efficient scheme for updating local sequence alignments with an affine gap model. In principle, using the previous matching result between two amino acid sequences, we perform a forward-backward alignment to generate heuristic searching bands which are bounded by a set of suboptimal paths. Given a correctly updated sequence, we initially predict a new score of the alignment path for each contour to select the best candidates among them. Then, we run the Smith-Waterman algorithm in this confined space. Furthermore, our heuristic alignment for an updated sequence shows that it can be further accelerated by using reusable dynamic programming (rDP), our prior work. In this study, we successfully validate "relative node tolerance bound" (RNTB) in the pruned searching space. Furthermore, we improve the computational performance by quantifying the successful RNTB tolerance probability and switch to rDP on perturbation-resilient columns only. In our searching space derived by a threshold value of 90 percent of the optimal alignment score, we find that 98.3 percent of contours contain correctly updated paths. We also find that our method consumes only 25.36 percent of the runtime cost of sparse dynamic programming (sDP) method, and to only 2.55 percent of that of a normal dynamic programming with the Smith-Waterman algorithm.
Optimization of Algorithms Using Extensions of Dynamic Programming
AbouEisha, Hassan M.
2017-04-09
We study and answer questions related to the complexity of various important problems such as: multi-frontal solvers of hp-adaptive finite element method, sorting and majority. We advocate the use of dynamic programming as a viable tool to study optimal algorithms for these problems. The main approach used to attack these problems is modeling classes of algorithms that may solve this problem using a discrete model of computation then defining cost functions on this discrete structure that reflect different complexity measures of the represented algorithms. As a last step, dynamic programming algorithms are designed and used to optimize those models (algorithms) and to obtain exact results on the complexity of the studied problems. The first part of the thesis presents a novel model of computation (element partition tree) that represents a class of algorithms for multi-frontal solvers along with cost functions reflecting various complexity measures such as: time and space. It then introduces dynamic programming algorithms for multi-stage and bi-criteria optimization of element partition trees. In addition, it presents results based on optimal element partition trees for famous benchmark meshes such as: meshes with point and edge singularities. New improved heuristics for those benchmark meshes were ob- tained based on insights of the optimal results found by our algorithms. The second part of the thesis starts by introducing a general problem where different problems can be reduced to and show how to use a decision table to model such problem. We describe how decision trees and decision tests for this table correspond to adaptive and non-adaptive algorithms for the original problem. We present exact bounds on the average time complexity of adaptive algorithms for the eight elements sorting problem. Then bounds on adaptive and non-adaptive algorithms for a variant of the majority problem are introduced. Adaptive algorithms are modeled as decision trees whose depth
Dynamic Programming and Graph Algorithms in Computer Vision*
Felzenszwalb, Pedro F.; Zabih, Ramin
2013-01-01
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting, since by carefully exploiting problem structure they often provide non-trivial guarantees concerning solution quality. In this paper we briefly review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo; the mid-level problem of interactive object segmentation; and the high-level problem of model-based recognition. PMID:20660950
A multi supplier lot sizing strategy using dynamic programming
Directory of Open Access Journals (Sweden)
Mohammad Mahdavi Mazdeh
2013-01-01
Full Text Available In this paper, the problem of lot sizing for the case of a single item is considered along with supplier selection in a two-stage supply chain. The suppliers are able to offer quantity discounts, which can be either all-unit or incremental discount policies. A mathematical modeling formulation for the proposed problem is presented and a dynamic programming methodology is provided to solve it. Computational experiments are performed in order to examine the accuracy and the performance of the proposed method in terms of running time. The preliminary results indicate that the proposed algorithm is capable of providing optimal solutions within low computational times, high accuracy solutions.
The Inverse Optimal Problem: A Dynamic Programming Approach.
Chang, Fwu-Ranq
1988-01-01
This paper solves the stochastic inverse optimal problem. Dynamic programming is used to transform the origina l problem into a differential equation. A solution exists for any pro duction function with a finite slope at the origin provided the savin gs function, starting from the origin, is steep initially and flat ev entually. Three consumption functions-linear, Keynes-ian, and Cantabr igian-are also studied with a Cobb-Douglas production technology. A w ell-known result in discrete time mo...
1975-12-01
Frequency domain computer programs developed or acquired by TSC for the analysis of rail vehicle dynamics are described in two volumes. Volume 2 contains program listings including subroutines for the four TSC frequency domain programs described in V...
Dynamics of the public concern and risk communication program implementation.
Zaryabova, Victoria; Israel, Michel
2015-09-01
The public concern about electromagnetic field (EMF) exposure varies due to different reasons. A part of them are connected with the better and higher quality of information that people receive from science, media, Internet, social networks, industry, but others are based on good communication programs performed by the responsible institutions, administration and persons. Especially, in Bulgaria, public concern follows interesting changes, some of them in correlation with the European processes of concern, but others following the economic and political processes in the country. Here, we analyze the dynamics of the public concern over the last 10 years. Our explanation of the decrease of the people's complaints against EMF exposure from base stations for mobile communication is as a result of our risk communication program that is in implementation for >10 years.
Energy Technology Data Exchange (ETDEWEB)
Crouch,E.; McDonald, B.; Smith, K.; Cararella, T.; Seaton, B.; Head, J.
2006-01-01
Surfactant Protein D (SP-D) is an innate immune effector that contributes to antimicrobial host defense and immune regulation. Interactions of SP-D with microorganisms and organic antigens involve binding of glycoconjugates to the C-type lectin carbohydrate recognition domain (CRD). A trimeric fusion protein encoding the human neck+CRD (hNCRD) bound to the aromatic glycoside, p-nitrophenyl-alpha-D-maltoside, with nearly a log-fold higher affinity than maltose, the prototypical competitor. Maltotriose, which has the same linkage pattern as the maltoside, bound with intermediate affinity. Site-directed substitution of leucine for phenylalanine 335 (Phe335) decreased affinities for the maltoside and maltotriose without significantly altering the affinity for maltose or glucose, and substitution of tyrosine or tryptophan for leucine restored preferential binding to maltotriose and the maltoside. A mutant with alanine at this position failed to bind to mannan or maltose-substituted solid supports. Crystallographic analysis of the hNCRD complexed with maltotriose or p-nitrophenyl-maltoside showed stacking of the terminal glucose or nitrophenyl ring with the aromatic ring of Phe335. Our studies indicate that Phe335, which is evolutionarily conserved in all known SP-Ds, plays important - if not critical roles - in SP-D function.
Approximate Dynamic Programming in Tracking Control of a Robotic Manipulator
Directory of Open Access Journals (Sweden)
Marcin Szuster
2016-02-01
Full Text Available This article focuses on the implementation of an approximate dynamic programming algorithm in the discrete tracking control system of the three-degrees of freedom Scorbot-ER 4pc robotic manipulator. The controlled system is included in an articulated robots group which uses rotary joints to access their work space. The main part of the control system is a dual heuristic dynamic programming algorithm that consists of two structures designed in the form of neural networks: an actor and a critic. The actor generates the suboptimal control law while the critic approximates the difference of the value function from Bellman's equation with respect to the state. The residual elements of the control system are the PD controller, the supervisory term and an additional control signal. The structure of the supervisory term derives from the stability analysis performed using the Lyapunov stability theorem. The control system works online, the neural networks' weights-adaptation procedure is performed in every iteration step, and the neural networks' preliminary learning process is not required. The performance of the control system was verified by a series of computer simulations and experiments performed using the Scorbot-ER 4pc robotic manipulator.
Evaluation of Electric Power Procurement Strategies by Stochastic Dynamic Programming
Saisho, Yuichi; Hayashi, Taketo; Fujii, Yasumasa; Yamaji, Kenji
In deregulated electricity markets, the role of a distribution company is to purchase electricity from the wholesale electricity market at randomly fluctuating prices and to provide it to its customers at a given fixed price. Therefore the company has to take risk stemming from the uncertainties of electricity prices and/or demand fluctuation instead of the customers. The way to avoid the risk is to make a bilateral contact with generating companies or install its own power generation facility. This entails the necessity to develop a certain method to make an optimal strategy for electric power procurement. In such a circumstance, this research has the purpose for proposing a mathematical method based on stochastic dynamic programming and additionally considering the characteristics of the start-up cost of electric power generation facility to evaluate strategies of combination of the bilateral contract and power auto-generation with its own facility for procuring electric power in deregulated electricity market. In the beginning we proposed two approaches to solve the stochastic dynamic programming, and they are a Monte Carlo simulation method and a finite difference method to derive the solution of a partial differential equation of the total procurement cost of electric power. Finally we discussed the influences of the price uncertainty on optimal strategies of power procurement.
Fernandes, Joseph R D; Jain, Sammit; Banerjee, Arnab
2017-05-15
The aim of the present study was to investigate variation in the expression pattern of ornithine decarboxylase (ODC1), spermine (SPM), spermidine (SPD) and antizyme inhibitor (AZIN1) in hypothalamus, ovary and uterus during the estrous cycle of rats. Further, to understand any correlation between polyamines and GnRH I expression in hypothalamus; effect of putrescine treatment on GnRH I expression in hypothalamus and progesterone and estradiol levels in serum were investigated. The study also aims in quantifying all the immunohistochemistry images obtained based on pixel counting algorithm to yield the relative pixel count. This algorithm uses a red green blue (RGB) colour thresholding approach to quantify the intensity of the chromogen present. The result of the present study demonstrates almost similar expression pattern of polyamine and polyamine related factors, ODC1, SPD, SPM and AZIN1, with that of hypothalamic GnRH I, all of which mainly localized in the medial preoptic area (MPA) of the hypothalamus, during the proestrus, estrus and diestrus. This suggest that hypothalamic GnRH I expression is under regulation of polyamines. The study showed significant increase in hypothalamic GnRH I expression for both the doses of putrescine treatment to adult female rats. Further, it was shown that in ovary expression pattern of ODC1, SPM, SPD and AZIN1 were similar with that of steroidogenic factor, StAR during the estrous cycle, and putrescine supplementation increased significantly estradiol and progesterone levels in serum, all suggesting ovarian polyamines are involved in regulation of ovarian steroidogenesis. Localization of these factors in the theca and granulosa cells suggest involvement of polyamines in the process of folliculogenesis and luteinization; and ODC1, SPD, SPM and AZIN1 in oocyte further suggests polyamine role in maintenance of oocyte physiology. Finally, in uterus SPM and AZIN1 were localized throughout the estrous cycle, being comparatively more
Patriarca, M.; Kuronen, A.; Robles, M.; Kaski, K.
2007-01-01
The study of crystal defects and the complex processes underlying their formation and time evolution has motivated the development of the program ALINE for interactive molecular dynamics experiments. This program couples a molecular dynamics code to a Graphical User Interface and runs on a UNIX-X11 Window System platform with the MOTIF library, which is contained in many standard Linux releases. ALINE is written in C, thus giving the user the possibility to modify the source code, and, at the same time, provides an effective and user-friendly framework for numerical experiments, in which the main parameters can be interactively varied and the system visualized in various ways. We illustrate the main features of the program through some examples of detection and dynamical tracking of point-defects, linear defects, and planar defects, such as stacking faults in lattice-mismatched heterostructures. Program summaryTitle of program:ALINE Catalogue identifier:ADYJ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYJ_v1_0 Program obtainable from: CPC Program Library, Queen University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Computers:DEC ALPHA 300, Intel i386 compatible computers, G4 Apple Computers Installations:Laboratory of Computational Engineering, Helsinki University of Technology, Helsinki, Finland Operating systems under which the program has been tested:True64 UNIX, Linux-i386, Mac OS X 10.3 and 10.4 Programming language used:Standard C and MOTIF libraries Memory required to execute with typical data:6 Mbytes but may be larger depending on the system size No. of lines in distributed program, including test data, etc.:16 901 No. of bytes in distributed program, including test data, etc.:449 559 Distribution format:tar.gz Nature of physical problem:Some phenomena involving defects take place inside three-dimensional crystals at times which can be hardly predicted. For this reason they are
Directory of Open Access Journals (Sweden)
Jooyoung Park
2015-05-01
Full Text Available Recently, the optimization of power flows in portable hybrid power-supply systems (HPSSs has become an important issue with the advent of a variety of mobile systems and hybrid energy technologies. In this paper, a control strategy is considered for dynamically managing power flows in portable HPSSs employing batteries and supercapacitors. Our dynamic power management strategy utilizes the concept of approximate dynamic programming (ADP. ADP methods are important tools in the fields of stochastic control and machine learning, and the utilization of these tools for practical engineering problems is now an active and promising research field. We propose an ADP-based procedure based on optimization under constraints including the iterated Bellman inequalities, which can be solved by convex optimization carried out offline, to find the optimal power management rules for portable HPSSs. The effectiveness of the proposed procedure is tested through dynamic simulations for smartphone workload scenarios, and simulation results show that the proposed strategy can successfully cope with uncertain workload demands.
Optimization of decision rules based on dynamic programming approach
Zielosko, Beata
2014-01-14
This chapter is devoted to the study of an extension of dynamic programming approach which allows optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure that is the difference between number of rows in a given decision table and the number of rows labeled with the most common decision for this table divided by the number of rows in the decision table. We fix a threshold γ, such that 0 ≤ γ < 1, and study so-called γ-decision rules (approximate decision rules) that localize rows in subtables which uncertainty is at most γ. Presented algorithm constructs a directed acyclic graph Δ γ T which nodes are subtables of the decision table T given by pairs "attribute = value". The algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The chapter contains also results of experiments with decision tables from UCI Machine Learning Repository. © 2014 Springer International Publishing Switzerland.
Reversible circuit synthesis by genetic programming using dynamic gate libraries
Abubakar, Mustapha Y.; Jung, Low Tang; Zakaria, Nordin; Younes, Ahmed; Abdel-Aty, Abdel-Haleem
2017-06-01
We have defined a new method for automatic construction of reversible logic circuits by using the genetic programming approach. The choice of the gate library is 100% dynamic. The algorithm is capable of accepting all possible combinations of the following gate types: NOT TOFFOLI, NOT PERES, NOT CNOT TOFFOLI, NOT CNOT SWAP FREDKIN, NOT CNOT TOFFOLI SWAP FREDKIN, NOT CNOT PERES, NOT CNOT SWAP FREDKIN PERES, NOT CNOT TOFFOLI PERES and NOT CNOT TOFFOLI SWAP FREDKIN PERES. Our method produced near optimum circuits in some cases when a particular subset of gate types was used in the library. Meanwhile, in some cases, optimal circuits were produced due to the heuristic nature of the algorithm. We compared the outcomes of our method with several existing synthesis methods, and it was shown that our algorithm performed relatively well compared to the previous synthesis methods in terms of the output efficiency of the algorithm and execution time as well.
Survey of Dynamic Simulation Programs for Nuclear Fuel Reprocessing
Energy Technology Data Exchange (ETDEWEB)
Troy J. Tranter; Daryl R. Haefner
2008-06-01
The absence of any industrial scale nuclear fuel reprocessing in the U.S. has precluded the necessary driver for developing the advanced simulation capability now prevalent in so many other industries. Modeling programs to simulate the dynamic behavior of nuclear fuel separations and processing were originally developed to support the US government’s mission of weapons production and defense fuel recovery. Consequently there has been little effort is the US devoted towards improving this specific process simulation capability during the last two or three decades. More recent work has been focused on elucidating chemical thermodynamics and developing better models of predicting equilibrium in actinide solvent extraction systems. These equilibrium models have been used to augment flowsheet development and testing primarily at laboratory scales. The development of more robust and complete process models has not kept pace with the vast improvements in computational power and user interface and is significantly behind simulation capability in other chemical processing and separation fields.
PACE: A dynamic programming algorithm for hardware/software partitioning
DEFF Research Database (Denmark)
Knudsen, Peter Voigt; Madsen, Jan
1996-01-01
This paper presents the PACE partitioning algorithm which is used in the LYCOS co-synthesis system for partitioning control/dataflow graphs into hardware and software parts. The algorithm is a dynamic programming algorithm which solves both the problem of minimizing system execution time...... communication model and thus attempts to minimize communication overhead. The time-complexity of the algorithm is O(n2·𝒜) and the space-complexity is O(n·𝒜) where 𝒜 is the total area of the hardware chip and n the number of code fragments which may be placed in either hardware or software...... with a hardware area constraint and the problem of minimizing hardware area with a system execution time constraint. The target architecture consists of a single microprocessor and a single hardware chip (ASIC, FPGA, etc.) which are connected by a communication channel. The algorithm incorporates a realistic...
Dispersion analysis techniques within the space vehicle dynamics simulation program
Snow, L. S.; Kuhn, A. E.
1975-01-01
The Space Vehicle Dynamics Simulation (SVDS) program was evaluated as a dispersion analysis tool. The Linear Error Analysis (LEA) post processor was examined in detail and simulation techniques relative to conducting a dispersion analysis using the SVDS were considered. The LEA processor is a tool for correlating trajectory dispersion data developed by simulating 3 sigma uncertainties as single error source cases. The processor combines trajectory and performance deviations by a root-sum-square (RSS process) and develops a covariance matrix for the deviations. Results are used in dispersion analyses for the baseline reference and orbiter flight test missions. As a part of this study, LEA results were verified as follows: (A) Hand calculating the RSS data and the elements of the covariance matrix for comparison with the LEA processor computed data. (B) Comparing results with previous error analyses. The LEA comparisons and verification are made at main engine cutoff (MECO).
Condition-dependent mate choice: A stochastic dynamic programming approach.
Frame, Alicia M; Mills, Alex F
2014-09-01
We study how changing female condition during the mating season and condition-dependent search costs impact female mate choice, and what strategies a female could employ in choosing mates to maximize her own fitness. We address this problem via a stochastic dynamic programming model of mate choice. In the model, a female encounters males sequentially and must choose whether to mate or continue searching. As the female searches, her own condition changes stochastically, and she incurs condition-dependent search costs. The female attempts to maximize the quality of the offspring, which is a function of the female's condition at mating and the quality of the male with whom she mates. The mating strategy that maximizes the female's net expected reward is a quality threshold. We compare the optimal policy with other well-known mate choice strategies, and we use simulations to examine how well the optimal policy fares under imperfect information. Copyright © 2014 Elsevier Inc. All rights reserved.
Optimization of a pump-pipe system by dynamic programming
DEFF Research Database (Denmark)
Vidal, Rene Victor Valqui; Ferreira, Jose S.
1984-01-01
In this paper the problem of minimizing the total cost of a pump-pipe system in series is considered. The route of the pipeline and the number of pumping stations are known. The optimization will then consist in determining the control variables, diameter and thickness of the pipe and the size of...... of the pumps. A general mathematical model is formulated and Dynamic Programming is used to find an optimal solution.......In this paper the problem of minimizing the total cost of a pump-pipe system in series is considered. The route of the pipeline and the number of pumping stations are known. The optimization will then consist in determining the control variables, diameter and thickness of the pipe and the size...
Evaluating management regimes for European beech forests using dynamic programming
Directory of Open Access Journals (Sweden)
Juan Torres Rojo
2014-12-01
Full Text Available Aim of study: This contribution describes a systematic search method for identifying optimum thinning regimes for beech forests (Fagus sylvatica L. by using a combination of optimization heuristics and a simple whole stand growth prediction model. Area of study: Data to build the model come from standard and management forest inventories as well as yield tables from the Northern and Western part of Germany and from southern and central Denmark.Material and Methods: Growth projections are made from equations to project basal area and top height. The remaining stand variables are recovered from additional equations fitted from forest inventory data or acquired from other authors. Mortality is estimated through an algorithm based on the maximum density line. The optimization routine uses a two-state dynamic programming model. Thinning type is defined by the NG index, which describes the ratio of the proportion of removed trees and basal area with respect to the same proportion before thinning. Main results: Growth equations fitted from inventory data show high goodness of fit with R2 values larger than 0.85 and high significance levels for the parameter estimates. The mortality algorithm converges quickly providing mortality estimates within the expected range.Research Highlights: The combination of a simple growth and yield model within a Dynamic Programming framework in conjunction with NG values as indicators of thinning type yield good estimates of practical thinning schedules compared to thinning recommendations provided by diverse authors.Keywords: beech (Fagus sylvatica L.; NG ratio; thinning optimization; growth and yield simulation; mortality.
Design and Analysis of Decision Rules via Dynamic Programming
Amin, Talha M.
2017-04-24
The areas of machine learning, data mining, and knowledge representation have many different formats used to represent information. Decision rules, amongst these formats, are the most expressive and easily-understood by humans. In this thesis, we use dynamic programming to design decision rules and analyze them. The use of dynamic programming allows us to work with decision rules in ways that were previously only possible for brute force methods. Our algorithms allow us to describe the set of all rules for a given decision table. Further, we can perform multi-stage optimization by repeatedly reducing this set to only contain rules that are optimal with respect to selected criteria. One way that we apply this study is to generate small systems with short rules by simulating a greedy algorithm for the set cover problem. We also compare maximum path lengths (depth) of deterministic and non-deterministic decision trees (a non-deterministic decision tree is effectively a complete system of decision rules) with regards to Boolean functions. Another area of advancement is the presentation of algorithms for constructing Pareto optimal points for rules and rule systems. This allows us to study the existence of “totally optimal” decision rules (rules that are simultaneously optimal with regards to multiple criteria). We also utilize Pareto optimal points to compare and rate greedy heuristics with regards to two criteria at once. Another application of Pareto optimal points is the study of trade-offs between cost and uncertainty which allows us to find reasonable systems of decision rules that strike a balance between length and accuracy.
2015-08-17
Control based on Heuristic Dynamic Programming for Nonlinear Continuous-Time Systems In this paper, a novel predictive event-triggered control...method based on heuristic dynamic programming (HDP) algorithm is developed for nonlinear continuous-time systems. A model network is used to estimate...College Road, Suite II Kingston, RI 02881 -1967 ABSTRACT Predictive Event-Triggered Control based on Heuristic Dynamic Programming for Nonlinear
Dynamic Line Rating Oncor Electric Delivery Smart Grid Program
Energy Technology Data Exchange (ETDEWEB)
Johnson, Justin; Smith, Cale; Young, Mike; Donohoo, Ken; Owen, Ross; Clark, Eddit; Espejo, Raul; Aivaliotis, Sandy; Stelmak, Ron; Mohr, Ron; Barba, Cristian; Gonzalez, Guillermo; Malkin, Stuart; Dimitrova, Vessela; Ragsdale, Gary; Mitchem, Sean; Jeirath, Nakul; Loomis, Joe; Trevino, Gerardo; Syracuse, Steve; Hurst, Neil; Mereness, Matt; Johnson, Chad; Bivens, Carrie
2013-05-04
Electric transmission lines are the lifeline of the electric utility industry, delivering its product from source to consumer. This critical infrastructure is often constrained such that there is inadequate capacity on existing transmission lines to efficiently deliver the power to meet demand in certain areas or to transport energy from high-generation areas to high-consumption regions. When this happens, the cost of the energy rises; more costly sources of power are used to meet the demand or the system operates less reliably. These economic impacts are known as congestion, and they can amount to substantial dollars for any time frame of reference: hour, day or year. There are several solutions to the transmission constraint problem, including: construction of new generation, construction of new transmission facilities, rebuilding and reconductoring of existing transmission assets, and Dynamic Line Rating (DLR). All of these options except DLR are capital intensive, have long lead times and often experience strong public and regulatory opposition. The Smart Grid Demonstration Program (SGDP) project co-funded by the Department of Energy (DOE) and Oncor Electric Delivery Company developed and deployed the most extensive and advanced DLR installation to demonstrate that DLR technology is capable of resolving many transmission capacity constraint problems with a system that is reliable, safe and very cost competitive. The SGDP DLR deployment is the first application of DLR technology to feed transmission line real-time dynamic ratings directly into the system operation’s State Estimator and load dispatch program, which optimizes the matching of generation with load demand on a security, reliability and economic basis. The integrated Dynamic Line Rating (iDLR)1 collects transmission line parameters at remote locations on the lines, calculates the real-time line rating based on the equivalent conductor temperature, ambient temperature and influence of wind and solar
Directory of Open Access Journals (Sweden)
Max Reinhardt
2011-05-01
Full Text Available This article discusses methods and results of an explorative study of two generations of the Social Democratic Party of Germany (SPD: the two generations comprise, on the one hand, older and younger members of the postwar generation who witnessed the Second World War as young soldiers or as children, and on the other hand, the generation that was born in the 1950s and has mainly been responsible for shaping policy for some years. The aim of my dissertation was to analyze the ability of the social democratic leadership to represent the full range of party members and (base voters by comparing two generations, using a sample of political leaders and the habitus/field-analysis inspired by Pierre BOURDIEU. The basis of the analysis were partly biographical, partly theme-focused interviews, as well as a range of sources and already published literature regarding the biographies of these political leaders. The following article is based on my dissertation and is focused on a description of selected theoretical implications, on the description of the essential criteria for selecting the sample and on some of the methods used. These are an analysis of the life, life and field effects, the factions and the development of types of political leaders. I will present some results to exemplify the methods used. They show that the ability of the SPD to represent the full range of party members and (base voters and the power structure of the SPD have changed, thus threatening the party’s status as a "Volkspartei." URN: http://nbn-resolving.de/urn:nbn:de:0114-fqs1102197
1975-12-01
Frequency domain computer programs developed or acquired by TSC for the analysis of rail vehicle dynamics are described in two volumes. Volume I defines the general analytical capabilities required for computer programs applicable to single rail vehi...
Directory of Open Access Journals (Sweden)
Korry Apriandi
2015-01-01
Full Text Available The object of this research in PT. SPD Semarang by using the type and design was qualitative and descriptive research the were aims to know the execution of SMK3 application on OHSAS 18001: 2007 in PT. SPD Semarang. From the results show that implementation of SMK3 on OHSAS PT. SPD as much as 131 points (87,3%. For points that haven’t met the standards yet as much as 10 points (6.7%. And for the points which don’t meet as many as 9 points (6%. So, PT. SPD were included in the category level assessment good or equivalent certificate flag gold tally. It was advisable to PT. SPD to enhance the application of SMK3 based on OHSAS with: (1 required to have a manual SMK3 on OHSAS, (2 required to have procedures for identifying, accessing and updating rules K3, (3 required to provide competent resources to SMK3 implementations, (4 the HSE training should be distinguished the responsibilities, competencies, languages, skills and risk, (5 should be doing simulated fire emergency, (6 must have data calibration tools in accordance with the regulations.
Dynamic programming approach to optimization of approximate decision rules
Amin, Talha
2013-02-01
This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number of unordered pairs of rows with different decisions in the decision table T. For a nonnegative real number β, we consider β-decision rules that localize rows in subtables of T with uncertainty at most β. Our algorithm constructs a directed acyclic graph Δβ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most β. The graph Δβ(T) allows us to describe the whole set of so-called irredundant β-decision rules. We can describe all irredundant β-decision rules with minimum length, and after that among these rules describe all rules with maximum coverage. We can also change the order of optimization. The consideration of irredundant rules only does not change the results of optimization. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository. © 2012 Elsevier Inc. All rights reserved.
Dynamic programming approach for partial decision rule optimization
Amin, Talha
2012-10-04
This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertainty measure J(T) which is the difference between number of rows in a decision table T and number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules (partial decision rules) that localize rows in subtables of T with uncertainty at most γ. Presented algorithm constructs a directed acyclic graph Δ γ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The graph Δ γ(T) allows us to describe the whole set of so-called irredundant γ-decision rules. We can optimize such set of rules according to length or coverage. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository.
Replacement model of city bus: A dynamic programming approach
Arifin, Dadang; Yusuf, Edhi
2017-06-01
This paper aims to develop a replacement model of city bus vehicles operated in Bandung City. This study is driven from real cases encountered by the Damri Company in the efforts to improve services to the public. The replacement model propounds two policy alternatives: First, to maintain or keep the vehicles, and second is to replace them with new ones taking into account operating costs, revenue, salvage value, and acquisition cost of a new vehicle. A deterministic dynamic programming approach is used to solve the model. The optimization process was heuristically executed using empirical data of Perum Damri. The output of the model is to determine the replacement schedule and the best policy if the vehicle has passed the economic life. Based on the results, the technical life of the bus is approximately 20 years old, while the economic life is an average of 9 (nine) years. It means that after the bus is operated for 9 (nine) years, managers should consider the policy of rejuvenation.
Bodley, C. S.; Devers, A. D.; Park, A. C.; Frisch, H. P.
1978-01-01
A theoretical development and associated digital computer program system for the dynamic simulation and stability analysis of passive and actively controlled spacecraft are presented. The dynamic system (spacecraft) is modeled as an assembly of rigid and/or flexible bodies not necessarily in a topological tree configuration. The computer program system is used to investigate total system dynamic characteristics, including interaction effects between rigid and/or flexible bodies, control systems, and a wide range of environmental loadings. In addition, the program system is used for designing attitude control systems and for evaluating total dynamic system performance, including time domain response and frequency domain stability analyses.
The NASA Computational Fluid Dynamics (CFD) program - Building technology to solve future challenges
Richardson, Pamela F.; Dwoyer, Douglas L.; Kutler, Paul; Povinelli, Louis A.
1993-01-01
This paper presents the NASA Computational Fluid Dynamics program in terms of a strategic vision and goals as well as NASA's financial commitment and personnel levels. The paper also identifies the CFD program customers and the support to those customers. In addition, the paper discusses technical emphasis and direction of the program and some recent achievements. NASA's Ames, Langley, and Lewis Research Centers are the research hubs of the CFD program while the NASA Headquarters Office of Aeronautics represents and advocates the program.
Energy Technology Data Exchange (ETDEWEB)
Tinianow, M.A.; Rotelli, R.L. Jr.; Baird, J.A.
1984-06-01
User instructions for the GEODYN Interactive Finite Element Computer Program are presented. The program is capable of performing the analysis of the three-dimensional transient dynamic response of a Polycrystalline Diamond Compact Bit - Bit Sub arising from the intermittent contact of the bit with the downhole rock formations. The program accommodates non-linear, time dependent, loading and boundary conditions.
Energy Technology Data Exchange (ETDEWEB)
Baird, J.A.; Apostal, M.C.; Rotelli, R.L. Jr.; Tinianow, M.A.; Wormley, D.N.
1984-06-01
The Theoretical Description for the GEODYN interactive finite-element computer program is presented. The program is capable of performing the analysis of the three-dimensional transient dynamic response of a Polycrystalline Diamond Compact Bit-Bit Sub arising from the intermittent contact of the bit with the downhole rock formations. The program accommodates nonlinear, time-dependent, loading and boundary conditions.
Dynamic grain growth during superplastic deformation
Energy Technology Data Exchange (ETDEWEB)
Rabinovich, M.Kh. [Ufa State Aviation-Technical Univ. (Russian Federation); Trifonov, V.G. [Russian Academy of Sciences, Ufa (Russian Federation). Inst. for Metals Superplasticity Problems
1996-05-01
Superplastic deformation (SPD) causes the accelerated anisotropic grain growth. This process results in the formation of structure which is quasistable during superplastic deformation and unstable after deformation. The degree of instability is determined by the size of grains, their shape coefficient which depends on the nature of an alloy and is equal to 1.1--1.5 after SPD, and by the unbalance of triple junctions at boundaries. Alloying of metals can affect the thermodynamic force and mechanism of dynamic anisotropic grain growth and correspondingly influence the parameters of superplasticity in alloys.
York, William S; Yi, Xiaobing
2004-08-01
A computer program CONDORR (CONstrained Dynamics of Rigid Residues) was developed for molecular dynamics simulations of large and/or constrained molecular systems, particularly carbohydrates. CONDORR efficiently calculates molecular trajectories on the basis of 2D or 3D potential energy maps, and can generate such maps based on a simple force field. The simulations involve three translational and three rotational degrees of freedom for each rigid, asymmetrical residue in the model. Total energy and angular momentum are conserved when no stochastic or external forces are applied to the model, if the time step is kept sufficiently short. Application of Langevin dynamics allows longer time steps, providing efficient exploration of conformational space. The utility of CONDORR was demonstrated by application to a constrained polysaccharide model and to the calculation of residual dipolar couplings for a disaccharide. [Figure: see text]. Molecular models (bottom) are created by cloning rigid residue archetypes (top) and joining them together. As defined here, the archetypes AX, HM and BG respectively correspond to an alpha-D-Xyl p residue, a hydroxymethyl group, and a beta-D-Glc p residue lacking O6, H6a and H6b. Each archetype contains atoms (indicated by boxes) that can be shared with other archetypes to form a linked structure. For example, the glycosidic link between the two D-Glc p residues is established by specifying that O1 of the nonreducing beta-D-Glc p (BG) residue (2) is identical to O4 of the reducing Glc p (BG) residue (1). The coordinates of the two residues are adjusted so as to superimpose these two (nominally distinct) atoms. Flexible hydroxymethyl (HM) groups (3 and 4) are treated as separate residues, and the torsional angles (normally indicated by the symbol omega) that define their geometric relationships to the pyranosyl rings of the BG residues are specified as psi3 and psi4, respectively. The torsional angles phi3 and phi4, defined solely to
DEFF Research Database (Denmark)
Fakih, Dalia; Pilecki, Bartosz; Schlosser, Anders
2015-01-01
-induced mucous cell metaplasia was increased in Sftpd(-/-) mice, supporting previously reported protective effects of endogenous SP-D in allergy. OVA-induced parenchymal CCL11 levels and eosinophilic infiltration in brochoalveolar lavage (BAL) were unaffected by 1,3-β-glucan but were reversed with rfh......SP-D treatment. 1,3-β-glucan-treatment did, however, induce pulmonary neutrophilic infiltration and increased TNF-α levels in BAL, independently of OVA-induced allergy. This infiltration was also reversed by treatment with rfhSP-D. 1,3-β-glucan reduced OVA-induced mucous cell metaplasia, Th2 cytokines and IFN......-D protects from mold-induced exacerbations of allergic asthma....
Evolutionary programming for goal-driven dynamic planning
Vaccaro, James M.; Guest, Clark C.; Ross, David O.
2002-03-01
Many complex artificial intelligence (IA) problems are goal- driven in nature and the opportunity exists to realize the benefits of a goal-oriented solution. In many cases, such as in command and control, a goal-oriented approach may be the only option. One of many appropriate applications for such an approach is War Gaming. War Gaming is an important tool for command and control because it provides a set of alternative courses of actions so that military leaders can contemplate their next move in the battlefield. For instance, when making decisions that save lives, it is necessary to completely understand the consequences of a given order. A goal-oriented approach provides a slowly evolving tractably reasoned solution that inherently follows one of the principles of war: namely concentration on the objective. Future decision-making will depend not only on the battlefield, but also on a virtual world where military leaders can wage wars and determine their options by playing computer war games much like the real world. The problem with these games is that the built-in AI does not learn nor adapt and many times cheats, because the intelligent player has access to all the information, while the user has access to limited information provided on a display. These games are written for the purpose of entertainment and actions are calculated a priori and off-line, and are made prior or during their development. With these games getting more sophisticated in structure and less domain specific in scope, there needs to be a more general intelligent player that can adapt and learn in case the battlefield situations or the rules of engagement change. One such war game that might be considered is Risk. Risk incorporates the principles of war, is a top-down scalable model, and provides a good application for testing a variety of goal- oriented AI approaches. By integrating a goal-oriented hybrid approach, one can develop a program that plays the Risk game effectively and move
Yuan, Qiao; Zhuo, Chen; Yonggui, Ma; Fuer, Lu; Suhua, Chen; Guangying, Huang
2013-07-01
The most frequently used spermicide Nonoxynol-9 (N-9) in the clinic alters the vaginal flora, which will result in an increased risk of opportunistic infection. So development of a novel spermicidal and microbicidal drug appears to be inevitable. Vaginal local immune is an important part of vaginal flora. Secretory leukocyte protease inhibitor (SLPI), surfactant proteins D (SP-D), and lactoferrin (LF) are anti-microbial molecules with important roles in immune system of female vaginas. To observe effect of a vaginal spermicide nonoxynol-9 (N-9) berberine plural gel on the expression of SLPI SP-D and LF in mice's vaginas. Materials and Methods : Female BABL/C mice were randomly divided into following 5 groups: normal control group, blank gel group, berberine gel group, 12% N-9 gel group and N-9 berberine plural gel group. Estradiol benzoate at physiological dose was done by hypodermic injection to every group's mice. After 72h, drug gels were separately injected into the mice's vaginas, while immunohistochemistry and Western blot were taken to detect the expression of the 3 indexes in mice's vaginas respectively after 24h and 72h of gel injection. The differences in the three indexes between normal control group and blank gel group were not significant statistically (p>0.05). The expression of the three indexes in 12% N-9 gel group was decreased compared to that in blank gel group (p0.05). Also, the three index's level of 24h and 72h in sub observation groups after treatment were without statistical significance (p>0.05). Application of N-9 berberine plural gel had little impact on antimicrobial peptides in normal mice's vaginas.
Jiang, Luan; Hu, Xiaoxin; Xiao, Qin; Gu, Yajia; Li, Qiang
2017-06-01
Amount of fibroglandular tissue (FGT) and level of background parenchymal enhancement (BPE) in breast dynamic contrast enhanced magnetic resonance images (DCE-MRI) are suggested as strong indices for assessing breast cancer risk. Whole breast segmentation is the first important task for quantitative analysis of FGT and BPE in three-dimensional (3-D) DCE-MRI. The purpose of this study is to develop and evaluate a fully automated technique for accurate segmentation of the whole breast in 3-D fat-suppressed DCE-MRI. The whole breast segmentation consisted of two major steps, i.e., the delineation of chest wall line and breast skin line. First, a sectional dynamic programming method was employed to trace the upper and/or lower boundaries of the chest wall by use of the positive and/or negative gradient within a band along the chest wall in each 2-D slice. Second, another dynamic programming was applied to delineate the skin-air boundary slice-by-slice based on the saturated gradient of the enhanced image obtained with the prior statistical distribution of gray levels of the breast skin line. Starting from the central slice, these two steps employed a Gaussian function to limit the search range of boundaries in adjacent slices based on the continuity of chest wall line and breast skin line. Finally, local breast skin line detection was applied around armpit to complete the whole breast segmentation. The method was validated with a representative dataset of 100 3-D breast DCE-MRI scans through objective quantification and subjective evaluation. The MR scans in the dataset were acquired with four MR scanners in five spatial resolutions. The cases were assessed with four breast density ratings by radiologists based on Breast Imaging Reporting and Data System (BI-RADS) of American College of Radiology. Our segmentation algorithm achieved a Dice volume overlap measure of 95.8 ± 1.2% and volume difference measure of 8.4 ± 2.4% between the automatically and manually
2016-07-01
The vision of the Dynamic Mobility Applications (DMA) program is to expedite the development, testing, and deployment of innovative mobility applications that maximize system productivity and enhance mobility of individuals within the surface transpo...
Chen, Wei; Huang, Dayu; Kulkarni, Ankur A.; Unnikrishnan, Jayakrishnan; Zhu, Quanyan; Mehta, Prashant; Meyn, Sean; Wierman, Adam
2013-01-01
Neuro-dynamic programming is a class of powerful techniques for approximating the solution to dynamic programming equations. In their most computationally attractive formulations, these techniques provide the approximate solution only within a prescribed finite-dimensional function class. Thus, the question that always arises is how should the function class be chosen? The goal of this paper is to propose an approach using the solutions to associated fluid and diffusion approximations. In ord...
Bellman's GAP--a language and compiler for dynamic programming in sequence analysis.
Sauthoff, Georg; Möhl, Mathias; Janssen, Stefan; Giegerich, Robert
2013-03-01
Dynamic programming is ubiquitous in bioinformatics. Developing and implementing non-trivial dynamic programming algorithms is often error prone and tedious. Bellman's GAP is a new programming system, designed to ease the development of bioinformatics tools based on the dynamic programming technique. In Bellman's GAP, dynamic programming algorithms are described in a declarative style by tree grammars, evaluation algebras and products formed thereof. This bypasses the design of explicit dynamic programming recurrences and yields programs that are free of subscript errors, modular and easy to modify. The declarative modules are compiled into C++ code that is competitive to carefully hand-crafted implementations. This article introduces the Bellman's GAP system and its language, GAP-L. It then demonstrates the ease of development and the degree of re-use by creating variants of two common bioinformatics algorithms. Finally, it evaluates Bellman's GAP as an implementation platform of 'real-world' bioinformatics tools. Bellman's GAP is available under GPL license from http://bibiserv.cebitec.uni-bielefeld.de/bellmansgap. This Web site includes a repository of re-usable modules for RNA folding based on thermodynamics.
Optimal Design of Measurement Programs for the Parameter Identification of Dynamic Systems
DEFF Research Database (Denmark)
Kirkegaard, Poul Henning; Sørensen, John Dalsgaard; Brincker, Rune
The design of a measured program devoted to parameter identification of structural dynamic systems is considered, the design problem is formulated as an optimization problem due to minimize the total expected cost of the measurement program. All the calculations are based on a priori knowledge...
Dynamic Programming Strategies on the Decision Tree Hidden behind the Optimizing Problems
Zoltan KATAI
2007-01-01
The aim of the paper is to present the characteristics of certain dynamic programming strategies on the decision tree hidden behind the optimizing problems and thus to offer such a clear tool for their study and classification which can help in the comprehension of the essence of this programming technique.
Drobnes, Emilie; Littleton, A.; Pesnell, William D.; Beck, K.; Buhr, S.; Durscher, R.; Hill, S.; McCaffrey, M.; McKenzie, D. E.; Myers, D.;
2013-01-01
We outline the context and overall philosophy for the combined Solar Dynamics Observatory (SDO) Education and Public Outreach (E/PO) program, present a brief overview of all SDO E/PO programs along with more detailed highlights of a few key programs, followed by a review of our results to date, conclude a summary of the successes, failures, and lessons learned, which future missions can use as a guide, while incorporating their own content to enhance the public's knowledge and appreciation of science and technology as well as its benefit to society.
On Static and Dynamic Control-Flow Information in Program Analysis and Transformation
DEFF Research Database (Denmark)
Damian, Daniel
This thesis addresses several aspects of static and dynamic control-flow information in programming languages, by investigating its interaction with program transformation and program analysis. Control-flow information indicates for each point in a program the possible program points to be executed...... that a non-duplicating CPS transformation does not alter the result of a monovariant constraint-based control-flow analysis. Building on control-flow analysis, we show that traditional constraint-based binding-time analysis and traditional partial evaluation benefit from the effects of a CPS transformation...
Snow, L. S.; Kuhn, A. E.
1975-01-01
Previous error analyses conducted by the Guidance and Dynamics Branch of NASA have used the Guidance Analysis Program (GAP) as the trajectory simulation tool. Plans are made to conduct all future error analyses using the Space Vehicle Dynamics Simulation (SVDS) program. A study was conducted to compare the inertial measurement unit (IMU) error simulations of the two programs. Results of the GAP/SVDS comparison are presented and problem areas encountered while attempting to simulate IMU errors, vehicle performance uncertainties and environmental uncertainties using SVDS are defined. An evaluation of the SVDS linear error analysis capability is also included.
DEFF Research Database (Denmark)
Rong, Aiying; Hakonen, Henri; Lahdelma, Risto
2009-01-01
This paper addresses the unit commitment (UC) in multi-period combined heat and power (CHP) production planning under the deregulated power market. In CHP plants (units), generation of heat and power follows joint characteristics, which implies that it is difficult to determine the relative cost...... efficiency of the plants. We introduce in this paper the DRDP-RSC algorithm, which is a dynamic regrouping based dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units, sequential commitment of units in small groups. Relaxed states of the plants are used to reduce...
Spin physics experiments at NICA-SPD with polarized proton and deuteron beams
Energy Technology Data Exchange (ETDEWEB)
Savin, I.; Efremov, A.; Pshekhonov, D.; Kovalenko, A.; Teryaev, O.; Shevchenko, O.; Nagajcev, A.; Guskov, A.; Kukhtin, V.; Toplilin, N. [JINR, Dubna (Russian Federation)
2016-08-15
This is a brief description of suggested measurements of asymmetries of the Drell-Yan (DY) pair production in collisions of non-polarized, longitudinally and transversally polarized protons and deuterons which provide an access to all leading-twist collinear and TMD PDFs of quarks and anti-quarks in nucleons. Other spin effects in hadronic and heavy-ion collisions may be also studied constituting the spin physics program at NICA. (orig.)
Program participation, labor force dynamics, and accepted wage rates
DEFF Research Database (Denmark)
Munch, Jakob Roland; Skipper, Lars
2008-01-01
transition rate from unemployment to employment upon completion. Most programs, therefore, increase the expected duration of unemployment spells. However, we find that the training undertaken while unemployed successfully increases the expected duration of subsequent spells of employment for many...... subpopulations. These longer spells of employment come at a cost of lower accepted hourly wage rates...
National Research Council Canada - National Science Library
Bi, Wenjie; Tian, Liuqing; Liu, Haiying; Chen, Xiaohong
2014-01-01
Dynamic portfolio choice is an important problem in finance, but the optimal strategy analysis is difficult when considering multiple stochastic volatility variables such as the stock price, interest rate, and income...
Strong sp-d exchange coupling in ZnMnTe/ZnMgTe core/shell nanowires
Energy Technology Data Exchange (ETDEWEB)
Wojnar, Piotr; Janik, Elzbieta; Szymura, Malgorzata; Zaleszczyk, Wojciech; Kret, Slawomir; Klopotowski, Lukasz; Wojciechowski, Tomasz; Baczewski, Lech T.; Wiater, Maciej; Karczewski, Grzegorz; Wojtowicz, Tomasz; Kossut, Jacek [Institute of Physics, Polish Academy of Sciences, Al. Lotnikow 32/46, 02-668 Warsaw (Poland); Suffczynski, Jan; Papierska, Joanna [Institute of Experimental Physics, Warsaw University, ul. Hoza 69, 00-681 Warsaw (Poland)
2014-07-15
In this work, our recent progress in the growth and optical studies of telluride nanowire heterostructures containing a small molar fraction of magnetic Mn-ions of only a few percent is overviewed. ZnMnTe/ZnMgTe core/shell nanowires (NWs) are grown by molecular beam epitaxy by employing the vapor-liquid-solid growth mechanism assisted with gold catalyst. The structures are studied by means of photoluminescence and microphotoluminescence in an external magnetic field. In the first step, however, an activation of the near band edge emission from ZnTe and ZnMnTe nanowires is described, which is achieved by coating the nanowires with shells made of ZnMgTe. The role of these shells is to passivate Zn(Mn)Te surface states. The incorporation of Mn ions into the crystalline lattice of ZnMnTe nanowires is manifested as a considerable blue shift of near band edge emission with increasing Mn concentration inside the nanowire cores, which reflects directly the increase of their energy gap. In an external magnetic field the near band edge emission exhibits a giant spectral redshift accompanied by an increase of the circular polarization of the emitted light. Both effect are fingerprints of giant Zeeman splitting of the band edges due to sp-d exchange interaction between the band carriers and magnetic Mn-ions. (copyright 2014 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim) (orig.)
Bunting, Peter; Armston, John; Clewley, Daniel; Lucas, Richard M.
2013-07-01
The management and spatial-temporal integration of LiDAR data from different sensors and platforms has been impeded by lack of generic open source tools and standards. This paper presents a new open source software system, the sorted pulse data software library (SPDLib), that provides a processing framework based on an implementation of a new file format for the storage of discrete-return and waveform LiDAR data from terrestrial, airborne and space borne platforms. A python binding and a visualisation tool (SPD Points Viewer), which build on top of the SPDLib and SPD file format have also been provided. The software and source code have recently been made freely available and can be accessed online through an open source code repository. Future developments will focus on the development of advanced waveform processing functionality and optimising IO performance. The software and documentation can be obtained from http://www.spdlib.org.
A Case for Dynamic Reverse-code Generation to Debug Non-deterministic Programs
Directory of Open Access Journals (Sweden)
Jooyong Yi
2013-09-01
Full Text Available Backtracking (i.e., reverse execution helps the user of a debugger to naturally think backwards along the execution path of a program, and thinking backwards makes it easy to locate the origin of a bug. So far backtracking has been implemented mostly by state saving or by checkpointing. These implementations, however, inherently do not scale. Meanwhile, a more recent backtracking method based on reverse-code generation seems promising because executing reverse code can restore the previous states of a program without state saving. In the literature, there can be found two methods that generate reverse code: (a static reverse-code generation that pre-generates reverse code through static analysis before starting a debugging session, and (b dynamic reverse-code generation that generates reverse code by applying dynamic analysis on the fly during a debugging session. In particular, we espoused the latter one in our previous work to accommodate non-determinism of a program caused by e.g., multi-threading. To demonstrate the usefulness of our dynamic reverse-code generation, this article presents a case study of various backtracking methods including ours. We compare the memory usage of various backtracking methods in a simple but nontrivial example, a bounded-buffer program. In the case of non-deterministic programs such as this bounded-buffer program, our dynamic reverse-code generation outperforms the existing backtracking methods in terms of memory efficiency.
Ou, Z; Chen, Y; Niu, X; He, W; Song, B; Fan, D; Sun, X
2017-11-01
Cadmium (Cd) is an environmental and industrial pollutant that induces a broad spectrum of toxicological effects, influences a variety of human organs, and is associated with poor semen quality and male infertility. Increasing evidence demonstrates that Cd induces testicular germ cell apoptosis in rodent animals. However, the specific effect of Cd exposure on autophagy in germ cells is poorly understood. We investigate the role of high-mobility group box 1 protein (HMGB1), a ubiquitous nuclear protein, on Cd-evoked autophagy in a mouse spermatocyte cell line (GC-2spd). Our data have shown that autophagy was significantly elevated in GC-2spd cells exposed to Cd. Furthermore, there was a reduction in rapamycin (RAP)-mediated apoptosis. In addition, Cd exposure reduced cell viability, which is an effect that could be significantly inhibited by RAP treatment. These results indicate that autophagy appears to serve a positive function in reducing Cd-induced cytotoxicity. In addition, HMGB1 increased coincident with the processing of LC3-I to LC3-II. Thus, the upregulation of HMGB1 increases LC3-II levels. Our data suggest that HMGB1-induced autophagy appears to act as a defense/survival mechanism against Cd cytotoxicity in GC-2spd cells.
Endocardium and Epicardium Segmentation in MR Images Based on Developed Otsu and Dynamic Programming
Directory of Open Access Journals (Sweden)
Shengzhou XU
2014-03-01
Full Text Available In order to accurately extract the endocardium and epicardium of the left ventricle from cardiac magnetic resonance (MR images, a method based on developed Otsu and dynamic programming has been proposed. First, regions with high gray value are divided into several left ventricle candidate regions by the developed Otsu algorithm, which based on constraining the search range of the ideal segmentation threshold. Then, left ventricular blood pool is selected from the candidate regions and its convex hull is found out as the endocardium. The epicardium is derived by applying dynamic programming method to find a closed path with minimum local cost. The local cost function of the dynamic programming method consists of two factors: boundary gradient and shape features. In order to improve the accuracy of segmentation, a non-maxima gradient suppression technique is adopted to get the boundary gradient. The experimental result of 138 MR images show that the method proposed has high accuracy and robustness.
A cross-scale constrained dynamic programming algorithm for stereo matching
Cheng, Sipei; Da, Feipeng; Yu, Jian; Huang, Yuan; Gai, Shaoyan
2017-06-01
Stereo matching is an important and hot research topic in computer vision. In order to solve the well-known streaking effects of dynamic programming, and reduce the mismatch points on edges, discontinuous and textureless regions, we propose a cross-scale constrained dynamic programming algorithm for stereo matching. The algorithm involves both image pyramid model and Gaussian scale space to operate a coarse-to-fine dynamic programming on multi-scale cost volumes. For the purpose of improving the disparity accuracy in textureless region, a cross-scale regularized constraint is added to ensure the cost consistency, the computational burden is reduced by using the disparity estimation from lower scale operation to seed the search on the larger image. Both synthetic and real scene experimental results show our algorithm can effectively reduce the mismatch in textureless regions.
Grammatikopoulos, Vasilis
2012-01-01
The current study attempts to integrate parts of program theory and systems-based procedures in educational program evaluation. The educational program that was implemented, called the "Early Steps" project, proposed that physical education can contribute to various educational goals apart from the usual motor skills improvement. Basic…
Repetitive elements dynamics in cell identity programming, maintenance and disease
Bodega, Beatrice
2014-12-01
The days of \\'junk DNA\\' seem to be over. The rapid progress of genomics technologies has been unveiling unexpected mechanisms by which repetitive DNA and in particular transposable elements (TEs) have evolved, becoming key issues in understanding genome structure and function. Indeed, rather than \\'parasites\\', recent findings strongly suggest that TEs may have a positive function by contributing to tissue specific transcriptional programs, in particular as enhancer-like elements and/or modules for regulation of higher order chromatin structure. Further, it appears that during development and aging genomes experience several waves of TEs activation, and this contributes to individual genome shaping during lifetime. Interestingly, TEs activity is major target of epigenomic regulation. These findings are shedding new light on the genome-phenotype relationship and set the premises to help to explain complex disease manifestation, as consequence of TEs activity deregulation.
Dupnick, E.
1973-01-01
Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.
Li, Yongping; Huang, Guohe
2009-03-01
In this study, a dynamic analysis approach based on an inexact multistage integer programming (IMIP) model is developed for supporting municipal solid waste (MSW) management under uncertainty. Techniques of interval-parameter programming and multistage stochastic programming are incorporated within an integer-programming framework. The developed IMIP can deal with uncertainties expressed as probability distributions and interval numbers, and can reflect the dynamics in terms of decisions for waste-flow allocation and facility-capacity expansion over a multistage context. Moreover, the IMIP can be used for analyzing various policy scenarios that are associated with different levels of economic consequences. The developed method is applied to a case study of long-term waste-management planning. The results indicate that reasonable solutions have been generated for binary and continuous variables. They can help generate desired decisions of system-capacity expansion and waste-flow allocation with a minimized system cost and maximized system reliability.
A novel neural dynamical approach to convex quadratic program and its efficient applications.
Xia, Youshen; Sun, Changyin
2009-12-01
This paper proposes a novel neural dynamical approach to a class of convex quadratic programming problems where the number of variables is larger than the number of equality constraints. The proposed continuous-time and proposed discrete-time neural dynamical approach are guaranteed to be globally convergent to an optimal solution. Moreover, the number of its neurons is equal to the number of equality constraints. In contrast, the number of neurons in existing neural dynamical methods is at least the number of the variables. Therefore, the proposed neural dynamical approach has a low computational complexity. Compared with conventional numerical optimization methods, the proposed discrete-time neural dynamical approach reduces multiplication operation per iteration and has a large computational step length. Computational examples and two efficient applications to signal processing and robot control further confirm the good performance of the proposed approach.
Li, Ji-Qing; Zhang, Yu-Shan; Ji, Chang-Ming; Wang, Ai-Jing; Lund, Jay R
2013-01-01
This paper examines long-term optimal operation using dynamic programming for a large hydropower system of 10 reservoirs in Northeast China. Besides considering flow and hydraulic head, the optimization explicitly includes time-varying electricity market prices to maximize benefit. Two techniques are used to reduce the 'curse of dimensionality' of dynamic programming with many reservoirs. Discrete differential dynamic programming (DDDP) reduces the search space and computer memory needed. Object-oriented programming (OOP) and the ability to dynamically allocate and release memory with the C++ language greatly reduces the cumulative effect of computer memory for solving multi-dimensional dynamic programming models. The case study shows that the model can reduce the 'curse of dimensionality' and achieve satisfactory results.
Energy Technology Data Exchange (ETDEWEB)
Brown, M.A.; White, D.L.
1992-12-01
This study continues the series of evaluations of the Bonneville Power Administration's long-term Residential Weatherization Program (RWP) by examining the energy saved by its 1988 and 1989 participants. The sample of participants for this study was drawn from 10 utilities covering the region's three climate zones. Six of these utilities were included in the 1988 RWP evaluation, and eight of them were included in the 1989 RWP evaluation. This study analyzes data on 356 participating households in 1988, 433 participants in 1989, and a comparison group of 1170 nonparticipants in 1988 and 1466 in 1989. Previous evaluations of Bonneville's earlier weatherization programs provide an historic context for analyzing program dynamics.
Energy Technology Data Exchange (ETDEWEB)
Brown, M.A.; White, D.L.
1992-12-01
This study continues the series of evaluations of the Bonneville Power Administration`s long-term Residential Weatherization Program (RWP) by examining the energy saved by its 1988 and 1989 participants. The sample of participants for this study was drawn from 10 utilities covering the region`s three climate zones. Six of these utilities were included in the 1988 RWP evaluation, and eight of them were included in the 1989 RWP evaluation. This study analyzes data on 356 participating households in 1988, 433 participants in 1989, and a comparison group of 1170 nonparticipants in 1988 and 1466 in 1989. Previous evaluations of Bonneville`s earlier weatherization programs provide an historic context for analyzing program dynamics.
A dynamic programming approach to missing data estimation using neural networks
CSIR Research Space (South Africa)
Nelwamondo, FV
2013-01-01
Full Text Available This paper develops and presents a novel technique for missing data estimation using a combination of dynamic programming, neural networks and genetic algorithms (GA) on suitable subsets of the input data. The method proposed here is well suited...
Fast pairwise structural RNA alignments by pruning of the dynamical programming matrix
DEFF Research Database (Denmark)
Havgaard, Jakob Hull; Torarinsson, Elfar; Gorodkin, Jan
2007-01-01
not be present and pre-folding ignores the comparative information. Here, pruning of the dynamical programming matrix is presented as an alternative novel heuristic constraint. All subalignments that do not exceed a length-dependent minimum score are discarded as the matrix is filled out, thus giving...
DEFF Research Database (Denmark)
Rong, Aiying; Hakonen, Henri; Lahdelma, Risto
2008-01-01
introduce in this paper the DP-RSC1 algorithm, which is a variant of the dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units and sequential commitment of units one by one. The time complexity of DP-RSC1 is proportional to the number of generating units...
Dynamics of Population and Economic Growth: A Computer-Based Instruction Program.
Roh, Chaisung; Handler, Paul
A computer-assisted instructional (CAI) program at the University of Illinois is used to teach the dynamics of population growth. Socio-economic models are also developed to show the consequences of population growth upon variables such as income, productivity, and the demand for food. A one-sex population projection model allows students to…
Sutrisno; Widowati; Solikhin
2016-06-01
In this paper, we propose a mathematical model in stochastic dynamic optimization form to determine the optimal strategy for an integrated single product inventory control problem and supplier selection problem where the demand and purchasing cost parameters are random. For each time period, by using the proposed model, we decide the optimal supplier and calculate the optimal product volume purchased from the optimal supplier so that the inventory level will be located at some point as close as possible to the reference point with minimal cost. We use stochastic dynamic programming to solve this problem and give several numerical experiments to evaluate the model. From the results, for each time period, the proposed model was generated the optimal supplier and the inventory level was tracked the reference point well.
Optimizing Gear Shifting Strategy for Off-Road Vehicle with Dynamic Programming
Directory of Open Access Journals (Sweden)
Xinxin Zhao
2014-01-01
Full Text Available Gear shifting strategy of vehicle is important aid for the acquisition of dynamic performance and high economy. A dynamic programming (DP algorithm is used to optimize the gear shifting schedule for off-road vehicle by using an objective function that weighs fuel use and trip time. The optimization is accomplished through discrete dynamic programming and a trade-off between trip time and fuel consumption is analyzed. By using concave and convex surface road as road profile, an optimal gear shifting strategy is used to control the longitudinal behavior of the vehicle. Simulation results show that the trip time can be reduced by powerful gear shifting strategy and fuel consumption can achieve high economy with economical gear shifting strategy in different initial conditions and route cases.
Zhao, Yongzhen; Jia, Yumei; Li, Chunsheng; Fang, Yingying; Shao, Rui
2018-01-01
To evaluate the efficacy of soluble programmed death-1 (sPD-1) for risk stratification and prediction of 28-day mortality in patients with sepsis, we compared serum sPD-1 with procalcitonin (PCT), C-reactive protein (CRP), and the Mortality in Emergency Department Sepsis (MEDS) score. A total of 60 healthy volunteers and 595 emergency department (ED) patients were recruited for this prospective cohort study. According to the severity of their condition on ED arrival, the patients were allocated to the systemic inflammatory response syndrome group (130 cases), sepsis group (276 cases), severe sepsis group (121 cases), and septic shock group (68 cases). In addition, all patients with sepsis were also divided into the survivor group (349 cases) and nonsurvivor group (116 cases) according to the 28-day outcomes. When the severity of sepsis increased, the levels of sPD-1 gradually increased. The levels of sPD-1, PCT, CRP and the MEDS score were also higher in the nonsurvivor group compared to the survivor group. Logistic regression suggested that sPD-1, PCT, and the MEDS score were independent risk factors for 28-day mortality of patients with sepsis. Area under the curve (AUC) of sPD-1, PCT and the MEDS score for 28-day mortality was 0.725, 0.693, and 0.767, respectively, and the AUC was improved when all 3 factors were combined (0.843). Serum sPD-1 is positively correlated with the severity of sepsis, and it is valuable for risk stratification of patients and prediction of 28-day mortality. Combining sPD-1 with PCT and the MEDS score improves the prognostic evaluation. Copyright © 2017 Elsevier Inc. All rights reserved.
Energy Technology Data Exchange (ETDEWEB)
None
1977-05-01
The mathematical models and computer program comprising the SPP Dynamic Simulation are described. The SPP Dynamic Simulation is a computerized model representing the time-varying performance characteristics of the SPP. The model incorporates all the principal components of the pilot plant. Time-dependent direct normal solar insulation, as corrupted by simulated cloud passages, is transformed into absorbed radiant power by actions of the heliostat field and enclosed receiver cavity. The absorbed power then drives the steam generator model to produce superheated steam for the turbine and/or thermal storage subsystems. The thermal storage subsystem can, in turn, also produce steam for the turbine. The turbine using the steam flow energy produces the mechanical shaft power necessary for the generator to convert it to electrical power. This electrical power is subsequently transmitted to a transmission grid system. Exhaust steam from the turbine is condensed, reheated, deaerated, and pressurized by pumps for return as feedwater to the thermal storage and/or steam generator. A master control/instrumentation system is utilized to coordinate the various plant operations. The master controller reacts to plant operator demands and control settings to effect the desired output response. The SPP Dynamic Simulation Computer program is written in FORTRAN language. Various input options (e.g., insolation values, load demands, initial pressures/temperatures/flows) are permitted. Plant performance may be monitored via computer printout or computer generated plots. The remainder of this document describes the detailed pilot plant dynamic model, the basis for this simulation, and the utilization of this simulation to obtain analytical plant performance results.
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
DEFF Research Database (Denmark)
Christensen, Tue; Andersen, Kim Allan; Klose, Andreas
2013-01-01
This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost functions are often found in practice. We present a dynamic programming algorithm for solving...... this so-called single-sink, fixed-charge, multiple-choice transportation problem exactly. The method exploits heuristics and lower bounds to peg binary variables, improve bounds on flow variables, and reduce the state-space variable. In this way, the dynamic programming method is able to solve large...... instances with up to 10,000 nodes and 10 different transportation modes in a few seconds, much less time than required by a widely used mixed-integer programming solver and other methods proposed in the literature for this problem....
Bellman, Richard
2003-01-01
An introduction to the mathematical theory of multistage decision processes, this text takes a ""functional equation"" approach to the discovery of optimum policies. Written by a leading developer of such policies, it presents a series of methods, uniqueness and existence theorems, and examples for solving the relevant equations. The text examines existence and uniqueness theorems, the optimal inventory equation, bottleneck problems in multistage production processes, a new formalism in the calculus of variation, strategies behind multistage games, and Markovian decision processes. Each chapte
Raso, Luciano; Dorchies, David; Malaterre, Pierre-Olivier
2015-04-01
We developed an Objective Oriented Programming (OOP) tool for optimal management of complex water systems by use of Stochastic Dual Dynamic Programming (SDDP). OOP is a powerful programming paradigm. OOP minimizes code redundancies, making code modification and maintenance very effective. This is especially welcome in research, in which, often, code must be modified to meet new requirements that were not initially considered. SDDP is an advanced method for optimal operation of complex dynamic systems under uncertainty. SDDP can deal with large and complex systems, such as a multi-reservoir system. The objective of this tool is making SDDP usable for Water Management Analysts. Thanks to this tool, the Analyst can bypass the SDDP programming complexity, and his/her task is simplified to the definition of system elements, topology and objectives, and experiments characteristics. In this tool, the main classes are: Experiment, System, Element, and Objective. Experiments are run on a system. A system is made of many elements interconnected among them. Class Element is made of the following sub-classes: (stochastic) hydrological scenario, (deterministic) water demand scenario, reservoir, river reach, off-take, and irrigation basin. Objectives are used in the optimization procedure to find the optimal operational rules, for a given system and experiment. OOP flexibility allows the Water Management Analyst to extend easily existing classes in order to answer his/her specific research questions. The tool is implemented in Python, and will be initially tested on two applications: the Senegal River water system, in West Africa, and the Seine River, in France.
Hoham, Ronald W.; Marcarelli, Amy M.; Rogers, Haldre S.; Ragan, Michael D.; Petre, Benjamin M.; Ungerer, Michael D.; Barnes, Joseph M.; Francis, David O.
2000-12-01
The effects of premating light regimes on sexual reproduction and the production of spherical cells in Chloromonas sp.-D, a unicellular green snow alga, were studied using cross-mating strains 582C and 582D isolated from snowpacks associated with mixed hardwood- softwood forests in Whetstone Gulf State Park, Tughill Plateau, NY. Two pre-acclimation regimes were used, Vita-Lite as controls (530- 700 nm peak) and blue light as experimentals (430- 460 nm peak) prior to the mating experiments. In blue light, an increase in the number of matings and spherical cells (spheres) produced in the life cycle was observed as the photoperiod increased. This implies that longer photoperiods of blue light are more optimal for sexual reproduction in Chloromonas sp.-D than shorter ones. Under Vita-Lite, there was a significant increase in the number of matings and spheres with the extended 20 : 4 photoperiod compared with the shorter 14 : 10 photoperiod. Under blue light, significantly more matings and spheres occurred than under Vita-Lite using the same irradiance level of 95µmol photons m-2 s-1 (photosynthetically active radiation [PAR] of 400- 700 nm) for the 14 : 10 and 20 : 4 photoperiods. The results of these experiments suggest that Chloromonas sp.-D, known only from the Tughill Plateau, NY, is not reproducing optimally at this site where it grows and reproduces under an approximate 14 : 10 photoperiod in early April. However, in the upper 10 cm of snow in the Tughill Plateau, a blue light irradiance level of 95µmol photons m-2 s-1 occurs, which is optimal for this species. When these conditions are combined with a 14 : 10 photoperiod, the Tughill Plateau appears to be sub-optimal for mating and production of spherical cells. Since Chloromonas sp.-D does not appear to have a dependence on a dark cycle, this would allow it to expand its geographical distribution. It may reproduce more optimally under blue light (95µmol photons m-2 s-1) with an extended photoperiod (>20 : 4
Ren, Kaiyu; Lai, Albert M; Mukhopadhyay, Aveek; Machiraju, Raghu; Huang, Kun; Xiang, Yang
2014-01-01
Mapping medical terms to standardized UMLS concepts is a basic step for leveraging biomedical texts in data management and analysis. However, available methods and tools have major limitations in handling queries over the UMLS Metathesaurus that contain inaccurate query terms, which frequently appear in real world applications. To provide a practical solution for this task, we propose a layered dynamic programming mapping (LDPMap) approach, which can efficiently handle these queries. LDPMap uses indexing and two layers of dynamic programming techniques to efficiently map a biomedical term to a UMLS concept. Our empirical study shows that LDPMap achieves much faster query speeds than LCS. In comparison to the UMLS Metathesaurus Browser and MetaMap, LDPMap is much more effective in querying the UMLS Metathesaurus for inaccurately spelled medical terms, long medical terms, and medical terms with special characters. These results demonstrate that LDPMap is an efficient and effective method for mapping medical terms to the UMLS Metathesaurus.
Optimum Repartition of Transport Capacities in the Logistic System using Dynamic Programming
Directory of Open Access Journals (Sweden)
Gheorghe BĂŞANU
2011-08-01
Full Text Available Transportations take an essential role in logistics, interconnecting the majority of processes and operations within logistic system. The efficient use of transportation capacity is a priority whose achievement can diminish logistic costs. This objective is today difficult to achieve due to increasing complexity of transportation monitoring and coordination. This complexity is determined by transportation number and diversity, by the volume and diversity of orders, by increasing the targets to be supplied.Dynamic programming represents a highly useful tool for logistic managers, considering that its specific techniques and methods are oriented toward solving problems related to resource optimum allocation and utilization.The present paper presents briefly a series of theoretical elements of dynamic programming applied in logistics, based on which it is shown a mathematic model to determine the optimum policy for transport capacity repartition for the area attached to a logistic centre, through three distribution centres.
Pareto Optimal Solutions for Stochastic Dynamic Programming Problems via Monte Carlo Simulation
Directory of Open Access Journals (Sweden)
R. T. N. Cardoso
2013-01-01
Full Text Available A heuristic algorithm is proposed for a class of stochastic discrete-time continuous-variable dynamic programming problems submitted to non-Gaussian disturbances. Instead of using the expected values of the objective function, the randomness nature of the decision variables is kept along the process, while Pareto fronts weighted by all quantiles of the objective function are determined. Thus, decision makers are able to choose any quantile they wish. This new idea is carried out by using Monte Carlo simulations embedded in an approximate algorithm proposed to deterministic dynamic programming problems. The new method is tested in instances of the classical inventory control problem. The results obtained attest for the efficiency and efficacy of the algorithm in solving these important stochastic optimization problems.
A Case Study on Air Combat Decision Using Approximated Dynamic Programming
Directory of Open Access Journals (Sweden)
Yaofei Ma
2014-01-01
Full Text Available As a continuous state space problem, air combat is difficult to be resolved by traditional dynamic programming (DP with discretized state space. The approximated dynamic programming (ADP approach is studied in this paper to build a high performance decision model for air combat in 1 versus 1 scenario, in which the iterative process for policy improvement is replaced by mass sampling from history trajectories and utility function approximating, leading to high efficiency on policy improvement eventually. A continuous reward function is also constructed to better guide the plane to find its way to “winner” state from any initial situation. According to our experiments, the plane is more offensive when following policy derived from ADP approach other than the baseline Min-Max policy, in which the “time to win” is reduced greatly but the cumulated probability of being killed by enemy is higher. The reason is analyzed in this paper.
A Stereo Dual-Channel Dynamic Programming Algorithm for UAV Image Stitching.
Li, Ming; Chen, Ruizhi; Zhang, Weilong; Li, Deren; Liao, Xuan; Wang, Lei; Pan, Yuanjin; Zhang, Peng
2017-09-08
Dislocation is one of the major challenges in unmanned aerial vehicle (UAV) image stitching. In this paper, we propose a new algorithm for seamlessly stitching UAV images based on a dynamic programming approach. Our solution consists of two steps: Firstly, an image matching algorithm is used to correct the images so that they are in the same coordinate system. Secondly, a new dynamic programming algorithm is developed based on the concept of a stereo dual-channel energy accumulation. A new energy aggregation and traversal strategy is adopted in our solution, which can find a more optimal seam line for image stitching. Our algorithm overcomes the theoretical limitation of the classical Duplaquet algorithm. Experiments show that the algorithm can effectively solve the dislocation problem in UAV image stitching, especially for the cases in dense urban areas. Our solution is also direction-independent, which has better adaptability and robustness for stitching images.
Nagy, Ivan
2017-01-01
This book provides a general theoretical background for constructing the recursive Bayesian estimation algorithms for mixture models. It collects the recursive algorithms for estimating dynamic mixtures of various distributions and brings them in the unified form, providing a scheme for constructing the estimation algorithm for a mixture of components modeled by distributions with reproducible statistics. It offers the recursive estimation of dynamic mixtures, which are free of iterative processes and close to analytical solutions as much as possible. In addition, these methods can be used online and simultaneously perform learning, which improves their efficiency during estimation. The book includes detailed program codes for solving the presented theoretical tasks. Codes are implemented in the open source platform for engineering computations. The program codes given serve to illustrate the theory and demonstrate the work of the included algorithms.
DEFF Research Database (Denmark)
Davidsen, Claus; Liu, Suxia; Mo, Xinguo
2014-01-01
to head-dependent pumping costs. These dynamic pumping costs strongly affect the total costs and can lead to non-convexity of the future cost function. The water user groups (agriculture, industry, domestic) are characterized by inelastic demands and fixed water allocation and water supply curtailment......Optimal management of conjunctive use of surface water and groundwater has been attempted with different algorithms in the literature. In this study, a hydro-economic modelling approach to optimize conjunctive use of scarce surface water and groundwater resources under uncertainty is presented....... A stochastic dynamic programming (SDP) approach is used to minimize the basin-wide total costs arising from water allocations and water curtailments. Dynamic allocation problems with inclusion of groundwater resources proved to be more complex to solve with SDP than pure surface water allocation problems due...
Gao, Xiaoming; Thomas H. Spreen; DeLorenzo, Michael A.
1992-01-01
Seasonal price premiums have been proposed as a means of dampening the highly seasonal patterns of milk production in Florida. A Markov decision bio-economic model of the breeding and replacement decisions was solved via stochastic dynamic programming and used to analyze the potential supply response to seasonal price premiums. The results of the analysis suggest that the seasonal milk supply in Florida is highly price inelastic.
Directory of Open Access Journals (Sweden)
Stanimirović Ivan
2009-01-01
Full Text Available We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm, as well as with Microsoft Project.
A New Powered Lower Limb Prosthesis Control Framework Based on Adaptive Dynamic Programming.
Wen, Yue; Si, Jennie; Gao, Xiang; Huang, Stephanie; Huang, He Helen
2017-09-01
This brief presents a novel application of adaptive dynamic programming (ADP) for optimal adaptive control of powered lower limb prostheses, a type of wearable robots to assist the motor function of the limb amputees. Current control of these robotic devices typically relies on finite state impedance control (FS-IC), which lacks adaptability to the user's physical condition. As a result, joint impedance settings are often customized manually and heuristically in clinics, which greatly hinder the wide use of these advanced medical devices. This simulation study aimed at demonstrating the feasibility of ADP for automatic tuning of the twelve knee joint impedance parameters during a complete gait cycle to achieve balanced walking. Given that the accurate models of human walking dynamics are difficult to obtain, the model-free ADP control algorithms were considered. First, direct heuristic dynamic programming (dHDP) was applied to the control problem, and its performance was evaluated on OpenSim, an often-used dynamic walking simulator. For the comparison purposes, we selected another established ADP algorithm, the neural fitted Q with continuous action (NFQCA). In both cases, the ADP controllers learned to control the right knee joint and achieved balanced walking, but dHDP outperformed NFQCA in this application during a 200 gait cycle-based testing.
Dynamic trunk stabilization: a conceptual back injury prevention program for volleyball athletes.
Smith, Chad E; Nyland, John; Caudill, Paul; Brosky, Joseph; Caborn, David N M
2008-11-01
The sport of volleyball creates considerable dynamic trunk stability demands. Back injury occurs all too frequently in volleyball, particularly among female athletes. The purpose of this clinical commentary is to review functional anatomy, muscle coactivation strategies, assessment of trunk muscle performance, and the characteristics of effective exercises for the trunk or core. From this information, a conceptual progressive 3-phase volleyball-specific training program is presented to improve dynamic trunk stability and to potentially reduce the incidence of back injury among volleyball athletes. Phase 1 addresses low-velocity motor control, kinesthetic awareness, and endurance, with the clinician providing cues to teach achievement of biomechanically neutral spine alignment. Phase 2 focuses on progressively higher velocity dynamic multiplanar endurance, coordination, and strength-power challenges integrating upper and lower extremity movements, while maintaining neutral spine alignment. Phase 3 integrates volleyball-specific skill simulations by breaking down composite movement patterns into their component parts, with differing dynamic trunk stability requirements, while maintaining neutral spine alignment. Prospective research is needed to validate the efficacy of this program.
Extraction of Static and Dynamic Reservoir Operation Rules by Genetic Programming
Directory of Open Access Journals (Sweden)
Habib Akbari Alashti
2014-11-01
Full Text Available Considering the necessity of desirable operation of limited water resources and assuming the significant role of dams in controlling and consuming the surface waters, highlights the advantageous of suitable operation rules for optimal and sustainable operation of dams. This study investigates the hydroelectric supply of a one-reservoir system of Karoon3 using nonlinear programming (NLP, genetic algorithm (GA, genetic programming (GP and fixed length gen GP (FLGGP in real-time operation of dam considering two approaches of static and dynamic operation rules. In static operation rule, only one rule curve is extracted for all months in a year whereas in dynamic operation rule, monthly rule curves (12 rules are extracted for each month of a year. In addition, nonlinear decision rule (NLDR curves are considered, and the total deficiency function as the target (objective function have been used for evaluating the performance of each method and approach. Results show appropriate efficiency of GP and FLGGP methods in extracting operation rules in both approaches. Superiority of these methods to operation methods yielded by GA and NLP is 5%. Moreover, according to the results, it can be remarked that, FLGGP method is an alternative for GP method, whereas the GP method cannot be used due to its limitations. Comparison of two approaches of static and dynamic operation rules demonstrated the superiority of dynamic operation rule to static operation rule (about 10% and therefore this method has more capabilities in real-time operation of the reservoirs systems.
Zhou, Yuan; Cheng, Xinyao; Xu, Xiangyang; Song, Enmin
2013-12-01
Segmentation of carotid artery intima-media in longitudinal ultrasound images for measuring its thickness to predict cardiovascular diseases can be simplified as detecting two nearly parallel boundaries within a certain distance range, when plaque with irregular shapes is not considered. In this paper, we improve the implementation of two dynamic programming (DP) based approaches to parallel boundary detection, dual dynamic programming (DDP) and piecewise linear dual dynamic programming (PL-DDP). Then, a novel DP based approach, dual line detection (DLD), which translates the original 2-D curve position to a 4-D parameter space representing two line segments in a local image segment, is proposed to solve the problem while maintaining efficiency and rotation invariance. To apply the DLD to ultrasound intima-media segmentation, it is imbedded in a framework that employs an edge map obtained from multiplication of the responses of two edge detectors with different scales and a coupled snake model that simultaneously deforms the two contours for maintaining parallelism. The experimental results on synthetic images and carotid arteries of clinical ultrasound images indicate improved performance of the proposed DLD compared to DDP and PL-DDP, with respect to accuracy and efficiency. Copyright © 2013 Elsevier B.V. All rights reserved.
The dynamic programming approach to long term production planning in agriculture
Directory of Open Access Journals (Sweden)
Jitka Janová
2011-01-01
Full Text Available The production planning in agriculture is one of the most important decision problems of the farmer. Although some decision support tools based mainly on linear programming and addressed to agriculture authorities were presented, their direct application by a farmer is not possible. This is mainly due to the local character of the models developed for particular agricultural conditions and also due to the complexness of underlying mathematical programming models.This paper aims to develop dynamic programming model for the long run crop plan optimization covering the typical conditions of Czech farms, which could serve as a platform for further enlargements and changes according to needs and conditions of particular farm. The dynamic programming algorithm is developed in detail for model case of four areas to be planted by four crops each year. The possibility of covering different constraints by generating the state space is discussed, and the generating procedure for crop rotation rules is shown. The goal function reflects the farmers objective of profit maximization and it is defined with respect to harvests’ randomness. The case study is solved for the data from South Moravian agriculture cooperative and the optimal solution is presented and discussed.
Wright, Robert; Abraham, Edo; Parpas, Panos; Stoianov, Ivan
2015-12-01
The operation of water distribution networks (WDN) with a dynamic topology is a recently pioneered approach for the advanced management of District Metered Areas (DMAs) that integrates novel developments in hydraulic modeling, monitoring, optimization, and control. A common practice for leakage management is the sectorization of WDNs into small zones, called DMAs, by permanently closing isolation valves. This facilitates water companies to identify bursts and estimate leakage levels by measuring the inlet flow for each DMA. However, by permanently closing valves, a number of problems have been created including reduced resilience to failure and suboptimal pressure management. By introducing a dynamic topology to these zones, these disadvantages can be eliminated while still retaining the DMA structure for leakage monitoring. In this paper, a novel optimization method based on sequential convex programming (SCP) is outlined for the control of a dynamic topology with the objective of reducing average zone pressure (AZP). A key attribute for control optimization is reliable convergence. To achieve this, the SCP method we propose guarantees that each optimization step is strictly feasible, resulting in improved convergence properties. By using a null space algorithm for hydraulic analyses, the computations required are also significantly reduced. The optimized control is actuated on a real WDN operated with a dynamic topology. This unique experimental program incorporates a number of technologies set up with the objective of investigating pioneering developments in WDN management. Preliminary results indicate AZP reductions for a dynamic topology of up to 6.5% over optimally controlled fixed topology DMAs. This article was corrected on 12 JAN 2016. See the end of the full text for details.
Toh, H
1997-08-01
Two approximations were introduced into the double dynamic programming algorithm, in order to reduce the computational time for structural alignment. One of them was the so-called distance cut-off, which approximately describes the structural environment of each residue by its local environment. In the approximation, a sphere with a given radius is placed at the center of the side chain of each residue. The local environment of a residue is constituted only by the residues with side chain centers that are present within the sphere, which is expressed by a set of center-to-center distances from the side chain of the residue to those of all the other constituent residues. The residues outside the sphere are neglected from the local environment. Another approximation is associated with the distance cut-off, which is referred to here as the delta N cut-off. If two local environments are similar to each other, the numbers of residues constituting the environments are expected to be similar. The delta N cut-off was introduced based on the idea. If the difference between the numbers of the constituent residues of two local environments is greater than a given threshold value, delta N, the evaluation of the similarity between the local environments is skipped. The introduction of the two approximations dramatically reduced the computational time for structural alignment by the double dynamic programming algorithm. However, the approximations also decreased the accuracy of the alignment. To improve the accuracy with the approximations, a program with a two-step alignment algorithm was constructed. At first, an alignment was roughly constructed with the approximations. Then, the epsilon-suboptimal region for the alignment was determined. Finally, the double dynamic programming algorithm with full structural environments was applied to the residue pairs within the epsilon-suboptimal region to produce an improved alignment.
Spasticity changes in SCI following a dynamic standing program using the Segway.
Boutilier, G; Sawatzky, B J; Grant, C; Wiefelspuett, S; Finlayson, H
2012-08-01
A pilot prospective pre- and post-intervention study. To determine whether a dynamic standing program using the Segway Personal Transporter results in any measurable physiological effects in individuals with spinal cord injury (SCI) using both qualitative and quantitative measures of spasticity, pain and fatigue. International Collaboration of Repair Discoveries (ICORD) Research Centre, Vancouver, BC, Canada. Eight individuals with SCI ASIA (American Spinal Injury Association) A-D, who could stand with or without the assistance of bracing or supports, participated in a 4-week dynamic standing program using a Segway (3 per week, 30-min sessions). The main outcome was spasticity as measured by the Modified Ashworth Scale (MAS). Secondary measures included the SCI-Spasticity Evaluation Tool, Pain Outcomes Questionnaire, and Fatigue Severity Scale. The dynamic standing sessions were associated with immediate improvements in spasticity (MAS) (PSegway may be effective for short-term spasticity reduction and decreased pain and fatigue. Future work should examine a larger sample size and help to propose mechanisms for potential reductions in spasticity.
Yang, Ruiduo; Sarkar, Sudeep; Loeding, Barbara
2010-03-01
We consider two crucial problems in continuous sign language recognition from unaided video sequences. At the sentence level, we consider the movement epenthesis (me) problem and at the feature level, we consider the problem of hand segmentation and grouping. We construct a framework that can handle both of these problems based on an enhanced, nested version of the dynamic programming approach. To address movement epenthesis, a dynamic programming (DP) process employs a virtual me option that does not need explicit models. We call this the enhanced level building (eLB) algorithm. This formulation also allows the incorporation of grammar models. Nested within this eLB is another DP that handles the problem of selecting among multiple hand candidates. We demonstrate our ideas on four American Sign Language data sets with simple background, with the signer wearing short sleeves, with complex background, and across signers. We compared the performance with Conditional Random Fields (CRF) and Latent Dynamic-CRF-based approaches. The experiments show more than 40 percent improvement over CRF or LDCRF approaches in terms of the frame labeling rate. We show the flexibility of our approach when handling a changing context. We also find a 70 percent improvement in sign recognition rate over the unenhanced DP matching algorithm that does not accommodate the me effect.
Directory of Open Access Journals (Sweden)
Amal F Soliman
2016-01-01
Conclusion Twelve weeks of intensive dynamic exercise program should be recommended to patients with FM as it was effective in decreasing the oxidative stress parameters, increasing the antioxidant parameters, and improving the clinical outcome of this disease.
MyDTW - Dynamic Time Warping program for stratigraphical time series
Kotov, Sergey; Paelike, Heiko
2017-04-01
One of the general tasks in many geological disciplines is matching of one time or space signal to another. It can be classical correlation between two cores or cross-sections in sedimentology or marine geology. For example, tuning a paleoclimatic signal to a target curve, driven by variations in the astronomical parameters, is a powerful technique to construct accurate time scales. However, these methods can be rather time-consuming and can take ours of routine work even with the help of special semi-automatic software. Therefore, different approaches to automate the processes have been developed during last decades. Some of them are based on classical statistical cross-correlations such as the 'Correlator' after Olea [1]. Another ones use modern ideas of dynamic programming. A good example is as an algorithm developed by Lisiecki and Lisiecki [2] or dynamic time warping based algorithm after Pälike [3]. We introduce here an algorithm and computer program, which are also stemmed from the Dynamic Time Warping algorithm class. Unlike the algorithm of Lisiecki and Lisiecki, MyDTW does not lean on a set of penalties to follow geological logics, but on a special internal structure and specific constrains. It differs also from [3] in basic ideas of implementation and constrains design. The algorithm is implemented as a computer program with a graphical user interface using Free Pascal and Lazarus IDE and available for Windows, Mac OS, and Linux. Examples with synthetic and real data are demonstrated. Program is available for free download at http://www.marum.de/Sergey_Kotov.html . References: 1. Olea, R.A. Expert systems for automated correlation and interpretation of wireline logs // Math Geol (1994) 26: 879. doi:10.1007/BF02083420 2. Lisiecki L. and Lisiecki P. Application of dynamic programming to the correlation of paleoclimate records // Paleoceanography (2002), Volume 17, Issue 4, pp. 1-1, CiteID 1049, doi: 10.1029/2001PA000733 3. Pälike, H. Extending the
Liu, Derong; Huang, Yuzhu; Wang, Ding; Wei, Qinglai
2013-09-01
In this paper, an observer-based optimal control scheme is developed for unknown nonlinear systems using adaptive dynamic programming (ADP) algorithm. First, a neural-network (NN) observer is designed to estimate system states. Then, based on the observed states, a neuro-controller is constructed via ADP method to obtain the optimal control. In this design, two NN structures are used: a three-layer NN is used to construct the observer which can be applied to systems with higher degrees of nonlinearity and without a priori knowledge of system dynamics, and a critic NN is employed to approximate the value function. The optimal control law is computed using the critic NN and the observer NN. Uniform ultimate boundedness of the closed-loop system is guaranteed. The actor, critic, and observer structures are all implemented in real-time, continuously and simultaneously. Finally, simulation results are presented to demonstrate the effectiveness of the proposed control scheme.
Aziz, Jonathan D.; Parker, Jeffrey S.; Scheeres, Daniel J.; Englander, Jacob A.
2018-01-01
Low-thrust trajectories about planetary bodies characteristically span a high count of orbital revolutions. Directing the thrust vector over many revolutions presents a challenging optimization problem for any conventional strategy. This paper demonstrates the tractability of low-thrust trajectory optimization about planetary bodies by applying a Sundman transformation to change the independent variable of the spacecraft equations of motion to an orbit angle and performing the optimization with differential dynamic programming. Fuel-optimal geocentric transfers are computed with the transfer duration extended up to 2000 revolutions. The flexibility of the approach to higher fidelity dynamics is shown with Earth's J 2 perturbation and lunar gravity included for a 500 revolution transfer.
A Dynamic Programming Approach for Pricing Weather Derivatives under Issuer Default Risk
Directory of Open Access Journals (Sweden)
Wolfgang Karl Härdle
2017-10-01
Full Text Available Weather derivatives are contingent claims with payoff based on a pre-specified weather index. Firms exposed to weather risk can transfer it to financial markets via weather derivatives. We develop a utility-based model for pricing baskets of weather derivatives under default risk on the issuer side in over-the-counter markets. In our model, agents maximise the expected utility of their terminal wealth, while they dynamically rebalance their weather portfolios over a finite investment horizon. Using dynamic programming approach, we obtain semi-closed forms for the equilibrium prices of weather derivatives and for the optimal strategies of the agents. We give an example on how to price rainfall derivatives on selected stations in China in the universe of a financial investor and a weather exposed crop insurer.
Avoiding tipping points in fisheries management through Gaussian process dynamic programming.
Boettiger, Carl; Mangel, Marc; Munch, Stephan
2015-02-22
Model uncertainty and limited data are fundamental challenges to robust management of human intervention in a natural system. These challenges are acutely highlighted by concerns that many ecological systems may contain tipping points, such as Allee population sizes. Before a collapse, we do not know where the tipping points lie, if they exist at all. Hence, we know neither a complete model of the system dynamics nor do we have access to data in some large region of state space where such a tipping point might exist. We illustrate how a Bayesian non-parametric approach using a Gaussian process (GP) prior provides a flexible representation of this inherent uncertainty. We embed GPs in a stochastic dynamic programming framework in order to make robust management predictions with both model uncertainty and limited data. We use simulations to evaluate this approach as compared with the standard approach of using model selection to choose from a set of candidate models. We find that model selection erroneously favours models without tipping points, leading to harvest policies that guarantee extinction. The Gaussian process dynamic programming (GPDP) performs nearly as well as the true model and significantly outperforms standard approaches. We illustrate this using examples of simulated single-species dynamics, where the standard model selection approach should be most effective and find that it still fails to account for uncertainty appropriately and leads to population crashes, while management based on the GPDP does not, as it does not underestimate the uncertainty outside of the observed data. © 2015 The Author(s) Published by the Royal Society. All rights reserved.
Lu, Z.; Porporato, A. M.
2012-12-01
seasonally dry areas, which are widely distributed in the world, are usually facing an intensive disparity between the lack of natural resource and the great demand of social development. In dry seasons of such areas, the distribution/allocation of water resource is an extremely critical and sensitive issue, and conflicts often occur due to lack of appropriate water allocation scheme. Among the many uses of water, the need of agricultural irrigation water is highly elastic, but this factor has not yet been made full use to free up water from agriculture use. The primary goal of this work is to design an optimal distribution scheme of water resource for dry seasons to maximize benefits from precious water resources, considering the high elasticity of agriculture water demand due to the dynamic of soil moisture affected by the uncertainty of precipitation and other factors like canopy interception. A dynamic programming model will be used to figure out an appropriate allocation of water resources among agricultural irrigation and other purposes like drinking water, industry, and hydropower, etc. In this dynamic programming model, we analytically quantify the dynamic of soil moisture in the agricultural fields by describing the interception with marked Poisson process and describing the rainfall depth with exponential distribution. Then, we figure out a water-saving irrigation scheme, which regulates the timetable and volumes of water in irrigation, in order to minimize irrigation water requirement under the premise of necessary crop yield (as a constraint condition). And then, in turn, we provide a scheme of water resource distribution/allocation among agriculture and other purposes, taking aim at maximizing benefits from precious water resources, or in other words, make best use of limited water resource.
Improved dynamic-programming-based algorithms for segmentation of masses in mammograms.
Rojas Domínguez, Alfonso; Nandi, Asoke K
2007-11-01
In this paper, two new boundary tracing algorithms for segmentation of breast masses are presented. These new algorithms are based on the dynamic programming-based boundary tracing (DPBT) algorithm proposed in Timp and Karssemeijer, [S. Timp and N. Karssemeijer, Med. Phys. 31, 958-971 (2004)] The DPBT algorithm contains two main steps: (1) construction of a local cost function, and (2) application of dynamic programming to the selection of the optimal boundary based on the local cost function. The validity of some assumptions used in the design of the DPBT algorithm is tested in this paper using a set of 349 mammographic images. Based on the results of the tests, modifications to the computation of the local cost function have been designed and have resulted in the Improved-DPBT (IDPBT) algorithm. A procedure for the dynamic selection of the strength of the components of the local cost function is presented that makes these parameters independent of the image dataset. Incorporation of this dynamic selection procedure has produced another new algorithm which we have called ID2PBT. Methods for the determination of some other parameters of the DPBT algorithm that were not covered in the original paper are presented as well. The merits of the new IDPBT and ID2PBT algorithms are demonstrated experimentally by comparison against the DPBT algorithm. The segmentation results are evaluated with base on the area overlap measure and other segmentation metrics. Both of the new algorithms outperform the original DPBT; the improvements in the algorithms performance are more noticeable around the values of the segmentation metrics corresponding to the highest segmentation accuracy, i.e., the new algorithms produce more optimally segmented regions, rather than a pronounced increase in the average quality of all the segmented regions.
Aziz, Jonathan D.; Parker, Jeffrey S.; Scheeres, Daniel J.; Englander, Jacob A.
2017-01-01
Low-thrust trajectories about planetary bodies characteristically span a high count of orbital revolutions. Directing the thrust vector over many revolutions presents a challenging optimization problem for any conventional strategy. This paper demonstrates the tractability of low-thrust trajectory optimization about planetary bodies by applying a Sundman transformation to change the independent variable of the spacecraft equations of motion to the eccentric anomaly and performing the optimization with differential dynamic programming. Fuel-optimal geocentric transfers are shown in excess of 1000 revolutions while subject to Earths J2 perturbation and lunar gravity.
Stochastic Optimization of Economic Dispatch for Microgrid Based on Approximate Dynamic Programming
DEFF Research Database (Denmark)
Shuai, Hang; Fang, Jiakun; Ai, Xiaomeng
2018-01-01
This paper proposes an approximate dynamic programming (ADP) based approach for the economic dispatch (ED) of microgrid with distributed generations (DGs). The time-variant renewable generation, electricity price and the power demand are considered as stochastic variables in this work. An ADP based...... of historical prediction error distribution to reduce the influence of inaccurate forecast on the system operation. Numerical simulations demonstrate the effectiveness of the proposed approach. The near-optimal decision obtained by ADPED is very close to the global optimality. And it can be adaptive to both day...
Optimization and analysis of decision trees and rules: Dynamic programming approach
Alkhalid, Abdulaziz
2013-08-01
This paper is devoted to the consideration of software system Dagger created in KAUST. This system is based on extensions of dynamic programming. It allows sequential optimization of decision trees and rules relative to different cost functions, derivation of relationships between two cost functions (in particular, between number of misclassifications and depth of decision trees), and between cost and uncertainty of decision trees. We describe features of Dagger and consider examples of this systems work on decision tables from UCI Machine Learning Repository. We also use Dagger to compare 16 different greedy algorithms for decision tree construction. © 2013 Taylor and Francis Group, LLC.
Optimization and analysis of decision trees and rules: dynamic programming approach
Alkhalid, Abdulaziz; Amin, Talha; Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail; Zielosko, Beata
2013-08-01
This paper is devoted to the consideration of software system Dagger created in KAUST. This system is based on extensions of dynamic programming. It allows sequential optimization of decision trees and rules relative to different cost functions, derivation of relationships between two cost functions (in particular, between number of misclassifications and depth of decision trees), and between cost and uncertainty of decision trees. We describe features of Dagger and consider examples of this system's work on decision tables from UCI Machine Learning Repository. We also use Dagger to compare 16 different greedy algorithms for decision tree construction.
The Optimal Operation of Haditha Reservoir by Discrete Differential Dynamic Programming (DDDP
Directory of Open Access Journals (Sweden)
Nesrin J. AL-Mansori
2017-07-01
Full Text Available The aim of the present research is to find the best optimal policy for monthly operation of Haditha Reservoir for 24 years ( from 1990 to 2014 in order to minimize the total penalties taken place due to both releases and storage when exceeded the limited allowable values by using Discrete Differential Dynamic Programming (DDDP. The results of this study used to find a suitable probability distribution of the values of storage. The log normal distribution for three parameters was found to be the best distribution for determination the operation curves values
Bellman, Richard
2015-01-01
Rapid advances in the physical and biological sciences and in related technologies have brought about equally farreaching changes in mathematical research. Focusing on control theory, invariant imbedding, dynamic programming, and quasilinearization, Mr. Bellman explores with ease and clarity the mathematical research problems arising from scientific questions in engineering, physics, biology, and medicine. Special attention is paid in these essays to the use of the digital computer in obtaining the numerical solution of numerical problems, its influence in the formulation of new and old scient
Testing Object-Oriented Programs using Dynamic Aspects and Non-Determinism
DEFF Research Database (Denmark)
Achenbach, Michael; Ostermann, Klaus
2010-01-01
The implementation of unit tests with mock objects and stubs often involves substantial manual work. Stubbed methods return simple default values, therefore variations of these values require separate test cases. The integration of mock objects often requires more infrastructure code and design...... decisions exposing private data. We present an approach that both improves the expressiveness of test cases using non-deterministic choice and reduces design modifications using dynamic aspect-oriented programming techniques. Non-deterministic choice facilitates local definitions of multiple executions...
Heckman, James J; Raut, Lakshmi K
2016-03-01
This paper formulates a structural dynamic programming model of preschool investment choices of altruistic parents and then empirically estimates the structural parameters of the model using the NLSY79 data. The paper finds that preschool investment significantly boosts cognitive and non-cognitive skills, which enhance earnings and school outcomes. It also finds that a standard Mincer earnings function, by omitting measures of non-cognitive skills on the right-hand side, overestimates the rate of return to schooling. From the estimated equilibrium Markov process, the paper studies the nature of within generation earnings distribution, intergenerational earnings mobility, and schooling mobility. The paper finds that a tax-financed free preschool program for the children of poor socioeconomic status generates positive net gains to the society in terms of average earnings, higher intergenerational earnings mobility, and schooling mobility.
Human dynamics of spending: Longitudinal study of a coalition loyalty program
Yi, Il Gu; Jeong, Hyang Min; Choi, Woosuk; Jang, Seungkwon; Lee, Heejin; Kim, Beom Jun
2014-09-01
Large-scale data of a coalition loyalty program is analyzed in terms of the temporal dynamics of customers' behaviors. We report that the two main activities of a loyalty program, earning and redemption of points, exhibit very different behaviors. It is also found that as customers become older from their early 20's, both male and female customers increase their earning and redemption activities until they arrive at the turning points, beyond which both activities decrease. The positions of turning points as well as the maximum earned and redeemed points are found to differ for males and females. On top of these temporal behaviors, we identify that there exists a learning effect and customers learn how to earn and redeem points as their experiences accumulate in time.
MacGillivray, Laurie; Goode, Gretchen S.
2016-01-01
Researchers of after-school tutoring primarily focus on educational outcomes with little attention to the social dynamics of such programs. In our qualitative case study, we examined the nature of interactions among tutors in a tutoring program at a homeless shelter for families. Employing Bourdieu's concepts of "social capital" and…
Addressing gender dynamics and engaging men in HIV programs: lessons learned from Horizons research.
Pulerwitz, Julie; Michaelis, Annie; Verma, Ravi; Weiss, Ellen
2010-01-01
In the field of human immunodeficiency virus (HIV) prevention, there has been increasing interest in the role that gender plays in HIV and violence risk, and in successfully engaging men in the response. This article highlights findings from more than 10 studies in Asia, Africa, and Latin America--conducted from 1997 through 2007 as part of the Horizons program--that have contributed to understanding the relationship between gender and men's behaviors, developing useful measurement tools for gender norms, and designing and evaluating the impact of gender-focused program strategies. Studies showed significant associations between support for inequitable norms and risk, such as more partner violence and less condom use. Programmatic lessons learned ranged from insights into appropriate media messages, to strategies to engage men in critically reflecting upon gender inequality, to the qualities of successful program facilitators. The portfolio of work reveals the potential and importance of directly addressing gender dynamics in HIV- and violence-prevention programs for both men and women.
Yuan, Qiao; Zhuo, Chen; Yonggui, Ma; Fuer, Lu; Suhua, Chen; Guangying, Huang
2013-01-01
Background: The most frequently used spermicide Nonoxynol-9 (N-9) in the clinic alters the vaginal flora, which will result in an increased risk of opportunistic infection. So development of a novel spermicidal and microbicidal drug appears to be inevitable. Vaginal local immune is an important part of vaginal flora. Secretory leukocyte protease inhibitor (SLPI), surfactant proteins D (SP-D), and lactoferrin (LF) are anti-microbial molecules with important roles in immune system of female vaginas. Objective: To observe effect of a vaginal spermicide nonoxynol-9 (N-9) berberine plural gel on the expression of SLPI SP-D and LF in mice’s vaginas. Materials and Methods : Female BABL/C mice were randomly divided into following 5 groups: normal control group, blank gel group, berberine gel group, 12% N-9 gel group and N-9 berberine plural gel group. Estradiol benzoate at physiological dose was done by hypodermic injection to every group’s mice. After 72h, drug gels were separately injected into the mice’s vaginas, while immunohistochemistry and Western blot were taken to detect the expression of the 3 indexes in mice’s vaginas respectively after 24h and 72h of gel injection. Results: The differences in the three indexes between normal control group and blank gel group were not significant statistically (p>0.05). The expression of the three indexes in 12% N-9 gel group was decreased compared to that in blank gel group (p0.05). Also, the three index's level of 24h and 72h in sub observation groups after treatment were without statistical significance (p>0.05). Conclusion: Application of N-9 berberine plural gel had little impact on antimicrobial peptides in normal mice’s vaginas. PMID:24639792
Directory of Open Access Journals (Sweden)
Huang Guangying
2013-01-01
Full Text Available Background: The most frequently used spermicide Nonoxynol-9 (N-9 in the clinic alters the vaginal flora, which will result in an increased risk of opportunistic infection. So development of a novel spermicidal and microbicidal drug appears to be inevitable. Vaginal local immune is an important part of vaginal flora. Secretory leukocyte protease inhibitor (SLPI, surfactant proteins D (SP-D, and lactoferrin (LF are anti-microbial molecules with important roles in immune system of female vaginas. Objective: To observe effect of a vaginal spermicide nonoxynol-9 (N-9 berberine plural gel on the expression of SLPI SP-D and LF in mice’s vaginas. Materials and Methods: Female BABL/C mice were randomly divided into following 5 groups: normal control group, blank gel group, berberine gel group, 12% N-9 gel group and N-9 berberine plural gel group. Estradiol benzoate at physiological dose was done by hypodermic injection to every group’s mice. After 72h, drug gels were separately injected into the mice’s vaginas, while immunohistochemistry and Western blot were taken to detect the expression of the 3 indexes in mice’s vaginas respectively after 24h and 72h of gel injection. Results: The differences in the three indexes between normal control group and blank gel group were not significant statistically (p>0.05. The expression of the three indexes in 12% N-9 gel group was decreased compared to that in blank gel group (p0.05. Also, the three index's level of 24h and 72h in sub observation groups after treatment were without statistical significance (p>0.05. Conclusion: Application of N-9 berberine plural gel had little impact on antimicrobial peptides in normal mice’s vaginas.
Khan, Mohammad Ibrahim; Kamal, Md Sarwar
2015-03-01
Markov Chain is very effective in prediction basically in long data set. In DNA sequencing it is always very important to find the existence of certain nucleotides based on the previous history of the data set. We imposed the Chapman Kolmogorov equation to accomplish the task of Markov Chain. Chapman Kolmogorov equation is the key to help the address the proper places of the DNA chain and this is very powerful tools in mathematics as well as in any other prediction based research. It incorporates the score of DNA sequences calculated by various techniques. Our research utilize the fundamentals of Warshall Algorithm (WA) and Dynamic Programming (DP) to measures the score of DNA segments. The outcomes of the experiment are that Warshall Algorithm is good for small DNA sequences on the other hand Dynamic Programming are good for long DNA sequences. On the top of above findings, it is very important to measure the risk factors of local sequencing during the matching of local sequence alignments whatever the length.
Directory of Open Access Journals (Sweden)
Cheng-Hong Yang
2009-04-01
Full Text Available Single nucleotide polymorphisms (SNPs play an important role in personalized medicine. However, the SNP data reported in many association studies provide only the SNP nucleotide/amino acid position, without providing the SNP ID recorded in National Center for Biotechnology Information databases. A tool with the ability to provide SNP ID identification, with a user-friendly interface, is needed. In this paper, a dynamic programming algorithm was used to compare homologs when the processed input sequence is aligned with the SNP FASTA database. Our novel system provides a web-based tool that uses the National Center for Biotechnology Information dbSNP database, which provides SNP sequence identification and SNP FASTA formats. Freely selectable sequence formats for alignment can be used, including general sequence formats (ACGT, [dNTP1/dNTP2] or IUPAC formats and orientation with bidirectional sequence matching. In contrast to the National Center for Biotechnology Information SNP-BLAST, the proposed system always provides the correct targeted SNP ID (SNP hit, as well as nearby SNPs (flanking hits, arranged in their chromosomal order and contig positions. The system also solves problems inherent in SNP-BLAST, which cannot always provide the correct SNP ID for a given input sequence. Therefore, this system constitutes a novel application which uses dynamic programming to identify SNP IDs from the literature and keyed-in sequences for systematic association studies. It is freely available at http://bio.kuas.edu.tw/SNPosition/.
Yang, Cheng-Hong; Chuang, Li-Yeh; Cheng, Yu-Huei; Wen, Cheng-Hao; Chang, Hsueh-Wei
2009-04-01
Single nucleotide polymorphisms (SNPs) play an important role in personalized medicine. However, the SNP data reported in many association studies provide only the SNP nucleotide/amino acid position, without providing the SNP ID recorded in National Center for Biotechnology Information databases. A tool with the ability to provide SNP ID identification, with a user-friendly interface, is needed. In this paper, a dynamic programming algorithm was used to compare homologs when the processed input sequence is aligned with the SNP FASTA database. Our novel system provides a web-based tool that uses the National Center for Biotechnology Information dbSNP database, which provides SNP sequence identification and SNP FASTA formats. Freely selectable sequence formats for alignment can be used, including general sequence formats (ACGT, [dNTP1/dNTP2] or IUPAC formats) and orientation with bidirectional sequence matching. In contrast to the National Center for Biotechnology Information SNP-BLAST, the proposed system always provides the correct targeted SNP ID (SNP hit), as well as nearby SNPs (flanking hits), arranged in their chromosomal order and contig positions. The system also solves problems inherent in SNP-BLAST, which cannot always provide the correct SNP ID for a given input sequence. Therefore, this system constitutes a novel application which uses dynamic programming to identify SNP IDs from the literature and keyed-in sequences for systematic association studies. It is freely available at http://bio.kuas.edu.tw/SNPosition/.
Energy Technology Data Exchange (ETDEWEB)
Takasugi, Noriyuki; Taniuchi, Takuya; Fukuda, Yutaka; Ito, Reiji; Kawakami, Hajime; Yoshikawa, Takao
1987-08-20
Nowadays, the development of the tethered type deep-sea ROV system using optical communication techniques, automated control techniques and robotics has been conducted and it is becoming possible to do safe and comparatively inexpensive investigations. However, since it constitutes problems that the power and light cables which hang an unmanned submarine (vehicle) receive the fluid dynamic actions and that due to the above effect, and the free movements of a mother ship and the vehicle are restricted, the technique of analyzing these behaviors is indispensable for the design of the vehicle system. Kawasaki Heavy Industries developed a program which can analyze in the time domain by the finite element method the three dimensional behaviors of the system in which mothership, tethering cable, launcher and vehicle are deemed to be an entirety and the tension of the tethering cables, etc. This article introduces this program. Thanks for this, the simulation of dynamic behavior of the above system and the simulation of total deep-sea operation supporting system have become feasible. (11 figs, 1 tab, 2 refs)
Jiang, Luan; Ling, Shan; Li, Qiang
2016-03-01
Cardiovascular diseases are becoming a leading cause of death all over the world. The cardiac function could be evaluated by global and regional parameters of left ventricle (LV) of the heart. The purpose of this study is to develop and evaluate a fully automated scheme for segmentation of LV in short axis cardiac cine MR images. Our fully automated method consists of three major steps, i.e., LV localization, LV segmentation at end-diastolic phase, and LV segmentation propagation to the other phases. First, the maximum intensity projection image along the time phases of the midventricular slice, located at the center of the image, was calculated to locate the region of interest of LV. Based on the mean intensity of the roughly segmented blood pool in the midventricular slice at each phase, end-diastolic (ED) and end-systolic (ES) phases were determined. Second, the endocardial and epicardial boundaries of LV of each slice at ED phase were synchronously delineated by use of a dual dynamic programming technique. The external costs of the endocardial and epicardial boundaries were defined with the gradient values obtained from the original and enhanced images, respectively. Finally, with the advantages of the continuity of the boundaries of LV across adjacent phases, we propagated the LV segmentation from the ED phase to the other phases by use of dual dynamic programming technique. The preliminary results on 9 clinical cardiac cine MR cases show that the proposed method can obtain accurate segmentation of LV based on subjective evaluation.
Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing
Ono, Masahiro; Kuwata, Yoshiaki
2013-01-01
A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach.
Boundary Control of Linear Uncertain 1-D Parabolic PDE Using Approximate Dynamic Programming.
Talaei, Behzad; Jagannathan, Sarangapani; Singler, John
2017-03-02
This paper develops a near optimal boundary control method for distributed parameter systems governed by uncertain linear 1-D parabolic partial differential equations (PDE) by using approximate dynamic programming. A quadratic surface integral is proposed to express the optimal cost functional for the infinite-dimensional state space. Accordingly, the Hamilton-Jacobi-Bellman (HJB) equation is formulated in the infinite-dimensional domain without using any model reduction. Subsequently, a neural network identifier is developed to estimate the unknown spatially varying coefficient in PDE dynamics. Novel tuning law is proposed to guarantee the boundedness of identifier approximation error in the PDE domain. A radial basis network (RBN) is subsequently proposed to generate an approximate solution for the optimal surface kernel function online. The tuning law for near optimal RBN weights is created, such that the HJB equation error is minimized while the dynamics are identified and closed-loop system remains stable. Ultimate boundedness (UB) of the closed-loop system is verified by using the Lyapunov theory. The performance of the proposed controller is successfully confirmed by simulation on an unstable diffusion-reaction process.
Lu, Zhao; Sun, Jing; Butts, Kenneth
2014-05-01
Support vector regression for approximating nonlinear dynamic systems is more delicate than the approximation of indicator functions in support vector classification, particularly for systems that involve multitudes of time scales in their sampled data. The kernel used for support vector learning determines the class of functions from which a support vector machine can draw its solution, and the choice of kernel significantly influences the performance of a support vector machine. In this paper, to bridge the gap between wavelet multiresolution analysis and kernel learning, the closed-form orthogonal wavelet is exploited to construct new multiscale asymmetric orthogonal wavelet kernels for linear programming support vector learning. The closed-form multiscale orthogonal wavelet kernel provides a systematic framework to implement multiscale kernel learning via dyadic dilations and also enables us to represent complex nonlinear dynamics effectively. To demonstrate the superiority of the proposed multiscale wavelet kernel in identifying complex nonlinear dynamic systems, two case studies are presented that aim at building parallel models on benchmark datasets. The development of parallel models that address the long-term/mid-term prediction issue is more intricate and challenging than the identification of series-parallel models where only one-step ahead prediction is required. Simulation results illustrate the effectiveness of the proposed multiscale kernel learning.
The Configuration Of Supply Chain Agritourism To Improve The Performance With Dynamic Programming
Directory of Open Access Journals (Sweden)
Sahnaz Ubud
2015-09-01
Full Text Available The purposes of this research is to implementation about the configuration of Supply Chain Agritourism in Mekarsari Tours Garden and result a decision making which must be done by top level management about their supply chain configuration. Because now Mekarsari, the biggest fruit garden in the world, have a lot of type of fruit which must be supply for the customer depend on the season with on time. So Mekarsari must know about their configuration from supplier to customer to improve their performance. The Respondents for this research is selected based on the results of supply chain maping from the worker in the garden, the top level management until the end customer. Supply chian network is formed consisting of farm workers to the end customers, especially those located in the tourist are of green land zone. The type of data is displayed in a supply chain modeling approach is to use the dynamic system. It’s consists of numeric data, the written data and mental models. That data is collected and processed into a design model. The design model is using system dynamics methodology. In compiling the system dynamics model has been used software Vensim Professional Academic Ventana 5.7. The result of this research is a configuration of Supply Chain Agritourism which is developed from the supplier until the end customer in Mekarsari tours Garden. From the Dynamic Programming, the result is a decision making which must be done by the top level management to improve the supply chain performance, especially in the green land zone.
Programming chemical kinetics: engineering dynamic reaction networks with DNA strand displacement
Srinivas, Niranjan
Over the last century, the silicon revolution has enabled us to build faster, smaller and more sophisticated computers. Today, these computers control phones, cars, satellites, assembly lines, and other electromechanical devices. Just as electrical wiring controls electromechanical devices, living organisms employ "chemical wiring" to make decisions about their environment and control physical processes. Currently, the big difference between these two substrates is that while we have the abstractions, design principles, verification and fabrication techniques in place for programming with silicon, we have no comparable understanding or expertise for programming chemistry. In this thesis we take a small step towards the goal of learning how to systematically engineer prescribed non-equilibrium dynamical behaviors in chemical systems. We use the formalism of chemical reaction networks (CRNs), combined with mass-action kinetics, as our programming language for specifying dynamical behaviors. Leveraging the tools of nucleic acid nanotechnology (introduced in Chapter 1), we employ synthetic DNA molecules as our molecular architecture and toehold-mediated DNA strand displacement as our reaction primitive. Abstraction, modular design and systematic fabrication can work only with well-understood and quantitatively characterized tools. Therefore, we embark on a detailed study of the "device physics" of DNA strand displacement (Chapter 2). We present a unified view of strand displacement biophysics and kinetics by studying the process at multiple levels of detail, using an intuitive model of a random walk on a 1-dimensional energy landscape, a secondary structure kinetics model with single base-pair steps, and a coarse-grained molecular model that incorporates three-dimensional geometric and steric effects. Further, we experimentally investigate the thermodynamics of three-way branch migration. Our findings are consistent with previously measured or inferred rates for
Pugacheva, Valentina; Korotkov, Alexander; Korotkov, Eugene
2016-10-01
The aim of this study was to show that amino acid sequences have a latent periodicity with insertions and deletions of amino acids in unknown positions of the analyzed sequence. Genetic algorithm, dynamic programming and random weight matrices were used to develop a new mathematical algorithm for latent periodicity search. A multiple alignment of periods was calculated with help of the direct optimization of the position-weight matrix without using pairwise alignments. The developed algorithm was applied to analyze amino acid sequences of a small number of proteins. This study showed the presence of latent periodicity with insertions and deletions in the amino acid sequences of such proteins, for which the presence of latent periodicity was not previously known. The origin of latent periodicity with insertions and deletions is discussed.
Stochastic optimal control in infinite dimension dynamic programming and HJB equations
Fabbri, Giorgio; Święch, Andrzej
2017-01-01
Providing an introduction to stochastic optimal control in infinite dimension, this book gives a complete account of the theory of second-order HJB equations in infinite-dimensional Hilbert spaces, focusing on its applicability to associated stochastic optimal control problems. It features a general introduction to optimal stochastic control, including basic results (e.g. the dynamic programming principle) with proofs, and provides examples of applications. A complete and up-to-date exposition of the existing theory of viscosity solutions and regular solutions of second-order HJB equations in Hilbert spaces is given, together with an extensive survey of other methods, with a full bibliography. In particular, Chapter 6, written by M. Fuhrman and G. Tessitore, surveys the theory of regular solutions of HJB equations arising in infinite-dimensional stochastic control, via BSDEs. The book is of interest to both pure and applied researchers working in the control theory of stochastic PDEs, and in PDEs in infinite ...
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
DEFF Research Database (Denmark)
Rauff Lind Christensen, Tue; Klose, Andreas; Andersen, Kim Allan
The Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem (SSFCMCTP) is a problem with versatile applications. This problem is a generalization of the Single-Sink, Fixed-Charge Transportation Problem (SSFCTP), which has a fixed-charge, linear cost structure. However, in at least two...... important aspects of supplier selection, an important application of the SSFCTP, this does not reflect the real life situation. First, transportation costs faced by many companies are in fact piecewise linear. Secondly, when suppliers offer discounts, either incremental or all-unit discounts, such savings...... are neglected in the SSFCTP. The SSFCMCTP overcome this problem by incorporating a staircase cost structure in the cost function instead of the usual one used in SSFCTP. We present a dynamic programming algorithm for the resulting problem. To enhance the performance of the generic algorithm a number...
Gosavi, Abhijit
2014-08-01
In control systems theory, the Markov decision process (MDP) is a widely used optimization model involving selection of the optimal action in each state visited by a discrete-event system driven by Markov chains. The classical MDP model is suitable for an agent/decision-maker interested in maximizing expected revenues, but does not account for minimizing variability in the revenues. An MDP model in which the agent can maximize the revenues while simultaneously controlling the variance in the revenues is proposed. This work is rooted in machine learning/neural network concepts, where updating is based on system feedback and step sizes. First, a Bellman equation for the problem is proposed. Thereafter, convergent dynamic programming and reinforcement learning techniques for solving the MDP are provided along with encouraging numerical results on a small MDP and a preventive maintenance problem.
Approximating high-dimensional dynamics by barycentric coordinates with linear programming.
Hirata, Yoshito; Shiro, Masanori; Takahashi, Nozomu; Aihara, Kazuyuki; Suzuki, Hideyuki; Mas, Paloma
2015-01-01
The increasing development of novel methods and techniques facilitates the measurement of high-dimensional time series but challenges our ability for accurate modeling and predictions. The use of a general mathematical model requires the inclusion of many parameters, which are difficult to be fitted for relatively short high-dimensional time series observed. Here, we propose a novel method to accurately model a high-dimensional time series. Our method extends the barycentric coordinates to high-dimensional phase space by employing linear programming, and allowing the approximation errors explicitly. The extension helps to produce free-running time-series predictions that preserve typical topological, dynamical, and/or geometric characteristics of the underlying attractors more accurately than the radial basis function model that is widely used. The method can be broadly applied, from helping to improve weather forecasting, to creating electronic instruments that sound more natural, and to comprehensively understanding complex biological data.
DEFF Research Database (Denmark)
Davidsen, Claus; Liu, Suxia; Mo, Xingguo
2015-01-01
Few studies address water quality in hydro-economic models, which often focus primarily on optimal allocation of water quantities. Water quality and water quantity are closely coupled, and optimal management with focus solely on either quantity or quality may cause large costs in terms of the oth......-er component. In this study, we couple water quality and water quantity in a joint hydro-economic catchment-scale optimization problem. Stochastic dynamic programming (SDP) is used to minimize the basin-wide total costs arising from water allocation, water curtailment and water treatment. The simple water......-economic optimiza-tion model can be used to assess costs of meeting additional constraints such as minimum water qual-ity or to economically prioritize investments in waste water treatment facilities based on economic criteria....
Optimal Control of Complex Systems Based on Improved Dual Heuristic Dynamic Programming Algorithm
Directory of Open Access Journals (Sweden)
Hui Li
2017-01-01
Full Text Available When applied to solving the data modeling and optimal control problems of complex systems, the dual heuristic dynamic programming (DHP technique, which is based on the BP neural network algorithm (BP-DHP, has difficulty in prediction accuracy, slow convergence speed, poor stability, and so forth. In this paper, a dual DHP technique based on Extreme Learning Machine (ELM algorithm (ELM-DHP was proposed. Through constructing three kinds of network structures, the paper gives the detailed realization process of the DHP technique in the ELM. The controller designed upon the ELM-DHP algorithm controlled a molecular distillation system with complex features, such as multivariability, strong coupling, and nonlinearity. Finally, the effectiveness of the algorithm is verified by the simulation that compares DHP and HDP algorithms based on ELM and BP neural network. The algorithm can also be applied to solve the data modeling and optimal control problems of similar complex systems.
Variable Displacement Control of the Concrete Pumping System Based on Dynamic Programming
Directory of Open Access Journals (Sweden)
Ye Min
2017-01-01
Full Text Available To solve the problems of cylinder piston striking cylinder and the hydraulic shocking of the main pump, and causing energy waste problem, the method of variable displacement control of piston stroke was proposed. In order to achieve effective control of the piston stroke, variable displacement control model was established under the physical constraint condition of non-collision between piston and cylinder. And the control process was realized by Dynamic Programming(DP, the simulation and test results show that piston of concrete pumping system don’t strike cylinder and reduce the hydraulic shock of the main pump outlet, meanwhile improve the response speed of the cylinder and achieve energy-saving purposes under varying loads. This control model built in the integration design space of structure variable and control variable is of guiding significance for solving open-loop system’s engineering problems.
Dynamic Programming Optimization of Multi-rate Multicast Video-Streaming Services
Directory of Open Access Journals (Sweden)
Nestor Michael Caños Tiglao
2010-06-01
Full Text Available In large scale IP Television (IPTV and Mobile TV distributions, the video signal is typically encoded and transmitted using several quality streams, over IP Multicast channels, to several groups of receivers, which are classified in terms of their reception rate. As the number of video streams is usually constrained by both the number of TV channels and the maximum capacity of the content distribution network, it is necessary to find the selection of video stream transmission rates that maximizes the overall user satisfaction. In order to efficiently solve this problem, this paper proposes the Dynamic Programming Multi-rate Optimization (DPMO algorithm. The latter was comparatively evaluated considering several user distributions, featuring different access rate patterns. The experimental results reveal that DPMO is significantly more efficient than exhaustive search, while presenting slightly higher execution times than the non-optimal Multi-rate Step Search (MSS algorithm.
Directory of Open Access Journals (Sweden)
Zongyuan Huang
2010-01-01
Full Text Available This paper is concerned with a kind of corporate international optimal portfolio and consumption choice problems, in which the investor can invest her or his wealth either in a domestic bond (bank account or in an oversea real project with production. The bank pays a lower interest rate for deposit and takes a higher rate for any loan. First, we show that Bellman's dynamic programming principle still holds in our setting; second, in terms of the foregoing principle, we obtain the investor's optimal portfolio proportion for a general maximizing expected utility problem and give the corresponding economic analysis; third, for the special but nontrivial Constant Relative Risk Aversion (CRRA case, we get the investors optimal investment and consumption solution; last but not least, we give some numerical simulation results to illustrate the influence of volatility parameters on the optimal investment strategy.
Policy Gradient Adaptive Dynamic Programming for Data-Based Optimal Control.
Luo, Biao; Liu, Derong; Wu, Huai-Ning; Wang, Ding; Lewis, Frank L
2017-10-01
The model-free optimal control problem of general discrete-time nonlinear systems is considered in this paper, and a data-based policy gradient adaptive dynamic programming (PGADP) algorithm is developed to design an adaptive optimal controller method. By using offline and online data rather than the mathematical system model, the PGADP algorithm improves control policy with a gradient descent scheme. The convergence of the PGADP algorithm is proved by demonstrating that the constructed Q -function sequence converges to the optimal Q -function. Based on the PGADP algorithm, the adaptive control method is developed with an actor-critic structure and the method of weighted residuals. Its convergence properties are analyzed, where the approximate Q -function converges to its optimum. Computer simulation results demonstrate the effectiveness of the PGADP-based adaptive control method.
Detection and Extraction of Roads from High Resolution Satellites Images with Dynamic Programming
Benzouai, Siham; Smara, Youcef
2010-12-01
The advent of satellite images allows now a regular and a fast digitizing and update of geographic data, especially roads which are very useful for Geographic Information Systems (GIS) applications such as transportation, urban pollution, geomarketing, etc. For this, several studies have been conducted to automate roads extraction in order to minimize the manual processes [4]. In this work, we are interested in roads extraction from satellite imagery with high spatial resolution (at best equal to 10 m). The method is semi automatic and follows a linear approach where road is considered as a linear object. As roads extraction is a pattern recognition problem, it is useful, above all, to characterize roads. After, we realize a pre-processing by applying an Infinite Size Edge Filter -ISEF- and processing method based on dynamic programming concept, in particular, Fishler algorithm designed by F*.
Noninvasive fetal QRS detection using an echo state network and dynamic programming.
Lukoševičius, Mantas; Marozas, Vaidotas
2014-08-01
We address a classical fetal QRS detection problem from abdominal ECG recordings with a data-driven statistical machine learning approach. Our goal is to have a powerful, yet conceptually clean, solution. There are two novel key components at the heart of our approach: an echo state recurrent neural network that is trained to indicate fetal QRS complexes, and several increasingly sophisticated versions of statistics-based dynamic programming algorithms, which are derived from and rooted in probability theory. We also employ a standard technique for preprocessing and removing maternal ECG complexes from the signals, but do not take this as the main focus of this work. The proposed approach is quite generic and can be extended to other types of signals and annotations. Open-source code is provided.
Stochastic Dynamic Programming for Three-Echelon Inventory System of Limited Shelf Life Products
Directory of Open Access Journals (Sweden)
Galal Noha M.
2016-01-01
Full Text Available Coordination of inventory decisions within the supply chain is one of the major determinants of its competitiveness in the global market. Products with limited shelf life impose additional challenges in managing the inventory across the supply chain because of the additional wastage costs incurred in case of being stored beyond product’s useful life. This paper presents a stochastic dynamic programming model for inventory replenishment in a serial multi-echelon distribution supply chain. The model considers uncertain stationary discrete demand at the retailer and zero lead time. The objective is to minimize expected total costs across the supply chain echelons, while maintaining a preset service level. The results illustrate that a cost saving of around 17% is achievable due to coordinating inventory decisions across the supply chain.
A Dynamic Economic Dispatch Model Incorporating Wind Power Based on Chance Constrained Programming
Directory of Open Access Journals (Sweden)
Wushan Cheng
2014-12-01
Full Text Available In order to maintain the stability and security of the power system, the uncertainty and intermittency of wind power must be taken into account in economic dispatch (ED problems. In this paper, a dynamic economic dispatch (DED model based on chance constrained programming is presented and an improved particle swarm optimization (PSO approach is proposed to solve the problem. Wind power is regarded as a random variable and is included in the chance constraint. New formulation of up and down spinning reserve constraints are presented under expectation meaning. The improved PSO algorithm combines a feasible region adjustment strategy with a hill climbing search operation based on the basic PSO. Simulations are performed under three distinct test systems with different generators. Results show that both the proposed DED model and the improved PSO approach are effective.
Real-Time Reactive Power Distribution in Microgrids by Dynamic Programing
DEFF Research Database (Denmark)
Levron, Yoash; Beck, Yuval; Katzir, Liran
2017-01-01
as radial ones. The optimization problem is formulated with the cluster reactive powers as free variables, and the solution space is spanned by the cluster reactive power outputs. The optimal solution is then constructed by efficiently scanning the entire solution space, by scanning every possible......In this paper a new real-time optimization method for reactive power distribution in microgrids is proposed. The method enables location of a globally optimal distribution of reactive power under normal operating conditions. The method exploits the typical compact structure of microgrids to obtain...... combination of reactive powers, by means of dynamic programming. Since every single step involves a one-dimensional problem, the complexity of the solution is only linear with the number of clusters, and as a result, a globally optimal solution may be obtained in real time. The paper includes the results...
Dynamic Programming and Error Estimates for Stochastic Control Problems with Maximum Cost
Energy Technology Data Exchange (ETDEWEB)
Bokanowski, Olivier, E-mail: boka@math.jussieu.fr [Laboratoire Jacques-Louis Lions, Université Paris-Diderot (Paris 7) UFR de Mathématiques - Bât. Sophie Germain (France); Picarelli, Athena, E-mail: athena.picarelli@inria.fr [Projet Commands, INRIA Saclay & ENSTA ParisTech (France); Zidani, Hasnaa, E-mail: hasnaa.zidani@ensta.fr [Unité de Mathématiques appliquées (UMA), ENSTA ParisTech (France)
2015-02-15
This work is concerned with stochastic optimal control for a running maximum cost. A direct approach based on dynamic programming techniques is studied leading to the characterization of the value function as the unique viscosity solution of a second order Hamilton–Jacobi–Bellman (HJB) equation with an oblique derivative boundary condition. A general numerical scheme is proposed and a convergence result is provided. Error estimates are obtained for the semi-Lagrangian scheme. These results can apply to the case of lookback options in finance. Moreover, optimal control problems with maximum cost arise in the characterization of the reachable sets for a system of controlled stochastic differential equations. Some numerical simulations on examples of reachable analysis are included to illustrate our approach.
Memory-efficient dynamic programming backtrace and pairwise local sequence alignment.
Newberg, Lee A
2008-08-15
A backtrace through a dynamic programming algorithm's intermediate results in search of an optimal path, or to sample paths according to an implied probability distribution, or as the second stage of a forward-backward algorithm, is a task of fundamental importance in computational biology. When there is insufficient space to store all intermediate results in high-speed memory (e.g. cache) existing approaches store selected stages of the computation, and recompute missing values from these checkpoints on an as-needed basis. Here we present an optimal checkpointing strategy, and demonstrate its utility with pairwise local sequence alignment of sequences of length 10,000. Sample C++-code for optimal backtrace is available in the Supplementary Materials. Supplementary data is available at Bioinformatics online.
A Dynamic Programming Algorithm for Optimal Design of Tidal Power Plants
Nag, B.
2013-03-01
A dynamic programming algorithm is proposed and demonstrated on a test case to determine the optimum operating schedule of a barrage tidal power plant to maximize the energy generation over a tidal cycle. Since consecutive sets of high and low tides can be predicted accurately for any tidal power plant site, this algorithm can be used to calculate the annual energy generation for different technical configurations of the plant. Thus an optimal choice of a tidal power plant design can be made from amongst different design configurations yielding the least cost of energy generation. Since this algorithm determines the optimal time of operation of sluice gate opening and turbine gates opening to maximize energy generation over a tidal cycle, it can also be used to obtain the annual schedule of operation of a tidal power plant and the minute-to-minute energy generation, for dissemination amongst power distribution utilities.
AbouEisha, Hassan M.
2017-07-13
We consider a class of two-and three-dimensional h-refined meshes generated by an adaptive finite element method. We introduce an element partition tree, which controls the execution of the multi-frontal solver algorithm over these refined grids. We propose and study algorithms with polynomial computational cost for the optimization of these element partition trees. The trees provide an ordering for the elimination of unknowns. The algorithms automatically optimize the element partition trees using extensions of dynamic programming. The construction of the trees by the dynamic programming approach is expensive. These generated trees cannot be used in practice, but rather utilized as a learning tool to propose fast heuristic algorithms. In this first part of our paper we focus on the dynamic programming approach, and draw a sketch of the heuristic algorithm. The second part will be devoted to a more detailed analysis of the heuristic algorithm extended for the case of hp-adaptive
Gupta, Deepak K; Fonck, Raymond R
2008-01-01
A new time-delay estimation (TDE) technique based on dynamic programming is developed, to measures the time-varying time-delay between two signals. Dynamic programming based TDE technique provides a frequency response 5 to 10 times higher than previously known TDE techniques, namely those based on time-lag cross-correlation or wavelet analysis. Effects of frequency spectrum, signal-to-noise ratio and amplitude of time-delay on response (represented as transfer function) of TDE technique is studied using simulated data signals. Transfer function for the technique decreases with increase in noise in signal; however it is independent of signal spectrum shape. Dynamic programming based TDE technique is applied to the Beam-Emission-Spectroscopy (BES) diagnostic data to measure poloidal velocity fluctuations, which led to the observation of theoretically predicted zonal flows in high-temperature tokamak plasmas.
Sahoo, Avimanyu; Jagannathan, Sarangapani
2017-02-01
In this paper, an event-driven stochastic adaptive dynamic programming (ADP)-based technique is introduced for nonlinear systems with a communication network within its feedback loop. A near optimal control policy is designed using an actor-critic framework and ADP with event sampled state vector. First, the system dynamics are approximated by using a novel neural network (NN) identifier with event sampled state vector. The optimal control policy is generated via an actor NN by using the NN identifier and value function approximated by a critic NN through ADP. The stochastic NN identifier, actor, and critic NN weights are tuned at the event sampled instants leading to aperiodic weight tuning laws. Above all, an adaptive event sampling condition based on estimated NN weights is designed by using the Lyapunov technique to ensure ultimate boundedness of all the closed-loop signals along with the approximation accuracy. The net result is event-driven stochastic ADP technique that can significantly reduce the computation and network transmissions. Finally, the analytical design is substantiated with simulation results.
Wang, Jin; Fung, Richard Y K
2015-01-01
A well-developed appointment system can help increase the utilization of medical facilities in an outpatient department. This paper outlines the development of an appointment system that can make an outpatient department work more efficiently and improve patient satisfaction level. A Markov decision process model is proposed to schedule sequential appointments with the consideration of patient preferences in order to maximize the patient satisfaction level. Adaptive dynamic programming algorithms are developed to avoid the curse of dimensionality. These algorithms can dynamically capture patient preferences, update the value of being a state, and thus improve the appointment decisions. Experiments were conducted to investigate the performance of the algorithms. The convergence behaviors under different settings, including the number of iterations needed for convergence and the accuracy of results, were examined. Bias-adjusted Kalman filter step-sizes were found to lead to the best convergence behavior, which stabilized within 5000 iterations. As for the effects of exploration and exploitation, it resulted in the best convergence behavior when the probability of taking a myopically optimal action equaled 0.9. The performance of value function approximation algorithm was greatly affected by the combination of basis functions. Under different combinations, errors varied from 2.7% to 8.3%. More preferences resulted in faster convergence, but required longer computation time. System parameters are adaptively updated as bookings are confirmed. The proposed appointment scheduling system could certainly contribute to better patient satisfaction level during the booking periods. Copyright © 2014 Elsevier B.V. All rights reserved.
Closed Cycle Engine Program Used in Solar Dynamic Power Testing Effort
Ensworth, Clint B., III; McKissock, David B.
1998-01-01
NASA Lewis Research Center is testing the world's first integrated solar dynamic power system in a simulated space environment. This system converts solar thermal energy into electrical energy by using a closed-cycle gas turbine and alternator. A NASA-developed analysis code called the Closed Cycle Engine Program (CCEP) has been used for both pretest predictions and post-test analysis of system performance. The solar dynamic power system has a reflective concentrator that focuses solar thermal energy into a cavity receiver. The receiver is a heat exchanger that transfers the thermal power to a working fluid, an inert gas mixture of helium and xenon. The receiver also uses a phase-change material to store the thermal energy so that the system can continue producing power when there is no solar input power, such as when an Earth-orbiting satellite is in eclipse. The system uses a recuperated closed Brayton cycle to convert thermal power to mechanical power. Heated gas from the receiver expands through a turbine that turns an alternator and a compressor. The system also includes a gas cooler and a radiator, which reject waste cycle heat, and a recuperator, a gas-to-gas heat exchanger that improves cycle efficiency by recovering thermal energy.
Directory of Open Access Journals (Sweden)
Zhanjie Li
Full Text Available Rapeseed (Brassica napus L. is an important oil crop worldwide and exhibits significant heterosis. Effective pollination control systems, which are closely linked to anther development, are a prerequisite for utilizing heterosis. The anther, which is the male organ in flowering plants, undergoes many metabolic processes during development. Although the gene expression patterns underlying pollen development are well studied in model plant Arabidopsis, the regulatory networks of genome-wide gene expression during rapeseed anther development is poorly understood, especially regarding metabolic regulations. In this study, we systematically analyzed metabolic processes occurring during anther development in rapeseed using ultrastructural observation and global transcriptome analysis. Anther ultrastructure exhibited that numerous cellular organelles abundant with metabolic materials, such as elaioplast, tapetosomes, plastids (containing starch deposits etc. appeared, accompanied with anther structural alterations during anther development, suggesting many metabolic processes occurring. Global transcriptome analysis revealed dynamic changes in gene expression during anther development that corresponded to dynamic functional alterations between early and late anther developmental stages. The early stage anthers preferentially expressed genes involved in lipid metabolism that are related to pollen extine formation as well as elaioplast and tapetosome biosynthesis, whereas the late stage anthers expressed genes associated with carbohydrate metabolism to form pollen intine and to accumulate starch in mature pollen grains. Finally, a predictive gene regulatory module responsible for early pollen extine formation was generated. Taken together, this analysis provides a comprehensive understanding of dynamic gene expression programming of metabolic processes in the rapeseed anther, especially with respect to lipid and carbohydrate metabolism during pollen
Sabar, Nasser R; Ayob, Masri; Kendall, Graham; Qu, Rong
2015-02-01
Hyper-heuristics are search methodologies that aim to provide high-quality solutions across a wide variety of problem domains, rather than developing tailor-made methodologies for each problem instance/domain. A traditional hyper-heuristic framework has two levels, namely, the high level strategy (heuristic selection mechanism and the acceptance criterion) and low level heuristics (a set of problem specific heuristics). Due to the different landscape structures of different problem instances, the high level strategy plays an important role in the design of a hyper-heuristic framework. In this paper, we propose a new high level strategy for a hyper-heuristic framework. The proposed high-level strategy utilizes a dynamic multiarmed bandit-extreme value-based reward as an online heuristic selection mechanism to select the appropriate heuristic to be applied at each iteration. In addition, we propose a gene expression programming framework to automatically generate the acceptance criterion for each problem instance, instead of using human-designed criteria. Two well-known, and very different, combinatorial optimization problems, one static (exam timetabling) and one dynamic (dynamic vehicle routing) are used to demonstrate the generality of the proposed framework. Compared with state-of-the-art hyper-heuristics and other bespoke methods, empirical results demonstrate that the proposed framework is able to generalize well across both domains. We obtain competitive, if not better results, when compared to the best known results obtained from other methods that have been presented in the scientific literature. We also compare our approach against the recently released hyper-heuristic competition test suite. We again demonstrate the generality of our approach when we compare against other methods that have utilized the same six benchmark datasets from this test suite.
Directory of Open Access Journals (Sweden)
Seung-Kil Lim
2017-01-01
Full Text Available This study focuses on the N-level batching problem with a hierarchical clustering structure. Clustering is the task of grouping a set of item types in such a way that item types in the same cluster are more similar (in some sense or another to each other than to those in other clusters. In hierarchical clustering structure, more and more different item types are clustered together as the level of the hierarchy increases. N-level batching is the process by which items with different types are grouped into several batches passed from level 1 to level N sequentially for given hierarchical clustering structure such that batches in each level should satisfy the maximum and minimum batch size requirements of the level. We consider two types of processing costs of the batches: unit processing cost and batch processing cost. We formulate the N-level batching problem with a hierarchical clustering structure as a nonlinear integer programming model with the objective of minimizing the total processing cost. To solve the problem optimally, we propose a multidimensional dynamic programming algorithm with an example.
SwiftLib: rapid degenerate-codon-library optimization through dynamic programming.
Jacobs, Timothy M; Yumerefendi, Hayretin; Kuhlman, Brian; Leaver-Fay, Andrew
2015-03-11
Degenerate codon (DC) libraries efficiently address the experimental library-size limitations of directed evolution by focusing diversity toward the positions and toward the amino acids (AAs) that are most likely to generate hits; however, manually constructing DC libraries is challenging, error prone and time consuming. This paper provides a dynamic programming solution to the task of finding the best DCs while keeping the size of the library beneath some given limit, improving on the existing integer-linear programming formulation. It then extends the algorithm to consider multiple DCs at each position, a heretofore unsolved problem, while adhering to a constraint on the number of primers needed to synthesize the library. In the two library-design problems examined here, the use of multiple DCs produces libraries that very nearly cover the set of desired AAs while still staying within the experimental size limits. Surprisingly, the algorithm is able to find near-perfect libraries where the ratio of amino-acid sequences to nucleic-acid sequences approaches 1; it effectively side-steps the degeneracy of the genetic code. Our algorithm is freely available through our web server and solves most design problems in about a second. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.
Bernhard, Axel; Casalbuoni, Sara; Ferracin, Paolo; Garcia Fajardo, Laura; Gerstl, Stefan; Gethmann, Julian; Grau, Andreas; Huttel, Erhard; Khrushchev, Sergey; Mezentsev, Nikolai; Müller, Anke-Susanne; Papaphilippou, Yannis; Saez de Jauregui, David; Schmickler, Hermann; Schoerling, Daniel; Shkaruba, Vitaliy; Smale, Nigel; Tsukanov, Valery; Zisopoulos, Panagiotis; Zolotarev, Konstantin
2016-01-01
In a collaboration between CERN, BINP and KIT a prototype of a superconducting damping wiggler for the CLIC damping rings has been installed at the ANKA synchrotron light source. On the one hand, the foreseen experimental program aims at validating the technical design of the wiggler, particularly the conduction cooling concept applied in its cryostat design, in a long-term study. On the other hand, the wiggler's influence on the beam dynamics particularly in the presence of collective effects is planned to be investigated. ANKA's low-alpha short-bunch operation mode will serve as a model system for these studies on collective effects. To simulate these effects and to make verifiable predictions an accurate model of the ANKA storage ring in low-alpha mode, including the insertion devices is under parallel development. This contribution reports on the first operational experience with the CLIC damping wiggler prototype in the ANKA storage ring and steps towards the planned advanced experimental program with th...
Ibarra, Ignacio L; Melo, Francisco
2010-07-01
Dynamic programming (DP) is a general optimization strategy that is successfully used across various disciplines of science. In bioinformatics, it is widely applied in calculating the optimal alignment between pairs of protein or DNA sequences. These alignments form the basis of new, verifiable biological hypothesis. Despite its importance, there are no interactive tools available for training and education on understanding the DP algorithm. Here, we introduce an interactive computer application with a graphical interface, for the purpose of educating students about DP. The program displays the DP scoring matrix and the resulting optimal alignment(s), while allowing the user to modify key parameters such as the values in the similarity matrix, the sequence alignment algorithm version and the gap opening/extension penalties. We hope that this software will be useful to teachers and students of bioinformatics courses, as well as researchers who implement the DP algorithm for diverse applications. The software is freely available at: http:/melolab.org/sat. The software is written in the Java computer language, thus it runs on all major platforms and operating systems including Windows, Mac OS X and LINUX. All inquiries or comments about this software should be directed to Francisco Melo at fmelo@bio.puc.cl.
Mogo, César; Brandão, João
2014-06-30
READY (REActive DYnamics) is a program for studying reactive dynamic systems using a global potential energy surface (PES) built from previously existing PESs corresponding to each of the most important elementary reactions present in the system. We present an application to the combustion dynamics of a mixture of hydrogen and oxygen using accurate PESs for all the systems involving up to four oxygen and hydrogen atoms. Results at the temperature of 4000 K and pressure of 2 atm are presented and compared with model based on rate constants. Drawbacks and advantages of this approach are discussed and future directions of research are pointed out. Copyright © 2014 Wiley Periodicals, Inc.
Sheeley, Douglas M; Breen, Joseph J; Old, Susan E
2005-01-01
Proteomics technology and methods remain inadequate. Technological constraints contribute to an artificially static view of complex biological systems and a barrier between quantitative and interaction studies. Several NIH programs combine proteomics technology development with research on challenging biological problems to drive progress. A new initiative of the NIH Roadmap focuses on characterization of dynamic systems. The success of these programs will be judged by their impact on relevant biological problems.
Kouramas, K.I.
2011-08-01
This work presents a new algorithm for solving the explicit/multi- parametric model predictive control (or mp-MPC) problem for linear, time-invariant discrete-time systems, based on dynamic programming and multi-parametric programming techniques. The algorithm features two key steps: (i) a dynamic programming step, in which the mp-MPC problem is decomposed into a set of smaller subproblems in which only the current control, state variables, and constraints are considered, and (ii) a multi-parametric programming step, in which each subproblem is solved as a convex multi-parametric programming problem, to derive the control variables as an explicit function of the states. The key feature of the proposed method is that it overcomes potential limitations of previous methods for solving multi-parametric programming problems with dynamic programming, such as the need for global optimization for each subproblem of the dynamic programming step. © 2011 Elsevier Ltd. All rights reserved.
Teachers' Scaffolding of Students' Learning of Geometry While Using a Dynamic Geometry Program
Dove, Anthony; Hollenbrands, Karen
2014-01-01
This study examined the scaffolds that three high school mathematics teachers provided to their geometry students as they used technology to explore geometric ideas. Teachers often used structured activities using a dynamic geometry program and provided significant emotive feedback while students worked through the tasks. This provided…
Regalla, Michele; Peker, Hilal
2017-01-01
This study examined a teacher's prompting strategies and the use of dynamic assessment (DA) in an inclusive prekindergarten French program. Prior research has shown that DA is an effective method to assess both foreign language learning and first language development for typically developing students and for students with special needs, as well as…
Fast pairwise structural RNA alignments by pruning of the dynamical programming matrix.
Directory of Open Access Journals (Sweden)
Jakob H Havgaard
2007-10-01
Full Text Available It has become clear that noncoding RNAs (ncRNA play important roles in cells, and emerging studies indicate that there might be a large number of unknown ncRNAs in mammalian genomes. There exist computational methods that can be used to search for ncRNAs by comparing sequences from different genomes. One main problem with these methods is their computational complexity, and heuristics are therefore employed. Two heuristics are currently very popular: pre-folding and pre-aligning. However, these heuristics are not ideal, as pre-aligning is dependent on sequence similarity that may not be present and pre-folding ignores the comparative information. Here, pruning of the dynamical programming matrix is presented as an alternative novel heuristic constraint. All subalignments that do not exceed a length-dependent minimum score are discarded as the matrix is filled out, thus giving the advantage of providing the constraints dynamically. This has been included in a new implementation of the FOLDALIGN algorithm for pairwise local or global structural alignment of RNA sequences. It is shown that time and memory requirements are dramatically lowered while overall performance is maintained. Furthermore, a new divide and conquer method is introduced to limit the memory requirement during global alignment and backtrack of local alignment. All branch points in the computed RNA structure are found and used to divide the structure into smaller unbranched segments. Each segment is then realigned and backtracked in a normal fashion. Finally, the FOLDALIGN algorithm has also been updated with a better memory implementation and an improved energy model. With these improvements in the algorithm, the FOLDALIGN software package provides the molecular biologist with an efficient and user-friendly tool for searching for new ncRNAs. The software package is available for download at http://foldalign.ku.dk.
Directory of Open Access Journals (Sweden)
Luciano da Silva Bastos Sales
2017-06-01
Full Text Available The main objective of this paper is to identify and describe how system dynamic can be useful to improve the decision making on projects, and leverage their execution. For this, the problems in the current project management frameworks are discussed and pointed some consequences of these deficiencies. A descriptive-exploratory research is presented through a qualitative case study in the Connected Amazon Program.Some improvement in decision making through the use of soft modeling of system dynamic were observed, anticipating problems that could occur in the Program execution. These problems are difficult to detected with current project management tools, which suggests that the use of system dynamics can complement traditional modeling, leveraging the project planning and execution.
Fotiadou, Eleni G; Neofotistou, Konstantina H; Sidiropoulou, Maria P; Tsimaras, Vasilios K; Mandroukas, Athanasios K; Angelopoulou, Nickoletta A
2009-10-01
The purpose of this study was to examine the effect of a rhythmic gymnastics program on the dynamic balance ability of a group of adults with intellectual disability (ID). The sample consisted of 18 adults with ID. The control group consisted of 8 adults and an intervention group of 10. The subjects were assigned to each group according to their desire to participate or not in the intervention program. Both groups were comparable in terms of age, weight, height, IQ, and socioeconomic background. The intervention group received a 12-week rhythmic gymnastics program at a frequency of 3 lessons per week, of 45 minutes. The methods of data collection included pre/post-test measurements of the dynamic balance for all subjects of both groups. The dynamic balance ability was measured by means of a balance deck (Lafayette) and was determined by the number of seconds the subject could remain standing on the platform of the stabilometer in durations of 30-, 45-, and 60-second intervals. As the results indicated, the intervention group showed a statistically significant improvement (p rhythmic gymnastics program when compared with the control group. It is concluded that adults with ID can improve their balance ability with the application of a well-designed rhythmic gymnastics program.
EDISON-WMW: Exact Dynamic Programing Solution of the Wilcoxon–Mann–Whitney Test
Directory of Open Access Journals (Sweden)
Alexander Marx
2016-02-01
Full Text Available In many research disciplines, hypothesis tests are applied to evaluate whether findings are statistically significant or could be explained by chance. The Wilcoxon–Mann–Whitney (WMW test is among the most popular hypothesis tests in medicine and life science to analyze if two groups of samples are equally distributed. This nonparametric statistical homogeneity test is commonly applied in molecular diagnosis. Generally, the solution of the WMW test takes a high combinatorial effort for large sample cohorts containing a significant number of ties. Hence, P value is frequently approximated by a normal distribution. We developed EDISON-WMW, a new approach to calculate the exact permutation of the two-tailed unpaired WMW test without any corrections required and allowing for ties. The method relies on dynamic programing to solve the combinatorial problem of the WMW test efficiently. Beyond a straightforward implementation of the algorithm, we presented different optimization strategies and developed a parallel solution. Using our program, the exact P value for large cohorts containing more than 1000 samples with ties can be calculated within minutes. We demonstrate the performance of this novel approach on randomly-generated data, benchmark it against 13 other commonly-applied approaches and moreover evaluate molecular biomarkers for lung carcinoma and chronic obstructive pulmonary disease (COPD. We found that approximated P values were generally higher than the exact solution provided by EDISON-WMW. Importantly, the algorithm can also be applied to high-throughput omics datasets, where hundreds or thousands of features are included. To provide easy access to the multi-threaded version of EDISON-WMW, a web-based solution of our algorithm is freely available at http://www.ccb.uni-saarland.de/software/wtest/.
Energy Technology Data Exchange (ETDEWEB)
Dall' Anese, Emiliano; Dhople, Sairaj V.; Giannakis, Georgios B.
2015-07-01
This paper considers a collection of networked nonlinear dynamical systems, and addresses the synthesis of feedback controllers that seek optimal operating points corresponding to the solution of pertinent network-wide optimization problems. Particular emphasis is placed on the solution of semidefinite programs (SDPs). The design of the feedback controller is grounded on a dual e-subgradient approach, with the dual iterates utilized to dynamically update the dynamical-system reference signals. Global convergence is guaranteed for diminishing stepsize rules, even when the reference inputs are updated at a faster rate than the dynamical-system settling time. The application of the proposed framework to the control of power-electronic inverters in AC distribution systems is discussed. The objective is to bridge the time-scale separation between real-time inverter control and network-wide optimization. Optimization objectives assume the form of SDP relaxations of prototypical AC optimal power flow problems.
Sofianidis, Giorgos; Hatzitaki, Vassilia; Douka, Stella; Grouios, Giorgos
2009-04-01
This preliminary study examined the effect of a 10-wk traditional Greek dance program on static and dynamic balance indices in healthy elderly adults. Twenty-six community-dwelling older adults were randomly assigned to either an intervention group who took supervised Greek traditional dance classes for 10 wk (1 hr, 2 sessions/week, n = 14), or a control group (n = 12). Balance was assessed pre- and postintervention by recording the center-of-pressure (COP) variations and trunk kinematics during performance of the Sharpened-Romberg test, 1-leg (OL) stance, and dynamic weight shifting (WS). After practice, the dance group significantly decreased COP displacement and trunk sway in OL stance. A significant increase in the range of trunk rotation was noted during performance of dynamic WS in the sagittal and frontal planes. These findings support the use of traditional dance as an effective means of physical activity for improving static and dynamic balance control in the elderly.
Optimizing the herd calving pattern with linear programming and dynamic probabilistic simulation.
Jalvingh, A W; Dijkhuizen, A A; Van Arendonk, J A
1994-06-01
Until recently, little attention has been paid to the influence of seasonal variation in performance and prices on the optimal calving pattern of a herd. A method was developed to determine the herd calving pattern that is farm-specific and optimal with use of linear programming. The required technical and economic parameters are calculated with a dynamic probabilistic simulation model of the dairy herd. The approach was illustrated with a situation in which the objective was to maximize the gross margin of the herd and the annual milk production of the herd was restricted, resulting in an optimal calving pattern: all heifers calved during August. When, in addition, only home-reared replacement heifers were allowed to enter the herd, heifer calvings took place from July to October. The gross margin was reduced by only Dfl. .13/100 kg of milk ($1 US = 1.80 Dfl.) as a result of the additional constraint. The sensitivity of the optimal calving pattern of herd was determined for lower reproductive performance and when seasonal price variation was ignored. The method described herein is a flexible tool for determining the optimal calving pattern of herd, taking into account farm-specific inputs and constraints.
Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining
Hussain, Shahid
2016-07-10
This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.
Directory of Open Access Journals (Sweden)
Viral H. Borisagar
2014-01-01
Full Text Available A novel hierarchical stereo matching algorithm is presented which gives disparity map as output from illumination variant stereo pair. Illumination difference between two stereo images can lead to undesirable output. Stereo image pair often experience illumination variations due to many factors like real and practical situation, spatially and temporally separated camera positions, environmental illumination fluctuation, and the change in the strength or position of the light sources. Window matching and dynamic programming techniques are employed for disparity map estimation. Good quality disparity map is obtained with the optimized path. Homomorphic filtering is used as a preprocessing step to lessen illumination variation between the stereo images. Anisotropic diffusion is used to refine disparity map to give high quality disparity map as a final output. The robust performance of the proposed approach is suitable for real life circumstances where there will be always illumination variation between the images. The matching is carried out in a sequence of images representing the same scene, however in different resolutions. The hierarchical approach adopted decreases the computation time of the stereo matching problem. This algorithm can be helpful in applications like robot navigation, extraction of information from aerial surveys, 3D scene reconstruction, and military and security applications. Similarity measure SAD is often sensitive to illumination variation. It produces unacceptable disparity map results for illumination variant left and right images. Experimental results show that our proposed algorithm produces quality disparity maps for both wide range of illumination variant and invariant stereo image pair.
Borisagar, Viral H; Zaveri, Mukesh A
2014-01-01
A novel hierarchical stereo matching algorithm is presented which gives disparity map as output from illumination variant stereo pair. Illumination difference between two stereo images can lead to undesirable output. Stereo image pair often experience illumination variations due to many factors like real and practical situation, spatially and temporally separated camera positions, environmental illumination fluctuation, and the change in the strength or position of the light sources. Window matching and dynamic programming techniques are employed for disparity map estimation. Good quality disparity map is obtained with the optimized path. Homomorphic filtering is used as a preprocessing step to lessen illumination variation between the stereo images. Anisotropic diffusion is used to refine disparity map to give high quality disparity map as a final output. The robust performance of the proposed approach is suitable for real life circumstances where there will be always illumination variation between the images. The matching is carried out in a sequence of images representing the same scene, however in different resolutions. The hierarchical approach adopted decreases the computation time of the stereo matching problem. This algorithm can be helpful in applications like robot navigation, extraction of information from aerial surveys, 3D scene reconstruction, and military and security applications. Similarity measure SAD is often sensitive to illumination variation. It produces unacceptable disparity map results for illumination variant left and right images. Experimental results show that our proposed algorithm produces quality disparity maps for both wide range of illumination variant and invariant stereo image pair.
Directory of Open Access Journals (Sweden)
Aidan Petrovich
2015-06-01
Full Text Available Computational methods are prevailing in identifying protein intrinsic disorder. The results from predictors are often given as per-residue disorder scores. The scores describe the disorder propensity of amino acids of a protein and can be further represented as a disorder curve. Many proteins share similar patterns in their disorder curves. The similar patterns are often associated with similar functions and evolutionary origins. Therefore, finding and characterizing specific patterns of disorder curves provides a unique and attractive perspective of studying the function of intrinsically disordered proteins. In this study, we developed a new computational tool named IDalign using dynamic programming. This tool is able to identify similar patterns among disorder curves, as well as to present the distribution of intrinsic disorder in query proteins. The disorder-based information generated by IDalign is significantly different from the information retrieved from classical sequence alignments. This tool can also be used to infer functions of disordered regions and disordered proteins. The web server of IDalign is available at (http://labs.cas.usf.edu/bioinfo/service.html.
Dynamic Programming for Instance Annotation in Multi-Instance Multi-Label Learning.
Pham, Anh T; Raich, Raviv; Fern, Xiaoli Z
2017-12-01
Labeling data for classification requires significant human effort. To reduce labeling cost, instead of labeling every instance, a group of instances (bag) is labeled by a single bag label. Computer algorithms are then used to infer the label for each instance in a bag, a process referred to as instance annotation. This task is challenging due to the ambiguity regarding the instance labels. We propose a discriminative probabilistic model for the instance annotation problem and introduce an expectation maximization framework for inference, based on the maximum likelihood approach. For many probabilistic approaches, brute-force computation of the instance label posterior probability given its bag label is exponential in the number of instances in the bag. Our contribution is a dynamic programming method for computing the posterior that is linear in the number of instances. We evaluate our method using both benchmark and real world data sets, in the domain of bird song, image annotation, and activity recognition. In many cases, the proposed framework outperforms, sometimes significantly, the current state-of-the-art MIML learning methods, both in instance label prediction and bag label prediction.
Detecting Wash Trade in Financial Market Using Digraphs and Dynamic Programming.
Cao, Yi; Li, Yuhua; Coleman, Sonya; Belatreche, Ammar; McGinnity, Thomas Martin
2016-11-01
A wash trade refers to the illegal activities of traders who utilize carefully designed limit orders to manually increase the trading volumes for creating a false impression of an active market. As one of the primary formats of market abuse, a wash trade can be extremely damaging to the proper functioning and integrity of capital markets. The existing work focuses on collusive clique detections based on certain assumptions of trading behaviors. Effective approaches for analyzing and detecting wash trade in a real-life market have yet to be developed. This paper analyzes and conceptualizes the basic structures of the trading collusion in a wash trade by using a directed graph of traders. A novel method is then proposed to detect the potential wash trade activities involved in a financial instrument by first recognizing the suspiciously matched orders and then further identifying the collusions among the traders who submit such orders. Both steps are formulated as a simplified form of the knapsack problem, which can be solved by dynamic programming approaches. The proposed approach is evaluated on seven stock data sets from the NASDAQ and the London Stock Exchange. The experimental results show that the proposed approach can effectively detect all primary wash trade scenarios across the selected data sets.
Ng, Hok K.; Grabbe, Shon; Mukherjee, Avijit
2010-01-01
The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.
A Novel Approach for Sampling in Approximate Dynamic Programming Based on $F$ -Discrepancy.
Cervellera, Cristiano; Maccio, Danilo
2017-10-01
Approximate dynamic programming (ADP) is the standard tool to solve Markovian decision problems under general hypotheses on the system and the cost equations. It is known that one of the key issues of the procedure is how to generate an efficient sampling of the state space, needed for the approximation of the value function, in order to cope with the well-known phenomenon of the curse of dimensionality. The most common approaches in the literature are either aimed at a uniform covering of the state space or driven by the actual evolution of the system trajectories. Concerning the latter approach, F -discrepancy, a quantity closely related to the Kolmogorov-Smirnov statistic, that measures how strictly a set of random points represents a probability distribution, has been recently proposed for an efficient ADP framework in the finite-horizon case. In this paper, we extend this framework to infinite-horizon discounted problems, providing a constructive algorithm to generate efficient sampling points driven by the system behavior. Then, the algorithm is refined with the aim of acquiring a more balanced covering of the state space, thus addressing possible drawbacks of a pure system-driven sampling approach to obtain, in fact, an efficient hybrid between the latter and the pure uniform design. A theoretical analysis is provided through the introduction of an original notion of the F -discrepancy and the proof of its properties. Simulation tests are provided to showcase the behavior of the proposed sampling method.
Russ, Daniel E; Ho, Kwan-Yuet; Longo, Nancy S
2015-05-23
Partitioning the human immunoglobulin variable region into variable (V), diversity (D), and joining (J) segments is a common sequence analysis step. We introduce a novel approximate dynamic programming method that uses conserved immunoglobulin gene motifs to improve performance of aligning V-segments of rearranged immunoglobulin (Ig) genes. Our new algorithm enhances the former JOINSOLVER algorithm by processing sequences with insertions and/or deletions (indels) and improves the efficiency for large datasets provided by high throughput sequencing. In our simulations, which include rearrangements with indels, the V-matching success rate improved from 61% for partial alignments of sequences with indels in the original algorithm to over 99% in the approximate algorithm. An improvement in the alignment of human VDJ rearrangements over the initial JOINSOLVER algorithm was also seen when compared to the Stanford.S22 human Ig dataset with an online VDJ partitioning software evaluation tool. HTJoinSolver can rapidly identify V- and J-segments with indels to high accuracy for mutated sequences when the mutation probability is around 30% and 20% respectively. The D-segment is much harder to fit even at 20% mutation probability. For all segments, the probability of correctly matching V, D, and J increases with our alignment score.
Petrovich, Aidan; Borne, Adam; Uversky, Vladimir N; Xue, Bin
2015-06-16
Computational methods are prevailing in identifying protein intrinsic disorder. The results from predictors are often given as per-residue disorder scores. The scores describe the disorder propensity of amino acids of a protein and can be further represented as a disorder curve. Many proteins share similar patterns in their disorder curves. The similar patterns are often associated with similar functions and evolutionary origins. Therefore, finding and characterizing specific patterns of disorder curves provides a unique and attractive perspective of studying the function of intrinsically disordered proteins. In this study, we developed a new computational tool named IDalign using dynamic programming. This tool is able to identify similar patterns among disorder curves, as well as to present the distribution of intrinsic disorder in query proteins. The disorder-based information generated by IDalign is significantly different from the information retrieved from classical sequence alignments. This tool can also be used to infer functions of disordered regions and disordered proteins. The web server of IDalign is available at (http://labs.cas.usf.edu/bioinfo/service.html).
A NASTRAN-based computer program for structural dynamic analysis of Horizontal Axis Wind Turbines
Lobitz, Don W.
1995-01-01
This paper describes a computer program developed for structural dynamic analysis of horizontal axis wind turbines (HAWT's). It is based on the finite element method through its reliance on NASTRAN for the development of mass, stiffness, and damping matrices of the tower end rotor, which are treated in NASTRAN as separate structures. The tower is modeled in a stationary frame and the rotor in one rotating at a constant angular velocity. The two structures are subsequently joined together (external to NASTRAN) using a time-dependent transformation consistent with the hub configuration. Aerodynamic loads are computed with an established flow model based on strip theory. Aeroelastic effects are included by incorporating the local velocity and twisting deformation of the blade in the load computation. The turbulent nature of the wind, both in space and time, is modeled by adding in stochastic wind increments. The resulting equations of motion are solved in the time domain using the implicit Newmark-Beta integrator. Preliminary comparisons with data from the Boeing/NASA MOD2 HAWT indicate that the code is capable of accurately and efficiently predicting the response of HAWT's driven by turbulent winds.
Fast segmentation of the left ventricle in cardiac MRI using dynamic programming.
Santiago, Carlos; Nascimento, Jacinto C; Marques, Jorge S
2018-02-01
The segmentation of the left ventricle (LV) in cardiac magnetic resonance imaging is a necessary step for the analysis and diagnosis of cardiac function. In most clinical setups, this step is still manually performed by cardiologists, which is time-consuming and laborious. This paper proposes a fast system for the segmentation of the LV that significantly reduces human intervention. A dynamic programming approach is used to obtain the border of the LV. Using very simple assumptions about the expected shape and location of the segmentation, this system is able to deal with many of the challenges associated with this problem. The system was evaluated on two public datasets: one with 33 patients, comprising a total of 660 magnetic resonance volumes and another with 45 patients, comprising a total of 90 volumes. Quantitative evaluation of the segmentation accuracy and computational complexity was performed. The proposed system is able to segment a whole volume in 1.5 seconds and achieves an average Dice similarity coefficient of 86.0% and an average perpendicular distance of 2.4 mm, which compares favorably with other state-of-the-art methods. A system for the segmentation of the left ventricle in cardiac magnetic resonance imaging is proposed. It is a fast framework that significantly reduces the amount of time and work required of cardiologists. Copyright © 2017 Elsevier B.V. All rights reserved.
Automatic Nuclear Segmentation Using Multiscale Radial Line Scanning With Dynamic Programming.
Xu, Hongming; Lu, Cheng; Berendt, Richard; Jha, Naresh; Mandal, Mrinal
2017-10-01
In the diagnosis of various cancers by analyzing histological images, automatic nuclear segmentation is an important step. However, nuclear segmentation is a difficult problem because of overlapping nuclei, inhomogeneous staining, and presence of noisy pixels and other tissue components. In this paper, we present an automatic technique for nuclear segmentation in skin histological images. The proposed technique first applies a bank of generalized Laplacian of Gaussian kernels to detect nuclear seeds. Based on the detected nuclear seeds, a multiscale radial line scanning method combined with dynamic programming is applied to extract a set of candidate nuclear boundaries. The gradient, intensity, and shape information are then integrated to determine the optimal boundary for each nucleus in the image. Nuclear overlap limitation is finally imposed based on a Dice coefficient measure such that the obtained nuclear contours do not severely intersect with each other. Experiments have been thoroughly performed on two datasets with H&E and Ki-67 stained images, which show that the proposed technique is superior to conventional schemes of nuclear segmentation.
Implementation of a Small Type DC Microgrid Based on Fuzzy Control and Dynamic Programming
Directory of Open Access Journals (Sweden)
Chin-Hsing Cheng
2016-09-01
Full Text Available A DC microgrid (DC-MG is a novel power system that uses DC distribution in order to provide high quality power. The study system is made by a photovoltaic array (PV, a wind generator (WG, a fuel cell (FC, and an energy storage system (ESS to establish a small type DC microgrid, with the bus being established by DC/DC converters with fuzzy controllers. An overall power dispatch was designed for the proposed system to distribute the power flows among the different energy sources and the storage unit in the system in order to satisfy the load requirements throughout an entire 24-h period. The structure of a power supervisor based on an optimal power dispatch algorithm is here proposed. Optimization was performed using dynamic programming (DP. In this paper, a system configuration of a DC microgrid is analyzed in different scenarios to show the efficacy of the control for all devices for the variable weather conditions with different DC loads. Thus, the voltage level and the power flow of the system are shown for different load conditions.
Directory of Open Access Journals (Sweden)
Fakhruddin Wirakusuma
2017-01-01
Full Text Available Kebutuhan daya listrik saat ini meningkat pesat seiring dengan perkembangan teknologi. Peningkatan kebutuhan daya listrik ini bertolak belakang dengan menipisnya ketersediaan sumber energy minyak dan batu bara. Permasalahan ini berdampak pada ketahanan listrik nasional. Untuk memenuhi kebutuhan daya listrik yang besar dengan cakupan wilayah yang luas diperlukan pembangkit tersebar berskala kecil. Pembangkit tersebar ini diupayakan bersumber pada energi terbarukan untuk meminimalkan pemakaian dari sumber energy minyak dan batu bara lalu dihubungkan ke Micro Grid serta digunakan baterai sebagai power balance. Oleh karena banyaknya pembangkit tersebar dan penggunaan baterai maka penting untuk menentukan besarnya pembangkitan daya listrik yang optimal dari masing-masing pembangkit serta penggunaan baterai berdasarkan kapasitas yang optimal sehingga kebutuhan daya listrik dapat dipenuhi dengan biaya yang minimal tiap waktunya. Optimisasi ini dikenal dengan istilah Dynamic Economic Dispatch. Optimisasi ini sudah banyak dilakukan dilakukan dengan berbagai macam metode Artificial Intelligence. Pada penelitian ini, metode Artificial Intellegence yang diaplikasikan yakni Quadratic Programming. Metode ini diterapkan pada software MATLAB. Dengan metode tersebut, diketahui bahwa penggunaan baterai mampu mengurangi total biaya pembangkitan.
Semi-automatic 3D lung nodule segmentation in CT using dynamic programming
Sargent, Dustin; Park, Sun Young
2017-02-01
We present a method for semi-automatic segmentation of lung nodules in chest CT that can be extended to general lesion segmentation in multiple modalities. Most semi-automatic algorithms for lesion segmentation or similar tasks use region-growing or edge-based contour finding methods such as level-set. However, lung nodules and other lesions are often connected to surrounding tissues, which makes these algorithms prone to growing the nodule boundary into the surrounding tissue. To solve this problem, we apply a 3D extension of the 2D edge linking method with dynamic programming to find a closed surface in a spherical representation of the nodule ROI. The algorithm requires a user to draw a maximal diameter across the nodule in the slice in which the nodule cross section is the largest. We report the lesion volume estimation accuracy of our algorithm on the FDA lung phantom dataset, and the RECIST diameter estimation accuracy on the lung nodule dataset from the SPIE 2016 lung nodule classification challenge. The phantom results in particular demonstrate that our algorithm has the potential to mitigate the disparity in measurements performed by different radiologists on the same lesions, which could improve the accuracy of disease progression tracking.
Directory of Open Access Journals (Sweden)
Nisha
2015-03-01
Full Text Available BACKGROUND: Balance is highly integrative dynamic process involving coordination of multiple neurological pathways that allows for the maintenance of the COG over BOS . Football players often perform lower extremity passing , shooting , twisting , cutting and dribbling skills while wearing shoes , these actions require body to be in the equilibrium position to perform the task . This leads to t he conclusion of the great importance of the ability of balance in football . AIMS: 1 . To study the effect of 4 week multidirectional balance board training on dynamic balance in football players . 2 . To study the effect of 4 week Both Sides Up ball training on dynamic balance in football players . 3 . To compare the effect of multidirectional balance board training program and BOSU ball training program on dynamic balance in football players . STUDY DESIGN: Randomized Clinical trial . METHODS: Total of 60 competitive badminton players with age group between18 - 25 were recruited in this study . The participants were allocated into 2 groups viz ., Group A (multidirectional balance board training and Group B (BOSU ball Training for a period of 4 we eks . Participants were test for SEBT and vertical jump test on first day and after 4 weeks of balance training . STATISTICAL ANALYSIS: Student t test , Chi - Square Test . RESULTS: The data analysis and statistical inference showed that , after 4 weeks of balanc e training there was improvement in dynamic balance in both the groups but there was no significant difference in dynamic balance between two groups . As seen by difference in the SEBT and VJT scores pre and post training with p<0 . 001 . CONCLUSION: 4 weeks balance training using BOSU and multidirectional balance board is effective in improving dynamic balance and vertical jump performance in football players and also can be used as a component of multifaceted training to improve dynamic balance and game skills
Directory of Open Access Journals (Sweden)
Riza Fahmi Andriyanto
2017-01-01
Full Text Available Kebutuhan akan energi listrik terus menigkat seiring dengan perkembangan teknologi. meningkatnya beban listrik ini harus diimbangi dengan penambahan daya yang dibangkitkan. Hal ini sangat berpengaruh pada penjadwalan unit pembangkit yang harus ditentukan dengan baik agar didapatkan pembangkitan yang optimal. Pada Tugas Akhir ini mengambil topik mengenai unit commitment dan economic dispatch dengan mempertimbangkan nilai dari batasan generator (ramp-rate. Metode yang digunakan adalah complete enumeration dengan forward dynamic programming pada unit commitment dan quadratic programming pada economic dispatch. Metode - metode tersebut diterapkan dalam pemrograman matlab sehingga dapat dijadikan suatu program perhitungan unit commitment dan economic dispatch dengan mempertimbangkan nilai batasan ramp-rate. Dengan metode tersebut, diharapkan permasalahan penjadwalan unit pembangkit dapat terselesaikan dengan baik dan optimal sehingga memperoleh total biaya pembangkitan yang ekonomis.
Purcell, Jessica; Brodin, Anders
2007-12-21
We used stochastic dynamic programming to investigate a spectacular migration strategy in the black brant Branta bernicla nigricans, a species of goose. Black brant migration is well suited for theoretical analysis since there are a number of existing strategies that easily can be compared. In early autumn, almost the entire population of the black brant gathers at Izembek Lagoon on the Alaska Peninsula to stage and refuel before the southward migration. There are at least three distinct strategies, with most geese making a spectacular direct migration more than 5000km across the Gulf of Alaska to their wintering grounds in southern Baja California or mainland Mexico. This is a potentially dangerous strategy since foraging is not possible during the overseas passage. Some individuals instead use shorter flights to make a detour along the coast, a longer route that all individuals use for northwards migration in spring. Since flight costs accelerate with increasing body mass, migration by short flights is energetically cheaper than long-distance flights. A small but increasing part of the population has recently begun to winter at Izembek. We investigated this migration under two different suppositions using a dynamic state variable model. First, if the geese are free to make a strategic choice, under what assumptions should they prefer direct migration and under what assumptions should they prefer detour migration/winter residency? Second, provided that the dominating direct migration strategy is optimal, what conditions will force the geese to go for detour migration/winter residency? In the second case the geese may try to follow an optimal direct migration strategy, but stochastic events may force them to choose a suboptimal policy. We also simulated possible effects of global warming. The model suggests that the fuel level at arrival in Izembek and fuel gain rates are key factors and that tail winds must have been reliable in the past, otherwise direct
Tanaka, Hiroki
.97Mn0.03As measured at 6 K. To calculate the Zeeman splitting energy at E0 (Gamma-CP), an experimentally reported parameter of a II-VI paramagnetic DMS, Cd 1-xMnxTe, was used due to some similarities of their electronic band structure. The Zeeman splitting energy at E0 (Gamma-CP) of Ga0.97Mn0.03As on sapphire, Ga 0.97Mn0.03As on InP, and free-standing Ga0.97Mn 0.03As was ~ 64 meV, ~ 9.6, meV and ~ 104 meV at 6 K. In addition, we found that MCD spectra around L-critical points shifted toward lower energy whereas the corresponding absorption spectra did not shift toward lower energy with an increase of Mn concentration. These results indicate that the sp-d exchange interaction in Ga1-xMn xAs has a very localized nature, because MCD is only active in a region where a band structure is affected by Mn spins, and optical absorption results from the overall sample response. This means that the sp-d exchange interactions are only generated within the sphere of influence.
A system dynamics model of a large R&D program
Ahn, Namsung
Organizations with large R&D activities must deal with a hierarchy of decision regarding resource allocation. At the highest level of allocation, the decision is related to the total allocation to R&D as some portion of revenue. The middle level of allocation deals with the allocation among phases of the R&D process. The lowest level of decisions relates to the resource allocation to specific projects within a specific phase. This study focuses on developing an R&D model to deal with the middle level of allocation, i.e., the allocation among phases of research such as basic research, development, and demonstration. The methodology used to develop the R&D model is System Dynamics. Our modeling concept is innovative in representing each phase of R&D as consisting of two parts: projects under way, and an inventory of successful but not-yet- exploited projects. In a simple world, this concept can yield an exact analytical solution for allocation of resources among phases. But in a real world, the concept should be improved by adding more complex structures with nonlinear behaviors. Two particular nonlinear feedbacks are incorporated into the R&D model. The probability of success for any specific project is assumed partly dependent upon resources allocated to the project. Further, the time required to reach a conclusion regarding the success or failure of a project is also assumed dependent upon the level of resources allocated. In addition, the number of successful projects partly depends on the inventory of potential ideas in the previous stage that can be exploited. This model can provide R&D management with insights into the effect of changing allocations to phases whether those changes are internally or externally driven. With this model, it is possible to study the effectiveness of management decisions in a continuous fashion. Managers can predict payoffs for a host of different policies. In addition, as new research results accumulate, a re- assessment of program
1991-01-01
A Science Definition Team was established in December 1990 by the Space Physics Division, NASA, to develop a satellite program to conduct research on the energetics, dynamics, and chemistry of the mesosphere and lower thermosphere/ionosphere. This two-volume publication describes the TIMED (Thermosphere-Ionosphere-Mesosphere, Energetics and Dynamics) mission and associated science program. The report outlines the scientific objectives of the mission, the program requirements, and the approach towards meeting these requirements.
Correcting sequencing errors in DNA coding regions using a dynamic programming approach
Energy Technology Data Exchange (ETDEWEB)
Xu, Y.; Mural, R.J.; Uberbacher, E.C.
1994-12-01
This paper presents an algorithm for detecting and ``correcting`` sequencing errors that occur in DNA coding regions. The types of sequencing error addressed include insertions and deletions (indels) of DNA bases. The goal is to provide a capability which makes single-pass or low-redundancy sequence data more informative, reducing the need for high-redundancy sequencing for gene identification and characterization purposes. The algorithm detects sequencing errors by discovering changes in the statistically preferred reading frame within a putative coding region and then inserts a number of ``neutral`` bases at a perceived reading frame transition point to make the putative exon candidate frame consistent. The authors have implemented the algorithm as a front-end subsystem of the GRAIL DNA sequence analysis system to construct a version which is very error tolerant and also intend to use this as a testbed for further development of sequencing error-correction technology. On a test set consisting of 68 Human DNA sequences with 1% randomly generated indels in coding regions, the algorithm detected and corrected 76% of the indels. The average distance between the position of an indel and the predicted one was 9.4 bases. With this subsystem in place, GRAIL correctly predicted 89% of the coding messages with 10% false message on the ``corrected`` sequences, compared to 69% correctly predicted coding messages and 11% falsely predicted messages on the ``corrupted`` sequences using standard GRAIL II method. The method uses a dynamic programming algorithm, and runs in time and space linear to the size of the input sequence.
Su, Bo-Han; Shen, Meng-Yu; Harn, Yeu-Chern; Wang, San-Yuan; Schurz, Alioune; Lin, Chieh; Lin, Olivia A; Tseng, Yufeng J
2017-11-15
The identification of chemical structures in natural product mixtures is an important task in drug discovery but is still a challenging problem, as structural elucidation is a time-consuming process and is limited by the available mass spectra of known natural products. Computer-aided structure elucidation (CASE) strategies seek to automatically propose a list of possible chemical structures in mixtures by utilizing chromatographic and spectroscopic methods. However, current CASE tools still cannot automatically solve structures for experienced natural product chemists. Here, we formulated the structural elucidation of natural products in a mixture as a computational problem by extending a list of scaffolds using a weighted side chain list after analyzing a collection of 243,130 natural products and designed an efficient algorithm to precisely identify the chemical structures. The complexity of such a problem is NP-complete. A dynamic programming (DP) algorithm can solve this NP-complete problem in pseudo-polynomial time after converting floating point molecular weights into integers. However, the running time of the DP algorithm degrades exponentially as the precision of the mass spectrometry experiment grows. To ideally solve in polynomial time, we proposed a novel iterative DP algorithm that can quickly recognize the chemical structures of natural products. By utilizing this algorithm to elucidate the structures of four natural products that were experimentally and structurally determined, the algorithm can search the exact solutions, and the time performance was shown to be in polynomial time for average cases. The proposed method improved the speed of the structural elucidation of natural products and helped broaden the spectrum of available compounds that could be applied as new drug candidates. A web service built for structural elucidation studies is freely accessible via the following link ( http://csccp.cmdm.tw/ ).
A dynamic programming model for optimising feeding and slaughter decisions regarding fattening pigs
Directory of Open Access Journals (Sweden)
J. K. NIEMI
2008-12-01
Full Text Available Costs of purchasing new piglets and of feeding them until slaughter are the main variable expenditures in pig fattening. They both depend on slaughter intensity, the nature of feeding patterns and the technological constraints of pig fattening, such as genotype. Therefore, it is of interest to examine the effect of production technology and changes in input and output prices on feeding and slaughter decisions. This study examines the problem by using a dynamic programming model that links genetic characteristics of a pig to feeding decisions and the timing of slaughter and takes into account how these jointly affect the quality-adjusted value of a carcass. The state of nature and the genotype of a pig are known in the analysis. The results suggest that producer can benefit from improvements in the pigs genotype. Animals of improved genotype can reach optimal slaughter maturity quicker and produce leaner meat than animals of poor genotype. In order to fully utilise the benefits of animal breeding, the producer must adjust feeding and slaughter patterns on the basis of genotype. The results also suggest that the producer can benefit from flexible feeding technology. Typically, such a technology provides incentives to feed piglets with protein-rich feed. When the pig approaches slaughter maturity, the share of protein-rich feed in the diet gradually decreases and the amount of energy-rich feed increases. Generally, the optimal slaughter weight is within the weight range that pays the highest price per kilogram of pig meat. The optimal feeding pattern and the optimal timing of slaughter depend on price ratios. Particularly, an increase in the price of pig meat provides incentives to increase the growth rates up to the pigs biological maximum by increasing the amount of energy in the feed. Price changes and changes in slaughter premium can also have large income effects.;
Unfolding Dynamics of Single Collapsed DNA Molecules
Murayama, Y.; Wada, H.; Ishida, R.; Sano, M.
We observed elastic responses of single DNA molecules and visualized them during the collapsing transition induced by trivalent cation, spermidine (SPD). The force-extension curves show worm-like behavior, force plateau, and stick-release responses depending on SPD concentration. The periodic stick-release responses may reflect the unraveling of toroidal condensates. At much higher SPD concentration, we observed re-elongation of a single collapsed DNA. For the visualization, a fluorescent dye, YOYO, was used. We observed bright spots in the fluorescence intensity profile of a collapsed DNA during stretching, which may correspond to the collapsed parts within the single DNA. The decrease of the intensity of the spots in stretching implies the mechanical unfolding of collapsed parts. Towards achieving a microscopic understanding of these experimental results, we also investigate the elastic properties of a highly charged polyelectrolyte (PE) chain by Brownian dynamics simulation method. In our dynamic simulation, a PE has a small intrinsic stiffness (i.e., the PE is semiflexible) to model the stiffness of DNA chain, and added multivalent counterions are explicitly taken into account. As the electrostatic coupling parameter (proportional to counterion valency) is increased, counterion condensation is observed, leading finally to the PE collapse through the discontinuous transition for a sufficiently large coupling parameter. Mechanical unfolding of a PE globule reveals its molecular elasticities including force plateau, in agreement with the experimental observations. A numerically deduced electrostatic condensation energy is compared to the experimental value. Charge ordering in the PE-counterion complex and its deformation by the external forcing are elucidated in conjunction with the PE elastic responses. Other dynamic effects such as the effect of a pulling speed are also discussed.
Directory of Open Access Journals (Sweden)
Gaurav Khemka
2017-10-01
Full Text Available This paper considers an alternative way of structuring stochastic variables in a dynamic programming framework where the model structure dictates that numerical methods of solution are necessary. Rather than estimating integrals within a Bellman equation using quadrature nodes, we use nodes directly from the underlying data. An example of the application of this approach is presented using individual lifetime financial modelling. The results show that data-driven methods lead to the least losses in result accuracy compared to quadrature and Quasi-Monte Carlo approaches, using historical data as a base. These results hold for both a single stochastic variable and multiple stochastic variables. The results are significant for improving the computational accuracy of lifetime financial models and other models that employ stochastic dynamic programming.
Directory of Open Access Journals (Sweden)
Elham Azimzadeh
2013-01-01
Full Text Available Objectives: Falling is a main cause of mortality in elderly. Balance training exercises can help to prevent falls in older adults. According to the principle of specificity of training, the perturbation-based trainings are more similar to the real world. So these training programs can improve balance in elderly. Furthermore, exercising in an aquatic environment can reduce the limitations for balance training rather than a non-aquatic on. The aim of this study is comparing the effectiveness of perturbed and non-perturbed balance training programs in water on static and dynamic balance in aforementioned population group. Methods & Materials: 37 old women (age 80-65, were randomized to the following groups: perturbation-based training (n=12, non-perturbation-based training (n=12 and control (n=13 groups. Static and dynamic balance had been tested before and after the eight weeks of training by the postural stability test of the Biodex balance system using dynamic (level 4 and static platform. The data were analyzed by one sample paired t-test, Independent t-test and ANOVA. Results: There was a significant improvement for all indexes of static and dynamic balance in perturbation-based training (P<0.05. However, in non-perturbed group, all indexes were improved except ML (P<0.05. ANOVA showed that perturbed training was more effective than non-perturbed training on both static and dynamic balances. Conclusion: The findings confirmed the specificity principle of training. Although balance training can improve balance abilities, these kinds of trainings are not such specific for improving balance neuromuscular activities.The perturbation-based trainings can activate postural compensatory responses and reduce falling risk. According to results, we can conclude that hydrotherapy especially with perturbation-based programs will be useful for rehabilitation interventions in elderly .
Energy Technology Data Exchange (ETDEWEB)
Masciola, M.; Jonkman, J.; Robertson, A.
2014-03-01
Techniques to model dynamic mooring lines come in various forms. The most widely used models include either a heuristic representation of the physics (such as a Lumped-Mass, LM, system), a Finite-Element Analysis (FEA) discretization of the lines (discretized in space), or a Finite-Difference (FD) model (which is discretized in both space and time). In this paper, we explore the features of the various models, weigh the advantages of each, and propose a plan for implementing one dynamic mooring line model into the open-source Mooring Analysis Program (MAP). MAP is currently used as a module for the FAST offshore wind turbine computer-aided engineering (CAE) tool to model mooring systems quasi-statically, although dynamic mooring capabilities are desired. Based on the exploration in this manuscript, the lumped-mass representation is selected for implementation in MAP based on its simplicity, computational cost, and ability to provide similar physics captured by higher-order models.
Wawro, Martha; Haden, Carol
2014-06-01
The Solar Dynamics Observatory’s (SDO) education and public outreach (EPO) team has developed and implemented a number of formal education programs for K-12 students and teachers. Programs include the Day At Goddard field trip for high school students, SDO Ambassador in the Classroom outreach to elementary classrooms, and teacher support materials for solar science education. These programs have been designed to foster student interest and engagement in science especially solar science, and increase their awareness and interest in NASA and STEM careers. Magnolia Consulting, who worked closely with the SDO EPO team to both design a substantive evaluation program, as well as improve the education programs offered, has extensively evaluated these programs. Evaluation findings indicate that teachers highly value the opportunities and resources provided by SDO EPO and that student impacts include increased interest and engagement in solar science topics and awareness of STEM careers. This presentation will be a summary of the results of the evaluation of these formal education programs including lessons learned that can be of value to the STEM EPO community.
Daneshjoo, Abdolhamid; Mokhtar, Abdul Halim; Rahnama, Nader; Yusof, Ashril
2012-01-01
Purpose The study investigated the effects of FIFA 11+ and HarmoKnee, both being popular warm-up programs, on proprioception, and on the static and dynamic balance of professional male soccer players. Methods Under 21 year-old soccer players (n = 36) were divided randomly into 11+, HarmoKnee and control groups. The programs were performed for 2 months (24 sessions). Proprioception was measured bilaterally at 30°, 45° and 60° knee flexion using the Biodex Isokinetic Dynamometer. Static and dynamic balances were evaluated using the stork stand test and Star Excursion Balance Test (SEBT), respectively. Results The proprioception error of dominant leg significantly decreased from pre- to post-test by 2.8% and 1.7% in the 11+ group at 45° and 60° knee flexion, compared to 3% and 2.1% in the HarmoKnee group. The largest joint positioning error was in the non-dominant leg at 30° knee flexion (mean error value = 5.047), (pproprioception at 45° and 60° knee flexion as well as static and dynamic balance in professional male soccer players. Data from this research may be helpful in encouraging coaches or trainers to implement the two warm-up programs in their soccer teams. PMID:23251579
Goodman, Lawrence E
2001-01-01
Beginning text presents complete theoretical treatment of mechanical model systems and deals with technological applications. Topics include introduction to calculus of vectors, particle motion, dynamics of particle systems and plane rigid bodies, technical applications in plane motions, theory of mechanical vibrations, and more. Exercises and answers appear in each chapter.
Frady, Greg; Nesman, Thomas; Zoladz, Thomas; Szabo, Roland
2010-01-01
For many years, the capabilities to determine the root-cause failure of component failures have been limited to the analytical tools and the state of the art data acquisition systems. With this limited capability, many anomalies have been resolved by adding material to the design to increase robustness without the ability to determine if the design solution was satisfactory until after a series of expensive test programs were complete. The risk of failure and multiple design, test, and redesign cycles were high. During the Space Shuttle Program, many crack investigations in high energy density turbomachines, like the SSME turbopumps and high energy flows in the main propulsion system, have led to the discovery of numerous root-cause failures and anomalies due to the coexistences of acoustic forcing functions, structural natural modes, and a high energy excitation, such as an edge tone or shedding flow, leading the technical community to understand many of the primary contributors to extremely high frequency high cycle fatique fluid-structure interaction anomalies. These contributors have been identified using advanced analysis tools and verified using component and system tests during component ground tests, systems tests, and flight. The structural dynamics and fluid dynamics communities have developed a special sensitivity to the fluid-structure interaction problems and have been able to adjust and solve these problems in a time effective manner to meet budget and schedule deadlines of operational vehicle programs, such as the Space Shuttle Program over the years.
Qian, Xiaohua; Lin, Yuan; Zhao, Yue; Wang, Jing; Liu, Jing; Zhuang, Xiahai
2015-03-01
Myocardium segmentation in cardiac magnetic resonance (MR) images plays a vital role in clinical diagnosis of the cardiovascular diseases. Because of the low contrast and large variation in intensity and shapes, myocardium segmentation has been a challenging task. A dynamic programming (DP) based segmentation method, incorporating the likelihood and shape information of the myocardium, is developed for segmenting myocardium in cardiac MR images. The endocardium, i.e., the left ventricle blood cavity, is segmented for initialization, and then the optimal epicardium contour is determined using the polar-transformed image and DP scheme. In the DP segmentation scheme, three techniques are proposed to improve the segmentation performance: (1) the likelihood image of the myocardium is constructed to define the external cost in the DP, thus the cost function incorporates prior probability estimation; (2) the adaptive search range is introduced to determine the polar-transformed image, thereby excluding irrelevant tissues; (3) the connectivity constrained DP algorithm is developed to obtain an optimal closed contour. Four metrics, including the Dice metric (Dice), root mean squared error (RMSE), reliability, and correlation coefficient, are used to assess the segmentation accuracy. The authors evaluated the performance of the proposed method on a private dataset and the MICCAI 2009 challenge dataset. The authors also explored the effects of the three new techniques of the DP scheme in the proposed method. For the qualitative evaluation, the segmentation results of the proposed method were clinically acceptable. For the quantitative evaluation, the mean (Dice) for the endocardium and epicardium was 0.892 and 0.927, respectively; the mean RMSE was 2.30 mm for the endocardium and 2.39 mm for the epicardium. In addition, the three new techniques in the proposed DP scheme, i.e., the likelihood image of the myocardium, the adaptive search range, and the connectivity constrained
Turner, Sean; Galelli, Stefano; Wilcox, Karen
2015-04-01
Water reservoir systems are often affected by recurring large-scale ocean-atmospheric anomalies, known as teleconnections, that cause prolonged periods of climatological drought. Accurate forecasts of these events -- at lead times in the order of weeks and months -- may enable reservoir operators to take more effective release decisions to improve the performance of their systems. In practice this might mean a more reliable water supply system, a more profitable hydropower plant or a more sustainable environmental release policy. To this end, climate indices, which represent the oscillation of the ocean-atmospheric system, might be gainfully employed within reservoir operating models that adapt the reservoir operation as a function of the climate condition. This study develops a Stochastic Dynamic Programming (SDP) approach that can incorporate climate indices using a Hidden Markov Model. The model simulates the climatic regime as a hidden state following a Markov chain, with the state transitions driven by variation in climatic indices, such as the Southern Oscillation Index. Time series analysis of recorded streamflow data reveals the parameters of separate autoregressive models that describe the inflow to the reservoir under three representative climate states ("normal", "wet", "dry"). These models then define inflow transition probabilities for use in a classic SDP approach. The key advantage of the Hidden Markov Model is that it allows conditioning the operating policy not only on the reservoir storage and the antecedent inflow, but also on the climate condition, thus potentially allowing adaptability to a broader range of climate conditions. In practice, the reservoir operator would effect a water release tailored to a specific climate state based on available teleconnection data and forecasts. The approach is demonstrated on the operation of a realistic, stylised water reservoir with carry-over capacity in South-East Australia. Here teleconnections relating
Wölfer, Ralf; Scheithauer, Herbert
2014-01-01
Bullying is a social phenomenon and although preventive interventions consequently address social mechanisms, evaluations hardly consider the complexity of peer processes. Therefore, the present study analyzes the efficacy of the fairplayer.manual bullying prevention program from a social network perspective. Within a pretest-posttest control group design, longitudinal data were available from 328 middle-school students (MAge = 13.7 years; 51% girls), who provided information on bullying behavior and interaction patterns. The revealed network parameters were utilized to examine the network change (MANCOVA) and the network dynamics (SIENA). Across both forms of analyses, findings revealed the hypothesized intervention-based decrease of bullies' social influence. Hence the present bullying prevention program, as one example of programs that successfully addresses both individual skills and social mechanisms, demonstrates the desired effect of reducing contextual opportunities for the exhibition of bullying behavior. © 2014 Wiley Periodicals, Inc.
Directory of Open Access Journals (Sweden)
Livia BOBU
2015-09-01
Full Text Available In most of the developing countries, dental caries continues to represent a major issue of public health. In Romania, the National Program for Oral and Dental Diseases Prevention was implemented between 1999-2010, addressed to children attending primary school and consisting of weekly mouth rinses with 0.2% NaF solution. In the present study, the dynamic evolution of oral health status of schoolchildren aged 6-12 years in Iasi, under the impact of this Program, was analyzed. The results showed a decreasing trend in the prevalence and incidence of dental caries, a constant decrease of caries experience indices DMFT and DMFS and, within them, the increasing trend of fillings indicator FS and the decrease of deep lesions weight. The conclusion is that tooth decay has declined in schoolchildren in Iasi during the development of the National Prevention Program.
Energy Technology Data Exchange (ETDEWEB)
Sabah, Fayroz A., E-mail: fayroz-arif@yahoo.com [Institue of Nano-Optoelectronics Research and Technology (INOR), School of Physics, Universiti Sains Malaysia, 11800 Penang (Malaysia); Department of Electrical Engineering, College of Engineering, Al-Mustansiriya University, Baghdad (Iraq); Ahmed, Naser M., E-mail: naser@usm.my; Hassan, Z., E-mail: zai@usm.my; Azzez, Shrook A. [Institue of Nano-Optoelectronics Research and Technology (INOR), School of Physics, Universiti Sains Malaysia, 11800 Penang (Malaysia); Rasheed, Hiba S., E-mail: hibasaad1980@yahoo.com [Institue of Nano-Optoelectronics Research and Technology (INOR), School of Physics, Universiti Sains Malaysia, 11800 Penang (Malaysia); Department of Physics, College of Education, Al-Mustansiriya University, Baghdad (Iraq); Al-Hazim, Nabeel Z., E-mail: nabeelnano333@gmail.com [Institue of Nano-Optoelectronics Research and Technology (INOR), School of Physics, Universiti Sains Malaysia, 11800 Penang (Malaysia); Ministry of Education, the General Directorate for Educational Anbar (Iraq)
2016-07-06
The copper sulphide (CuS) thin films were grown with good adhesion by spray pyrolysis deposition (SPD) on Ti, ITO and glass substrates at 200 °C. The distance between nozzle and substrate is 30 cm. The composition was prepared by mixing copper chloride CuCl{sub 2}.2H{sub 2}O as a source of Cu{sup 2+} and sodium thiosulfate Na{sub 2}S{sub 2}O{sub 3}.5H{sub 2}O as a source of and S{sup 2−}. Two concentrations (0.2 and 0.4 M) were used for each CuCl{sub 2} and Na{sub 2}S{sub 2}O{sub 3} to be prepared and then sprayed (20 ml). The process was started by spraying the solution for 3 seconds and after 10 seconds the cycle was repeated until the solution was sprayed completely on the hot substrates. The structural characteristics were studied using X-ray diffraction; they showed covellite CuS hexagonal crystal structure for 0.2 M concentration, and covellite CuS hexagonal crystal structure with two small peaks of chalcocite Cu{sub 2}S hexagonal crystal structure for 0.4 M concentration. Also the surface and electrical characteristics were investigated using Field Emission Scanning Electron Microscopy (FESEM) and current source device, respectively. The surface study for the CuS thin films showed nanorods to be established for 0.2 M concentration and mix of nanorods and nanoplates for 0.4 M concentration. The electrical study showed ohmic behavior and low resistivity for these films. Hall Effect was measured for these thin films, it showed that all samples of CuS are p- type thin films and ensured that the resistivity for thin films of 0.2 M concentration was lower than that of 0.4 M concentration; and for the two concentrations CuS thin film deposited on ITO had the lowest resistivity. This leads to the result that the conductivity was high for CuS thin film deposited on ITO substrate, and the conductivity of the three thin films of 0.2 M concentration was higher than that of 0.4 M concentration.
Modelling the Influence of Awareness Programs by Media on the Drinking Dynamics
Directory of Open Access Journals (Sweden)
Hai-Feng Huo
2014-01-01
Full Text Available We develop a nonlinear mathematical model with the effect of awareness programs on the binge drinking. Due to the fact that awareness programs are capable of inducing behavioral changes in nondrinkers, we introduce a separate class by avoiding contacts with the heavy drinkers. Furthermore we assume that cumulative density of awareness programs increases at a rate proportional to the number of heavy drinkers. We establish some sufficient conditions for the stability of the alcohol free and the alcohol present equilibria and give some numerical simulations to explain our main result. Our results show that awareness programs is an effective measure in reducing alcohol problems.
A new version of a computer program for dynamical calculations of RHEED intensity oscillations
Daniluk, Andrzej; Skrobas, Kazimierz
2006-01-01
We present a new version of the RHEED program which contains a graphical user interface enabling the use of the program in the graphical environment. The presented program also contains a graphical component which enables displaying program data at run-time through an easy-to-use graphical interface. New version program summaryTitle of program: RHEEDGr Catalogue identifier: ADWV Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWV Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Catalogue identifier of previous version: ADUY Authors of the original program: A. Daniluk Does the new version supersede the original program: no Computer for which the new version is designed and others on which it has been tested: Pentium-based PC Operating systems or monitors under which the new version has been tested: Windows 9x, XP, NT Programming language used: Borland C++ Builder Memory required to execute with typical data: more than 1 MB Number of bits in a word: 64 bits Number of processors used: 1 Number of lines in distributed program, including test data, etc.: 5797 Number of bytes in distributed program, including test data, etc.: 588 121 Distribution format: tar.gz Nature of physical problem: Reflection high-energy electron diffraction (RHEED) is a very useful technique for studying growth and surface analysis of thin epitaxial structures prepared by the molecular beam epitaxy (MBE). The RHEED technique can reveal, almost instantaneously, changes either in the coverage of the sample surface by adsorbates or in the surface structure of a thin film. Method of solution: RHEED intensities are calculated within the framework of the general matrix formulation of Peng and Whelan [1] under the one-beam condition. Reasons for the new version: Responding to the user feedback we designed a graphical package that enables displaying program data at run-time through an easy-to-use graphical interface. Summary of revisions:In the present form
First results of operational ionospheric dynamics prediction for the Brazilian Space Weather program
Petry, Adriano; de Souza, Jonas Rodrigues; de Campos Velho, Haroldo Fraga; Pereira, André Grahl; Bailey, Graham John
2014-07-01
It is shown the development and preliminary results of operational ionosphere dynamics prediction system for the Brazilian Space Weather program. The system is based on the Sheffield University Plasmasphere-Ionosphere Model (SUPIM), a physics-based model computer code describing the distribution of ionization within the Earth mid to equatorial latitude ionosphere and plasmasphere, during geomagnetically quiet periods. The model outputs are given in a 2-dimensional plane aligned with Earth magnetic field lines, with fixed magnetic longitude coordinate. The code was adapted to provide the output in geographical coordinates. It was made referring to the Earth’s magnetic field as an eccentric dipole, using the approximation based on International Geomagnetic Reference Field (IGRF-11). During the system operation, several simulation runs are performed at different longitudes. The original code would not be able to run all simulations serially in reasonable time. So, a parallel version for the code was developed for enhancing the performance. After preliminary tests, it was frequently observed code instability, when negative ion temperatures or concentrations prevented the code from continuing its processing. After a detailed analysis, it was verified that most of these problems occurred due to concentration estimation of simulation points located at high altitudes, typically over 4000 km of altitude. In order to force convergence, an artificial exponential decay for ion-neutral collisional frequency was used above mentioned altitudes. This approach shown no significant difference from original code output, but improved substantially the code stability. In order to make operational system even more stable, the initial altitude and initial ion concentration values used on exponential decay equation are changed when convergence is not achieved, within pre-defined values. When all code runs end, the longitude of every point is then compared with its original reference
Cavity contour segmentation in chest radiographs using supervised learning and dynamic programming
Energy Technology Data Exchange (ETDEWEB)
Maduskar, Pragnya, E-mail: pragnya.maduskar@radboudumc.nl; Hogeweg, Laurens; Sánchez, Clara I.; Ginneken, Bram van [Diagnostic Image Analysis Group, Radboud University Medical Center, Nijmegen, 6525 GA (Netherlands); Jong, Pim A. de [Department of Radiology, University Medical Center Utrecht, 3584 CX (Netherlands); Peters-Bax, Liesbeth [Department of Radiology, Radboud University Medical Center, Nijmegen, 6525 GA (Netherlands); Dawson, Rodney [University of Cape Town Lung Institute, Cape Town 7700 (South Africa); Ayles, Helen [Department of Infectious and Tropical Diseases, London School of Hygiene and Tropical Medicine, London WC1E 7HT (United Kingdom)
2014-07-15
Purpose: Efficacy of tuberculosis (TB) treatment is often monitored using chest radiography. Monitoring size of cavities in pulmonary tuberculosis is important as the size predicts severity of the disease and its persistence under therapy predicts relapse. The authors present a method for automatic cavity segmentation in chest radiographs. Methods: A two stage method is proposed to segment the cavity borders, given a user defined seed point close to the center of the cavity. First, a supervised learning approach is employed to train a pixel classifier using texture and radial features to identify the border pixels of the cavity. A likelihood value of belonging to the cavity border is assigned to each pixel by the classifier. The authors experimented with four different classifiers:k-nearest neighbor (kNN), linear discriminant analysis (LDA), GentleBoost (GB), and random forest (RF). Next, the constructed likelihood map was used as an input cost image in the polar transformed image space for dynamic programming to trace the optimal maximum cost path. This constructed path corresponds to the segmented cavity contour in image space. Results: The method was evaluated on 100 chest radiographs (CXRs) containing 126 cavities. The reference segmentation was manually delineated by an experienced chest radiologist. An independent observer (a chest radiologist) also delineated all cavities to estimate interobserver variability. Jaccard overlap measure Ω was computed between the reference segmentation and the automatic segmentation; and between the reference segmentation and the independent observer's segmentation for all cavities. A median overlap Ω of 0.81 (0.76 ± 0.16), and 0.85 (0.82 ± 0.11) was achieved between the reference segmentation and the automatic segmentation, and between the segmentations by the two radiologists, respectively. The best reported mean contour distance and Hausdorff distance between the reference and the automatic segmentation were
Zhang, Shuo; Zhang, Chengning; Han, Guangwei; Wang, Qinghui
2014-01-01
A dual-motor coupling-propulsion electric bus (DMCPEB) is modeled, and its optimal control strategy is studied in this paper. The necessary dynamic features of energy loss for subsystems is modeled. Dynamic programming (DP) technique is applied to find the optimal control strategy including upshift threshold, downshift threshold, and power split ratio between the main motor and auxiliary motor. Improved control rules are extracted from the DP-based control solution, forming near-optimal control strategies. Simulation results demonstrate that a significant improvement in reducing energy loss due to the dual-motor coupling-propulsion system (DMCPS) running is realized without increasing the frequency of the mode switch. PMID:25540814
Amin, Talha
2013-01-01
In the paper, we present a comparison of dynamic programming and greedy approaches for construction and optimization of approximate decision rules relative to the number of misclassifications. We use an uncertainty measure that is a difference between the number of rows in a decision table T and the number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules that localize rows in subtables of T with uncertainty at most γ. Experimental results with decision tables from the UCI Machine Learning Repository are also presented. © 2013 Springer-Verlag.
Robust Adaptive Dynamic Programming of Two-Player Zero-Sum Games for Continuous-Time Linear Systems.
Fu, Yue; Fu, Jun; Chai, Tianyou
2015-12-01
In this brief, an online robust adaptive dynamic programming algorithm is proposed for two-player zero-sum games of continuous-time unknown linear systems with matched uncertainties, which are functions of system outputs and states of a completely unknown exosystem. The online algorithm is developed using the policy iteration (PI) scheme with only one iteration loop. A new analytical method is proposed for convergence proof of the PI scheme. The sufficient conditions are given to guarantee globally asymptotic stability and suboptimal property of the closed-loop system. Simulation studies are conducted to illustrate the effectiveness of the proposed method.
Qiu, J. P.; Niu, D. X.
Micro-grid is one of the key technologies of the future energy supplies. Take economic planning. reliability, and environmental protection of micro grid as a basis for the analysis of multi-strategy objective programming problems for micro grid which contains wind power, solar power, and battery and micro gas turbine. Establish the mathematical model of each power generation characteristics and energy dissipation. and change micro grid planning multi-objective function under different operating strategies to a single objective model based on AHP method. Example analysis shows that in combination with dynamic ant mixed genetic algorithm can get the optimal power output of this model.
Takano, Yu; Nakata, Kazuto; Yonezawa, Yasushige; Nakamura, Haruki
2016-05-05
A massively parallel program for quantum mechanical-molecular mechanical (QM/MM) molecular dynamics simulation, called Platypus (PLATform for dYnamic Protein Unified Simulation), was developed to elucidate protein functions. The speedup and the parallelization ratio of Platypus in the QM and QM/MM calculations were assessed for a bacteriochlorophyll dimer in the photosynthetic reaction center (DIMER) on the K computer, a massively parallel computer achieving 10 PetaFLOPs with 705,024 cores. Platypus exhibited the increase in speedup up to 20,000 core processors at the HF/cc-pVDZ and B3LYP/cc-pVDZ, and up to 10,000 core processors by the CASCI(16,16)/6-31G** calculations. We also performed excited QM/MM-MD simulations on the chromophore of Sirius (SIRIUS) in water. Sirius is a pH-insensitive and photo-stable ultramarine fluorescent protein. Platypus accelerated on-the-fly excited-state QM/MM-MD simulations for SIRIUS in water, using over 4000 core processors. In addition, it also succeeded in 50-ps (200,000-step) on-the-fly excited-state QM/MM-MD simulations for the SIRIUS in water. © 2016 The Authors. Journal of Computational Chemistry Published by Wiley Periodicals, Inc.
THE DEVELOPMENT OF AN EBook WITH DYNAMIC CONTENT FOR THE INTRODUCTION OF ALGORITHMS and PROGRAMMING
Directory of Open Access Journals (Sweden)
Gürcan Çetin
2016-12-01
Full Text Available It is very important that the content of Algorithms and Programming course is understood by Computer Engineering students. The eBook designed in this study provides a better explanation of the flow diagrams and programming logic of the algorithms used in the introduction to programming, as well as the abstract processing steps in the computer memory and CPU during programming are animated and visualized by means of computer animations and simulations. The EPUB 3.0 based training content, developed by using animation and interactive content, is expected to create new opportunities for students at anytime and anywhere access. This work also includes the development process of an EPUB 3.0 based eBook for use on computers or mobile devices.
Directory of Open Access Journals (Sweden)
Serhii Kalmykov
2017-12-01
Full Text Available Purpose: to study hemodynamic parameters and the reaction of the cardiovascular system to the dosed physical load of patients combined aortic defect with heart failure of the I degree under the influence of the complex physical therapy program developed by us during the rehabilitation process. Material & Methods: the study involved 26 middle-aged men with a diagnosis: combined aortic valve disease, HF I st. Result: dynamics of functional parameters of the cardiovascular system of patients under the influence of the physical therapy program is analyzed. Conclusion: the combination of morning hygienic gymnastics, therapeutic gymnastics, independent activities and dosed walking with a therapeutic massage contributes to the normalization of vascular tone, motor-vascular reflexes and blood pressure, increasing the tolerance of the cardiovascular system to physical activity.
Directory of Open Access Journals (Sweden)
Rodica Rotberg
2004-01-01
Full Text Available A program for the non-steady state calculus of the thermal condition of buildings is proposed. A harmonical model has been used to creating this program. The detailed presentation of the algorithm is followed by a case study drawn up for an enclosure with load-bearing masonry structure situated at intermediate and terminal layers, at different moments: in winter, when the heating is cut-off, and in summer.
No tests required : comparing traditional and dynamic predictors of programming success.
Watson, Christopher; Frederick W.B. Li; Godwin, Jamie L.
2014-01-01
Research over the past fifty years into predictors of programming performance has yielded little improvement in the identification of at-risk students. This is possibly because research to date is based upon using static tests, which fail to reflect changes in a student's learning progress over time. In this paper, the effectiveness of 38 traditional predictors of programming performance are compared to 12 new data-driven predictors, that are based upon analyzing directly logged data, describ...
VanderWijngaart, Rob F.; Biswas, Rupak; Frumkin, Michael; Feng, Huiyu; Biegel, Bryan (Technical Monitor)
2001-01-01
The contents include: 1) A brief history of NPB; 2) What is (not) being measured by NPB; 3) Irregular dynamic applications (UA Benchmark); and 4) Wide area distributed computing (NAS Grid Benchmarks-NGB). This paper is presented in viewgraph form.
Approximate Dynamic Programming techniques for skill-based routing in call centres
Roubos, D.; Bhulai, S.
2012-01-01
We consider the problem of dynamic multi-skill routing in call centers. Calls from different customer classes are offered to the call center according to a Poisson process. The agents are grouped into pools according to their heterogeneous skill sets that determine the calls that they can handle.
JED: a Java Essential Dynamics Program for comparative analysis of protein trajectories.
David, Charles C; Singam, Ettayapuram Ramaprasad Azhagiya; Jacobs, Donald J
2017-05-25
Essential Dynamics (ED) is a common application of principal component analysis (PCA) to extract biologically relevant motions from atomic trajectories of proteins. Covariance and correlation based PCA are two common approaches to determine PCA modes (eigenvectors) and their eigenvalues. Protein dynamics can be characterized in terms of Cartesian coordinates or internal distance pairs. In understanding protein dynamics, a comparison of trajectories taken from a set of proteins for similarity assessment provides insight into conserved mechanisms. Comprehensive software is needed to facilitate comparative-analysis with user-friendly features that are rooted in best practices from multivariate statistics. We developed a Java based Essential Dynamics toolkit called JED to compare the ED from multiple protein trajectories. Trajectories from different simulations and different proteins can be pooled for comparative studies. JED implements Cartesian-based coordinates (cPCA) and internal distance pair coordinates (dpPCA) as options to construct covariance (Q) or correlation (R) matrices. Statistical methods are implemented for treating outliers, benchmarking sampling adequacy, characterizing the precision of Q and R, and reporting partial correlations. JED output results as text files that include transformed coordinates for aligned structures, several metrics that quantify protein mobility, PCA modes with their eigenvalues, and displacement vector (DV) projections onto the top principal modes. Pymol scripts together with PDB files allow movies of individual Q- and R-cPCA modes to be visualized, and the essential dynamics occurring within user-selected time scales. Subspaces defined by the top eigenvectors are compared using several statistical metrics to quantify similarity/overlap of high dimensional vector spaces. Free energy landscapes can be generated for both cPCA and dpPCA. JED offers a convenient toolkit that encourages best practices in applying multivariate
Whyte, E F; Richter, C; O'Connor, S; Moran, K A
2018-02-01
Deficits in trunk control predict ACL injuries which frequently occur during high-risk activities such as cutting. However, no existing trunk control/core stability program has been found to positively affect trunk kinematics during cutting activities. This study investigated the effectiveness of a 6-week dynamic core stability program (DCS) on the biomechanics of anticipated and unanticipated side and crossover cutting maneuvers. Thirty-one male, varsity footballers participated in this randomized controlled trial. Three-dimensional trunk and lower limb biomechanics were captured in a motion analysis laboratory during the weight acceptance phase of anticipated and unanticipated side and crossover cutting maneuvers at baseline and 6-week follow-up. The DCS group performed a DCS program three times weekly for 6 weeks in a university rehabilitation room. Both the DCS and control groups concurrently completed their regular practice and match play. Statistical parametric mapping and repeated measures analysis of variance were used to determine any group (DCS vs control) by time (pre vs post) interactions. The DCS resulted in greater internal hip extensor (P=.017, η 2 =0.079), smaller internal knee valgus (P=.026, η 2 =0.076), and smaller internal knee external rotator moments (P=.041, η 2 =0.066) during anticipated side cutting compared with the control group. It also led to reduced posterior ground reaction forces for all cutting activities (P=.015-.030, η 2 =0.074-0.105). A 6-week DCS program did not affect trunk kinematics, but it did reduce a small number of biomechanical risk factors for ACL injury, predominantly during anticipated side cutting. A DCS program could play a role in multimodal ACL injury prevention programs. © 2017 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.
Liao, Bolin; Zhang, Yunong; Jin, Long
2016-02-01
In this paper, a new Taylor-type numerical differentiation formula is first presented to discretize the continuous-time Zhang neural network (ZNN), and obtain higher computational accuracy. Based on the Taylor-type formula, two Taylor-type discrete-time ZNN models (termed Taylor-type discrete-time ZNNK and Taylor-type discrete-time ZNNU models) are then proposed and discussed to perform online dynamic equality-constrained quadratic programming. For comparison, Euler-type discrete-time ZNN models (called Euler-type discrete-time ZNNK and Euler-type discrete-time ZNNU models) and Newton iteration, with interesting links being found, are also presented. It is proved herein that the steady-state residual errors of the proposed Taylor-type discrete-time ZNN models, Euler-type discrete-time ZNN models, and Newton iteration have the patterns of O(h(3)), O(h(2)), and O(h), respectively, with h denoting the sampling gap. Numerical experiments, including the application examples, are carried out, of which the results further substantiate the theoretical findings and the efficacy of Taylor-type discrete-time ZNN models. Finally, the comparisons with Taylor-type discrete-time derivative model and other Lagrange-type discrete-time ZNN models for dynamic equality-constrained quadratic programming substantiate the superiority of the proposed Taylor-type discrete-time ZNN models once again.
Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun
2016-02-01
As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.
Nordin, Noraimi Azlin Mohd; Omar, Mohd; Sharif, S. Sarifah Radiah
2017-04-01
Companies are looking forward to improve their productivity within their warehouse operations and distribution centres. In a typical warehouse operation, order picking contributes more than half percentage of the operating costs. Order picking is a benchmark in measuring the performance and productivity improvement of any warehouse management. Solving order picking problem is crucial in reducing response time and waiting time of a customer in receiving his demands. To reduce the response time, proper routing for picking orders is vital. Moreover, in production line, it is vital to always make sure the supplies arrive on time. Hence, a sample routing network will be applied on EP Manufacturing Berhad (EPMB) as a case study. The Dijkstra's algorithm and Dynamic Programming method are applied to find the shortest distance for an order picker in order picking. The results show that the Dynamic programming method is a simple yet competent approach in finding the shortest distance to pick an order that is applicable in a warehouse within a short time period.
Van Der Borght, Stefaan; Schim Van Der Loeff, Maarten Franciscus; Clevenbergh, Philippe; Kabarega, Jean Pierre; Kamo, Emmanuel; Van Cranenburgh, Katinka; Rijckborst, Henk; Lange, Joep M; Rinke De Wit, Tobias Floris
2010-01-01
International audience; High uptake of HIV voluntary counselling and testing (VCT) services is important for the success of HIV workplace programs in sub-Saharan Africa. From 2001 onwards Heineken, a multinational brewing company, implemented a comprehensive HIV prevention and treatment program for employees and their dependents of its African subsidiaries. Confidential in-house VCT is part of this program. VCT uptake dynamics over time, and factors associated with early uptake were studied. ...
2010-01-01
Abstract High uptake of HIV voluntary counselling and testing (VCT) services is important for the success of HIV workplace programs in sub-Saharan Africa. From 2001 onwards Heineken, a multinational brewing company, implemented a comprehensive HIV prevention and treatment program for employees and their dependents of its African subsidiaries. Confidential in-house VCT is part of this program. VCT uptake dynamics over time, and factors associated with early uptake were studied. Be...
Energy Technology Data Exchange (ETDEWEB)
Panin, Anatoly, E-mail: a.panin@fz-juelich.de [Forschungszentrum Jülich GmbH, Institut für Energie- und Klimaforschung – Plasmaphysik, 52425 Jülich (Germany); Khovayko, Mikhail [St. Petersburg Polytechnic University, Mechanics and Control Processes Department, Computational Mechanics Laboratory, 195251 St. Petersburg (Russian Federation); Krasikov, Yury [Forschungszentrum Jülich GmbH, Institut für Energie- und Klimaforschung – Plasmaphysik, 52425 Jülich (Germany); Nemov, Alexander [St. Petersburg Polytechnic University, Mechanics and Control Processes Department, Computational Mechanics Laboratory, 195251 St. Petersburg (Russian Federation); Biel, Wolfgang; Mertens, Philippe; Neubauer, Olaf; Schrader, Michael [Forschungszentrum Jülich GmbH, Institut für Energie- und Klimaforschung – Plasmaphysik, 52425 Jülich (Germany)
2015-10-15
To prolong a lifetime of the ITER first diagnostic mirrors some protective shutters can be engaged. A concept of an elastic shutter that operates frictionless in vacuum has been studied at the Forschungszentrum Jülich, Germany. Under actuation two shutter arms (∼2 m long) bend laterally between two pairs of limiting bumpers thus shielding the optical aperture or opening it for measurements. To increase the shutter efficiency the transition time between its open and closed states can be minimized. This demands a fast shutter that operates in fractions of a second and exhibit essentially dynamic behavior, like impacts with the bumpers that cause the shutter arms’ bouncing and oscillations. The paper presents numerical studies of the shutter dynamic behavior using the explicit and implicit 3D FE transient structural modeling. Simple 1D analytical model was developed to predict the shutter impact kinetic energy that mostly determines its further dynamic response. The structure sensitivity to different parameters was studied and ways for its optimization were laid down. A parametric shutter mockup with easily changeable mechanical characteristics was manufactured. A test program aimed for further shutter optimization, basing on the analysis performed and engaging powerful capabilities of the parametric shutter mockup is discussed in the paper.
Functional Programming for Dynamic and Large Data with Self-Adjusting Computation
Chen, Yan; Acar, Umut A.; Tangwongsan, Kanat
2014-01-01
International audience; Combining type theory, language design, and empirical work, we present techniques for computing with large and dynamically changing datasets. Based on lambda calculus, our techniques are suitable for expressing a diverse set of algorithms on large datasets and, via self-adjusting computation, enable computations to respond automatically to changes in their data. To improve the scalability of self-adjusting computation, we present a type system for precise dependency tr...
DYNAMIC COMPLEMENTARITY IN EXPORT PROMOTION: THE MARKET ACCESS PROGRAM IN FRUITS AND VEGETABLES
Richards, Timothy J.; Patterson, Paul M.
1998-01-01
Government-supported promotion in foreign markets may justified when market failures exist, such as spillover externalities, where promotion of one commodity positively influences exports of another, or when market uncertainties cause planning horizons to be shorter than the persistent effects of promotion. A dynamic model of U.S. apple, almond, grape, and wine export supply is developed to test for these market failures. Promotion is viewed as an investment in establishing and maintaining a ...
Stochastic linear dynamical programming in order to apply it in energy modelling
Energy Technology Data Exchange (ETDEWEB)
El Hachem, S.
1995-11-01
This thesis contributes to the development of new algorithms for the computation of stochastic dynamic problem and its mini-maxi variant for the case of imperfect knowledge on random data. The proposed algorithms are scenarios aggregation type. It also contributes to integrate these algorithms in a decision support approach and to discuss the stochastic modeling of two energy problems: the refining and the portfolio gas contracts. (author). 112 refs., 5 tabs.
Disentangling the dynamic core: a research program for a neurodynamics at the large-scale.
Le Van Quyen, Michel
2003-01-01
My purpose in this paper is to sketch a research direction based on Francisco Varela's pioneering work in neurodynamics (see also Rudrauf et al. 2003, in this issue). Very early on he argued that the internal coherence of every mental-cognitive state lies in the global self-organization of the brain activities at the large-scale, constituting a fundamental pole of integration called here a "dynamic core". Recent neuroimaging evidence appears to broadly support this hypothesis and suggests that a global brain dynamics emerges at the large scale level from the cooperative interactions among widely distributed neuronal populations. Despite a growing body of evidence supporting this view, our understanding of these large-scale brain processes remains hampered by the lack of a theoretical language for expressing these complex behaviors in dynamical terms. In this paper, I propose a rough cartography of a comprehensive approach that offers a conceptual and mathematical framework to analyze spatio-temporal large-scale brain phenomena. I emphasize how these nonlinear methods can be applied, what property might be inferred from neuronal signals, and where one might productively proceed for the future. This paper is dedicated, with respect and affection, to the memory of Francisco Varela.
Directory of Open Access Journals (Sweden)
Abdolhamid Daneshjoo
Full Text Available PURPOSE: The study investigated the effects of FIFA 11+ and HarmoKnee, both being popular warm-up programs, on proprioception, and on the static and dynamic balance of professional male soccer players. METHODS: Under 21 year-old soccer players (n = 36 were divided randomly into 11+, HarmoKnee and control groups. The programs were performed for 2 months (24 sessions. Proprioception was measured bilaterally at 30°, 45° and 60° knee flexion using the Biodex Isokinetic Dynamometer. Static and dynamic balances were evaluated using the stork stand test and Star Excursion Balance Test (SEBT, respectively. RESULTS: The proprioception error of dominant leg significantly decreased from pre- to post-test by 2.8% and 1.7% in the 11+ group at 45° and 60° knee flexion, compared to 3% and 2.1% in the HarmoKnee group. The largest joint positioning error was in the non-dominant leg at 30° knee flexion (mean error value = 5.047, (p<0.05. The static balance with the eyes opened increased in the 11+ by 10.9% and in the HarmoKnee by 6.1% (p<0.05. The static balance with eyes closed significantly increased in the 11+ by 12.4% and in the HarmoKnee by 17.6%. The results indicated that static balance was significantly higher in eyes opened compared to eyes closed (p = 0.000. Significant improvements in SEBT in the 11+ (12.4% and HarmoKnee (17.6% groups were also found. CONCLUSION: Both the 11+ and HarmoKnee programs were proven to be useful warm-up protocols in improving proprioception at 45° and 60° knee flexion as well as static and dynamic balance in professional male soccer players. Data from this research may be helpful in encouraging coaches or trainers to implement the two warm-up programs in their soccer teams.
Optimizing the herd calving pattern with linear programming and dynamic probabilistic simulation.
Jalvingh, A.W.; Dijkhuizen, A.A.; Arendonk, van J.A.M.
1994-01-01
Until recently, little attention has been paid to the influence of seasonal variation in performance and prices on the optimal calving pattern of a herd. A method was developed to determine the herd calving pattern that is farm-specific and optimal with use of linear programming. The required
Griffith, Daniel; Bedford, Marilyn; Hundley, Stephen
2008-01-01
Traditional leadership development programs for higher education staff are challenged to blend theory with a real-world context that is meaningful to participants' work. Standard student leadership curriculum is strong on theory, but often thin on providing this real-world context. Both HR training departments and academic units charged with…
2012-03-30
... inform stakeholders on the progress, products, and plans of the two programs, and to seek input from... transform future surface transportation systems management. The DCM is the creation and expansion of access... connected vehicles (automobiles, buses, trucks, fleets), mobile devices, and infrastructure. To learn more...
Human seat interaction simulation using RAMSIS and the dynamic simulation program MADYMO
Happee, R.; Loczi, J.
1999-01-01
Both RAMSIS and MADYMO are widely applied for computer aided vehicle design. Both programs are used to simulate occupant-vehicle interactions where RAMSIS focuses on ergonomics in normal driving conditions and MADYMO focuses on passive safety in impact conditions. This paper describes simulations of
A Dynamical Systems Theory Examination of Social Connections in Outdoor Recreation Programs
Jostad, Jeremy
2015-01-01
Adolescence is a developmental time period in which social connections are an important aspect to fostering positive growth and identity. Outdoor Adventure Education (OAE) programs are strategically positioned to help in this developmental process because of the novel social environment, however, little is known about how these types of social…
Dang, Shilpa; Chaudhury, Santanu; Lall, Brejesh; Roy, Prasun Kumar
2017-06-15
Determination of effective connectivity (EC) among brain regions using fMRI is helpful in understanding the underlying neural mechanisms. Dynamic Bayesian Networks (DBNs) are an appropriate class of probabilistic graphical temporal-models that have been used in past to model EC from fMRI, specifically order-one. High-order DBNs (HO-DBNs) have still not been explored for fMRI data. A fundamental problem faced in the structure-learning of HO-DBN is high computational-burden and low accuracy by the existing heuristic search techniques used for EC detection from fMRI. In this paper, we propose using dynamic programming (DP) principle along with integration of properties of scoring-function in a way to reduce search space for structure-learning of HO-DBNs and finally, for identifying EC from fMRI which has not been done yet to the best of our knowledge. The proposed exact search-&-score learning approach HO-DBN-DP is an extension of the technique which was originally devised for learning a BN's structure from static data (Singh and Moore, 2005). The effectiveness in structure-learning is shown on synthetic fMRI dataset. The algorithm reaches globally-optimal solution in appreciably reduced time-complexity than the static counterpart due to integration of properties. The proof of optimality is provided. The results demonstrate that HO-DBN-DP is comparably more accurate and faster than currently used structure-learning algorithms used for identifying EC from fMRI. The real data EC from HO-DBN-DP shows consistency with previous literature than the classical Granger Causality method. Hence, the DP algorithm can be employed for reliable EC estimates from experimental fMRI data. Copyright © 2017 Elsevier B.V. All rights reserved.
Directory of Open Access Journals (Sweden)
S. Sofana Reka
2016-09-01
Full Text Available This paper proposes a cloud computing framework in smart grid environment by creating small integrated energy hub supporting real time computing for handling huge storage of data. A stochastic programming approach model is developed with cloud computing scheme for effective demand side management (DSM in smart grid. Simulation results are obtained using GUI interface and Gurobi optimizer in Matlab in order to reduce the electricity demand by creating energy networks in a smart hub approach.
A dynamic programming approach for quickly estimating large network-based MEV models
DEFF Research Database (Denmark)
Mai, Tien; Frejinger, Emma; Fosgerau, Mogens
2017-01-01
We propose a way to estimate a family of static Multivariate Extreme Value (MEV) models with large choice sets in short computational time. The resulting model is also straightforward and fast to use for prediction. Following Daly and Bierlaire (2006), the correlation structure is defined by a ro...... to converge (4.3 h on an Intel(R) 3.2 GHz machine using a non-parallelized code). We also show that our approach allows to estimate a cross-nested logit model of 111 nests with a real data set of more than 100,000 observations in 14 h.......We propose a way to estimate a family of static Multivariate Extreme Value (MEV) models with large choice sets in short computational time. The resulting model is also straightforward and fast to use for prediction. Following Daly and Bierlaire (2006), the correlation structure is defined...... by a rooted, directed graph where each node without successor is an alternative. We formulate a family of MEV models as dynamic discrete choice models on graphs of correlation structures and show that the dynamic models are consistent with MEV theory and generalize the network MEV model (Daly and Bierlaire...
Pfile, Kate R; Gribble, Phillip A; Buskirk, Gretchen E; Meserth, Sara M; Pietrosimone, Brian G
2016-08-01
Epidemiological data demonstrate the need for lower-extremity injury-prevention training. Neuromuscular-control (NMC) programs are immediately effective at minimizing lower-extremity injury risk and improving sport-related performance measures. Research investigating lasting effects after an injury-prevention program is limited. To determine whether dynamic balance, landing mechanics, and hamstring and quadriceps strength could be improved after a 6-wk NMC intervention and maintained for a season. Prospective case series. Controlled laboratory. 11 Division I women's basketball players (age 19.40 ± 1.35 y, height 178.05 ± 7.52 cm, mass 72.86 ± 10.70 kg). Subjects underwent testing 3 times, completing the Star Excursion Balance Test (SEBT), Landing Error Scoring System (LESS), and isometric strength testing for the hamstrings and quadriceps muscles. Pretest and posttest 1 occurred immediately before and after the intervention, respectively, and posttest 2 at the end of the competitive season, 9 mo after posttest 1. Subjects participated in eighteen 30-min plyometric and NMC-training sessions over a 6-wk period. The normalized SEBT composite score, normalized peak isometric hamstrings:quadriceps (H:Q) ratio, and the LESS total score. The mean composite reach significantly improved over time (F2,10 = 6.96, P = .005) where both posttest scores were significantly higher than pretest (70.41% ± 4.08%) (posttest 1 73.48% ± 4.19%, t10 = -3.11, P = .011) and posttest 2 (74.2% ± 4.77%, t10 = -3.78, P = .004). LESS scores significantly improved over time (F2,10 = 6.29, P = .009). The pretest LESS score (7.30 ± 3.40) was higher than posttest 1 (4.9 ± 1.20, t10 = 2.71, P = .024) and posttest 2 (5.44 ± 1.83, t10 = 2.58, P = .030). There were no statistically significant differences (P > .05) over time for the H:Q ratio when averaging both legs (F2,10 = 0.83, P = .45). A 6-wk NMC program improved landing mechanics and dynamic balance over a 9-mo period in women
Assessment of an optimized dog-culling program in the dynamics of canine Leishmania transmission.
Moreira, Edson Duarte; Mendes de Souza, Verena Maria; Sreenivasan, Meera; Nascimento, Eliane Góes; Pontes de Carvalho, Lain
2004-08-06
In Brazil, zoonotic visceral leishmaniasis (ZVL) control programs based on the mass elimination of seropositive dogs have failed to reduce the number of leishmaniasis cases. However, these programs have been done under sub-optimal conditions. We studied a cohort of dogs in an urban area in Brazil to determine, whether a dog-culling program optimized with: (i) replacement of a relatively low-sensitivity indirect immune-fluorescent test on blood eluate by a more sensitive enzyme-linked immunosorbent assay on serum blood samples; (ii) shortening of the time interval from serodiagnosis to removal of dogs; (iii) screening a high proportion of the dog population could reduce the incidence of canine Leishmania infection (CLI). The study ran from December 1997 to July 2000, with four follow-up assessments performed at approximately 8-month intervals. All dogs seropositive for anti-Leishmania antibodies were promptly eliminated. A large number of new dogs immigrated to the study area throughout the study period. They comprised 43.8-49.8% of the cohort at each follow-up assessment, and upto 15% of them already had Leishmania infection. Overall, 42 news cases of CLI were identified, for a crude incidence rate of 11.8 cases per 100 dog-years (95% CI 8.6-15.6). In the first, second, third and fourth follow-up assessments the incidence rates were 8.2 (95% CI 3.0-17.9), 12.2 (95% CI 6.3-21.2), 16.4 (95% CI 8.5-28.6) and 13.6 (95% CI 7.1-23.8), respectively. There was no statistically significant change in these rates throughout the study period. Our results suggest that dog-culling programs do not reduce the incidence of CLI, even with an optimized intervention. Possible reasons for this failure include: currently available serologic methods lack sufficient sensitivity and/or specificity to accurately identify all infected dogs warranting removal in order to prevent Leishmania transmission; destroyed dogs are immediately replaced by susceptible puppies, and quite often, by
Dynamic Analyses of Result Quality in Energy-Aware Approximate Programs
RIngenburg, Michael F.
Energy efficiency is a key concern in the design of modern computer systems. One promising approach to energy-efficient computation, approximate computing, trades off output precision for energy efficiency. However, this tradeoff can have unexpected effects on computation quality. This thesis presents dynamic analysis tools to study, debug, and monitor the quality and energy efficiency of approximate computations. We propose three styles of tools: prototyping tools that allow developers to experiment with approximation in their applications, online tools that instrument code to determine the key sources of error, and online tools that monitor the quality of deployed applications in real time. Our prototyping tool is based on an extension to the functional language OCaml. We add approximation constructs to the language, an approximation simulator to the runtime, and profiling and auto-tuning tools for studying and experimenting with energy-quality tradeoffs. We also present two online debugging tools and three online monitoring tools. The first online tool identifies correlations between output quality and the total number of executions of, and errors in, individual approximate operations. The second tracks the number of approximate operations that flow into a particular value. Our online tools comprise three low-cost approaches to dynamic quality monitoring. They are designed to monitor quality in deployed applications without spending more energy than is saved by approximation. Online monitors can be used to perform real time adjustments to energy usage in order to meet specific quality goals. We present prototype implementations of all of these tools and describe their usage with several applications. Our prototyping, profiling, and autotuning tools allow us to experiment with approximation strategies and identify new strategies, our online tools succeed in providing new insights into the effects of approximation on output quality, and our monitors succeed in
Directory of Open Access Journals (Sweden)
Vasileios K. Tsimaras
2015-04-01
Full Text Available Traditional dance is gaining popularity as an intervention choice for improving poor balance ability of people with intellectual disability (ID. Balance improvement for individuals with ID through dance provides opportunities for participation in sport activities and promotes independent living. This short review provides in brief research evidence of dynamic balance improvement as measured by means of a balance deck in duration of 30, 45, and 60 sec intervals, highlighting the need to incorporate traditional dance programs in Physical Education (PE lessons applied on participants with ID. Overall, traditional dances provide emotional and cognitive interaction that has a direct positive effect on quality of life and successful motor performance of individuals with ID.
Zhang, Huaguang; Jiang, He; Luo, Chaomin; Xiao, Geyang
2017-10-01
In this paper, we investigate the nonzero-sum games for a class of discrete-time (DT) nonlinear systems by using a novel policy iteration (PI) adaptive dynamic programming (ADP) method. The main idea of our proposed PI scheme is to utilize the iterative ADP algorithm to obtain the iterative control policies, which not only ensure the system to achieve stability but also minimize the performance index function for each player. This paper integrates game theory, optimal control theory, and reinforcement learning technique to formulate and handle the DT nonzero-sum games for multiplayer. First, we design three actor-critic algorithms, an offline one and two online ones, for the PI scheme. Subsequently, neural networks are employed to implement these algorithms and the corresponding stability analysis is also provided via the Lyapunov theory. Finally, a numerical simulation example is presented to demonstrate the effectiveness of our proposed approach.
Directory of Open Access Journals (Sweden)
Nasserdine Oudni
2016-01-01
Full Text Available This work is a numerical simulation of nonlinear problems of the damage process and fracture of quasi-brittle materials especially concrete. In this study, we model the macroscopic behavior of concrete material, taking into account the phenomenon of damage. J. Mazars model whose principle is based on damage mechanics has been implemented in a finite element program written Fortran 90, it takes into account the dissymmetry of concrete behavior in tension and in compression, this model takes into account the cracking tensile and rupture in compression. It is a model that is commonly used for static and pseudo-static systems, but in this work, it was used in the dynamic case.
Shurbevski, Aleksandar; Karuno, Yoshiyuki; Nagamochi, Hiroshi
We consider a repetitive routing problem of a single grasp-and-delivery robot used on a printed circuit board (PCB) assembly line. The robot arranges n identical pins from their current configuration to the next required one by transferring at most one pin at a time. The pins support a PCB from underneath to prevent it from overbending, while an automated manipulator embeds electronic parts in the PCB from above. Given an initial configuration of pins and a sequence of m required configurations, the problem asks to find a transfer route of the robot that minimizes the route length over all m transitions. A polynomial time approximation algorithm with factor two has been proposed by the authors to the problem. In this paper, we design a dynamic programming (DP) procedure to improve its empirical performance, and also conduct numerical experiments to show how well the proposed DP procedure performs.
AbouEisha, Hassan M.
2014-06-06
In this paper we present a dynamic programming algorithm for finding optimal elimination trees for computational grids refined towards point or edge singularities. The elimination tree is utilized to guide the multi-frontal direct solver algorithm. Thus, the criterion for the optimization of the elimination tree is the computational cost associated with the multi-frontal solver algorithm executed over such tree. We illustrate the paper with several examples of optimal trees found for grids with point, isotropic edge and anisotropic edge mixed with point singularity. We show the comparison of the execution time of the multi-frontal solver algorithm with results of MUMPS solver with METIS library, implementing the nested dissection algorithm.
Jou, Jonathan D; Jain, Swati; Georgiev, Ivelin S; Donald, Bruce R
2016-06-01
Sparse energy functions that ignore long range interactions between residue pairs are frequently used by protein design algorithms to reduce computational cost. Current dynamic programming algorithms that fully exploit the optimal substructure produced by these energy functions only compute the GMEC. This disproportionately favors the sequence of a single, static conformation and overlooks better binding sequences with multiple low-energy conformations. Provable, ensemble-based algorithms such as A* avoid this problem, but A* cannot guarantee better performance than exhaustive enumeration. We propose a novel, provable, dynamic programming algorithm called Branch-Width Minimization* (BWM*) to enumerate a gap-free ensemble of conformations in order of increasing energy. Given a branch-decomposition of branch-width w for an n-residue protein design with at most q discrete side-chain conformations per residue, BWM* returns the sparse GMEC in O([Formula: see text]) time and enumerates each additional conformation in merely O([Formula: see text]) time. We define a new measure, Total Effective Search Space (TESS), which can be computed efficiently a priori before BWM* or A* is run. We ran BWM* on 67 protein design problems and found that TESS discriminated between BWM*-efficient and A*-efficient cases with 100% accuracy. As predicted by TESS and validated experimentally, BWM* outperforms A* in 73% of the cases and computes the full ensemble or a close approximation faster than A*, enumerating each additional conformation in milliseconds. Unlike A*, the performance of BWM* can be predicted in polynomial time before running the algorithm, which gives protein designers the power to choose the most efficient algorithm for their particular design problem.
DEFF Research Database (Denmark)
Hu, Rui; Hu, Weihao; Li, Pengfei
2016-01-01
Power system restoration is very significant for the operation reliability. Although a totally blackout in today's power system rarely happens, the operators still have to make the restoration strategies in advance by using their experience or some strategy supportive systems. Nowadays, as distri...... System. The testing system was modified by replacing traditional generators with wind farms to create a high wind penetration system....... and relatively low cost. Thus, many countries are increasing the wind power penetration in their power system step by step, such as Denmark, Spain and Germany. The incremental wind power penetration brings a lot of new issues in operation and programming. The power system sometimes will operate close to its...... stable limits. Once the blackout happens, a well-designed restoration strategy is significant. This paper focuses on how to ameliorate the power system restoration procedures to adapt the high wind power penetration and how to take full advantages of the wind power plants during the restoration...
“Push” dynamics in policy experimentation: Downscaling climate change adaptation programs in Canada
Directory of Open Access Journals (Sweden)
Adam Wellstead
2016-12-01
Full Text Available Policy experiments have often been touted as valuable mechanisms for ensuring sustainability transitions and climate change adaptation. However problems exist both in the definition of ‘experiments’, and in their design and realization. While valuable, most experiments examined in the literature to date have been small-scale micro-level deployments or evaluations of policy tools in which the most problematic element revolves around their “scaling-up” or diffusion. The literature on the subject has generally neglected the problems and issues related to another class of experiments in which macro or meso-level initiatives are ‘scaled-down’ to the micro-level. This paper examines a recent effort of this kind in Canada involving the creation of Regional Adaptation Collaboratives (RACs across the country whose main purpose is to push national level initiatives down to the regions and localities. As the discussion shows, this top-down process has its own dynamics distinct from those involved in ‘scaling up’ and should be examined as a separate category of policy experiments in its own right.
Directory of Open Access Journals (Sweden)
Etienne Dardenne
2014-06-01
Full Text Available The RNA helicases DDX5 and DDX17 are members of a large family of highly conserved proteins that are involved in gene-expression regulation; however, their in vivo targets and activities in biological processes such as cell differentiation, which requires reprogramming of gene-expression programs at multiple levels, are not well characterized. Here, we uncovered a mechanism by which DDX5 and DDX17 cooperate with heterogeneous nuclear ribonucleoprotein (hnRNP H/F splicing factors to define epithelial- and myoblast-specific splicing subprograms. We then observed that downregulation of DDX5 and DDX17 protein expression during myogenesis and epithelial-to-mesenchymal transdifferentiation contributes to the switching of splicing programs during these processes. Remarkably, this downregulation is mediated by the production of miRNAs induced upon differentiation in a DDX5/DDX17-dependent manner. Since DDX5 and DDX17 also function as coregulators of master transcriptional regulators of differentiation, we propose to name these proteins “master orchestrators” of differentiation that dynamically orchestrate several layers of gene expression.
Energy Technology Data Exchange (ETDEWEB)
Sofronov, I.D.; Voronin, B.L.; Butnev, O.I. [VNIIEF (Russian Federation)] [and others
1997-12-31
The aim of the work performed is to develop a 3D parallel program for numerical calculation of gas dynamics problem with heat conductivity on distributed memory computational systems (CS), satisfying the condition of numerical result independence from the number of processors involved. Two basically different approaches to the structure of massive parallel computations have been developed. The first approach uses the 3D data matrix decomposition reconstructed at temporal cycle and is a development of parallelization algorithms for multiprocessor CS with shareable memory. The second approach is based on using a 3D data matrix decomposition not reconstructed during a temporal cycle. The program was developed on 8-processor CS MP-3 made in VNIIEF and was adapted to a massive parallel CS Meiko-2 in LLNL by joint efforts of VNIIEF and LLNL staffs. A large number of numerical experiments has been carried out with different number of processors up to 256 and the efficiency of parallelization has been evaluated in dependence on processor number and their parameters.
Directory of Open Access Journals (Sweden)
Cornelia Amariei
2014-09-01
Full Text Available The structural dynamics of chromatin have been implicated in the regulation of fundamental eukaryotic processes, such as DNA transcription, replication and repair. Although previous studies have revealed that the chromatin landscape, nucleosome remodeling and histone modification events are intimately tied into cellular energetics and redox state, few studies undertake defined time-resolved measurements of these state variables. Here, we use metabolically synchronous, continuously-grown yeast cultures to measure DNA occupancy and track global patterns with respect to the metabolic state of the culture. Combined with transcriptome analyses and ChIP-qPCR experiments, these paint an intriguing picture where genome-wide nucleosome focusing occurs during the recovery of energy charge, followed by clearance of the promoter regions and global transcriptional slow-down, thus indicating a nucleosome-mediated “reset point” for the cycle. The reset begins at the end of the catabolic and stress-response transcriptional programs and ends prior to the start of the anabolic and cell-growth transcriptional program, and the histones on genes from both the catabolic and anabolic superclusters are deacetylated.
Energy Technology Data Exchange (ETDEWEB)
Silva, Marcelo Mariano da
2008-01-15
The search for high performance and low cost hardware and software solutions always guides the developments performed at the IEN parallel computing laboratory. In this context, this dissertation about the building of programs for visualization of computational fluid dynamics (CFD) simulations using the open source software OpenDx was written. The programs developed are useful to produce videos and images in two or three dimensions. They are interactive, easily to use and were designed to serve fluid dynamics researchers. A detailed description about how this programs were developed and the complete instructions of how to use them was done. The use of OpenDx as development tool is also introduced. There are examples that help the reader to understand how programs can be useful for many applications. (author)
Xiao, Jingjie
A key hurdle for implementing real-time pricing of electricity is a lack of consumers' responses. Solutions to overcome the hurdle include the energy management system that automatically optimizes household appliance usage such as plug-in hybrid electric vehicle charging (and discharging with vehicle-to-grid) via a two-way communication with the grid. Real-time pricing, combined with household automation devices, has a potential to accommodate an increasing penetration of plug-in hybrid electric vehicles. In addition, the intelligent energy controller on the consumer-side can help increase the utilization rate of the intermittent renewable resource, as the demand can be managed to match the output profile of renewables, thus making the intermittent resource such as wind and solar more economically competitive in the long run. One of the main goals of this dissertation is to present how real-time retail pricing, aided by control automation devices, can be integrated into the wholesale electricity market under various uncertainties through approximate dynamic programming. What distinguishes this study from the existing work in the literature is that whole- sale electricity prices are endogenously determined as we solve a system operator's economic dispatch problem on an hourly basis over the entire optimization horizon. This modeling and algorithm framework will allow a feedback loop between electricity prices and electricity consumption to be fully captured. While we are interested in a near-optimal solution using approximate dynamic programming; deterministic linear programming benchmarks are use to demonstrate the quality of our solutions. The other goal of the dissertation is to use this framework to provide numerical evidence to the debate on whether real-time pricing is superior than the current flat rate structure in terms of both economic and environmental impacts. For this purpose, the modeling and algorithm framework is tested on a large-scale test case
Cottrell, Paul Edward
There is a lack of research in the area of hedging future contracts, especially in illiquid or very volatile market conditions. It is important to understand the volatility of the oil and currency markets because reduced fluctuations in these markets could lead to better hedging performance. This study compared different hedging methods by using a hedging error metric, supplementing the Receding Horizontal Control and Stochastic Programming (RHCSP) method by utilizing the London Interbank Offered Rate with the Levy process. The RHCSP hedging method was investigated to determine if improved hedging error was accomplished compared to the Black-Scholes, Leland, and Whalley and Wilmott methods when applied on simulated, oil, and currency futures markets. A modified RHCSP method was also investigated to determine if this method could significantly reduce hedging error under extreme market illiquidity conditions when applied on simulated, oil, and currency futures markets. This quantitative study used chaos theory and emergence for its theoretical foundation. An experimental research method was utilized for this study with a sample size of 506 hedging errors pertaining to historical and simulation data. The historical data were from January 1, 2005 through December 31, 2012. The modified RHCSP method was found to significantly reduce hedging error for the oil and currency market futures by the use of a 2-way ANOVA with a t test and post hoc Tukey test. This study promotes positive social change by identifying better risk controls for investment portfolios and illustrating how to benefit from high volatility in markets. Economists, professional investment managers, and independent investors could benefit from the findings of this study.
Analysis of Natural Frequencies in the Universal Programs for Dynamic Processes Analysis
Directory of Open Access Journals (Sweden)
V. A. Trudonoshin
2016-01-01
Full Text Available Finding the natural frequencies of complex technical objects is an important design procedure. This type of analysis allows us to determine the resonant frequencies and, as a consequence, to avoid their adverse impact on dynamics the projected object or that of under study. This applies to both the objects with distributed parameters, and the objects with lumped parameters. As to the first type of the objects, in almost every package that implements the finite element method, this type of analysis is available. The situation is different for the objects with lumped parameters. Methods to have the mathematical models for these objects look to implicit methods of numerical integration of ordinary differential equations. And the component equations of the reactive branches are sampled by numerical integration formulas, and the derivatives of state variables disappear from the vector of the unknowns of a mathematical model. In this case, talk about the implementation of the procedure for finding natural frequencies by finding eigenvalues is simply unnecessary. In cases where a mathematical model of the object is given in the normal Cauchy form, obtaining the natural frequencies is reduced to finding the eigenvalues of the coefficient matrix. There are methods to form the mathematical models in which the derivatives of the state variables make a sub-vector of the vector of unknowns. These are generalized, advanced nodal methods, and an advanced nodal one for mechanical systems. There can be a try for reduction of the mathematical models of objects, obtained by these methods, to the normal Cauchy form. The article discusses a similar procedure for the generalized and advanced nodal methods. As for the extended nodal method for mechanical systems there is specifics the article does not show. For the model obtained by generalized method the vector of unknown variables is permutated so that a sub-vector of the derivatives of the state variables was in
Roubos, D.; Bhulai, S.
2010-01-01
In this article we develop techniques for applying Approximate Dynamic Programming (ADP) to the control of time-varying queuing systems. First, we show that the classical state space representation in queuing systems leads to approximations that can be significantly improved by increasing the
De Groote, F; Demeulenaere, B; Swevers, J; De Schutter, J; Jonkers, I
2012-01-01
This paper presents an enhanced version of the previously proposed physiological inverse approach (PIA) to calculate musculotendon (MT) forces and evaluates the proposed methodology in a comparative study. PIA combines an inverse dynamic analysis with an optimisation approach that imposes muscle physiology and optimises performance over the entire motion. To solve the resulting large-scale, nonlinear optimisation problem, we neglected muscle fibre contraction speed and an approximate quadratic optimisation problem (PIA-QP) was formulated. Conversely, the enhanced version of PIA proposed in this paper takes into account muscle fibre contraction speed. The optimisation problem is solved using a sequential convex programing procedure (PIA-SCP). The comparative study includes PIA-SCP, PIA-QP and two commonly used approaches from the literature: static optimisation (SO) and computed muscle control (CMC). SO and CMC make simplifying assumptions to limit the computational time. Both methods minimise an instantaneous performance criterion. Furthermore, SO does not impose muscle physiology. All methods are applied to a gait cycle of six control subjects. The relative root mean square error averaged over all subjects, ε(RMS), between the joint torques simulated from the optimised activations and the joint torques obtained from the inverse dynamic analysis was about twice as large for SO (ε(RMS) = 86) as compared with CMC (ε(RMS) = 39) and PIA-SCP (ε(RMS) = 50). ε(RMS) was at least twice as large for PIA-QP (ε(RMS) = 197) than for all other methods. As compared with CMC, muscle activation patterns predicted by PIA-SCP better agree with experimental electromyography (EMG). This study shows that imposing muscle physiology as well as globally optimising performance is important to accurately calculate MT forces underlying gait.
Directory of Open Access Journals (Sweden)
McConville Malcolm J
2007-10-01
Full Text Available Abstract Background Gas chromatography-mass spectrometry (GC-MS is a robust platform for the profiling of certain classes of small molecules in biological samples. When multiple samples are profiled, including replicates of the same sample and/or different sample states, one needs to account for retention time drifts between experiments. This can be achieved either by the alignment of chromatographic profiles prior to peak detection, or by matching signal peaks after they have been extracted from chromatogram data matrices. Automated retention time correction is particularly important in non-targeted profiling studies. Results A new approach for matching signal peaks based on dynamic programming is presented. The proposed approach relies on both peak retention times and mass spectra. The alignment of more than two peak lists involves three steps: (1 all possible pairs of peak lists are aligned, and similarity of each pair of peak lists is estimated; (2 the guide tree is built based on the similarity between the peak lists; (3 peak lists are progressively aligned starting with the two most similar peak lists, following the guide tree until all peak lists are exhausted. When two or more experiments are performed on different sample states and each consisting of multiple replicates, peak lists within each set of replicate experiments are aligned first (within-state alignment, and subsequently the resulting alignments are aligned themselves (between-state alignment. When more than two sets of replicate experiments are present, the between-state alignment also employs the guide tree. We demonstrate the usefulness of this approach on GC-MS metabolic profiling experiments acquired on wild-type and mutant Leishmania mexicana parasites. Conclusion We propose a progressive method to match signal peaks across multiple GC-MS experiments based on dynamic programming. A sensitive peak similarity function is proposed to balance peak retention time and peak
Directory of Open Access Journals (Sweden)
Vidya Subramanian
Full Text Available The histone H2A variant H2A.Z is essential for embryonic development and for proper control of developmental gene expression programs in embryonic stem cells (ESCs. Divergent regions of amino acid sequence of H2A.Z likely determine its functional specialization compared to core histone H2A. For example, H2A.Z contains three divergent residues in the essential C-terminal acidic patch that reside on the surface of the histone octamer as an uninterrupted acidic patch domain; however, we know little about how these residues contribute to chromatin structure and function. Here, we show that the divergent amino acids Gly92, Asp97, and Ser98 in the H2A.Z C-terminal acidic patch (H2A.Z(AP3 are critical for lineage commitment during ESC differentiation. H2A.Z is enriched at most H3K4me3 promoters in ESCs including poised, bivalent promoters that harbor both activating and repressive marks, H3K4me3 and H3K27me3 respectively. We found that while H2A.Z(AP3 interacted with its deposition complex and displayed a highly similar distribution pattern compared to wild-type H2A.Z, its enrichment levels were reduced at target promoters. Further analysis revealed that H2A.Z(AP3 was less tightly associated with chromatin, suggesting that the mutant is more dynamic. Notably, bivalent genes in H2A.Z(AP3 ESCs displayed significant changes in expression compared to active genes. Moreover, bivalent genes in H2A.Z(AP3 ESCs gained H3.3, a variant associated with higher nucleosome turnover, compared to wild-type H2A.Z. We next performed single cell imaging to measure H2A.Z dynamics. We found that H2A.Z(AP3 displayed higher mobility in chromatin compared to wild-type H2A.Z by fluorescent recovery after photobleaching (FRAP. Moreover, ESCs treated with the transcriptional inhibitor flavopiridol resulted in a decrease in the H2A.Z(AP3 mobile fraction and an increase in its occupancy at target genes indicating that the mutant can be properly incorporated into chromatin
Directory of Open Access Journals (Sweden)
Fábio Cunha Coelho
2009-10-01
Full Text Available O objetivo deste trabalho foi avaliar a incidência e a dinâmica de populações de plantas daninhas na cultura da cana-de-açúcar em sistema de plantio direto (SPD em comparação ao preparo convencional (PC, após tratamento com herbicidas. O delineamento experimental foi em blocos casualizados, com quatro repetições, num esquema fatorial 4x2. Os tratamentos foram: (I – cana PC vegetação espontânea incorporada com adubação e (II – idem I sem adubação; (III – cana SPD sobre palhada feijão-de-porco com adubação e (IV – idem III sem adubação; (V – cana SPD sobre palhada de mucuna preta com adubação e (VI – idem V sem adubação e (VII – cana SPD sobre palhada de crotalária juncea com adubação e (VIII – idem VII sem adubação. As espécies Cyperus rotundus e Sorghum halepense apresentaram os maiores índices de valor de importância na área experimental. O SPD de cana-de-açúcar sobre feijão-de-porco apresentou o menor índice de similariedade na comunidade de plantas daninhas em relação à cana cultivada convencionalmente. A incidência de plantas daninhas na cana PC foi 531 e 525% superior à cana SPD e contribuiu para a redução de 27% na produtividade.The research aimed to evaluate the incidence and the populations dynamics in sugarcane crop in no-tillage system in comparison to the conventional one. The experimental design was completely random, using four replications, in a factorial 4x2 outline. The treatments were: (I – sugarcane PC incorporated to spontaneous vegetation with manuring and (II – the same procedure as in I without manuring; (III – sugarcane SPD over jack bean (Canavalia ensiformis with manuring and (IV – the same procedure as in III without manuring; (V – sugarcane SPD over velvet bean (Mucuna aterrima with manuring and (VI – the same procedure as in V without manuring and (VII – sugarcane SPD over sunnhemp (Crotalaria juncea with manuring and (VIII – the same
Sandner, Raimar; Vukics, András
2014-09-01
++ libraries, GNU Scientific Library, Blitz++, FLENS, NumPy, SciPy Catalogue identifier of previous version: AELU_v1_0 Journal reference of previous version: Comput. Phys. Comm. 183 (2012) 1381 Does the new version supersede the previous version?: Yes Nature of problem: Definition of (open) composite quantum systems out of elementary building blocks [2,3]. Manipulation of such systems, with emphasis on dynamical simulations such as Master-equation evolution [4] and Monte Carlo wave-function simulation [5]. Solution method: Master equation, Monte Carlo wave-function method Reasons for new version: The new version is mainly a feature release, but it does correct some problems of the previous version, especially as regards the build system. Summary of revisions: We give an example for a typical Python script implementing the ring-cavity system presented in Sec. 3.3 of Ref. [2]: Restrictions: Total dimensionality of the system. Master equation-few thousands. Monte Carlo wave-function trajectory-several millions. Unusual features: Because of the heavy use of compile-time algorithms, compilation of programs written in the framework may take a long time and much memory (up to several GBs). Additional comments: The framework is not a program, but provides and implements an application-programming interface for developing simulations in the indicated problem domain. We use several C++11 features which limits the range of supported compilers (g++ 4.7, clang++ 3.1) Documentation, http://cppqed.sourceforge.net/ Running time: Depending on the magnitude of the problem, can vary from a few seconds to weeks. References: [1] Entry point: http://cppqed.sf.net [2] A. Vukics, C++QEDv2: The multi-array concept and compile-time algorithms in the definition of composite quantum systems, Comp. Phys. Comm. 183(2012)1381. [3] A. Vukics, H. Ritsch, C++QED: an object-oriented framework for wave-function simulations of cavity QED systems, Eur. Phys. J. D 44 (2007) 585. [4] H. J. Carmichael, An Open
Shang, Yizi; Lu, Shibao; Gong, Jiaguo; Liu, Ronghua; Li, Xiang; Fan, Qixiang
2017-11-01
This paper presents a practical genetic algorithm (GA)-based solution for solving the economic load dispatch problem (ELDP) and further compares the performance of the improved GA (IGA) with that of dynamic programming (DP). Specifically, their performance is comprehensively evaluated in terms of addressing the ELDP through a case study of 26 turbines in the Three Gorges Hydropower Plant with a focus on calculation accuracy, calculation time, and algorithm stability. Evaluation results show that the improved GA method can significantly reduce the ineffectiveness of the GA in current use and could avoid the running of the turbines in the cavitation/vibration zone, thereby ensuring the safety of the turbines during generating operations. Further, the analysis comparing the performance of the IGA and DP show that the IGA is superior to DP when a small number of turbines are involved. However, as the number of turbines increases, the IGA requires more calculation time than DP; moreover, its calculation accuracy and convergence rate are significantly reduced. It is difficult to guarantee the stability of IGA in high-dimension space even though the population grows, on account of the exponential expansion of the calculation dimension, the algorithm's premature convergence, and the lack of a local search capability. The improvement of the GA as well as the evaluation method proposed in this paper provide a new approach for choosing and improving optimization algorithms to solve the ELDP of large-scale hydropower plants.
Walsh, Thomas P; Webber, Caleb; Searle, Stephen; Sturrock, Shane S; Barton, Geoffrey J
2008-07-01
SCANPS performs iterative profile searching similar to PSI-BLAST but with full dynamic programing on each cycle and on-the-fly estimation of significance. This combination gives good sensitivity and selectivity that outperforms PSI-BLAST in domain-searching benchmarks. Although computationally expensive, SCANPS exploits onchip parallelism (MMX and SSE2 instructions on Intel chips) as well as MPI parallelism to give acceptable turnround times even for large databases. A web server developed to run SCANPS searches is now available at http://www.compbio.dundee.ac.uk/www-scanps. The server interface allows a range of different protein sequence databases to be searched including the SCOP database of protein domains. The server provides the user with regularly updated versions of the main protein sequence databases and is backed up by significant computing resources which ensure that searches are performed rapidly. For SCOP searches, the results may be viewed in a new tree-based representation that reflects the structure of the SCOP hierarchy; this aids the user in placing each hit in the context of its SCOP classification and understanding its relationship to other domains in SCOP.
LoMauro, Antonella; Cesareo, Ambra; Agosti, Fiorenza; Tringali, Gabriella; Salvadego, Desy; Grassi, Bruno; Sartorio, Alessandro; Aliverti, Andrea
2016-06-01
The objective of this study was to characterize static and dynamic thoraco-abdominal volumes in obese adolescents and to test the effects of a 3-week multidisciplinary body weight reduction program (MBWRP), entailing an energy-restricted diet, psychological and nutritional counseling, aerobic physical activity, and respiratory muscle endurance training (RMET), on these parameters. Total chest wall (VCW), pulmonary rib cage (VRC,p), abdominal rib cage (VRC,a), and abdominal (VAB) volumes were measured on 11 male adolescents (Tanner stage: 3-5; BMI standard deviation score: >2; age: 15.9 ± 1.3 years; percent body fat: 38.4%) during rest, inspiratory capacity (IC) maneuver, and incremental exercise on a cycle ergometer at baseline and after 3 weeks of MBWRP. At baseline, the progressive increase in tidal volume was achieved by an increase in end-inspiratory VCW (p weight loss was concentrated in the abdomen and total IC decreased. During exercise, abdominal rib cage hyperinflation was delayed and associated with 15% increased performance and reduced dyspnea at high workloads (p muscles, and reduced dyspnea.
Chanudet, M
1999-01-01
The behavior of the CTF2 drive beam is studied through the first elements of the line for a bunch train of 48'10nC. Simulations were realised with the PARMELA program which tracks particles through different RF and magnetic elements. Space charge and beam loading in RF structures are included in the calculations, but not the wakefields. In this note, all the beam, RF and magnetic parameters are chosen to approach the operational settings of the CTF2 at the end of 98 and the beginning of 99. Two configurations are reported and compared. The first is chosen to describe the Nov. 98 experimental layout. The second one with a booster section is proposed to improve the beam characteristics. The PARMELA beam generation is discussed. Then, the fields in the HCS sections are studied, a purely standing wave in the couplers is put in evidence and a model of the HCS is deduced and tested for the PARMELA simulations. The RF effects of the HCS section on the beam dynamics are demonstrated, in particular the critical focusi...
Directory of Open Access Journals (Sweden)
Xiangyu Hou
2017-01-01
Full Text Available In the fresh produce wholesale market, the market price is determined by the total demand and supply. The price is stochastic, and either wholesaler or retailer has few influence on it. In the wholesaler’s inventory decision, the price’s uncertainty plays an important role as well as the uncertainty from the demand side: the wholesaler makes his decision based on the retailer’s ordering, which is influenced by the stochastic market price and the distribution of the consumer’s demand. In addition, when at the wholesale stage, the products show a similar quality of similar appearance. With more efforts being input, the wholesaler could detect and record more additional information than that reflected from the appearance. Based on this, he can classify the quality into different levels. No experience shows how the wholesaler could use the underlying quality information and how much this information could improve his profit. To describe and explore this problem, a bilevel dynamic programming approach is employed. We evaluate different strategies of using the underlying information, show the features of the optimal policy, develop heuristics, and discuss the influence of factors such as quality and market price. We also develop the managerial principles for the practical use.
O'Neill, M A; Hilgetag, C C
2001-08-29
Many problems in analytical biology, such as the classification of organisms, the modelling of macromolecules, or the structural analysis of metabolic or neural networks, involve complex relational data. Here, we describe a software environment, the portable UNIX programming system (PUPS), which has been developed to allow efficient computational representation and analysis of such data. The system can also be used as a general development tool for database and classification applications. As the complexity of analytical biology problems may lead to computation times of several days or weeks even on powerful computer hardware, the PUPS environment gives support for persistent computations by providing mechanisms for dynamic interaction and homeostatic protection of processes. Biological objects and their interrelations are also represented in a homeostatic way in PUPS. Object relationships are maintained and updated by the objects themselves, thus providing a flexible, scalable and current data representation. Based on the PUPS environment, we have developed an optimization package, CANTOR, which can be applied to a wide range of relational data and which has been employed in different analyses of neuroanatomical connectivity. The CANTOR package makes use of the PUPS system features by modifying candidate arrangements of objects within the system's database. This restructuring is carried out via optimization algorithms that are based on user-defined cost functions, thus providing flexible and powerful tools for the structural analysis of the database content. The use of stochastic optimization also enables the CANTOR system to deal effectively with incomplete and inconsistent data. Prototypical forms of PUPS and CANTOR have been coded and used successfully in the analysis of anatomical and functional mammalian brain connectivity, involving complex and inconsistent experimental data. In addition, PUPS has been used for solving multivariate engineering optimization
1978-10-01
Energy gain of system 233 in lb. IV. UNACCOUNLTED ENERGY LOST 28 in lb. • = 74 Overall experience wcth TRACoing n indicarce athat T50 MEph T enaggerate...to signal before processing Processing A signal corresponding to that torque required to twist the bushing will be generated by rolling out that part
Elements of Dynamic Programming,
1981-02-02
UuJACJCIMOIC 3 IICP- ~I) ovio orpacAb. itiafpe.iclclcoe FiA KOAI14CCTnO CptACTO Y1=- - X,1 , nNAeActmIole so DropylO OTP.ICJb DOC = 0151504 PAGE...again all ressvu .te ara packed intc tranch II;their remaiader/residue at tle fau or tae CiLtn year (and entira period) will ie equal tc 0.04 20. iu...we ccnatruct the sesries of curves fcz fau ..t .a w3 ., aependlnS ca X3 IFig. 12.5). For each of these curves we ,oe kuit wi.th the maximum ordinate
Dynamic Cylinder Test Program.
1983-06-29
filled explotion cavity, 333 mm high, covered with 1.22 m of overburden, as shown in Figure 5. The charge density of the cavity was 6.25 kg/m 3. The...kg/m detonation cord. The HEST was fired vertically from top to bottom at a shock propagation rate of 6400 m/s (maximum burn rate for the detonation
Davidsen, Claus; Liu, Suxia; Mo, Xingguo; Engelund Holm, Peter; Trapp, Stefan; Rosbjerg, Dan; Bauer-Gottwein, Peter
2015-04-01
Few studies address water quality in hydro-economic models, which often focus primarily on optimal allocation of water quantities. Water quality and water quantity are closely coupled, and optimal management with focus solely on either quantity or quality may cause large costs in terms of the oth-er component. In this study, we couple water quality and water quantity in a joint hydro-economic catchment-scale optimization problem. Stochastic dynamic programming (SDP) is used to minimize the basin-wide total costs arising from water allocation, water curtailment and water treatment. The simple water quality module can handle conservative pollutants, first order depletion and non-linear reactions. For demonstration purposes, we model pollutant releases as biochemical oxygen demand (BOD) and use the Streeter-Phelps equation for oxygen deficit to compute the resulting min-imum dissolved oxygen concentrations. Inelastic water demands, fixed water allocation curtailment costs and fixed wastewater treatment costs (before and after use) are estimated for the water users (agriculture, industry and domestic). If the BOD concentration exceeds a given user pollution thresh-old, the user will need to pay for pre-treatment of the water before use. Similarly, treatment of the return flow can reduce the BOD load to the river. A traditional SDP approach is used to solve one-step-ahead sub-problems for all combinations of discrete reservoir storage, Markov Chain inflow clas-ses and monthly time steps. Pollution concentration nodes are introduced for each user group and untreated return flow from the users contribute to increased BOD concentrations in the river. The pollutant concentrations in each node depend on multiple decision variables (allocation and wastewater treatment) rendering the objective function non-linear. Therefore, the pollution concen-tration decisions are outsourced to a genetic algorithm, which calls a linear program to determine the remainder of the decision
Airoldi, Edoardo M.; Miller, Darach; Athanasiadou, Rodoniki; Brandt, Nathan; Abdul-Rahman, Farah; Neymotin, Benjamin; Hashimoto, Tatsu; Bahmani, Tayebeh; Gresham, David
2016-01-01
Cell growth rate is regulated in response to the abundance and molecular form of essential nutrients. In Saccharomyces cerevisiae (budding yeast), the molecular form of environmental nitrogen is a major determinant of cell growth rate, supporting growth rates that vary at least threefold. Transcriptional control of nitrogen use is mediated in large part by nitrogen catabolite repression (NCR), which results in the repression of specific transcripts in the presence of a preferred nitrogen source that supports a fast growth rate, such as glutamine, that are otherwise expressed in the presence of a nonpreferred nitrogen source, such as proline, which supports a slower growth rate. Differential expression of the NCR regulon and additional nitrogen-responsive genes results in >500 transcripts that are differentially expressed in cells growing in the presence of different nitrogen sources in batch cultures. Here we find that in growth rate–controlled cultures using nitrogen-limited chemostats, gene expression programs are strikingly similar regardless of nitrogen source. NCR expression is derepressed in all nitrogen-limiting chemostat conditions regardless of nitrogen source, and in these conditions, only 34 transcripts exhibit nitrogen source–specific differential gene expression. Addition of either the preferred nitrogen source, glutamine, or the nonpreferred nitrogen source, proline, to cells growing in nitrogen-limited chemostats results in rapid, dose-dependent repression of the NCR regulon. Using a novel means of computational normalization to compare global gene expression programs in steady-state and dynamic conditions, we find evidence that the addition of nitrogen to nitrogen-limited cells results in the transient overproduction of transcripts required for protein translation. Simultaneously, we find that that accelerated mRNA degradation underlies the rapid clearing of a subset of transcripts, which is most pronounced for the highly expressed NCR
Yamada, Kazunori D
2018-01-01
A profile-comparison method with position-specific scoring matrix (PSSM) is among the most accurate alignment methods. Currently, cosine similarity and correlation coefficients are used as scoring functions of dynamic programming to calculate similarity between PSSMs. However, it is unclear whether these functions are optimal for profile alignment methods. By definition, these functions cannot capture nonlinear relationships between profiles. Therefore, we attempted to discover a novel scoring function, which was more suitable for the profile-comparison method than existing functions, using neural networks. Although neural networks required derivative-of-cost functions, the problem being addressed in this study lacked them. Therefore, we implemented a novel derivative-free neural network by combining a conventional neural network with an evolutionary strategy optimization method used as a solver. Using this novel neural network system, we optimized the scoring function to align remote sequence pairs. Our results showed that the pairwise-profile aligner using the novel scoring function significantly improved both alignment sensitivity and precision relative to aligners using existing functions. We developed and implemented a novel derivative-free neural network and aligner (Nepal) for optimizing sequence alignments. Nepal improved alignment quality by adapting to remote sequence alignments and increasing the expressiveness of similarity scores. Additionally, this novel scoring function can be realized using a simple matrix operation and easily incorporated into other aligners. Moreover our scoring function could potentially improve the performance of homology detection and/or multiple-sequence alignment of remote homologous sequences. The goal of the study was to provide a novel scoring function for profile alignment method and develop a novel learning system capable of addressing derivative-free problems. Our system is capable of optimizing the performance of other
Energy Technology Data Exchange (ETDEWEB)
Muench, T.J.; Wooders, M.H.; McLean, R.
1976-08-01
Two models are developed that can estimate derived fuel demands in single-family dwellings, given fixed final demand for space heat by states. One is an extension of a single-period linear programming model of the nation's energy system, the Brookhaven Energy System Optimization Model. In it the demand for single-family space heat is disaggregated by state and type of home-heating system. The other is a multiple-period dynamic programming model of single-family space heat demand, also disaggregated by state and type of system. Preliminary results for each model are presented and compared.
Shorikov, A. F.
2016-12-01
This article discusses the discrete-time dynamical system consisting from two controlled objects and described by a linear recurrent vector equations in the presence of uncertain perturbations. This dynamical system has two levels of a control: dominant level (the first level or the level I) and subordinate level (the second level or the level II) and both have different linear terminal criterions of functioning and united a priori by determined information and control connections. It is assumed that the sets constraining all a priori undefined parameters are known and they are a finite sets or convex, closed and bounded polyhedrons in the corresponding finite-dimensional vector spaces. For the dynamical system in question, we propose a mathematical formalization in the form of solving two-level hierarchical minimax program control problem with incomplete information. In this article for solving of the investigated problem is proposed the algorithm that has a form of a recurrent procedure of solving a linear programming and a finite optimization problems. The results obtained in this article can be used for computer simulation of an actual dynamical processes and for designing controlling and navigation systems.
Bergstra, J.A.; Bethke, I.
2002-01-01
Molecular dynamics is a model for the structure and meaning of object based programming systems. In molecular dynamics the memory state of a system is modeled as a fluid consisting of a collection of molecules. Each molecule is a collection of atoms with bindings between them. A computation is
Du, Likai; Lan, Zhenggang
2015-04-14
Nonadiabatic dynamics simulations have rapidly become an indispensable tool for understanding ultrafast photochemical processes in complex systems. Here, we present our recently developed on-the-fly nonadiabatic dynamics package, JADE, which allows researchers to perform nonadiabatic excited-state dynamics simulations of polyatomic systems at an all-atomic level. The nonadiabatic dynamics is based on Tully's surface-hopping approach. Currently, several electronic structure methods (CIS, TDHF, TDDFT(RPA/TDA), and ADC(2)) are supported, especially TDDFT, aiming at performing nonadiabatic dynamics on medium- to large-sized molecules. The JADE package has been interfaced with several quantum chemistry codes, including Turbomole, Gaussian, and Gamess (US). To consider environmental effects, the Langevin dynamics was introduced as an easy-to-use scheme into the standard surface-hopping dynamics. The JADE package is mainly written in Fortran for greater numerical performance and Python for flexible interface construction, with the intent of providing open-source, easy-to-use, well-modularized, and intuitive software in the field of simulations of photochemical and photophysical processes. To illustrate the possible applications of the JADE package, we present a few applications of excited-state dynamics for various polyatomic systems, such as the methaniminium cation, fullerene (C20), p-dimethylaminobenzonitrile (DMABN) and its primary amino derivative aminobenzonitrile (ABN), and 10-hydroxybenzo[h]quinoline (10-HBQ).
Sutton, L. R.
1975-01-01
A theoretical analysis is developed for a coupled helicopter rotor system to allow determination of the loads and dynamic response behavior of helicopter rotor systems in both steady-state forward flight and maneuvers. The effects of an anisotropically supported swashplate or gyroscope control system and a deformed free wake on the rotor system dynamic response behavior are included.
Mammalian carnivores are increasingly the focus of reintroduction attempts in areas from whichthey have been extirpated by historic persecution. We used static and dynamic spatial models to evaluate whether a proposed wolf reintroduction to the southern Rocky Mountain region ...
2017-06-26
This zip file contains files of data to support FHWA-JPO-16-370, Analysis, Modeling, and Simulation (AMS) Testbed Development and Evaluation to Support Dynamic Mobility Applications (DMA) and Active Transportation and Demand Management (ATDM) Program...
Waiboer, R.R.
2007-01-01
Robotised laser welding is an innovative joining technique which is increasingly finding applications, especially in the automotive industry. In order to reduce the time needed to prepare and programthe laser welding robot, off-line programming systems are used. The off-line programming systems
Schaefer, Jessica L; Sandrey, Michelle A
2012-11-01
A dynamic-balance-training (DBT) program supplemented with the Graston instrument-assisted soft-tissue mobilization (GISTM) technique has not been evaluated collectively as a treatment in subjects with chronic ankle instability (CAI). To examine the effects of GISTM in conjunction with a DBT program on outcomes associated with CAI, including pain and disability, range of motion (ROM), and dynamic postural control. Pretest/posttest, repeated measures. High school and a Division I mid-Atlantic university. Thirty-six healthy, physically active individuals (5 female, 31 male; age 17.7 ± 1.9 y; height 175.3 ± 14.6 cm) with a history of CAI as determined by an ankle-instability questionnaire volunteered to be in this study. Subjects were randomly assigned to 1 of 3 intervention groups: both treatments (DBT/GISTM, n = 13), DBT and a sham GISTM treatment (DBT/GISTM-S, n = 12), or DBT and control-no GISTM (DBT/C, n = 11). All groups participated in a 4-wk DBT program consisting of low-impact and dynamic activities that was progressed from week to week. The DBT/GISTM and DBT/GISTM-S groups received the GISTM treatment or sham treatment twice a week for 8 min before performing the DBT program. Pretest and posttest measurements included the Foot and Ankle Ability Measure (FAAM), FAAM Sport, the visual analog scale (VAS), ankle ROM in 4 directions, and the Star Excursion Balance Test (SEBT) in 3 directions. FAAM and FAAM-Sport scores, VAS, goniometric ROM (plantar flexion, dorsiflexion, inversion, eversion), and SEBT (anterior, posteromedial, posterolateral). Subjects in all groups posttest demonstrated an increase in FAAM, FAAM Sport, ROM, and SEBT in all directions but not in VAS, which decreased. No other results were significant. For subjects with CAI, dynamic postural control, ROM, pain and disability improved pretest to posttest regardless of group membership, with the largest effects found in most measures in the DBT/GISTM group.
Energy Technology Data Exchange (ETDEWEB)
Busby, R.L.; Ward, K.B.
1989-01-01
A model was devised to estimate the harvest value of unthinned loblolly and slash pine (pinus taeda L. and P. elliottii var. elliottii Englm.) plantations in the west gulf region. The model, MERCHOP, can be used to forecast product volumes and values; the output provided is partitioned into 1-inch tree d.b.h. classes. Using a dynamic programming algorithm, MERCHOP can be used to convert stand tables predicted by USLYCOWG's three-parameter Weibull function into a listing of seven products that maximizes the selling value of the stand, assuming the assumptions used in the analysis are correct.
Energy Technology Data Exchange (ETDEWEB)
Veiga-Lopez, A.; Beckett, E.M.; Abi Salloum, B. [Department of Pediatrics, University of Michigan, Ann Arbor, MI (United States); Ye, W. [Department of Biostatistics, University of Michigan, Ann Arbor, MI (United States); Padmanabhan, V., E-mail: vasantha@umich.edu [Department of Pediatrics, University of Michigan, Ann Arbor, MI (United States); The Reproductive Sciences Program, University of Michigan, Ann Arbor, MI (United States)
2014-09-01
Developmental exposure to BPA adversely affects reproductive function. In sheep, prenatal BPA treatment induces reproductive neuroendocrine defects, manifested as LH excess and dampened LH surge and perturbs early ovarian gene expression. In this study we hypothesized that prenatal BPA treatment will also disrupt ovarian follicular dynamics. Pregnant sheep were treated from days 30 to 90 of gestation with 3 different BPA doses (0.05, 0.5, or 5 mg/kg BW/day). All female offspring were estrus synchronized and transrectal ultrasonography was performed daily for 22 days to monitor ovarian follicular and corpora lutea dynamics. Blood samples were collected to assess preovulatory hormonal changes and luteal progesterone dynamics. Statistical analysis revealed that the time interval between the estradiol rise and the preovulatory LH surge was shortened in the BPA-treated females. None of the three BPA doses had an effect on corpora lutea, progestogenic cycles, and mean number or duration of ovulatory and non-ovulatory follicles. However, differences in follicular count trajectories were evident in all three follicular size classes (2–3 mm, 4–5 mm, and ≥ 6 mm) of prenatal BPA-treated animals compared to controls. Number of follicular waves tended also to be more variable in the prenatal BPA-treated groups ranging from 2 to 5 follicular waves per cycle, while this was restricted to 3 to 4 waves in control females. These changes in ovarian follicular dynamics coupled with defects in time interval between estradiol rise and preovulatory LH release are likely to lead to subfertility in prenatal BPA-treated females. - Highlights: • Prenatal BPA shortens interval between estradiol rise and preovulatory LH surge. • Prenatal BPA affects follicular count trajectory and follicular wave occurrence. • Prenatal BPA does not affect ovulatory rate and progesterone dynamics.
Oh, Kwang Jin; Kang, Ji Hoon; Myung, Hun Joo
2012-02-01
We have revised a general purpose parallel molecular dynamics simulation program mm_par using the object-oriented programming. We parallelized the revised version using a hierarchical scheme in order to utilize more processors for a given system size. The benchmark result will be presented here. New version program summaryProgram title: mm_par2.0 Catalogue identifier: ADXP_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXP_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC license, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 2 390 858 No. of bytes in distributed program, including test data, etc.: 25 068 310 Distribution format: tar.gz Programming language: C++ Computer: Any system operated by Linux or Unix Operating system: Linux Classification: 7.7 External routines: We provide wrappers for FFTW [1], Intel MKL library [2] FFT routine, and Numerical recipes [3] FFT, random number generator, and eigenvalue solver routines, SPRNG [4] random number generator, Mersenne Twister [5] random number generator, space filling curve routine. Catalogue identifier of previous version: ADXP_v1_0 Journal reference of previous version: Comput. Phys. Comm. 174 (2006) 560 Does the new version supersede the previous version?: Yes Nature of problem: Structural, thermodynamic, and dynamical properties of fluids and solids from microscopic scales to mesoscopic scales. Solution method: Molecular dynamics simulation in NVE, NVT, and NPT ensemble, Langevin dynamics simulation, dissipative particle dynamics simulation. Reasons for new version: First, object-oriented programming has been used, which is known to be open for extension and closed for modification. It is also known to be better for maintenance. Second, version 1.0 was based on atom decomposition and domain decomposition scheme [6] for parallelization. However, atom
Amosu, Adewale; Sun, Yuefeng
WheelerLab is an interactive program that facilitates the interpretation of stratigraphic data (seismic sections, outcrop data and well sections) within a sequence stratigraphic framework and the subsequent transformation of the data into the chronostratigraphic domain. The transformation enables the identification of significant geological features, particularly erosional and non-depositional features that are not obvious in the original seismic domain. Although there are some software products that contain interactive environments for carrying out chronostratigraphic analysis, none of them are open-source codes. In addition to being open source, WheelerLab adds two important functionalities not present in currently available software: (1) WheelerLab generates a dynamic chronostratigraphic section and (2) WheelerLab enables chronostratigraphic analysis of older seismic data sets that exist only as images and not in the standard seismic file formats; it can also be used for the chronostratigraphic analysis of outcrop images and interpreted well sections. The dynamic chronostratigraphic section sequentially depicts the evolution of the chronostratigraphic chronosomes concurrently with the evolution of identified genetic stratal packages. This facilitates a better communication of the sequence-stratigraphic process. WheelerLab is designed to give the user both interactive and interpretational control over the transformation; this is most useful when determining the correct stratigraphic order for laterally separated genetic stratal packages. The program can also be used to generate synthetic sequence stratigraphic sections for chronostratigraphic analysis.
Directory of Open Access Journals (Sweden)
Adewale Amosu
2017-01-01
Full Text Available WheelerLab is an interactive program that facilitates the interpretation of stratigraphic data (seismic sections, outcrop data and well sections within a sequence stratigraphic framework and the subsequent transformation of the data into the chronostratigraphic domain. The transformation enables the identification of significant geological features, particularly erosional and non-depositional features that are not obvious in the original seismic domain. Although there are some software products that contain interactive environments for carrying out chronostratigraphic analysis, none of them are open-source codes. In addition to being open source, WheelerLab adds two important functionalities not present in currently available software: (1 WheelerLab generates a dynamic chronostratigraphic section and (2 WheelerLab enables chronostratigraphic analysis of older seismic data sets that exist only as images and not in the standard seismic file formats; it can also be used for the chronostratigraphic analysis of outcrop images and interpreted well sections. The dynamic chronostratigraphic section sequentially depicts the evolution of the chronostratigraphic chronosomes concurrently with the evolution of identified genetic stratal packages. This facilitates a better communication of the sequence-stratigraphic process. WheelerLab is designed to give the user both interactive and interpretational control over the transformation; this is most useful when determining the correct stratigraphic order for laterally separated genetic stratal packages. The program can also be used to generate synthetic sequence stratigraphic sections for chronostratigraphic analysis.
Shukla, Krishna Dayal; Saxena, Nishant; Manivannan, Anbarasu
2017-12-01
Recent advancements in commercialization of high-speed non-volatile electronic memories including phase change memory (PCM) have shown potential not only for advanced data storage but also for novel computing concepts. However, an in-depth understanding on ultrafast electrical switching dynamics is a key challenge for defining the ultimate speed of nanoscale memory devices that demands for an unconventional electrical setup, specifically capable of handling extremely fast electrical pulses. In the present work, an ultrafast programmable electrical tester (PET) setup has been developed exceptionally for unravelling time-resolved electrical switching dynamics and programming characteristics of nanoscale memory devices at the picosecond (ps) time scale. This setup consists of novel high-frequency contact-boards carefully designed to capture extremely fast switching transient characteristics within 200 ± 25 ps using time-resolved current-voltage measurements. All the instruments in the system are synchronized using LabVIEW, which helps to achieve various programming characteristics such as voltage-dependent transient parameters, read/write operations, and endurance test of memory devices systematically using short voltage pulses having pulse parameters varied from 1 ns rise/fall time and 1.5 ns pulse width (full width half maximum). Furthermore, the setup has successfully demonstrated strikingly one order faster switching characteristics of Ag5In5Sb60Te30 (AIST) PCM devices within 250 ps. Hence, this novel electrical setup would be immensely helpful for realizing the ultimate speed limits of various high-speed memory technologies for future computing.
Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.
2015-08-01
The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.
Herrera Ramos, Estefanía
2015-01-01
Programa de doctorado: Salud pública: Epidemiología, nutrición y planificación [ES]La presente Tesis Doctoral plantea la hipótesis de que la variabilidad genética de las proteínas surfactantes A y D (SP-A y SP-D) pueden influir en la susceptibilidad y pronóstico de diversas enfermedades pulmonares. Esas variantes podrían utilizarse como marcadores para identificar a los subgrupos de individuos con mayor predisposición a desarrollar una de estas enf...
Daniluk, Andrzej
2011-06-01
problems of this type, the computational and threading layers of the project have been implemented in the form of one design pattern as a part of Model-View-Controller architecture. Reasons for new version: Responding to the users' feedback the Growth09 project has been upgraded to a standard that allows the carrying out of sample computations of the RHEED intensities for a disordered surface for a wide range of single- and epitaxial hetero-structures. The design pattern on which the project is based has also been improved. It is shown that this model can be effectively used for multithreaded growth simulations of thin epitaxial layers and corresponding RHEED intensities for a wide range of single- and hetero-structures. Responding to the users' feedback the present release has been implemented using a well-documented free compiler [1] not requiring the special configuration and installation additional libraries. Summary of revisions: The logical structure of the Growth09 program has been modified according to the scheme showed in Fig. 1. The class diagram in Fig. 1 is a static view of the main platform-specific elements of the GrowthCP architecture. Fig. 2 provides a dynamic view by showing the creation and destruction simplistic sequence diagram for the process. The program requires the user to provide the appropriate parameters in the form of a knowledge base for the crystal structures under investigation. These parameters are loaded from the parameters. ini files at run-time. Instructions to prepare the .ini files can be found in the new distribution. The program enables carrying out different growth models and one-dimensional dynamical RHEED calculations for the fcc lattice with basis of three-atoms, fcc lattice with basis of two-atoms, fcc lattice with single atom basis, Zinc-Blende, Sodium Chloride, and Wurtzite crystalline structures and hetero-structures, but yet the Fourier component of the scattering potential in the TRHEEDCalculations.crystPotUgXXX() procedure
Van der Borght, Stefaan F; Schim van der Loeff, Maarten F; Clevenbergh, Philippe; Kabarega, Jean Pierre; Kamo, Emmanuel; van Cranenburgh, Katinka; Rijckborst, Henk; Lange, Joep M; Rinke de Wit, Tobias F
2010-02-01
High uptake of HIV voluntary counseling and testing (VCT) services is important for the success of HIV workplace programs in sub-Saharan Africa. From 2001 onwards, Heineken, a multinational brewing company, implemented a comprehensive HIV prevention and treatment program for employees and their dependents of its African subsidiaries. Confidential in-house VCT is part of this program. VCT uptake dynamics over time, and factors associated with early uptake were studied. Between September 2001 and December 2007, 9723 adult beneficiaries were tested for HIV in 14 company sites in five African countries. Three hundred and seventy (3.8%) of tested persons were infected with HIV-1. During the first 12 months 1412 tests were done, compared to 8311 tests in the subsequent years. The annual average uptake of testing among eligible persons varied between 15 and 32%. The coverage was higher among female compared to male employees, and higher among female compared to male spouses. Distinct peaks in uptake were linked to specific local events. HIV-1 infected persons were significantly more likely to be tested in the early period. The proportion of HIV-1 infected persons among testees was 8.8% in the first 12 months compared to 3.0% in the subsequent period (p<0.001). HIV-1 infected persons diagnosed in the early period were in a more advanced clinical stage, and had a significantly lower CD4 count than those tested later (median CD4 count 227 vs. 314 cells/microl; p=0.002). In this workplace program, HIV-1 infected individuals came earlier for an HIV test than uninfected people, and people with advanced infection came earlier than those with less advanced disease. Employees' spouses are harder to reach than employees and extra efforts should be undertaken to reach them as well. Uptake of HIV testing can be actively influenced by educational or promotional activities.
DEFF Research Database (Denmark)
Solov'yov, Ilia; Yakubovich, Alexander V.; Nikolaev, Pavel V.
2012-01-01
We present a multipurpose computer code MesoBioNano Explorer (MBN Explorer). The package allows to model molecular systems of varied level of complexity. In particular, MBN Explorer is suited to compute system's energy, to optimize molecular structure as well as to consider the molecular and random...... it significantly different from the existing codes, is its universality and applicability to the description of a broad range of problems involving different molecular systems. Most of the existing codes are developed for particular classes of molecular systems and do not permit multiscale approach while MBN...... Explorer goes beyond these drawbacks. On demand, MBN Explorer allows to group particles in the system into rigid fragments, thereby significantly reducing the number of dynamical degrees of freedom. Despite the universality, the computational efficiency of MBN Explorer is comparable (and in some cases even...
Wang, Jun-Sheng; Yang, Guang-Hong
2017-07-25
This paper studies the optimal output-feedback control problem for unknown linear discrete-time systems with stochastic measurement and process noise. A dithered Bellman equation with the innovation covariance matrix is constructed via the expectation operator given in the form of a finite summation. On this basis, an output-feedback-based approximate dynamic programming method is developed, where the terms depending on the innovation covariance matrix are available with the aid of the innovation covariance matrix identified beforehand. Therefore, by iterating the Bellman equation, the resulting value function can converge to the optimal one in the presence of the aforementioned noise, and the nearly optimal control laws are delivered. To show the effectiveness and the advantages of the proposed approach, a simulation example and a velocity control experiment on a dc machine are employed.
Directory of Open Access Journals (Sweden)
Renxin Xiao
2018-01-01
Full Text Available This paper proposes a comparison study of energy management methods for a parallel plug-in hybrid electric vehicle (PHEV. Based on detailed analysis of the vehicle driveline, quadratic convex functions are presented to describe the nonlinear relationship between engine fuel-rate and battery charging power at different vehicle speed and driveline power demand. The engine-on power threshold is estimated by the simulated annealing (SA algorithm, and the battery power command is achieved by convex optimization with target of improving fuel economy, compared with the dynamic programming (DP based method and the charging depleting–charging sustaining (CD/CS method. In addition, the proposed control methods are discussed at different initial battery state of charge (SOC values to extend the application. Simulation results validate that the proposed strategy based on convex optimization can save the fuel consumption and reduce the computation burden obviously.
Avraamova, O G; Kulazhenko, T V; Gabitova, K F
2016-01-01
The paper presents the assessment of tooth decay prevalence in clinically homogenous groups of children receiving long-term preventive program (PP) in school dental facilities. Five-years PP were introduced in clinical practice in 2 Moscow schools. Preventive treatment was performed by dental hygienist. The results show that systematic preventive treatment in school dental offices starting from elementary school allows reducing dental caries incidence 46-53% and stabilize the incidence of caries complications. It should be mentioned though that analysis of individualized outcomes proves heterogeneity of study results despite of equal conditions of PP. Potentially significant hence is early diagnostics and treatment of initial caries forms as demineralization foci, especially in children with intensive tooth decay. Optimization of pediatric dentist and dental hygienist activity in school dental facilities is the main factor of caries prevention efficiency.
Directory of Open Access Journals (Sweden)
J. Crain
2016-06-01
Full Text Available This status report on the Canadian Hospitals Injury Reporting and Prevention Program (CHIRPP, an emergency department-based injury and poisoning surveillance system, describes the result of migrating from a centralized data entry and coding process to a decentralized process, the web-based eCHIRPP system, in 2011. This secure system is improving the CHIRPP’s overall flexibility and timeliness, which are key attributes of an effective surveillance system. The integrated eCHIRPP platform enables near real-time data entry and access, has user-friendly data management and analysis tools, and allows for easier communication and connectivity across the CHIRPP network through an online collaboration centre. Current pilot testing of automated data monitoring and trend analysis tools—designed to monitor and flag incoming data according to predefined criteria (for example, a new consumer product—is revealing eCHIRPP’s potential for providing early warnings of new hazards, issues and trends.
Directory of Open Access Journals (Sweden)
Kotenko К.V.
2013-12-01
Full Text Available The study aimed the development and assessment of features of corrective action of a medical complex on a lipid imbalance at patients with obesity. Material and methods. For an assessment of features of corrective action of a medical complex on a lipid imbalance at patients with obesity in research I was 50 male patients with obesity and frustration of the reproductive sphere aged from 24 to 68 years were included, middle age was 38,5±6,1 years and 7 healthy persons, men of comparable age without any pathological states, results of which all researches were accepted to values of norm. To all patients included in research, except all-clinical inspection calculation of an index of body weight and the relation of a circle of a waist to a circle of hips, measurement of arterial pressure were applied questioning concerning food and food behavior, anthropometry (growth the body weight, a circle of a waist and hips. Besides all patients conducted laboratory methods the researches including definition of atherogenic fractions of lipids (the general cholesterol, triglycerides, LPNPand LPVP. Researches were conducted before treatment and after a course of treatment. Results. The effective complex program for restoration of reproductive function at patients with obesity is developed. Conclusion. Application of the developed comprehensive program more than its separate components caused the expressed reduction of body weight, mainly due to reduction of fatty tissue and manifestations of visceral obesity in patients with obesity and violation of reproductive function, including due to elimination of metabolic imbalance.
Padmanabhan, Vasantha; Veiga-Lopez, Almudena; Herkimer, Carol; Abi Salloum, Bachir; Moeller, Jacob; Beckett, Evan; Sreedharan, Rohit
2015-07-01
Prenatal T excess induces maternal hyperinsulinemia, early puberty, and reproductive/metabolic defects in the female similar to those seen in women with polycystic ovary syndrome. This study addressed the organizational/activational role of androgens and insulin in programming pubertal advancement and periovulatory LH surge defects. Treatment groups included the following: 1) control; 2) prenatal T; 3) prenatal T plus prenatal androgen antagonist, flutamide; 4) prenatal T plus prenatal insulin sensitizer, rosiglitazone; 5) prenatal T and postnatal flutamide; 6) prenatal T and postnatal rosiglitazone; and 7) prenatal T and postnatal metformin. Prenatal treatments spanned 30-90 days of gestation and postnatal treatments began at approximately 8 weeks of age and continued throughout. Blood samples were taken twice weekly, beginning at approximately 12 weeks of age to time puberty. Two-hour samples after the synchronization with prostaglandin F2α were taken for 120 hours to characterize LH surge dynamics at 7 and 19 months of age. Prenatal T females entered puberty earlier than controls, and all interventions prevented this advancement. Prenatal T reduced the percentage of animals having LH surge, and females that presented LH surge exhibited delayed timing and dampened amplitude of the LH surge. Prenatal androgen antagonist, but not other interventions, restored LH surges without normalizing the timing of the surge. Normalization of pubertal timing with prenatal/postnatal androgen antagonist and insulin sensitizer interventions suggests that pubertal advancement is programmed by androgenic actions of T involving insulin as a mediary. Restoration of LH surges by cotreatment with androgen antagonist supports androgenic programming at the organizational level.
DEFF Research Database (Denmark)
Nielsen, Søren R.K.
This book has been prepared for the course on Computational Dynamics given at the 8th semester at the structural program in civil engineering at Aalborg University.......This book has been prepared for the course on Computational Dynamics given at the 8th semester at the structural program in civil engineering at Aalborg University....
Intramolecular and nonlinear dynamics
Energy Technology Data Exchange (ETDEWEB)
Davis, M.J. [Argonne National Laboratory, IL (United States)
1993-12-01
Research in this program focuses on three interconnected areas. The first involves the study of intramolecular dynamics, particularly of highly excited systems. The second area involves the use of nonlinear dynamics as a tool for the study of molecular dynamics and complex kinetics. The third area is the study of the classical/quantum correspondence for highly excited systems, particularly systems exhibiting classical chaos.
Chambers, Joseph
2010-01-01
community, Leonardo da Vinci, George Cayley, and the Wright brothers are examples of early aviation pioneers who frequently used models during their scientific efforts to understand and develop flying machines. Progress in the technology associated with model testing in worldwide applications has firmly established model aircraft as a key element in new aerospace research and development programs. Models are now routinely used in many applications and roles, including aerodynamic data gathering in wind tunnel investigations for the analysis of full-scale aircraft designs, proof-of-concept demonstrators for radical aeronautical concepts, and problem-solving exercises for vehicles already in production. The most critical contributions of aerospace models are to provide confidence and risk reduction for new designs and to enhance the safety and efficiency of existing configurations.
Shih, Ching-Hsiang
2012-01-01
Software technology is adopted by the current research to improve the Drag-and-Drop abilities of two people with multiple disabilities and minimal motor control. This goal was realized through a Dynamic Drag-and-Drop Assistive Program (DDnDAP) in which the complex dragging process is replaced by simply poking the mouse wheel and clicking. However,…
Energy Technology Data Exchange (ETDEWEB)
Vianna, Savio S.V. [Det Norske Veritas PRINCIPIA, Rio de Janeiro, RJ (Brazil); Ferreira Filho, Virgilio Jose [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE). Programa de Engenharia de Producao
2004-07-01
Nowadays, worry about produce under safe conditions increased. This compromising with environment and safety systems is somehow careless regarding mathematics models in order to foreseen day by day production scenarios. The present paper suggests a methodology based on computational fluid dynamics and mathematics programming using graph theory to optimize gas detectors location on offshore facility plant. (author)
Energy Technology Data Exchange (ETDEWEB)
Salellas, J.; Zamora, I.; Fabbri, M.; Colomer, C.; Castillo, R.; Fradera, J.
2014-07-01
The objective of the analysis of the spread of fire through Computational Fluid Dynamics simulation with the Fire Dynamics Simulator program is to determine the identification of the affected computers and determine the livability in the areas of fire as fire postulates. The simulation with Fire Dynamics Simulator allows the evolution and spread of flame and smoke behavior in an instant in time, determining the exact moment that damage is caused by radiation or temperature to equipment and operation according to the level of toxicity and temperature of the fire area. (Author)
Directory of Open Access Journals (Sweden)
Hongwen He
2013-01-01
Full Text Available Energy management strategy influences the power performance and fuel economy of plug-in hybrid electric vehicles greatly. To explore the fuel-saving potential of a plug-in hybrid electric bus (PHEB, this paper searched the global optimal energy management strategy using dynamic programming (DP algorithm. Firstly, the simplified backward model of the PHEB was built which is necessary for DP algorithm. Then the torque and speed of engine and the torque of motor were selected as the control variables, and the battery state of charge (SOC was selected as the state variables. The DP solution procedure was listed, and the way was presented to find all possible control variables at every state of each stage in detail. Finally, the appropriate SOC increment is determined after quantizing the state variables, and then the optimal control of long driving distance of a specific driving cycle is replaced with the optimal control of one driving cycle, which reduces the computational time significantly and keeps the precision at the same time. The simulation results show that the fuel economy of the PEHB with the optimal energy management strategy is improved by 53.7% compared with that of the conventional bus, which can be a benchmark for the assessment of other control strategies.
Chiavico, Mattia; Raso, Luciano; Dorchies, David; Malaterre, Pierre-Olivier
2015-04-01
Seine river region is an extremely important logistic and economic junction for France and Europe. The hydraulic protection of most part of the region relies on four controlled reservoirs, managed by EPTB Seine-Grands Lacs. Presently, reservoirs operation is not centrally coordinated, and release rules are based on empirical filling curves. In this study, we analyze how a centralized release policy can face flood and drought risks, optimizing water system efficiency. The optimal and centralized decisional problem is solved by Stochastic Dual Dynamic Programming (SDDP) method, minimizing an operational indicator for each planning objective. SDDP allows us to include into the system: 1) the hydrological discharge, specifically a stochastic semi-distributed auto-regressive model, 2) the hydraulic transfer model, represented by a linear lag and route model, and 3) reservoirs and diversions. The novelty of this study lies on the combination of reservoir and hydraulic models in SDDP for flood and drought protection problems. The study case covers the Seine basin until the confluence with Aube River: this system includes two reservoirs, the city of Troyes, and the Nuclear power plant of Nogent-Sur-Seine. The conflict between the interests of flood protection, drought protection, water use and ecology leads to analyze the environmental system in a Multi-Objective perspective.
Directory of Open Access Journals (Sweden)
Zeyu Chen
2015-01-01
Full Text Available The employed energy management strategy plays an important role in energy saving performance and exhausted emission reduction of plug-in hybrid electric vehicles (HEVs. An application of dynamic programming for optimization of power allocation is implemented in this paper with certain driving cycle and a limited driving range. Considering the DP algorithm can barely be used in real-time control because of its huge computational task and the dependence on a priori driving cycle, several online useful control rules are established based on the offline optimization results of DP. With the above efforts, an online energy management strategy is proposed finally. The presented energy management strategy concerns the prolongation of all-electric driving range as well as the energy saving performance. A simulation study is deployed to evaluate the control performance of the proposed energy management approach. All-electric range of the plug-in HEV can be prolonged by up to 2.86% for a certain driving condition. The energy saving performance is relative to the driving distance. The presented energy management strategy brings a little higher energy cost when driving distance is short, but for a long driving distance, it can reduce the energy consumption by up to 5.77% compared to the traditional CD-CS strategy.
Ratnanather, J Tilak; Lal, Rakesh M; An, Michael; Poynton, Clare B; Li, Muwei; Jiang, Hangyi; Oishi, Kenichi; Selemon, Lynn D; Mori, Susumu; Miller, Michael I
2013-01-01
Probabilistic methods have the potential to generate multiple and complex white matter fiber tracts in diffusion tensor imaging (DTI). Here, a method based on dynamic programming (DP) is introduced to reconstruct fibers pathways whose complex anatomical structures cannot be resolved beyond the resolution of standard DTI data. DP is based on optimizing a sequentially additive cost function derived from a Gaussian diffusion model whose covariance is defined by the diffusion tensor. DP is used to determine the optimal path between initial and terminal nodes by efficiently searching over all paths, connecting the nodes, and choosing the path in which the total probability is maximized. An ex vivo high-resolution scan of a macaque hemi-brain is used to demonstrate the advantages and limitations of DP. DP can generate fiber bundles between distant cortical areas (superior longitudinal fasciculi, arcuate fasciculus, uncinate fasciculus, and fronto-occipital fasciculus), neighboring cortical areas (dorsal and ventral banks of the principal sulcus), as well as cortical projections to the hippocampal formation (cingulum bundle), neostriatum (motor cortical projections to the putamen), thalamus (subcortical bundle), and hippocampal formation projections to the mammillary bodies via the fornix. Validation is established either by comparison with in vivo intracellular transport of horseradish peroxidase in another macaque monkey or by comparison with atlases. DP is able to generate known pathways, including crossing and kissing tracts. Thus, DP has the potential to enhance neuroimaging studies of cortical connectivity.
DEFF Research Database (Denmark)
Vallgårda, Anna; Boer, Laurens; Tsaknaki, Vasiliki
2017-01-01
, and color, but additionally being capable of sensing, actuating, and computing. Indeed, computers will not be things in and by themselves, but embedded into the materials that make up our surroundings. This also means that the way we interact with computers and the way we program them, will change....... Consequently we ask what the practice of programming and giving form to such materials would be like? How would we be able to familiarize ourselves with the dynamics of these materials and their different combinations of cause and effect? Which tools would we need and what would they look like? Will we program...... these computational composites through external computers and then transfer the code them, or will the programming happen closer to the materials? In this feature we outline a new research program that floats between imagined futures and the development of a material programming practice....
Coffin, T.
1986-01-01
A dynamic pressure data base and data base management system developed to characterize the Space Shuttle Main Engine (SSME) dynamic pressure environment is described. The data base represents dynamic pressure measurements obtained during single engine hot firing tesets of the SSME. Software is provided to permit statistical evaluation of selected measurements under specified operating conditions. An interpolation scheme is also included to estimate spectral trends with SSME power level. Flow dynamic environments in high performance rocket engines are discussed.
Coffin, T.
1986-01-01
A dynamic pressure data base and data base management system developed to characterize the Space Shuttle Main Engine (SSME) dynamic pressure environment is reported. The data base represents dynamic pressure measurements obtained during single engine hot firing tests of the SSME. Software is provided to permit statistical evaluation of selected measurements under specified operating conditions. An interpolation scheme is included to estimate spectral trends with SSME power level. Flow Dynamic Environments in High Performance Rocket Engines are described.
Miller, R. D.; Rogers, J. T.
1975-01-01
General requirements for dynamic loads analyses are described. The indicial lift growth function unsteady subsonic aerodynamic representation is reviewed, and the FLEXSTAB CPS is evaluated with respect to these general requirements. The effects of residual flexibility techniques on dynamic loads analyses are also evaluated using a simple dynamic model.
Directory of Open Access Journals (Sweden)
Brambs Hans
2011-04-01
Full Text Available Abstract Background Systematic aerobe training has positive effects on the compliance of dedicated arterial walls. The adaptations of the arterial structure and function are associated with the blood flow-induced changes of the wall shear stress which induced vascular remodelling via nitric oxide delivered from the endothelial cell. In order to assess functional changes of the common carotid artery over time in these processes, a precise measurement technique is necessary. Before this study, a reliable, precise, and quick method to perform this work is not present. Methods We propose a fully automated algorithm to analyze the cross-sectional area of the carotid artery in MR image sequences. It contains two phases: (1 position detection of the carotid artery, (2 accurate boundary identification of the carotid artery. In the first phase, we use intensity, area size and shape as features to discriminate the carotid artery from other tissues and vessels. In the second phase, the directional gradient, Hough transform, and circle model guided dynamic programming are used to identify the boundary accurately. Results We test the system stability using contrast degraded images (contrast resolutions range from 50% to 90%. The unsigned error ranges from 2.86% ± 2.24% to 3.03% ± 2.40%. The test of noise degraded images (SNRs range from 16 to 20 dB shows the unsigned error ranging from 2.63% ± 2.06% to 3.12% ± 2.11%. The test of raw images has an unsigned error 2.56% ± 2.10% compared to the manual tracings. Conclusions We have proposed an automated system which is able to detect carotid artery cross sectional boundary in MRI sequences during heart cycles. The accuracy reaches 2.56% ± 2.10% compared to the manual tracings. The system is stable, reliable and results are reproducible.
Visualizing Dynamic Memory Allocations
Moreta, Sergio; Telea, Alexandru
2007-01-01
We present a visualization tool for dynamic memory allocation information obtained from instrumenting the runtime allocator used by C programs. The goal of the presented visualization techniques is to convey insight in the dynamic behavior of the allocator. The purpose is to help the allocator
Data linkage dynamics with shedding
Bergstra, J.A.; Middelburg, C.A.
2008-01-01
We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage collection. With shedding, each time a link to a data object is updated by a program, it is determined
Data linkage dynamics with shedding
Bergstra, J.A.; Middelburg, C.A.
2010-01-01
We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage collection. With shedding, each time a link to a data object is updated by a program, it is determined
Van Trijp, J. M P; Breur, A.
2014-01-01
During the course of 2011-2012 The Netherlands Branch Organization of Fire Services-"Brandweer Nederland" has initiated a new occupational safety and quality management program Cicero. This program is specifically designed to improve organizational design; behavior; standards and procedures of Dutch
Lairmore, Michael D.; Oglesbee, Michael; Weisbrode, Steve E.; Wellman, Maxey; Rosol, Thomas; Stromberg, Paul
2011-01-01
Recent reports project a deficiency of veterinary pathologists, indicating a need to train highly qualified veterinary pathologists, particularly in academic veterinary medicine. The need to provide high-quality research training for veterinary pathologists has been recognized by the veterinary pathology training program of the Ohio State University (OSU) since its inception. The OSU program incorporates elements of both residency training and graduate education into a unified program. This review illustrates the components and structure of the training program and reflects on future challenges in training veterinary pathologists. Key elements of the OSU program include an experienced faculty, dedicated staff, and high-quality students who have a sense of common mission. The program is supported through cultural and infrastructure support. Financial compensation, limited research funding, and attractive work environments, including work–life balance, will undoubtedly continue to be forces in the marketplace for veterinary pathologists. To remain competitive and to expand the ability to train veterinary pathologists with research skills, programs must support strong faculty members, provide appropriate infrastructure support, and seek active partnerships with private industry to expand program opportunities. Shortages of trained faculty may be partially resolved by regional cooperation to share faculty expertise or through the use of communications technology to bridge distances between programs. To foster continued interest in academic careers, training programs will need to continue to evolve and respond to trainees' needs while maintaining strong allegiances to high-quality pathology training. Work–life balance, collegial environments that foster a culture of respect for veterinary pathology, and continued efforts to reach out to veterinary students to provide opportunities to learn about the diverse careers offered in veterinary pathology will pay long
Stubenvoll, Michael D; Medley, Jeffrey C; Irwin, Miranda; Song, Mi Hye
2016-09-01
Centrosomes are critical sites for orchestrating microtubule dynamics, and exhibit dynamic changes in size during the cell cycle. As cells progress to mitosis, centrosomes recruit more microtubules (MT) to form mitotic bipolar spindles that ensure proper chromosome segregation. We report a new role for ATX-2, a C. elegans ortholog of Human Ataxin-2, in regulating centrosome size and MT dynamics. ATX-2, an RNA-binding protein, forms a complex with SZY-20 in an RNA-independent fashion. Depleting ATX-2 results in embryonic lethality and cytokinesis failure, and restores centrosome duplication to zyg-1 mutants. In this pathway, SZY-20 promotes ATX-2 abundance, which inversely correlates with centrosome size. Centrosomes depleted of ATX-2 exhibit elevated levels of centrosome factors (ZYG-1, SPD-5, γ-Tubulin), increasing MT nucleating activity but impeding MT growth. We show that ATX-2 influences MT behavior through γ-Tubulin at the centrosome. Our data suggest that RNA-binding proteins play an active role in controlling MT dynamics and provide insight into the control of proper centrosome size and MT dynamics.
Directory of Open Access Journals (Sweden)
Michael D Stubenvoll
2016-09-01
Full Text Available Centrosomes are critical sites for orchestrating microtubule dynamics, and exhibit dynamic changes in size during the cell cycle. As cells progress to mitosis, centrosomes recruit more microtubules (MT to form mitotic bipolar spindles that ensure proper chromosome segregation. We report a new role for ATX-2, a C. elegans ortholog of Human Ataxin-2, in regulating centrosome size and MT dynamics. ATX-2, an RNA-binding protein, forms a complex with SZY-20 in an RNA-independent fashion. Depleting ATX-2 results in embryonic lethality and cytokinesis failure, and restores centrosome duplication to zyg-1 mutants. In this pathway, SZY-20 promotes ATX-2 abundance, which inversely correlates with centrosome size. Centrosomes depleted of ATX-2 exhibit elevated levels of centrosome factors (ZYG-1, SPD-5, γ-Tubulin, increasing MT nucleating activity but impeding MT growth. We show that ATX-2 influences MT behavior through γ-Tubulin at the centrosome. Our data suggest that RNA-binding proteins play an active role in controlling MT dynamics and provide insight into the control of proper centrosome size and MT dynamics.
Energy Technology Data Exchange (ETDEWEB)
Oliveira, Sebastiao E.M.; Rangel, Ricardo D.; Thome, Luiz M.; Baitelli, Roberto; Guimaraes, Carlos H. [Centro de Pesquisas de Energia Eletrica (CEPEL), Rio de Janeiro, RJ (Brazil)
1994-12-31
This work presents a description of the characteristics of the program ANATEM. It also shows the facilities to execution of the software in the current development stagy. (author) 16 refs., 8 figs., 1 tab.
DEFF Research Database (Denmark)
Krommes, Kasper; Bandholm, Thomas; Jakobsen, Markus D
2017-01-01
BACKGROUND: Training intensity is an important variable in strength training and above 80% of one repetition maximum is recommended for promoting strength for athletes. Four dynamic and two isometric on-field exercises are included in the Hölmich groin-injury prevention study that initially faile...
Bartocci, Ezio; Singh, Rupinder; von Stein, Frederick B.; Amedome, Avessie; Caceres, Alan Joseph J.; Castillo, Juan; Closser, Evan; Deards, Gabriel; Goltsev, Andriy; Ines, Roumwelle Sta.; Isbilir, Cem; Marc, Joan K.; Moore, Diquan; Pardi, Dana; Sadhu, Sandeep; Sanchez, Samuel; Sharma, Pooja; Singh, Anoopa; Rogers, Joshua; Wolinetz, Aron; Grosso-Applewhite, Terri; Zhao, Kai; Filipski, Andrew B.; Gilmour, Robert F., Jr.; Grosu, Radu; Glimm, James; Smolka, Scott A.; Cherry, Elizabeth M.; Clarke, Edmund M.; Griffeth, Nancy; Fenton, Flavio H.
2011-01-01
As part of a 3-wk intersession workshop funded by a National Science Foundation Expeditions in Computing award, 15 undergraduate students from the City University of New York collaborated on a study aimed at characterizing the voltage dynamics and arrhythmogenic behavior of cardiac cells for a broad range of physiologically relevant conditions…
Exploring Adaptive Program Behavior
DEFF Research Database (Denmark)
Bonnichsen, Lars Frydendal; Probst, Christian W.
Modern computer systems are increasingly complex, with ever changing bottlenecks. This makes it difficult to ensure consistent performance when porting software, or even running it. Adaptivity, ie, switching between program variations, and dynamic recompilation have been suggested as solutions...
Community Involvement Training Program
A dynamic training conference that brings together more than 450 people from EPA and the Agency’s partners and stakeholders who plan and implement environmental community involvement, partnership, stewardship, outreach, and education programs.
Interactive Dynamic-System Simulation
Korn, Granino A
2010-01-01
Showing you how to use personal computers for modeling and simulation, Interactive Dynamic-System Simulation, Second Edition provides a practical tutorial on interactive dynamic-system modeling and simulation. It discusses how to effectively simulate dynamical systems, such as aerospace vehicles, power plants, chemical processes, control systems, and physiological systems. Written by a pioneer in simulation, the book introduces dynamic-system models and explains how software for solving differential equations works. After demonstrating real simulation programs with simple examples, the author
Energy Technology Data Exchange (ETDEWEB)
Thiriet, L.; Deledicq, A. [Commissariat a l' Energie Atomique, 92 - Fontenay-aux-Roses (France). Centre d' Etudes Nucleaires, section des etudes economiques generales
1968-09-01
First, the point of applying Dynamic Programming to optimization and Operational Research problems in chemical industries are recalled, as well as the conditions in which a dynamic program is illustrated by a sequential graph. A new algorithm for the determination of sub-optimal politics in a sequential graph is then developed. Finally, the applications of sub-optimality concept is shown when taking into account the indirect effects related to possible strategies, or in the case of stochastic choices and of problems of the siting of plants... application examples are given. (authors) [French] On rappelle d'abord l'interet de la Programmation Dynamique dans les problemes d'optimisation et de Recherche Operationnelle dans les industries chimiques, et les conditions de representation d'un programme dynamique par un graphe sequentiel. On expose ensuite un nouvel algorithme de determination de politiques sous-optimales dans un graphe sequentiel. On montre enfin les applications du concept de sous-optimalite a la prise en compte d'effets indirects lies aux politiques possibles, aux choix dans l'aleatoire, a des problemes de localisation optimale d'usines... et on donne des exemples d'utilisation. (auteurs)
Lee, A. Y.
1967-01-01
Computer program calculates the steady state fluid distribution, temperature rise, and pressure drop of a coolant, the material temperature distribution of a heat generating solid, and the heat flux distributions at the fluid-solid interfaces. It performs the necessary iterations automatically within the computer, in one machine run.
Photochemical reaction dynamics
Energy Technology Data Exchange (ETDEWEB)
Moore, B.C. [Lawrence Berkeley Laboratory, Livermore, CA (United States)
1993-12-01
The purpose of the program is to develop a fundamental understanding of unimolecular and bimolecular reaction dynamics with application in combustion and energy systems. The energy dependence in ketene isomerization, ketene dissociation dynamics, and carbonyl substitution on organometallic rhodium complexes in liquid xenon have been studied. Future studies concerning unimolecular processes in ketene as well as energy transfer and kinetic studies of methylene radicals are discussed.
Chadwick, Jess
2011-01-01
Take Razor for a test drive and discover first hand how this scripting syntax simplifies the way you create dynamic, data-driven websites. With this concise guide, you'll work with Razor syntax by building example websites with Microsoft WebMatrix and ASP.NET MVC. You'll quickly learn how Razor lets you combine code and content in a fluid and expressive manner on Windows-based servers. Programming Razor also explores components of the Razor API, and shows you how Razor templates are turned into rendered HTML. By the end of this book, you'll be able to create Razor-based websites with custom
Flexible Animation Computer Program
Stallcup, Scott S.
1990-01-01
FLEXAN (Flexible Animation), computer program animating structural dynamics on Evans and Sutherland PS300-series graphics workstation with VAX/VMS host computer. Typical application is animation of spacecraft undergoing structural stresses caused by thermal and vibrational effects. Displays distortions in shape of spacecraft. Program displays single natural mode of vibration, mode history, or any general deformation of flexible structure. Written in FORTRAN 77.
1976-01-01
Component (ATC) Program was to minimize technical, cost, and schedule risks associated with the future HLH system RDTE and produccion programs. This...U .*C Fjo 3’f4’ATY hV~~ 04"ON o .laQ J .I4 SW. o L M *~ I 16 &E ANI bo , OW@M4.P U " : kS P ? &.a4 2A 4 M’ Po’. ACi; Jar f(SS- ^w 4 I TV & Ab .4 5. E...0 U 0~t (0i r4C F z 1.4 )-40 0H 4J ý4 u -HH N’H ~NH 4J W 245 "Aggregate Breaking Strengths" ( ABS ) were 95,744 lb and 91,478 lb for right-and left
Adewale Amosu; Yuefeng Sun
2017-01-01
WheelerLab is an interactive program that facilitates the interpretation of stratigraphic data (seismic sections, outcrop data and well sections) within a sequence stratigraphic framework and the subsequent transformation of the data into the chronostratigraphic domain. The transformation enables the identification of significant geological features, particularly erosional and non-depositional features that are not obvious in the original seismic domain. Although there are some software produ...
Nonlinear dynamics of structures
Oller, Sergio
2014-01-01
This book lays the foundation of knowledge that will allow a better understanding of nonlinear phenomena that occur in structural dynamics. This work is intended for graduate engineering students who want to expand their knowledge on the dynamic behavior of structures, specifically in the nonlinear field, by presenting the basis of dynamic balance in non‐linear behavior structures due to the material and kinematics mechanical effects. Particularly, this publication shows the solution of the equation of dynamic equilibrium for structure with nonlinear time‐independent materials (plasticity, damage and frequencies evolution), as well as those time dependent non‐linear behavior materials (viscoelasticity and viscoplasticity). The convergence conditions for the non‐linear dynamic structure solution are studied, and the theoretical concepts and its programming algorithms are presented.
DEFF Research Database (Denmark)
Davidsen, Claus; Cardenal, Silvio Javier Pereira; Liu, Suxia
2015-01-01
in stricter water management. The results show that the SNWTP reduces the impacts of water scarcity and impacts optimal water management in the basin. The presented modeling framework provides an objective basis for the development of tools to avoid overpumping groundwater resources at minimum costs.......Water scarcity and rapid economic growth have increased the pressure on water resources and environment in Northern China, causing decreased groundwater tables, ecosystem degradation, and direct economic losses due to insufficient water supply. The authors applied the water value method, a variant...... of stochastic dynamic programming, to optimize water resources management in the Ziya River basin. Natural runoff from the upper basin was estimated with a rainfall-runoff model autocalibrated using in situ measured discharge. The runoff serial correlation was described by a Markov chain and used as input...
Energy Technology Data Exchange (ETDEWEB)
Weston, R.E. Jr.; Sears, T.J.; Preses, J.M. [Brookhaven National Laboratory, Upton, NY (United States)
1993-12-01
Research in this program is directed towards the spectroscopy of small free radicals and reactive molecules and the state-to-state dynamics of gas phase collision, energy transfer, and photodissociation phenomena. Work on several systems is summarized here.
Qiu, Tianlei; Xu, Ying; Gao, Min; Han, Meilin; Wang, Xuming
2017-05-01
While heterotrophic denitrification has been widely used for treating such nitrogen-rich wastewater, it requires the use of additional carbon sources. With fluctuations in the nitrate concentration in the influent, controlling the C/N ratio to avoid carbon breakthrough becomes difficult. To overcome this obstacle, solid-phase denitrification (SPD) using biodegradable polymers has been used, where denitrification and carbon source biodegradation depend on microorganisms growing within the reactor. However, the microbial community dynamics in continuous-flow SPD reactors have not been fully elucidated yet. Here, we aimed to study bacterial community dynamics in a biodenitrification reactor packed with a polylactic acid/poly (3-hydroxybutyrate-co-3-hydroxyvalerate) (PLA/PHBV) blend as the carbon source and biofilm carrier. A lab-scale denitrifying reactor filled with a PLA/PHBV blend was used. With 85 mg/L of influent NO3-N concentration and a hydraulic retention time (HRT) of 2.5 h, more than 92% of the nitrate was removed. The bacterial community of inoculated activated sludge had the highest species richness in all samples. Bacterial species diversity in the reactor first decreased and then increased to a stable level. Diaphorobacter species were predominant in the reactor after day 24. In total, 178 clones were retrieved from the 16S rRNA gene clone library constructed from the biofilm samples in the reactor at 62 days of operation, and 80.9% of the clones were affiliated with Betaproteobacteria. Of these, 97.2% were classified into phylotypes corresponding to Diaphorobacter nitroreducens strain NA10B with 99% sequence similarity. Diaphorobacter, Rhizobium, Acidovorax, Rubrivivax, Azospira, Thermomonas, and Acidaminobacter constituted the biofilm microflora in the stably running reactor. Copyright © 2016 The Society for Biotechnology, Japan. Published by Elsevier B.V. All rights reserved.
Energy Technology Data Exchange (ETDEWEB)
Hedrick, R.A.; Cleveland, J.C.
1976-06-24
BLAST simulates the high temperature gas cooled reactor reheater-steam generator module with a multi-node, fixed boundary, homogenous flow model. The time dependent conservation of energy, mass, and momentum equations are solved by an implicit integration technique. The code contains equation of state formulations for both helium and water as well as heat transfer and friction factor correlations. Normal operational transients and more severe transients such as those resulting in low and/or reverse flow can be simulated. The code calculates helium and water temperature, pressure, flow rate, and tube bulk and wall temperatures at various points within the reheater-steam generator module during the transients. BLAST predictions will be compared with dynamic test results obtained from the Fort St. Vrain reactor owned by Public Service of Colorado, and, based on these comparisons, appropriate improvements will be made in BLAST. BLAST is written in FORTRAN IV for the IBM 360/91 computer at the Oak Ridge National Laboratory.
Six Pillars of Dynamic Schools
Edwards, Steven W.; Chapman, Paul E.
2009-01-01
"Six Pillars of Dynamic Schools" uncovers an often overlooked truth--effective change is the product of hard work and dedication. There is no silver bullet; no matter how many programs, software packages, or new initiatives a district uses, the magic won't just "happen." Dynamic schools result from consistent and redundant focus on the fundamental…
Relative Efficiency of Split-plot Design (SPD) to Randomized ...
African Journals Online (AJOL)
PROF. O. E. OSUAGWU
2013-06-01
Datafield Logistics ..... k level of the poultry manure (split-plot treatments);. ( )jk. AB is the interaction effect of the th j level of the phosphorus (whole-plot treatments) and th k level of the poultry manure (split-plot treatments); ijkl e.
Regulation of ribonucleotide reductase by Spd1 involves multiple mechanisms
DEFF Research Database (Denmark)
Nestoras, Konstantinos; Mohammed, Asma Hadi; Schreurs, Ann-Sofie
2010-01-01
The correct levels of deoxyribonucleotide triphosphates and their relative abundance are important to maintain genomic integrity. Ribonucleotide reductase (RNR) regulation is complex and multifaceted. RNR is regulated allosterically by two nucleotide-binding sites, by transcriptional control, and...
Static Analysis of Dynamic Languages
Madsen, Magnus
2015-01-01
Dynamic programming languages are highly popular and widely used. Java-Script is often called the lingua franca of the web and it is the de facto standardfor client-side web programming. On the server-side the PHP, Python andRuby languages are prevalent. What these languages have in common isan expressive power which is not easily captured by any static type system.These, and similar dynamic languages, are often praised for their ease-of-useand flexibility. Unfortunately, this dynamism comes ...
Kasper, Philipp; Vohlen, Christina; Dinger, Katharina; Mohr, Jasmine; Hucklenbruch-Rother, Eva; Janoschek, Ruth; Köth, Jessica; Matthes, Jan; Appel, Sarah; Dötsch, Jörg; Alejandre Alcazar, Miguel A
2017-10-01
Childhood obesity is associated with renal diseases. Maternal obesity is a risk factor linked to increased adipocytokines and metabolic disorders in the offspring. Therefore, we studied the impact of maternal obesity on renal-intrinsic insulin and adipocytokine signaling and on renal function and structure. To induce maternal obesity, female mice were fed a high-fat diet (HFD) or a standard diet (SD; control group) prior to mating, during gestation, and throughout lactation. A third group of dams was fed HFD only during lactation (HFD-Lac). After weaning at postnatal day (P)21, offspring of all groups received SD. Clinically, HFD offspring were overweight and insulin resistant at P21. Although no metabolic changes were detected at P70, renal sodium excretion was reduced by 40%, and renal matrix deposition increased in the HFD group. Mechanistically, two stages were differentiated. In the early stage (P21), compared with the control group, HFD showed threefold increased white adipose tissue, impaired glucose tolerance, hyperleptinemia, and hyperinsulinemia. Renal leptin/Stat3-signaling was activated. In contrast, the Akt/ AMPKα cascade and Krüppel-like factor 15 expression were decreased. In the late stage (P70), although no metabolic differences were detected in HFD when compared with the control group, leptin/Stat3-signaling was reduced, and Akt/AMPKα was activated in the kidneys. This effect was linked to an increase of proliferative (cyclinD1/D2) and profibrotic (ctgf/collagen IIIα1) markers, similar to leptin-deficient mice. HFD-Lac mice exhibited metabolic changes at P21 similar to HFD, but no other persistent changes. This study shows a link between maternal obesity and metabolic programming of renal structure and function and intrinsic-renal Stat3/Akt/AMPKα signaling in the offspring. Copyright © 2017 Endocrine Society.
Static Analysis for Dynamic XML
DEFF Research Database (Denmark)
Christensen, Aske Simon; Møller, Anders; Schwartzbach, Michael Ignatieff
2002-01-01
We describe the summary graph lattice for dataflow analysis of programs that dynamically construct XML documents. Summary graphs have successfully been used to provide static guarantees in the JWIG language for programming interactive Web services. In particular, the JWIG compiler is able to check...
Hardware Support for Dynamic Languages
DEFF Research Database (Denmark)
Schleuniger, Pascal; Karlsson, Sven; Probst, Christian W.
2011-01-01
In recent years, dynamic programming languages have enjoyed increasing popularity. For example, JavaScript has become one of the most popular programming languages on the web. As the complexity of web applications is growing, compute-intensive workloads are increasingly handed off to the client...
Static Analysis of Dynamic Languages
DEFF Research Database (Denmark)
Madsen, Magnus
Dynamic programming languages are highly popular and widely used. Java- Script is often called the lingua franca of the web and it is the de facto standard for client-side web programming. On the server-side the PHP, Python and Ruby languages are prevalent. What these languages have in common...
Directory of Open Access Journals (Sweden)
Xiao Li
2016-08-01
Full Text Available Epigenetic mechanisms have an important role in the pre- and peri-conceptional programming by maternal nutrition. Yet, whether or not RNA m6A methylation—an old epigenetic marker receiving increased attention recently—is involved remains an unknown question. In this study, mouse high-fat feeding prior to conception was shown to induce overweight and glucose intolerant dams, which then continued to be exposed to a high-fat diet during gestation and lactation. The dams on a standard diet throughout the whole experiment were used as a control. Results showed that maternal high-fat intake impaired postnatal growth in male offspring, indicated by decreased body weight and Lee’s index at 3, 8 and 15 weeks old, but the percentages of visceral fat and tibialis anterior relative to the whole body weights were significantly increased at eight weeks of age. The maternal high-fat exposure significantly increased mRNA N6-methyladenosine (m6A levels in visceral fat at three weeks old, combined with downregulated Fat mass and obesity-associated gene (FTO and upregulated Methyltransferase like 3 (METTL3 transcription, and these changes were reversed at eight weeks of age. In the tibialis anterior muscle, the maternal high-fat diet significantly enhanced m6A modifications at three weeks, and lowered m6A levels at 15 weeks of age. Accordingly, FTO transcription was significantly inhibited at three weeks and stimulated at 15 weeks of age, and METTL3 transcripts were significantly improved at three weeks. Interestingly, both FTO and METTL3 transcription was significantly elevated at eight weeks of age, and yet the m6A modifications remained unchanged. Our study showed that maternal high-fat intake could affect mRNA m6A modifications and its related genes in offspring in a tissue-specific and development-dependent way, and provided an interesting indication of the working of the m6A system during the transmission from maternal nutrition to subsequent
Ecological Research Division Theoretical Ecology Program. [Contains abstracts
Energy Technology Data Exchange (ETDEWEB)
1990-10-01
This report presents the goals of the Theoretical Ecology Program and abstracts of research in progress. Abstracts cover both theoretical research that began as part of the terrestrial ecology core program and new projects funded by the theoretical program begun in 1988. Projects have been clustered into four major categories: Ecosystem dynamics; landscape/scaling dynamics; population dynamics; and experiment/sample design.
Hunter, Jason
2001-01-01
Servlets are an exciting and important technology that ties Java to the Web, allowing programmers to write Java programs that create dynamic web content. Java Servlet Programming covers everything Java developers need to know to write effective servlets. It explains the servlet lifecycle, showing how to use servlets to maintain state information effortlessly. It also describes how to serve dynamic web content, including both HTML pages and multimedia data, and explores more advanced topics like integrated session tracking, efficient database connectivity using JDBC, applet-servlet communicat
Wilson, E
2013-01-01
This document is part of Subvolume C 'Accelerators and Colliders' of Volume 21 'Elementary Particles' of Landolt-Börnstein - Group I 'Elementary Particles, Nuclei and Atoms'. It contains the Chapter '2 Beam Dynamics' with the content: 2 Beam Dynamics 2.1 Linear Transverse Beam Dynamics 2.2 Coupling 2.3 Liouville's Theorem 2.4 Momentum Dependent Transverse Motion 2.5 Longitudinal Motion
Sternberg, Shlomo
2010-01-01
Celebrated mathematician Shlomo Sternberg, a pioneer in the field of dynamical systems, created this modern one-semester introduction to the subject for his classes at Harvard University. Its wide-ranging treatment covers one-dimensional dynamics, differential equations, random walks, iterated function systems, symbolic dynamics, and Markov chains. Supplementary materials offer a variety of online components, including PowerPoint lecture slides for professors and MATLAB exercises.""Even though there are many dynamical systems books on the market, this book is bound to become a classic. The the
Federal Laboratory Consortium — The Dynamics Lab replicates vibration environments for every Navy platform. Testing performed includes: Flight Clearance, Component Improvement, Qualification, Life...
Conference on Multibody Dynamics
Multibody Dynamics : Computational Methods and Applications
2014-01-01
By having its origin in analytical and continuum mechanics, as well as in computer science and applied mathematics, multibody dynamics provides a basis for analysis and virtual prototyping of innovative applications in many fields of contemporary engineering. With the utilization of computational models and algorithms that classically belonged to different fields of applied science, multibody dynamics delivers reliable simulation platforms for diverse highly-developed industrial products such as vehicle and railway systems, aeronautical and space vehicles, robotic manipulators, smart structures, biomechanical applications and nano-technologies. The chapters of this volume are based on the revised and extended versions of the selected scientific papers from amongst 255 original contributions that have been accepted to be presented within the program of the distinguished international ECCOMAS conference. It reflects state-of-the-art in the advances of multibody dynamics, providing excellent insight in the recen...
DEFF Research Database (Denmark)
Brorsen, Michael
These lecture notes are intended mainly for the 7th semester course "Fluid Dynamics" offered by the Study Committee on Civil Engineering, Aalborg University.......These lecture notes are intended mainly for the 7th semester course "Fluid Dynamics" offered by the Study Committee on Civil Engineering, Aalborg University....
Dynamic Pricing Criteria in Linear Programming
1988-07-01
503 526 0.96 323.27 251.21 1.29 ETAM = 623 640 0.97 235.27 180.22 1.31 E226 530 581 0.91 166.11 137.79 1.21 Geom. Men: 0.9g Geom. Mmn: 1.23 (SHIP...ADLITTLE 114 2 1.8 114 13 11.4 SHARE1B 182 8 4.4 274 10 3.6 ISRAEL 230 2 0.9 296 17 5.7 BANDM 550 28 5.1 454 28 6.2 STAIR 847 56 6.6 418 52 12.4 ETAM
Heuristic Dynamic Programming With Internal Goal Representation
2013-09-03
Jagannathan (2007). We introduce one more input, namely internal reward signal s, for the critic network and aim to help the value function approximation...reinforcement learning (ADPRL), IEEE symposium series on computational intelligence (SSCI), France He P, Jagannathan S (2007) Reinforcement learning
LanDPro: Landscape Dynamics Program
2012-09-18
forward progress in both areas of research. The focus of this component of LanDPro is on cleared circles, which are roughly circular shaped features...about 1 to 3 m diameter that have a smooth, interior shallow depression either devoid of desert pavement clasts or sparsely covered with clasts
Program Partitioning using Dynamic Trust Models
DEFF Research Database (Denmark)
Søndergaard, Dan; Probst, Christian W.; Jensen, Christian D.
2006-01-01
Developing distributed applications is a difficult task. It is further complicated if system-wide security policies shall be specified and enforced, or if both data and hosts are owned by principals that do not fully trust each other, as is typically the case in service-oriented or grid-based sce...... of the splitting framework, that is parametrised in the trust component, and show the result of specialising it with different trust models. We also develop a metric to measure the quality of the result of the partitioning process.......Developing distributed applications is a difficult task. It is further complicated if system-wide security policies shall be specified and enforced, or if both data and hosts are owned by principals that do not fully trust each other, as is typically the case in service-oriented or grid...... across a set of hosts, obeying both the annotations and the trust relation between the principals. The resulting applications guarantee \\$\\backslash\\$emph{by construction} that safety and confidentiality of both data and computations are ensured. In this work, we develop a generalised version...
Solution Methods for Stochastic Dynamic Linear Programs.
1980-12-01
Huang, Ziemba and Ben- Tal [35] examined this property using the theory of moment spaces to bound the expectation. Their work rests on the following...b - a)z(b) _ ’ _ z(pA). Huang, Ziemba and Ben-Tal carry these principles further. They sub- divide the interval [a, b] and apply successively finer...Hotelling, H., " The economics of exhaustible resources", Journal of Political Economy 39, pp. 137-175, 1931. [35] Huang, C.C., W.T. Ziemba and A. Ben
Approximate Dynamic Programming for Military Resource Allocation
2014-12-26
rewards using subgradient information. Through several theorems, optimality of the algorithm is proven for a two-stage Dy- namic Weapon-Target Assignment...From the solution of the subproblems by the MMR algorithm, this can easily be proven for the 2-stage DWTA. The left subgradient v−(x(2), ω) is...uk ++1),M)]. The same idea is applied to the right of x(2) for the right subgradient . Concavity is preserved by the following theorem, similar to
Markov Decision Processes Discrete Stochastic Dynamic Programming
Puterman, Martin L
2005-01-01
The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover volumes, Wiley hopes to extend the lives of these works by making them available to future generations of statisticians, mathematicians, and scientists. "This text is unique in bringing together so many results hitherto found only in part in other texts and papers. . . . The text is fairly self-contained, inclusive of some basic mathematical results needed, and provides a rich diet
Discrete dynamics versus analytic dynamics
DEFF Research Database (Denmark)
Toxværd, Søren
2014-01-01
For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent of such a......For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent...... of such an analytic analogy, exists an exact hidden energy invariance E * for VA dynamics. The fact that the discrete VA dynamics has the same invariances as Newtonian dynamics raises the question, which of the formulations that are correct, or alternatively, the most appropriate formulation of classical dynamics....... In this context the relation between the discrete VA dynamics and the (general) discrete dynamics investigated by Lee [Phys. Lett. B122, 217 (1983)] is presented and discussed....
Managerial and program inefficiency for European meat manufacturing firms
Kapelko, Magdalena; Oude Lansink, Alfons
2017-01-01
This paper proposes a dynamic multidirectional inefficiency analysis approach within the context of Data Envelopment Analysis to measuring input- and investment-specific managerial and program inefficiency for groups of firms characterized by different technologies. Dynamic managerial inefficiency refers to the distance to the firms’ group-specific dynamic frontier of best practices, and dynamic program inefficiency measures the difference between the group-specific dynamic frontier and the p...
Hill, David P.; Prejean, Stephanie; Schubert, Gerald
2015-01-01
Dynamic stresses propagating as seismic waves from large earthquakes trigger a spectrum of responses at global distances. In addition to locally triggered earthquakes in a variety of tectonic environments, dynamic stresses trigger tectonic (nonvolcanic) tremor in the brittle–plastic transition zone along major plate-boundary faults, activity changes in hydrothermal and volcanic systems, and, in hydrologic domains, changes in spring discharge, water well levels, soil liquefaction, and the eruption of mud volcanoes. Surface waves with periods of 15–200 s are the most effective triggering agents; body-wave trigger is less frequent. Triggering dynamic stresses can be < 1 kPa.
DEFF Research Database (Denmark)
Sannino, Francesco
2013-01-01
paradigm the physical scale and henceforth also the massive spectrum of the theory jump at the lower boundary of the conformal window. In particular we propose that a theory can suddenly jump from a Quantum Chromodynamics type spectrum, at the lower boundary of the conformal window, to a conformal one...... without particle interpretation. The jumping scenario, therefore, does not support a near-conformal dynamics of walking type. We will also discuss the impact of jumping dynamics on the construction of models of dynamical electroweak symmetry breaking....