Portfolio optimization with mean-variance model
NASA Astrophysics Data System (ADS)
Hoe, Lam Weng; Siew, Lam Weng
2016-06-01
Investors wish to achieve the target rate of return at the minimum level of risk in their investment. Portfolio optimization is an investment strategy that can be used to minimize the portfolio risk and can achieve the target rate of return. The mean-variance model has been proposed in portfolio optimization. The mean-variance model is an optimization model that aims to minimize the portfolio risk which is the portfolio variance. The objective of this study is to construct the optimal portfolio using the mean-variance model. The data of this study consists of weekly returns of 20 component stocks of FTSE Bursa Malaysia Kuala Lumpur Composite Index (FBMKLCI). The results of this study show that the portfolio composition of the stocks is different. Moreover, investors can get the return at minimum level of risk with the constructed optimal mean-variance portfolio.
Multiperiod Mean-Variance Portfolio Optimization via Market Cloning
Ankirchner, Stefan; Dermoune, Azzouz
2011-08-15
The problem of finding the mean variance optimal portfolio in a multiperiod model can not be solved directly by means of dynamic programming. In order to find a solution we therefore first introduce independent market clones having the same distributional properties as the original market, and we replace the portfolio mean and variance by their empirical counterparts. We then use dynamic programming to derive portfolios maximizing a weighted sum of the empirical mean and variance. By letting the number of market clones converge to infinity we are able to solve the original mean variance problem.
PET image reconstruction: mean, variance, and optimal minimax criterion
NASA Astrophysics Data System (ADS)
Liu, Huafeng; Gao, Fei; Guo, Min; Xue, Liying; Nie, Jing; Shi, Pengcheng
2015-04-01
Given the noise nature of positron emission tomography (PET) measurements, it is critical to know the image quality and reliability as well as expected radioactivity map (mean image) for both qualitative interpretation and quantitative analysis. While existing efforts have often been devoted to providing only the reconstructed mean image, we present a unified framework for joint estimation of the mean and corresponding variance of the radioactivity map based on an efficient optimal min-max criterion. The proposed framework formulates the PET image reconstruction problem to be a transformation from system uncertainties to estimation errors, where the minimax criterion is adopted to minimize the estimation errors with possibly maximized system uncertainties. The estimation errors, in the form of a covariance matrix, express the measurement uncertainties in a complete way. The framework is then optimized by ∞-norm optimization and solved with the corresponding H∞ filter. Unlike conventional statistical reconstruction algorithms, that rely on the statistical modeling methods of the measurement data or noise, the proposed joint estimation stands from the point of view of signal energies and can handle from imperfect statistical assumptions to even no a priori statistical assumptions. The performance and accuracy of reconstructed mean and variance images are validated using Monte Carlo simulations. Experiments on phantom scans with a small animal PET scanner and real patient scans are also conducted for assessment of clinical potential.
Swarm based mean-variance mapping optimization (MVMOS) for solving economic dispatch
NASA Astrophysics Data System (ADS)
Khoa, T. H.; Vasant, P. M.; Singh, M. S. Balbir; Dieu, V. N.
2014-10-01
The economic dispatch (ED) is an essential optimization task in the power generation system. It is defined as the process of allocating the real power output of generation units to meet required load demand so as their total operating cost is minimized while satisfying all physical and operational constraints. This paper introduces a novel optimization which named as Swarm based Mean-variance mapping optimization (MVMOS). The technique is the extension of the original single particle mean-variance mapping optimization (MVMO). Its features make it potentially attractive algorithm for solving optimization problems. The proposed method is implemented for three test power systems, including 3, 13 and 20 thermal generation units with quadratic cost function and the obtained results are compared with many other methods available in the literature. Test results have indicated that the proposed method can efficiently implement for solving economic dispatch.
2014-01-01
Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results. PMID:24991645
Mean-variance portfolio analysis data for optimizing community-based photovoltaic investment.
Shakouri, Mahmoud; Lee, Hyun Woo
2016-03-01
The amount of electricity generated by Photovoltaic (PV) systems is affected by factors such as shading, building orientation and roof slope. To increase electricity generation and reduce volatility in generation of PV systems, a portfolio of PV systems can be made which takes advantages of the potential synergy among neighboring buildings. This paper contains data supporting the research article entitled: PACPIM: new decision-support model of optimized portfolio analysis for community-based photovoltaic investment [1]. We present a set of data relating to physical properties of 24 houses in Oregon, USA, along with simulated hourly electricity data for the installed PV systems. The developed Matlab code to construct optimized portfolios is also provided in . The application of these files can be generalized to variety of communities interested in investing on PV systems. PMID:26937458
Conversations across Meaning Variance
ERIC Educational Resources Information Center
Cordero, Alberto
2013-01-01
Progressive interpretations of scientific theories have long been denounced as naive, because of the inescapability of meaning variance. The charge reportedly applies to recent realist moves that focus on theory-parts rather than whole theories. This paper considers the question of what "theory-parts" of epistemic significance (if any) relevantly…
Driveway identification signing and marking
Not Available
1986-09-01
A primary purpose of a public highway is to provide access to commercial establishments. Driveways to fast-food restaurants, banks, retail stores, and office buildings line many road sections. A bewildering array of reflectorized, unreflectorized, lighted, and unlighted high- and low-mounted signs with varying messages direct motorists in and out of many of the driveways, while other access points have no signs. In a very few cases, the Manual of Uniform Traffic Control Devices-type signing for one-way roads has been installed for the one-way-type circulation design at some of these establishments. Should MUTCD-type one-way signs be recommended practice to control and provide a more uniform identification of these driveways when necessary. Are there signs not presently in the MUTCD that should be added to cope with this situation.
Mean-Variance Hedging on Uncertain Time Horizon in a Market with a Jump
Kharroubi, Idris; Lim, Thomas; Ngoupeyou, Armand
2013-12-15
In this work, we study the problem of mean-variance hedging with a random horizon T∧τ, where T is a deterministic constant and τ is a jump time of the underlying asset price process. We first formulate this problem as a stochastic control problem and relate it to a system of BSDEs with a jump. We then provide a verification theorem which gives the optimal strategy for the mean-variance hedging using the solution of the previous system of BSDEs. Finally, we prove that this system of BSDEs admits a solution via a decomposition approach coming from filtration enlargement theory.
Beurskens, Luuk (ECN-Energy Research Centre of the Netherland); Jansen, Jaap C. (ECN-Energy Research Centre of the Netherlands); Awerbuch, Shimon Ph.D. (.University of Sussex, Brighton, UK); Drennen, Thomas E.
2005-09-01
Energy planning represents an investment-decision problem. Investors commonly evaluate such problems using portfolio theory to manage risk and maximize portfolio performance under a variety of unpredictable economic outcomes. Energy planners need to similarly abandon their reliance on traditional, ''least-cost'' stand-alone technology cost estimates and instead evaluate conventional and renewable energy sources on the basis of their portfolio cost--their cost contribution relative to their risk contribution to a mix of generating assets. This report describes essential portfolio-theory ideas and discusses their application in the Western US region. The memo illustrates how electricity-generating mixes can benefit from additional shares of geothermal and other renewables. Compared to fossil-dominated mixes, efficient portfolios reduce generating cost while including greater renewables shares in the mix. This enhances energy security. Though counter-intuitive, the idea that adding more costly geothermal can actually reduce portfolio-generating cost is consistent with basic finance theory. An important implication is that in dynamic and uncertain environments, the relative value of generating technologies must be determined not by evaluating alternative resources, but by evaluating alternative resource portfolios. The optimal results for the Western US Region indicate that compared to the EIA target mixes, there exist generating mixes with larger geothermal shares at equal-or-lower expected cost and risk.
Continuous-Time Mean-Variance Portfolio Selection with Random Horizon
Yu, Zhiyong
2013-12-15
This paper examines the continuous-time mean-variance optimal portfolio selection problem with random market parameters and random time horizon. Treating this problem as a linearly constrained stochastic linear-quadratic optimal control problem, I explicitly derive the efficient portfolios and efficient frontier in closed forms based on the solutions of two backward stochastic differential equations. Some related issues such as a minimum variance portfolio and a mutual fund theorem are also addressed. All the results are markedly different from those in the problem with deterministic exit time. A key part of my analysis involves proving the global solvability of a stochastic Riccati equation, which is interesting in its own right.
9 CFR 313.1 - Livestock pens, driveways and ramps.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Livestock pens, driveways and ramps... INSPECTION AND CERTIFICATION HUMANE SLAUGHTER OF LIVESTOCK § 313.1 Livestock pens, driveways and ramps. (a) Livestock pens, driveways and ramps shall be maintained in good repair. They shall be free from sharp...
43 CFR 3815.7 - Mining claims subject to stock driveway withdrawals.
Code of Federal Regulations, 2013 CFR
2013-10-01
... 43 Public Lands: Interior 2 2013-10-01 2013-10-01 false Mining claims subject to stock driveway... SUBJECT TO LOCATION Mineral Locations in Stock Driveway Withdrawals § 3815.7 Mining claims subject to stock driveway withdrawals. Mining claims on lands within stock driveway withdrawals, located prior...
43 CFR 3815.7 - Mining claims subject to stock driveway withdrawals.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 43 Public Lands: Interior 2 2011-10-01 2011-10-01 false Mining claims subject to stock driveway... SUBJECT TO LOCATION Mineral Locations in Stock Driveway Withdrawals § 3815.7 Mining claims subject to stock driveway withdrawals. Mining claims on lands within stock driveway withdrawals, located prior...
43 CFR 3815.7 - Mining claims subject to stock driveway withdrawals.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 43 Public Lands: Interior 2 2012-10-01 2012-10-01 false Mining claims subject to stock driveway... SUBJECT TO LOCATION Mineral Locations in Stock Driveway Withdrawals § 3815.7 Mining claims subject to stock driveway withdrawals. Mining claims on lands within stock driveway withdrawals, located prior...
FACILITY 89. FRONT OBLIQUE TAKEN FROM DRIVEWAY. VIEW FACING NORTHEAST. ...
FACILITY 89. FRONT OBLIQUE TAKEN FROM DRIVEWAY. VIEW FACING NORTHEAST. - U.S. Naval Base, Pearl Harbor, Naval Housing Area Makalapa, Junior Officers' Quarters Type K, Makin Place, & Halawa, Makalapa, & Midway Drives, Pearl City, Honolulu County, HI
Photocopy of original blackandwhite silver gelatin print, TWELFTH STREET DRIVEWAY ...
Photocopy of original black-and-white silver gelatin print, TWELFTH STREET DRIVEWAY ENTRANCE, August 31, 1929, photographer Commercial Photo Company - Internal Revenue Service Headquarters Building, 1111 Constitution Avenue Northwest, Washington, District of Columbia, DC
7. View of south court and driveway toward main entrance; ...
7. View of south court and driveway toward main entrance; and parts of north and south wings of main building; facing east. - Mission Motel, South Court, 9235 MacArthur Boulevard, Oakland, Alameda County, CA
7. ELEVATION OF STREET (NORTH) FACADE FROM DRIVEWAY OF LOWELL'S ...
7. ELEVATION OF STREET (NORTH) FACADE FROM DRIVEWAY OF LOWELL'S FORMER RESIDENCE. NOTE BUILDERS VERTICALLY ALIGNED STEM OF BOATS WITH CORNER OF HOUSE BEHIND CAMERA POSITION. - Lowell's Boat Shop, 459 Main Street, Amesbury, Essex County, MA
2. View from the mansion formal entrance driveway toward the ...
2. View from the mansion formal entrance driveway toward the big meadow at the Billings Farm & Museum. The driveway is flanked by granite gateposts surmounted by wrought iron urn lamps. The view includes a manicured hemlock hedge (Tsuga canadensis) retained by a stone wall at left, and white birch (Betula species) under-planted with ferns at center. - Marsh-Billings-Rockefeller National Historical Park, 54 Elm Street, Woodstock, Windsor County, VT
Risk-Averse Multi-Armed Bandit Problems Under Mean-Variance Measure
NASA Astrophysics Data System (ADS)
Vakili, Sattar; Zhao, Qing
2016-09-01
The multi-armed bandit problems have been studied mainly under the measure of expected total reward accrued over a horizon of length $T$. In this paper, we address the issue of risk in multi-armed bandit problems and develop parallel results under the measure of mean-variance, a commonly adopted risk measure in economics and mathematical finance. We show that the model-specific regret and the model-independent regret in terms of the mean-variance of the reward process are lower bounded by $\\Omega(\\log T)$ and $\\Omega(T^{2/3})$, respectively. We then show that variations of the UCB policy and the DSEE policy developed for the classic risk-neutral MAB achieve these lower bounds.
Robust Programming Problems Based on the Mean-Variance Model Including Uncertainty Factors
NASA Astrophysics Data System (ADS)
Hasuike, Takashi; Ishii, Hiroaki
2009-01-01
This paper considers robust programming problems based on the mean-variance model including uncertainty sets and fuzzy factors. Since these problems are not well-defined problems due to fuzzy factors, it is hard to solve them directly. Therefore, introducing chance constraints, fuzzy goals and possibility measures, the proposed models are transformed into the deterministic equivalent problems. Furthermore, in order to solve these equivalent problems efficiently, the solution method is constructed introducing the mean-absolute deviation and doing the equivalent transformations.
R package MVR for Joint Adaptive Mean-Variance Regularization and Variance Stabilization
Dazard, Jean-Eudes; Xu, Hua; Rao, J. Sunil
2015-01-01
We present an implementation in the R language for statistical computing of our recent non-parametric joint adaptive mean-variance regularization and variance stabilization procedure. The method is specifically suited for handling difficult problems posed by high-dimensional multivariate datasets (p ≫ n paradigm), such as in ‘omics’-type data, among which are that the variance is often a function of the mean, variable-specific estimators of variances are not reliable, and tests statistics have low powers due to a lack of degrees of freedom. The implementation offers a complete set of features including: (i) normalization and/or variance stabilization function, (ii) computation of mean-variance-regularized t and F statistics, (iii) generation of diverse diagnostic plots, (iv) synthetic and real ‘omics’ test datasets, (v) computationally efficient implementation, using C interfacing, and an option for parallel computing, (vi) manual and documentation on how to setup a cluster. To make each feature as user-friendly as possible, only one subroutine per functionality is to be handled by the end-user. It is available as an R package, called MVR (‘Mean-Variance Regularization’), downloadable from the CRAN. PMID:26819572
Measuring kinetics of complex single ion channel data using mean-variance histograms.
Patlak, J B
1993-01-01
The measurement of single ion channel kinetics is difficult when those channels exhibit subconductance events. When the kinetics are fast, and when the current magnitudes are small, as is the case for Na+, Ca2+, and some K+ channels, these difficulties can lead to serious errors in the estimation of channel kinetics. I present here a method, based on the construction and analysis of mean-variance histograms, that can overcome these problems. A mean-variance histogram is constructed by calculating the mean current and the current variance within a brief "window" (a set of N consecutive data samples) superimposed on the digitized raw channel data. Systematic movement of this window over the data produces large numbers of mean-variance pairs which can be assembled into a two-dimensional histogram. Defined current levels (open, closed, or sublevel) appear in such plots as low variance regions. The total number of events in such low variance regions is estimated by curve fitting and plotted as a function of window width. This function decreases with the same time constants as the original dwell time probability distribution for each of the regions. The method can therefore be used: 1) to present a qualitative summary of the single channel data from which the signal-to-noise ratio, open channel noise, steadiness of the baseline, and number of conductance levels can be quickly determined; 2) to quantify the dwell time distribution in each of the levels exhibited. In this paper I present the analysis of a Na+ channel recording that had a number of complexities. The signal-to-noise ratio was only about 8 for the main open state, open channel noise, and fast flickers to other states were present, as were a substantial number of subconductance states. "Standard" half-amplitude threshold analysis of these data produce open and closed time histograms that were well fitted by the sum of two exponentials, but with apparently erroneous time constants, whereas the mean-variance
2. GENERAL VIEW: MAIN DRIVEWAY: CORD CABIN IS TO THE ...
2. GENERAL VIEW: MAIN DRIVEWAY: CORD CABIN IS TO THE RIGHT OF KIOSK THE FAGEOL CABIN IS IN THE BACKGROUND. - Camp Richardson Resort, Cord Cabin, U.S. Highway 89, 3 miles west of State Highway 50 & 89, South Lake Tahoe, El Dorado County, CA
9 CFR 313.1 - Livestock pens, driveways and ramps.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 9 Animals and Animal Products 2 2013-01-01 2013-01-01 false Livestock pens, driveways and ramps. 313.1 Section 313.1 Animals and Animal Products FOOD SAFETY AND INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE AGENCY ORGANIZATION AND TERMINOLOGY; MANDATORY MEAT AND POULTRY PRODUCTS INSPECTION AND...
9 CFR 313.1 - Livestock pens, driveways and ramps.
Code of Federal Regulations, 2014 CFR
2014-01-01
... 9 Animals and Animal Products 2 2014-01-01 2014-01-01 false Livestock pens, driveways and ramps. 313.1 Section 313.1 Animals and Animal Products FOOD SAFETY AND INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE AGENCY ORGANIZATION AND TERMINOLOGY; MANDATORY MEAT AND POULTRY PRODUCTS INSPECTION AND...
9 CFR 313.1 - Livestock pens, driveways and ramps.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 9 Animals and Animal Products 2 2011-01-01 2011-01-01 false Livestock pens, driveways and ramps. 313.1 Section 313.1 Animals and Animal Products FOOD SAFETY AND INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE AGENCY ORGANIZATION AND TERMINOLOGY; MANDATORY MEAT AND POULTRY PRODUCTS INSPECTION AND...
9 CFR 313.1 - Livestock pens, driveways and ramps.
Code of Federal Regulations, 2012 CFR
2012-01-01
... 9 Animals and Animal Products 2 2012-01-01 2012-01-01 false Livestock pens, driveways and ramps. 313.1 Section 313.1 Animals and Animal Products FOOD SAFETY AND INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE AGENCY ORGANIZATION AND TERMINOLOGY; MANDATORY MEAT AND POULTRY PRODUCTS INSPECTION AND VOLUNTARY INSPECTION AND CERTIFICATION...
THE KINETH HOUSE FROM THE CENTRAL DRIVEWAY, LOOKING NORTHEAST. The ...
THE KINETH HOUSE FROM THE CENTRAL DRIVEWAY, LOOKING NORTHEAST. The two-story vernacular farm house, with its early addition to the east, faces Highway 20. Its yard is lined with split rail fence. - Kineth Farm, House, 19162 STATE ROUTE 20, Coupeville, Island County, WA
Full-Depth Asphalt Pavements for Parking Lots and Driveways.
ERIC Educational Resources Information Center
Asphalt Inst., College Park, MD.
The latest information for designing full-depth asphalt pavements for parking lots and driveways is covered in relationship to the continued increase in vehicle registration. It is based on The Asphalt Institute's Thickness Design Manual, Series No. 1 (MS-1), Seventh Edition, which covers all aspects of asphalt pavement thickness design in detail,…
NASA Astrophysics Data System (ADS)
Elliott, T. J.; Johnson, T. H.
2016-04-01
We show how impurity atoms can measure moments of ultracold-atomic-gas densities, using the example of bosons in a one-dimensional lattice. This builds on a body of work regarding the probing of systems by measuring the dephasing of an immersed qubit. We show that this dephasing is captured by a function resembling characteristic functions of probability theory, of which the derivatives at short times reveal moments of the system operator to which the qubit couples. For a qubit formed by an impurity atom, in a system of ultracold atoms, this operator can be the density of the system at the location of the impurity, and thus means, variances, and correlations of the atomic densities are accessible.
Quantifying Systemic Risk by Solutions of the Mean-Variance Risk Model
Morgenstern, Ingo
2016-01-01
The world is still recovering from the financial crisis peaking in September 2008. The triggering event was the bankruptcy of Lehman Brothers. To detect such turmoils, one can investigate the time-dependent behaviour of correlations between assets or indices. These cross-correlations have been connected to the systemic risks within markets by several studies in the aftermath of this crisis. We study 37 different US indices which cover almost all aspects of the US economy and show that monitoring an average investor’s behaviour can be used to quantify times of increased risk. In this paper the overall investing strategy is approximated by the ground-states of the mean-variance model along the efficient frontier bound to real world constraints. Changes in the behaviour of the average investor is utlilized as a early warning sign. PMID:27351482
Quantifying Systemic Risk by Solutions of the Mean-Variance Risk Model.
Jurczyk, Jan; Eckrot, Alexander; Morgenstern, Ingo
2016-01-01
The world is still recovering from the financial crisis peaking in September 2008. The triggering event was the bankruptcy of Lehman Brothers. To detect such turmoils, one can investigate the time-dependent behaviour of correlations between assets or indices. These cross-correlations have been connected to the systemic risks within markets by several studies in the aftermath of this crisis. We study 37 different US indices which cover almost all aspects of the US economy and show that monitoring an average investor's behaviour can be used to quantify times of increased risk. In this paper the overall investing strategy is approximated by the ground-states of the mean-variance model along the efficient frontier bound to real world constraints. Changes in the behaviour of the average investor is utlilized as a early warning sign. PMID:27351482
Atta Mills, Ebenezer Fiifi Emire; Yan, Dawen; Yu, Bo; Wei, Xinyuan
2016-01-01
We propose a consolidated risk measure based on variance and the safety-first principle in a mean-risk portfolio optimization framework. The safety-first principle to financial portfolio selection strategy is modified and improved. Our proposed models are subjected to norm regularization to seek near-optimal stable and sparse portfolios. We compare the cumulative wealth of our preferred proposed model to a benchmark, S&P 500 index for the same period. Our proposed portfolio strategies have better out-of-sample performance than the selected alternative portfolio rules in literature and control the downside risk of the portfolio returns. PMID:27386363
Self-Averaging Property of Minimal Investment Risk of Mean-Variance Model
Shinzato, Takashi
2015-01-01
In portfolio optimization problems, the minimum expected investment risk is not always smaller than the expected minimal investment risk. That is, using a well-known approach from operations research, it is possible to derive a strategy that minimizes the expected investment risk, but this strategy does not always result in the best rate of return on assets. Prior to making investment decisions, it is important to an investor to know the potential minimal investment risk (or the expected minimal investment risk) and to determine the strategy that will maximize the return on assets. We use the self-averaging property to analyze the potential minimal investment risk and the concentrated investment level for the strategy that gives the best rate of return. We compare the results from our method with the results obtained by the operations research approach and with those obtained by a numerical simulation using the optimal portfolio. The results of our method and the numerical simulation are in agreement, but they differ from that of the operations research approach. PMID:26225761
Code of Federal Regulations, 2010 CFR
2010-01-01
... storage rooms; outer premises, docks, driveways, etc.; fly-breeding material; nuisances. 355.15 Section....15 Inedible material operating and storage rooms; outer premises, docks, driveways, etc.; fly... any material in which flies may breed, or the maintenance of any nuisance on the premises shall not...
Code of Federal Regulations, 2011 CFR
2011-01-01
... storage rooms; outer premises, docks, driveways, etc.; fly-breeding material; nuisances. 355.15 Section....15 Inedible material operating and storage rooms; outer premises, docks, driveways, etc.; fly... any material in which flies may breed, or the maintenance of any nuisance on the premises shall not...
DRAWING R100131, COMPANY OFFICERS' AREA, BUILDING LOCATIONS, DRIVEWAYS, AND SIDEWALKS, ...
DRAWING R-1001-31, COMPANY OFFICERS' AREA, BUILDING LOCATIONS, DRIVEWAYS, AND SIDEWALKS, LAS LOMAS AND BUENA VISTA DRIVES. Ink on linen, signed by H.B. Nurse. Date has been erased, but probably June 15, 1933. Also marked "PWC 104288." - Hamilton Field, East of Nave Drive, Novato, Marin County, CA
DRAWING R100132, FIELD OFFICERS' AREA, BUILDING LOCATIONS, DRIVEWAYS, AND SIDEWALKS, ...
DRAWING R-1001-32, FIELD OFFICERS' AREA, BUILDING LOCATIONS, DRIVEWAYS, AND SIDEWALKS, SOUTH CIRCLE, CASA GRANDE REAL, AND SEQUOIA DRIVES. Ink on linen, signed by H.B. Nurse. Date has been erased, but probably June 15, 1933. Also marked "PWC 104289." - Hamilton Field, East of Nave Drive, Novato, Marin County, CA
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.
Code of Federal Regulations, 2012 CFR
2012-01-01
... storage rooms; outer premises, docks, driveways, etc.; fly-breeding material; nuisances. 355.15 Section...-breeding material; nuisances. All operating and storage rooms and departments of inspected plants used for... any material in which flies may breed, or the maintenance of any nuisance on the premises shall not...
Code of Federal Regulations, 2013 CFR
2013-01-01
... storage rooms; outer premises, docks, driveways, etc.; fly-breeding material; nuisances. 355.15 Section...-breeding material; nuisances. All operating and storage rooms and departments of inspected plants used for... any material in which flies may breed, or the maintenance of any nuisance on the premises shall not...
Code of Federal Regulations, 2014 CFR
2014-01-01
... storage rooms; outer premises, docks, driveways, etc.; fly-breeding material; nuisances. 355.15 Section...-breeding material; nuisances. All operating and storage rooms and departments of inspected plants used for... any material in which flies may breed, or the maintenance of any nuisance on the premises shall not...
Code of Federal Regulations, 2010 CFR
2010-01-01
... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Livestock affected with anthrax... INSPECTION § 309.7 Livestock affected with anthrax; cleaning and disinfection of infected livestock pens and driveways. (a) Any livestock found on ante-mortem inspection to be affected with anthrax shall be...
Code of Federal Regulations, 2012 CFR
2012-01-01
... 9 Animals and Animal Products 2 2012-01-01 2012-01-01 false Livestock affected with anthrax... INSPECTION § 309.7 Livestock affected with anthrax; cleaning and disinfection of infected livestock pens and driveways. (a) Any livestock found on ante-mortem inspection to be affected with anthrax shall be...
Code of Federal Regulations, 2011 CFR
2011-01-01
... 9 Animals and Animal Products 2 2011-01-01 2011-01-01 false Livestock affected with anthrax... INSPECTION § 309.7 Livestock affected with anthrax; cleaning and disinfection of infected livestock pens and driveways. (a) Any livestock found on ante-mortem inspection to be affected with anthrax shall be...
Code of Federal Regulations, 2014 CFR
2014-01-01
... 9 Animals and Animal Products 2 2014-01-01 2014-01-01 false Livestock affected with anthrax... INSPECTION § 309.7 Livestock affected with anthrax; cleaning and disinfection of infected livestock pens and driveways. (a) Any livestock found on ante-mortem inspection to be affected with anthrax shall be...
Code of Federal Regulations, 2013 CFR
2013-01-01
... 9 Animals and Animal Products 2 2013-01-01 2013-01-01 false Livestock affected with anthrax... INSPECTION § 309.7 Livestock affected with anthrax; cleaning and disinfection of infected livestock pens and driveways. (a) Any livestock found on ante-mortem inspection to be affected with anthrax shall be...
Portfolio optimization with skewness and kurtosis
NASA Astrophysics Data System (ADS)
Lam, Weng Hoe; Jaaman, Saiful Hafizah Hj.; Isa, Zaidi
2013-04-01
Mean and variance of return distributions are two important parameters of the mean-variance model in portfolio optimization. However, the mean-variance model will become inadequate if the returns of assets are not normally distributed. Therefore, higher moments such as skewness and kurtosis cannot be ignored. Risk averse investors prefer portfolios with high skewness and low kurtosis so that the probability of getting negative rates of return will be reduced. The objective of this study is to compare the portfolio compositions as well as performances between the mean-variance model and mean-variance-skewness-kurtosis model by using the polynomial goal programming approach. The results show that the incorporation of skewness and kurtosis will change the optimal portfolio compositions. The mean-variance-skewness-kurtosis model outperforms the mean-variance model because the mean-variance-skewness-kurtosis model takes skewness and kurtosis into consideration. Therefore, the mean-variance-skewness-kurtosis model is more appropriate for the investors of Malaysia in portfolio optimization.
Portfolio optimization using median-variance approach
NASA Astrophysics Data System (ADS)
Wan Mohd, Wan Rosanisah; Mohamad, Daud; Mohamed, Zulkifli
2013-04-01
Optimization models have been applied in many decision-making problems particularly in portfolio selection. Since the introduction of Markowitz's theory of portfolio selection, various approaches based on mathematical programming have been introduced such as mean-variance, mean-absolute deviation, mean-variance-skewness and conditional value-at-risk (CVaR) mainly to maximize return and minimize risk. However most of the approaches assume that the distribution of data is normal and this is not generally true. As an alternative, in this paper, we employ the median-variance approach to improve the portfolio optimization. This approach has successfully catered both types of normal and non-normal distribution of data. With this actual representation, we analyze and compare the rate of return and risk between the mean-variance and the median-variance based portfolio which consist of 30 stocks from Bursa Malaysia. The results in this study show that the median-variance approach is capable to produce a lower risk for each return earning as compared to the mean-variance approach.
Algorithms for optimizing CT fluence control
NASA Astrophysics Data System (ADS)
Hsieh, Scott S.; Pelc, Norbert J.
2014-03-01
The ability to customize the incident x-ray fluence in CT via beam-shaping filters or mA modulation is known to improve image quality and/or reduce radiation dose. Previous work has shown that complete control of x-ray fluence (ray-by-ray fluence modulation) would further improve dose efficiency. While complete control of fluence is not currently possible, emerging concepts such as dynamic attenuators and inverse-geometry CT allow nearly complete control to be realized. Optimally using ray-by-ray fluence modulation requires solving a very high-dimensional optimization problem. Most optimization techniques fail or only provide approximate solutions. We present efficient algorithms for minimizing mean or peak variance given a fixed dose limit. The reductions in variance can easily be translated to reduction in dose, if the original variance met image quality requirements. For mean variance, a closed form solution is derived. The peak variance problem is recast as iterated, weighted mean variance minimization, and at each iteration it is possible to bound the distance to the optimal solution. We apply our algorithms in simulations of scans of the thorax and abdomen. Peak variance reductions of 45% and 65% are demonstrated in the abdomen and thorax, respectively, compared to a bowtie filter alone. Mean variance shows smaller gains (about 15%).
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.
Static vs stochastic optimization: A case study of FTSE Bursa Malaysia sectorial indices
Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita
2014-06-19
Traditional portfolio optimization methods in the likes of Markowitz' mean-variance model and semi-variance model utilize static expected return and volatility risk from historical data to generate an optimal portfolio. The optimal portfolio may not truly be optimal in reality due to the fact that maximum and minimum values from the data may largely influence the expected return and volatility risk values. This paper considers distributions of assets' return and volatility risk to determine a more realistic optimized portfolio. For illustration purposes, the sectorial indices data in FTSE Bursa Malaysia is employed. The results show that stochastic optimization provides more stable information ratio.
Static vs stochastic optimization: A case study of FTSE Bursa Malaysia sectorial indices
NASA Astrophysics Data System (ADS)
Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah@Rozita
2014-06-01
Traditional portfolio optimization methods in the likes of Markowitz' mean-variance model and semi-variance model utilize static expected return and volatility risk from historical data to generate an optimal portfolio. The optimal portfolio may not truly be optimal in reality due to the fact that maximum and minimum values from the data may largely influence the expected return and volatility risk values. This paper considers distributions of assets' return and volatility risk to determine a more realistic optimized portfolio. For illustration purposes, the sectorial indices data in FTSE Bursa Malaysia is employed. The results show that stochastic optimization provides more stable information ratio.
Inverse Optimization: A New Perspective on the Black-Litterman Model.
Bertsimas, Dimitris; Gupta, Vishal; Paschalidis, Ioannis Ch
2012-12-11
The Black-Litterman (BL) model is a widely used asset allocation model in the financial industry. In this paper, we provide a new perspective. The key insight is to replace the statistical framework in the original approach with ideas from inverse optimization. This insight allows us to significantly expand the scope and applicability of the BL model. We provide a richer formulation that, unlike the original model, is flexible enough to incorporate investor information on volatility and market dynamics. Equally importantly, our approach allows us to move beyond the traditional mean-variance paradigm of the original model and construct "BL"-type estimators for more general notions of risk such as coherent risk measures. Computationally, we introduce and study two new "BL"-type estimators and their corresponding portfolios: a Mean Variance Inverse Optimization (MV-IO) portfolio and a Robust Mean Variance Inverse Optimization (RMV-IO) portfolio. These two approaches are motivated by ideas from arbitrage pricing theory and volatility uncertainty. Using numerical simulation and historical backtesting, we show that both methods often demonstrate a better risk-reward tradeoff than their BL counterparts and are more robust to incorrect investor views. PMID:25382873
Inverse Optimization: A New Perspective on the Black-Litterman Model
Bertsimas, Dimitris; Gupta, Vishal; Paschalidis, Ioannis Ch.
2014-01-01
The Black-Litterman (BL) model is a widely used asset allocation model in the financial industry. In this paper, we provide a new perspective. The key insight is to replace the statistical framework in the original approach with ideas from inverse optimization. This insight allows us to significantly expand the scope and applicability of the BL model. We provide a richer formulation that, unlike the original model, is flexible enough to incorporate investor information on volatility and market dynamics. Equally importantly, our approach allows us to move beyond the traditional mean-variance paradigm of the original model and construct “BL”-type estimators for more general notions of risk such as coherent risk measures. Computationally, we introduce and study two new “BL”-type estimators and their corresponding portfolios: a Mean Variance Inverse Optimization (MV-IO) portfolio and a Robust Mean Variance Inverse Optimization (RMV-IO) portfolio. These two approaches are motivated by ideas from arbitrage pricing theory and volatility uncertainty. Using numerical simulation and historical backtesting, we show that both methods often demonstrate a better risk-reward tradeoff than their BL counterparts and are more robust to incorrect investor views. PMID:25382873
NASA Astrophysics Data System (ADS)
Morton de Lachapelle, David; Challet, Damien
2010-07-01
Despite the availability of very detailed data on financial markets, agent-based modeling is hindered by the lack of information about real trader behavior. This makes it impossible to validate agent-based models, which are thus reverse-engineering attempts. This work is a contribution towards building a set of stylized facts about the traders themselves. Using the client database of Swissquote Bank SA, the largest online Swiss broker, we find empirical relationships between turnover, account values and the number of assets in which a trader is invested. A theory based on simple mean-variance portfolio optimization that crucially includes variable transaction costs is able to reproduce faithfully the observed behaviors. We finally argue that our results bring to light the collective ability of a population to construct a mean-variance portfolio that takes into account the structure of transaction costs.
Robust Portfolio Optimization Using Pseudodistances
2015-01-01
The presence of outliers in financial asset returns is a frequently occurring phenomenon which may lead to unreliable mean-variance optimized portfolios. This fact is due to the unbounded influence that outliers can have on the mean returns and covariance estimators that are inputs in the optimization procedure. In this paper we present robust estimators of mean and covariance matrix obtained by minimizing an empirical version of a pseudodistance between the assumed model and the true model underlying the data. We prove and discuss theoretical properties of these estimators, such as affine equivariance, B-robustness, asymptotic normality and asymptotic relative efficiency. These estimators can be easily used in place of the classical estimators, thereby providing robust optimized portfolios. A Monte Carlo simulation study and applications to real data show the advantages of the proposed approach. We study both in-sample and out-of-sample performance of the proposed robust portfolios comparing them with some other portfolios known in literature. PMID:26468948
Dynamics of mean-variance-skewness of cumulative crop yield impact temporal yield variance
Technology Transfer Automated Retrieval System (TEKTRAN)
Production risk associated with cropping systems influences farmers’ decisions to adopt a new management practice or a production system. Cumulative yield (CY), temporal yield variance (TYV) and coefficient of variation (CV) were used to assess the risk associated with adopting combinations of new m...
Kuo, Ting-chun; Mandal, Sandip; Yamauchi, Atsushi; Hsieh, Chih-hao
2016-05-01
Fishing is expected to alter the spatial heterogeneity of fishes. As an effective index to quantify spatial heterogeneity, the exponent b in Taylor's power law (V = aMb) measures how spatial variance (V) varies with changes in mean abundance (M) of a population, with larger b indicating higher spatial aggregation potential (i.e., more heterogeneity). Theory predicts b is related with life history traits, but empirical evidence is lacking. Using 50-yr spatiotemporal data from the California Current Ecosystem, we examined fishing and life history effects on Taylor's exponent by comparing spatial distributions of exploited and unexploited fishes living in the same environment. We found that unexploited species with smaller size and generation time exhibit larger b, supporting theoretical prediction. In contrast, this relationship in exploited species is much weaker, as the exponents of large exploited species were higher than unexploited species with similar traits. Our results suggest that fishing may increase spatial aggregation potential of a species, likely through degrading their size/age structure. Results of moving-window cross-correlation analyses on b vs. age structure indices (mean age and age evenness) for some exploited species corroborate our findings. Furthermore, through linking our findings to other fundamental ecological patterns (occupancy-abundance and size-abundance relationships), we provide theoretical arguments for the usefulness of monitoring the exponent b for management purposes. We propose that age/size-truncated species might have lower recovery rate in spatial occupancy, and the spatial variance-mass relationship of a species might be non-linear. Our findings provide theoretical basis explaining why fishery management strategy should be concerned with changes to the age and spatial structure of exploited fishes. PMID:27349101
Optimal Solar PV Arrays Integration for Distributed Generation
Omitaomu, Olufemi A; Li, Xueping
2012-01-01
Solar photovoltaic (PV) systems hold great potential for distributed energy generation by installing PV panels on rooftops of residential and commercial buildings. Yet challenges arise along with the variability and non-dispatchability of the PV systems that affect the stability of the grid and the economics of the PV system. This paper investigates the integration of PV arrays for distributed generation applications by identifying a combination of buildings that will maximize solar energy output and minimize system variability. Particularly, we propose mean-variance optimization models to choose suitable rooftops for PV integration based on Markowitz mean-variance portfolio selection model. We further introduce quantity and cardinality constraints to result in a mixed integer quadratic programming problem. Case studies based on real data are presented. An efficient frontier is obtained for sample data that allows decision makers to choose a desired solar energy generation level with a comfortable variability tolerance level. Sensitivity analysis is conducted to show the tradeoffs between solar PV energy generation potential and variability.
Optimal trading strategies—a time series approach
NASA Astrophysics Data System (ADS)
Bebbington, Peter A.; Kühn, Reimer
2016-05-01
Motivated by recent advances in the spectral theory of auto-covariance matrices, we are led to revisit a reformulation of Markowitz’ mean-variance portfolio optimization approach in the time domain. In its simplest incarnation it applies to a single traded asset and allows an optimal trading strategy to be found which—for a given return—is minimally exposed to market price fluctuations. The model is initially investigated for a range of synthetic price processes, taken to be either second order stationary, or to exhibit second order stationary increments. Attention is paid to consequences of estimating auto-covariance matrices from small finite samples, and auto-covariance matrix cleaning strategies to mitigate against these are investigated. Finally we apply our framework to real world data.
NASA Astrophysics Data System (ADS)
Sun, Xuelian; Liu, Zixian
2016-02-01
In this paper, a new estimator of correlation matrix is proposed, which is composed of the detrended cross-correlation coefficients (DCCA coefficients), to improve portfolio optimization. In contrast to Pearson's correlation coefficients (PCC), DCCA coefficients acquired by the detrended cross-correlation analysis (DCCA) method can describe the nonlinear correlation between assets, and can be decomposed in different time scales. These properties of DCCA make it possible to improve the investment effect and more valuable to investigate the scale behaviors of portfolios. The minimum variance portfolio (MVP) model and the Mean-Variance (MV) model are used to evaluate the effectiveness of this improvement. Stability analysis shows the effect of two kinds of correlation matrices on the estimation error of portfolio weights. The observed scale behaviors are significant to risk management and could be used to optimize the portfolio selection.
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.
Zhu, Hongchun; Cai, Lijie; Liu, Haiying; Huang, Wei
2016-01-01
Multi-scale image segmentation and the selection of optimal segmentation parameters are the key processes in the object-oriented information extraction of high-resolution remote sensing images. The accuracy of remote sensing special subject information depends on this extraction. On the basis of WorldView-2 high-resolution data, the optimal segmentation parameters methodof object-oriented image segmentation and high-resolution image information extraction, the following processes were conducted in this study. Firstly, the best combination of the bands and weights was determined for the information extraction of high-resolution remote sensing image. An improved weighted mean-variance method was proposed andused to calculatethe optimal segmentation scale. Thereafter, the best shape factor parameter and compact factor parameters were computed with the use of the control variables and the combination of the heterogeneity and homogeneity indexes. Different types of image segmentation parameters were obtained according to the surface features. The high-resolution remote sensing images were multi-scale segmented with the optimal segmentation parameters. Ahierarchical network structure was established by setting the information extraction rules to achieve object-oriented information extraction. This study presents an effective and practical method that can explain expert input judgment by reproducible quantitative measurements. Furthermore the results of this procedure may be incorporated into a classification scheme. PMID:27362762
Zhu, Hongchun; Cai, Lijie; Liu, Haiying; Huang, Wei
2016-01-01
Multi-scale image segmentation and the selection of optimal segmentation parameters are the key processes in the object-oriented information extraction of high-resolution remote sensing images. The accuracy of remote sensing special subject information depends on this extraction. On the basis of WorldView-2 high-resolution data, the optimal segmentation parameters methodof object-oriented image segmentation and high-resolution image information extraction, the following processes were conducted in this study. Firstly, the best combination of the bands and weights was determined for the information extraction of high-resolution remote sensing image. An improved weighted mean-variance method was proposed andused to calculatethe optimal segmentation scale. Thereafter, the best shape factor parameter and compact factor parameters were computed with the use of the control variables and the combination of the heterogeneity and homogeneity indexes. Different types of image segmentation parameters were obtained according to the surface features. The high-resolution remote sensing images were multi-scale segmented with the optimal segmentation parameters. Ahierarchical network structure was established by setting the information extraction rules to achieve object-oriented information extraction. This study presents an effective and practical method that can explain expert input judgment by reproducible quantitative measurements. Furthermore the results of this procedure may be incorporated into a classification scheme. PMID:27362762
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
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.
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
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.
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.
[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.
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
RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks
Balasundaram, Balabhaskar; Butenko, Sergiy; Boginski, Vladimir; Uryasev, Stan
2013-12-25
to capture uncertainty and risk using appropriate probabilistic, statistical and optimization concepts. The main difficulty arising in addressing these issues is the dramatic increase in the computational complexity of the resulting optimization problems. This project studied novel models and methodologies for risk-averse network optimization- specifically, network design, network flows and cluster detection problems under uncertainty. The approach taken was to incorporate a quantitative risk measure known as conditional value-at-risk that is widely used in financial applications. This approach presents a viable alternate modeling and optimization framework to chance-constrained optimization and mean-variance optimization, one that also facilitates the detection of risk-averse solutions.
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
Energy Science and Technology Software Center (ESTSC)
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
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.
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.
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.
Energy Science and Technology Software Center (ESTSC)
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
Energy Science and Technology Software Center (ESTSC)
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
Energy Science and Technology Software Center (ESTSC)
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
Energy Science and Technology Software Center (ESTSC)
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
Energy Science and Technology Software Center (ESTSC)
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
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
Energy Science and Technology Software Center (ESTSC)
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
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
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.
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.
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
Energy Science and Technology Software Center (ESTSC)
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.
An optimal repartitioning decision policy
NASA Technical Reports Server (NTRS)
Nicol, D. M.; Reynolds, P. F., Jr.
1986-01-01
A central problem to parallel processing is the determination of an effective partitioning of workload to processors. The effectiveness of any given partition is dependent on the stochastic nature of the workload. The problem of determining when and if the stochastic behavior of the workload has changed enough to warrant the calculation of a new partition is treated. The problem is modeled as a Markov decision process, and an optimal decision policy is derived. Quantification of this policy is usually intractable. A heuristic policy which performs nearly optimally is investigated empirically. The results suggest that the detection of change is the predominant issue in this problem.
Optimal Retirement with Increasing Longevity*
Bloom, David E.; Canning, David; Moore, Michael
2014-01-01
We develop an optimizing life-cycle model of retirement with perfect capital markets. We show that longer healthy life expectancy usually leads to later retirement, but with an elasticity less than unity. We calibrate our model using data from the US and find that, over the last century, the effect of rising incomes, which promote early retirement, has dominated the effect of rising lifespans. Our model predicts continuing declines in the optimal retirement age, despite rising life expectancy, provided the rate of real wage growth remains as high as in the last century. PMID:24954970
Combinatorial optimization with Boolean constraints
Hulme, B.L.; Worrell, R.B.
1983-02-01
This report shows how Boolean algebraic formula manipulation can be used to solve certain kinds of optimization problems. If the problem can be formulated in terms of 0 to 1 variables and if the feasible solutions can be described by a Boolean equation, then the method of this report can be used. The method generates feasible solutions algebraically as terms of a disjunctive normal form of a Boolean function. Many small sample problems are solved to illustrate the method and the practical situations in which these optimization problems arise.
Thermodynamic Metrics and Optimal Paths
Sivak, David; Crooks, Gavin
2012-05-08
A fundamental problem in modern thermodynamics is how a molecular-scale machine performs useful work, while operating away from thermal equilibrium without excessive dissipation. To this end, we derive a friction tensor that induces a Riemannian manifold on the space of thermodynamic states. Within the linear-response regime, this metric structure controls the dissipation of finite-time transformations, and bestows optimal protocols with many useful properties. We discuss the connection to the existing thermodynamic length formalism, and demonstrate the utility of this metric by solving for optimal control parameter protocols in a simple nonequilibrium model.
Distributed optimization system and method
Hurtado, John E.; Dohrmann, Clark R.; Robinett, III, Rush D.
2003-06-10
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.
Optimal shapes for self-propelled swimmers
NASA Astrophysics Data System (ADS)
Koumoutsakos, Petros; van Rees, Wim; Gazzola, Mattia
2011-11-01
We optimize swimming shapes of three-dimensional self-propelled swimmers by combining the CMA- Evolution Strategy with a remeshed vortex method. We analyze the robustness of optimal shapes and discuss the near wake vortex dynamics for optimal speed and efficiency at Re=550. We also report preliminary results of optimal shapes and arrangements for multiple coordinated swimmers.
Enhancing Polyhedral Relaxations for Global Optimization
ERIC Educational Resources Information Center
Bao, Xiaowei
2009-01-01
During the last decade, global optimization has attracted a lot of attention due to the increased practical need for obtaining global solutions and the success in solving many global optimization problems that were previously considered intractable. In general, the central question of global optimization is to find an optimal solution to a given…
Optimal control in a macroeconomic problem
NASA Astrophysics Data System (ADS)
Bulgakov, V. K.; Shatov, G. L.
2007-08-01
The Pontryagin maximum principle is used to develop an original algorithm for finding an optimal control in a macroeconomic problem. Numerical results are presented for the optimal control and optimal trajectory of the development of a regional economic system. For an optimal control satisfying a certain constraint, an invariant of a macroeconomic system is derived.
Research on optimization-based design
NASA Technical Reports Server (NTRS)
Balling, R. J.; Parkinson, A. R.; Free, J. C.
1989-01-01
Research on optimization-based design is discussed. Illustrative examples are given for cases involving continuous optimization with discrete variables and optimization with tolerances. Approximation of computationally expensive and noisy functions, electromechanical actuator/control system design using decomposition and application of knowledge-based systems and optimization for the design of a valve anti-cavitation device are among the topics covered.
Modular optimization code package: MOZAIK
NASA Astrophysics Data System (ADS)
Bekar, Kursat B.
This dissertation addresses the development of a modular optimization code package, MOZAIK, for geometric shape optimization problems in nuclear engineering applications. MOZAIK's first mission, determining the optimal shape of the D2O moderator tank for the current and new beam tube configurations for the Penn State Breazeale Reactor's (PSBR) beam port facility, is used to demonstrate its capabilities and test its performance. MOZAIK was designed as a modular optimization sequence including three primary independent modules: the initializer, the physics and the optimizer, each having a specific task. By using fixed interface blocks among the modules, the code attains its two most important characteristics: generic form and modularity. The benefit of this modular structure is that the contents of the modules can be switched depending on the requirements of accuracy, computational efficiency, or compatibility with the other modules. Oak Ridge National Laboratory's discrete ordinates transport code TORT was selected as the transport solver in the physics module of MOZAIK, and two different optimizers, Min-max and Genetic Algorithms (GA), were implemented in the optimizer module of the code package. A distributed memory parallelism was also applied to MOZAIK via MPI (Message Passing Interface) to execute the physics module concurrently on a number of processors for various states in the same search. Moreover, dynamic scheduling was enabled to enhance load balance among the processors while running MOZAIK's physics module thus improving the parallel speedup and efficiency. In this way, the total computation time consumed by the physics module is reduced by a factor close to M, where M is the number of processors. This capability also encourages the use of MOZAIK for shape optimization problems in nuclear applications because many traditional codes related to radiation transport do not have parallel execution capability. A set of computational models based on the
Neurodynamic Optimization and Its Applications in Robotics
NASA Astrophysics Data System (ADS)
Jun, Wang
Optimization problems arise in a wide variety of scientific and engineering applications. It is computationally challenging when optimization procedures have to be performed in real time to optimize the performance of dynamical systems. For such applications, classical optimization techniques may not be competent due to the problem dimensionality and stringent requirement on computational time. One very promising approach to dynamic optimization is to apply artificial neural networks.
Optimization of space manufacturing systems
NASA Technical Reports Server (NTRS)
Akin, D. L.
1979-01-01
Four separate analyses are detailed: transportation to low earth orbit, orbit-to-orbit optimization, parametric analysis of SPS logistics based on earth and lunar source locations, and an overall program option optimization implemented with linear programming. It is found that smaller vehicles are favored for earth launch, with the current Space Shuttle being right at optimum payload size. Fully reusable launch vehicles represent a savings of 50% over the Space Shuttle; increased reliability with less maintenance could further double the savings. An optimization of orbit-to-orbit propulsion systems using lunar oxygen for propellants shows that ion propulsion is preferable by a 3:1 cost margin over a mass driver reaction engine at optimum values; however, ion engines cannot yet operate in the lower exhaust velocity range where the optimum lies, and total program costs between the two systems are ambiguous. Heavier payloads favor the use of a MDRE. A parametric model of a space manufacturing facility is proposed, and used to analyze recurring costs, total costs, and net present value discounted cash flows. Parameters studied include productivity, effects of discounting, materials source tradeoffs, economic viability of closed-cycle habitats, and effects of varying degrees of nonterrestrial SPS materials needed from earth. Finally, candidate optimal scenarios are chosen, and implemented in a linear program with external constraints in order to arrive at an optimum blend of SPS production strategies in order to maximize returns.
Optimal control of native predators
Martin, Julien; O'Connell, Allan F.; Kendall, William L.; Runge, Michael C.; Simons, Theodore R.; Waldstein, Arielle H.; Schulte, Shiloh A.; Converse, Sarah J.; Smith, Graham W.; Pinion, Timothy; Rikard, Michael; Zipkin, Elise F.
2010-01-01
We apply decision theory in a structured decision-making framework to evaluate how control of raccoons (Procyon lotor), a native predator, can promote the conservation of a declining population of American Oystercatchers (Haematopus palliatus) on the Outer Banks of North Carolina. Our management objective was to maintain Oystercatcher productivity above a level deemed necessary for population recovery while minimizing raccoon removal. We evaluated several scenarios including no raccoon removal, and applied an adaptive optimization algorithm to account for parameter uncertainty. We show how adaptive optimization can be used to account for uncertainties about how raccoon control may affect Oystercatcher productivity. Adaptive management can reduce this type of uncertainty and is particularly well suited for addressing controversial management issues such as native predator control. The case study also offers several insights that may be relevant to the optimal control of other native predators. First, we found that stage-specific removal policies (e.g., yearling versus adult raccoon removals) were most efficient if the reproductive values among stage classes were very different. Second, we found that the optimal control of raccoons would result in higher Oystercatcher productivity than the minimum levels recommended for this species. Third, we found that removing more raccoons initially minimized the total number of removals necessary to meet long term management objectives. Finally, if for logistical reasons managers cannot sustain a removal program by removing a minimum number of raccoons annually, managers may run the risk of creating an ecological trap for Oystercatchers.
Unifying process control and optimization
Makansi, J.
2005-09-01
About 40% of US generation is now subject to wholesale competition. To intelligently bid into these new markets, real-time prices must be aligned with real-time costs. It is time to integrate the many advanced applications, sensors, and analyzers used for control, automation, and optimization into a system that reflects process and financial objectives. The paper reports several demonstration projects in the USA revealing what is being done in the area of advanced process optimization (by Alliant Energy, American Electric Power, PacifiCorp, Detroit Edison and Tennessee Valley Authority). In addition to these projects US DOE's NETL has funded the plant environment and cost optimization system, PECOS which combines physical models, neural networks and fuzzy logic control to provide operators with least cost setpoints for controllable variables. At Dynegy Inc's Baldwin station in Illinois the DOE is subsidizing a project where real time, closed-loop IT systems will optimize combustion, soot-blowing and SCR performance as well as unit thermal performance and plant economic performance. Commercial products such as Babcock and Wilcox's Flame Doctor, continuous emissions monitoring systems and various real-time predictive monitoring systems are also available. 4 figs.
Optimal deployment of solar index
Croucher, Matt
2010-11-15
There is a growing trend, generally caused by state-specific renewable portfolio standards, to increase the importance of renewable electricity generation within generation portfolios. While RPS assist with determining the composition of generation they do not, for the most part, dictate the location of generation. Using data from various public sources, the authors create an optimal index for solar deployment. (author)
Optimizing Learning Through Effective Management.
ERIC Educational Resources Information Center
Mills, Earl S.; Wood, Duane R.
A model of an instructional program which uses principles of effective management to optimize learning for adult learners is described. The model is a result of the authors' work with the Institute for Personal and Career Development which is responsible for the external degree program of Central Michigan University. Most adult learners have…
Optimizing Requirements Decisions with KEYS
NASA Technical Reports Server (NTRS)
Jalali, Omid; Menzies, Tim; Feather, Martin
2008-01-01
Recent work with NASA's Jet Propulsion Laboratory has allowed for external access to five of JPL's real-world requirements models, anonymized to conceal proprietary information, but retaining their computational nature. Experimentation with these models, reported herein, demonstrates a dramatic speedup in the computations performed on them. These models have a well defined goal: select mitigations that retire risks which, in turn, increases the number of attainable requirements. Such a non-linear optimization is a well-studied problem. However identification of not only (a) the optimal solution(s) but also (b) the key factors leading to them is less well studied. Our technique, called KEYS, shows a rapid way of simultaneously identifying the solutions and their key factors. KEYS improves on prior work by several orders of magnitude. Prior experiments with simulated annealing or treatment learning took tens of minutes to hours to terminate. KEYS runs much faster than that; e.g for one model, KEYS ran 13,000 times faster than treatment learning (40 minutes versus 0.18 seconds). Processing these JPL models is a non-linear optimization problem: the fewest mitigations must be selected while achieving the most requirements. Non-linear optimization is a well studied problem. With this paper, we challenge other members of the PROMISE community to improve on our results with other techniques.
Calorimeter Optimization for Jet Identification
Bower, G.
2004-10-11
During LCWS 1999 at Sitges, Spain, we presented a set of discriminators for reconstructing jets in high energy lepton colliders. We have extended that study by adding new event types, by adding new discriminators, and by using a neural net rather than cuts to identify jets. We apply these techniques to detector simulations to begin a study of calorimeter optimization.
Wind Electrolysis: Hydrogen Cost Optimization
Saur, G.; Ramsden, T.
2011-05-01
This report describes a hydrogen production cost analysis of a collection of optimized central wind based water electrolysis production facilities. The basic modeled wind electrolysis facility includes a number of low temperature electrolyzers and a co-located wind farm encompassing a number of 3MW wind turbines that provide electricity for the electrolyzer units.
Shape optimization of corrugated airfoils
NASA Astrophysics Data System (ADS)
Jain, Sambhav; Bhatt, Varun Dhananjay; Mittal, Sanjay
2015-12-01
The effect of corrugations on the aerodynamic performance of a Mueller C4 airfoil, placed at a 5° angle of attack and Re=10{,}000, is investigated. A stabilized finite element method is employed to solve the incompressible flow equations in two dimensions. A novel parameterization scheme is proposed that enables representation of corrugations on the surface of the airfoil, and their spontaneous appearance in the shape optimization loop, if indeed they improve aerodynamic performance. Computations are carried out for different location and number of corrugations, while holding their height fixed. The first corrugation causes an increase in lift and drag. Each of the later corrugations leads to a reduction in drag. Shape optimization of the Mueller C4 airfoil is carried out using various objective functions and optimization strategies, based on controlling airfoil thickness and camber. One of the optimal shapes leads to 50 % increase in lift coefficient and 23 % increase in aerodynamic efficiency compared to the Mueller C4 airfoil.
Acoustic design by topology optimization
NASA Astrophysics Data System (ADS)
Dühring, Maria B.; Jensen, Jakob S.; Sigmund, Ole
2008-11-01
To bring down noise levels in human surroundings is an important issue and a method to reduce noise by means of topology optimization is presented here. The acoustic field is modeled by Helmholtz equation and the topology optimization method is based on continuous material interpolation functions in the density and bulk modulus. The objective function is the squared sound pressure amplitude. First, room acoustic problems are considered and it is shown that the sound level can be reduced in a certain part of the room by an optimized distribution of reflecting material in a design domain along the ceiling or by distribution of absorbing and reflecting material along the walls. We obtain well defined optimized designs for a single frequency or a frequency interval for both 2D and 3D problems when considering low frequencies. Second, it is shown that the method can be applied to design outdoor sound barriers in order to reduce the sound level in the shadow zone behind the barrier. A reduction of up to 10 dB for a single barrier and almost 30 dB when using two barriers are achieved compared to utilizing conventional sound barriers.
Optimization of Actuating Origami Networks
NASA Astrophysics Data System (ADS)
Buskohl, Philip; Fuchi, Kazuko; Bazzan, Giorgio; Joo, James; Gregory, Reich; Vaia, Richard
2015-03-01
Origami structures morph between 2D and 3D conformations along predetermined fold lines that efficiently program the form, function and mobility of the structure. By leveraging design concepts from action origami, a subset of origami art focused on kinematic mechanisms, reversible folding patterns for applications such as solar array packaging, tunable antennae, and deployable sensing platforms may be designed. However, the enormity of the design space and the need to identify the requisite actuation forces within the structure places a severe limitation on design strategies based on intuition and geometry alone. The present work proposes a topology optimization method, using truss and frame element analysis, to distribute foldline mechanical properties within a reference crease pattern. Known actuating patterns are placed within a reference grid and the optimizer adjusts the fold stiffness of the network to optimally connect them. Design objectives may include a target motion, stress level, or mechanical energy distribution. Results include the validation of known action origami structures and their optimal connectivity within a larger network. This design suite offers an important step toward systematic incorporation of origami design concepts into new, novel and reconfigurable engineering devices. This research is supported under the Air Force Office of Scientific Research (AFOSR) funding, LRIR 13RQ02COR.
Optimal Concentrations in Transport Networks
NASA Astrophysics Data System (ADS)
Jensen, Kaare; Savage, Jessica; Kim, Wonjung; Bush, John; Holbrook, N. Michele
2013-03-01
Biological and man-made systems rely on effective transport networks for distribution of material and energy. Mass flow in these networks is determined by the flow rate and the concentration of material. While the most concentrated solution offers the greatest potential for mass flow, impedance grows with concentration and thus makes it the most difficult to transport. The concentration at which mass flow is optimal depends on specific physical and physiological properties of the system. We derive a simple model which is able to predict optimal concentrations observed in blood flows, sugar transport in plants, and nectar feeding animals. Our model predicts that the viscosity at the optimal concentration μopt =2nμ0 is an integer power of two times the viscosity of the pure carrier medium μ0. We show how the observed powers 1 <= n <= 6 agree well with theory and discuss how n depends on biological constraints imposed on the transport process. The model provides a universal framework for studying flows impeded by concentration and provides hints of how to optimize engineered flow systems, such as congestion in traffic flows.
Optimal Foraging in Semantic Memory
ERIC Educational Resources Information Center
Hills, Thomas T.; Jones, Michael N.; Todd, Peter M.
2012-01-01
Do humans search in memory using dynamic local-to-global search strategies similar to those that animals use to forage between patches in space? If so, do their dynamic memory search policies correspond to optimal foraging strategies seen for spatial foraging? Results from a number of fields suggest these possibilities, including the shared…
Singularities in Optimal Structural Design
NASA Technical Reports Server (NTRS)
Patnaik, S. N.; Guptill, J. D.; Berke, L.
1992-01-01
Singularity conditions that arise during structural optimization can seriously degrade the performance of the optimizer. The singularities are intrinsic to the formulation of the structural optimization problem and are not associated with the method of analysis. Certain conditions that give rise to singularities have been identified in earlier papers, encompassing the entire structure. Further examination revealed more complex sets of conditions in which singularities occur. Some of these singularities are local in nature, being associated with only a segment of the structure. Moreover, the likelihood that one of these local singularities may arise during an optimization procedure can be much greater than that of the global singularity identified earlier. Examples are provided of these additional forms of singularities. A framework is also given in which these singularities can be recognized. In particular, the singularities can be identified by examination of the stress displacement relations along with the compatibility conditions and/or the displacement stress relations derived in the integrated force method of structural analysis.
Singularities in optimal structural design
NASA Technical Reports Server (NTRS)
Patnaik, S. N.; Guptill, J. D.; Berke, L.
1992-01-01
Singularity conditions that arise during structural optimization can seriously degrade the performance of the optimizer. The singularities are intrinsic to the formulation of the structural optimization problem and are not associated with the method of analysis. Certain conditions that give rise to singularities have been identified in earlier papers, encompassing the entire structure. Further examination revealed more complex sets of conditions in which singularities occur. Some of these singularities are local in nature, being associated with only a segment of the structure. Moreover, the likelihood that one of these local singularities may arise during an optimization procedure can be much greater than that of the global singularity identified earlier. Examples are provided of these additional forms of singularities. A framework is also given in which these singularities can be recognized. In particular, the singularities can be identified by examination of the stress displacement relations along with the compatibility conditions and/or the displacement stress relations derived in the integrated force method of structural analysis.
Propeller design by numerical optimization
NASA Technical Reports Server (NTRS)
Mendoza, J. P.
1977-01-01
A computer program designed to optimize propeller characteristics was developed by combining two main programs: the first is the optimization program based on the gradient algorithm; the second is based on a propeller blade element theory and uses an aerodynamics subprogram to approximate the lift and drag characteristics of the NACA 16-series airfoil section. To evaluate the propeller program alone (with its aerodynamics subprogram), propeller characteristics were computed and compared to those from wind tunnel investigations conducted on three different NACA propellers. Although the thrust and power coefficients which were computed using the blade element theory were generally higher than the experimental results for two of the three propellers, the corresponding efficiencies showed good agreement for all three propellers. The propeller optimization program was then used to study the NACA 4-(5)(08)-03 propeller at various Mach numbers from 0.175 to 0.60. Improvements in propeller efficiency and thrust were obtained through the use of the propeller optimization program.
Soliton molecules: Experiments and optimization
Mitschke, Fedor
2014-10-06
Stable compound states of several fiber-optic solitons have recently been demonstrated. In the first experiment their shape was approximated, for want of a better description, by a sum of Gaussians. Here we discuss an optimization strategy which helps to find preferable shapes so that the generation of radiative background is reduced.
Quantum Annealing for Constrained Optimization
NASA Astrophysics Data System (ADS)
Hen, Itay; Spedalieri, Federico M.
2016-03-01
Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealers that promise to solve certain combinatorial optimization problems of practical relevance faster than their classical analogues. The applicability of such devices for many theoretical and real-world optimization problems, which are often constrained, is severely limited by the sparse, rigid layout of the devices' quantum bits. Traditionally, constraints are addressed by the addition of penalty terms to the Hamiltonian of the problem, which, in turn, requires prohibitively increasing physical resources while also restricting the dynamical range of the interactions. Here, we propose a method for encoding constrained optimization problems on quantum annealers that eliminates the need for penalty terms and thereby reduces the number of required couplers and removes the need for minor embedding, greatly reducing the number of required physical qubits. We argue the advantages of the proposed technique and illustrate its effectiveness. We conclude by discussing the experimental feasibility of the suggested method as well as its potential to appreciably reduce the resource requirements for implementing optimization problems on quantum annealers and its significance in the field of quantum computing.
Quantum Annealing for Constrained Optimization
NASA Astrophysics Data System (ADS)
Hen, Itay; Spedalieri, Federico
Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealers that could potentially solve certain quadratic unconstrained binary optimization problems faster than their classical analogues. The applicability of such devices for many theoretical and practical optimization problems, which are often constrained, is severely limited by the sparse, rigid layout of the devices' quantum bits. Traditionally, constraints are addressed by the addition of penalty terms to the Hamiltonian of the problem, which in turn requires prohibitively increasing physical resources while also restricting the dynamical range of the interactions. Here we propose a method for encoding constrained optimization problems on quantum annealers that eliminates the need for penalty terms and thereby removes many of the obstacles associated with the implementation of these. We argue the advantages of the proposed technique and illustrate its effectiveness. We then conclude by discussing the experimental feasibility of the suggested method as well as its potential to boost the encodability of other optimization problems.
Critical Pedagogy for Transformative Optimism
ERIC Educational Resources Information Center
Mayo, Peter
2006-01-01
This essay critically highlights the main features of a study that attaches importance to the concepts of time and optimism and their effects on the achievement and goals of high and low achievers in a North American and a Brazilian context. The focus on the time factor that serves as a leitmotif throughout the study gives this work its…
Multilevel algorithms for nonlinear optimization
NASA Technical Reports Server (NTRS)
Alexandrov, Natalia; Dennis, J. E., Jr.
1994-01-01
Multidisciplinary design optimization (MDO) gives rise to nonlinear optimization problems characterized by a large number of constraints that naturally occur in blocks. We propose a class of multilevel optimization methods motivated by the structure and number of constraints and by the expense of the derivative computations for MDO. The algorithms are an extension to the nonlinear programming problem of the successful class of local Brown-Brent algorithms for nonlinear equations. Our extensions allow the user to partition constraints into arbitrary blocks to fit the application, and they separately process each block and the objective function, restricted to certain subspaces. The methods use trust regions as a globalization strategy, and they have been shown to be globally convergent under reasonable assumptions. The multilevel algorithms can be applied to all classes of MDO formulations. Multilevel algorithms for solving nonlinear systems of equations are a special case of the multilevel optimization methods. In this case, they can be viewed as a trust-region globalization of the Brown-Brent class.
Shape Optimization of Swimming Sheets
Wilkening, J.; Hosoi, A.E.
2005-03-01
The swimming behavior of a flexible sheet which moves by propagating deformation waves along its body was first studied by G. I. Taylor in 1951. In addition to being of theoretical interest, this problem serves as a useful model of the locomotion of gastropods and various micro-organisms. Although the mechanics of swimming via wave propagation has been studied extensively, relatively little work has been done to define or describe optimal swimming by this mechanism.We carry out this objective for a sheet that is separated from a rigid substrate by a thin film of viscous Newtonian fluid. Using a lubrication approximation to model the dynamics, we derive the relevant Euler-Lagrange equations to optimize swimming speed and efficiency. The optimization equations are solved numerically using two different schemes: a limited memory BFGS method that uses cubic splines to represent the wave profile, and a multi-shooting Runge-Kutta approach that uses the Levenberg-Marquardt method to vary the parameters of the equations until the constraints are satisfied. The former approach is less efficient but generalizes nicely to the non-lubrication setting. For each optimization problem we obtain a one parameter family of solutions that becomes singular in a self-similar fashion as the parameter approaches a critical value. We explore the validity of the lubrication approximation near this singular limit by monitoring higher order corrections to the zeroth order theory and by comparing the results with finite element solutions of the full Stokes equations.
Optimization in Bilingual Language Use
ERIC Educational Resources Information Center
Bhatt, Rakesh M.
2013-01-01
Pieter Muysken's keynote paper, "Language contact outcomes as a result of bilingual optimization strategies", undertakes an ambitious project to theoretically unify different empirical outcomes of language contact, for instance, SLA, pidgins and Creoles, and code-switching. Muysken has dedicated a life-time to researching, rather…
Pattern formations and optimal packing.
Mityushev, Vladimir
2016-04-01
Patterns of different symmetries may arise after solution to reaction-diffusion equations. Hexagonal arrays, layers and their perturbations are observed in different models after numerical solution to the corresponding initial-boundary value problems. We demonstrate an intimate connection between pattern formations and optimal random packing on the plane. The main study is based on the following two points. First, the diffusive flux in reaction-diffusion systems is approximated by piecewise linear functions in the framework of structural approximations. This leads to a discrete network approximation of the considered continuous problem. Second, the discrete energy minimization yields optimal random packing of the domains (disks) in the representative cell. Therefore, the general problem of pattern formations based on the reaction-diffusion equations is reduced to the geometric problem of random packing. It is demonstrated that all random packings can be divided onto classes associated with classes of isomorphic graphs obtained from the Delaunay triangulation. The unique optimal solution is constructed in each class of the random packings. If the number of disks per representative cell is finite, the number of classes of isomorphic graphs, hence, the number of optimal packings is also finite. PMID:26852668
Robust, Optimal Subsonic Airfoil Shapes
NASA Technical Reports Server (NTRS)
Rai, Man Mohan
2014-01-01
A method has been developed to create an airfoil robust enough to operate satisfactorily in different environments. This method determines a robust, optimal, subsonic airfoil shape, beginning with an arbitrary initial airfoil shape, and imposes the necessary constraints on the design. Also, this method is flexible and extendible to a larger class of requirements and changes in constraints imposed.
Multicriteria optimization informed VMAT planning
Chen, Huixiao; Craft, David L.; Gierga, David P.
2014-04-01
We developed a patient-specific volumetric-modulated arc therapy (VMAT) optimization procedure using dose-volume histogram (DVH) information from multicriteria optimization (MCO) of intensity-modulated radiotherapy (IMRT) plans. The study included 10 patients with prostate cancer undergoing standard fractionation treatment, 10 patients with prostate cancer undergoing hypofractionation treatment, and 5 patients with head/neck cancer. MCO-IMRT plans using 20 and 7 treatment fields were generated for each patient on the RayStation treatment planning system (clinical version 2.5, RaySearch Laboratories, Stockholm, Sweden). The resulting DVH of the 20-field MCO-IMRT plan for each patient was used as the reference DVH, and the extracted point values of the resulting DVH of the MCO-IMRT plan were used as objectives and constraints for VMAT optimization. Weights of objectives or constraints of VMAT optimization or both were further tuned to generate the best match with the reference DVH of the MCO-IMRT plan. The final optimal VMAT plan quality was evaluated by comparison with MCO-IMRT plans based on homogeneity index, conformity number of planning target volume, and organ at risk sparing. The influence of gantry spacing, arc number, and delivery time on VMAT plan quality for different tumor sites was also evaluated. The resulting VMAT plan quality essentially matched the 20-field MCO-IMRT plan but with a shorter delivery time and less monitor units. VMAT plan quality of head/neck cancer cases improved using dual arcs whereas prostate cases did not. VMAT plan quality was improved by fine gantry spacing of 2 for the head/neck cancer cases and the hypofractionation-treated prostate cancer cases but not for the standard fractionation–treated prostate cancer cases. MCO-informed VMAT optimization is a useful and valuable way to generate patient-specific optimal VMAT plans, though modification of the weights of objectives or constraints extracted from resulting DVH of MCO
Multicriteria optimization informed VMAT planning.
Chen, Huixiao; Craft, David L; Gierga, David P
2014-01-01
We developed a patient-specific volumetric-modulated arc therapy (VMAT) optimization procedure using dose-volume histogram (DVH) information from multicriteria optimization (MCO) of intensity-modulated radiotherapy (IMRT) plans. The study included 10 patients with prostate cancer undergoing standard fractionation treatment, 10 patients with prostate cancer undergoing hypofractionation treatment, and 5 patients with head/neck cancer. MCO-IMRT plans using 20 and 7 treatment fields were generated for each patient on the RayStation treatment planning system (clinical version 2.5, RaySearch Laboratories, Stockholm, Sweden). The resulting DVH of the 20-field MCO-IMRT plan for each patient was used as the reference DVH, and the extracted point values of the resulting DVH of the MCO-IMRT plan were used as objectives and constraints for VMAT optimization. Weights of objectives or constraints of VMAT optimization or both were further tuned to generate the best match with the reference DVH of the MCO-IMRT plan. The final optimal VMAT plan quality was evaluated by comparison with MCO-IMRT plans based on homogeneity index, conformity number of planning target volume, and organ at risk sparing. The influence of gantry spacing, arc number, and delivery time on VMAT plan quality for different tumor sites was also evaluated. The resulting VMAT plan quality essentially matched the 20-field MCO-IMRT plan but with a shorter delivery time and less monitor units. VMAT plan quality of head/neck cancer cases improved using dual arcs whereas prostate cases did not. VMAT plan quality was improved by fine gantry spacing of 2 for the head/neck cancer cases and the hypofractionation-treated prostate cancer cases but not for the standard fractionation-treated prostate cancer cases. MCO-informed VMAT optimization is a useful and valuable way to generate patient-specific optimal VMAT plans, though modification of the weights of objectives or constraints extracted from resulting DVH of MCO-IMRT or
Optimal control of hydroelectric facilities
NASA Astrophysics Data System (ADS)
Zhao, Guangzhi
This thesis considers a simple yet realistic model of pump-assisted hydroelectric facilities operating in a market with time-varying but deterministic power prices. Both deterministic and stochastic water inflows are considered. The fluid mechanical and engineering details of the facility are described by a model containing several parameters. We present a dynamic programming algorithm for optimizing either the total energy produced or the total cash generated by these plants. The algorithm allows us to give the optimal control strategy as a function of time and to see how this strategy, and the associated plant value, varies with water inflow and electricity price. We investigate various cases. For a single pumped storage facility experiencing deterministic power prices and water inflows, we investigate the varying behaviour for an oversimplified constant turbine- and pump-efficiency model with simple reservoir geometries. We then generalize this simple model to include more realistic turbine efficiencies, situations with more complicated reservoir geometry, and the introduction of dissipative switching costs between various control states. We find many results which reinforce our physical intuition about this complicated system as well as results which initially challenge, though later deepen, this intuition. One major lesson of this work is that the optimal control strategy does not differ much between two differing objectives of maximizing energy production and maximizing its cash value. We then turn our attention to the case of stochastic water inflows. We present a stochastic dynamic programming algorithm which can find an on-average optimal control in the face of this randomness. As the operator of a facility must be more cautious when inflows are random, the randomness destroys facility value. Following this insight we quantify exactly how much a perfect hydrological inflow forecast would be worth to a dam operator. In our final chapter we discuss the
Composite Particle Swarm Optimizer With Historical Memory for Function Optimization.
Li, Jie; Zhang, JunQi; Jiang, ChangJun; Zhou, MengChu
2015-10-01
Particle swarm optimization (PSO) algorithm is a population-based stochastic optimization technique. It is characterized by the collaborative search in which each particle is attracted toward the global best position (gbest) in the swarm and its own best position (pbest). However, all of particles' historical promising pbests in PSO are lost except their current pbests. In order to solve this problem, this paper proposes a novel composite PSO algorithm, called historical memory-based PSO (HMPSO), which uses an estimation of distribution algorithm to estimate and preserve the distribution information of particles' historical promising pbests. Each particle has three candidate positions, which are generated from the historical memory, particles' current pbests, and the swarm's gbest. Then the best candidate position is adopted. Experiments on 28 CEC2013 benchmark functions demonstrate the superiority of HMPSO over other algorithms. PMID:26390177
Optimization of multi-constrained structures based on optimality criteria
NASA Technical Reports Server (NTRS)
Rizzi, P.
1976-01-01
A weight-reduction algorithm is developed for the optimal design of structures subject to several multibehavioral inequality constraints. The structural weight is considered to depend linearly on the design variables. The algorithm incorporates a simple recursion formula derived from the Kuhn-Tucker necessary conditions for optimality, associated with a procedure to delete nonactive constraints based on the Gauss-Seidel iterative method for linear systems. A number of example problems is studied, including typical truss structures and simplified wings subject to static loads and with constraints imposed on stresses and displacements. For one of the latter structures, constraints on the fundamental natural frequency and flutter speed are also imposed. The results obtained show that the method is fast, efficient, and general when compared to other competing techniques. Extensions to the generality of the method to include equality constraints and nonlinear merit functions is discussed.
Optimism, pessimism, and gambling: the downside of optimism.
Gibson, Bryan; Sanbonmatsu, David M
2004-02-01
Three studies examined the relation between dispositional optimism and gambling. In Study 1, optimists were more likely than pessimists to have positive gambling expectations and report maintaining these expectations following losses. They also were more likely to indicate that winning money was a primary motivation for their gambling. Study 2 demonstrated that pessimists but not optimists reduce their betting and expectations after poor gaming performance. Study 3 replicated this effect using a more controlled experiment and showed that after losing, optimists report remembering more near wins than do pessimists. Thus, all three studies suggest that optimists, more than pessimists, maintain positive expectations and continue gambling after experiencing negative gaming outcomes. The authors suggest that despite optimism's many benefits, there are common situations in which the pessimistic tendency to disengage is beneficial. PMID:15030630
Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization
NASA Technical Reports Server (NTRS)
Birge, Brian
2013-01-01
The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.
Model test optimization using the virtual environment for test optimization
Klenke, S.E.; Reese, G.M.; Schoof, L.A.; Shierling, C.
1995-11-01
We present a software environment integrating analysis and test-based models to support optimal modal test design through a Virtual Environment for Test Optimization (VETO). The VETO assists analysis and test engineers to maximize the value of each modal test. It is particularly advantageous for structural dynamics model reconciliation applications. The VETO enables an engineer to interact with a finite element model of a test object to optimally place sensors and exciters and to investigate the selection of data acquisition parameters needed to conduct a complete modal survey. Additionally, the user can evaluate the use of different types of instrumentation such as filters, amplifiers and transducers for which models are available in the VETO. The dynamic response of most of the virtual instruments (including the device under test) are modeled in the state space domain. Design of modal excitation levels and appropriate test instrumentation are facilitated by the VETO`s ability to simulate such features as unmeasured external inputs, A/D quantization effects, and electronic noise. Measures of the quality of the experimental design, including the Modal Assurance Criterion, and the Normal Mode Indicator Function are available. The VETO also integrates tools such as Effective Independence and minamac to assist in selection of optimal sensor locations. The software is designed about three distinct modules: (1) a main controller and GUI written in C++, (2) a visualization model, taken from FEAVR, running under AVS, and (3) a state space model and time integration module built in SIMULINK. These modules are designed to run as separate processes on interconnected machines.
Modal test optimization using VETO (Virtual Environment for Test Optimization)
Klenke, S.E.; Reese, G.M.; Schoof, L.A.; Shierling, C.L.
1995-12-01
We present a software environment integrating analysis and test based models to support optimal modal test design through a Virtual Environment for Test Optimization (VETO). The VETO assists analysis and test engineers in maximizing the value of each modal test. It is particularly advantageous for structural dynamics model reconciliation applications. The VETO enables an engineer to interact with a finite element model of a test object to optimally place sensors and exciters and to investigate the selection of-data acquisition parameters needed to conduct a complete modal survey. Additionally, the user can evaluate the use of different types of instrumentation such as filters, amplifiers and transducers for which models are available in the VETO. The dynamic response of most of the virtual instruments (including the device under test) are modeled in the state space domain. Design of modal excitation levels and appropriate test instrumentation are facilitated by the VETO`s ability to simulate such features as unmeasured external inputs, A/D quantization effects, and electronic noise. Measures of the quality of the experimental design, including the Modal Assurance Criterion, and the Normal Mode indicator Function are available. The VETO also integrates tools such as Effective Independence and minamac to assist in selection of optimal sensor locations. The software is designed about three distinct modules: (1) a main controller and GUI written in C++, (2) a visualization model, taken from FEAVR, running under AVS, and (3) a state space model and time integration module, built in SIMULINK. These modules are designed to run as separate processes on interconnected machines. MATLAB`s external interface library is used to provide transparent, bidirectional communication between the controlling program and the computational engine where all the time integration is performed.
Modal test optimization using VETO (Virtual Environment for Test Optimization)
Klenke, S.E.; Reese, G.M.; Schoof, L.A.; Shierling, C.
1996-01-01
We present a software environment integrating analysis and test-based models to support optimal modal test design through a Virtual Environment for Test Optimization (VETO). A goal in developing this software tool is to provide test and analysis organizations with a capability of mathematically simulating the complete test environment in software. Derived models of test equipment, instrumentation and hardware can be combined within the VETO to provide the user with a unique analysis and visualization capability to evaluate new and existing test methods. The VETO assists analysis and test engineers in maximizing the value of each modal test. It is particularly advantageous for structural dynamics model reconciliation applications. The VETO enables an engineer to interact with a finite element model of a test object to optimally place sensors and exciters and to investigate the selection of data acquisition parameters needed to conduct a complete modal survey. Additionally, the user can evaluate the use of different types of instrumentation such as filters, amplifiers and transducers for which models are available in the VETO. The dynamic response of most of the virtual instruments (including the device under test) is modeled in the state space domain. Design of modal excitation levels and appropriate test instrumentation are facilitated by the VETO`s ability to simulate such features as unmeasured external inputs, A/D quantization effects, and electronic noise. Measures of the quality of the experimental design, including the Modal Assurance Criterion, and the Normal Mode Indicator Function are available.
A novel bee swarm optimization algorithm for numerical function optimization
NASA Astrophysics Data System (ADS)
Akbari, Reza; Mohammadi, Alireza; Ziarati, Koorush
2010-10-01
The optimization algorithms which are inspired from intelligent behavior of honey bees are among the most recently introduced population based techniques. In this paper, a novel algorithm called bee swarm optimization, or BSO, and its two extensions for improving its performance are presented. The BSO is a population based optimization technique which is inspired from foraging behavior of honey bees. The proposed approach provides different patterns which are used by the bees to adjust their flying trajectories. As the first extension, the BSO algorithm introduces different approaches such as repulsion factor and penalizing fitness (RP) to mitigate the stagnation problem. Second, to maintain efficiently the balance between exploration and exploitation, time-varying weights (TVW) are introduced into the BSO algorithm. The proposed algorithm (BSO) and its two extensions (BSO-RP and BSO-RPTVW) are compared with existing algorithms which are based on intelligent behavior of honey bees, on a set of well known numerical test functions. The experimental results show that the BSO algorithms are effective and robust; produce excellent results, and outperform other algorithms investigated in this consideration.
Fuzzy set applications in engineering optimization: Multilevel fuzzy optimization
NASA Technical Reports Server (NTRS)
Diaz, Alejandro R.
1989-01-01
A formulation for multilevel optimization with fuzzy objective functions is presented. With few exceptions, formulations for fuzzy optimization have dealt with a one-level problem in which the objective is the membership function of a fuzzy set formed by the fuzzy intersection of other sets. In the problem examined here, the goal set G is defined in a more general way, using an aggregation operator H that allows arbitrary combinations of set operations (union, intersection, addition) on the individual sets Gi. This is a straightforward extension of the standard form, but one that makes possible the modeling of interesting evaluation strategies. A second, more important departure from the standard form will be the construction of a multilevel problem analogous to the design decomposition problem in optimization. This arrangement facilitates the simulation of a system design process in which different components of the system are designed by different teams, and different levels of design detail become relevant at different time stages in the process: global design features early, local features later in the process.
Optimization Algorithms in Optimal Predictions of Atomistic Properties by Kriging.
Di Pasquale, Nicodemo; Davie, Stuart J; Popelier, Paul L A
2016-04-12
The machine learning method kriging is an attractive tool to construct next-generation force fields. Kriging can accurately predict atomistic properties, which involves optimization of the so-called concentrated log-likelihood function (i.e., fitness function). The difficulty of this optimization problem quickly escalates in response to an increase in either the number of dimensions of the system considered or the size of the training set. In this article, we demonstrate and compare the use of two search algorithms, namely, particle swarm optimization (PSO) and differential evolution (DE), to rapidly obtain the maximum of this fitness function. The ability of these two algorithms to find a stationary point is assessed by using the first derivative of the fitness function. Finally, the converged position obtained by PSO and DE is refined through the limited-memory Broyden-Fletcher-Goldfarb-Shanno bounded (L-BFGS-B) algorithm, which belongs to the class of quasi-Newton algorithms. We show that both PSO and DE are able to come close to the stationary point, even in high-dimensional problems. They do so in a reasonable amount of time, compared to that with the Newton and quasi-Newton algorithms, regardless of the starting position in the search space of kriging hyperparameters. The refinement through L-BFGS-B is able to give the position of the maximum with whichever precision is desired. PMID:26930135
NASA Astrophysics Data System (ADS)
Deufel, Christopher L.; Furutani, Keith M.
2014-02-01
As dose optimization for high dose rate brachytherapy becomes more complex, it becomes increasingly important to have a means of verifying that optimization results are reasonable. A method is presented for using a simple optimization as quality assurance for the more complex optimization algorithms typically found in commercial brachytherapy treatment planning systems. Quality assurance tests may be performed during commissioning, at regular intervals, and/or on a patient specific basis. A simple optimization method is provided that optimizes conformal target coverage using an exact, variance-based, algebraic approach. Metrics such as dose volume histogram, conformality index, and total reference air kerma agree closely between simple and complex optimizations for breast, cervix, prostate, and planar applicators. The simple optimization is shown to be a sensitive measure for identifying failures in a commercial treatment planning system that are possibly due to operator error or weaknesses in planning system optimization algorithms. Results from the simple optimization are surprisingly similar to the results from a more complex, commercial optimization for several clinical applications. This suggests that there are only modest gains to be made from making brachytherapy optimization more complex. The improvements expected from sophisticated linear optimizations, such as PARETO methods, will largely be in making systems more user friendly and efficient, rather than in finding dramatically better source strength distributions.
Chopped random-basis quantum optimization
Caneva, Tommaso; Calarco, Tommaso; Montangero, Simone
2011-08-15
In this work, we describe in detail the chopped random basis (CRAB) optimal control technique recently introduced to optimize time-dependent density matrix renormalization group simulations [P. Doria, T. Calarco, and S. Montangero, Phys. Rev. Lett. 106, 190501 (2011)]. Here, we study the efficiency of this control technique in optimizing different quantum processes and we show that in the considered cases we obtain results equivalent to those obtained via different optimal control methods while using less resources. We propose the CRAB optimization as a general and versatile optimal control technique.
Integrated multidisciplinary design optimization of rotorcraft
NASA Technical Reports Server (NTRS)
Adelman, Howard M.; Mantay, Wayne R.
1989-01-01
The NASA/Army research plan for developing the logic elements for helicopter rotor design optimization by integrating appropriate disciplines and accounting for important interactions among the disciplines is discussed. The paper describes the optimization formulation in terms of the objective function, design variables, and constraints. The analysis aspects are discussed, and an initial effort at defining the interdisciplinary coupling is summarized. Results are presented on the achievements made in the rotor aerodynamic performance optimization for minimum hover horsepower, rotor dynamic optimization for vibration reduction, rotor structural optimization for minimum weight, and integrated aerodynamic load/dynamics optimization for minimum vibration and weight.
Design of optimal systolic arrays
Li, G.J.; Wah, B.W.
1985-01-01
Conventional design of systolic arrays is based on the mapping of an algorithm onto an interconnection of processing elements in a VLSI chip. This mapping is done in an ad hoc manner, and the resulting configuration usually represents a feasible but suboptimal design. In this paper, systolic arrays are characterized by three classes of parameters: the velocities of data flows, the spatial distributions of data, and the periods of computation. By relating these parameters in constraint equations that govern the correctness of the design, the design is formulated into an optimization problem. The size of the search space is a polynomial of the problem size, and a methodology to systematically search and reduce this space and to obtain the optimal design is proposed. Some examples of applying the method, including matrix multiplication, finite impulse response filtering, deconvolution, and triangular-matrix inversion, are given. 30 references.
Optimal Extraction of Echelle Spectra
NASA Astrophysics Data System (ADS)
Piskunov, Nikolai
The extraction of the echelle spectra registered with a CCD detector represents a big challenge because of three reasons: (1) the pixel sampling is often close or worse then optimal, (2) spectral orders are curved and tilted with respect to the CCD rows (or columns) and (3) every pixel contains additional noise coming from various sources as illustrated in Figure 1. The main goal of an optimal extraction is to recover as much of the science signal while minimizing the contribution of the noise. Here we present the Slit Function Decomposition algorithm which replaces the summation in a sliding window with a reconstruction of the slit illumination profile. The reconstruction is formulated as an inverse problem solved by iterations and it is robust against most of the systematic problems including cosmic rays and cosmetic defects.
Optimal design of airlift fermenters
Moresi, M.
1981-11-01
In this article a modeling of a draft-tube airlift fermenter (ALF) based on perfect back-mixing of liquid and plugflow for gas bubbles has been carried out to optimize the design and operation of fermentation units at different working capacities. With reference to a whey fermentation by yeasts the economic optimization has led to a slim ALF with an aspect ratio of about 15. As far as power expended per unit of oxygen transfer is concerned, the responses of the model are highly influenced by kLa. However, a safer use of the model has been suggested in order to assess the feasibility of the fermentation process under study. (Refs. 39).
Integrated Energy System Dispatch Optimization
Firestone, Ryan; Stadler, Michael; Marnay, Chris
2006-06-16
On-site cogeneration of heat and electricity, thermal and electrical storage, and curtailing/rescheduling demand options are often cost-effective to commercial and industrial sites. This collection of equipment and responsive consumption can be viewed as an integrated energy system(IES). The IES can best meet the sites cost or environmental objectives when controlled in a coordinated manner. However, continuously determining this optimal IES dispatch is beyond the expectations for operators of smaller systems. A new algorithm is proposed in this paper to approximately solve the real-time dispatch optimization problem for a generic IES containing an on-site cogeneration system subject to random outages, limited curtailment opportunities, an intermittent renewable electricity source, and thermal storage. An example demonstrates how this algorithm can be used in simulation to estimate the value of IES components.
Asymptotically optimal topological quantum compiling.
Kliuchnikov, Vadym; Bocharov, Alex; Svore, Krysta M
2014-04-11
We address the problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model. We classify the single-qubit unitaries that can be represented exactly by Fibonacci anyon braids and use the classification to develop a probabilistically polynomial algorithm that approximates any given single-qubit unitary to a desired precision by an asymptotically depth-optimal braid pattern. We extend our algorithm in two directions: to produce braids that allow only single-strand movement, called weaves, and to produce depth-optimal approximations of two-qubit gates. Our compiled braid patterns have depths that are 20 to 1000 times shorter than those output by prior state-of-the-art methods, for precisions ranging between 10(-10) and 10(-30). PMID:24765934
Heteronuclear decoupling by optimal tracking.
Neves, Jorge L; Heitmann, Björn; Khaneja, Navin; Glaser, Steffen J
2009-11-01
The problem to design efficient heteronuclear decoupling sequences is studied using optimal control methods. A generalized version of the gradient ascent engineering (GRAPE) algorithm is presented that makes it possible to design complex non-periodic decoupling sequences which are characterized by tens of thousands of pulse sequence parameters. In contrast to conventional approaches based on average Hamiltonian theory, the concept of optimal tracking is used: a pulse sequence is designed that steers the evolution of an ensemble of spin systems such that at a series of time points, a specified trajectory of the density operator is tracked as closely as possible. The approach is demonstrated for the case of low-power heteronuclear decoupling in the liquid state for in vivo applications. Compared to conventional sequences, significant gains in decoupling efficiency and robustness with respect to offset and inhomogeneity of the radio-frequency field were found in simulations and experiments. PMID:19695913
Optimal designs for copula models
Perrone, E.; Müller, W.G.
2016-01-01
Copula modelling has in the past decade become a standard tool in many areas of applied statistics. However, a largely neglected aspect concerns the design of related experiments. Particularly the issue of whether the estimation of copula parameters can be enhanced by optimizing experimental conditions and how robust all the parameter estimates for the model are with respect to the type of copula employed. In this paper an equivalence theorem for (bivariate) copula models is provided that allows formulation of efficient design algorithms and quick checks of whether designs are optimal or at least efficient. Some examples illustrate that in practical situations considerable gains in design efficiency can be achieved. A natural comparison between different copula models with respect to design efficiency is provided as well. PMID:27453616
Optimal transport and the placenta
Morgan, Simon; Xia, Qinglan; Salafia, Carolym
2010-01-01
The goal of this paper is to investigate the expected effects of (i) placental size, (ii) placental shape and (iii) the position of insertion of the umbilical cord on the work done by the foetus heart in pumping blood across the placenta. We use optimal transport theory and modeling to quantify the expected effects of these factors . Total transport cost and the shape factor contribution to cost are given by the optimal transport model. Total placental transport cost is highly correlated with birth weight, placenta weight, FPR and the metabolic scaling factor beta. The shape factor is also highly correlated with birth weight, and after adjustment for placental weight, is highly correlated with the metabolic scaling factor beta.
Robust Optimization of Biological Protocols
Flaherty, Patrick; Davis, Ronald W.
2015-01-01
When conducting high-throughput biological experiments, it is often necessary to develop a protocol that is both inexpensive and robust. Standard approaches are either not cost-effective or arrive at an optimized protocol that is sensitive to experimental variations. We show here a novel approach that directly minimizes the cost of the protocol while ensuring the protocol is robust to experimental variation. Our approach uses a risk-averse conditional value-at-risk criterion in a robust parameter design framework. We demonstrate this approach on a polymerase chain reaction protocol and show that our improved protocol is less expensive than the standard protocol and more robust than a protocol optimized without consideration of experimental variation. PMID:26417115
Groundwater Optimal Management Under Uncertainty
NASA Astrophysics Data System (ADS)
Karatzas, George P.
One of the latest developments dealing with noisy or incomplete data in mathemat- ical programming is the robust optimization approach. This approach is based on a scenario-based description of the data and yields a solution that is less sensitive to realizations of the data of the different scenarios. The objective function considers the violations of the constraints under each scenario and incorporates that into the formu- lation by using a kind of penalty `weights'. In the area of groundwater management the robust optimization approach has been used to incorporate uncertainty into the model by considering a multiple scenario description of the hydraulic conductivity field. The focus of the present study is to determine an effective methodology for selecting the scenarios as well as the `weights' in the most effective manner.
Optimal control and Galois theory
Zelikin, M I; Kiselev, D D; Lokutsievskiy, L V
2013-11-30
An important role is played in the solution of a class of optimal control problems by a certain special polynomial of degree 2(n−1) with integer coefficients. The linear independence of a family of k roots of this polynomial over the field Q implies the existence of a solution of the original problem with optimal control in the form of an irrational winding of a k-dimensional Clifford torus, which is passed in finite time. In the paper, we prove that for n≤15 one can take an arbitrary positive integer not exceeding [n/2] for k. The apparatus developed in the paper is applied to the systems of Chebyshev-Hermite polynomials and generalized Chebyshev-Laguerre polynomials. It is proved that for such polynomials of degree 2m every subsystem of [(m+1)/2] roots with pairwise distinct squares is linearly independent over the field Q. Bibliography: 11 titles.
Optimal protocols for nonlocality distillation
Hoeyer, Peter; Rashid, Jibran
2010-10-15
Forster et al. recently showed that weak nonlocality can be amplified by giving the first protocol that distills a class of nonlocal boxes (NLBs) [Phys. Rev. Lett. 102, 120401 (2009)] We first show that their protocol is optimal among all nonadaptive protocols. We next consider adaptive protocols. We show that the depth-2 protocol of Allcock et al. [Phys. Rev. A 80, 062107 (2009)] performs better than previously known adaptive depth-2 protocols for all symmetric NLBs. We present a depth-3 protocol that extends the known region of distillable NLBs. We give examples of NLBs for which each of the Forster et al., the Allcock et al., and our protocols perform best. The understanding we develop is that there is no single optimal protocol for NLB distillation. The choice of which protocol to use depends on the noise parameters for the NLB.
Structural optimization: Challenges and opportunities
NASA Technical Reports Server (NTRS)
Sobieszczanski-Sobieski, J.
1984-01-01
A review of developments in structural optimization techniques and their interface with growing computer capabilities is presented. Structural design steps comprise functional definition of an object, an evaluation phase wherein external influences are quantified, selection of the design concept, material, object geometry, and the internal layout, and quantification of the physical characteristics. Optimization of a fully stressed design is facilitated by use of nonlinear mathematical programming which permits automated definition of the physics of a problem. Design iterations terminate when convergence is acquired between mathematical and physical criteria. A constrained minimum algorithm has been formulated using an Augmented Lagrangian approach and a generalized reduced gradient to obtain fast convergence. Various approximation techniques are mentioned. The synergistic application of all the methods surveyed requires multidisciplinary teamwork during a design effort.
Optimal concentrations in nectar feeding
Kim, Wonjung; Gilet, Tristan; Bush, John W. M.
2011-01-01
Nectar drinkers must feed quickly and efficiently due to the threat of predation. While the sweetest nectar offers the greatest energetic rewards, the sharp increase of viscosity with sugar concentration makes it the most difficult to transport. We here demonstrate that the sugar concentration that optimizes energy transport depends exclusively on the drinking technique employed. We identify three nectar drinking techniques: active suction, capillary suction, and viscous dipping. For each, we deduce the dependence of the volume intake rate on the nectar viscosity and thus infer an optimal sugar concentration consistent with laboratory measurements. Our results provide the first rationale for why suction feeders typically pollinate flowers with lower sugar concentration nectar than their counterparts that use viscous dipping. PMID:21949358
Process optimization in optical fabrication
NASA Astrophysics Data System (ADS)
Faehnle, Oliver
2016-03-01
Predictable and stable fabrication processes are essential for reliable cost and quality management in optical fabrication technology. This paper reports on strategies to generate and control optimum sets of process parameters for, e.g., subaperture polishing of small optics (featuring clear apertures smaller than 2 mm). Emphasis is placed on distinguishing between machine and process optimization, demonstrating that it is possible to set up the ductile mode grinding process by means other than controlling critical depth of cut. Finally, a recently developed in situ testing technique is applied to monitor surface quality on-machine while abrasively working the surface under test enabling an online optimization of polishing processes eventually minimizing polishing time and fabrication cost.
Chemical shift driven geometry optimization.
Witter, Raiker; Priess, Wolfram; Sternberg, Ulrich
2002-01-30
A new method for refinement of 3D molecular structures by geometry optimization is presented. Prerequisites are a force field and a very fast procedure for the calculation of chemical shifts in every step of optimization. To the energy, provided by the force field (COSMOS force field), a pseudoenergy, depending on the difference between experimental and calculated chemical shifts, is added. In addition to the energy gradients, pseudoforces are computed. This requires the derivatives of the chemical shifts with respect to the coordinates. The pseudoforces are analytically derived from the integral expressions of the bond polarization theory. Single chemical shift values attributed to corresponding atoms are considered for structural correction. As a first example, this method is applied for proton position refinement of the D-mannitol X-ray structure. A crystal structure refinement with 13C chemical shift pseudoforces is carried out. PMID:11924742
[Optimization of radiological scoliosis assessment].
Enríquez, Goya; Piqueras, Joaquim; Catalá, Ana; Oliva, Glòria; Ruiz, Agustí; Ribas, Montserrat; Duran, Carmina; Rodrigo, Carlos; Rodríguez, Eugenia; Garriga, Victoria; Maristany, Teresa; García-Fontecha, César; Baños, Joan; Muchart, Jordi; Alava, Fernando
2014-07-01
Most scoliosis are idiopathic (80%) and occur more frequently in adolescent girls. Plain radiography is the imaging method of choice, both for the initial study and follow-up studies but has the disadvantage of using ionizing radiation. The breasts are exposed to x-ray along these repeated examinations. The authors present a range of recommendations in order to optimize radiographic exam technique for both conventional and digital x-ray settings to prevent unnecessary patients' radiation exposure and to reduce the risk of breast cancer in patients with scoliosis. With analogue systems, leaded breast protectors should always be used, and with any radiographic equipment, analog or digital radiography, the examination should be performed in postero-anterior projection and optimized low-dose techniques. The ALARA (as low as reasonable achievable) rule should always be followed to achieve diagnostic quality images with the lowest feasible dose. PMID:25128362
Optimal intervention strategies for tuberculosis
NASA Astrophysics Data System (ADS)
Bowong, Samuel; Aziz Alaoui, A. M.
2013-06-01
This paper deals with the problem of optimal control of a deterministic model of tuberculosis (abbreviated as TB for tubercle bacillus). We first present and analyze an uncontrolled tuberculosis model which incorporates the essential biological and epidemiological features of the disease. The model is shown to exhibit the phenomenon of backward bifurcation, where a stable disease-free equilibrium co-exists with one or more stable endemic equilibria when the associated basic reproduction number is less than the unity. Based on this continuous model, the tuberculosis control is formulated and solved as an optimal control problem, indicating how control terms on the chemoprophylaxis and detection should be introduced in the population to reduce the number of individuals with active TB. Results provide a framework for designing the cost-effective strategies for TB with two intervention methods.
Optimality Principles of Undulatory Swimming
NASA Astrophysics Data System (ADS)
Nangia, Nishant; Bale, Rahul; Patankar, Neelesh
2015-11-01
A number of dimensionless quantities derived from a fish's kinematic and morphological parameters have been used to describe the hydrodynamics of swimming. In particular, body/caudal fin swimmers have been found to swim within a relatively narrow range of these quantities in nature, e.g., Strouhal number or the optimal specific wavelength. It has been hypothesized or shown that these constraints arise due to maximization of swimming speed, efficiency, or cost of transport in certain domains of this large dimensionless parameter space. Using fully resolved simulations of undulatory patterns, we investigate the existence of various optimality principles in fish swimming. Using scaling arguments, we relate various dimensionless parameters to each other. Based on these findings, we make design recommendations on how kinematic parameters for a swimming robot or vehicle should be chosen. This work is supported by NSF Grants CBET-0828749, CMMI-0941674, CBET-1066575 and the National Science Foundation Graduate Research Fellowship under Grant No. DGE-1324585.
Topology optimization of piezoelectric nanostructures
NASA Astrophysics Data System (ADS)
Nanthakumar, S. S.; Lahmer, Tom; Zhuang, Xiaoying; Park, Harold S.; Rabczuk, Timon
2016-09-01
We present an extended finite element formulation for piezoelectric nanobeams and nanoplates that is coupled with topology optimization to study the energy harvesting potential of piezoelectric nanostructures. The finite element model for the nanoplates is based on the Kirchoff plate model, with a linear through the thickness distribution of electric potential. Based on the topology optimization, the largest enhancements in energy harvesting are found for closed circuit boundary conditions, though significant gains are also found for open circuit boundary conditions. Most interestingly, our results demonstrate the competition between surface elasticity, which reduces the energy conversion efficiency, and surface piezoelectricity, which enhances the energy conversion efficiency, in governing the energy harvesting potential of piezoelectric nanostructures.
Formulation Optimization of Arecoline Patches
Wu, Pao-Chu; Tsai, Pi-Ju; Lin, Shin-Chen; Huang, Yaw-Bin
2014-01-01
The response surface methodology (RSM) including polynomial equations has been used to design an optimal patch formulation with appropriate adhesion and flux. The patch formulations were composed of different polymers, including Eudragit RS 100 (ERS), Eudragit RL 100 (ERL) and polyvinylpyrrolidone K30 (PVP), plasticizers (PEG 400), and drug. In addition, using terpenes as enhancers could increase the flux of the drug. Menthol showed the highest enhancement effect on the flux of arecoline. PMID:24707220
Optimizing Sustainable Geothermal Heat Extraction
NASA Astrophysics Data System (ADS)
Patel, Iti; Bielicki, Jeffrey; Buscheck, Thomas
2016-04-01
Geothermal heat, though renewable, can be depleted over time if the rate of heat extraction exceeds the natural rate of renewal. As such, the sustainability of a geothermal resource is typically viewed as preserving the energy of the reservoir by weighing heat extraction against renewability. But heat that is extracted from a geothermal reservoir is used to provide a service to society and an economic gain to the provider of that service. For heat extraction used for market commodities, sustainability entails balancing the rate at which the reservoir temperature renews with the rate at which heat is extracted and converted into economic profit. We present a model for managing geothermal resources that combines simulations of geothermal reservoir performance with natural resource economics in order to develop optimal heat mining strategies. Similar optimal control approaches have been developed for managing other renewable resources, like fisheries and forests. We used the Non-isothermal Unsaturated-saturated Flow and Transport (NUFT) model to simulate the performance of a sedimentary geothermal reservoir under a variety of geologic and operational situations. The results of NUFT are integrated into the optimization model to determine the extraction path over time that maximizes the net present profit given the performance of the geothermal resource. Results suggest that the discount rate that is used to calculate the net present value of economic gain is a major determinant of the optimal extraction path, particularly for shallower and cooler reservoirs, where the regeneration of energy due to the natural geothermal heat flux is a smaller percentage of the amount of energy that is extracted from the reservoir.
Intelligent permuting and its optimization
NASA Astrophysics Data System (ADS)
Shi, Wei; Chen, J. H.
1995-08-01
In this paper genetic algorithm (GA) is developed and applied to the optimizing or rationalizing permutation problems with FMS scheduling as an example. Special methods of genetic coding for permutations, fitness function definitions, crossover and mutation operations are designed and tested. A novel catastrophe technique is suggested to rescue the GA procedure from evolution halt. The effectiveness of GA for permutation problems is identified by computational experiments.
Optimization of Cylindrical Hall Thrusters
Yevgeny Raitses, Artem Smirnov, Erik Granstedt, and Nathaniel J. Fi
2007-07-24
The cylindrical Hall thruster features high ionization efficiency, quiet operation, and ion acceleration in a large volume-to-surface ratio channel with performance comparable with the state-of-the-art annular Hall thrusters. These characteristics were demonstrated in low and medium power ranges. Optimization of miniaturized cylindrical thrusters led to performance improvements in the 50-200W input power range, including plume narrowing, increased thruster efficiency, reliable discharge initiation, and stable operation. __________________________________________________
Optimization of Cylindrical Hall Thrusters
Yevgeny Raitses, Artem Smirnov, Erik Granstedt, and Nathaniel J. Fisch
2007-11-27
The cylindrical Hall thruster features high ionization efficiency, quiet operation, and ion acceleration in a large volume-to-surface ratio channel with performance comparable with the state-of-the-art annular Hall thrusters. These characteristics were demonstrated in low and medium power ranges. Optimization of miniaturized cylindrical thrusters led to performance improvements in the 50-200W input power range, including plume narrowing, increased thruster efficiency, reliable discharge initiation, and stable operation.
Exponential approximations in optimal design
NASA Technical Reports Server (NTRS)
Belegundu, A. D.; Rajan, S. D.; Rajgopal, J.
1990-01-01
One-point and two-point exponential functions have been developed and proved to be very effective approximations of structural response. The exponential has been compared to the linear, reciprocal and quadratic fit methods. Four test problems in structural analysis have been selected. The use of such approximations is attractive in structural optimization to reduce the numbers of exact analyses which involve computationally expensive finite element analysis.
Switching strategies to optimize search
NASA Astrophysics Data System (ADS)
Shlesinger, Michael F.
2016-03-01
Search strategies are explored when the search time is fixed, success is probabilistic and the estimate for success can diminish with time if there is not a successful result. Under the time constraint the problem is to find the optimal time to switch a search strategy or search location. Several variables are taken into account, including cost, gain, rate of success if a target is present and the probability that a target is present.
Optimal Stopping with Information Constraint
Lempa, Jukka
2012-10-15
We study the optimal stopping problem proposed by Dupuis and Wang (Adv. Appl. Probab. 34:141-157, 2002). In this maximization problem of the expected present value of the exercise payoff, the underlying dynamics follow a linear diffusion. The decision maker is not allowed to stop at any time she chooses but rather on the jump times of an independent Poisson process. Dupuis and Wang (Adv. Appl. Probab. 34:141-157, 2002), solve this problem in the case where the underlying is a geometric Brownian motion and the payoff function is of American call option type. In the current study, we propose a mild set of conditions (covering the setup of Dupuis and Wang in Adv. Appl. Probab. 34:141-157, 2002) on both the underlying and the payoff and build and use a Markovian apparatus based on the Bellman principle of optimality to solve the problem under these conditions. We also discuss the interpretation of this model as optimal timing of an irreversible investment decision under an exogenous information constraint.
Optimal segmentation and packaging process
Kostelnik, K.M.; Meservey, R.H.; Landon, M.D.
1999-08-10
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 and 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. 3 figs.
Optimization of Micromachined Photon Devices
Datskos, P.G.; Datskou, I.; Evans, B.M., III; Rajic, S.
1999-07-18
The Oak Ridge National Laboratory has been instrumental in developing ultraprecision technologies for the fabrication of optical devices. We are currently extending our ultraprecision capabilities to the design, fabrication, and testing of micro-optics and MEMS devices. Techniques have been developed in our lab for fabricating micro-devices using single point diamond turning and ion milling. The devices we fabricated can be used in micro-scale interferometry, micro-positioners, micro-mirrors, and chemical sensors. In this paper, we focus on the optimization of microstructure performance using finite element analysis and the experimental validation of those results. We also discuss the fabrication of such structures and the optical testing of the devices. The performance is simulated using finite element analysis to optimize geometric and material parameters. The parameters we studied include bimaterial coating thickness effects; device length, width, and thickness effects, as well as changes in the geometry itself. This optimization results in increased sensitivity of these structures to absorbed incoming energy, which is important for photon detection or micro-mirror actuation. We have investigated and tested multiple geometries. The devices were fabricated using focused ion beam milling, and their response was measured using a chopped photon source and laser triangulation techniques. Our results are presented and discussed.
Combined control-structure optimization
NASA Technical Reports Server (NTRS)
Salama, M.; Milman, M.; Bruno, R.; Scheid, R.; Gibson, S.
1989-01-01
An approach for combined control-structure optimization keyed to enhancing early design trade-offs is outlined and illustrated by numerical examples. The approach employs a homotopic strategy and appears to be effective for generating families of designs that can be used in these early trade studies. Analytical results were obtained for classes of structure/control objectives with linear quadratic Gaussian (LQG) and linear quadratic regulator (LQR) costs. For these, researchers demonstrated that global optima can be computed for small values of the homotopy parameter. Conditions for local optima along the homotopy path were also given. Details of two numerical examples employing the LQR control cost were given showing variations of the optimal design variables along the homotopy path. The results of the second example suggest that introducing a second homotopy parameter relating the two parts of the control index in the LQG/LQR formulation might serve to enlarge the family of Pareto optima, but its effect on modifying the optimal structural shapes may be analogous to the original parameter lambda.
Optimization of Supersonic Transport Trajectories
NASA Technical Reports Server (NTRS)
Ardema, Mark D.; Windhorst, Robert; Phillips, James
1998-01-01
This paper develops a near-optimal guidance law for generating minimum fuel, time, or cost fixed-range trajectories for supersonic transport aircraft. The approach uses a choice of new state variables along with singular perturbation techniques to time-scale decouple the dynamic equations into multiple equations of single order (second order for the fast dynamics). Application of the maximum principle to each of the decoupled equations, as opposed to application to the original coupled equations, avoids the two point boundary value problem and transforms the problem from one of a functional optimization to one of multiple function optimizations. It is shown that such an approach produces well known aircraft performance results such as minimizing the Brequet factor for minimum fuel consumption and the energy climb path. Furthermore, the new state variables produce a consistent calculation of flight path angle along the trajectory, eliminating one of the deficiencies in the traditional energy state approximation. In addition, jumps in the energy climb path are smoothed out by integration of the original dynamic equations at constant load factor. Numerical results performed for a supersonic transport design show that a pushover dive followed by a pullout at nominal load factors are sufficient maneuvers to smooth the jump.
Optimal control of overdamped systems.
Zulkowski, Patrick R; DeWeese, Michael R
2015-09-01
Nonequilibrium physics encompasses a broad range of natural and synthetic small-scale systems. Optimizing transitions of such systems will be crucial for the development of nanoscale technologies and may reveal the physical principles underlying biological processes at the molecular level. Recent work has demonstrated that when a thermodynamic system is driven away from equilibrium then the space of controllable parameters has a Riemannian geometry induced by a generalized inverse diffusion tensor. We derive a simple, compact expression for the inverse diffusion tensor that depends solely on equilibrium information for a broad class of potentials. We use this formula to compute the minimal dissipation for two model systems relevant to small-scale information processing and biological molecular motors. In the first model, we optimally erase a single classical bit of information modeled by an overdamped particle in a smooth double-well potential. In the second model, we find the minimal dissipation of a simple molecular motor model coupled to an optical trap. In both models, we find that the minimal dissipation for the optimal protocol of duration τ is proportional to 1/τ, as expected, though the dissipation for the erasure model takes a different form than what we found previously for a similar system. PMID:26465436
A novel stochastic optimization algorithm.
Li, B; Jiang, W
2000-01-01
This paper presents a new stochastic approach SAGACIA based on proper integration of simulated annealing algorithm (SAA), genetic algorithm (GA), and chemotaxis algorithm (CA) for solving complex optimization problems. SAGACIA combines the advantages of SAA, GA, and CA together. It has the following features: (1) it is not the simple mix of SAA, GA, and CA; (2) it works from a population; (3) it can be easily used to solve optimization problems either with continuous variables or with discrete variables, and it does not need coding and decoding,; and (4) it can easily escape from local minima and converge quickly. Good solutions can be obtained in a very short time. The search process of SAGACIA can be explained with Markov chains. In this paper, it is proved that SAGACIA has the property of global asymptotical convergence. SAGACIA has been applied to solve such problems as scheduling, the training of artificial neural networks, and the optimizing of complex functions. In all the test cases, the performance of SAGACIA is better than that of SAA, GA, and CA. PMID:18244742
Radiation Shielding Optimization on Mars
NASA Technical Reports Server (NTRS)
Slaba, Tony C.; Mertens, Chris J.; Blattnig, Steve R.
2013-01-01
Future space missions to Mars will require radiation shielding to be optimized for deep space transit and an extended stay on the surface. In deep space, increased shielding levels and material optimization will reduce the exposure from most solar particle events (SPE) but are less effective at shielding against galactic cosmic rays (GCR). On the surface, the shielding provided by the Martian atmosphere greatly reduces the exposure from most SPE, and long-term GCR exposure is a primary concern. Previous work has shown that in deep space, additional shielding of common materials such as aluminum or polyethylene does not significantly reduce the GCR exposure. In this work, it is shown that on the Martian surface, almost any amount of aluminum shielding increases exposure levels for humans. The increased exposure levels are attributed to neutron production in the shield and Martian regolith as well as the electromagnetic cascade induced in the Martian atmosphere. This result is significant for optimization of vehicle and shield designs intended for the surface of Mars.
Response Surface Model Building and Multidisciplinary Optimization Using D-Optimal Designs
NASA Technical Reports Server (NTRS)
Unal, Resit; Lepsch, Roger A.; McMillin, Mark L.
1998-01-01
This paper discusses response surface methods for approximation model building and multidisciplinary design optimization. The response surface methods discussed are central composite designs, Bayesian methods and D-optimal designs. An over-determined D-optimal design is applied to a configuration design and optimization study of a wing-body, launch vehicle. Results suggest that over determined D-optimal designs may provide an efficient approach for approximation model building and for multidisciplinary design optimization.
NASA Astrophysics Data System (ADS)
Bulgakov, V. K.; Strigunov, V. V.
2009-05-01
The Pontryagin maximum principle is used to prove a theorem concerning optimal control in regional macroeconomics. A boundary value problem for optimal trajectories of the state and adjoint variables is formulated, and optimal curves are analyzed. An algorithm is proposed for solving the boundary value problem of optimal control. The performance of the algorithm is demonstrated by computing an optimal control and the corresponding optimal trajectories.
Helicopter mission optimization study. [portable computer technology for flight optimization
NASA Technical Reports Server (NTRS)
Olson, J. R.
1978-01-01
The feasibility of using low-cost, portable computer technology to help a helicopter pilot optimize flight parameters to minimize fuel consumption and takeoff and landing noise was demonstrated. Eight separate computer programs were developed for use in the helicopter cockpit using a hand-held computer. The programs provide the helicopter pilot with the ability to calculate power required, minimum fuel consumption for both range and endurance, maximum speed and a minimum noise profile for both takeoff and landing. Each program is defined by a maximum of two magnetic cards. The helicopter pilot is required to key in the proper input parameter such as gross weight, outside air temperature or pressure altitude.
Cardiac resynchronization therapy: optimizing the device, optimizing the patient.
Trupp, Robin J
2004-01-01
Heart failure is a major health problem in the United States, associated with high morbidity, mortality, and economic burden. Despite recent advances in pharmacological treatments to attenuate disease progression, medications become relatively ineffective, resulting in worsening congestive symptoms and increased exercise intolerance. Cardiac resynchronization therapy provides a new adjunct for heart failure patients who remain symptomatic despite optimized medical therapies. This article discusses cardiac resynchronization therapy and measures that should be considered to ensure proper functioning of the device and improved quality of life for patients. PMID:15326978
Risk Analysis for Resource Planning Optimization
NASA Technical Reports Server (NTRS)
Cheung, Kar-Ming
2008-01-01
This paper describes a systems engineering approach to resource planning by integrating mathematical modeling and constrained optimization, empirical simulation, and theoretical analysis techniques to generate an optimal task plan in the presence of uncertainties.
Program Aids Analysis And Optimization Of Design
NASA Technical Reports Server (NTRS)
Rogers, James L., Jr.; Lamarsh, William J., II
1994-01-01
NETS/ PROSSS (NETS Coupled With Programming System for Structural Synthesis) computer program developed to provide system for combining NETS (MSC-21588), neural-network application program and CONMIN (Constrained Function Minimization, ARC-10836), optimization program. Enables user to reach nearly optimal design. Design then used as starting point in normal optimization process, possibly enabling user to converge to optimal solution in significantly fewer iterations. NEWT/PROSSS written in C language and FORTRAN 77.
Global optimality of extremals: An example
NASA Technical Reports Server (NTRS)
Kreindler, E.; Newman, F.
1980-01-01
The question of the existence and location of Darboux points is crucial for minimally sufficient conditions for global optimality and for computation of optimal trajectories. A numerical investigation is presented of the Darboux points and their relationship with conjugate points for a problem of minimum fuel, constant velocity, and horizontal aircraft turns to capture a line. This simple second order optimal control problem shows that ignoring the possible existence of Darboux points may play havoc with the computation of optimal trajectories.
An Evolutionary Optimization System for Spacecraft Design
NASA Technical Reports Server (NTRS)
Fukunaga, A.; Stechert, A.
1997-01-01
Spacecraft design optimization is a domian that can benefit from the application of optimization algorithms such as genetic algorithms. In this paper, we describe DEVO, an evolutionary optimization system that addresses these issues and provides a tool that can be applied to a number of real-world spacecraft design applications. We describe two current applications of DEVO: physical design if a Mars Microprobe Soil Penetrator, and system configuration optimization for a Neptune Orbiter.
HOPSPACK: Hybrid Optimization Parallel Search Package.
Gray, Genetha A.; Kolda, Tamara G.; Griffin, Joshua; Taddy, Matt; Martinez-Canales, Monica
2008-12-01
In this paper, we describe the technical details of HOPSPACK (Hybrid Optimization Parallel SearchPackage), a new software platform which facilitates combining multiple optimization routines into asingle, tightly-coupled, hybrid algorithm that supports parallel function evaluations. The frameworkis designed such that existing optimization source code can be easily incorporated with minimalcode modification. By maintaining the integrity of each individual solver, the strengths and codesophistication of the original optimization package are retained and exploited.4
Optimization of solver for gas flow modeling
NASA Astrophysics Data System (ADS)
Savichkin, D.; Dodulad, O.; Kloss, Yu
2014-05-01
The main purpose of the work is optimization of the solver for rarefied gas flow modeling based on the Boltzmann equation. Optimization method is based on SIMD extensions for ×86 processors. Computational code is profiled and manually optimized with SSE instructions. Heat flow, shock waves and Knudsen pump are modeled with optimized solver. Dependencies of computational time from mesh sizes and CPU capabilities are provided.
Genetic algorithms - What fitness scaling is optimal?
NASA Technical Reports Server (NTRS)
Kreinovich, Vladik; Quintana, Chris; Fuentes, Olac
1993-01-01
A problem of choosing the best scaling function as a mathematical optimization problem is formulated and solved under different optimality criteria. A list of functions which are optimal under different criteria is presented which includes both the best functions empirically proved and new functions that may be worth trying.
Optimizing Dynamical Network Structure for Pinning Control
Orouskhani, Yasin; Jalili, Mahdi; Yu, Xinghuo
2016-01-01
Controlling dynamics of a network from any initial state to a final desired state has many applications in different disciplines from engineering to biology and social sciences. In this work, we optimize the network structure for pinning control. The problem is formulated as four optimization tasks: i) optimizing the locations of driver nodes, ii) optimizing the feedback gains, iii) optimizing simultaneously the locations of driver nodes and feedback gains, and iv) optimizing the connection weights. A newly developed population-based optimization technique (cat swarm optimization) is used as the optimization method. In order to verify the methods, we use both real-world networks, and model scale-free and small-world networks. Extensive simulation results show that the optimal placement of driver nodes significantly outperforms heuristic methods including placing drivers based on various centrality measures (degree, betweenness, closeness and clustering coefficient). The pinning controllability is further improved by optimizing the feedback gains. We also show that one can significantly improve the controllability by optimizing the connection weights. PMID:27067020
Optimizing Dynamical Network Structure for Pinning Control.
Orouskhani, Yasin; Jalili, Mahdi; Yu, Xinghuo
2016-01-01
Controlling dynamics of a network from any initial state to a final desired state has many applications in different disciplines from engineering to biology and social sciences. In this work, we optimize the network structure for pinning control. The problem is formulated as four optimization tasks: i) optimizing the locations of driver nodes, ii) optimizing the feedback gains, iii) optimizing simultaneously the locations of driver nodes and feedback gains, and iv) optimizing the connection weights. A newly developed population-based optimization technique (cat swarm optimization) is used as the optimization method. In order to verify the methods, we use both real-world networks, and model scale-free and small-world networks. Extensive simulation results show that the optimal placement of driver nodes significantly outperforms heuristic methods including placing drivers based on various centrality measures (degree, betweenness, closeness and clustering coefficient). The pinning controllability is further improved by optimizing the feedback gains. We also show that one can significantly improve the controllability by optimizing the connection weights. PMID:27067020
Optimizing Dynamical Network Structure for Pinning Control
NASA Astrophysics Data System (ADS)
Orouskhani, Yasin; Jalili, Mahdi; Yu, Xinghuo
2016-04-01
Controlling dynamics of a network from any initial state to a final desired state has many applications in different disciplines from engineering to biology and social sciences. In this work, we optimize the network structure for pinning control. The problem is formulated as four optimization tasks: i) optimizing the locations of driver nodes, ii) optimizing the feedback gains, iii) optimizing simultaneously the locations of driver nodes and feedback gains, and iv) optimizing the connection weights. A newly developed population-based optimization technique (cat swarm optimization) is used as the optimization method. In order to verify the methods, we use both real-world networks, and model scale-free and small-world networks. Extensive simulation results show that the optimal placement of driver nodes significantly outperforms heuristic methods including placing drivers based on various centrality measures (degree, betweenness, closeness and clustering coefficient). The pinning controllability is further improved by optimizing the feedback gains. We also show that one can significantly improve the controllability by optimizing the connection weights.
Merits and limitations of optimality criteria method for structural optimization
NASA Technical Reports Server (NTRS)
Patnaik, Surya N.; Guptill, James D.; Berke, Laszlo
1993-01-01
The merits and limitations of the optimality criteria (OC) method for the minimum weight design of structures subjected to multiple load conditions under stress, displacement, and frequency constraints were investigated by examining several numerical examples. The examples were solved utilizing the Optimality Criteria Design Code that was developed for this purpose at NASA Lewis Research Center. This OC code incorporates OC methods available in the literature with generalizations for stress constraints, fully utilized design concepts, and hybrid methods that combine both techniques. Salient features of the code include multiple choices for Lagrange multiplier and design variable update methods, design strategies for several constraint types, variable linking, displacement and integrated force method analyzers, and analytical and numerical sensitivities. The performance of the OC method, on the basis of the examples solved, was found to be satisfactory for problems with few active constraints or with small numbers of design variables. For problems with large numbers of behavior constraints and design variables, the OC method appears to follow a subset of active constraints that can result in a heavier design. The computational efficiency of OC methods appears to be similar to some mathematical programming techniques.
Optimization and geophysical inverse problems
Barhen, J.; Berryman, J.G.; Borcea, L.; Dennis, J.; de Groot-Hedlin, C.; Gilbert, F.; Gill, P.; Heinkenschloss, M.; Johnson, L.; McEvilly, T.; More, J.; Newman, G.; Oldenburg, D.; Parker, P.; Porto, B.; Sen, M.; Torczon, V.; Vasco, D.; Woodward, N.B.
2000-10-01
A fundamental part of geophysics is to make inferences about the interior of the earth on the basis of data collected at or near the surface of the earth. In almost all cases these measured data are only indirectly related to the properties of the earth that are of interest, so an inverse problem must be solved in order to obtain estimates of the physical properties within the earth. In February of 1999 the U.S. Department of Energy sponsored a workshop that was intended to examine the methods currently being used to solve geophysical inverse problems and to consider what new approaches should be explored in the future. The interdisciplinary area between inverse problems in geophysics and optimization methods in mathematics was specifically targeted as one where an interchange of ideas was likely to be fruitful. Thus about half of the participants were actively involved in solving geophysical inverse problems and about half were actively involved in research on general optimization methods. This report presents some of the topics that were explored at the workshop and the conclusions that were reached. In general, the objective of a geophysical inverse problem is to find an earth model, described by a set of physical parameters, that is consistent with the observational data. It is usually assumed that the forward problem, that of calculating simulated data for an earth model, is well enough understood so that reasonably accurate synthetic data can be generated for an arbitrary model. The inverse problem is then posed as an optimization problem, where the function to be optimized is variously called the objective function, misfit function, or fitness function. The objective function is typically some measure of the difference between observational data and synthetic data calculated for a trial model. However, because of incomplete and inaccurate data, the objective function often incorporates some additional form of regularization, such as a measure of smoothness
Phase unwrapping using discontinuity optimization
Flynn, T.J.
1998-03-01
In SAR interferometry, the periodicity of the phase must be removed using two-dimensional phase unwrapping. The goal of the procedure is to find a smooth surface in which large spatial phase differences, called discontinuities, are restricted to places where their presence is reasonable. The pioneering work of Goldstein et al. identified points of local unwrap inconsistency called residues, which must be connected by discontinuities. This paper presents an overview of recent work that treats phase unwrapping as a discrete optimization problem with the constraint that residues must be connected. Several algorithms use heuristic methods to reduce the total number of discontinuities. Constantini has introduced the weighted sum of discontinuity magnitudes as a criterion of unwrap error and shown how algorithms from optimization theory are used to minimize it. Pixels of low quality are given low weight to guide discontinuities away from smooth, high-quality regions. This method is generally robust, but if noise is severe it underestimates the steepness of slopes and the heights of peaks. This problem is mitigated by subtracting (modulo 2{pi}) a smooth estimate of the unwrapped phase from the data, then unwrapping the resulting residual phase. The unwrapped residual is added to the smooth estimate to produce the final unwrapped phase. The estimate can be computed by lowpass filtering of an existing unwrapped phase; this makes possible an iterative algorithm in which the result of each iteration provides the estimate for the next. An example illustrates the results of optimal discontinuity placement and the improvement from unwrapping of the residual phase.
Optimizing High Level Waste Disposal
Dirk Gombert
2005-09-01
If society is ever to reap the potential benefits of nuclear energy, technologists must close the fuel-cycle completely. A closed cycle equates to a continued supply of fuel and safe reactors, but also reliable and comprehensive closure of waste issues. High level waste (HLW) disposal in borosilicate glass (BSG) is based on 1970s era evaluations. This host matrix is very adaptable to sequestering a wide variety of radionuclides found in raffinates from spent fuel reprocessing. However, it is now known that the current system is far from optimal for disposal of the diverse HLW streams, and proven alternatives are available to reduce costs by billions of dollars. The basis for HLW disposal should be reassessed to consider extensive waste form and process technology research and development efforts, which have been conducted by the United States Department of Energy (USDOE), international agencies and the private sector. Matching the waste form to the waste chemistry and using currently available technology could increase the waste content in waste forms to 50% or more and double processing rates. Optimization of the HLW disposal system would accelerate HLW disposition and increase repository capacity. This does not necessarily require developing new waste forms, the emphasis should be on qualifying existing matrices to demonstrate protection equal to or better than the baseline glass performance. Also, this proposed effort does not necessarily require developing new technology concepts. The emphasis is on demonstrating existing technology that is clearly better (reliability, productivity, cost) than current technology, and justifying its use in future facilities or retrofitted facilities. Higher waste processing and disposal efficiency can be realized by performing the engineering analyses and trade-studies necessary to select the most efficient methods for processing the full spectrum of wastes across the nuclear complex. This paper will describe technologies being
Optimizing antimicrobial therapy in children.
Long, Sarah S
2016-07-01
Management of common infections and optimal use of antimicrobial agents are presented, highlighting new evidence from the medical literature that enlightens practice. Primary therapy of staphylococcal skin abscesses is drainage. Patients who have a large abscess (>5 cm), cellulitis or mixed abscess-cellulitis likely would benefit from additional antibiotic therapy. When choosing an antibiotic for outpatient management, the patient, pathogen and in vitro drug susceptibility as well as tolerability, bioavailability and safety characteristics of antibiotics should be considered. Management of recurrent staphylococcal skin and soft tissue infections is vexing. Focus is best placed on reducing density of the organism on the patient's skin and in the environment, and optimizing a healthy skin barrier. With attention to adherence and optimal dosing, acute uncomplicated osteomyelitis can be managed with early transition from parenteral to oral therapy and with a 3-4 week total course of therapy. Doxycycline should be prescribed when indicated for a child of any age. Its use is not associated with dental staining. Azithromycin should be prescribed for infants when indicated, whilst being alert to an associated ≥2-fold excess risk of pyloric stenosis with use under 6 weeks of age. Beyond the neonatal period, acyclovir is more safely dosed by body surface area (not to exceed 500 mg/m(2)/dose) than by weight. In addition to the concern of antimicrobial resistance, unnecessary use of antibiotics should be avoided because of potential later metabolic effects, thought to be due to perturbation of the host's microbiome. PMID:27263076
Optimal woofer tweeter control demonstration
NASA Astrophysics Data System (ADS)
Le Roux, B.; El Hadi, K.; NDiaye, M.; Gray, M.
2011-09-01
Large aperture telescope adaptive optics incorporates several deformable and active mirrors. Several options have been proposed for several DM adaptive optics systems. We study an optimal control approach for these woofer tweeter systems based on a Kalman filtering method. This approach allows to share out the spatial energy of correction between the mirrors and to deal with different temporal response time. The approach is presented and a validation of the control method is carried out in a numerical simulation. We finally present the experimental validation of such control solutions for woofer-tweeter systems. The validation bench and the optical components are presented and the first experimental results are shown.
Optimization of hydraulic turbine diffuser
NASA Astrophysics Data System (ADS)
Moravec, Prokop; Hliník, Juraj; Rudolf, Pavel
2016-03-01
Hydraulic turbine diffuser recovers pressure energy from residual kinetic energy on turbine runner outlet. Efficiency of this process is especially important for high specific speed turbines, where almost 50% of available head is utilized within diffuser. Magnitude of the coefficient of pressure recovery can be significantly influenced by designing its proper shape. Present paper focuses on mathematical shape optimization method coupled with CFD. First method is based on direct search Nelder-Mead algorithm, while the second method employs adjoint solver and morphing. Results obtained with both methods are discussed and their advantages/disadvantages summarized.
Trajectory Analysis and Optimization System
Energy Science and Technology Software Center (ESTSC)
1996-06-04
TAOS is a general-purpose software tool capable of analyzing nearly any type of three degree-of-freedom point-mass, high-speed trajectory. Input files contain aerodynamic coefficients, propulsion data, and a trajectory description. The trajectory description divides the trajectory into segments, and within each segment, guidance rules provided by the user describe how the trajectory is computed. Output files contain tabulated trajectory information such as position, velocity, and acceleration. Parametric optimization provides a powerful method for satisfying mission-planning constraints,more » and trajectories involving more than one vehicle can be computed within a single problem.« less
Optimization of integrated polarization filters.
Gagnon, Denis; Dumont, Joey; Déziel, Jean-Luc; Dubé, Louis J
2014-10-01
This study reports on the design of small footprint, integrated polarization filters based on engineered photonic lattices. Using a rods-in-air lattice as a basis for a TE filter and a holes-in-slab lattice for the analogous TM filter, we are able to maximize the degree of polarization of the output beams up to 98% with a transmission efficiency greater than 75%. The proposed designs allow not only for logical polarization filtering, but can also be tailored to output an arbitrary transverse beam profile. The lattice configurations are found using a recently proposed parallel tabu search algorithm for combinatorial optimization problems in integrated photonics. PMID:25360980
Hubble Systems Optimize Hospital Schedules
NASA Technical Reports Server (NTRS)
2009-01-01
Don Rosenthal, a former Ames Research Center computer scientist who helped design the Hubble Space Telescope's scheduling software, co-founded Allocade Inc. of Menlo Park, California, in 2004. Allocade's OnCue software helps hospitals reclaim unused capacity and optimize constantly changing schedules for imaging procedures. After starting to use the software, one medical center soon reported noticeable improvements in efficiency, including a 12 percent increase in procedure volume, 35 percent reduction in staff overtime, and significant reductions in backlog and technician phone time. Allocade now offers versions for outpatient and inpatient magnetic resonance imaging (MRI), ultrasound, interventional radiology, nuclear medicine, Positron Emission Tomography (PET), radiography, radiography-fluoroscopy, and mammography.
Optimizing the neonatal thermal environment.
Sherman, Tami Irwin; Greenspan, Jay S; St Clair, Nancy; Touch, Suzanne M; Shaffer, Thomas H
2006-01-01
Devices used to maintain thermal stability in preterm infants have advanced over time from the first incubator reported by Jean-Louis-Paul Denuce in 1857 to the latest Versalet Incuwarmer and Giraffe Omnibed devices today. Optimizing the thermal environment has proven significant for improving the chances of survival for small infants. Understanding the basic physiologic principles and current methodology of thermoregulation is important in the clinical care of these tiny infants. This article highlights principles of thermoregulation and the technologic advances that provide thermal support to our vulnerable PMID:16913236
Spectrometer beam tube dimensional optimization
Dye, S.
1993-01-04
This project examined the optimization of the design of a beam tube. An ANSYS model was used to find the minimum tube thickness and the best camber in a beam tube under vacuum and preloaded by a pair of magnet poles. After the tube was modeled one version of it was built for use in the accelerator. This beam tube was put under a vacuum and the dimensional changes were recorded and compared to the ANSYS predictions. These deflection results were quite close to the predicted numbers and would suggest that the stresses are similar to the predictions as well.
Optimization process in helicopter design
NASA Technical Reports Server (NTRS)
Logan, A. H.; Banerjee, D.
1984-01-01
In optimizing a helicopter configuration, Hughes Helicopters uses a program called Computer Aided Sizing of Helicopters (CASH), written and updated over the past ten years, and used as an important part of the preliminary design process of the AH-64. First, measures of effectiveness must be supplied to define the mission characteristics of the helicopter to be designed. Then CASH allows the designer to rapidly and automatically develop the basic size of the helicopter (or other rotorcraft) for the given mission. This enables the designer and management to assess the various tradeoffs and to quickly determine the optimum configuration.
Trajectory Analysis and Optimization System
Salguero, David E.
1996-06-04
TAOS is a general-purpose software tool capable of analyzing nearly any type of three degree-of-freedom point-mass, high-speed trajectory. Input files contain aerodynamic coefficients, propulsion data, and a trajectory description. The trajectory description divides the trajectory into segments, and within each segment, guidance rules provided by the user describe how the trajectory is computed. Output files contain tabulated trajectory information such as position, velocity, and acceleration. Parametric optimization provides a powerful method for satisfying mission-planning constraints, and trajectories involving more than one vehicle can be computed within a single problem.
Optimal breast cancer pathology manifesto.
Tot, T; Viale, G; Rutgers, E; Bergsten-Nordström, E; Costa, A
2015-11-01
This manifesto was prepared by a European Breast Cancer (EBC) Council working group and launched at the European Breast Cancer Conference in Glasgow on 20 March 2014. It sets out optimal technical and organisational requirements for a breast cancer pathology service, in the light of concerns about variability and lack of patient-centred focus. It is not a guideline about how pathology services should be performed. It is a call for all in the cancer community--pathologists, oncologists, patient advocates, health administrators and policymakers--to check that services are available that serve the needs of patients in a high quality, timely way. PMID:26283037
Pilot-optimal augmentation synthesis
NASA Technical Reports Server (NTRS)
Schmidt, D. K.
1978-01-01
An augmentation synthesis method usable in the absence of quantitative handling qualities specifications, and yet explicitly including design objectives based on pilot-rating concepts, is presented. The algorithm involves the unique approach of simultaneously solving for the stability augmentation system (SAS) gains, pilot equalization and pilot rating prediction via optimal control techniques. Simultaneous solution is required in this case since the pilot model (gains, etc.) depends upon the augmented plant dynamics, and the augmentation is obviously not a priori known. Another special feature is the use of the pilot's objective function (from which the pilot model evolves) to design the SAS.
Optimized microsystems-enabled photovoltaics
Cruz-Campa, Jose Luis; Nielson, Gregory N.; Young, Ralph W.; Resnick, Paul J.; Okandan, Murat; Gupta, Vipin P.
2015-09-22
Technologies pertaining to designing microsystems-enabled photovoltaic (MEPV) cells are described herein. A first restriction for a first parameter of an MEPV cell is received. Subsequently, a selection of a second parameter of the MEPV cell is received. Values for a plurality of parameters of the MEPV cell are computed such that the MEPV cell is optimized with respect to the second parameter, wherein the values for the plurality of parameters are computed based at least in part upon the restriction for the first parameter.
Flat-plate photovoltaic array design optimization
NASA Technical Reports Server (NTRS)
Ross, R. G., Jr.
1980-01-01
An analysis is presented which integrates the results of specific studies in the areas of photovoltaic structural design optimization, optimization of array series/parallel circuit design, thermal design optimization, and optimization of environmental protection features. The analysis is based on minimizing the total photovoltaic system life-cycle energy cost including repair and replacement of failed cells and modules. This approach is shown to be a useful technique for array optimization, particularly when time-dependent parameters such as array degradation and maintenance are involved.
Enhanced ant colony optimization for multiscale problems
NASA Astrophysics Data System (ADS)
Hu, Nan; Fish, Jacob
2016-03-01
The present manuscript addresses the issue of computational complexity of optimizing nonlinear composite materials and structures at multiple scales. Several solutions are detailed to meet the enormous computational challenge of optimizing nonlinear structures at multiple scales including: (i) enhanced sampling procedure that provides superior performance of the well-known ant colony optimization algorithm, (ii) a mapping-based meshing of a representative volume element that unlike unstructured meshing permits sensitivity analysis on coarse meshes, and (iii) a multilevel optimization procedure that takes advantage of possible weak coupling of certain scales. We demonstrate the proposed optimization procedure on elastic and inelastic laminated plates involving three scales.
Integrated multidisciplinary design optimization of rotorcraft
NASA Technical Reports Server (NTRS)
Adelman, Howard M.; Mantay, Wayne R.
1989-01-01
The NASA/Army research plan for developing the logic elements for helicopter rotor design optimization by integrating appropriate disciplines and accounting for important interactions among the disciplines is discussed. The optimization formulation is described in terms of the objective function, design variables, and constraints. The analysis aspects are discussed, and an initial effort at defining the interdisciplinary coupling is summarized. Results are presented on the achievements made in the rotor dynamic optimization for vibration reduction, rotor structural optimization for minimum weight, and integrated aerodynamic load/dynamics optimization for minimum vibration and weight.
Magnetic design optimization using variable metrics
Davey, K.R.
1995-11-01
The optimal design of a magnet assembly for a magnetic levitated train is approached using a three step process. First, the key parameters within the objective performance index are computed for the variation range of the problem. Second, the performance index is fitted to a smooth polynomial involving products of the powers of all variables. Third, a constrained optimization algorithm is employed to predict the optimal choice of the variables. An assessment of the integrity of the optimization program is obtained by comparing the final optimized solution with that predicted by the field analysis in the final configuration. Additional field analysis is recommended around the final solution to fine tune the solution.
Design optimization method for Francis turbine
NASA Astrophysics Data System (ADS)
Kawajiri, H.; Enomoto, Y.; Kurosawa, S.
2014-03-01
This paper presents a design optimization system coupled CFD. Optimization algorithm of the system employs particle swarm optimization (PSO). Blade shape design is carried out in one kind of NURBS curve defined by a series of control points. The system was applied for designing the stationary vanes and the runner of higher specific speed francis turbine. As the first step, single objective optimization was performed on stay vane profile, and second step was multi-objective optimization for runner in wide operating range. As a result, it was confirmed that the design system is useful for developing of hydro turbine.
Evolutionary optimization of protein folding.
Debès, Cédric; Wang, Minglei; Caetano-Anollés, Gustavo; Gräter, Frauke
2013-01-01
Nature has shaped the make up of proteins since their appearance, [Formula: see text]3.8 billion years ago. However, the fundamental drivers of structural change responsible for the extraordinary diversity of proteins have yet to be elucidated. Here we explore if protein evolution affects folding speed. We estimated folding times for the present-day catalog of protein domains directly from their size-modified contact order. These values were mapped onto an evolutionary timeline of domain appearance derived from a phylogenomic analysis of protein domains in 989 fully-sequenced genomes. Our results show a clear overall increase of folding speed during evolution, with known ultra-fast downhill folders appearing rather late in the timeline. Remarkably, folding optimization depends on secondary structure. While alpha-folds showed a tendency to fold faster throughout evolution, beta-folds exhibited a trend of folding time increase during the last [Formula: see text]1.5 billion years that began during the "big bang" of domain combinations. As a consequence, these domain structures are on average slow folders today. Our results suggest that fast and efficient folding of domains shaped the universe of protein structure. This finding supports the hypothesis that optimization of the kinetic and thermodynamic accessibility of the native fold reduces protein aggregation propensities that hamper cellular functions. PMID:23341762
Path optimization for oil probe
NASA Astrophysics Data System (ADS)
Smith, O'Neil; Rahmes, Mark; Blue, Mark; Peter, Adrian
2014-05-01
We discuss a robust method for optimal oil probe path planning inspired by medical imaging. Horizontal wells require three-dimensional steering made possible by the rotary steerable capabilities of the system, which allows the hole to intersect multiple target shale gas zones. Horizontal "legs" can be over a mile long; the longer the exposure length, the more oil and natural gas is drained and the faster it can flow. More oil and natural gas can be produced with fewer wells and less surface disturbance. Horizontal drilling can help producers tap oil and natural gas deposits under surface areas where a vertical well cannot be drilled, such as under developed or environmentally sensitive areas. Drilling creates well paths which have multiple twists and turns to try to hit multiple accumulations from a single well location. Our algorithm can be used to augment current state of the art methods. Our goal is to obtain a 3D path with nodes describing the optimal route to the destination. This algorithm works with BIG data and saves cost in planning for probe insertion. Our solution may be able to help increase the energy extracted vs. input energy.
Environmental statistics and optimal regulation
NASA Astrophysics Data System (ADS)
Sivak, David; Thomson, Matt
2015-03-01
The precision with which an organism can detect its environment, and the timescale for and statistics of environmental change, will affect the suitability of different strategies for regulating protein levels in response to environmental inputs. We propose a general framework--here applied to the enzymatic regulation of metabolism in response to changing nutrient concentrations--to predict the optimal regulatory strategy given the statistics of fluctuations in the environment and measurement apparatus, and the costs associated with enzyme production. We find: (i) relative convexity of enzyme expression cost and benefit influences the fitness of thresholding or graded responses; (ii) intermediate levels of measurement uncertainty call for a sophisticated Bayesian decision rule; and (iii) in dynamic contexts, intermediate levels of uncertainty call for retaining memory of the past. Statistical properties of the environment, such as variability and correlation times, set optimal biochemical parameters, such as thresholds and decay rates in signaling pathways. Our framework provides a theoretical basis for interpreting molecular signal processing algorithms and a classification scheme that organizes known regulatory strategies and may help conceptualize heretofore unknown ones.
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.
Optimized Direct-Drive Uniformity
NASA Astrophysics Data System (ADS)
Marshall, F. J.; McKenty, P. W.; Kessler, T. J.; Forties, R.; Kelly, J. A.; Waxer, L. J.
2002-11-01
The means of optimizing direct-drive illumination uniformity in laser fusion implosions will be discussed. To provide the most-uniform drive, the target must be illuminated by smooth single beams, symmetrically placed on target, with the optimum beam shape. On the 60-beam OMEGA laser system these near-optimum, direct-drive illumination conditions have been achieved by smoothing each beam with 1-THz smoothing by spectral dispersion (SSD), which incorporates distributed phase plates (DPP's) and polarization smoothing (PS), and by the modified soccer-ball orientation of the beams. The current beam smoothing provides for unprecedented levels of direct-drive uniformity, approaching σ_rms ˜ 2% up to ℓ = 200 after ˜300 ps. The sensitivity of the illumination to beam shape has been studied, and a new set of DPP's have been designed and are being built to further optimize the uniformity on OMEGA. Also, the sensitivity of the drive to beam balance, beam pointing, and target positioning has been studied both by calculation and by performing target implosions allowing quantitative limits to be placed on all contributors. This work was supported by the U.S. Department of Energy Office of Inertial Confinement Fusion under Cooperative Agreement No. DE-FC03-92SF19460.
Automatic discovery of optimal classes
NASA Technical Reports Server (NTRS)
Cheeseman, Peter; Stutz, John; Freeman, Don; Self, Matthew
1986-01-01
A criterion, based on Bayes' theorem, is described that defines the optimal set of classes (a classification) for a given set of examples. This criterion is transformed into an equivalent minimum message length criterion with an intuitive information interpretation. This criterion does not require that the number of classes be specified in advance, this is determined by the data. The minimum message length criterion includes the message length required to describe the classes, so there is a built in bias against adding new classes unless they lead to a reduction in the message length required to describe the data. Unfortunately, the search space of possible classifications is too large to search exhaustively, so heuristic search methods, such as simulated annealing, are applied. Tutored learning and probabilistic prediction in particular cases are an important indirect result of optimal class discovery. Extensions to the basic class induction program include the ability to combine category and real value data, hierarchical classes, independent classifications and deciding for each class which attributes are relevant.
Optimizing adherence to antiretroviral therapy
Sahay, Seema; Reddy, K. Srikanth; Dhayarkar, Sampada
2011-01-01
HIV has now become a manageable chronic disease. However, the treatment outcomes may get hampered by suboptimal adherence to ART. Adherence optimization is a concrete reality in the wake of ‘universal access’ and it is imperative to learn lessons from various studies and programmes. This review examines current literature on ART scale up, treatment outcomes of the large scale programmes and the role of adherence therein. Social, behavioural, biological and programme related factors arise in the context of ART adherence optimization. While emphasis is laid on adherence, retention of patients under the care umbrella emerges as a major challenge. An in-depth understanding of patients’ health seeking behaviour and health care delivery system may be useful in improving adherence and retention of patients in care continuum and programme. A theoretical framework to address the barriers and facilitators has been articulated to identify problematic areas in order to intervene with specific strategies. Empirically tested objective adherence measurement tools and approaches to assess adherence in clinical/ programme settings are required. Strengthening of ART programmes would include appropriate policies for manpower and task sharing, integrating traditional health sector, innovations in counselling and community support. Implications for the use of theoretical model to guide research, clinical practice, community involvement and policy as part of a human rights approach to HIV disease is suggested. PMID:22310817
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.
Optimal Defaults and Active Decisions*
Carroll, Gabriel D.; Choi, James J.; Laibson, David; Madrian, Brigitte C.; Metrick, Andrew
2009-01-01
Defaults often have a large influence on consumer decisions. We identify an overlooked but practical alternative to defaults: requiring individuals to make an explicit choice for themselves. We study such “active decisions” in the context of 401(k) saving. We find that compelling new hires to make active decisions about 401(k) enrollment raises the initial fraction that enroll by 28 percentage points relative to a standard opt-in enrollment procedure, producing a savings distribution three months after hire that would take 30 months to achieve under standard enrollment. We also present a model of 401(k) enrollment and derive conditions under which the optimal enrollment regime is automatic enrollment (i.e., default enrollment), standard enrollment (i.e., default non-enrollment), or active decisions (i.e., no default and compulsory choice). Active decisions are optimal when consumers have a strong propensity to procrastinate and savings preferences are highly heterogeneous. Financial illiteracy, however, favors default enrollment over active decision enrollment. PMID:20041043
Optimization in fractional aircraft ownership
NASA Astrophysics Data System (ADS)
Septiani, R. D.; Pasaribu, H. M.; Soewono, E.; Fayalita, R. A.
2012-05-01
Fractional Aircraft Ownership is a new concept in flight ownership management system where each individual or corporation may own a fraction of an aircraft. In this system, the owners have privilege to schedule their flight according to their needs. Fractional management companies (FMC) manages all aspects of aircraft operations, including utilization of FMC's aircraft in combination of outsourced aircrafts. This gives the owners the right to enjoy the benefits of private aviations. However, FMC may have complicated business requirements that neither commercial airlines nor charter airlines faces. Here, optimization models are constructed to minimize the number of aircrafts in order to maximize the profit and to minimize the daily operating cost. In this paper, three kinds of demand scenarios are made to represent different flight operations from different types of fractional owners. The problems are formulated as an optimization of profit and a daily operational cost to find the optimum flight assignments satisfying the weekly and daily demand respectively from the owners. Numerical results are obtained by Genetic Algorithm method.
Piezoelectric transducer design via multiobjective optimization.
Fu, B; Hemsel, T; Wallaschek, J
2006-12-22
The design of piezoelectric transducers is usually based on single-objective optimization only. In most practical applications of piezoelectric transducers, however, there exist multiple design objectives that often are contradictory to each other by their very nature. It is impossible to find a solution at which each objective function gets its optimal value simultaneously. Our design approach is to first find a set of Pareto-optimal solutions, which can be considered to be best compromises among multiple design objectives. Among these Pareto-optimal solutions, the designer can then select the one solution which he considers to be the best one. In this paper we investigate the optimal design of a Langevin transducer. The design problem is formulated mathematically as a constrained multiobjective optimization problem. The maximum vibration amplitude and the minimum electrical input power are considered as optimization objectives. Design variables involve continuous variables (dimensions of the transducer) and discrete variables (the number of piezoelectric rings and material types). In order to formulate the optimization problem, the behavior of piezoelectric transducers is modeled using the transfer matrix method based on analytical models. Multiobjective evolutionary algorithms are applied in the optimization process and a set of Pareto-optimal designs is calculated. The optimized results are analyzed and the preferred design is determined. PMID:16814826
Optimal design of compact spur gear reductions
NASA Technical Reports Server (NTRS)
Savage, M.; Lattime, S. B.; Kimmel, J. A.; Coe, H. H.
1992-01-01
The optimal design of compact spur gear reductions includes the selection of bearing and shaft proportions in addition to gear mesh parameters. Designs for single mesh spur gear reductions are based on optimization of system life, system volume, and system weight including gears, support shafts, and the four bearings. The overall optimization allows component properties to interact, yielding the best composite design. A modified feasible directions search algorithm directs the optimization through a continuous design space. Interpolated polynomials expand the discrete bearing properties and proportions into continuous variables for optimization. After finding the continuous optimum, the designer can analyze near optimal designs for comparison and selection. Design examples show the influence of the bearings on the optimal configurations.
Optimal Appearance Model for Visual Tracking
Wang, Yuru; Jiang, Longkui; Liu, Qiaoyuan; Yin, Minghao
2016-01-01
Many studies argue that integrating multiple cues in an adaptive way increases tracking performance. However, what is the definition of adaptiveness and how to realize it remains an open issue. On the premise that the model with optimal discriminative ability is also optimal for tracking the target, this work realizes adaptiveness and robustness through the optimization of multi-cue integration models. Specifically, based on prior knowledge and current observation, a set of discrete samples are generated to approximate the foreground and background distribution. With the goal of optimizing the classification margin, an objective function is defined, and the appearance model is optimized by introducing optimization algorithms. The proposed optimized appearance model framework is embedded into a particle filter for a field test, and it is demonstrated to be robust against various kinds of complex tracking conditions. This model is general and can be easily extended to other parameterized multi-cue models. PMID:26789639
Optimal Appearance Model for Visual Tracking.
Wang, Yuru; Jiang, Longkui; Liu, Qiaoyuan; Yin, Minghao
2016-01-01
Many studies argue that integrating multiple cues in an adaptive way increases tracking performance. However, what is the definition of adaptiveness and how to realize it remains an open issue. On the premise that the model with optimal discriminative ability is also optimal for tracking the target, this work realizes adaptiveness and robustness through the optimization of multi-cue integration models. Specifically, based on prior knowledge and current observation, a set of discrete samples are generated to approximate the foreground and background distribution. With the goal of optimizing the classification margin, an objective function is defined, and the appearance model is optimized by introducing optimization algorithms. The proposed optimized appearance model framework is embedded into a particle filter for a field test, and it is demonstrated to be robust against various kinds of complex tracking conditions. This model is general and can be easily extended to other parameterized multi-cue models. PMID:26789639
Time-response-based evolutionary optimization
NASA Astrophysics Data System (ADS)
Avigad, Gideon; Goldvard, Alex; Salomon, Shaul
2015-04-01
Solutions to engineering problems are often evaluated by considering their time responses; thus, each solution is associated with a function. To avoid optimizing the functions, such optimization is usually carried out by setting auxiliary objectives (e.g. minimal overshoot). Therefore, in order to find different optimal solutions, alternative auxiliary optimization objectives may have to be defined prior to optimization. In the current study, a new approach is suggested that avoids the need to define auxiliary objectives. An algorithm is suggested that enables the optimization of solutions according to their transient behaviours. For this optimization, the functions are sampled and the problem is posed as a multi-objective problem. The recently introduced algorithm NSGA-II-PSA is adopted and tailored to solve it. Mathematical as well as engineering problems are utilized to explain and demonstrate the approach and its applicability to real life problems. The results highlight the advantages of avoiding the definition of artificial objectives.
Li, Zukui; Ding, Ran; Floudas, Christodoulos A.
2011-01-01
Robust counterpart optimization techniques for linear optimization and mixed integer linear optimization problems are studied in this paper. Different uncertainty sets, including those studied in literature (i.e., interval set; combined interval and ellipsoidal set; combined interval and polyhedral set) and new ones (i.e., adjustable box; pure ellipsoidal; pure polyhedral; combined interval, ellipsoidal, and polyhedral set) are studied in this work and their geometric relationship is discussed. For uncertainty in the left hand side, right hand side, and objective function of the optimization problems, robust counterpart optimization formulations induced by those different uncertainty sets are derived. Numerical studies are performed to compare the solutions of the robust counterpart optimization models and applications in refinery production planning and batch process scheduling problem are presented. PMID:21935263
OPTIMIZING THROUGH CO-EVOLUTIONARY AVALANCHES
S. BOETTCHER; A. PERCUS
2000-08-01
We explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problems. The method, called extremal optimization, is inspired by ''self-organized critically,'' a concept introduced to describe emergent complexity in many physical systems. In contrast to Genetic Algorithms which operate on an entire ''gene-pool'' of possible solutions, extremal optimization successively replaces extremely undesirable elements of a sub-optimal solution with new, random ones. Large fluctuations, called ''avalanches,'' ensue that efficiently explore many local optima. Drawing upon models used to simulate far-from-equilibrium dynamics, extremal optimization complements approximation methods inspired by equilibrium statistical physics, such as simulated annealing. With only one adjustable parameter, its performance has proved competitive with more elaborate methods, especially near phase transitions. Those phase transitions are found in the parameter space of most optimization problems, and have recently been conjectured to be the origin of some of the hardest instances in computational complexity. We will demonstrate how extremal optimization can be implemented for a variety of combinatorial optimization problems. We believe that extremal optimization will be a useful tool in the investigation of phase transitions in combinatorial optimization problems, hence valuable in elucidating the origin of computational complexity.
Experimental validation of structural optimization methods
NASA Technical Reports Server (NTRS)
Adelman, Howard M.
1992-01-01
The topic of validating structural optimization methods by use of experimental results is addressed. The need for validating the methods as a way of effecting a greater and an accelerated acceptance of formal optimization methods by practicing engineering designers is described. The range of validation strategies is defined which includes comparison of optimization results with more traditional design approaches, establishing the accuracy of analyses used, and finally experimental validation of the optimization results. Examples of the use of experimental results to validate optimization techniques are described. The examples include experimental validation of the following: optimum design of a trussed beam; combined control-structure design of a cable-supported beam simulating an actively controlled space structure; minimum weight design of a beam with frequency constraints; minimization of the vibration response of helicopter rotor blade; minimum weight design of a turbine blade disk; aeroelastic optimization of an aircraft vertical fin; airfoil shape optimization for drag minimization; optimization of the shape of a hole in a plate for stress minimization; optimization to minimize beam dynamic response; and structural optimization of a low vibration helicopter rotor.
Bayesian approach to global discrete optimization
Mockus, J.; Mockus, A.; Mockus, L.
1994-12-31
We discuss advantages and disadvantages of the Bayesian approach (average case analysis). We present the portable interactive version of software for continuous global optimization. We consider practical multidimensional problems of continuous global optimization, such as optimization of VLSI yield, optimization of composite laminates, estimation of unknown parameters of bilinear time series. We extend Bayesian approach to discrete optimization. We regard the discrete optimization as a multi-stage decision problem. We assume that there exists some simple heuristic function which roughly predicts the consequences of the decisions. We suppose randomized decisions. We define the probability of the decision by the randomized decision function depending on heuristics. We fix this function with exception of some parameters. We repeat the randomized decision several times at the fixed values of those parameters and accept the best decision as the result. We optimize the parameters of the randomized decision function to make the search more efficient. Thus we reduce the discrete optimization problem to the continuous problem of global stochastic optimization. We solve this problem by the Bayesian methods of continuous global optimization. We describe the applications to some well known An problems of discrete programming, such as knapsack, traveling salesman, and scheduling.
Evolutionary Optimization of a Geometrically Refined Truss
NASA Technical Reports Server (NTRS)
Hull, P. V.; Tinker, M. L.; Dozier, G. V.
2007-01-01
Structural optimization is a field of research that has experienced noteworthy growth for many years. Researchers in this area have developed optimization tools to successfully design and model structures, typically minimizing mass while maintaining certain deflection and stress constraints. Numerous optimization studies have been performed to minimize mass, deflection, and stress on a benchmark cantilever truss problem. Predominantly traditional optimization theory is applied to this problem. The cross-sectional area of each member is optimized to minimize the aforementioned objectives. This Technical Publication (TP) presents a structural optimization technique that has been previously applied to compliant mechanism design. This technique demonstrates a method that combines topology optimization, geometric refinement, finite element analysis, and two forms of evolutionary computation: genetic algorithms and differential evolution to successfully optimize a benchmark structural optimization problem. A nontraditional solution to the benchmark problem is presented in this TP, specifically a geometrically refined topological solution. The design process begins with an alternate control mesh formulation, multilevel geometric smoothing operation, and an elastostatic structural analysis. The design process is wrapped in an evolutionary computing optimization toolset.
Evolutionary optimization of a Genetically Refined Truss
NASA Technical Reports Server (NTRS)
Hull, Patrick V.; Tinker, Michael L.; Dozier, Gerry
2005-01-01
Structural optimization is a field of research that has experienced noteworthy growth for many years. Researchers in this area have developed optimization tools to successfully design and model structures, typically minimizing mass while maintaining certain deflection and stress constraints. Numerous optimization studies have been performed to minimize mass, deflection and stress on a benchmark cantilever truss problem. Predominantly traditional optimization theory is applied to this problem. The cross-sectional area of each member is optimized to minimize the aforementioned objectives. This paper will present a structural optimization technique that has been previously applied to compliant mechanism design. This technique demonstrates a method that combines topology optimization, geometric refinement, finite element analysis, and two forms of evolutionary computation: Genetic Algorithms and Differential Evolution to successfully optimize a benchmark structural optimization problem. An non-traditional solution to the benchmark problem is presented in this paper, specifically a geometrically refined topological solution. The design process begins with an alternate control mesh formulation, multilevel geometric smoothing operation, and an elastostatic structural analysis. The design process is wrapped in an evolutionary computing optimization toolset.
Trajectory optimization for the National Aerospace Plane
NASA Technical Reports Server (NTRS)
Lu, Ping
1993-01-01
The objective of this second phase research is to investigate the optimal ascent trajectory for the National Aerospace Plane (NASP) from runway take-off to orbital insertion and address the unique problems associated with the hypersonic flight trajectory optimization. The trajectory optimization problem for an aerospace plane is a highly challenging problem because of the complexity involved. Previous work has been successful in obtaining sub-optimal trajectories by using energy-state approximation and time-scale decomposition techniques. But it is known that the energy-state approximation is not valid in certain portions of the trajectory. This research aims at employing full dynamics of the aerospace plane and emphasizing direct trajectory optimization methods. The major accomplishments of this research include the first-time development of an inverse dynamics approach in trajectory optimization which enables us to generate optimal trajectories for the aerospace plane efficiently and reliably, and general analytical solutions to constrained hypersonic trajectories that has wide application in trajectory optimization as well as in guidance and flight dynamics. Optimal trajectories in abort landing and ascent augmented with rocket propulsion and thrust vectoring control were also investigated. Motivated by this study, a new global trajectory optimization tool using continuous simulated annealing and a nonlinear predictive feedback guidance law have been under investigation and some promising results have been obtained, which may well lead to more significant development and application in the near future.
The Optimal Gravitational Lens Telescope
NASA Astrophysics Data System (ADS)
Surdej, J.; Delacroix, C.; Coleman, P.; Dominik, M.; Habraken, S.; Hanot, C.; Le Coroller, H.; Mawet, D.; Quintana, H.; Sadibekova, T.; Sluse, D.
2010-05-01
Given an observed gravitational lens mirage produced by a foreground deflector (cf. galaxy, quasar, cluster, ...), it is possible via numerical lens inversion to retrieve the real source image, taking full advantage of the magnifying power of the cosmic lens. This has been achieved in the past for several remarkable gravitational lens systems. Instead, we propose here to invert an observed multiply imaged source directly at the telescope using an ad hoc optical instrument which is described in the present paper. Compared to the previous method, this should allow one to detect fainter source features as well as to use such an optimal gravitational lens telescope to explore even fainter objects located behind and near the lens. Laboratory and numerical experiments illustrate this new approach.
Optimizing human factors in dentistry
Gupta, Arpit; Ankola, Anil V.; Hebbal, Mamata
2013-01-01
Occupational health hazards among dental professionals are on a continuous rise and they have a significant negative overall impact on daily life. This review is intended to provide the information regarding risk factors and to highlight the prevention strategies for optimizing human factors in dentistry. Risk factors among dentists are multifactorial, which can be categorized into biomechanical and psychosocial. To achieve a realistic target of safety and health at work, prevention is clearly the best approach; therefore, musculoskeletal disorders can be reduced through proper positioning of dental worker and patient, regular rest breaks, general good health, using ergonomic equipment, and exercises designed to counteract the particular risk factors for the dental occupation. However, substantial evidences are still required to elucidate the potential risk factors and to formulate effective prevention programs. PMID:23946745
Optimal kicking of a trampolinist.
Chen, Jing; Guo, Hongmei; Gao, Zhipeng; An, Meiwen; Wang, Xiaojun; Chen, Weiyi
2016-08-01
This work aims to create a mathematical model by using kinematical equations that can describe the landing-jump of a trampoline performance. In this model, the trampolinist was assumed to be a combination of two parts of masses. The landing process (from the time trampolinist touches the net to the deepest location) was discretized into two stages. During these two stages, the trampolinist exerts different internal forces. Analyzing the kinematics of the abovementioned two stages, we obtained the numerical solutions for the optimum loading time and loading force of the trampolinist to get the deepest landing location. This work has potential for guiding a trampolinist in developing his/her personalized optimal strategy for exerting force during landing on the trampoline. PMID:27132153
Demonstration of integrated optimization software
2008-01-01
NeuCO has designed and demonstrated the integration of five system control modules using its proprietary ProcessLink{reg_sign} technology of neural networks, advanced algorithms and fuzzy logic to maximize performance of coal-fired plants. The separate modules control cyclone combustion, sootblowing, SCR operations, performance and equipment maintenance. ProcessLink{reg_sign} provides overall plant-level integration of controls responsive to plant operator and corporate criteria. Benefits of an integrated approach include NOx reduction improvement in heat rate, availability, efficiency and reliability; extension of SCR catalyst life; and reduced consumption of ammonia. All translate into cost savings. As plant complexity increases through retrofit, repowering or other plant modifications, this integrated process optimization approach will be an important tool for plant operators. 1 fig., 1 photo.
Optimal screening for genetic diseases.
Nævdal, Eric
2014-12-01
Screening for genetic diseases is performed in many regions and/or ethnic groups where there is a high prevalence of possibly malign genes. The propagation of such genes can be considered a dynamic externality. Given that many of these diseases are untreatable and give rise to truly tragic outcomes, they are a source of societal concern, and the screening process should perhaps be regulated. This paper incorporates a standard model of genetic propagation into an economic model of dynamic management to derive cost benefit rules for optimal screening. The highly non-linear nature of genetic dynamics gives rise to perhaps surprising results that include discontinuous controls and threshold effects. One insight is that any screening program that is in place for any amount of time should screen all individuals in a target population. The incorporation of genetic models may prove to be useful to several emerging fields in economics such as genoeconomics, neuroeconomics and paleoeconomics. PMID:25203815
Demystifying optimal dynamic treatment regimes.
Moodie, Erica E M; Richardson, Thomas S; Stephens, David A
2007-06-01
A dynamic regime is a function that takes treatment and covariate history and baseline covariates as inputs and returns a decision to be made. Murphy (2003, Journal of the Royal Statistical Society, Series B 65, 331-366) and Robins (2004, Proceedings of the Second Seattle Symposium on Biostatistics, 189-326) have proposed models and developed semiparametric methods for making inference about the optimal regime in a multi-interval trial that provide clear advantages over traditional parametric approaches. We show that Murphy's model is a special case of Robins's and that the methods are closely related but not equivalent. Interesting features of the methods are highlighted using the Multicenter AIDS Cohort Study and through simulation. PMID:17688497
THE OPTIMAL GRAVITATIONAL LENS TELESCOPE
Surdej, J.; Hanot, C.; Sadibekova, T.; Delacroix, C.; Habraken, S.; Coleman, P.; Dominik, M.; Le Coroller, H.; Mawet, D.; Quintana, H.; Sluse, D.
2010-05-15
Given an observed gravitational lens mirage produced by a foreground deflector (cf. galaxy, quasar, cluster, ...), it is possible via numerical lens inversion to retrieve the real source image, taking full advantage of the magnifying power of the cosmic lens. This has been achieved in the past for several remarkable gravitational lens systems. Instead, we propose here to invert an observed multiply imaged source directly at the telescope using an ad hoc optical instrument which is described in the present paper. Compared to the previous method, this should allow one to detect fainter source features as well as to use such an optimal gravitational lens telescope to explore even fainter objects located behind and near the lens. Laboratory and numerical experiments illustrate this new approach.
Actuator-valve interface optimization
Burchett, O.L.; Jones, R.L.
1986-01-01
A computer code, Actuator Valve Response (AVR), has been developed to optimize the explosive actuator-valve interface parameters so that the valve plunger velocity is at a maximum when the plunger reaches the valve tubes. The code considers three forces to act on the valve plunger before the plunger reaches the valve tubes. These are the pressure force produced by the actuator, the shear force necessary to shear the seal disks on the actuator and the valve plunger, and the friction force caused by friction between the plunger and the plunger bore. The three forces are modeled by expressions that are explicitly functions of the plunger displacement. A particular actuator-valve combination was analyzed with the computer code AVR with four different combinations of valve plunger seal disk shear strength and initial friction force. (LEW)
Optimization of data life cycles
NASA Astrophysics Data System (ADS)
Jung, C.; Gasthuber, M.; Giesler, A.; Hardt, M.; Meyer, J.; Rigoll, F.; Schwarz, K.; Stotzka, R.; Streit, A.
2014-06-01
Data play a central role in most fields of science. In recent years, the amount of data from experiment, observation, and simulation has increased rapidly and data complexity has grown. Also, communities and shared storage have become geographically more distributed. Therefore, methods and techniques applied to scientific data need to be revised and partially be replaced, while keeping the community-specific needs in focus. The German Helmholtz Association project "Large Scale Data Management and Analysis" (LSDMA) aims to maximize the efficiency of data life cycles in different research areas, ranging from high energy physics to systems biology. In its five Data Life Cycle Labs (DLCLs), data experts closely collaborate with the communities in joint research and development to optimize the respective data life cycle. In addition, the Data Services Integration Team (DSIT) provides data analysis tools and services which are common to several DLCLs. This paper describes the various activities within LSDMA and focuses on the work performed in the DLCLs.
HCCI Engine Optimization and Control
Rolf D. Reitz
2005-09-30
The goal of this project was to develop methods to optimize and control Homogeneous-Charge Compression Ignition (HCCI) engines, with emphasis on diesel-fueled engines. HCCI offers the potential of nearly eliminating IC engine NOx and particulate emissions at reduced cost over Compression Ignition Direct Injection engines (CIDI) by controlling pollutant emissions in-cylinder. The project was initiated in January, 2002, and the present report is the final report for work conducted on the project through December 31, 2004. Periodic progress has also been reported at bi-annual working group meetings held at USCAR, Detroit, MI, and at the Sandia National Laboratories. Copies of these presentation materials are available on CD-ROM, as distributed by the Sandia National Labs. In addition, progress has been documented in DOE Advanced Combustion Engine R&D Annual Progress Reports for FY 2002, 2003 and 2004. These reports are included as the Appendices in this Final report.
Optimal monitoring of computer networks
Fedorov, V.V.; Flanagan, D.
1997-08-01
The authors apply the ideas from optimal design theory to the very specific area of monitoring large computer networks. The behavior of these networks is so complex and uncertain that it is quite natural to use the statistical methods of experimental design which were originated in such areas as biology, behavioral sciences and agriculture, where the random character of phenomena is a crucial component and systems are too complicated to be described by some sophisticated deterministic models. They want to emphasize that only the first steps have been completed, and relatively simple underlying concepts about network functions have been used. Their immediate goal is to initiate studies focused on developing efficient experimental design techniques which can be used by practitioners working with large networks operating and evolving in a random environment.
Low thrust optimal orbital transfers
NASA Technical Reports Server (NTRS)
Cobb, Shannon S.
1994-01-01
For many optimal transfer problems it is reasonable to expect that the minimum time solution is also the minimum fuel solution. However, if one allows the propulsion system to be turned off and back on, it is clear that these two solutions may differ. In general, high thrust transfers resemble the well known impulsive transfers where the burn arcs are of very short duration. The low and medium thrust transfers differ in that their thrust acceleration levels yield longer burn arcs and thus will require more revolutions. In this research, we considered two approaches for solving this problem: a powered flight guidance algorithm previously developed for higher thrust transfers was modified and an 'averaging technique' was investigated.
Optimizing SNAP for Weak Lensing
NASA Astrophysics Data System (ADS)
High, F. W.; Ellis, R. S.; Massey, R. J.; Rhodes, J. D.; Lamoureux, J. I.; SNAP Collaboration
2004-12-01
The Supernova/Acceleration Probe (SNAP) satellite proposes to measure weak gravitational lensing in addition to type Ia supernovae. Its pixel scale has been set to 0.10 arcsec per pixel as established by the needs of supernova observations. To find the optimal pixel scale for accurate weak lensing measurements we conduct a tradeoff study in which, via simulations, we fix the suvey size in total pixels and vary the pixel scale. Our preliminary results show that with a smaller scale of about 0.08 arcsec per pixel we can minimize the contribution of intrinsic shear variance to the error on the power spectrum of mass density distortion. Currently we are testing the robustness of this figure as well as determining whether dithering yields analogous results.
Optimization of multiple flyby trajectories
NASA Technical Reports Server (NTRS)
Damario, L. A.; Sackett, L. L.; Stanford, R. H.; Byrnes, D. V.
1979-01-01
A procedure has been developed which minimizes total delta-V (instantaneous velocity change) for a multiple flyby trajectory with constraints on flyby altitude and orientation. The solution is found by varying the locations of maneuver points between each flyby to minimize the delta-Vs at the maneuver points. Each trajectory segment connecting consecutive maneuver points is found by solving an N-body analog to Lambert's problem. Multiconic techniques are used for trajectory propagation and for computation of the state transition matrix. The constrained parameter optimization problem is converted to an unconstrained problem by means of penalty functions and then solved with a quasi-Newton algorithm utilizing analytic first derivatives. This procedure has been successfully applied to Galileo satellite tour trajectories.
On Optimal Bilinear Quadrilateral Meshes
D'Azevedo, E.
1998-10-26
The novelty of this work is in presenting interesting error properties of two types of asymptotically optimal quadrilateral meshes for bilinear approximation. The first type of mesh has an error equidistributing property where the maximum interpolation error is asymptotically the same over all elements. The second type has faster than expected super-convergence property for certain saddle-shaped data functions. The super-convergent mesh may be an order of magnitude more accurate than the error equidistributing mesh. Both types of mesh are generated by a coordinate transformation of a regular mesh of squares. The coordinate transformation is derived by interpreting the Hessian matrix of a data function as a metric tensor. The insights in this work may have application in mesh design near known corner or point singularities.
On Optimal Bilinear Quadrilateral Meshes
D'Azevedo, E
2000-03-17
The novelty of this work is in presenting interesting error properties of two types of asymptotically ''optimal'' quadrilateral meshes for bilinear approximation. The first type of mesh has an error equidistributing property where the maximum interpolation error is asymptotically the same over all elements. The second type has faster than expected ''super-convergence'' property for certain saddle-shaped data functions. The ''superconvergent'' mesh may be an order of magnitude more accurate than the error equidistributing mesh. Both types of mesh are generated by a coordinate transformation of a regular mesh of squares. The coordinate transformation is derived by interpreting the Hessian matrix of a data function as a metric tensor. The insights in this work may have application in mesh design near corner or point singularities.
Hybrid Optimization Parallel Search PACKage
Energy Science and Technology Software Center (ESTSC)
2009-11-10
HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework providesmore » a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, a useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.« less
Foraging optimally for home ranges
Mitchell, Michael S.; Powell, Roger A.
2012-01-01
Economic models predict behavior of animals based on the presumption that natural selection has shaped behaviors important to an animal's fitness to maximize benefits over costs. Economic analyses have shown that territories of animals are structured by trade-offs between benefits gained from resources and costs of defending them. Intuitively, home ranges should be similarly structured, but trade-offs are difficult to assess because there are no costs of defense, thus economic models of home-range behavior are rare. We present economic models that predict how home ranges can be efficient with respect to spatially distributed resources, discounted for travel costs, under 2 strategies of optimization, resource maximization and area minimization. We show how constraints such as competitors can influence structure of homes ranges through resource depression, ultimately structuring density of animals within a population and their distribution on a landscape. We present simulations based on these models to show how they can be generally predictive of home-range behavior and the mechanisms that structure the spatial distribution of animals. We also show how contiguous home ranges estimated statistically from location data can be misleading for animals that optimize home ranges on landscapes with patchily distributed resources. We conclude with a summary of how we applied our models to nonterritorial black bears (Ursus americanus) living in the mountains of North Carolina, where we found their home ranges were best predicted by an area-minimization strategy constrained by intraspecific competition within a social hierarchy. Economic models can provide strong inference about home-range behavior and the resources that structure home ranges by offering falsifiable, a priori hypotheses that can be tested with field observations.
Optimal Conservation of Migratory Species
Martin, Tara G.; Chadès, Iadine; Arcese, Peter; Marra, Peter P.; Possingham, Hugh P.; Norris, D. Ryan
2007-01-01
Background Migratory animals comprise a significant portion of biodiversity worldwide with annual investment for their conservation exceeding several billion dollars. Designing effective conservation plans presents enormous challenges. Migratory species are influenced by multiple events across land and sea–regions that are often separated by thousands of kilometres and span international borders. To date, conservation strategies for migratory species fail to take into account how migratory animals are spatially connected between different periods of the annual cycle (i.e. migratory connectivity) bringing into question the utility and efficiency of current conservation efforts. Methodology/Principal Findings Here, we report the first framework for determining an optimal conservation strategy for a migratory species. Employing a decision theoretic approach using dynamic optimization, we address the problem of how to allocate resources for habitat conservation for a Neotropical-Nearctic migratory bird, the American redstart Setophaga ruticilla, whose winter habitat is under threat. Our first conservation strategy used the acquisition of winter habitat based on land cost, relative bird density, and the rate of habitat loss to maximize the abundance of birds on the wintering grounds. Our second strategy maximized bird abundance across the entire range of the species by adding the constraint of maintaining a minimum percentage of birds within each breeding region in North America using information on migratory connectivity as estimated from stable-hydrogen isotopes in feathers. We show that failure to take into account migratory connectivity may doom some regional populations to extinction, whereas including information on migratory connectivity results in the protection of the species across its entire range. Conclusions/Significance We demonstrate that conservation strategies for migratory animals depend critically upon two factors: knowledge of migratory
Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization
NASA Technical Reports Server (NTRS)
Sobieszczanski-Sobieski, Jaroslaw; Venter, Gerhard
2002-01-01
The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.
Gschwind, Michael K
2013-07-23
Mechanisms for aggressively optimizing computer code are provided. With these mechanisms, a compiler determines an optimization to apply to a portion of source code and determines if the optimization as applied to the portion of source code will result in unsafe optimized code that introduces a new source of exceptions being generated by the optimized code. In response to a determination that the optimization is an unsafe optimization, the compiler generates an aggressively compiled code version, in which the unsafe optimization is applied, and a conservatively compiled code version in which the unsafe optimization is not applied. The compiler stores both versions and provides them for execution. Mechanisms are provided for switching between these versions during execution in the event of a failure of the aggressively compiled code version. Moreover, predictive mechanisms are provided for predicting whether such a failure is likely.
An overview of the optimization modelling applications
NASA Astrophysics Data System (ADS)
Singh, Ajay
2012-10-01
SummaryThe optimal use of available resources is of paramount importance in the backdrop of the increasing food, fiber, and other demands of the burgeoning global population and the shrinking resources. The optimal use of these resources can be determined by employing an optimization technique. The comprehensive reviews on the use of various programming techniques for the solution of different optimization problems have been provided in this paper. The past reviews are grouped into nine sections based on the solutions of the theme-based real world problems. The sections include: use of optimization modelling for conjunctive use planning, groundwater management, seawater intrusion management, irrigation management, achieving optimal cropping pattern, management of reservoir systems operation, management of resources in arid and semi-arid regions, solid waste management, and miscellaneous uses which comprise, managing problems of hydropower generation and sugar industry. Conclusions are drawn where gaps exist and more research needs to be focused.
Time optimal paths for high speed maneuvering
Reister, D.B.; Lenhart, S.M.
1993-01-01
Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature of the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.
Translator for Optimizing Fluid-Handling Components
NASA Technical Reports Server (NTRS)
Landon, Mark; Perry, Ernest
2007-01-01
A software interface has been devised to facilitate optimization of the shapes of valves, elbows, fittings, and other components used to handle fluids under extreme conditions. This software interface translates data files generated by PLOT3D (a NASA grid-based plotting-and- data-display program) and by computational fluid dynamics (CFD) software into a format in which the files can be read by Sculptor, which is a shape-deformation- and-optimization program. Sculptor enables the user to interactively, smoothly, and arbitrarily deform the surfaces and volumes in two- and three-dimensional CFD models. Sculptor also includes design-optimization algorithms that can be used in conjunction with the arbitrary-shape-deformation components to perform automatic shape optimization. In the optimization process, the output of the CFD software is used as feedback while the optimizer strives to satisfy design criteria that could include, for example, improved values of pressure loss, velocity, flow quality, mass flow, etc.
Analytical and Computational Aspects of Collaborative Optimization
NASA Technical Reports Server (NTRS)
Alexandrov, Natalia M.; Lewis, Robert Michael
2000-01-01
Bilevel problem formulations have received considerable attention as an approach to multidisciplinary optimization in engineering. We examine the analytical and computational properties of one such approach, collaborative optimization. The resulting system-level optimization problems suffer from inherent computational difficulties due to the bilevel nature of the method. Most notably, it is impossible to characterize and hence identify solutions of the system-level problems because the standard first-order conditions for solutions of constrained optimization problems do not hold. The analytical features of the system-level problem make it difficult to apply conventional nonlinear programming algorithms. Simple examples illustrate the analysis and the algorithmic consequences for optimization methods. We conclude with additional observations on the practical implications of the analytical and computational properties of collaborative optimization.
Topology Optimization for Architected Materials Design
NASA Astrophysics Data System (ADS)
Osanov, Mikhail; Guest, James K.
2016-07-01
Advanced manufacturing processes provide a tremendous opportunity to fabricate materials with precisely defined architectures. To fully leverage these capabilities, however, materials architectures must be optimally designed according to the target application, base material used, and specifics of the fabrication process. Computational topology optimization offers a systematic, mathematically driven framework for navigating this new design challenge. The design problem is posed and solved formally as an optimization problem with unit cell and upscaling mechanics embedded within this formulation. This article briefly reviews the key requirements to apply topology optimization to materials architecture design and discusses several fundamental findings related to optimization of elastic, thermal, and fluidic properties in periodic materials. Emerging areas related to topology optimization for manufacturability and manufacturing variations, nonlinear mechanics, and multiscale design are also discussed.
Back to the future: nostalgia increases optimism.
Cheung, Wing-Yee; Wildschut, Tim; Sedikides, Constantine; Hepper, Erica G; Arndt, Jamie; Vingerhoets, Ad J J M
2013-11-01
This research examined the proposition that nostalgia is not simply a past-oriented emotion, but its scope extends into the future, and, in particular, a positive future. We adopted a convergent validation approach, using multiple methods to assess the relation between nostalgia and optimism. Study 1 tested whether nostalgic narratives entail traces of optimism; indeed, nostalgic (compared with ordinary) narratives contained more expressions of optimism. Study 2 manipulated nostalgia through the recollection of nostalgic (vs. ordinary) events, and showed that nostalgia boosts optimism. Study 3 demonstrated that the effect of nostalgia (induced with nomothetically relevant songs) on optimism is mediated by self-esteem. Finally, Study 4 established that nostalgia (induced with idiographically relevant lyrics) fosters social connectedness, which subsequently increases self-esteem, which then boosts optimism. The nostalgic experience is inherently optimistic and paints a subjectively rosier future. PMID:23928397
Tractable Pareto Optimization of Temporal Preferences
NASA Technical Reports Server (NTRS)
Morris, Robert; Morris, Paul; Khatib, Lina; Venable, Brent
2003-01-01
This paper focuses on temporal constraint problems where the objective is to optimize a set of local preferences for when events occur. In previous work, a subclass of these problems has been formalized as a generalization of Temporal CSPs, and a tractable strategy for optimization has been proposed, where global optimality is defined as maximizing the minimum of the component preference values. This criterion for optimality, which we call 'Weakest Link Optimization' (WLO), is known to have limited practical usefulness because solutions are compared only on the basis of their worst value; thus, there is no requirement to improve the other values. To address this limitation, we introduce a new algorithm that re-applies WLO iteratively in a way that leads to improvement of all the values. We show the value of this strategy by proving that, with suitable preference functions, the resulting solutions are Pareto Optimal.
Optimal measurements in phase estimation: simple examples
NASA Astrophysics Data System (ADS)
Wasak, Tomasz; Smerzi, Augusto; Pezzé, Luca; Chwedeńczuk, Jan
2016-05-01
We identify optimal measurement strategies for phase estimation in different scenarios in which the interferometer acts on two-mode symmetric states. For pure states of a single qubit, we show that optimal measurements form a broad set parametrized with a continuous variable. When the state is mixed, this set reduces to merely two possible measurements. For two-qubit symmetric Werner state, we find the optimal measurement and show that estimation from the population imbalance is optimal only if the state is pure. We also determine the optimal measurements for a wide class of symmetric N-qubit Werner-like states. Finally, for a pure symmetric state of N qubits, we find under which conditions the estimation from the full N-body correlation and from the population imbalance is optimal.
Piezoresistive Cantilever Performance—Part II: Optimization
Park, Sung-Jin; Doll, Joseph C.; Rastegar, Ali J.; Pruitt, Beth L.
2010-01-01
Piezoresistive silicon cantilevers fabricated by ion implantation are frequently used for force, displacement, and chemical sensors due to their low cost and electronic readout. However, the design of piezoresistive cantilevers is not a straightforward problem due to coupling between the design parameters, constraints, process conditions, and performance. We systematically analyzed the effect of design and process parameters on force resolution and then developed an optimization approach to improve force resolution while satisfying various design constraints using simulation results. The combined simulation and optimization approach is extensible to other doping methods beyond ion implantation in principle. The optimization results were validated by fabricating cantilevers with the optimized conditions and characterizing their performance. The measurement results demonstrate that the analytical model accurately predicts force and displacement resolution, and sensitivity and noise tradeoff in optimal cantilever performance. We also performed a comparison between our optimization technique and existing models and demonstrated eight times improvement in force resolution over simplified models. PMID:20333323
Social optimality in quantum Bayesian games
NASA Astrophysics Data System (ADS)
Iqbal, Azhar; Chappell, James M.; Abbott, Derek
2015-10-01
A significant aspect of the study of quantum strategies is the exploration of the game-theoretic solution concept of the Nash equilibrium in relation to the quantization of a game. Pareto optimality is a refinement on the set of Nash equilibria. A refinement on the set of Pareto optimal outcomes is known as social optimality in which the sum of players' payoffs is maximized. This paper analyzes social optimality in a Bayesian game that uses the setting of generalized Einstein-Podolsky-Rosen experiments for its physical implementation. We show that for the quantum Bayesian game a direct connection appears between the violation of Bell's inequality and the social optimal outcome of the game and that it attains a superior socially optimal outcome.
Options for Robust Airfoil Optimization under Uncertainty
NASA Technical Reports Server (NTRS)
Padula, Sharon L.; Li, Wu
2002-01-01
A robust optimization method is developed to overcome point-optimization at the sampled design points. This method combines the best features from several preliminary methods proposed by the authors and their colleagues. The robust airfoil shape optimization is a direct method for drag reduction over a given range of operating conditions and has three advantages: (1) it prevents severe degradation in the off-design performance by using a smart descent direction in each optimization iteration, (2) it uses a large number of spline control points as design variables yet the resulting airfoil shape does not need to be smoothed, and (3) it allows the user to make a tradeoff between the level of optimization and the amount of computing time consumed. For illustration purposes, the robust optimization method is used to solve a lift-constrained drag minimization problem for a two-dimensional (2-D) airfoil in Euler flow with 20 geometric design variables.
Aerospace Applications of Optimization under Uncertainty
NASA Technical Reports Server (NTRS)
Padula, Sharon; Gumbert, Clyde; Li, Wu
2003-01-01
The Multidisciplinary Optimization (MDO) Branch at NASA Langley Research Center develops new methods and investigates opportunities for applying optimization to aerospace vehicle design. This paper describes MDO Branch experiences with three applications of optimization under uncertainty: (1) improved impact dynamics for airframes, (2) transonic airfoil optimization for low drag, and (3) coupled aerodynamic/structures optimization of a 3-D wing. For each case, a brief overview of the problem and references to previous publications are provided. The three cases are aerospace examples of the challenges and opportunities presented by optimization under uncertainty. The present paper will illustrate a variety of needs for this technology, summarize promising methods, and uncover fruitful areas for new research.
Aerospace Applications of Optimization under Uncertainty
NASA Technical Reports Server (NTRS)
Padula, Sharon; Gumbert, Clyde; Li, Wu
2006-01-01
The Multidisciplinary Optimization (MDO) Branch at NASA Langley Research Center develops new methods and investigates opportunities for applying optimization to aerospace vehicle design. This paper describes MDO Branch experiences with three applications of optimization under uncertainty: (1) improved impact dynamics for airframes, (2) transonic airfoil optimization for low drag, and (3) coupled aerodynamic/structures optimization of a 3-D wing. For each case, a brief overview of the problem and references to previous publications are provided. The three cases are aerospace examples of the challenges and opportunities presented by optimization under uncertainty. The present paper will illustrate a variety of needs for this technology, summarize promising methods, and uncover fruitful areas for new research.
Aerodynamic optimization studies on advanced architecture computers
NASA Technical Reports Server (NTRS)
Chawla, Kalpana
1995-01-01
The approach to carrying out multi-discipline aerospace design studies in the future, especially in massively parallel computing environments, comprises of choosing (1) suitable solvers to compute solutions to equations characterizing a discipline, and (2) efficient optimization methods. In addition, for aerodynamic optimization problems, (3) smart methodologies must be selected to modify the surface shape. In this research effort, a 'direct' optimization method is implemented on the Cray C-90 to improve aerodynamic design. It is coupled with an existing implicit Navier-Stokes solver, OVERFLOW, to compute flow solutions. The optimization method is chosen such that it can accomodate multi-discipline optimization in future computations. In the work , however, only single discipline aerodynamic optimization will be included.
Lead Optimization Mapper: Automating free energy calculations for lead optimization
Liu, Shuai; Wu, Yujie; Lin, Teng; Abel, Robert; Redmann, Jonathan P.; Summa, Christopher M.; Jaber, Vivian R.; Lim, Nathan M.; Mobley, David L.
2013-01-01
Alchemical free energy calculations hold increasing promise as an aid to drug discovery efforts. However, applications of these techniques in discovery projects have been relatively few, partly because of the difficulty of planning and setting up calculations. Here, we introduce Lead Optimization Mapper, LOMAP, an automated algorithm to plan efficient relative free energy calculations between potential ligands within a substantial library of perhaps hundreds of compounds. In this approach, ligands are first grouped by structural similarity primarily based on the size of a (loosely defined) maximal common substructure, and then calculations are planned within and between sets of structurally related compounds. An emphasis is placed on ensuring that relative free energies can be obtained between any pair of compounds without combining the results of too many different relative free energy calculations (to avoid accumulation of error) and by providing some redundancy to allow for the possibility of error and consistency checking and provide some insight into when results can be expected to be unreliable. The algorithm is discussed in detail and a Python implementation, based on both Schrödinger's and OpenEye's APIs, has been made available freely under the BSD license. PMID:24072356
Optimal Control of Evolution Mixed Variational Inclusions
Alduncin, Gonzalo
2013-12-15
Optimal control problems of primal and dual evolution mixed variational inclusions, in reflexive Banach spaces, are studied. The solvability analysis of the mixed state systems is established via duality principles. The optimality analysis is performed in terms of perturbation conjugate duality methods, and proximation penalty-duality algorithms to mixed optimality conditions are further presented. Applications to nonlinear diffusion constrained problems as well as quasistatic elastoviscoplastic bilateral contact problems exemplify the theory.
Optimized entanglement-assisted quantum error correction
Taghavi, Soraya; Brun, Todd A.; Lidar, Daniel A.
2010-10-15
Using convex optimization, we propose entanglement-assisted quantum error-correction procedures that are optimized for given noise channels. We demonstrate through numerical examples that such an optimized error-correction method achieves higher channel fidelities than existing methods. This improved performance, which leads to perfect error correction for a larger class of error channels, is interpreted in at least some cases by quantum teleportation, but for general channels this interpretation does not hold.
Optimal control of sun tracking solar concentrators
NASA Technical Reports Server (NTRS)
Hughes, R. O.
1979-01-01
Application of the modern control theory to derive an optimal sun tracking control for a point focusing solar concentrator is presented. A standard tracking problem converted to regulator problem using a sun rate input achieves an almost zero steady state tracking error with the optimal control formulation. However, these control techniques are costly because optimal type algorithms require large computing systems, thus they will be used mainly as comparison standards for other types of control algorithms and help in their development.