Illumination system design with multi-step optimization
NASA Astrophysics Data System (ADS)
Magarill, Simon; Cassarly, William J.
2015-08-01
Automatic optimization algorithms can be used when designing illumination systems. For systems with many design variables, optimization using an adjustable set of variables at different steps of the process can provide different local minima. We present a few examples of implementing a multi-step optimization method. We have found that this approach can sometimes lead to more efficient solutions. In this paper we illustrate the effectiveness of using a commercially available optimization algorithm with a slightly modified procedure.
Multi-step optimization strategy for fuel-optimal orbital transfer of low-thrust spacecraft
NASA Astrophysics Data System (ADS)
Rasotto, M.; Armellin, R.; Di Lizia, P.
2016-03-01
An effective method for the design of fuel-optimal transfers in two- and three-body dynamics is presented. The optimal control problem is formulated using calculus of variation and primer vector theory. This leads to a multi-point boundary value problem (MPBVP), characterized by complex inner constraints and a discontinuous thrust profile. The first issue is addressed by embedding the MPBVP in a parametric optimization problem, thus allowing a simplification of the set of transversality constraints. The second problem is solved by representing the discontinuous control function by a smooth function depending on a continuation parameter. The resulting trajectory optimization method can deal with different intermediate conditions, and no a priori knowledge of the control structure is required. Test cases in both the two- and three-body dynamics show the capability of the method in solving complex trajectory design problems.
Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement.
Schuetz, Philipp; Caflisch, Amedeo
2008-04-01
Identifying strongly connected substructures in large networks provides insight into their coarse-grained organization. Several approaches based on the optimization of a quality function, e.g., the modularity, have been proposed. We present here a multistep extension of the greedy algorithm (MSG) that allows the merging of more than one pair of communities at each iteration step. The essential idea is to prevent the premature condensation into few large communities. Upon convergence of the MSG a simple refinement procedure called "vertex mover" (VM) is used for reassigning vertices to neighboring communities to improve the final modularity value. With an appropriate choice of the step width, the combined MSG-VM algorithm is able to find solutions of higher modularity than those reported previously. The multistep extension does not alter the scaling of computational cost of the greedy algorithm. PMID:18517695
Faries, Kaitlyn M; Kressel, Lucas L; Dylla, Nicholas P; Wander, Marc J; Hanson, Deborah K; Holten, Dewey; Laible, Philip D; Kirmaier, Christine
2016-02-01
Using high-throughput methods for mutagenesis, protein isolation and charge-separation functionality, we have assayed 40 Rhodobacter capsulatus reaction center (RC) mutants for their P(+)QB(-) yield (P is a dimer of bacteriochlorophylls and Q is a ubiquinone) as produced using the normally inactive B-side cofactors BB and HB (where B is a bacteriochlorophyll and H is a bacteriopheophytin). Two sets of mutants explore all possible residues at M131 (M polypeptide, native residue Val near HB) in tandem with either a fixed His or a fixed Asn at L181 (L polypeptide, native residue Phe near BB). A third set of mutants explores all possible residues at L181 with a fixed Glu at M131 that can form a hydrogen bond to HB. For each set of mutants, the results of a rapid millisecond screening assay that probes the yield of P(+)QB(-) are compared among that set and to the other mutants reported here or previously. For a subset of eight mutants, the rate constants and yields of the individual B-side electron transfer processes are determined via transient absorption measurements spanning 100 fs to 50 μs. The resulting ranking of mutants for their yield of P(+)QB(-) from ultrafast experiments is in good agreement with that obtained from the millisecond screening assay, further validating the efficient, high-throughput screen for B-side transmembrane charge separation. Results from mutants that individually show progress toward optimization of P(+)HB(-)→P(+)QB(-) electron transfer or initial P*→P(+)HB(-) conversion highlight unmet challenges of optimizing both processes simultaneously. PMID:26658355
A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems
Cao, Leilei; Xu, Lihong; Goodman, Erik D.
2016-01-01
A Guiding Evolutionary Algorithm (GEA) with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared. PMID:27293421
A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems.
Cao, Leilei; Xu, Lihong; Goodman, Erik D
2016-01-01
A Guiding Evolutionary Algorithm (GEA) with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared. PMID:27293421
Pugatch, Rami
2015-02-24
Bacterial self-replication is a complex process composed of many de novo synthesis steps catalyzed by a myriad of molecular processing units, e.g., the transcription-translation machinery, metabolic enzymes, and the replisome. Successful completion of all production tasks requires a schedule-a temporal assignment of each of the production tasks to its respective processing units that respects ordering and resource constraints. Most intracellular growth processes are well characterized. However, the manner in which they are coordinated under the control of a scheduling policy is not well understood. When fast replication is favored, a schedule that minimizes the completion time is desirable. However, if resources are scarce, it is typically computationally hard to find such a schedule, in the worst case. Here, we show that optimal scheduling naturally emerges in cellular self-replication. Optimal doubling time is obtained by maintaining a sufficiently large inventory of intermediate metabolites and processing units required for self-replication and additionally requiring that these processing units be "greedy," i.e., not idle if they can perform a production task. We calculate the distribution of doubling times of such optimally scheduled self-replicating factories, and find it has a universal form-log-Frechet, not sensitive to many microscopic details. Analyzing two recent datasets of Escherichia coli growing in a stationary medium, we find excellent agreement between the observed doubling-time distribution and the predicted universal distribution, suggesting E. coli is optimally scheduling its replication. Greedy scheduling appears as a simple generic route to optimal scheduling when speed is the optimization criterion. Other criteria such as efficiency require more elaborate scheduling policies and tighter regulation. PMID:25675498
Pugatch, Rami
2015-01-01
Bacterial self-replication is a complex process composed of many de novo synthesis steps catalyzed by a myriad of molecular processing units, e.g., the transcription–translation machinery, metabolic enzymes, and the replisome. Successful completion of all production tasks requires a schedule—a temporal assignment of each of the production tasks to its respective processing units that respects ordering and resource constraints. Most intracellular growth processes are well characterized. However, the manner in which they are coordinated under the control of a scheduling policy is not well understood. When fast replication is favored, a schedule that minimizes the completion time is desirable. However, if resources are scarce, it is typically computationally hard to find such a schedule, in the worst case. Here, we show that optimal scheduling naturally emerges in cellular self-replication. Optimal doubling time is obtained by maintaining a sufficiently large inventory of intermediate metabolites and processing units required for self-replication and additionally requiring that these processing units be “greedy,” i.e., not idle if they can perform a production task. We calculate the distribution of doubling times of such optimally scheduled self-replicating factories, and find it has a universal form—log-Frechet, not sensitive to many microscopic details. Analyzing two recent datasets of Escherichia coli growing in a stationary medium, we find excellent agreement between the observed doubling-time distribution and the predicted universal distribution, suggesting E. coli is optimally scheduling its replication. Greedy scheduling appears as a simple generic route to optimal scheduling when speed is the optimization criterion. Other criteria such as efficiency require more elaborate scheduling policies and tighter regulation. PMID:25675498
Arabi Jeshvaghani, R.; Zohdi, H.; Shahverdi, H.R.; Bozorg, M.; Hadavi, S.M.M.
2012-11-15
Multi-step heat treatments comprise of high temperature forming (150 Degree-Sign C/24 h plus 190 Degree-Sign C for several minutes) and subsequent low temperature forming (120 Degree-Sign C for 24 h) is developed in creep age forming of 7075 aluminum alloy to decrease springback and exfoliation corrosion susceptibility without reduction in tensile properties. The results show that the multi-step heat treatment gives the low springback and the best combination of exfoliation corrosion resistance and tensile strength. The lower springback is attributed to the dislocation recovery and more stress relaxation at higher temperature. Transmission electron microscopy observations show that corrosion resistance is improved due to the enlargement in the size and the inter-particle distance of the grain boundaries precipitates. Furthermore, the achievement of the high strength is related to the uniform distribution of ultrafine {eta} Prime precipitates within grains. - Highlights: Black-Right-Pointing-Pointer Creep age forming developed for manufacturing of aircraft wing panels by aluminum alloy. Black-Right-Pointing-Pointer A good combination of properties with minimal springback is required in this component. Black-Right-Pointing-Pointer This requirement can be improved through the appropriate heat treatments. Black-Right-Pointing-Pointer Multi-step cycles developed in creep age forming of AA7075 for improving of springback and properties. Black-Right-Pointing-Pointer Results indicate simultaneous enhancing the properties and shape accuracy (lower springback).
NASA Astrophysics Data System (ADS)
Hanin, Leonid; Zaider, Marco
2014-08-01
We revisit a long-standing problem of optimization of fractionated radiotherapy and solve it in considerable generality under the following three assumptions only: (1) repopulation of clonogenic cancer cells between radiation exposures follows linear birth-and-death Markov process; (2) clonogenic cancer cells do not interact with each other; and (3) the dose response function s(D) is decreasing and logarithmically concave. Optimal schedules of fractionated radiation identified in this work can be described by the following ‘greedy’ principle: give the maximum possible dose as soon as possible. This means that upper bounds on the total dose and the dose per fraction reflecting limitations on the damage to normal tissue, along with a lower bound on the time between successive fractions of radiation, determine the optimal radiation schedules completely. Results of this work lead to a new paradigm of dose delivery which we term optimal biologically-based adaptive boosting (OBBAB). It amounts to (a) subdividing the target into regions that are homogeneous with respect to the maximum total dose and maximum dose per fraction allowed by the anatomy and biological properties of the normal tissue within (or adjacent to) the region in question and (b) treating each region with an individual optimal schedule determined by these constraints. The fact that different regions may be treated to different total dose and dose per fraction mean that the number of fractions may also vary between regions. Numerical evidence suggests that OBBAB produces significantly larger tumor control probability than the corresponding conventional treatments.
Chaswal, V.; Yoo, S.; Thomadsen, B. R.; Henderson, D. L.
2007-02-15
The goals of interstitial implant brachytherapy include delivery of the target dose in a uniform manner while sparing sensitive structures, and minimizing the number of needles and sources. We investigated the use of a multi-species source arrangement ({sup 192}Ir with {sup 125}I) for treatment in interstitial prostate brachytherapy. The algorithm utilizes an 'adjoint ratio', which provides a means of ranking source positions and is the criterion for the Greedy Heuristic optimization. Three cases were compared, each using 0.4 mCi {sup 125}I seeds: case I is the base case using {sup 125}I alone, case II uses 0.12 mCi {sup 192}Ir seeds mixed with {sup 125}I, and case III uses 0.25 mCi {sup 192}Ir mixed with {sup 125}I. Both multi-species cases result in lower exposure of the urethra and central prostate region. Compared with the base case, the exposure to the rectum and normal tissue increases by a significant amount for case III as compared with the increase in case II, signifying the effect of slower dose falloff rate of higher energy gammas of {sup 192}Ir in the tissue. The number of seeds and needles decreases in both multi-species cases, with case III requiring fewer seeds and needles than case II. Further, the effect of {sup 192}Ir on uniformity was investigated using the 0.12 mCi {sup 192}Ir seeds in multi-species implants. An increase in uniformity was observed with an increase in the number of 0.12 mCi {sup 192}Ir seeds implanted. The effects of prostate size on the evaluation parameters for multi-species implants were investigated using 0.12 mCi {sup 192}Ir and 0.4 mCi {sup 125}I, and an acceptable treatment plan with increased uniformity was obtained.
Coutu, Diane L
2003-02-01
Americans are outraged at the greediness of Wall Street analysts, dot-com entrepreneurs, and, most of all, chief executive officers. How could Tyco's Dennis Kozlowski use company funds to throw his wife a million-dollar birthday bash on an Italian island? How could Enron's Ken Lay sell thousands of shares of his company's once high-flying stock just before it crashed, leaving employees with nothing? Even America's most popular domestic guru, Martha Stewart, is suspected of having her hand in the cookie jar. To some extent, our outrage may be justified, writes HBR senior editor Diane Coutu. And yet, it's easy to forget that just a couple years ago these same people were lauded as heroes. Many Americans wanted nothing more, in fact, than to emulate them, to share in their fortunes. Indeed, we spent an enormous amount of time talking and thinking about double-digit returns, IPOs, day trading, and stock options. It could easily be argued that it was public indulgence in corporate money lust that largely created the mess we're now in. It's time to take a hard look at greed, both in its general form and in its peculiarly American incarnation, says Coutu. If Federal Reserve Board chairman Alan Greenspan was correct in telling Congress that "infectious greed" contaminated U.S. business, then we need to try to understand its causes--and how the average American may have contributed to it. Why did so many of us fall prey to greed? With a deep, almost reflexive trust in the free market, are Americans somehow greedier than other peoples? And as we look at the wreckage from the 1990s, can we be sure it won't happen again? PMID:12577651
Synthesis of Greedy Algorithms Using Dominance Relations
NASA Technical Reports Server (NTRS)
Nedunuri, Srinivas; Smith, Douglas R.; Cook, William R.
2010-01-01
Greedy algorithms exploit problem structure and constraints to achieve linear-time performance. Yet there is still no completely satisfactory way of constructing greedy algorithms. For example, the Greedy Algorithm of Edmonds depends upon translating a problem into an algebraic structure called a matroid, but the existence of such a translation can be as hard to determine as the existence of a greedy algorithm itself. An alternative characterization of greedy algorithms is in terms of dominance relations, a well-known algorithmic technique used to prune search spaces. We demonstrate a process by which dominance relations can be methodically derived for a number of greedy algorithms, including activity selection, and prefix-free codes. By incorporating our approach into an existing framework for algorithm synthesis, we demonstrate that it could be the basis for an effective engineering method for greedy algorithms. We also compare our approach with other characterizations of greedy algorithms.
Multi-step avalanche chambers for final experiment E605
NASA Astrophysics Data System (ADS)
Hubbard, J. R.; Coutrakon, G.; Cribier, M.; Mangeot, Ph.; Martin, H.; Mullié, J.; Palanque, S.; Pelle, J.
1980-10-01
Physical processein multi-step avalanche chambers, detector properties, and difficulties in operation are discussed. Advantages of multi-step chambers over classical MWPCs for specific experimental problems encountered in experiment E605 (high-flux environment and Cherenkov imaging) are described. Some details of detector design are presented.
Multi-step wrought processing of TiAl-based alloys
Fuchs, G.E.
1997-04-01
Wrought processing will likely be needed for fabrication of a variety of TiAl-based alloy structural components. Laboratory and development work has usually relied on one-step forging to produce test material. Attempts to scale-up TiAl-based alloy processing has indicated that multi-step wrought processing is necessary. The purpose of this study was to examine potential multi-step processing routes, such as two-step isothermal forging and extrusion + isothermal forging. The effects of processing (I/M versus P/M), intermediate recrystallization heat treatments and processing route on the tensile and creep properties of Ti-48Al-2Nb-2Cr alloys were examined. The results of the testing were then compared to samples from the same heats of materials processed by one-step routes. Finally, by evaluating the effect of processing on microstructure and properties, optimized and potentially lower cost processing routes could be identified.
Multi-Step Ahead Predictions for Critical Levels in Physiological Time Series.
ElMoaqet, Hisham; Tilbury, Dawn M; Ramachandran, Satya Krishna
2016-07-01
Standard modeling and evaluation methods have been classically used in analyzing engineering dynamical systems where the fundamental problem is to minimize the (mean) error between the real and predicted systems. Although these methods have been applied to multi-step ahead predictions of physiological signals, it is often more important to predict clinically relevant events than just to match these signals. Adverse clinical events, which occur after a physiological signal breaches a clinically defined critical threshold, are a popular class of such events. This paper presents a framework for multi-step ahead predictions of critical levels of abnormality in physiological signals. First, a performance metric is presented for evaluating multi-step ahead predictions. Then, this metric is used to identify personalized models optimized with respect to predictions of critical levels of abnormality. To address the paucity of adverse events, weighted support vector machines and cost-sensitive learning are used to optimize the proposed framework with respect to statistical metrics that can take into account the relative rarity of such events. PMID:27244754
DEFORMATION DEPENDENT TUL MULTI-STEP DIRECT MODEL
WIENKE,H.; CAPOTE, R.; HERMAN, M.; SIN, M.
2007-04-22
The Multi-Step Direct (MSD) module TRISTAN in the nuclear reaction code EMPIRE has been extended in order to account for nuclear deformation. The new formalism was tested in calculations of neutron emission spectra emitted from the {sup 232}Th(n,xn) reaction. These calculations include vibration-rotational Coupled Channels (CC) for the inelastic scattering to low-lying collective levels, ''deformed'' MSD with quadrupole deformation for inelastic scattering to the continuum, Multi-Step Compound (MSC) and Hauser-Feshbach with advanced treatment of the fission channel. Prompt fission neutrons were also calculated. The comparison with experimental data shows clear improvement over the ''spherical'' MSD calculations and JEFF-3.1 and JENDL-3.3 evaluations.
Hypersonic flow over a multi-step afterbody
NASA Astrophysics Data System (ADS)
Menezes, V.; Kumar, S.; Maruta, K.; Reddy, K. P. J.; Takayama, K.
2005-12-01
Effect of a multi-step base on the total drag of a missile shaped body was studied in a shock tunnel at a hypersonic Mach number of 5.75. Total drag over the body was measured using a single component accelerometer force balance. Experimental results indicated a reduction of 8% in total drag over the body with a multi-step base in comparison with the base-line (model with a flat base) configuration.The flow fields around the above bodies were simulated using a 2-D axisymmetric Navier Stokes solver and the simulated results on total drag were compared with the measured results. The simulated flow field pictures give an insight into the involved flow physics.
The convergence of the greedy algorithm with respect to the Haar system in the space L{sub p}(0,1)
Livshits, Evgenii D
2010-02-28
The approximation properties of the X-greedy algorithm in the space L{sub p}(0,1) are studied. For 1 < p < 2 estimates for the rate of convergence of the X-greedy algorithm with respect to the Haar system are obtained that are close to optimal. Bibliography: 18 titles.
Hierarchical multi-step organization during viral capsid assembly.
Lampel, Ayala; Varenik, Maxim; Regev, Oren; Gazit, Ehud
2015-12-01
Formation of the HIV-1 core by the association of capsid proteins is a critical, not fully understood, step in the viral life cycle. Understanding the early stages of the mechanism may improve treatment opportunities. Here, spectroscopic analysis (opacity) is used to follow the kinetics of capsid protein assembly, which shows three stages: a lag phase, followed by a linear increase stage and terminated by a plateau. Adding pre-incubated capsid proteins at the start of the lag phase shortens it and increases the rate of assembly at the linear stage, demonstrating autoacceleration and cooperative assembly. Cryogenic transmission electron microscopy is used to probe structural evolution at these three stages. At the beginning of the lag phase, short tubular assemblies are found alongside micron long tubes. Their elongation continues all throughout the lag phase, at the end of which tubes start to assemble into bundles. Based on these results, we suggest a multi-step self-assembly process including fast nucleation and elongation followed by tubes packing into arrays. PMID:26497114
Collecting reliable clades using the Greedy Strict Consensus Merger
Böcker, Sebastian
2016-01-01
Supertree methods combine a set of phylogenetic trees into a single supertree. Similar to supermatrix methods, these methods provide a way to reconstruct larger parts of the Tree of Life, potentially evading the computational complexity of phylogenetic inference methods such as maximum likelihood. The supertree problem can be formalized in different ways, to cope with contradictory information in the input. Many supertree methods have been developed. Some of them solve NP-hard optimization problems like the well-known Matrix Representation with Parsimony, while others have polynomial worst-case running time but work in a greedy fashion (FlipCut). Both can profit from a set of clades that are already known to be part of the supertree. The Superfine approach shows how the Greedy Strict Consensus Merger (GSCM) can be used as preprocessing to find these clades. We introduce different scoring functions for the GSCM, a randomization, as well as a combination thereof to improve the GSCM to find more clades. This helps, in turn, to improve the resolution of the GSCM supertree. We find this modifications to increase the number of true positive clades by 18% compared to the currently used Overlap scoring. PMID:27375971
P.I. Steven M. Larson MD Co P.I. Nai-Kong Cheung MD, Ph.D.
2009-09-21
The 4 specific aims of this project are: (1) Optimization of MST to increase tumor uptake; (2) Antigen heterogeneity; (3) Characterization and reduction of renal uptake; and (4) Validation in vivo of optimized MST targeted therapy. This proposal focussed upon optimizing multistep immune targeting strategies for the treatment of cancer. Two multi-step targeting constructs were explored during this funding period: (1) anti-Tag-72 and (2) anti-GD2.
Efficient greedy algorithms for economic manpower shift planning
NASA Astrophysics Data System (ADS)
Nearchou, A. C.; Giannikos, I. C.; Lagodimos, A. G.
2015-01-01
Consideration is given to the economic manpower shift planning (EMSP) problem, an NP-hard capacity planning problem appearing in various industrial settings including the packing stage of production in process industries and maintenance operations. EMSP aims to determine the manpower needed in each available workday shift of a given planning horizon so as to complete a set of independent jobs at minimum cost. Three greedy heuristics are presented for the EMSP solution. These practically constitute adaptations of an existing algorithm for a simplified version of EMSP which had shown excellent performance in terms of solution quality and speed. Experimentation shows that the new algorithms perform very well in comparison to the results obtained by both the CPLEX optimizer and an existing metaheuristic. Statistical analysis is deployed to rank the algorithms in terms of their solution quality and to identify the effects that critical planning factors may have on their relative efficiency.
Mitran, T L; Melchert, O; Hartmann, A K
2013-12-01
The main characteristics of biased greedy random walks (BGRWs) on two-dimensional lattices with real-valued quenched disorder on the lattice edges are studied. Here the disorder allows for negative edge weights. In previous studies, considering the negative-weight percolation (NWP) problem, this was shown to change the universality class of the existing, static percolation transition. In the presented study, four different types of BGRWs and an algorithm based on the ant colony optimization heuristic were considered. Regarding the BGRWs, the precise configurations of the lattice walks constructed during the numerical simulations were influenced by two parameters: a disorder parameter ρ that controls the amount of negative edge weights on the lattice and a bias strength B that governs the drift of the walkers along a certain lattice direction. The random walks are "greedy" in the sense that the local optimal choice of the walker is to preferentially traverse edges with a negative weight (associated with a net gain of "energy" for the walker). Here, the pivotal observable is the probability that, after termination, a lattice walk exhibits a total negative weight, which is here considered as percolating. The behavior of this observable as function of ρ for different bias strengths B is put under scrutiny. Upon tuning ρ, the probability to find such a feasible lattice walk increases from zero to 1. This is the key feature of the percolation transition in the NWP model. Here, we address the question how well the transition point ρ(c), resulting from numerically exact and "static" simulations in terms of the NWP model, can be resolved using simple dynamic algorithms that have only local information available, one of the basic questions in the physics of glassy systems. PMID:24483380
An Experimental Method for the Active Learning of Greedy Algorithms
ERIC Educational Resources Information Center
Velazquez-Iturbide, J. Angel
2013-01-01
Greedy algorithms constitute an apparently simple algorithm design technique, but its learning goals are not simple to achieve.We present a didacticmethod aimed at promoting active learning of greedy algorithms. The method is focused on the concept of selection function, and is based on explicit learning goals. It mainly consists of an…
Li, Zhengbang; Zhang, Wei; Pan, Dongdong; Li, Qizhai
2016-01-01
Principal component analysis (PCA) is a useful tool to identify important linear combination of correlated variables in multivariate analysis and has been applied to detect association between genetic variants and human complex diseases of interest. How to choose adequate number of principal components (PCs) to represent the original system in an optimal way is a key issue for PCA. Note that the traditional PCA, only using a few top PCs while discarding the other PCs, might significantly lose power in genetic association studies if all the PCs contain non-ignorable signals. In order to make full use of information from all PCs, Aschard and his colleagues have proposed a multi-step combined PCs method (named mCPC) recently, which performs well especially when several traits are highly correlated. However, the power superiority of mCPC has just been illustrated by simulation, while the theoretical power performance of mCPC has not been studied yet. In this work, we attempt to investigate theoretical properties of mCPC and further propose a novel and efficient strategy to combine PCs. Extensive simulation results confirm that the proposed method is more robust than existing procedures. A real data application to detect the association between gene TRAF1-C5 and rheumatoid arthritis further shows good performance of the proposed procedure. PMID:27189724
Diffusive behavior of a greedy traveling salesman
NASA Astrophysics Data System (ADS)
Lipowski, Adam; Lipowska, Dorota
2011-06-01
Using Monte Carlo simulations we examine the diffusive properties of the greedy algorithm in the d-dimensional traveling salesman problem. Our results show that for d=3 and 4 the average squared distance from the origin
A greedy-navigator approach to navigable city plans
NASA Astrophysics Data System (ADS)
Lee, Sang Hoon; Holme, Petter
2013-01-01
We use a set of four theoretical navigability indices for street maps to investigate the shape of the resulting street networks, if they are grown by optimizing these indices. The indices compare the performance of simulated navigators (having a partial information about the surroundings, like humans in many real situations) to the performance of optimally navigating individuals. We show that our simple greedy shortcut construction strategy generates the emerging structures that are different from real road network, but not inconceivable. The resulting city plans, for all navigation indices, share common qualitative properties such as the tendency for triangular blocks to appear, while the more quantitative features, such as degree distributions and clustering, are characteristically different depending on the type of metrics and routing strategies. We show that it is the type of metrics used which determines the overall shapes characterized by structural heterogeneity, but the routing schemes contribute to more subtle details of locality, which is more emphasized in case of unrestricted connections when the edge crossing is allowed.
A Greedy reassignment algorithm for the PBS minimum monitor unit constraint.
Lin, Yuting; Kooy, Hanne; Craft, David; Depauw, Nicolas; Flanz, Jacob; Clasie, Benjamin
2016-06-21
Proton pencil beam scanning (PBS) treatment plans are made of numerous unique spots of different weights. These weights are optimized by the treatment planning systems, and sometimes fall below the deliverable threshold set by the treatment delivery system. The purpose of this work is to investigate a Greedy reassignment algorithm to mitigate the effects of these low weight pencil beams. The algorithm is applied during post-processing to the optimized plan to generate deliverable plans for the treatment delivery system. The Greedy reassignment method developed in this work deletes the smallest weight spot in the entire field and reassigns its weight to its nearest neighbor(s) and repeats until all spots are above the minimum monitor unit (MU) constraint. Its performance was evaluated using plans collected from 190 patients (496 fields) treated at our facility. The Greedy reassignment method was compared against two other post-processing methods. The evaluation criteria was the γ-index pass rate that compares the pre-processed and post-processed dose distributions. A planning metric was developed to predict the impact of post-processing on treatment plans for various treatment planning, machine, and dose tolerance parameters. For fields with a pass rate of 90 ± 1% the planning metric has a standard deviation equal to 18% of the centroid value showing that the planning metric and γ-index pass rate are correlated for the Greedy reassignment algorithm. Using a 3rd order polynomial fit to the data, the Greedy reassignment method has 1.8 times better planning metric at 90% pass rate compared to other post-processing methods. As the planning metric and pass rate are correlated, the planning metric could provide an aid for implementing parameters during treatment planning, or even during facility design, in order to yield acceptable pass rates. More facilities are starting to implement PBS and some have spot sizes (one standard deviation) smaller than 5
A Greedy reassignment algorithm for the PBS minimum monitor unit constraint
NASA Astrophysics Data System (ADS)
Lin, Yuting; Kooy, Hanne; Craft, David; Depauw, Nicolas; Flanz, Jacob; Clasie, Benjamin
2016-06-01
Proton pencil beam scanning (PBS) treatment plans are made of numerous unique spots of different weights. These weights are optimized by the treatment planning systems, and sometimes fall below the deliverable threshold set by the treatment delivery system. The purpose of this work is to investigate a Greedy reassignment algorithm to mitigate the effects of these low weight pencil beams. The algorithm is applied during post-processing to the optimized plan to generate deliverable plans for the treatment delivery system. The Greedy reassignment method developed in this work deletes the smallest weight spot in the entire field and reassigns its weight to its nearest neighbor(s) and repeats until all spots are above the minimum monitor unit (MU) constraint. Its performance was evaluated using plans collected from 190 patients (496 fields) treated at our facility. The Greedy reassignment method was compared against two other post-processing methods. The evaluation criteria was the γ-index pass rate that compares the pre-processed and post-processed dose distributions. A planning metric was developed to predict the impact of post-processing on treatment plans for various treatment planning, machine, and dose tolerance parameters. For fields with a pass rate of 90 ± 1% the planning metric has a standard deviation equal to 18% of the centroid value showing that the planning metric and γ-index pass rate are correlated for the Greedy reassignment algorithm. Using a 3rd order polynomial fit to the data, the Greedy reassignment method has 1.8 times better planning metric at 90% pass rate compared to other post-processing methods. As the planning metric and pass rate are correlated, the planning metric could provide an aid for implementing parameters during treatment planning, or even during facility design, in order to yield acceptable pass rates. More facilities are starting to implement PBS and some have spot sizes (one standard deviation) smaller than 5
On the origin of multi-step spin transition behaviour in 1D nanoparticles
NASA Astrophysics Data System (ADS)
Chiruta, Daniel; Jureschi, Catalin-Maricel; Linares, Jorge; Dahoo, Pierre Richard; Garcia, Yann; Rotaru, Aurelian
2015-09-01
To investigate the spin state switching mechanism in spin crossover (SCO) nanoparticles, a special attention is given to three-step thermally induced SCO behavior in 1D chains. An additional term is included in the standard Ising-like Hamiltonian to account for the border interaction between SCO molecules and its local environment. It is shown that this additional interaction, together with the short range interaction, drives the multi-steps thermal hysteretic behavior in 1D SCO systems. The relation between a polymeric matrix and this particular multi-step SCO phenomenon is discussed accordingly. Finally, the environmental influence on the SCO system's size is analyzed as well.
Surface Modified Particles By Multi-Step Addition And Process For The Preparation Thereof
Cook, Ronald Lee; Elliott, Brian John; Luebben, Silvia DeVito; Myers, Andrew William; Smith, Bryan Matthew
2006-01-17
The present invention relates to a new class of surface modified particles and to a multi-step surface modification process for the preparation of the same. The multi-step surface functionalization process involves two or more reactions to produce particles that are compatible with various host systems and/or to provide the particles with particular chemical reactivities. The initial step comprises the attachment of a small organic compound to the surface of the inorganic particle. The subsequent steps attach additional compounds to the previously attached organic compounds through organic linking groups.
Chun, Sung-woo; Kim, Daehong; Kwon, Jihun; Kim, Bongho; Choi, Seonjun; Lee, Seung-Beck
2012-04-01
We have demonstrated the fabrication of sub 30 nm magnetic tunnel junctions (MTJs) with perpendicular magnetic anisotropy. The multi-step ion beam etching (IBE) process performed for 18 min between 45 deg. and 30 deg. , at 500 V combined ion supply voltage, resulted in a 55 nm tall MTJ with 28 nm diameter. We used a negative tone electron beam resist as the hard mask, which maintained its lateral dimension during the IBE, allowing almost vertical pillar side profiles. The measurement results showed a tunnel magneto-resistance ratio of 13% at 1 k{Omega} junction resistance. With further optimization in IBE energy and multi-step etching process, it will be possible to fabricate perpendicularly oriented MTJs for future sub 30 nm non-volatile magnetic memory applications.
Ultra-fast consensus of discrete-time multi-agent systems with multi-step predictive output feedback
NASA Astrophysics Data System (ADS)
Zhang, Wenle; Liu, Jianchang
2016-04-01
This article addresses the ultra-fast consensus problem of high-order discrete-time multi-agent systems based on a unified consensus framework. A novel multi-step predictive output mechanism is proposed under a directed communication topology containing a spanning tree. By predicting the outputs of a network several steps ahead and adding this information into the consensus protocol, it is shown that the asymptotic convergence factor is improved by a power of q + 1 compared to the routine consensus. The difficult problem of selecting the optimal control gain is solved well by introducing a variable called convergence step. In addition, the ultra-fast formation achievement is studied on the basis of this new consensus protocol. Finally, the ultra-fast consensus with respect to a reference model and robust consensus is discussed. Some simulations are performed to illustrate the effectiveness of the theoretical results.
Multi-step routes of capuchin monkeys in a laser pointer traveling salesman task.
Howard, Allison M; Fragaszy, Dorothy M
2014-09-01
Prior studies have claimed that nonhuman primates plan their routes multiple steps in advance. However, a recent reexamination of multi-step route planning in nonhuman primates indicated that there is no evidence for planning more than one step ahead. We tested multi-step route planning in capuchin monkeys using a pointing device to "travel" to distal targets while stationary. This device enabled us to determine whether capuchins distinguish the spatial relationship between goals and themselves and spatial relationships between goals and the laser dot, allocentrically. In Experiment 1, two subjects were presented with identical food items in Near-Far (one item nearer to subject) and Equidistant (both items equidistant from subject) conditions with a laser dot visible between the items. Subjects moved the laser dot to the items using a joystick. In the Near-Far condition, one subject demonstrated a bias for items closest to self but the other subject chose efficiently. In the second experiment, subjects retrieved three food items in similar Near-Far and Equidistant arrangements. Both subjects preferred food items nearest the laser dot and showed no evidence of multi-step route planning. We conclude that these capuchins do not make choices on the basis of multi-step look ahead strategies. PMID:24700520
Mechanical and Metallurgical Evolution of Stainless Steel 321 in a Multi-step Forming Process
NASA Astrophysics Data System (ADS)
Anderson, M.; Bridier, F.; Gholipour, J.; Jahazi, M.; Wanjara, P.; Bocher, P.; Savoie, J.
2016-04-01
This paper examines the metallurgical evolution of AISI Stainless Steel 321 (SS 321) during multi-step forming, a process that involves cycles of deformation with intermediate heat treatment steps. The multi-step forming process was simulated by implementing interrupted uniaxial tensile testing experiments. Evolution of the mechanical properties as well as the microstructural features, such as twins and textures of the austenite and martensite phases, was studied as a function of the multi-step forming process. The characteristics of the Strain-Induced Martensite (SIM) were also documented for each deformation step and intermediate stress relief heat treatment. The results indicated that the intermediate heat treatments considerably increased the formability of SS 321. Texture analysis showed that the effect of the intermediate heat treatment on the austenite was minor and led to partial recrystallization, while deformation was observed to reinforce the crystallographic texture of austenite. For the SIM, an Olson-Cohen equation type was identified to analytically predict its formation during the multi-step forming process. The generated SIM was textured and weakened with increasing deformation.
Use of Chiral Oxazolidinones for a Multi-Step Synthetic Laboratory Module
ERIC Educational Resources Information Center
Betush, Matthew P.; Murphree, S. Shaun
2009-01-01
Chiral oxazolidinone chemistry is used as a framework for an advanced multi-step synthesis lab. The cost-effective and robust preparation of chiral starting materials is presented, as well as the use of chiral auxiliaries in a synthesis scheme that is appropriate for students currently in the second semester of the organic sequence. (Contains 1…
NASA Astrophysics Data System (ADS)
Mitran, T. L.; Melchert, O.; Hartmann, A. K.
2013-12-01
The main characteristics of biased greedy random walks (BGRWs) on two-dimensional lattices with real-valued quenched disorder on the lattice edges are studied. Here the disorder allows for negative edge weights. In previous studies, considering the negative-weight percolation (NWP) problem, this was shown to change the universality class of the existing, static percolation transition. In the presented study, four different types of BGRWs and an algorithm based on the ant colony optimization heuristic were considered. Regarding the BGRWs, the precise configurations of the lattice walks constructed during the numerical simulations were influenced by two parameters: a disorder parameter ρ that controls the amount of negative edge weights on the lattice and a bias strength B that governs the drift of the walkers along a certain lattice direction. The random walks are “greedy” in the sense that the local optimal choice of the walker is to preferentially traverse edges with a negative weight (associated with a net gain of “energy” for the walker). Here, the pivotal observable is the probability that, after termination, a lattice walk exhibits a total negative weight, which is here considered as percolating. The behavior of this observable as function of ρ for different bias strengths B is put under scrutiny. Upon tuning ρ, the probability to find such a feasible lattice walk increases from zero to 1. This is the key feature of the percolation transition in the NWP model. Here, we address the question how well the transition point ρc, resulting from numerically exact and “static” simulations in terms of the NWP model, can be resolved using simple dynamic algorithms that have only local information available, one of the basic questions in the physics of glassy systems.
Region-based multi-step optic disk and cup segmentation from color fundus image
NASA Astrophysics Data System (ADS)
Xiao, Di; Lock, Jane; Manresa, Javier Moreno; Vignarajan, Janardhan; Tay-Kearney, Mei-Ling; Kanagasingam, Yogesan
2013-02-01
Retinal optic cup-disk-ratio (CDR) is a one of important indicators of glaucomatous neuropathy. In this paper, we propose a novel multi-step 4-quadrant thresholding method for optic disk segmentation and a multi-step temporal-nasal segmenting method for optic cup segmentation based on blood vessel inpainted HSL lightness images and green images. The performance of the proposed methods was evaluated on a group of color fundus images and compared with the manual outlining results from two experts. Dice scores of detected disk and cup regions between the auto and manual results were computed and compared. Vertical CDRs were also compared among the three results. The preliminary experiment has demonstrated the robustness of the method for automatic optic disk and cup segmentation and its potential value for clinical application.
A nonparametric method of multi-step ahead forecasting in diffusion processes
NASA Astrophysics Data System (ADS)
Yamamura, Mariko; Shoji, Isao
2010-06-01
This paper provides a nonparametric model of multi-step ahead forecasting in diffusion processes. The model is constructed from the local linear model with the Gaussian kernel. The paper provides simulation studies to evaluate its performance of multi-step ahead forecasting by comparing with the global linear model, showing the better forecasting performance of the nonparametric model than the global linear model. The paper also conducts empirical analysis for forecasting using intraday data of the Japanese stock price index and the time series of heart rates. The result shows the performance of forecasting does not differ much in the Japanese stock price index, but that the nonparametric model shows significantly better performance in the analysis of the heart rates.
Teaching multi-step math skills to adults with disabilities via video prompting.
Kellems, Ryan O; Frandsen, Kaitlyn; Hansen, Blake; Gabrielsen, Terisa; Clarke, Brynn; Simons, Kalee; Clements, Kyle
2016-11-01
The purpose of this study was to evaluate the effectiveness of teaching multi-step math skills to nine adults with disabilities in an 18-21 post-high school transition program using a video prompting intervention package. The dependent variable was the percentage of steps completed correctly. The independent variable was the video prompting intervention, which involved several multi-step math calculation skills: (a) calculating a tip (15%), (b) calculating item unit prices, and (c) adjusting a recipe for more or fewer people. Results indicated a functional relationship between the video prompting interventions and prompting package and the percentage of steps completed correctly. 8 out of the 9 adults showed significant gains immediately after receiving the video prompting intervention. PMID:27589151
Contaminant source and release history identification in groundwater: a multi-step approach.
Gzyl, G; Zanini, A; Frączek, R; Kura, K
2014-02-01
The paper presents a new multi-step approach aiming at source identification and release history estimation. The new approach consists of three steps: performing integral pumping tests, identifying sources, and recovering the release history by means of a geostatistical approach. The present paper shows the results obtained from the application of the approach within a complex case study in Poland in which several areal sources were identified. The investigated site is situated in the vicinity of a former chemical plant in southern Poland in the city of Jaworzno in the valley of the Wąwolnica River; the plant has been in operation since the First World War producing various chemicals. From an environmental point of view the most relevant activity was the production of pesticides, especially lindane. The application of the multi-step approach enabled a significant increase in the knowledge of contamination at the site. Some suspected contamination sources have been proven to have minor effect on the overall contamination. Other suspected sources have been proven to have key significance. Some areas not taken into consideration previously have now been identified as key sources. The method also enabled estimation of the magnitude of the sources and, a list of the priority reclamation actions will be drawn as a result. The multi-step approach has proven to be effective and may be applied to other complicated contamination cases. Moreover, the paper shows the capability of the geostatistical approach to manage a complex real case study. PMID:24365394
Contaminant source and release history identification in groundwater: A multi-step approach
NASA Astrophysics Data System (ADS)
Gzyl, G.; Zanini, A.; Frączek, R.; Kura, K.
2014-02-01
The paper presents a new multi-step approach aiming at source identification and release history estimation. The new approach consists of three steps: performing integral pumping tests, identifying sources, and recovering the release history by means of a geostatistical approach. The present paper shows the results obtained from the application of the approach within a complex case study in Poland in which several areal sources were identified. The investigated site is situated in the vicinity of a former chemical plant in southern Poland in the city of Jaworzno in the valley of the Wąwolnica River; the plant has been in operation since the First World War producing various chemicals. From an environmental point of view the most relevant activity was the production of pesticides, especially lindane. The application of the multi-step approach enabled a significant increase in the knowledge of contamination at the site. Some suspected contamination sources have been proven to have minor effect on the overall contamination. Other suspected sources have been proven to have key significance. Some areas not taken into consideration previously have now been identified as key sources. The method also enabled estimation of the magnitude of the sources and, a list of the priority reclamation actions will be drawn as a result. The multi-step approach has proven to be effective and may be applied to other complicated contamination cases. Moreover, the paper shows the capability of the geostatistical approach to manage a complex real case study.
Multi-step motion planning: Application to free-climbing robots
NASA Astrophysics Data System (ADS)
Bretl, Timothy Wolfe
This dissertation addresses the problem of planning the motion of a multi-limbed robot to "free-climb" vertical rock surfaces. Free-climbing relies on natural features and friction (such as holes or protrusions) rather than special fixtures or tools. It requires strength, but more importantly it requires deliberate reasoning: not only must the robot decide how to adjust its posture to reach the next feature without falling, it must plan an entire sequence of steps, where each one might have future consequences. This process of reasoning is called multi-step planning. A multi-step planning framework is presented for computing non-gaited, free-climbing motions. This framework derives from an analysis of a free-climbing robot's configuration space, which can be decomposed into constraint manifolds associated with each state of contact between the robot and its environment. An understanding of the adjacency between manifolds motivates a two-stage strategy that uses a candidate sequence of steps to direct the subsequent search for motions. Three algorithms are developed to support the framework. The first algorithm reduces the amount of time required to plan each potential step, a large number of which must be considered over an entire multi-step search. It extends the probabilistic roadmap (PRM) approach based on an analysis of the interaction between balance and the topology of closed kinematic chains. The second algorithm addresses a problem with the PRM approach, that it is unable to distinguish challenging steps (which may be critical) from impossible ones. This algorithm detects impossible steps explicitly, using automated algebraic inference and machine learning. The third algorithm provides a fast constraint checker (on which the PRM approach depends), in particular a test of balance at the initially unknown number of sampled configurations associated with each step. It is a method of incremental precomputation, fast because it takes advantage of the sample
Laboratory investigation of borehole breakouts and Multi-step failure model
NASA Astrophysics Data System (ADS)
Ruan, Xiao-Ping; Mao, Ji-Zheng; Cui, Zhan-Tao
1993-05-01
Based on our experiment of borehole breakouts with a group of sandstone samples described in this paper, a multi-step failure model of borehole breakouts are proposed to quantitatively explain the relationship between the section shape of borehole breakouts and the state of crustal stress. In this model the borehole spalling is not only related to the state of stress at a single point but also the state of stress on its neighboring area. The comparison between the experimental results of borehole breakouts and the calculation results shows a good agreement.
Lin, Shih-Wei; Ying, Kuo-Ching; Wan, Shu-Yen
2014-01-01
Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295
2014-01-01
Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295
Quasi-greedy triangulations approximating the minimum weight triangulation
Levcopoulos, C.; Krznaric, D.
1996-12-31
This paper settles the following two open problems: (1) What is the worst-case approximation ratio between the greedy and the minimum weight triangulation? (2) Is there a polynomial time algorithm that always pro- duces a triangulation whose length is within a constant factor from the minimum? The answer to the first question is that the known {Omega}({radical}n) lower bound is tight. The second question is answered in the affirmative by using a slight modification of an O(n log n) algorithm for the greedy triangulation. We also derive some other interesting results. For example, we show that a constant-factor approximation of the minimum weight convex partition can be obtained within the same time bounds.
Multi-step loading/unloading experiments that challenge constitutive models of glassy polymers
NASA Astrophysics Data System (ADS)
Caruthers, James; Medvedev, Grigori
2014-03-01
The mechanical response of glassy polymers depends on the thermal and deformational history, where the resulting relaxation phenomenon remains a significant challenge for constitutive modeling. For strain controlled experiments the stress response is measured during loading/unloading ramps and a constant strain. By judiciously combining the basic steps, a set of multi-step experiments have been designed to challenge existing constitutive models for glassy polymers. A particular example is the ``stress memory'' experiment, i.e. loading through yield, unloading to zero stress, and holding at final strain, where the subsequent evolution of the stress exhibits an overshoot. The observed dependence of the overshoot on the loading strain rate cannot be explained by the models where the relaxation time is a function of stress or strain. Another discriminating multi-step history experiment involves strain accumulation to test the common assumption that the phenomenon of strain hardening is caused by a purely elastic contribution to stress. Experimental results will be presented for a low Tg epoxy system, and the data will be used to critically analyze the predictions of both traditional viscoelastic/viscoplastic constitutive models and a recently developed Stochastic Constitutive Model.
Lutz, Barry; Liang, Tinny; Fu, Elain; Ramachandran, Sujatha; Kauffman, Peter; Yager, Paul
2013-01-01
Lateral flow tests (LFTs) are an ingenious format for rapid and easy-to-use diagnostics, but they are fundamentally limited to assay chemistries that can be reduced to a single chemical step. In contrast, most laboratory diagnostic assays rely on multiple timed steps carried out by a human or a machine. Here, we use dissolvable sugar applied to paper to create programmable flow delays and present a paper network topology that uses these time delays to program automated multi-step fluidic protocols. Solutions of sucrose at different concentrations (10-70% of saturation) were added to paper strips and dried to create fluidic time delays spanning minutes to nearly an hour. A simple folding card format employing sugar delays was shown to automate a four-step fluidic process initiated by a single user activation step (folding the card); this device was used to perform a signal-amplified sandwich immunoassay for a diagnostic biomarker for malaria. The cards are capable of automating multi-step assay protocols normally used in laboratories, but in a rapid, low-cost, and easy-to-use format. PMID:23685876
A new indirect multi-step-ahead prediction model for a long-term hydrologic prediction
NASA Astrophysics Data System (ADS)
Cheng, Chun-Tian; Xie, Jing-Xin; Chau, Kwok-Wing; Layeghifard, Mehdi
2008-10-01
SummaryA dependable long-term hydrologic prediction is essential to planning, designing and management activities of water resources. A three-stage indirect multi-step-ahead prediction model, which combines dynamic spline interpolation into multilayer adaptive time-delay neural network (ATNN), is proposed in this study for the long term hydrologic prediction. In the first two stages, a group of spline interpolation and dynamic extraction units are utilized to amplify the effect of observations in order to decrease the errors accumulation and propagation caused by the previous prediction. In the last step, variable time delays and weights are dynamically regulated by ATNN and the output of ATNN can be obtained as a multi-step-ahead prediction. We use two examples to illustrate the effectiveness of the proposed model. One example is the sunspots time series that is a well-known nonlinear and non-Gaussian benchmark time series and is often used to evaluate the effectiveness of nonlinear models. Another example is a case study of a long-term hydrologic prediction which uses the monthly discharges data from the Manwan Hydropower Plant in Yunnan Province of China. Application results show that the proposed method is feasible and effective.
Iterated greedy graph coloring and the coloring landscape
Culberson, J.
1994-12-31
The Iterated Greedy (IG) graph coloring algorithm uses the greedy, or simple sequential, graph coloring algorithm repeatedly to obtain ever better colorings. On each iteration, the permutation presented to the greedy algorithm is generated so that the vertices of the independent sets identified in the previous coloring are adjacent in the permutation. It is trivial to prove that this ensures that the new coloring will use no more colors than the previous coloring. On random graphs the algorithm does not perform as well as TABU or semi-exhaustive independent set approaches. It does offer some improvements when combined with these. On k-colorable graphs it seems quite effective, and offers a robustness over a wide range of k, n, p values the other algorithms seem not to have. In particular, evidence indicates that one setting of parameters seems to be {open_quotes}near best{close_quotes} over most of these classes. Evidence also indicates that graphs in the classes we consider that are harder for this algorithm are also more difficult for TABU and semi-exhaustive independent set approaches. Thus, the number of iterations required gives a natural measure of difficulty of the graphs, independent of machine characteristics and many details of implementation.
SMG: Fast scalable greedy algorithm for influence maximization in social networks
NASA Astrophysics Data System (ADS)
Heidari, Mehdi; Asadpour, Masoud; Faili, Hesham
2015-02-01
Influence maximization is the problem of finding k most influential nodes in a social network. Many works have been done in two different categories, greedy approaches and heuristic approaches. The greedy approaches have better influence spread, but lower scalability on large networks. The heuristic approaches are scalable and fast but not for all type of networks. Improving the scalability of greedy approach is still an open and hot issue. In this work we present a fast greedy algorithm called State Machine Greedy that improves the existing algorithms by reducing calculations in two parts: (1) counting the traversing nodes in estimate propagation procedure, (2) Monte-Carlo graph construction in simulation of diffusion. The results show that our method makes a huge improvement in the speed over the existing greedy approaches.
Digital multi-step phase-shifting profilometry for three-dimensional ballscrew surface imaging
NASA Astrophysics Data System (ADS)
Liu, Cheng-Yang; Yen, Tzu-Ping
2016-05-01
A digital multi-step phase-shifting profilometry for three-dimensional (3-D) ballscrew surface imaging is presented. The 3-D digital imaging system is capable of capturing fringe pattern images. The straight fringe patterns generated by software in the computer are projected onto the ballscrew surface by the DLP projector. The distorted fringe patterns are captured by the CCD camera at different detecting directions for reconstruction algorithms. The seven-step phase-shifting algorithm and quality guided path unwrapping algorithm are used to calculate absolute phase at each pixel position. The 3-D calibration method is used to obtain the relationship between the absolute phase map and ballscrew shape. The angular dependence of 3-D shape imaging for ballscrews is analyzed and characterized. The experimental results may provide a novel, fast, and high accuracy imaging system to inspect the surface features of the ballscrew without length limitation for automated optical inspection industry.
Variation of nanopore diameter along porous anodic alumina channels by multi-step anodization.
Lee, Kwang Hong; Lim, Xin Yuan; Wai, Kah Wing; Romanato, Filippo; Wong, Chee Cheong
2011-02-01
In order to form tapered nanocapillaries, we investigated a method to vary the nanopore diameter along the porous anodic alumina (PAA) channels using multi-step anodization. By anodizing the aluminum in either single acid (H3PO4) or multi-acid (H2SO4, oxalic acid and H3PO4) with increasing or decreasing voltage, the diameter of the nanopore along the PAA channel can be varied systematically corresponding to the applied voltages. The pore size along the channel can be enlarged or shrunken in the range of 20 nm to 200 nm. Structural engineering of the template along the film growth direction can be achieved by deliberately designing a suitable voltage and electrolyte together with anodization time. PMID:21456152
A Multi-Step Assessment Scheme for Seismic Network Site Selection in Densely Populated Areas
NASA Astrophysics Data System (ADS)
Plenkers, Katrin; Husen, Stephan; Kraft, Toni
2015-10-01
We developed a multi-step assessment scheme for improved site selection during seismic network installation in densely populated areas. Site selection is a complex process where different aspects (seismic background noise, geology, and financing) have to be taken into account. In order to improve this process, we developed a step-wise approach that allows quantifying the quality of a site by using, in addition to expert judgement and test measurements, two weighting functions as well as reference stations. Our approach ensures that the recording quality aimed for is reached and makes different sites quantitatively comparable to each other. Last but not least, it is an easy way to document the decision process, because all relevant parameters are listed, quantified, and weighted.
The solution of Parrondo’s games with multi-step jumps
NASA Astrophysics Data System (ADS)
Saakian, David B.
2016-04-01
We consider the general case of Parrondo’s games, when there is a finite probability to stay in the current state as well as multi-step jumps. We introduce a modification of the model: the transition probabilities between different games depend on the choice of the game in the previous round. We calculate the rate of capital growth as well as the variance of the distribution, following large deviation theory. The modified model allows higher capital growth rates than in standard Parrondo games for the range of parameters considered in the key articles about these games, and positive capital growth is possible for a much wider regime of parameters of the model.
Star sub-pixel centroid calculation based on multi-step minimum energy difference method
NASA Astrophysics Data System (ADS)
Wang, Duo; Han, YanLi; Sun, Tengfei
2013-09-01
The star's centroid plays a vital role in celestial navigation, star images which be gotten during daytime, due to the strong sky background, have a low SNR, and the star objectives are nearly submerged in the background, takes a great trouble to the centroid localization. Traditional methods, such as a moment method, weighted centroid calculation method is simple but has a big error, especially in the condition of a low SNR. Gaussian method has a high positioning accuracy, but the computational complexity. Analysis of the energy distribution in star image, a location method for star target centroids based on multi-step minimum energy difference is proposed. This method uses the linear superposition to narrow the centroid area, in the certain narrow area uses a certain number of interpolation to pixels for the pixels' segmentation, and then using the symmetry of the stellar energy distribution, tentatively to get the centroid position: assume that the current pixel is the star centroid position, and then calculates and gets the difference of the sum of the energy which in the symmetric direction(in this paper we take the two directions of transverse and longitudinal) and the equal step length(which can be decided through different conditions, the paper takes 9 as the step length) of the current pixel, and obtain the centroid position in this direction when the minimum difference appears, and so do the other directions, then the validation comparison of simulated star images, and compare with several traditional methods, experiments shows that the positioning accuracy of the method up to 0.001 pixel, has good effect to calculate the centroid of low SNR conditions; at the same time, uses this method on a star map which got at the fixed observation site during daytime in near-infrared band, compare the results of the paper's method with the position messages which were known of the star, it shows that :the multi-step minimum energy difference method achieves a better
Cross-cultural adaptation of instruments assessing breastfeeding determinants: a multi-step approach
2014-01-01
Background Cross-cultural adaptation is a necessary process to effectively use existing instruments in other cultural and language settings. The process of cross-culturally adapting, including translation, of existing instruments is considered a critical set to establishing a meaningful instrument for use in another setting. Using a multi-step approach is considered best practice in achieving cultural and semantic equivalence of the adapted version. We aimed to ensure the content validity of our instruments in the cultural context of KwaZulu-Natal, South Africa. Methods The Iowa Infant Feeding Attitudes Scale, Breastfeeding Self-Efficacy Scale-Short Form and additional items comprise our consolidated instrument, which was cross-culturally adapted utilizing a multi-step approach during August 2012. Cross-cultural adaptation was achieved through steps to maintain content validity and attain semantic equivalence in the target version. Specifically, Lynn’s recommendation to apply an item-level content validity index score was followed. The revised instrument was translated and back-translated. To ensure semantic equivalence, Brislin’s back-translation approach was utilized followed by the committee review to address any discrepancies that emerged from translation. Results Our consolidated instrument was adapted to be culturally relevant and translated to yield more reliable and valid results for use in our larger research study to measure infant feeding determinants effectively in our target cultural context. Conclusions Undertaking rigorous steps to effectively ensure cross-cultural adaptation increases our confidence that the conclusions we make based on our self-report instrument(s) will be stronger. In this way, our aim to achieve strong cross-cultural adaptation of our consolidated instruments was achieved while also providing a clear framework for other researchers choosing to utilize existing instruments for work in other cultural, geographic and population
Multi-step regionalization technique and regional model validation for climate studies
NASA Astrophysics Data System (ADS)
Argüeso, D.; Hidalgo-Muñoz, J. M.; Calandria-Hernández, D.; Gámiz-Fortis, S. R.; Esteban-Parra, M. J.; Castro-Díez, Y.
2010-09-01
A regionalization procedure is proposed to define affinity regions in Andalusia (Southern Spain) regarding maximum and minimum temperature, and precipitation in order to validate a regional climate model (WRF). In situ observations are not suitable for model validation unless they are somehow upscaled. Therefore, a regionalization methodology was adopted to overcome the representation error that arises from the spatial scale disagreement between site-specific observations and model outputs. An observational daily dataset that comprises 412 rain gauges and 120 maximum and minimum temperature series all over Andalusia was used. The observations covered a 10-year period ranging from 1990 to 1999 with no more than 10% of missing values. The original dataset composed by 716 series for precipitation and 243 for temperature were employed to fill the gaps using a correlation method. Precipitation and temperature have been processed separately using the multi-step regionalization methodology formed by three main stages. Firstly, a S-Mode Principal Component Analysis (PCA) was applied to the correlation matrix obtained from daily values to retain principal modes of variability and discard possible information redundancy. Secondly, rotated normalized loadings were used to classify the stations via an agglomerative Clustering Analysis (CA) method to set the number of regions and the centroids associated to those regions. Finally, using the centroids calculated in the previous step and once the appropriate number of regions was identified, a non-hierarchical k-means algorithm was applied to obtain the definitive climate division of Andalusia. The combination of methods attempts to take advantage of their benefits and eliminate their shortcomings when used individually. This multi-step methodology achieves a noticeable reduction of subjectivity in the regionalization process. Furthermore, it is a methodology only based on the data analyzed to perform the regionalization with no
Greedy adaptive walks on a correlated fitness landscape.
Park, Su-Chan; Neidhart, Johannes; Krug, Joachim
2016-05-21
We study adaptation of a haploid asexual population on a fitness landscape defined over binary genotype sequences of length L. We consider greedy adaptive walks in which the population moves to the fittest among all single mutant neighbors of the current genotype until a local fitness maximum is reached. The landscape is of the rough mount Fuji type, which means that the fitness value assigned to a sequence is the sum of a random and a deterministic component. The random components are independent and identically distributed random variables, and the deterministic component varies linearly with the distance to a reference sequence. The deterministic fitness gradient c is a parameter that interpolates between the limits of an uncorrelated random landscape (c=0) and an effectively additive landscape (c→∞). When the random fitness component is chosen from the Gumbel distribution, explicit expressions for the distribution of the number of steps taken by the greedy walk are obtained, and it is shown that the walk length varies non-monotonically with the strength of the fitness gradient when the starting point is sufficiently close to the reference sequence. Asymptotic results for general distributions of the random fitness component are obtained using extreme value theory, and it is found that the walk length attains a non-trivial limit for L→∞, different from its values for c=0 and c=∞, if c is scaled with L in an appropriate combination. PMID:26953649
Reinforced recurrent neural networks for multi-step-ahead flood forecasts
NASA Astrophysics Data System (ADS)
Chen, Pin-An; Chang, Li-Chiu; Chang, Fi-John
2013-08-01
Considering true values cannot be available at every time step in an online learning algorithm for multi-step-ahead (MSA) forecasts, a MSA reinforced real-time recurrent learning algorithm for recurrent neural networks (R-RTRL NN) is proposed. The main merit of the proposed method is to repeatedly adjust model parameters with the current information including the latest observed values and model's outputs to enhance the reliability and the forecast accuracy of the proposed method. The sequential formulation of the R-RTRL NN is derived. To demonstrate its reliability and effectiveness, the proposed R-RTRL NN is implemented to make 2-, 4- and 6-step-ahead forecasts in a famous benchmark chaotic time series and a reservoir flood inflow series in North Taiwan. For comparison purpose, three comparative neural networks (two dynamic and one static neural networks) were performed. Numerical and experimental results indicate that the R-RTRL NN not only achieves superior performance to comparative networks but significantly improves the precision of MSA forecasts for both chaotic time series and reservoir inflow case during typhoon events with effective mitigation in the time-lag problem.
Exact free vibration of multi-step Timoshenko beam system with several attachments
NASA Astrophysics Data System (ADS)
Farghaly, S. H.; El-Sayed, T. A.
2016-05-01
This paper deals with the analysis of the natural frequencies, mode shapes of an axially loaded multi-step Timoshenko beam combined system carrying several attachments. The influence of system design and the proposed sub-system non-dimensional parameters on the combined system characteristics are the major part of this investigation. The effect of material properties, rotary inertia and shear deformation of the beam system for each span are included. The end masses are elastically supported against rotation and translation at an offset point from the point of attachment. A sub-system having two degrees of freedom is located at the beam ends and at any of the intermediate stations and acts as a support and/or a suspension. The boundary conditions of the ordinary differential equation governing the lateral deflections and slope due to bending of the beam system including the shear force term, due to the sub-system, have been formulated. Exact global coefficient matrices for the combined modal frequencies, the modal shape and for the discrete sub-system have been derived. Based on these formulae, detailed parametric studies of the combined system are carried out. The applied mathematical model is valid for wide range of applications especially in mechanical, naval and structural engineering fields.
Multi-step deformations - a stringent test for constitutive models for polymer glasses
NASA Astrophysics Data System (ADS)
Medvedev, Grigori; Caruthers, James
A number of constitutive models have been proposed to describe mechanical behavior of polymer glasses, where the focus has been on the stress-strain curve observed in a constant strain rate deformation. The stress-strain curve possesses several prominent features, including yield, post-yield softening, flow, and hardening, which have proven challenging to predict. As a result, both viscoplastic and nonlinear viscoelastic constitutive models have become quite intricate, where a new mechanism is invoked for each bend of the stress-strain curve. We demonstrate on several examples that when the models are used to describe the multi-step deformations vs. the more common single strain rate deformation, they produce responses that are qualitatively incorrect, revealing the existing models to be parameterizations of a single-step curve. A recently developed stochastic constitutive model has fewer problems than the traditional viscoelastic/viscoplastic models, but it also has difficulties. The implications for the mechanics and physics of glassy polymers will be discussed.
Multi-step process for concentrating magnetic particles in waste sludges
Watson, J.L.
1990-07-10
This invention involves a multi-step, multi-force process for dewatering sludges which have high concentrations of magnetic particles, such as waste sludges generated during steelmaking. This series of processing steps involves (1) mixing a chemical flocculating agent with the sludge; (2) allowing the particles to aggregate under non-turbulent conditions; (3) subjecting the mixture to a magnetic field which will pull the magnetic aggregates in a selected direction, causing them to form a compacted sludge; (4) preferably, decanting the clarified liquid from the compacted sludge; and (5) using filtration to convert the compacted sludge into a cake having a very high solids content. Steps 2 and 3 should be performed simultaneously. This reduces the treatment time and increases the extent of flocculation and the effectiveness of the process. As partially formed aggregates with active flocculating groups are pulled through the mixture by the magnetic field, they will contact other particles and form larger aggregates. This process can increase the solids concentration of steelmaking sludges in an efficient and economic manner, thereby accomplishing either of two goals: (a) it can convert hazardous wastes into economic resources for recycling as furnace feed material, or (b) it can dramatically reduce the volume of waste material which must be disposed. 7 figs.
Multi-step process for concentrating magnetic particles in waste sludges
Watson, John L.
1990-01-01
This invention involves a multi-step, multi-force process for dewatering sludges which have high concentrations of magnetic particles, such as waste sludges generated during steelmaking. This series of processing steps involves (1) mixing a chemical flocculating agent with the sludge; (2) allowing the particles to aggregate under non-turbulent conditions; (3) subjecting the mixture to a magnetic field which will pull the magnetic aggregates in a selected direction, causing them to form a compacted sludge; (4) preferably, decanting the clarified liquid from the compacted sludge; and (5) using filtration to convert the compacted sludge into a cake having a very high solids content. Steps 2 and 3 should be performed simultaneously. This reduces the treatment time and increases the extent of flocculation and the effectiveness of the process. As partially formed aggregates with active flocculating groups are pulled through the mixture by the magnetic field, they will contact other particles and form larger aggregates. This process can increase the solids concentration of steelmaking sludges in an efficient and economic manner, thereby accomplishing either of two goals: (a) it can convert hazardous wastes into economic resources for recycling as furnace feed material, or (b) it can dramatically reduce the volume of waste material which must be disposed.
Shutdown Dose Rate Analysis Using the Multi-Step CADIS Method
Ibrahim, Ahmad M.; Peplow, Douglas E.; Peterson, Joshua L.; Grove, Robert E.
2015-01-01
The Multi-Step Consistent Adjoint Driven Importance Sampling (MS-CADIS) hybrid Monte Carlo (MC)/deterministic radiation transport method was proposed to speed up the shutdown dose rate (SDDR) neutron MC calculation using an importance function that represents the neutron importance to the final SDDR. This work applied the MS-CADIS method to the ITER SDDR benchmark problem. The MS-CADIS method was also used to calculate the SDDR uncertainty resulting from uncertainties in the MC neutron calculation and to determine the degree of undersampling in SDDR calculations because of the limited ability of the MC method to tally detailed spatial and energy distributions. The analysis that used the ITER benchmark problem compared the efficiency of the MS-CADIS method to the traditional approach of using global MC variance reduction techniques for speeding up SDDR neutron MC calculation. Compared to the standard Forward-Weighted-CADIS (FW-CADIS) method, the MS-CADIS method increased the efficiency of the SDDR neutron MC calculation by 69%. The MS-CADIS method also increased the fraction of nonzero scoring mesh tally elements in the space-energy regions of high importance to the final SDDR.
Shutdown Dose Rate Analysis Using the Multi-Step CADIS Method
Ibrahim, Ahmad M.; Peplow, Douglas E.; Peterson, Joshua L.; Grove, Robert E.
2015-01-01
The Multi-Step Consistent Adjoint Driven Importance Sampling (MS-CADIS) hybrid Monte Carlo (MC)/deterministic radiation transport method was proposed to speed up the shutdown dose rate (SDDR) neutron MC calculation using an importance function that represents the neutron importance to the final SDDR. This work applied the MS-CADIS method to the ITER SDDR benchmark problem. The MS-CADIS method was also used to calculate the SDDR uncertainty resulting from uncertainties in the MC neutron calculation and to determine the degree of undersampling in SDDR calculations because of the limited ability of the MC method to tally detailed spatial and energy distributions. The analysismore » that used the ITER benchmark problem compared the efficiency of the MS-CADIS method to the traditional approach of using global MC variance reduction techniques for speeding up SDDR neutron MC calculation. Compared to the standard Forward-Weighted-CADIS (FW-CADIS) method, the MS-CADIS method increased the efficiency of the SDDR neutron MC calculation by 69%. The MS-CADIS method also increased the fraction of nonzero scoring mesh tally elements in the space-energy regions of high importance to the final SDDR.« less
Detection of Heterogeneous Small Inclusions by a Multi-Step MUSIC Method
NASA Astrophysics Data System (ADS)
Solimene, Raffaele; Dell'Aversano, Angela; Leone, Giovanni
2014-05-01
In this contribution the problem of detecting and localizing scatterers with small (in terms of wavelength) cross sections by collecting their scattered field is addressed. The problem is dealt with for a two-dimensional and scalar configuration where the background is given as a two-layered cylindrical medium. More in detail, while scattered field data are taken in the outermost layer, inclusions are embedded within the inner layer. Moreover, the case of heterogeneous inclusions (i.e., having different scattering coefficients) is addressed. As a pertinent applicative context we identify the problem of diagnose concrete pillars in order to detect and locate rebars, ducts and other small in-homogeneities that can populate the interior of the pillar. The nature of inclusions influences the scattering coefficients. For example, the field scattered by rebars is stronger than the one due to ducts. Accordingly, it is expected that the more weakly scattering inclusions can be difficult to be detected as their scattered fields tend to be overwhelmed by those of strong scatterers. In order to circumvent this problem, in this contribution a multi-step MUltiple SIgnal Classification (MUSIC) detection algorithm is adopted [1]. In particular, the first stage aims at detecting rebars. Once rebars have been detected, their positions are exploited to update the Green's function and to subtract the scattered field due to their presence. The procedure is repeated until all the inclusions are detected. The analysis is conducted by numerical experiments for a multi-view/multi-static single-frequency configuration and the synthetic data are generated by a FDTD forward solver. Acknowledgement This work benefited from networking activities carried out within the EU funded COST Action TU1208 "Civil Engineering Applications of Ground Penetrating Radar." [1] R. Solimene, A. Dell'Aversano and G. Leone, "MUSIC algorithms for rebar detection," J. of Geophysics and Engineering, vol. 10, pp. 1
A Greedy Double Auction Mechanism for Grid Resource Allocation
NASA Astrophysics Data System (ADS)
Ding, Ding; Luo, Siwei; Gao, Zhan
To improve the resource utilization and satisfy more users, a Greedy Double Auction Mechanism(GDAM) is proposed to allocate resources in grid environments. GDAM trades resources at discriminatory price instead of uniform price, reflecting the variance in requirements for profits and quantities. Moreover, GDAM applies different auction rules to different cases, over-demand, over-supply and equilibrium of demand and supply. As a new mechanism for grid resource allocation, GDAM is proved to be strategy-proof, economically efficient, weakly budget-balanced and individual rational. Simulation results also confirm that GDAM outperforms the traditional one on both the total trade amount and the user satisfaction percentage, specially as more users are involved in the auction market.
NASA Technical Reports Server (NTRS)
Dupnick, E.; Wiggins, D.
1980-01-01
The functional specifications, functional design and flow, and the program logic of the GREEDY computer program are described. The GREEDY program is a submodule of the Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE) program and has been designed as a continuation of the shuttle Mission Payloads (MPLS) program. The MPLS uses input payload data to form a set of feasible payload combinations; from these, GREEDY selects a subset of combinations (a traffic model) so all payloads can be included without redundancy. The program also provides the user a tutorial option so that he can choose an alternate traffic model in case a particular traffic model is unacceptable.
Method to Improve Indium Bump Bonding via Indium Oxide Removal Using a Multi-Step Plasma Process
NASA Technical Reports Server (NTRS)
Greer, H. Frank (Inventor); Jones, Todd J. (Inventor); Vasquez, Richard P. (Inventor); Hoenk, Michael E. (Inventor); Dickie, Matthew R. (Inventor); Nikzad, Shouleh (Inventor)
2012-01-01
A process for removing indium oxide from indium bumps in a flip-chip structure to reduce contact resistance, by a multi-step plasma treatment. A first plasma treatment of the indium bumps with an argon, methane and hydrogen plasma reduces indium oxide, and a second plasma treatment with an argon and hydrogen plasma removes residual organics. The multi-step plasma process for removing indium oxide from the indium bumps is more effective in reducing the oxide, and yet does not require the use of halogens, does not change the bump morphology, does not attack the bond pad material or under-bump metallization layers, and creates no new mechanisms for open circuits.
Cook, Ronald Lee; Elliott, Brian John; Luebben, Silvia DeVito; Myers, Andrew William; Smith, Bryan Matthew
2005-05-03
A new class of surface modified particles and a multi-step Michael-type addition surface modification process for the preparation of the same is provided. The multi-step Michael-type addition surface modification process involves two or more reactions to compatibilize particles with various host systems and/or to provide the particles with particular chemical reactivities. The initial step comprises the attachment of a small organic compound to the surface of the inorganic particle. The subsequent steps attach additional compounds to the previously attached organic compounds through reactive organic linking groups. Specifically, these reactive groups are activated carbon—carbon pi bonds and carbon and non-carbon nucleophiles that react via Michael or Michael-type additions.
Automated multi-step purification protocol for Angiotensin-I-Converting-Enzyme (ACE).
Eisele, Thomas; Stressler, Timo; Kranz, Bertolt; Fischer, Lutz
2012-12-12
Highly purified proteins are essential for the investigation of the functional and biochemical properties of proteins. The purification of a protein requires several steps, which are often time-consuming. In our study, the Angiotensin-I-Converting-Enzyme (ACE; EC 3.4.15.1) was solubilised from pig lung without additional detergents, which are commonly used, under mild alkaline conditions in a Tris-HCl buffer (50mM, pH 9.0) for 48h. An automation of the ACE purification was performed using a multi-step protocol in less than 8h, resulting in a purified protein with a specific activity of 37Umg(-1) (purification factor 308) and a yield of 23.6%. The automated ACE purification used an ordinary fast-protein-liquid-chromatography (FPLC) system equipped with two additional switching valves. These switching valves were needed for the buffer stream inversion and for the connection of the Superloop™ used for the protein parking. Automated ACE purification was performed using four combined chromatography steps, including two desalting procedures. The purification methods contained two hydrophobic interaction chromatography steps, a Cibacron 3FG-A chromatography step and a strong anion exchange chromatography step. The purified ACE was characterised by sodium dodecyl sulphate-polyacrylamide gel electrophoresis (SDS-PAGE) and native-PAGE. The estimated monomer size of the purified glycosylated ACE was determined to be ∼175kDa by SDS-PAGE, with the dimeric form at ∼330kDa as characterised by a native PAGE using a novel activity staining protocol. For the activity staining, the tripeptide l-Phe-Gly-Gly was used as the substrate. The ACE cleaved the dipeptide Gly-Gly, releasing the l-Phe to be oxidised with l-amino acid oxidase. Combined with peroxidase and o-dianisidine, the generated H(2)O(2) stained a brown coloured band. This automated purification protocol can be easily adapted to be used with other protein purification tasks. PMID:23217308
A controlled greedy supervised approach for co-reference resolution on clinical text.
Chowdhury, Md Faisal Mahbub; Zweigenbaum, Pierre
2013-06-01
Identification of co-referent entity mentions inside text has significant importance for other natural language processing (NLP) tasks (e.g. event linking). However, this task, known as co-reference resolution, remains a complex problem, partly because of the confusion over different evaluation metrics and partly because the well-researched existing methodologies do not perform well on new domains such as clinical records. This paper presents a variant of the influential mention-pair model for co-reference resolution. Using a series of linguistically and semantically motivated constraints, the proposed approach controls generation of less-informative/sub-optimal training and test instances. Additionally, the approach also introduces some aggressive greedy strategies in chain clustering. The proposed approach has been tested on the official test corpus of the recently held i2b2/VA 2011 challenge. It achieves an unweighted average F1 score of 0.895, calculated from multiple evaluation metrics (MUC, B(3) and CEAF scores). These results are comparable to the best systems of the challenge. What makes our proposed system distinct is that it also achieves high average F1 scores for each individual chain type (Test: 0.897, Person: 0.852, PROBLEM: 0.855, TREATMENT: 0.884). Unlike other works, it obtains good scores for each of the individual metrics rather than being biased towards a particular metric. PMID:23562650
Halim, Amanatuzzakiah Abdul; Szita, Nicolas; Baganz, Frank
2013-12-01
The concept of de novo metabolic engineering through novel synthetic pathways offers new directions for multi-step enzymatic synthesis of complex molecules. This has been complemented by recent progress in performing enzymatic reactions using immobilized enzyme microreactors (IEMR). This work is concerned with the construction of de novo designed enzyme pathways in a microreactor synthesizing chiral molecules. An interesting compound, commonly used as the building block in several pharmaceutical syntheses, is a single diastereoisomer of 2-amino-1,3,4-butanetriol (ABT). This chiral amino alcohol can be synthesized from simple achiral substrates using two enzymes, transketolase (TK) and transaminase (TAm). Here we describe the development of an IEMR using His6-tagged TK and TAm immobilized onto Ni-NTA agarose beads and packed into tubes to enable multi-step enzyme reactions. The kinetic parameters of both enzymes were first determined using single IEMRs evaluated by a kinetic model developed for packed bed reactors. The Km(app) for both enzymes appeared to be flow rate dependent, while the turnover number kcat was reduced 3 fold compared to solution-phase TK and TAm reactions. For the multi-step enzyme reaction, single IEMRs were cascaded in series, whereby the first enzyme, TK, catalyzed a model reaction of lithium-hydroxypyruvate (HPA) and glycolaldehyde (GA) to L-erythrulose (ERY), and the second unit of the IEMR with immobilized TAm converted ERY into ABT using (S)-α-methylbenzylamine (MBA) as amine donor. With initial 60mM (HPA and GA each) and 6mM (MBA) substrate concentration mixture, the coupled reaction reached approximately 83% conversion in 20 min at the lowest flow rate. The ability to synthesize a chiral pharmaceutical intermediate, ABT in relatively short time proves this IEMR system as a powerful tool for construction and evaluation of de novo pathways as well as for determination of enzyme kinetics. PMID:24055435
Multi-Step Ka/Ka Dichroic Plate with Rounded Corners for NASA's 34m Beam Waveguide Antenna
NASA Technical Reports Server (NTRS)
Veruttipong, Watt; Khayatian, Behrouz; Hoppe, Daniel; Long, Ezra
2013-01-01
A multi-step Ka/Ka dichroic plate Frequency Selective Surface (FSS structure) is designed, manufactured and tested for use in NASA's Deep Space Network (DSN) 34m Beam Waveguide (BWG) antennas. The proposed design allows ease of manufacturing and ability to handle the increased transmit power (reflected off the FSS) of the DSN BWG antennas from 20kW to 100 kW. The dichroic is designed using HFSS and results agree well with measured data considering the manufacturing tolerances that could be achieved on the dichroic.
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
NASA Astrophysics Data System (ADS)
Borowiecki, Piotr; Göring, Frank
A maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued function p defined on the vertex set V(G) and called a potential function of a graph G, while P(G) = max v ∈ V(G) p(v) is called a potential of G. For any graph P(G) ≤ Δ(G), where Δ(G) is the maximum degree of G. Moreover, Δ(G) - P(G) may be arbitrarily large. A potential of a vertex lets us get a closer insight into the properties of its neighborhood which leads to the definition of the family of GreedyMAX-type algorithms having the classical GreedyMAX algorithm as their origin. We establish a lower bound 1/(P + 1) for the performance ratio of GreedyMAX-type algorithms which favorably compares with the bound 1/(Δ + 1) known to hold for GreedyMAX. The cardinality of an independent set generated by any GreedyMAX-type algorithm is at least sum_{vin V(G)} (p(v)+1)^{-1}, which strengthens the bounds of Turán and Caro-Wei stated in terms of vertex degrees.
Lautenschlager, Karin; Hwang, Chiachi; Ling, Fangqiong; Liu, Wen-Tso; Boon, Nico; Köster, Oliver; Egli, Thomas; Hammes, Frederik
2014-10-01
Indigenous bacterial communities are essential for biofiltration processes in drinking water treatment systems. In this study, we examined the microbial community composition and abundance of three different biofilter types (rapid sand, granular activated carbon, and slow sand filters) and their respective effluents in a full-scale, multi-step treatment plant (Zürich, CH). Detailed analysis of organic carbon degradation underpinned biodegradation as the primary function of the biofilter biomass. The biomass was present in concentrations ranging between 2-5 × 10(15) cells/m(3) in all filters but was phylogenetically, enzymatically and metabolically diverse. Based on 16S rRNA gene-based 454 pyrosequencing analysis for microbial community composition, similar microbial taxa (predominantly Proteobacteria, Planctomycetes, Acidobacteria, Bacteriodetes, Nitrospira and Chloroflexi) were present in all biofilters and in their respective effluents, but the ratio of microbial taxa was different in each filter type. This change was also reflected in the cluster analysis, which revealed a change of 50-60% in microbial community composition between the different filter types. This study documents the direct influence of the filter biomass on the microbial community composition of the final drinking water, particularly when the water is distributed without post-disinfection. The results provide new insights on the complexity of indigenous bacteria colonizing drinking water systems, especially in different biofilters of a multi-step treatment plant. PMID:24937356
NASA Astrophysics Data System (ADS)
Chang, Fi-John; Tsai, Meng-Jung
2016-04-01
Accurate multi-step-ahead inflow forecasting during typhoon periods is extremely crucial for real-time reservoir flood control. We propose a spatio-temporal lumping of radar rainfall for modeling inflow forecasts to mitigate time-lag problems and improve forecasting accuracy. Spatial aggregation of radar cells is made based on the sub-catchment partitioning obtained from the Self-Organizing Map (SOM), and then flood forecasting is made by the Adaptive Neuro Fuzzy Inference System (ANFIS) models coupled with a 2-staged Gamma Test (2-GT) procedure that identifies the optimal non-trivial rainfall inputs. The Shihmen Reservoir in northern Taiwan is used as a case study. The results show that the proposed methods can, in general, precisely make 1- to 4-hour-ahead forecasts and the lag time between predicted and observed flood peaks could be mitigated. The constructed ANFIS models with only two fuzzy if-then rules can effectively categorize inputs into two levels (i.e. high and low) and provide an insightful view (perspective) of the rainfall-runoff process, which demonstrate their capability in modeling the complex rainfall-runoff process. In addition, the confidence level of forecasts with acceptable error can reach as high as 97% at horizon t+1 and 77% at horizon t+4, respectively, which evidently promotes model reliability and leads to better decisions on real-time reservoir operation during typhoon events.
Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
NASA Astrophysics Data System (ADS)
Nowicki, Tomasz; Tresser, Charles
2004-03-01
A greedy algorithm for scheduling and digital printing with inputs in a convex polytope, and vertices of this polytope as successive outputs, has recently been proven to be bounded for any convex polytope in any dimension. This boundedness property follows readily from the existence of some invariant region for a dynamical system equivalent to the algorithm, which is what one proves. While the proof, and some constructions of invariant regions that can be made to depend on a single parameter, are reasonably simple for convex polygons in the plane, the proof of boundedness gets quite complicated in dimension three and above. We show here that such complexity is somehow justified by proving that the most natural generalization of the construction that works for polygons does not work in any dimension above two, even if we allow for as many parameters as there are faces. We first prove that some polytopes in dimension greater than two admit no invariant region to which they are combinatorially equivalent. We then modify these examples to get polytopes such that no invariant region can be obtained by pushing out the borders of the half spaces that intersect to form the polytope. We also show that another mechanism prevents some simplices (the simplest polytopes in any dimension) from admitting invariant regions to which they would be similar. By contrast in dimension two, one can always get an invariant region by pushing these borders far enough in some correlated way; for instance, pushing all borders by the same distance builds an invariant region for any polygon if the push is at a distance big enough for that polygon. To motivate the examples that we provide, we discuss briefly the bifurcations of polyhedra associated with pushing half spaces in parallel to themselves. In dimension three, the elementary codimension one bifurcation resembles the unfolding of the elementary degenerate singularity for codimension one foliations on surfaces. As the subject of this
Convex dynamics: unavoidable difficulties in bounding some greedy algorithms.
Nowicki, Tomasz; Tresser, Charles
2004-03-01
A greedy algorithm for scheduling and digital printing with inputs in a convex polytope, and vertices of this polytope as successive outputs, has recently been proven to be bounded for any convex polytope in any dimension. This boundedness property follows readily from the existence of some invariant region for a dynamical system equivalent to the algorithm, which is what one proves. While the proof, and some constructions of invariant regions that can be made to depend on a single parameter, are reasonably simple for convex polygons in the plane, the proof of boundedness gets quite complicated in dimension three and above. We show here that such complexity is somehow justified by proving that the most natural generalization of the construction that works for polygons does not work in any dimension above two, even if we allow for as many parameters as there are faces. We first prove that some polytopes in dimension greater than two admit no invariant region to which they are combinatorially equivalent. We then modify these examples to get polytopes such that no invariant region can be obtained by pushing out the borders of the half spaces that intersect to form the polytope. We also show that another mechanism prevents some simplices (the simplest polytopes in any dimension) from admitting invariant regions to which they would be similar. By contrast in dimension two, one can always get an invariant region by pushing these borders far enough in some correlated way; for instance, pushing all borders by the same distance builds an invariant region for any polygon if the push is at a distance big enough for that polygon. To motivate the examples that we provide, we discuss briefly the bifurcations of polyhedra associated with pushing half spaces in parallel to themselves. In dimension three, the elementary codimension one bifurcation resembles the unfolding of the elementary degenerate singularity for codimension one foliations on surfaces. As the subject of this
NASA Astrophysics Data System (ADS)
Tommerup, So/ren; Endelt, Benny; Nielsen, Karl Brian
2013-12-01
This paper investigates process control possibilities obtained from a new tool concept for adaptive blank holder force (BHF) distribution. The investigation concerns the concept's application to a multi-step deep drawing process exemplified by the NUMISHEET2014 benchmark 2: Springback of draw-redraw pan. An actuator system, where several cavities are embedded into the blank holder plate is used. By independently controlling the pressure of hydraulic fluid in these cavities, a controlled deflection of the blank holder plate surface can be achieved whereby the distribution of the BHF can be controlled. Using design of experiments, a full 3-level factorial experiments is conducted with respect to the cavity pressures, and the effects and interactions are evaluated.
Dauber, Eva-Maria; Kratzer, Adelgunde; Neuhuber, Franz; Parson, Walther; Klintschar, Michael; Bär, Walter; Mayr, Wolfgang R
2012-05-01
Well defined estimates of mutation rates are a prerequisite for the use of short tandem repeat (STR-) loci in relationship testing. We investigated 65 isolated genetic inconsistencies, which were observed within 50,796 allelic transfers at 23 STR-loci (ACTBP2 (SE33), CD4, CSF1PO, F13A1, F13B, FES, FGA, vWA, TH01, TPOX, D2S1338, D3S1358, D5S818, D7S820, D8S1132, D8S1179, D12S391, D13S317, D16S539, D17S976, D18S51, D19S433, D21S11) in Caucasoid families residing in Austria and Switzerland. Sequencing data of repeat and flanking regions and the median of all theoretically possible mutational steps showed valuable information to characterise the mutational events with regard to parental origin, change of repeat number (mutational step size) and direction of mutation (losses and gains of repeats). Apart from predominant single-step mutations including one case with a double genetic inconsistency, two double-step and two apparent four-step mutations could be identified. More losses than gains of repeats and more mutations originating from the paternal than the maternal lineage were observed (31 losses, 22 gains, 12 losses or gains and 47 paternal, 11 maternal mutations and 7 unclear of parental origin). The mutation in the paternal germline was 3.3 times higher than in the maternal germline. The results of our study show, that apart from the vast majority of single-step mutations rare multi-step mutations can be observed. Therefore, the interpretation of mutational events should not rigidly be restricted to the shortest possible mutational step, because rare but true multi-step mutations can easily be overlooked, if haplotype analysis is not possible. PMID:21873136
Kinahan, David J; Kearney, Sinéad M; Dimov, Nikolay; Glynn, Macdara T; Ducrée, Jens
2014-07-01
The centrifugal "lab-on-a-disc" concept has proven to have great potential for process integration of bioanalytical assays, in particular where ease-of-use, ruggedness, portability, fast turn-around time and cost efficiency are of paramount importance. Yet, as all liquids residing on the disc are exposed to the same centrifugal field, an inherent challenge of these systems remains the automation of multi-step, multi-liquid sample processing and subsequent detection. In order to orchestrate the underlying bioanalytical protocols, an ample palette of rotationally and externally actuated valving schemes has been developed. While excelling with the level of flow control, externally actuated valves require interaction with peripheral instrumentation, thus compromising the conceptual simplicity of the centrifugal platform. In turn, for rotationally controlled schemes, such as common capillary burst valves, typical manufacturing tolerances tend to limit the number of consecutive laboratory unit operations (LUOs) that can be automated on a single disc. In this paper, a major advancement on recently established dissolvable film (DF) valving is presented; for the very first time, a liquid handling sequence can be controlled in response to completion of preceding liquid transfer event, i.e. completely independent of external stimulus or changes in speed of disc rotation. The basic, event-triggered valve configuration is further adapted to leverage conditional, large-scale process integration. First, we demonstrate a fluidic network on a disc encompassing 10 discrete valving steps including logical relationships such as an AND-conditional as well as serial and parallel flow control. Then we present a disc which is capable of implementing common laboratory unit operations such as metering and selective routing of flows. Finally, as a pilot study, these functions are integrated on a single disc to automate a common, multi-step lab protocol for the extraction of total RNA from
A multi-step system for screening and localization of hard exudates in retinal images
NASA Astrophysics Data System (ADS)
Bopardikar, Ajit S.; Bhola, Vishal; Raghavendra, B. S.; Narayanan, Rangavittal
2012-03-01
The number of people being affected by Diabetes mellitus worldwide is increasing at an alarming rate. Monitoring of the diabetic condition and its effects on the human body are therefore of great importance. Of particular interest is diabetic retinopathy (DR) which is a result of prolonged, unchecked diabetes and affects the visual system. DR is a leading cause of blindness throughout the world. At any point of time 25 - 44% of people with diabetes are afflicted by DR. Automation of the screening and monitoring process for DR is therefore essential for efficient utilization of healthcare resources and optimizing treatment of the affected individuals. Such automation would use retinal images and detect the presence of specific artifacts such as hard exudates, hemorrhages and soft exudates (that may appear in the image) to gauge the severity of DR. In this paper, we focus on the detection of hard exudates. We propose a two step system that consists of a screening step that classifies retinal images as normal or abnormal based on the presence of hard exudates and a detection stage that localizes these artifacts in an abnormal retinal image. The proposed screening step automatically detects the presence of hard exudates with a high sensitivity and positive predictive value (PPV ). The detection/localization step uses a k-means based clustering approach to localize hard exudates in the retinal image. Suitable feature vectors are chosen based on their ability to isolate hard exudates while minimizing false detections. The algorithm was tested on a benchmark dataset (DIARETDB1) and was seen to provide a superior performance compared to existing methods. The two-step process described in this paper can be embedded in a tele-ophthalmology system to aid with speedy detection and diagnosis of the severity of DR.
The Greedy Little Boy Teacher's Manual [With Units for Levels A and B].
ERIC Educational Resources Information Center
Otto, Dale; George, Larry
The Center for the Study of Migrant and Indian Education has recognized the need to develop special materials to improve the non-Indian's understanding of the differences he observes in his Indian classmates and to promote a better understanding by American Indian children of their unique cultural heritage. The Greedy Little Boy is a traditional…
GreedEx: A Visualization Tool for Experimentation and Discovery Learning of Greedy Algorithms
ERIC Educational Resources Information Center
Velazquez-Iturbide, J. A.; Debdi, O.; Esteban-Sanchez, N.; Pizarro, C.
2013-01-01
Several years ago we presented an experimental, discovery-learning approach to the active learning of greedy algorithms. This paper presents GreedEx, a visualization tool developed to support this didactic method. The paper states the design goals of GreedEx, makes explicit the major design decisions adopted, and describes its main characteristics…
Marcon, Magda; Keller, Daniel; Wurnig, Moritz C; Eberhardt, Christian; Weiger, Markus; Eberli, Daniel; Boss, Andreas
2016-07-01
The separation and quantification of collagen-bound water (CBW) and pore water (PW) components of the cortical bone signal are important because of their different contribution to bone mechanical properties. Ultrashort TE (UTE) imaging can be used to exploit the transverse relaxation from CBW and PW, allowing their quantification. We tested, for the first time, the feasibility of UTE measurements in mice for the separation and quantification of the transverse relaxation of CBW and PW in vivo using three different approaches for T2 * determination. UTE sequences were acquired at 4.7 T in six mice with 10 different TEs (50-5000 μs). The transverse relaxation time T2 * of CBW (T2 *cbw ) and PW (T2 *pw ) and the CBW fraction (bwf) were computed using a mono-exponential (i), a standard bi-exponential (ii) and a new multi-step bi-exponential (iii) approach. Regions of interest were drawn at multiple levels of the femur and vertebral body cortical bone for each mouse. The sum of the normalized squared residuals (Res) and the homogeneity of variance were tested to compare the different methods. In the femur, approach (i) yielded mean T2 * ± standard deviation (SD) of 657 ± 234 μs. With approach (ii), T2 *cbw , T2 *pw and bwf were 464 ± 153 μs, 15 777 ± 10 864 μs and 57.6 ± 9.9%, respectively. For approach (iii), T2 *cbw , T2 *pw and bwf were 387 ± 108 μs, 7534 ± 2765 μs and 42.5 ± 6.2%, respectively. Similar values were obtained from vertebral bodies. Res with approach (ii) was lower than with the two other approaches (p < 0.007), but T2 *pw and bwf variance was lower with approach (iii) than with approach (ii) (p < 0.048). We demonstrated that the separation and quantification of cortical bone water components with UTE sequences is feasible in vivo in mouse models. The direct bi-exponential approach exhibited the best approximation to the measured signal curve with the lowest residuals; however, the newly
Multiwavelength Observations of a Slow Raise, Multi-Step X1.6 Flare and the Associated Eruption
NASA Astrophysics Data System (ADS)
Yurchyshyn, V.
2015-12-01
Using multi-wavelength observations we studied a slow rise, multi-step X1.6 flare that began on November 7, 2014 as a localized eruption of core fields inside a δ-sunspot and later engulfed the entire active region. This flare event was associated with formation of two systems of post eruption arcades (PEAs) and several J-shaped flare ribbons showing extremely fine details, irreversible changes in the photospheric magnetic fields, and it was accompanied by a fast and wide coronal mass ejection. Data from the Solar Dynamics Observatory, IRIS spacecraft along with the ground based data from the New Solar Telescope (NST) present evidence that i) the flare and the eruption were directly triggered by a flux emergence that occurred inside a δ--sunspot at the boundary between two umbrae; ii) this event represented an example of an in-situ formation of an unstable flux rope observed only in hot AIA channels (131 and 94Å) and LASCO C2 coronagraph images; iii) the global PEA system spanned the entire AR and was due to global scale reconnection occurring at heights of about one solar radii, indicating on the global spatial and temporal scale of the eruption.
Blaum, K; Geppert, C; Schreiber, W G; Hengstler, J G; Müller, P; Nörtershäuser, W; Wendt, K; Bushaw, B A
2002-04-01
The application of high-resolution multi-step resonance ionization mass spectrometry (RIMS) to the trace determination of the rare earth element gadolinium is described. Utilizing three-step resonant excitation into an autoionizing level, both isobaric and isotopic selectivity of >10(7) were attained. An overall detection efficiency of approximately 10(-7) and an isotope specific detection limit of 1.5 x 10(9) atoms have been demonstrated. When targeting the major isotope (158)Gd, this corresponds to a total Gd detection limit of 1.6 pg. Additionally, linear response has been demonstrated over a dynamic range of six orders of magnitude. The method has been used to determine the Gd content in various normal and tumor tissue samples, taken from a laboratory mouse shortly after injection of gadolinium diethylenetriaminepentaacetic acid dimeglumine (Gd-DTPA), which is used as a contrast agent for magnetic resonance imaging (MRI). The RIMS results show Gd concentrations that vary by more than two orders of magnitude (0.07-11.5 microg mL(-1)) depending on the tissue type. This variability is similar to that observed in MRI scans that depict Gd-DTPA content in the mouse prior to dissection, and illustrates the potential for quantitative trace analysis in microsamples of biomedical materials. PMID:12012186
NASA Astrophysics Data System (ADS)
Migiyama, Go; Sugimura, Atsuhiko; Osa, Atsushi; Miike, Hidetoshi
Recently, digital cameras are offering technical advantages rapidly. However, the shot image is different from the sight image generated when that scenery is seen with the naked eye. There are blown-out highlights and crushed blacks in the image that photographed the scenery of wide dynamic range. The problems are hardly generated in the sight image. These are contributory cause of difference between the shot image and the sight image. Blown-out highlights and crushed blacks are caused by the difference of dynamic range between the image sensor installed in a digital camera such as CCD and CMOS and the human visual system. Dynamic range of the shot image is narrower than dynamic range of the sight image. In order to solve the problem, we propose an automatic method to decide an effective exposure range in superposition of edges. We integrate multi-step exposure images using the method. In addition, we try to erase pseudo-edges using the process to blend exposure values. Afterwards, we get a pseudo wide dynamic range image automatically.
Segmenting the Femoral Head and Acetabulum in the Hip Joint Automatically Using a Multi-Step Scheme
NASA Astrophysics Data System (ADS)
Wang, Ji; Cheng, Yuanzhi; Fu, Yili; Zhou, Shengjun; Tamura, Shinichi
We describe a multi-step approach for automatic segmentation of the femoral head and the acetabulum in the hip joint from three dimensional (3D) CT images. Our segmentation method consists of the following steps: 1) construction of the valley-emphasized image by subtracting valleys from the original images; 2) initial segmentation of the bone regions by using conventional techniques including the initial threshold and binary morphological operations from the valley-emphasized image; 3) further segmentation of the bone regions by using the iterative adaptive classification with the initial segmentation result; 4) detection of the rough bone boundaries based on the segmented bone regions; 5) 3D reconstruction of the bone surface using the rough bone boundaries obtained in step 4) by a network of triangles; 6) correction of all vertices of the 3D bone surface based on the normal direction of vertices; 7) adjustment of the bone surface based on the corrected vertices. We evaluated our approach on 35 CT patient data sets. Our experimental results show that our segmentation algorithm is more accurate and robust against noise than other conventional approaches for automatic segmentation of the femoral head and the acetabulum. Average root-mean-square (RMS) distance from manual reference segmentations created by experienced users was approximately 0.68mm (in-plane resolution of the CT data).
A multi-step reaction model for ignition of fully-dense Al-CuO nanocomposite powders
NASA Astrophysics Data System (ADS)
Stamatis, D.; Ermoline, A.; Dreizin, E. L.
2012-12-01
A multi-step reaction model is developed to describe heterogeneous processes occurring upon heating of an Al-CuO nanocomposite material prepared by arrested reactive milling. The reaction model couples a previously derived Cabrera-Mott oxidation mechanism describing initial, low temperature processes and an aluminium oxidation model including formation of different alumina polymorphs at increased film thicknesses and higher temperatures. The reaction model is tuned using traces measured by differential scanning calorimetry. Ignition is studied for thin powder layers and individual particles using respectively the heated filament (heating rates of 103-104 K s-1) and laser ignition (heating rate ∼106 K s-1) experiments. The developed heterogeneous reaction model predicts a sharp temperature increase, which can be associated with ignition when the laser power approaches the experimental ignition threshold. In experiments, particles ignited by the laser beam are observed to explode, indicating a substantial gas release accompanying ignition. For the heated filament experiments, the model predicts exothermic reactions at the temperatures, at which ignition is observed experimentally; however, strong thermal contact between the metal filament and powder prevents the model from predicting the thermal runaway. It is suggested that oxygen gas release from decomposing CuO, as observed from particles exploding upon ignition in the laser beam, disrupts the thermal contact of the powder and filament; this phenomenon must be included in the filament ignition model to enable prediction of the temperature runaway.
Ragazzi, M; Rada, E C
2012-10-01
In the sector of municipal solid waste management the debate on the performances of conventional and novel thermo-chemical technologies is still relevant. When a plant must be constructed, decision makers often select a technology prior to analyzing the local environmental impact of the available options, as this type of study is generally developed when the design of the plant has been carried out. Additionally, in the literature there is a lack of comparative analyses of the contributions to local air pollution from different technologies. The present study offers a multi-step approach, based on pollutant emission factors and atmospheric dilution coefficients, for a local comparative analysis. With this approach it is possible to check if some assumptions related to the advantages of the novel thermochemical technologies, in terms of local direct impact on air quality, can be applied to municipal solid waste treatment. The selected processes concern combustion, gasification and pyrolysis, alone or in combination. The pollutants considered are both carcinogenic and non-carcinogenic. A case study is presented concerning the location of a plant in an alpine region and its contribution to the local air pollution. Results show that differences among technologies are less than expected. Performances of each technology are discussed in details. PMID:22795304
Multi-step reaction mechanism for F atom interactions with organosilicate glass and SiO x films
NASA Astrophysics Data System (ADS)
Mankelevich, Yuri A.; Voronina, Ekaterina N.; Rakhimova, Tatyana V.; Palov, Alexander P.; Lopaev, Dmitry V.; Zyryanov, Sergey M.; Baklanov, Mikhail R.
2016-09-01
An ab initio approach with the density functional theory (DFT) method was used to study F atom interactions with organosilicate glass (OSG)-based low-k dielectric films. Because of the complexity and significant modifications of the OSG surface structure during the interaction with radicals and etching, a variety of reactions between the surface groups and thermal F atoms can happen. For OSG film etching and damage, we propose a multi-step mechanism based on DFT static and dynamic simulations, which is consistent with the previously reported experimental observations. The important part of the proposed mechanism is the formation of pentavalent Si atoms on the OSG surface due to a quasi-chemisorption of the incident F atoms. The revealed mechanism of F atom incorporation into the OSG matrix explains the experimentally observed phenomena of fast fluorination without significant modification of the chemical structure. We demonstrate that the pentavalent Si states induce the weakening of adjacent Si–O bonds and their breaking under F atom flux. The calculated results allow us to propose a set of elementary chemical reactions of successive removal of CH3 and CH2 groups and fluorinated SiO x matrix etching.
NASA Astrophysics Data System (ADS)
Shimizu, M.; Yamada, T.; Sasaki, K.; Takada, A.; Nomura, H.; Iguchi, F.; Yugami, H.
2015-04-01
Controlling the thermal radiation spectra of materials is one of the promising ways to advance energy system efficiency. It is well known that the thermal radiation spectrum can be controlled through the introduction of periodic surface microstructures. Herein, a method for the large-area fabrication of periodic microstructures based on multi-step wet etching is described. The method consists of three main steps, i.e., resist mask fabrication via photolithography, electrochemical wet etching, and side wall protection. Using this method, high-aspect micro-holes (0.82 aspect ratio) arrayed with hexagonal symmetry were fabricated on a stainless steel substrate. The conventional wet etching process method typically provides an aspect ratio of 0.3. The optical absorption peak attributed to the fabricated micro-hole array appeared at 0.8 μm, and the peak absorbance exceeded 0.8 for the micro-holes with a 0.82 aspect ratio. While argon plasma etching in a vacuum chamber was used in the present study for the formation of the protective layer, atmospheric plasma etching should be possible and will expand the applicability of this new method for the large-area fabrication of high-aspect materials.
ERIC Educational Resources Information Center
Mechling, Linda C.; Ayres, Kevin M.; Bryant, Kathryn J.; Foster, Ashley L.
2014-01-01
The current study evaluated a relatively new video-based procedure, continuous video modeling (CVM), to teach multi-step cleaning tasks to high school students with moderate intellectual disability. CVM in contrast to video modeling and video prompting allows repetition of the video model (looping) as many times as needed while the user completes…
NASA Astrophysics Data System (ADS)
Werisch, Stefan; Lennartz, Franz; Bieberle, Andre
2013-04-01
Dynamic Multi Step Outflow (MSO) experiments serve for the estimation of the parameters from soil hydraulic functions like e.g. the Mualem van Genuchten model. The soil hydraulic parameters are derived from outflow records and corresponding matric potential measurements from commonly a single tensiometer using inverse modeling techniques. We modified the experimental set up allowing for simultaneous measurements of the matric potential with three tensiometers and the water content using a high-resolution gamma-ray densiometry measurement system (Bieberle et al., 2007, Hampel et al., 2007). Different combinations of the measured time series were used for the estimation of effective soil hydraulic properties, representing different degrees of information of the "hydraulic reality" of the sample. The inverse modeling task was solved with the multimethod search algorithm AMALGAM (Vrugt et al., 2007) in combination with the Hydrus1D model (Šimúnek et al., 2008). Subsequently, the resulting effective soil hydraulic parameters allow the simulation of the MSO experiment and the comparison of model results with observations. The results show that the information of a single tensiometer together with the outflow record result in a set of effective soil hydraulic parameters producing an overall good agreement between the simulation and the observation for the location of the tensiometer. Significantly deviating results are obtained for the other tensiometer positions using this parameter set. Inclusion of more information, such as additional matric potential measurements with the according water contents within the optimization procedure lead to different, more representative hydraulic parameters which improved the overall agreement significantly. These findings indicate that more information about the soil hydraulic state variables in space and time are necessary to obtain effective soil hydraulic properties of soil core samples. Bieberle, A., Kronenberg, J., Schleicher, E
Greedy heuristic algorithm for solving series of eee components classification problems*
NASA Astrophysics Data System (ADS)
Kazakovtsev, A. L.; Antamoshkin, A. N.; Fedosov, V. V.
2016-04-01
Algorithms based on using the agglomerative greedy heuristics demonstrate precise and stable results for clustering problems based on k- means and p-median models. Such algorithms are successfully implemented in the processes of production of specialized EEE components for using in space systems which include testing each EEE device and detection of homogeneous production batches of the EEE components based on results of the tests using p-median models. In this paper, authors propose a new version of the genetic algorithm with the greedy agglomerative heuristic which allows solving series of problems. Such algorithm is useful for solving the k-means and p-median clustering problems when the number of clusters is unknown. Computational experiments on real data show that the preciseness of the result decreases insignificantly in comparison with the initial genetic algorithm for solving a single problem.
A Subspace Pursuit–based Iterative Greedy Hierarchical Solution to the Neuromagnetic Inverse Problem
Babadi, Behtash; Obregon-Henao, Gabriel; Lamus, Camilo; Hämäläinen, Matti S.; Brown, Emery N.; Purdon, Patrick L.
2013-01-01
Magnetoencephalography (MEG) is an important non-invasive method for studying activity within the human brain. Source localization methods can be used to estimate spatiotemporal activity from MEG measurements with high temporal resolution, but the spatial resolution of these estimates is poor due to the ill-posed nature of the MEG inverse problem. Recent developments in source localization methodology have emphasized temporal as well as spatial constraints to improve source localization accuracy, but these methods can be computationally intense. Solutions emphasizing spatial sparsity hold tremendous promise, since the underlying neurophysiological processes generating MEG signals are often sparse in nature, whether in the form of focal sources, or distributed sources representing large-scale functional networks. Recent developments in the theory of compressed sensing (CS) provide a rigorous framework to estimate signals with sparse structure. In particular, a class of CS algorithms referred to as greedy pursuit algorithms can provide both high recovery accuracy and low computational complexity. Greedy pursuit algorithms are difficult to apply directly to the MEG inverse problem because of the high-dimensional structure of the MEG source space and the high spatial correlation in MEG measurements. In this paper, we develop a novel greedy pursuit algorithm for sparse MEG source localization that overcomes these fundamental problems. This algorithm, which we refer to as the Subspace Pursuit-based Iterative Greedy Hierarchical (SPIGH) inverse solution, exhibits very low computational complexity while achieving very high localization accuracy. We evaluate the performance of the proposed algorithm using comprehensive simulations, as well as the analysis of human MEG data during spontaneous brain activity and somatosensory stimuli. These studies reveal substantial performance gains provided by the SPIGH algorithm in terms of computational complexity, localization accuracy
GREEDI---The computerization of the DOE/DOD environmental data bank
Adams, C R; Kephart, E M
1988-01-01
One of the major responsibilities of Sandia National Laboratories is to develop shock and vibration specifications for system mechanical, electrical, and pyrotechnic components. The data required to generate these specifications are collected from finite element analyses, from laboratory simulation experiments with hardware, and from environmental tests. The production of the component specifications requires the analysis, comparison, and continual updating of these data. Sandia National Laboratories has also maintained the DOE/DOD Environmental Data Bank for over 25 years to assist in its shock and vibration efforts as well as to maintain data for several other types of environments. A means of facilitating shared access to engineering analysis data and providing an integrated environment to perform shock and vibration data analysis tasks was required. An interactive computer code and database system named GREEDI (a Graphical Resource for an Engineering Environmental Database Implementation) was developed and implemented. This transformed the DOE/DOD Environmental Data Bank from a card index system into an easily accessed computerized engineering database tool that can manage data in digitized form. GREEDI was created by interconnecting the SPEEDI (Sandia Partitioned Engineering Environmental Database Implementation) code, and the GRAFAID code, an interactive X-Y data analysis tool. An overview of the GREEDI software system is presented. 10 refs.
Emergence of social cohesion in a model society of greedy, mobile individuals.
Roca, Carlos P; Helbing, Dirk
2011-07-12
Human wellbeing in modern societies relies on social cohesion, which can be characterized by high levels of cooperation and a large number of social ties. Both features, however, are frequently challenged by individual self-interest. In fact, the stability of social and economic systems can suddenly break down as the recent financial crisis and outbreaks of civil wars illustrate. To understand the conditions for the emergence and robustness of social cohesion, we simulate the creation of public goods among mobile agents, assuming that behavioral changes are determined by individual satisfaction. Specifically, we study a generalized win-stay-lose-shift learning model, which is only based on previous experience and rules out greenbeard effects that would allow individuals to guess future gains. The most noteworthy aspect of this model is that it promotes cooperation in social dilemma situations despite very low information requirements and without assuming imitation, a shadow of the future, reputation effects, signaling, or punishment. We find that moderate greediness favors social cohesion by a coevolution between cooperation and spatial organization, additionally showing that those cooperation-enforcing levels of greediness can be evolutionarily selected. However, a maladaptive trend of increasing greediness, although enhancing individuals' returns in the beginning, eventually causes cooperation and social relationships to fall apart. Our model is, therefore, expected to shed light on the long-standing problem of the emergence and stability of cooperative behavior. PMID:21709245
Emergence of social cohesion in a model society of greedy, mobile individuals
Roca, Carlos P.; Helbing, Dirk
2011-01-01
Human wellbeing in modern societies relies on social cohesion, which can be characterized by high levels of cooperation and a large number of social ties. Both features, however, are frequently challenged by individual self-interest. In fact, the stability of social and economic systems can suddenly break down as the recent financial crisis and outbreaks of civil wars illustrate. To understand the conditions for the emergence and robustness of social cohesion, we simulate the creation of public goods among mobile agents, assuming that behavioral changes are determined by individual satisfaction. Specifically, we study a generalized win-stay-lose-shift learning model, which is only based on previous experience and rules out greenbeard effects that would allow individuals to guess future gains. The most noteworthy aspect of this model is that it promotes cooperation in social dilemma situations despite very low information requirements and without assuming imitation, a shadow of the future, reputation effects, signaling, or punishment. We find that moderate greediness favors social cohesionby a coevolution between cooperation and spatial organization, additionally showing that those cooperation-enforcing levels of greediness can be evolutionarily selected. However, a maladaptive trend of increasing greediness, although enhancing individuals’ returns in the beginning, eventually causes cooperation and social relationships to fall apart. Our model is, therefore, expected to shed light on the long-standing problem of the emergence and stability of cooperative behavior. PMID:21709245
Gajos, Katarzyna; Petrou, Panagiota; Budkowski, Andrzej; Awsiuk, Kamil; Bernasik, Andrzej; Misiakos, Konstantinos; Rysz, Jakub; Raptis, Ioannis; Kakabakos, Sotirios
2015-02-21
Three multi-step multi-molecular approaches using the biotin-streptavidin system to contact-print DNA arrays on SiO2 surfaces modified with (3-glycidoxypropyl)trimethoxysilane are examined after each deposition/reaction step by atomic force microscopy, X-ray photoelectron spectroscopy and time of flight secondary ion mass spectrometry. Surface modification involves the spotting of preformed conjugates of biotinylated oligonucleotides with streptavidin onto surfaces coated with biotinylated bovine serum albumin b-BSA (approach I) or the spotting of biotinylated oligonucleotides onto a streptavidin coating, the latter prepared through a reaction with immobilized b-BSA (approach II) or direct adsorption (approach III). AFM micrographs, quantified by autocorrelation and height histogram parameters (e.g. roughness), reveal uniform coverage after each modification step with distinct nanostructures after the reaction of biotinylated BSA with streptavidin or of a streptavidin conjugate with biotinylated oligonucleotides. XPS relates the immobilization of biomolecules with covalent binding to the epoxy-silanized surface. Protein coverage, estimated from photoelectron attenuation, shows that regarding streptavidin the highest and the lowest immobilization efficiency is achieved by following approaches I and III, respectively, as confirmed by TOF-SIMS microanalysis. The size of the DNA spot reflects the contact radius of the printed droplet and increases with protein coverage (and roughness) prior to the spotting, as epoxy-silanized surfaces are hardly hydrophilic. Representative TOF-SIMS images show sub-millimeter spots: uniform for approach I, doughnut-like (with a small non-zero minimum) for approach II, both with coffee-rings or peak-shaped for approach III. Spot features, originating from pinned contact lines and DNA surface binding and revealed by complementary molecular distributions (all material, DNA, streptavidin, BSA, epoxy, SiO2), indicate two modes of droplet
Multi-Step Fibrinogen Binding to the Integrin αIIbβ3 Detected Using Force Spectroscopy
Litvinov, Rustem I.; Bennett, Joel S.; Weisel, John W.; Shuman, Henry
2005-01-01
The regulated ability of integrin αIIbβ3 to bind fibrinogen plays a crucial role in platelet aggregation and hemostasis. We have developed a model system based on laser tweezers, enabling us to measure specific rupture forces needed to separate single receptor-ligand complexes. First of all, we performed a thorough and statistically representative analysis of nonspecific protein-protein binding versus specific αIIbβ3-fibrinogen interactions in combination with experimental evidence for single-molecule measurements. The rupture force distribution of purified αIIbβ3 and fibrinogen, covalently attached to underlying surfaces, ranged from ∼20 to 150 pN. This distribution could be fit with a sum of an exponential curve for weak to moderate (20–60 pN) forces, and a Gaussian curve for strong (>60 pN) rupture forces that peaked at 80–90 pN. The interactions corresponding to these rupture force regimes differed in their susceptibility to αIIbβ3 antagonists or Mn2+, an αIIbβ3 activator. Varying the surface density of fibrinogen changed the total binding probability linearly >3.5-fold but did not affect the shape of the rupture force distribution, indicating that the measurements represent single-molecule binding. The yield strength of αIIbβ3-fibrinogen interactions was independent of the loading rate (160–16,000 pN/s), whereas their binding probability markedly correlated with the duration of contact. The aggregate of data provides evidence for complex multi-step binding/unbinding pathways of αIIbβ3 and fibrinogen revealed at the single-molecule level. PMID:16040750
Guo, Xiao-Xi; Hu, Wei; Liu, Yuan; Sun, Su-Qin; Gu, Dong-Chen; He, Helen; Xu, Chang-Hua; Wang, Xi-Chang
2016-02-01
BPO is often added to wheat flour as flour improver, but its excessive use and edibility are receiving increasing concern. A multi-step IR macro-fingerprinting was employed to identify BPO in wheat flour and unveil its changes during storage. BPO contained in wheat flour (<3.0 mg/kg) was difficult to be identified by infrared spectra with correlation coefficients between wheat flour and wheat flour samples contained BPO all close to 0.98. By applying second derivative spectroscopy, obvious differences among wheat flour and wheat flour contained BPO before and after storage in the range of 1500-1400 cm(-1) were disclosed. The peak of 1450 cm(-1) which belonged to BPO was blue shifted to 1453 cm(-1) (1455) which belonged to benzoic acid after one week of storage, indicating that BPO changed into benzoic acid after storage. Moreover, when using two-dimensional correlation infrared spectroscopy (2DCOS-IR) to track changes of BPO in wheat flour (0.05 mg/g) within one week, intensities of auto-peaks at 1781 cm(-1) and 669 cm(-1) which belonged to BPO and benzoic acid, respectively, were changing inversely, indicating that BPO was decomposed into benzoic acid. Moreover, another autopeak at 1767 cm(-1) which does not belong to benzoic acid was also rising simultaneously. By heating perturbation treatment of BPO in wheat flour based on 2DCOS-IR and spectral subtraction analysis, it was found that BPO in wheat flour not only decomposed into benzoic acid and benzoate, but also produced other deleterious substances, e.g., benzene. This study offers a promising method with minimum pretreatment and time-saving to identify BPO in wheat flour and its chemical products during storage in a holistic manner. PMID:26519920
NASA Astrophysics Data System (ADS)
Guo, Xiao-Xi; Hu, Wei; Liu, Yuan; Sun, Su-Qin; Gu, Dong-Chen; He, Helen; Xu, Chang-Hua; Wang, Xi-Chang
2016-02-01
BPO is often added to wheat flour as flour improver, but its excessive use and edibility are receiving increasing concern. A multi-step IR macro-fingerprinting was employed to identify BPO in wheat flour and unveil its changes during storage. BPO contained in wheat flour (< 3.0 mg/kg) was difficult to be identified by infrared spectra with correlation coefficients between wheat flour and wheat flour samples contained BPO all close to 0.98. By applying second derivative spectroscopy, obvious differences among wheat flour and wheat flour contained BPO before and after storage in the range of 1500-1400 cm- 1 were disclosed. The peak of 1450 cm- 1 which belonged to BPO was blue shifted to 1453 cm- 1 (1455) which belonged to benzoic acid after one week of storage, indicating that BPO changed into benzoic acid after storage. Moreover, when using two-dimensional correlation infrared spectroscopy (2DCOS-IR) to track changes of BPO in wheat flour (0.05 mg/g) within one week, intensities of auto-peaks at 1781 cm- 1 and 669 cm- 1 which belonged to BPO and benzoic acid, respectively, were changing inversely, indicating that BPO was decomposed into benzoic acid. Moreover, another autopeak at 1767 cm- 1 which does not belong to benzoic acid was also rising simultaneously. By heating perturbation treatment of BPO in wheat flour based on 2DCOS-IR and spectral subtraction analysis, it was found that BPO in wheat flour not only decomposed into benzoic acid and benzoate, but also produced other deleterious substances, e.g., benzene. This study offers a promising method with minimum pretreatment and time-saving to identify BPO in wheat flour and its chemical products during storage in a holistic manner.
Pishva, Ehsan; Drukker, Marjan; Viechtbauer, Wolfgang; Decoster, Jeroen; Collip, Dina; van Winkel, Ruud; Wichers, Marieke; Jacobs, Nele; Thiery, Evert; Derom, Catherine; Geschwind, Nicole; van den Hove, Daniel; Lataster, Tineke; Myin-Germeys, Inez; van Os, Jim
2014-01-01
Recent human and animal studies suggest that epigenetic mechanisms mediate the impact of environment on development of mental disorders. Therefore, we hypothesized that polymorphisms in epigenetic-regulatory genes impact stress-induced emotional changes. A multi-step, multi-sample gene-environment interaction analysis was conducted to test whether 31 single nucleotide polymorphisms (SNPs) in epigenetic-regulatory genes, i.e. three DNA methyltransferase genes DNMT1, DNMT3A, DNMT3B, and methylenetetrahydrofolate reductase (MTHFR), moderate emotional responses to stressful and pleasant stimuli in daily life as measured by Experience Sampling Methodology (ESM). In the first step, main and interactive effects were tested in a sample of 112 healthy individuals. Significant associations in this discovery sample were then investigated in a population-based sample of 434 individuals for replication. SNPs showing significant effects in both the discovery and replication samples were subsequently tested in three other samples of: (i) 85 unaffected siblings of patients with psychosis, (ii) 110 patients with psychotic disorders, and iii) 126 patients with a history of major depressive disorder. Multilevel linear regression analyses showed no significant association between SNPs and negative affect or positive affect. No SNPs moderated the effect of pleasant stimuli on positive affect. Three SNPs of DNMT3A (rs11683424, rs1465764, rs1465825) and 1 SNP of MTHFR (rs1801131) moderated the effect of stressful events on negative affect. Only rs11683424 of DNMT3A showed consistent directions of effect in the majority of the 5 samples. These data provide the first evidence that emotional responses to daily life stressors may be moderated by genetic variation in the genes involved in the epigenetic machinery. PMID:24967710
NASA Astrophysics Data System (ADS)
Brochero, D.; Anctil, F.; Gagné, C.
2011-03-01
An uncertainty cascade model applied to stream flow forecasting seeks to evaluate the different sources of uncertainty of the complex rainfall-runoff process. The current trend focuses on the combination of Meteorological Ensemble Prediction Systems (MEPS) and hydrological model(s). However, the number of members of such a HEPS may rapidly increase to a level that may not be operationally sustainable. This article evaluates a 94% simplification of an initial 800-member HEPS, forcing 16 lumped rainfall-runoff models with the European Center for Medium-range Weather Forecasts (ECMWF MEPS). More specifically, it tests the time (local) and space (regional) generalization ability of the simplified 50-member HEPS obtained using a methodology that combines 4 main aspects: (i) optimizing information of the short-length series using k-folds cross-validation, (ii) implementing a backward greedy selection technique, (iii) guiding the selection with a linear combination of diversified scores, and (iv) formulating combination case studies at the cross-validation stage. At the local level, the transferability of the 9th day member selection was proven for the other 8 forecast horizons at an 82% success rate. At the regional level, a good performance was also achieved when the 50-member HEPS was applied to a neighbouring catchment within the same cluster. Diversity, defined as hydrological model complementarities addressing different aspects of a forecast, was identified as the critical factor for proper selection applications.
NASA Astrophysics Data System (ADS)
Yang, Cui-Li; Tang, Kit-Sang
2011-12-01
By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.
An Improved Greedy Search Algorithm for the Development of a Phonetically Rich Speech Corpus
NASA Astrophysics Data System (ADS)
Zhang, Jin-Song; Nakamura, Satoshi
An efficient way to develop large scale speech corpora is to collect phonetically rich ones that have high coverage of phonetic contextual units. The sentence set, usually called as the minimum set, should have small text size in order to reduce the collection cost. It can be selected by a greedy search algorithm from a large mother text corpus. With the inclusion of more and more phonetic contextual effects, the number of different phonetic contextual units increased dramatically, making the search not a trivial issue. In order to improve the search efficiency, we previously proposed a so-called least-to-most-ordered greedy search based on the conventional algorithms. This paper evaluated these algorithms in order to show their different characteristics. The experimental results showed that the least-to-most-ordered methods successfully achieved smaller objective sets at significantly less computation time, when compared with the conventional ones. This algorithm has already been applied to the development a number of speech corpora, including a large scale phonetically rich Chinese speech corpus ATRPTH which played an important role in developing our multi-language translation system.
A Fast Greedy Sparse Method of Current Sources Reconstruction for Ventricular Torsion Detection
NASA Astrophysics Data System (ADS)
Bing, Lu; Jiang, Shiqin; Chen, Mengpei; Zhao, Chen; Grönemeyer, D.; Hailer, B.; Van Leeuwen, P.
2015-09-01
A fast greedy sparse (FGS) method of cardiac equivalent current sources reconstruction is developed for non-invasive detection and quantitative analysis of individual left ventricular torsion. The cardiac magnetic field inverse problem is solved based on a distributed source model. The analysis of real 61-channel magnetocardiogram (MCG) data demonstrates that one or two dominant current source with larger strength can be identified efficiently by the FGS algorithm. Then, the left ventricle torsion during systole is examined on the basis of x, y and z coordination curves and angle change of reconstructed dominant current sources. The advantages of this method are non-invasive, visible, with higher sensitivity and resolution. It may enable the clinical detection of cardiac systolic and ejection dysfunction.
Greedy Set Cover Field Selection for Multi-object Spectroscopy in C++ MPI
NASA Astrophysics Data System (ADS)
Stenborg, T. N.
2015-09-01
Multi-object spectrographs allow efficient observation of clustered targets. Observational programs of many targets not encompassed within a telescope's field of view, however, require multiple pointings. Here, a greedy set cover algorithmic approach to efficient field selection in such a scenario is examined. The goal of this approach is not to minimize the total number of pointings needed to cover a given target set, but rather maximize the observational return for a restricted number of pointings. Telescope field of view and maximum targets per field are input parameters, allowing algorithm application to observation planning for the current range of active multi-object spectrographs (e.g. the 2dF/AAOmega, Fiber Large Array Multi Element Spectrograph, Fiber Multi-Object Spectrograph, Hectochelle, Hectospec and Hydra systems), and for any future systems. A parallel version of the algorithm is implemented with the message passing interface, facilitating execution on both shared and distributed memory systems.
NASA Astrophysics Data System (ADS)
Shigeta, Takemi; Young, D. L.; Liu, Chein-Shan
2012-08-01
The mixed boundary value problem of the Laplace equation is considered. The method of fundamental solutions (MFS) approximates the exact solution to the Laplace equation by a linear combination of independent fundamental solutions with different source points. The accuracy of the numerical solution depends on the distribution of source points. In this paper, a weighted greedy QR decomposition (GQRD) is proposed to choose significant source points by introducing a weighting parameter. An index called an average degree of approximation is defined to show the efficiency of the proposed method. From numerical experiments, it is concluded that the numerical solution tends to be more accurate when the average degree of approximation is larger, and that the proposed method can yield more accurate solutions with a less number of source points than the conventional GQRD.
MotifMiner: A Table Driven Greedy Algorithm for DNA Motif Mining
NASA Astrophysics Data System (ADS)
Seeja, K. R.; Alam, M. A.; Jain, S. K.
DNA motif discovery is a much explored problem in functional genomics. This paper describes a table driven greedy algorithm for discovering regulatory motifs in the promoter sequences of co-expressed genes. The proposed algorithm searches both DNA strands for the common patterns or motifs. The inputs to the algorithm are set of promoter sequences, the motif length and minimum Information Content. The algorithm generates subsequences of given length from the shortest input promoter sequence. It stores these subsequences and their reverse complements in a table. Then it searches the remaining sequences for good matches of these subsequences. The Information Content score is used to measure the goodness of the motifs. The algorithm has been tested with synthetic data and real data. The results are found promising. The algorithm could discover meaningful motifs from the muscle specific regulatory sequences.
2011-01-01
Background Position-specific priors (PSP) have been used with success to boost EM and Gibbs sampler-based motif discovery algorithms. PSP information has been computed from different sources, including orthologous conservation, DNA duplex stability, and nucleosome positioning. The use of prior information has not yet been used in the context of combinatorial algorithms. Moreover, priors have been used only independently, and the gain of combining priors from different sources has not yet been studied. Results We extend RISOTTO, a combinatorial algorithm for motif discovery, by post-processing its output with a greedy procedure that uses prior information. PSP's from different sources are combined into a scoring criterion that guides the greedy search procedure. The resulting method, called GRISOTTO, was evaluated over 156 yeast TF ChIP-chip sequence-sets commonly used to benchmark prior-based motif discovery algorithms. Results show that GRISOTTO is at least as accurate as other twelve state-of-the-art approaches for the same task, even without combining priors. Furthermore, by considering combined priors, GRISOTTO is considerably more accurate than the state-of-the-art approaches for the same task. We also show that PSP's improve GRISOTTO ability to retrieve motifs from mouse ChiP-seq data, indicating that the proposed algorithm can be applied to data from a different technology and for a higher eukaryote. Conclusions The conclusions of this work are twofold. First, post-processing the output of combinatorial algorithms by incorporating prior information leads to a very efficient and effective motif discovery method. Second, combining priors from different sources is even more beneficial than considering them separately. PMID:21513505
Death of the (traveling) salesman: primates do not show clear evidence of multi-step route planning.
Janson, Charles
2014-05-01
Several comparative studies have linked larger brain size to a fruit-eating diet in primates and other animals. The general explanation for this correlation is that fruit is a complex resource base, consisting of many discrete patches of many species, each with distinct nutritional traits, the production of which changes predictably both within and between seasons. Using this information to devise optimal spatial foraging strategies is among the most difficult problems to solve in all of mathematics, a version of the famous Traveling Salesman Problem. Several authors have suggested that primates might use their large brains and complex cognition to plan foraging strategies that approximate optimal solutions to this problem. Three empirical studies have examined how captive primates move when confronted with the simplest version of the problem: a spatial array of equally valuable goals. These studies have all concluded that the subjects remember many food source locations and show very efficient travel paths; some authors also inferred that the subjects may plan their movements based on considering combinations of three or more future goals at a time. This analysis re-examines critically the claims of planned movement sequences from the evidence presented. The efficiency of observed travel paths is largely consistent with use of the simplest of foraging rules, such as visiting the nearest unused "known" resource. Detailed movement sequences by test subjects are most consistent with a rule that mentally sums spatial information from all unused resources in a given trial into a single "gravity" measure that guides movements to one destination at a time. PMID:23934927
NASA Astrophysics Data System (ADS)
Dyar, Scott M.; Smeigh, Amanda L.; Karlen, Steven D.; Young, Ryan M.; Wasielewski, Michael R.
2015-06-01
The excited state and redox properties of a new bi-functional perylene redox chromophore, 2,3-dihydro-1-azabenzo[cd]perylene (DABP), are described. Perylene has been widely used in electron donor-acceptor molecules in fields ranging from artificial photosynthesis to molecular spintronics. However, attaching multiple redox components to perylene to carry out multi-step electron transfer reactions often produces hard to separate regioisomers, which complicate data analysis. The use of DABP provides a strategy to retain the electronic properties of perylene, yet eliminate regioisomers. Ultrafast photo-initiated single- and two-step electron transfer reactions in three linear electron donor-acceptor systems incorporating DABP are described to illustrate its utility.
Zhang, Wenle; Liu, Jianchang; Wang, Honghai
2015-09-01
This paper deals with the ultra-fast formation control problem of high-order discrete-time multi-agent systems. Using the local neighbor-error knowledge, a novel ultra-fast protocol with multi-step predictive information and self-feedback term is proposed. The asymptotic convergence factor is improved by a power of q+1 compared to the routine protocol. To some extent, the ultra-fast algorithm overcomes the influence of communication topology to the convergence speed. Furthermore, some sufficient conditions are given herein. The ones decouple the design of the synchronizing gains from the detailed graph properties, and explicitly reveal how the agent dynamic and the communication graph jointly affect the ultra-fast formationability. Finally, some simulations are worked out to illustrate the effectiveness of our theoretical results. PMID:26051965
Zhao, Huiying; Xu, Jin; Ghebrezadik, Helen; Hylands, Peter J
2015-10-10
Ginseng, mainly Asian ginseng and American ginseng, is the most widely consumed herbal product in the world . However, the existing quality control method is not adequate: adulteration is often seen in the market. In this study, 31 batches of ginseng from Chinese stores were analyzed using (1)H NMR metabolite profiles together with multi-step principal component analysis. The most abundant metabolites, sugars, were excluded from the NMR spectra after the first principal component analysis, in order to reveal differences contributed by less abundant metabolites. For the first time, robust, distinctive and representative differences of Asian ginseng from American ginseng were found and the key metabolites responsible were identified as sucrose, glucose, arginine, choline, and 2-oxoglutarate and malate. Differences between wild and cultivated ginseng were identified as ginsenosides. A substitute cultivated American ginseng was noticed. These results demonstrated that the combination of (1)H NMR and PCA is effective in quality control of ginseng. PMID:26037159
NASA Astrophysics Data System (ADS)
Lin, Chun-Cheng; Tang, Jian-Fu; Su, Hsiu-Hsien; Hong, Cheng-Shong; Huang, Chih-Yu; Chu, Sheng-Yuan
2016-06-01
The multi-step resistive switching (RS) behavior of a unipolar Pt/Li0.06Zn0.94O/Pt resistive random access memory (RRAM) device is investigated. It is found that the RRAM device exhibits normal, 2-, 3-, and 4-step RESET behaviors under different compliance currents. The transport mechanism within the device is investigated by means of current-voltage curves, in-situ transmission electron microscopy, and electrochemical impedance spectroscopy. It is shown that the ion transport mechanism is dominated by Ohmic behavior under low electric fields and the Poole-Frenkel emission effect (normal RS behavior) or Li+ ion diffusion (2-, 3-, and 4-step RESET behaviors) under high electric fields.
Erdemir, Ugur; Sancakli, Hande Sar; Yildiz, Esra
2012-01-01
Objectives: The objective of this in vitro study was to evaluate the surface roughness and micro-hardness of three novel resin composites containing nanoparticles after polishing with one-step and conventional multi-step polishing systems. Methods: A total of 126 specimens (10 X 2 mm) were prepared in a metal mold using three nano-composites (Filtek Supreme XT, Ceram-X, and Grandio), 21 specimens of each resin composite for both tests (n=63 for each test). Following light curing, seven specimens from each group received no polishing treatment and served as controls for both tests. The specimens were randomly polished using PoGo and Sof-Lex systems for 30 seconds after being wet-ground with 1200-grit silicon carbide paper. The mean surface roughness of each polished specimen was determined with a profilometer. The microhardness was determined using a Vickers hardness measuring instrument with a 200-g load and 15 seconds dwell time. The data were analyzed using the Kruskal-Wallis test and the post hoc Dunn's multiple comparison tests at a significance level of .05. Results: Among all materials, the smoothest surfaces were obtained under a matrix strip (control) (P<.05). There were no statistically significant differences among polishing systems in the resin composites for surface roughness (P>.05). The lowest hardness values for the three resin composites were obtained with a matrix strip, and there was a statistically significant difference compared with other polishing systems (P<.05) whereas no statistically significant differences were observed between the polishing systems (P>.05). Conclusion: The current one-step polishing system appears to be as effective as multi-step systems and may be preferable for polishing resin composite restorations. PMID:22509124
Vaisocherová-Lísalová, Hana; Víšová, Ivana; Ermini, Maria Laura; Špringer, Tomáš; Song, Xue Chadtová; Mrázek, Jan; Lamačová, Josefína; Scott Lynn, N; Šedivák, Petr; Homola, Jiří
2016-06-15
Recent outbreaks of foodborne illnesses have shown that foodborne bacterial pathogens present a significant threat to public health, resulting in an increased need for technologies capable of fast and reliable screening of food commodities. The optimal method of pathogen detection in foods should: (i) be rapid, specific, and sensitive; (ii) require minimum sample preparation; and (iii) be robust and cost-effective, thus enabling use in the field. Here we report the use of a SPR biosensor based on ultra-low fouling and functionalizable poly(carboxybetaine acrylamide) (pCBAA) brushes for the rapid and sensitive detection of bacterial pathogens in crude food samples utilizing a three-step detection assay. We studied both the surface resistance to fouling and the functional capabilities of these brushes with respect to each step of the assay, namely: (I) incubation of the sensor with crude food samples, resulting in the capture of bacteria by antibodies immobilized to the pCBAA coating, (II) binding of secondary biotinylated antibody (Ab2) to previously captured bacteria, and (III) binding of streptavidin-coated gold nanoparticles to the biotinylated Ab2 in order to enhance the sensor response. We also investigated the effects of the brush thickness on the biorecognition capabilities of the gold-grafted functionalized pCBAA coatings. We demonstrate that pCBAA-compared to standard low-fouling OEG-based alkanethiolate self-assemabled monolayers-exhibits superior surface resistance regarding both fouling from complex food samples as well as the non-specific binding of S-AuNPs. We further demonstrate that a SPR biosensor based on a pCBAA brush with a thickness as low as 20 nm was capable of detecting E. coli O157:H7 and Salmonella sp. in complex hamburger and cucumber samples with extraordinary sensitivity and specificity. The limits of detection for the two bacteria in cucumber and hamburger extracts were determined to be 57 CFU/mL and 17 CFU/mL for E. coli and 7.4 × 10
NASA Astrophysics Data System (ADS)
Ma, Hui; Zhou, Haijun
2011-05-01
In this brief report we explore the energy landscapes of two spin glass models using a greedy single-spin flipping process, Gmax. The ground-state energy density of the random maximum two-satisfiability problem is efficiently approached by Gmax. The achieved energy density e(t) decreases with the evolution time t as e(t)-e(∞)=h(log10t)-z with a small prefactor h and a scaling coefficient z>1, indicating an energy landscape with deep and rugged funnel-shape regions. For the ±J Viana-Bray spin glass model, however, the greedy single-spin dynamics quickly gets trapped to a local minimal region of the energy landscape.
Computer-Assisted Test Assembly Using Optimization Heuristics.
ERIC Educational Resources Information Center
Leucht, Richard M.
1998-01-01
Presents a variation of a "greedy" algorithm that can be used in test-assembly problems. The algorithm, the normalized weighted absolute-deviation heuristic, selects items to have a locally optimal fit to a moving set of average criterion values. Demonstrates application of the model. (SLD)
Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.
Lee, HyungJune
2014-01-01
We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736
Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks
Lee, HyungJune
2014-01-01
We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736
Cai, Chuangjian; Zhang, Lin; Cai, Wenjuan; Zhang, Dong; Lv, Yanlu; Luo, Jianwen
2016-01-01
In order to improve the spatial resolution of time-domain (TD) fluorescence molecular lifetime tomography (FMLT), an accelerated nonlinear orthogonal matching pursuit (ANOMP) algorithm is proposed. As a kind of nonlinear greedy sparsity-constrained methods, ANOMP can find an approximate solution of L0 minimization problem. ANOMP consists of two parts, i.e., the outer iterations and the inner iterations. Each outer iteration selects multiple elements to expand the support set of the inverse lifetime based on the gradients of a mismatch error. The inner iterations obtain an intermediate estimate based on the support set estimated in the outer iterations. The stopping criterion for the outer iterations is based on the stability of the maximum reconstructed values and is robust for problems with targets at different edge-to-edge distances (EEDs). Phantom experiments with two fluorophores at different EEDs and in vivo mouse experiments demonstrate that ANOMP can provide high quantification accuracy, even if the EED is relatively small, and high resolution. PMID:27446648
Marquette, Ian; Quesne, Christiane
2014-11-15
Type III multi-step rationally extended harmonic oscillator and radial harmonic oscillator potentials, characterized by a set of k integers m{sub 1}, m{sub 2}, ⋯, m{sub k}, such that m{sub 1} < m{sub 2} < ⋯ < m{sub k} with m{sub i} even (resp. odd) for i odd (resp. even), are considered. The state-adding and state-deleting approaches to these potentials in a supersymmetric quantum mechanical framework are combined to construct new ladder operators. The eigenstates of the Hamiltonians are shown to separate into m{sub k} + 1 infinite-dimensional unitary irreducible representations of the corresponding polynomial Heisenberg algebras. These ladder operators are then used to build a higher-order integral of motion for seven new infinite families of superintegrable two-dimensional systems separable in cartesian coordinates. The finite-dimensional unitary irreducible representations of the polynomial algebras of such systems are directly determined from the ladder operator action on the constituent one-dimensional Hamiltonian eigenstates and provide an algebraic derivation of the superintegrable systems whole spectrum including the level total degeneracies.
Xiong, Hanzhen; Li, Qiulian; Chen, Ruichao; Liu, Shaoyan; Lin, Qiongyan; Xiong, Zhongtang; Jiang, Qingping; Guo, Linlang
2016-01-01
We aimed to identify endometrioid endometrial carcinoma (EEC)-related gene signatures using a multi-step miRNA-mRNA regulatory network construction approach. Pathway analysis showed that 61 genes were enriched on many carcinoma-related pathways. Among the 14 highest scoring gene signatures, six genes had been previously shown to be endometrial carcinoma. By qRT-PCR and next generation sequencing, we found that a gene signature (CPEB1) was significantly down-regulated in EEC tissues, which may be caused by hsa-miR-183-5p up-regulation. In addition, our literature surveys suggested that CPEB1 may play an important role in EEC pathogenesis by regulating the EMT/p53 pathway. The miRNA-mRNA network is worthy of further investigation with respect to the regulatory mechanisms of miRNAs in EEC. CPEB1 appeared to be a tumor suppressor in EEC. Our results provided valuable guidance for the functional study at the cellular level, as well as the EEC mouse models. PMID:27271671
Grain refinement in a AlZnMgCuTi alloy by intensive melt shearing: A multi-step nucleation mechanism
NASA Astrophysics Data System (ADS)
Li, H. T.; Xia, M.; Jarry, Ph.; Scamans, G. M.; Fan, Z.
2011-01-01
Direct chill (DC) cast ingots of wrought Al alloys conventionally require the deliberate addition of a grain refiner to provide a uniform as-cast microstructure for the optimisation of both mechanical properties and processability. Grain refiner additions have been in widespread industrial use for more than half a century. Intensive melt shearing can provide grain refinement without the need for a specific grain refiner addition for both magnesium and aluminium based alloys. In this paper we present experimental evidence of the grain refinement in an experimental wrought aluminium alloy achieved by intensive melt shearing in the liquid state prior to solidification. The mechanisms for high shear induced grain refinement are correlated with the evolution of oxides in alloys. The oxides present in liquid aluminium alloys, normally as oxide films and clusters, can be effectively dispersed by intensive shearing and then provide effective sites for the heterogeneous nucleation of Al 3Ti phase. As a result, Al 3Ti particles with a narrower size distribution and hence improved efficiency as active nucleation sites of α-aluminium grains are responsible for the achieved significant grain refinement. This is termed a multi-step nucleation mechanism.
NASA Astrophysics Data System (ADS)
Prados, A. I.; Gupta, P.; Mehta, A. V.; Schmidt, C.; Blevins, B.; Carleton-Hug, A.; Barbato, D.
2014-12-01
NASA's Applied Remote Sensing Training Program (ARSET), http://arset.gsfc.nasa.gov, within NASA's Applied Sciences Program, has been providing applied remote sensing training since 2008. The goals of the program are to develop the technical and analytical skills necessary to utilize NASA resources for decision-support, and to help end-users navigate through the vast data resources freely available. We discuss our multi-step approach to improving data access and use of NASA satellite and model data for air quality, water resources, disaster, and land management. The program has reached over 1600 participants world wide using a combined online and interactive approach. We will discuss lessons learned as well as best practices and success stories in improving the use of NASA Earth Science resources archived at multiple data centers by end-users in the private and public sectors. ARSET's program evaluation method for improving the program and assessing the benefits of trainings to U.S and international organizations will also be described.
NASA Astrophysics Data System (ADS)
Xu, Rong; Sun, Suqin; Zhu, Weicheng; Xu, Changhua; Liu, Yougang; Shen, Liang; Shi, Yue; Chen, Jun
2014-07-01
The genus Cistanche generally has four species in China, including C. deserticola (CD), C. tubulosa (CT), C. salsa (CS) and C. sinensis (CSN), among which CD and CT are official herbal sources of Cistanche Herba (CH). To clarify the sources of CH and ensure the clinical efficacy and safety, a multi-step IR macro-fingerprint method was developed to analyze and evaluate the ethanol extracts of the four species. Through this method, the four species were distinctively distinguished, and the main active components phenylethanoid glycosides (PhGs) were estimated rapidly according to the fingerprint features in the original IR spectra, second derivative spectra, correlation coefficients and 2D-IR correlation spectra. The exclusive IR fingerprints in the spectra including the positions, shapes and numbers of peaks indicated that constitutes of CD were the most abundant, and CT had the highest level of PhGs. The results deduced by some macroscopic features in IR fingerprint were in agreement with the HPLC fingerprint of PhGs from the four species, but it should be noted that the IR provided more chemical information than HPLC. In conclusion, with the advantages of high resolution, cost effective and speediness, the macroscopic IR fingerprint method should be a promising analytical technique for discriminating extremely similar herbal medicine, monitoring and tracing the constituents of different extracts and even for quality control of the complex systems such as TCM.
NASA Astrophysics Data System (ADS)
Hatta, Kohei; Nakajima, Yohei; Isoda, Erika; Itoh, Mariko; Yamamoto, Tamami
The brain is one of the most complicated structures in nature. Zebrafish is a useful model to study development of vertebrate brain, because it is transparent at early embryonic stage and it develops rapidly outside of the body. We made a series of transgenic zebrafish expressing green-fluorescent protein related molecules, for example, Kaede and KikGR, whose green fluorescence can be irreversibly converted to red upon irradiation with ultra-violet (UV) or violet light, and Dronpa, whose green fluorescence is eliminated with strong blue light but can be reactivated upon irradiation with UV or violet-light. We have recently shown that infrared laser evoked gene operator (IR-LEGO) which causes a focused heat shock could locally induce these fluorescent proteins and the other genes. Neural cell migration and axonal pattern formation in living brain could be visualized by this technique. We also can express channel rhodopsine 2 (ChR2), a photoactivatable cation channel, or Natronomonas pharaonis halorhodopsin (NpHR), a photoactivatable chloride ion pump, locally in the nervous system by IR. Then, behaviors of these animals can be controlled by activating or silencing the local neurons by light. This novel strategy is useful in discovering neurons and circuits responsible for a wide variety of animal behaviors. We proposed to call this method ‘multi-stepped optogenetics’.
Flores, Glenn
2002-07-01
Cinematic depictions of physicians potentially can affect public expectations and the patient-physician relationship, but little attention has been devoted to portrayals of physicians in movies. The objective of the study was the analysis of cinematic depictions of physicians to determine common demographic attributes of movie physicians, major themes, and whether portrayals have changed over time. All movies released on videotape with physicians as main characters and readily available to the public were viewed in their entirety. Data were collected on physician characteristics, diagnoses, and medical accuracy, and dialogue concerning physicians was transcribed. The results showed that in the 131 films, movie physicians were significantly more likely to be male (p < 0.00001), White (p < 0.00001), and < 40 years of age (p < 0.009). The proportion of women and minority film physicians has declined steadily in recent decades. Movie physicians are most commonly surgeons (33%), psychiatrists (26%), and family practitioners (18%). Physicians were portrayed negatively in 44% of movies, and since the 1960s positive portrayals declined while negative portrayals increased. Physicians frequently are depicted as greedy, egotistical, uncaring, and unethical, especially in recent films. Medical inaccuracies occurred in 27% of films. Compassion and idealism were common in early physician movies but are increasingly scarce in recent decades. A recurrent theme is the "mad scientist," the physician-researcher that values research more than patients' welfare. Portrayals of physicians as egotistical and materialistic have increased, whereas sexism and racism have waned. Movies from the past two decades have explored critical issues surrounding medical ethics and managed care. We conclude that negative cinematic portrayals of physicians are on the rise, which may adversely affect patient expectations and the patient-physician relationship. Nevertheless, films about physicians can
Flores, Glenn
2002-01-01
Cinematic depictions of physicians potentially can affect public expectations and the patient-physician relationship, but little attention has been devoted to portrayals of physicians in movies. The objective of the study was the analysis of cinematic depictions of physicians to determine common demographic attributes of movie physicians, major themes, and whether portrayals have changed over time. All movies released on videotape with physicians as main characters and readily available to the public were viewed in their entirety. Data were collected on physician characteristics, diagnoses, and medical accuracy, and dialogue concerning physicians was transcribed. The results showed that in the 131 films, movie physicians were significantly more likely to be male (p < 0.00001), White (p < 0.00001), and < 40 years of age (p < 0.009). The proportion of women and minority film physicians has declined steadily in recent decades. Movie physicians are most commonly surgeons (33%), psychiatrists (26%), and family practitioners (18%). Physicians were portrayed negatively in 44% of movies, and since the 1960s positive portrayals declined while negative portrayals increased. Physicians frequently are depicted as greedy, egotistical, uncaring, and unethical, especially in recent films. Medical inaccuracies occurred in 27% of films. Compassion and idealism were common in early physician movies but are increasingly scarce in recent decades. A recurrent theme is the "mad scientist," the physician-researcher that values research more than patients' welfare. Portrayals of physicians as egotistical and materialistic have increased, whereas sexism and racism have waned. Movies from the past two decades have explored critical issues surrounding medical ethics and managed care. We conclude that negative cinematic portrayals of physicians are on the rise, which may adversely affect patient expectations and the patient-physician relationship. Nevertheless, films about physicians can
Magmatically Greedy Reararc Volcanoes of the N. Tofua Segment of the Tonga Arc
NASA Astrophysics Data System (ADS)
Rubin, K. H.; Embley, R. W.; Arculus, R. J.; Lupton, J. E.
2013-12-01
Volcanism along the northernmost Tofua Arc is enigmatic because edifices of the arc's volcanic front are mostly, magmatically relatively anemic, despite the very high convergence rate of the Pacific Plate with this section of Tonga Arc. However, just westward of the arc front, in terrain generally thought of as part of the adjacent NE Lau Backarc Basin, lie a series of very active volcanoes and volcanic features, including the large submarine caldera Niuatahi (aka volcano 'O'), a large composite dacite lava flow terrain not obviously associated with any particular volcanic edifice, and the Mata volcano group, a series of 9 small elongate volcanoes in an extensional basin at the extreme NE corner of the Lau Basin. These three volcanic terrains do not sit on arc-perpendicular cross chains. Collectively, these volcanic features appear to be receiving a large proportion of the magma flux from the sub-Tonga/Lau mantle wedge, in effect 'stealing' this magma flux from the arc front. A second occurrence of such magma 'capture' from the arc front occurs in an area just to the south, on southernmost portion of the Fonualei Spreading Center. Erupted compositions at these 'magmatically greedy' volcanoes are consistent with high slab-derived fluid input into the wedge (particularly trace element abundances and volatile contents, e.g., see Lupton abstract this session). It is unclear how long-lived a feature this is, but the very presence of such hyperactive and areally-dispersed volcanism behind the arc front implies these volcanoes are not in fact part of any focused spreading/rifting in the Lau Backarc Basin, and should be thought of as 'reararc volcanoes'. Possible tectonic factors contributing to this unusually productive reararc environment are the high rate of convergence, the cold slab, the highly disorganized extension in the adjacent backarc, and the tear in the subducting plate just north of the Tofua Arc.
A greedy-based multiquadric method for LiDAR-derived ground data reduction
NASA Astrophysics Data System (ADS)
Chen, Chuanfa; Yan, Changqing; Cao, Xuewei; Guo, Jinyun; Dai, Honglei
2015-04-01
A new greedy-based multiquadric method (MQ-G) has been developed to perform LiDAR-derived ground data reduction by selecting a certain amount of significant terrain points from the raw dataset to keep the accuracy of the constructed DEMs as high as possible, while maximally retaining terrain features. In the process of MQ-G, the significant terrain points were selected with an iterative process. First, the points with the maximum and minimum elevations were selected as the initial significant points. Next, a smoothing MQ was employed to perform an interpolation with the selected critical points. Then, the importance of all candidate points was assessed by interpolation error (i.e. the absolute difference between the interpolated and actual elevations). Lastly, the most significant point in the current iteration was selected and used for point selection in the next iteration. The process was repeated until the number of selected points reached a pre-set level or no point was found to have the interpolation error exceeding a user-specified accuracy tolerance. In order to avoid the huge computing cost, a new technique was presented to quickly solve the systems of MQ equations in the global interpolation process, and then the global MQ was replaced with the local one when a certain amount of critical points were selected. Four study sites with different morphologies (i.e. flat, undulating, hilly and mountainous terrains) were respectively employed to comparatively analyze the performances of MQ-G and the classical data selection methods including maximum z-tolerance (Max-Z) and the random method for reducing LiDAR-derived ground datasets. Results show that irrespective of the number of selected critical points and terrain characteristics, MQ-G is always more accurate than the other methods for DEM construction. Moreover, MQ-G has a better ability of preserving terrain feature lines, especially for the undulating and hilly terrains.
NASA Astrophysics Data System (ADS)
Yang, J.-S.; Yu, S.-P.; Liu, G.-M.
2013-12-01
In order to increase the accuracy of serial-propagated long-range multi-step-ahead (MSA) prediction, which has high practical value but also great implementary difficulty because of huge error accumulation, a novel wavelet neural network hybrid model - CDW-NN - combining continuous and discrete wavelet transforms (CWT and DWT) and neural networks (NNs), is designed as the MSA predictor for the effective long-term forecast of hydrological signals. By the application of 12 types of hybrid and pure models in estuarine 1096-day river stages forecasting, the different forecast performances and the superiorities of CDW-NN model with corresponding driving mechanisms are discussed. One type of CDW-NN model, CDW-NF, which uses neuro-fuzzy as the forecast submodel, has been proven to be the most effective MSA predictor for the prominent accuracy enhancement during the overall 1096-day long-term forecasts. The special superiority of CDW-NF model lies in the CWT-based methodology, which determines the 15-day and 28-day prior data series as model inputs by revealing the significant short-time periodicities involved in estuarine river stage signals. Comparing the conventional single-step-ahead-based long-term forecast models, the CWT-based hybrid models broaden the prediction range in each forecast step from 1 day to 15 days, and thus reduce the overall forecasting iteration steps from 1096 steps to 74 steps and finally create significant decrease of error accumulations. In addition, combination of the advantages of DWT method and neuro-fuzzy system also benefits filtering the noisy dynamics in model inputs and enhancing the simulation and forecast ability for the complex hydro-system.
NASA Astrophysics Data System (ADS)
Yang, J.-S.; Yu, S.-P.; Liu, G.-M.
2013-07-01
In order to increase the accuracy of serial-propagated long-range multi-step-ahead (MSA) prediction, which has high practical value but also great difficulty to conduct because of huge error accumulation, a novel wavelet-NN hybrid model CDW-NN, combining continuous and discrete wavelet transforms (CWT and DWT) and neural networks (NN), is designed as the MSA predictor for effective long-term forecast of hydrological signals. By the application of 12 types of hybrid and pure models in estuarine 1096 day river stage series forecasting, different forecast performances and the superiorities of CDW-NN model with corresponding driving mechanisms are discussed, and one type of CDW-NN model (CDW-NF), which uses Neuro-Fuzzy as the forecast submodel, has been proven to be the most effective MSA predictor for the accuracy enhancement in the overall 1096 days long-term forecast. The special superiority of CDW-NF model lies in the CWT based methodology, which determines the 15 and 28 day prior data series as model inputs by revealing the significant short-time periodicities involved in estuarine river stage signals. Comparing conventional single-step-ahead based long-term forecast models, the CWT based hybrid models broaden the prediction range in each forecast step from 1 day to 15 days, thus reduce the overall forecasting iteration steps from 1096 steps to 74 steps and finally creates significant decrease of error accumulations. In addition, combination of the advantages of DWT method and Neuro-Fuzzy system also very benefit filtering the noisy dynamics for model inputs and enhancing the simulation and forecast ability of the complex hydro-system.
Fan, Jian Ping; Kalia, Priya; Di Silvio, Lucy; Huang, Jie
2014-03-01
A multi-step sol-gel process was employed to synthesize bioactive glass (BG) nanoparticles. Transmission electron microscopy (TEM) revealed that the BG nanoparticles were spherical and ranged from 30 to 60 nm in diameter. In vitro reactivity of the BG nanoparticles was tested in phosphate buffer saline (PBS), Tris-buffer (TRIS), simulated body fluid (SBF), and Dulbecco's modified Eagle's medium (DMEM), in comparison with similar sized hydroxyapatite (HA) and silicon substituted HA (SiHA) nanoparticles. Bioactivity of the BG nanoparticles was confirmed through Fourier transform infrared spectroscopy (FTIR) analysis. It was found that bone-like apatite was formed after immersion in SBF at 7 days. Solutions containing BG nanoparticles were slightly more alkaline than HA and SiHA, suggesting that a more rapid apatite formation on BG was related to solution-mediated dissolution. Primary human osteoblast (HOB) cell model was used to evaluate biological responses to BG nanoparticles. Lactate dehydrogenase (LDH) cytotoxicity assay showed that HOB cells were not adversely affected by the BG nanoparticles throughout the 7day test period. Interestingly, MTS assay results showed an enhancement in cell proliferation in the presence of BG when compared to HA and SiHA nanoparticles. Particularly, statistically significant (p<0.05) alkaline phosphatase (ALP) activity of HOB cells was found on the culture containing BG nanoparticles, suggesting that the cell differentiation might be promoted by BG. Real-time quantitative PCR analysis (qPCR) further confirmed this finding, as a significantly higher level of RUNX2 gene expression was recorded on the cells cultured in the presence of BG nanoparticles when compared to those with HA and SiHA. PMID:24433905
Boolean methods of optimization over independence systems
Hulme, B.L.
1983-01-01
This paper presents both a direct and an iterative method of solving the combinatorial optimization problem associated with any independence system. The methods use Boolean algebraic computations to produce solutions. In addition, the iterative method employs a version of the greedy algorithm both to compute upper bounds on the optimum value and to produce the additional circuits needed at every stage. The methods are extensions of those used to solve a problem of fire protection at nuclear reactor power plants.
2012-01-01
Background Various antigen-specific immunoassays are available for the serological diagnosis of autoimmune bullous diseases. However, a spectrum of different tissue-based and monovalent antigen-specific assays is required to establish the diagnosis. BIOCHIP mosaics consisting of different antigen substrates allow polyvalent immunofluorescence (IF) tests and provide antibody profiles in a single incubation. Methods Slides for indirect IF were prepared, containing BIOCHIPS with the following test substrates in each reaction field: monkey esophagus, primate salt-split skin, antigen dots of tetrameric BP180-NC16A as well as desmoglein 1-, desmoglein 3-, and BP230gC-expressing human HEK293 cells. This BIOCHIP mosaic was probed using a large panel of sera from patients with pemphigus vulgaris (PV, n = 65), pemphigus foliaceus (PF, n = 50), bullous pemphigoid (BP, n = 42), and non-inflammatory skin diseases (n = 97) as well as from healthy blood donors (n = 100). Furthermore, to evaluate the usability in routine diagnostics, 454 consecutive sera from patients with suspected immunobullous disorders were prospectively analyzed in parallel using a) the IF BIOCHIP mosaic and b) a panel of single antibody assays as commonly used by specialized centers. Results Using the BIOCHIP mosaic, sensitivities of the desmoglein 1-, desmoglein 3-, and NC16A-specific substrates were 90%, 98.5% and 100%, respectively. BP230 was recognized by 54% of the BP sera. Specificities ranged from 98.2% to 100% for all substrates. In the prospective study, a high agreement was found between the results obtained by the BIOCHIP mosaic and the single test panel for the diagnosis of BP, PV, PF, and sera without serum autoantibodies (Cohen’s κ between 0.88 and 0.97). Conclusions The BIOCHIP mosaic contains sensitive and specific substrates for the indirect IF diagnosis of BP, PF, and PV. Its diagnostic accuracy is comparable with the conventional multi-step approach. The highly
Hierarchical models and iterative optimization of hybrid systems
NASA Astrophysics Data System (ADS)
Rasina, Irina V.; Baturina, Olga V.; Nasatueva, Soelma N.
2016-06-01
A class of hybrid control systems on the base of two-level discrete-continuous model is considered. The concept of this model was proposed and developed in preceding works as a concretization of the general multi-step system with related optimality conditions. A new iterative optimization procedure for such systems is developed on the base of localization of the global optimality conditions via contraction the control set.
Saethre, Eirik; Stadler, Jonathan
2013-03-01
As clinical trial research increasingly permeates sub-Saharan Africa, tales of purposeful HIV infection, blood theft, and other harmful outcomes are widely reported by participants and community members. Examining responses to the Microbicide Development Programme 301-a randomized, double-blind, placebo-controlled microbicide trial-we investigate the ways in which these accounts embed medical research within postcolonial contexts. We explore three popular narratives circulating around the Johannesburg trial site: malicious whites killing participants and selling their blood, greedy women enrolling in the trial solely for financial gain, and virtuous volunteers attempting to ensure their health and aid others through trial participation. We argue that trial participants and community members transform medical research into a meaningful tool that alternately affirms, debates, and challenges contemporary social relations. PMID:23674325
Zhu, Chuan; Zhang, Sai; Han, Guangjie; Jiang, Jinfang; Rodrigues, Joel J P C
2016-01-01
Mobile sink is widely used for data collection in wireless sensor networks. It can avoid 'hot spot' problems but energy consumption caused by multihop transmission is still inefficient in real-time application scenarios. In this paper, a greedy scanning data collection strategy (GSDCS) is proposed, and we focus on how to reduce routing energy consumption by shortening total length of routing paths. We propose that the mobile sink adjusts its trajectory dynamically according to the changes of network, instead of predetermined trajectory or random walk. Next, the mobile sink determines which area has more source nodes, then it moves toward this area. The benefit of GSDCS is that most source nodes are no longer needed to upload sensory data for long distances. Especially in event-driven application scenarios, when event area changes, the mobile sink could arrive at the new event area where most source nodes are located currently. Hence energy can be saved. Analytical and simulation results show that compared with existing work, our GSDCS has a better performance in specific application scenarios. PMID:27608022
A GREEDY METHOD FOR RECONSTRUCTING POLYCRYSTALS FROM THREE-DIMENSIONAL X-RAY DIFFRACTION DATA.
Kulshreshth, Arun K; Alpers, Andreas; Herman, Gabor T; Knudsen, Erik; Rodek, Lajos; Poulsen, Henning F
2009-02-01
An iterative search method is proposed for obtaining orientation maps inside polycrystals from three-dimensional X-ray diffraction (3DXRD) data. In each step, detector pixel intensities are calculated by a forward model based on the current estimate of the orientation map. The pixel at which the experimentally measured value most exceeds the simulated one is identified. This difference can only be reduced by changing the current estimate at a location from a relatively small subset of all possible locations in the estimate and, at each such location, an increase at the identified pixel can only be achieved by changing the orientation in only a few possible ways. The method selects the location/orientation pair indicated as best by a function that measures data consistency combined with prior information on orientation maps. The superiority of the method to a previously published forward projection Monte Carlo optimization is demonstrated on simulated data. PMID:20126520
Melnik, Eva; Bruck, Roman; Hainberger, Rainer; Lämmerhofer, Michael
2011-08-12
The process of surface functionalization involving silanization, biotinylation and streptavidin bonding as platform for biospecific ligand immobilization was optimized for thin film polyimide spin-coated silicon wafers, of which the polyimide film serves as a wave guiding layer in evanescent wave photonic biosensors. This type of optical sensors make great demands on the materials involved as well as on the layer properties, such as the optical quality, the layer thickness and the surface roughness. In this work we realized the binding of a 3-mercaptopropyl trimethoxysilane on an oxygen plasma activated polyimide surface followed by subsequent derivatization of the reactive thiol groups with maleimide-PEG(2)-biotin and immobilization of streptavidin. The progress of the functionalization was monitored by using different fluorescence labels for optimization of the chemical derivatization steps. Further, X-ray photoelectron spectroscopy and atomic force microscopy were utilized for the characterization of the modified surface. These established analytical methods allowed to derive information like chemical composition of the surface, surface coverage with immobilized streptavidin, as well as parameters of the surface roughness. The proposed functionalization protocol furnished a surface density of 144 fmol mm(-2) streptavidin with good reproducibility (13.9% RSD, n=10) and without inflicted damage to the surface. This surface modification was applied to polyimide based Mach-Zehnder interferometer sensors to realize a real-time measurement of streptavidin binding validating the functionality of the MZI biosensor. Subsequently, this streptavidin surface was employed to immobilize biotinylated single-stranded DNA and utilized for monitoring of selective DNA hybridization. These proved the usability of polyimide based evanescent photonic devices for biosensing application. PMID:21704776
Li, Cong; Li, Hui; Sun, Jin; Zhang, XinYue; Shi, Jinsong; Xu, Zhenghong
2016-08-01
Hydroxylation of dehydroepiandrosterone (DHEA) to 3β,7α,15α-trihydroxy-5-androstene-17-one (7α,15α-diOH-DHEA) by Colletotrichum lini ST-1 is an essential step in the synthesis of many steroidal drugs, while low DHEA concentration and 7α,15α-diOH-DHEA production are tough problems to be solved urgently in industry. In this study, the significant improvement of 7α,15α-diOH-DHEA yield in 5-L stirred fermenter with 15 g/L DHEA was achieved. To maintain a sufficient quantity of glucose for the bioconversion, glucose of 15 g/L was fed at 18 h, the 7α,15α-diOH-DHEA yield and dry cell weight were increased by 17.7 and 30.9 %, respectively. Moreover, multi-step DHEA addition strategy was established to diminish DHEA toxicity to C. lini, and the 7α,15α-diOH-DHEA yield raised to 53.0 %. Further, a novel strategy integrating glucose-feeding with multi-step addition of DHEA was carried out and the product yield increased to 66.6 %, which was the highest reported 7α,15α-diOH-DHEA production in 5-L stirred fermenter. Meanwhile, the conversion course was shortened to 44 h. This strategy would provide a possible way in enhancing the 7α,15α-diOH-DHEA yield in pharmaceutical industry. PMID:27094679
Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming
2016-01-01
Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971
Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming
2016-01-01
Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971
Combinatorial optimization methods for disassembly line balancing
NASA Astrophysics Data System (ADS)
McGovern, Seamus M.; Gupta, Surendra M.
2004-12-01
Disassembly takes place in remanufacturing, recycling, and disposal with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence which: minimizes workstations, ensures similar idle times, and is feasible. Finding the optimal balance is computationally intensive due to factorial growth. Combinatorial optimization methods hold promise for providing solutions to the disassembly line balancing problem, which is proven to belong to the class of NP-complete problems. Ant colony optimization, genetic algorithm, and H-K metaheuristics are presented and compared along with a greedy/hill-climbing heuristic hybrid. A numerical study is performed to illustrate the implementation and compare performance. Conclusions drawn include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the techniques, and their practicality due to ease of implementation.
Johnson, Gary E.; Khan, Fenton; Ploskey, Gene R.; Hughes, James S.; Fischer, Eric S.
2010-08-18
The goal of the study was to optimize performance of the fixed-location hydroacoustic systems at Lookout Point Dam (LOP) and the acoustic imaging system at Cougar Dam (CGR) by determining deployment and data acquisition methods that minimized structural, electrical, and acoustic interference. The general approach was a multi-step process from mount design to final system configuration. The optimization effort resulted in successful deployments of hydroacoustic equipment at LOP and CGR.
Multi-step contrast sensitivity gauge
Quintana, Enrico C; Thompson, Kyle R; Moore, David G; Heister, Jack D; Poland, Richard W; Ellegood, John P; Hodges, George K; Prindville, James E
2014-10-14
An X-ray contrast sensitivity gauge is described herein. The contrast sensitivity gauge comprises a plurality of steps of varying thicknesses. Each step in the gauge includes a plurality of recesses of differing depths, wherein the depths are a function of the thickness of their respective step. An X-ray image of the gauge is analyzed to determine a contrast-to-noise ratio of a detector employed to generate the image.
Smusz, Sabina; Mordalski, Stefan; Witek, Jagna; Rataj, Krzysztof; Kafel, Rafał; Bojarski, Andrzej J
2015-04-27
Molecular docking, despite its undeniable usefulness in computer-aided drug design protocols and the increasing sophistication of tools used in the prediction of ligand-protein interaction energies, is still connected with a problem of effective results analysis. In this study, a novel protocol for the automatic evaluation of numerous docking results is presented, being a combination of Structural Interaction Fingerprints and Spectrophores descriptors, machine-learning techniques, and multi-step results analysis. Such an approach takes into consideration the performance of a particular learning algorithm (five machine learning methods were applied), the performance of the docking algorithm itself, the variety of conformations returned from the docking experiment, and the receptor structure (homology models were constructed on five different templates). Evaluation using compounds active toward 5-HT6 and 5-HT7 receptors, as well as additional analysis carried out for beta-2 adrenergic receptor ligands, proved that the methodology is a viable tool for supporting virtual screening protocols, enabling proper discrimination between active and inactive compounds. PMID:25806997
Optimal interdiction of unreactive Markovian evaders
Hagberg, Aric; Pan, Feng; Gutfraind, Alex
2009-01-01
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdiction. the task of the interdictor is to find a set of edges in a weighted network such that the removal of those edges would increase the cost to an evader of traveling on a path through the network. Our work is motivated by cases in which the evader has incomplete information about the network or lacks planning time or computational power, e.g. when authorities set up roadblocks to catch bank robbers, the criminals do not know all the roadblock locations or the best path to use for their escape. We introduce a model of network interdiction in which the motion of one or more evaders is described by Markov processes on a network and the evaders are assumed not to react to interdiction decisions. The interdiction objective is to find a node or set. of size at most B, that maximizes the probability of capturing the evaders. We prove that similar to the classical formulation this interdiction problem is NP-hard. But unlike the classical problem our interdiction problem is submodular and the optimal solution can be approximated within 1-lie using a greedy algorithm. Additionally. we exploit submodularity to introduce a priority evaluation strategy that speeds up the greedy algorithm by orders of magnitude. Taken together the results bring closer the goal of finding realistic solutions to the interdiction problem on global-scale networks.
Extremal Optimization for p-Spin Models
NASA Astrophysics Data System (ADS)
Falkner, Stefan; Boettcher, Stefan
2012-02-01
It was shown recently that finding ground states in the 3-spin model on a 2d dimensional triangular lattice poses an NP-hard problem [1]. We use the extremal optimization (EO) heuristic [2] to explore ground state energies and finite-size scaling corrections [3]. EO predicts the thermodynamic ground state energy with high accuracy, based on the observation that finite size corrections appear to decay purely with system size. Just as found in 3-spin models on r-regular graphs, there are no noticeable anomalous corrections to these energies. Interestingly, the results are sufficiently accurate to detect alternating patters in the energies when the lattice size L is divisible by 6. Although ground states seem very prolific and might seem easy to obtain with simple greedy algorithms, our tests show significant improvement in the data with EO. [4pt] [1] PRE 83 (2011) 046709,[2] PRL 86 (2001) 5211,[3] S. Boettcher and S. Falkner (in preparation).
Approximating random quantum optimization problems
NASA Astrophysics Data System (ADS)
Hsu, B.; Laumann, C. R.; Läuchli, A. M.; Moessner, R.; Sondhi, S. L.
2013-06-01
We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem k-body quantum satisfiability (k-QSAT) on large random graphs. As an approximation strategy, we optimize the solution space over “classical” product states, which in turn introduces a novel autonomous classical optimization problem, PSAT, over a space of continuous degrees of freedom rather than discrete bits. Our central results are (i) the derivation of a set of bounds and approximations in various limits of the problem, several of which we believe may be amenable to a rigorous treatment; (ii) a demonstration that an approximation based on a greedy algorithm borrowed from the study of frustrated magnetism performs well over a wide range in parameter space, and its performance reflects the structure of the solution space of random k-QSAT. Simulated annealing exhibits metastability in similar “hard” regions of parameter space; and (iii) a generalization of belief propagation algorithms introduced for classical problems to the case of continuous spins. This yields both approximate solutions, as well as insights into the free energy “landscape” of the approximation problem, including a so-called dynamical transition near the satisfiability threshold. Taken together, these results allow us to elucidate the phase diagram of random k-QSAT in a two-dimensional energy-density-clause-density space.
Image-driven mesh optimization
Lindstrom, P; Turk, G
2001-01-05
We describe a method of improving the appearance of a low vertex count mesh in a manner that is guided by rendered images of the original, detailed mesh. This approach is motivated by the fact that greedy simplification methods often yield meshes that are poorer than what can be represented with a given number of vertices. Our approach relies on edge swaps and vertex teleports to alter the mesh connectivity, and uses the downhill simplex method to simultaneously improve vertex positions and surface attributes. Note that this is not a simplification method--the vertex count remains the same throughout the optimization. At all stages of the optimization the changes are guided by a metric that measures the differences between rendered versions of the original model and the low vertex count mesh. This method creates meshes that are geometrically faithful to the original model. Moreover, the method takes into account more subtle aspects of a model such as surface shading or whether cracks are visible between two interpenetrating parts of the model.
Methods for optimizing the structure alphabet sequences of proteins.
Dong, Qi-wen; Wang, Xiao-long; Lin, Lei
2007-11-01
Protein structure prediction based on fragment assemble has made great progress in recent years. Local protein structure prediction is receiving increased attention. One essential step of local protein structure prediction method is that the three-dimensional conformations must be compressed into one-dimensional series of letters of a structural alphabet. The traditional method assigns each structure fragment the structure alphabet that has the best local structure similarity. However, such locally optimal structure alphabet sequence does not guarantee to produce the globally optimal structure. This study presents two efficient methods trying to find the optimal structure alphabet sequence, which can model the native structures as accuracy as possible. First, a 28-letter structure alphabet is derived by clustering fragment in Cartesian space with fragment length of seven residues. The average quantization error of the 28 letters is 0.82 A in term of root mean square deviation. Then, two efficient methods are presented to encode the protein structures into series of structure alphabet letters, that is, the greedy and dynamic programming algorithm. They are tested on PDB database using the structure alphabet developed in Cartesian coordinates space (our structure alphabet) and in torsion angles space (the PB structure alphabet), respectively. The experimental results show that these two methods can find the approximately optimal structure alphabet sequences by searching a small fraction of the modeling space. The traditional local-optimization method achieves 26.27 A root mean square deviations between the reconstructed structures and the native one, while the modeling accuracy is improved to 3.28 A by the greedy algorithm. The results are helpful for local protein structure prediction. PMID:17493604
NASA Astrophysics Data System (ADS)
Brochero, D.; Anctil, F.; Gagné, C.
2012-04-01
In input selection (or feature selection), modellers are interested in identifying k of the d dimensions that provide the most information. In hydrology, this problem is particularly relevant when dealing with temporally and spatially distributed data such as radar rainfall estimates or meteorological ensemble forecasts. The most common approaches for input determination of artifitial neural networks (ANN) in water resources are cross-correlation, heuristics, embedding window analysis (chaos theory), and sensitivity analyses. We resorted here to Forward Greedy Selection (FGS), a sensitivity analysis, for identifying the inputs that maximize the performance of ANN forecasting. It consists of a pool of ANNs with different structures, initial weights, and training data subsets. The stacked ANN model was setup through the joint use of stop training and a special type of boosting for regression known as AdaBoost.RT. Several ANN are then used in series, each one exploiting, with incremental probability, data with relative estimation error higher than a pre-set threshold value. The global estimate is then obtained from the aggregation of the estimates of the models (here the median value). Two schemes are compared here, which differ in their input type. The first scheme looks at lagged radar rainfall estimates averaged over entire catchment (the average scenario), while the second scheme deals with the spatial variation fields of the radar rainfall estimates (the distributed scenario). Results lead to three major findings. First, stacked ANN response outperforms the best single ANN (in the same way as many others reports). Second, a positive gain in the test subset of around 20%, when compared to the average scenario, is observed in the distributed scenario. However, the most important result from the selecting process is the final structure of the inputs, for the distributed scenario clearly outlines the areas with the greatest impact on forecasting in terms of the
Optimal transport on supply-demand networks
NASA Astrophysics Data System (ADS)
Chen, Yu-Han; Wang, Bing-Hong; Zhao, Li-Chao; Zhou, Changsong; Zhou, Tao
2010-06-01
In the literature, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grids and supply chain networks, show a far different scenario in which nodes are classified into two categories: supply nodes provide some kinds of services, while demand nodes require them. In this paper, we propose a general transport model for these supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogeneous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the near optimal configuration of supply nodes, which remarkably enhances the transport capacity compared with a random configuration and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.
Improving IMRT-plan quality with MLC leaf position refinement post plan optimization
Niu, Ying; Zhang, Guowei; Berman, Barry L.; Parke, William C.; Yi, Byongyong; Yu, Cedric X.
2012-01-01
Purpose: In intensity-modulated radiation therapy (IMRT) planning, reducing the pencil-beam size may lead to a significant improvement in dose conformity, but also increase the time needed for the dose calculation and plan optimization. The authors develop and evaluate a postoptimization refinement (POpR) method, which makes fine adjustments to the multileaf collimator (MLC) leaf positions after plan optimization, enhancing the spatial precision and improving the plan quality without a significant impact on the computational burden. Methods: The authors’ POpR method is implemented using a commercial treatment planning system based on direct aperture optimization. After an IMRT plan is optimized using pencil beams with regular pencil-beam step size, a greedy search is conducted by looping through all of the involved MLC leaves to see if moving the MLC leaf in or out by half of a pencil-beam step size will improve the objective function value. The half-sized pencil beams, which are used for updating dose distribution in the greedy search, are derived from the existing full-sized pencil beams without need for further pencil-beam dose calculations. A benchmark phantom case and a head-and-neck (HN) case are studied for testing the authors’ POpR method. Results: Using a benchmark phantom and a HN case, the authors have verified that their POpR method can be an efficient technique in the IMRT planning process. Effectiveness of POpR is confirmed by noting significant improvements in objective function values. Dosimetric benefits of POpR are comparable to those of using a finer pencil-beam size from the optimization start, but with far less computation and time. Conclusions: The POpR is a feasible and practical method to significantly improve IMRT-plan quality without compromising the planning efficiency. PMID:22894437
An Automated, Multi-Step Monte Carlo Burnup Code System.
2003-07-14
Version 02 MONTEBURNS Version 2 calculates coupled neutronic/isotopic results for nuclear systems and produces a large number of criticality and burnup results based on various material feed/removal specifications, power(s), and time intervals. MONTEBURNS is a fully automated tool that links the LANL MCNP Monte Carlo transport code with a radioactive decay and burnup code. Highlights on changes to Version 2 are listed in the transmittal letter. Along with other minor improvements in MONTEBURNS Version 2,more » the option was added to use CINDER90 instead of ORIGEN2 as the depletion/decay part of the system. CINDER90 is a multi-group depletion code developed at LANL and is not currently available from RSICC. This MONTEBURNS release was tested with various combinations of CCC-715/MCNPX 2.4.0, CCC-710/MCNP5, CCC-700/MCNP4C, CCC-371/ORIGEN2.2, ORIGEN2.1 and CINDER90. Perl is required software and is not included in this distribution. MCNP, ORIGEN2, and CINDER90 are not included.« less
48 CFR 15.202 - Advisory multi-step process.
Code of Federal Regulations, 2010 CFR
2010-10-01
... offerors to submit information that allows the Government to advise the offerors about their potential to... concept, past performance, and limited pricing information). At a minimum, the notice shall contain..., notwithstanding the advice provided by the Government in response to their submissions, they may participate...
Information processing in multi-step signaling pathways
NASA Astrophysics Data System (ADS)
Ganesan, Ambhi; Hamidzadeh, Archer; Zhang, Jin; Levchenko, Andre
Information processing in complex signaling networks is limited by a high degree of variability in the abundance and activity of biochemical reactions (biological noise) operating in living cells. In this context, it is particularly surprising that many signaling pathways found in eukaryotic cells are composed of long chains of biochemical reactions, which are expected to be subject to accumulating noise and delayed signal processing. Here, we challenge the notion that signaling pathways are insulated chains, and rather view them as parts of extensively branched networks, which can benefit from a low degree of interference between signaling components. We further establish conditions under which this pathway organization would limit noise accumulation, and provide evidence for this type of signal processing in an experimental model of a calcium-activated MAPK cascade. These results address the long-standing problem of diverse organization and structure of signaling networks in live cells.
A variable multi-step method for transient heat conduction
NASA Technical Reports Server (NTRS)
Smolinski, Patrick
1991-01-01
A variable explicit time integration algorithm is developed for unsteady diffusion problems. The algorithm uses nodal partitioning and allows the nodal groups to be updated with different time steps. The stability of the algorithm is analyzed using energy methods and critical time steps are found in terms of element eigenvalues with no restrictions on element types. Several numerical examples are given to illustrate the accuracy of the method.
Multi-step heater deployment in a subsurface formation
Mason, Stanley Leroy
2012-04-03
A method for installing a horizontal or inclined subsurface heater includes placing a heating section of a heater in a horizontal or inclined section of a wellbore with an installation tool. The tool is uncoupled from the heating section. A lead in section is mechanically and electrically coupled to the heating section of the heater. The lead-in section is located in an angled or vertical section of the wellbore.
An Automated, Multi-Step Monte Carlo Burnup Code System.
TRELLUE, HOLLY R.
2003-07-14
Version 02 MONTEBURNS Version 2 calculates coupled neutronic/isotopic results for nuclear systems and produces a large number of criticality and burnup results based on various material feed/removal specifications, power(s), and time intervals. MONTEBURNS is a fully automated tool that links the LANL MCNP Monte Carlo transport code with a radioactive decay and burnup code. Highlights on changes to Version 2 are listed in the transmittal letter. Along with other minor improvements in MONTEBURNS Version 2, the option was added to use CINDER90 instead of ORIGEN2 as the depletion/decay part of the system. CINDER90 is a multi-group depletion code developed at LANL and is not currently available from RSICC. This MONTEBURNS release was tested with various combinations of CCC-715/MCNPX 2.4.0, CCC-710/MCNP5, CCC-700/MCNP4C, CCC-371/ORIGEN2.2, ORIGEN2.1 and CINDER90. Perl is required software and is not included in this distribution. MCNP, ORIGEN2, and CINDER90 are not included.
Peloid Mud: a multi-step maturation analysis
NASA Astrophysics Data System (ADS)
Redolfi, M.
2013-12-01
The aim of this work is understanding the process involved in the maturation of artificial peloid mud commonly use in thermal spa. I prepare a standard protocol for analysis: XRD, chemical, heat capacity and heavy metal sequential extraction . I also prepare 12 artificial peloid mud following the procedure describe in Veniale et al. (2004) mixing natural thermal waters form the Lazio region with a common clay also collected in Lazio Region with a ration of 1:1 in weight and put this mud in a sealed box at 40 °C for all the maturation process without remixing. Each peloid mud was sampled at one, three and six month of maturation, dried at 60 °C degree and milled for analysis. Each mud was compared with the result at one, three and six month to identify the major different of parameters at different time of maturation.
A global optimization paradigm based on change of measures.
Sarkar, Saikat; Roy, Debasish; Vasu, Ram Mohan
2015-07-01
A global optimization framework, COMBEO (Change Of Measure Based Evolutionary Optimization), is proposed. An important aspect in the development is a set of derivative-free additive directional terms, obtainable through a change of measures en route to the imposition of any stipulated conditions aimed at driving the realized design variables (particles) to the global optimum. The generalized setting offered by the new approach also enables several basic ideas, used with other global search methods such as the particle swarm or the differential evolution, to be rationally incorporated in the proposed set-up via a change of measures. The global search may be further aided by imparting to the directional update terms additional layers of random perturbations such as 'scrambling' and 'selection'. Depending on the precise choice of the optimality conditions and the extent of random perturbation, the search can be readily rendered either greedy or more exploratory. As numerically demonstrated, the new proposal appears to provide for a more rational, more accurate and, in some cases, a faster alternative to many available evolutionary optimization schemes. PMID:26587268
A global optimization paradigm based on change of measures
Sarkar, Saikat; Roy, Debasish; Vasu, Ram Mohan
2015-01-01
A global optimization framework, COMBEO (Change Of Measure Based Evolutionary Optimization), is proposed. An important aspect in the development is a set of derivative-free additive directional terms, obtainable through a change of measures en route to the imposition of any stipulated conditions aimed at driving the realized design variables (particles) to the global optimum. The generalized setting offered by the new approach also enables several basic ideas, used with other global search methods such as the particle swarm or the differential evolution, to be rationally incorporated in the proposed set-up via a change of measures. The global search may be further aided by imparting to the directional update terms additional layers of random perturbations such as ‘scrambling’ and ‘selection’. Depending on the precise choice of the optimality conditions and the extent of random perturbation, the search can be readily rendered either greedy or more exploratory. As numerically demonstrated, the new proposal appears to provide for a more rational, more accurate and, in some cases, a faster alternative to many available evolutionary optimization schemes. PMID:26587268
Optimal stimulus scheduling for active estimation of evoked brain networks
NASA Astrophysics Data System (ADS)
Kafashan, MohammadMehdi; Ching, ShiNung
2015-12-01
Objective. We consider the problem of optimal probing to learn connections in an evoked dynamic network. Such a network, in which each edge measures an input-output relationship between sites in sensor/actuator-space, is relevant to emerging applications in neural mapping and neural connectivity estimation. Approach. We show that the problem of scheduling nodes to a probe (i.e., stimulate) amounts to a problem of optimal sensor scheduling. Main results. By formulating the evoked network in state-space, we show that the solution to the greedy probing strategy has a convenient form and, under certain conditions, is optimal over a finite horizon. We adopt an expectation maximization technique to update the state-space parameters in an online fashion and demonstrate the efficacy of the overall approach in a series of detailed numerical examples. Significance. The proposed method provides a principled means to actively probe time-varying connections in neuronal networks. The overall method can be implemented in real time and is particularly well-suited to applications in stimulation-based cortical mapping in which the underlying network dynamics are changing over time.
Optimizing spread dynamics on graphs by message passing
NASA Astrophysics Data System (ADS)
Altarelli, F.; Braunstein, A.; Dall'Asta, L.; Zecchina, R.
2013-09-01
Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully applied to describe cascades in a large variety of contexts. Over the past decades, much effort has been devoted to understanding the typical behavior of the cascades arising from initial conditions extracted at random from some given ensemble. However, the problem of optimizing the trajectory of the system, i.e. of identifying appropriate initial conditions to maximize (or minimize) the final number of active nodes, is still considered to be practically intractable, with the only exception being models that satisfy a sort of diminishing returns property called submodularity. Submodular models can be approximately solved by means of greedy strategies, but by definition they lack cooperative characteristics which are fundamental in many real systems. Here we introduce an efficient algorithm based on statistical physics for the optimization of trajectories in cascade processes on graphs. We show that for a wide class of irreversible dynamics, even in the absence of submodularity, the spread optimization problem can be solved efficiently on large networks. Analytic and algorithmic results on random graphs are complemented by the solution of the spread maximization problem on a real-world network (the Epinions consumer reviews network).
NASA Astrophysics Data System (ADS)
Guthier, C. V.; Aschenbrenner, K. P.; Müller, R.; Polster, L.; Cormack, R. A.; Hesser, J. W.
2016-08-01
This paper demonstrates that optimization strategies derived from the field of compressed sensing (CS) improve computational performance in inverse treatment planning (ITP) for high-dose-rate (HDR) brachytherapy. Following an approach applied to low-dose-rate brachytherapy, we developed a reformulation of the ITP problem with the same mathematical structure as standard CS problems. Two greedy methods, derived from hard thresholding and subspace pursuit are presented and their performance is compared to state-of-the-art ITP solvers. Applied to clinical prostate brachytherapy plans speed-up by a factor of 56–350 compared to state-of-the-art methods. Based on a Wilcoxon signed rank-test the novel method statistically significantly decreases the final objective function value (p < 0.01). The optimization times were below one second and thus planing can be considered as real-time capable. The novel CS inspired strategy enables real-time ITP for HDR brachytherapy including catheter optimization. The generated plans are either clinically equivalent or show a better performance with respect to dosimetric measures.
Guthier, C V; Aschenbrenner, K P; Müller, R; Polster, L; Cormack, R A; Hesser, J W
2016-08-21
This paper demonstrates that optimization strategies derived from the field of compressed sensing (CS) improve computational performance in inverse treatment planning (ITP) for high-dose-rate (HDR) brachytherapy. Following an approach applied to low-dose-rate brachytherapy, we developed a reformulation of the ITP problem with the same mathematical structure as standard CS problems. Two greedy methods, derived from hard thresholding and subspace pursuit are presented and their performance is compared to state-of-the-art ITP solvers. Applied to clinical prostate brachytherapy plans speed-up by a factor of 56-350 compared to state-of-the-art methods. Based on a Wilcoxon signed rank-test the novel method statistically significantly decreases the final objective function value (p < 0.01). The optimization times were below one second and thus planing can be considered as real-time capable. The novel CS inspired strategy enables real-time ITP for HDR brachytherapy including catheter optimization. The generated plans are either clinically equivalent or show a better performance with respect to dosimetric measures. PMID:27435044
MEC--a near-optimal online reinforcement learning algorithm for continuous deterministic systems.
Zhao, Dongbin; Zhu, Yuanheng
2015-02-01
In this paper, the first probably approximately correct (PAC) algorithm for continuous deterministic systems without relying on any system dynamics is proposed. It combines the state aggregation technique and the efficient exploration principle, and makes high utilization of online observed samples. We use a grid to partition the continuous state space into different cells to save samples. A near-upper Q operator is defined to produce a near-upper Q function using samples in each cell. The corresponding greedy policy effectively balances between exploration and exploitation. With the rigorous analysis, we prove that there is a polynomial time bound of executing nonoptimal actions in our algorithm. After finite steps, the final policy reaches near optimal in the framework of PAC. The implementation requires no knowledge of systems and has less computation complexity. Simulation studies confirm that it is a better performance than other similar PAC algorithms. PMID:25474812
A nested partitions framework for beam angle optimization in intensity-modulated radiation therapy.
D'Souza, Warren D; Zhang, Hao H; Nazareth, Daryl P; Shi, Leyuan; Meyer, Robert R
2008-06-21
Coupling beam angle optimization with dose optimization in intensity-modulated radiation therapy (IMRT) increases the size and complexity of an already large-scale combinatorial optimization problem. We have developed a novel algorithm, nested partitions (NP), that is capable of finding suitable beam angle sets by guiding the dose optimization process. NP is a metaheuristic that is flexible enough to guide the search of a heuristic or deterministic dose optimization algorithm. The NP method adaptively samples from the entire feasible region, or search space, and coordinates the sampling effort with a systematic partitioning of the feasible region at successive iterations, concentrating the search in promising subsets. We used a 'warm-start' approach by initiating NP with beam angle samples derived from an integer programming (IP) model. In this study, we describe our implementation of the NP framework with a commercial optimization algorithm. We compared the NP framework with equi-spaced beam angle selection, the IP method, greedy heuristic and random sampling heuristic methods. The results of the NP approach were evaluated using two clinical cases (head and neck and whole pelvis) involving the primary tumor and nodal volumes. Our results show that NP produces better quality solutions than the alternative considered methods. PMID:18523351
A nested partitions framework for beam angle optimization in intensity-modulated radiation therapy
NASA Astrophysics Data System (ADS)
D'Souza, Warren D.; Zhang, Hao H.; Nazareth, Daryl P.; Shi, Leyuan; Meyer, Robert R.
2008-06-01
Coupling beam angle optimization with dose optimization in intensity-modulated radiation therapy (IMRT) increases the size and complexity of an already large-scale combinatorial optimization problem. We have developed a novel algorithm, nested partitions (NP), that is capable of finding suitable beam angle sets by guiding the dose optimization process. NP is a metaheuristic that is flexible enough to guide the search of a heuristic or deterministic dose optimization algorithm. The NP method adaptively samples from the entire feasible region, or search space, and coordinates the sampling effort with a systematic partitioning of the feasible region at successive iterations, concentrating the search in promising subsets. We used a 'warm-start' approach by initiating NP with beam angle samples derived from an integer programming (IP) model. In this study, we describe our implementation of the NP framework with a commercial optimization algorithm. We compared the NP framework with equi-spaced beam angle selection, the IP method, greedy heuristic and random sampling heuristic methods. The results of the NP approach were evaluated using two clinical cases (head and neck and whole pelvis) involving the primary tumor and nodal volumes. Our results show that NP produces better quality solutions than the alternative considered methods.
NASA Technical Reports Server (NTRS)
Laird, Philip
1992-01-01
We distinguish static and dynamic optimization of programs: whereas static optimization modifies a program before runtime and is based only on its syntactical structure, dynamic optimization is based on the statistical properties of the input source and examples of program execution. Explanation-based generalization is a commonly used dynamic optimization method, but its effectiveness as a speedup-learning method is limited, in part because it fails to separate the learning process from the program transformation process. This paper describes a dynamic optimization technique called a learn-optimize cycle that first uses a learning element to uncover predictable patterns in the program execution and then uses an optimization algorithm to map these patterns into beneficial transformations. The technique has been used successfully for dynamic optimization of pure Prolog.
NASA Astrophysics Data System (ADS)
Shaltev, M.
2016-02-01
The search for continuous gravitational waves in a wide parameter space at a fixed computing cost is most efficiently done with semicoherent methods, e.g., StackSlide, due to the prohibitive computing cost of the fully coherent search strategies. Prix and Shaltev [Phys. Rev. D 85, 084010 (2012)] have developed a semianalytic method for finding optimal StackSlide parameters at a fixed computing cost under ideal data conditions, i.e., gapless data and a constant noise floor. In this work, we consider more realistic conditions by allowing for gaps in the data and changes in the noise level. We show how the sensitivity optimization can be decoupled from the data selection problem. To find optimal semicoherent search parameters, we apply a numerical optimization using as an example the semicoherent StackSlide search. We also describe three different data selection algorithms. Thus, the outcome of the numerical optimization consists of the optimal search parameters and the selected data set. We first test the numerical optimization procedure under ideal conditions and show that we can reproduce the results of the analytical method. Then we gradually relax the conditions on the data and find that a compact data selection algorithm yields higher sensitivity compared to a greedy data selection procedure.
Guo, Chengan; Yang, Qingshan
2015-07-01
Finding the optimal solution to the constrained l0 -norm minimization problems in the recovery of compressive sensed signals is an NP-hard problem and it usually requires intractable combinatorial searching operations for getting the global optimal solution, unless using other objective functions (e.g., the l1 norm or lp norm) for approximate solutions or using greedy search methods for locally optimal solutions (e.g., the orthogonal matching pursuit type algorithms). In this paper, a neurodynamic optimization method is proposed to solve the l0 -norm minimization problems for obtaining the global optimum using a recurrent neural network (RNN) model. For the RNN model, a group of modified Gaussian functions are constructed and their sum is taken as the objective function for approximating the l0 norm and for optimization. The constructed objective function sets up a convexity condition under which the neurodynamic system is guaranteed to obtain the globally convergent optimal solution. An adaptive adjustment scheme is developed for improving the performance of the optimization algorithm further. Extensive experiments are conducted to test the proposed approach in this paper and the output results validate the effectiveness of the new method. PMID:25122603
Hoffmann, Thomas J.; Zhan, Yiping; Kvale, Mark N.; Hesselson, Stephanie E.; Gollub, Jeremy; Iribarren, Carlos; Lu, Yontao; Mei, Gangwu; Purdy, Matthew M.; Quesenberry, Charles; Rowell, Sarah; Shapero, Michael H.; Smethurst, David; Somkin, Carol P.; Van den Eeden, Stephen K.; Walter, Larry; Webster, Teresa; Whitmer, Rachel A.; Finn, Andrea; Schaefer, Catherine; Kwok, Pui-Yan; Risch, Neil
2012-01-01
Four custom Axiom genotyping arrays were designed for a genome-wide association (GWA) study of 100,000 participants from the Kaiser Permanente Research Program on Genes, Environment and Health. The array optimized for individuals of European race/ethnicity was previously described. Here we detail the development of three additional microarrays optimized for individuals of East Asian, African American, and Latino race/ethnicity. For these arrays, we decreased redundancy of high-performing SNPs to increase SNP capacity. The East Asian array was designed using greedy pairwise SNP selection. However, removing SNPs from the target set based on imputation coverage is more efficient than pairwise tagging. Therefore, we developed a novel hybrid SNP selection method for the African American and Latino arrays utilizing rounds of greedy pairwise SNP selection, followed by removal from the target set of SNPs covered by imputation. The arrays provide excellent genome-wide coverage and are valuable additions for large-scale GWA studies. PMID:21903159
NASA Astrophysics Data System (ADS)
Bai, Peng; Jeon, Mi Young; Ren, Limin; Knight, Chris; Deem, Michael W.; Tsapatsis, Michael; Siepmann, J. Ilja
2015-01-01
Zeolites play numerous important roles in modern petroleum refineries and have the potential to advance the production of fuels and chemical feedstocks from renewable resources. The performance of a zeolite as separation medium and catalyst depends on its framework structure. To date, 213 framework types have been synthesized and >330,000 thermodynamically accessible zeolite structures have been predicted. Hence, identification of optimal zeolites for a given application from the large pool of candidate structures is attractive for accelerating the pace of materials discovery. Here we identify, through a large-scale, multi-step computational screening process, promising zeolite structures for two energy-related applications: the purification of ethanol from fermentation broths and the hydroisomerization of alkanes with 18-30 carbon atoms encountered in petroleum refining. These results demonstrate that predictive modelling and data-driven science can now be applied to solve some of the most challenging separation problems involving highly non-ideal mixtures and highly articulated compounds.
Inversion and fast optimization using computational intelligence with applications to geoacoustics
NASA Astrophysics Data System (ADS)
Thompson, Benjamin Berry
With a sufficiently complex underwater acoustic model, one may produce an arbitrarily accurate reconstruction of acoustic energy propagation in any specified underwater environment. Problems arise, however, when these acoustic emulations are required in a timely manner. When many realizations of the acoustic model are required over a short period of time, model complexity prohibits any kind of fast execution of such an algorithm. Two approaches may be applied to increasing the speed of any such iterative technique: first, one may attempt to simplify or speed up the model. Second, one may attempt to reduce the number of times the complex model must be executed. In this dissertation, we take both approaches for two distinct, unsolved problems in the area of geoacoustics: inversion of acoustic models for bottom parameter acquisition, and sonobuoy placement for optimal sonar coverage of a desired area, and we will see both may be phrased as optimization problems. The primary focus of this paper, however, is specifically on the use of computational intelligence to increase the execution time of these optimization algorithms, including a very remarkable greedy algorithm for the placement of sonobuoys, which executes in time orders of magnitude lower than with direct optimization techniques.
Extraction of Optimal Spectral Bands Using Hierarchical Band Merging Out of Hyperspectral Data
NASA Astrophysics Data System (ADS)
Le Bris, A.; Chehata, N.; Briottet, X.; Paparoditis, N.
2015-08-01
Spectral optimization consists in identifying the most relevant band subset for a specific application. It is a way to reduce hyperspectral data huge dimensionality and can be applied to design specific superspectral sensors dedicated to specific land cover applications. Spectral optimization includes both band selection and band extraction. On the one hand, band selection aims at selecting an optimal band subset (according to a relevance criterion) among the bands of a hyperspectral data set, using automatic feature selection algorithms. On the other hand, band extraction defines the most relevant spectral bands optimizing both their position along the spectrum and their width. The approach presented in this paper first builds a hierarchy of groups of adjacent bands, according to a relevance criterion to decide which adjacent bands must be merged. Then, band selection is performed at the different levels of this hierarchy. Two approaches were proposed to achieve this task : a greedy one and a new adaptation of an incremental feature selection algorithm to this hierarchy of merged bands.
NASA Astrophysics Data System (ADS)
Vecherin, Sergey N.; Wilson, D. Keith; Pettit, Chris L.
2010-04-01
Determination of an optimal configuration (numbers, types, and locations) of a sensor network is an important practical problem. In most applications, complex signal propagation effects and inhomogeneous coverage preferences lead to an optimal solution that is highly irregular and nonintuitive. The general optimization problem can be strictly formulated as a binary linear programming problem. Due to the combinatorial nature of this problem, however, its strict solution requires significant computational resources (NP-complete class of complexity) and is unobtainable for large spatial grids of candidate sensor locations. For this reason, a greedy algorithm for approximate solution was recently introduced [S. N. Vecherin, D. K. Wilson, and C. L. Pettit, "Optimal sensor placement with terrain-based constraints and signal propagation effects," Unattended Ground, Sea, and Air Sensor Technologies and Applications XI, SPIE Proc. Vol. 7333, paper 73330S (2009)]. Here further extensions to the developed algorithm are presented to include such practical needs and constraints as sensor availability, coverage by multiple sensors, and wireless communication of the sensor information. Both communication and detection are considered in a probabilistic framework. Communication signal and signature propagation effects are taken into account when calculating probabilities of communication and detection. Comparison of approximate and strict solutions on reduced-size problems suggests that the approximate algorithm yields quick and good solutions, which thus justifies using that algorithm for full-size problems. Examples of three-dimensional outdoor sensor placement are provided using a terrain-based software analysis tool.
General optimization technique for high-quality community detection in complex networks
NASA Astrophysics Data System (ADS)
Sobolevsky, Stanislav; Campari, Riccardo; Belyi, Alexander; Ratti, Carlo
2014-07-01
Recent years have witnessed the development of a large body of algorithms for community detection in complex networks. Most of them are based upon the optimization of objective functions, among which modularity is the most common, though a number of alternatives have been suggested in the scientific literature. We present here an effective general search strategy for the optimization of various objective functions for community detection purposes. When applied to modularity, on both real-world and synthetic networks, our search strategy substantially outperforms the best existing algorithms in terms of final scores of the objective function. In terms of execution time for modularity optimization this approach also outperforms most of the alternatives present in literature with the exception of fastest but usually less efficient greedy algorithms. The networks of up to 30000 nodes can be analyzed in time spans ranging from minutes to a few hours on average workstations, making our approach readily applicable to tasks not limited by strict time constraints but requiring the quality of partitioning to be as high as possible. Some examples are presented in order to demonstrate how this quality could be affected by even relatively small changes in the modularity score stressing the importance of optimization accuracy.
Carver, Charles S.; Scheier, Michael F.
2014-01-01
Optimism is a cognitive construct (expectancies regarding future outcomes) that also relates to motivation: optimistic people exert effort, whereas pessimistic people disengage from effort. Study of optimism began largely in health contexts, finding positive associations between optimism and markers of better psychological and physical health. Physical health effects likely occur through differences in both health-promoting behaviors and physiological concomitants of coping. Recently, the scientific study of optimism has extended to the realm of social relations: new evidence indicates that optimists have better social connections, partly because they work harder at them. In this review, we examine the myriad ways this trait can benefit an individual, and our current understanding of the biological basis of optimism. PMID:24630971
Large-scale optimal sensor array management for target tracking
NASA Astrophysics Data System (ADS)
Tharmarasa, Ratnasingham; Kirubarajan, Thiagalingam; Hernandez, Marcel L.
2004-01-01
Large-scale sensor array management has applications in a number of target tracking problems. For example, in ground target tracking, hundreds or even thousands of unattended ground sensors (UGS) may be dropped over a large surveillance area. At any one time it may then only be possible to utilize a very small number of the available sensors at the fusion center because of bandwidth limitations. A similar situation may arise in tracking sea surface or underwater targets using a large number of sonobuoys. The general problem is then to select a subset of the available sensors in order to optimize tracking performance. The Posterior Cramer-Rao Lower Bound (PCRLB), which quantifies the obtainable accuracy of target state estimation, is used as the basis for network management. In a practical scenario with even hundreds of sensors, the number of possible sensor combinations would make it impossible to enumerate all possibilities in real-time. Efficient local (or greedy) search techniques must then be used to make the computational load manageable. In this paper we introduce an efficient search strategy for selecting a subset of the sensor array for use during each sensor change interval in multi-target tracking. Simulation results illustrating the performance of the sensor array manager are also presented.
Large-scale optimal sensor array management for target tracking
NASA Astrophysics Data System (ADS)
Tharmarasa, Ratnasingham; Kirubarajan, Thiagalingam; Hernandez, Marcel L.
2003-12-01
Large-scale sensor array management has applications in a number of target tracking problems. For example, in ground target tracking, hundreds or even thousands of unattended ground sensors (UGS) may be dropped over a large surveillance area. At any one time it may then only be possible to utilize a very small number of the available sensors at the fusion center because of bandwidth limitations. A similar situation may arise in tracking sea surface or underwater targets using a large number of sonobuoys. The general problem is then to select a subset of the available sensors in order to optimize tracking performance. The Posterior Cramer-Rao Lower Bound (PCRLB), which quantifies the obtainable accuracy of target state estimation, is used as the basis for network management. In a practical scenario with even hundreds of sensors, the number of possible sensor combinations would make it impossible to enumerate all possibilities in real-time. Efficient local (or greedy) search techniques must then be used to make the computational load manageable. In this paper we introduce an efficient search strategy for selecting a subset of the sensor array for use during each sensor change interval in multi-target tracking. Simulation results illustrating the performance of the sensor array manager are also presented.
Selecting training inputs via greedy rank covering
Buchsbaum, A.L.; Santen, J.P.H. van
1996-12-31
We present a general method for selecting a small set of training inputs, the observations of which will suffice to estimate the parameters of a given linear model. We exemplify the algorithm in terms of predicting segmental duration of phonetic-segment feature vectors in a text-to-speech synthesizer, but the algorithm will work for any linear model and its associated domain.
NASA Technical Reports Server (NTRS)
Macready, William; Wolpert, David
2005-01-01
We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.
Practical optimization of Steiner trees via the cavity method
NASA Astrophysics Data System (ADS)
Braunstein, Alfredo; Muntoni, Anna
2016-07-01
The optimization version of the cavity method for single instances, called Max-Sum, has been applied in the past to the minimum Steiner tree problem on graphs and variants. Max-Sum has been shown experimentally to give asymptotically optimal results on certain types of weighted random graphs, and to give good solutions in short computation times for some types of real networks. However, the hypotheses behind the formulation and the cavity method itself limit substantially the class of instances on which the approach gives good results (or even converges). Moreover, in the standard model formulation, the diameter of the tree solution is limited by a predefined bound, that affects both computation time and convergence properties. In this work we describe two main enhancements to the Max-Sum equations to be able to cope with optimization of real-world instances. First, we develop an alternative ‘flat’ model formulation that allows the relevant configuration space to be reduced substantially, making the approach feasible on instances with large solution diameter, in particular when the number of terminal nodes is small. Second, we propose an integration between Max-Sum and three greedy heuristics. This integration allows Max-Sum to be transformed into a highly competitive self-contained algorithm, in which a feasible solution is given at each step of the iterative procedure. Part of this development participated in the 2014 DIMACS Challenge on Steiner problems, and we report the results here. The performance on the challenge of the proposed approach was highly satisfactory: it maintained a small gap to the best bound in most cases, and obtained the best results on several instances in two different categories. We also present several improvements with respect to the version of the algorithm that participated in the competition, including new best solutions for some of the instances of the challenge.
Wen-Chiao Lin; Humberto E. Garcia; Tae-Sic Yoo
2011-06-01
Diagnosers for keeping track on the occurrences of special events in the framework of unreliable partially observed discrete-event dynamical systems were developed in previous work. This paper considers observation platforms consisting of sensors that provide partial and unreliable observations and of diagnosers that analyze them. Diagnosers in observation platforms typically perform better as sensors providing the observations become more costly or increase in number. This paper proposes a methodology for finding an observation platform that achieves an optimal balance between cost and performance, while satisfying given observability requirements and constraints. Since this problem is generally computational hard in the framework considered, an observation platform optimization algorithm is utilized that uses two greedy heuristics, one myopic and another based on projected performances. These heuristics are sequentially executed in order to find best observation platforms. The developed algorithm is then applied to an observation platform optimization problem for a multi-unit-operation system. Results show that improved observation platforms can be found that may significantly reduce the observation platform cost but still yield acceptable performance for correctly inferring the occurrences of special events.
A Globally Optimal Particle Tracking Technique for Stereo Imaging Velocimetry Experiments
NASA Technical Reports Server (NTRS)
McDowell, Mark
2008-01-01
An important phase of any Stereo Imaging Velocimetry experiment is particle tracking. Particle tracking seeks to identify and characterize the motion of individual particles entrained in a fluid or air experiment. We analyze a cylindrical chamber filled with water and seeded with density-matched particles. In every four-frame sequence, we identify a particle track by assigning a unique track label for each camera image. The conventional approach to particle tracking is to use an exhaustive tree-search method utilizing greedy algorithms to reduce search times. However, these types of algorithms are not optimal due to a cascade effect of incorrect decisions upon adjacent tracks. We examine the use of a guided evolutionary neural net with simulated annealing to arrive at a globally optimal assignment of tracks. The net is guided both by the minimization of the search space through the use of prior limiting assumptions about valid tracks and by a strategy which seeks to avoid high-energy intermediate states which can trap the net in a local minimum. A stochastic search algorithm is used in place of back-propagation of error to further reduce the chance of being trapped in an energy well. Global optimization is achieved by minimizing an objective function, which includes both track smoothness and particle-image utilization parameters. In this paper we describe our model and present our experimental results. We compare our results with a nonoptimizing, predictive tracker and obtain an average increase in valid track yield of 27 percent
Sejnowski, Terrence J.; Poizner, Howard; Lynch, Gary; Gepshtein, Sergei; Greenspan, Ralph J.
2014-01-01
Human performance approaches that of an ideal observer and optimal actor in some perceptual and motor tasks. These optimal abilities depend on the capacity of the cerebral cortex to store an immense amount of information and to flexibly make rapid decisions. However, behavior only approaches these limits after a long period of learning while the cerebral cortex interacts with the basal ganglia, an ancient part of the vertebrate brain that is responsible for learning sequences of actions directed toward achieving goals. Progress has been made in understanding the algorithms used by the brain during reinforcement learning, which is an online approximation of dynamic programming. Humans also make plans that depend on past experience by simulating different scenarios, which is called prospective optimization. The same brain structures in the cortex and basal ganglia that are active online during optimal behavior are also active offline during prospective optimization. The emergence of general principles and algorithms for goal-directed behavior has consequences for the development of autonomous devices in engineering applications. PMID:25328167
Lee, John R.
1975-01-01
Optimal fluoridation has been defined as that fluoride exposure which confers maximal cariostasis with minimal toxicity and its values have been previously determined to be 0.5 to 1 mg per day for infants and 1 to 1.5 mg per day for an average child. Total fluoride ingestion and urine excretion were studied in Marin County, California, children in 1973 before municipal water fluoridation. Results showed fluoride exposure to be higher than anticipated and fulfilled previously accepted criteria for optimal fluoridation. Present and future water fluoridation plans need to be reevaluated in light of total environmental fluoride exposure. PMID:1130041
Tyteca, Eva; Vanderlinden, Kim; Favier, Maxime; Clicq, David; Cabooter, Deirdre; Desmet, Gert
2014-09-01
Linear gradient programs are very frequently used in reversed phase liquid chromatography to enhance the selectivity compared to isocratic separations. Multi-linear gradient programs on the other hand are only scarcely used, despite their intrinsically larger separation power. Because the gradient-conformity of the latest generation of instruments has greatly improved, a renewed interest in more complex multi-segment gradient liquid chromatography can be expected in the future, raising the need for better performing gradient design algorithms. We explored the possibilities of a new type of multi-segment gradient optimization algorithm, the so-called "one-segment-per-group-of-components" optimization strategy. In this gradient design strategy, the slope is adjusted after the elution of each individual component of the sample, letting the retention properties of the different analytes auto-guide the course of the gradient profile. Applying this method experimentally to four randomly selected test samples, the separation time could on average be reduced with about 40% compared to the best single linear gradient. Moreover, the newly proposed approach performed equally well or better than the multi-segment optimization mode of a commercial software package. Carrying out an extensive in silico study, the experimentally observed advantage could also be generalized over a statistically significant amount of different 10 and 20 component samples. In addition, the newly proposed gradient optimization approach enables much faster searches than the traditional multi-step gradient design methods. PMID:25039066
NASA Technical Reports Server (NTRS)
Vanderplaats, G. N.; Chen, Xiang; Zhang, Ning-Tian
1988-01-01
The use of formal numerical optimization methods for the design of gears is investigated. To achieve this, computer codes were developed for the analysis of spur gears and spiral bevel gears. These codes calculate the life, dynamic load, bending strength, surface durability, gear weight and size, and various geometric parameters. It is necessary to calculate all such important responses because they all represent competing requirements in the design process. The codes developed here were written in subroutine form and coupled to the COPES/ADS general purpose optimization program. This code allows the user to define the optimization problem at the time of program execution. Typical design variables include face width, number of teeth and diametral pitch. The user is free to choose any calculated response as the design objective to minimize or maximize and may impose lower and upper bounds on any calculated responses. Typical examples include life maximization with limits on dynamic load, stress, weight, etc. or minimization of weight subject to limits on life, dynamic load, etc. The research codes were written in modular form for easy expansion and so that they could be combined to create a multiple reduction optimization capability in future.
Fixed-Point Optimization of Atoms and Density in DFT.
Marks, L D
2013-06-11
I describe an algorithm for simultaneous fixed-point optimization (mixing) of the density and atomic positions in Density Functional Theory calculations which is approximately twice as fast as conventional methods, is robust, and requires minimal to no user intervention or input. The underlying numerical algorithm differs from ones previously proposed in a number of aspects and is an autoadaptive hybrid of standard Broyden methods. To understand how the algorithm works in terms of the underlying quantum mechanics, the concept of algorithmic greed for different Broyden methods is introduced, leading to the conclusion that if a linear model holds that the first Broyden method is optimal, the second if a linear model is a poor approximation. How this relates to the algorithm is discussed in terms of electronic phase transitions during a self-consistent run which results in discontinuous changes in the Jacobian. This leads to the need for a nongreedy algorithm when the charge density crosses phase boundaries, as well as a greedy algorithm within a given phase. An ansatz for selecting the algorithm structure is introduced based upon requiring the extrapolated component of the curvature condition to have projected positive eigenvalues. The general convergence of the fixed-point methods is briefly discussed in terms of the dielectric response and elastic waves using known results for quasi-Newton methods. The analysis indicates that both should show sublinear dependence with system size, depending more upon the number of different chemical environments than upon the number of atoms, consistent with the performance of the algorithm and prior literature. This is followed by details of algorithm ranging from preconditioning to trust region control. A number of results are shown, finishing up with a discussion of some of the many open questions. PMID:26583869
Kreitler, Jason R.; Stoms, David M.; Davis, Frank W.
2014-01-01
Quantitative methods of spatial conservation prioritization have traditionally been applied to issues in conservation biology and reserve design, though their use in other types of natural resource management is growing. The utility maximization problem is one form of a covering problem where multiple criteria can represent the expected social benefits of conservation action. This approach allows flexibility with a problem formulation that is more general than typical reserve design problems, though the solution methods are very similar. However, few studies have addressed optimization in utility maximization problems for conservation planning, and the effect of solution procedure is largely unquantified. Therefore, this study mapped five criteria describing elements of multifunctional agriculture to determine a hypothetical conservation resource allocation plan for agricultural land conservation in the Central Valley of CA, USA. We compared solution procedures within the utility maximization framework to determine the difference between an open source integer programming approach and a greedy heuristic, and find gains from optimization of up to 12%. We also model land availability for conservation action as a stochastic process and determine the decline in total utility compared to the globally optimal set using both solution algorithms. Our results are comparable to other studies illustrating the benefits of optimization for different conservation planning problems, and highlight the importance of maximizing the effectiveness of limited funding for conservation and natural resource management.
NASA Astrophysics Data System (ADS)
Mugunthan, P.; Shoemaker, C. A.; Regis, R. G.
2003-12-01
Heuristics and function approximation optimization methods were applied in calibrating biological and biokinetic parameters for a computationally expensive groundwater bioremediation model for engineered reductive dechlorination of chlorinated ethenes. Multi-species groundwater bioremediation models that use monod type kinetics are often not amenable to traditional derivative based optimization due to stiff biokinetic equations. The performance of three heuristic methods, Stochastic Greedy Search (GS), Real Genetic Algorithm (RGA), Derandomized Evolution Strategy (DES), and, Function Approximation Optimization based on Radial Basis Function (FA-RBF) were compared on three-dimensional hypothetical and field problems. GS was implemented so as to perform a more global search. Optimization results on hypothetical problem indicated that FA-RBF performed statistically significantly better than heuristic based evolutionary algorithms at a 10% significance level. Further, this particular implementation of GS performed well and proved superior to RGA. These heuristic methods and FA-RBF, with the exception of RGA, were applied to calibrate biological and biokinetic parameters using treatability test data for enhanced bioremediation at a Naval Air Station in Alameda Point, CA. All three methods performed well and identified similar solutions. The approximate simulation times for the hypothetical and real problems were 7 min and 2.5 hours respectively. Calibration of such computationally expensive models by heuristic and function approximation methods appears promising.
Stoms, David M.; Davis, Frank W.
2014-01-01
Quantitative methods of spatial conservation prioritization have traditionally been applied to issues in conservation biology and reserve design, though their use in other types of natural resource management is growing. The utility maximization problem is one form of a covering problem where multiple criteria can represent the expected social benefits of conservation action. This approach allows flexibility with a problem formulation that is more general than typical reserve design problems, though the solution methods are very similar. However, few studies have addressed optimization in utility maximization problems for conservation planning, and the effect of solution procedure is largely unquantified. Therefore, this study mapped five criteria describing elements of multifunctional agriculture to determine a hypothetical conservation resource allocation plan for agricultural land conservation in the Central Valley of CA, USA. We compared solution procedures within the utility maximization framework to determine the difference between an open source integer programming approach and a greedy heuristic, and find gains from optimization of up to 12%. We also model land availability for conservation action as a stochastic process and determine the decline in total utility compared to the globally optimal set using both solution algorithms. Our results are comparable to other studies illustrating the benefits of optimization for different conservation planning problems, and highlight the importance of maximizing the effectiveness of limited funding for conservation and natural resource management. PMID:25538868
Sparse and optimal acquisition design for diffusion MRI and beyond
Koay, Cheng Guan; Özarslan, Evren; Johnson, Kevin M.; Meyerand, M. Elizabeth
2012-01-01
Purpose: Diffusion magnetic resonance imaging (MRI) in combination with functional MRI promises a whole new vista for scientists to investigate noninvasively the structural and functional connectivity of the human brain—the human connectome, which had heretofore been out of reach. As with other imaging modalities, diffusion MRI data are inherently noisy and its acquisition time-consuming. Further, a faithful representation of the human connectome that can serve as a predictive model requires a robust and accurate data-analytic pipeline. The focus of this paper is on one of the key segments of this pipeline—in particular, the development of a sparse and optimal acquisition (SOA) design for diffusion MRI multiple-shell acquisition and beyond. Methods: The authors propose a novel optimality criterion for sparse multiple-shell acquisition and quasimultiple-shell designs in diffusion MRI and a novel and effective semistochastic and moderately greedy combinatorial search strategy with simulated annealing to locate the optimum design or configuration. The goal of the optimality criteria is threefold: first, to maximize uniformity of the diffusion measurements in each shell, which is equivalent to maximal incoherence in angular measurements; second, to maximize coverage of the diffusion measurements around each radial line to achieve maximal incoherence in radial measurements for multiple-shell acquisition; and finally, to ensure maximum uniformity of diffusion measurement directions in the limiting case when all the shells are coincidental as in the case of a single-shell acquisition. The approach taken in evaluating the stability of various acquisition designs is based on the condition number and the A-optimal measure of the design matrix. Results: Even though the number of distinct configurations for a given set of diffusion gradient directions is very large in general—e.g., in the order of 10232 for a set of 144 diffusion gradient directions, the proposed search
NASA Astrophysics Data System (ADS)
Handels, Heinz; Ross, Th; Kreusch, J.; Wolff, H. H.; Poeppl, S. J.
1998-06-01
A new approach to computer supported recognition of melanoma and naevocytic naevi based on high resolution skin surface profiles is presented. Profiles are generated by sampling an area of 4 X 4 mm2 at a resolution of 125 sample points per mm with a laser profilometer at a vertical resolution of 0.1 micrometers . With image analysis algorithms Haralick's texture parameters, Fourier features and features based on fractal analysis are extracted. In order to improve classification performance, a subsequent feature selection process is applied to determine the best possible subset of features. Genetic algorithms are optimized for the feature selection process, and results of different approaches are compared. As quality measure for feature subsets, the error rate of the nearest neighbor classifier estimated with the leaving-one-out method is used. In comparison to heuristic strategies and greedy algorithms, genetic algorithms show the best results for the feature selection problem. After feature selection, several architectures of feed forward neural networks with error back-propagation are evaluated. Classification performance of the neural classifier is optimized using different topologies, learning parameters and pruning algorithms. The best neural classifier achieved an error rate of 4.5% and was found after network pruning. The best result in all with an error rate of 2.3% was obtained with the nearest neighbor classifier.
Finding Near-Optimal Groups of Epidemic Spreaders in a Complex Network
Moores, Geoffrey; Shakarian, Paulo; Macdonald, Brian; Howard, Nicholas
2014-01-01
In this paper, we present algorithms to find near-optimal sets of epidemic spreaders in complex networks. We extend the notion of local-centrality, a centrality measure previously shown to correspond with a node's ability to spread an epidemic, to sets of nodes by introducing combinatorial local centrality. Though we prove that finding a set of nodes that maximizes this new measure is NP-hard, good approximations are available. We show that a strictly greedy approach obtains the best approximation ratio unless P = NP and then formulate a modified version of this approach that leverages qualities of the network to achieve a faster runtime while maintaining this theoretical guarantee. We perform an experimental evaluation on samples from several different network structures which demonstrate that our algorithm maximizes combinatorial local centrality and consistently chooses the most effective set of nodes to spread infection under the SIR model, relative to selecting the top nodes using many common centrality measures. We also demonstrate that the optimized algorithm we develop scales effectively. PMID:24694693
Adaptive tracking and compensation of laser spot based on ant colony optimization
NASA Astrophysics Data System (ADS)
Yang, Lihong; Ke, Xizheng; Bai, Runbing; Hu, Qidi
2009-05-01
Because the effect of atmospheric scattering and atmospheric turbulence on laser signal of atmospheric absorption,laser spot twinkling, beam drift and spot split-up occur ,when laser signal transmits in the atmospheric channel. The phenomenon will be seriously affects the stability and the reliability of laser spot receiving system. In order to reduce the influence of atmospheric turbulence, we adopt optimum control thoughts in the field of artificial intelligence, propose a novel adaptive optical control technology-- model-free optimized adaptive control technology, analyze low-order pattern wave-front error theory, in which an -adaptive optical system is employed to adjust errors, and design its adaptive structure system. Ant colony algorithm is the control core algorithm, which is characteristic of positive feedback, distributed computing and greedy heuristic search. . The ant colony algorithm optimization of adaptive optical phase compensation is simulated. Simulation result shows that, the algorithm can effectively control laser energy distribution, improve laser light beam quality, and enhance signal-to-noise ratio of received signal.
Tippetts, Tyler J; Warner, Phillip B; Kukhareva, Polina V; Shields, David E; Staes, Catherine J; Kawamoto, Kensaku
2015-01-01
Given the close relationship between clinical decision support (CDS) and quality measurement (QM), it has been proposed that a standards-based CDS Web service could be leveraged to enable QM. Benefits of such a CDS-QM framework include semantic consistency and implementation efficiency. However, earlier research has identified execution performance as a critical barrier when CDS-QM is applied to large populations. Here, we describe challenges encountered and solutions devised to optimize CDS-QM execution performance. Through these optimizations, the CDS-QM execution time was optimized approximately three orders of magnitude, such that approximately 370,000 patient records can now be evaluated for 22 quality measure groups in less than 5 hours (approximately 2 milliseconds per measure group per patient). Several key optimization methods were identified, with the most impact achieved through population-based retrieval of relevant data, multi-step data staging, and parallel processing. These optimizations have enabled CDS-QM to be operationally deployed at an enterprise level. PMID:26958259
NASA Technical Reports Server (NTRS)
Patterson, Michael J.; Mohajeri, Kayhan
1991-01-01
The preliminary results of a test program to optimize a neutralizer design for 30 cm xenon ion thrusters are discussed. The impact of neutralizer geometry, neutralizer axial location, and local magnetic fields on neutralizer performance is discussed. The effect of neutralizer performance on overall thruster performance is quantified, for thruster operation in the 0.5-3.2 kW power range. Additionally, these data are compared to data published for other north-south stationkeeping (NSSK) and primary propulsion xenon ion thruster neutralizers.
Sklarz, Shlomo E.; Tannor, David J.; Khaneja, Navin
2004-05-01
We study the problem of optimal control of dissipative quantum dynamics. Although under most circumstances dissipation leads to an increase in entropy (or a decrease in purity) of the system, there is an important class of problems for which dissipation with external control can decrease the entropy (or increase the purity) of the system. An important example is laser cooling. In such systems, there is an interplay of the Hamiltonian part of the dynamics, which is controllable, and the dissipative part of the dynamics, which is uncontrollable. The strategy is to control the Hamiltonian portion of the evolution in such a way that the dissipation causes the purity of the system to increase rather than decrease. The goal of this paper is to find the strategy that leads to maximal purity at the final time. Under the assumption that Hamiltonian control is complete and arbitrarily fast, we provide a general framework by which to calculate optimal cooling strategies. These assumptions lead to a great simplification, in which the control problem can be reformulated in terms of the spectrum of eigenvalues of {rho}, rather than {rho} itself. By combining this formulation with the Hamilton-Jacobi-Bellman theorem we are able to obtain an equation for the globally optimal cooling strategy in terms of the spectrum of the density matrix. For the three-level {lambda} system, we provide a complete analytic solution for the optimal cooling strategy. For this system it is found that the optimal strategy does not exploit system coherences and is a 'greedy' strategy, in which the purity is increased maximally at each instant.
[SIAM conference on optimization
Not Available
1992-05-10
Abstracts are presented of 63 papers on the following topics: large-scale optimization, interior-point methods, algorithms for optimization, problems in control, network optimization methods, and parallel algorithms for optimization problems.
Mdluli, Thembi; Buzzard, Gregery T.; Rundell, Ann E.
2015-01-01
This model-based design of experiments (MBDOE) method determines the input magnitudes of an experimental stimuli to apply and the associated measurements that should be taken to optimally constrain the uncertain dynamics of a biological system under study. The ideal global solution for this experiment design problem is generally computationally intractable because of parametric uncertainties in the mathematical model of the biological system. Others have addressed this issue by limiting the solution to a local estimate of the model parameters. Here we present an approach that is independent of the local parameter constraint. This approach is made computationally efficient and tractable by the use of: (1) sparse grid interpolation that approximates the biological system dynamics, (2) representative parameters that uniformly represent the data-consistent dynamical space, and (3) probability weights of the represented experimentally distinguishable dynamics. Our approach identifies data-consistent representative parameters using sparse grid interpolants, constructs the optimal input sequence from a greedy search, and defines the associated optimal measurements using a scenario tree. We explore the optimality of this MBDOE algorithm using a 3-dimensional Hes1 model and a 19-dimensional T-cell receptor model. The 19-dimensional T-cell model also demonstrates the MBDOE algorithm’s scalability to higher dimensions. In both cases, the dynamical uncertainty region that bounds the trajectories of the target system states were reduced by as much as 86% and 99% respectively after completing the designed experiments in silico. Our results suggest that for resolving dynamical uncertainty, the ability to design an input sequence paired with its associated measurements is particularly important when limited by the number of measurements. PMID:26379275
Mdluli, Thembi; Buzzard, Gregery T; Rundell, Ann E
2015-09-01
This model-based design of experiments (MBDOE) method determines the input magnitudes of an experimental stimuli to apply and the associated measurements that should be taken to optimally constrain the uncertain dynamics of a biological system under study. The ideal global solution for this experiment design problem is generally computationally intractable because of parametric uncertainties in the mathematical model of the biological system. Others have addressed this issue by limiting the solution to a local estimate of the model parameters. Here we present an approach that is independent of the local parameter constraint. This approach is made computationally efficient and tractable by the use of: (1) sparse grid interpolation that approximates the biological system dynamics, (2) representative parameters that uniformly represent the data-consistent dynamical space, and (3) probability weights of the represented experimentally distinguishable dynamics. Our approach identifies data-consistent representative parameters using sparse grid interpolants, constructs the optimal input sequence from a greedy search, and defines the associated optimal measurements using a scenario tree. We explore the optimality of this MBDOE algorithm using a 3-dimensional Hes1 model and a 19-dimensional T-cell receptor model. The 19-dimensional T-cell model also demonstrates the MBDOE algorithm's scalability to higher dimensions. In both cases, the dynamical uncertainty region that bounds the trajectories of the target system states were reduced by as much as 86% and 99% respectively after completing the designed experiments in silico. Our results suggest that for resolving dynamical uncertainty, the ability to design an input sequence paired with its associated measurements is particularly important when limited by the number of measurements. PMID:26379275
NASA Astrophysics Data System (ADS)
Allahverdyan, Armen E.; Hovhannisyan, Karen; Mahler, Guenter
2010-05-01
We study a refrigerator model which consists of two n -level systems interacting via a pulsed external field. Each system couples to its own thermal bath at temperatures Th and Tc , respectively (θ≡Tc/Th<1) . The refrigerator functions in two steps: thermally isolated interaction between the systems driven by the external field and isothermal relaxation back to equilibrium. There is a complementarity between the power of heat transfer from the cold bath and the efficiency: the latter nullifies when the former is maximized and vice versa. A reasonable compromise is achieved by optimizing the product of the heat-power and efficiency over the Hamiltonian of the two systems. The efficiency is then found to be bounded from below by ζCA=(1)/(1-θ)-1 (an analog of the Curzon-Ahlborn efficiency), besides being bound from above by the Carnot efficiency ζC=(1)/(1-θ)-1 . The lower bound is reached in the equilibrium limit θ→1 . The Carnot bound is reached (for a finite power and a finite amount of heat transferred per cycle) for lnn≫1 . If the above maximization is constrained by assuming homogeneous energy spectra for both systems, the efficiency is bounded from above by ζCA and converges to it for n≫1 .
Allahverdyan, Armen E; Hovhannisyan, Karen; Mahler, Guenter
2010-05-01
We study a refrigerator model which consists of two n -level systems interacting via a pulsed external field. Each system couples to its own thermal bath at temperatures T h and T c, respectively (θ ≡ T c/T h < 1). The refrigerator functions in two steps: thermally isolated interaction between the systems driven by the external field and isothermal relaxation back to equilibrium. There is a complementarity between the power of heat transfer from the cold bath and the efficiency: the latter nullifies when the former is maximized and vice versa. A reasonable compromise is achieved by optimizing the product of the heat-power and efficiency over the Hamiltonian of the two systems. The efficiency is then found to be bounded from below by [formula: see text] (an analog of the Curzon-Ahlborn efficiency), besides being bound from above by the Carnot efficiency [formula: see text]. The lower bound is reached in the equilibrium limit θ → 1. The Carnot bound is reached (for a finite power and a finite amount of heat transferred per cycle) for ln n > 1. If the above maximization is constrained by assuming homogeneous energy spectra for both systems, the efficiency is bounded from above by ζ CA and converges to it for n > 1. PMID:20866207
AMMOS: Automated Molecular Mechanics Optimization tool for in silico Screening
Pencheva, Tania; Lagorce, David; Pajeva, Ilza; Villoutreix, Bruno O; Miteva, Maria A
2008-01-01
Background Virtual or in silico ligand screening combined with other computational methods is one of the most promising methods to search for new lead compounds, thereby greatly assisting the drug discovery process. Despite considerable progresses made in virtual screening methodologies, available computer programs do not easily address problems such as: structural optimization of compounds in a screening library, receptor flexibility/induced-fit, and accurate prediction of protein-ligand interactions. It has been shown that structural optimization of chemical compounds and that post-docking optimization in multi-step structure-based virtual screening approaches help to further improve the overall efficiency of the methods. To address some of these points, we developed the program AMMOS for refining both, the 3D structures of the small molecules present in chemical libraries and the predicted receptor-ligand complexes through allowing partial to full atom flexibility through molecular mechanics optimization. Results The program AMMOS carries out an automatic procedure that allows for the structural refinement of compound collections and energy minimization of protein-ligand complexes using the open source program AMMP. The performance of our package was evaluated by comparing the structures of small chemical entities minimized by AMMOS with those minimized with the Tripos and MMFF94s force fields. Next, AMMOS was used for full flexible minimization of protein-ligands complexes obtained from a mutli-step virtual screening. Enrichment studies of the selected pre-docked complexes containing 60% of the initially added inhibitors were carried out with or without final AMMOS minimization on two protein targets having different binding pocket properties. AMMOS was able to improve the enrichment after the pre-docking stage with 40 to 60% of the initially added active compounds found in the top 3% to 5% of the entire compound collection. Conclusion The open source AMMOS
Optimization and scale-up of a fluid bed tangential spray rotogranulation process.
Bouffard, J; Dumont, H; Bertrand, F; Legros, R
2007-04-20
The production of pellets in the pharmaceutical industry generally involves multi-step processing: (1) mixing, (2) wet granulation, (3) spheronization and (4) drying. While extrusion-spheronization processes have been popular because of their simplicity, fluid-bed rotogranulation (FBRG) is now being considered as an alternative, since it offers the advantages of combining the different steps into one processing unit, thus reducing processing time and material handling. This work aimed at the development of a FBRG process for the production of pellets in a 4.5-l Glatt GCPG1 tangential spray rotoprocessor and its optimization using factorial design. The factors considered were: (1) rotor disc velocity, (2) gap air pressure, (3) air flow rate, (4) binder spray rate and (5) atomization pressure. The pellets were characterized for their physical properties by measuring size distribution, roundness and flow properties. The results indicated that: pellet mean particle size is negatively affected by air flow rate and rotor plate speed, while binder spray rate has a positive effect on size; pellet flow properties are enhanced by operating with increased air flow rate and worsened with increased binder spray rate. Multiple regression analysis enabled the identification of an optimal operating window for production of acceptable pellets. Scale-up of these operating conditions was tested in a 30-l Glatt GPCG15 FBRG. PMID:17166677
Optimization of propranolol HCl release kinetics from press coated sustained release tablets.
Ali, Adel Ahmed; Ali, Ahmed Mahmoud
2013-01-01
Press-coated sustained release tablets offer a valuable, cheap and easy manufacture alternative to the highly expensive, multi-step manufacture and filling of coated beads. In this study, propranolol HCl press-coated tablets were prepared using hydroxylpropylmethylcellulose (HPMC) as tablet coating material together with carbopol 971P and compressol as release modifiers. The prepared formulations were optimized for zero-order release using artificial neural network program (INForm, Intelligensys Ltd, North Yorkshire, UK). Typical zero-order release kinetics with extended release profile for more than 12 h was obtained. The most important variables considered by the program in optimizing formulations were type and proportion of polymer mixture in the coat layer and distribution ratio of drug between core and coat. The key elements found were; incorporation of 31-38 % of the drug in the coat, fixing the amount of polymer in coat to be not less than 50 % of coat layer. Optimum zero-order release kinetics (linear regression r2 = 0.997 and Peppas model n value > 0.80) were obtained when 2.5-10 % carbopol and 25-42.5% compressol were incorporated into the 50 % HPMC coat layer. PMID:22582904
A Hybrid Optimization Framework with POD-based Order Reduction and Design-Space Evolution Scheme
NASA Astrophysics Data System (ADS)
Ghoman, Satyajit S.
The main objective of this research is to develop an innovative multi-fidelity multi-disciplinary design, analysis and optimization suite that integrates certain solution generation codes and newly developed innovative tools to improve the overall optimization process. The research performed herein is divided into two parts: (1) the development of an MDAO framework by integration of variable fidelity physics-based computational codes, and (2) enhancements to such a framework by incorporating innovative features extending its robustness. The first part of this dissertation describes the development of a conceptual Multi-Fidelity Multi-Strategy and Multi-Disciplinary Design Optimization Environment (M3 DOE), in context of aircraft wing optimization. M 3 DOE provides the user a capability to optimize configurations with a choice of (i) the level of fidelity desired, (ii) the use of a single-step or multi-step optimization strategy, and (iii) combination of a series of structural and aerodynamic analyses. The modularity of M3 DOE allows it to be a part of other inclusive optimization frameworks. The M 3 DOE is demonstrated within the context of shape and sizing optimization of the wing of a Generic Business Jet aircraft. Two different optimization objectives, viz. dry weight minimization, and cruise range maximization are studied by conducting one low-fidelity and two high-fidelity optimization runs to demonstrate the application scope of M3 DOE. The second part of this dissertation describes the development of an innovative hybrid optimization framework that extends the robustness of M 3 DOE by employing a proper orthogonal decomposition-based design-space order reduction scheme combined with the evolutionary algorithm technique. The POD method of extracting dominant modes from an ensemble of candidate configurations is used for the design-space order reduction. The snapshot of candidate population is updated iteratively using evolutionary algorithm technique of
Temporal variability of the optimal monitoring setup assessed using information theory
NASA Astrophysics Data System (ADS)
Fahle, Marcus; Hohenbrink, Tobias L.; Dietrich, Ottfried; Lischeid, Gunnar
2015-09-01
Hydrology is rich in methods that use information theory to evaluate monitoring networks. Yet in most existing studies, only the available data set as a whole is used, which neglects the intraannual variability of the hydrological system. In this paper, we demonstrate how this variability can be considered by extending monitoring evaluation to subsets of the available data. Therefore, we separately evaluated time windows of fixed length, which were shifted through the data set, and successively extended time windows. We used basic information theory measures and a greedy ranking algorithm based on the criterion of maximum information/minimum redundancy. The network investigated monitored surface and groundwater levels at quarter-hourly intervals and was located at an artificially drained lowland site in the Spreewald region in north-east Germany. The results revealed that some of the monitoring stations were of value permanently while others were needed only temporally. The prevailing meteorological conditions, particularly the amount of precipitation, affected the degree of similarity between the water levels measured. The hydrological system tended to act more individually during periods of no or little rainfall. The optimal monitoring setup, its stability, and the monitoring effort necessary were influenced by the meteorological forcing. Altogether, the methodology presented can help achieve a monitoring network design that has a more even performance or covers the conditions of interest (e.g., floods or droughts) best.
Optimizing Site Selection in Urban Areas in Northern Switzerland
NASA Astrophysics Data System (ADS)
Plenkers, K.; Kraft, T.; Bethmann, F.; Husen, S.; Schnellmann, M.
2012-04-01
There is a need to observe weak seismic events (M<2) in areas close to potential nuclear-waste repositories or nuclear power plants, in order to analyze the underlying seismo-tectonic processes and estimate their seismic hazard. We are therefore densifying the existing Swiss Digital Seismic Network in northern Switzerland by additional 20 stations. The new network that will be in operation by the end of 2012, aims at observing seismicity in northern Switzerland with a completeness of M_c=1.0 and a location error < 0.5 km in epicenter and < 2 km in focal depth. Monitoring of weak seismic events in this region is challenging, because the area of interest is densely populated and geology is dominated by the Swiss molasse basin. A optimal network-design and a thoughtful choice for station-sites is, therefore, mandatory. To help with decision making we developed a step-wise approach to find the optimum network configuration. Our approach is based on standard network optimization techniques regarding the localization error. As a new feature, our approach uses an ambient noise model to compute expected signal-to-noise ratios for a given site. The ambient noise model uses information on land use and major infrastructures such as highways and train lines. We ran a series of network optimizations with increasing number of stations until the requirements regarding localization error and magnitude of completeness are reached. The resulting network geometry serves as input for the site selection. Site selection is done by using a newly developed multi-step assessment-scheme that takes into account local noise level, geology, infrastructure, and costs necessary to realize the station. The assessment scheme is weighting the different parameters and the most promising sites are identified. In a first step, all potential sites are classified based on information from topographic maps and site inspection. In a second step, local noise conditions are measured at selected sites. We
Multi-step Loading of Human Minichromosome Maintenance Proteins in Live Human Cells*
Symeonidou, Ioanna-Eleni; Kotsantis, Panagiotis; Roukos, Vassilis; Rapsomaniki, Maria-Anna; Grecco, Hernán E.; Bastiaens, Philippe; Taraviras, Stavros; Lygerou, Zoi
2013-01-01
Once-per-cell cycle replication is regulated through the assembly onto chromatin of multisubunit protein complexes that license DNA for a further round of replication. Licensing consists of the loading of the hexameric MCM2–7 complex onto chromatin during G1 phase and is dependent on the licensing factor Cdt1. In vitro experiments have suggested a two-step binding mode for minichromosome maintenance (MCM) proteins, with transient initial interactions converted to stable chromatin loading. Here, we assess MCM loading in live human cells using an in vivo licensing assay on the basis of fluorescence recovery after photobleaching of GFP-tagged MCM protein subunits through the cell cycle. We show that, in telophase, MCM2 and MCM4 maintain transient interactions with chromatin, exhibiting kinetics similar to Cdt1. These are converted to stable interactions from early G1 phase. The immobile fraction of MCM2 and MCM4 increases during G1 phase, suggestive of reiterative licensing. In late G1 phase, a large fraction of MCM proteins are loaded onto chromatin, with maximal licensing observed just prior to S phase onset. Fluorescence loss in photobleaching experiments show subnuclear concentrations of MCM-chromatin interactions that differ as G1 phase progresses and do not colocalize with sites of DNA synthesis in S phase. PMID:24158436
Multi-Step Attack Detection via Bayesian Modeling under Model Parameter Uncertainty
ERIC Educational Resources Information Center
Cole, Robert
2013-01-01
Organizations in all sectors of business have become highly dependent upon information systems for the conduct of business operations. Of necessity, these information systems are designed with many points of ingress, points of exposure that can be leveraged by a motivated attacker seeking to compromise the confidentiality, integrity or…
A multi-step solvent-free mechanochemical route to indium(iii) complexes.
Wang, Jingyi; Ganguly, Rakesh; Yongxin, Li; Díaz, Jesus; Soo, Han Sen; García, Felipe
2016-05-10
Mechanochemistry is well-established in the solid-phase synthesis of inorganic materials but has rarely been employed for molecular syntheses. In recent years, there has been nascent interest in 'greener' synthetic methods with less solvent, higher yields, and shorter reaction times being especially appealing to the fine chemicals and inorganic catalyst industries. Herein, we demonstrate that main-group indium(iii) complexes featuring bis(imino)acenaphthene (BIAN) ligands are readily accessible through a mechanochemical milling approach. The synthetic methodology reported herein not only bypasses the use of large solvent quantities and transition metal reagents for ligand synthesis, but also reduces reaction times dramatically. These new main-group complexes exhibit the potential to be reduced to indium(i) compounds, which may be employed as photosensitizers in organic catalyses and functional materials. PMID:27112317
Use of DBMS in Multi-step Information Systems for LANDSAT
NASA Technical Reports Server (NTRS)
Noll, C. E.
1984-01-01
Data are obtained by the thematic mapper on LANDSAT 4 in seven bands and are telemetered and electronically recorded at ground station where the data must be geometrically and rediometrically corrected before a photographic image is produced. Current system characteristics for processing this information are described including the menu for data products reports. The tracking system provides up-to-date and complete information and requires that production stages adhere to the inherent DBMS structure. The concept can be applied to any procedures requiring status information.
Multi-step shot noise spectrum induced by a local large spin
NASA Astrophysics Data System (ADS)
Niu, Peng-Bin; Shi, Yun-Long; Sun, Zhu; Nie, Yi-Hang
2015-12-01
We use non-equilibrium Green’s function method to analyze the shot noise spectrum of artificial single molecular magnets (ASMM) model in the strong spin-orbit coupling limit in sequential tunneling regime, mainly focusing on the effects of local large spin. In the linear response regime, the shot noise shows 2S + 1 peaks and is strongly spin-dependent. In the nonlinear response regime, one can observe 2S + 1 steps in shot noise and Fano factor. In these steps one can see the significant enhancement effect due to the spin-dependent multi-channel process of local large spin, which reduces electron correlations. Project supported by the National Natural Science Foundation of China (Grant Nos. 11504210, 11504211, 11504212, 11274207, 11274208, 11174115, and 11325417), the Key Program of the Ministry of Education of China (Grant No. 212018), the Scientific and Technological Project of Shanxi Province, China (Grant No. 2015031002-2), the Natural Science Foundation of Shanxi Province, China (Grant Nos. 2013011007-2 and 2013021010-5), and the Outstanding Innovative Teams of Higher Learning Institutions of Shanxi Province, China.
Multi-step EMG Classification Algorithm for Human-Computer Interaction
NASA Astrophysics Data System (ADS)
Ren, Peng; Barreto, Armando; Adjouadi, Malek
A three-electrode human-computer interaction system, based on digital processing of the Electromyogram (EMG) signal, is presented. This system can effectively help disabled individuals paralyzed from the neck down to interact with computers or communicate with people through computers using point-and-click graphic interfaces. The three electrodes are placed on the right frontalis, the left temporalis and the right temporalis muscles in the head, respectively. The signal processing algorithm used translates the EMG signals during five kinds of facial movements (left jaw clenching, right jaw clenching, eyebrows up, eyebrows down, simultaneous left & right jaw clenching) into five corresponding types of cursor movements (left, right, up, down and left-click), to provide basic mouse control. The classification strategy is based on three principles: the EMG energy of one channel is typically larger than the others during one specific muscle contraction; the spectral characteristics of the EMG signals produced by the frontalis and temporalis muscles during different movements are different; the EMG signals from adjacent channels typically have correlated energy profiles. The algorithm is evaluated on 20 pre-recorded EMG signal sets, using Matlab simulations. The results show that this method provides improvements and is more robust than other previous approaches.
Simulation of multi-steps thermal transition in 2D spin-crossover nanoparticles
NASA Astrophysics Data System (ADS)
Jureschi, Catalin-Maricel; Pottier, Benjamin-Louis; Linares, Jorge; Richard Dahoo, Pierre; Alayli, Yasser; Rotaru, Aurelian
2016-04-01
We have used an Ising like model to study the thermal behavior of a 2D spin crossover (SCO) system embedded in a matrix. The interaction parameter between edge SCO molecules and its local environment was included in the standard Ising like model as an additional term. The influence of the system's size and the ratio between the number of edge molecules and the other molecules were also discussed.
The Multi-Step CADIS method for shutdown dose rate calculations and uncertainty propagation
Ibrahim, Ahmad M.; Peplow, Douglas E.; Grove, Robert E.; Peterson, Joshua L.; Johnson, Seth R.
2015-12-01
Shutdown dose rate (SDDR) analysis requires (a) a neutron transport calculation to estimate neutron flux fields, (b) an activation calculation to compute radionuclide inventories and associated photon sources, and (c) a photon transport calculation to estimate final SDDR. In some applications, accurate full-scale Monte Carlo (MC) SDDR simulations are needed for very large systems with massive amounts of shielding materials. However, these simulations are impractical because calculation of space- and energy-dependent neutron fluxes throughout the structural materials is needed to estimate distribution of radioisotopes causing the SDDR. Biasing the neutron MC calculation using an importance function is not simple becausemore » it is difficult to explicitly express the response function, which depends on subsequent computational steps. Furthermore, the typical SDDR calculations do not consider how uncertainties in MC neutron calculation impact SDDR uncertainty, even though MC neutron calculation uncertainties usually dominate SDDR uncertainty.« less
The Multi-Step CADIS method for shutdown dose rate calculations and uncertainty propagation
Ibrahim, Ahmad M.; Peplow, Douglas E.; Grove, Robert E.; Peterson, Joshua L.; Johnson, Seth R.
2015-12-01
Shutdown dose rate (SDDR) analysis requires (a) a neutron transport calculation to estimate neutron flux fields, (b) an activation calculation to compute radionuclide inventories and associated photon sources, and (c) a photon transport calculation to estimate final SDDR. In some applications, accurate full-scale Monte Carlo (MC) SDDR simulations are needed for very large systems with massive amounts of shielding materials. However, these simulations are impractical because calculation of space- and energy-dependent neutron fluxes throughout the structural materials is needed to estimate distribution of radioisotopes causing the SDDR. Biasing the neutron MC calculation using an importance function is not simple because it is difficult to explicitly express the response function, which depends on subsequent computational steps. Furthermore, the typical SDDR calculations do not consider how uncertainties in MC neutron calculation impact SDDR uncertainty, even though MC neutron calculation uncertainties usually dominate SDDR uncertainty.
Multi-off-grid methods in multi-step integration of ordinary differential equations
NASA Technical Reports Server (NTRS)
Beaudet, P. R.
1974-01-01
Description of methods of solving first- and second-order systems of differential equations in which all derivatives are evaluated at off-grid locations in order to circumvent the Dahlquist stability limitation on the order of on-grid methods. The proposed multi-off-grid methods require off-grid state predictors for the evaluation of the n derivatives at each step. Progressing forward in time, the off-grid states are predicted using a linear combination of back on-grid state values and off-grid derivative evaluations. A comparison is made between the proposed multi-off-grid methods and the corresponding Adams and Cowell on-grid integration techniques in integrating systems of ordinary differential equations, showing a significant reduction in the error at larger step sizes in the case of the multi-off-grid integrator.
Modeling the Auto-Ignition of Biodiesel Blends with a Multi-Step Model
Toulson, Dr. Elisa; Allen, Casey M; Miller, Dennis J; McFarlane, Joanna; Schock, Harold; Lee, Tonghun
2011-01-01
There is growing interest in using biodiesel in place of or in blends with petrodiesel in diesel engines; however, biodiesel oxidation chemistry is complicated to directly model and existing surrogate kinetic models are very large, making them computationally expensive. The present study describes a method for predicting the ignition behavior of blends of n-heptane and methyl butanoate, fuels whose blends have been used in the past as a surrogate for biodiesel. The autoignition is predicted using a multistep (8-step) model in order to reduce computational time and make this a viable tool for implementation into engine simulation codes. A detailed reaction mechanism for n-heptane-methyl butanoate blends was used as a basis for validating the multistep model results. The ignition delay trends predicted by the multistep model for the n-heptane-methyl butanoate blends matched well with that of the detailed CHEMKIN model for the majority of conditions tested.
NASA Astrophysics Data System (ADS)
Siepmann, J. Ilja; Bai, Peng; Tsapatsis, Michael; Knight, Chris; Deem, Michael W.
2015-03-01
Zeolites play numerous important roles in modern petroleum refineries and have the potential to advance the production of fuels and chemical feedstocks from renewable resources. The performance of a zeolite as separation medium and catalyst depends on its framework structure and the type or location of active sites. To date, 213 framework types have been synthesized and >330000 thermodynamically accessible zeolite structures have been predicted. Hence, identification of optimal zeolites for a given application from the large pool of candidate structures is attractive for accelerating the pace of materials discovery. Here we identify, through a large-scale, multi-step computational screening process, promising zeolite structures for two energy-related applications: the purification of ethanol beyond the ethanol/water azeotropic concentration in a single separation step from fermentation broths and the hydroisomerization of alkanes with 18-30 carbon atoms encountered in petroleum refining. These results demonstrate that predictive modeling and data-driven science can now be applied to solve some of the most challenging separation problems involving highly non-ideal mixtures and highly articulated compounds. Financial support from the Department of Energy Office of Basic Energy Sciences, Division of Chemical Sciences, Geosciences and Biosciences under Award DE-FG02-12ER16362 is gratefully acknowledged.
Particle Swarm Optimization Toolbox
NASA Technical Reports Server (NTRS)
Grant, Michael J.
2010-01-01
The Particle Swarm Optimization Toolbox is a library of evolutionary optimization tools developed in the MATLAB environment. The algorithms contained in the library include a genetic algorithm (GA), a single-objective particle swarm optimizer (SOPSO), and a multi-objective particle swarm optimizer (MOPSO). Development focused on both the SOPSO and MOPSO. A GA was included mainly for comparison purposes, and the particle swarm optimizers appeared to perform better for a wide variety of optimization problems. All algorithms are capable of performing unconstrained and constrained optimization. The particle swarm optimizers are capable of performing single and multi-objective optimization. The SOPSO and MOPSO algorithms are based on swarming theory and bird-flocking patterns to search the trade space for the optimal solution or optimal trade in competing objectives. The MOPSO generates Pareto fronts for objectives that are in competition. A GA, based on Darwin evolutionary theory, is also included in the library. The GA consists of individuals that form a population in the design space. The population mates to form offspring at new locations in the design space. These offspring contain traits from both of the parents. The algorithm is based on this combination of traits from parents to hopefully provide an improved solution than either of the original parents. As the algorithm progresses, individuals that hold these optimal traits will emerge as the optimal solutions. Due to the generic design of all optimization algorithms, each algorithm interfaces with a user-supplied objective function. This function serves as a "black-box" to the optimizers in which the only purpose of this function is to evaluate solutions provided by the optimizers. Hence, the user-supplied function can be numerical simulations, analytical functions, etc., since the specific detail of this function is of no concern to the optimizer. These algorithms were originally developed to support entry
2007-03-01
Aristos is a Trilinos package for nonlinear continuous optimization, based on full-space sequential quadratic programming (SQP) methods. Aristos is specifically designed for the solution of large-scale constrained optimization problems in which the linearized constraint equations require iterative (i.e. inexact) linear solver techniques. Aristos' unique feature is an efficient handling of inexactness in linear system solves. Aristos currently supports the solution of equality-constrained convex and nonconvex optimization problems. It has been used successfully in the areamore » of PDE-constrained optimization, for the solution of nonlinear optimal control, optimal design, and inverse problems.« less
Investigations into the Optimization of Multi-Source Strength Brachytherapy Treatment Procedures
D. L. Henderson; S. Yoo; B.R. Thomadsen
2002-09-30
The goal of this project is to investigate the use of multi-strength and multi-specie radioactive sources in permanent prostate implant brachytherapy. In order to fulfill the requirement for an optimal dose distribution, the prescribed dose should be delivered to the target in a nearly uniform dose distribution while simultaneously sparing sensitive structures. The treatment plan should use a small number of needles and sources while satisfying the treatment requirements. The hypothesis for the use of multi-strength and/or multi-specie sources is that a better treatment plan using fewer sources and needles could be obtained than by treatment plans using single-strength sources could reduce the overall number of sources used for treatment. We employ a recently developed greedy algorithm based on the adjoint concept as the optimization search engine. The algorithm utilizes and ''adjoint ratio'', which provides a means of ranking source positions, as the pseudo-objective function. It ha s been shown that the greedy algorithm can solve the optimization problem efficiently and arrives at a clinically acceptable solution in less than 10 seconds. Our study was inclusive, that is there was no combination of sources that clearly stood out from the others and could therefore be considered the preferred set of sources for treatment planning. Source strengths of 0.2 mCi (low), 0.4 mCi (medium), and 0.6 mCi (high) of {sup 125}I in four different combinations were used for the multi-strength source study. The combination of high- and medium-strength sources achieved a more uniform target dose distribution due to few source implants whereas the combination of low-and medium-strength sources achieved better sparing of sensitive tissues including that of the single-strength 0.4 mCi base case. {sup 125}I at 0.4 mCi and {sup 192}Ir at 0.12 mCi and 0.25 mCi source strengths were used for the multi-specie source study. This study also proved inconclusive , Treatment plans using a
Multidisciplinary Optimization for Aerospace Using Genetic Optimization
NASA Technical Reports Server (NTRS)
Pak, Chan-gi; Hahn, Edward E.; Herrera, Claudia Y.
2007-01-01
In support of the ARMD guidelines NASA's Dryden Flight Research Center is developing a multidisciplinary design and optimization tool This tool will leverage existing tools and practices, and allow the easy integration and adoption of new state-of-the-art software. Optimization has made its way into many mainstream applications. For example NASTRAN(TradeMark) has its solution sequence 200 for Design Optimization, and MATLAB(TradeMark) has an Optimization Tool box. Other packages, such as ZAERO(TradeMark) aeroelastic panel code and the CFL3D(TradeMark) Navier-Stokes solver have no built in optimizer. The goal of the tool development is to generate a central executive capable of using disparate software packages ina cross platform network environment so as to quickly perform optimization and design tasks in a cohesive streamlined manner. A provided figure (Figure 1) shows a typical set of tools and their relation to the central executive. Optimization can take place within each individual too, or in a loop between the executive and the tool, or both.
Optimization of aerospace structures
NASA Technical Reports Server (NTRS)
Keith, Theo G., Jr.; Patnaik, Surya N.
1994-01-01
Research carried out is grouped under two topics: (1) Design Optimization, and (2) Integrated Force Method of Analysis. Design Optimization Research Topics are singularity alleviation enhances structural optimization methods, computer based design capability extended through substructure synthesis, and optimality criteria provides optimum design for a select class of structural problems. Integrated Force Method of Analysis Research Topics are boundary compatibility formulation improves stress analysis of shell structures. Brief descriptions of the four topics are appended.
Cyclone performance and optimization
Leith, D.
1990-12-15
An empirical model for predicting pressure drop across a cyclone, developed by Dirgo (1988), is presented. The model was developed through a statistical analysis of pressure drop data for 98 cyclone designs. This model is used with the efficiency model of Iozia and Leith (1990) to develop an optimization curve which predicts the minimum pressure drop on the dimension ratios of the optimized cyclone for a given aerodynamic cut diameter, d{sub 50}. The effect of variation in cyclone height, cyclone diameter, and flow on the optimization is determined. The optimization results are used to develop a design procedure for optimized cyclones. 33 refs., 10 figs., 4 tabs.
McGuire-Snieckus, Rebecca
2014-01-01
Optimism is generally accepted by psychiatrists, psychologists and other caring professionals as a feature of mental health. Interventions typically rely on cognitive-behavioural tools to encourage individuals to ‘stop negative thought cycles’ and to ‘challenge unhelpful thoughts’. However, evidence suggests that most individuals have persistent biases of optimism and that excessive optimism is not conducive to mental health. How helpful is it to facilitate optimism in individuals who are likely to exhibit biases of optimism already? By locating the cause of distress at the individual level and ‘unhelpful’ cognitions, does this minimise wider systemic social and economic influences on mental health? PMID:25237497
Integrated controls design optimization
Lou, Xinsheng; Neuschaefer, Carl H.
2015-09-01
A control system (207) for optimizing a chemical looping process of a power plant includes an optimizer (420), an income algorithm (230) and a cost algorithm (225) and a chemical looping process models. The process models are used to predict the process outputs from process input variables. Some of the process in puts and output variables are related to the income of the plant; and some others are related to the cost of the plant operations. The income algorithm (230) provides an income input to the optimizer (420) based on a plurality of input parameters (215) of the power plant. The cost algorithm (225) provides a cost input to the optimizer (420) based on a plurality of output parameters (220) of the power plant. The optimizer (420) determines an optimized operating parameter solution based on at least one of the income input and the cost input, and supplies the optimized operating parameter solution to the power plant.
NASA Technical Reports Server (NTRS)
Venter, Gerhard; Sobieszczanski-Sobieski Jaroslaw
2002-01-01
The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.
Supercomputer optimizations for stochastic optimal control applications
NASA Technical Reports Server (NTRS)
Chung, Siu-Leung; Hanson, Floyd B.; Xu, Huihuang
1991-01-01
Supercomputer optimizations for a computational method of solving stochastic, multibody, dynamic programming problems are presented. The computational method is valid for a general class of optimal control problems that are nonlinear, multibody dynamical systems, perturbed by general Markov noise in continuous time, i.e., nonsmooth Gaussian as well as jump Poisson random white noise. Optimization techniques for vector multiprocessors or vectorizing supercomputers include advanced data structures, loop restructuring, loop collapsing, blocking, and compiler directives. These advanced computing techniques and superconducting hardware help alleviate Bellman's curse of dimensionality in dynamic programming computations, by permitting the solution of large multibody problems. Possible applications include lumped flight dynamics models for uncertain environments, such as large scale and background random aerospace fluctuations.
NASA Technical Reports Server (NTRS)
Wheeler, Ward C.
2003-01-01
The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.
Wheeler, Ward C
2003-08-01
The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. PMID:14531408
Zhou, Zhi; de Bedout, Juan Manuel; Kern, John Michael; Biyik, Emrah; Chandra, Ramu Sharat
2013-01-22
A system for optimizing customer utility usage in a utility network of customer sites, each having one or more utility devices, where customer site is communicated between each of the customer sites and an optimization server having software for optimizing customer utility usage over one or more networks, including private and public networks. A customer site model for each of the customer sites is generated based upon the customer site information, and the customer utility usage is optimized based upon the customer site information and the customer site model. The optimization server can be hosted by an external source or within the customer site. In addition, the optimization processing can be partitioned between the customer site and an external source.
Homotopy optimization methods for global optimization.
Dunlavy, Daniel M.; O'Leary, Dianne P.
2005-12-01
We define a new method for global optimization, the Homotopy Optimization Method (HOM). This method differs from previous homotopy and continuation methods in that its aim is to find a minimizer for each of a set of values of the homotopy parameter, rather than to follow a path of minimizers. We define a second method, called HOPE, by allowing HOM to follow an ensemble of points obtained by perturbation of previous ones. We relate this new method to standard methods such as simulated annealing and show under what circumstances it is superior. We present results of extensive numerical experiments demonstrating performance of HOM and HOPE.
Structural optimization using optimality criteria methods
NASA Technical Reports Server (NTRS)
Khot, N. S.; Berke, L.
1984-01-01
Optimality criteria methods take advantage of some concepts as those of statically determinate or indeterminate structures, and certain variational principles of structural dynamics, to develop efficient algorithms for the sizing of structures that are subjected to stiffness-related constraints. Some of the methods and iterative strategies developed over the last decade for calculations of the Lagrange multipliers in stressand displacement-limited problems, as well as for satisfying the appropriate optimality criterion, are discussed. The application of these methods are illustrated by solving problems with stress and displacement constraints.
Conceptual design optimization study
NASA Technical Reports Server (NTRS)
Hollowell, S. J.; Beeman, E. R., II; Hiyama, R. M.
1990-01-01
The feasibility of applying multilevel functional decomposition and optimization techniques to conceptual design of advanced fighter aircraft was investigated. Applying the functional decomposition techniques to the conceptual design phase appears to be feasible. The initial implementation of the modified design process will optimize wing design variables. A hybrid approach, combining functional decomposition techniques for generation of aerodynamic and mass properties linear sensitivity derivatives with existing techniques for sizing mission performance and optimization, is proposed.
Smoothers for Optimization Problems
NASA Technical Reports Server (NTRS)
Arian, Eyal; Ta'asan, Shlomo
1996-01-01
We present a multigrid one-shot algorithm, and a smoothing analysis, for the numerical solution of optimal control problems which are governed by an elliptic PDE. The analysis provides a simple tool to determine a smoothing minimization process which is essential for multigrid application. Numerical results include optimal control of boundary data using different discretization schemes and an optimal shape design problem in 2D with Dirichlet boundary conditions.
Control and optimization system
Xinsheng, Lou
2013-02-12
A system for optimizing a power plant includes a chemical loop having an input for receiving an input parameter (270) and an output for outputting an output parameter (280), a control system operably connected to the chemical loop and having a multiple controller part (230) comprising a model-free controller. The control system receives the output parameter (280), optimizes the input parameter (270) based on the received output parameter (280), and outputs an optimized input parameter (270) to the input of the chemical loop to control a process of the chemical loop in an optimized manner.
Face sketch synthesis via sparse representation-based greedy search.
Shengchuan Zhang; Xinbo Gao; Nannan Wang; Jie Li; Mingjin Zhang
2015-08-01
Face sketch synthesis has wide applications in digital entertainment and law enforcement. Although there is much research on face sketch synthesis, most existing algorithms cannot handle some nonfacial factors, such as hair style, hairpins, and glasses if these factors are excluded in the training set. In addition, previous methods only work on well controlled conditions and fail on images with different backgrounds and sizes as the training set. To this end, this paper presents a novel method that combines both the similarity between different image patches and prior knowledge to synthesize face sketches. Given training photo-sketch pairs, the proposed method learns a photo patch feature dictionary from the training photo patches and replaces the photo patches with their sparse coefficients during the searching process. For a test photo patch, we first obtain its sparse coefficient via the learnt dictionary and then search its nearest neighbors (candidate patches) in the whole training photo patches with sparse coefficients. After purifying the nearest neighbors with prior knowledge, the final sketch corresponding to the test photo can be obtained by Bayesian inference. The contributions of this paper are as follows: 1) we relax the nearest neighbor search area from local region to the whole image without too much time consuming and 2) our method can produce nonfacial factors that are not contained in the training set and is robust against image backgrounds and can even ignore the alignment and image size aspects of test photos. Our experimental results show that the proposed method outperforms several state-of-the-arts in terms of perceptual and objective metrics. PMID:25879946
NASA Astrophysics Data System (ADS)
Birnir, Bjorn; Rowlett, Julie
2010-05-01
We show that the land-surface equation of Birnir, Smith and Merchant, describing erosion of transport limited surfaces have unique weak solutions. The theory of optimal transport is then used to show that these equations constitute an optimal transport of the sediment by the water flow.
Stenholm, Ake; Holmström, Sara; Hjärthag, Sandra; Lind, Ola
2012-01-01
Trace-level analysis of alkylphenol polyethoxylates (APEOs) in wastewater containing sludge requires the prior removal of contaminants and preconcentration. In this study, the effects on optimal work-up procedures of the types of alkylphenols present, their degree of ethoxylation, the biofilm wastewater treatment and the sample matrix were investigated for these purposes. The sampling spot for APEO-containing specimens from an industrial wastewater treatment plant was optimized, including a box that surrounded the tubing outlet carrying the wastewater, to prevent sedimented sludge contaminating the collected samples. Following these changes, the sampling precision (in terms of dry matter content) at a point just under the tubing leading from the biofilm reactors was 0.7% RSD. The findings were applied to develop a work-up procedure for use prior to a high-performance liquid chromatography-fluorescence detection analysis method capable of quantifying nonylphenol polyethoxylates (NPEOs) and poorly investigated dinonylphenol polyethoxylates (DNPEOs) at low microg L(-1) concentrations in effluents from non-activated sludge biofilm reactors. The selected multi-step work-up procedure includes lyophilization and pressurized fluid extraction (PFE) followed by strong ion exchange solid phase extraction (SPE). The yields of the combined procedure, according to tests with NP10EO-spiked effluent from a wastewater treatment plant, were in the 62-78% range. PMID:22519096
Data communication network optimization
Hessel, S.R.
1987-01-01
Research that will ultimately improve the quality of the decisions made in the design of packet-data communication networks is described. Three topics are specifically addressed: an unusually general method of optimizing networks is developed; a network model is developed that facilitates the optimization and it itself valuable; and the statistical nature of the data-communication traffic on networks is examined to support the model. The model permits the analysis of delays in heterogeneous networks of complex topology. The focus of this dissertation is on the optimization of networks. The optimization is built upon the model. The algorithm varies capacity and routing to minimize network cost. The capacity-assignment algorithm developed is an iterative algorithm that allows arbitrarily complex queuing models to be used. It is because of this algorithm that the optimization can be applied to a wide range of heterogeneous network. The routing algorithms is basically the flow deviation algorithm of Gerla.
Optimal Limited Contingency Planning
NASA Technical Reports Server (NTRS)
Meuleau, Nicolas; Smith, David E.
2003-01-01
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications where it is desirable to strictly limit the number of decision points and branches in a plan. This raises the question of how one goes about finding optimal plans containing only a limited number of branches. In this paper, we present an any-time algorithm for optimal k-contingency planning. It is the first optimal algorithm for limited contingency planning that is not an explicit enumeration of possible contingent plans. By modelling the problem as a partially observable Markov decision process, it implements the Bellman optimality principle and prunes the solution space. We present experimental results of applying this algorithm to some simple test cases.
Algorithms for bilevel optimization
NASA Technical Reports Server (NTRS)
Alexandrov, Natalia; Dennis, J. E., Jr.
1994-01-01
General multilevel nonlinear optimization problems arise in design of complex systems and can be used as a means of regularization for multi-criteria optimization problems. Here, for clarity in displaying our ideas, we restrict ourselves to general bi-level optimization problems, and we present two solution approaches. Both approaches use a trust-region globalization strategy, and they can be easily extended to handle the general multilevel problem. We make no convexity assumptions, but we do assume that the problem has a nondegenerate feasible set. We consider necessary optimality conditions for the bi-level problem formulations and discuss results that can be extended to obtain multilevel optimization formulations with constraints at each level.
NASA Astrophysics Data System (ADS)
Dharmaseelan, Anoop; Adistambha, Keyne D.
2015-05-01
Fuel cost accounts for 40 percent of the operating cost of an airline. Fuel cost can be minimized by planning a flight on optimized routes. The routes can be optimized by searching best connections based on the cost function defined by the airline. The most common algorithm that used to optimize route search is Dijkstra's. Dijkstra's algorithm produces a static result and the time taken for the search is relatively long. This paper experiments a new algorithm to optimize route search which combines the principle of simulated annealing and genetic algorithm. The experimental results of route search, presented are shown to be computationally fast and accurate compared with timings from generic algorithm. The new algorithm is optimal for random routing feature that is highly sought by many regional operators.
Optimal control computer programs
NASA Technical Reports Server (NTRS)
Kuo, F.
1992-01-01
The solution of the optimal control problem, even with low order dynamical systems, can usually strain the analytical ability of most engineers. The understanding of this subject matter, therefore, would be greatly enhanced if a software package existed that could simulate simple generic problems. Surprisingly, despite a great abundance of commercially available control software, few, if any, address the part of optimal control in its most generic form. The purpose of this paper is, therefore, to present a simple computer program that will perform simulations of optimal control problems that arise from the first necessary condition and the Pontryagin's maximum principle.
Thermophotovoltaic Array Optimization
SBurger; E Brown; K Rahner; L Danielson; J Openlander; J Vell; D Siganporia
2004-07-29
A systematic approach to thermophotovoltaic (TPV) array design and fabrication was used to optimize the performance of a 192-cell TPV array. The systematic approach began with cell selection criteria that ranked cells and then matched cell characteristics to maximize power output. Following cell selection, optimization continued with an array packaging design and fabrication techniques that introduced negligible electrical interconnect resistance and minimal parasitic losses while maintaining original cell electrical performance. This paper describes the cell selection and packaging aspects of array optimization as applied to fabrication of a 192-cell array.
Optimization of evaporative cooling
NASA Astrophysics Data System (ADS)
Sackett, C. A.; Bradley, C. C.; Hulet, R. G.
1997-05-01
Recent experiments have used forced evaporative cooling to produce Bose-Einstein condensation in dilute gases. The evaporative cooling process can be optimized to provide the maximum phase-space density with a specified number of atoms remaining. We show that this global optimization is approximately achieved by locally optimizing the cooling efficiency at each instant. We discuss how this method can be implemented, and present the results for our 7Li trap. The predicted behavior of the gas is found to agree well with experiment.
Denis Rldzal, Drew Kouri
2014-05-13
ROL provides interfaces to and implementations of algorithms for gradient-based unconstrained and constrained optimization. ROL can be used to optimize the response of any client simulation code that evaluates scalar-valued response functions. If the client code can provide gradient information for the response function, ROL will take advantage of it, resulting in faster runtimes. ROL's interfaces are matrix-free, in other words ROL only uses evaluations of scalar-valued and vector-valued functions. ROL can be used to solve optimal design problems and inverse problems based on a variety of simulation software.
2014-05-13
ROL provides interfaces to and implementations of algorithms for gradient-based unconstrained and constrained optimization. ROL can be used to optimize the response of any client simulation code that evaluates scalar-valued response functions. If the client code can provide gradient information for the response function, ROL will take advantage of it, resulting in faster runtimes. ROL's interfaces are matrix-free, in other words ROL only uses evaluations of scalar-valued and vector-valued functions. ROL can be used tomore » solve optimal design problems and inverse problems based on a variety of simulation software.« less
TOOLKIT FOR ADVANCED OPTIMIZATION
2000-10-13
The TAO project focuses on the development of software for large scale optimization problems. TAO uses an object-oriented design to create a flexible toolkit with strong emphasis on the reuse of external tools where appropriate. Our design enables bi-directional connection to lower level linear algebra support (for example, parallel sparse matrix data structures) as well as higher level application frameworks. The Toolkist for Advanced Optimization (TAO) is aimed at teh solution of large-scale optimization problemsmore » on high-performance architectures. Our main goals are portability, performance, scalable parallelism, and an interface independent of the architecture. TAO is suitable for both single-processor and massively-parallel architectures. The current version of TAO has algorithms for unconstrained and bound-constrained optimization.« less
A. S. Hofler; P. Evtushenko; M. Krasilnikov
2007-08-01
Injector gun design is an iterative process where the designer optimizes a few nonlinearly interdependent beam parameters to achieve the required beam quality for a particle accelerator. Few tools exist to automate the optimization process and thoroughly explore the parameter space. The challenging beam requirements of new accelerator applications such as light sources and electron cooling devices drive the development of RF and SRF photo injectors. RF and SRF gun design is further complicated because the bunches are space charge dominated and require additional emittance compensation. A genetic algorithm has been successfully used to optimize DC photo injector designs for Cornell* and Jefferson Lab**, and we propose studying how the genetic algorithm techniques can be applied to the design of RF and SRF gun injectors. In this paper, we report on the initial phase of the study where we model and optimize gun designs that have been benchmarked with beam measurements and simulation.
Library for Nonlinear Optimization
2001-10-09
OPT++ is a C++ object-oriented library for nonlinear optimization. This incorporates an improved implementation of an existing capability and two new algorithmic capabilities based on existing journal articles and freely available software.
Topology optimized microbioreactors.
Schäpper, Daniel; Lencastre Fernandes, Rita; Lantz, Anna Eliasson; Okkels, Fridolin; Bruus, Henrik; Gernaey, Krist V
2011-04-01
This article presents the fusion of two hitherto unrelated fields--microbioreactors and topology optimization. The basis for this study is a rectangular microbioreactor with homogeneously distributed immobilized brewers yeast cells (Saccharomyces cerevisiae) that produce a recombinant protein. Topology optimization is then used to change the spatial distribution of cells in the reactor in order to optimize for maximal product flow out of the reactor. This distribution accounts for potentially negative effects of, for example, by-product inhibition. We show that the theoretical improvement in productivity is at least fivefold compared with the homogeneous reactor. The improvements obtained by applying topology optimization are largest where either nutrition is scarce or inhibition effects are pronounced. PMID:21404253
General shape optimization capability
NASA Technical Reports Server (NTRS)
Chargin, Mladen K.; Raasch, Ingo; Bruns, Rudolf; Deuermeyer, Dawson
1991-01-01
A method is described for calculating shape sensitivities, within MSC/NASTRAN, in a simple manner without resort to external programs. The method uses natural design variables to define the shape changes in a given structure. Once the shape sensitivities are obtained, the shape optimization process is carried out in a manner similar to property optimization processes. The capability of this method is illustrated by two examples: the shape optimization of a cantilever beam with holes, loaded by a point load at the free end (with the shape of the holes and the thickness of the beam selected as the design variables), and the shape optimization of a connecting rod subjected to several different loading and boundary conditions.
Nuclear Energy Density Optimization
Kortelainen, Erno M; Lesinski, Thomas; More, J.; Nazarewicz, W.; Sarich, J.; Schunck, N.; Stoitsov, M. V.; Wild, S.
2010-01-01
We carry out state-of-the-art optimization of a nuclear energy density of Skyrme type in the framework of the Hartree-Fock-Bogoliubov (HFB) theory. The particle-hole and particle-particle channels are optimized simultaneously, and the experimental data set includes both spherical and deformed nuclei. The new model-based, derivative-free optimization algorithm used in this work has been found to be significantly better than standard optimization methods in terms of reliability, speed, accuracy, and precision. The resulting parameter set UNEDFpre results in good agreement with experimental masses, radii, and deformations and seems to be free of finite-size instabilities. An estimate of the reliability of the obtained parameterization is given, based on standard statistical methods. We discuss new physics insights offered by the advanced covariance analysis.
Propeller design by optimization
NASA Technical Reports Server (NTRS)
Rizk, M. H.; Jou, W.-H.
1986-01-01
The feasibility of designing propellers by an optimization procedure is investigated. A scheme, which solves the full potential flow equation about a propeller by line relaxation, is modified so that the iterative solutions of the flow equation and the design parameters are updated simultaneously. Some technical problems in using optimization for designing propellers with maximum efficiency are identified. Approaches for overcoming these problems are presented.
Kawase, Mitsuhiro
2009-11-22
The zipped file contains a directory of data and routines used in the NNMREC turbine depth optimization study (Kawase et al., 2011), and calculation results thereof. For further info, please contact Mitsuhiro Kawase at kawase@uw.edu. Reference: Mitsuhiro Kawase, Patricia Beba, and Brian Fabien (2011), Finding an Optimal Placement Depth for a Tidal In-Stream Conversion Device in an Energetic, Baroclinic Tidal Channel, NNMREC Technical Report.
Modeling using optimization routines
NASA Technical Reports Server (NTRS)
Thomas, Theodore
1995-01-01
Modeling using mathematical optimization dynamics is a design tool used in magnetic suspension system development. MATLAB (software) is used to calculate minimum cost and other desired constraints. The parameters to be measured are programmed into mathematical equations. MATLAB will calculate answers for each set of inputs; inputs cover the boundary limits of the design. A Magnetic Suspension System using Electromagnets Mounted in a Plannar Array is a design system that makes use of optimization modeling.
Software for global optimization
Mockus, L.
1994-12-31
The interactive graphical software that implements numeric methods and other techniques to solve global optimization problems is presented. The Bayesian approach to the optimization is the underlying idea of numeric methods used. Software is designed to solve deterministic and stochastic problems of different complexity and with many variables. It includes global and local optimization methods for differentiable and nondifferentiable functions. Implemented numerical techniques for global optimization vary from simple Monte-Carlo simulation to Bayesian methods by J. Mockus and extrapolation theory based methods by Zilinskas. Local optimization techniques includes simplex method of Nelder and Mead method of nonlinear programming by Shitkowski, and method of stochastic approximation with Bayesian step size control by J. Mockus. Software is interactive, it allows user to start and stop chosen method of global or local optimization, define and change its parameters and examine the solution process. Out-put from solution process is both numerical and graphical. Currently available graphical features are the projection of the objective function on a chosen plane and convergence plot. Both these features let the user easily observe solution process and interactively modify it. More features can be added in a standard way. It is up to the user how many graphical and numerical output features activate or deactivate at any given time. Software is implemented in C++ using X Windows as graphical platform.
Cyclone performance and optimization
Leith, D.
1990-09-15
The objectives of this project are: to characterize the gas flow pattern within cyclones, to revise the theory for cyclone performance on the basis of these findings, and to design and test cyclones whose dimensions have been optimized using revised performance theory. This work is important because its successful completion will aid in the technology for combustion of coal in pressurized, fluidized beds. This quarter, an empirical model for predicting pressure drop across a cyclone was developed through a statistical analysis of pressure drop data for 98 cyclone designs. The model is shown to perform better than the pressure drop models of First (1950), Alexander (1949), Barth (1956), Stairmand (1949), and Shepherd-Lapple (1940). This model is used with the efficiency model of Iozia and Leith (1990) to develop an optimization curve which predicts the minimum pressure drop and the dimension rations of the optimized cyclone for a given aerodynamic cut diameter, d{sub 50}. The effect of variation in cyclone height, cyclone diameter, and flow on the optimization curve is determined. The optimization results are used to develop a design procedure for optimized cyclones. 37 refs., 10 figs., 4 tabs.
Optimization using Extremal Dynamics
NASA Astrophysics Data System (ADS)
Boettcher, Stefan
2001-03-01
We explore a new heuristic for finding high-quality solutions to NP-hard optimization problems which we have recently introduced [see ``Nature's Way of Optimizing," Artificial Intelligence 119, 275-286 (2000) and cond-mat/0010337]. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. Extremal optimization successively replaces extremely undesirable elements of a single sub-optimal solution with new, random ones. Large fluctuations ensue that efficiently explore many local optima. With only one adjustable parameter, its performance has proved competitive with more elaborate methods, especially near phase transitions which are believed to contain the hardest instances. In particular, extremal optimization is superior to simulated annealing in the partitioning of sparse graphs, it finds the overlap of all ground-states at the phase transition of the 3-coloring problem, and it provides independent confirmation for the ground-state energy of spin glasses, previously obtained with elaborate genetic algorithms.
NASA Astrophysics Data System (ADS)
Wecker, Dave; Hastings, Matthew B.; Troyer, Matthias
2016-08-01
We study a variant of the quantum approximate optimization algorithm [E. Farhi, J. Goldstone, and S. Gutmann, arXiv:1411.4028] with a slightly different parametrization and a different objective: rather than looking for a state which approximately solves an optimization problem, our goal is to find a quantum algorithm that, given an instance of the maximum 2-satisfiability problem (MAX-2-SAT), will produce a state with high overlap with the optimal state. Using a machine learning approach, we chose a "training set" of instances and optimized the parameters to produce a large overlap for the training set. We then tested these optimized parameters on a larger instance set. As a training set, we used a subset of the hard instances studied by Crosson, Farhi, C. Y.-Y. Lin, H.-H. Lin, and P. Shor (CFLLS) (arXiv:1401.7320). When tested, on the full set, the parameters that we find produce a significantly larger overlap than the optimized annealing times of CFLLS. Testing on other random instances from 20 to 28 bits continues to show improvement over annealing, with the improvement being most notable on the hardest instances. Further tests on instances of MAX-3-SAT also showed improvement on the hardest instances. This algorithm may be a possible application for near-term quantum computers with limited coherence times.
Thermoacoustic Refrigerator's Stack Optimization
NASA Astrophysics Data System (ADS)
El-Fawal, Mawahib Hassan; Mohd-Ghazali, Normah; Yaacob, Mohd. Shafik; Darus, Amer Nordin
2010-06-01
The standing wave thermoacoustic refrigerator, which uses sound generation to transfer heat, was developed rapidly during the past four decades. It was regarded as a new, promising and environmentally benign alternative to conventional compression vapor refrigerators, although it was not competitive regarding the coefficient of performance (COP) yet. Thus the aim of this paper is to enhance thermoacoustic refrigerator's stack performance through optimization. A computational optimization procedure of thermoacoustic stack design was fully developed. The procedure was designed to achieve optimal coefficient of performance based on most of the design and operating parameters. Cooling load and acoustic power governing equations were set assuming the linear thermoacoustic theory. Lagrange multipliers method was used as an optimization technique tool to solve the governing equations. Numerical analyses results of the developed design procedure are presented. The results showed that the stack design parameters are the most significant parameters for the optimal overall performance. The coefficient of performance obtained increases by about 48.8% from the published experimental optimization methods. The results are in good agreement with past established studies.
NASA Technical Reports Server (NTRS)
Rasmussen, John
1990-01-01
Structural optimization has attracted the attention since the days of Galileo. Olhoff and Taylor have produced an excellent overview of the classical research within this field. However, the interest in structural optimization has increased greatly during the last decade due to the advent of reliable general numerical analysis methods and the computer power necessary to use them efficiently. This has created the possibility of developing general numerical systems for shape optimization. Several authors, eg., Esping; Braibant & Fleury; Bennet & Botkin; Botkin, Yang, and Bennet; and Stanton have published practical and successful applications of general optimization systems. Ding and Homlein have produced extensive overviews of available systems. Furthermore, a number of commercial optimization systems based on well-established finite element codes have been introduced. Systems like ANSYS, IDEAS, OASIS, and NISAOPT are widely known examples. In parallel to this development, the technology of computer aided design (CAD) has gained a large influence on the design process of mechanical engineering. The CAD technology has already lived through a rapid development driven by the drastically growing capabilities of digital computers. However, the systems of today are still considered as being only the first generation of a long row of computer integrated manufacturing (CIM) systems. These systems to come will offer an integrated environment for design, analysis, and fabrication of products of almost any character. Thus, the CAD system could be regarded as simply a database for geometrical information equipped with a number of tools with the purpose of helping the user in the design process. Among these tools are facilities for structural analysis and optimization as well as present standard CAD features like drawing, modeling, and visualization tools. The state of the art of structural optimization is that a large amount of mathematical and mechanical techniques are
1998-07-01
GenOpt is a generic optimization program for nonlinear, constrained optimization. For evaluating the objective function, any simulation program that communicates over text files can be coupled to GenOpt without code modification. No analytic properties of the objective function are used by GenOpt. ptimization algorithms and numerical methods can be implemented in a library and shared among users. Gencpt offers an interlace between the optimization algorithm and its kernel to make the implementation of new algorithmsmore » fast and easy. Different algorithms of constrained and unconstrained minimization can be added to a library. Algorithms for approximation derivatives and performing line-search will be implemented. The objective function is evaluated as a black-box function by an external simulation program. The kernel of GenOpt deals with the data I/O, result sotrage and report, interlace to the external simulation program, and error handling. An abstract optimization class offers methods to interface the GenOpt kernel and the optimization algorithm library.« less
Optimization of Heat Exchangers
Ivan Catton
2010-10-01
The objective of this research is to develop tools to design and optimize heat exchangers (HE) and compact heat exchangers (CHE) for intermediate loop heat transport systems found in the very high temperature reator (VHTR) and other Generation IV designs by addressing heat transfer surface augmentation and conjugate modeling. To optimize heat exchanger, a fast running model must be created that will allow for multiple designs to be compared quickly. To model a heat exchanger, volume averaging theory, VAT, is used. VAT allows for the conservation of mass, momentum and energy to be solved for point by point in a 3 dimensional computer model of a heat exchanger. The end product of this project is a computer code that can predict an optimal configuration for a heat exchanger given only a few constraints (input fluids, size, cost, etc.). As VAT computer code can be used to model characteristics )pumping power, temperatures, and cost) of heat exchangers more quickly than traditional CFD or experiment, optimization of every geometric parameter simultaneously can be made. Using design of experiment, DOE and genetric algorithms, GE, to optimize the results of the computer code will improve heat exchanger disign.
McMordie Stoughton, Kate; Duan, Xiaoli; Wendel, Emily M.
2013-08-26
This technology evaluation was prepared by Pacific Northwest National Laboratory on behalf of the U.S. Department of Energy’s Federal Energy Management Program (FEMP). ¬The technology evaluation assesses techniques for optimizing reverse osmosis (RO) systems to increase RO system performance and water efficiency. This evaluation provides a general description of RO systems, the influence of RO systems on water use, and key areas where RO systems can be optimized to reduce water and energy consumption. The evaluation is intended to help facility managers at Federal sites understand the basic concepts of the RO process and system optimization options, enabling them to make informed decisions during the system design process for either new projects or recommissioning of existing equipment. This evaluation is focused on commercial-sized RO systems generally treating more than 80 gallons per hour.¬
2013-08-01
This technology evaluation was prepared by Pacific Northwest National Laboratory on behalf of the U.S. Department of Energy’s Federal Energy Management Program (FEMP). The technology evaluation assesses techniques for optimizing reverse osmosis (RO) systems to increase RO system performance and water efficiency. This evaluation provides a general description of RO systems, the influence of RO systems on water use, and key areas where RO systems can be optimized to reduce water and energy consumption. The evaluation is intended to help facility managers at Federal sites understand the basic concepts of the RO process and system optimization options, enabling them to make informed decisions during the system design process for either new projects or recommissioning of existing equipment. This evaluation is focused on commercial-sized RO systems generally treating more than 80 gallons per hour.
Johnson, E.A.; Leung, C.; Schira, J.J.
1983-03-01
A closed loop timing optimization control for an internal combustion engine closed about the instantaneous rotational velocity of the engine's crankshaft is disclosed herein. The optimization control computes from the instantaneous rotational velocity of the engine's crankshaft, a signal indicative of the angle at which the crankshaft has a maximum rotational velocity for the torque impulses imparted to the engine's crankshaft by the burning of an air/fuel mixture in each of the engine's combustion chambers and generates a timing correction signal for each of the engine's combustion chambers. The timing correction signals, applied to the engine timing control, modifies the time at which the ignition signal, injection signals or both are generated such that the rotational velocity of the engine's crankshaft has a maximum value at a predetermined angle for each torque impulse generated optimizing the conversion of the combustion energy to rotational torque.
Optimal symmetric flight studies
NASA Technical Reports Server (NTRS)
Weston, A. R.; Menon, P. K. A.; Bilimoria, K. D.; Cliff, E. M.; Kelley, H. J.
1985-01-01
Several topics in optimal symmetric flight of airbreathing vehicles are examined. In one study, an approximation scheme designed for onboard real-time energy management of climb-dash is developed and calculations for a high-performance aircraft presented. In another, a vehicle model intermediate in complexity between energy and point-mass models is explored and some quirks in optimal flight characteristics peculiar to the model uncovered. In yet another study, energy-modelling procedures are re-examined with a view to stretching the range of validity of zeroth-order approximation by special choice of state variables. In a final study, time-fuel tradeoffs in cruise-dash are examined for the consequences of nonconvexities appearing in the classical steady cruise-dash model. Two appendices provide retrospective looks at two early publications on energy modelling and related optimal control theory.
Fuzzy logic controller optimization
Sepe, Jr., Raymond B; Miller, John Michael
2004-03-23
A method is provided for optimizing a rotating induction machine system fuzzy logic controller. The fuzzy logic controller has at least one input and at least one output. Each input accepts a machine system operating parameter. Each output produces at least one machine system control parameter. The fuzzy logic controller generates each output based on at least one input and on fuzzy logic decision parameters. Optimization begins by obtaining a set of data relating each control parameter to at least one operating parameter for each machine operating region. A model is constructed for each machine operating region based on the machine operating region data obtained. The fuzzy logic controller is simulated with at least one created model in a feedback loop from a fuzzy logic output to a fuzzy logic input. Fuzzy logic decision parameters are optimized based on the simulation.
Optimally combined confidence limits
NASA Astrophysics Data System (ADS)
Janot, P.; Le Diberder, F.
1998-02-01
An analytical and optimal procedure to combine statistically independent sets of confidence levels on a quantity is presented. This procedure does not impose any constraint on the methods followed by each analysis to derive its own limit. It incorporates the a priori statistical power of each of the analyses to be combined, in order to optimize the overall sensitivity. It can, in particular, be used to combine the mass limits obtained by several analyses searching for the Higgs boson in different decay channels, with different selection efficiencies, mass resolution and expected background. It can also be used to combine the mass limits obtained by several experiments (e.g. ALEPH, DELPHI, L3 and OPAL, at LEP 2) independently of the method followed by each of these experiments to derive their own limit. A method to derive the limit set by one analysis is also presented, along with an unbiased prescription to optimize the expected mass limit in the no-signal-hypothesis.
Optimization of Combinatorial Mutagenesis
NASA Astrophysics Data System (ADS)
Parker, Andrew S.; Griswold, Karl E.; Bailey-Kellogg, Chris
Protein engineering by combinatorial site-directed mutagenesis evaluates a portion of the sequence space near a target protein, seeking variants with improved properties (stability, activity, immunogenicity, etc.). In order to improve the hit-rate of beneficial variants in such mutagenesis libraries, we develop methods to select optimal positions and corresponding sets of the mutations that will be used, in all combinations, in constructing a library for experimental evaluation. Our approach, OCoM (Optimization of Combinatorial Mutagenesis), encompasses both degenerate oligonucleotides and specified point mutations, and can be directed accordingly by requirements of experimental cost and library size. It evaluates the quality of the resulting library by one- and two-body sequence potentials, averaged over the variants. To ensure that it is not simply recapitulating extant sequences, it balances the quality of a library with an explicit evaluation of the novelty of its members. We show that, despite dealing with a combinatorial set of variants, in our approach the resulting library optimization problem is actually isomorphic to single-variant optimization. By the same token, this means that the two-body sequence potential results in an NP-hard optimization problem. We present an efficient dynamic programming algorithm for the one-body case and a practically-efficient integer programming approach for the general two-body case. We demonstrate the effectiveness of our approach in designing libraries for three different case study proteins targeted by previous combinatorial libraries - a green fluorescent protein, a cytochrome P450, and a beta lactamase. We found that OCoM worked quite efficiently in practice, requiring only 1 hour even for the massive design problem of selecting 18 mutations to generate 107 variants of a 443-residue P450. We demonstrate the general ability of OCoM in enabling the protein engineer to explore and evaluate trade-offs between quality and
Optimal Quantum Phase Estimation
Dorner, U.; Smith, B. J.; Lundeen, J. S.; Walmsley, I. A.; Demkowicz-Dobrzanski, R.; Banaszek, K.; Wasilewski, W.
2009-01-30
By using a systematic optimization approach, we determine quantum states of light with definite photon number leading to the best possible precision in optical two-mode interferometry. Our treatment takes into account the experimentally relevant situation of photon losses. Our results thus reveal the benchmark for precision in optical interferometry. Although this boundary is generally worse than the Heisenberg limit, we show that the obtained precision beats the standard quantum limit, thus leading to a significant improvement compared to classical interferometers. We furthermore discuss alternative states and strategies to the optimized states which are easier to generate at the cost of only slightly lower precision.
Cherniak, Christopher
2012-01-01
Combinatorial network optimization theory concerns minimization of connection costs among interconnected components in systems such as electronic circuits. As an organization principle, similar wiring minimization can be observed at various levels of nervous systems, invertebrate and vertebrate, including primate, from placement of the entire brain in the body down to the subcellular level of neuron arbor geometry. In some cases, the minimization appears either perfect, or as good as can be detected with current methods. One question such best-of-all-possible-brains results raise is, what is the map of such optimization, does it have a distinct neural domain? PMID:22230636
Terascale Optimal PDE Simulations
David Keyes
2009-07-28
The Terascale Optimal PDE Solvers (TOPS) Integrated Software Infrastructure Center (ISIC) was created to develop and implement algorithms and support scientific investigations performed by DOE-sponsored researchers. These simulations often involve the solution of partial differential equations (PDEs) on terascale computers. The TOPS Center researched, developed and deployed an integrated toolkit of open-source, optimal complexity solvers for the nonlinear partial differential equations that arise in many DOE application areas, including fusion, accelerator design, global climate change and reactive chemistry. The algorithms created as part of this project were also designed to reduce current computational bottlenecks by orders of magnitude on terascale computers, enabling scientific simulation on a scale heretofore impossible.
NASA Astrophysics Data System (ADS)
Ouaknin, Gaddiel; Laachi, Nabil; Delaney, Kris; Fredrickson, Glenn; Gibou, Frederic
2016-03-01
Directed self-assembly using block copolymers for positioning vertical interconnect access in integrated circuits relies on the proper shape of a confined domain in which polymers will self-assemble into the targeted design. Finding that shape, i.e., solving the inverse problem, is currently mainly based on trial and error approaches. We introduce a level-set based algorithm that makes use of a shape optimization strategy coupled with self-consistent field theory to solve the inverse problem in an automated way. It is shown that optimal shapes are found for different targeted topologies with accurate placement and distances between the different components.
Distributed Optimization System
Hurtado, John E.; Dohrmann, Clark R.; Robinett, III, Rush D.
2004-11-30
A search system and method for controlling multiple agents to optimize an objective using distributed sensing and cooperative control. The search agent can be one or more physical agents, such as a robot, and can be software agents for searching cyberspace. The objective can be: chemical sources, temperature sources, radiation sources, light sources, evaders, trespassers, explosive sources, time dependent sources, time independent sources, function surfaces, maximization points, minimization points, and optimal control of a system such as a communication system, an economy, a crane, and a multi-processor computer.
OPTIMIZING EXPOSURE MEASUREMENT TECHNIQUES
The research reported in this task description addresses one of a series of interrelated NERL tasks with the common goal of optimizing the predictive power of low cost, reliable exposure measurements for the planned Interagency National Children's Study (NCS). Specifically, we w...
ERIC Educational Resources Information Center
Cody, Martin L.
1974-01-01
Discusses the optimality of natural selection, ways of testing for optimum solutions to problems of time - or energy-allocation in nature, optimum patterns in spatial distribution and diet breadth, and how best to travel over a feeding area so that food intake is maximized. (JR)
Toward Optimal Transport Networks
NASA Technical Reports Server (NTRS)
Alexandrov, Natalia; Kincaid, Rex K.; Vargo, Erik P.
2008-01-01
Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.
Optimizing Computer Technology Integration
ERIC Educational Resources Information Center
Dillon-Marable, Elizabeth; Valentine, Thomas
2006-01-01
The purpose of this study was to better understand what optimal computer technology integration looks like in adult basic skills education (ABSE). One question guided the research: How is computer technology integration best conceptualized and measured? The study used the Delphi method to map the construct of computer technology integration and…
Optimization of digital designs
NASA Technical Reports Server (NTRS)
Whitaker, Sterling R. (Inventor); Miles, Lowell H. (Inventor)
2009-01-01
An application specific integrated circuit is optimized by translating a first representation of its digital design to a second representation. The second representation includes multiple syntactic expressions that admit a representation of a higher-order function of base Boolean values. The syntactic expressions are manipulated to form a third representation of the digital design.
Fourier Series Optimization Opportunity
ERIC Educational Resources Information Center
Winkel, Brian
2008-01-01
This note discusses the introduction of Fourier series as an immediate application of optimization of a function of more than one variable. Specifically, it is shown how the study of Fourier series can be motivated to enrich a multivariable calculus class. This is done through discovery learning and use of technology wherein students build the…
Optimal ciliary beating patterns
NASA Astrophysics Data System (ADS)
Vilfan, Andrej; Osterman, Natan
2011-11-01
We introduce a measure for energetic efficiency of single or collective biological cilia. We define the efficiency of a single cilium as Q2 / P , where Q is the volume flow rate of the pumped fluid and P is the dissipated power. For ciliary arrays, we define it as (ρQ) 2 / (ρP) , with ρ denoting the surface density of cilia. We then numerically determine the optimal beating patterns according to this criterion. For a single cilium optimization leads to curly, somewhat counterintuitive patterns. But when looking at a densely ciliated surface, the optimal patterns become remarkably similar to what is observed in microorganisms like Paramecium. The optimal beating pattern then consists of a fast effective stroke and a slow sweeping recovery stroke. Metachronal waves lead to a significantly higher efficiency than synchronous beating. Efficiency also increases with an increasing density of cilia up to the point where crowding becomes a problem. We finally relate the pumping efficiency of cilia to the swimming efficiency of a spherical microorganism and show that the experimentally estimated efficiency of Paramecium is surprisingly close to the theoretically possible optimum.
Optimization of Systran System.
ERIC Educational Resources Information Center
Toma, Peter P.; And Others
This report describes an optimization phase of the SYSTRAN (System Translation) machine translation technique. The most distinctive characteristic of SYSTRAN is the absence of pre-editing; the program reads tapes containing raw and unedited Russian texts, carries out dictionary and table lookups, performs all syntactic analysis procedures, and…
ERIC Educational Resources Information Center
Rebilas, Krzysztof
2013-01-01
Consider a skier who goes down a takeoff ramp, attains a speed "V", and jumps, attempting to land as far as possible down the hill below (Fig. 1). At the moment of takeoff the angle between the skier's velocity and the horizontal is [alpha]. What is the optimal angle [alpha] that makes the jump the longest possible for the fixed magnitude of the…
Optimized multisectioned acoustic liners
NASA Technical Reports Server (NTRS)
Baumeister, K. J.
1979-01-01
A critical examination is presented of the use of optimized axially segmented acoustic liners to increase the attenuation of a liner. New calculations show that segmenting is most efficient at high frequencies with relatively long duct lengths where the attenuation is low for both uniform and segmented liners. Statistical considerations indicate little advantage in using optimized liners with more than two segments while the bandwidth of an optimized two-segment liner is shown to be nearly equal to that of a uniform liner. Multielement liner calculations show a large degradation in performance due to changes in assumed input modal structure. Finally, in order to substantiate previous and future analytical results, in-house (finite difference) and contractor (mode matching) programs are used to generate theoretical attenuations for a number of liner configurations for liners in a rectangular duct with no mean flow. Overall, the use of optimized multisectioned liners (sometimes called phased liners) fails to offer sufficient advantage over a uniform liner to warrant their use except in low frequency single mode application.
Optimization in Cardiovascular Modeling
NASA Astrophysics Data System (ADS)
Marsden, Alison L.
2014-01-01
Fluid mechanics plays a key role in the development, progression, and treatment of cardiovascular disease. Advances in imaging methods and patient-specific modeling now reveal increasingly detailed information about blood flow patterns in health and disease. Building on these tools, there is now an opportunity to couple blood flow simulation with optimization algorithms to improve the design of surgeries and devices, incorporating more information about the flow physics in the design process to augment current medical knowledge. In doing so, a major challenge is the need for efficient optimization tools that are appropriate for unsteady fluid mechanics problems, particularly for the optimization of complex patient-specific models in the presence of uncertainty. This article reviews the state of the art in optimization tools for virtual surgery, device design, and model parameter identification in cardiovascular flow and mechanobiology applications. In particular, it reviews trade-offs between traditional gradient-based methods and derivative-free approaches, as well as the need to incorporate uncertainties. Key future challenges are outlined, which extend to the incorporation of biological response and the customization of surgeries and devices for individual patients.
ERIC Educational Resources Information Center
Simmons, Joseph P.; Massey, Cade
2012-01-01
Is optimism real, or are optimistic forecasts just cheap talk? To help answer this question, we investigated whether optimistic predictions persist in the face of large incentives to be accurate. We asked National Football League football fans to predict the winner of a single game. Roughly half (the partisans) predicted a game involving their…
Optimizing Conferencing Freeware
ERIC Educational Resources Information Center
Baggaley, Jon; Klaas, Jim; Wark, Norine; Depow, Jim
2005-01-01
The increasing range of options provided by two popular conferencing freeware products, "Yahoo Messenger" and "MSN Messenger," are discussed. Each tool contains features designed primarily for entertainment purposes, which can be customized for use in online education. This report provides suggestions for optimizing the educational potential of…
ERIC Educational Resources Information Center
Homan, Michael; Worley, Penny
This course syllabus describes methods for optimizing online searching, using as an example searching on the National Library of Medicine (NLM) online system. Four major activities considered are the online interview, query analysis and search planning, online interaction, and post-search analysis. Within the context of these activities, concepts…
Optimal GENCO bidding strategy
NASA Astrophysics Data System (ADS)
Gao, Feng
Electricity industries worldwide are undergoing a period of profound upheaval. The conventional vertically integrated mechanism is being replaced by a competitive market environment. Generation companies have incentives to apply novel technologies to lower production costs, for example: Combined Cycle units. Economic dispatch with Combined Cycle units becomes a non-convex optimization problem, which is difficult if not impossible to solve by conventional methods. Several techniques are proposed here: Mixed Integer Linear Programming, a hybrid method, as well as Evolutionary Algorithms. Evolutionary Algorithms share a common mechanism, stochastic searching per generation. The stochastic property makes evolutionary algorithms robust and adaptive enough to solve a non-convex optimization problem. This research implements GA, EP, and PS algorithms for economic dispatch with Combined Cycle units, and makes a comparison with classical Mixed Integer Linear Programming. The electricity market equilibrium model not only helps Independent System Operator/Regulator analyze market performance and market power, but also provides Market Participants the ability to build optimal bidding strategies based on Microeconomics analysis. Supply Function Equilibrium (SFE) is attractive compared to traditional models. This research identifies a proper SFE model, which can be applied to a multiple period situation. The equilibrium condition using discrete time optimal control is then developed for fuel resource constraints. Finally, the research discusses the issues of multiple equilibria and mixed strategies, which are caused by the transmission network. Additionally, an advantage of the proposed model for merchant transmission planning is discussed. A market simulator is a valuable training and evaluation tool to assist sellers, buyers, and regulators to understand market performance and make better decisions. A traditional optimization model may not be enough to consider the distributed
An optimal structural design algorithm using optimality criteria
NASA Technical Reports Server (NTRS)
Taylor, J. E.; Rossow, M. P.
1976-01-01
An algorithm for optimal design is given which incorporates several of the desirable features of both mathematical programming and optimality criteria, while avoiding some of the undesirable features. The algorithm proceeds by approaching the optimal solution through the solutions of an associated set of constrained optimal design problems. The solutions of the constrained problems are recognized at each stage through the application of optimality criteria based on energy concepts. Two examples are described in which the optimal member size and layout of a truss is predicted, given the joint locations and loads.
Optimization of combinatorial mutagenesis.
Parker, Andrew S; Griswold, Karl E; Bailey-Kellogg, Chris
2011-11-01
Protein engineering by combinatorial site-directed mutagenesis evaluates a portion of the sequence space near a target protein, seeking variants with improved properties (e.g., stability, activity, immunogenicity). In order to improve the hit-rate of beneficial variants in such mutagenesis libraries, we develop methods to select optimal positions and corresponding sets of the mutations that will be used, in all combinations, in constructing a library for experimental evaluation. Our approach, OCoM (Optimization of Combinatorial Mutagenesis), encompasses both degenerate oligonucleotides and specified point mutations, and can be directed accordingly by requirements of experimental cost and library size. It evaluates the quality of the resulting library by one- and two-body sequence potentials, averaged over the variants. To ensure that it is not simply recapitulating extant sequences, it balances the quality of a library with an explicit evaluation of the novelty of its members. We show that, despite dealing with a combinatorial set of variants, in our approach the resulting library optimization problem is actually isomorphic to single-variant optimization. By the same token, this means that the two-body sequence potential results in an NP-hard optimization problem. We present an efficient dynamic programming algorithm for the one-body case and a practically-efficient integer programming approach for the general two-body case. We demonstrate the effectiveness of our approach in designing libraries for three different case study proteins targeted by previous combinatorial libraries--a green fluorescent protein, a cytochrome P450, and a beta lactamase. We found that OCoM worked quite efficiently in practice, requiring only 1 hour even for the massive design problem of selecting 18 mutations to generate 10⁷ variants of a 443-residue P450. We demonstrate the general ability of OCoM in enabling the protein engineer to explore and evaluate trade-offs between quality and
Collet, Timothé; Pietquin, Olivier
2015-01-01
Active learning is the problem of interactively constructing the training set used in classification in order to reduce its size. It would ideally successively add the instance-label pair that decreases the classification error most. However, the effect of the addition of a pair is not known in advance. It can still be estimated with the pairs already in the training set. The online minimization of the classification error involves a tradeoff between exploration and exploitation. This is a common problem in machine learning for which multiarmed bandit, using the approach of Optimism int the Face of Uncertainty, has proven very efficient these last years. This paper introduces three algorithms for the active learning problem in classification using Optimism in the Face of Uncertainty. Experiments lead on built-in problems and real world datasets demonstrate that they compare positively to state-of-the-art methods. PMID:26681934
Optimal Electric Utility Expansion
1989-10-10
SAGE-WASP is designed to find the optimal generation expansion policy for an electrical utility system. New units can be automatically selected from a user-supplied list of expansion candidates which can include hydroelectric and pumped storage projects. The existing system is modeled. The calculational procedure takes into account user restrictions to limit generation configurations to an area of economic interest. The optimization program reports whether the restrictions acted as a constraint on the solution. All expansionmore » configurations considered are required to pass a user supplied reliability criterion. The discount rate and escalation rate are treated separately for each expansion candidate and for each fuel type. All expenditures are separated into local and foreign accounts, and a weighting factor can be applied to foreign expenditures.« less
Optimal firing rate estimation
NASA Technical Reports Server (NTRS)
Paulin, M. G.; Hoffman, L. F.
2001-01-01
We define a measure for evaluating the quality of a predictive model of the behavior of a spiking neuron. This measure, information gain per spike (Is), indicates how much more information is provided by the model than if the prediction were made by specifying the neuron's average firing rate over the same time period. We apply a maximum Is criterion to optimize the performance of Gaussian smoothing filters for estimating neural firing rates. With data from bullfrog vestibular semicircular canal neurons and data from simulated integrate-and-fire neurons, the optimal bandwidth for firing rate estimation is typically similar to the average firing rate. Precise timing and average rate models are limiting cases that perform poorly. We estimate that bullfrog semicircular canal sensory neurons transmit in the order of 1 bit of stimulus-related information per spike.
Combinatorial optimization games
Deng, X.; Ibaraki, Toshihide; Nagamochi, Hiroshi
1997-06-01
We introduce a general integer programming formulation for a class of combinatorial optimization games, which immediately allows us to improve the algorithmic result for finding amputations in the core (an important solution concept in cooperative game theory) of the network flow game on simple networks by Kalai and Zemel. An interesting result is a general theorem that the core for this class of games is nonempty if and only if a related linear program has an integer optimal solution. We study the properties for this mathematical condition to hold for several interesting problems, and apply them to resolve algorithmic and complexity issues for their cores along the line as put forward in: decide whether the core is empty; if the core is empty, find an imputation in the core; given an imputation x, test whether x is in the core. We also explore the properties of totally balanced games in this succinct formulation of cooperative games.
Heliostat cost optimization study
NASA Astrophysics Data System (ADS)
von Reeken, Finn; Weinrebe, Gerhard; Keck, Thomas; Balz, Markus
2016-05-01
This paper presents a methodology for a heliostat cost optimization study. First different variants of small, medium sized and large heliostats are designed. Then the respective costs, tracking and optical quality are determined. For the calculation of optical quality a structural model of the heliostat is programmed and analyzed using finite element software. The costs are determined based on inquiries and from experience with similar structures. Eventually the levelised electricity costs for a reference power tower plant are calculated. Before each annual simulation run the heliostat field is optimized. Calculated LCOEs are then used to identify the most suitable option(s). Finally, the conclusions and findings of this extensive cost study are used to define the concept of a new cost-efficient heliostat called `Stellio'.
Cyclone performance and optimization
Leith, D.
1990-06-15
The objectives of this project are: to characterize the gas flow pattern within cyclones, to revise the theory for cyclone performance on the basis of these findings, and to design and test cyclones whose dimensions have been optimized using revised performance theory. This work is important because its successful completion will aid in the technology for combustion of coal in pressurized, fluidized beds. During the past quarter, we have nearly completed modeling work that employs the flow field measurements made during the past six months. In addition, we have begun final work using the results of this project to develop improved design methods for cyclones. This work involves optimization using the Iozia-Leith efficiency model and the Dirgo pressure drop model. This work will be completed this summer. 9 figs.
NEMO Oceanic Model Optimization
NASA Astrophysics Data System (ADS)
Epicoco, I.; Mocavero, S.; Murli, A.; Aloisio, G.
2012-04-01
NEMO is an oceanic model used by the climate community for stand-alone or coupled experiments. Its parallel implementation, based on MPI, limits the exploitation of the emerging computational infrastructures at peta and exascale, due to the weight of communications. As case study we considered the MFS configuration developed at INGV with a resolution of 1/16° tailored on the Mediterranenan Basin. The work is focused on the analysis of the code on the MareNostrum cluster and on the optimization of critical routines. The first performance analysis of the model aimed at establishing how much the computational performance are influenced by the GPFS file system or the local disks and wich is the best domain decomposition. The results highlight that the exploitation of local disks can reduce the wall clock time up to 40% and that the best performance is achieved with a 2D decomposition when the local domain has a square shape. A deeper performance analysis highlights the obc_rad, dyn_spg and tra_adv routines are the most time consuming routines. The obc_rad implements the evaluation of the open boundaries and it has been the first routine to be optimized. The communication pattern implemented in obc_rad routine has been redesigned. Before the introduction of the optimizations all processes were involved in the communication, but only the processes on the boundaries have the actual data to be exchanged and only the data on the boundaries must be exchanged. Moreover the data along the vertical levels are "packed" and sent with only one MPI_send invocation. The overall efficiency increases compared with the original version, as well as the parallel speed-up. The execution time was reduced of about 33.81%. The second phase of optimization involved the SOR solver routine, implementing the Red-Black Successive-Over-Relaxation method. The high frequency of exchanging data among processes represent the most part of the overall communication time. The number of communication is
Optimizing Thomson's jumping ring
NASA Astrophysics Data System (ADS)
Tjossem, Paul J. H.; Brost, Elizabeth C.
2011-04-01
The height to which rings will jump in a Thomson jumping ring apparatus is the central question posed by this popular lecture demonstration. We develop a simple time-averaged inductive-phase-lag model for the dependence of the jump height on the ring material, its mass, and temperature and apply it to measurements of the jump height for a set of rings made by slicing copper and aluminum alloy pipe into varying lengths. The data confirm a peak jump height that grows, narrows, and shifts to smaller optimal mass when the rings are cooled to 77 K. The model explains the ratio of the cooled/warm jump heights for a given ring, the reduction in optimal mass as the ring is cooled, and the shape of the mass resonance. The ring that jumps the highest is found to have a characteristic resistance equal to the inductive reactance of the set of rings.
Nicholas, D.M.; Wilkins, J.T.
1983-09-01
Innovative design of physical solvent plants for acid gas removal can materially reduce both installation and operating costs. A review of the design considerations for one physical solvent process (Selexol) points to numerous arrangements for potential improvement. These are evaluated for a specific case in four combinations that identify an optimum for the case in question but, more importantly, illustrate the mechanism for use for such optimization elsewhere.
Reynolds, J. L.
1982-01-01
Optimal prenatal care begins before conception, when health habits can be reviewed. The most important task of the initial prenatal assessment is establishing dates. Ongoing assessments should emphasize measurement of symphisis to fundus height, maternal nutrition and screening, especially for urinary tract infection and gestational diabetes. Prenatal care is an excellent opportunity for patient education and involvement of the family. Good prenatal care is today's best health investment. PMID:21286515
Singularity in structural optimization
NASA Technical Reports Server (NTRS)
Patnaik, S. N.; Guptill, J. D.; Berke, L.
1993-01-01
The conditions under which global and local singularities may arise in structural optimization are examined. Examples of these singularities are presented, and a framework is given within which the singularities can be recognized. It is shown, in particular, that singularities can be identified through the analysis of stress-displacement relations together with compatibility conditions or the displacement-stress relations derived by the integrated force method of structural analysis. Methods of eliminating the effects of singularities are suggested and illustrated numerically.
HOMER® Micropower Optimization Model
Lilienthal, P.
2005-01-01
NREL has developed the HOMER micropower optimization model. The model can analyze all of the available small power technologies individually and in hybrid configurations to identify least-cost solutions to energy requirements. This capability is valuable to a diverse set of energy professionals and applications. NREL has actively supported its growing user base and developed training programs around the model. These activities are helping to grow the global market for solar technologies.
Optimal Centroid Position Estimation
Candy, J V; McClay, W A; Awwal, A S; Ferguson, S W
2004-07-23
The alignment of high energy laser beams for potential fusion experiments demand high precision and accuracy by the underlying positioning algorithms. This paper discusses the feasibility of employing online optimal position estimators in the form of model-based processors to achieve the desired results. Here we discuss the modeling, development, implementation and processing of model-based processors applied to both simulated and actual beam line data.
Trajectory Optimization: OTIS 4
NASA Technical Reports Server (NTRS)
Riehl, John P.; Sjauw, Waldy K.; Falck, Robert D.; Paris, Stephen W.
2010-01-01
The latest release of the Optimal Trajectories by Implicit Simulation (OTIS4) allows users to simulate and optimize aerospace vehicle trajectories. With OTIS4, one can seamlessly generate optimal trajectories and parametric vehicle designs simultaneously. New features also allow OTIS4 to solve non-aerospace continuous time optimal control problems. The inputs and outputs of OTIS4 have been updated extensively from previous versions. Inputs now make use of objectoriented constructs, including one called a metastring. Metastrings use a greatly improved calculator and common nomenclature to reduce the user s workload. They allow for more flexibility in specifying vehicle physical models, boundary conditions, and path constraints. The OTIS4 calculator supports common mathematical functions, Boolean operations, and conditional statements. This allows users to define their own variables for use as outputs, constraints, or objective functions. The user-defined outputs can directly interface with other programs, such as spreadsheets, plotting packages, and visualization programs. Internally, OTIS4 has more explicit and implicit integration procedures, including high-order collocation methods, the pseudo-spectral method, and several variations of multiple shooting. Users may switch easily between the various methods. Several unique numerical techniques such as automated variable scaling and implicit integration grid refinement, support the integration methods. OTIS4 is also significantly more user friendly than previous versions. The installation process is nearly identical on various platforms, including Microsoft Windows, Apple OS X, and Linux operating systems. Cross-platform scripts also help make the execution of OTIS and post-processing of data easier. OTIS4 is supplied free by NASA and is subject to ITAR (International Traffic in Arms Regulations) restrictions. Users must have a Fortran compiler, and a Python interpreter is highly recommended.
Optimization of neutron source
Hooper, E.B.
1993-11-09
I consider here the optimization of the two component neutron source, allowing beam species and energy to vary. A simple model is developed, based on the earlier publications, that permits the optimum to be obtained simply. The two component plasma, with one species of hot ion (D{sup +} or T{sup +}) and the complementary species of cold ion, is easy to analyze in the case of a spatially uniform cold plasma, as to good approximation the total number of hot ions is important but not their spatial distribution. Consequently, the optimization can ignore spatial effects. The problem of a plasma with both types of hot ions and cold ions is rather more difficult, as the neutron production by hot-hot interactions is sensitive to their spatial distributions. Consequently, consideration of this problem will be delayed to a future memorandum. The basic model is that used in the published articles on the two-component, beam-plasma mirror source. I integrate the Fokker-Planck equation analytically, obtaining good agreement with previous numerical results. This simplifies the optimization, by providing a functional form for the neutron production. The primary result is expressed in terms of the power efficiency: watts of neutrons/watts of primary power. The latter includes the positive ion neutralization efficiency. At 150 keV, the present model obtains an efficiency of 0.66%, compared with 0.53% of the earlier calculation.
NASA Astrophysics Data System (ADS)
Kupers, Michiel; Klingbeil, Patrick; Tschischgale, Joerg; Buhl, Stefan; Hempel, Fritjof
2009-03-01
Cost of ownership of scanners for the manufacturing of front end layers is becoming increasingly expensive. The ability to quickly switch the production of a layer to another scanner in case it is down is important. This paper presents a method to match the scanner grids in the most optimal manner so that use of front end scanners in effect becomes interchangeable. A breakdown of the various components of overlay is given and we discuss methods to optimize the matching strategy in the fab. A concern here is how to separate the scanner and process induced effects. We look at the relative contributions of intrafield and interfield errors caused by the scanner and the process. Experimental results of a method to control the scanner grid are presented and discussed. We compare the overlay results before and after optimizing the scanner grids and show that the matching penalty is reduced by 20%. We conclude with some thoughts on the need to correct the remaining matching errors.
Flood Bypass Capacity Optimization
NASA Astrophysics Data System (ADS)
Siclari, A.; Hui, R.; Lund, J. R.
2015-12-01
Large river flows can damage adjacent flood-prone areas, by exceeding river channel and levee capacities. Particularly large floods are difficult to contain in leveed river banks alone. Flood bypasses often can efficiently reduce flood risks, where excess river flow is diverted over a weir to bypasses, that incur much less damage and cost. Additional benefits of bypasses include ecosystem protection, agriculture, groundwater recharge and recreation. Constructing or expanding an existing bypass costs in land purchase easements, and levee setbacks. Accounting for such benefits and costs, this study develops a simple mathematical model for optimizing flood bypass capacity using benefit-cost and risk analysis. Application to the Yolo Bypass, an existing bypass along the Sacramento River in California, estimates optimal capacity that economically reduces flood damage and increases various benefits, especially for agriculture. Land availability is likely to limit bypass expansion. Compensation for landowners could relax such limitations. Other economic values could affect the optimal results, which are shown by sensitivity analysis on major parameters. By including land geography into the model, location of promising capacity expansions can be identified.
NASA Technical Reports Server (NTRS)
Vanderplaats, Garrett; Townsend, James C. (Technical Monitor)
2002-01-01
The purpose of this research under the NASA Small Business Innovative Research program was to develop algorithms and associated software to solve very large nonlinear, constrained optimization tasks. Key issues included efficiency, reliability, memory, and gradient calculation requirements. This report describes the general optimization problem, ten candidate methods, and detailed evaluations of four candidates. The algorithm chosen for final development is a modern recreation of a 1960s external penalty function method that uses very limited computer memory and computational time. Although of lower efficiency, the new method can solve problems orders of magnitude larger than current methods. The resulting BIGDOT software has been demonstrated on problems with 50,000 variables and about 50,000 active constraints. For unconstrained optimization, it has solved a problem in excess of 135,000 variables. The method includes a technique for solving discrete variable problems that finds a "good" design, although a theoretical optimum cannot be guaranteed. It is very scalable in that the number of function and gradient evaluations does not change significantly with increased problem size. Test cases are provided to demonstrate the efficiency and reliability of the methods and software.
Structural optimization of framed structures using generalized optimality criteria
NASA Technical Reports Server (NTRS)
Kolonay, R. M.; Venkayya, Vipperla B.; Tischler, V. A.; Canfield, R. A.
1989-01-01
The application of a generalized optimality criteria to framed structures is presented. The optimality conditions, Lagrangian multipliers, resizing algorithm, and scaling procedures are all represented as a function of the objective and constraint functions along with their respective gradients. The optimization of two plane frames under multiple loading conditions subject to stress, displacement, generalized stiffness, and side constraints is presented. These results are compared to those found by optimizing the frames using a nonlinear mathematical programming technique.
Structural optimization of large structural systems by optimality criteria methods
NASA Technical Reports Server (NTRS)
Berke, Laszlo
1992-01-01
The fundamental concepts of the optimality criteria method of structural optimization are presented. The effect of the separability properties of the objective and constraint functions on the optimality criteria expressions is emphasized. The single constraint case is treated first, followed by the multiple constraint case with a more complex evaluation of the Lagrange multipliers. Examples illustrate the efficiency of the method.
Infrared Drying Parameter Optimization
NASA Astrophysics Data System (ADS)
Jackson, Matthew R.
In recent years, much research has been done to explore direct printing methods, such as screen and inkjet printing, as alternatives to the traditional lithographic process. The primary motivation is reduction of the material costs associated with producing common electronic devices. Much of this research has focused on developing inkjet or screen paste formulations that can be printed on a variety of substrates, and which have similar conductivity performance to the materials currently used in the manufacturing of circuit boards and other electronic devices. Very little research has been done to develop a process that would use direct printing methods to manufacture electronic devices in high volumes. This study focuses on developing and optimizing a drying process for conductive copper ink in a high volume manufacturing setting. Using an infrared (IR) dryer, it was determined that conductive copper prints could be dried in seconds or minutes as opposed to tens of minutes or hours that it would take with other drying devices, such as a vacuum oven. In addition, this study also identifies significant parameters that can affect the conductivity of IR dried prints. Using designed experiments and statistical analysis; the dryer parameters were optimized to produce the best conductivity performance for a specific ink formulation and substrate combination. It was determined that for an ethylene glycol, butanol, 1-methoxy 2- propanol ink formulation printed on Kapton, the optimal drying parameters consisted of a dryer height of 4 inches, a temperature setting between 190 - 200°C, and a dry time of 50-65 seconds depending on the printed film thickness as determined by the number of print passes. It is important to note that these parameters are optimized specifically for the ink formulation and substrate used in this study. There is still much research that needs to be done into optimizing the IR dryer for different ink substrate combinations, as well as developing a
Ames Optimized TCA Configuration
NASA Technical Reports Server (NTRS)
Cliff, Susan E.; Reuther, James J.; Hicks, Raymond M.
1999-01-01
Configuration design at Ames was carried out with the SYN87-SB (single block) Euler code using a 193 x 49 x 65 C-H grid. The Euler solver is coupled to the constrained (NPSOL) and the unconstrained (QNMDIF) optimization packages. Since the single block grid is able to model only wing-body configurations, the nacelle/diverter effects were included in the optimization process by SYN87's option to superimpose the nacelle/diverter interference pressures on the wing. These interference pressures were calculated using the AIRPLANE code. AIRPLANE is an Euler solver that uses a unstructured tetrahedral mesh and is capable of computations about arbitrary complete configurations. In addition, the buoyancy effects of the nacelle/diverters were also included in the design process by imposing the pressure field obtained during the design process onto the triangulated surfaces of the nacelle/diverter mesh generated by AIRPLANE. The interference pressures and nacelle buoyancy effects are added to the final forces after each flow field calculation. Full details of the (recently enhanced) ghost nacelle capability are given in a related talk. The pseudo nacelle corrections were greatly improved during this design cycle. During the Ref H and Cycle 1 design activities, the nacelles were only translated and pitched. In the cycle 2 design effort the nacelles can translate vertically, and pitch to accommodate the changes in the lower surface geometry. The diverter heights (between their leading and trailing edges) were modified during design as the shape of the lower wing changed, with the drag of the diverter changing accordingly. Both adjoint and finite difference gradients were used during optimization. The adjoint-based gradients were found to give good direction in the design space for configurations near the starting point, but as the design approached a minimum, the finite difference gradients were found to be more accurate. Use of finite difference gradients was limited by the
Multiobjective optimization of temporal processes.
Song, Zhe; Kusiak, Andrew
2010-06-01
This paper presents a dynamic predictive-optimization framework of a nonlinear temporal process. Data-mining (DM) and evolutionary strategy algorithms are integrated in the framework for solving the optimization model. DM algorithms learn dynamic equations from the process data. An evolutionary strategy algorithm is then applied to solve the optimization problem guided by the knowledge extracted by the DM algorithm. The concept presented in this paper is illustrated with the data from a power plant, where the goal is to maximize the boiler efficiency and minimize the limestone consumption. This multiobjective optimization problem can be either transformed into a single-objective optimization problem through preference aggregation approaches or into a Pareto-optimal optimization problem. The computational results have shown the effectiveness of the proposed optimization framework. PMID:19900853
Turbine Performance Optimization Task Status
NASA Technical Reports Server (NTRS)
Griffin, Lisa W.; Turner, James E. (Technical Monitor)
2001-01-01
Capability to optimize for turbine performance and accurately predict unsteady loads will allow for increased reliability, Isp, and thrust-to-weight. The development of a fast, accurate aerodynamic design, analysis, and optimization system is required.
Combinatorial optimization in foundry practice
NASA Astrophysics Data System (ADS)
Antamoshkin, A. N.; Masich, I. S.
2016-04-01
The multicriteria mathematical model of foundry production capacity planning is suggested in the paper. The model is produced in terms of pseudo-Boolean optimization theory. Different search optimization methods were used to solve the obtained problem.
Taking Stock of Unrealistic Optimism
Shepperd, James A.; Klein, William M. P.; Waters, Erika A.; Weinstein, Neil D.
2015-01-01
Researchers have used terms such as unrealistic optimism and optimistic bias to refer to concepts that are similar but not synonymous. Drawing from three decades of research, we critically discuss how researchers define unrealistic optimism and we identify four types that reflect different measurement approaches: unrealistic absolute optimism at the individual and group level and unrealistic comparative optimism at the individual and group level. In addition, we discuss methodological criticisms leveled against research on unrealistic optimism and note that the criticisms are primarily relevant to only one type—the group form of unrealistic comparative optimism. We further clarify how the criticisms are not nearly as problematic even for unrealistic comparative optimism as they might seem. Finally, we note boundary conditions on the different types of unrealistic optimism and reflect on five broad questions that deserve further attention. PMID:26045714
Peng, Ting; Sun, Xiaochun; Mumm, Rita H
2014-01-01
Multiple trait integration (MTI) is a multi-step process of converting an elite variety/hybrid for value-added traits (e.g. transgenic events) through backcross breeding. From a breeding standpoint, MTI involves four steps: single event introgression, event pyramiding, trait fixation, and version testing. This study explores the feasibility of marker-aided backcross conversion of a target maize hybrid for 15 transgenic events in the light of the overall goal of MTI of recovering equivalent performance in the finished hybrid conversion along with reliable expression of the value-added traits. Using the results to optimize single event introgression (Peng et al. Optimized breeding strategies for multiple trait integration: I. Minimizing linkage drag in single event introgression. Mol Breed, 2013) which produced single event conversions of recurrent parents (RPs) with ≤8 cM of residual non-recurrent parent (NRP) germplasm with ~1 cM of NRP germplasm in the 20 cM regions flanking the event, this study focused on optimizing process efficiency in the second and third steps in MTI: event pyramiding and trait fixation. Using computer simulation and probability theory, we aimed to (1) fit an optimal breeding strategy for pyramiding of eight events into the female RP and seven in the male RP, and (2) identify optimal breeding strategies for trait fixation to create a 'finished' conversion of each RP homozygous for all events. In addition, next-generation seed needs were taken into account for a practical approach to process efficiency. Building on work by Ishii and Yonezawa (Optimization of the marker-based procedures for pyramiding genes from multiple donor lines: I. Schedule of crossing between the donor lines. Crop Sci 47:537-546, 2007a), a symmetric crossing schedule for event pyramiding was devised for stacking eight (seven) events in a given RP. Options for trait fixation breeding strategies considered selfing and doubled haploid approaches to achieve homozygosity
Analysis of Multi-step Forming of Metallic Bipolar Plate for MCFC Using Various Shapes of Preforms
NASA Astrophysics Data System (ADS)
Lee, Chang-Hwan; Ryu, Seung-Min; Yang, Dong-Yol; Kang, Dong-Woo; Chang, In-Gab; Lee, Tae-Won
2010-06-01
The metallic bipolar plates of a molten carbonate fuel cell (MCFC) consist of a shielded slot plate and a center plate. Among these, the shielded slot plate (the current collector) supports the Membrane Electrode Assembly (MEA) mechanically. The anode gases and the cathode gases pass through a space between individual slot patterns. The catalysts are located in the upper part of the shielded slot plate. Therefore, triple phase boundaries can be generated, and carbonate ions can act as the mobile charge carrier for the MCFC. Due to these properties, the shielded slot plate should have a sheared corrugated pattern. In order to form a sheared corrugated pattern, a slitting process is required during the first stage of the forming process. However, it is not possible to obtain a high aspect ratio in a sheared corrugated trapezoidal pattern due to the plastic strain concentration on the upper round region of the pattern. Therefore additional forming processes are required to form a high aspect-ratio pattern. For example, the two additional processes such as a "stretching process using a preform" and a "final forming process" can be done subsequent to the first slitting process. Before the final forming process, a stretching process, which forms an intermediate shape (perform), can make the strain distribution more uniform. Hence, various examples of performs were evaluated by using FEM simulation employing simplified boundary conditions. Finally, experiments involving microscopic and macroscopic observations using the proposed shape of a preform were conducted to characterize the formability of the sheared corrugated pattern. It was found that the numerical simulations are in good agreement with the experimental results.
Hong, Tian; Watanabe, Kazuhide; Ta, Catherine Ha; Villarreal-Ponce, Alvaro; Nie, Qing; Dai, Xing
2015-11-01
Reversible epithelial-to-mesenchymal transition (EMT) is central to tissue development, epithelial stemness, and cancer metastasis. While many regulatory elements have been identified to induce EMT, the complex process underlying such cellular plasticity remains poorly understood. Utilizing a systems biology approach integrating modeling and experiments, we found multiple intermediate states contributing to EMT and that the robustness of the transitions is modulated by transcriptional factor Ovol2. In particular, we obtained evidence for a mutual inhibition relationship between Ovol2 and EMT inducer Zeb1, and observed that adding this regulation generates a novel four-state system consisting of two distinct intermediate phenotypes that differ in differentiation propensities and are favored in different environmental conditions. We identified epithelial cells that naturally exist in an intermediate state with bidirectional differentiation potential, and found the balance between EMT-promoting and -inhibiting factors to be critical in achieving and selecting between intermediate states. Our analysis suggests a new design principle in controlling cellular plasticity through multiple intermediate cell fates and underscores the critical involvement of Ovol2 and its associated molecular regulations. PMID:26554584
Pietrzykowski, Andrzej Z.; Spijker, Sabine
2014-01-01
Malfunction of synaptic plasticity in different brain regions, including the amygdala plays a role in impulse control deficits that are characteristics of several psychiatric disorders, such as ADHD, schizophrenia, depression and addiction. Previously, we discovered a locus for impulsivity (Impu1) containing the neuregulin 3 (Nrg3) gene, of which the level of expression determines levels of inhibitory control. MicroRNAs (miRNAs) are potent regulators of gene expression, and have recently emerged as important factors contributing to the development of psychiatric disorders. However, their role in impulsivity, as well as control of Nrg3 expression or malfunction of the amygdala, is not well established. Here, we used the GeneNetwork database of BXD mice to search for correlated traits with impulsivity using an overrepresentation analysis to filter for biologically meaningful traits. We determined that inhibitory control was significantly correlated with expression of miR-190b, -28a, -340, -219a, and -491 in the amygdala, and that the overrepresented correlated traits showed a specific pattern of coregulation with these miRNAs. A bioinformatics analysis identified that miR-190b, by targeting an Nrg3-related network, could affect synaptic plasticity in the amygdala, targeting bot impulsive and compulsive traits. Moreover, miR-28a, -340, -219a, and possibly -491 could act on synaptic function by determining the balance between neuronal outgrowth and differentiation. We propose that these miRNAs are attractive candidates of regulation of amygdala synaptic plasticity, possibly during development but also in maintaining the impulsive phenotype. These results can help us to better understand mechanisms of synaptic dysregulation in psychiatric disorders. PMID:25561905
Gahlaut, Vijay; Mathur, Saloni; Dhariwal, Raman; Khurana, Jitendra P; Tyagi, Akhilesh K; Balyan, Harindra S; Gupta, Pushpendra K
2014-12-01
Wheat is an important staple crop, and its productivity is severely constrained by drought stress (DS). An understanding of the molecular basis of drought tolerance is necessary for genetic improvement of wheat for tolerance to DS. The two-component system (TCS) serves as a common sensor-regulator coupling mechanism implicated in the regulation of diverse biological processes (including response to DS) not only in prokaryotes, but also in higher plants. In the latter, TCS generally consists of two signalling elements, a histidine kinase (HK) and a response regulator (RR) associated with an intermediate element called histidine phosphotransferase (HPT). Keeping in view the possible utility of TCS in developing water use efficient (WUE) wheat cultivars, we identified and characterized 62 wheat genes encoding TCS elements in a silico study; these included 7 HKs, 45 RRs along with 10 HPTs. Twelve of the 62 genes showed relatively higher alterations in the expression under drought. The quantitative RT-PCR (qRT-PCR)-based expression analysis of these 12 TCS genes was carried out in wheat seedlings of a drought sensitive (HD2967) and a tolerant (Dharwar Dry) cultivar subjected to either dehydration stress or cytokinin treatment. The expression of these 12 genes under dehydration stress differed in sensitive and tolerant genotypes, even though for individual genes, both showed either up-regulation or down-regulation. In response to the treatment of cytokinin, the expression of type-A RR genes was higher in the tolerant genotype, relative to that in the sensitive genotype, the situation being reverse for the type-B RRs. These results have been discussed in the context of the role of TCS elements in drought tolerance in wheat. PMID:25228409
Properties of Electron-Beam Irradiated CuInSe2 Layers by Multi-Step Sputtering Method.
Kim, Chae-Woong; Kim, Jin Hyeok; Jeong, Chaehwan
2015-10-01
Typically, CuInSe2 (CIS) based thin films for photovoltaic devices are deposited by co-evaporation or by deposition of the metals, followed by treatment in a selenium environment. This article describes CIS films that are instead deposited by DC and RF magnetron sputtering from binary Cu2Se and In2Se3 targets without the supply of selenium. As a novel method, electron beam annealing was used for crystallization of Cu2Se/In2Se3 stacked precursors. The surface, cross-sectional morphology, and compositional ratio of CIS films were investigated to confirm the possibility in crystallization without any addition of selenium. Our work demonstrates that the e-beam annealing method can be a good candidate for the rapid crystallization of Cu-In-Se sputtered precursors. PMID:26726419
Ta, Catherine Ha; Villarreal-Ponce, Alvaro; Nie, Qing; Dai, Xing
2015-01-01
Reversible epithelial-to-mesenchymal transition (EMT) is central to tissue development, epithelial stemness, and cancer metastasis. While many regulatory elements have been identified to induce EMT, the complex process underlying such cellular plasticity remains poorly understood. Utilizing a systems biology approach integrating modeling and experiments, we found multiple intermediate states contributing to EMT and that the robustness of the transitions is modulated by transcriptional factor Ovol2. In particular, we obtained evidence for a mutual inhibition relationship between Ovol2 and EMT inducer Zeb1, and observed that adding this regulation generates a novel four-state system consisting of two distinct intermediate phenotypes that differ in differentiation propensities and are favored in different environmental conditions. We identified epithelial cells that naturally exist in an intermediate state with bidirectional differentiation potential, and found the balance between EMT-promoting and -inhibiting factors to be critical in achieving and selecting between intermediate states. Our analysis suggests a new design principle in controlling cellular plasticity through multiple intermediate cell fates and underscores the critical involvement of Ovol2 and its associated molecular regulations. PMID:26554584
NASA Astrophysics Data System (ADS)
Badrzadeh, Honey; Sarukkalige, Ranjan; Jayawardena, A. W.
2013-12-01
Discrete wavelet transform was applied to decomposed ANN and ANFIS inputs.Novel approach of WNF with subtractive clustering applied for flow forecasting.Forecasting was performed in 1-5 step ahead, using multi-variate inputs.Forecasting accuracy of peak values and longer lead-time significantly improved.
Evidence of Multi-step Nucleation Leading to Various Crystallization Pathways from an Fe-O-Al Melt
Wang, G. C.; Wang, Q.; Li, S. L.; Ai, X. G.; Fan, C. G.
2014-01-01
The crystallization process from a solution begins with nucleation, which determines the structure and size of the resulting crystals. Further understanding of multi-pathway crystallizations from solution through two-step nucleation mechanisms is needed. This study uses density functional theory to probe the thermodynamic properties of alumina clusters at high temperature and reveals the thermodynamic relationship between these clusters and the saturation levels of dissolved oxygen and aluminum in an Fe–O–Al melt. Based on the thermodynamics of cluster formation and the experimental evidence for both excess oxygen in the Fe-O-Al melt and for alumina with a polycrystalline structure in solidified iron, we demonstrate that the appearance of various types of clusters that depends on the saturation ratio determines the nucleation steps that lead to the various crystallization pathways. Such mechanisms may also be important in nucleation and crystallization from solution. PMID:24866413
Liu, Chang; Wang, Xin; Chen, Yuhuang; Hao, Huijing; Li, Xu; Liang, Junrong; Duan, Ran; Li, Chuchu; Zhang, Jing; Shao, Shihe; Jing, Huaiqi
2016-01-01
In many gram negative bacilli, AmpD plays a key role in both cell well-recycling pathway and β-lactamase regulation, inactivation of the ampD causes the accumulation of 1,6-anhydromuropeptides, and results in the ampC overproduction. In Yersinia enterocolitica, the regulation of ampC expression may also rely on the ampR-ampC system, the role of AmpD in this species is still unknown. In this study, three AmpD homologs (AmpD1, AmpD2, and AmpD3) have been identified in complete sequence of strain Y. enterocolitica subsp. palearctica 105.5R(r). To understand the role of three AmpD homologs, several mutant strains were constructed and analyzed where a rare ampC regulation mechanism was observed: low-effective ampD2 and ampD3 cooperate with the high-effective ampD1 in the three levels regulation of ampC expression. Enterobacteriaceae was used to be supposed to regulate ampC expression by two steps, three steps regulation was only observed in Pseudomonas aeruginosa. In this study, we first reported that Enterobacteriaceae Y. enterocolitica can also possess a three steps stepwise regulation mechanism, regulating the ampC expression precisely. PMID:27588018
Cruickshank-Quinn, Charmion; Quinn, Kevin D.; Powell, Roger; Yang, Yanhui; Armstrong, Michael; Mahaffey, Spencer; Reisdorph, Richard; Reisdorph, Nichole
2014-01-01
Metabolomics is an emerging field which enables profiling of samples from living organisms in order to obtain insight into biological processes. A vital aspect of metabolomics is sample preparation whereby inconsistent techniques generate unreliable results. This technique encompasses protein precipitation, liquid-liquid extraction, and solid-phase extraction as a means of fractionating metabolites into four distinct classes. Improved enrichment of low abundance molecules with a resulting increase in sensitivity is obtained, and ultimately results in more confident identification of molecules. This technique has been applied to plasma, bronchoalveolar lavage fluid, and cerebrospinal fluid samples with volumes as low as 50 µl. Samples can be used for multiple downstream applications; for example, the pellet resulting from protein precipitation can be stored for later analysis. The supernatant from that step undergoes liquid-liquid extraction using water and strong organic solvent to separate the hydrophilic and hydrophobic compounds. Once fractionated, the hydrophilic layer can be processed for later analysis or discarded if not needed. The hydrophobic fraction is further treated with a series of solvents during three solid-phase extraction steps to separate it into fatty acids, neutral lipids, and phospholipids. This allows the technician the flexibility to choose which class of compounds is preferred for analysis. It also aids in more reliable metabolite identification since some knowledge of chemical class exists. PMID:25045913
Hu, Xichan; Liu, Jinqiang; Jun, Hyun-IK; Kim, Jin-Kwang; Qiao, Feng
2016-01-01
Tightly controlled recruitment of telomerase, a low-abundance enzyme, to telomeres is essential for regulated telomere synthesis. Recent studies in human cells revealed that a patch of amino acids in the shelterin component TPP1, called the TEL-patch, is essential for recruiting telomerase to telomeres. However, how TEL-patch—telomerase interaction integrates into the overall orchestration of telomerase regulation at telomeres is unclear. In fission yeast, Tel1ATM/Rad3ATR-mediated phosphorylation of shelterin component Ccq1 during late S phase is involved in telomerase recruitment through promoting the binding of Ccq1 to a telomerase accessory protein Est1. Here, we identify the TEL-patch in Tpz1TPP1, mutations of which lead to decreased telomeric association of telomerase, similar to the phosphorylation-defective Ccq1. Furthermore, we find that telomerase action at telomeres requires formation and resolution of an intermediate state, in which the cell cycle-dependent Ccq1-Est1 interaction is coupled to the TEL-patch—Trt1 interaction, to achieve temporally regulated telomerase elongation of telomeres. DOI: http://dx.doi.org/10.7554/eLife.15470.001 PMID:27253066
Liu, Chang; Wang, Xin; Chen, Yuhuang; Hao, Huijing; Li, Xu; Liang, Junrong; Duan, Ran; Li, Chuchu; Zhang, Jing; Shao, Shihe; Jing, Huaiqi
2016-01-01
In many gram negative bacilli, AmpD plays a key role in both cell well-recycling pathway and β-lactamase regulation, inactivation of the ampD causes the accumulation of 1,6-anhydromuropeptides, and results in the ampC overproduction. In Yersinia enterocolitica, the regulation of ampC expression may also rely on the ampR-ampC system, the role of AmpD in this species is still unknown. In this study, three AmpD homologs (AmpD1, AmpD2, and AmpD3) have been identified in complete sequence of strain Y. enterocolitica subsp. palearctica 105.5R(r). To understand the role of three AmpD homologs, several mutant strains were constructed and analyzed where a rare ampC regulation mechanism was observed: low-effective ampD2 and ampD3 cooperate with the high-effective ampD1 in the three levels regulation of ampC expression. Enterobacteriaceae was used to be supposed to regulate ampC expression by two steps, three steps regulation was only observed in Pseudomonas aeruginosa. In this study, we first reported that Enterobacteriaceae Y. enterocolitica can also possess a three steps stepwise regulation mechanism, regulating the ampC expression precisely. PMID:27588018
Gröger, Harald; Hummel, Werner
2014-04-01
The combination of biocatalytic and chemocatalytic reactions leading to one-pot processes in aqueous medium represents an economically and ecologically attractive concept in organic synthesis due to the potential to avoid time and capacity consuming and waste producing work-up steps of intermediates. The use of water as a solvent has many advantages. A key feature is the opportunity it provides as the solvent in nature to make use of the full range of enzymes. In recent years development of chemoenzymatic one-pot processes in water has emerged tremendously, and proof of concepts for the combination of biotransformations with metal catalysts and organocatalysts were demonstrated. This review will focus on major contributions in this field, which also underline the compatibility of these two 'worlds' of catalysis with each other as well as the industrial potential of this one-pot approach. PMID:24709123
A Novel Multi-step Virtual Screening for the Identification of Human and Mouse mPGES-1 Inhibitors.
Corso, G; Alisi, M A; Cazzolla, N; Coletta, I; Furlotti, G; Garofalo, B; Mangano, G; Mancini, F; Vitiello, M; Ombrato, Rosella
2016-09-01
We present here the development of a novel virtual screening protocol combining Structure-based and Ligand-based drug design approaches for the identification of mouse mPGES-1 inhibitors. We used the existing 3D structural data of the murine enzyme to hypothesize the inhibitors binding mode, which was the starting point for docking simulations, shape screening, and pharmacophore hypothesis screening. The protocol allowed the identification of 16 mouse mPGES-1 inhibitors with low micromolar activity, which, notably, also inhibit the human enzyme in the same concentration range. The inhibitors predicted binding mode is expected to be the base for the rational drug design of new potent dual species inhibitors of human and murine mPGES-1. PMID:27546040
SU-C-BRF-07: A Pattern Fusion Algorithm for Multi-Step Ahead Prediction of Surrogate Motion
Zawisza, I; Yan, H; Yin, F
2014-06-15
Purpose: To assure that tumor motion is within the radiation field during high-dose and high-precision radiosurgery, real-time imaging and surrogate monitoring are employed. These methods are useful in providing real-time tumor/surrogate motion but no future information is available. In order to anticipate future tumor/surrogate motion and track target location precisely, an algorithm is developed and investigated for estimating surrogate motion multiple-steps ahead. Methods: The study utilized a one-dimensional surrogate motion signal divided into three components: (a) training component containing the primary data including the first frame to the beginning of the input subsequence; (b) input subsequence component of the surrogate signal used as input to the prediction algorithm: (c) output subsequence component is the remaining signal used as the known output of the prediction algorithm for validation. The prediction algorithm consists of three major steps: (1) extracting subsequences from training component which best-match the input subsequence according to given criterion; (2) calculating weighting factors from these best-matched subsequence; (3) collecting the proceeding parts of the subsequences and combining them together with assigned weighting factors to form output. The prediction algorithm was examined for several patients, and its performance is assessed based on the correlation between prediction and known output. Results: Respiratory motion data was collected for 20 patients using the RPM system. The output subsequence is the last 50 samples (∼2 seconds) of a surrogate signal, and the input subsequence was 100 (∼3 seconds) frames prior to the output subsequence. Based on the analysis of correlation coefficient between predicted and known output subsequence, the average correlation is 0.9644±0.0394 and 0.9789±0.0239 for equal-weighting and relative-weighting strategies, respectively. Conclusion: Preliminary results indicate that the prediction algorithm is effective in estimating surrogate motion multiple-steps in advance. Relative-weighting method shows better prediction accuracy than equal-weighting method. More parameters of this algorithm are under investigation.
Jayaram, Smitha; Kapoor, Sabeeta; Dharmesh, Shylaja M
2015-06-25
Corn pectic polysaccharide (COPP) inhibited galectin-3 mediated hemagglutination at Minimum Inhibitory Concentration (MIC) of 4.08 μg/mL as opposed to citrus pectin (25 μg/mL), a well known galectin-3 inhibitor and lactose (4.16 μg/mL)--sugar specific to galectin-3. COPP effectively (72%) inhibited invasion and metastasis in experimental animals. In vivo results were substantiated by modulation of cancer specific markers such as galectin-3, which is a key molecule for initiation of metastatic cascade, vascular endothelial growth factor (VEGF) that enhances angiogenesis, matrix metalloproteinases 2 and 9 that are required for invasion, NF-κB, a transcription factor for proliferative potency of tumor cells and a phosphoglucoisomerase (PGI), the activity of which favors cancer cell growth. Structural characterization studies indicate the active component (relatively less acidic, 0.05 M ammonium carbonate, 160 kDa fraction) which showed antimetastatic potency in vitro with MIC of 0.09 μg/mL, and ∼ 45 fold increase in the activity when compared to that of COPP. Gas liquid chromatographic analysis indicated the presence of rhamnose (1%), arabinose (20%), xylose (3%), mannose (4%), galactose (54%) and uronic acid (10%) in different proportions. However, correlative data attributed galectin-3 inhibitory activity to enhanced levels of arabinose and galactose. FTIR, HPLC and NMR spectroscopic analysis further highlights that COPP is an arabinogalactan with methyl/ethyl esters. It is therefore suggested that the blockade of galectin-3 mediated lung metastasis appears to be a result of an inhibition of mixed functions induced during metastasis. The data signifies the importance of dietary carbohydrate as cancer-preventive agent. Although pectin digestibility and absorption are issues of concern, promising in vivo data provides evidence for the cancer preventive property of corn. The present study reveals for the first time a new component of corn, i.e.,--corn pectin with cancer preventive activity apart from corn starch that has been in wide use for multipurpose health benefits. PMID:25882088
Vanotti, Matias B; Millner, Patricia D; Hunt, Patrick G; Ellison, Aprel Q
2005-01-01
Concern has greatly increased about the potential for contamination of water, food, and air by pathogens present in manure. We evaluated pathogen reduction in liquid swine manure in a multi-stage treatment system where first the solids and liquid are separated with polymer, followed by biological nitrogen (N) removal using nitrification and denitrification, and then phosphorus (P) extraction through lime precipitation. Each step of the treatment system was analyzed for Salmonella and microbial indicators of fecal contamination (total coliforms, fecal coliforms, and enterococci). Before treatment, mean concentrations of Salmonella, total coliforms, fecal coliforms, and enterococci were 3.89, 6.79, 6.23 and 5.73 log(10) colony forming units (cfu)/ml, respectively. The flushed manure contained 10,590 mg/l TSS, 8270 mg/l COD, 688 mg/l TKN and 480 mg/l TP, which were reduced >98% by the treatment system. Results showed a consistent trend in reduction of pathogens and microbial indicators as a result of each step in the treatment system. Solid-liquid separation decreased their concentrations by 0.5-1 log(10). Additional biological N removal treatment with alternating anoxic and oxic conditions achieved a higher reduction with average removals of 2.4 log(10) for Salmonella and 4.1-4.5 log(10) for indicator microbes. Subsequent P treatment decreased concentration of Salmonella and pathogen indicators to undetectable level (<0.3 log(10) cfu/ml) due to elevated process pH (10.3). Our results indicate that nitrification/denitrification treatment after solids separation is very effective in reducing pathogens in liquid swine manure and that the phosphorus removal step via alkaline calcium precipitation produces a sanitized effluent which may be important for biosecurity reasons. PMID:15381218
ERIC Educational Resources Information Center
de Souza, Rebecca; Dauner, Kim Nichols; Goei, Ryan; LaCaille, Lara; Kotowski, Michael R.; Schultz, Jennifer Feenstra; LaCaille, Rick; Versnik Nowak, Amy L.
2014-01-01
Background: Obesity prevention efforts typically involve changing eating and exercise behaviors as well as the physical and social environment in which those behaviors occur. Due to existing social networks, worksites are a logical choice for implementing such interventions. Purpose: This article describes the development and implementation of a…
Optimization of stall regulated rotors
Fuglsang, P.L.; Madsen, H.A.
1995-09-01
The present work deals with the optimization of stall regulated rotors for wind turbines. Two different optimization methods are presented. The first method is a single design point optimization procedure, whereas the second is a multi pointed optimization technique which is founded on a general optimization algorithm. The use of an optimization algorithm offers the possibility to treat complex optimization problems concerning the entire rotor geometry. The two methods are compared through design of a 20 kW rotor showing good agreement. By use of the optimization algorithm, different aspects of modern wind turbine design layout are investigated. The improvement of the annual energy production by optimizing the airfoil characteristics in addition to the blade chord and twist has been found marginal compared to a case where a standard NACA 634x airfoil family is used. The optimal ratio of swept area to rated power is found depending strongly on the value of the specified maximum loads. Optimization of rotors to specific wind regimes has not been found favorable. In general, the results show that the optimization algorithm is an useful aid to the design.
Optimal Test Construction. Research Report.
ERIC Educational Resources Information Center
Veldkamp, Bernard P.
This paper discusses optimal test construction, which deals with the selection of items from a pool to construct a test that performs optimally with respect to the objective of the test and simultaneously meets all test specifications. Optimal test construction problems can be formulated as mathematical decision models. Algorithms and heuristics…
A Primer on Unrealistic Optimism
Shepperd, James A.; Waters, Erika; Weinstein, Neil D.; Klein, William M. P.
2014-01-01
People display unrealistic optimism in their predictions for countless events, believing that their personal future outcomes will be more desirable than can possibly be true. We summarize the vast literature on unrealistic optimism by focusing on four broad questions: What is unrealistic optimism; when does it occur; why does it occur; and what are its consequences. PMID:26089606
Metacognitive Control and Optimal Learning
ERIC Educational Resources Information Center
Son, Lisa K.; Sethi, Rajiv
2006-01-01
The notion of optimality is often invoked informally in the literature on metacognitive control. We provide a precise formulation of the optimization problem and show that optimal time allocation strategies depend critically on certain characteristics of the learning environment, such as the extent of time pressure, and the nature of the uptake…
ERIC Educational Resources Information Center
Reivich, Karen
2010-01-01
Dictionary definitions of optimism encompass two related concepts. The first of these is a hopeful disposition or a conviction that good will ultimately prevail. The second, broader conception of optimism refers to the belief, or the inclination to believe, that the world is the best of all possible worlds. In psychological research, optimism has…
Multicriteria VMAT optimization
Craft, David; McQuaid, Dualta; Wala, Jeremiah; Chen, Wei; Salari, Ehsan; Bortfeld, Thomas
2012-02-15
Purpose: To make the planning of volumetric modulated arc therapy (VMAT) faster and to explore the tradeoffs between planning objectives and delivery efficiency. Methods: A convex multicriteria dose optimization problem is solved for an angular grid of 180 equi-spaced beams. This allows the planner to navigate the ideal dose distribution Pareto surface and select a plan of desired target coverage versus organ at risk sparing. The selected plan is then made VMAT deliverable by a fluence map merging and sequencing algorithm, which combines neighboring fluence maps based on a similarity score and then delivers the merged maps together, simplifying delivery. Successive merges are made as long as the dose distribution quality is maintained. The complete algorithm is called VMERGE. Results: VMERGE is applied to three cases: a prostate, a pancreas, and a brain. In each case, the selected Pareto-optimal plan is matched almost exactly with the VMAT merging routine, resulting in a high quality plan delivered with a single arc in less than 5 min on average. Conclusions: VMERGE offers significant improvements over existing VMAT algorithms. The first is the multicriteria planning aspect, which greatly speeds up planning time and allows the user to select the plan, which represents the most desirable compromise between target coverage and organ at risk sparing. The second is the user-chosen epsilon-optimality guarantee of the final VMAT plan. Finally, the user can explore the tradeoff between delivery time and plan quality, which is a fundamental aspect of VMAT that cannot be easily investigated with current commercial planning systems.
Constructing optimal entanglement witnesses
Chruscinski, Dariusz; Pytel, Justyna; Sarbicki, Gniewomir
2009-12-15
We provide a class of indecomposable entanglement witnesses. In 4x4 case, it reproduces the well-known Breuer-Hall witness. We prove that these witnesses are optimal and atomic, i.e., they are able to detect the 'weakest' quantum entanglement encoded into states with positive partial transposition. Equivalently, we provide a construction of indecomposable atomic maps in the algebra of 2kx2k complex matrices. It is shown that their structural physical approximations give rise to entanglement breaking channels. This result supports recent conjecture by Korbicz et al. [Phys. Rev. A 78, 062105 (2008)].
Optimized hydrogen piston engines
Smith, J.R.
1994-05-10
Hydrogen piston engines can be simultaneously optimized for improved thermal efficiency and for extremely low emissions. Using these engines in constant-speed, constant-load systems such as series hybrid-electric automobiles or home cogeneration systems can result in significantly improved energy efficiency. For the same electrical energy produced, the emissions from such engines can be comparable to those from natural gas-fired steam power plants. These hydrogen-fueled high-efficiency, low-emission (HELE) engines are a mechanical equivalent of hydrogen fuel cells. HELE engines could facilitate the transition to a hydrogen fuel cell economy using near-term technology.
Optimization of radiation protection
Lochard, J.
1981-07-01
The practical and theoretical problems raised by the optimization of radiological protection merit a review of decision-making methods, their relevance, and the way in which they are used in order to better determine what role they should play in the decision-making process. Following a brief summary of the theoretical background of the cost-benefit analysis, we examine the methodological choices implicit in the model presented in the International Commission on Radiological Protection Publication No. 26 and, particularly, the consequences of the theory that the level of radiation protection, the benefits, and the production costs of an activity can be treated separately.
NASA Astrophysics Data System (ADS)
Souza, Andre; Doering, Charles R.
2015-11-01
The transport of heat by buoyancy driven flows, i.e., thermal convection plays a central role in many natural phenomena and an understanding of how to control its mechanisms is relevant to many engineering applications. In this talk we will consider a variational formulation of optimal heat transport in simple geometries. Numerical results, limits on heat transport, and a comparison to Rayleigh-Bénard convection will be presented. Research supported by NSF Awards PHY-1205219, PHY-1338407, PHY-1443836, PHY-1533555 and DMS-1515161.
Nonconvex optimization and jamming
NASA Astrophysics Data System (ADS)
Kallus, Yoav
Recent work on the jamming transition of particles with short-range interactions has drawn connections with models based on minimization problems with linear inequality constraints and a concave objective. These properties reduce the continuous optimization problem to a discrete search among the corners of the feasible polytope. I will discuss results from simulations of models with and without quenched disorder, exhibiting critical power laws, scaling collapse, and protocol dependence. These models are also well-suited for study using tools of algebraic topology, which I will discuss briefly. Supported by an Omidyar Fellowship at the Santa Fe Institute.
Design Optimization Toolkit: Users' Manual
Aguilo Valentin, Miguel Alejandro
2014-07-01
The Design Optimization Toolkit (DOTk) is a stand-alone C++ software package intended to solve complex design optimization problems. DOTk software package provides a range of solution methods that are suited for gradient/nongradient-based optimization, large scale constrained optimization, and topology optimization. DOTk was design to have a flexible user interface to allow easy access to DOTk solution methods from external engineering software packages. This inherent flexibility makes DOTk barely intrusive to other engineering software packages. As part of this inherent flexibility, DOTk software package provides an easy-to-use MATLAB interface that enables users to call DOTk solution methods directly from the MATLAB command window.
An improved cockroach swarm optimization.
Obagbuwa, I C; Adewumi, A O
2014-01-01
Hunger component is introduced to the existing cockroach swarm optimization (CSO) algorithm to improve its searching ability and population diversity. The original CSO was modelled with three components: chase-swarming, dispersion, and ruthless; additional hunger component which is modelled using partial differential equation (PDE) method is included in this paper. An improved cockroach swarm optimization (ICSO) is proposed in this paper. The performance of the proposed algorithm is tested on well known benchmarks and compared with the existing CSO, modified cockroach swarm optimization (MCSO), roach infestation optimization RIO, and hungry roach infestation optimization (HRIO). The comparison results show clearly that the proposed algorithm outperforms the existing algorithms. PMID:24959611
Optimization Methods in Sherpa
NASA Astrophysics Data System (ADS)
Siemiginowska, Aneta; Nguyen, Dan T.; Doe, Stephen M.; Refsdal, Brian L.
2009-09-01
Forward fitting is a standard technique used to model X-ray data. A statistic, usually assumed weighted chi^2 or Poisson likelihood (e.g. Cash), is minimized in the fitting process to obtain a set of the best model parameters. Astronomical models often have complex forms with many parameters that can be correlated (e.g. an absorbed power law). Minimization is not trivial in such setting, as the statistical parameter space becomes multimodal and finding the global minimum is hard. Standard minimization algorithms can be found in many libraries of scientific functions, but they are usually focused on specific functions. However, Sherpa designed as general fitting and modeling application requires very robust optimization methods that can be applied to variety of astronomical data (X-ray spectra, images, timing, optical data etc.). We developed several optimization algorithms in Sherpa targeting a wide range of minimization problems. Two local minimization methods were built: Levenberg-Marquardt algorithm was obtained from MINPACK subroutine LMDIF and modified to achieve the required robustness; and Nelder-Mead simplex method has been implemented in-house based on variations of the algorithm described in the literature. A global search Monte-Carlo method has been implemented following a differential evolution algorithm presented by Storn and Price (1997). We will present the methods in Sherpa and discuss their usage cases. We will focus on the application to Chandra data showing both 1D and 2D examples. This work is supported by NASA contract NAS8-03060 (CXC).
Bower, Stanley
2011-12-31
A 5.0L V8 twin-turbocharged direct injection engine was designed, built, and tested for the purpose of assessing the fuel economy and performance in the F-Series pickup of the Dual Fuel engine concept and of an E85 optimized FFV engine. Additionally, production 3.5L gasoline turbocharged direct injection (GTDI) EcoBoost engines were converted to Dual Fuel capability and used to evaluate the cold start emissions and fuel system robustness of the Dual Fuel engine concept. Project objectives were: to develop a roadmap to demonstrate a minimized fuel economy penalty for an F-Series FFV truck with a highly boosted, high compression ratio spark ignition engine optimized to run with ethanol fuel blends up to E85; to reduce FTP 75 energy consumption by 15% - 20% compared to an equally powered vehicle with a current production gasoline engine; and to meet ULEV emissions, with a stretch target of ULEV II / Tier II Bin 4. All project objectives were met or exceeded.
Synthesizing optimal waste blends
Narayan, V.; Diwekar, W.M.; Hoza, M.
1996-10-01
Vitrification of tank wastes to form glass is a technique that will be used for the disposal of high-level waste at Hanford. Process and storage economics show that minimizing the total number of glass logs produced is the key to keeping cost as low as possible. The amount of glass produced can be reduced by blending of the wastes. The optimal way to combine the tanks to minimize the vole of glass can be determined from a discrete blend calculation. However, this problem results in a combinatorial explosion as the number of tanks increases. Moreover, the property constraints make this problem highly nonconvex where many algorithms get trapped in local minima. In this paper the authors examine the use of different combinatorial optimization approaches to solve this problem. A two-stage approach using a combination of simulated annealing and nonlinear programming (NLP) is developed. The results of different methods such as the heuristics approach based on human knowledge and judgment, the mixed integer nonlinear programming (MINLP) approach with GAMS, and branch and bound with lower bound derived from the structure of the given blending problem are compared with this coupled simulated annealing and NLP approach.
NASA Astrophysics Data System (ADS)
Gal-Yam, Avishay; Zackay, Barak; Ofek, Eran O.
2016-01-01
Transient detection and flux measurement via image subtraction are fundamental to time domain astronomy. Starting from first principles, we develop the optimal linear statistic for transient detection and flux measurement and any other image-difference hypothesis testing. We derive a simple closed-form statistic that: (1) Is mathematically proven to be the optimal subtraction statistic in the limit of background-dominated noise within the family of linear solutions, that contains all previously suggested methods; (2) Does not leave subtraction or deconvolution artifacts, even in the vicinity of bright stars; (3) Is an order of magnitude faster to compute than popular methods; (4) Allowsautomatic transient detection down to the theoretical sensitivity limit by providing a reliable, well-defined detection significance; (5) Is symmetric to the interchange of the new and reference images; (6) Is numerically stable; and (7) Is trivial to implement. We demonstratethat the correct way to prepare a reference image is the proper image co-addition presented in Zackay & Ofek 2015. Finally, we show a proper image subtraction statistic, that, along with its point spread functions, is a sufficient statistic for any decision or measurement on the difference image. This allows accurate filtration of image artifacts such as cosmic rays and hot pixels. We demonstrate this method on simulated data as well as on observations from the Palomar Transient Factory.
Optimal Synchronizability of Bearings
NASA Astrophysics Data System (ADS)
Araújo, N. A. M.; Seybold, H.; Baram, R. M.; Herrmann, H. J.; Andrade, J. S., Jr.
2013-02-01
Bearings are mechanical dissipative systems that, when perturbed, relax toward a synchronized (bearing) state. Here we find that bearings can be perceived as physical realizations of complex networks of oscillators with asymmetrically weighted couplings. Accordingly, these networks can exhibit optimal synchronization properties through fine-tuning of the local interaction strength as a function of node degree [Motter, Zhou, and Kurths, Phys. Rev. E 71, 016116 (2005)PLEEE81539-3755]. We show that, in analogy, the synchronizability of bearings can be maximized by counterbalancing the number of contacts and the inertia of their constituting rotor disks through the mass-radius relation, m˜rα, with an optimal exponent α=α× which converges to unity for a large number of rotors. Under this condition, and regardless of the presence of a long-tailed distribution of disk radii composing the mechanical system, the average participation per disk is maximized and the energy dissipation rate is homogeneously distributed among elementary rotors.
MAGEE,GLEN I.
2000-08-03
Computers transfer data in a number of different ways. Whether through a serial port, a parallel port, over a modem, over an ethernet cable, or internally from a hard disk to memory, some data will be lost. To compensate for that loss, numerous error detection and correction algorithms have been developed. One of the most common error correction codes is the Reed-Solomon code, which is a special subset of BCH (Bose-Chaudhuri-Hocquenghem) linear cyclic block codes. In the AURA project, an unmanned aircraft sends the data it collects back to earth so it can be analyzed during flight and possible flight modifications made. To counter possible data corruption during transmission, the data is encoded using a multi-block Reed-Solomon implementation with a possibly shortened final block. In order to maximize the amount of data transmitted, it was necessary to reduce the computation time of a Reed-Solomon encoding to three percent of the processor's time. To achieve such a reduction, many code optimization techniques were employed. This paper outlines the steps taken to reduce the processing time of a Reed-Solomon encoding and the insight into modern optimization techniques gained from the experience.
Optimization of inclusive fitness.
Grafen, Alan
2006-02-01
The first fully explicit argument is given that broadly supports a widespread belief among whole-organism biologists that natural selection tends to lead to organisms acting as if maximizing their inclusive fitness. The use of optimization programs permits a clear statement of what this belief should be understood to mean, in contradistinction to the common mathematical presumption that it should be formalized as some kind of Lyapunov or even potential function. The argument reveals new details and uncovers latent assumptions. A very general genetic architecture is allowed, and there is arbitrary uncertainty. However, frequency dependence of fitnesses is not permitted. The logic of inclusive fitness immediately draws together various kinds of intra-genomic conflict, and the concept of 'p-family' is introduced. Inclusive fitness is thus incorporated into the formal Darwinism project, which aims to link the mathematics of motion (difference and differential equations) used to describe gene frequency trajectories with the mathematics of optimization used to describe purpose and design. Important questions remain to be answered in the fundamental theory of inclusive fitness. PMID:16046225
Diffusion with optimal resetting
NASA Astrophysics Data System (ADS)
Evans, Martin R.; Majumdar, Satya N.
2011-10-01
We consider the mean time to absorption by an absorbing target of a diffusive particle with the addition of a process whereby the particle is reset to its initial position with rate r. We consider several generalizations of the model of Evans and Majumdar (2011 Phys. Rev. Lett.106 160601): (i) a space-dependent resetting rate r(x); (ii) resetting to a random position z drawn from a resetting distribution { P}(z); and (iii) a spatial distribution for the absorbing target PT(x). As an example of (i) we show that the introduction of a non-resetting window around the initial position can reduce the mean time to absorption provided that the initial position is sufficiently far from the target. We address the problem of optimal resetting, that is, minimizing the mean time to absorption for a given target distribution. For an exponentially decaying target distribution centred at the origin we show that a transition in the optimal resetting distribution occurs as the target distribution narrows.
Parametric Design Optimization By Integrating CAD Systems And Optimization Tools
NASA Astrophysics Data System (ADS)
Rehan, M.; Olabi, A. G.
2009-11-01
Designing a cost effective product in minimum time is a complex process. In order to achieve this goal the requirement of optimum designs are becoming more important. One of the time consuming factor in the design optimization cycle is the modifications of Computer Aided Design (CAD) model after optimization. In conventional design optimization techniques the design engineer has to update the CAD model after receiving optimum design from optimization tools. It is worthwhile using parametric design optimization process to minimize the optimization cycle time. This paper presents a comprehensive study to integrate the optimization parameters between CAD system and optimization tools which were driven from a single user environment. Finally, design optimization of a Compressed Natural Gas (CNG) cylinder was implemented as case study. In this case study the optimization tools were fully integrated with CAD system, therefore, all the deliverables including; part design, drawings and assembly can be automatically updated after achieving the optimum geometry having minimum volume and satisfying all imposed constraints.
Particle swarm optimization for complex nonlinear optimization problems
NASA Astrophysics Data System (ADS)
Alexandridis, Alex; Famelis, Ioannis Th.; Tsitouras, Charalambos
2016-06-01
This work presents the application of a technique belonging to evolutionary computation, namely particle swarm optimization (PSO), to complex nonlinear optimization problems. To be more specific, a PSO optimizer is setup and applied to the derivation of Runge-Kutta pairs for the numerical solution of initial value problems. The effect of critical PSO operational parameters on the performance of the proposed scheme is thoroughly investigated.
Ultimate open pit stochastic optimization
NASA Astrophysics Data System (ADS)
Marcotte, Denis; Caron, Josiane
2013-02-01
Classical open pit optimization (maximum closure problem) is made on block estimates, without directly considering the block grades uncertainty. We propose an alternative approach of stochastic optimization. The stochastic optimization is taken as the optimal pit computed on the block expected profits, rather than expected grades, computed from a series of conditional simulations. The stochastic optimization generates, by construction, larger ore and waste tonnages than the classical optimization. Contrary to the classical approach, the stochastic optimization is conditionally unbiased for the realized profit given the predicted profit. A series of simulated deposits with different variograms are used to compare the stochastic approach, the classical approach and the simulated approach that maximizes expected profit among simulated designs. Profits obtained with the stochastic optimization are generally larger than the classical or simulated pit. The main factor controlling the relative gain of stochastic optimization compared to classical approach and simulated pit is shown to be the information level as measured by the boreholes spacing/range ratio. The relative gains of the stochastic approach over the classical approach increase with the treatment costs but decrease with mining costs. The relative gains of the stochastic approach over the simulated pit approach increase both with the treatment and mining costs. At early stages of an open pit project, when uncertainty is large, the stochastic optimization approach appears preferable to the classical approach or the simulated pit approach for fair comparison of the values of alternative projects and for the initial design and planning of the open pit.
Optimization of electrolytic cells
Alkire, R.; Soon, S-A.; Sradther, M.
1985-05-01
A methodology was developed for optimizing electrolytic cells described by a potential field distribution along with material, voltage, and economic balance equations. In the present study, the cell consisted of two flow-through porous electrodes separated by a membrane. The model consisted of two nonlinear differential equations, 1 variables, eight equality constraints, and five inequality constraints. The optimum solutions were obtained for simple economic objectives with use of a successive quadratic programming method. The sensitivity of the optimum to operating variables and design constraints was found with the use of Lagrange multipliers. The method may be applied to an electrolytic cell which can be modeled by a combination of differential, algebraic, and polynomial (curve-fit) equations.
NASA Astrophysics Data System (ADS)
Downing, C. A.; Pearce, A. R.; Churchill, R. J.; Portnoi, M. E.
2015-10-01
We transform the two-dimensional Dirac-Weyl equation, which governs the charge carriers in graphene, into a nonlinear first-order differential equation for scattering phase shift, using the so-called variable-phase method. This allows us to utilize the Levinson theorem, relating scattering phase shifts of a slow particle to its bound states, to find zero-energy bound states created electrostatically in realistic structures. These confined states are formed at critical potential strengths, which leads us to posit the use of "optimal traps" to combat the chiral tunneling found in graphene: this could be explored experimentally with an artificial network of point charges held above the graphene layer. We also discuss scattering on these states and find that the s states create a dominant peak in the scattering cross section as the energy tends towards the Dirac point energy, suggesting a dominant contribution to the resistivity.
Desalination Plant Optimization
1992-10-01
MSF21 and VTE21 perform design and costing calculations for multistage flash evaporator (MSF) and multieffect vertical tube evaporator (VTE) desalination plants. An optimization capability is available, if desired. The MSF plant consists of a recovery section, reject section, brine heater, and associated buildings and equipment. Operating costs and direct and indirect capital costs for plant, buildings, site, and intakes are calculated. Computations are based on the first and last stages of each section and amore » typical middle recovery stage. As a result, the program runs rapidly but does not give stage by stage parameters. The VTE plant consists of vertical tube effects, multistage flash preheater, condenser, and brine heater and associated buildings and equipment. Design computations are done for each vertical tube effect, but preheater computations are based on the first and last stages and a typical middle stage.« less
Gogol, Manfred
2015-08-01
Stress is a stimulus or incident which has an exogenic or endogenic influence on an organism and leads to a biological and/or psychological adaptation from the organism by adaptation. Stressors can be differentiated by the temporal impact (e.g. acute, chronic or acute on chronic), strength and quality. The consequences of stress exposure and adaptation can be measured at the cellular level and as (sub) clinical manifestations, where this process can be biologically seen as a continuum. Over the course of life there is an accumulation of stress incidents resulting in a diminution of the capability for adaptation and repair mechanisms. By means of various interventions it is possible to improve the individual capability for adaptation but it is not currently definitively possible to disentangle alterations due to ageing and the development of diseases. As a consequence the term "healthy ageing" should be replaced by the concept of "optimal ageing". PMID:26208575
DENSE MEDIA CYCLONE OPTIMIZATION
Gerald H. Luttrell
2002-04-11
The test data obtained from the Baseline Assessment that compares the performance of the density traces to that of different sizes of coal particles is now complete. The experimental results show that the tracer data can indeed be used to accurately predict HMC performance. The following conclusions were drawn: (i) the tracer curve is slightly sharper than curve for coarsest size fraction of coal (probably due to the greater resolution of the tracer technique), (ii) the Ep increases with decreasing coal particle size, and (iii) the Ep values are not excessively large for the well-maintained HMC circuits. The major problems discovered were associated with improper apex-to-vortex finder ratios and particle hang-up due to media segregation. Only one plant yielded test data that were typical of a fully optimized level of performance.
Cyclone performance and optimization
Leith, D.
1989-06-15
The objectives of this project are: to characterize the gas flow pattern within cyclones, to revise the theory for cyclone performance on the basis of these findings, and to design and test cyclones whose dimensions have been optimized using revised performance theory. This work is important because its successful completion will aid in the technology for combustion of coal in pressurized, fluidized beds. We have now received all the equipment necessary for the flow visualization studies described over the last two progress reports. We have begun more detailed studies of the gas flow pattern within cyclones as detailed below. Third, we have begun studies of the effect of particle concentration on cyclone performance. This work is critical to application of our results to commercial operations. 1 fig.
DENSE MEDIA CYCLONE OPTIMIZATION
Gerald H. Luttrell
2002-01-14
During the past quarter, float-sink analyses were completed for four of seven circuits evaluated in this project. According to the commercial laboratory, the analyses for the remaining three sites will be finished by mid February 2002. In addition, it was necessary to repeat several of the float-sink tests to resolve problems identified during the analysis of the experimental data. In terms of accomplishments, a website is being prepared to distribute project findings and software to the public. This site will include (i) an operators manual for HMC operation and maintenance (already available in hard copy), (ii) an expert system software package for evaluating and optimizing HMC performance (in development), and (iii) a spreadsheet-based process model for plant designers (in development). Several technology transfer activities were also carried out including the publication of project results in proceedings and the training of plant operations via workshops.
Optimizing process vacuum condensers
Lines, J.R.; Tice, D.W.
1997-09-01
Vacuum condensers play a critical role in supporting vacuum processing operations. Although they may appear similar to atmospheric units, vacuum condensers have their own special designs, considerations and installation needs. By adding vacuum condensers, precondensers and intercondensers, system cost efficiency can be optimized. Vacuum-condensing systems permit reclamation of high-value product by use of a precondenser, or reduce operating costs with intercondensers. A precondenser placed between the vacuum vessel and ejector system will recover valuable process vapors and reduce vapor load to an ejector system--minimizing the system`s capital and operating costs. Similarly, an intercondenser positioned between ejector stages can condense motive steam and process vapors and reduce vapor load to downstream ejectors as well as lower capital and operating costs. The paper describes vacuum condenser systems, types of vacuum condensers, shellside condensing, tubeside condensing, noncondensable gases, precondenser pressure drop, system interdependency, equipment installation, and equipment layout.
Optimized nanoporous materials.
Braun, Paul V.; Langham, Mary Elizabeth; Jacobs, Benjamin W.; Ong, Markus D.; Narayan, Roger J.; Pierson, Bonnie E.; Gittard, Shaun D.; Robinson, David B.; Ham, Sung-Kyoung; Chae, Weon-Sik; Gough, Dara V.; Wu, Chung-An Max; Ha, Cindy M.; Tran, Kim L.
2009-09-01
Nanoporous materials have maximum practical surface areas for electrical charge storage; every point in an electrode is within a few atoms of an interface at which charge can be stored. Metal-electrolyte interfaces make best use of surface area in porous materials. However, ion transport through long, narrow pores is slow. We seek to understand and optimize the tradeoff between capacity and transport. Modeling and measurements of nanoporous gold electrodes has allowed us to determine design principles, including the fact that these materials can deplete salt from the electrolyte, increasing resistance. We have developed fabrication techniques to demonstrate architectures inspired by these principles that may overcome identified obstacles. A key concept is that electrodes should be as close together as possible; this is likely to involve an interpenetrating pore structure. However, this may prove extremely challenging to fabricate at the finest scales; a hierarchically porous structure can be a worthy compromise.
Bahrami, Bahador; Olsen, Karsten; Latham, Peter E.; Roepstorff, Andreas; Rees, Geraint; Frith, Chris D.
2012-01-01
In everyday life, many believe that ‘two heads are better than one’. Indeed, our ability to solve problems together appears to be fundamental to the current dominance, and future survival, of the human species. But are two heads really better than one? We addressed this question in the context of a collective low-level perceptual decision-making task. For two observers of nearly equal sensitivity, two heads were definitely better than one, provided that they were given the opportunity to communicate freely, even in the absence of any feedback about decision outcomes. But for observers with very different sensitivities, two heads were worse than the better one. These seemingly discrepant patterns of group behaviour can be explained by a model in which two heads are Bayes optimal under the assumption that individuals accurately communicate their level of confidence on every trial. PMID:20798320
Optimality in Data Assimilation
NASA Astrophysics Data System (ADS)
Nearing, Grey; Yatheendradas, Soni
2016-04-01
It costs a lot more to develop and launch an earth-observing satellite than it does to build a data assimilation system. As such, we propose that it is important to understand the efficiency of our assimilation algorithms at extracting information from remote sensing retrievals. To address this, we propose that it is necessary to adopt completely general definition of "optimality" that explicitly acknowledges all differences between the parametric constraints of our assimilation algorithm (e.g., Gaussianity, partial linearity, Markovian updates) and the true nature of the environmetnal system and observing system. In fact, it is not only possible, but incredibly straightforward, to measure the optimality (in this more general sense) of any data assimilation algorithm as applied to any intended model or natural system. We measure the information content of remote sensing data conditional on the fact that we are already running a model and then measure the actual information extracted by data assimilation. The ratio of the two is an efficiency metric, and optimality is defined as occurring when the data assimilation algorithm is perfectly efficient at extracting information from the retrievals. We measure the information content of the remote sensing data in a way that, unlike triple collocation, does not rely on any a priori presumed relationship (e.g., linear) between the retrieval and the ground truth, however, like triple-collocation, is insensitive to the spatial mismatch between point-based measurements and grid-scale retrievals. This theory and method is therefore suitable for use with both dense and sparse validation networks. Additionally, the method we propose is *constructive* in the sense that it provides guidance on how to improve data assimilation systems. All data assimilation strategies can be reduced to approximations of Bayes' law, and we measure the fractions of total information loss that are due to individual assumptions or approximations in the
OPTIMAL NETWORK TOPOLOGY DESIGN
NASA Technical Reports Server (NTRS)
Yuen, J. H.
1994-01-01
This program was developed as part of a research study on the topology design and performance analysis for the Space Station Information System (SSIS) network. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. It is intended that this new design technique consider all important performance measures explicitly and take into account the constraints due to various technical feasibilities. In the current program, technical constraints are taken care of by the user properly forming the starting set of candidate components (e.g. nonfeasible links are not included). As subsets are generated, they are tested to see if they form an acceptable network by checking that all requirements are satisfied. Thus the first acceptable subset encountered gives the cost-optimal topology satisfying all given constraints. The user must sort the set of "feasible" link elements in increasing order of their costs. The program prompts the user for the following information for each link: 1) cost, 2) connectivity (number of stations connected by the link), and 3) the stations connected by that link. Unless instructed to stop, the program generates all possible acceptable networks in increasing order of their total costs. The program is written only to generate topologies that are simply connected. Tests on reliability, delay, and other performance measures are discussed in the documentation, but have not been incorporated into the program. This program is written in PASCAL for interactive execution and has been implemented on an IBM PC series computer operating under PC DOS. The disk contains source code only. This program was developed in 1985.
Optimal management strategies in variable environments: Stochastic optimal control methods
Williams, B.K.
1985-01-01
Dynamic optimization was used to investigate the optimal defoliation of salt desert shrubs in north-western Utah. Management was formulated in the context of optimal stochastic control theory, with objective functions composed of discounted or time-averaged biomass yields. Climatic variability and community patterns of salt desert shrublands make the application of stochastic optimal control both feasible and necessary. A primary production model was used to simulate shrub responses and harvest yields under a variety of climatic regimes and defoliation patterns. The simulation results then were used in an optimization model to determine optimal defoliation strategies. The latter model encodes an algorithm for finite state, finite action, infinite discrete time horizon Markov decision processes. Three questions were addressed: (i) What effect do changes in weather patterns have on optimal management strategies? (ii) What effect does the discounting of future returns have? (iii) How do the optimal strategies perform relative to certain fixed defoliation strategies? An analysis was performed for the three shrub species, winterfat (Ceratoides lanata), shadscale (Atriplex confertifolia) and big sagebrush (Artemisia tridentata). In general, the results indicate substantial differences among species in optimal control strategies, which are associated with differences in physiological and morphological characteristics. Optimal policies for big sagebrush varied less with variation in climate, reserve levels and discount rates than did either shadscale or winterfat. This was attributed primarily to the overwintering of photosynthetically active tissue and to metabolic activity early in the growing season. Optimal defoliation of shadscale and winterfat generally was more responsive to differences in plant vigor and climate, reflecting the sensitivity of these species to utilization and replenishment of carbohydrate reserves. Similarities could be seen in the influence of both
GAPS IN SUPPORT VECTOR OPTIMIZATION
STEINWART, INGO; HUSH, DON; SCOVEL, CLINT; LIST, NICOLAS
2007-01-29
We show that the stopping criteria used in many support vector machine (SVM) algorithms working on the dual can be interpreted as primal optimality bounds which in turn are known to be important for the statistical analysis of SVMs. To this end we revisit the duality theory underlying the derivation of the dual and show that in many interesting cases primal optimality bounds are the same as known dual optimality bounds.
Recent developments in multilevel optimization
NASA Technical Reports Server (NTRS)
Vanderplaats, Garret N.; Kim, D.-S.
1989-01-01
Recent developments in multilevel optimization are briefly reviewed. The general nature of the multilevel design task, the use of approximations to develop and solve the analysis design task, the structure of the formal multidiscipline optimization problem, a simple cantilevered beam which demonstrates the concepts of multilevel design and the basic mathematical details of the optimization task and the system level are among the topics discussed.
Structural optimization by multilevel decomposition
NASA Technical Reports Server (NTRS)
Sobieszczanski-Sobieski, J.; James, B.; Dovi, A.
1983-01-01
A method is described for decomposing an optimization problem into a set of subproblems and a coordination problem which preserves coupling between the subproblems. The method is introduced as a special case of multilevel, multidisciplinary system optimization and its algorithm is fully described for two level optimization for structures assembled of finite elements of arbitrary type. Numerical results are given for an example of a framework to show that the decomposition method converges and yields results comparable to those obtained without decomposition. It is pointed out that optimization by decomposition should reduce the design time by allowing groups of engineers, using different computers to work concurrently on the same large problem.
Structural Optimization in automotive design
NASA Technical Reports Server (NTRS)
Bennett, J. A.; Botkin, M. E.
1984-01-01
Although mathematical structural optimization has been an active research area for twenty years, there has been relatively little penetration into the design process. Experience indicates that often this is due to the traditional layout-analysis design process. In many cases, optimization efforts have been outgrowths of analysis groups which are themselves appendages to the traditional design process. As a result, optimization is often introduced into the design process too late to have a significant effect because many potential design variables have already been fixed. A series of examples are given to indicate how structural optimization has been effectively integrated into the design process.
Stochastic Optimization of Complex Systems
Birge, John R.
2014-03-20
This project focused on methodologies for the solution of stochastic optimization problems based on relaxation and penalty methods, Monte Carlo simulation, parallel processing, and inverse optimization. The main results of the project were the development of a convergent method for the solution of models that include expectation constraints as in equilibrium models, improvement of Monte Carlo convergence through the use of a new method of sample batch optimization, the development of new parallel processing methods for stochastic unit commitment models, and the development of improved methods in combination with parallel processing for incorporating automatic differentiation methods into optimization.
RNA based evolutionary optimization
NASA Astrophysics Data System (ADS)
Schuster, Peter
1993-12-01
. Evolutionary optimization of two-letter sequences in thus more difficult than optimization in the world of natural RNA sequences with four bases. This fact might explain the usage of four bases in the genetic language of nature. Finally we study the mapping from RNA sequences into secondary structures and explore the topology of RNA shape space. We find that ‘neutral paths’ connecting neighbouring sequences with identical structures go very frequently through entire sequence space. Sequences folding into common structures are found everywhere in sequence space. Hence, evolution can migrate to almost every part of sequence space without ‘hill climbing’ and only small fractions of the entire number of sequences have to be searched in order to find suitable structures.
NASA Astrophysics Data System (ADS)
Inanloo, B.
2011-12-01
The Caspian Sea is considered to be the largest inland body of water in the world, which located between the Caucasus Mountains and Central Asia. The Caspian Sea has been a source of the most contentious international conflicts between five littoral states now borders the sea: Azerbaijan, Iran, Kazakhstan, Russia, and Turkmenistan. The conflict over the legal status of this international body of water as an aftermath of the breakup of the Soviet Union in 1991. Since then the parties have been negotiating without coming up with any agreement neither on the ownerships of waters, nor the oil and natural gas beneath them. The number of involved stakeholders, the unusual characteristics of the Caspian Sea in considering it as a lake or a sea, and a large number of external parties are interested in the valuable resources of the Sea has made this conflict complex and unique. This paper intends to apply methods to find the best allocation schemes considering acceptability and stability of selected solution to share the Caspian Sea and its resources fairly and efficiently. Although, there are several allocation methods in solving such allocation problems, however, most of those seek a socially optimal solution that can satisfy majority of criteria or decision makers, while, in practice, especially in multi-nation problems, such solution may not be necessarily a stable solution and to be acceptable to all parties. Hence, there is need to apply a method that considers stability and acceptability of solutions to find a solution with high chance to be agreed upon that. Application of some distance-based methods in studying the Caspian Sea conflict provides some policy insights useful for finding solutions that can resolve the dispute. In this study, we use methods such as Goal Programming, Compromise Programming, and considering stability of solution the logic of Power Index is used to find a division rule that is stable negotiators. The results of this study shows that the
Acoustic Radiation Optimization Using the Particle Swarm Optimization Algorithm
NASA Astrophysics Data System (ADS)
Jeon, Jin-Young; Okuma, Masaaki
The present paper describes a fundamental study on structural bending design to reduce noise using a new evolutionary population-based heuristic algorithm called the particle swarm optimization algorithm (PSOA). The particle swarm optimization algorithm is a parallel evolutionary computation technique proposed by Kennedy and Eberhart in 1995. This algorithm is based on the social behavior models for bird flocking, fish schooling and other models investigated by zoologists. Optimal structural design problems to reduce noise are highly nonlinear, so that most conventional methods are difficult to apply. The present paper investigates the applicability of PSOA to such problems. Optimal bending design of a vibrating plate using PSOA is performed in order to minimize noise radiation. PSOA can be effectively applied to such nonlinear acoustic radiation optimization.
Aluminum laser welding optimization
NASA Astrophysics Data System (ADS)
Chmelíčková, Hana; Halenka, Viktor; Lapšanská, Hana; Havelková, Martina
2007-04-01
Pulsed Nd:YAG laser with maximal power 150 W is used in our laboratory to cut, drill and weld metal and non-metal thin materials to thickness 2 mm. Welding is realized by fixed processing head or movable fiber one with beam diameter 0,6 mm in focus plane. Welding of stainless and low-carbon steel was tested before and results are publicized and used in practice. Now the goal of our experiment was optimization of process parameters for aluminum that has other physical properties than steels, lower density, higher heat conductivity and surface reflexivity. Pure alumina specimen 0,8 mm and Al-Mg-Si alloy 0,5 mm prepared for butt welds. Problem with surface layer of Al IIO 3 was overcome by sanding and chemical cleaning with grinding paste. Critical parameters for good weld shape are specimen position from beam focus plane, pulse length and energy, pulse frequency and the motion velocity that determines percentage of pulse overlap. Argon as protective gas was used with speed 6 liters per second. Thermal distribution in material can be modeled by numerical simulation. Software tool SYSWELD makes possible to fit laser as surface heat source, define weld geometry, and make meshing of specimen to finite elements and compute heat conduction during process. Color isotherms, vectors, mechanical deformations and others results can be study in post-processing.
Optimized System Identification
NASA Technical Reports Server (NTRS)
Juang, Jer-Nan; Longman, Richard W.
1999-01-01
In system identification, one usually cares most about finding a model whose outputs are as close as possible to the true system outputs when the same input is applied to both. However, most system identification algorithms do not minimize this output error. Often they minimize model equation error instead, as in typical least-squares fits using a finite-difference model, and it is seen here that this distinction is significant. Here, we develop a set of system identification algorithms that minimize output error for multi-input/multi-output and multi-input/single-output systems. This is done with sequential quadratic programming iterations on the nonlinear least-squares problems, with an eigendecomposition to handle indefinite second partials. This optimization minimizes a nonlinear function of many variables, and hence can converge to local minima. To handle this problem, we start the iterations from the OKID (Observer/Kalman Identification) algorithm result. Not only has OKID proved very effective in practice, it minimizes an output error of an observer which has the property that as the data set gets large, it converges to minimizing the criterion of interest here. Hence, it is a particularly good starting point for the nonlinear iterations here. Examples show that the methods developed here eliminate the bias that is often observed using any system identification methods of either over-estimating or under-estimating the damping of vibration modes in lightly damped structures.
Optimal Phase Oscillatory Network
NASA Astrophysics Data System (ADS)
Follmann, Rosangela
2013-03-01
Important topics as preventive detection of epidemics, collective self-organization, information flow and systemic robustness in clusters are typical examples of processes that can be studied in the context of the theory of complex networks. It is an emerging theory in a field, which has recently attracted much interest, involving the synchronization of dynamical systems associated to nodes, or vertices, of the network. Studies have shown that synchronization in oscillatory networks depends not only on the individual dynamics of each element, but also on the combination of the topology of the connections as well as on the properties of the interactions of these elements. Moreover, the response of the network to small damages, caused at strategic points, can enhance the global performance of the whole network. In this presentation we explore an optimal phase oscillatory network altered by an additional term in the coupling function. The application to associative-memory network shows improvement on the correct information retrieval as well as increase of the storage capacity. The inclusion of some small deviations on the nodes, when solutions are attracted to a false state, results in additional enhancement of the performance of the associative-memory network. Supported by FAPESP - Sao Paulo Research Foundation, grant number 2012/12555-4
van der Sanden, Boudewijn; Dhobb, Mehdi; Berger, François; Wion, Didier
2010-11-01
Stem cells always balance between self-renewal and differentiation. Hence, stem cell culture parameters are critical and need to be continuously refined according to progress in our stem cell biology understanding and the latest technological developments. In the past few years, major efforts have been made to define more precisely the medium composition in which stem cells grow or differentiate. This led to the progressive replacement of ill-defined additives such as serum or feeder cell layers by recombinant cytokines or growth factors. Another example is the control of the oxygen pressure. For many years cell cultures have been done under atmospheric oxygen pressure which is much higher than the one experienced by stem cells in vivo. A consequence of cell metabolism is that cell culture conditions are constantly changing. Therefore, the development of high sensitive monitoring processes and control algorithms is required for ensuring cell culture medium homeostasis. Stem cells also sense the physical constraints of their microenvironment. Rigidity, stiffness, and geometry of the culture substrate influence stem cell fate. Hence, nanotopography is probably as important as medium formulation in the optimization of stem cell culture conditions. Recent advances include the development of synthetic bioinformative substrates designed at the micro- and nanoscale level. On going research in many different fields including stem cell biology, nanotechnology, and bioengineering suggest that our current way to culture cells in Petri dish or flasks will soon be outdated as flying across the Atlantic Ocean in the Lindbergh's plane. PMID:20803548
Cyclone performance and optimization
Leith, D.
1989-03-15
The objectives of this project are: to characterize the gas flow pattern within cyclones, to revise the theory for cyclone performance on the basis of these findings, and to design and test cyclones whose dimensions have been optimized using revised performance theory. This work is important because its successful completion will aid in the technology for combustion of coal in pressurized, fluidized beds. This quarter, we have been hampered somewhat by flow delivery of the bubble generation system and arc lighting system placed on order last fall. This equipment is necessary to map the flow field within cyclones using the techniques described in last quarter's report. Using the bubble generator, we completed this quarter a study of the natural length'' of cyclones of 18 different configurations, each configuration operated at five different gas flows. Results suggest that the equation by Alexander for natural length is incorrect; natural length as measured with the bubble generation system is always below the bottom of the cyclones regardless of the cyclone configuration or gas flow, within the limits of the experimental cyclones tested. This finding is important because natural length is a term in equations used to predict cyclone efficiency. 1 tab.
Powers, Tom
2013-09-01
This work describes preliminary results of a new software tool that allows one to vary parameters and understand the effects on the optimized costs of construction plus 10 year operations of an SRF linac, the associated cryogenic facility, and controls, where operations includes the cost of the electrical utilities but not the labor or other costs. It derives from collaborative work done with staff from Accelerator Science and Technology Centre, Daresbury, UK several years ago while they were in the process of developing a conceptual design for the New Light Source project.[1] The initial goal was to convert a spread sheet format to a graphical interface to allow the ability to sweep different parameter sets. The tools also allow one to compare the cost of the different facets of the machine design and operations so as to better understand the tradeoffs. The work was first published in an ICFA Beam Dynamics News Letter.[2] More recent additions to the software include the ability to save and restore input parameters as well as to adjust the Qo versus E parameters in order to explore the potential costs savings associated with doing so. Additionally, program changes now allow one to model the costs associated with a linac that makes use of energy recovery mode of operation.
Sweeping Jet Optimization Studies
NASA Technical Reports Server (NTRS)
Melton, LaTunia Pack; Koklu, Mehti; Andino, Marlyn; Lin, John C.; Edelman, Louis
2016-01-01
Progress on experimental efforts to optimize sweeping jet actuators for active flow control (AFC) applications with large adverse pressure gradients is reported. Three sweeping jet actuator configurations, with the same orifice size but di?erent internal geometries, were installed on the flap shoulder of an unswept, NACA 0015 semi-span wing to investigate how the output produced by a sweeping jet interacts with the separated flow and the mechanisms by which the flow separation is controlled. For this experiment, the flow separation was generated by deflecting the wing's 30% chord trailing edge flap to produce an adverse pressure gradient. Steady and unsteady pressure data, Particle Image Velocimetry data, and force and moment data were acquired to assess the performance of the three actuator configurations. The actuator with the largest jet deflection angle, at the pressure ratios investigated, was the most efficient at controlling flow separation on the flap of the model. Oil flow visualization studies revealed that the flow field controlled by the sweeping jets was more three-dimensional than expected. The results presented also show that the actuator spacing was appropriate for the pressure ratios examined.
Optimizing haemodialysate composition
Locatelli, Francesco; La Milia, Vincenzo; Violo, Leano; Del Vecchio, Lucia; Di Filippo, Salvatore
2015-01-01
Survival and quality of life of dialysis patients are strictly dependent on the quality of the haemodialysis (HD) treatment. In this respect, dialysate composition, including water purity, plays a crucial role. A major aim of HD is to normalize predialysis plasma electrolyte and mineral concentrations, while minimizing wide swings in the patient's intradialytic plasma concentrations. Adequate sodium (Na) and water removal is critical for preventing intra- and interdialytic hypotension and pulmonary edema. Avoiding both hyper- and hypokalaemia prevents life-threatening cardiac arrhythmias. Optimal calcium (Ca) and magnesium (Mg) dialysate concentrations may protect the cardiovascular system and the bones, preventing extraskeletal calcifications, severe secondary hyperparathyroidism and adynamic bone disease. Adequate bicarbonate concentration [HCO3−] maintains a stable pH in the body fluids for appropriate protein and membrane functioning and also protects the bones. An adequate dialysate glucose concentration prevents severe hyperglycaemia and life-threating hypoglycaemia, which can lead to severe cardiovascular complications and a worsening of diabetic comorbidities. PMID:26413285
Optimally Squeezed Spin States
NASA Astrophysics Data System (ADS)
Rojo, Alberto
2004-03-01
We consider optimally spin-squeezed states that maximize the sensitivity of the Ramsey spectroscopy, and for which the signal to noise ratio scales as the number of particles N. Using the variational principle we prove that these states are eigensolutions of the Hamiltonian H(λ)=λ S_z^2-S_x, and that, for large N, the states become equivalent to the quadrature squeezed states of the harmonic oscillator. We present numerical results that illustrate the validity of the equivalence. We also present results of spin squeezing via atom-field interactions within the context of the Tavis-Cummings model. An ensemble of N two-level atoms interacts with a quantized cavity field. For all the atoms initially in their ground states, it is shown that spin squeezing of both the atoms and the field can be achieved provided the initial state of the cavity field has coherence between number states differing by 2. Most of the discussion is restricted to the case of a cavity field initially in a coherent state, but initial squeezed states for the field are also discussed. An analytic solution is found that is valid in the limit that the number of atoms is much greater than unity. References: A. G. Rojo, Phys. Rev A, 68, 013807 (2003); Claudiu Genes, P. R. Berman, and A. G. Rojo Phys. Rev. A 68, 043809 (2003).
McNamara, John M; Fromhage, Lutz; Barta, Zoltan; Houston, Alasdair I
2009-03-01
In many animal species, females will benefit if they can secure their mate's help in raising their young. It has been suggested that they can achieve this by being coy (i.e. reluctant to mate) when courted, because this gives them time to assess a prospective mate's helpfulness and hence allows them to reject non-helpful males. According to this view, coyness should (i) reflect a trade-off between information gain and time lost on the part of the female, and (ii) be subject to an evolutionary feedback between optimal female coyness and male helping behaviour. Previous theory has considered each of these aspects in isolation. By contrast, here we present a comprehensive game theory model of this situation, leading to qualitatively new insights. We predict that a high degree of coyness should be associated with a high encounter rate during mate search, with an intermediate rate of information gain during mate inspection and with an intermediate dependence of reproduction on male help. Strongly biased sex ratios, however, preclude coyness. Due to the mutual feedback between coyness and helpfulness in our model, alternatively stable evolutionary outcomes (with or without coyness) are possible under broad conditions. We also discuss alternative interpretations of coyness. PMID:19129134
Optimizing management of glycaemia.
Chatterjee, Sudesna; Khunti, Kamlesh; Davies, Melanie J
2016-06-01
The global epidemic of type 2 diabetes (T2DM) continues largely unabated due to an increasingly sedentary lifestyle and obesogenic environment. A cost-effective patient-centred approach, incorporating glucose-lowering therapy and modification of cardiovascular risk factors, could help prevent the inevitable development and progression of macrovascular and microvascular complications. Glycaemic optimization requires patient structured education, self-management and empowerment, and psychological support along with early and proactive use of glucose lowering therapies, which should be delivered in a system of care as shown by the Chronic Care Model. From diagnosis, intensive glycaemic control and individualised care is aimed at reducing complications. In older people, the goal is maintaining quality of life and minimizing morbidity, especially as overtreatment increases hypoglycaemia risk. Maintaining durable glycaemic control is challenging and complex to achieve without hypoglycaemia, weight gain and other significant adverse effects. Overcoming patient and physician barriers can help ensure adequate treatment initiation and intensification. Cardiovascular safety studies with newer glucose-lowering agents are now mandatory, with a sodium glucose co-transporter-2 inhibitor (empagliflozin), and two glucagon like peptide-1 receptor agonists (liraglutide and semaglutide) being the first to demonstrate superior CV outcomes compared with placebo. PMID:27432074
Max, N. |
1992-12-17
Radiosity algorithms for global illumination, either ``gathering`` or ``shooting`` versions, depend on the calculation of form factors. It is possible to calculate the form factors analytically, but this is difficult when occlusion is involved, so sampling methods are usually preferred. The necessary visibility information can be obtained by ray tracing in the sampled directions. However, area coherence makes it more efficient to project and scan-convert the scene onto a number of planes, for example, the faces of a hemicube. The hemicube faces have traditionally been divided into equal square pixels, but more general subdivisions are practical, and can reduce the variance of the form factor estimates. The hemicube estimates of form factors are based on a finite set of sample directions. We obtain several optimal arrangements of sample directions, which minimize the variance of this estimate. Four approaches are changing the size of the pixels, the shape of the pixels, the shape of the hemicube, or using non-uniform pixel grids. The best approach reduces the variance by 43%. The variance calculation is based on the assumption that the errors in the estimate are caused by the projections of single edges of polygonal patches, and that the positions and orientations of these edges are random.
Max, N. California Univ., Davis, CA )
1992-12-17
Radiosity algorithms for global illumination, either gathering'' or shooting'' versions, depend on the calculation of form factors. It is possible to calculate the form factors analytically, but this is difficult when occlusion is involved, so sampling methods are usually preferred. The necessary visibility information can be obtained by ray tracing in the sampled directions. However, area coherence makes it more efficient to project and scan-convert the scene onto a number of planes, for example, the faces of a hemicube. The hemicube faces have traditionally been divided into equal square pixels, but more general subdivisions are practical, and can reduce the variance of the form factor estimates. The hemicube estimates of form factors are based on a finite set of sample directions. We obtain several optimal arrangements of sample directions, which minimize the variance of this estimate. Four approaches are changing the size of the pixels, the shape of the pixels, the shape of the hemicube, or using non-uniform pixel grids. The best approach reduces the variance by 43%. The variance calculation is based on the assumption that the errors in the estimate are caused by the projections of single edges of polygonal patches, and that the positions and orientations of these edges are random.
Industrial cogeneration optimization program
Not Available
1980-01-01
The purpose of this program was to identify up to 10 good near-term opportunities for cogeneration in 5 major energy-consuming industries which produce food, textiles, paper, chemicals, and refined petroleum; select, characterize, and optimize cogeneration systems for these identified opportunities to achieve maximum energy savings for minimum investment using currently available components of cogenerating systems; and to identify technical, institutional, and regulatory obstacles hindering the use of industrial cogeneration systems. The analysis methods used and results obtained are described. Plants with fuel demands from 100,000 Btu/h to 3 x 10/sup 6/ Btu/h were considered. It was concluded that the major impediments to industrial cogeneration are financial, e.g., high capital investment and high charges by electric utilities during short-term cogeneration facility outages. In the plants considered an average energy savings from cogeneration of 15 to 18% compared to separate generation of process steam and electric power was calculated. On a national basis for the 5 industries considered, this extrapolates to saving 1.3 to 1.6 quads per yr or between 630,000 to 750,000 bbl/d of oil. Properly applied, federal activity can do much to realize a substantial fraction of this potential by lowering the barriers to cogeneration and by stimulating wider implementation of this technology. (LCL)
A Problem on Optimal Transportation
ERIC Educational Resources Information Center
Cechlarova, Katarina
2005-01-01
Mathematical optimization problems are not typical in the classical curriculum of mathematics. In this paper we show how several generalizations of an easy problem on optimal transportation were solved by gifted secondary school pupils in a correspondence mathematical seminar, how they can be used in university courses of linear programming and…
Supply-Chain Optimization Template
NASA Technical Reports Server (NTRS)
Quiett, William F.; Sealing, Scott L.
2009-01-01
The Supply-Chain Optimization Template (SCOT) is an instructional guide for identifying, evaluating, and optimizing (including re-engineering) aerospace- oriented supply chains. The SCOT was derived from the Supply Chain Council s Supply-Chain Operations Reference (SCC SCOR) Model, which is more generic and more oriented toward achieving a competitive advantage in business.
Aerodynamic design using numerical optimization
NASA Technical Reports Server (NTRS)
Murman, E. M.; Chapman, G. T.
1983-01-01
The procedure of using numerical optimization methods coupled with computational fluid dynamic (CFD) codes for the development of an aerodynamic design is examined. Several approaches that replace wind tunnel tests, develop pressure distributions and derive designs, or fulfill preset design criteria are presented. The method of Aerodynamic Design by Numerical Optimization (ADNO) is described and illustrated with examples.
Optimizing Medical Kits for Spaceflight
NASA Technical Reports Server (NTRS)
Keenan, A. B,; Foy, Millennia; Myers, G.
2014-01-01
The Integrated Medical Model (IMM) is a probabilistic model that estimates medical event occurrences and mission outcomes for different mission profiles. IMM simulation outcomes describing the impact of medical events on the mission may be used to optimize the allocation of resources in medical kits. Efficient allocation of medical resources, subject to certain mass and volume constraints, is crucial to ensuring the best outcomes of in-flight medical events. We implement a new approach to this medical kit optimization problem. METHODS We frame medical kit optimization as a modified knapsack problem and implement an algorithm utilizing a dynamic programming technique. Using this algorithm, optimized medical kits were generated for 3 different mission scenarios with the goal of minimizing the probability of evacuation and maximizing the Crew Health Index (CHI) for each mission subject to mass and volume constraints. Simulation outcomes using these kits were also compared to outcomes using kits optimized..RESULTS The optimized medical kits generated by the algorithm described here resulted in predicted mission outcomes more closely approached the unlimited-resource scenario for Crew Health Index (CHI) than the implementation in under all optimization priorities. Furthermore, the approach described here improves upon in reducing evacuation when the optimization priority is minimizing the probability of evacuation. CONCLUSIONS This algorithm provides an efficient, effective means to objectively allocate medical resources for spaceflight missions using the Integrated Medical Model.
Query Evaluation: Strategies and Optimizations.
ERIC Educational Resources Information Center
Turtle, Howard; Flood, James
1995-01-01
Discusses two query evaluation strategies used in large text retrieval systems: (1) term-at-a-time; and (2) document-at-a-time. Describes optimization techniques that can reduce query evaluation costs. Presents simulation results that compare the performance of these optimization techniques when applied to natural language query evaluation. (JMV)
Optimized layout generator for microgyroscope
NASA Astrophysics Data System (ADS)
Tay, Francis E.; Li, Shifeng; Logeeswaran, V. J.; Ng, David C.
2000-10-01
This paper presents an optimized out-of-plane microgyroscope layout generator using AutoCAD R14 and MS ExcelTM as a first attempt to automating the design of resonant micro- inertial sensors. The out-of-plane microgyroscope with two degrees of freedom lumped parameter model was chosen as the synthesis topology. Analytical model for the open loop operating has been derived for the gyroscope performance characteristics. Functional performance parameters such as sensitivity are ensured to be satisfied while simultaneously optimizing a design objective such as minimum area. A single algorithm will optimize the microgyroscope dimensions, while simultaneously maximizing or minimizing the objective functions: maximum sensitivity and minimum area. The multi- criteria objective function and optimization methodology was implemented using the Generalized Reduced Gradient algorithm. For data conversion a DXF to GDS converter was used. The optimized theoretical design performance parameters show good agreement with finite element analysis.
Optimal Distinctiveness Signals Membership Trust.
Leonardelli, Geoffrey J; Loyd, Denise Lewin
2016-07-01
According to optimal distinctiveness theory, sufficiently small minority groups are associated with greater membership trust, even among members otherwise unknown, because the groups are seen as optimally distinctive. This article elaborates on the prediction's motivational and cognitive processes and tests whether sufficiently small minorities (defined by relative size; for example, 20%) are associated with greater membership trust relative to mere minorities (45%), and whether such trust is a function of optimal distinctiveness. Two experiments, examining observers' perceptions of minority and majority groups and using minimal groups and (in Experiment 2) a trust game, revealed greater membership trust in minorities than majorities. In Experiment 2, participants also preferred joining minorities over more powerful majorities. Both effects occurred only when minorities were 20% rather than 45%. In both studies, perceptions of optimal distinctiveness mediated effects. Discussion focuses on the value of relative size and optimal distinctiveness, and when membership trust manifests. PMID:27140657
Risk modelling in portfolio optimization
NASA Astrophysics Data System (ADS)
Lam, W. H.; Jaaman, Saiful Hafizah Hj.; Isa, Zaidi
2013-09-01
Risk management is very important in portfolio optimization. The mean-variance model has been used in portfolio optimization to minimize the investment risk. The objective of the mean-variance model is to minimize the portfolio risk and achieve the target rate of return. Variance is used as risk measure in the mean-variance model. The purpose of this study is to compare the portfolio composition as well as performance between the optimal portfolio of mean-variance model and equally weighted portfolio. Equally weighted portfolio means the proportions that are invested in each asset are equal. The results show that the portfolio composition of the mean-variance optimal portfolio and equally weighted portfolio are different. Besides that, the mean-variance optimal portfolio gives better performance because it gives higher performance ratio than the equally weighted portfolio.
Optimal dynamic detection of explosives
Moore, David Steven; Mcgrane, Shawn D; Greenfield, Margo T; Scharff, R J; Rabitz, Herschel A; Roslund, J
2009-01-01
The detection of explosives is a notoriously difficult problem, especially at stand-off distances, due to their (generally) low vapor pressure, environmental and matrix interferences, and packaging. We are exploring optimal dynamic detection to exploit the best capabilities of recent advances in laser technology and recent discoveries in optimal shaping of laser pulses for control of molecular processes to significantly enhance the standoff detection of explosives. The core of the ODD-Ex technique is the introduction of optimally shaped laser pulses to simultaneously enhance sensitivity of explosives signatures while reducing the influence of noise and the signals from background interferents in the field (increase selectivity). These goals are being addressed by operating in an optimal nonlinear fashion, typically with a single shaped laser pulse inherently containing within it coherently locked control and probe sub-pulses. With sufficient bandwidth, the technique is capable of intrinsically providing orthogonal broad spectral information for data fusion, all from a single optimal pulse.
Hansborough, L.; Hamm, R.; Stovall, J.; Swenson, D.
1980-01-01
PIGMI (Pion Generator for Medical Irradiations) is a compact linear proton accelerator design, optimized for pion production and cancer treatment use in a hospital environment. Technology developed during a four-year PIGMI Prototype experimental program allows the design of smaller, less expensive, and more reliable proton linacs. A new type of low-energy accelerating structure, the radio-frequency quadrupole (RFQ) has been tested; it produces an exceptionally good-quality beam and allows the use of a simple 30-kV injector. Average axial electric-field gradients of over 9 MV/m have been demonstrated in a drift-tube linac (DTL) structure. Experimental work is underway to test the disk-and-washer (DAW) structure, another new type of accelerating structure for use in the high-energy coupled-cavity linac (CCL). Sufficient experimental and developmental progress has been made to closely define an actual PIGMI. It will consist of a 30-kV injector, and RFQ linac to a proton energy of 2.5 MeV, a DTL linac to 125 MeV, and a CCL linac to the final energy of 650 MeV. The total length of the accelerator is 133 meters. The RFQ and DTL will be driven by a single 440-MHz klystron; the CCL will be driven by six 1320-MHz klystrons. The peak beam current is 28 mA. The beam pulse length is 60 ..mu..s at a 60-Hz repetition rate, resulting in a 100-..mu..A average beam current. The total cost of the accelerator is estimated to be approx. $10 million.
Optimality criteria solution strategies in multiple constraint design optimization
NASA Technical Reports Server (NTRS)
Levy, R.; Parzynski, W.
1981-01-01
Procedures and solution strategies are described to solve the conventional structural optimization problem using the Lagrange multiplier technique. The multipliers, obtained through solution of an auxiliary nonlinear optimization problem, lead to optimality criteria to determine the design variables. It is shown that this procedure is essentially equivalent to an alternative formulation using a dual method Lagrangian function objective. Although mathematical formulations are straight-forward, successful applications and computational efficiency depend upon execution procedure strategies. Strategies examined, with application examples, include selection of active constraints, move limits, line search procedures, and side constraint boundaries.
Optimal multiobjective design of digital filters using spiral optimization technique.
Ouadi, Abderrahmane; Bentarzi, Hamid; Recioui, Abdelmadjid
2013-01-01
The multiobjective design of digital filters using spiral optimization technique is considered in this paper. This new optimization tool is a metaheuristic technique inspired by the dynamics of spirals. It is characterized by its robustness, immunity to local optima trapping, relative fast convergence and ease of implementation. The objectives of filter design include matching some desired frequency response while having minimum linear phase; hence, reducing the time response. The results demonstrate that the proposed problem solving approach blended with the use of the spiral optimization technique produced filters which fulfill the desired characteristics and are of practical use. PMID:24083108
NASA Technical Reports Server (NTRS)
Allan, Brian; Owens, Lewis
2010-01-01
In support of the Blended-Wing-Body aircraft concept, a new flow control hybrid vane/jet design has been developed for use in a boundary-layer-ingesting (BLI) offset inlet in transonic flows. This inlet flow control is designed to minimize the engine fan-face distortion levels and the first five Fourier harmonic half amplitudes while maximizing the inlet pressure recovery. This concept represents a potentially enabling technology for quieter and more environmentally friendly transport aircraft. An optimum vane design was found by minimizing the engine fan-face distortion, DC60, and the first five Fourier harmonic half amplitudes, while maximizing the total pressure recovery. The optimal vane design was then used in a BLI inlet wind tunnel experiment at NASA Langley's 0.3-meter transonic cryogenic tunnel. The experimental results demonstrated an 80-percent decrease in DPCPavg, the reduction in the circumferential distortion levels, at an inlet mass flow rate corresponding to the middle of the operational range at the cruise condition. Even though the vanes were designed at a single inlet mass flow rate, they performed very well over the entire inlet mass flow range tested in the wind tunnel experiment with the addition of a small amount of jet flow control. While the circumferential distortion was decreased, the radial distortion on the outer rings at the aerodynamic interface plane (AIP) increased. This was a result of the large boundary layer being distributed from the bottom of the AIP in the baseline case to the outer edges of the AIP when using the vortex generator (VG) vane flow control. Experimental results, as already mentioned, showed an 80-percent reduction of DPCPavg, the circumferential distortion level at the engine fan-face. The hybrid approach leverages strengths of vane and jet flow control devices, increasing inlet performance over a broader operational range with significant reduction in mass flow requirements. Minimal distortion level requirements
Optimizing WFIRST Coronagraph Science
NASA Astrophysics Data System (ADS)
Macintosh, Bruce
We propose an in-depth scientific investigation that will define how the WFIRST coronagraphic instrument will discover and characterize nearby planetary systems and how it will use observations of planets and disks to probe the diversity of their compositions, dynamics, and formation. Given the enormous diversity of known planetary systems it is not enough to optimize a coronagraph mission plan for the characterization of solar system analogs. Instead, we must design a mission to characterize a wide variety of planets, from gas and ice giant planets at a range of separations to mid-sized planets with no analogs in our solar system. We must consider updated planet distributions based on the results of the Kepler mission, long-term radial velocity (RV) surveys and updated luminosity distributions of exo-zodiacal dust from interferometric thermal infrared surveys of nearby stars. The properties of all these objects must be informed by our best models of planets and disks, and the process of using WFIRST observations to measure fundamental planetary properties such as composition must derive from rigorous methods. Our team brings a great depth of expertise to inform and accomplish these and all of the other tasks enumerated in the SIT proposal call. We will perform end-to-end modeling that starts with model spectra of planets and images of disks, simulates WFIRST data using these models, accounts for geometries of specific star / planet / disk systems, and incorporates detailed instrument performance models. We will develop and implement data analysis techniques to extract well-calibrated astrophysical signals from complex data, and propose observing plans that maximize the mission's scientific yield. We will work with the community to build observing programs and target lists, inform them of WFIRSTs capabilities, and supply simulated scientific observations for data challenges. Our work will be informed by the experience we have gained from building and observing with
Solving constrained optimization problems with hybrid particle swarm optimization
NASA Astrophysics Data System (ADS)
Zahara, Erwie; Hu, Chia-Hsin
2008-11-01
Constrained optimization problems (COPs) are very important in that they frequently appear in the real world. A COP, in which both the function and constraints may be nonlinear, consists of the optimization of a function subject to constraints. Constraint handling is one of the major concerns when solving COPs with particle swarm optimization (PSO) combined with the Nelder-Mead simplex search method (NM-PSO). This article proposes embedded constraint handling methods, which include the gradient repair method and constraint fitness priority-based ranking method, as a special operator in NM-PSO for dealing with constraints. Experiments using 13 benchmark problems are explained and the NM-PSO results are compared with the best known solutions reported in the literature. Comparison with three different meta-heuristics demonstrates that NM-PSO with the embedded constraint operator is extremely effective and efficient at locating optimal solutions.
A Novel Particle Swarm Optimization Algorithm for Global Optimization
Wang, Chun-Feng; Liu, Kui
2016-01-01
Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed. In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire population in the current iteration is considered. Meanwhile, to avoid premature, an abandoned mechanism is used. Furthermore, for improving the global convergence speed of our algorithm, a chaotic search is adopted in the best solution of the current iteration. To verify the performance of our algorithm, standard test functions have been employed. The experimental results show that the algorithm is much more robust and efficient than some existing Particle Swarm Optimization algorithms. PMID:26955387
A Novel Particle Swarm Optimization Algorithm for Global Optimization.
Wang, Chun-Feng; Liu, Kui
2016-01-01
Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed. In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire population in the current iteration is considered. Meanwhile, to avoid premature, an abandoned mechanism is used. Furthermore, for improving the global convergence speed of our algorithm, a chaotic search is adopted in the best solution of the current iteration. To verify the performance of our algorithm, standard test functions have been employed. The experimental results show that the algorithm is much more robust and efficient than some existing Particle Swarm Optimization algorithms. PMID:26955387
Optimal Protocols and Optimal Transport in Stochastic Thermodynamics
NASA Astrophysics Data System (ADS)
Aurell, Erik; Mejía-Monasterio, Carlos; Muratore-Ginanneschi, Paolo
2011-06-01
Thermodynamics of small systems has become an important field of statistical physics. Such systems are driven out of equilibrium by a control, and the question is naturally posed how such a control can be optimized. We show that optimization problems in small system thermodynamics are solved by (deterministic) optimal transport, for which very efficient numerical methods have been developed, and of which there are applications in cosmology, fluid mechanics, logistics, and many other fields. We show, in particular, that minimizing expected heat released or work done during a nonequilibrium transition in finite time is solved by the Burgers equation and mass transport by the Burgers velocity field. Our contribution hence considerably extends the range of solvable optimization problems in small system thermodynamics.
Global and Local Optimization Algorithms for Optimal Signal Set Design
Kearsley, Anthony J.
2001-01-01
The problem of choosing an optimal signal set for non-Gaussian detection was reduced to a smooth inequality constrained mini-max nonlinear programming problem by Gockenbach and Kearsley. Here we consider the application of several optimization algorithms, both global and local, to this problem. The most promising results are obtained when special-purpose sequential quadratic programming (SQP) algorithms are embedded into stochastic global algorithms.
Social Emotional Optimization Algorithm for Nonlinear Constrained Optimization Problems
NASA Astrophysics Data System (ADS)
Xu, Yuechun; Cui, Zhihua; Zeng, Jianchao
Nonlinear programming problem is one important branch in operational research, and has been successfully applied to various real-life problems. In this paper, a new approach called Social emotional optimization algorithm (SEOA) is used to solve this problem which is a new swarm intelligent technique by simulating the human behavior guided by emotion. Simulation results show that the social emotional optimization algorithm proposed in this paper is effective and efficiency for the nonlinear constrained programming problems.
MPQC: Performance Analysis and Optimization
Sarje, Abhinav; Williams, Samuel; Bailey, David
2012-11-30
MPQC (Massively Parallel Quantum Chemistry) is a widely used computational quantum chemistry code. It is capable of performing a number of computations commonly occurring in quantum chemistry. In order to achieve better performance of MPQC, in this report we present a detailed performance analysis of this code. We then perform loop and memory access optimizations, and measure performance improvements by comparing the performance of the optimized code with that of the original MPQC code. We observe that the optimized MPQC code achieves a significant improvement in the performance through a better utilization of vector processing and memory hierarchies.
Metabolism at Evolutionary Optimal States
Rabbers, Iraes; van Heerden, Johan H.; Nordholt, Niclas; Bachmann, Herwig; Teusink, Bas; Bruggeman, Frank J.
2015-01-01
Metabolism is generally required for cellular maintenance and for the generation of offspring under conditions that support growth. The rates, yields (efficiencies), adaptation time and robustness of metabolism are therefore key determinants of cellular fitness. For biotechnological applications and our understanding of the evolution of metabolism, it is necessary to figure out how the functional system properties of metabolism can be optimized, via adjustments of the kinetics and expression of enzymes, and by rewiring metabolism. The trade-offs that can occur during such optimizations then indicate fundamental limits to evolutionary innovations and bioengineering. In this paper, we review several theoretical and experimental findings about mechanisms for metabolic optimization. PMID:26042723
Optimal interdiction of unreactive Markovian evaders
Gutfraind, Alexander; Hagberg, Aric; Pan, Feng
2008-01-01
The network interdiction problem arises in a wide variety of areas including military logistics, infectious disease control and counter-terrorism. In the classical formulation one is given a weighted network G(N, E) and the task is to find b nodes (or edges) whose removal would maximally increase the least-cost path from a source node s to a target node r. In practical applications. G represenLs a transportation or activity network; node/edge removal is done by an agent, the 'interdictor' against another agent the 'evader' who wants to traverse G from s to t along the least-cost route. Our work is motivated by cases in which both agents have bounded rationality: e.g. when the authorities set up road blocks to catch bank robbers, neither party can plot its actions with full information about the other. We introduce a novel model of network interdiction in which the motion of (possibly) several evaders i. described by a Markov pr cess on G.We further suppose that the evaden; do not respond to interdiction decisions because of time, knowledge or computational constraint . We prove that this interdiction problem is NP-hard, like the classical formulation, but unlike the classical problem the objective function is submodular. This implies that the solution could be approximated within 1-lie using a greedy algorithm. Exploiting submodularity again. we demonstrate that a 'priority' (or 'lazy') evaluation algorithm can improve performance by orders of magnitude. Taken together, the results bring closer realistic solutions to the interdiction problem on global-scale networks.
An Efficient Chemical Reaction Optimization Algorithm for Multiobjective Optimization.
Bechikh, Slim; Chaabani, Abir; Ben Said, Lamjed
2015-10-01
Recently, a new metaheuristic called chemical reaction optimization was proposed. This search algorithm, inspired by chemical reactions launched during collisions, inherits several features from other metaheuristics such as simulated annealing and particle swarm optimization. This fact has made it, nowadays, one of the most powerful search algorithms in solving mono-objective optimization problems. In this paper, we propose a multiobjective variant of chemical reaction optimization, called nondominated sorting chemical reaction optimization, in an attempt to exploit chemical reaction optimization features in tackling problems involving multiple conflicting criteria. Since our approach is based on nondominated sorting, one of the main contributions of this paper is the proposal of a new quasi-linear average time complexity quick nondominated sorting algorithm; thereby making our multiobjective algorithm efficient from a computational cost viewpoint. The experimental comparisons against several other multiobjective algorithms on a variety of benchmark problems involving various difficulties show the effectiveness and the efficiency of this multiobjective version in providing a well-converged and well-diversified approximation of the Pareto front. PMID:25373137
Pixelated source optimization for optical lithography via particle swarm optimization
NASA Astrophysics Data System (ADS)
Wang, Lei; Li, Sikun; Wang, Xiangzhao; Yan, Guanyong; Yang, Chaoxing
2016-01-01
Source optimization is one of the key techniques for achieving higher resolution without increasing the complexity of mask design. An efficient source optimization approach is proposed on the basis of particle swarm optimization. The pixelated sources are encoded into particles, which are evaluated by using the pattern error as the fitness function. Afterward, the optimization is implemented by updating the velocities and positions of these particles. This approach is demonstrated using three mask patterns, including a periodic array of contact holes, a vertical line/space design, and a complicated pattern. The pattern errors are reduced by 69.6%, 51.5%, and 40.3%, respectively. Compared with the source optimization approach via genetic algorithm, the proposed approach leads to faster convergence while improving the image quality at the same time. Compared with the source optimization approach via gradient descent method, the proposed approach does not need the calculation of gradients, and it has a strong adaptation to various lithographic models, fitness functions, and resist models. The robustness of the proposed approach to initial sources is also verified.
NASA Astrophysics Data System (ADS)
Tarpine, Ryan; Lam, Fumei; Istrail, Sorin
We present results on two classes of problems. The first result addresses the long standing open problem of finding unifying principles for Linkage Disequilibrium (LD) measures in population genetics (Lewontin 1964 [10], Hedrick 1987 [8], Devlin and Risch 1995 [5]). Two desirable properties have been proposed in the extensive literature on this topic and the mutual consistency between these properties has remained at the heart of statistical and algorithmic difficulties with haplotype and genome-wide association study analysis. The first axiom is (1) The ability to extend LD measures to multiple loci as a conservative extension of pairwise LD. All widely used LD measures are pairwise measures. Despite significant attempts, it is not clear how to naturally extend these measures to multiple loci, leading to a "curse of the pairwise". The second axiom is (2) The Interpretability of Intermediate Values. In this paper, we resolve this mutual consistency problem by introducing a new LD measure, directed informativeness overrightarrow{I} (the directed graph theoretic counterpart of the informativeness measure introduced by Halldorsson et al. [6]) and show that it satisfies both of the above axioms. We also show the maximum informative subset of tagging SNPs based on overrightarrow{I} can be computed exactly in polynomial time for realistic genome-wide data. Furthermore, we present polynomial time algorithms for optimal genome-wide tagging SNPs selection for a number of commonly used LD measures, under the bounded neighborhood assumption for linked pairs of SNPs. One problem in the area is the search for a quality measure for tagging SNPs selection that unifies the LD-based methods such as LD-select (implemented in Tagger, de Bakker et al. 2005 [4], Carlson et al. 2004 [3]) and the information-theoretic ones such as informativeness. We show that the objective function of the LD-select algorithm is the Minimal Dominating Set (MDS) on r 2-SNP graphs and show that we can
Putting combustion optimization to work
Spring, N.
2009-05-15
New plants and plants that are retrofitting can benefit from combustion optimization. Boiler tuning and optimization can complement each other. The continuous emissions monitoring system CEMS, and tunable diode laser absorption spectroscopy TDLAS can be used for optimisation. NeuCO's CombustionOpt neural network software can determine optimal fuel and air set points. Babcock and Wilcox Power Generation Group Inc's Flame Doctor can be used in conjunction with other systems to diagnose and correct coal-fired burner performance. The four units of the Colstrip power plant in Colstrips, Montana were recently fitted with combustion optimization systems based on advanced model predictive multi variable controls (MPCs), ABB's Predict & Control tool. Unit 4 of Tampa Electric's Big Bend plant in Florida is fitted with Emerson's SmartProcess fuzzy neural model based combustion optimisation system. 1 photo.
Real-time refinery optimization
Kennedy, J.P.
1989-05-01
This article discusses refinery operation with specific consideration of the topics of: gasoline; control projects; catalytic reforming control; hydrocracker control packages; blending optimization; real-time data acquisition; and other plant automation packages.
Constrained Multiobjective Biogeography Optimization Algorithm
Mo, Hongwei; Xu, Zhidan; Xu, Lifang; Wu, Zhou; Ma, Haiping
2014-01-01
Multiobjective optimization involves minimizing or maximizing multiple objective functions subject to a set of constraints. In this study, a novel constrained multiobjective biogeography optimization algorithm (CMBOA) is proposed. It is the first biogeography optimization algorithm for constrained multiobjective optimization. In CMBOA, a disturbance migration operator is designed to generate diverse feasible individuals in order to promote the diversity of individuals on Pareto front. Infeasible individuals nearby feasible region are evolved to feasibility by recombining with their nearest nondominated feasible individuals. The convergence of CMBOA is proved by using probability theory. The performance of CMBOA is evaluated on a set of 6 benchmark problems and experimental results show that the CMBOA performs better than or similar to the classical NSGA-II and IS-MOEA. PMID:25006591
Constrained multiobjective biogeography optimization algorithm.
Mo, Hongwei; Xu, Zhidan; Xu, Lifang; Wu, Zhou; Ma, Haiping
2014-01-01
Multiobjective optimization involves minimizing or maximizing multiple objective functions subject to a set of constraints. In this study, a novel constrained multiobjective biogeography optimization algorithm (CMBOA) is proposed. It is the first biogeography optimization algorithm for constrained multiobjective optimization. In CMBOA, a disturbance migration operator is designed to generate diverse feasible individuals in order to promote the diversity of individuals on Pareto front. Infeasible individuals nearby feasible region are evolved to feasibility by recombining with their nearest nondominated feasible individuals. The convergence of CMBOA is proved by using probability theory. The performance of CMBOA is evaluated on a set of 6 benchmark problems and experimental results show that the CMBOA performs better than or similar to the classical NSGA-II and IS-MOEA. PMID:25006591
Nonlinear optimization for stochastic simulations.
Johnson, Michael M.; Yoshimura, Ann S.; Hough, Patricia Diane; Ammerlahn, Heidi R.
2003-12-01
This report describes research targeting development of stochastic optimization algorithms and their application to mission-critical optimization problems in which uncertainty arises. The first section of this report covers the enhancement of the Trust Region Parallel Direct Search (TRPDS) algorithm to address stochastic responses and the incorporation of the algorithm into the OPT++ optimization library. The second section describes the Weapons of Mass Destruction Decision Analysis Center (WMD-DAC) suite of systems analysis tools and motivates the use of stochastic optimization techniques in such non-deterministic simulations. The third section details a batch programming interface designed to facilitate criteria-based or algorithm-driven execution of system-of-system simulations. The fourth section outlines the use of the enhanced OPT++ library and batch execution mechanism to perform systems analysis and technology trade-off studies in the WMD detection and response problem domain.
Amine plant troubleshooting and optimization
Abry, R.G.F.; DuPart, M.S.
1995-04-01
A systematic method for troubleshooting and optimization of amine plants, if properly used, will result in fewer plant upsets, quick and correct responses to changing conditions and long-term profitable operations of any amine unit. It is important for amine plants to maintain safe, continuous and optimized operations for short- and long-term success. Effective and fast resolution of maine unit upsets plays a large part in this success. These considerations are as important in plants using generic amines such as monoethanolamine (MEA), diethanolamine (DEA), methyldiethanolamine (MDEA) and specialty amines based on MDEA. The key to troubleshooting and optimization is a systematic approach. Developing and using control charts can also be used to monitor amine plant operations. By using these techniques collectively, a formal method for troubleshooting and optimization can be established. This will ultimately result in a more trouble-free, continuous operation.
Techniques for shuttle trajectory optimization
NASA Technical Reports Server (NTRS)
Edge, E. R.; Shieh, C. J.; Powers, W. F.
1973-01-01
The application of recently developed function-space Davidon-type techniques to the shuttle ascent trajectory optimization problem is discussed along with an investigation of the recently developed PRAXIS algorithm for parameter optimization. At the outset of this analysis, the major deficiency of the function-space algorithms was their potential storage problems. Since most previous analyses of the methods were with relatively low-dimension problems, no storage problems were encountered. However, in shuttle trajectory optimization, storage is a problem, and this problem was handled efficiently. Topics discussed include: the shuttle ascent model and the development of the particular optimization equations; the function-space algorithms; the operation of the algorithm and typical simulations; variable final-time problem considerations; and a modification of Powell's algorithm.
NASA Astrophysics Data System (ADS)
Montenegro-Johnson, Thomas D.; Lauga, Eric
2014-06-01
Propulsion at microscopic scales is often achieved through propagating traveling waves along hairlike organelles called flagella. Taylor's two-dimensional swimming sheet model is frequently used to provide insight into problems of flagellar propulsion. We derive numerically the large-amplitude wave form of the two-dimensional swimming sheet that yields optimum hydrodynamic efficiency: the ratio of the squared swimming speed to the rate-of-working of the sheet against the fluid. Using the boundary element method, we show that the optimal wave form is a front-back symmetric regularized cusp that is 25% more efficient than the optimal sine wave. This optimal two-dimensional shape is smooth, qualitatively different from the kinked form of Lighthill's optimal three-dimensional flagellum, not predicted by small-amplitude theory, and different from the smooth circular-arc-like shape of active elastic filaments.
Optimization of a thermomagnetic motor
NASA Astrophysics Data System (ADS)
Trapanese, Marco; Cipriani, Giovanni; Di Dio, Vincenzo; Franzitta, Vincenzo; Viola, Alessia
2015-05-01
In this paper, an approach towards the optimization of the Curie motor is presented. The approach is based on a thermal-magnetic coupled dynamic model of the motor, which is obtained by assuming the use of a ferromagnetic material working at temperatures near the Curie point. An analytical expression of the generated torque, which links this quantity to the magnetic, thermal, and geometrical parameters of the generated torque, is given. The expressions of speed and torque are derived and related to the thermal properties of the machine and are used as optimization indexes in an optimization procedure. The aim of the optimization process is to obtain a machine able to rotate constantly at the maximum achievable power. A design of a machine, based on this theory, is proposed and the related performances are numerically simulated. A preliminary experimental verification of the performances is reported.
Habitat Design Optimization and Analysis
NASA Technical Reports Server (NTRS)
SanSoucie, Michael P.; Hull, Patrick V.; Tinker, Michael L.
2006-01-01
Long-duration surface missions to the Moon and Mars will require habitats for the astronauts. The materials chosen for the habitat walls play a direct role in the protection against the harsh environments found on the surface. Choosing the best materials, their configuration, and the amount required is extremely difficult due to the immense size of the design region. Advanced optimization techniques are necessary for habitat wall design. Standard optimization techniques are not suitable for problems with such large search spaces; therefore, a habitat design optimization tool utilizing genetic algorithms has been developed. Genetic algorithms use a "survival of the fittest" philosophy, where the most fit individuals are more likely to survive and reproduce. This habitat design optimization tool is a multi-objective formulation of structural analysis, heat loss, radiation protection, and meteoroid protection. This paper presents the research and development of this tool.
Dosimetry robustness with stochastic optimization
NASA Astrophysics Data System (ADS)
Nohadani, Omid; Seco, Joao; Martin, Benjamin C.; Bortfeld, Thomas
2009-06-01
All radiation therapy treatment planning relies on accurate dose calculation. Uncertainties in dosimetric prediction can significantly degrade an otherwise optimal plan. In this work, we introduce a robust optimization method which handles dosimetric errors and warrants for high-quality IMRT plans. Unlike other dose error estimations, we do not rely on the detailed knowledge about the sources of the uncertainty and use a generic error model based on random perturbation. This generality is sought in order to cope with a large variety of error sources. We demonstrate the method on a clinical case of lung cancer and show that our method provides plans that are more robust against dosimetric errors and are clinically acceptable. In fact, the robust plan exhibits a two-fold improved equivalent uniform dose compared to the non-robust but optimized plan. The achieved speedup will allow computationally extensive multi-criteria or beam-angle optimization approaches to warrant for dosimetrically relevant plans.
Structural optimization with approximate sensitivities
NASA Technical Reports Server (NTRS)
Patnaik, S. N.; Hopkins, D. A.; Coroneos, R.
1994-01-01
Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.
Data Understanding Applied to Optimization
NASA Technical Reports Server (NTRS)
Buntine, Wray; Shilman, Michael
1998-01-01
The goal of this research is to explore and develop software for supporting visualization and data analysis of search and optimization. Optimization is an ever-present problem in science. The theory of NP-completeness implies that the problems can only be resolved by increasingly smarter problem specific knowledge, possibly for use in some general purpose algorithms. Visualization and data analysis offers an opportunity to accelerate our understanding of key computational bottlenecks in optimization and to automatically tune aspects of the computation for specific problems. We will prototype systems to demonstrate how data understanding can be successfully applied to problems characteristic of NASA's key science optimization tasks, such as central tasks for parallel processing, spacecraft scheduling, and data transmission from a remote satellite.
Optimal control for electron shuttling
NASA Astrophysics Data System (ADS)
Zhang, Jun; Greenman, Loren; Deng, Xiaotian; Hayes, Ian M.; Whaley, K. Birgitta
2013-06-01
In this paper we apply an optimal control technique to derive control fields that transfer an electron between ends of a chain of donors or quantum dots. We formulate the transfer as an optimal steering problem, and then derive the dynamics of the optimal control. A numerical algorithm is developed to effectively generate control pulses. We apply this technique to transfer an electron between sites of a triple quantum dot and an ionized chain of phosphorus dopants in silicon. Using the optimal pulses for the spatial shuttling of phosphorus dopants, we then add hyperfine interactions to the Hamiltonian and show that a 500 G magnetic field will transfer the electron spatially as well as transferring the spin components of two of the four hyperfine states of the electron-nuclear spin pair.
Geometric optimization of thermal systems
NASA Astrophysics Data System (ADS)
Alebrahim, Asad Mansour
2000-10-01
The work in chapter 1 extends to three dimensions and to convective heat transfer the constructal method of minimizing the thermal resistance between a volume and one point. In the first part, the heat flow mechanism is conduction, and the heat generating volume is occupied by low conductivity material (k 0) and high conductivity inserts (kp) that are shaped as constant-thickness disks mounted on a common stem of kp material. In the second part the interstitial spaces once occupied by k0 material are bathed by forced convection. The internal and external geometric aspect ratios of the elemental volume and the first assembly are optimized numerically subject to volume constraints. Chapter 2 presents the constrained thermodynamic optimization of a cross-flow heat exchanger with ram air on the cold side, which is used in the environmental control systems of aircraft. Optimized geometric features such as the ratio of channel spacings and flow lengths are reported. It is found that the optimized features are relatively insensitive to changes in other physical parameters of the installation and relatively insensitive to the additional irreversibility due to discharging the ram-air stream into the atmosphere, emphasizing the robustness of the thermodynamic optimum. In chapter 3 the problem of maximizing exergy extraction from a hot stream by distributing streams over a heat transfer surface is studied. In the first part, the cold stream is compressed in an isothermal compressor, expanded in an adiabatic turbine, and discharged into the ambient. In the second part, the cold stream is compressed in an adiabatic compressor. Both designs are optimized with respect to the capacity-rate imbalance of the counter-flow and the pressure ratio maintained by the compressor. This study shows the tradeoff between simplicity and increased performance, and outlines the path for further conceptual work on the extraction of exergy from a hot stream that is being cooled gradually. The aim
Numerical Optimization Using Computer Experiments
NASA Technical Reports Server (NTRS)
Trosset, Michael W.; Torczon, Virginia
1997-01-01
Engineering design optimization often gives rise to problems in which expensive objective functions are minimized by derivative-free methods. We propose a method for solving such problems that synthesizes ideas from the numerical optimization and computer experiment literatures. Our approach relies on kriging known function values to construct a sequence of surrogate models of the objective function that are used to guide a grid search for a minimizer. Results from numerical experiments on a standard test problem are presented.
Optimization by nonhierarchical asynchronous decomposition
NASA Technical Reports Server (NTRS)
Shankar, Jayashree; Ribbens, Calvin J.; Haftka, Raphael T.; Watson, Layne T.
1992-01-01
Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. The algorithm is carefully analyzed for quadratic programs, and a number of modifications are suggested to improve its robustness.
CENTRAL PLATEAU REMEDIATION OPTIMIZATION STUDY
BERGMAN, T. B.; STEFANSKI, L. D.; SEELEY, P. N.; ZINSLI, L. C.; CUSACK, L. J.
2012-09-19
THE CENTRAL PLATEAU REMEDIATION OPTIMIZATION STUDY WAS CONDUCTED TO DEVELOP AN OPTIMAL SEQUENCE OF REMEDIATION ACTIVITIES IMPLEMENTING THE CERCLA DECISION ON THE CENTRAL PLATEAU. THE STUDY DEFINES A SEQUENCE OF ACTIVITIES THAT RESULT IN AN EFFECTIVE USE OF RESOURCES FROM A STRATEGIC PERSPECTIVE WHEN CONSIDERING EQUIPMENT PROCUREMENT AND STAGING, WORKFORCE MOBILIZATION/DEMOBILIZATION, WORKFORCE LEVELING, WORKFORCE SKILL-MIX, AND OTHER REMEDIATION/DISPOSITION PROJECT EXECUTION PARAMETERS.
Optimal encryption of quantum bits
Boykin, P. Oscar; Roychowdhury, Vwani
2003-04-01
We show that 2n random classical bits are both necessary and sufficient for encrypting any unknown state of n quantum bits in an informationally secure manner. We also characterize the complete set of optimal protocols in terms of a set of unitary operations that comprise an orthonormal basis in a canonical inner product space. Moreover, a connection is made between quantum encryption and quantum teleportation that allows for a different proof of optimality of teleportation.
Design optimization of space structures
NASA Technical Reports Server (NTRS)
Felippa, Carlos
1991-01-01
The topology-shape-size optimization of space structures is investigated through Kikuchi's homogenization method. The method starts from a 'design domain block,' which is a region of space into which the structure is to materialize. This domain is initially filled with a finite element mesh, typically regular. Force and displacement boundary conditions corresponding to applied loads and supports are applied at specific points in the domain. An optimal structure is to be 'carved out' of the design under two conditions: (1) a cost function is to be minimized, and (2) equality or inequality constraints are to be satisfied. The 'carving' process is accomplished by letting microstructure holes develop and grow in elements during the optimization process. These holes have a rectangular shape in two dimensions and a cubical shape in three dimensions, and may also rotate with respect to the reference axes. The properties of the perforated element are obtained through an homogenization procedure. Once a hole reaches the volume of the element, that element effectively disappears. The project has two phases. In the first phase the method was implemented as the combination of two computer programs: a finite element module, and an optimization driver. In the second part, focus is on the application of this technique to planetary structures. The finite element part of the method was programmed for the two-dimensional case using four-node quadrilateral elements to cover the design domain. An element homogenization technique different from that of Kikuchi and coworkers was implemented. The optimization driver is based on an augmented Lagrangian optimizer, with the volume constraint treated as a Courant penalty function. The optimizer has to be especially tuned to this type of optimization because the number of design variables can reach into the thousands. The driver is presently under development.
SWOC: Spectral Wavelength Optimization Code
NASA Astrophysics Data System (ADS)
Ruchti, G. R.
2016-06-01
SWOC (Spectral Wavelength Optimization Code) determines the wavelength ranges that provide the optimal amount of information to achieve the required science goals for a spectroscopic study. It computes a figure-of-merit for different spectral configurations using a user-defined list of spectral features, and, utilizing a set of flux-calibrated spectra, determines the spectral regions showing the largest differences among the spectra.
Methods to optimize selective hyperthermia
NASA Astrophysics Data System (ADS)
Cowan, Thomas M.; Bailey, Christopher A.; Liu, Hong; Chen, Wei R.
2003-07-01
Laser immunotherapy, a novel therapy for breast cancer, utilizes selective photothermal interaction to raise the temperature of tumor tissue above the cell damage threshold. Photothermal interaction is achieved with intratumoral injection of a laser absorbing dye followed by non-invasive laser irradiation. When tumor heating is used in combination with immunoadjuvant to stimulate an immune response, anti-tumor immunity can be achieved. In our study, gelatin phantom simulations were used to optimize therapy parameters such as laser power, laser beam radius, and dye concentration to achieve maximum heating of target tissue with the minimum heating of non-targeted tissue. An 805-nm diode laser and indocyanine green (ICG) were used to achieve selective photothermal interactions in a gelatin phantom. Spherical gelatin phantoms containing ICG were used to simulate the absorption-enhanced target tumors, which were embedded inside gelatin without ICG to simulate surrounding non-targeted tissue. Different laser powers and dye concentrations were used to treat the gelatin phantoms. The temperature distributions in the phantoms were measured, and the data were used to determine the optimal parameters used in selective hyperthermia (laser power and dye concentration for this case). The method involves an optimization coefficient, which is proportional to the difference between temperatures measured in targeted and non-targeted gel. The coefficient is also normalized by the difference between the most heated region of the target gel and the least heated region. A positive optimization coefficient signifies a greater temperature increase in targeted gelatin when compared to non-targeted gelatin, and therefore, greater selectivity. Comparisons were made between the optimization coefficients for varying laser powers in order to demonstrate the effectinvess of this method in finding an optimal parameter set. Our experimental results support the proposed use of an optimization
Optimal BLS: Optimizing transit-signal detection for Keplerian dynamics
NASA Astrophysics Data System (ADS)
Ofir, Aviv
2015-08-01
Transit surveys, both ground- and space-based, have already accumulated a large number of light curves that span several years. We optimize the search for transit signals for both detection and computational efficiencies by assuming that the searched systems can be described by Keplerian, and propagating the effects of different system parameters to the detection parameters. Importnantly, we mainly consider the information content of the transit signal and not any specific algorithm - and use BLS (Kovács, Zucker, & Mazeh 2002) just as a specific example.We show that the frequency information content of the light curve is primarily determined by the duty cycle of the transit signal, and thus the optimal frequency sampling is found to be cubic and not linear. Further optimization is achieved by considering duty-cycle dependent binning of the phased light curve. By using the (standard) BLS, one is either fairly insensitive to long-period planets or less sensitive to short-period planets and computationally slower by a significant factor of ~330 (for a 3 yr long dataset). We also show how the physical system parameters, such as the host star's size and mass, directly affect transit detection. This understanding can then be used to optimize the search for every star individually.By considering Keplerian dynamics explicitly rather than implicitly one can optimally search the transit signal parameter space. The presented Optimal BLS enhances the detectability of both very short and very long period planets, while allowing such searches to be done with much reduced resources and time. The Matlab/Octave source code for Optimal BLS is made available.
Optimal lattice-structured materials
Messner, Mark C.
2016-07-09
This paper describes a method for optimizing the mesostructure of lattice-structured materials. These materials are periodic arrays of slender members resembling efficient, lightweight macroscale structures like bridges and frame buildings. Current additive manufacturing technologies can assemble lattice structures with length scales ranging from nanometers to millimeters. Previous work demonstrates that lattice materials have excellent stiffness- and strength-to-weight scaling, outperforming natural materials. However, there are currently no methods for producing optimal mesostructures that consider the full space of possible 3D lattice topologies. The inverse homogenization approach for optimizing the periodic structure of lattice materials requires a parameterized, homogenized material model describingmore » the response of an arbitrary structure. This work develops such a model, starting with a method for describing the long-wavelength, macroscale deformation of an arbitrary lattice. The work combines the homogenized model with a parameterized description of the total design space to generate a parameterized model. Finally, the work describes an optimization method capable of producing optimal mesostructures. Several examples demonstrate the optimization method. One of these examples produces an elastically isotropic, maximally stiff structure, here called the isotruss, that arguably outperforms the anisotropic octet truss topology.« less
Unrealistic Optimism: East and West?
Joshi, Mary Sissons; Carter, Wakefield
2013-01-01
Following Weinstein’s (1980) pioneering work many studies established that people have an optimistic bias concerning future life events. At first, the bulk of research was conducted using populations in North America and Northern Europe, the optimistic bias was thought of as universal, and little attention was paid to cultural context. However, construing unrealistic optimism as a form of self-enhancement, some researchers noted that it was far less common in East Asian cultures. The current study extends enquiry to a different non-Western culture. Two hundred and eighty seven middle aged and middle income participants (200 in India, 87 in England) rated 11 positive and 11 negative events in terms of the chances of each event occurring in “their own life,” and the chances of each event occurring in the lives of “people like them.” Comparative optimism was shown for bad events, with Indian participants showing higher levels of optimism than English participants. The position regarding comparative optimism for good events was more complex. In India those of higher socioeconomic status (SES) were optimistic, while those of lower SES were on average pessimistic. Overall, English participants showed neither optimism nor pessimism for good events. The results, whose clinical relevance is discussed, suggest that the expression of unrealistic optimism is shaped by an interplay of culture and socioeconomic circumstance. PMID:23407689
Efficient computation of optimal actions
Todorov, Emanuel
2009-01-01
Optimal choice of actions is a fundamental problem relevant to fields as diverse as neuroscience, psychology, economics, computer science, and control engineering. Despite this broad relevance the abstract setting is similar: we have an agent choosing actions over time, an uncertain dynamical system whose state is affected by those actions, and a performance criterion that the agent seeks to optimize. Solving problems of this kind remains hard, in part, because of overly generic formulations. Here, we propose a more structured formulation that greatly simplifies the construction of optimal control laws in both discrete and continuous domains. An exhaustive search over actions is avoided and the problem becomes linear. This yields algorithms that outperform Dynamic Programming and Reinforcement Learning, and thereby solve traditional problems more efficiently. Our framework also enables computations that were not possible before: composing optimal control laws by mixing primitives, applying deterministic methods to stochastic systems, quantifying the benefits of error tolerance, and inferring goals from behavioral data via convex optimization. Development of a general class of easily solvable problems tends to accelerate progress—as linear systems theory has done, for example. Our framework may have similar impact in fields where optimal choice of actions is relevant. PMID:19574462
Optimal control of motorsport differentials
NASA Astrophysics Data System (ADS)
Tremlett, A. J.; Massaro, M.; Purdy, D. J.; Velenis, E.; Assadian, F.; Moore, A. P.; Halley, M.
2015-12-01
Modern motorsport limited slip differentials (LSD) have evolved to become highly adjustable, allowing the torque bias that they generate to be tuned in the corner entry, apex and corner exit phases of typical on-track manoeuvres. The task of finding the optimal torque bias profile under such varied vehicle conditions is complex. This paper presents a nonlinear optimal control method which is used to find the minimum time optimal torque bias profile through a lane change manoeuvre. The results are compared to traditional open and fully locked differential strategies, in addition to considering related vehicle stability and agility metrics. An investigation into how the optimal torque bias profile changes with reduced track-tyre friction is also included in the analysis. The optimal LSD profile was shown to give a performance gain over its locked differential counterpart in key areas of the manoeuvre where a quick direction change is required. The methodology proposed can be used to find both optimal passive LSD characteristics and as the basis of a semi-active LSD control algorithm.
Pyomo : Python Optimization Modeling Objects.
Siirola, John; Laird, Carl Damon; Hart, William Eugene; Watson, Jean-Paul
2010-11-01
The Python Optimization Modeling Objects (Pyomo) package [1] is an open source tool for modeling optimization applications within Python. Pyomo provides an objected-oriented approach to optimization modeling, and it can be used to define symbolic problems, create concrete problem instances, and solve these instances with standard solvers. While Pyomo provides a capability that is commonly associated with algebraic modeling languages such as AMPL, AIMMS, and GAMS, Pyomo's modeling objects are embedded within a full-featured high-level programming language with a rich set of supporting libraries. Pyomo leverages the capabilities of the Coopr software library [2], which integrates Python packages (including Pyomo) for defining optimizers, modeling optimization applications, and managing computational experiments. A central design principle within Pyomo is extensibility. Pyomo is built upon a flexible component architecture [3] that allows users and developers to readily extend the core Pyomo functionality. Through these interface points, extensions and applications can have direct access to an optimization model's expression objects. This facilitates the rapid development and implementation of new modeling constructs and as well as high-level solution strategies (e.g. using decomposition- and reformulation-based techniques). In this presentation, we will give an overview of the Pyomo modeling environment and model syntax, and present several extensions to the core Pyomo environment, including support for Generalized Disjunctive Programming (Coopr GDP), Stochastic Programming (PySP), a generic Progressive Hedging solver [4], and a tailored implementation of Bender's Decomposition.
Optimized quadrature surface coil designs
Kumar, Ananda; Bottomley, Paul A.
2008-01-01
Background Quadrature surface MRI/MRS detectors comprised of circular loop and figure-8 or butterfly-shaped coils offer improved signal-to-noise-ratios (SNR) compared to single surface coils, and reduced power and specific absorption rates (SAR) when used for MRI excitation. While the radius of the optimum loop coil for performing MRI at depth d in a sample is known, the optimum geometry for figure-8 and butterfly coils is not. Materials and methods The geometries of figure-8 and square butterfly detector coils that deliver the optimum SNR are determined numerically by the electromagnetic method of moments. Figure-8 and loop detectors are then combined to create SNR-optimized quadrature detectors whose theoretical and experimental SNR performance are compared with a novel quadrature detector comprised of a strip and a loop, and with two overlapped loops optimized for the same depth at 3 T. The quadrature detection efficiency and local SAR during transmission for the three quadrature configurations are analyzed and compared. Results The SNR-optimized figure-8 detector has loop radius r8 ∼ 0.6d, so r8/r0 ∼ 1.3 in an optimized quadrature detector at 3 T. The optimized butterfly coil has side length ∼ d and crossover angle of ≥ 150° at the center. Conclusions These new design rules for figure-8 and butterfly coils optimize their performance as linear and quadrature detectors. PMID:18057975
Schedule path optimization for adiabatic quantum computing and optimization
NASA Astrophysics Data System (ADS)
Zeng, Lishan; Zhang, Jun; Sarovar, Mohan
2016-04-01
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are probabilistic in nature and the minimum gap between the ground state and first excited state of the system during evolution is a major factor in determining the success probability. In this work we investigate a strategy for increasing the minimum gap and success probability by introducing intermediate Hamiltonians that modify the evolution path between initial and final Hamiltonians. We focus on an optimization problem relevant to recent hardware implementations and present numerical evidence for the existence of a purely local intermediate Hamiltonian that achieve the optimum performance in terms of pushing the minimum gap to one of the end points of the evolution. As a part of this study we develop a convex optimization formulation of the search for optimal adiabatic schedules that makes this computation more tractable, and which may be of independent interest. We further study the effectiveness of random intermediate Hamiltonians on the minimum gap and success probability, and empirically find that random Hamiltonians have a significant probability of increasing the success probability, but only by a modest amount.
A novel metaheuristic for continuous optimization problems: Virus optimization algorithm
NASA Astrophysics Data System (ADS)
Liang, Yun-Chia; Rodolfo Cuevas Juarez, Josue
2016-01-01
A novel metaheuristic for continuous optimization problems, named the virus optimization algorithm (VOA), is introduced and investigated. VOA is an iteratively population-based method that imitates the behaviour of viruses attacking a living cell. The number of viruses grows at each replication and is controlled by an immune system (a so-called 'antivirus') to prevent the explosive growth of the virus population. The viruses are divided into two classes (strong and common) to balance the exploitation and exploration effects. The performance of the VOA is validated through a set of eight benchmark functions, which are also subject to rotation and shifting effects to test its robustness. Extensive comparisons were conducted with over 40 well-known metaheuristic algorithms and their variations, such as artificial bee colony, artificial immune system, differential evolution, evolutionary programming, evolutionary strategy, genetic algorithm, harmony search, invasive weed optimization, memetic algorithm, particle swarm optimization and simulated annealing. The results showed that the VOA is a viable solution for continuous optimization.
Optimal singular control with applications to trajectory optimization
NASA Technical Reports Server (NTRS)
Vinh, N. X.
1977-01-01
A comprehensive discussion of the problem of singular control is presented. Singular control enters an optimal trajectory when the so called switching function vanishes identically over a finite time interval. Using the concept of domain of maneuverability, the problem of optical switching is analyzed. Criteria for the optimal direction of switching are presented. The switching, or junction, between nonsingular and singular subarcs is examined in detail. Several theorems concerning the necessary, and also sufficient conditions for smooth junction are presented. The concepts of quasi-linear control and linearized control are introduced. They are designed for the purpose of obtaining approximate solution for the difficult Euler-Lagrange type of optimal control in the case where the control is nonlinear.
Optimal design of solidification processes
NASA Technical Reports Server (NTRS)
Dantzig, Jonathan A.; Tortorelli, Daniel A.
1991-01-01
An optimal design algorithm is presented for the analysis of general solidification processes, and is demonstrated for the growth of GaAs crystals in a Bridgman furnace. The system is optimal in the sense that the prespecified temperature distribution in the solidifying materials is obtained to maximize product quality. The optimization uses traditional numerical programming techniques which require the evaluation of cost and constraint functions and their sensitivities. The finite element method is incorporated to analyze the crystal solidification problem, evaluate the cost and constraint functions, and compute the sensitivities. These techniques are demonstrated in the crystal growth application by determining an optimal furnace wall temperature distribution to obtain the desired temperature profile in the crystal, and hence to maximize the crystal's quality. Several numerical optimization algorithms are studied to determine the proper convergence criteria, effective 1-D search strategies, appropriate forms of the cost and constraint functions, etc. In particular, we incorporate the conjugate gradient and quasi-Newton methods for unconstrained problems. The efficiency and effectiveness of each algorithm is presented in the example problem.
Multivariate optimization of production systems
Carroll, J.A.; Horne, R.N. )
1992-07-01
This paper reports that mathematically, optimization involves finding the extreme values of a function. Given a function of several variables, Z = {integral}({rvec x}{sub 1}, {rvec x}{sub 2},{rvec x}{sub 3},{yields}x{sub n}), an optimization scheme will find the combination of these variables that produces an extreme value in the function, whether it is a minimum or a maximum value. Many examples of optimization exist. For instance, if a function gives and investor's expected return on the basis of different investments, numerical optimization of the function will determine the mix of investments that will yield the maximum expected return. This is the basis of modern portfolio theory. If a function gives the difference between a set of data and a model of the data, numerical optimization of the function will produce the best fit of the model to the data. This is the basis for nonlinear parameter estimation. Similar examples can be given for network analysis, queuing theory, decision analysis, etc.
Large deviations and portfolio optimization
NASA Astrophysics Data System (ADS)
Sornette, Didier
Risk control and optimal diversification constitute a major focus in the finance and insurance industries as well as, more or less consciously, in our everyday life. We present a discussion of the characterization of risks and of the optimization of portfolios that starts from a simple illustrative model and ends by a general functional integral formulation. A major item is that risk, usually thought of as one-dimensional in the conventional mean-variance approach, has to be addressed by the full distribution of losses. Furthermore, the time-horizon of the investment is shown to play a major role. We show the importance of accounting for large fluctuations and use the theory of Cramér for large deviations in this context. We first treat a simple model with a single risky asset that exemplifies the distinction between the average return and the typical return and the role of large deviations in multiplicative processes, and the different optimal strategies for the investors depending on their size. We then analyze the case of assets whose price variations are distributed according to exponential laws, a situation that is found to describe daily price variations reasonably well. Several portfolio optimization strategies are presented that aim at controlling large risks. We end by extending the standard mean-variance portfolio optimization theory, first within the quasi-Gaussian approximation and then using a general formulation for non-Gaussian correlated assets in terms of the formalism of functional integrals developed in the field theory of critical phenomena.
Optimal randomized scheduling by replacement
Saias, I.
1996-05-01
In the replacement scheduling problem, a system is composed of n processors drawn from a pool of p. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of n processors. The system operates satisfactorily as long as, upon report of a fault, the scheduler chooses n non-faulty processors. We provide a randomized protocol maximizing the expected number of faults the system can sustain before the occurrence of a crash. The optimality of the protocol is established by considering a closely related dual optimization problem. The game-theoretic technical difficulties that we solve in this paper are very general and encountered whenever proving the optimality of a randomized algorithm in parallel and distributed computation.
Local optimization of neuron arbors.
Cherniak, C
1992-01-01
How parsimoniously is brain wiring laid out, that is, how well does a neuron minimize costs of connections among its synapses? Neural optimization of dendritic and axonic arbors can be evaluated using a generalization of the Steiner tree concept from combinatorial network optimization theory. Local branch-junction geometry of neuronal connecting structures fits a volume minimization model well. In addition, volume of the arborizations at this neighborhood level is significantly more strongly minimized than their length, signal propagation speed, or surface area. The mechanism of this local volume optimization resembles those involved in formation of nonliving tree structures such as river junctions and electric-discharge patterns, and appears to govern initial nerve growth-cone behavior through vector-mechanical energy minimization. PMID:1586674
Genetic Optimization of Optical Nanoantennas
NASA Astrophysics Data System (ADS)
Forestiere, Carlo; Pasquale, Alyssa; Capretti, Antonio; Lee, Sylvanus; Miano, Giovanni; Tamburrino, Antonello; Dal Negro, Luca
2012-02-01
Metal nanostructures can act as plasmonic nanoantennas (PNAs) due to their unique ability to concentrate the light over sub-wavelength spatial regions. However engineering the optimum PNA in terms of a given quality factor or objective function. We propose a novel design strategy of PNAs by coupling a genetic optimization (GA) tool to the analytical multi-particle Mie theory. The positions and radii of metallic nanosphere clusters are found by requiring maximum electric field enhancement at a given focus point. Within the optimization process we introduced several constraints in order to guarantee the physical realizability of the tailored nanostructure with electron-beam lithography (EBL). Our GA optimization results unveil the central role of the radiative coupling in the design of PNA and open up new exciting pathways in the engineering of metal nanostructures. Samples were fabricated using techniques and surface-enhancement Raman scattering measures were performed confirming the theoretical predictions.
Optimal segmentation and packaging process
Kostelnik, Kevin M.; Meservey, Richard H.; Landon, Mark D.
1999-01-01
A process for improving packaging efficiency uses three dimensional, computer simulated models with various optimization algorithms to determine the optimal segmentation process and packaging configurations based on constraints including container limitations. The present invention is applied to a process for decontaminating, decommissioning (D&D), and remediating a nuclear facility involving the segmentation and packaging of contaminated items in waste containers in order to minimize the number of cuts, maximize packaging density, and reduce worker radiation exposure. A three-dimensional, computer simulated, facility model of the contaminated items are created. The contaminated items are differentiated. The optimal location, orientation and sequence of the segmentation and packaging of the contaminated items is determined using the simulated model, the algorithms, and various constraints including container limitations. The cut locations and orientations are transposed to the simulated model. The contaminated items are actually segmented and packaged. The segmentation and packaging may be simulated beforehand. In addition, the contaminated items may be cataloged and recorded.
Fuel consumption in optimal control
NASA Technical Reports Server (NTRS)
Redmond, Jim; Silverberg, Larry
1992-01-01
A method has been developed for comparing three optimal control strategies based on fuel consumption. A general cost function minimization procedure was developed by applying two theorems associated with convex sets. Three cost functions associated with control saturation, pseudofuel, and absolute fuel are introduced and minimized. The first two cost functions led to the bang-bang and continuous control strategies, and the minimization of absolute fuel led to an impulsive strategy. The three control strategies were implemented on two elementary systems and a comparison of fuel consumption was made. The impulse control strategy consumes significantly less fuel than the continuous and bang-bang control strategies. This comparison suggests a potential for fuel savings in higher-order systems using impulsive control strategies. However, since exact solutions to fuel-optimal control for large-order systems are difficult if not impossible to achieve, the alternative is to develop near-optimal control strategies.
Optimizing Stellarators for Turbulent Transport
H.E. Mynick, N.Pomphrey, and P. Xanthopoulos
2010-05-27
Up to now, the term "transport-optimized" stellarators has meant optimized to minimize neoclassical transport, while the task of also mitigating turbulent transport, usually the dominant transport channel in such designs, has not been addressed, due to the complexity of plasma turbulence in stellarators. Here, we demonstrate that stellarators can also be designed to mitigate their turbulent transport, by making use of two powerful numerical tools not available until recently, namely gyrokinetic codes valid for 3D nonlinear simulations, and stellarator optimization codes. A first proof-of-principle configuration is obtained, reducing the level of ion temperature gradient turbulent transport from the NCSX baseline design by a factor of about 2.5.
Optimality, reduction and collective motion
Justh, Eric W.; Krishnaprasad, P. S.
2015-01-01
The planar self-steering particle model of agents in a collective gives rise to dynamics on the N-fold direct product of SE(2), the rigid motion group in the plane. Assuming a connected, undirected graph of interaction between agents, we pose a family of symmetric optimal control problems with a coupling parameter capturing the strength of interactions. The Hamiltonian system associated with the necessary conditions for optimality is reducible to a Lie–Poisson dynamical system possessing interesting structure. In particular, the strong coupling limit reveals additional (hidden) symmetry, beyond the manifest one used in reduction: this enables explicit integration of the dynamics, and demonstrates the presence of a ‘master clock’ that governs all agents to steer identically. For finite coupling strength, we show that special solutions exist with steering controls proportional across the collective. These results suggest that optimality principles may provide a framework for understanding imitative behaviours observed in certain animal aggregations. PMID:27547087
Integrated solar energy system optimization
NASA Astrophysics Data System (ADS)
Young, S. K.
1982-11-01
The computer program SYSOPT, intended as a tool for optimizing the subsystem sizing, performance, and economics of integrated wind and solar energy systems, is presented. The modular structure of the methodology additionally allows simulations when the solar subsystems are combined with conventional technologies, e.g., a utility grid. Hourly energy/mass flow balances are computed for interconnection points, yielding optimized sizing and time-dependent operation of various subsystems. The program requires meteorological data, such as insolation, diurnal and seasonal variations, and wind speed at the hub height of a wind turbine, all of which can be taken from simulations like the TRNSYS program. Examples are provided for optimization of a solar-powered (wind turbine and parabolic trough-Rankine generator) desalinization plant, and a design analysis for a solar powered greenhouse.
Accelerating optimization by tracing valley
NASA Astrophysics Data System (ADS)
Li, Qing-Xiao; He, Rong-Qiang; Lu, Zhong-Yi
2016-06-01
We propose an algorithm to accelerate optimization when an objective function locally resembles a long narrow valley. In such a case, a conventional optimization algorithm usually wanders with too many tiny steps in the valley. The new algorithm approximates the valley bottom locally by a parabola that is obtained by fitting a set of successive points generated recently by a conventional optimization method. Then large steps are taken along the parabola, accompanied by fine adjustment to trace the valley bottom. The effectiveness of the new algorithm has been demonstrated by accelerating the Newton trust-region minimization method and the Levenberg-Marquardt method on the nonlinear fitting problem in exact diagonalization dynamical mean-field theory and on the classic minimization problem of the Rosenbrock's function. Many times speedup has been achieved for both problems, showing the high efficiency of the new algorithm.
Excitation optimization for damage detection
Bement, Matthew T; Bewley, Thomas R
2009-01-01
A technique is developed to answer the important question: 'Given limited system response measurements and ever-present physical limits on the level of excitation, what excitation should be provided to a system to make damage most detectable?' Specifically, a method is presented for optimizing excitations that maximize the sensitivity of output measurements to perturbations in damage-related parameters estimated with an extended Kalman filter. This optimization is carried out in a computationally efficient manner using adjoint-based optimization and causes the innovations term in the extended Kalman filter to be larger in the presence of estimation errors, which leads to a better estimate of the damage-related parameters in question. The technique is demonstrated numerically on a nonlinear 2 DOF system, where a significant improvement in the damage-related parameter estimation is observed.
Optimal flow for brown trout: Habitat - prey optimization.
Fornaroli, Riccardo; Cabrini, Riccardo; Sartori, Laura; Marazzi, Francesca; Canobbio, Sergio; Mezzanotte, Valeria
2016-10-01
The correct definition of ecosystem needs is essential in order to guide policy and management strategies to optimize the increasing use of freshwater by human activities. Commonly, the assessment of the optimal or minimum flow rates needed to preserve ecosystem functionality has been done by habitat-based models that define a relationship between in-stream flow and habitat availability for various species of fish. We propose a new approach for the identification of optimal flows using the limiting factor approach and the evaluation of basic ecological relationships, considering the appropriate spatial scale for different organisms. We developed density-environment relationships for three different life stages of brown trout that show the limiting effects of hydromorphological variables at habitat scale. In our analyses, we found that the factors limiting the densities of trout were water velocity, substrate characteristics and refugia availability. For all the life stages, the selected models considered simultaneously two variables and implied that higher velocities provided a less suitable habitat, regardless of other physical characteristics and with different patterns. We used these relationships within habitat based models in order to select a range of flows that preserve most of the physical habitat for all the life stages. We also estimated the effect of varying discharge flows on macroinvertebrate biomass and used the obtained results to identify an optimal flow maximizing habitat and prey availability. PMID:27320735
Optimal sensor placement in structural health monitoring using discrete optimization
NASA Astrophysics Data System (ADS)
Sun, Hao; Büyüköztürk, Oral
2015-12-01
The objective of optimal sensor placement (OSP) is to obtain a sensor layout that gives as much information of the dynamic system as possible in structural health monitoring (SHM). The process of OSP can be formulated as a discrete minimization (or maximization) problem with the sensor locations as the design variables, conditional on the constraint of a given sensor number. In this paper, we propose a discrete optimization scheme based on the artificial bee colony algorithm to solve the OSP problem after first transforming it into an integer optimization problem. A modal assurance criterion-oriented objective function is investigated to measure the utility of a sensor configuration in the optimization process based on the modal characteristics of a reduced order model. The reduced order model is obtained using an iterated improved reduced system technique. The constraint is handled by a penalty term added to the objective function. Three examples, including a 27 bar truss bridge, a 21-storey building at the MIT campus and the 610 m high Canton Tower, are investigated to test the applicability of the proposed algorithm to OSP. In addition, the proposed OSP algorithm is experimentally validated on a physical laboratory structure which is a three-story two-bay steel frame instrumented with triaxial accelerometers. Results indicate that the proposed method is efficient and can be potentially used in OSP in practical SHM.
Interaction Prediction Optimization in Multidisciplinary Design Optimization Problems
Zhang, Xiaoling; Huang, Hong-Zhong; Wang, Zhonglai; Xu, Huanwei
2014-01-01
The distributed strategy of Collaborative Optimization (CO) is suitable for large-scale engineering systems. However, it is hard for CO to converge when there is a high level coupled dimension. Furthermore, the discipline objectives cannot be considered in each discipline optimization problem. In this paper, one large-scale systems control strategy, the interaction prediction method (IPM), is introduced to enhance CO. IPM is utilized for controlling subsystems and coordinating the produce process in large-scale systems originally. We combine the strategy of IPM with CO and propose the Interaction Prediction Optimization (IPO) method to solve MDO problems. As a hierarchical strategy, there are a system level and a subsystem level in IPO. The interaction design variables (including shared design variables and linking design variables) are operated at the system level and assigned to the subsystem level as design parameters. Each discipline objective is considered and optimized at the subsystem level simultaneously. The values of design variables are transported between system level and subsystem level. The compatibility constraints are replaced with the enhanced compatibility constraints to reduce the dimension of design variables in compatibility constraints. Two examples are presented to show the potential application of IPO for MDO. PMID:24744685
A competitive swarm optimizer for large scale optimization.
Cheng, Ran; Jin, Yaochu
2015-02-01
In this paper, a novel competitive swarm optimizer (CSO) for large scale optimization is proposed. The algorithm is fundamentally inspired by the particle swarm optimization but is conceptually very different. In the proposed CSO, neither the personal best position of each particle nor the global best position (or neighborhood best positions) is involved in updating the particles. Instead, a pairwise competition mechanism is introduced, where the particle that loses the competition will update its position by learning from the winner. To understand the search behavior of the proposed CSO, a theoretical proof of convergence is provided, together with empirical analysis of its exploration and exploitation abilities showing that the proposed CSO achieves a good balance between exploration and exploitation. Despite its algorithmic simplicity, our empirical results demonstrate that the proposed CSO exhibits a better overall performance than five state-of-the-art metaheuristic algorithms on a set of widely used large scale optimization problems and is able to effectively solve problems of dimensionality up to 5000. PMID:24860047
Fuzzy resource optimization for safeguards
Zardecki, A.; Markin, J.T.
1991-01-01
Authorization, enforcement, and verification -- three key functions of safeguards systems -- form the basis of a hierarchical description of the system risk. When formulated in terms of linguistic rather than numeric attributes, the risk can be computed through an algorithm based on the notion of fuzzy sets. Similarly, this formulation allows one to analyze the optimal resource allocation by maximizing the overall detection probability, regarded as a linguistic variable. After summarizing the necessary elements of the fuzzy sets theory, we outline the basic algorithm. This is followed by a sample computation of the fuzzy optimization. 10 refs., 1 tab.
Adaptive critics for dynamic optimization.
Kulkarni, Raghavendra V; Venayagamoorthy, Ganesh Kumar
2010-06-01
A novel action-dependent adaptive critic design (ACD) is developed for dynamic optimization. The proposed combination of a particle swarm optimization-based actor and a neural network critic is demonstrated through dynamic sleep scheduling of wireless sensor motes for wildlife monitoring. The objective of the sleep scheduler is to dynamically adapt the sleep duration to node's battery capacity and movement pattern of animals in its environment in order to obtain snapshots of the animal on its trajectory uniformly. Simulation results show that the sleep time of the node determined by the actor critic yields superior quality of sensory data acquisition and enhanced node longevity. PMID:20223635
Spin bearing retainer design optimization
NASA Technical Reports Server (NTRS)
Boesiger, Edward A.; Warner, Mark H.
1991-01-01
The dynamics behavior of spin bearings for momentum wheels (control-moment gyroscope, reaction wheel assembly) is critical to satellite stability and life. Repeated bearing retainer instabilities hasten lubricant deterioration and can lead to premature bearing failure and/or unacceptable vibration. These instabilities are typically distinguished by increases in torque, temperature, audible noise, and vibration induced by increases into the bearing cartridge. Ball retainer design can be optimized to minimize these occurrences. A retainer was designed using a previously successful smaller retainer as an example. Analytical methods were then employed to predict its behavior and optimize its configuration.
Optimal Network-Topology Design
NASA Technical Reports Server (NTRS)
Li, Victor O. K.; Yuen, Joseph H.; Hou, Ting-Chao; Lam, Yuen Fung
1987-01-01
Candidate network designs tested for acceptability and cost. Optimal Network Topology Design computer program developed as part of study on topology design and analysis of performance of Space Station Information System (SSIS) network. Uses efficient algorithm to generate candidate network designs consisting of subsets of set of all network components, in increasing order of total costs and checks each design to see whether it forms acceptable network. Technique gives true cost-optimal network and particularly useful when network has many constraints and not too many components. Program written in PASCAL.
MTF optimization of MCT detectors
NASA Astrophysics Data System (ADS)
Martineau, L.; Rubaldo, L.; Chabuel, F.; Gravrand, Olivier
2013-10-01
Spatial applications are challenging infrared (IR) technologies requiring the best system performances. Usually, the need is a trade-off between the signal to noise ratio (SNR) and spatial response of the IR detector, and in particular the modulation transfer function (MTF) performance. MTF optimization requires a deep understanding of detector physics and the use of evaluation tools. This paper describes the optimization of an n-on-p Mercury Cadmium Telluride (MCT) pixel design using a MTF mathematical model to predict the performance.
Configuration optimization of space structures
NASA Technical Reports Server (NTRS)
Felippa, Carlos; Crivelli, Luis A.; Vandenbelt, David
1991-01-01
The objective is to develop a computer aid for the conceptual/initial design of aerospace structures, allowing configurations and shape to be apriori design variables. The topics are presented in viewgraph form and include the following: Kikuchi's homogenization method; a classical shape design problem; homogenization method steps; a 3D mechanical component design example; forming a homogenized finite element; a 2D optimization problem; treatment of volume inequality constraint; algorithms for the volume inequality constraint; object function derivatives--taking advantage of design locality; stiffness variations; variations of potential; and schematics of the optimization problem.
CHP Installed Capacity Optimizer Software
2004-11-30
The CHP Installed Capacity Optimizer is a Microsoft Excel spreadsheet application that determines the most economic amount of capacity of distributed generation and thermal utilization equipment (e.g., absorption chillers) to install for any user-defined set of load and cost data. Installing the optimum amount of capacity is critical to the life-cycle economic viability of a distributed generation/cooling heat and power (CHP) application. Using advanced optimization algorithms, the software accesses the loads, utility tariffs, equipment costs,more » etc., and provides to the user the most economic amount of system capacity to install.« less
Design optimization of transonic airfoils
NASA Technical Reports Server (NTRS)
Joh, C.-Y.; Grossman, B.; Haftka, R. T.
1991-01-01
Numerical optimization procedures were considered for the design of airfoils in transonic flow based on the transonic small disturbance (TSD) and Euler equations. A sequential approximation optimization technique was implemented with an accurate approximation of the wave drag based on the Nixon's coordinate straining approach. A modification of the Euler surface boundary conditions was implemented in order to efficiently compute design sensitivities without remeshing the grid. Two effective design procedures producing converged designs in approximately 10 global iterations were developed: interchanging the role of the objective function and constraint and the direct lift maximization with move limits which were fixed absolute values of the design variables.
CHP Installed Capacity Optimizer Software
2004-11-30
The CHP Installed Capacity Optimizer is a Microsoft Excel spreadsheet application that determines the most economic amount of capacity of distributed generation and thermal utilization equipment (e.g., absorption chillers) to install for any user-defined set of load and cost data. Installing the optimum amount of capacity is critical to the life-cycle economic viability of a distributed generation/cooling heat and power (CHP) application. Using advanced optimization algorithms, the software accesses the loads, utility tariffs, equipment costs, etc., and provides to the user the most economic amount of system capacity to install.
Selected optimal shuttle entry computations
NASA Technical Reports Server (NTRS)
Sullivan, H. C.
1974-01-01
Parameterization and the Davidon-Fletcher-Powell method are used to study the characteristics of optimal shuttle entry trajectories. Two problems of thermal protective system weight minimization are considered: roll modulation and roll plus an angle-of-attack modulation. Both problems are targeted for the edges of the entry footprint. Results consistent with constraints on loads and control bounds are particularly well-behaved and strongly support 'energy' approximation results obtained for the case of symmetric flight by Kelley and Sullivan (1973). Furthermore, results indicate that optimal shuttle entry trajectories should be easy to duplicate and to analyze by using simple techniques.