Optimal intermittent search strategies
International Nuclear Information System (INIS)
Rojo, F; Budde, C E; Wio, H S
2009-01-01
We study the search kinetics of a single fixed target by a set of searchers performing an intermittent random walk, jumping between different internal states. Exploiting concepts of multi-state and continuous-time random walks we have calculated the survival probability of a target up to time t, and have 'optimized' (minimized) it with regard to the transition probability among internal states. Our model shows that intermittent strategies always improve target detection, even for simple diffusion states of motion
Optimal intermittent search strategies
Energy Technology Data Exchange (ETDEWEB)
Rojo, F; Budde, C E [FaMAF, Universidad Nacional de Cordoba, Ciudad Universitaria, X5000HUA Cordoba (Argentina); Wio, H S [Instituto de Fisica de Cantabria, Universidad de Cantabria and CSIC E-39005 Santander (Spain)
2009-03-27
We study the search kinetics of a single fixed target by a set of searchers performing an intermittent random walk, jumping between different internal states. Exploiting concepts of multi-state and continuous-time random walks we have calculated the survival probability of a target up to time t, and have 'optimized' (minimized) it with regard to the transition probability among internal states. Our model shows that intermittent strategies always improve target detection, even for simple diffusion states of motion.
Switching strategies to optimize search
International Nuclear Information System (INIS)
Shlesinger, Michael F
2016-01-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. (paper: interdisciplinary statistical mechanics)
Optimal intermittent search strategies: smelling the prey
International Nuclear Information System (INIS)
Revelli, J A; Wio, H S; Rojo, F; Budde, C E
2010-01-01
We study the kinetics of the search of a single fixed target by a searcher/walker that performs an intermittent random walk, characterized by different states of motion. In addition, we assume that the walker has the ability to detect the scent left by the prey/target in its surroundings. Our results, in agreement with intuition, indicate that the prey's survival probability could be strongly reduced (increased) if the predator is attracted (or repelled) by the trace left by the prey. We have also found that, for a positive trace (the predator is guided towards the prey), increasing the inhomogeneity's size reduces the prey's survival probability, while the optimal value of α (the parameter that regulates intermittency) ceases to exist. The agreement between theory and numerical simulations is excellent.
Optimal intermittent search strategies: smelling the prey
Energy Technology Data Exchange (ETDEWEB)
Revelli, J A; Wio, H S [Instituto de Fisica de Cantabria, Universidad de Cantabria and CSIC, E-39005 Santander (Spain); Rojo, F; Budde, C E [Fa.M.A.F., Universidad Nacional de Cordoba, Ciudad Universitaria, X5000HUA Cordoba (Argentina)
2010-05-14
We study the kinetics of the search of a single fixed target by a searcher/walker that performs an intermittent random walk, characterized by different states of motion. In addition, we assume that the walker has the ability to detect the scent left by the prey/target in its surroundings. Our results, in agreement with intuition, indicate that the prey's survival probability could be strongly reduced (increased) if the predator is attracted (or repelled) by the trace left by the prey. We have also found that, for a positive trace (the predator is guided towards the prey), increasing the inhomogeneity's size reduces the prey's survival probability, while the optimal value of {alpha} (the parameter that regulates intermittency) ceases to exist. The agreement between theory and numerical simulations is excellent.
A Competitive and Experiential Assignment in Search Engine Optimization Strategy
Clarke, Theresa B.; Clarke, Irvine, III
2014-01-01
Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be new…
Optimal swimming strategies in mate searching pelagic copepods
DEFF Research Database (Denmark)
Kiørboe, Thomas
2008-01-01
Male copepods must swim to find females, but swimming increases the risk of meeting predators and is expensive in terms of energy expenditure. Here I address the trade-offs between gains and risks and the question of how much and how fast to swim using simple models that optimise the number...... of lifetime mate encounters. Radically different swimming strategies are predicted for different feeding behaviours, and these predictions are tested experimentally using representative species. In general, male swimming speeds and the difference in swimming speeds between the genders are predicted...... and observed to increase with increasing conflict between mate searching and feeding. It is high in ambush feeders, where searching (swimming) and feeding are mutually exclusive and low in species, where the matured males do not feed at all. Ambush feeding males alternate between stationary ambush feeding...
The topography of the environment alters the optimal search strategy for active particles
Volpe, Giorgio; Volpe, Giovanni
2017-10-01
In environments with scarce resources, adopting the right search strategy can make the difference between succeeding and failing, even between life and death. At different scales, this applies to molecular encounters in the cell cytoplasm, to animals looking for food or mates in natural landscapes, to rescuers during search and rescue operations in disaster zones, and to genetic computer algorithms exploring parameter spaces. When looking for sparse targets in a homogeneous environment, a combination of ballistic and diffusive steps is considered optimal; in particular, more ballistic Lévy flights with exponent α≤1 are generally believed to optimize the search process. However, most search spaces present complex topographies. What is the best search strategy in these more realistic scenarios? Here, we show that the topography of the environment significantly alters the optimal search strategy toward less ballistic and more Brownian strategies. We consider an active particle performing a blind cruise search for nonregenerating sparse targets in a 2D space with steps drawn from a Lévy distribution with the exponent varying from α=1 to α=2 (Brownian). We show that, when boundaries, barriers, and obstacles are present, the optimal search strategy depends on the topography of the environment, with α assuming intermediate values in the whole range under consideration. We interpret these findings using simple scaling arguments and discuss their robustness to varying searcher's size. Our results are relevant for search problems at different length scales from animal and human foraging to microswimmers' taxis to biochemical rates of reaction.
Yadav, Naresh Kumar; Kumar, Mukesh; Gupta, S. K.
2017-03-01
General strategic bidding procedure has been formulated in the literature as a bi-level searching problem, in which the offer curve tends to minimise the market clearing function and to maximise the profit. Computationally, this is complex and hence, the researchers have adopted Karush-Kuhn-Tucker (KKT) optimality conditions to transform the model into a single-level maximisation problem. However, the profit maximisation problem with KKT optimality conditions poses great challenge to the classical optimisation algorithms. The problem has become more complex after the inclusion of transmission constraints. This paper simplifies the profit maximisation problem as a minimisation function, in which the transmission constraints, the operating limits and the ISO market clearing functions are considered with no KKT optimality conditions. The derived function is solved using group search optimiser (GSO), a robust population-based optimisation algorithm. Experimental investigation is carried out on IEEE 14 as well as IEEE 30 bus systems and the performance is compared against differential evolution-based strategic bidding, genetic algorithm-based strategic bidding and particle swarm optimisation-based strategic bidding methods. The simulation results demonstrate that the obtained profit maximisation through GSO-based bidding strategies is higher than the other three methods.
Improved quantum-behaved particle swarm optimization with local search strategy
Directory of Open Access Journals (Sweden)
Maolong Xi
2017-03-01
Full Text Available Quantum-behaved particle swarm optimization, which was motivated by analysis of particle swarm optimization and quantum system, has shown compared performance in finding the optimal solutions for many optimization problems to other evolutionary algorithms. To address the problem of premature, a local search strategy is proposed to improve the performance of quantum-behaved particle swarm optimization. In proposed local search strategy, a super particle is presented which is a collection body of randomly selected particles’ dimension information in the swarm. The selected probability of particles in swarm is different and determined by their fitness values. To minimization problems, the fitness value of one particle is smaller; the selected probability is more and will contribute more information in constructing the super particle. In addition, in order to investigate the influence on algorithm performance with different local search space, four methods of computing the local search radius are applied in local search strategy and propose four variants of local search quantum-behaved particle swarm optimization. Empirical studies on a suite of well-known benchmark functions are undertaken in order to make an overall performance comparison among the proposed methods and other quantum-behaved particle swarm optimization. The simulation results show that the proposed quantum-behaved particle swarm optimization variants have better advantages over the original quantum-behaved particle swarm optimization.
Volpato, Enilze de Souza Nogueira; Betini, Marluci; Puga, Maria Eduarda; Agarwal, Arnav; Cataneo, Antônio José Maria; Oliveira, Luciane Dias de; Bazan, Rodrigo; Braz, Leandro Gobbo; Pereira, José Eduardo Guimarães; El Dib, Regina
2018-01-15
A high-quality electronic search is essential for ensuring accuracy and comprehensiveness among the records retrieved when conducting systematic reviews. Therefore, we aimed to identify the most efficient method for searching in both MEDLINE (through PubMed) and EMBASE, covering search terms with variant spellings, direct and indirect orders, and associations with MeSH and EMTREE terms (or lack thereof). Experimental study. UNESP, Brazil. We selected and analyzed 37 search strategies that had specifically been developed for the field of anesthesiology. These search strategies were adapted in order to cover all potentially relevant search terms, with regard to variant spellings and direct and indirect orders, in the most efficient manner. When the strategies included variant spellings and direct and indirect orders, these adapted versions of the search strategies selected retrieved the same number of search results in MEDLINE (mean of 61.3%) and a higher number in EMBASE (mean of 63.9%) in the sample analyzed. The numbers of results retrieved through the searches analyzed here were not identical with and without associated use of MeSH and EMTREE terms. However, association of these terms from both controlled vocabularies retrieved a larger number of records than did the use of either one of them. In view of these results, we recommend that the search terms used should include both preferred and non-preferred terms (i.e. variant spellings and direct/indirect order of the same term) and associated MeSH and EMTREE terms, in order to develop highly-sensitive search strategies for systematic reviews.
Research on the optimization strategy of web search engine based on data mining
Chen, Ronghua
2018-04-01
With the wide application of search engines, web site information has become an important way for people to obtain information. People have found that they are growing in an increasingly explosive manner. Web site information is verydifficult to find the information they need, and now the search engine can not meet the need, so there is an urgent need for the network to provide website personalized information service, data mining technology for this new challenge is to find a breakthrough. In order to improve people's accuracy of finding information from websites, a website search engine optimization strategy based on data mining is proposed, and verified by website search engine optimization experiment. The results show that the proposed strategy improves the accuracy of the people to find information, and reduces the time for people to find information. It has an important practical value.
Optimal Search Strategy of Robotic Assembly Based on Neural Vibration Learning
Directory of Open Access Journals (Sweden)
Lejla Banjanovic-Mehmedovic
2011-01-01
Full Text Available This paper presents implementation of optimal search strategy (OSS in verification of assembly process based on neural vibration learning. The application problem is the complex robot assembly of miniature parts in the example of mating the gears of one multistage planetary speed reducer. Assembly of tube over the planetary gears was noticed as the most difficult problem of overall assembly. The favourable influence of vibration and rotation movement on compensation of tolerance was also observed. With the proposed neural-network-based learning algorithm, it is possible to find extended scope of vibration state parameter. Using optimal search strategy based on minimal distance path between vibration parameter stage sets (amplitude and frequencies of robots gripe vibration and recovery parameter algorithm, we can improve the robot assembly behaviour, that is, allow the fastest possible way of mating. We have verified by using simulation programs that search strategy is suitable for the situation of unexpected events due to uncertainties.
Optimal Control Strategy Search Using a Simplest 3-D PWR Xenon Oscillation Simulator
International Nuclear Information System (INIS)
Yoichiro, Shimazu
2004-01-01
Power spatial oscillations due to the transient xenon spatial distribution are well known as xenon oscillation in large PWRs. When the reactor size becomes larger than the current design, then even radial oscillations can be also divergent. Even if the radial oscillation is convergent, when some control rods malfunction occurs, it is necessary to suppress the oscillation in as short time as possible. In such cases, optimal control strategy is required. Generally speaking the optimality search based on the modern control theory requires a lot of calculation for the evaluation of state variables. In the case of control rod malfunctions the xenon oscillation could be three dimensional. In such case, direct core calculations would be inevitable. From this point of view a very simple model, only four point reactor model, has been developed and verified. In this paper, an example of a procedure and the results for optimal control strategy search are presented. It is shown that we have only one optimal strategy within a half cycle of the oscillation with fixed control strength. It is also shown that a 3-D xenon oscillation introduced by a control rod malfunction can not be controlled by only one control step as can be done for axial oscillations. They might be quite strong limitations to the operators. Thus it is recommended that a strategy generator, which is quick in analyzing and easy to use, might be installed in a monitoring system or operator guiding system. (author)
Directory of Open Access Journals (Sweden)
Shouheng Tuo
2013-01-01
Full Text Available Harmony search (HS algorithm is an emerging population-based metaheuristic algorithm, which is inspired by the music improvisation process. The HS method has been developed rapidly and applied widely during the past decade. In this paper, an improved global harmony search algorithm, named harmony search based on teaching-learning (HSTL, is presented for high dimension complex optimization problems. In HSTL algorithm, four strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation are employed to maintain the proper balance between convergence and population diversity, and dynamic strategy is adopted to change the parameters. The proposed HSTL algorithm is investigated and compared with three other state-of-the-art HS optimization algorithms. Furthermore, to demonstrate the robustness and convergence, the success rate and convergence analysis is also studied. The experimental results of 31 complex benchmark functions demonstrate that the HSTL method has strong convergence and robustness and has better balance capacity of space exploration and local exploitation on high dimension complex optimization problems.
Directory of Open Access Journals (Sweden)
Haynes R Brian
2004-06-01
Full Text Available Abstract Background Clinical end users of MEDLINE have a difficult time retrieving articles that are both scientifically sound and directly relevant to clinical practice. Search filters have been developed to assist end users in increasing the success of their searches. Many filters have been developed for the literature on therapy and reviews but little has been done in the area of prognosis. The objective of this study is to determine how well various methodologic textwords, Medical Subject Headings, and their Boolean combinations retrieve methodologically sound literature on the prognosis of health disorders in MEDLINE. Methods An analytic survey was conducted, comparing hand searches of journals with retrievals from MEDLINE for candidate search terms and combinations. Six research assistants read all issues of 161 journals for the publishing year 2000. All articles were rated using purpose and quality indicators and categorized into clinically relevant original studies, review articles, general papers, or case reports. The original and review articles were then categorized as 'pass' or 'fail' for methodologic rigor in the areas of prognosis and other clinical topics. Candidate search strategies were developed for prognosis and run in MEDLINE – the retrievals being compared with the hand search data. The sensitivity, specificity, precision, and accuracy of the search strategies were calculated. Results 12% of studies classified as prognosis met basic criteria for scientific merit for testing clinical applications. Combinations of terms reached peak sensitivities of 90%. Compared with the best single term, multiple terms increased sensitivity for sound studies by 25.2% (absolute increase, and increased specificity, but by a much smaller amount (1.1% when sensitivity was maximized. Combining terms to optimize both sensitivity and specificity achieved sensitivities and specificities of approximately 83% for each. Conclusion Empirically derived
Evolution of optimal Lévy-flight strategies in human mental searches
Radicchi, Filippo; Baronchelli, Andrea
2012-06-01
Recent analysis of empirical data [Radicchi, Baronchelli, and Amaral, PloS ONE1932-620310.1371/journal.pone.0029910 7, e029910 (2012)] showed that humans adopt Lévy-flight strategies when exploring the bid space in online auctions. A game theoretical model proved that the observed Lévy exponents are nearly optimal, being close to the exponent value that guarantees the maximal economical return to players. Here, we rationalize these findings by adopting an evolutionary perspective. We show that a simple evolutionary process is able to account for the empirical measurements with the only assumption that the reproductive fitness of the players is proportional to their search ability. Contrary to previous modeling, our approach describes the emergence of the observed exponent without resorting to any strong assumptions on the initial searching strategies. Our results generalize earlier research, and open novel questions in cognitive, behavioral, and evolutionary sciences.
Emergence of an optimal search strategy from a simple random walk.
Sakiyama, Tomoko; Gunji, Yukio-Pegio
2013-09-06
In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths.
Directory of Open Access Journals (Sweden)
Charles Tatkeu
2008-12-01
Full Text Available We propose a global convergence baud-spaced blind equalization method in this paper. This method is based on the application of both generalized pattern optimization and channel surfing reinitialization. The potentially used unimodal cost function relies on higher- order statistics, and its optimization is achieved using a pattern search algorithm. Since the convergence to the global minimum is not unconditionally warranted, we make use of channel surfing reinitialization (CSR strategy to find the right global minimum. The proposed algorithm is analyzed, and simulation results using a severe frequency selective propagation channel are given. Detailed comparisons with constant modulus algorithm (CMA are highlighted. The proposed algorithm performances are evaluated in terms of intersymbol interference, normalized received signal constellations, and root mean square error vector magnitude. In case of nonconstant modulus input signals, our algorithm outperforms significantly CMA algorithm with full channel surfing reinitialization strategy. However, comparable performances are obtained for constant modulus signals.
Zaouche, Abdelouahib; Dayoub, Iyad; Rouvaen, Jean Michel; Tatkeu, Charles
2008-12-01
We propose a global convergence baud-spaced blind equalization method in this paper. This method is based on the application of both generalized pattern optimization and channel surfing reinitialization. The potentially used unimodal cost function relies on higher- order statistics, and its optimization is achieved using a pattern search algorithm. Since the convergence to the global minimum is not unconditionally warranted, we make use of channel surfing reinitialization (CSR) strategy to find the right global minimum. The proposed algorithm is analyzed, and simulation results using a severe frequency selective propagation channel are given. Detailed comparisons with constant modulus algorithm (CMA) are highlighted. The proposed algorithm performances are evaluated in terms of intersymbol interference, normalized received signal constellations, and root mean square error vector magnitude. In case of nonconstant modulus input signals, our algorithm outperforms significantly CMA algorithm with full channel surfing reinitialization strategy. However, comparable performances are obtained for constant modulus signals.
Optimization of refueling-shuffling scheme in PWR core by random search strategy
International Nuclear Information System (INIS)
Wu Yuan
1991-11-01
A random method for simulating optimization of refueling management in a pressurized water reactor (PWR) core is described. The main purpose of the optimization was to select the 'best' refueling arrangement scheme which would produce maximum economic benefits under certain imposed conditions. To fulfill this goal, an effective optimization strategy, two-stage random search method was developed. First, the search was made in a manner similar to the stratified sampling technique. A local optimum can be reached by comparison of the successive results. Then the other random experiences would be carried on between different strata to try to find the global optimum. In general, it can be used as a practical tool for conventional fuel management scheme. However, it can also be used in studies on optimization of Low-Leakage fuel management. Some calculations were done for a typical PWR core on a CYBER-180/830 computer. The results show that the method proposed can obtain satisfactory approach at reasonable low computational cost
Oliver, B. M.
Attention is given to the approaches which would provide the greatest chance of success in attempts related to the discovery of extraterrestrial advanced cultures in the Galaxy, taking into account the principle of least energy expenditure. The energetics of interstellar contact are explored, giving attention to the use of manned spacecraft, automatic probes, and beacons. The least expensive approach to a search for other civilizations involves a listening program which attempts to detect signals emitted by such civilizations. The optimum part of the spectrum for the considered search is found to be in the range from 1 to 2 GHz. Antenna and transmission formulas are discussed along with the employment of matched gates and filters, the probable characteristics of the signals to be detected, the filter-signal mismatch loss, surveys of the radio sky, the conduction of targeted searches.
Optimal search strategies for detecting cost and economic studies in EMBASE
Directory of Open Access Journals (Sweden)
Haynes R Brian
2006-06-01
Full Text Available Abstract Background Economic evaluations in the medical literature compare competing diagnosis or treatment methods for their use of resources and their expected outcomes. The best evidence currently available from research regarding both cost and economic comparisons will continue to expand as this type of information becomes more important in today's clinical practice. Researchers and clinicians need quick, reliable ways to access this information. A key source of this type of information is large bibliographic databases such as EMBASE. The objective of this study was to develop search strategies that optimize the retrieval of health costs and economics studies from EMBASE. Methods We conducted an analytic survey, comparing hand searches of journals with retrievals from EMBASE for candidate search terms and combinations. 6 research assistants read all issues of 55 journals indexed by EMBASE for the publishing year 2000. We rated all articles using purpose and quality indicators and categorized them into clinically relevant original studies, review articles, general papers, or case reports. The original and review articles were then categorized for purpose (i.e., cost and economics and other clinical topics and depending on the purpose as 'pass' or 'fail' for methodologic rigor. Candidate search strategies were developed for economic and cost studies, then run in the 55 EMBASE journals, the retrievals being compared with the hand search data. The sensitivity, specificity, precision, and accuracy of the search strategies were calculated. Results Combinations of search terms for detecting both cost and economic studies attained levels of 100% sensitivity with specificity levels of 92.9% and 92.3% respectively. When maximizing for both sensitivity and specificity, the combination of terms for detecting cost studies (sensitivity increased 2.2% over the single term but at a slight decrease in specificity of 0.9%. The maximized combination of terms
Directory of Open Access Journals (Sweden)
Rony Baskoro Lukito
2014-12-01
Full Text Available The purpose of this research is how to optimize a web design that can increase the number of visitors. The number of Internet users in the world continues to grow in line with advances in information technology. Products and services marketing media do not just use the printed and electronic media. Moreover, the cost of using the Internet as a medium of marketing is relatively inexpensive when compared to the use of television as a marketing medium. The penetration of the internet as a marketing medium lasted for 24 hours in different parts of the world. But to make an internet site into a site that is visited by many internet users, the site is not only good from the outside view only. Web sites that serve as a medium for marketing must be built with the correct rules, so that the Web site be optimal marketing media. One of the good rules in building the internet site as a marketing medium is how the content of such web sites indexed well in search engines like google. Search engine optimization in the index will be focused on the search engine Google for 83% of internet users across the world using Google as a search engine. Search engine optimization commonly known as SEO (Search Engine Optimization is an important rule that the internet site is easier to find a user with the desired keywords.
Wang, Yan; Huang, Song; Ji, Zhicheng
2017-07-01
This paper presents a hybrid particle swarm optimization and gravitational search algorithm based on hybrid mutation strategy (HGSAPSO-M) to optimize economic dispatch (ED) including distributed generations (DGs) considering market-based energy pricing. A daily ED model was formulated and a hybrid mutation strategy was adopted in HGSAPSO-M. The hybrid mutation strategy includes two mutation operators, chaotic mutation, Gaussian mutation. The proposed algorithm was tested on IEEE-33 bus and results show that the approach is effective for this problem.
Radiotherapy Planning Using an Improved Search Strategy in Particle Swarm Optimization.
Modiri, Arezoo; Gu, Xuejun; Hagan, Aaron M; Sawant, Amit
2017-05-01
Evolutionary stochastic global optimization algorithms are widely used in large-scale, nonconvex problems. However, enhancing the search efficiency and repeatability of these techniques often requires well-customized approaches. This study investigates one such approach. We use particle swarm optimization (PSO) algorithm to solve a 4D radiation therapy (RT) inverse planning problem, where the key idea is to use respiratory motion as an additional degree of freedom in lung cancer RT. The primary goal is to administer a lethal dose to the tumor target while sparing surrounding healthy tissue. Our optimization iteratively adjusts radiation fluence-weights for all beam apertures across all respiratory phases. We implement three PSO-based approaches: conventionally used unconstrained, hard-constrained, and our proposed virtual search. As proof of concept, five lung cancer patient cases are optimized over ten runs using each PSO approach. For comparison, a dynamically penalized likelihood (DPL) algorithm-a popular RT optimization technique is also implemented and used. The proposed technique significantly improves the robustness to random initialization while requiring fewer iteration cycles to converge across all cases. DPL manages to find the global optimum in 2 out of 5 RT cases over significantly more iterations. The proposed virtual search approach boosts the swarm search efficiency, and consequently, improves the optimization convergence rate and robustness for PSO. RT planning is a large-scale, nonconvex optimization problem, where finding optimal solutions in a clinically practical time is critical. Our proposed approach can potentially improve the optimization efficiency in similar time-sensitive problems.
Marolt, Klemen
2013-01-01
Search engine optimization techniques, often shortened to “SEO,” should lead to first positions in organic search results. Some optimization techniques do not change over time, yet still form the basis for SEO. However, as the Internet and web design evolves dynamically, new optimization techniques flourish and flop. Thus, we looked at the most important factors that can help to improve positioning in search results. It is important to emphasize that none of the techniques can guarantee high ...
International Nuclear Information System (INIS)
Mahdad, Belkacem; Srairi, K.
2015-01-01
Highlights: • A generalized optimal security power system planning strategy for blackout risk prevention is proposed. • A Grey Wolf Optimizer dynamically coordinated with Pattern Search algorithm is proposed. • A useful optimized database dynamically generated considering margin loading stability under severe faults. • The robustness and feasibility of the proposed strategy is validated in the standard IEEE 30 Bus system. • The proposed planning strategy will be useful for power system protection coordination and control. - Abstract: Developing a flexible and reliable power system planning strategy under critical situations is of great importance to experts and industrials to minimize the probability of blackouts occurrence. This paper introduces the first stage of this practical strategy by the application of Grey Wolf Optimizer coordinated with pattern search algorithm for solving the security smart grid power system management under critical situations. The main objective of this proposed planning strategy is to prevent the practical power system against blackout due to the apparition of faults in generating units or important transmission lines. At the first stage the system is pushed to its margin stability limit, the critical loads shedding are selected using voltage stability index. In the second stage the generator control variables, the reactive power of shunt and dynamic compensators are adjusted in coordination with minimization the active and reactive power at critical loads to maintain the system at security state to ensure service continuity. The feasibility and efficiency of the proposed strategy is applied to IEEE 30-Bus test system. Results are promising and prove the practical efficiency of the proposed strategy to ensure system security under critical situations
Intermittent random walks for an optimal search strategy: one-dimensional case
International Nuclear Information System (INIS)
Oshanin, G; Wio, H S; Lindenberg, K; Burlatsky, S F
2007-01-01
We study the search kinetics of an immobile target by a concentration of randomly moving searchers. The object of the study is to optimize the probability of detection within the constraints of our model. The target is hidden on a one-dimensional lattice in the sense that searchers have no a priori information about where it is, and may detect it only upon encounter. The searchers perform random walks in discrete time n = 0,1,2,...,N, where N is the maximal time the search process is allowed to run. With probability α the searchers step on a nearest-neighbour, and with probability (1-α) they leave the lattice and stay off until they land back on the lattice at a fixed distance L away from the departure point. The random walk is thus intermittent. We calculate the probability P N that the target remains undetected up to the maximal search time N, and seek to minimize this probability. We find that P N is a non-monotonic function of α, and show that there is an optimal choice α opt (N) of α well within the intermittent regime, 0 opt (N) N can be orders of magnitude smaller compared to the 'pure' random walk cases α = 0 and α = 1
Intermittent search strategies
Bénichou, O.; Loverdo, C.; Moreau, M.; Voituriez, R.
2011-01-01
This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. It is first shown that intermittent search strategies are actually widely observed at various scales. At the macroscopic scale, this is, for example, the case of animals looking for food; at the microscopic scale, intermittent transport patterns are involved in a reaction pathway of DNA-binding proteins as well as in intracellular transport. Second, generic stochastic models are introduced, which show that intermittent strategies are efficient strategies that enable the minimization of search time. This suggests that the intrinsic efficiency of intermittent search strategies could justify their frequent observation in nature. Last, beyond these modeling aspects, it is proposed that intermittent strategies could also be used in a broader context to design and accelerate search processes.
Guaraldi, Federica; Parasiliti-Caprino, Mirko; Goggi, Riccardo; Beccuti, Guglielmo; Grottoli, Silvia; Arvat, Emanuela; Ghizzoni, Lucia; Ghigo, Ezio; Giordano, Roberta; Gori, Davide
2014-12-01
The exponential growth of scientific literature available through electronic databases (namely PubMed) has increased the chance of finding interesting articles. At the same time, search has become more complicated, time consuming, and at risk of missing important information. Therefore, optimized strategies have to be adopted to maximize searching impact. The aim of this study was to formulate efficient strings to search PubMed for etiologic associations between adrenal disorders (ADs) and other conditions. A comprehensive list of terms identifying endogenous conditions primarily affecting adrenals was compiled. An ad hoc analysis was performed to find the best way to express each term in order to find the highest number of potentially pertinent articles in PubMed. A predefined number of retrieved abstracts were read to assess their association with ADs' etiology. A more sensitive (providing the largest literature coverage) and a more specific (including only those terms retrieving >40 % of potentially pertinent articles) string were formulated. Various researches were performed to assess strings' ability to identify articles of interest in comparison with non-optimized literature searches. We formulated optimized, ready applicable tools for the identification of the literature assessing etiologic associations in the field of ADs using PubMed, and demonstrated the advantages deriving from their application. Detailed description of the methodological process is also provided, so that this work can easily be translated to other fields of practice.
Optimization of partial search
International Nuclear Information System (INIS)
Korepin, Vladimir E
2005-01-01
A quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by the number of queries to the oracle. The author suggests a new version of the Grover-Radhakrishnan algorithm which uses a minimal number of such queries. The algorithm can run on the same hardware that is used for the usual Grover algorithm. (letter to the editor)
Directory of Open Access Journals (Sweden)
Fei Wang
2017-11-01
Full Text Available The optimal dispatching model for a stand-alone microgrid (MG is of great importance to its operation reliability and economy. This paper aims at addressing the difficulties in improving the operational economy and maintaining the power balance under uncertain load demand and renewable generation, which could be even worse in such abnormal conditions as storms or abnormally low or high temperatures. A new two-time scale multi-objective optimization model, including day-ahead cursory scheduling and real-time scheduling for finer adjustments, is proposed to optimize the operational cost, load shedding compensation and environmental benefit of stand-alone MG through controllable load (CL and multi-distributed generations (DGs. The main novelty of the proposed model is that the synergetic response of CL and energy storage system (ESS in real-time scheduling offset the operation uncertainty quickly. And the improved dispatch strategy for combined cooling-heating-power (CCHP enhanced the system economy while the comfort is guaranteed. An improved algorithm, Search Improvement Process-Chaotic Optimization-Particle Swarm Optimization-Elite Retention Strategy (SIP-CO-PSO-ERS algorithm with strong searching capability and fast convergence speed, was presented to deal with the problem brought by the increased errors between actual renewable generation and load and prior predictions. Four typical scenarios are designed according to the combinations of day types (work day or weekend and weather categories (sunny or rainy to verify the performance of the presented dispatch strategy. The simulation results show that the proposed two-time scale model and SIP-CO-PSO-ERS algorithm exhibit better performance in adaptability, convergence speed and search ability than conventional methods for the stand-alone MG’s operation.
Directory of Open Access Journals (Sweden)
Tinggui Chen
2014-01-01
Full Text Available Artificial bee colony (ABC algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA, artificial colony optimization (ACO, and particle swarm optimization (PSO. However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments.
Directory of Open Access Journals (Sweden)
Gonggui Chen
2017-01-01
Full Text Available The optimal power flow (OPF is well-known as a significant optimization tool for the security and economic operation of power system, and OPF problem is a complex nonlinear, nondifferentiable programming problem. Thus this paper proposes a Gbest-guided cuckoo search algorithm with the feedback control strategy and constraint domination rule which is named as FCGCS algorithm for solving OPF problem and getting optimal solution. This FCGCS algorithm is guided by the global best solution for strengthening exploitation ability. Feedback control strategy is devised to dynamically regulate the control parameters according to actual and specific feedback value in the simulation process. And the constraint domination rule can efficiently handle inequality constraints on state variables, which is superior to traditional penalty function method. The performance of FCGCS algorithm is tested and validated on the IEEE 30-bus and IEEE 57-bus example systems, and simulation results are compared with different methods obtained from other literatures recently. The comparison results indicate that FCGCS algorithm can provide high-quality feasible solutions for different OPF problems.
Davis, Harold
2006-01-01
SEO--short for Search Engine Optimization--is the art, craft, and science of driving web traffic to web sites. Web traffic is food, drink, and oxygen--in short, life itself--to any web-based business. Whether your web site depends on broad, general traffic, or high-quality, targeted traffic, this PDF has the tools and information you need to draw more traffic to your site. You'll learn how to effectively use PageRank (and Google itself); how to get listed, get links, and get syndicated; and much more. The field of SEO is expanding into all the possible ways of promoting web traffic. This
Optimal GENCO bidding strategy
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
Directory of Open Access Journals (Sweden)
Chengfen Zhang
2015-01-01
Full Text Available Dry-type air-core reactor is now widely applied in electrical power distribution systems, for which the optimization design is a crucial issue. In the optimization design problem of dry-type air-core reactor, the objectives of minimizing the production cost and minimizing the operation cost are both important. In this paper, a multiobjective optimal model is established considering simultaneously the two objectives of minimizing the production cost and minimizing the operation cost. To solve the multi-objective optimization problem, a memetic evolutionary algorithm is proposed, which combines elitist nondominated sorting genetic algorithm version II (NSGA-II with a local search strategy based on the covariance matrix adaptation evolution strategy (CMA-ES. NSGA-II can provide decision maker with flexible choices among the different trade-off solutions, while the local-search strategy, which is applied to nondominated individuals randomly selected from the current population in a given generation and quantity, can accelerate the convergence speed. Furthermore, another modification is that an external archive is set in the proposed algorithm for increasing the evolutionary efficiency. The proposed algorithm is tested on a dry-type air-core reactor made of rectangular cross-section litz-wire. Simulation results show that the proposed algorithm has high efficiency and it converges to a better Pareto front.
Optimal search behavior and classic foraging theory
International Nuclear Information System (INIS)
Bartumeus, F; Catalan, J
2009-01-01
Random walk methods and diffusion theory pervaded ecological sciences as methods to analyze and describe animal movement. Consequently, statistical physics was mostly seen as a toolbox rather than as a conceptual framework that could contribute to theory on evolutionary biology and ecology. However, the existence of mechanistic relationships and feedbacks between behavioral processes and statistical patterns of movement suggests that, beyond movement quantification, statistical physics may prove to be an adequate framework to understand animal behavior across scales from an ecological and evolutionary perspective. Recently developed random search theory has served to critically re-evaluate classic ecological questions on animal foraging. For instance, during the last few years, there has been a growing debate on whether search behavior can include traits that improve success by optimizing random (stochastic) searches. Here, we stress the need to bring together the general encounter problem within foraging theory, as a mean for making progress in the biological understanding of random searching. By sketching the assumptions of optimal foraging theory (OFT) and by summarizing recent results on random search strategies, we pinpoint ways to extend classic OFT, and integrate the study of search strategies and its main results into the more general theory of optimal foraging.
Efficient search by optimized intermittent random walks
International Nuclear Information System (INIS)
Oshanin, Gleb; Lindenberg, Katja; Wio, Horacio S; Burlatsky, Sergei
2009-01-01
We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest neighbor site with probability α or go off lattice with probability 1 - α to move in a random direction until it lands back on the lattice at a fixed distance L away from the departure point. Considering α and L as optimization parameters, we seek to enhance the chances of successful detection by minimizing the probability P N that the target remains undetected up to the maximal search time N. We show that even in this simple model, a number of very efficient search strategies can lead to a decrease of P N by orders of magnitude upon appropriate choices of α and L. We demonstrate that, in general, such optimal intermittent strategies are much more efficient than Brownian searches and are as efficient as search algorithms based on random walks with heavy-tailed Cauchy jump-length distributions. In addition, such intermittent strategies appear to be more advantageous than Levy-based ones in that they lead to more thorough exploration of visited regions in space and thus lend themselves to parallelization of the search processes.
Optimal Labour Taxation and Search
Boone, J.; Bovenberg, A.L.
2000-01-01
This paper explores the optimal role of the tax system in alleviating labour-market imperfections, raising revenue, and correcting the income distribution. For this purpose, the standard search model of the labour market is extended by introducing non-linear vacancy costs due to scarce
Tales from the Field: Search Strategies Applied in Web Searching
Directory of Open Access Journals (Sweden)
Soohyung Joo
2010-08-01
Full Text Available In their web search processes users apply multiple types of search strategies, which consist of different search tactics. This paper identifies eight types of information search strategies with associated cases based on sequences of search tactics during the information search process. Thirty-one participants representing the general public were recruited for this study. Search logs and verbal protocols offered rich data for the identification of different types of search strategies. Based on the findings, the authors further discuss how to enhance web-based information retrieval (IR systems to support each type of search strategy.
University Students' Online Information Searching Strategies in Different Search Contexts
Tsai, Meng-Jung; Liang, Jyh-Chong; Hou, Huei-Tse; Tsai, Chin-Chung
2012-01-01
This study investigates the role of search context played in university students' online information searching strategies. A total of 304 university students in Taiwan were surveyed with questionnaires in which two search contexts were defined as searching for learning, and searching for daily life information. Students' online search strategies…
Optimal Fungal Space Searching Algorithms.
Asenova, Elitsa; Lin, Hsin-Yu; Fu, Eileen; Nicolau, Dan V; Nicolau, Dan V
2016-10-01
Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural "master" algorithm, which comprises two "slave" sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.
Search Parameter Optimization for Discrete, Bayesian, and Continuous Search Algorithms
2017-09-01
NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CONTINUOUS SEARCH ALGORITHMS by...to 09-22-2017 4. TITLE AND SUBTITLE SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CON- TINUOUS SEARCH ALGORITHMS 5. FUNDING NUMBERS 6...simple search and rescue acts to prosecuting aerial/surface/submersible targets on mission. This research looks at varying the known discrete and
A stochastic model for intermittent search strategies
International Nuclear Information System (INIS)
Benichou, O; Coppey, M; Moreau, M; Suet, P H; Voituriez, R
2005-01-01
It is often necessary, in scientific or everyday life problems, to find a randomly hidden target. What is then the optimal strategy to reach it as rapidly as possible? In this article, we develop a stochastic theory for intermittent search behaviours, which are often observed: the searcher alternates phases of intensive search and slow motion with fast displacements. The first results of this theory have already been announced recently. Here we provide a detailed presentation of the theory, as well as the full derivation of the results. Furthermore, we explicitly discuss the minimization of the time needed to find the target
Optimal fuel inventory strategies
International Nuclear Information System (INIS)
Caspary, P.J.; Hollibaugh, J.B.; Licklider, P.L.; Patel, K.P.
1990-01-01
In an effort to maintain their competitive edge, most utilities are reevaluating many of their conventional practices and policies in an effort to further minimize customer revenue requirements without sacrificing system reliability. Over the past several years, Illinois Power has been rethinking its traditional fuel inventory strategies, recognizing that coal supplies are competitive and plentiful and that carrying charges on inventory are expensive. To help the Company achieve one of its strategic corporate goals, an optimal fuel inventory study was performed for its five major coal-fired generating stations. The purpose of this paper is to briefly describe Illinois Power's system and past practices concerning coal inventories, highlight the analytical process behind the optimal fuel inventory study, and discuss some of the recent experiences affecting coal deliveries and economic dispatch
Constructing Effective Search Strategies for Electronic Searching.
Flanagan, Lynn; Parente, Sharon Campbell
Electronic databases have grown tremendously in both number and popularity since their development during the 1960s. Access to electronic databases in academic libraries was originally offered primarily through mediated search services by trained librarians; however, the advent of CD-ROM and end-user interfaces for online databases has shifted the…
A Direct Search Algorithm for Global Optimization
Directory of Open Access Journals (Sweden)
Enrique Baeyens
2016-06-01
Full Text Available A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is differentiable and its gradient is Lipschitz continuous. The algorithm’s performance has been extensively tested using benchmark functions and compared to some well-known global optimization algorithms. The results of the computational study show that the algorithm combines both simplicity and efficiency and is competitive with the heuristics-based strategies presently used for global optimization.
Automatic Planning of External Search Engine Optimization
Directory of Open Access Journals (Sweden)
Vita Jasevičiūtė
2015-07-01
Full Text Available This paper describes an investigation of the external search engine optimization (SEO action planning tool, dedicated to automatically extract a small set of most important keywords for each month during whole year period. The keywords in the set are extracted accordingly to external measured parameters, such as average number of searches during the year and for every month individually. Additionally the position of the optimized web site for each keyword is taken into account. The generated optimization plan is similar to the optimization plans prepared manually by the SEO professionals and can be successfully used as a support tool for web site search engine optimization.
ROLE AND IMPORTANCE OF SEARCH ENGINE OPTIMIZATION
Gurneet Kaur
2017-01-01
Search Engines are an indispensible platform for users all over the globe to search for relevant information online. Search Engine Optimization (SEO) is the exercise of improving the position of a website in search engine rankings, for a chosen set of keywords. SEO is divided into two parts: On-Page and Off-Page SEO. In order to be successful, both the areas require equal attention. This paper aims to explain the functioning of the search engines along with the role and importance of search e...
Optimal Aide Security Information Search (OASIS)
National Research Council Canada - National Science Library
Kapadia, Chetna
2005-01-01
The purpose of the Optimal AIDE Security Information Search (OASIS) effort was to investigate and prototype a tool that can assist the network security analyst in collecting useful information to defend the networks they manage...
Implementing optimal thinning strategies
Kurt H. Riitters; J. Douglas Brodie
1984-01-01
Optimal thinning regimes for achieving several management objectives were derived from two stand-growth simulators by dynamic programming. Residual mean tree volumes were then plotted against stand density management diagrams. The results supported the use of density management diagrams for comparing, checking, and implementing the results of optimization analyses....
W. Alink (Wouter); R. Cornacchia (Roberto); A.P. de Vries (Arjen)
2010-01-01
htmlabstractTasks performed by intellectual property specialists are often ad hoc, and continuously require new approaches to search a collection of documents. We therefore investigate the benets of a visual `search strategy builder' to allow IP search experts to express their approach to
An introduction to harmony search optimization method
Wang, Xiaolei; Zenger, Kai
2014-01-01
This brief provides a detailed introduction, discussion and bibliographic review of the nature1-inspired optimization algorithm called Harmony Search. It uses a large number of simulation results to demonstrate the advantages of Harmony Search and its variants and also their drawbacks. The authors show how weaknesses can be amended by hybridization with other optimization methods. The Harmony Search Method with Applications will be of value to researchers in computational intelligence in demonstrating the state of the art of research on an algorithm of current interest. It also helps researche
Local beam angle optimization with linear programming and gradient search
International Nuclear Information System (INIS)
Craft, David
2007-01-01
The optimization of beam angles in IMRT planning is still an open problem, with literature focusing on heuristic strategies and exhaustive searches on discrete angle grids. We show how a beam angle set can be locally refined in a continuous manner using gradient-based optimization in the beam angle space. The gradient is derived using linear programming duality theory. Applying this local search to 100 random initial angle sets of a phantom pancreatic case demonstrates the method, and highlights the many-local-minima aspect of the BAO problem. Due to this function structure, we recommend a search strategy of a thorough global search followed by local refinement at promising beam angle sets. Extensions to nonlinear IMRT formulations are discussed. (note)
Routine development of objectively derived search strategies
Directory of Open Access Journals (Sweden)
Hausner Elke
2012-02-01
Full Text Available Abstract Background Over the past few years, information retrieval has become more and more professionalized, and information specialists are considered full members of a research team conducting systematic reviews. Research groups preparing systematic reviews and clinical practice guidelines have been the driving force in the development of search strategies, but open questions remain regarding the transparency of the development process and the available resources. An empirically guided approach to the development of a search strategy provides a way to increase transparency and efficiency. Methods Our aim in this paper is to describe the empirically guided development process for search strategies as applied by the German Institute for Quality and Efficiency in Health Care (Institut für Qualität und Wirtschaftlichkeit im Gesundheitswesen, or "IQWiG". This strategy consists of the following steps: generation of a test set, as well as the development, validation and standardized documentation of the search strategy. Results We illustrate our approach by means of an example, that is, a search for literature on brachytherapy in patients with prostate cancer. For this purpose, a test set was generated, including a total of 38 references from 3 systematic reviews. The development set for the generation of the strategy included 25 references. After application of textual analytic procedures, a strategy was developed that included all references in the development set. To test the search strategy on an independent set of references, the remaining 13 references in the test set (the validation set were used. The validation set was also completely identified. Discussion Our conclusion is that an objectively derived approach similar to that used in search filter development is a feasible way to develop and validate reliable search strategies. Besides creating high-quality strategies, the widespread application of this approach will result in a
Stochastic search in structural optimization - Genetic algorithms and simulated annealing
Hajela, Prabhat
1993-01-01
An account is given of illustrative applications of genetic algorithms and simulated annealing methods in structural optimization. The advantages of such stochastic search methods over traditional mathematical programming strategies are emphasized; it is noted that these methods offer a significantly higher probability of locating the global optimum in a multimodal design space. Both genetic-search and simulated annealing can be effectively used in problems with a mix of continuous, discrete, and integer design variables.
Optimizing decommissioning strategies
International Nuclear Information System (INIS)
Passant, F.H.
1993-01-01
Many different approaches can be considered for achieving satisfactory decommissioning of nuclear installations. These can embrace several different engineering actions at several stages, with time variations between the stages. Multi-attribute analysis can be used to help in the decision making process and to establish the optimum strategy. It has been used in the Usa and the UK to help in selecting preferred sites for radioactive waste repositories, and also in UK to help with the choice of preferred sites for locating PWR stations, and in selecting optimum decommissioning strategies
Competing intelligent search agents in global optimization
Energy Technology Data Exchange (ETDEWEB)
Streltsov, S.; Vakili, P. [Boston Univ., MA (United States); Muchnik, I. [Rutgers Univ., Piscataway, NJ (United States)
1996-12-31
In this paper we present a new search methodology that we view as a development of intelligent agent approach to the analysis of complex system. The main idea is to consider search process as a competition mechanism between concurrent adaptive intelligent agents. Agents cooperate in achieving a common search goal and at the same time compete with each other for computational resources. We propose a statistical selection approach to resource allocation between agents that leads to simple and efficient on average index allocation policies. We use global optimization as the most general setting that encompasses many types of search problems, and show how proposed selection policies can be used to improve and combine various global optimization methods.
International Nuclear Information System (INIS)
Chen, C.Y.; Shih, L.H.
1992-01-01
Recently, the main power company in Taiwan has shifted the primary energy resource from oil to coal and tried to diversify the coal supply from various sources. The company wants to have the imported coal meet the environmental standards and operation requirements as well as to have high heating value. In order to achieve these objectives, establishment of a coal blending system for Taiwan is necessary. A mathematical model using mixed integer programming technique is used to model the import strategy and the blending system. 6 refs., 1 tab
Collaborative Search Strategies for Green Innovation
DEFF Research Database (Denmark)
Ørding Olsen, Anders; Sofka, Wolfgang; Grimpe, Christoph
Recent innovation and strategy research emphasizes the importance of firm’s search for external knowledge to improve innovation performance. We focus on such search strategies within the domain of sustainable innovation in which problems are inherently complex and the relevant knowledge is widely...... dispersed. Hence, firms need to collaborate. We shed new light on collaborative search strategies led by firms in general and for solving environmental problems in particular. Both topics are largely absent in the extant open innovation literature. Using data from the European Seventh Framework Program...... for Research and Technological Development (FP7), our results indicate that the problem-solving potential of a search strategy increases with the diversity of existing knowledge of the partners in a consortium and with the experience of the partners involved. Moreover, we identify a substantial negative effect...
Towards improving searches for optimal phylogenies.
Ford, Eric; St John, Katherine; Wheeler, Ward C
2015-01-01
Finding the optimal evolutionary history for a set of taxa is a challenging computational problem, even when restricting possible solutions to be "tree-like" and focusing on the maximum-parsimony optimality criterion. This has led to much work on using heuristic tree searches to find approximate solutions. We present an approach for finding exact optimal solutions that employs and complements the current heuristic methods for finding optimal trees. Given a set of taxa and a set of aligned sequences of characters, there may be subsets of characters that are compatible, and for each such subset there is an associated (possibly partially resolved) phylogeny with edges corresponding to each character state change. These perfect phylogenies serve as anchor trees for our constrained search space. We show that, for sequences with compatible sites, the parsimony score of any tree [Formula: see text] is at least the parsimony score of the anchor trees plus the number of inferred changes between [Formula: see text] and the anchor trees. As the maximum-parsimony optimality score is additive, the sum of the lower bounds on compatible character partitions provides a lower bound on the complete alignment of characters. This yields a region in the space of trees within which the best tree is guaranteed to be found; limiting the search for the optimal tree to this region can significantly reduce the number of trees that must be examined in a search of the space of trees. We analyze this method empirically using four different biological data sets as well as surveying 400 data sets from the TreeBASE repository, demonstrating the effectiveness of our technique in reducing the number of steps in exact heuristic searches for trees under the maximum-parsimony optimality criterion. © The Author(s) 2014. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.
A Hybrid Backtracking Search Optimization Algorithm with Differential Evolution
Directory of Open Access Journals (Sweden)
Lijin Wang
2015-01-01
Full Text Available The backtracking search optimization algorithm (BSA is a new nature-inspired method which possesses a memory to take advantage of experiences gained from previous generation to guide the population to the global optimum. BSA is capable of solving multimodal problems, but it slowly converges and poorly exploits solution. The differential evolution (DE algorithm is a robust evolutionary algorithm and has a fast convergence speed in the case of exploitive mutation strategies that utilize the information of the best solution found so far. In this paper, we propose a hybrid backtracking search optimization algorithm with differential evolution, called HBD. In HBD, DE with exploitive strategy is used to accelerate the convergence by optimizing one worse individual according to its probability at each iteration process. A suit of 28 benchmark functions are employed to verify the performance of HBD, and the results show the improvement in effectiveness and efficiency of hybridization of BSA and DE.
Sampson, Margaret; Barrowman, Nicholas J; Moher, David; Clifford, Tammy J; Platt, Robert W; Morrison, Andra; Klassen, Terry P; Zhang, Li
2006-02-24
Most electronic search efforts directed at identifying primary studies for inclusion in systematic reviews rely on the optimal Boolean search features of search interfaces such as DIALOG and Ovid. Our objective is to test the ability of an Ultraseek search engine to rank MEDLINE records of the included studies of Cochrane reviews within the top half of all the records retrieved by the Boolean MEDLINE search used by the reviewers. Collections were created using the MEDLINE bibliographic records of included and excluded studies listed in the review and all records retrieved by the MEDLINE search. Records were converted to individual HTML files. Collections of records were indexed and searched through a statistical search engine, Ultraseek, using review-specific search terms. Our data sources, systematic reviews published in the Cochrane library, were included if they reported using at least one phase of the Cochrane Highly Sensitive Search Strategy (HSSS), provided citations for both included and excluded studies and conducted a meta-analysis using a binary outcome measure. Reviews were selected if they yielded between 1000-6000 records when the MEDLINE search strategy was replicated. Nine Cochrane reviews were included. Included studies within the Cochrane reviews were found within the first 500 retrieved studies more often than would be expected by chance. Across all reviews, recall of included studies into the top 500 was 0.70. There was no statistically significant difference in ranking when comparing included studies with just the subset of excluded studies listed as excluded in the published review. The relevance ranking provided by the search engine was better than expected by chance and shows promise for the preliminary evaluation of large results from Boolean searches. A statistical search engine does not appear to be able to make fine discriminations concerning the relevance of bibliographic records that have been pre-screened by systematic reviewers.
Optimal Strategy and Business Models
DEFF Research Database (Denmark)
Johnson, Peter; Foss, Nicolai Juul
2016-01-01
This study picks up on earlier suggestions that control theory may further the study of strategy. Strategy can be formally interpreted as an idealized path optimizing heterogeneous resource deployment to produce maximum financial gain. Using standard matrix methods to describe the firm Hamiltonia...... variable of firm path, suggesting in turn that the firm's business model is the codification of the application of investment resources used to control the strategic path of value realization....
Ringed Seal Search for Global Optimization via a Sensitive Search Model.
Directory of Open Access Journals (Sweden)
Younes Saadi
Full Text Available The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive and exploitation (intensive of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be
Ant colony search algorithm for optimal reactive power optimization
Directory of Open Access Journals (Sweden)
Lenin K.
2006-01-01
Full Text Available The paper presents an (ACSA Ant colony search Algorithm for Optimal Reactive Power Optimization and voltage control of power systems. ACSA is a new co-operative agents’ approach, which is inspired by the observation of the behavior of real ant colonies on the topic of ant trial formation and foraging methods. Hence, in the ACSA a set of co-operative agents called "Ants" co-operates to find good solution for Reactive Power Optimization problem. The ACSA is applied for optimal reactive power optimization is evaluated on standard IEEE, 30, 57, 191 (practical test bus system. The proposed approach is tested and compared to genetic algorithm (GA, Adaptive Genetic Algorithm (AGA.
Optimal Search for an Astrophysical Gravitational-Wave Background
Rory Smith; Eric Thrane
2018-01-01
Roughly every 2–10 min, a pair of stellar-mass black holes merge somewhere in the Universe. A small fraction of these mergers are detected as individually resolvable gravitational-wave events by advanced detectors such as LIGO and Virgo. The rest contribute to a stochastic background. We derive the statistically optimal search strategy (producing minimum credible intervals) for a background of unresolved binaries. Our method applies Bayesian parameter estimation to all available data. Using M...
Search Engine Marketing (SEM: Financial & Competitive Advantages of an Effective Hotel SEM Strategy
Directory of Open Access Journals (Sweden)
Leora Halpern Lanz
2015-05-01
Full Text Available Search Engine Marketing and Optimization (SEO, SEM are keystones of a hotels marketing strategy, in fact research shows that 90% of travelers start their vacation planning with a Google search. Learn five strategies that can enhance a hotels SEO and SEM strategies to boost bookings.
Search Engine Marketing (SEM): Financial & Competitive Advantages of an Effective Hotel SEM Strategy
Leora Halpern Lanz
2015-01-01
Search Engine Marketing and Optimization (SEO, SEM) are keystones of a hotels marketing strategy, in fact research shows that 90% of travelers start their vacation planning with a Google search. Learn five strategies that can enhance a hotels SEO and SEM strategies to boost bookings.
Formalized search strategies for human risk contributions
International Nuclear Information System (INIS)
Rasmussen, J.; Pedersen, O.M.
1982-07-01
For risk management, the results of a probabilistic risk analysis (PRA) as well as the underlying assumptions can be used as references in a closed-loop risk control; and the analyses of operational experiences as a means of feedback. In this context, the need for explicit definition and documentation of the PRA coverage, including the search strategies applied, is discussed and aids are proposed such as plant description in terms of a formal abstraction hierarchy and use of cause-consequence-charts for the documentation of not only the results of PRA but also of its coverage. Typical human risk contributions are described on the basis of general plant design features relevant for risk and accident analysis. With this background, search strategies for human risk contributions are treated: Under the designation ''work analysis'', procedures for the analysis of familiar, well trained, planned tasks are proposed. Strategies for identifying human risk contributions outside this category are outlined. (author)
Taking It to the Top: A Lesson in Search Engine Optimization
Frydenberg, Mark; Miko, John S.
2011-01-01
Search engine optimization (SEO), the promoting of a Web site so it achieves optimal position with a search engine's rankings, is an important strategy for organizations and individuals in order to promote their brands online. Techniques for achieving SEO are relevant to students of marketing, computing, media arts, and other disciplines, and many…
Mixed integer evolution strategies for parameter optimization.
Li, Rui; Emmerich, Michael T M; Eggermont, Jeroen; Bäck, Thomas; Schütz, M; Dijkstra, J; Reiber, J H C
2013-01-01
Evolution strategies (ESs) are powerful probabilistic search and optimization algorithms gleaned from biological evolution theory. They have been successfully applied to a wide range of real world applications. The modern ESs are mainly designed for solving continuous parameter optimization problems. Their ability to adapt the parameters of the multivariate normal distribution used for mutation during the optimization run makes them well suited for this domain. In this article we describe and study mixed integer evolution strategies (MIES), which are natural extensions of ES for mixed integer optimization problems. MIES can deal with parameter vectors consisting not only of continuous variables but also with nominal discrete and integer variables. Following the design principles of the canonical evolution strategies, they use specialized mutation operators tailored for the aforementioned mixed parameter classes. For each type of variable, the choice of mutation operators is governed by a natural metric for this variable type, maximal entropy, and symmetry considerations. All distributions used for mutation can be controlled in their shape by means of scaling parameters, allowing self-adaptation to be implemented. After introducing and motivating the conceptual design of the MIES, we study the optimality of the self-adaptation of step sizes and mutation rates on a generalized (weighted) sphere model. Moreover, we prove global convergence of the MIES on a very general class of problems. The remainder of the article is devoted to performance studies on artificial landscapes (barrier functions and mixed integer NK landscapes), and a case study in the optimization of medical image analysis systems. In addition, we show that with proper constraint handling techniques, MIES can also be applied to classical mixed integer nonlinear programming problems.
Bramer, W. M.; Rethlefsen, Melissa L.; Kleijnen, Jos; Franco, Oscar H.
2017-01-01
Background: Within systematic reviews, when searching for relevant references, it is advisable to use multiple databases. However, searching databases is laborious and time-consuming, as syntax of search strategies are database specific. We aimed to determine the optimal combination of databases
Search Greedy for radial fuel optimization
International Nuclear Information System (INIS)
Ortiz, J. J.; Castillo, J. A.; Pelta, D. A.
2008-01-01
In this work a search algorithm Greedy is presented for the optimization of fuel cells in reactors BWR. As first phase a study was made of sensibility of the Factor of Pick of Local Power (FPPL) of the cell, in function of the exchange of the content of two fuel rods. His way it could settle down that then the rods to exchange do not contain gadolinium, small changes take place in the value of the FPPL of the cell. This knowledge was applied later in the search Greedy to optimize fuel cell. Exchanges of rods with gadolinium takes as a mechanism of global search and exchanges of rods without gadolinium takes as a method of local search. It worked with a cell of 10x10 rods and 2 circular water channels in center of the same one. From an inventory of enrichments of uranium and concentrations of given gadolinium and one distribution of well-known enrichments; the techniques finds good solutions that the FPPL minimizes, maintaining the factor of multiplication of neutrons in a range appropriate of values. In the low part of the assembly of a lot of recharge of a cycle of 18 months the cells were placed. The values of FPPL of the opposing cells are similar or smaller to those of the original cell and with behaviors in the nucleus also comparable to those obtained with the original cell. The evaluation of the cells was made with the code of transport CASMO-IV and the evaluation of the nucleus was made by means of the one simulator of the nucleus SIMULATE-3. (Author)
Searching for Cost-Optimized Interstellar Beacons
Benford, Gregory; Benford, James; Benford, Dominic
2010-06-01
What would SETI beacon transmitters be like if built by civilizations that had a variety of motives but cared about cost? In a companion paper, we presented how, for fixed power density in the far field, a cost-optimum interstellar beacon system could be built. Here, we consider how we should search for a beacon if it were produced by a civilization similar to ours. High-power transmitters could be built for a wide variety of motives other than the need for two-way communication; this would include beacons built to be seen over thousands of light-years. Extraterrestrial beacon builders would likely have to contend with economic pressures just as their terrestrial counterparts do. Cost, spectral lines near 1 GHz, and interstellar scintillation favor radiating frequencies substantially above the classic "water hole." Therefore, the transmission strategy for a distant, cost-conscious beacon would be a rapid scan of the galactic plane with the intent to cover the angular space. Such pulses would be infrequent events for the receiver. Such beacons built by distant, advanced, wealthy societies would have very different characteristics from what SETI researchers seek. Future searches should pay special attention to areas along the galactic disk where SETI searches have seen coherent signals that have not recurred on the limited listening time intervals we have used. We will need to wait for recurring events that may arriarrive in intermittent bursts. Several new SETI search strategies have emerged from these ideas. We propose a new test for beacons that is based on the Life Plane hypotheses.
Formalized Search Strategies for Human Risk Contributions
DEFF Research Database (Denmark)
Rasmussen, Jens; Pedersen, O. M.
For risk management, the results of a probabilistic risk analysis (PRA) as well as the underlying assumptions can be used as references in a closed-loop risk control; and the analyses of operational experiences as a means of feedback. In this context, the need for explicit definition...... risk contributions are described on the basis of general plant design features relevant for risk and accident analysis. With this background, search strategies for human risk contributions are treated: Under the designation "work analysis", procedures for the analysis of familiar, well trained, planned...... tasks are proposed. Strategies for identifying human risk contributions outside this category are outlined....
Optimal Path Determination for Flying Vehicle to Search an Object
Heru Tjahjana, R.; Heri Soelistyo U, R.; Ratnasari, L.; Irawanto, B.
2018-01-01
In this paper, a method to determine optimal path for flying vehicle to search an object is proposed. Background of the paper is controlling air vehicle to search an object. Optimal path determination is one of the most popular problem in optimization. This paper describe model of control design for a flying vehicle to search an object, and focus on the optimal path that used to search an object. In this paper, optimal control model is used to control flying vehicle to make the vehicle move in optimal path. If the vehicle move in optimal path, then the path to reach the searched object also optimal. The cost Functional is one of the most important things in optimal control design, in this paper the cost functional make the air vehicle can move as soon as possible to reach the object. The axis reference of flying vehicle uses N-E-D (North-East-Down) coordinate system. The result of this paper are the theorems which say that the cost functional make the control optimal and make the vehicle move in optimal path are proved analytically. The other result of this paper also shows the cost functional which used is convex. The convexity of the cost functional is use for guarantee the existence of optimal control. This paper also expose some simulations to show an optimal path for flying vehicle to search an object. The optimization method which used to find the optimal control and optimal path vehicle in this paper is Pontryagin Minimum Principle.
Optimal Search for an Astrophysical Gravitational-Wave Background
Smith, Rory; Thrane, Eric
2018-04-01
Roughly every 2-10 min, a pair of stellar-mass black holes merge somewhere in the Universe. A small fraction of these mergers are detected as individually resolvable gravitational-wave events by advanced detectors such as LIGO and Virgo. The rest contribute to a stochastic background. We derive the statistically optimal search strategy (producing minimum credible intervals) for a background of unresolved binaries. Our method applies Bayesian parameter estimation to all available data. Using Monte Carlo simulations, we demonstrate that the search is both "safe" and effective: it is not fooled by instrumental artifacts such as glitches and it recovers simulated stochastic signals without bias. Given realistic assumptions, we estimate that the search can detect the binary black hole background with about 1 day of design sensitivity data versus ≈40 months using the traditional cross-correlation search. This framework independently constrains the merger rate and black hole mass distribution, breaking a degeneracy present in the cross-correlation approach. The search provides a unified framework for population studies of compact binaries, which is cast in terms of hyperparameter estimation. We discuss a number of extensions and generalizations, including application to other sources (such as binary neutron stars and continuous-wave sources), simultaneous estimation of a continuous Gaussian background, and applications to pulsar timing.
Optimal Search for an Astrophysical Gravitational-Wave Background
Directory of Open Access Journals (Sweden)
Rory Smith
2018-04-01
Full Text Available Roughly every 2–10 min, a pair of stellar-mass black holes merge somewhere in the Universe. A small fraction of these mergers are detected as individually resolvable gravitational-wave events by advanced detectors such as LIGO and Virgo. The rest contribute to a stochastic background. We derive the statistically optimal search strategy (producing minimum credible intervals for a background of unresolved binaries. Our method applies Bayesian parameter estimation to all available data. Using Monte Carlo simulations, we demonstrate that the search is both “safe” and effective: it is not fooled by instrumental artifacts such as glitches and it recovers simulated stochastic signals without bias. Given realistic assumptions, we estimate that the search can detect the binary black hole background with about 1 day of design sensitivity data versus ≈40 months using the traditional cross-correlation search. This framework independently constrains the merger rate and black hole mass distribution, breaking a degeneracy present in the cross-correlation approach. The search provides a unified framework for population studies of compact binaries, which is cast in terms of hyperparameter estimation. We discuss a number of extensions and generalizations, including application to other sources (such as binary neutron stars and continuous-wave sources, simultaneous estimation of a continuous Gaussian background, and applications to pulsar timing.
Evolution strategies for robust optimization
Kruisselbrink, Johannes Willem
2012-01-01
Real-world (black-box) optimization problems often involve various types of uncertainties and noise emerging in different parts of the optimization problem. When this is not accounted for, optimization may fail or may yield solutions that are optimal in the classical strict notion of optimality, but
Design search and optimization in aerospace engineering.
Keane, A J; Scanlan, J P
2007-10-15
In this paper, we take a design-led perspective on the use of computational tools in the aerospace sector. We briefly review the current state-of-the-art in design search and optimization (DSO) as applied to problems from aerospace engineering, focusing on those problems that make heavy use of computational fluid dynamics (CFD). This ranges over issues of representation, optimization problem formulation and computational modelling. We then follow this with a multi-objective, multi-disciplinary example of DSO applied to civil aircraft wing design, an area where this kind of approach is becoming essential for companies to maintain their competitive edge. Our example considers the structure and weight of a transonic civil transport wing, its aerodynamic performance at cruise speed and its manufacturing costs. The goals are low drag and cost while holding weight and structural performance at acceptable levels. The constraints and performance metrics are modelled by a linked series of analysis codes, the most expensive of which is a CFD analysis of the aerodynamics using an Euler code with coupled boundary layer model. Structural strength and weight are assessed using semi-empirical schemes based on typical airframe company practice. Costing is carried out using a newly developed generative approach based on a hierarchical decomposition of the key structural elements of a typical machined and bolted wing-box assembly. To carry out the DSO process in the face of multiple competing goals, a recently developed multi-objective probability of improvement formulation is invoked along with stochastic process response surface models (Krigs). This approach both mitigates the significant run times involved in CFD computation and also provides an elegant way of balancing competing goals while still allowing the deployment of the whole range of single objective optimizers commonly available to design teams.
Organizational Search Strategy: An Examination of Interdependencies, Locus and Temporality of Search
Ebrahim, Mahdi
2017-01-01
Notwithstanding the ample research on organizational search and its performance implications, the factors that shape the organizations’ search strategy is fairly under-explored. This study investigates how problems’ characteristics influence the managerial decision of searching jointly or
Optimal taxation and welfare benefits with monitoring of job search
Boone, J.; Bovenberg, A.L.
2013-01-01
In order to investigate the interaction between tax policy, welfare benefits, the government technology for monitoring and sanctioning inadequate search, workfare, and externalities from work, we incorporate endogenous job search and involuntary unemployment into a model of optimal nonlinear income
In Search of Search Engine Marketing Strategy Amongst SME's in Ireland
Barry, Chris; Charleton, Debbie
Researchers have identified the Web as a searchers first port of call for locating information. Search Engine Marketing (SEM) strategies have been noted as a key consideration when developing, maintaining and managing Websites. A study presented here of SEM practices of Irish small to medium enterprises (SMEs) reveals they plan to spend more resources on SEM in the future. Most firms utilize an informal SEM strategy, where Website optimization is perceived most effective in attracting traffic. Respondents cite the use of ‘keywords in title and description tags’ as the most used SEM technique, followed by the use of ‘keywords throughout the whole Website’; while ‘Pay for Placement’ was most widely used Paid Search technique. In concurrence with the literature, measuring SEM performance remains a significant challenge with many firms unsure if they measure it effectively. An encouraging finding is that Irish SMEs adopt a positive ethical posture when undertaking SEM.
Optimal neighborhood indexing for protein similarity search.
Peterlongo, Pierre; Noé, Laurent; Lavenier, Dominique; Nguyen, Van Hoa; Kucherov, Gregory; Giraud, Mathieu
2008-12-16
Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data flow involves heuristics with large seed indexes. In order to speed up this technique, the index can be enhanced by storing additional information to limit the number of random memory accesses. However, this improvement leads to a larger index that may become a bottleneck. In the case of protein similarity search, we propose to decrease the index size by reducing the amino acid alphabet. The paper presents two main contributions. First, we show that an optimal neighborhood indexing combining an alphabet reduction and a longer neighborhood leads to a reduction of 35% of memory involved into the process, without sacrificing the quality of results nor the computational time. Second, our approach led us to develop a new kind of substitution score matrices and their associated e-value parameters. In contrast to usual matrices, these matrices are rectangular since they compare amino acid groups from different alphabets. We describe the method used for computing those matrices and we provide some typical examples that can be used in such comparisons. Supplementary data can be found on the website http://bioinfo.lifl.fr/reblosum. We propose a practical index size reduction of the neighborhood data, that does not negatively affect the performance of large-scale search in protein sequences. Such an index can be used in any study involving large protein data. Moreover, rectangular substitution score matrices and their associated statistical parameters can have applications in any study involving an alphabet reduction.
Optimal neighborhood indexing for protein similarity search
Directory of Open Access Journals (Sweden)
Nguyen Van
2008-12-01
Full Text Available Abstract Background Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data flow involves heuristics with large seed indexes. In order to speed up this technique, the index can be enhanced by storing additional information to limit the number of random memory accesses. However, this improvement leads to a larger index that may become a bottleneck. In the case of protein similarity search, we propose to decrease the index size by reducing the amino acid alphabet. Results The paper presents two main contributions. First, we show that an optimal neighborhood indexing combining an alphabet reduction and a longer neighborhood leads to a reduction of 35% of memory involved into the process, without sacrificing the quality of results nor the computational time. Second, our approach led us to develop a new kind of substitution score matrices and their associated e-value parameters. In contrast to usual matrices, these matrices are rectangular since they compare amino acid groups from different alphabets. We describe the method used for computing those matrices and we provide some typical examples that can be used in such comparisons. Supplementary data can be found on the website http://bioinfo.lifl.fr/reblosum. Conclusion We propose a practical index size reduction of the neighborhood data, that does not negatively affect the performance of large-scale search in protein sequences. Such an index can be used in any study involving large protein data. Moreover, rectangular substitution score matrices and their associated statistical parameters can have applications in any study involving an alphabet reduction.
Chance and strategy in search processes
International Nuclear Information System (INIS)
Moreau, M; Bénichou, O; Loverdo, C; Voituriez, R
2009-01-01
We consider a searcher in quest of a target in two situations: in the presence of an infinite number of identical, Poisson distributed targets, and in the presence of a unique target in a finite territory. The searcher alternates intensive search phases, during which it scans the neighbouring territory but does not move, and displacement phases with no target detection. We study the problem of determining the best strategy of displacement for minimizing the mean search time: either a deterministic or a stochastic trajectory. With a reasonable simplifying hypothesis, we show that for Poisson distributed targets, deterministic, self-avoiding trajectories are more efficient than stochastic ones if the detection process involves no memory skills and can be modelled by a Markov process. In contrast, if the detection process is not Markovian, it can be better for the searcher to follow a stochastic trajectory rather than a self-avoiding trajectory, and we give an explicit example of such a memory law. In the case of a unique target, self-avoiding trajectories are always better if an infinite time is available for the search, whereas stochastic trajectories can be more efficient if the searcher has to find the target before a given deadline. Moreover, we show that the gain due to a deterministic trajectory, compared to a stochastic one, is not significant in the case of a large network containing a unique target. Additionally, for various examples of displacement trajectories, we compute the overall mean search time and study its minimization as a function of the mean duration of the detection process
Directory of Open Access Journals (Sweden)
Jianwen Guo
2016-01-01
Full Text Available All equipment must be maintained during its lifetime to ensure normal operation. Maintenance is one of the critical roles in the success of manufacturing enterprises. This paper proposed a preventive maintenance period optimization model (PMPOM to find an optimal preventive maintenance period. By making use of the advantages of particle swarm optimization (PSO and cuckoo search (CS algorithm, a hybrid optimization algorithm of PSO and CS is proposed to solve the PMPOM problem. The test functions show that the proposed algorithm exhibits more outstanding performance than particle swarm optimization and cuckoo search. Experiment results show that the proposed algorithm has advantages of strong optimization ability and fast convergence speed to solve the PMPOM problem.
Strategies to improve sleep during extended search and rescue operations.
Jenkins, Jennifer Lee; Fredericksen, Kim; Stone, Roger; Tang, Nelson
2007-01-01
This study investigated strategies to improve sleeping conditions during search and rescue operations during disaster response. Forty members of the Montgomery County (Maryland) Urban Search and Rescue Team were surveyed for individual sleep habits and sleeping aids used during extended deployments. Team members were also asked to suggest methods to improve sleep on future deployments. The average amount of sleep during field operations was 5.4 hours with a range of 4-8 hours. Eight percent surveyed would prefer another schedule besides the 12-hour work day, all of whom proposed three 8-hour shifts. Fifteen percent of participants were interested in a pharmacological sleeping aid. Fifty percent of search and rescue members interviewed would consider using nonpharmacological sleeping aids. Furthermore, 40% of participants stated they had successfully devised self-employed methods of sleep aids for previous deployments, such as ear plugs, massage, mental imagery, personal routines, music and headphones, reading, and blindfolds. This study suggests that availability of both pharmacological and nonpharmacological sleeping aids to search and rescue workers via the team cache could impact the quantity of sleep. Further investigation into methods of optimizing sleep during field missions could theoretically show enhanced performance through various aspects of missions including mitigation of errors, improved productivity, and improved overall physiological and emotional well-being of search and rescue personnel.
Intelligent Search Optimization using Artificial Fuzzy Logics
Manral, Jai
2015-01-01
Information on the web is prodigious; searching relevant information is difficult making web users to rely on search engines for finding relevant information on the web. Search engines index and categorize web pages according to their contents using crawlers and rank them accordingly. For given user query they retrieve millions of webpages and display them to users according to web-page rank. Every search engine has their own algorithms based on certain parameters for ranking web-pages. Searc...
Randomized Search Strategies With Imperfect Sensors
National Research Council Canada - National Science Library
Gage, Douglas W
1993-01-01
.... An important class of coverage applications are those that involve a search, in which a number of searching elements move about within a prescribed search area in order to find one or more target...
Asymptotic estimation of reactor fueling optimal strategy
International Nuclear Information System (INIS)
Simonov, V.D.
1985-01-01
The problem of improving the technical-economic factors of operating. and designed nuclear power plant blocks by developino. internal fuel cycle strategy (reactor fueling regime optimization), taking into account energy system structural peculiarities altogether, is considered. It is shown, that in search of asymptotic solutions of reactor fueling planning tasks the model of fuel energy potential (FEP) is the most ssuitable and effective. FEP represents energy which may be produced from the fuel in a reactor with real dimensions and power, but with hypothetical fresh fuel supply, regime, providing smilar burnup of all the fuel, passing through the reactor, and continuous overloading of infinitely small fuel portion under fule power, and infinitely rapid mixing of fuel in the reactor core volume. Reactor fuel run with such a standard fuel cycle may serve as FEP quantitative measure. Assessment results of optimal WWER-440 reactor fresh fuel supply periodicity are given as an example. The conclusion is drawn that with fuel enrichment x=3.3% the run which is 300 days, is economically justified, taking into account that the cost of one energy unit production is > 3 cop/KW/h
Optimal search strategies on complex networks
Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco
2014-01-01
Complex networks are ubiquitous in nature and play a role of paramount importance in many contexts. Internet and the cyberworld, which permeate our everyday life, are self-organized hierarchical graphs. Urban traffic flows on intricate road networks, which impact both transportation design and epidemic control. In the brain, neurons are cabled through heterogeneous connections, which support the propagation of electric signals. In all these cases, the true challenge is to unveil the mechanism...
An Innovative Approach for online Meta Search Engine Optimization
Manral, Jai; Hossain, Mohammed Alamgir
2015-01-01
This paper presents an approach to identify efficient techniques used in Web Search Engine Optimization (SEO). Understanding SEO factors which can influence page ranking in search engine is significant for webmasters who wish to attract large number of users to their website. Different from previous relevant research, in this study we developed an intelligent Meta search engine which aggregates results from various search engines and ranks them based on several important SEO parameters. The r...
Optimizing EDELWEISS detectors for low-mass WIMP searches
Arnaud, Q.; Armengaud, E.; Augier, C.; Benoît, A.; Bergé, L.; Billard, J.; Broniatowski, A.; Camus, P.; Cazes, A.; Chapellier, M.; Charlieux, F.; de Jésus, M.; Dumoulin, L.; Eitel, K.; Foerster, N.; Gascon, J.; Giuliani, A.; Gros, M.; Hehn, L.; Jin, Y.; Juillard, A.; Kleifges, M.; Kozlov, V.; Kraus, H.; Kudryavtsev, V. A.; Le-Sueur, H.; Maisonobe, R.; Marnieros, S.; Navick, X.-F.; Nones, C.; Olivieri, E.; Pari, P.; Paul, B.; Poda, D.; Queguiner, E.; Rozov, S.; Sanglard, V.; Scorza, S.; Siebenborn, B.; Vagneron, L.; Weber, M.; Yakushev, E.; EDELWEISS Collaboration
2018-01-01
The physics potential of EDELWEISS detectors for the search of low-mass weakly interacting massive particles (WIMPs) is studied. Using a data-driven background model, projected exclusion limits are computed using frequentist and multivariate analysis approaches, namely, profile likelihood and boosted decision tree. Both current and achievable experimental performances are considered. The optimal strategy for detector optimization depends critically on whether the emphasis is put on WIMP masses below or above ˜5 GeV /c2 . The projected sensitivity for the next phase of the EDELWEISS-III experiment at the Modane Underground Laboratory (LSM) for low-mass WIMP search is presented. By 2018 an upper limit on the spin-independent WIMP-nucleon cross section of σSI=7 ×10-42 cm2 is expected for a WIMP mass in the range 2 - 5 GeV /c2 . The requirements for a future hundred-kilogram-scale experiment designed to reach the bounds imposed by the coherent scattering of solar neutrinos are also described. By improving the ionization resolution down to 50 eVe e , we show that such an experiment installed in an even lower background environment (e.g., at SNOLAB) together with an exposure of 1 000 kg .yr , should allow us to observe about 80 B 8 neutrino events after discrimination.
Optimizing literature search in systematic reviews
DEFF Research Database (Denmark)
Aagaard, Thomas; Lund, Hans; Juhl, Carsten Bogh
2016-01-01
BACKGROUND: When conducting systematic reviews, it is essential to perform a comprehensive literature search to identify all published studies relevant to the specific research question. The Cochrane Collaborations Methodological Expectations of Cochrane Intervention Reviews (MECIR) guidelines...... of musculoskeletal disorders. METHODS: Data sources were systematic reviews published by the Cochrane Musculoskeletal Review Group, including at least five RCTs, reporting a search history, searching MEDLINE, EMBASE, CENTRAL, and adding reference- and hand-searching. Additional databases were deemed eligible...... if they indexed RCTs, were in English and used in more than three of the systematic reviews. Relative recall was calculated as the number of studies identified by the literature search divided by the number of eligible studies i.e. included studies in the individual systematic reviews. Finally, cumulative median...
Determining an optimal supply chain strategy
Directory of Open Access Journals (Sweden)
Intaher M. Ambe
2012-11-01
Full Text Available In today’s business environment, many companies want to become efficient and flexible, but have struggled, in part, because they have not been able to formulate optimal supply chain strategies. Often this is as a result of insufficient knowledge about the costs involved in maintaining supply chains and the impact of the supply chain on their operations. Hence, these companies find it difficult to manufacture at a competitive cost and respond quickly and reliably to market demand. Mismatched strategies are the root cause of the problems that plague supply chains, and supply-chain strategies based on a one-size-fits-all strategy often fail. The purpose of this article is to suggest instruments to determine an optimal supply chain strategy. This article, which is conceptual in nature, provides a review of current supply chain strategies and suggests a framework for determining an optimal strategy.
Multispecies Coevolution Particle Swarm Optimization Based on Previous Search History
Directory of Open Access Journals (Sweden)
Danping Wang
2017-01-01
Full Text Available A hybrid coevolution particle swarm optimization algorithm with dynamic multispecies strategy based on K-means clustering and nonrevisit strategy based on Binary Space Partitioning fitness tree (called MCPSO-PSH is proposed. Previous search history memorized into the Binary Space Partitioning fitness tree can effectively restrain the individuals’ revisit phenomenon. The whole population is partitioned into several subspecies and cooperative coevolution is realized by an information communication mechanism between subspecies, which can enhance the global search ability of particles and avoid premature convergence to local optimum. To demonstrate the power of the method, comparisons between the proposed algorithm and state-of-the-art algorithms are grouped into two categories: 10 basic benchmark functions (10-dimensional and 30-dimensional, 10 CEC2005 benchmark functions (30-dimensional, and a real-world problem (multilevel image segmentation problems. Experimental results show that MCPSO-PSH displays a competitive performance compared to the other swarm-based or evolutionary algorithms in terms of solution accuracy and statistical tests.
Optimal Taxation with On-the-Job Search
DEFF Research Database (Denmark)
Bagger, Jesper; Moen, Espen R.; Vejlin, Rune Majlund
We study the optimal taxation of labor income in the presence of search frictions. Heterogeneous workers undertake costly search off- and on-the-job in order to locate more productive jobs that pay higher wages. More productive workers search harder, resulting in equilibrium sorting where low......-type workers are overrepresented in low-wage jobs while high-type workers are overrepresented in high-wage jobs. Absent taxes, worker search effort is efficient, because the social and private gains from search coincide. The optimal tax system balance efficiency and equity concerns at the margin. Equity...... concerns make it desirable to levy low taxes on (or indeed, subsidize) low-wage jobs including unemployment, and levy high taxes on high-wage jobs. Efficiency concerns limit how much taxes an optimal tax system levy on high-paid jobs, as high taxes distort the workers' incentives to search. The model...
Finfgeld-Connett, Deborah; Johnson, E Diane
2013-01-01
To report literature search strategies for the purpose of conducting knowledge-building and theory-generating qualitative systematic reviews. Qualitative systematic reviews lie on a continuum from knowledge-building and theory-generating to aggregating and summarizing. Different types of literature searches are needed to optimally support these dissimilar reviews. Articles published between 1989-Autumn 2011. These documents were identified using a hermeneutic approach and multiple literature search strategies. Redundancy is not the sole measure of validity when conducting knowledge-building and theory-generating systematic reviews. When conducting these types of reviews, literature searches should be consistent with the goal of fully explicating concepts and the interrelationships among them. To accomplish this objective, a 'berry picking' approach is recommended along with strategies for overcoming barriers to finding qualitative research reports. To enhance integrity of knowledge-building and theory-generating systematic reviews, reviewers are urged to make literature search processes as transparent as possible, despite their complexity. This includes fully explaining and rationalizing what databases were used and how they were searched. It also means describing how literature tracking was conducted and grey literature was searched. In the end, the decision to cease searching also needs to be fully explained and rationalized. Predetermined linear search strategies are unlikely to generate search results that are adequate for purposes of conducting knowledge-building and theory-generating qualitative systematic reviews. Instead, it is recommended that iterative search strategies take shape as reviews evolve. © 2012 Blackwell Publishing Ltd.
Piehowski, Paul D; Petyuk, Vladislav A; Sandoval, John D; Burnum, Kristin E; Kiebel, Gary R; Monroe, Matthew E; Anderson, Gordon A; Camp, David G; Smith, Richard D
2013-03-01
For bottom-up proteomics, there are wide variety of database-searching algorithms in use for matching peptide sequences to tandem MS spectra. Likewise, there are numerous strategies being employed to produce a confident list of peptide identifications from the different search algorithm outputs. Here we introduce a grid-search approach for determining optimal database filtering criteria in shotgun proteomics data analyses that is easily adaptable to any search. Systematic Trial and Error Parameter Selection--referred to as STEPS--utilizes user-defined parameter ranges to test a wide array of parameter combinations to arrive at an optimal "parameter set" for data filtering, thus maximizing confident identifications. The benefits of this approach in terms of numbers of true-positive identifications are demonstrated using datasets derived from immunoaffinity-depleted blood serum and a bacterial cell lysate, two common proteomics sample types. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Web-based information search and retrieval: effects of strategy use and age on search success.
Stronge, Aideen J; Rogers, Wendy A; Fisk, Arthur D
2006-01-01
The purpose of this study was to investigate the relationship between strategy use and search success on the World Wide Web (i.e., the Web) for experienced Web users. An additional goal was to extend understanding of how the age of the searcher may influence strategy use. Current investigations of information search and retrieval on the Web have provided an incomplete picture of Web strategy use because participants have not been given the opportunity to demonstrate their knowledge of Web strategies while also searching for information on the Web. Using both behavioral and knowledge-engineering methods, we investigated searching behavior and system knowledge for 16 younger adults (M = 20.88 years of age) and 16 older adults (M = 67.88 years). Older adults were less successful than younger adults in finding correct answers to the search tasks. Knowledge engineering revealed that the age-related effect resulted from ineffective search strategies and amount of Web experience rather than age per se. Our analysis led to the development of a decision-action diagram representing search behavior for both age groups. Older adults had more difficulty than younger adults when searching for information on the Web. However, this difficulty was related to the selection of inefficient search strategies, which may have been attributable to a lack of knowledge about available Web search strategies. Actual or potential applications of this research include training Web users to search more effectively and suggestions to improve the design of search engines.
Ambush frequency should increase over time during optimal predator search for prey.
Alpern, Steve; Fokkink, Robbert; Timmer, Marco; Casas, Jérôme
2011-11-07
We advance and apply the mathematical theory of search games to model the problem faced by a predator searching for prey. Two search modes are available: ambush and cruising search. Some species can adopt either mode, with their choice at a given time traditionally explained in terms of varying habitat and physiological conditions. We present an additional explanation of the observed predator alternation between these search modes, which is based on the dynamical nature of the search game they are playing: the possibility of ambush decreases the propensity of the prey to frequently change locations and thereby renders it more susceptible to the systematic cruising search portion of the strategy. This heuristic explanation is supported by showing that in a new idealized search game where the predator is allowed to ambush or search at any time, and the prey can change locations at intermittent times, optimal predator play requires an alternation (or mixture) over time of ambush and cruise search. Thus, our game is an extension of the well-studied 'Princess and Monster' search game. Search games are zero sum games, where the pay-off is the capture time and neither the Searcher nor the Hider knows the location of the other. We are able to determine the optimal mixture of the search modes when the predator uses a mixture which is constant over time, and also to determine how the mode mixture changes over time when dynamic strategies are allowed (the ambush probability increases over time). In particular, we establish the 'square root law of search predation': the optimal proportion of active search equals the square root of the fraction of the region that has not yet been explored.
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
Binary cuckoo search based optimal PMU placement scheme for ...
African Journals Online (AJOL)
without including zero-injection effect, an Optimal PMU Placement strategy considering ..... in Indian power grid — A case study, Frontiers in Energy, Vol. ... optimization approach, Proceedings: International Conference on Intelligent Systems ...
Optimization strategies in complex systems
Bussolari, L.; Contucci, P.; Giardinà, C.; Giberti, C.; Unguendoli, F.; Vernia, C.
2003-01-01
We consider a class of combinatorial optimization problems that emerge in a variety of domains among which: condensed matter physics, theory of financial risks, error correcting codes in information transmissions, molecular and protein conformation, image restoration. We show the performances of two
The Effect of Teaching Search Strategies on Perceptual Performance.
van der Gijp, Anouk; Vincken, Koen L; Boscardin, Christy; Webb, Emily M; Ten Cate, Olle Th J; Naeger, David M
2017-06-01
Radiology expertise is dependent on the use of efficient search strategies. The aim of this study is to investigate the effect of teaching search strategies on trainee's accuracy in detecting lung nodules at computed tomography. Two search strategies, "scanning" and "drilling," were tested with a randomized crossover design. Nineteen junior radiology residents were randomized into two groups. Both groups first completed a baseline lung nodule detection test allowing a free search strategy, followed by a test after scanning instruction and drilling instruction or vice versa. True positive (TP) and false positive (FP) scores and scroll behavior were registered. A mixed-design analysis of variance was applied to compare the three search conditions. Search strategy instruction had a significant effect on scroll behavior, F(1.3) = 54.2, P search (M = 15.3, SD = 4.6), t(18) = 4.44, P search. FP scores for drilling (M = 7.3, SD = 5.6) were significantly lower than for free search (M = 12.5, SD = 7.8), t(18) = 4.86, P < 0.001. Teaching a drilling strategy is preferable to teaching a scanning strategy for finding lung nodules. Copyright © 2017 The Association of University Radiologists. Published by Elsevier Inc. All rights reserved.
Directory of Open Access Journals (Sweden)
John Loy
2007-06-01
Full Text Available Objective – To develop and test the sensitivity and specificity, precision andaccuracy of search strategies to retrieve clinically sound treatment studies in the EMBASE database.Design – Analytical study.Setting – Methodologically sound studies of treatment from 55 journals indexed in EMBASE for the year 2000.Subjects – EMBASE and hand searches performed at the Health Information Research Unit of McMaster University, Ontario, Canada.Methods – The authors compare the results of EMBASE searches using their search strategies with the “gold standard” of articles retrieved by hand search. Research assistants initially hand searched each issue of 55 selected journals published in 2000 to identify articles detailing studies on healthcare treatment of humans. Subject coverage of the journals was wide ranging and included obstetrics and gynaecology, psychiatry, oncology, neurology, surgery and general practice. Studies were then assessed to ensure they met the qualifying criteria: random allocation of participants to groups, outcome assessment of at least 80% of participants who began the study, and analysis consistent with study design. Initially, 3850 articles on treatment were identified, of which 1256 (32.6% were methodologically sound. To construct a comprehensive set of search terms, input was sought from librarians and researchers in the US and Canada. This initially produced a list of 5385 terms, of which 4843 were unique and 3524 produced hits. Individual search terms with sensitivity greater then 25% and specificity greater then 75% were incorporated into search strategies for use within the OVID interface for the EMBASE database to retrieve articles meeting the same criteria. These strategies were developed using all 27,769 articles published in the 55 journals in 2000. This all inclusive approach was used to test the search strategies’ ability to identify high quality treatment articles from a larger pool of material
Optimal Advance Selling Strategy under Price Commitment
Chenhang Zeng
2012-01-01
This paper considers a two-period model with experienced consumers and inexperienced consumers. The retailer determines both advance selling price and regular selling price at the beginning of the first period. I show that advance selling weekly dominates no advance selling, and the optimal advance selling price may be at a discount, at a premium or at the regular selling price. To help the retailer choose the optimal pricing strategy, conditions for each possible advance selling strategy to ...
Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems
National Research Council Canada - National Science Library
Abramson, Mark A; Audet, Charles; Dennis, Jr, J. E
2004-01-01
.... This class combines and extends the Audet-Dennis Generalized Pattern Search (GPS) algorithms for bound constrained mixed variable optimization, and their GPS-filter algorithms for general nonlinear constraints...
Optimizing Event Selection with the Random Grid Search
Energy Technology Data Exchange (ETDEWEB)
Bhat, Pushpalatha C. [Fermilab; Prosper, Harrison B. [Florida State U.; Sekmen, Sezen [Kyungpook Natl. U.; Stewart, Chip [Broad Inst., Cambridge
2017-06-29
The random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.
Optimal Semi-Adaptive Search With False Targets
2017-12-01
Kress, K. Y. Lin, and R. Szechtman, “Optimal discrete search with imperfect specificity,” Math Meth Oper Res, vol. 68, pp. 539–549, 2008. [16] L. D...constraints on employment of physical search assets will involve discrete approximations to the continuous solutions given by these techniques. These...model assumes. We optimize in the continuous case, to be able then to make the best possible discrete approximations if needed, given the constraints of a
Optimal Target Stars in the Search for Life
Lingam, Manasvi; Loeb, Abraham
2018-04-01
The selection of optimal targets in the search for life represents a highly important strategic issue. In this Letter, we evaluate the benefits of searching for life around a potentially habitable planet orbiting a star of arbitrary mass relative to a similar planet around a Sun-like star. If recent physical arguments implying that the habitability of planets orbiting low-mass stars is selectively suppressed are correct, we find that planets around solar-type stars may represent the optimal targets.
Uncovering Web search strategies in South African higher education
Directory of Open Access Journals (Sweden)
Surika Civilcharran
2016-11-01
Full Text Available Background: In spite of the enormous amount of information available on the Web and the fact that search engines are continuously evolving to enhance the search experience, students are nevertheless faced with the difficulty of effectively retrieving information. It is, therefore, imperative for the interaction between students and search tools to be understood and search strategies to be identified, in order to promote successful information retrieval. Objectives: This study identifies the Web search strategies used by postgraduate students and forms part of a wider study into information retrieval strategies used by postgraduate students at the University of KwaZulu-Natal (UKZN, Pietermaritzburg campus, South Africa. Method: Largely underpinned by Thatcher’s cognitive search strategies, the mixed-methods approach was utilised for this study, in which questionnaires were employed in Phase 1 and structured interviews in Phase 2. This article reports and reflects on the findings of Phase 2, which focus on identifying the Web search strategies employed by postgraduate students. The Phase 1 results were reported in Civilcharran, Hughes and Maharaj (2015. Results: Findings reveal the Web search strategies used for academic information retrieval. In spite of easy access to the invisible Web and the advent of meta-search engines, the use of Web search engines still remains the preferred search tool. The UKZN online library databases and especially the UKZN online library, Online Public Access Catalogue system, are being underutilised. Conclusion: Being ranked in the top three percent of the world’s universities, UKZN is investing in search tools that are not being used to their full potential. This evidence suggests an urgent need for students to be trained in Web searching and to have a greater exposure to a variety of search tools. This article is intended to further contribute to the design of undergraduate training programmes in order to deal
Tank Waste Remediation System optimized processing strategy
International Nuclear Information System (INIS)
Slaathaug, E.J.; Boldt, A.L.; Boomer, K.D.; Galbraith, J.D.; Leach, C.E.; Waldo, T.L.
1996-03-01
This report provides an alternative strategy evolved from the current Hanford Site Tank Waste Remediation System (TWRS) programmatic baseline for accomplishing the treatment and disposal of the Hanford Site tank wastes. This optimized processing strategy performs the major elements of the TWRS Program, but modifies the deployment of selected treatment technologies to reduce the program cost. The present program for development of waste retrieval, pretreatment, and vitrification technologies continues, but the optimized processing strategy reuses a single facility to accomplish the separations/low-activity waste (LAW) vitrification and the high-level waste (HLW) vitrification processes sequentially, thereby eliminating the need for a separate HLW vitrification facility
Using heuristic search for optimizing maintenance plans
International Nuclear Information System (INIS)
Mutanen, Teemu
2012-01-01
This work addresses the maintenance action selection process. Maintenance personnel need to evaluate maintenance actions and costs to keep the machines in working condition. Group of actions are evaluated together as maintenance plans. The maintenance plans as output provide information to the user about which actions to take if any and what future actions should be prepared for. The heuristic search method is implemented as part of general use toolbox for analysis of measurements from movable work machines. Impacts from machine's usage restrictions and maintenance activities are analysed. The results show that once put on a temporal perspective, the prioritized order of the actions is different and provide additional information to the user.
LETTER TO THE EDITOR: Optimization of partial search
Korepin, Vladimir E.
2005-11-01
A quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by the number of queries to the oracle. The author suggests a new version of the Grover-Radhakrishnan algorithm which uses a minimal number of such queries. The algorithm can run on the same hardware that is used for the usual Grover algorithm.
PWR loading pattern optimization using Harmony Search algorithm
International Nuclear Information System (INIS)
Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.
2013-01-01
Highlights: ► Numerical results reveal that the HS method is reliable. ► The great advantage of HS is significant gain in computational cost. ► On the average, the final band width of search fitness values is narrow. ► Our experiments show that the search approaches the optimal value fast. - Abstract: In this paper a core reloading technique using Harmony Search, HS, is presented in the context of finding an optimal configuration of fuel assemblies, FA, in pressurized water reactors. To implement and evaluate the proposed technique a Harmony Search along Nodal Expansion Code for 2-D geometry, HSNEC2D, is developed to obtain nearly optimal arrangement of fuel assemblies in PWR cores. This code consists of two sections including Harmony Search algorithm and Nodal Expansion modules using fourth degree flux expansion which solves two dimensional-multi group diffusion equations with one node per fuel assembly. Two optimization test problems are investigated to demonstrate the HS algorithm capability in converging to near optimal loading pattern in the fuel management field and other subjects. Results, convergence rate and reliability of the method are quite promising and show the HS algorithm performs very well and is comparable to other competitive algorithms such as Genetic Algorithm and Particle Swarm Intelligence. Furthermore, implementation of nodal expansion technique along HS causes considerable reduction of computational time to process and analysis optimization in the core fuel management problems
Optimal control of anthracnose using mixed strategies.
Fotsa Mbogne, David Jaures; Thron, Christopher
2015-11-01
In this paper we propose and study a spatial diffusion model for the control of anthracnose disease in a bounded domain. The model is a generalization of the one previously developed in [15]. We use the model to simulate two different types of control strategies against anthracnose disease. Strategies that employ chemical fungicides are modeled using a continuous control function; while strategies that rely on cultivational practices (such as pruning and removal of mummified fruits) are modeled with a control function which is discrete in time (though not in space). For comparative purposes, we perform our analyses for a spatially-averaged model as well as the space-dependent diffusion model. Under weak smoothness conditions on parameters we demonstrate the well-posedness of both models by verifying existence and uniqueness of the solution for the growth inhibition rate for given initial conditions. We also show that the set [0, 1] is positively invariant. We first study control by impulsive strategies, then analyze the simultaneous use of mixed continuous and pulse strategies. In each case we specify a cost functional to be minimized, and we demonstrate the existence of optimal control strategies. In the case of pulse-only strategies, we provide explicit algorithms for finding the optimal control strategies for both the spatially-averaged model and the space-dependent model. We verify the algorithms for both models via simulation, and discuss properties of the optimal solutions. Copyright © 2015 Elsevier Inc. All rights reserved.
The primary advantage of Dynamically Dimensioned Search algorithm (DDS) is that it outperforms many other optimization techniques in both convergence speed and the ability in searching for parameter sets that satisfy statistical guidelines while requiring only one algorithm parameter (perturbation f...
Differential harmony search algorithm to optimize PWRs loading pattern
Energy Technology Data Exchange (ETDEWEB)
Poursalehi, N., E-mail: npsalehi@yahoo.com [Engineering Department, Shahid Beheshti University, G.C, P.O.Box: 1983963113, Tehran (Iran, Islamic Republic of); Zolfaghari, A.; Minuchehr, A. [Engineering Department, Shahid Beheshti University, G.C, P.O.Box: 1983963113, Tehran (Iran, Islamic Republic of)
2013-04-15
Highlights: ► Exploit of DHS algorithm in LP optimization reveals its flexibility, robustness and reliability. ► Upshot of our experiments with DHS shows that the search approach to optimal LP is quickly. ► On the average, the final band width of DHS fitness values is narrow relative to HS and GHS. -- Abstract: The objective of this work is to develop a core loading optimization technique using differential harmony search algorithm in the context of obtaining an optimal configuration of fuel assemblies in pressurized water reactors. To implement and evaluate the proposed technique, differential harmony search nodal expansion package for 2-D geometry, DHSNEP-2D, is developed. The package includes two modules; in the first modules differential harmony search (DHS) is implemented and nodal expansion code which solves two dimensional-multi group neutron diffusion equations using fourth degree flux expansion with one node per a fuel assembly is in the second module. For evaluation of DHS algorithm, classical harmony search (HS) and global-best harmony search (GHS) algorithms are also included in DHSNEP-2D in order to compare the outcome of techniques together. For this purpose, two PWR test cases have been investigated to demonstrate the DHS algorithm capability in obtaining near optimal loading pattern. Results show that the convergence rate of DHS and execution times are quite promising and also is reliable for the fuel management operation. Moreover, numerical results show the good performance of DHS relative to other competitive algorithms such as genetic algorithm (GA), classical harmony search (HS) and global-best harmony search (GHS) algorithms.
Differential harmony search algorithm to optimize PWRs loading pattern
International Nuclear Information System (INIS)
Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.
2013-01-01
Highlights: ► Exploit of DHS algorithm in LP optimization reveals its flexibility, robustness and reliability. ► Upshot of our experiments with DHS shows that the search approach to optimal LP is quickly. ► On the average, the final band width of DHS fitness values is narrow relative to HS and GHS. -- Abstract: The objective of this work is to develop a core loading optimization technique using differential harmony search algorithm in the context of obtaining an optimal configuration of fuel assemblies in pressurized water reactors. To implement and evaluate the proposed technique, differential harmony search nodal expansion package for 2-D geometry, DHSNEP-2D, is developed. The package includes two modules; in the first modules differential harmony search (DHS) is implemented and nodal expansion code which solves two dimensional-multi group neutron diffusion equations using fourth degree flux expansion with one node per a fuel assembly is in the second module. For evaluation of DHS algorithm, classical harmony search (HS) and global-best harmony search (GHS) algorithms are also included in DHSNEP-2D in order to compare the outcome of techniques together. For this purpose, two PWR test cases have been investigated to demonstrate the DHS algorithm capability in obtaining near optimal loading pattern. Results show that the convergence rate of DHS and execution times are quite promising and also is reliable for the fuel management operation. Moreover, numerical results show the good performance of DHS relative to other competitive algorithms such as genetic algorithm (GA), classical harmony search (HS) and global-best harmony search (GHS) algorithms
Optimizing the search for transiting planets in long time series
Ofir, Aviv
2014-01-01
Context. Transit surveys, both ground- and space-based, have already accumulated a large number of light curves that span several years. Aims: The search for transiting planets in these long time series is computationally intensive. We wish to optimize the search for both detection and computational efficiencies. Methods: We assume that the searched systems can be described well by Keplerian orbits. We then propagate the effects of different system parameters to the detection parameters. Results: 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. Conclusions: By considering Keplerian dynamics explicitly rather than implicitly one can optimally search the BLS 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. The MATLAB code is only available at the CDS via anonymous ftp to http://cdsarc.u-strasbg.fr (ftp://130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/561/A138
Optimal Pricing Strategy in Marketing Research Consulting.
Chang, Chun-Hao; Lee, Chi-Wen Jevons
1994-01-01
This paper studies the optimal pricing scheme for a monopolistic marketing research consultant who sells high-cost proprietary marketing information to her oligopolistic clients in the manufacturing industry. In designing an optimal pricing strategy, the consultant needs to fully consider the behavior of her clients, the behavior of the existing and potential competitors to her clients, and the behavior of her clients' customers. The authors show how the environment uncertainty, the capabilit...
Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario.
Sharit, Joseph; Taha, Jessica; Berkowsky, Ronald W; Profita, Halley; Czaja, Sara J
2015-01-01
Although access to Internet health information can be beneficial, solving complex health-related problems online is challenging for many individuals. In this study, we investigated the performance of a sample of 60 adults ages 18 to 85 years in using the Internet to resolve a relatively complex health information problem. The impact of age, Internet experience, and cognitive abilities on measures of search time, amount of search, and search accuracy was examined, and a model of Internet information seeking was developed to guide the characterization of participants' search strategies. Internet experience was found to have no impact on performance measures. Older participants exhibited longer search times and lower amounts of search but similar search accuracy performance as their younger counterparts. Overall, greater search accuracy was related to an increased amount of search but not to increased search duration and was primarily attributable to higher cognitive abilities, such as processing speed, reasoning ability, and executive function. There was a tendency for those who were younger, had greater Internet experience, and had higher cognitive abilities to use a bottom-up (i.e., analytic) search strategy, although use of a top-down (i.e., browsing) strategy was not necessarily unsuccessful. Implications of the findings for future studies and design interventions are discussed.
Optimal Deterministic Investment Strategies for Insurers
Directory of Open Access Journals (Sweden)
Ulrich Rieder
2013-11-01
Full Text Available We consider an insurance company whose risk reserve is given by a Brownian motion with drift and which is able to invest the money into a Black–Scholes financial market. As optimization criteria, we treat mean-variance problems, problems with other risk measures, exponential utility and the probability of ruin. Following recent research, we assume that investment strategies have to be deterministic. This leads to deterministic control problems, which are quite easy to solve. Moreover, it turns out that there are some interesting links between the optimal investment strategies of these problems. Finally, we also show that this approach works in the Lévy process framework.
Search algorithms as a framework for the optimization of drug combinations.
Directory of Open Access Journals (Sweden)
Diego Calzolari
2008-12-01
Full Text Available Combination therapies are often needed for effective clinical outcomes in the management of complex diseases, but presently they are generally based on empirical clinical experience. Here we suggest a novel application of search algorithms -- originally developed for digital communication -- modified to optimize combinations of therapeutic interventions. In biological experiments measuring the restoration of the decline with age in heart function and exercise capacity in Drosophila melanogaster, we found that search algorithms correctly identified optimal combinations of four drugs using only one-third of the tests performed in a fully factorial search. In experiments identifying combinations of three doses of up to six drugs for selective killing of human cancer cells, search algorithms resulted in a highly significant enrichment of selective combinations compared with random searches. In simulations using a network model of cell death, we found that the search algorithms identified the optimal combinations of 6-9 interventions in 80-90% of tests, compared with 15-30% for an equivalent random search. These findings suggest that modified search algorithms from information theory have the potential to enhance the discovery of novel therapeutic drug combinations. This report also helps to frame a biomedical problem that will benefit from an interdisciplinary effort and suggests a general strategy for its solution.
Optimization strategies for complex engineering applications
Energy Technology Data Exchange (ETDEWEB)
Eldred, M.S.
1998-02-01
LDRD research activities have focused on increasing the robustness and efficiency of optimization studies for computationally complex engineering problems. Engineering applications can be characterized by extreme computational expense, lack of gradient information, discrete parameters, non-converging simulations, and nonsmooth, multimodal, and discontinuous response variations. Guided by these challenges, the LDRD research activities have developed application-specific techniques, fundamental optimization algorithms, multilevel hybrid and sequential approximate optimization strategies, parallel processing approaches, and automatic differentiation and adjoint augmentation methods. This report surveys these activities and summarizes the key findings and recommendations.
Behavior and neural basis of near-optimal visual search
Ma, Wei Ji; Navalpakkam, Vidhya; Beck, Jeffrey M; van den Berg, Ronald; Pouget, Alexandre
2013-01-01
The ability to search efficiently for a target in a cluttered environment is one of the most remarkable functions of the nervous system. This task is difficult under natural circumstances, as the reliability of sensory information can vary greatly across space and time and is typically a priori unknown to the observer. In contrast, visual-search experiments commonly use stimuli of equal and known reliability. In a target detection task, we randomly assigned high or low reliability to each item on a trial-by-trial basis. An optimal observer would weight the observations by their trial-to-trial reliability and combine them using a specific nonlinear integration rule. We found that humans were near-optimal, regardless of whether distractors were homogeneous or heterogeneous and whether reliability was manipulated through contrast or shape. We present a neural-network implementation of near-optimal visual search based on probabilistic population coding. The network matched human performance. PMID:21552276
Search optimization of named entities from twitter streams
Fazeel, K. Mohammed; Hassan Mottur, Simama; Norman, Jasmine; Mangayarkarasi, R.
2017-11-01
With Enormous number of tweets, People often face difficulty to get exact information about those tweets. One of the approach followed for getting information about those tweets via Google. There is not any accuracy tool developed for search optimization and as well as getting information about those tweets. So, this system contains the search optimization and functionalities for getting information about those tweets. Another problem faced here are the tweets that contains grammatical errors, misspellings, non-standard abbreviations, and meaningless capitalization. So, these problems can be eliminated by the use of this tool. Lot of time can be saved and as well as by the use of efficient search optimization each information about those particular tweets can be obtained.
Decoherence in optimized quantum random-walk search algorithm
International Nuclear Information System (INIS)
Zhang Yu-Chao; Bao Wan-Su; Wang Xiang; Fu Xiang-Qun
2015-01-01
This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative. (paper)
A Fuzzy Gravitational Search Algorithm to Design Optimal IIR Filters
Directory of Open Access Journals (Sweden)
Danilo Pelusi
2018-03-01
Full Text Available The goodness of Infinite Impulse Response (IIR digital filters design depends on pass band ripple, stop band ripple and transition band values. The main problem is defining a suitable error fitness function that depends on these parameters. This fitness function can be optimized by search algorithms such as evolutionary algorithms. This paper proposes an intelligent algorithm for the design of optimal 8th order IIR filters. The main contribution is the design of Fuzzy Inference Systems able to tune key parameters of a revisited version of the Gravitational Search Algorithm (GSA. In this way, a Fuzzy Gravitational Search Algorithm (FGSA is designed. The optimization performances of FGSA are compared with those of Differential Evolution (DE and GSA. The results show that FGSA is the algorithm that gives the best compromise between goodness, robustness and convergence rate for the design of 8th order IIR filters. Moreover, FGSA assures a good stability of the designed filters.
[AWAKE CRANIOTOMY: IN SEARCH FOR OPTIMAL SEDATION].
Kulikova, A S; Sel'kov, D A; Kobyakov, G L; Shmigel'skiy, A V; Lubnin, A Yu
2015-01-01
Awake craniotomy is a "gold standard"for intraoperative brain language mapping. One of the main anesthetic challenge of awake craniotomy is providing of optimal sedation for initial stages of intervention. The goal of this study was comparison of different technics of anesthesia for awake craniotomy. Materials and methods: 162 operations were divided in 4 groups: 76 cases with propofol sedation (2-4mg/kg/h) without airway protection; 11 cases with propofol sedation (4-5 mg/kg/h) with MV via LMA; 36 cases of xenon anesthesia; and 39 cases with dexmedetomidine sedation without airway protection. Results and discussion: brain language mapping was successful in 90% of cases. There was no difference between groups in successfulness of brain mapping. However in the first group respiratory complications were more frequent. Three other technics were more safer Xenon anesthesia was associated with ultrafast awakening for mapping (5±1 min). Dexmedetomidine sedation provided high hemodynamic and respiratory stability during the procedure.
Topology optimization based on the harmony search method
International Nuclear Information System (INIS)
Lee, Seung-Min; Han, Seog-Young
2017-01-01
A new topology optimization scheme based on a Harmony search (HS) as a metaheuristic method was proposed and applied to static stiffness topology optimization problems. To apply the HS to topology optimization, the variables in HS were transformed to those in topology optimization. Compliance was used as an objective function, and harmony memory was defined as the set of the optimized topology. Also, a parametric study for Harmony memory considering rate (HMCR), Pitch adjusting rate (PAR), and Bandwidth (BW) was performed to find the appropriate range for topology optimization. Various techniques were employed such as a filtering scheme, simple average scheme and harmony rate. To provide a robust optimized topology, the concept of the harmony rate update rule was also implemented. Numerical examples are provided to verify the effectiveness of the HS by comparing the optimal layouts of the HS with those of Bidirectional evolutionary structural optimization (BESO) and Artificial bee colony algorithm (ABCA). The following conclu- sions could be made: (1) The proposed topology scheme is very effective for static stiffness topology optimization problems in terms of stability, robustness and convergence rate. (2) The suggested method provides a symmetric optimized topology despite the fact that the HS is a stochastic method like the ABCA. (3) The proposed scheme is applicable and practical in manufacturing since it produces a solid-void design of the optimized topology. (4) The suggested method appears to be very effective for large scale problems like topology optimization.
Topology optimization based on the harmony search method
Energy Technology Data Exchange (ETDEWEB)
Lee, Seung-Min; Han, Seog-Young [Hanyang University, Seoul (Korea, Republic of)
2017-06-15
A new topology optimization scheme based on a Harmony search (HS) as a metaheuristic method was proposed and applied to static stiffness topology optimization problems. To apply the HS to topology optimization, the variables in HS were transformed to those in topology optimization. Compliance was used as an objective function, and harmony memory was defined as the set of the optimized topology. Also, a parametric study for Harmony memory considering rate (HMCR), Pitch adjusting rate (PAR), and Bandwidth (BW) was performed to find the appropriate range for topology optimization. Various techniques were employed such as a filtering scheme, simple average scheme and harmony rate. To provide a robust optimized topology, the concept of the harmony rate update rule was also implemented. Numerical examples are provided to verify the effectiveness of the HS by comparing the optimal layouts of the HS with those of Bidirectional evolutionary structural optimization (BESO) and Artificial bee colony algorithm (ABCA). The following conclu- sions could be made: (1) The proposed topology scheme is very effective for static stiffness topology optimization problems in terms of stability, robustness and convergence rate. (2) The suggested method provides a symmetric optimized topology despite the fact that the HS is a stochastic method like the ABCA. (3) The proposed scheme is applicable and practical in manufacturing since it produces a solid-void design of the optimized topology. (4) The suggested method appears to be very effective for large scale problems like topology optimization.
Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach
Directory of Open Access Journals (Sweden)
Dongshuang Li
2018-05-01
Full Text Available The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.
Budget constraints and optimization in sponsored search auctions
Yang, Yanwu
2013-01-01
The Intelligent Systems Series publishes reference works and handbooks in three core sub-topic areas: Intelligent Automation, Intelligent Transportation Systems, and Intelligent Computing. They include theoretical studies, design methods, and real-world implementations and applications. The series' readership is broad, but focuses on engineering, electronics, and computer science. Budget constraints and optimization in sponsored search auctions takes into account consideration of the entire life cycle of campaigns for researchers and developers working on search systems and ROI maximization
Wolf Search Algorithm for Solving Optimal Reactive Power Dispatch Problem
Directory of Open Access Journals (Sweden)
Kanagasabai Lenin
2015-03-01
Full Text Available This paper presents a new bio-inspired heuristic optimization algorithm called the Wolf Search Algorithm (WSA for solving the multi-objective reactive power dispatch problem. Wolf Search algorithm is a new bio – inspired heuristic algorithm which based on wolf preying behaviour. The way wolves search for food and survive by avoiding their enemies has been imitated to formulate the algorithm for solving the reactive power dispatches. And the speciality of wolf is possessing both individual local searching ability and autonomous flocking movement and this special property has been utilized to formulate the search algorithm .The proposed (WSA algorithm has been tested on standard IEEE 30 bus test system and simulation results shows clearly about the good performance of the proposed algorithm .
Optimization by GRASP greedy randomized adaptive search procedures
Resende, Mauricio G C
2016-01-01
This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASP and combinatorial optimizat...
Complicated problem solution techniques in optimal parameter searching
International Nuclear Information System (INIS)
Gergel', V.P.; Grishagin, V.A.; Rogatneva, E.A.; Strongin, R.G.; Vysotskaya, I.N.; Kukhtin, V.V.
1992-01-01
An algorithm is presented of a global search for numerical solution of multidimentional multiextremal multicriteria optimization problems with complicated constraints. A boundedness of object characteristic changes is assumed at restricted changes of its parameters (Lipschitz condition). The algorithm was realized as a computer code. The algorithm was realized as a computer code. The programme was used to solve in practice the different applied optimization problems. 10 refs.; 3 figs
Designing Search UX Strategies for eCommerce Success
Nudelman, Greg
2011-01-01
Best practices, practical advice, and design ideas for successful ecommerce search A glaring gap has existed in the market for a resource that offers a comprehensive, actionable design patterns and design strategies for ecommerce search-but no longer. With this invaluable book, user experience designer and user researcher Greg Nudelman shares his years of experience working on popular ecommerce sites as he tackles even the most difficult ecommerce search design problems. Nudelman helps you create highly effective and intuitive ecommerce search design solutions and he takes a unique forward-thi
Dual-mode nested search method for categorical uncertain multi-objective optimization
Tang, Long; Wang, Hu
2016-10-01
Categorical multi-objective optimization is an important issue involved in many matching design problems. Non-numerical variables and their uncertainty are the major challenges of such optimizations. Therefore, this article proposes a dual-mode nested search (DMNS) method. In the outer layer, kriging metamodels are established using standard regular simplex mapping (SRSM) from categorical candidates to numerical values. Assisted by the metamodels, a k-cluster-based intelligent sampling strategy is developed to search Pareto frontier points. The inner layer uses an interval number method to model the uncertainty of categorical candidates. To improve the efficiency, a multi-feature convergent optimization via most-promising-area stochastic search (MFCOMPASS) is proposed to determine the bounds of objectives. Finally, typical numerical examples are employed to demonstrate the effectiveness of the proposed DMNS method.
Search for Directed Networks by Different Random Walk Strategies
Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long
2012-03-01
A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.
PR Students' Perceptions and Readiness for Using Search Engine Optimization
Moody, Mia; Bates, Elizabeth
2013-01-01
Enough evidence is available to support the idea that public relations professionals must possess search engine optimization (SEO) skills to assist clients in a full-service capacity; however, little research exists on how much college students know about the tactic and best practices for incorporating SEO into course curriculum. Furthermore, much…
Parallel strategy for optimal learning in perceptrons
International Nuclear Information System (INIS)
Neirotti, J P
2010-01-01
We developed a parallel strategy for learning optimally specific realizable rules by perceptrons, in an online learning scenario. Our result is a generalization of the Caticha-Kinouchi (CK) algorithm developed for learning a perceptron with a synaptic vector drawn from a uniform distribution over the N-dimensional sphere, so called the typical case. Our method outperforms the CK algorithm in almost all possible situations, failing only in a denumerable set of cases. The algorithm is optimal in the sense that it saturates Bayesian bounds when it succeeds.
ARSTEC, Nonlinear Optimization Program Using Random Search Method
International Nuclear Information System (INIS)
Rasmuson, D. M.; Marshall, N. H.
1979-01-01
1 - Description of problem or function: The ARSTEC program was written to solve nonlinear, mixed integer, optimization problems. An example of such a problem in the nuclear industry is the allocation of redundant parts in the design of a nuclear power plant to minimize plant unavailability. 2 - Method of solution: The technique used in ARSTEC is the adaptive random search method. The search is started from an arbitrary point in the search region and every time a point that improves the objective function is found, the search region is centered at that new point. 3 - Restrictions on the complexity of the problem: Presently, the maximum number of independent variables allowed is 10. This can be changed by increasing the dimension of the arrays
Theory of Randomized Search Heuristics in Combinatorial Optimization
DEFF Research Database (Denmark)
The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS), the Metr......The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS...... analysis of randomized algorithms to RSHs. Mostly, the expected runtime of RSHs on selected problems is analzyed. Thereby, we understand why and when RSHs are efficient optimizers and, conversely, when they cannot be efficient. The tutorial will give an overview on the analysis of RSHs for solving...
The impact of PICO as a search strategy tool on literature search quality
DEFF Research Database (Denmark)
Eriksen, Mette Brandt; Frandsen, Tove Faber
2018-01-01
Objective: This review aimed to determine, if the use of the PICO model (Patient Intervention Comparison Outcome) as a search strategy tool affects the quality of the literature search. Methods: A comprehensive literature search was conducted in: PubMed, Embase, CINAHL, PsycInfo, Cochrane Library...... and three studies were included, data was extracted, risk of bias was assessed and a qualitative analysis was conducted. The included studies compared PICO to PIC or link to related articles in PubMed; PICOS and SPIDER. One study compared PICO to unguided searching. Due to differences in intervention...
STRATEGIES IN SEARCH FOR INTERNATIONAL PARTNERSHIPS
Directory of Open Access Journals (Sweden)
Denise de Freitas
Full Text Available Introduction: Internationalization is the process which integrates universal, intercultural or global dimension in a program, in this case, postgraduate. It can be understood as the process of increasing participation in international operations. Method: To offer design and motivational logistics on how to run a process of international scientific relationship. Results: It is necessary to develop several different aspects to be reached internationalization: to know the fundamentals of internationalization; to have international vision; to promote strategy for internationalization; to know the characteristics of an institutional center of internationalization; and to understand the institutional advantages of internationalization. Conclusion: Internationalization is essential to aerate the Brazilian postgraduate and not mischaracterize or weakens the process. On the contrary, it contributes to increase its vitality and capacity for innovation. Today is not possible to imagine science without internationalization.
The Optimal Nash Equilibrium Strategies Under Competition
Institute of Scientific and Technical Information of China (English)
孟力; 王崇喜; 汪定伟; 张爱玲
2004-01-01
This paper presented a game theoretic model to study the competition for a single investment oppertunity under uncertainty. It models the hazard rate of investment as a function of competitors' trigger level. Under uncertainty and different information structure, the option and game theory was applied to researching the optimal Nash equilibrium strategies of one or more firm. By means of Matlab software, the paper simulates a real estate developing project example and illustrates how parameter affects investment strategies. The paper's work will contribute to the present investment practice in China.
Particle Swarm Optimization With Interswarm Interactive Learning Strategy.
Qin, Quande; Cheng, Shi; Zhang, Qingyu; Li, Li; Shi, Yuhui
2016-10-01
The learning strategy in the canonical particle swarm optimization (PSO) algorithm is often blamed for being the primary reason for loss of diversity. Population diversity maintenance is crucial for preventing particles from being stuck into local optima. In this paper, we present an improved PSO algorithm with an interswarm interactive learning strategy (IILPSO) by overcoming the drawbacks of the canonical PSO algorithm's learning strategy. IILPSO is inspired by the phenomenon in human society that the interactive learning behavior takes place among different groups. Particles in IILPSO are divided into two swarms. The interswarm interactive learning (IIL) behavior is triggered when the best particle's fitness value of both the swarms does not improve for a certain number of iterations. According to the best particle's fitness value of each swarm, the softmax method and roulette method are used to determine the roles of the two swarms as the learning swarm and the learned swarm. In addition, the velocity mutation operator and global best vibration strategy are used to improve the algorithm's global search capability. The IIL strategy is applied to PSO with global star and local ring structures, which are termed as IILPSO-G and IILPSO-L algorithm, respectively. Numerical experiments are conducted to compare the proposed algorithms with eight popular PSO variants. From the experimental results, IILPSO demonstrates the good performance in terms of solution accuracy, convergence speed, and reliability. Finally, the variations of the population diversity in the entire search process provide an explanation why IILPSO performs effectively.
Optimized Strategies for Detecting Extrasolar Space Weather
Hallinan, Gregg
2018-06-01
Fully understanding the implications of space weather for the young solar system, as well as the wider population of planet-hosting stars, requires remote sensing of space weather in other stellar systems. Solar coronal mass ejections can be accompanied by bright radio bursts at low frequencies (typically measurement of the magnetic field strength of the planet, informing on whether the atmosphere of the planet can survive the intense magnetic activity of its host star. However, both stellar and planetary radio emission are highly variable and optimal strategies for detection of these emissions requires the capability to monitor 1000s of nearby stellar/planetary systems simultaneously. I will discuss optimized strategies for both ground and space-based experiments to take advantage of the highly variable nature of the radio emissions powered by extrasolar space weather to enable detection of stellar CMEs and planetary magnetospheres.
Optimization of pocket machining strategy in HSM
Msaddek, El Bechir; Bouaziz, Zoubeir; Dessein, Gilles; Baili, Maher
2012-01-01
International audience; Our two major concerns, which should be taken into consideration as soon as we start the selecting the machining parameters, are the minimization of the machining time and the maintaining of the high-speed machining machine in good state. The manufacturing strategy is one of the parameters which practically influences the time of the different geometrical forms manufacturing, as well as the machine itself. In this article, we propose an optimization methodology of the ...
Optimal strategies for pricing general insurance
Emms, P.; Haberman, S.; Savoulli, I.
2006-01-01
Optimal premium pricing policies in a competitive insurance environment are investigated using approximation methods and simulation of sample paths. The market average premium is modelled as a diffusion process, with the premium as the control function and the maximization of the expected total utility of wealth, over a finite time horizon, as the objective. In order to simplify the optimisation problem, a linear utility function is considered and two particular premium strategies are adopted...
Search strategies in practice: Influence of information and task constraints.
Pacheco, Matheus M; Newell, Karl M
2018-01-01
The practice of a motor task has been conceptualized as a process of search through a perceptual-motor workspace. The present study investigated the influence of information and task constraints on the search strategy as reflected in the sequential relations of the outcome in a discrete movement virtual projectile task. The results showed that the relation between the changes of trial-to-trial movement outcome to performance level was dependent on the landscape of the task dynamics and the influence of inherent variability. Furthermore, the search was in a constrained parameter region of the perceptual-motor workspace that depended on the task constraints. These findings show that there is not a single function of trial-to-trial change over practice but rather that local search strategies (proportional, discontinuous, constant) adapt to the level of performance and the confluence of constraints to action. Copyright © 2017 Elsevier B.V. All rights reserved.
Optimal Quantum Spatial Search on Random Temporal Networks.
Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser
2017-12-01
To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G(n,p), where p is the probability that any two given nodes are connected: After every time interval τ, a new graph G(n,p) replaces the previous one. We prove analytically that, for any given p, there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O(sqrt[n]), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.
Optimal Quantum Spatial Search on Random Temporal Networks
Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser
2017-12-01
To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.
A Cooperative Harmony Search Algorithm for Function Optimization
Directory of Open Access Journals (Sweden)
Gang Li
2014-01-01
Full Text Available Harmony search algorithm (HS is a new metaheuristic algorithm which is inspired by a process involving musical improvisation. HS is a stochastic optimization technique that is similar to genetic algorithms (GAs and particle swarm optimizers (PSOs. It has been widely applied in order to solve many complex optimization problems, including continuous and discrete problems, such as structure design, and function optimization. A cooperative harmony search algorithm (CHS is developed in this paper, with cooperative behavior being employed as a significant improvement to the performance of the original algorithm. Standard HS just uses one harmony memory and all the variables of the object function are improvised within the harmony memory, while the proposed algorithm CHS uses multiple harmony memories, so that each harmony memory can optimize different components of the solution vector. The CHS was then applied to function optimization problems. The results of the experiment show that CHS is capable of finding better solutions when compared to HS and a number of other algorithms, especially in high-dimensional problems.
Computational assessment of visual search strategies in volumetric medical images.
Wen, Gezheng; Aizenman, Avigael; Drew, Trafton; Wolfe, Jeremy M; Haygood, Tamara Miner; Markey, Mia K
2016-01-01
When searching through volumetric images [e.g., computed tomography (CT)], radiologists appear to use two different search strategies: "drilling" (restrict eye movements to a small region of the image while quickly scrolling through slices), or "scanning" (search over large areas at a given depth before moving on to the next slice). To computationally identify the type of image information that is used in these two strategies, 23 naïve observers were instructed with either "drilling" or "scanning" when searching for target T's in 20 volumes of faux lung CTs. We computed saliency maps using both classical two-dimensional (2-D) saliency, and a three-dimensional (3-D) dynamic saliency that captures the characteristics of scrolling through slices. Comparing observers' gaze distributions with the saliency maps showed that search strategy alters the type of saliency that attracts fixations. Drillers' fixations aligned better with dynamic saliency and scanners with 2-D saliency. The computed saliency was greater for detected targets than for missed targets. Similar results were observed in data from 19 radiologists who searched five stacks of clinical chest CTs for lung nodules. Dynamic saliency may be superior to the 2-D saliency for detecting targets embedded in volumetric images, and thus "drilling" may be more efficient than "scanning."
Directory of Open Access Journals (Sweden)
Veena Anand
2017-01-01
Full Text Available Wireless Sensor Networks (WSN has the disadvantage of limited and non-rechargeable energy resource in WSN creates a challenge and led to development of various clustering and routing algorithms. The paper proposes an approach for improving network lifetime by using Particle swarm optimization based clustering and Harmony Search based routing in WSN. So in this paper, global optimal cluster head are selected and Gateway nodes are introduced to decrease the energy consumption of the CH while sending aggregated data to the Base station (BS. Next, the harmony search algorithm based Local Search strategy finds best routing path for gateway nodes to the Base Station. Finally, the proposed algorithm is presented.
Parallel Harmony Search Based Distributed Energy Resource Optimization
Energy Technology Data Exchange (ETDEWEB)
Ceylan, Oguzhan [ORNL; Liu, Guodong [ORNL; Tomsovic, Kevin [University of Tennessee, Knoxville (UTK)
2015-01-01
This paper presents a harmony search based parallel optimization algorithm to minimize voltage deviations in three phase unbalanced electrical distribution systems and to maximize active power outputs of distributed energy resources (DR). The main contribution is to reduce the adverse impacts on voltage profile during a day as photovoltaics (PVs) output or electrical vehicles (EVs) charging changes throughout a day. The IEEE 123- bus distribution test system is modified by adding DRs and EVs under different load profiles. The simulation results show that by using parallel computing techniques, heuristic methods may be used as an alternative optimization tool in electrical power distribution systems operation.
An Elite Decision Making Harmony Search Algorithm for Optimization Problem
Directory of Open Access Journals (Sweden)
Lipu Zhang
2012-01-01
Full Text Available This paper describes a new variant of harmony search algorithm which is inspired by a well-known item “elite decision making.” In the new algorithm, the good information captured in the current global best and the second best solutions can be well utilized to generate new solutions, following some probability rule. The generated new solution vector replaces the worst solution in the solution set, only if its fitness is better than that of the worst solution. The generating and updating steps and repeated until the near-optimal solution vector is obtained. Extensive computational comparisons are carried out by employing various standard benchmark optimization problems, including continuous design variables and integer variables minimization problems from the literature. The computational results show that the proposed new algorithm is competitive in finding solutions with the state-of-the-art harmony search variants.
Multilevel Thresholding Segmentation Based on Harmony Search Optimization
Directory of Open Access Journals (Sweden)
Diego Oliva
2013-01-01
Full Text Available In this paper, a multilevel thresholding (MT algorithm based on the harmony search algorithm (HSA is introduced. HSA is an evolutionary method which is inspired in musicians improvising new harmonies while playing. Different to other evolutionary algorithms, HSA exhibits interesting search capabilities still keeping a low computational overhead. The proposed algorithm encodes random samples from a feasible search space inside the image histogram as candidate solutions, whereas their quality is evaluated considering the objective functions that are employed by the Otsu’s or Kapur’s methods. Guided by these objective values, the set of candidate solutions are evolved through the HSA operators until an optimal solution is found. Experimental results demonstrate the high performance of the proposed method for the segmentation of digital images.
Stochastic optimal foraging: tuning intensive and extensive dynamics in random searches.
Directory of Open Access Journals (Sweden)
Frederic Bartumeus
Full Text Available Recent theoretical developments had laid down the proper mathematical means to understand how the structural complexity of search patterns may improve foraging efficiency. Under information-deprived scenarios and specific landscape configurations, Lévy walks and flights are known to lead to high search efficiencies. Based on a one-dimensional comparative analysis we show a mechanism by which, at random, a searcher can optimize the encounter with close and distant targets. The mechanism consists of combining an optimal diffusivity (optimally enhanced diffusion with a minimal diffusion constant. In such a way the search dynamics adequately balances the tension between finding close and distant targets, while, at the same time, shifts the optimal balance towards relatively larger close-to-distant target encounter ratios. We find that introducing a multiscale set of reorientations ensures both a thorough local space exploration without oversampling and a fast spreading dynamics at the large scale. Lévy reorientation patterns account for these properties but other reorientation strategies providing similar statistical signatures can mimic or achieve comparable efficiencies. Hence, the present work unveils general mechanisms underlying efficient random search, beyond the Lévy model. Our results suggest that animals could tune key statistical movement properties (e.g. enhanced diffusivity, minimal diffusion constant to cope with the very general problem of balancing out intensive and extensive random searching. We believe that theoretical developments to mechanistically understand stochastic search strategies, such as the one here proposed, are crucial to develop an empirically verifiable and comprehensive animal foraging theory.
Tabu search, a versatile technique for the functions optimization
International Nuclear Information System (INIS)
Castillo M, J.A.
2003-01-01
The basic elements of the Tabu search technique are presented, putting emphasis in the qualities that it has in comparison with the traditional methods of optimization known as in descending pass. Later on some modifications are sketched that have been implemented in the technique along the time, so that this it is but robust. Finally they are given to know some areas where this technique has been applied, obtaining successful results. (Author)
Optimal income taxation with endogenous participation and search unemployment
Lehmann, Etienne; Parmentier, Alexis; van der Linden, Bruno
2011-01-01
This paper characterizes the optimal redistributive taxation when individuals are hetero- geneous in two exogenous dimensions: their skills and their values of non-market activities. Search-matching frictions on the labor markets create unemployment. Wages, labor demand and participation are endogenous. The government only observes wage levels. Under a Max- imin objective, if the elasticity of participation decreases along the distribution of skills, at the optimum, the average tax rate is in...
Optimal IIR filter design using Gravitational Search Algorithm with Wavelet Mutation
Directory of Open Access Journals (Sweden)
S.K. Saha
2015-01-01
Full Text Available This paper presents a global heuristic search optimization technique, which is a hybridized version of the Gravitational Search Algorithm (GSA and Wavelet Mutation (WM strategy. Thus, the Gravitational Search Algorithm with Wavelet Mutation (GSAWM was adopted for the design of an 8th-order infinite impulse response (IIR filter. GSA is based on the interaction of masses situated in a small isolated world guided by the approximation of Newtonian’s laws of gravity and motion. Each mass is represented by four parameters, namely, position, active, passive and inertia mass. The position of the heaviest mass gives the near optimal solution. For better exploitation in multidimensional search spaces, the WM strategy is applied to randomly selected particles that enhance the capability of GSA for finding better near optimal solutions. An extensive simulation study of low-pass (LP, high-pass (HP, band-pass (BP and band-stop (BS IIR filters unleashes the potential of GSAWM in achieving better cut-off frequency sharpness, smaller pass band and stop band ripples, smaller transition width and higher stop band attenuation with assured stability.
Combining of Direct Search and Signal-to-Noise Ratio for economic dispatch optimization
International Nuclear Information System (INIS)
Lin, Whei-Min; Gow, Hong-Jey; Tsai, Ming-Tang
2011-01-01
This paper integrated the ideas of Direct Search and Signal-to-Noise Ratio (SNR) to develop a Novel Direct Search (NDS) method for solving the non-convex economic dispatch problems. NDS consists of three stages: Direct Search (DS), Global SNR (GSNR) and Marginal Compensation (MC) stages. DS provides a basic solution. GSNR searches the point with optimization strategy. MC fulfills the power balance requirement. With NDS, the infinite solution space becomes finite. Furthermore, a same optimum solution can be repeatedly reached. Effectiveness of NDS is demonstrated with three examples and the solutions were compared with previously published results. Test results show that the proposed method is simple, robust, and more effective than many other previously developed algorithms.
Salehi, Mojtaba; Bahreininejad, Ardeshir
2011-08-01
Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In the present work, the process planning is divided into preliminary planning, and secondary/detailed planning. In the preliminary stage, based on the analysis of order and clustering constraints as a compulsive constraint aggregation in operation sequencing and using an intelligent searching strategy, the feasible sequences are generated. Then, in the detailed planning stage, using the genetic algorithm which prunes the initial feasible sequences, the optimized operation sequence and the optimized selection of the machine, cutting tool and TAD for each operation based on optimization constraints as an additive constraint aggregation are obtained. The main contribution of this work is the optimization of sequence of the operations of the part, and optimization of machine selection, cutting tool and TAD for each operation using the intelligent search and genetic algorithm simultaneously.
Optimization Under Uncertainty for Wake Steering Strategies
Energy Technology Data Exchange (ETDEWEB)
Quick, Julian [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Annoni, Jennifer [National Renewable Energy Laboratory (NREL), Golden, CO (United States); King, Ryan N [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Dykes, Katherine L [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Fleming, Paul A [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Ning, Andrew [Brigham Young University
2017-08-03
Offsetting turbines' yaw orientations from incoming wind is a powerful tool that may be leveraged to reduce undesirable wake effects on downstream turbines. First, we examine a simple two-turbine case to gain intuition as to how inflow direction uncertainty affects the optimal solution. The turbines are modeled with unidirectional inflow such that one turbine directly wakes the other, using ten rotor diameter spacing. We perform optimization under uncertainty (OUU) via a parameter sweep of the front turbine. The OUU solution generally prefers less steering. We then do this optimization for a 60-turbine wind farm with unidirectional inflow, varying the degree of inflow uncertainty and approaching this OUU problem by nesting a polynomial chaos expansion uncertainty quantification routine within an outer optimization. We examined how different levels of uncertainty in the inflow direction effect the ratio of the expected values of deterministic and OUU solutions for steering strategies in the large wind farm, assuming the directional uncertainty used to reach said OUU solution (this ratio is defined as the value of the stochastic solution or VSS).
A search strategy for occupational health intervention studies
Verbeek, J.; Salmi, J.; Pasternack, I.; Jauhiainen, M.; Laamanen, I.; Schaafsma, F.; Hulshof, C.; van Dijk, F.
2005-01-01
As a result of low numbers and diversity in study type, occupational health intervention studies are not easy to locate in electronic literature databases. To develop a search strategy that facilitates finding occupational health intervention studies in Medline, both for researchers and
The Development of Visual Search Strategies in Biscriptal Readers.
Liow, Susan Rikard; Green, David; Tam, Melissa
1999-01-01
To test whether cognitive processing in bilingual depends on script combinations and language proficiency, this study investigated the development of alphabetic and logographic visual search strategies in two kinds of biscriptals: (1) Malay-English and (2) Chinese-English readers. Results support the view that there are script implications of…
Gravitation search algorithm: Application to the optimal IIR filter design
Directory of Open Access Journals (Sweden)
Suman Kumar Saha
2014-01-01
Full Text Available This paper presents a global heuristic search optimization technique known as Gravitation Search Algorithm (GSA for the design of 8th order Infinite Impulse Response (IIR, low pass (LP, high pass (HP, band pass (BP and band stop (BS filters considering various non-linear characteristics of the filter design problems. This paper also adopts a novel fitness function in order to improve the stop band attenuation to a great extent. In GSA, law of gravity and mass interactions among different particles are adopted for handling the non-linear IIR filter design optimization problem. In this optimization technique, searcher agents are the collection of masses and interactions among them are governed by the Newtonian gravity and the laws of motion. The performances of the GSA based IIR filter designs have proven to be superior as compared to those obtained by real coded genetic algorithm (RGA and standard Particle Swarm Optimization (PSO. Extensive simulation results affirm that the proposed approach using GSA outperforms over its counterparts not only in terms of quality output, i.e., sharpness at cut-off, smaller pass band ripple, higher stop band attenuation, but also the fastest convergence speed with assured stability.
PubMed searches: overview and strategies for clinicians.
Lindsey, Wesley T; Olin, Bernie R
2013-04-01
PubMed is a biomedical and life sciences database maintained by a division of the National Library of Medicine known as the National Center for Biotechnology Information (NCBI). It is a large resource with more than 5600 journals indexed and greater than 22 million total citations. Searches conducted in PubMed provide references that are more specific for the intended topic compared with other popular search engines. Effective PubMed searches allow the clinician to remain current on the latest clinical trials, systematic reviews, and practice guidelines. PubMed continues to evolve by allowing users to create a customized experience through the My NCBI portal, new arrangements and options in search filters, and supporting scholarly projects through exportation of citations to reference managing software. Prepackaged search options available in the Clinical Queries feature also allow users to efficiently search for clinical literature. PubMed also provides information regarding the source journals themselves through the Journals in NCBI Databases link. This article provides an overview of the PubMed database's structure and features as well as strategies for conducting an effective search.
A Hybrid Harmony Search Algorithm Approach for Optimal Power Flow
Directory of Open Access Journals (Sweden)
Mimoun YOUNES
2012-08-01
Full Text Available Optimal Power Flow (OPF is one of the main functions of Power system operation. It determines the optimal settings of generating units, bus voltage, transformer tap and shunt elements in Power System with the objective of minimizing total production costs or losses while the system is operating within its security limits. The aim of this paper is to propose a novel methodology (BCGAs-HSA that solves OPF including both active and reactive power dispatch It is based on combining the binary-coded genetic algorithm (BCGAs and the harmony search algorithm (HSA to determine the optimal global solution. This method was tested on the modified IEEE 30 bus test system. The results obtained by this method are compared with those obtained with BCGAs or HSA separately. The results show that the BCGAs-HSA approach can converge to the optimum solution with accuracy compared to those reported recently in the literature.
Forecasting solar radiation using an optimized hybrid model by Cuckoo Search algorithm
International Nuclear Information System (INIS)
Wang, Jianzhou; Jiang, He; Wu, Yujie; Dong, Yao
2015-01-01
Due to energy crisis and environmental problems, it is very urgent to find alternative energy sources nowadays. Solar energy, as one of the great potential clean energies, has widely attracted the attention of researchers. In this paper, an optimized hybrid method by CS (Cuckoo Search) on the basis of the OP-ELM (Optimally Pruned Extreme Learning Machine), called CS-OP-ELM, is developed to forecast clear sky and real sky global horizontal radiation. First, MRSR (Multiresponse Sparse Regression) and LOO-CV (leave-one-out cross-validation) can be applied to rank neurons and prune the possibly meaningless neurons of the FFNN (Feed Forward Neural Network), respectively. Then, Direct strategy and Direct-Recursive strategy based on OP-ELM are introduced to build a hybrid model. Furthermore, CS (Cuckoo Search) optimized algorithm is employed to determine the proper weight coefficients. In order to verify the effectiveness of the developed method, hourly solar radiation data from six sites of the United States has been collected, and methods like ARMA (Autoregression moving average), BP (Back Propagation) neural network and OP-ELM can be compared with CS-OP-ELM. Experimental results show the optimized hybrid method CS-OP-ELM has the best forecasting performance. - Highlights: • An optimized hybrid method called CS-OP-ELM is proposed to forecast solar radiation. • CS-OP-ELM adopts multiple variables dataset as input variables. • Direct and Direct-Recursive strategy are introduced to build a hybrid model. • CS (Cuckoo Search) algorithm is used to determine the optimal weight coefficients. • The proposed method has the best performance compared with other methods
Naghibi, Tofigh; Hoffmann, Sarah; Pfister, Beat
2015-08-01
Feature subset selection, as a special case of the general subset selection problem, has been the topic of a considerable number of studies due to the growing importance of data-mining applications. In the feature subset selection problem there are two main issues that need to be addressed: (i) Finding an appropriate measure function than can be fairly fast and robustly computed for high-dimensional data. (ii) A search strategy to optimize the measure over the subset space in a reasonable amount of time. In this article mutual information between features and class labels is considered to be the measure function. Two series expansions for mutual information are proposed, and it is shown that most heuristic criteria suggested in the literature are truncated approximations of these expansions. It is well-known that searching the whole subset space is an NP-hard problem. Here, instead of the conventional sequential search algorithms, we suggest a parallel search strategy based on semidefinite programming (SDP) that can search through the subset space in polynomial time. By exploiting the similarities between the proposed algorithm and an instance of the maximum-cut problem in graph theory, the approximation ratio of this algorithm is derived and is compared with the approximation ratio of the backward elimination method. The experiments show that it can be misleading to judge the quality of a measure solely based on the classification accuracy, without taking the effect of the non-optimum search strategy into account.
Combined optimization model for sustainable energization strategy
Abtew, Mohammed Seid
Access to energy is a foundation to establish a positive impact on multiple aspects of human development. Both developed and developing countries have a common concern of achieving a sustainable energy supply to fuel economic growth and improve the quality of life with minimal environmental impacts. The Least Developing Countries (LDCs), however, have different economic, social, and energy systems. Prevalence of power outage, lack of access to electricity, structural dissimilarity between rural and urban regions, and traditional fuel dominance for cooking and the resultant health and environmental hazards are some of the distinguishing characteristics of these nations. Most energy planning models have been designed for developed countries' socio-economic demographics and have missed the opportunity to address special features of the poor countries. An improved mixed-integer programming energy-source optimization model is developed to address limitations associated with using current energy optimization models for LDCs, tackle development of the sustainable energization strategies, and ensure diversification and risk management provisions in the selected energy mix. The Model predicted a shift from traditional fuels reliant and weather vulnerable energy source mix to a least cost and reliable modern clean energy sources portfolio, a climb on the energy ladder, and scored multifaceted economic, social, and environmental benefits. At the same time, it represented a transition strategy that evolves to increasingly cleaner energy technologies with growth as opposed to an expensive solution that leapfrogs immediately to the cleanest possible, overreaching technologies.
Local Optimization Strategies in Urban Vehicular Mobility.
Directory of Open Access Journals (Sweden)
Pierpaolo Mastroianni
Full Text Available The comprehension of vehicular traffic in urban environments is crucial to achieve a good management of the complex processes arising from people collective motion. Even allowing for the great complexity of human beings, human behavior turns out to be subject to strong constraints--physical, environmental, social, economic--that induce the emergence of common patterns. The observation and understanding of those patterns is key to setup effective strategies to optimize the quality of life in cities while not frustrating the natural need for mobility. In this paper we focus on vehicular mobility with the aim to reveal the underlying patterns and uncover the human strategies determining them. To this end we analyze a large dataset of GPS vehicles tracks collected in the Rome (Italy district during a month. We demonstrate the existence of a local optimization of travel times that vehicle drivers perform while choosing their journey. This finding is mirrored by two additional important facts, i.e., the observation that the average vehicle velocity increases by increasing the travel length and the emergence of a universal scaling law for the distribution of travel times at fixed traveled length. A simple modeling scheme confirms this scenario opening the way to further predictions.
An Elitist Multiobjective Tabu Search for Optimal Design of Groundwater Remediation Systems.
Yang, Yun; Wu, Jianfeng; Wang, Jinguo; Zhou, Zhifang
2017-11-01
This study presents a new multiobjective evolutionary algorithm (MOEA), the elitist multiobjective tabu search (EMOTS), and incorporates it with MODFLOW/MT3DMS to develop a groundwater simulation-optimization (SO) framework based on modular design for optimal design of groundwater remediation systems using pump-and-treat (PAT) technique. The most notable improvement of EMOTS over the original multiple objective tabu search (MOTS) lies in the elitist strategy, selection strategy, and neighborhood move rule. The elitist strategy is to maintain all nondominated solutions within later search process for better converging to the true Pareto front. The elitism-based selection operator is modified to choose two most remote solutions from current candidate list as seed solutions to increase the diversity of searching space. Moreover, neighborhood solutions are uniformly generated using the Latin hypercube sampling (LHS) in the bounded neighborhood space around each seed solution. To demonstrate the performance of the EMOTS, we consider a synthetic groundwater remediation example. Problem formulations consist of two objective functions with continuous decision variables of pumping rates while meeting water quality requirements. Especially, sensitivity analysis is evaluated through the synthetic case for determination of optimal combination of the heuristic parameters. Furthermore, the EMOTS is successfully applied to evaluate remediation options at the field site of the Massachusetts Military Reservation (MMR) in Cape Cod, Massachusetts. With both the hypothetical and the large-scale field remediation sites, the EMOTS-based SO framework is demonstrated to outperform the original MOTS in achieving the performance metrics of optimality and diversity of nondominated frontiers with desirable stability and robustness. © 2017, National Ground Water Association.
Searching for evidence: Knowledge and search strategies used by forensic scientists
Schraagen, J.M.C.; Leijenhorst, H.
2001-01-01
The Forensic Science Laboratory of The Netherlands is suffering from a growing backlog due to an increasing number of cases, which results in long delivery times of research reports within a number of departments. The project, "Strategies for Searching Trace Evidence," was started by the Forensic
National Research Council Canada - National Science Library
Yunker, James
2003-01-01
In this report, a relatively new simulation optimization technique, the genetic search, is compared to two more established simulation techniques-the pattern search and the response surface methodology search...
Search strategies on the Internet: general and specific.
Bottrill, Krys
2004-06-01
Some of the most up-to-date information on scientific activity is to be found on the Internet; for example, on the websites of academic and other research institutions and in databases of currently funded research studies provided on the websites of funding bodies. Such information can be valuable in suggesting new approaches and techniques that could be applicable in a Three Rs context. However, the Internet is a chaotic medium, not subject to the meticulous classification and organisation of classical information resources. At the same time, Internet search engines do not match the sophistication of search systems used by database hosts. Also, although some offer relatively advanced features, user awareness of these tends to be low. Furthermore, much of the information on the Internet is not accessible to conventional search engines, giving rise to the concept of the "Invisible Web". General strategies and techniques for Internet searching are presented, together with a comparative survey of selected search engines. The question of how the Invisible Web can be accessed is discussed, as well as how to keep up-to-date with Internet content and improve searching skills.
Optimal allocation of trend following strategies
Grebenkov, Denis S.; Serror, Jeremy
2015-09-01
We consider a portfolio allocation problem for trend following (TF) strategies on multiple correlated assets. Under simplifying assumptions of a Gaussian market and linear TF strategies, we derive analytical formulas for the mean and variance of the portfolio return. We construct then the optimal portfolio that maximizes risk-adjusted return by accounting for inter-asset correlations. The dynamic allocation problem for n assets is shown to be equivalent to the classical static allocation problem for n2 virtual assets that include lead-lag corrections in positions of TF strategies. The respective roles of asset auto-correlations and inter-asset correlations are investigated in depth for the two-asset case and a sector model. In contrast to the principle of diversification suggesting to treat uncorrelated assets, we show that inter-asset correlations allow one to estimate apparent trends more reliably and to adjust the TF positions more efficiently. If properly accounted for, inter-asset correlations are not deteriorative but beneficial for portfolio management that can open new profit opportunities for trend followers. These concepts are illustrated using daily returns of three highly correlated futures markets: the E-mini S&P 500, Euro Stoxx 50 index, and the US 10-year T-note futures.
Sampling optimization for printer characterization by direct search.
Bianco, Simone; Schettini, Raimondo
2012-12-01
Printer characterization usually requires many printer inputs and corresponding color measurements of the printed outputs. In this brief, a sampling optimization for printer characterization on the basis of direct search is proposed to maintain high color accuracy with a reduction in the number of characterization samples required. The proposed method is able to match a given level of color accuracy requiring, on average, a characterization set cardinality which is almost one-fourth of that required by the uniform sampling, while the best method in the state of the art needs almost one-third. The number of characterization samples required can be further reduced if the proposed algorithm is coupled with a sequential optimization method that refines the sample values in the device-independent color space. The proposed sampling optimization method is extended to deal with multiple substrates simultaneously, giving statistically better colorimetric accuracy (at the α = 0.05 significance level) than sampling optimization techniques in the state of the art optimized for each individual substrate, thus allowing use of a single set of characterization samples for multiple substrates.
International Nuclear Information System (INIS)
Shlesinger, Michael F
2009-01-01
There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.
Signatures of active and passive optimized Lévy searching in jellyfish.
Reynolds, Andy M
2014-10-06
Some of the strongest empirical support for Lévy search theory has come from telemetry data for the dive patterns of marine predators (sharks, bony fishes, sea turtles and penguins). The dive patterns of the unusually large jellyfish Rhizostoma octopus do, however, sit outside of current Lévy search theory which predicts that a single search strategy is optimal. When searching the water column, the movement patterns of these jellyfish change over time. Movement bouts can be approximated by a variety of Lévy and Brownian (exponential) walks. The adaptive value of this variation is not known. On some occasions movement pattern data are consistent with the jellyfish prospecting away from a preferred depth, not finding an improvement in conditions elsewhere and so returning to their original depth. This 'bounce' behaviour also sits outside of current Lévy walk search theory. Here, it is shown that the jellyfish movement patterns are consistent with their using optimized 'fast simulated annealing'--a novel kind of Lévy walk search pattern--to locate the maximum prey concentration in the water column and/or to locate the strongest of many olfactory trails emanating from more distant prey. Fast simulated annealing is a powerful stochastic search algorithm for locating a global maximum that is hidden among many poorer local maxima in a large search space. This new finding shows that the notion of active optimized Lévy walk searching is not limited to the search for randomly and sparsely distributed resources, as previously thought, but can be extended to embrace other scenarios, including that of the jellyfish R. octopus. In the presence of convective currents, it could become energetically favourable to search the water column by riding the convective currents. Here, it is shown that these passive movements can be represented accurately by Lévy walks of the type occasionally seen in R. octopus. This result vividly illustrates that Lévy walks are not necessarily
Optimal Refueling Pattern Search for a CANDU Reactor Using a Genetic Algorithm
International Nuclear Information System (INIS)
Quang Binh, DO; Gyuhong, ROH; Hangbok, CHOI
2006-01-01
This paper presents the results from the application of genetic algorithms to a refueling optimization of a Canada deuterium uranium (CANDU) reactor. This work aims at making a mathematical model of the refueling optimization problem including the objective function and constraints and developing a method based on genetic algorithms to solve the problem. The model of the optimization problem and the proposed method comply with the key features of the refueling strategy of the CANDU reactor which adopts an on-power refueling operation. In this study, a genetic algorithm combined with an elitism strategy was used to automatically search for the refueling patterns. The objective of the optimization was to maximize the discharge burn-up of the refueling bundles, minimize the maximum channel power, or minimize the maximum change in the zone controller unit (ZCU) water levels. A combination of these objectives was also investigated. The constraints include the discharge burn-up, maximum channel power, maximum bundle power, channel power peaking factor and the ZCU water level. A refueling pattern that represents the refueling rate and channels was coded by a one-dimensional binary chromosome, which is a string of binary numbers 0 and 1. A computer program was developed in FORTRAN 90 running on an HP 9000 workstation to conduct the search for the optimal refueling patterns for a CANDU reactor at the equilibrium state. The results showed that it was possible to apply genetic algorithms to automatically search for the refueling channels of the CANDU reactor. The optimal refueling patterns were compared with the solutions obtained from the AUTOREFUEL program and the results were consistent with each other. (authors)
Arasomwan, Martins Akugbe; Adewumi, Aderemi Oluyinka
2014-01-01
A new local search technique is proposed and used to improve the performance of particle swarm optimization algorithms by addressing the problem of premature convergence. In the proposed local search technique, a potential particle position in the solution search space is collectively constructed by a number of randomly selected particles in the swarm. The number of times the selection is made varies with the dimension of the optimization problem and each selected particle donates the value in the location of its randomly selected dimension from its personal best. After constructing the potential particle position, some local search is done around its neighbourhood in comparison with the current swarm global best position. It is then used to replace the global best particle position if it is found to be better; otherwise no replacement is made. Using some well-studied benchmark problems with low and high dimensions, numerical simulations were used to validate the performance of the improved algorithms. Comparisons were made with four different PSO variants, two of the variants implement different local search technique while the other two do not. Results show that the improved algorithms could obtain better quality solution while demonstrating better convergence velocity and precision, stability, robustness, and global-local search ability than the competing variants. PMID:24723827
Optimizing searches for electromagnetic counterparts of gravitational wave triggers
Coughlin, Michael W.; Tao, Duo; Chan, Man Leong; Chatterjee, Deep; Christensen, Nelson; Ghosh, Shaon; Greco, Giuseppe; Hu, Yiming; Kapadia, Shasvath; Rana, Javed; Salafia, Om Sharan; Stubbs11, Christopher
2018-04-01
With the detection of a binary neutron star system and its corresponding electromagnetic counterparts, a new window of transient astronomy has opened. Due to the size of the sky localization regions, which can span hundreds to thousands of square degrees, there are significant benefits to optimizing tilings for these large sky areas. The rich science promised by gravitational-wave astronomy has led to the proposal for a variety of proposed tiling and time allocation schemes, and for the first time, we make a systematic comparison of some of these methods. We find that differences of a factor of 2 or more in efficiency are possible, depending on the algorithm employed. For this reason, with future surveys searching for electromagnetic counterparts, care should be taken when selecting tiling, time allocation, and scheduling algorithms to optimize counterpart detection.
Novel Back Propagation Optimization by Cuckoo Search Algorithm
Directory of Open Access Journals (Sweden)
Jiao-hong Yi
2014-01-01
Full Text Available The traditional Back Propagation (BP has some significant disadvantages, such as training too slowly, easiness to fall into local minima, and sensitivity of the initial weights and bias. In order to overcome these shortcomings, an improved BP network that is optimized by Cuckoo Search (CS, called CSBP, is proposed in this paper. In CSBP, CS is used to simultaneously optimize the initial weights and bias of BP network. Wine data is adopted to study the prediction performance of CSBP, and the proposed method is compared with the basic BP and the General Regression Neural Network (GRNN. Moreover, the parameter study of CSBP is conducted in order to make the CSBP implement in the best way.
Global Search Strategies for Solving Multilinear Least-Squares Problems
Directory of Open Access Journals (Sweden)
Mats Andersson
2012-04-01
Full Text Available The multilinear least-squares (MLLS problem is an extension of the linear least-squares problem. The difference is that a multilinear operator is used in place of a matrix-vector product. The MLLS is typically a large-scale problem characterized by a large number of local minimizers. It originates, for instance, from the design of filter networks. We present a global search strategy that allows for moving from one local minimizer to a better one. The efficiency of this strategy is illustrated by the results of numerical experiments performed for some problems related to the design of filter networks.
Optimized blind gamma-ray pulsar searches at fixed computing budget
International Nuclear Information System (INIS)
Pletsch, Holger J.; Clark, Colin J.
2014-01-01
The sensitivity of blind gamma-ray pulsar searches in multiple years worth of photon data, as from the Fermi LAT, is primarily limited by the finite computational resources available. Addressing this 'needle in a haystack' problem, here we present methods for optimizing blind searches to achieve the highest sensitivity at fixed computing cost. For both coherent and semicoherent methods, we consider their statistical properties and study their search sensitivity under computational constraints. The results validate a multistage strategy, where the first stage scans the entire parameter space using an efficient semicoherent method and promising candidates are then refined through a fully coherent analysis. We also find that for the first stage of a blind search incoherent harmonic summing of powers is not worthwhile at fixed computing cost for typical gamma-ray pulsars. Further enhancing sensitivity, we present efficiency-improved interpolation techniques for the semicoherent search stage. Via realistic simulations we demonstrate that overall these optimizations can significantly lower the minimum detectable pulsed fraction by almost 50% at the same computational expense.
Derivation of Optimal Cropping Pattern in Part of Hirakud Command using Cuckoo Search
Rath, Ashutosh; Biswal, Sudarsan; Samantaray, Sandeep; Swain, Prakash Chandra, PROF.
2017-08-01
The economicgrowth of a Nation depends on agriculture which relies on the obtainable water resources, available land and crops. The contribution of water in an appropriate quantity at appropriate time plays avitalrole to increase the agricultural production. Optimal utilization of available resources can be achieved by proper planning and management of water resources projects and adoption of appropriate technology. In the present work, the command area of Sambalpur distribrutary System is taken up for investigation. Further, adoption of a fixed cropping pattern causes the reduction of yield. The present study aims at developing different crop planning strategies to increase the net benefit from the command area with minimum investment. Optimization models are developed for Kharif season using LINDO and Cuckoo Search (CS) algorithm for maximization of the net benefits. In process of development of Optimization model the factors such as cultivable land, seeds, fertilizers, man power, water cost, etc. are taken as constraints. The irrigation water needs of major crops and the total available water through canals in the command of Sambalpur Distributary are estimated. LINDO and Cuckoo Search models are formulated and used to derive the optimal cropping pattern yielding maximum net benefits. The net benefits of Rs.585.0 lakhs in Kharif Season are obtained by adopting LINGO and 596.07 lakhs from Cuckoo Search, respectively, whereas the net benefits of 447.0 lakhs is received by the farmers of the locality with the adopting present cropping pattern.
Adaptive symbiotic organisms search (SOS algorithm for structural design optimization
Directory of Open Access Journals (Sweden)
Ghanshyam G. Tejani
2016-07-01
Full Text Available The symbiotic organisms search (SOS algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.
A DE-Based Scatter Search for Global Optimization Problems
Directory of Open Access Journals (Sweden)
Kun Li
2015-01-01
Full Text Available This paper proposes a hybrid scatter search (SS algorithm for continuous global optimization problems by incorporating the evolution mechanism of differential evolution (DE into the reference set updated procedure of SS to act as the new solution generation method. This hybrid algorithm is called a DE-based SS (SSDE algorithm. Since different kinds of mutation operators of DE have been proposed in the literature and they have shown different search abilities for different kinds of problems, four traditional mutation operators are adopted in the hybrid SSDE algorithm. To adaptively select the mutation operator that is most appropriate to the current problem, an adaptive mechanism for the candidate mutation operators is developed. In addition, to enhance the exploration ability of SSDE, a reinitialization method is adopted to create a new population and subsequently construct a new reference set whenever the search process of SSDE is trapped in local optimum. Computational experiments on benchmark problems show that the proposed SSDE is competitive or superior to some state-of-the-art algorithms in the literature.
Directory of Open Access Journals (Sweden)
A. P. Karpenko
2014-01-01
Full Text Available We consider a class of stochastic search algorithms of global optimization which in various publications are called behavioural, intellectual, metaheuristic, inspired by the nature, swarm, multi-agent, population, etc. We use the last term.Experience in using the population algorithms to solve challenges of global optimization shows that application of one such algorithm may not always effective. Therefore now great attention is paid to hybridization of population algorithms of global optimization. Hybrid algorithms unite various algorithms or identical algorithms, but with various values of free parameters. Thus efficiency of one algorithm can compensate weakness of another.The purposes of the work are development of hybrid algorithm of global optimization based on known algorithms of harmony search (HS and swarm of particles (PSO, software implementation of algorithm, study of its efficiency using a number of known benchmark problems, and a problem of dimensional optimization of truss structure.We set a problem of global optimization, consider basic algorithms of HS and PSO, give a flow chart of the offered hybrid algorithm called PSO HS , present results of computing experiments with developed algorithm and software, formulate main results of work and prospects of its development.
A novel optimization method, Gravitational Search Algorithm (GSA), for PWR core optimization
International Nuclear Information System (INIS)
Mahmoudi, S.M.; Aghaie, M.; Bahonar, M.; Poursalehi, N.
2016-01-01
Highlights: • The Gravitational Search Algorithm (GSA) is introduced. • The advantage of GSA is verified in Shekel’s Foxholes. • Reload optimizing in WWER-1000 and WWER-440 cases are performed. • Maximizing K eff , minimizing PPFs and flattening power density is considered. - Abstract: In-core fuel management optimization (ICFMO) is one of the most challenging concepts of nuclear engineering. In recent decades several meta-heuristic algorithms or computational intelligence methods have been expanded to optimize reactor core loading pattern. This paper presents a new method of using Gravitational Search Algorithm (GSA) for in-core fuel management optimization. The GSA is constructed based on the law of gravity and the notion of mass interactions. It uses the theory of Newtonian physics and searcher agents are the collection of masses. In this work, at the first step, GSA method is compared with other meta-heuristic algorithms on Shekel’s Foxholes problem. In the second step for finding the best core, the GSA algorithm has been performed for three PWR test cases including WWER-1000 and WWER-440 reactors. In these cases, Multi objective optimizations with the following goals are considered, increment of multiplication factor (K eff ), decrement of power peaking factor (PPF) and power density flattening. It is notable that for neutronic calculation, PARCS (Purdue Advanced Reactor Core Simulator) code is used. The results demonstrate that GSA algorithm have promising performance and could be proposed for other optimization problems of nuclear engineering field.
Galaxy Strategy for Ligo-Virgo Gravitational Wave Counterpart Searches
Gehrels, Neil; Cannizzo, John K.; Kanner, Jonah; Kasliwal, Mansi M.; Nissanke, Samaya; Singer, Leo P.
2016-01-01
In this work we continue a line of inquiry begun in Kanner et al. which detailed a strategy for utilizing telescopes with narrow fields of view, such as the Swift X-Ray Telescope (XRT), to localize gravity wave (GW) triggers from LIGO (Laser Interferometer Gravitational-Wave Observatory) / Virgo. If one considers the brightest galaxies that produce 50 percent of the light, then the number of galaxies inside typical GW error boxes will be several tens. We have found that this result applies both in the early years of Advanced LIGO when the range is small and the error boxes large, and in the later years when the error boxes will be small and the range large. This strategy has the beneficial property of reducing the number of telescope pointings by a factor 10 to 100 compared with tiling the entire error box. Additional galaxy count reduction will come from a GW rapid distance estimate which will restrict the radial slice in search volume. Combining the bright galaxy strategy with a convolution based on anticipated GW localizations, we find that the searches can be restricted to about 18 plus or minus 5 galaxies for 2015, about 23 plus or minus 4 for 2017, and about 11 plus or minus for 2020. This assumes a distance localization at the putative neutron star-neutron star (NS-NS) merger range mu for each target year, and these totals are integrated out to the range. Integrating out to the horizon would roughly double the totals. For localizations with r (rotation) greatly less than mu the totals would decrease. The galaxy strategy we present in this work will enable numerous sensitive optical and X-ray telescopes with small fields of view to participate meaningfully in searches wherein the prospects for rapidly fading afterglow place a premium on a fast response time.
Can collective searches profit from Levy walk strategies?
Energy Technology Data Exchange (ETDEWEB)
Santos, M C; Da Luz, M G E [Departamento de Fisica, Universidade Federal do Parana, Curitiba-PR, 81531-990 (Brazil); Raposo, E P [Laboratorio de Fisica Teorica e Computacional, Departamento de Fisica, Universidade Federal de Pernambuco, Recife-PE, 50670-901 (Brazil); Viswanathan, G M [Instituto de Fisica, Universidade Federal de Alagoas, Maceio-AL, 57072-970 (Brazil)], E-mail: luz@fisica.ufpr.br
2009-10-30
We address the problem of collective searching in which a group of walkers, guided by a leader, looks for randomly located target sites. In such a process, the necessity to maintain the group aggregated imposes a constraint in the foraging dynamics. We discuss four different models for the system collective behavior, with the leader and followers performing Gaussian as well as truncated Levy walks. In environments with low density of targets we show that Levy foraging is advantageous for the whole group, when compared with Gaussian strategy. Furthermore, certain extra rules must be incorporated in the individuals' dynamics, so that a compromise between the trend to keep the group together and the global efficiency of search is met. The exact character of these rules depends on specific details of the foraging process, such as regeneration of target sites and energy costs.
International Nuclear Information System (INIS)
Wu, Xia; Wu, Genhua
2014-01-01
Highlights: • A high efficient method for optimization of atomic clusters is developed. • Its performance is studied by optimizing Lennard-Jones clusters and Ag clusters. • The method is proved to be quite efficient. • A new Ag 61 cluster with stacking-fault face-centered cubic motif is found. - Abstract: Geometrical optimization of atomic clusters is performed by a development of adaptive immune optimization algorithm (AIOA) with dynamic lattice searching (DLS) operation (AIOA-DLS method). By a cycle of construction and searching of the dynamic lattice (DL), DLS algorithm rapidly makes the clusters more regular and greatly reduces the potential energy. DLS can thus be used as an operation acting on the new individuals after mutation operation in AIOA to improve the performance of the AIOA. The AIOA-DLS method combines the merit of evolutionary algorithm and idea of dynamic lattice. The performance of the proposed method is investigated in the optimization of Lennard-Jones clusters within 250 atoms and silver clusters described by many-body Gupta potential within 150 atoms. Results reported in the literature are reproduced, and the motif of Ag 61 cluster is found to be stacking-fault face-centered cubic, whose energy is lower than that of previously obtained icosahedron
Directory of Open Access Journals (Sweden)
A. K. M. Foysal Ahmed
2018-03-01
Full Text Available The classical capacitated vehicle routing problem (CVRP is a very popular combinatorial optimization problem in the field of logistics and supply chain management. Although CVRP has drawn interests of many researchers, no standard way has been established yet to obtain best known solutions for all the different problem sets. We propose an efficient algorithm Bilayer Local Search-based Particle Swarm Optimization (BLS-PSO along with a novel decoding method to solve CVRP. Decoding method is important to relate the encoded particle position to a feasible CVRP solution. In bilayer local search, one layer of local search is for the whole population in any iteration whereas another one is applied only on the pool of the best particles generated in different generations. Such searching strategies help the BLS-PSO to perform better than the existing proposals by obtaining best known solutions for most of the existing benchmark problems within very reasonable computational time. Computational results also show that the performance achieved by the proposed algorithm outperforms other PSO-based approaches.
Optimal energy management strategy for self-reconfigurable batteries
International Nuclear Information System (INIS)
Bouchhima, Nejmeddine; Schnierle, Marc; Schulte, Sascha; Birke, Kai Peter
2017-01-01
This paper proposes a novel energy management strategy for multi-cell high voltage batteries where the current through each cell can be controlled, called self-reconfigurable batteries. An optimized control strategy further enhances the energy efficiency gained by the hardware architecture of those batteries. Currently, achieving cell equalization by using the active balancing circuits is considered as the best way to optimize the energy efficiency of the battery pack. This study demonstrates that optimizing the energy efficiency of self-reconfigurable batteries is no more strongly correlated to the cell balancing. According to the features of this novel battery architecture, the energy management strategy is formulated as nonlinear dynamic optimization problem. To solve this optimal control, an optimization algorithm that generates the optimal discharge policy for a given driving cycle is developed based on dynamic programming and code vectorization. The simulation results show that the designed energy management strategy maximizes the system efficiency across the battery lifetime over conventional approaches. Furthermore, the present energy management strategy can be implemented online due to the reduced complexity of the optimization algorithm. - Highlights: • The energy efficiency of self-reconfigurable batteries is maximized. • The energy management strategy for the battery is formulated as optimal control problem. • Developing an optimization algorithm using dynamic programming techniques and code vectorization. • Simulation studies are conducted to validate the proposed optimal strategy.
Wastewater Treatment Optimization for Fish Migration Using Harmony Search
Directory of Open Access Journals (Sweden)
Zong Woo Geem
2014-01-01
Full Text Available Certain types of fish migrate between the sea and fresh water to spawn. In order for them to swim without any breathing problem, river should contain enough oxygen. If fish is passing along the river in municipal area, it needs sufficient dissolved oxygen level which is influenced by dumped amount of wastewater into the river. If existing treatment methods such as settling and biological oxidation are not enough, we have to consider additional treatment methods such as microscreening filtration and nitrification. This study constructed a wastewater treatment optimization model for migratory fish, which considers three costs (filtration cost, nitrification cost, and irrigation cost and two environmental constraints (minimal dissolved oxygen level and maximal nitrate-nitrogen concentration. Results show that the metaheuristic technique such as harmony search could find good solutions robustly while calculus-based technique such as generalized reduced gradient method was trapped in local optima or even divergent.
System identification using Nuclear Norm & Tabu Search optimization
Ahmed, Asif A.; Schoen, Marco P.; Bosworth, Ken W.
2018-01-01
In recent years, subspace System Identification (SI) algorithms have seen increased research, stemming from advanced minimization methods being applied to the Nuclear Norm (NN) approach in system identification. These minimization algorithms are based on hard computing methodologies. To the authors’ knowledge, as of now, there has been no work reported that utilizes soft computing algorithms to address the minimization problem within the nuclear norm SI framework. A linear, time-invariant, discrete time system is used in this work as the basic model for characterizing a dynamical system to be identified. The main objective is to extract a mathematical model from collected experimental input-output data. Hankel matrices are constructed from experimental data, and the extended observability matrix is employed to define an estimated output of the system. This estimated output and the actual - measured - output are utilized to construct a minimization problem. An embedded rank measure assures minimum state realization outcomes. Current NN-SI algorithms employ hard computing algorithms for minimization. In this work, we propose a simple Tabu Search (TS) algorithm for minimization. TS algorithm based SI is compared with the iterative Alternating Direction Method of Multipliers (ADMM) line search optimization based NN-SI. For comparison, several different benchmark system identification problems are solved by both approaches. Results show improved performance of the proposed SI-TS algorithm compared to the NN-SI ADMM algorithm.
Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah
2016-01-01
The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.
Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah
2016-01-01
The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585
Use of search engine optimization factors for Google page rank prediction
Tvrdi, Barbara
2012-01-01
Over the years, search engines have become an important tool for finding information. It is known that users select the link on the first page of search results in 62% of the cases. Search engine optimization techniques enable website improvement and therefore a better ranking in search engines. The exact specification of the factors that affect website ranking is not disclosed by search engine owners. In this thesis we tried to choose some most frequently mentioned search engine optimizatio...
Stochastic search, optimization and regression with energy applications
Hannah, Lauren A.
Designing clean energy systems will be an important task over the next few decades. One of the major roadblocks is a lack of mathematical tools to economically evaluate those energy systems. However, solutions to these mathematical problems are also of interest to the operations research and statistical communities in general. This thesis studies three problems that are of interest to the energy community itself or provide support for solution methods: R&D portfolio optimization, nonparametric regression and stochastic search with an observable state variable. First, we consider the one stage R&D portfolio optimization problem to avoid the sequential decision process associated with the multi-stage. The one stage problem is still difficult because of a non-convex, combinatorial decision space and a non-convex objective function. We propose a heuristic solution method that uses marginal project values---which depend on the selected portfolio---to create a linear objective function. In conjunction with the 0-1 decision space, this new problem can be solved as a knapsack linear program. This method scales well to large decision spaces. We also propose an alternate, provably convergent algorithm that does not exploit problem structure. These methods are compared on a solid oxide fuel cell R&D portfolio problem. Next, we propose Dirichlet Process mixtures of Generalized Linear Models (DPGLM), a new method of nonparametric regression that accommodates continuous and categorical inputs, and responses that can be modeled by a generalized linear model. We prove conditions for the asymptotic unbiasedness of the DP-GLM regression mean function estimate. We also give examples for when those conditions hold, including models for compactly supported continuous distributions and a model with continuous covariates and categorical response. We empirically analyze the properties of the DP-GLM and why it provides better results than existing Dirichlet process mixture regression
Optimization strategies for ultrasound volume registration
International Nuclear Information System (INIS)
Ijaz, Umer Zeeshan; Prager, Richard W; Gee, Andrew H; Treece, Graham M
2010-01-01
This paper considers registration of 3D ultrasound volumes acquired in multiple views for display in a single image volume. One way to acquire 3D data is to use a mechanically swept 3D probe. However, the usefulness of these probes is restricted by their limited field of view. This problem can be overcome by attaching a six-degree-of-freedom (DOF) position sensor to the probe, and displaying the information from multiple sweeps in their proper positions. However, an external six-DOF position sensor can be an inconvenience in a clinical setting. The objective of this paper is to propose a hybrid strategy that replaces the sensor with a combination of three-DOF image registration and an unobtrusive inertial sensor for measuring orientation. We examine a range of optimization algorithms and similarity measures for registration and compare them in in vitro and in vivo experiments. We register based on multiple reslice images rather than a whole voxel array. In this paper, we use a large number of reslices for improved reliability at the expense of computational speed. We have found that the Levenberg–Marquardt method is very fast but is not guaranteed to give the correct solution all the time. We conclude that normalized mutual information used in the Nelder–Mead simplex algorithm is potentially suitable for the registration task with an average execution time of around 5 min, in the majority of cases, with two restarts in a C++ implementation on a 3.0 GHz Intel Core 2 Duo CPU machine
Optimizing metapopulation sustainability through a checkerboard strategy.
Directory of Open Access Journals (Sweden)
Yossi Ben Zion
2010-01-01
Full Text Available The persistence of a spatially structured population is determined by the rate of dispersal among habitat patches. If the local dynamic at the subpopulation level is extinction-prone, the system viability is maximal at intermediate connectivity where recolonization is allowed, but full synchronization that enables correlated extinction is forbidden. Here we developed and used an algorithm for agent-based simulations in order to study the persistence of a stochastic metapopulation. The effect of noise is shown to be dramatic, and the dynamics of the spatial population differs substantially from the predictions of deterministic models. This has been validated for the stochastic versions of the logistic map, the Ricker map and the Nicholson-Bailey host-parasitoid system. To analyze the possibility of extinction, previous studies were focused on the attractiveness (Lyapunov exponent of stable solutions and the structure of their basin of attraction (dependence on initial population size. Our results suggest that these features are of secondary importance in the presence of stochasticity. Instead, optimal sustainability is achieved when decoherence is maximal. Individual-based simulations of metapopulations of different sizes, dimensions and noise types, show that the system's lifetime peaks when it displays checkerboard spatial patterns. This conclusion is supported by the results of a recently published Drosophila experiment. The checkerboard strategy provides a technique for the manipulation of migration rates (e.g., by constructing corridors in order to affect the persistence of a metapopulation. It may be used in order to minimize the risk of extinction of an endangered species, or to maximize the efficiency of an eradication campaign.
International Nuclear Information System (INIS)
Francois, J.L.; Martin-del-Campo, C.; Francois, R.; Morales, L.B.
2003-01-01
An optimization procedure based on the tabu search (TS) method was developed for the design of radial enrichment and gadolinia distributions for boiling water reactor (BWR) fuel lattices. The procedure was coded in a computing system in which the optimization code uses the tabu search method to select potential solutions and the HELIOS code to evaluate them. The goal of the procedure is to search for an optimal fuel utilization, looking for a lattice with minimum average enrichment, with minimum deviation of reactivity targets and with a local power peaking factor (PPF) lower than a limit value. Time-dependent-depletion (TDD) effects were considered in the optimization process. The additive utility function method was used to convert the multiobjective optimization problem into a single objective problem. A strategy to reduce the computing time employed by the optimization was developed and is explained in this paper. An example is presented for a 10x10 fuel lattice with 10 different fuel compositions. The main contribution of this study is the development of a practical TDD optimization procedure for BWR fuel lattice design, using TS with a multiobjective function, and a strategy to economize computing time
Optimal Control of Sensor Threshold for Autonomous Wide Area Search Munitions
National Research Council Canada - National Science Library
Kish, Brian A; Jacques, David R; Pachter, Meir
2005-01-01
The optimal employment of autonomous wide area search munitions is addressed. The scenario considered involves an airborne munition searching a battle space for stationary targets in the presence of false targets...
Optimal correction and design parameter search by modern methods of rigorous global optimization
International Nuclear Information System (INIS)
Makino, K.; Berz, M.
2011-01-01
Frequently the design of schemes for correction of aberrations or the determination of possible operating ranges for beamlines and cells in synchrotrons exhibit multitudes of possibilities for their correction, usually appearing in disconnected regions of parameter space which cannot be directly qualified by analytical means. In such cases, frequently an abundance of optimization runs are carried out, each of which determines a local minimum depending on the specific chosen initial conditions. Practical solutions are then obtained through an often extended interplay of experienced manual adjustment of certain suitable parameters and local searches by varying other parameters. However, in a formal sense this problem can be viewed as a global optimization problem, i.e. the determination of all solutions within a certain range of parameters that lead to a specific optimum. For example, it may be of interest to find all possible settings of multiple quadrupoles that can achieve imaging; or to find ahead of time all possible settings that achieve a particular tune; or to find all possible manners to adjust nonlinear parameters to achieve correction of high order aberrations. These tasks can easily be phrased in terms of such an optimization problem; but while mathematically this formulation is often straightforward, it has been common belief that it is of limited practical value since the resulting optimization problem cannot usually be solved. However, recent significant advances in modern methods of rigorous global optimization make these methods feasible for optics design for the first time. The key ideas of the method lie in an interplay of rigorous local underestimators of the objective functions, and by using the underestimators to rigorously iteratively eliminate regions that lie above already known upper bounds of the minima, in what is commonly known as a branch-and-bound approach. Recent enhancements of the Differential Algebraic methods used in particle
Developing an Integrated Design Strategy for Chip Layout Optimization
Wits, Wessel Willems; Jauregui Becker, Juan Manuel; van Vliet, Frank Edward; te Riele, G.J.
2011-01-01
This paper presents an integrated design strategy for chip layout optimization. The strategy couples both electric and thermal aspects during the conceptual design phase to improve chip performances; thermal management being one of the major topics. The layout of the chip circuitry is optimized
Optimal Spatial Harvesting Strategy and Symmetry-Breaking
International Nuclear Information System (INIS)
Kurata, Kazuhiro; Shi Junping
2008-01-01
A reaction-diffusion model with logistic growth and constant effort harvesting is considered. By minimizing an intrinsic biological energy function, we obtain an optimal spatial harvesting strategy which will benefit the population the most. The symmetry properties of the optimal strategy are also discussed, and related symmetry preserving and symmetry breaking phenomena are shown with several typical examples of habitats
Synthesis of Optimal Strategies Using HyTech
DEFF Research Database (Denmark)
Bouyer, Patricia; Cassez, Franck; Larsen, Kim Guldstrand
2005-01-01
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal...... strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation...
Optimization Strategies for Hardware-Based Cofactorization
Loebenberger, Daniel; Putzka, Jens
We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorization step on a hardware cluster. An optimal distribution of bitlength-specific ECM modules is proposed and compared to existing ones. With our optimizations we obtain a speedup between 17% and 33% of the cofactorization step of the GNFS when compared to the runtime of an unoptimized cluster.
Particle swarm optimization based optimal bidding strategy in an ...
African Journals Online (AJOL)
In an electricity market generating companies and large consumers need suitable bidding models to maximize their profits. Therefore, each supplier and large consumer will bid strategically for choosing the bidding coefficients to counter the competitors bidding strategy. In this paper, bidding strategy problem modeled as an ...
Optimization strategies for discrete multi-material stiffness optimization
DEFF Research Database (Denmark)
Hvejsel, Christian Frier; Lund, Erik; Stolpe, Mathias
2011-01-01
Design of composite laminated lay-ups are formulated as discrete multi-material selection problems. The design problem can be modeled as a non-convex mixed-integer optimization problem. Such problems are in general only solvable to global optimality for small to moderate sized problems. To attack...... which numerically confirm the sought properties of the new scheme in terms of convergence to a discrete solution....
Fetal DNA: strategies for optimal recovery
Legler, Tobias J.; Heermann, Klaus-Hinrich; Liu, Zhong; Soussan, Aicha Ait; van der Schoot, C. Ellen
2008-01-01
For fetal DNA extraction, in principle each DNA extraction method can be used; however, because most methods have been optimized for genomic DNA from leucocytes, we describe here the methods that have been optimized for the extraction of fetal DNA from maternal plasma and validated for this purpose
Strategies for Optimal Design of Structural Systems
DEFF Research Database (Denmark)
Enevoldsen, I.; Sørensen, John Dalsgaard
1992-01-01
Reliability-based design of structural systems is considered. Especially systems where the reliability model is a series system of parallel systems are analysed. A sensitivity analysis for this class of problems is presented. Direct and sequential optimization procedures to solve the optimization...
An optimal tuning strategy for tidal turbines.
Vennell, Ross
2016-11-01
Tuning wind and tidal turbines is critical to maximizing their power output. Adopting a wind turbine tuning strategy of maximizing the output at any given time is shown to be an extremely poor strategy for large arrays of tidal turbines in channels. This 'impatient-tuning strategy' results in far lower power output, much higher structural loads and greater environmental impacts due to flow reduction than an existing 'patient-tuning strategy' which maximizes the power output averaged over the tidal cycle. This paper presents a 'smart patient tuning strategy', which can increase array output by up to 35% over the existing strategy. This smart strategy forgoes some power generation early in the half tidal cycle in order to allow stronger flows to develop later in the cycle. It extracts enough power from these stronger flows to produce more power from the cycle as a whole than the existing strategy. Surprisingly, the smart strategy can often extract more power without increasing maximum structural loads on the turbines, while also maintaining stronger flows along the channel. This paper also shows that, counterintuitively, for some tuning strategies imposing a cap on turbine power output to limit loads can increase a turbine's average power output.
Intermittent random walks: transport regimes and implications on search strategies
International Nuclear Information System (INIS)
Gomez Portillo, Ignacio; Campos, Daniel; Méndez, Vicenç
2011-01-01
We construct a transport model for particles that alternate rests of random duration and flights with random velocities. The model provides a balance equation for the mesoscopic particle density obtained from the continuous-time random walk framework. By assuming power laws for the distributions of waiting times and flight durations (for any velocity distribution with finite moments) we have found that the model can yield all the transport regimes ranging from subdiffusion to ballistic depending on the values of the characteristic exponents of the distributions. In addition, if the exponents satisfy a simple relationship it is shown how the competition between the tails of the distributions gives rise to a diffusive transport. Finally, we explore how the details of this intermittent transport process affect the success probability in an optimal search problem where an individual searcher looks for a target distributed (heterogeneously) in space. All the results are conveniently checked with numerical simulations
Accelerated Simplified Swarm Optimization with Exploitation Search Scheme for Data Clustering.
Directory of Open Access Journals (Sweden)
Wei-Chang Yeh
Full Text Available Data clustering is commonly employed in many disciplines. The aim of clustering is to partition a set of data into clusters, in which objects within the same cluster are similar and dissimilar to other objects that belong to different clusters. Over the past decade, the evolutionary algorithm has been commonly used to solve clustering problems. This study presents a novel algorithm based on simplified swarm optimization, an emerging population-based stochastic optimization approach with the advantages of simplicity, efficiency, and flexibility. This approach combines variable vibrating search (VVS and rapid centralized strategy (RCS in dealing with clustering problem. VVS is an exploitation search scheme that can refine the quality of solutions by searching the extreme points nearby the global best position. RCS is developed to accelerate the convergence rate of the algorithm by using the arithmetic average. To empirically evaluate the performance of the proposed algorithm, experiments are examined using 12 benchmark datasets, and corresponding results are compared with recent works. Results of statistical analysis indicate that the proposed algorithm is competitive in terms of the quality of solutions.
National Research Council Canada - National Science Library
Homaifar, Abdollah; Esterline, Albert; Kimiaghalam, Bahram
2005-01-01
The Hybrid Projected Gradient-Evolutionary Search Algorithm (HPGES) algorithm uses a specially designed evolutionary-based global search strategy to efficiently create candidate solutions in the solution space...
Particle swarm optimization based optimal bidding strategy in an ...
African Journals Online (AJOL)
user
A considerable amount of work has also been reported on the game theory applications ... probability distribution function (Song et al, 1999) and as a continuous ..... compared with GA and Monte Carlo method, therefore the bidding strategies.
Directory of Open Access Journals (Sweden)
Shouheng Tuo
Full Text Available Harmony Search (HS and Teaching-Learning-Based Optimization (TLBO as new swarm intelligent optimization algorithms have received much attention in recent years. Both of them have shown outstanding performance for solving NP-Hard optimization problems. However, they also suffer dramatic performance degradation for some complex high-dimensional optimization problems. Through a lot of experiments, we find that the HS and TLBO have strong complementarity each other. The HS has strong global exploration power but low convergence speed. Reversely, the TLBO has much fast convergence speed but it is easily trapped into local search. In this work, we propose a hybrid search algorithm named HSTLBO that merges the two algorithms together for synergistically solving complex optimization problems using a self-adaptive selection strategy. In the HSTLBO, both HS and TLBO are modified with the aim of balancing the global exploration and exploitation abilities, where the HS aims mainly to explore the unknown regions and the TLBO aims to rapidly exploit high-precision solutions in the known regions. Our experimental results demonstrate better performance and faster speed than five state-of-the-art HS variants and show better exploration power than five good TLBO variants with similar run time, which illustrates that our method is promising in solving complex high-dimensional optimization problems. The experiment on portfolio optimization problems also demonstrate that the HSTLBO is effective in solving complex read-world application.
Optimal portfolio strategies under a shortfall constraint
African Journals Online (AJOL)
we make precise the optimal control problem to be solved. .... is closely related to the concept of Value-at-Risk, but overcomes some of the conceptual .... We adapt a dynamic programming approach to solve the HJB equation associated with.
Optimal Pricing Strategy for New Products
Trichy V. Krishnan; Frank M. Bass; Dipak C. Jain
1999-01-01
Robinson and Lakhani (1975) initiated a long research stream in marketing when they used the Bass model (1969) to develop optimal pricing path for a new product. A careful analysis of the extant literature reveals that the research predominantly suggests that the optimal price path should be largely based on the sales growth pattern. However, in the real world we rarely find new products that have such pricing pattern. We observe either a monotonically declining pricing pattern or an increase...
An optimal tuning strategy for tidal turbines
2016-01-01
Tuning wind and tidal turbines is critical to maximizing their power output. Adopting a wind turbine tuning strategy of maximizing the output at any given time is shown to be an extremely poor strategy for large arrays of tidal turbines in channels. This ‘impatient-tuning strategy’ results in far lower power output, much higher structural loads and greater environmental impacts due to flow reduction than an existing ‘patient-tuning strategy’ which maximizes the power output averaged over the tidal cycle. This paper presents a ‘smart patient tuning strategy’, which can increase array output by up to 35% over the existing strategy. This smart strategy forgoes some power generation early in the half tidal cycle in order to allow stronger flows to develop later in the cycle. It extracts enough power from these stronger flows to produce more power from the cycle as a whole than the existing strategy. Surprisingly, the smart strategy can often extract more power without increasing maximum structural loads on the turbines, while also maintaining stronger flows along the channel. This paper also shows that, counterintuitively, for some tuning strategies imposing a cap on turbine power output to limit loads can increase a turbine’s average power output. PMID:27956870
Multi-objective optimal strategy for generating and bidding in the power market
International Nuclear Information System (INIS)
Peng Chunhua; Sun Huijuan; Guo Jianfeng; Liu Gang
2012-01-01
Highlights: ► A new benefit/risk/emission comprehensive generation optimization model is established. ► A hybrid multi-objective differential evolution optimization algorithm is designed. ► Fuzzy set theory and entropy weighting method are employed to extract the general best solution. ► The proposed approach of generating and bidding is efficient for maximizing profit and minimizing both risk and emissions. - Abstract: Based on the coordinated interaction between units output and electricity market prices, the benefit/risk/emission comprehensive generation optimization model with objectives of maximal profit and minimal bidding risk and emissions is established. A hybrid multi-objective differential evolution optimization algorithm, which successfully integrates Pareto non-dominated sorting with differential evolution algorithm and improves individual crowding distance mechanism and mutation strategy to avoid premature and unevenly search, is designed to achieve Pareto optimal set of this model. Moreover, fuzzy set theory and entropy weighting method are employed to extract one of the Pareto optimal solutions as the general best solution. Several optimization runs have been carried out on different cases of generation bidding and scheduling. The results confirm the potential and effectiveness of the proposed approach in solving the multi-objective optimization problem of generation bidding and scheduling. In addition, the comparison with the classical optimization algorithms demonstrates the superiorities of the proposed algorithm such as integrality of Pareto front, well-distributed Pareto-optimal solutions, high search speed.
Peng, Qi; Guan, Weipeng; Wu, Yuxiang; Cai, Ye; Xie, Canyu; Wang, Pengfei
2018-01-01
This paper proposes a three-dimensional (3-D) high-precision indoor positioning strategy using Tabu search based on visible light communication. Tabu search is a powerful global optimization algorithm, and the 3-D indoor positioning can be transformed into an optimal solution problem. Therefore, in the 3-D indoor positioning, the optimal receiver coordinate can be obtained by the Tabu search algorithm. For all we know, this is the first time the Tabu search algorithm is applied to visible light positioning. Each light-emitting diode (LED) in the system broadcasts a unique identity (ID) and transmits the ID information. When the receiver detects optical signals with ID information from different LEDs, using the global optimization of the Tabu search algorithm, the 3-D high-precision indoor positioning can be realized when the fitness value meets certain conditions. Simulation results show that the average positioning error is 0.79 cm, and the maximum error is 5.88 cm. The extended experiment of trajectory tracking also shows that 95.05% positioning errors are below 1.428 cm. It can be concluded from the data that the 3-D indoor positioning based on the Tabu search algorithm achieves the requirements of centimeter level indoor positioning. The algorithm used in indoor positioning is very effective and practical and is superior to other existing methods for visible light indoor positioning.
Two Complementary Strategies for New Physics Searches at Lepton Colliders
Energy Technology Data Exchange (ETDEWEB)
Hooberman, Benjamin Henry [Univ. of California, Berkeley, CA (United States)
2009-07-06
In this thesis I present two complementary strategies for probing beyond-the-Standard Model physics using data collected in e^{+}e^{-} collisions at lepton colliders. One strategy involves searching for effects at low energy mediated by new particles at the TeV mass scale, at which new physics is expected to manifest. Several new physics scenarios, including Supersymmetry and models with leptoquarks or compositeness, may lead to observable rates for charged lepton-flavor violating processes, which are forbidden in the Standard Model. I present a search for lepton-flavor violating decays of the Υ(3S) using data collected with the BABAR detector. This study establishes the 90% confidence level upper limits BF(Υ(3S) → eτ) < 5.0 x 10^{-6} and BF(Υ(3S) → μτ) < 4.1 x 10^{-6} which are used to place constraints on new physics contributing to lepton-flavor violation at the TeV mass scale. An alternative strategy is to increase the collision energy above the threshold for new particles and produce them directly. I discuss research and development efforts aimed at producing a vertex tracker which achieves the physics performance required of a high energy lepton collider. A small-scale vertex tracker prototype is constructed using Silicon sensors of 50 μm thickness and tested using charged particle beams. This tracker achieves the targeted impact parameter resolution of σ_{LP} = (5⊕10 GeV/p_{T}) as well as a longitudinal vertex resolution of (260 ± 10) μm, which is consistent with the requirements of a TeV-scale lepton collider. This detector research and development effort must be motivated and directed by simulation studies of physics processes. Investigation of a dark matter-motivated Supersymmetry scenario is presented, in which the dark matter is composed of Supersymmetric neutralinos. In this scenario, studies of the e^{+}e^{-} → H^{0}A^{0} production process allow for
Power consumption optimization strategy for wireless networks
DEFF Research Database (Denmark)
Cornean, Horia; Kumar, Sanjay; Marchetti, Nicola
2011-01-01
in order to reduce the total power consumption in a multi cellular network. We present an algorithm for power optimization under no interference and in presence of interference conditions, targeting to maximize the network capacity. The convergence of the algorithm is guaranteed if the interference...
Search and optimization by metaheuristics techniques and algorithms inspired by nature
Du, Ke-Lin
2016-01-01
This textbook provides a comprehensive introduction to nature-inspired metaheuristic methods for search and optimization, including the latest trends in evolutionary algorithms and other forms of natural computing. Over 100 different types of these methods are discussed in detail. The authors emphasize non-standard optimization problems and utilize a natural approach to the topic, moving from basic notions to more complex ones. An introductory chapter covers the necessary biological and mathematical backgrounds for understanding the main material. Subsequent chapters then explore almost all of the major metaheuristics for search and optimization created based on natural phenomena, including simulated annealing, recurrent neural networks, genetic algorithms and genetic programming, differential evolution, memetic algorithms, particle swarm optimization, artificial immune systems, ant colony optimization, tabu search and scatter search, bee and bacteria foraging algorithms, harmony search, biomolecular computin...
Mousavi, Seyed Hosein; Nazemi, Ali; Hafezalkotob, Ashkan
2015-03-01
With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous optimization of multiple parameters. The problem is formulated analytically using the Nash equilibrium concept for games composed of large numbers of players having discrete and large strategy spaces. The solution methodology is based on a characterization of Nash equilibrium in terms of minima of a function and relies on a metaheuristic optimization approach to find these minima. This paper presents some metaheuristic algorithms to simulate how generators bid in the spot electricity market viewpoint of their profit maximization according to the other generators' strategies, such as genetic algorithm (GA), simulated annealing (SA) and hybrid simulated annealing genetic algorithm (HSAGA) and compares their results. As both GA and SA are generic search methods, HSAGA is also a generic search method. The model based on the actual data is implemented in a peak hour of Tehran's wholesale spot market in 2012. The results of the simulations show that GA outperforms SA and HSAGA on computing time, number of function evaluation and computing stability, as well as the results of calculated Nash equilibriums by GA are less various and different from each other than the other algorithms.
Intelligent fault recognition strategy based on adaptive optimized multiple centers
Zheng, Bo; Li, Yan-Feng; Huang, Hong-Zhong
2018-06-01
For the recognition principle based optimized single center, one important issue is that the data with nonlinear separatrix cannot be recognized accurately. In order to solve this problem, a novel recognition strategy based on adaptive optimized multiple centers is proposed in this paper. This strategy recognizes the data sets with nonlinear separatrix by the multiple centers. Meanwhile, the priority levels are introduced into the multi-objective optimization, including recognition accuracy, the quantity of optimized centers, and distance relationship. According to the characteristics of various data, the priority levels are adjusted to ensure the quantity of optimized centers adaptively and to keep the original accuracy. The proposed method is compared with other methods, including support vector machine (SVM), neural network, and Bayesian classifier. The results demonstrate that the proposed strategy has the same or even better recognition ability on different distribution characteristics of data.
Long-run savings and investment strategy optimization.
Gerrard, Russell; Guillén, Montserrat; Nielsen, Jens Perch; Pérez-Marín, Ana M
2014-01-01
We focus on automatic strategies to optimize life cycle savings and investment. Classical optimal savings theory establishes that, given the level of risk aversion, a saver would keep the same relative amount invested in risky assets at any given time. We show that, when optimizing lifecycle investment, performance and risk assessment have to take into account the investor's risk aversion and the maximum amount the investor could lose, simultaneously. When risk aversion and maximum possible loss are considered jointly, an optimal savings strategy is obtained, which follows from constant rather than relative absolute risk aversion. This result is fundamental to prove that if risk aversion and the maximum possible loss are both high, then holding a constant amount invested in the risky asset is optimal for a standard lifetime saving/pension process and outperforms some other simple strategies. Performance comparisons are based on downside risk-adjusted equivalence that is used in our illustration.
Long-Run Savings and Investment Strategy Optimization
Directory of Open Access Journals (Sweden)
Russell Gerrard
2014-01-01
Full Text Available We focus on automatic strategies to optimize life cycle savings and investment. Classical optimal savings theory establishes that, given the level of risk aversion, a saver would keep the same relative amount invested in risky assets at any given time. We show that, when optimizing lifecycle investment, performance and risk assessment have to take into account the investor’s risk aversion and the maximum amount the investor could lose, simultaneously. When risk aversion and maximum possible loss are considered jointly, an optimal savings strategy is obtained, which follows from constant rather than relative absolute risk aversion. This result is fundamental to prove that if risk aversion and the maximum possible loss are both high, then holding a constant amount invested in the risky asset is optimal for a standard lifetime saving/pension process and outperforms some other simple strategies. Performance comparisons are based on downside risk-adjusted equivalence that is used in our illustration.
Directory of Open Access Journals (Sweden)
Xuyun FU
2018-01-01
Full Text Available The opportunistic replacement of multiple Life-Limited Parts (LLPs is a problem widely existing in industry. The replacement strategy of LLPs has a great impact on the total maintenance cost to a lot of equipment. This article focuses on finding a quick and effective algorithm for this problem. To improve the algorithm efficiency, six reduction rules are suggested from the perspectives of solution feasibility, determination of the replacement of LLPs, determination of the maintenance occasion and solution optimality. Based on these six reduction rules, a search algorithm is proposed. This search algorithm can identify one or several optimal solutions. A numerical experiment shows that these six reduction rules are effective, and the time consumed by the algorithm is less than 38 s if the total life of equipment is shorter than 55000 and the number of LLPs is less than 11. A specific case shows that the algorithm can obtain optimal solutions which are much better than the result of the traditional method in 10 s, and it can provide support for determining to-be-replaced LLPs when determining the maintenance workscope of an aircraft engine. Therefore, the algorithm is applicable to engineering applications concerning opportunistic replacement of multiple LLPs in aircraft engines.
Optimal inspection strategies for offshore structural systems
DEFF Research Database (Denmark)
Faber, M. H.; Sorensen, J. D.; Kroon, I. B.
1992-01-01
a mathematical framework for the estimation of the failure and repair costs a.ssociated with systems failure. Further a strategy for selecting the components to inspect based on decision tree analysis is suggested. Methods and analysis schemes are illustrated by a simple example....
Control strategy optimization of HVAC plants
Energy Technology Data Exchange (ETDEWEB)
Facci, Andrea Luigi; Zanfardino, Antonella [Department of Engineering, University of Napoli “Parthenope” (Italy); Martini, Fabrizio [Green Energy Plus srl (Italy); Pirozzi, Salvatore [SIAT Installazioni spa (Italy); Ubertini, Stefano [School of Engineering (DEIM) University of Tuscia (Italy)
2015-03-10
In this paper we present a methodology to optimize the operating conditions of heating, ventilation and air conditioning (HVAC) plants to achieve a higher energy efficiency in use. Semi-empiric numerical models of the plant components are used to predict their performances as a function of their set-point and the environmental and occupied space conditions. The optimization is performed through a graph-based algorithm that finds the set-points of the system components that minimize energy consumption and/or energy costs, while matching the user energy demands. The resulting model can be used with systems of almost any complexity, featuring both HVAC components and energy systems, and is sufficiently fast to make it applicable to real-time setting.
Control strategy optimization of HVAC plants
International Nuclear Information System (INIS)
Facci, Andrea Luigi; Zanfardino, Antonella; Martini, Fabrizio; Pirozzi, Salvatore; Ubertini, Stefano
2015-01-01
In this paper we present a methodology to optimize the operating conditions of heating, ventilation and air conditioning (HVAC) plants to achieve a higher energy efficiency in use. Semi-empiric numerical models of the plant components are used to predict their performances as a function of their set-point and the environmental and occupied space conditions. The optimization is performed through a graph-based algorithm that finds the set-points of the system components that minimize energy consumption and/or energy costs, while matching the user energy demands. The resulting model can be used with systems of almost any complexity, featuring both HVAC components and energy systems, and is sufficiently fast to make it applicable to real-time setting
Optimal Licensing Strategy: Royalty or Fixed Fee?
Andrea Fosfuri; Esther Roca
2004-01-01
Licensing a cost-reducing innovation through a royalty has been shown to be superior to licensing by means of a fixed fee for an incumbent licensor. This note shows that this result relies crucially on the assumption that the incumbent licensor can sell its cost-reducing inno-vation to all industry players. If, for any reason, only some competitors could be reached through a licensing contract, then a fixed fee might be optimally chosen.
Optimized Power Dispatch Strategy for Offshore Wind Farms
DEFF Research Database (Denmark)
Hou, Peng; Hu, Weihao; Zhang, Baohua
2016-01-01
which are related to electrical system topology. This paper proposed an optimized power dispatch strategy (OPD) for minimizing the levelized production cost (LPC) of a wind farm. Particle swarm optimization (PSO) is employed to obtain final solution for the optimization problem. Both regular shape......Maximizing the power production of offshore wind farms using proper control strategy has become an important issue for wind farm operators. However, the power transmitted to the onshore substation (OS) is not only related to the power production of each wind turbine (WT) but also the power losses...... and irregular shape wind farm are chosen for the case study. The proposed dispatch strategy is compared with two other control strategies. The simulation results show the effectiveness of the proposed strategy....
Sleep As A Strategy For Optimizing Performance.
Yarnell, Angela M; Deuster, Patricia
2016-01-01
Recovery is an essential component of maintaining, sustaining, and optimizing cognitive and physical performance during and after demanding training and strenuous missions. Getting sufficient amounts of rest and sleep is key to recovery. This article focuses on sleep and discusses (1) why getting sufficient sleep is important, (2) how to optimize sleep, and (3) tools available to help maximize sleep-related performance. Insufficient sleep negatively impacts safety and readiness through reduced cognitive function, more accidents, and increased military friendly-fire incidents. Sufficient sleep is linked to better cognitive performance outcomes, increased vigor, and better physical and athletic performance as well as improved emotional and social functioning. Because Special Operations missions do not always allow for optimal rest or sleep, the impact of reduced rest and sleep on readiness and mission success should be minimized through appropriate preparation and planning. Preparation includes periods of "banking" or extending sleep opportunities before periods of loss, monitoring sleep by using tools like actigraphy to measure sleep and activity, assessing mental effectiveness, exploiting strategic sleep opportunities, and consuming caffeine at recommended doses to reduce fatigue during periods of loss. Together, these efforts may decrease the impact of sleep loss on mission and performance. 2016.
Optimal Dynamic Advertising Strategy Under Age-Specific Market Segmentation
Krastev, Vladimir
2011-12-01
We consider the model proposed by Faggian and Grosset for determining the advertising efforts and goodwill in the long run of a company under age segmentation of consumers. Reducing this model to optimal control sub problems we find the optimal advertising strategy and goodwill.
A strategy for optimizing item-pool management
Ariel, A.; van der Linden, Willem J.; Veldkamp, Bernard P.
2006-01-01
Item-pool management requires a balancing act between the input of new items into the pool and the output of tests assembled from it. A strategy for optimizing item-pool management is presented that is based on the idea of a periodic update of an optimal blueprint for the item pool to tune item
R. A. Swief; T. S. Abdel-Salam; Noha H. El-Amary
2018-01-01
This paper presents an efficient Cuckoo Search Optimization technique to improve the reliability of electrical power systems. Various reliability objective indices such as Energy Not Supplied, System Average Interruption Frequency Index, System Average Interruption, and Duration Index are the main indices indicating reliability. The Cuckoo Search Optimization (CSO) technique is applied to optimally place the protection devices, install the distributed generators, and to determine the size of ...
Optimal processing for gel electrophoresis images: Applying Monte Carlo Tree Search in GelApp.
Nguyen, Phi-Vu; Ghezal, Ali; Hsueh, Ya-Chih; Boudier, Thomas; Gan, Samuel Ken-En; Lee, Hwee Kuan
2016-08-01
In biomedical research, gel band size estimation in electrophoresis analysis is a routine process. To facilitate and automate this process, numerous software have been released, notably the GelApp mobile app. However, the band detection accuracy is limited due to a band detection algorithm that cannot adapt to the variations in input images. To address this, we used the Monte Carlo Tree Search with Upper Confidence Bound (MCTS-UCB) method to efficiently search for optimal image processing pipelines for the band detection task, thereby improving the segmentation algorithm. Incorporating this into GelApp, we report a significant enhancement of gel band detection accuracy by 55.9 ± 2.0% for protein polyacrylamide gels, and 35.9 ± 2.5% for DNA SYBR green agarose gels. This implementation is a proof-of-concept in demonstrating MCTS-UCB as a strategy to optimize general image segmentation. The improved version of GelApp-GelApp 2.0-is freely available on both Google Play Store (for Android platform), and Apple App Store (for iOS platform). © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Improving Search Strategies of Auditors – A Focus Group on Reflection Interventions
Fessl, Angela; Pammer, Viktoria; Wiese, Michael; Thalmann, Stefan
2017-01-01
Financial auditors routinely search internal as well as public knowledge bases as part of the auditing process. Efficient search strategies are crucial for knowledge workers in general and for auditors in particular. Modern search technology quickly evolves; and features beyond keyword search like fac-etted search or visual overview of knowledge bases like graph visualisations emerge. It is therefore desirable for auditors to learn about new innovations and to explore and experiment with such...
International Nuclear Information System (INIS)
Zhang, Zili; Gao, Chao; Liu, Yuxin; Qian, Tao
2014-01-01
Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP. (paper)
Directory of Open Access Journals (Sweden)
Zhaoyu Chen
2018-01-01
Full Text Available The network planning is a key factor that directly affects the performance of the wireless networks. Distributed antenna system (DAS is an effective strategy for the network planning. This paper investigates the antenna deployment in a DAS for the high-speed railway communication networks and formulates an optimization problem which is NP-hard for achieving the optimal deployment of the antennas in the DAS. To solve this problem, a scheme based on an improved cuckoo search based on dimension cells (ICSDC algorithm is proposed. ICSDC introduces the dimension cell mechanism to avoid the internal dimension interferences in order to improve the performance of the algorithm. Simulation results show that the proposed ICSDC-based scheme obtains a lower network cost compared with the uniform network planning method. Moreover, ICSDC algorithm has better performance in terms of the convergence rate and accuracy compared with the conventional cuckoo search algorithm, the particle swarm optimization, and the firefly algorithm.
Russell-Rose, Tony; Chamberlain, Jon
2017-10-02
Healthcare information professionals play a key role in closing the knowledge gap between medical research and clinical practice. Their work involves meticulous searching of literature databases using complex search strategies that can consist of hundreds of keywords, operators, and ontology terms. This process is prone to error and can lead to inefficiency and bias if performed incorrectly. The aim of this study was to investigate the search behavior of healthcare information professionals, uncovering their needs, goals, and requirements for information retrieval systems. A survey was distributed to healthcare information professionals via professional association email discussion lists. It investigated the search tasks they undertake, their techniques for search strategy formulation, their approaches to evaluating search results, and their preferred functionality for searching library-style databases. The popular literature search system PubMed was then evaluated to determine the extent to which their needs were met. The 107 respondents indicated that their information retrieval process relied on the use of complex, repeatable, and transparent search strategies. On average it took 60 minutes to formulate a search strategy, with a search task taking 4 hours and consisting of 15 strategy lines. Respondents reviewed a median of 175 results per search task, far more than they would ideally like (100). The most desired features of a search system were merging search queries and combining search results. Healthcare information professionals routinely address some of the most challenging information retrieval problems of any profession. However, their needs are not fully supported by current literature search systems and there is demand for improved functionality, in particular regarding the development and management of search strategies. ©Tony Russell-Rose, Jon Chamberlain. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 02.10.2017.
Blackjack in Holland Casino's : Basic, optimal and winning strategies
van der Genugten, B.B.
1995-01-01
This paper considers the cardgame Blackjack according to the rules of Holland Casino's in the Netherlands. Expected gains of strategies are derived with simulation and also with analytic tools. New effiency concepts based on the gains of the basic and the optimal strategy are introduced. A general
Optimal search filters for renal information in EMBASE.
Iansavichus, Arthur V; Haynes, R Brian; Shariff, Salimah Z; Weir, Matthew; Wilczynski, Nancy L; McKibbon, Ann; Rehman, Faisal; Garg, Amit X
2010-07-01
EMBASE is a popular database used to retrieve biomedical information. Our objective was to develop and test search filters to help clinicians and researchers efficiently retrieve articles with renal information in EMBASE. We used a diagnostic test assessment framework because filters operate similarly to screening tests. We divided a sample of 5,302 articles from 39 journals into development and validation sets of articles. Information retrieval properties were assessed by treating each search filter as a "diagnostic test" or screening procedure for the detection of relevant articles. We tested the performance of 1,936,799 search filters made of unique renal terms and their combinations. REFERENCE STANDARD & OUTCOME: The reference standard was manual review of each article. We calculated the sensitivity and specificity of each filter to identify articles with renal information. The best renal filters consisted of multiple search terms, such as "renal replacement therapy," "renal," "kidney disease," and "proteinuria," and the truncated terms "kidney," "dialy," "neph," "glomerul," and "hemodial." These filters achieved peak sensitivities of 98.7% (95% CI, 97.9-99.6) and specificities of 98.5% (95% CI, 98.0-99.0). The retrieval performance of these filters remained excellent in the validation set of independent articles. The retrieval performance of any search will vary depending on the quality of all search concepts used, not just renal terms. We empirically developed and validated high-performance renal search filters for EMBASE. These filters can be programmed into the search engine or used on their own to improve the efficiency of searching.
A new inertia weight control strategy for particle swarm optimization
Zhu, Xianming; Wang, Hongbo
2018-04-01
Particle Swarm Optimization is a member of swarm intelligence algorithms, which is inspired by the behavior of bird flocks. The inertia weight, one of the most important parameters of PSO, is crucial for PSO, for it balances the performance of exploration and exploitation of the algorithm. This paper proposes a new inertia weight control strategy and PSO with this new strategy is tested by four benchmark functions. The results shows that the new strategy provides the PSO with better performance.
A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems
Directory of Open Access Journals (Sweden)
Leilei Cao
2016-01-01
Full Text Available A Guiding Evolutionary Algorithm (GEA with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.
Noise-dependent optimal strategies for quantum metrology
Huang, Zixin; Macchiavello, Chiara; Maccone, Lorenzo
2018-03-01
For phase estimation using qubits, we show that for some noise channels, the optimal entanglement-assisted strategy depends on the noise level. We note that there is a nontrivial crossover between the parallel-entangled strategy and the ancilla-assisted strategy: in the former the probes are all entangled; in the latter the probes are entangled with a noiseless ancilla but not among themselves. The transition can be explained by the fact that separable states are more robust against noise and therefore are optimal in the high-noise limit, but they are in turn outperformed by ancilla-assisted ones.
Wang, Bo; Tian, Kuo; Zhao, Haixin; Hao, Peng; Zhu, Tianyu; Zhang, Ke; Ma, Yunlong
2017-06-01
In order to improve the post-buckling optimization efficiency of hierarchical stiffened shells, a multilevel optimization framework accelerated by adaptive equivalent strategy is presented in this paper. Firstly, the Numerical-based Smeared Stiffener Method (NSSM) for hierarchical stiffened shells is derived by means of the numerical implementation of asymptotic homogenization (NIAH) method. Based on the NSSM, a reasonable adaptive equivalent strategy for hierarchical stiffened shells is developed from the concept of hierarchy reduction. Its core idea is to self-adaptively decide which hierarchy of the structure should be equivalent according to the critical buckling mode rapidly predicted by NSSM. Compared with the detailed model, the high prediction accuracy and efficiency of the proposed model is highlighted. On the basis of this adaptive equivalent model, a multilevel optimization framework is then established by decomposing the complex entire optimization process into major-stiffener-level and minor-stiffener-level sub-optimizations, during which Fixed Point Iteration (FPI) is employed to accelerate convergence. Finally, the illustrative examples of the multilevel framework is carried out to demonstrate its efficiency and effectiveness to search for the global optimum result by contrast with the single-level optimization method. Remarkably, the high efficiency and flexibility of the adaptive equivalent strategy is indicated by compared with the single equivalent strategy.
Simulation to Support Local Search in Trajectory Optimization Planning
Morris, Robert A.; Venable, K. Brent; Lindsey, James
2012-01-01
NASA and the international community are investing in the development of a commercial transportation infrastructure that includes the increased use of rotorcraft, specifically helicopters and civil tilt rotors. However, there is significant concern over the impact of noise on the communities surrounding the transportation facilities. One way to address the rotorcraft noise problem is by exploiting powerful search techniques coming from artificial intelligence coupled with simulation and field tests to design low-noise flight profiles which can be tested in simulation or through field tests. This paper investigates the use of simulation based on predictive physical models to facilitate the search for low-noise trajectories using a class of automated search algorithms called local search. A novel feature of this approach is the ability to incorporate constraints directly into the problem formulation that addresses passenger safety and comfort.
A modified harmony search based method for optimal rural radial ...
African Journals Online (AJOL)
International Journal of Engineering, Science and Technology. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 2, No 3 (2010) >. Log in or Register to get access to full text downloads.
Optimal Inspection and Maintenance Strategies for Structural Systems
DEFF Research Database (Denmark)
Sommer, A. M.
The aim of this thesis is to give an overview of conventional and optimal reliability-based inspection and maintenance strategies and to examine for specific structures how the cost can be reduced and/or the safety can be improved by using optimal reliability-based inspection strategies....... For structures with several almost similar components it is suggested that individual inspection strategies should be determined for each component or a group of components based on the reliability of the actual component. The benefit of this procedure is assessed in connection with the structures considered....... Furthermore, in relation to the calculations performed the intention is to modify an existing program for determination of optimal inspection strategies. The main purpose of inspection and maintenance of structural systems is to prevent or delay damage or deterioration to protect people, environment...
Directory of Open Access Journals (Sweden)
Müller Kai F
2005-10-01
Full Text Available Abstract Background For parsimony analyses, the most common way to estimate confidence is by resampling plans (nonparametric bootstrap, jackknife, and Bremer support (Decay indices. The recent literature reveals that parameter settings that are quite commonly employed are not those that are recommended by theoretical considerations and by previous empirical studies. The optimal search strategy to be applied during resampling was previously addressed solely via standard search strategies available in PAUP*. The question of a compromise between search extensiveness and improved support accuracy for Bremer support received even less attention. A set of experiments was conducted on different datasets to find an empirical cut-off point at which increased search extensiveness does not significantly change Bremer support and jackknife or bootstrap proportions any more. Results For the number of replicates needed for accurate estimates of support in resampling plans, a diagram is provided that helps to address the question whether apparently different support values really differ significantly. It is shown that the use of random addition cycles and parsimony ratchet iterations during bootstrapping does not translate into higher support, nor does any extension of the search extensiveness beyond the rather moderate effort of TBR (tree bisection and reconnection branch swapping plus saving one tree per replicate. Instead, in case of very large matrices, saving more than one shortest tree per iteration and using a strict consensus tree of these yields decreased support compared to saving only one tree. This can be interpreted as a small risk of overestimating support but should be more than compensated by other factors that counteract an enhanced type I error. With regard to Bremer support, a rule of thumb can be derived stating that not much is gained relative to the surplus computational effort when searches are extended beyond 20 ratchet iterations per
Optimizing Search and Ranking in Folksonomy Systems by Exploiting Context Information
Abel, Fabian; Henze, Nicola; Krause, Daniel
Tagging systems enable users to annotate resources with freely chosen keywords. The evolving bunch of tag assignments is called folksonomy and there exist already some approaches that exploit folksonomies to improve resource retrieval. In this paper, we analyze and compare graph-based ranking algorithms: FolkRank and SocialPageRank. We enhance these algorithms by exploiting the context of tags, and evaluate the results on the GroupMe! dataset. In GroupMe!, users can organize and maintain arbitrary Web resources in self-defined groups. When users annotate resources in GroupMe!, this can be interpreted in context of a certain group. The grouping activity itself is easy for users to perform. However, it delivers valuable semantic information about resources and their context. We present GRank that uses the context information to improve and optimize the detection of relevant search results, and compare different strategies for ranking result lists in folksonomy systems.
Directory of Open Access Journals (Sweden)
Saifullah Khalid
2016-09-01
Full Text Available Three conventional control constant instantaneous power control, sinusoidal current control, and synchronous reference frame techniques for extracting reference currents for shunt active power filters have been optimized using Fuzzy Logic control and Adaptive Tabu search Algorithm and their performances have been compared. Critical analysis of Comparison of the compensation ability of different control strategies based on THD and speed will be done, and suggestions will be given for the selection of technique to be used. The simulated results using MATLAB model are presented, and they will clearly prove the value of the proposed control method of aircraft shunt APF. The waveforms observed after the application of filter will be having the harmonics within the limits and the power quality will be improved.
Testing search strategies for systematic reviews in the Medline literature database through PubMed.
Volpato, Enilze S N; Betini, Marluci; El Dib, Regina
2014-04-01
A high-quality electronic search is essential in ensuring accuracy and completeness in retrieved records for the conducting of a systematic review. We analysed the available sample of search strategies to identify the best method for searching in Medline through PubMed, considering the use or not of parenthesis, double quotation marks, truncation and use of a simple search or search history. In our cross-sectional study of search strategies, we selected and analysed the available searches performed during evidence-based medicine classes and in systematic reviews conducted in the Botucatu Medical School, UNESP, Brazil. We analysed 120 search strategies. With regard to the use of phrase searches with parenthesis, there was no difference between the results with and without parenthesis and simple searches or search history tools in 100% of the sample analysed (P = 1.0). The number of results retrieved by the searches analysed was smaller using double quotations marks and using truncation compared with the standard strategy (P = 0.04 and P = 0.08, respectively). There is no need to use phrase-searching parenthesis to retrieve studies; however, we recommend the use of double quotation marks when an investigator attempts to retrieve articles in which a term appears to be exactly the same as what was proposed in the search form. Furthermore, we do not recommend the use of truncation in search strategies in the Medline via PubMed. Although the results of simple searches or search history tools were the same, we recommend using the latter.
Directory of Open Access Journals (Sweden)
Hailong Wang
2018-01-01
Full Text Available The backtracking search optimization algorithm (BSA is a population-based evolutionary algorithm for numerical optimization problems. BSA has a powerful global exploration capacity while its local exploitation capability is relatively poor. This affects the convergence speed of the algorithm. In this paper, we propose a modified BSA inspired by simulated annealing (BSAISA to overcome the deficiency of BSA. In the BSAISA, the amplitude control factor (F is modified based on the Metropolis criterion in simulated annealing. The redesigned F could be adaptively decreased as the number of iterations increases and it does not introduce extra parameters. A self-adaptive ε-constrained method is used to handle the strict constraints. We compared the performance of the proposed BSAISA with BSA and other well-known algorithms when solving thirteen constrained benchmarks and five engineering design problems. The simulation results demonstrated that BSAISA is more effective than BSA and more competitive with other well-known algorithms in terms of convergence speed.
System modelling and online optimal management of MicroGrid using Mesh Adaptive Direct Search
Energy Technology Data Exchange (ETDEWEB)
Mohamed, Faisal A. [Department of Electrical Engineering, Omar Al-Mukhtar University, P.O. Box 919, El-Bieda (Libya); Koivo, Heikki N. [Department of Automation and Systems Technology, Helsinki University of Technology, P.O. Box 5500, FIN-02015 HUT (Finland)
2010-06-15
This paper presents a generalized formulation to determine the optimal operating strategy and cost optimization scheme for a MicroGrid. Prior to the optimization of the MicroGrid itself, models for the system components are determined using real data. The proposed cost function takes into consideration the costs of the emissions, NO{sub x}, SO{sub 2}, and CO{sub 2}, start-up costs, as well as the operation and maintenance costs. A daily income and outgo from sold or purchased power is also added. The MicroGrid considered in this paper consists of a wind turbine, a micro turbine, a diesel generator, a photovoltaic array, a fuel cell, and a battery storage. In this work, the Mesh Adaptive Direct Search (MADS) algorithm is used to minimize the cost function of the system while constraining it to meet the customer demand and safety of the system. In comparison with previously proposed techniques, a significant reduction is obtained. (author)
Directory of Open Access Journals (Sweden)
Yuliang Su
2015-04-01
Full Text Available A turning machine tool is a kind of new type of machine tool that is equipped with more than one spindle and turret. The distinctive simultaneous and parallel processing abilities of turning machine tool increase the complexity of process planning. The operations would not only be sequenced and satisfy precedence constraints, but also should be scheduled with multiple objectives such as minimizing machining cost, maximizing utilization of turning machine tool, and so on. To solve this problem, a hybrid genetic algorithm was proposed to generate optimal process plans based on a mixed 0-1 integer programming model. An operation precedence graph is used to represent precedence constraints and help generate a feasible initial population of hybrid genetic algorithm. Encoding strategy based on data structure was developed to represent process plans digitally in order to form the solution space. In addition, a local search approach for optimizing the assignments of available turrets would be added to incorporate scheduling with process planning. A real-world case is used to prove that the proposed approach could avoid infeasible solutions and effectively generate a global optimal process plan.
The development of PubMed search strategies for patient preferences for treatment outcomes
Directory of Open Access Journals (Sweden)
Ralph van Hoorn
2016-07-01
Full Text Available Abstract Background The importance of respecting patients’ preferences when making treatment decisions is increasingly recognized. Efficiently retrieving papers from the scientific literature reporting on the presence and nature of such preferences can help to achieve this goal. The objective of this study was to create a search filter for PubMed to help retrieve evidence on patient preferences for treatment outcomes. Methods A total of 27 journals were hand-searched for articles on patient preferences for treatment outcomes published in 2011. Selected articles served as a reference set. To develop optimal search strategies to retrieve this set, all articles in the reference set were randomly split into a development and a validation set. MeSH-terms and keywords retrieved using PubReMiner were tested individually and as combinations in PubMed and evaluated for retrieval performance (e.g. sensitivity (Se and specificity (Sp. Results Of 8238 articles, 22 were considered to report empirical evidence on patient preferences for specific treatment outcomes. The best search filters reached Se of 100 % [95 % CI 100-100] with Sp of 95 % [94–95 %] and Sp of 97 % [97–98 %] with 75 % Se [74–76 %]. In the validation set these queries reached values of Se of 90 % [89–91 %] with Sp 94 % [93–95 %] and Se of 80 % [79–81 %] with Sp of 97 % [96–96 %], respectively. Conclusions Narrow and broad search queries were developed which can help in retrieving literature on patient preferences for treatment outcomes. Identifying such evidence may in turn enhance the incorporation of patient preferences in clinical decision making and health technology assessment.
The development of PubMed search strategies for patient preferences for treatment outcomes.
van Hoorn, Ralph; Kievit, Wietske; Booth, Andrew; Mozygemba, Kati; Lysdahl, Kristin Bakke; Refolo, Pietro; Sacchini, Dario; Gerhardus, Ansgar; van der Wilt, Gert Jan; Tummers, Marcia
2016-07-29
The importance of respecting patients' preferences when making treatment decisions is increasingly recognized. Efficiently retrieving papers from the scientific literature reporting on the presence and nature of such preferences can help to achieve this goal. The objective of this study was to create a search filter for PubMed to help retrieve evidence on patient preferences for treatment outcomes. A total of 27 journals were hand-searched for articles on patient preferences for treatment outcomes published in 2011. Selected articles served as a reference set. To develop optimal search strategies to retrieve this set, all articles in the reference set were randomly split into a development and a validation set. MeSH-terms and keywords retrieved using PubReMiner were tested individually and as combinations in PubMed and evaluated for retrieval performance (e.g. sensitivity (Se) and specificity (Sp)). Of 8238 articles, 22 were considered to report empirical evidence on patient preferences for specific treatment outcomes. The best search filters reached Se of 100 % [95 % CI 100-100] with Sp of 95 % [94-95 %] and Sp of 97 % [97-98 %] with 75 % Se [74-76 %]. In the validation set these queries reached values of Se of 90 % [89-91 %] with Sp 94 % [93-95 %] and Se of 80 % [79-81 %] with Sp of 97 % [96-96 %], respectively. Narrow and broad search queries were developed which can help in retrieving literature on patient preferences for treatment outcomes. Identifying such evidence may in turn enhance the incorporation of patient preferences in clinical decision making and health technology assessment.
A proposal of optimal sampling design using a modularity strategy
Simone, A.; Giustolisi, O.; Laucelli, D. B.
2016-08-01
In real water distribution networks (WDNs) are present thousands nodes and optimal placement of pressure and flow observations is a relevant issue for different management tasks. The planning of pressure observations in terms of spatial distribution and number is named sampling design and it was faced considering model calibration. Nowadays, the design of system monitoring is a relevant issue for water utilities e.g., in order to manage background leakages, to detect anomalies and bursts, to guarantee service quality, etc. In recent years, the optimal location of flow observations related to design of optimal district metering areas (DMAs) and leakage management purposes has been faced considering optimal network segmentation and the modularity index using a multiobjective strategy. Optimal network segmentation is the basis to identify network modules by means of optimal conceptual cuts, which are the candidate locations of closed gates or flow meters creating the DMAs. Starting from the WDN-oriented modularity index, as a metric for WDN segmentation, this paper proposes a new way to perform the sampling design, i.e., the optimal location of pressure meters, using newly developed sampling-oriented modularity index. The strategy optimizes the pressure monitoring system mainly based on network topology and weights assigned to pipes according to the specific technical tasks. A multiobjective optimization minimizes the cost of pressure meters while maximizing the sampling-oriented modularity index. The methodology is presented and discussed using the Apulian and Exnet networks.
Optimal reactor strategy for commercializing fast breeder reactors
International Nuclear Information System (INIS)
Yamaji, Kenji; Nagano, Koji
1988-01-01
In this paper, a fuel cycle optimization model developed for analyzing the condition of selecting fast breeder reactors in the optimal reactor strategy is described. By dividing the period of planning, 1966-2055, into nine ten-year periods, the model was formulated as a compact linear programming model. With the model, the best mix of reactor types as well as the optimal timing of reprocessing spent fuel from LWRs to minimize the total cost were found. The results of the analysis are summarized as follows. Fast breeder reactors could be introduced in the optimal strategy when they can economically compete with LWRs with 30 year storage of spent fuel. In order that fast breeder reactors monopolize the new reactor market after the achievement of their technical availability, their capital cost should be less than 0.9 times as much as that of LWRs. When a certain amount of reprocessing commitment is assumed, the condition of employing fast breeder reactors in the optimal strategy is mitigated. In the optimal strategy, reprocessing is done just to meet plutonium demand, and the storage of spent fuel is selected to adjust the mismatch of plutonium production and utilization. The price hike of uranium ore facilitates the commercial adoption of fast breeder reactors. (Kako, I.)
Design of Underwater Robot Lines Based on a Hybrid Automatic Optimization Strategy
Institute of Scientific and Technical Information of China (English)
Wenjing Lyu; Weilin Luo
2014-01-01
In this paper, a hybrid automatic optimization strategy is proposed for the design of underwater robot lines. Isight is introduced as an integration platform. The construction of this platform is based on the user programming and several commercial software including UG6.0, GAMBIT2.4.6 and FLUENT12.0. An intelligent parameter optimization method, the particle swarm optimization, is incorporated into the platform. To verify the strategy proposed, a simulation is conducted on the underwater robot model 5470, which originates from the DTRC SUBOFF project. With the automatic optimization platform, the minimal resistance is taken as the optimization goal;the wet surface area as the constraint condition; the length of the fore-body, maximum body radius and after-body’s minimum radius as the design variables. With the CFD calculation, the RANS equations and the standard turbulence model are used for direct numerical simulation. By analyses of the simulation results, it is concluded that the platform is of high efficiency and feasibility. Through the platform, a variety of schemes for the design of the lines are generated and the optimal solution is achieved. The combination of the intelligent optimization algorithm and the numerical simulation ensures a global optimal solution and improves the efficiency of the searching solutions.
Optimal Portfolio Strategy under Rolling Economic Maximum Drawdown Constraints
Directory of Open Access Journals (Sweden)
Xiaojian Yu
2014-01-01
Full Text Available This paper deals with the problem of optimal portfolio strategy under the constraints of rolling economic maximum drawdown. A more practical strategy is developed by using rolling Sharpe ratio in computing the allocation proportion in contrast to existing models. Besides, another novel strategy named “REDP strategy” is further proposed, which replaces the rolling economic drawdown of the portfolio with the rolling economic drawdown of the risky asset. The simulation tests prove that REDP strategy can ensure the portfolio to satisfy the drawdown constraint and outperforms other strategies significantly. An empirical comparison research on the performances of different strategies is carried out by using the 23-year monthly data of SPTR, DJUBS, and 3-month T-bill. The investment cases of single risky asset and two risky assets are both studied in this paper. Empirical results indicate that the REDP strategy successfully controls the maximum drawdown within the given limit and performs best in both return and risk.
TOWARDS ACTIVE SEO (SEARCH ENGINE OPTIMIZATION 2.0
Directory of Open Access Journals (Sweden)
Charles-Victor Boutet
2012-12-01
Full Text Available In the age of writable web, new skills and new practices are appearing. In an environment that allows everyone to communicate information globally, internet referencing (or SEO is a strategic discipline that aims to generate visibility, internet traffic and a maximum exploitation of sites publications. Often misperceived as a fraud, SEO has evolved to be a facilitating tool for anyone who wishes to reference their website with search engines. In this article we show that it is possible to achieve the first rank in search results of keywords that are very competitive. We show methods that are quick, sustainable and legal; while applying the principles of active SEO 2.0. This article also clarifies some working functions of search engines, some advanced referencing techniques (that are completely ethical and legal and we lay the foundations for an in depth reflection on the qualities and advantages of these techniques.
ERRATUM: TOWARDS ACTIVE SEO (SEARCH ENGINE OPTIMIZATION 2.0
Directory of Open Access Journals (Sweden)
Charles-Victor Boutet
2013-04-01
Full Text Available In the age of writable web, new skills and new practices are appearing. In an environment that allows everyone to communicate information globally, internet referencing (or SEO is a strategic discipline that aims to generate visibility, internet traffic and a maximum exploitation of sites publications. Often misperceived as a fraud, SEO has evolved to be a facilitating tool for anyone who wishes to reference their website with search engines. In this article we show that it is possible to achieve the first rank in search results of keywords that are very competitive. We show methods that are quick, sustainable and legal; while applying the principles of active SEO 2.0. This article also clarifies some working functions of search engines, some advanced referencing techniques (that are completely ethical and legal and we lay the foundations for an in depth reflection on the qualities and advantages of these techniques.
Optimal random search for a single hidden target.
Snider, Joseph
2011-01-01
A single target is hidden at a location chosen from a predetermined probability distribution. Then, a searcher must find a second probability distribution from which random search points are sampled such that the target is found in the minimum number of trials. Here it will be shown that if the searcher must get very close to the target to find it, then the best search distribution is proportional to the square root of the target distribution regardless of dimension. For a Gaussian target distribution, the optimum search distribution is approximately a Gaussian with a standard deviation that varies inversely with how close the searcher must be to the target to find it. For a network where the searcher randomly samples nodes and looks for the fixed target along edges, the optimum is either to sample a node with probability proportional to the square root of the out-degree plus 1 or not to do so at all.
Boluyt, Nicole; Tjosvold, Lisa; Lefebvre, Carol; Klassen, Terry P.; Offringa, Martin
2008-01-01
OBJECTIVE: To determine the sensitivity and precision of existing search strategies for retrieving child health systematic reviews in MEDLINE using PubMed. DESIGN: Filter (diagnostic) accuracy study. We identified existing search strategies for systematic reviews, combined them with a filter that
Search Trees with Relaxed Balance and Near-Optimal Height
DEFF Research Database (Denmark)
Fagerberg, Rolf; Jensen, Rune E.; Larsen, Kim Skak
2001-01-01
We introduce a relaxed k-tree, a search tree with relaxed balance and a height bound, when in balance, of (1+epsilon)log_2 n + 1, for any epsilon > 0. The number of nodes involved in rebalancing is O(1/epsilon) per update in the amortized sense, and O(log n/epsilon) in the worst case sense. This ...... constant rebalancing, which is an improvement over the current definition. World Wide Web search engines are possible applications for this line of work....
Applying the Taguchi method to river water pollution remediation strategy optimization.
Yang, Tsung-Ming; Hsu, Nien-Sheng; Chiu, Chih-Chiang; Wang, Hsin-Ju
2014-04-15
Optimization methods usually obtain the travel direction of the solution by substituting the solutions into the objective function. However, if the solution space is too large, this search method may be time consuming. In order to address this problem, this study incorporated the Taguchi method into the solution space search process of the optimization method, and used the characteristics of the Taguchi method to sequence the effects of the variation of decision variables on the system. Based on the level of effect, this study determined the impact factor of decision variables and the optimal solution for the model. The integration of the Taguchi method and the solution optimization method successfully obtained the optimal solution of the optimization problem, while significantly reducing the solution computing time and enhancing the river water quality. The results suggested that the basin with the greatest water quality improvement effectiveness is the Dahan River. Under the optimal strategy of this study, the severe pollution length was reduced from 18 km to 5 km.
Applying the Taguchi Method to River Water Pollution Remediation Strategy Optimization
Directory of Open Access Journals (Sweden)
Tsung-Ming Yang
2014-04-01
Full Text Available Optimization methods usually obtain the travel direction of the solution by substituting the solutions into the objective function. However, if the solution space is too large, this search method may be time consuming. In order to address this problem, this study incorporated the Taguchi method into the solution space search process of the optimization method, and used the characteristics of the Taguchi method to sequence the effects of the variation of decision variables on the system. Based on the level of effect, this study determined the impact factor of decision variables and the optimal solution for the model. The integration of the Taguchi method and the solution optimization method successfully obtained the optimal solution of the optimization problem, while significantly reducing the solution computing time and enhancing the river water quality. The results suggested that the basin with the greatest water quality improvement effectiveness is the Dahan River. Under the optimal strategy of this study, the severe pollution length was reduced from 18 km to 5 km.
Optimal Finger Search Trees in the Pointer Machine
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Lagogiannis, George; Makris, Christos
2003-01-01
We develop a new finger search tree with worst-case constant update time in the Pointer Machine (PM) model of computation. This was a major problem in the field of Data Structures and was tantalizingly open for over twenty years while many attempts by researchers were made to solve it. The result...
Optimization of Transformation Coefficients Using Direct Search and Swarm Intelligence
Directory of Open Access Journals (Sweden)
Manusov V.Z.
2017-04-01
Full Text Available This research considers optimization of tap position of transformers in power systems to reduce power losses. Now, methods based on heuristic rules and fuzzy logic, or methods that optimize parts of the whole system separately, are applied to this problem. The first approach requires expert knowledge about processes in the network. The second methods are not able to consider all the interrelations of system’s parts, while changes in segment affect the entire system. Both approaches are tough to implement and require adjustment to the tasks solved. It needs to implement algorithms that can take into account complex interrelations of optimized variables and self-adapt to optimization task. It is advisable to use algorithms given complex interrelations of optimized variables and independently adapting from optimization tasks. Such algorithms include Swarm Intelligence algorithms. Their main features are self-organization, which allows them to automatically adapt to conditions of tasks, and the ability to efficiently exit from local extremes. Thus, they do not require specialized knowledge of the system, in contrast to fuzzy logic. In addition, they can efficiently find quasi-optimal solutions converging to the global optimum. This research applies Particle Swarm Optimization algorithm (PSO. The model of Tajik power system used in experiments. It was found out that PSO is much more efficient than greedy heuristics and more flexible and easier to use than fuzzy logic. PSO allows reducing active power losses from 48.01 to 45.83 MW (4.5%. With al, the effect of using greedy heuristics or fuzzy logic is two times smaller (2.3%.
Optimal generator bidding strategies for power and ancillary services
Morinec, Allen G.
As the electric power industry transitions to a deregulated market, power transactions are made upon price rather than cost. Generator companies are interested in maximizing their profits rather than overall system efficiency. A method to equitably compensate generation providers for real power, and ancillary services such as reactive power and spinning reserve, will ensure a competitive market with an adequate number of suppliers. Optimizing the generation product mix during bidding is necessary to maximize a generator company's profits. The objective of this research work is to determine and formulate appropriate optimal bidding strategies for a generation company in both the energy and ancillary services markets. These strategies should incorporate the capability curves of their generators as constraints to define the optimal product mix and price offered in the day-ahead and real time spot markets. In order to achieve such a goal, a two-player model was composed to simulate market auctions for power generation. A dynamic game methodology was developed to identify Nash Equilibria and Mixed-Strategy Nash Equilibria solutions as optimal generation bidding strategies for two-player non-cooperative variable-sum matrix games with incomplete information. These games integrated the generation product mix of real power, reactive power, and spinning reserve with the generators's capability curves as constraints. The research includes simulations of market auctions, where strategies were tested for generators with different unit constraints, costs, types of competitors, strategies, and demand levels. Studies on the capability of large hydrogen cooled synchronous generators were utilized to derive useful equations that define the exact shape of the capability curve from the intersections of the arcs defined by the centers and radial vectors of the rotor, stator, and steady-state stability limits. The available reactive reserve and spinning reserve were calculated given a
Search Engine Optimization for Flash Best Practices for Using Flash on the Web
Perkins, Todd
2009-01-01
Search Engine Optimization for Flash dispels the myth that Flash-based websites won't show up in a web search by demonstrating exactly what you can do to make your site fully searchable -- no matter how much Flash it contains. You'll learn best practices for using HTML, CSS and JavaScript, as well as SWFObject, for building sites with Flash that will stand tall in search rankings.
Application of optimal interation strategies to diffusion theory calculations
International Nuclear Information System (INIS)
Jones, R.B.
1978-01-01
The geometric interpretation of optimal (minimum computational time) iteration strategies is applied to one- and two-group, two-dimensional diffusion-theory calculations. The method is a ''spectral/time balance'' technique which weighs the convergence enhancement of the inner iteration procedure with that of the outer iteration loop and the time required to reconstruct the source. The diffusion-theory option of the discrete-ordinates transport code DOT3.5 was altered to incorporate the theoretical inner/outer decision logic. For the two-dimensional configuration considered, the optimal strategies reduced the total number of iterations performed for a given error criterion
Rahman, Imran; Vasant, Pandian M.; Singh, Balbir Singh Mahinder; Abdullah-Al-Wadud, M.
2014-10-01
Recent researches towards the use of green technologies to reduce pollution and increase penetration of renewable energy sources in the transportation sector are gaining popularity. The development of the smart grid environment focusing on PHEVs may also heal some of the prevailing grid problems by enabling the implementation of Vehicle-to-Grid (V2G) concept. Intelligent energy management is an important issue which has already drawn much attention to researchers. Most of these works require formulation of mathematical models which extensively use computational intelligence-based optimization techniques to solve many technical problems. Higher penetration of PHEVs require adequate charging infrastructure as well as smart charging strategies. We used Gravitational Search Algorithm (GSA) to intelligently allocate energy to the PHEVs considering constraints such as energy price, remaining battery capacity, and remaining charging time.
Mate choice and the evolutionary stability of a fixed threshold in a sequential search strategy
Directory of Open Access Journals (Sweden)
Raymond Cheng
2014-06-01
Full Text Available The sequential search strategy is a prominent model of searcher behavior, derived as a rule by which females might sample and choose a mate from a distribution of prospective partners. The strategy involves a threshold criterion against which prospective mates are evaluated. The optimal threshold depends on the attributes of prospective mates, which are likely to vary across generations or within the lifetime of searchers due to stochastic environmental events. The extent of this variability and the cost to acquire information on the distribution of the quality of prospective mates determine whether a learned or environmentally canalized threshold is likely to be favored. In this paper, we determine conditions on cross-generational perturbations of the distribution of male phenotypes that allow for the evolutionary stability of an environmentally canalized threshold. In particular, we derive conditions under which there is a genetically determined threshold that is optimal over an evolutionary time scale in comparison to any other unlearned threshold. These considerations also reveal a simple algorithm by which the threshold could be learned.
Optimization Under Uncertainty for Wake Steering Strategies: Preprint
Energy Technology Data Exchange (ETDEWEB)
Quick, Julian [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Annoni, Jennifer [National Renewable Energy Laboratory (NREL), Golden, CO (United States); King, Ryan N [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Dykes, Katherine L [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Fleming, Paul A [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Ning, Andrew [Brigham Young University
2017-05-01
Wind turbines in a wind power plant experience significant power losses because of aerodynamic interactions between turbines. One control strategy to reduce these losses is known as 'wake steering,' in which upstream turbines are yawed to direct wakes away from downstream turbines. Previous wake steering research has assumed perfect information, however, there can be significant uncertainty in many aspects of the problem, including wind inflow and various turbine measurements. Uncertainty has significant implications for performance of wake steering strategies. Consequently, the authors formulate and solve an optimization under uncertainty (OUU) problem for finding optimal wake steering strategies in the presence of yaw angle uncertainty. The OUU wake steering strategy is demonstrated on a two-turbine test case and on the utility-scale, offshore Princess Amalia Wind Farm. When we accounted for yaw angle uncertainty in the Princess Amalia Wind Farm case, inflow-direction-specific OUU solutions produced between 0% and 1.4% more power than the deterministically optimized steering strategies, resulting in an overall annual average improvement of 0.2%. More importantly, the deterministic optimization is expected to perform worse and with more downside risk than the OUU result when realistic uncertainty is taken into account. Additionally, the OUU solution produces fewer extreme yaw situations than the deterministic solution.
Wang, Ling; Xu, Huihui; Zhang, Xue; Fang, Ping
2017-08-01
The job search process is a stressful experience. This study investigated the effect of emotion regulation strategies on job search behavior in combination with anxiety and job search self-efficacy among Chinese university fourth-year students (N = 816, mean age = 21.98, 31.5% male, 34.9% majored in science, 18.0% from "211 Project" universities). Results showed that cognitive reappraisal was positively related to job search behavior, while expressive suppression was negatively related to job search behavior. Additionally, anxiety was negatively related to job search behavior, while job search self-efficacy was positively associated with job search behavior. Moreover, both anxiety and job search self-efficacy mediated the relationship between emotion regulation strategies and job search behavior. In general, emotion regulation strategies played an important role in job search behavior. Implications include the notion that emotion regulation interventions may be helpful to increase job search behavior among university students. Copyright © 2017 The Foundation for Professionals in Services for Adolescents. Published by Elsevier Ltd. All rights reserved.
Optimization of boiling water reactor control rod patterns using linear search
International Nuclear Information System (INIS)
Kiguchi, T.; Doi, K.; Fikuzaki, T.; Frogner, B.; Lin, C.; Long, A.B.
1984-01-01
A computer program for searching the optimal control rod pattern has been developed. The program is able to find a control rod pattern where the resulting power distribution is optimal in the sense that it is the closest to the desired power distribution, and it satisfies all operational constraints. The search procedure consists of iterative uses of two steps: sensitivity analyses of local power and thermal margins using a three-dimensional reactor simulator for a simplified prediction model; linear search for the optimal control rod pattern with the simplified model. The optimal control rod pattern is found along the direction where the performance index gradient is the steepest. This program has been verified to find the optimal control rod pattern through simulations using operational data from the Oyster Creek Reactor
Optimal football strategies: AC Milan versus FC Barcelona
Papahristodoulou, Christos
2012-01-01
In a recent UEFA Champions League game between AC Milan and FC Barcelona, played in Italy (final score 2-3), the collected match statistics, classified into four offensive and two defensive strategies, were in favour of FC Barcelona (by 13 versus 8 points). The aim of this paper is to examine to what extent the optimal game strategies derived from some deterministic, possibilistic, stochastic and fuzzy LP models would improve the payoff of AC Milan at the cost of FC Barcelona.
Search strategies for top partners in composite Higgs models
Gripaios, Ben; Müller, Thibaut; Parker, M. A.; Sutherland, Dave
2014-08-01
We consider how best to search for top partners in generic composite Higgs models. We begin by classifying the possible group representations carried by top partners in models with and without a custodial SU(2) × SU(2) ⋊ 2 symmetry protecting the rate for Z → decays. We identify a number of minimal models whose top partners only have electric charges of , , or and thus decay to top or bottom quarks via a single Higgs or electroweak gauge boson. We develop an inclusive search for these based on a top veto, which we find to be more effective than existing searches. Less minimal models feature light states that can be sought in final states with like-sign leptons and so we find that 2 straightforward LHC searches give a reasonable coverage of the gamut of composite Higgs models.
Social Optimization and Pricing Policy in Cognitive Radio Networks with an Energy Saving Strategy
Directory of Open Access Journals (Sweden)
Shunfu Jin
2016-01-01
Full Text Available The rapid growth of wireless application results in an increase in demand for spectrum resource and communication energy. In this paper, we firstly introduce a novel energy saving strategy in cognitive radio networks (CRNs and then propose an appropriate pricing policy for secondary user (SU packets. We analyze the behavior of data packets in a discrete-time single-server priority queue under multiple-vacation discipline. With the help of a Quasi-Birth-Death (QBD process model, we obtain the joint distribution for the number of SU packets and the state of base station (BS via the Matrix-Geometric Solution method. We assess the average latency of SU packets and the energy saving ratio of system. According to a natural reward-cost structure, we study the individually optimal behavior and the socially optimal behavior of the energy saving strategy and use an optimization algorithm based on standard particle swarm optimization (SPSO method to search the socially optimal arrival rate of SU packets. By comparing the individually optimal behavior and the socially optimal behavior, we impose an appropriate admission fee to SU packets. Finally, we present numerical results to show the impacts of system parameters on the system performance and the pricing policy.
Search Frictions, Job Flows and Optimal Monetary Policy
Shoujian Zhang
2014-01-01
Job creation and job destruction are investigated in an economy featured by search frictions in both labour and goods markets. We show that both the unemployment rate and the endogenous job destruction rate increase when the inflation rate rises, because the demand declines due to the increase in the cost of holding money. Our numerical exercises suggest that the destruction of lower productivity jobs and the creation of higher productivity jobs may be inefficiently low under the zero nominal...
Du, Jia Tina; Evans, Nina
2011-01-01
This project investigated how academic users search for information on their real-life research tasks. This article presents the findings of the first of two studies. The study data were collected in the Queensland University of Technology (QUT) in Brisbane, Australia. Eleven PhD students' searching behaviors on personal research topics were…
Optimal decentralized valley-filling charging strategy for electric vehicles
International Nuclear Information System (INIS)
Zhang, Kangkang; Xu, Liangfei; Ouyang, Minggao; Wang, Hewu; Lu, Languang; Li, Jianqiu; Li, Zhe
2014-01-01
Highlights: • An implementable charging strategy is developed for electric vehicles connected to a grid. • A two-dimensional pricing scheme is proposed to coordinate charging behaviors. • The strategy effectively works in decentralized way but achieves the systematic valley filling. • The strategy allows device-level charging autonomy, and does not require a bidirectional communication/control network. • The strategy can self-correct when confronted with adverse factors. - Abstract: Uncoordinated charging load of electric vehicles (EVs) increases the peak load of the power grid, thereby increasing the cost of electricity generation. The valley-filling charging scenario offers a cheaper alternative. This study proposes a novel decentralized valley-filling charging strategy, in which a day-ahead pricing scheme is designed by solving a minimum-cost optimization problem. The pricing scheme can be broadcasted to EV owners, and the individual charging behaviors can be indirectly coordinated. EV owners respond to the pricing scheme by autonomously optimizing their individual charge patterns. This device-level response induces a valley-filling effect in the grid at the system level. The proposed strategy offers three advantages: coordination (by the valley-filling effect), practicality (no requirement for a bidirectional communication/control network between the grid and EV owners), and autonomy (user control of EV charge patterns). The proposed strategy is validated in simulations of typical scenarios in Beijing, China. According to the results, the strategy (1) effectively achieves the valley-filling charging effect at 28% less generation cost than the uncoordinated charging strategy, (2) is robust to several potential affecters of the valley-filling effect, such as (system-level) inaccurate parameter estimation and (device-level) response capability and willingness (which cause less than 2% deviation in the minimal generation cost), and (3) is compatible with
Yang, Dixiong; Liu, Zhenjun; Zhou, Jilei
2014-04-01
Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.
Proximity search heuristics for wind farm optimal layout
DEFF Research Database (Denmark)
Fischetti, Martina; Monaci, Michele
2016-01-01
A heuristic framework for turbine layout optimization in a wind farm is proposed that combines ad-hoc heuristics and mixed-integer linear programming. In our framework, large-scale mixed-integer programming models are used to iteratively refine the current best solution according to the recently...
The Optimal Taxation of UnskilIed Labor with Job Search and Social Assistance
Boone, J.; Bovenberg, A.L.
2002-01-01
In order to explore the optimal taxation of low-skilled labor, we extend the standard model of optimal non-linear income taxation in the presence of quasi-linear preferences in leisure by allowing for involuntary unemployment, job search, an exogenous welfare benefit, and a non-utilitarian social
International Nuclear Information System (INIS)
Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.; Valavi, K.
2013-01-01
Highlights: • SGHS enhanced the convergence rate of LPO using some improvements in comparison to basic HS and GHS. • SGHS optimization algorithm obtained averagely better fitness relative to basic HS and GHS algorithms. • Upshot of the SGHS implementation in the LPO reveals its flexibility, efficiency and reliability. - Abstract: The aim of this work is to apply the new developed optimization algorithm, Self-adaptive Global best Harmony Search (SGHS), for PWRs fuel management optimization. SGHS algorithm has some modifications in comparison with basic Harmony Search (HS) and Global-best Harmony Search (GHS) algorithms such as dynamically change of parameters. For the demonstration of SGHS ability to find an optimal configuration of fuel assemblies, basic Harmony Search (HS) and Global-best Harmony Search (GHS) algorithms also have been developed and investigated. For this purpose, Self-adaptive Global best Harmony Search Nodal Expansion package (SGHSNE) has been developed implementing HS, GHS and SGHS optimization algorithms for the fuel management operation of nuclear reactor cores. This package uses developed average current nodal expansion code which solves the multi group diffusion equation by employment of first and second orders of Nodal Expansion Method (NEM) for two dimensional, hexagonal and rectangular geometries, respectively, by one node per a FA. Loading pattern optimization was performed using SGHSNE package for some test cases to present the SGHS algorithm capability in converging to near optimal loading pattern. Results indicate that the convergence rate and reliability of the SGHS method are quite promising and practically, SGHS improves the quality of loading pattern optimization results relative to HS and GHS algorithms. As a result, it has the potential to be used in the other nuclear engineering optimization problems
Optimal portfolio strategies under a shortfall constraint | Akume ...
African Journals Online (AJOL)
We impose dynamically, a shortfall constraint in terms of Tail Conditional Expectation on the portfolio selection problem in continuous time, in order to obtain optimal strategies. The nancial market is assumed to comprise n risky assets driven by geometric Brownian motion and one risk-free asset. The method of Lagrange ...
Optimal energy management strategy for battery powered electric vehicles
International Nuclear Information System (INIS)
Xi, Jiaqi; Li, Mian; Xu, Min
2014-01-01
Highlights: • The power usage for battery-powered electrical vehicles with in-wheel motors is maximized. • The battery and motor dynamics are examined emphasized on the power conversion and utilization. • The optimal control strategy is derived and verified by simulations. • An analytic expression of the optimal operating point is obtained. - Abstract: Due to limited energy density of batteries, energy management has always played a critical role in improving the overall energy efficiency of electric vehicles. In this paper, a key issue within the energy management problem will be carefully tackled, i.e., maximizing the power usage of batteries for battery-powered electrical vehicles with in-wheel motors. To this end, the battery and motor dynamics will be thoroughly examined with particular emphasis on the power conversion and power utilization. The optimal control strategy will then be derived based on the analysis. One significant contribution of this work is that an analytic expression for the optimal operating point in terms of the component and environment parameters can be obtained. Owing to this finding, the derived control strategy is also rendered a simple structure for real-time implementation. Simulation results demonstrate that the proposed strategy works both adaptively and robustly under different driving scenarios
Validation of optimization strategies using the linear structured production chains
Kusiak, Jan; Morkisz, Paweł; Oprocha, Piotr; Pietrucha, Wojciech; Sztangret, Łukasz
2017-06-01
Different optimization strategies applied to sequence of several stages of production chains were validated in this paper. Two benchmark problems described by ordinary differential equations (ODEs) were considered. A water tank and a passive CR-RC filter were used as the exemplary objects described by the first and the second order differential equations, respectively. Considered in the work optimization problems serve as the validators of strategies elaborated by the Authors. However, the main goal of research is selection of the best strategy for optimization of two real metallurgical processes which will be investigated in an on-going projects. The first problem will be the oxidizing roasting process of zinc sulphide concentrate where the sulphur from the input concentrate should be eliminated and the minimal concentration of sulphide sulphur in the roasted products has to be achieved. Second problem will be the lead refining process consisting of three stages: roasting to the oxide, oxide reduction to metal and the oxidizing refining. Strategies, which appear the most effective in considered benchmark problems will be candidates for optimization of the mentioned above industrial processes.
Optimization of Particle Search Algorithm for CFD-DEM Simulations
Directory of Open Access Journals (Sweden)
G. Baryshev
2013-09-01
Full Text Available Discrete element method has numerous applications in particle physics. However, simulating particles as discrete entities can become costly for large systems. In time-driven DEM simulation most computation time is taken by contact search stage. We propose an efficient collision detection method which is based on sorting particles by their coordinates. Using multiple sorting criteria allows minimizing number of potential neighbours and defines fitness of this approach for simulation of massive systems in 3D. This method is compared to a common approach that consists of placing particles onto a grid of cells. Advantage of the new approach is independence of simulation parameters upon particle radius and domain size.
Research of Ant Colony Optimized Adaptive Control Strategy for Hybrid Electric Vehicle
Directory of Open Access Journals (Sweden)
Linhui Li
2014-01-01
Full Text Available Energy management control strategy of hybrid electric vehicle has a great influence on the vehicle fuel consumption with electric motors adding to the traditional vehicle power system. As vehicle real driving cycles seem to be uncertain, the dynamic driving cycles will have an impact on control strategy’s energy-saving effect. In order to better adapt the dynamic driving cycles, control strategy should have the ability to recognize the real-time driving cycle and adaptively adjust to the corresponding off-line optimal control parameters. In this paper, four types of representative driving cycles are constructed based on the actual vehicle operating data, and a fuzzy driving cycle recognition algorithm is proposed for online recognizing the type of actual driving cycle. Then, based on the equivalent fuel consumption minimization strategy, an ant colony optimization algorithm is utilized to search the optimal control parameters “charge and discharge equivalent factors” for each type of representative driving cycle. At last, the simulation experiments are conducted to verify the accuracy of the proposed fuzzy recognition algorithm and the validity of the designed control strategy optimization method.
Baumes, Laurent A
2006-01-01
One of the main problems in high-throughput research for materials is still the design of experiments. At early stages of discovery programs, purely exploratory methodologies coupled with fast screening tools should be employed. This should lead to opportunities to find unexpected catalytic results and identify the "groups" of catalyst outputs, providing well-defined boundaries for future optimizations. However, very few new papers deal with strategies that guide exploratory studies. Mostly, traditional designs, homogeneous covering, or simple random samplings are exploited. Typical catalytic output distributions exhibit unbalanced datasets for which an efficient learning is hardly carried out, and interesting but rare classes are usually unrecognized. Here is suggested a new iterative algorithm for the characterization of the search space structure, working independently of learning processes. It enhances recognition rates by transferring catalysts to be screened from "performance-stable" space zones to "unsteady" ones which necessitate more experiments to be well-modeled. The evaluation of new algorithm attempts through benchmarks is compulsory due to the lack of past proofs about their efficiency. The method is detailed and thoroughly tested with mathematical functions exhibiting different levels of complexity. The strategy is not only empirically evaluated, the effect or efficiency of sampling on future Machine Learning performances is also quantified. The minimum sample size required by the algorithm for being statistically discriminated from simple random sampling is investigated.
An optimal inspection strategy for randomly failing equipment
International Nuclear Information System (INIS)
Chelbi, Anis; Ait-Kadi, Daoud
1999-01-01
This paper addresses the problem of generating optimal inspection strategies for randomly failing equipment where imminent failure is not obvious and can only be detected through inspection. Inspections are carried out following a condition-based procedure. The equipment is replaced if it has failed or if it shows imminent signs of failure. The latter state is indicated by measuring certain predetermined control parameters during inspection. Costs are associated with inspection, idle time and preventive or corrective actions. An optimal inspection strategy is defined as the inspection sequence minimizing the expected total cost per time unit over an infinite span. A mathematical model and a numerical algorithm are developed to generate an optimal inspection sequence. As a practical example, the model is applied to provide a machine tool operator with a time sequence for inspecting the cutting tool. The tool life time distribution and the trend of one control parameter defining its actual condition are supposed to be known
Optimal Energy Control Strategy Design for a Hybrid Electric Vehicle
Directory of Open Access Journals (Sweden)
Yuan Zou
2013-01-01
Full Text Available A heavy-duty parallel hybrid electric truck is modeled, and its optimal energy control is studied in this paper. The fundamental architecture of the parallel hybrid electric truck is modeled feed-forwardly, together with necessary dynamic features of subsystem or components. Dynamic programming (DP technique is adopted to find the optimal control strategy including the gear-shifting sequence and the power split between the engine and the motor subject to a battery SOC-sustaining constraint. Improved control rules are extracted from the DP-based control solution, forming near-optimal control strategies. Simulation results demonstrate that a significant improvement on the fuel economy can be achieved in the heavy-duty vehicle cycle from the natural driving statistics.
Growth or reproduction: emergence of an evolutionary optimal strategy
International Nuclear Information System (INIS)
Grilli, J; Suweis, S; Maritan, A
2013-01-01
Modern ecology has re-emphasized the need for a quantitative understanding of the original ‘survival of the fittest theme’ based on analysis of the intricate trade-offs between competing evolutionary strategies that characterize the evolution of life. This is key to the understanding of species coexistence and ecosystem diversity under the omnipresent constraint of limited resources. In this work we propose an agent-based model replicating a community of interacting individuals, e.g. plants in a forest, where all are competing for the same finite amount of resources and each competitor is characterized by a specific growth–reproduction strategy. We show that such an evolution dynamics drives the system towards a stationary state characterized by an emergent optimal strategy, which in turn depends on the amount of available resources the ecosystem can rely on. We find that the share of resources used by individuals is power-law distributed with an exponent directly related to the optimal strategy. The model can be further generalized to devise optimal strategies in social and economical interacting systems dynamics. (paper)
International Nuclear Information System (INIS)
Rocha, Humberto; Dias, Joana M; Ferreira, Brígida C; Lopes, Maria C
2013-01-01
Generally, the inverse planning of radiation therapy consists mainly of the fluence optimization. The beam angle optimization (BAO) in intensity-modulated radiation therapy (IMRT) consists of selecting appropriate radiation incidence directions and may influence the quality of the IMRT plans, both to enhance better organ sparing and to improve tumor coverage. However, in clinical practice, most of the time, beam directions continue to be manually selected by the treatment planner without objective and rigorous criteria. The goal of this paper is to introduce a novel approach that uses beam’s-eye-view dose ray tracing metrics within a pattern search method framework in the optimization of the highly non-convex BAO problem. Pattern search methods are derivative-free optimization methods that require a few function evaluations to progress and converge and have the ability to better avoid local entrapment. The pattern search method framework is composed of a search step and a poll step at each iteration. The poll step performs a local search in a mesh neighborhood and ensures the convergence to a local minimizer or stationary point. The search step provides the flexibility for a global search since it allows searches away from the neighborhood of the current iterate. Beam’s-eye-view dose metrics assign a score to each radiation beam direction and can be used within the pattern search framework furnishing a priori knowledge of the problem so that directions with larger dosimetric scores are tested first. A set of clinical cases of head-and-neck tumors treated at the Portuguese Institute of Oncology of Coimbra is used to discuss the potential of this approach in the optimization of the BAO problem. (paper)
Astrophysical search strategies for accelerator blind dark matter
International Nuclear Information System (INIS)
Wells, J.D.
1998-04-01
A weakly interacting dark matter particle may be very difficult to discover at an accelerator because it either (1) is too heavy, (2) has no standard model gauge interactions, or (3) is almost degenerate with other states. In each of these cases, searches for annihilation products in the galactic halo are useful probes of dark matter properties. Using the example of supersymmetric dark matter, the author demonstrates how astrophysical searches for dark matter may provide discovery and mass information inaccessible to collider physics programs such as the Tevatron and LHC
Online gaming for learning optimal team strategies in real time
Hudas, Gregory; Lewis, F. L.; Vamvoudakis, K. G.
2010-04-01
This paper first presents an overall view for dynamical decision-making in teams, both cooperative and competitive. Strategies for team decision problems, including optimal control, zero-sum 2-player games (H-infinity control) and so on are normally solved for off-line by solving associated matrix equations such as the Riccati equation. However, using that approach, players cannot change their objectives online in real time without calling for a completely new off-line solution for the new strategies. Therefore, in this paper we give a method for learning optimal team strategies online in real time as team dynamical play unfolds. In the linear quadratic regulator case, for instance, the method learns the Riccati equation solution online without ever solving the Riccati equation. This allows for truly dynamical team decisions where objective functions can change in real time and the system dynamics can be time-varying.
Artificial root foraging optimizer algorithm with hybrid strategies
Directory of Open Access Journals (Sweden)
Yang Liu
2017-02-01
Full Text Available In this work, a new plant-inspired optimization algorithm namely the hybrid artificial root foraging optimizion (HARFO is proposed, which mimics the iterative root foraging behaviors for complex optimization. In HARFO model, two innovative strategies were developed: one is the root-to-root communication strategy, which enables the individual exchange information with each other in different efficient topologies that can essentially improve the exploration ability; the other is co-evolution strategy, which can structure the hierarchical spatial population driven by evolutionary pressure of multiple sub-populations that ensure the diversity of root population to be well maintained. The proposed algorithm is benchmarked against four classical evolutionary algorithms on well-designed test function suites including both classical and composition test functions. Through the rigorous performance analysis that of all these tests highlight the significant performance improvement, and the comparative results show the superiority of the proposed algorithm.
Multiobjective Optimization of Water Distribution Networks Using Fuzzy Theory and Harmony Search
Directory of Open Access Journals (Sweden)
Zong Woo Geem
2015-07-01
Full Text Available Thus far, various phenomenon-mimicking algorithms, such as genetic algorithm, simulated annealing, tabu search, shuffled frog-leaping, ant colony optimization, harmony search, cross entropy, scatter search, and honey-bee mating, have been proposed to optimally design the water distribution networks with respect to design cost. However, flow velocity constraint, which is critical for structural robustness against water hammer or flow circulation against substance sedimentation, was seldom considered in the optimization formulation because of computational complexity. Thus, this study proposes a novel fuzzy-based velocity reliability index, which is to be maximized while the design cost is simultaneously minimized. The velocity reliability index is included in the existing cost optimization formulation and this extended multiobjective formulation is applied to two bench-mark problems. Results show that the model successfully found a Pareto set of multiobjective design solutions in terms of cost minimization and reliability maximization.
Directory of Open Access Journals (Sweden)
Andy M Reynolds
2007-04-01
Full Text Available During their trajectories in still air, fruit flies (Drosophila melanogaster explore their landscape using a series of straight flight paths punctuated by rapid 90 degrees body-saccades [1]. Some saccades are triggered by visual expansion associated with collision avoidance. Yet many saccades are not triggered by visual cues, but rather appear spontaneously. Our analysis reveals that the control of these visually independent saccades and the flight intervals between them constitute an optimal scale-free active searching strategy. Two characteristics of mathematical optimality that are apparent during free-flight in Drosophila are inter-saccade interval lengths distributed according to an inverse square law, which does not vary across landscape scale, and 90 degrees saccade angles, which increase the likelihood that territory will be revisited and thereby reduce the likelihood that near-by targets will be missed. We also show that searching is intermittent, such that active searching phases randomly alternate with relocation phases. Behaviorally, this intermittency is reflected in frequently occurring short, slow speed inter-saccade intervals randomly alternating with rarer, longer, faster inter-saccade intervals. Searching patterns that scale similarly across orders of magnitude of length (i.e., scale-free have been revealed in animals as diverse as microzooplankton, bumblebees, albatrosses, and spider monkeys, but these do not appear to be optimised with respect to turning angle, whereas Drosophila free-flight search does. Also, intermittent searching patterns, such as those reported here for Drosophila, have been observed in foragers such as planktivorous fish and ground foraging birds. Our results with freely flying Drosophila may constitute the first reported example of searching behaviour that is both scale-free and intermittent.
Savsani, Vimal; Patel, Vivek; Gadhvi, Bhargav; Tawhid, Mohamed
2017-01-01
Most of the modern multiobjective optimization algorithms are based on the search technique of genetic algorithms; however the search techniques of other recently developed metaheuristics are emerging topics among researchers. This paper proposes a novel multiobjective optimization algorithm named multiobjective heat transfer search (MOHTS) algorithm, which is based on the search technique of heat transfer search (HTS) algorithm. MOHTS employs the elitist nondominated sorting and crowding dis...
A Harmony Search Algorithm approach for optimizing traffic signal timings
Directory of Open Access Journals (Sweden)
Mauro Dell'Orco
2013-07-01
Full Text Available In this study, a bi-level formulation is presented for solving the Equilibrium Network Design Problem (ENDP. The optimisation of the signal timing has been carried out at the upper-level using the Harmony Search Algorithm (HSA, whilst the traffic assignment has been carried out through the Path Flow Estimator (PFE at the lower level. The results of HSA have been first compared with those obtained using the Genetic Algorithm, and the Hill Climbing on a two-junction network for a fixed set of link flows. Secondly, the HSA with PFE has been applied to the medium-sized network to show the applicability of the proposed algorithm in solving the ENDP. Additionally, in order to test the sensitivity of perceived travel time error, we have used the HSA with PFE with various level of perceived travel time. The results showed that the proposed method is quite simple and efficient in solving the ENDP.
Optimization of search algorithms for a mass spectra library
International Nuclear Information System (INIS)
Domokos, L.; Henneberg, D.; Weimann, B.
1983-01-01
The SISCOM mass spectra library search is mainly an interpretative system producing a ''hit list'' of similar spectra based on six comparison factors. This paper deals with extension of the system; the aim is exact identification (retrieval) of those reference spectra in the SISCOM hit list that correspond to the unknown compounds or components of the mixture. Thus, instead of a similarity measure, a decision (retrieval) function is needed to establish the identity of reference and unknown compounds by comparison of their spectra. To facilitate estimation of the weightings of the different variables in the retrieval function, pattern recognition algorithms were applied. Numerous statistical evaluations of three different library collections were made to check the quality of data bases and to derive appropriate variables for the retrieval function. (Auth.)
A Generalized Orienteering Problem for Optimal Search and Interdiction Planning
2013-09-01
proposed for the TOP. Boussier et al. (2007) presents a branch-and- price algorithm that relies on a pricing step within the column generation phase...dominates in all metric categories and B&B appears to be the least favorable. We use performance proles ( Dolan and Moré 2002) as a method for comparing...exceeded, with greater computing power it may be possible to obtain the optimal solution in a period of time that can support a 24-hour planning
Optimizing Vector-Quantization Processor Architecture for Intelligent Query-Search Applications
Xu, Huaiyu; Mita, Yoshio; Shibata, Tadashi
2002-04-01
The architecture of a very large scale integration (VLSI) vector-quantization processor (VQP) has been optimized to develop a general-purpose intelligent query-search agent. The agent performs a similarity-based search in a large-volume database. Although similarity-based search processing is computationally very expensive, latency-free searches have become possible due to the highly parallel maximum-likelihood search architecture of the VQP chip. Three architectures of the VQP chip have been studied and their performances are compared. In order to give reasonable searching results according to the different policies, the concept of penalty function has been introduced into the VQP. An E-commerce real-estate agency system has been developed using the VQP chip implemented in a field-programmable gate array (FPGA) and the effectiveness of such an agency system has been demonstrated.
PEMFC Optimization Strategy with Auxiliary Power Source in Fuel Cell Hybrid Vehicle
Directory of Open Access Journals (Sweden)
Tinton Dwi Atmaja
2012-02-01
Full Text Available Page HeaderOpen Journal SystemsJournal HelpUser You are logged in as...aulia My Journals My Profile Log Out Log Out as UserNotifications View (27 new ManageJournal Content SearchBrowse By Issue By Author By Title Other JournalsFont SizeMake font size smaller Make font size default Make font size largerInformation For Readers For Authors For LibrariansKeywords CBPNN Displacement FLC LQG/LTR Mixed PMA Ventilation bottom shear stress direct multiple shooting effective fuzzy logic geoelectrical method hourly irregular wave missile trajectory panoramic image predator-prey systems seawater intrusion segmentation structure development pattern terminal bunt manoeuvre Home About User Home Search Current Archives ##Editorial Board##Home > Vol 23, No 1 (2012 > AtmajaPEMFC Optimization Strategy with Auxiliary Power Source in Fuel Cell Hybrid VehicleTinton Dwi Atmaja, Amin AminAbstractone of the present-day implementation of fuel cell is acting as main power source in Fuel Cell Hybrid Vehicle (FCHV. This paper proposes some strategies to optimize the performance of Polymer Electrolyte Membrane Fuel Cell (PEMFC implanted with auxiliary power source to construct a proper FCHV hybridization. The strategies consist of the most updated optimization method determined from three point of view i.e. Energy Storage System (ESS, hybridization topology and control system analysis. The goal of these strategies is to achieve an optimum hybridization with long lifetime, low cost, high efficiency, and hydrogen consumption rate improvement. The energy storage system strategy considers battery, supercapacitor, and high-speed flywheel as the most promising alternative auxiliary power source. The hybridization topology strategy analyzes the using of multiple storage devices injected with electronic components to bear a higher fuel economy and cost saving. The control system strategy employs nonlinear control system to optimize the ripple factor of the voltage and the current
Optimal information transmission in organizations: search and congestion
Energy Technology Data Exchange (ETDEWEB)
Arenas, A.; Cabrales, A.; Danon, L.; Diaz-Guilera, A.; Guimera, R.; Vega-Redondo, F.
2008-01-01
We propose a stylized model of a problem-solving organization whose internal communication structure is given by a fixed network. Problems arrive randomly anywhere in this network and must find their way to their respective specialized solvers by relying on local information alone. The organization handles multiple problems simultaneously. For this reason, the process may be subject to congestion. We provide a characterization of the threshold of collapse of the network and of the stock of floating problems (or average delay) that prevails below that threshold. We build upon this characterization to address a design problem: the determination of what kind of network architecture optimizes performance for any given problem arrival rate. We conclude that, for low arrival rates, the optimal network is very polarized (i.e. star-like or centralized), whereas it is largely homogeneous (or decentralized) for high arrival rates. These observations are in line with a common transformation experienced by information-intensive organizations as their work flow has risen in recent years.
On the robust optimization to the uncertain vaccination strategy problem
International Nuclear Information System (INIS)
Chaerani, D.; Anggriani, N.; Firdaniza
2014-01-01
In order to prevent an epidemic of infectious diseases, the vaccination coverage needs to be minimized and also the basic reproduction number needs to be maintained below 1. This means that as we get the vaccination coverage as minimum as possible, thus we need to prevent the epidemic to a small number of people who already get infected. In this paper, we discuss the case of vaccination strategy in term of minimizing vaccination coverage, when the basic reproduction number is assumed as an uncertain parameter that lies between 0 and 1. We refer to the linear optimization model for vaccination strategy that propose by Becker and Starrzak (see [2]). Assuming that there is parameter uncertainty involved, we can see Tanner et al (see [9]) who propose the optimal solution of the problem using stochastic programming. In this paper we discuss an alternative way of optimizing the uncertain vaccination strategy using Robust Optimization (see [3]). In this approach we assume that the parameter uncertainty lies within an ellipsoidal uncertainty set such that we can claim that the obtained result will be achieved in a polynomial time algorithm (as it is guaranteed by the RO methodology). The robust counterpart model is presented
On the robust optimization to the uncertain vaccination strategy problem
Energy Technology Data Exchange (ETDEWEB)
Chaerani, D., E-mail: d.chaerani@unpad.ac.id; Anggriani, N., E-mail: d.chaerani@unpad.ac.id; Firdaniza, E-mail: d.chaerani@unpad.ac.id [Department of Mathematics, Faculty of Mathematics and Natural Sciences, University of Padjadjaran Indonesia, Jalan Raya Bandung Sumedang KM 21 Jatinangor Sumedang 45363 (Indonesia)
2014-02-21
In order to prevent an epidemic of infectious diseases, the vaccination coverage needs to be minimized and also the basic reproduction number needs to be maintained below 1. This means that as we get the vaccination coverage as minimum as possible, thus we need to prevent the epidemic to a small number of people who already get infected. In this paper, we discuss the case of vaccination strategy in term of minimizing vaccination coverage, when the basic reproduction number is assumed as an uncertain parameter that lies between 0 and 1. We refer to the linear optimization model for vaccination strategy that propose by Becker and Starrzak (see [2]). Assuming that there is parameter uncertainty involved, we can see Tanner et al (see [9]) who propose the optimal solution of the problem using stochastic programming. In this paper we discuss an alternative way of optimizing the uncertain vaccination strategy using Robust Optimization (see [3]). In this approach we assume that the parameter uncertainty lies within an ellipsoidal uncertainty set such that we can claim that the obtained result will be achieved in a polynomial time algorithm (as it is guaranteed by the RO methodology). The robust counterpart model is presented.
Generating optimized stochastic power management strategies for electric car components
Energy Technology Data Exchange (ETDEWEB)
Fruth, Matthias [TraceTronic GmbH, Dresden (Germany); Bastian, Steve [Technische Univ. Dresden (Germany)
2012-11-01
With the increasing prevalence of electric vehicles, reducing the power consumption of car components becomes a necessity. For the example of a novel traffic-light assistance system, which makes speed recommendations based on the expected length of red-light phases, power-management strategies are used to control under which conditions radio communication, positioning systems and other components are switched to low-power (e.g. sleep) or high-power (e.g. idle/busy) states. We apply dynamic power management, an optimization technique well-known from other domains, in order to compute energy-optimal power-management strategies, sometimes resulting in these strategies being stochastic. On the example of the traffic-light assistant, we present a MATLAB/Simulink-implemented framework for the generation, simulation and formal analysis of optimized power-management strategies, which is based on this technique. We study capabilities and limitations of this approach and sketch further applications in the automotive domain. (orig.)
Abedini, M. J.; Nasseri, M.; Burn, D. H.
2012-04-01
In any geostatistical study, an important consideration is the choice of an appropriate, repeatable, and objective search strategy that controls the nearby samples to be included in the location-specific estimation procedure. Almost all geostatistical software available in the market puts the onus on the user to supply search strategy parameters in a heuristic manner. These parameters are solely controlled by geographical coordinates that are defined for the entire area under study, and the user has no guidance as to how to choose these parameters. The main thesis of the current study is that the selection of search strategy parameters has to be driven by data—both the spatial coordinates and the sample values—and cannot be chosen beforehand. For this purpose, a genetic-algorithm-based ordinary kriging with moving neighborhood technique is proposed. The search capability of a genetic algorithm is exploited to search the feature space for appropriate, either local or global, search strategy parameters. Radius of circle/sphere and/or radii of standard or rotated ellipse/ellipsoid are considered as the decision variables to be optimized by GA. The superiority of GA-based ordinary kriging is demonstrated through application to the Wolfcamp Aquifer piezometric head data. Assessment of numerical results showed that definition of search strategy parameters based on both geographical coordinates and sample values improves cross-validation statistics when compared with that based on geographical coordinates alone. In the case of a variable search neighborhood for each estimation point, optimization of local search strategy parameters for an elliptical support domain—the orientation of which is dictated by anisotropic axes—via GA was able to capture the dynamics of piezometric head in west Texas/New Mexico in an efficient way.
An optimization strategy for a biokinetic model of inhaled radionuclides
International Nuclear Information System (INIS)
Shyr, L.J.; Griffith, W.C.; Boecker, B.B.
1991-01-01
Models for material disposition and dosimetry involve predictions of the biokinetics of the material among compartments representing organs and tissues in the body. Because of a lack of human data for most toxicants, many of the basic data are derived by modeling the results obtained from studies using laboratory animals. Such a biomathematical model is usually developed by adjusting the model parameters to make the model predictions match the measured retention and excretion data visually. The fitting process can be very time-consuming for a complicated model, and visual model selections may be subjective and easily biased by the scale or the data used. Due to the development of computerized optimization methods, manual fitting could benefit from an automated process. However, for a complicated model, an automated process without an optimization strategy will not be efficient, and may not produce fruitful results. In this paper, procedures for, and implementation of, an optimization strategy for a complicated mathematical model is demonstrated by optimizing a biokinetic model for 144Ce in fused aluminosilicate particles inhaled by beagle dogs. The optimized results using SimuSolv were compared to manual fitting results obtained previously using the model simulation software GASP. Also, statistical criteria provided by SimuSolv, such as likelihood function values, were used to help or verify visual model selections
Control strategies for wind farm power optimization: LES study
Ciri, Umberto; Rotea, Mario; Leonardi, Stefano
2017-11-01
Turbines in wind farms operate in off-design conditions as wake interactions occur for particular wind directions. Advanced wind farm control strategies aim at coordinating and adjusting turbine operations to mitigate power losses in such conditions. Coordination is achieved by controlling on upstream turbines either the wake intensity, through the blade pitch angle or the generator torque, or the wake direction, through yaw misalignment. Downstream turbines can be adapted to work in waked conditions and limit power losses, using the blade pitch angle or the generator torque. As wind conditions in wind farm operations may change significantly, it is difficult to determine and parameterize the variations of the coordinated optimal settings. An alternative is model-free control and optimization of wind farms, which does not require any parameterization and can track the optimal settings as conditions vary. In this work, we employ a model-free optimization algorithm, extremum-seeking control, to find the optimal set-points of generator torque, blade pitch and yaw angle for a three-turbine configuration. Large-Eddy Simulations are used to provide a virtual environment to evaluate the performance of the control strategies under realistic, unsteady incoming wind. This work was supported by the National Science Foundation, Grants No. 1243482 (the WINDINSPIRE project) and IIP 1362033 (I/UCRC WindSTAR). TACC is acknowledged for providing computational time.
Spatial planning via extremal optimization enhanced by cell-based local search
International Nuclear Information System (INIS)
Sidiropoulos, Epaminondas
2014-01-01
A new treatment is presented for land use planning problems by means of extremal optimization in conjunction to cell-based neighborhood local search. Extremal optimization, inspired by self-organized critical models of evolution has been applied mainly to the solution of classical combinatorial optimization problems. Cell-based local search has been employed by the author elsewhere in problems of spatial resource allocation in combination with genetic algorithms and simulated annealing. In this paper it complements extremal optimization in order to enhance its capacity for a spatial optimization problem. The hybrid method thus formed is compared to methods of the literature on a specific characteristic problem. It yields better results both in terms of objective function values and in terms of compactness. The latter is an important quantity for spatial planning. The present treatment yields significant compactness values as emergent results
A Novel adaptative Discrete Cuckoo Search Algorithm for parameter optimization in computer vision
Directory of Open Access Journals (Sweden)
loubna benchikhi
2017-10-01
Full Text Available Computer vision applications require choosing operators and their parameters, in order to provide the best outcomes. Often, the users quarry on expert knowledge and must experiment many combinations to find manually the best one. As performance, time and accuracy are important, it is necessary to automate parameter optimization at least for crucial operators. In this paper, a novel approach based on an adaptive discrete cuckoo search algorithm (ADCS is proposed. It automates the process of algorithms’ setting and provides optimal parameters for vision applications. This work reconsiders a discretization problem to adapt the cuckoo search algorithm and presents the procedure of parameter optimization. Some experiments on real examples and comparisons to other metaheuristic-based approaches: particle swarm optimization (PSO, reinforcement learning (RL and ant colony optimization (ACO show the efficiency of this novel method.
Win-Win transport strategies: searching for synergies.
Valdés Serrano, Cristina; Monzón de Cáceres, Andrés; García Benítez, Francisco
2014-01-01
The need of an urban transport strategy on urban areas which solves the environmental problems derived from traffic without decreasing the trip attraction of these urban areas is taken for granted. Besides there is also a clear consensus among researchers and institutions in the need for integrated transport strategies (May et al., 2006; Zhang et al., 2006). But there is still a lack of knowledge on the policy measures to be implemented. This research aims to deepen in the understanding of h...
Knowledge in Artificial Intelligence Systems: Searching the Strategies for Application
Kornienko, Alla A.; Kornienko, Anatoly V.; Fofanov, Oleg B.; Chubik, Maxim P.
2015-01-01
The studies based on auto-epistemic logic are pointed out as an advanced direction for development of artificial intelligence (AI). Artificial intelligence is taken as a system that imitates the solution of complicated problems by human during the course of life. The structure of symbols and operations, by which intellectual solution is performed, as well as searching the strategic reference points for those solutions, which are caused by certain structures of symbols and operations, – are co...
Strategies for the search of life in the universe
Schneider, Jean
1996-01-01
The discovery of an increasing number of Jupiter-like planets in orbit around other stars (or extra-solar planets) is a promising first step toward the search for Life in the Universe. We review all aspects of the question: - definition of Life - definition and characterization of the `habitable zone' around a star - overview of detection methods of planets, with special attention to habitable planets - present fingings - future projects.
Structural optimization of a motorcycle chassis by pattern search algorithm
Scappaticci, Lorenzo; Bartolini, Nicola; Guglielmino, Eugenio; Risitano, Giacomo
2017-08-01
Changes to the technical regulations of the motorcycle racing world classes introduced the new Moto2 category. The vehicles are prototypes that use single-brand tyres and engines derived from series production, supplied by a single manufacturer. The stability and handling of the vehicle are highly dependent on the geometric properties of the chassis. The performance of a racing motorcycle chassis can be primarily evaluated in terms of weight and stiffness. The aim of this work is to maximize the performance of a tubular frame designed for a motorcycle racing in the Moto2 category. The goal is the implementation of an optimization algorithm that acts on the dimensions of the single pipes of the frame and involves the design of an objective function to minimize the weight of the frame by controlling its stiffnesses.
Russell-Rose, Tony; Chamberlain, Jon
2017-01-01
Background Healthcare information professionals play a key role in closing the knowledge gap between medical research and clinical practice. Their work involves meticulous searching of literature databases using complex search strategies that can consist of hundreds of keywords, operators, and ontology terms. This process is prone to error and can lead to inefficiency and bias if performed incorrectly. Objective The aim of this study was to investigate the search behavior of healthcare inform...
An High Resolution Near-Earth Objects Population Enabling Next-Generation Search Strategies
Tricaico, Pasquale; Beshore, E. C.; Larson, S. M.; Boattini, A.; Williams, G. V.
2010-01-01
Over the past decade, the dedicated search for kilometer-size near-Earth objects (NEOs), potentially hazardous objects (PHOs), and potential Earth impactors has led to a boost in the rate of discoveries of these objects. The catalog of known NEOs is the fundamental ingredient used to develop a model for the NEOs population, either by assessing and correcting for the observational bias (Jedicke et al., 2002), or by evaluating the migration rates from the NEOs source regions (Bottke et al., 2002). The modeled NEOs population is a necessary tool used to track the progress in the search of large NEOs (Jedicke et al., 2003) and to try to predict the distribution of the ones still undiscovered, as well as to study the sky distribution of potential Earth impactors (Chesley & Spahr, 2004). We present a method to model the NEOs population in all six orbital elements, on a finely grained grid, allowing us the design and test of targeted and optimized search strategies. This method relies on the observational data routinely reported to the Minor Planet Center (MPC) by the Catalina Sky Survey (CSS) and by other active NEO surveys over the past decade, to determine on a nightly basis the efficiency in detecting moving objects as a function of observable quantities including apparent magnitude, rate of motion, airmass, and galactic latitude. The cumulative detection probability is then be computed for objects within a small range in orbital elements and absolute magnitude, and the comparison with the number of know NEOs within the same range allows us to model the population. When propagated to the present epoch and projected on the sky plane, this provides the distribution of the missing large NEOs, PHOs, and potential impactors.
Talk as a Metacognitive Strategy during the Information Search Process of Adolescents
Bowler, Leanne
2010-01-01
Introduction: This paper describes a metacognitive strategy related to the social dimension of the information search process of adolescents. Method: A case study that used naturalistic methods to explore the metacognitive thinking nd associated emotions of ten adolescents. The study was framed by Kuhlthau's Information Search Process model and…
A rational analysis of alternating search and reflection strategies in problem solving
Taatgen, N; Shafto, MG; Langley, P
1997-01-01
In this paper two approaches to problem solving, search and reflection, are discussed, and combined in two models, both based on rational analysis (Anderson, 1990). The first model is a dynamic growth model, which shows that alternating search and reflection is a rational strategy. The second model
Alumni Job Search Strategies, Class of 2011. GMAC[R] Data-to-Go Series
Graduate Management Admission Council, 2012
2012-01-01
Examining the job search strategies and employment outcomes for Class of 2011 graduate business school alumni sheds light on current job market trends and the effort required to secure a first job after earning a graduate business degree. This fact sheet highlights the job search methods used by Class of 2011 business school graduates as reported…
Automatic CT simulation optimization for radiation therapy: A general strategy.
Li, Hua; Yu, Lifeng; Anastasio, Mark A; Chen, Hsin-Chen; Tan, Jun; Gay, Hiram; Michalski, Jeff M; Low, Daniel A; Mutic, Sasa
2014-03-01
In radiation therapy, x-ray computed tomography (CT) simulation protocol specifications should be driven by the treatment planning requirements in lieu of duplicating diagnostic CT screening protocols. The purpose of this study was to develop a general strategy that allows for automatically, prospectively, and objectively determining the optimal patient-specific CT simulation protocols based on radiation-therapy goals, namely, maintenance of contouring quality and integrity while minimizing patient CT simulation dose. The authors proposed a general prediction strategy that provides automatic optimal CT simulation protocol selection as a function of patient size and treatment planning task. The optimal protocol is the one that delivers the minimum dose required to provide a CT simulation scan that yields accurate contours. Accurate treatment plans depend on accurate contours in order to conform the dose to actual tumor and normal organ positions. An image quality index, defined to characterize how simulation scan quality affects contour delineation, was developed and used to benchmark the contouring accuracy and treatment plan quality within the predication strategy. A clinical workflow was developed to select the optimal CT simulation protocols incorporating patient size, target delineation, and radiation dose efficiency. An experimental study using an anthropomorphic pelvis phantom with added-bolus layers was used to demonstrate how the proposed prediction strategy could be implemented and how the optimal CT simulation protocols could be selected for prostate cancer patients based on patient size and treatment planning task. Clinical IMRT prostate treatment plans for seven CT scans with varied image quality indices were separately optimized and compared to verify the trace of target and organ dosimetry coverage. Based on the phantom study, the optimal image quality index for accurate manual prostate contouring was 4.4. The optimal tube potentials for patient sizes
Automatic CT simulation optimization for radiation therapy: A general strategy
Energy Technology Data Exchange (ETDEWEB)
Li, Hua, E-mail: huli@radonc.wustl.edu; Chen, Hsin-Chen; Tan, Jun; Gay, Hiram; Michalski, Jeff M.; Mutic, Sasa [Department of Radiation Oncology, Washington University, St. Louis, Missouri 63110 (United States); Yu, Lifeng [Department of Radiology, Mayo Clinic, Rochester, Minnesota 55905 (United States); Anastasio, Mark A. [Department of Biomedical Engineering, Washington University, St. Louis, Missouri 63110 (United States); Low, Daniel A. [Department of Radiation Oncology, University of California Los Angeles, Los Angeles, California 90095 (United States)
2014-03-15
Purpose: In radiation therapy, x-ray computed tomography (CT) simulation protocol specifications should be driven by the treatment planning requirements in lieu of duplicating diagnostic CT screening protocols. The purpose of this study was to develop a general strategy that allows for automatically, prospectively, and objectively determining the optimal patient-specific CT simulation protocols based on radiation-therapy goals, namely, maintenance of contouring quality and integrity while minimizing patient CT simulation dose. Methods: The authors proposed a general prediction strategy that provides automatic optimal CT simulation protocol selection as a function of patient size and treatment planning task. The optimal protocol is the one that delivers the minimum dose required to provide a CT simulation scan that yields accurate contours. Accurate treatment plans depend on accurate contours in order to conform the dose to actual tumor and normal organ positions. An image quality index, defined to characterize how simulation scan quality affects contour delineation, was developed and used to benchmark the contouring accuracy and treatment plan quality within the predication strategy. A clinical workflow was developed to select the optimal CT simulation protocols incorporating patient size, target delineation, and radiation dose efficiency. An experimental study using an anthropomorphic pelvis phantom with added-bolus layers was used to demonstrate how the proposed prediction strategy could be implemented and how the optimal CT simulation protocols could be selected for prostate cancer patients based on patient size and treatment planning task. Clinical IMRT prostate treatment plans for seven CT scans with varied image quality indices were separately optimized and compared to verify the trace of target and organ dosimetry coverage. Results: Based on the phantom study, the optimal image quality index for accurate manual prostate contouring was 4.4. The optimal tube
International Nuclear Information System (INIS)
Yadav, Parikshit; Kumar, Rajesh; Panda, S.K.; Chang, C.S.
2011-01-01
Harmony Search (HS) algorithm is music based meta-heuristic optimization method which is analogous with the music improvisation process where musician continue to polish the pitches in order to obtain better harmony. The paper focuses on the optimal scheduling of the generators to reduce the fuel consumption in the oil rig platform. The accurate modeling of the specific fuel consumption is significant in this optimization. The specific fuel consumption has been modeled using cubic spline interpolation. The SFC curve is non-linear and discrete in nature, hence conventional methods fail to give optimal solution. HS algorithm has been used for optimal scheduling of the generators of both equal and unequal rating. Furthermore an Improved Harmony Search (IHS) method for generating new solution vectors that enhances accuracy and convergence rate of HS has been employed. The paper also focuses on the impacts of constant parameters on Harmony Search algorithm. Numerical results show that the IHS method has good convergence property. Moreover, the fuel consumption for IHS algorithm is lower when compared to HS and other heuristic or deterministic methods and is a powerful search algorithm for various engineering optimization problems.
Energy Technology Data Exchange (ETDEWEB)
Yadav, Parikshit; Kumar, Rajesh; Panda, S.K.; Chang, C.S. [Department of Electrical and Computer Engineering, National University of Singapore, Singapore 117576 (Singapore)
2011-02-15
Harmony Search (HS) algorithm is music based meta-heuristic optimization method which is analogous with the music improvisation process where musician continue to polish the pitches in order to obtain better harmony. The paper focuses on the optimal scheduling of the generators to reduce the fuel consumption in the oil rig platform. The accurate modeling of the specific fuel consumption is significant in this optimization. The specific fuel consumption has been modeled using cubic spline interpolation. The SFC curve is non-linear and discrete in nature, hence conventional methods fail to give optimal solution. HS algorithm has been used for optimal scheduling of the generators of both equal and unequal rating. Furthermore an Improved Harmony Search (IHS) method for generating new solution vectors that enhances accuracy and convergence rate of HS has been employed. The paper also focuses on the impacts of constant parameters on Harmony Search algorithm. Numerical results show that the IHS method has good convergence property. Moreover, the fuel consumption for IHS algorithm is lower when compared to HS and other heuristic or deterministic methods and is a powerful search algorithm for various engineering optimization problems. (author)
Transitions in optimal adaptive strategies for populations in fluctuating environments
Mayer, Andreas; Mora, Thierry; Rivoire, Olivier; Walczak, Aleksandra M.
2017-09-01
Biological populations are subject to fluctuating environmental conditions. Different adaptive strategies can allow them to cope with these fluctuations: specialization to one particular environmental condition, adoption of a generalist phenotype that compromises between conditions, or population-wise diversification (bet hedging). Which strategy provides the largest selective advantage in the long run depends on the range of accessible phenotypes and the statistics of the environmental fluctuations. Here, we analyze this problem in a simple mathematical model of population growth. First, we review and extend a graphical method to identify the nature of the optimal strategy when the environmental fluctuations are uncorrelated. Temporal correlations in environmental fluctuations open up new strategies that rely on memory but are mathematically challenging to study: We present analytical results to address this challenge. We illustrate our general approach by analyzing optimal adaptive strategies in the presence of trade-offs that constrain the range of accessible phenotypes. Our results extend several previous studies and have applications to a variety of biological phenomena, from antibiotic resistance in bacteria to immune responses in vertebrates.
Directory of Open Access Journals (Sweden)
Mangal Singh
2017-12-01
Full Text Available This paper considers the use of the Partial Transmit Sequence (PTS technique to reduce the Peak‐to‐Average Power Ratio (PAPR of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search‐based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms.
Jochmann-Mannak, Hanna
2014-01-01
Children experience all kinds of problems using search interfaces for adults such as Google. The research reported in this dissertation is about the design of informational interfaces for children between 8 and 12 years old. The goal of the research was to learn more about interfaces that ‘work’ for
How Interface Design and Search Strategy Influence Children’s Search Performance and Evaluation
Jochmann-Mannak, Hanna; Lentz, Leo; Huibers, Theo W.C.; Sanders, Ted
This chapter presents an experiment with 158 children, aged 10 to 12, in which search performance and attitudes towards an informational Website are investigated. The same Website was designed in 3 different types of interface design varying in playfulness of navigation structure and in playfulness
Eye Movements Reveal Optimal Strategies for Analogical Reasoning.
Vendetti, Michael S; Starr, Ariel; Johnson, Elizabeth L; Modavi, Kiana; Bunge, Silvia A
2017-01-01
Analogical reasoning refers to the process of drawing inferences on the basis of the relational similarity between two domains. Although this complex cognitive ability has been the focus of inquiry for many years, most models rely on measures that cannot capture individuals' thought processes moment by moment. In the present study, we used participants' eye movements to investigate reasoning strategies in real time while solving visual propositional analogy problems (A:B::C:D). We included both a semantic and a perceptual lure on every trial to determine how these types of distracting information influence reasoning strategies. Participants spent more time fixating the analogy terms and the target relative to the other response choices, and made more saccades between the A and B items than between any other items. Participants' eyes were initially drawn to perceptual lures when looking at response choices, but they nonetheless performed the task accurately. We used participants' gaze sequences to classify each trial as representing one of three classic analogy problem solving strategies and related strategy usage to analogical reasoning performance. A project-first strategy, in which participants first extrapolate the relation between the AB pair and then generalize that relation for the C item, was both the most commonly used strategy as well as the optimal strategy for solving visual analogy problems. These findings provide new insight into the role of strategic processing in analogical problem solving.
Eye Movements Reveal Optimal Strategies for Analogical Reasoning
Directory of Open Access Journals (Sweden)
Michael S. Vendetti
2017-06-01
Full Text Available Analogical reasoning refers to the process of drawing inferences on the basis of the relational similarity between two domains. Although this complex cognitive ability has been the focus of inquiry for many years, most models rely on measures that cannot capture individuals' thought processes moment by moment. In the present study, we used participants' eye movements to investigate reasoning strategies in real time while solving visual propositional analogy problems (A:B::C:D. We included both a semantic and a perceptual lure on every trial to determine how these types of distracting information influence reasoning strategies. Participants spent more time fixating the analogy terms and the target relative to the other response choices, and made more saccades between the A and B items than between any other items. Participants' eyes were initially drawn to perceptual lures when looking at response choices, but they nonetheless performed the task accurately. We used participants' gaze sequences to classify each trial as representing one of three classic analogy problem solving strategies and related strategy usage to analogical reasoning performance. A project-first strategy, in which participants first extrapolate the relation between the AB pair and then generalize that relation for the C item, was both the most commonly used strategy as well as the optimal strategy for solving visual analogy problems. These findings provide new insight into the role of strategic processing in analogical problem solving.
Artificial intelligence search techniques for optimization of the cold source geometry
International Nuclear Information System (INIS)
Azmy, Y.Y.
1988-01-01
Most optimization studies of cold neutron sources have concentrated on the numerical prediction or experimental measurement of the cold moderator optimum thickness which produces the largest cold neutron leakage for a given thermal neutron source. Optimizing the geometrical shape of the cold source, however, is a more difficult problem because the optimized quantity, the cold neutron leakage, is an implicit function of the shape which is the unknown in such a study. We draw an analogy between this problem and a state space search, then we use a simple Artificial Intelligence (AI) search technique to determine the optimum cold source shape based on a two-group, r-z diffusion model. We implemented this AI design concept in the computer program AID which consists of two modules, a physical model module and a search module, which can be independently modified, improved, or made more sophisticated. 7 refs., 1 fig
Artificial intelligence search techniques for the optimization of cold source geometry
International Nuclear Information System (INIS)
Azmy, Y.Y.
1988-01-01
Most optimization studies of cold neutron sources have concentrated on the numerical prediction or experimental measurement of the cold moderator optimum thickness that produces the largest cold neutron leakage for a given thermal neutron source. Optimizing the geometric shape of the cold source, however, is a more difficult problem because the optimized quantity, the cold neutron leakage, is an implicit function of the shape, which is the unknown in such a study. An analogy is drawn between this problem and a state space search, then a simple artificial intelligence (AI) search technique is used to determine the optimum cold source shape based on a two-group, r-z diffusion model. This AI design concept was implemented in the computer program AID, which consists of two modules, a physical model module, and a search module, which can be independently modified, improved, or made more sophisticated
International Nuclear Information System (INIS)
Chan, Apple L.S.; Hanby, Vic I.; Chow, T.T.
2007-01-01
A district cooling system is a sustainable means of distribution of cooling energy through mass production. A cooling medium like chilled water is generated at a central refrigeration plant and supplied to serve a group of consumer buildings through a piping network. Because of the substantial capital investment involved, an optimal design of the distribution piping configuration is one of the crucial factors for successful implementation of the district cooling scheme. In the present study, genetic algorithm (GA) incorporated with local search techniques was developed to find the optimal/near optimal configuration of the piping network in a hypothetical site. The effect of local search, mutation rate and frequency of local search on the performance of the GA in terms of both solution quality and computation time were investigated and presented in this paper
An Optimization Model and Modified Harmony Search Algorithm for Microgrid Planning with ESS
Directory of Open Access Journals (Sweden)
Yang Jiao
2017-01-01
Full Text Available To solve problems such as the high cost of microgrids (MGs, balance between supply and demand, stability of system operation, and optimizing the MG planning model, the energy storage system (ESS and harmony search algorithm (HSA are proposed. First, the conventional MG planning optimization model is constructed and the constraint conditions are defined: the supply and demand balance and reserve requirements. Second, an ESS is integrated into the optimal model of MG planning. The model with an ESS can solve and identify parameters such as the optimal power, optimal capacity, and optimal installation year. Third, the convergence speed and robustness of the ESS are optimized and improved. A case study comprising three different cases concludes the paper. The results show that the modified HSA (MHSA can effectively improve the stability and economy of MG operation with an ESS.
An extension of the directed search domain algorithm to bilevel optimization
Wang, Kaiqiang; Utyuzhnikov, Sergey V.
2017-08-01
A method is developed for generating a well-distributed Pareto set for the upper level in bilevel multiobjective optimization. The approach is based on the Directed Search Domain (DSD) algorithm, which is a classical approach for generation of a quasi-evenly distributed Pareto set in multiobjective optimization. The approach contains a double-layer optimizer designed in a specific way under the framework of the DSD method. The double-layer optimizer is based on bilevel single-objective optimization and aims to find a unique optimal Pareto solution rather than generate the whole Pareto frontier on the lower level in order to improve the optimization efficiency. The proposed bilevel DSD approach is verified on several test cases, and a relevant comparison against another classical approach is made. It is shown that the approach can generate a quasi-evenly distributed Pareto set for the upper level with relatively low time consumption.
New Search Space Reduction Algorithm for Vertical Reference Trajectory Optimization
Directory of Open Access Journals (Sweden)
Alejandro MURRIETA-MENDOZA
2016-06-01
Full Text Available Burning the fuel required to sustain a given flight releases pollution such as carbon dioxide and nitrogen oxides, and the amount of fuel consumed is also a significant expense for airlines. It is desirable to reduce fuel consumption to reduce both pollution and flight costs. To increase fuel savings in a given flight, one option is to compute the most economical vertical reference trajectory (or flight plan. A deterministic algorithm was developed using a numerical aircraft performance model to determine the most economical vertical flight profile considering take-off weight, flight distance, step climb and weather conditions. This algorithm is based on linear interpolations of the performance model using the Lagrange interpolation method. The algorithm downloads the latest available forecast from Environment Canada according to the departure date and flight coordinates, and calculates the optimal trajectory taking into account the effects of wind and temperature. Techniques to avoid unnecessary calculations are implemented to reduce the computation time. The costs of the reference trajectories proposed by the algorithm are compared with the costs of the reference trajectories proposed by a commercial flight management system using the fuel consumption estimated by the FlightSim® simulator made by Presagis®.
Optimal intervention strategies for cholera outbreak by education and chlorination
Bakhtiar, Toni
2016-01-01
This paper discusses the control of infectious diseases in the framework of optimal control approach. A case study on cholera control was studied by considering two control strategies, namely education and chlorination. We distinct the former control into one regarding person-to-person behaviour and another one concerning person-to-environment conduct. Model are divided into two interacted populations: human population which follows an SIR model and pathogen population. Pontryagin maximum principle was applied in deriving a set of differential equations which consists of dynamical and adjoin systems as optimality conditions. Then, the fourth order Runge-Kutta method was exploited to numerically solve the equation system. An illustrative example was provided to assess the effectiveness of the control strategies toward a set of control scenarios.
Energy Technology Data Exchange (ETDEWEB)
Ji, Aimin; Yin, Xu; Yuan, Minghai [Hohai University, Changzhou (China)
2015-09-15
There are two problems in Collaborative optimization (CO): (1) the local optima arising from the selection of an inappropriate initial point; (2) the low efficiency and accuracy root in inappropriate relaxation factors. To solve these problems, we first develop the Latin hypercube design (LHD) to determine an initial point of optimization, and then use the non-linear programming by quadratic Lagrangian (NLPQL) to search for the global solution. The effectiveness of the initial point selection strategy is verified by three benchmark functions with some dimensions and different complexities. Then we propose the Adaptive relaxation collaborative optimization (ARCO) algorithm to solve the inconsistency between the system level and the disciplines level, and in this method, the relaxation factors are determined according to the three separated stages of CO respectively. The performance of the ARCO algorithm is compared with the standard collaborative algorithm and the constant relaxation collaborative algorithm with a typical numerical example, which indicates that the ARCO algorithm is more efficient and accurate. Finally, we propose a Hybrid collaborative optimization (HCO) approach, which integrates the selection strategy of initial point with the ARCO algorithm. The results show that HCO can achieve the global optimal solution without the initial value and it also has advantages in convergence, accuracy and robustness. Therefore, the proposed HCO approach can solve the CO problems with applications in the spindle and the speed reducer.
International Nuclear Information System (INIS)
Ji, Aimin; Yin, Xu; Yuan, Minghai
2015-01-01
There are two problems in Collaborative optimization (CO): (1) the local optima arising from the selection of an inappropriate initial point; (2) the low efficiency and accuracy root in inappropriate relaxation factors. To solve these problems, we first develop the Latin hypercube design (LHD) to determine an initial point of optimization, and then use the non-linear programming by quadratic Lagrangian (NLPQL) to search for the global solution. The effectiveness of the initial point selection strategy is verified by three benchmark functions with some dimensions and different complexities. Then we propose the Adaptive relaxation collaborative optimization (ARCO) algorithm to solve the inconsistency between the system level and the disciplines level, and in this method, the relaxation factors are determined according to the three separated stages of CO respectively. The performance of the ARCO algorithm is compared with the standard collaborative algorithm and the constant relaxation collaborative algorithm with a typical numerical example, which indicates that the ARCO algorithm is more efficient and accurate. Finally, we propose a Hybrid collaborative optimization (HCO) approach, which integrates the selection strategy of initial point with the ARCO algorithm. The results show that HCO can achieve the global optimal solution without the initial value and it also has advantages in convergence, accuracy and robustness. Therefore, the proposed HCO approach can solve the CO problems with applications in the spindle and the speed reducer
Turbine Control Strategies for Wind Farm Power Optimization
DEFF Research Database (Denmark)
Mirzaei, Mahmood; Göçmen Bozkurt, Tuhfe; Giebel, Gregor
2015-01-01
In recent decades there has been increasing interest in green energies, of which wind energy is the most important one. In order to improve the competitiveness of the wind power plants, there are ongoing researches to decrease cost per energy unit and increase the efficiency of wind turbines...... and wind farms. One way of achieving these goals is to optimize the power generated by a wind farm. One optimization method is to choose appropriate operating points for the individual wind turbines in the farm. We have made three models of a wind farm based on three difference control strategies...... the generated power by changing the power reference of the individual wind turbines. We use the optimization setup to compare power production of the wind farm models. This paper shows that for the most frequent wind velocities (below and around the rated values), the generated powers of the wind farms...
Search strategy for theorem proving in artificial systems. II
Energy Technology Data Exchange (ETDEWEB)
Lovitskii, V A; Barenboim, M S
1981-01-01
For Pt.I see IBID., p.28 (1981). An algorithm is presented, realizing the strategy of part I, by constructing a graph of disproofs. The idea central to the algorithm is to choose pairs of literals with the highest probability at the given moment, rather than to choose literals at random. 3 references.
Search strategy for theorem proving in artificial systems. I
Energy Technology Data Exchange (ETDEWEB)
Lovitskii, V A; Barenboim, M S
1981-01-01
A strategy is contrived, employing the language of finite-order predicate calculus, for finding proofs of theorems. A theorem is formulated, based on 2 known theorems on purity and absorption, and used to determine 5 properties of a set of propositions. 3 references.
Integrated testing strategies can be optimal for chemical risk classification.
Raseta, Marko; Pitchford, Jon; Cussens, James; Doe, John
2017-08-01
There is an urgent need to refine strategies for testing the safety of chemical compounds. This need arises both from the financial and ethical costs of animal tests, but also from the opportunities presented by new in-vitro and in-silico alternatives. Here we explore the mathematical theory underpinning the formulation of optimal testing strategies in toxicology. We show how the costs and imprecisions of the various tests, and the variability in exposures and responses of individuals, can be assembled rationally to form a Markov Decision Problem. We compute the corresponding optimal policies using well developed theory based on Dynamic Programming, thereby identifying and overcoming some methodological and logical inconsistencies which may exist in the current toxicological testing. By illustrating our methods for two simple but readily generalisable examples we show how so-called integrated testing strategies, where information of different precisions from different sources is combined and where different initial test outcomes lead to different sets of future tests, can arise naturally as optimal policies. Copyright © 2017 Elsevier Inc. All rights reserved.
Optimal sampling strategies for detecting zoonotic disease epidemics.
Directory of Open Access Journals (Sweden)
Jake M Ferguson
2014-06-01
Full Text Available The early detection of disease epidemics reduces the chance of successful introductions into new locales, minimizes the number of infections, and reduces the financial impact. We develop a framework to determine the optimal sampling strategy for disease detection in zoonotic host-vector epidemiological systems when a disease goes from below detectable levels to an epidemic. We find that if the time of disease introduction is known then the optimal sampling strategy can switch abruptly between sampling only from the vector population to sampling only from the host population. We also construct time-independent optimal sampling strategies when conducting periodic sampling that can involve sampling both the host and the vector populations simultaneously. Both time-dependent and -independent solutions can be useful for sampling design, depending on whether the time of introduction of the disease is known or not. We illustrate the approach with West Nile virus, a globally-spreading zoonotic arbovirus. Though our analytical results are based on a linearization of the dynamical systems, the sampling rules appear robust over a wide range of parameter space when compared to nonlinear simulation models. Our results suggest some simple rules that can be used by practitioners when developing surveillance programs. These rules require knowledge of transition rates between epidemiological compartments, which population was initially infected, and of the cost per sample for serological tests.
Optimal sampling strategies for detecting zoonotic disease epidemics.
Ferguson, Jake M; Langebrake, Jessica B; Cannataro, Vincent L; Garcia, Andres J; Hamman, Elizabeth A; Martcheva, Maia; Osenberg, Craig W
2014-06-01
The early detection of disease epidemics reduces the chance of successful introductions into new locales, minimizes the number of infections, and reduces the financial impact. We develop a framework to determine the optimal sampling strategy for disease detection in zoonotic host-vector epidemiological systems when a disease goes from below detectable levels to an epidemic. We find that if the time of disease introduction is known then the optimal sampling strategy can switch abruptly between sampling only from the vector population to sampling only from the host population. We also construct time-independent optimal sampling strategies when conducting periodic sampling that can involve sampling both the host and the vector populations simultaneously. Both time-dependent and -independent solutions can be useful for sampling design, depending on whether the time of introduction of the disease is known or not. We illustrate the approach with West Nile virus, a globally-spreading zoonotic arbovirus. Though our analytical results are based on a linearization of the dynamical systems, the sampling rules appear robust over a wide range of parameter space when compared to nonlinear simulation models. Our results suggest some simple rules that can be used by practitioners when developing surveillance programs. These rules require knowledge of transition rates between epidemiological compartments, which population was initially infected, and of the cost per sample for serological tests.
Users’ Perceived Difficulties and Corresponding Reformulation Strategies in Google Voice Search
Directory of Open Access Journals (Sweden)
Wei Jeng
2016-06-01
Full Text Available In this article, we report users’ perceptions of query input errors and query reformulation strategies in voice search using data collected through a laboratory user study. Our results reveal that: 1 users’ perceived obstacles during a voice search can be related to speech recognition errors and topic complexity; 2 users naturally develop different strategies to deal with various types of words (e.g., acronyms, single-worded queries, non-English words with high error rates in speech recognition; and 3 users can have various emotional reactions when encounter voice input errors and they develop preferred usage occasions for voice search.
A penalty guided stochastic fractal search approach for system reliability optimization
International Nuclear Information System (INIS)
Mellal, Mohamed Arezki; Zio, Enrico
2016-01-01
Modern industry requires components and systems with high reliability levels. In this paper, we address the system reliability optimization problem. A penalty guided stochastic fractal search approach is developed for solving reliability allocation, redundancy allocation, and reliability–redundancy allocation problems. Numerical results of ten case studies are presented as benchmark problems for highlighting the superiority of the proposed approach compared to others from literature. - Highlights: • System reliability optimization is investigated. • A penalty guided stochastic fractal search approach is developed. • Results of ten case studies are compared with previously published methods. • Performance of the approach is demonstrated.
PcapDB: Search Optimized Packet Capture, Version 0.1.0.0
Energy Technology Data Exchange (ETDEWEB)
2016-11-04
PcapDB is a packet capture system designed to optimize the captured data for fast search in the typical (network incident response) use case. The technology involved in this software has been submitted via the IDEAS system and has been filed as a provisional patent. It includes the following primary components: capture: The capture component utilizes existing capture libraries to retrieve packets from network interfaces. Once retrieved the packets are passed to additional threads for sorting into flows and indexing. The sorted flows and indexes are passed to other threads so that they can be written to disk. These components are written in the C programming language. search: The search components provide a means to find relevant flows and the associated packets. A search query is parsed and represented as a search tree. Various search commands, written in C, are then used resolve this tree into a set of search results. The tree generation and search execution management components are written in python. interface: The PcapDB web interface is written in Python on the Django framework. It provides a series of pages, API's, and asynchronous tasks that allow the user to manage the capture system, perform searches, and retrieve results. Web page components are written in HTML,CSS and Javascript.
Optimizing Online Suicide Prevention: A Search Engine-Based Tailored Approach.
Arendt, Florian; Scherr, Sebastian
2017-11-01
Search engines are increasingly used to seek suicide-related information online, which can serve both harmful and helpful purposes. Google acknowledges this fact and presents a suicide-prevention result for particular search terms. Unfortunately, the result is only presented to a limited number of visitors. Hence, Google is missing the opportunity to provide help to vulnerable people. We propose a two-step approach to a tailored optimization: First, research will identify the risk factors. Second, search engines will reweight algorithms according to the risk factors. In this study, we show that the query share of the search term "poisoning" on Google shows substantial peaks corresponding to peaks in actual suicidal behavior. Accordingly, thresholds for showing the suicide-prevention result should be set to the lowest levels during the spring, on Sundays and Mondays, on New Year's Day, and on Saturdays following Thanksgiving. Search engines can help to save lives globally by utilizing a more tailored approach to suicide prevention.
Directory of Open Access Journals (Sweden)
Narinder Singh
2018-03-01
Full Text Available The quest for an efficient nature-inspired optimization technique has continued over the last few decades. In this paper, a hybrid nature-inspired optimization technique has been proposed. The hybrid algorithm has been constructed using Mean Grey Wolf Optimizer (MGWO and Whale Optimizer Algorithm (WOA. We have utilized the spiral equation of Whale Optimizer Algorithm for two procedures in the Hybrid Approach GWO (HAGWO algorithm: (i firstly, we used the spiral equation in Grey Wolf Optimizer algorithm for balance between the exploitation and the exploration process in the new hybrid approach; and (ii secondly, we also applied this equation in the whole population in order to refrain from the premature convergence and trapping in local minima. The feasibility and effectiveness of the hybrid algorithm have been tested by solving some standard benchmarks, XOR, Baloon, Iris, Breast Cancer, Welded Beam Design, Pressure Vessel Design problems and comparing the results with those obtained through other metaheuristics. The solutions prove that the newly existing hybrid variant has higher stronger stability, faster convergence rate and computational accuracy than other nature-inspired metaheuristics on the maximum number of problems and can successfully resolve the function of constrained nonlinear optimization in reality.
Win the game of Googleopoly unlocking the secret strategy of search engines
Bradley, Sean V
2015-01-01
Rank higher in search results with this guide to SEO and content building supremacy Google is not only the number one search engine in the world, it is also the number one website in the world. Only 5 percent of site visitors search past the first page of Google, so if you're not in those top ten results, you are essentially invisible. Winning the Game of Googleopoly is the ultimate roadmap to Page One Domination. The POD strategy is what gets you on that super-critical first page of Google results by increasing your page views. You'll learn how to shape your online presence for Search Engine
Hennessy, Michael H; Fishbein, Marty; Curtis, Brenda; Barrett, Daniel
2008-03-01
This article investigates two kinds of information search strategies in the context of selecting romantic partners. Confirmatory searching occurs when people ask for more information about a romantic partner in order to validate or confirm their assessment. Balanced searches are characterized by a search for risk information for partners rated as attractive and for attractiveness information about partners rated as risky in order to attain a more complete evaluation. A factorial survey computer program randomly constructed five types of partner descriptions and college-age respondents evaluated nine descriptions in terms of both health risk and romantic attractiveness outcomes. The results show little evidence of balanced search strategies: for all vignette types the respondents searched for attractiveness information. Regression analysis of the search outcomes showed no difference between males and females in the desire for attractiveness or risk information, the amount of additional information desired, or the proportion of descriptions for which more information was desired. However, an attractive physical appearance did increase the amount of additional information desired and the proportion of vignettes for which more information was desired. The results were generally inconsistent with a balanced search hypothesis; a better characterization of the respondents' strategy might be "confirmatory bias."
Directory of Open Access Journals (Sweden)
Weitian Lin
2014-01-01
Full Text Available Particle swarm optimization algorithm (PSOA is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA, and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA. Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly.
VI International Workshop on Nature Inspired Cooperative Strategies for Optimization
Otero, Fernando; Masegosa, Antonio
2014-01-01
Biological and other natural processes have always been a source of inspiration for computer science and information technology. Many emerging problem solving techniques integrate advanced evolution and cooperation strategies, encompassing a range of spatio-temporal scales for visionary conceptualization of evolutionary computation. This book is a collection of research works presented in the VI International Workshop on Nature Inspired Cooperative Strategies for Optimization (NICSO) held in Canterbury, UK. Previous editions of NICSO were held in Granada, Spain (2006 & 2010), Acireale, Italy (2007), Tenerife, Spain (2008), and Cluj-Napoca, Romania (2011). NICSO 2013 and this book provides a place where state-of-the-art research, latest ideas and emerging areas of nature inspired cooperative strategies for problem solving are vigorously discussed and exchanged among the scientific community. The breadth and variety of articles in this book report on nature inspired methods and applications such as Swarm In...
Nuclear Power Plant Outage Optimization Strategy. 2016 Edition
International Nuclear Information System (INIS)
2016-10-01
This publication is an update of IAEA-TECDOC-1315, Nuclear Power Plant Outage Optimisation Strategy, which was published in 2002, and aims to communicate good outage management practices in a manner that can be used by operators and utilities in Member States. Nuclear power plant outage management is a key factor for safe and economic nuclear power plant performance. This publication discusses plant outage strategy and how this strategy is actually implemented. The main areas that are important for outage optimization that were identified by the utilities and government organizations participating in this report are: 1) organization and management; 2) outage planning and preparation; 3) outage execution; 4) safety outage review; and 5) counter measures to avoid the extension of outages and to facilitate the work in forced outages. Good outage management practices cover many different areas of work and this publication aims to communicate these good practices in a way that they can be used effectively by operators and utilities
An automated supernova search and the design strategy
International Nuclear Information System (INIS)
Colgate, S.A.
1987-01-01
The design considerations for an automated supernova search are reviewed. If supernova are to be found a week after explosion well before light maximum of both Types I and II, and if a rate of finding of 52 per year is justified, then one needs to keep roughly 5000 galaxies under surveillance out of a full set of 15,000 galaxies at ≅50 Mpc distance. For detection at 1% of Type I maximum light requires a 30-inch telescope, 10 photoelectrons per pixel threshold, a 128 x 128 pixel photodetector operating with a 3-second integration time, and 2 seconds to slew and settle ≅1 0 . A system designed to perform this function in real-time is described. 7 refs
International Nuclear Information System (INIS)
Oliver, Mike; Jensen, Michael; Chen, Jeff; Wong, Eugene
2009-01-01
Intensity-modulated arc therapy (IMAT) is a rotational variant of intensity-modulated radiation therapy (IMRT) that can be implemented with or without angular dose rate variation. The purpose of this study is to assess optimization strategies and initial conditions using a leaf position optimization (LPO) algorithm altered for variable dose rate IMAT. A concave planning target volume (PTV) with a central cylindrical organ at risk (OAR) was used in this study. The initial IMAT arcs were approximated by multiple static beams at 5 deg. angular increments where multi-leaf collimator (MLC) leaf positions were determined from the beam's eye view to irradiate the PTV but avoid the OAR. For the optimization strategy, two arcs with arc ranges of 280 deg. and 150 deg. were employed and plans were created using LPO alone, variable dose rate optimization (VDRO) alone, simultaneous LPO and VDRO and sequential combinations of these strategies. To assess the MLC initialization effect, three single 360 deg. arc plans with different initial MLC configurations were generated using the simultaneous LPO and VDRO. The effect of changing optimization degrees of freedom was investigated by employing 3 deg., 5 deg. and 10 deg. angular sampling intervals for the two 280 deg., two 150 deg. and single arc plans using LPO and VDRO. The objective function value, a conformity index, a dose homogeneity index, mean dose to OAR and normal tissues were computed and used to evaluate the treatment plans. This study shows that the best optimization strategy for a concave target is to use simultaneous MLC LPO and VDRO. We found that the optimization result is sensitive to the choice of initial MLC aperture shapes suggesting that an LPO-based IMAT plan may not be able to overcome local minima for this geometry. In conclusion, simultaneous MLC leaf position and VDRO are needed with the most appropriate initial conditions (MLC positions, arc ranges and number of arcs) for IMAT.
Critical Assessment of Search Strategies in Systematic Reviews in Endodontics.
Yaylali, Ibrahim Ethem; Alaçam, Tayfun
2016-06-01
The aim of this study was to perform an overview of literature search strategies in systematic reviews (SRs) published in 2 endodontic journals, Journal of Endodontics and International Endodontic Journal. A search was done by using the MEDLINE (PubMed interface) database to retrieve the articles published between January 1, 2000 and December 31, 2015. The last search was on January 10, 2016. All the SRs published in the 2 journals were retrieved and screened. Eligible SRs were assessed by using 11 questions about search strategies in the SRs that were adapted from 2 guidelines (ie, AMSTAR checklist and the Cochrane Handbook). A total of 83 SRs were retrieved by electronic search. Of these, 55 were from the Journal of Endodontics, and 28 were from the International Endodontic Journal. After screening, 2 SRs were excluded, and 81 SRs were included in the study. Some issues, such as search of grey literature and contact with study authors, were not fully reported (30% and 25%, respectively). On the other hand, some issues, such as the use of index terms and key words and search in at least 2 databases, were reported in most of the SRs (97% and 95%, respectively). The overall quality of the search strategy in both journals was 61%. No significant difference was found between the 2 journals in terms of evaluation criteria (P > .05). There exist areas for improving the quality of reporting of search strategies in SRs; for example, grey literature should be searched for unpublished studies, no language limitation should be applied to databases, and authors should make an attempt to contact the authors of included studies to obtain further relevant information. Copyright © 2016 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.
Golder, Su; Loke, Yoon K; Zorzela, Liliane
2014-06-01
Research indicates that the methods used to identify data for systematic reviews of adverse effects may need to differ from other systematic reviews. To compare search methods in systematic reviews of adverse effects with other reviews. The search methodologies in 849 systematic reviews of adverse effects were compared with other reviews. Poor reporting of search strategies is apparent in both systematic reviews of adverse effects and other types of systematic reviews. Systematic reviews of adverse effects are less likely to restrict their searches to MEDLINE or include only randomised controlled trials (RCTs). The use of other databases is largely dependent on the topic area and the year the review was conducted, with more databases searched in more recent reviews. Adverse effects search terms are used by 72% of reviews and despite recommendations only two reviews report using floating subheadings. The poor reporting of search strategies in systematic reviews is universal, as is the dominance of searching MEDLINE. However, reviews of adverse effects are more likely to include a range of study designs (not just RCTs) and search beyond MEDLINE. © 2014 Crown Copyright.
Genetic evolutionary taboo search for optimal marker placement in infrared patient setup
International Nuclear Information System (INIS)
Riboldi, M; Baroni, G; Spadea, M F; Tagaste, B; Garibaldi, C; Cambria, R; Orecchia, R; Pedotti, A
2007-01-01
In infrared patient setup adequate selection of the external fiducial configuration is required for compensating inner target displacements (target registration error, TRE). Genetic algorithms (GA) and taboo search (TS) were applied in a newly designed approach to optimal marker placement: the genetic evolutionary taboo search (GETS) algorithm. In the GETS paradigm, multiple solutions are simultaneously tested in a stochastic evolutionary scheme, where taboo-based decision making and adaptive memory guide the optimization process. The GETS algorithm was tested on a group of ten prostate patients, to be compared to standard optimization and to randomly selected configurations. The changes in the optimal marker configuration, when TRE is minimized for OARs, were specifically examined. Optimal GETS configurations ensured a 26.5% mean decrease in the TRE value, versus 19.4% for conventional quasi-Newton optimization. Common features in GETS marker configurations were highlighted in the dataset of ten patients, even when multiple runs of the stochastic algorithm were performed. Including OARs in TRE minimization did not considerably affect the spatial distribution of GETS marker configurations. In conclusion, the GETS algorithm proved to be highly effective in solving the optimal marker placement problem. Further work is needed to embed site-specific deformation models in the optimization process
Selva, Anna; Solà, Ivan; Zhang, Yuan; Pardo-Hernandez, Hector; Haynes, R Brian; Martínez García, Laura; Navarro, Tamara; Schünemann, Holger; Alonso-Coello, Pablo
2017-08-30
Identifying scientific literature addressing patients' views and preferences is complex due to the wide range of studies that can be informative and the poor indexing of this evidence. Given the lack of guidance we developed a search strategy to retrieve this type of evidence. We assembled an initial list of terms from several sources, including the revision of the terms and indexing of topic-related studies and, methods research literature, and other relevant projects and systematic reviews. We used the relative recall approach, evaluating the capacity of the designed search strategy for retrieving studies included in relevant systematic reviews for the topic. We implemented in practice the final version of the search strategy for conducting systematic reviews and guidelines, and calculated search's precision and the number of references needed to read (NNR). We assembled an initial version of the search strategy, which had a relative recall of 87.4% (yield of 132/out of 151 studies). We then added some additional terms from the studies not initially identified, and re-tested this improved version against the studies included in a new set of systematic reviews, reaching a relative recall of 85.8% (151/out of 176 studies, 95% CI 79.9 to 90.2). This final version of the strategy includes two sets of terms related with two domains: "Patient Preferences and Decision Making" and "Health State Utilities Values". When we used the search strategy for the development of systematic reviews and clinical guidelines we obtained low precision values (ranging from 2% to 5%), and the NNR from 20 to 50. This search strategy fills an important research gap in this field. It will help systematic reviewers, clinical guideline developers, and policy-makers to retrieve published research on patients' views and preferences. In turn, this will facilitate the inclusion of this critical aspect when formulating heath care decisions, including recommendations.
Optimal Dynamic Strategies for Index Tracking and Algorithmic Trading
Ward, Brian
In this thesis we study dynamic strategies for index tracking and algorithmic trading. Tracking problems have become ever more important in Financial Engineering as investors seek to precisely control their portfolio risks and exposures over different time horizons. This thesis analyzes various tracking problems and elucidates the tracking errors and strategies one can employ to minimize those errors and maximize profit. In Chapters 2 and 3, we study the empirical tracking properties of exchange traded funds (ETFs), leveraged ETFs (LETFs), and futures products related to spot gold and the Chicago Board Option Exchange (CBOE) Volatility Index (VIX), respectively. These two markets provide interesting and differing examples for understanding index tracking. We find that static strategies work well in the nonleveraged case for gold, but fail to track well in the corresponding leveraged case. For VIX, tracking via neither ETFs, nor futures\\ portfolios succeeds, even in the nonleveraged case. This motivates the need for dynamic strategies, some of which we construct in these two chapters and further expand on in Chapter 4. There, we analyze a framework for index tracking and risk exposure control through financial derivatives. We derive a tracking condition that restricts our exposure choices and also define a slippage process that characterizes the deviations from the index over longer horizons. The framework is applied to a number of models, for example, Black Scholes model and Heston model for equity index tracking, as well as the Square Root (SQR) model and the Concatenated Square Root (CSQR) model for VIX tracking. By specifying how each of these models fall into our framework, we are able to understand the tracking errors in each of these models. Finally, Chapter 5 analyzes a tracking problem of a different kind that arises in algorithmic trading: schedule following for optimal execution. We formulate and solve a stochastic control problem to obtain the optimal
Cost-effectiveness analysis of optimal strategy for tumor treatment
International Nuclear Information System (INIS)
Pang, Liuyong; Zhao, Zhong; Song, Xinyu
2016-01-01
We propose and analyze an antitumor model with combined immunotherapy and chemotherapy. Firstly, we explore the treatment effects of single immunotherapy and single chemotherapy, respectively. Results indicate that neither immunotherapy nor chemotherapy alone are adequate to cure a tumor. Hence, we apply optimal theory to investigate how the combination of immunotherapy and chemotherapy should be implemented, for a certain time period, in order to reduce the number of tumor cells, while minimizing the implementation cost of the treatment strategy. Secondly, we establish the existence of the optimality system and use Pontryagin’s Maximum Principle to characterize the optimal levels of the two treatment measures. Furthermore, we calculate the incremental cost-effectiveness ratios to analyze the cost-effectiveness of all possible combinations of the two treatment measures. Finally, numerical results show that the combination of immunotherapy and chemotherapy is the most cost-effective strategy for tumor treatment, and able to eliminate the entire tumor with size 4.470 × 10"8 in a year.
Energy Optimal Control Strategy of PHEV Based on PMP Algorithm
Directory of Open Access Journals (Sweden)
Tiezhou Wu
2017-01-01
Full Text Available Under the global voice of “energy saving” and the current boom in the development of energy storage technology at home and abroad, energy optimal control of the whole hybrid electric vehicle power system, as one of the core technologies of electric vehicles, is bound to become a hot target of “clean energy” vehicle development and research. This paper considers the constraints to the performance of energy storage system in Parallel Hybrid Electric Vehicle (PHEV, from which lithium-ion battery frequently charges/discharges, PHEV largely consumes energy of fuel, and their are difficulty in energy recovery and other issues in a single cycle; the research uses lithium-ion battery combined with super-capacitor (SC, which is hybrid energy storage system (Li-SC HESS, working together with internal combustion engine (ICE to drive PHEV. Combined with PSO-PI controller and Li-SC HESS internal power limited management approach, the research proposes the PHEV energy optimal control strategy. It is based on revised Pontryagin’s minimum principle (PMP algorithm, which establishes the PHEV vehicle simulation model through ADVISOR software and verifies the effectiveness and feasibility. Finally, the results show that the energy optimization control strategy can improve the instantaneity of tracking PHEV minimum fuel consumption track, implement energy saving, and prolong the life of lithium-ion batteries and thereby can improve hybrid energy storage system performance.
In Search of the Optimal Path: How Learners at Task Use an Online Dictionary
Hamel, Marie-Josee
2012-01-01
We have analyzed circa 180 navigation paths followed by six learners while they performed three language encoding tasks at the computer using an online dictionary prototype. Our hypothesis was that learners who follow an "optimal path" while navigating within the dictionary, using its search and look-up functions, would have a high chance of…
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation
DEFF Research Database (Denmark)
Witt, Carsten
2012-01-01
The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1...
In Search of Optimal Cognitive Diagnostic Model(s) for ESL Grammar Test Data
Yi, Yeon-Sook
2017-01-01
This study compares five cognitive diagnostic models in search of optimal one(s) for English as a Second Language grammar test data. Using a unified modeling framework that can represent specific models with proper constraints, the article first fit the full model (the log-linear cognitive diagnostic model, LCDM) and investigated which model…
Two-Stage Chaos Optimization Search Application in Maximum Power Point Tracking of PV Array
Directory of Open Access Journals (Sweden)
Lihua Wang
2014-01-01
Full Text Available In order to deliver the maximum available power to the load under the condition of varying solar irradiation and environment temperature, maximum power point tracking (MPPT technologies have been used widely in PV systems. Among all the MPPT schemes, the chaos method is one of the hot topics in recent years. In this paper, a novel two-stage chaos optimization method is presented which can make search faster and more effective. In the process of proposed chaos search, the improved logistic mapping with the better ergodic is used as the first carrier process. After finding the current optimal solution in a certain guarantee, the power function carrier as the secondary carrier process is used to reduce the search space of optimized variables and eventually find the maximum power point. Comparing with the traditional chaos search method, the proposed method can track the change quickly and accurately and also has better optimization results. The proposed method provides a new efficient way to track the maximum power point of PV array.
Directory of Open Access Journals (Sweden)
Vikram Kumar Kamboj
2016-04-01
Full Text Available In recent years, global warming and carbon dioxide (CO2 emission reduction have become important issues in India, as CO2 emission levels are continuing to rise in accordance with the increased volume of Indian national energy consumption under the pressure of global warming, it is crucial for Indian government to impose the effective policy to promote CO2 emission reduction. Challenge of supplying the nation with high quality and reliable electrical energy at a reasonable cost, converted government policy into deregulation and restructuring environment. This research paper presents aims to presents an effective solution for energy and environmental problems of electric power using an efficient and powerful hybrid optimization algorithm: Hybrid Harmony search-random search algorithm. The proposed algorithm is tested for standard IEEE-14 bus, -30 bus and -56 bus system. The effectiveness of proposed hybrid algorithm is compared with others well known evolutionary, heuristics and meta-heuristics search algorithms. For multi-objective unit commitment, it is found that as there are conflicting relationship between cost and emission, if the performance in cost criterion is improved, performance in the emission is seen to deteriorate.
Optimal knockout strategies in genome-scale metabolic networks using particle swarm optimization.
Nair, Govind; Jungreuthmayer, Christian; Zanghellini, Jürgen
2017-02-01
Knockout strategies, particularly the concept of constrained minimal cut sets (cMCSs), are an important part of the arsenal of tools used in manipulating metabolic networks. Given a specific design, cMCSs can be calculated even in genome-scale networks. We would however like to find not only the optimal intervention strategy for a given design but the best possible design too. Our solution (PSOMCS) is to use particle swarm optimization (PSO) along with the direct calculation of cMCSs from the stoichiometric matrix to obtain optimal designs satisfying multiple objectives. To illustrate the working of PSOMCS, we apply it to a toy network. Next we show its superiority by comparing its performance against other comparable methods on a medium sized E. coli core metabolic network. PSOMCS not only finds solutions comparable to previously published results but also it is orders of magnitude faster. Finally, we use PSOMCS to predict knockouts satisfying multiple objectives in a genome-scale metabolic model of E. coli and compare it with OptKnock and RobustKnock. PSOMCS finds competitive knockout strategies and designs compared to other current methods and is in some cases significantly faster. It can be used in identifying knockouts which will force optimal desired behaviors in large and genome scale metabolic networks. It will be even more useful as larger metabolic models of industrially relevant organisms become available.
Energy Technology Data Exchange (ETDEWEB)
Renaut, R.; He, Q. [Arizona State Univ., Tempe, AZ (United States)
1994-12-31
In a new parallel iterative algorithm for unconstrained optimization by multisplitting is proposed. In this algorithm the original problem is split into a set of small optimization subproblems which are solved using well known sequential algorithms. These algorithms are iterative in nature, e.g. DFP variable metric method. Here the authors use sequential algorithms based on an inexact subspace search, which is an extension to the usual idea of an inexact fine search. Essentially the idea of the inexact line search for nonlinear minimization is that at each iteration the authors only find an approximate minimum in the line search direction. Hence by inexact subspace search, they mean that, instead of finding the minimum of the subproblem at each interation, they do an incomplete down hill search to give an approximate minimum. Some convergence and numerical results for this algorithm will be presented. Further, the original theory will be generalized to the situation with a singular Hessian. Applications for nonlinear least squares problems will be presented. Experimental results will be presented for implementations on an Intel iPSC/860 Hypercube with 64 nodes as well as on the Intel Paragon.
Directory of Open Access Journals (Sweden)
Thi Rein Myo
2008-11-01
Full Text Available Optimal point-to-point trajectory planning for planar redundant manipulator is considered in this study. The main objective is to minimize the sum of the position error of the end-effector at each intermediate point along the trajectory so that the end-effector can track the prescribed trajectory accurately. An algorithm combining Genetic Algorithm and Pattern Search as a Generalized Pattern Search GPS is introduced to design the optimal trajectory. To verify the proposed algorithm, simulations for a 3-D-O-F planar manipulator with different end-effector trajectories have been carried out. A comparison between the Genetic Algorithm and the Generalized Pattern Search shows that The GPS gives excellent tracking performance.
A Particle Swarm Optimization-Based Approach with Local Search for Predicting Protein Folding.
Yang, Cheng-Hong; Lin, Yu-Shiun; Chuang, Li-Yeh; Chang, Hsueh-Wei
2017-10-01
The hydrophobic-polar (HP) model is commonly used for predicting protein folding structures and hydrophobic interactions. This study developed a particle swarm optimization (PSO)-based algorithm combined with local search algorithms; specifically, the high exploration PSO (HEPSO) algorithm (which can execute global search processes) was combined with three local search algorithms (hill-climbing algorithm, greedy algorithm, and Tabu table), yielding the proposed HE-L-PSO algorithm. By using 20 known protein structures, we evaluated the performance of the HE-L-PSO algorithm in predicting protein folding in the HP model. The proposed HE-L-PSO algorithm exhibited favorable performance in predicting both short and long amino acid sequences with high reproducibility and stability, compared with seven reported algorithms. The HE-L-PSO algorithm yielded optimal solutions for all predicted protein folding structures. All HE-L-PSO-predicted protein folding structures possessed a hydrophobic core that is similar to normal protein folding.
Genetic local search algorithm for optimization design of diffractive optical elements.
Zhou, G; Chen, Y; Wang, Z; Song, H
1999-07-10
We propose a genetic local search algorithm (GLSA) for the optimization design of diffractive optical elements (DOE's). This hybrid algorithm incorporates advantages of both genetic algorithm (GA) and local search techniques. It appears better able to locate the global minimum compared with a canonical GA. Sample cases investigated here include the optimization design of binary-phase Dammann gratings, continuous surface-relief grating array generators, and a uniform top-hat focal plane intensity profile generator. Two GLSA's whose incorporated local search techniques are the hill-climbing method and the simulated annealing algorithm are investigated. Numerical experimental results demonstrate that the proposed algorithm is highly efficient and robust. DOE's that have high diffraction efficiency and excellent uniformity can be achieved by use of the algorithm we propose.
Optimal Bidding Strategy for Renewable Microgrid with Active Network Management
Directory of Open Access Journals (Sweden)
Seung Wan Kim
2016-01-01
Full Text Available Active Network Management (ANM enables a microgrid to optimally dispatch the active/reactive power of its Renewable Distributed Generation (RDG and Battery Energy Storage System (BESS units in real time. Thus, a microgrid with high penetration of RDGs can handle their uncertainties and variabilities to achieve the stable operation using ANM. However, the actual power flow in the line connecting the main grid and microgrid may deviate significantly from the day-ahead bids if the bids are determined without consideration of the real-time adjustment through ANM, which will lead to a substantial imbalance cost. Therefore, this study proposes a formulation for obtaining an optimal bidding which reflects the change of power flow in the connecting line by real-time adjustment using ANM. The proposed formulation maximizes the expected profit of the microgrid considering various network and physical constraints. The effectiveness of the proposed bidding strategy is verified through the simulations with a 33-bus test microgrid. The simulation results show that the proposed bidding strategy improves the expected operating profit by reducing the imbalance cost to a greater degree compared to the basic bidding strategy without consideration of ANM.
Optimization of travel salesman problem using the ant colony system and Greedy search
International Nuclear Information System (INIS)
Esquivel E, J.; Ordonez A, A.; Ortiz S, J. J.
2008-01-01
In this paper we present some results obtained during the development of optimization systems that can be used to design refueling and patterns of control rods in a BWR. These systems use ant colonies and Greedy search. The first phase of this project is to be familiar with these optimization techniques applied to the problem of travel salesman problem (TSP). The utility of TSP study is that, like the refueling design and pattern design of control rods are problems of combinative optimization. Even, the similarity with the problem of the refueling design is remarkable. It is presented some results for the TSP with the 32 state capitals of Mexico country. (Author)
Cost Effectiveness Analysis of Optimal Malaria Control Strategies in Kenya
Directory of Open Access Journals (Sweden)
Gabriel Otieno
2016-03-01
Full Text Available Malaria remains a leading cause of mortality and morbidity among the children under five and pregnant women in sub-Saharan Africa, but it is preventable and controllable provided current recommended interventions are properly implemented. Better utilization of malaria intervention strategies will ensure the gain for the value for money and producing health improvements in the most cost effective way. The purpose of the value for money drive is to develop a better understanding (and better articulation of costs and results so that more informed, evidence-based choices could be made. Cost effectiveness analysis is carried out to inform decision makers on how to determine where to allocate resources for malaria interventions. This study carries out cost effective analysis of one or all possible combinations of the optimal malaria control strategies (Insecticide Treated Bednets—ITNs, Treatment, Indoor Residual Spray—IRS and Intermittent Preventive Treatment for Pregnant Women—IPTp for the four different transmission settings in order to assess the extent to which the intervention strategies are beneficial and cost effective. For the four different transmission settings in Kenya the optimal solution for the 15 strategies and their associated effectiveness are computed. Cost-effective analysis using Incremental Cost Effectiveness Ratio (ICER was done after ranking the strategies in order of the increasing effectiveness (total infections averted. The findings shows that for the endemic regions the combination of ITNs, IRS, and IPTp was the most cost-effective of all the combined strategies developed in this study for malaria disease control and prevention; for the epidemic prone areas is the combination of the treatment and IRS; for seasonal areas is the use of ITNs plus treatment; and for the low risk areas is the use of treatment only. Malaria transmission in Kenya can be minimized through tailor-made intervention strategies for malaria control
Testing of Strategies for the Acceleration of the Cost Optimization
Energy Technology Data Exchange (ETDEWEB)
Ponciroli, Roberto [Argonne National Lab. (ANL), Argonne, IL (United States); Vilim, Richard B. [Argonne National Lab. (ANL), Argonne, IL (United States)
2017-08-31
The general problem addressed in the Nuclear-Renewable Hybrid Energy System (N-R HES) project is finding the optimum economical dispatch (ED) and capacity planning solutions for the hybrid energy systems. In the present test-problem configuration, the N-R HES unit is composed of three electrical power-generating components, i.e. the Balance of Plant (BOP), the Secondary Energy Source (SES), and the Energy Storage (ES). In addition, there is an Industrial Process (IP), which is devoted to hydrogen generation. At this preliminary stage, the goal is to find the power outputs of each one of the N-R HES unit components (BOP, SES, ES) and the IP hydrogen production level that maximizes the unit profit by simultaneously satisfying individual component operational constraints. The optimization problem is meant to be solved in the Risk Analysis Virtual Environment (RAVEN) framework. The dynamic response of the N-R HES unit components is simulated by using dedicated object-oriented models written in the Modelica modeling language. Though this code coupling provides for very accurate predictions, the ensuing optimization problem is characterized by a very large number of solution variables. To ease the computational burden and to improve the path to a converged solution, a method to better estimate the initial guess for the optimization problem solution was developed. The proposed approach led to the definition of a suitable Monte Carlo-based optimization algorithm (called the preconditioner), which provides an initial guess for the optimal N-R HES power dispatch and the optimal installed capacity for each one of the unit components. The preconditioner samples a set of stochastic power scenarios for each one of the N-R HES unit components, and then for each of them the corresponding value of a suitably defined cost function is evaluated. After having simulated a sufficient number of power histories, the configuration which ensures the highest profit is selected as the optimal
Directory of Open Access Journals (Sweden)
Alejandro MURRIETA-MENDOZA
2017-08-01
Full Text Available With the objective of reducing the flight cost and the amount of polluting emissions released in the atmosphere, a new optimization algorithm considering the climb, cruise and descent phases is presented for the reference vertical flight trajectory. The selection of the reference vertical navigation speeds and altitudes was solved as a discrete combinatory problem by means of a graph-tree passing through nodes using the beam search optimization technique. To achieve a compromise between the execution time and the algorithm’s ability to find the global optimal solution, a heuristic methodology introducing a parameter called “optimism coefficient was used in order to estimate the trajectory’s flight cost at every node. The optimal trajectory cost obtained with the developed algorithm was compared with the cost of the optimal trajectory provided by a commercial flight management system(FMS. The global optimal solution was validated against an exhaustive search algorithm(ESA, other than the proposed algorithm. The developed algorithm takes into account weather effects, step climbs during cruise and air traffic management constraints such as constant altitude segments, constant cruise Mach, and a pre-defined reference lateral navigation route. The aircraft fuel burn was computed using a numerical performance model which was created and validated using flight test experimental data.
Directory of Open Access Journals (Sweden)
Chao-Chih Lin
2017-10-01
Full Text Available A new transient-based hybrid heuristic approach is developed to optimize a transient generation process and to detect leaks in pipe networks. The approach couples the ordinal optimization approach (OOA and the symbiotic organism search (SOS to solve the optimization problem by means of iterations. A pipe network analysis model (PNSOS is first used to determine steady-state head distribution and pipe flow rates. The best transient generation point and its relevant valve operation parameters are optimized by maximizing the objective function of transient energy. The transient event is created at the chosen point, and the method of characteristics (MOC is used to analyze the transient flow. The OOA is applied to sift through the candidate pipes and the initial organisms with leak information. The SOS is employed to determine the leaks by minimizing the sum of differences between simulated and computed head at the observation points. Two synthetic leaking scenarios, a simple pipe network and a water distribution network (WDN, are chosen to test the performance of leak detection ordinal symbiotic organism search (LDOSOS. Leak information can be accurately identified by the proposed approach for both of the scenarios. The presented technique makes a remarkable contribution to the success of leak detection in the pipe networks.
Optimization of fuel cells for BWR using Path Re linking and flexible strategies of solution
International Nuclear Information System (INIS)
Castillo M, J. A.; Ortiz S, J. J.; Torres V, M.; Perusquia del Cueto, R.
2009-10-01
In this work are presented the obtained preliminary results to design nuclear fuel cells for boiling water reactors (BWR) using new strategies. To carry out the cells design some of the used rules in the fuel administration were discarded and other were implemented. The above-mentioned with the idea of making a comparative analysis between the used rules and those implemented here, under the hypothesis that it can be possible to design nuclear fuel cells without using all the used rules and executing the security restrictions that are imposed in these cases. To evaluate the quality of the obtained cells it was taken into account the power pick factor and the infinite multiplication factor, in the same sense, to evaluate the proposed configurations and to obtain the mentioned parameters was used the CASMO-4 code. To optimize the design it is uses the combinatorial optimization technique named Path Re linking and the Dispersed Search as local search method. The preliminary results show that it is possible to implement new strategies for the cells design of nuclear fuel following new rules. (Author)
Directory of Open Access Journals (Sweden)
Y. Gholipour
Full Text Available This paper focuses on a metamodel-based design optimization algorithm. The intention is to improve its computational cost and convergence rate. Metamodel-based optimization method introduced here, provides the necessary means to reduce the computational cost and convergence rate of the optimization through a surrogate. This algorithm is a combination of a high quality approximation technique called Inverse Distance Weighting and a meta-heuristic algorithm called Harmony Search. The outcome is then polished by a semi-tabu search algorithm. This algorithm adopts a filtering system and determines solution vectors where exact simulation should be applied. The performance of the algorithm is evaluated by standard truss design problems and there has been a significant decrease in the computational effort and improvement of convergence rate.
Issues and Strategies in Solving Multidisciplinary Optimization Problems
Patnaik, Surya
2013-01-01
Optimization research at NASA Glenn Research Center has addressed the design of structures, aircraft and airbreathing propulsion engines. The accumulated multidisciplinary design activity is collected under a testbed entitled COMETBOARDS. Several issues were encountered during the solution of the problems. Four issues and the strategies adapted for their resolution are discussed. This is followed by a discussion on analytical methods that is limited to structural design application. An optimization process can lead to an inefficient local solution. This deficiency was encountered during design of an engine component. The limitation was overcome through an augmentation of animation into optimization. Optimum solutions obtained were infeasible for aircraft and airbreathing propulsion engine problems. Alleviation of this deficiency required a cascading of multiple algorithms. Profile optimization of a beam produced an irregular shape. Engineering intuition restored the regular shape for the beam. The solution obtained for a cylindrical shell by a subproblem strategy converged to a design that can be difficult to manufacture. Resolution of this issue remains a challenge. The issues and resolutions are illustrated through a set of problems: Design of an engine component, Synthesis of a subsonic aircraft, Operation optimization of a supersonic engine, Design of a wave-rotor-topping device, Profile optimization of a cantilever beam, and Design of a cylindrical shell. This chapter provides a cursory account of the issues. Cited references provide detailed discussion on the topics. Design of a structure can also be generated by traditional method and the stochastic design concept. Merits and limitations of the three methods (traditional method, optimization method and stochastic concept) are illustrated. In the traditional method, the constraints are manipulated to obtain the design and weight is back calculated. In design optimization, the weight of a structure becomes the
Solving the wind farm layout optimization problem using random search algorithm
DEFF Research Database (Denmark)
Feng, Ju; Shen, Wen Zhong
2015-01-01
, in which better results than the genetic algorithm (GA) and the old version of the RS algorithm are obtained. Second it is applied to the Horns Rev 1 WF, and the optimized layouts obtain a higher power production than its original layout, both for the real scenario and for two constructed scenarios......Wind farm (WF) layout optimization is to find the optimal positions of wind turbines (WTs) inside a WF, so as to maximize and/or minimize a single objective or multiple objectives, while satisfying certain constraints. In this work, a random search (RS) algorithm based on continuous formulation....... In this application, it is also found that in order to get consistent and reliable optimization results, up to 360 or more sectors for wind direction have to be used. Finally, considering the inevitable inter-annual variations in the wind conditions, the robustness of the optimized layouts against wind condition...
Search strategy has influenced the discovery rate of human viruses.
Rosenberg, Ronald; Johansson, Michael A; Powers, Ann M; Miller, Barry R
2013-08-20
A widely held concern is that the pace of infectious disease emergence has been increasing. We have analyzed the rate of discovery of pathogenic viruses, the preeminent source of newly discovered causes of human disease, from 1897 through 2010. The rate was highest during 1950-1969, after which it moderated. This general picture masks two distinct trends: for arthropod-borne viruses, which comprised 39% of pathogenic viruses, the discovery rate peaked at three per year during 1960-1969, but subsequently fell nearly to zero by 1980; however, the rate of discovery of nonarboviruses remained stable at about two per year from 1950 through 2010. The period of highest arbovirus discovery coincided with a comprehensive program supported by The Rockefeller Foundation of isolating viruses from humans, animals, and arthropod vectors at field stations in Latin America, Africa, and India. The productivity of this strategy illustrates the importance of location, approach, long-term commitment, and sponsorship in the discovery of emerging pathogens.
Zhang, Guoxian; Ferrari, Silvia; Cai, Chenghui
2012-02-01
This paper investigates the comparative performance of several information-driven search strategies and decision rules using a canonical target classification problem. Five sensor models are considered: one obtained from classical estimation theory and four obtained from Bernoulli, Poisson, binomial, and mixture-of-binomial distributions. A systematic approach is presented for deriving information functions that represent the expected utility of future sensor measurements from mutual information, Rènyi divergence, Kullback-Leibler divergence, information potential, quadratic entropy, and the Cauchy-Schwarz distance. The resulting information-driven strategies are compared to direct-search, alert-confirm, task-driven (TS), and log-likelihood-ratio (LLR) search strategies. Extensive numerical simulations show that quadratic entropy typically leads to the most effective search strategy with respect to correct-classification rates. In the presence of prior information, the quadratic-entropy-driven strategy also displays the lowest rate of false alarms. However, when prior information is absent or very noisy, TS and LLR strategies achieve the lowest false-alarm rates for the Bernoulli, mixture-of-binomial, and classical sensor models.
Strategies for Optimizing Algal Biology for Enhanced Biomass Production
Energy Technology Data Exchange (ETDEWEB)
Barry, Amanda N.; Starkenburg, Shawn R.; Sayre, Richard T., E-mail: rsayre@newmexicoconsortium.org [Los Alamos National Laboratory, New Mexico Consortium, Los Alamos, NM (United States)
2015-02-02
One of the most environmentally sustainable ways to produce high-energy density (oils) feed stocks for the production of liquid transportation fuels is from biomass. Photosynthetic carbon capture combined with biomass combustion (point source) and subsequent carbon capture and sequestration has also been proposed in the intergovernmental panel on climate change report as one of the most effective and economical strategies to remediate atmospheric greenhouse gases. To maximize photosynthetic carbon capture efficiency and energy-return-on-investment, we must develop biomass production systems that achieve the greatest yields with the lowest inputs. Numerous studies have demonstrated that microalgae have among the greatest potentials for biomass production. This is in part due to the fact that all alga cells are photoautotrophic, they have active carbon concentrating mechanisms to increase photosynthetic productivity, and all the biomass is harvestable unlike plants. All photosynthetic organisms, however, convert only a fraction of the solar energy they capture into chemical energy (reduced carbon or biomass). To increase aerial carbon capture rates and biomass productivity, it will be necessary to identify the most robust algal strains and increase their biomass production efficiency often by genetic manipulation. We review recent large-scale efforts to identify the best biomass producing strains and metabolic engineering strategies to improve aerial productivity. These strategies include optimization of photosynthetic light-harvesting antenna size to increase energy capture and conversion efficiency and the potential development of advanced molecular breeding techniques. To date, these strategies have resulted in up to twofold increases in biomass productivity.
Strategies for Optimizing Algal Biology for Enhanced Biomass Production
International Nuclear Information System (INIS)
Barry, Amanda N.; Starkenburg, Shawn R.; Sayre, Richard T.
2015-01-01
One of the most environmentally sustainable ways to produce high-energy density (oils) feed stocks for the production of liquid transportation fuels is from biomass. Photosynthetic carbon capture combined with biomass combustion (point source) and subsequent carbon capture and sequestration has also been proposed in the intergovernmental panel on climate change report as one of the most effective and economical strategies to remediate atmospheric greenhouse gases. To maximize photosynthetic carbon capture efficiency and energy-return-on-investment, we must develop biomass production systems that achieve the greatest yields with the lowest inputs. Numerous studies have demonstrated that microalgae have among the greatest potentials for biomass production. This is in part due to the fact that all alga cells are photoautotrophic, they have active carbon concentrating mechanisms to increase photosynthetic productivity, and all the biomass is harvestable unlike plants. All photosynthetic organisms, however, convert only a fraction of the solar energy they capture into chemical energy (reduced carbon or biomass). To increase aerial carbon capture rates and biomass productivity, it will be necessary to identify the most robust algal strains and increase their biomass production efficiency often by genetic manipulation. We review recent large-scale efforts to identify the best biomass producing strains and metabolic engineering strategies to improve aerial productivity. These strategies include optimization of photosynthetic light-harvesting antenna size to increase energy capture and conversion efficiency and the potential development of advanced molecular breeding techniques. To date, these strategies have resulted in up to twofold increases in biomass productivity.
Sleuth: A quasi-model-independent search strategy for new physics
International Nuclear Information System (INIS)
Bruce O. Knuteson
2001-01-01
How can we search for new physics when we only vaguely know what it should look like? How can we perform an unbiased yet data-driven search? If we see apparently anomalous events in our data, how can we quantify their ''interestingness'' a posteriori? We present an analysis strategy (SLEUTH) that simultaneously addresses each of these questions, and we demonstrate its application to over thirty exclusive final states in data collected by D0 in Run I of the Fermilab Tevatron
Multi-Objective Optimization of a Hybrid ESS Based on Optimal Energy Management Strategy for LHDs
Directory of Open Access Journals (Sweden)
Jiajun Liu
2017-10-01
Full Text Available Energy storage systems (ESS play an important role in the performance of mining vehicles. A hybrid ESS combining both batteries (BTs and supercapacitors (SCs is one of the most promising solutions. As a case study, this paper discusses the optimal hybrid ESS sizing and energy management strategy (EMS of 14-ton underground load-haul-dump vehicles (LHDs. Three novel contributions are added to the relevant literature. First, a multi-objective optimization is formulated regarding energy consumption and the total cost of a hybrid ESS, which are the key factors of LHDs, and a battery capacity degradation model is used. During the process, dynamic programming (DP-based EMS is employed to obtain the optimal energy consumption and hybrid ESS power profiles. Second, a 10-year life cycle cost model of a hybrid ESS for LHDs is established to calculate the total cost, including capital cost, operating cost, and replacement cost. According to the optimization results, three solutions chosen from the Pareto front are compared comprehensively, and the optimal one is selected. Finally, the optimal and battery-only options are compared quantitatively using the same objectives, and the hybrid ESS is found to be a more economical and efficient option.
Directory of Open Access Journals (Sweden)
Debkalpa Goswami
2015-03-01
Full Text Available Ultrasonic machining (USM is a mechanical material removal process used to erode holes and cavities in hard or brittle workpieces by using shaped tools, high-frequency mechanical motion and an abrasive slurry. Unlike other non-traditional machining processes, such as laser beam and electrical discharge machining, USM process does not thermally damage the workpiece or introduce significant levels of residual stress, which is important for survival of materials in service. For having enhanced machining performance and better machined job characteristics, it is often required to determine the optimal control parameter settings of an USM process. The earlier mathematical approaches for parametric optimization of USM processes have mostly yielded near optimal or sub-optimal solutions. In this paper, two almost unexplored non-conventional optimization techniques, i.e. gravitational search algorithm (GSA and fireworks algorithm (FWA are applied for parametric optimization of USM processes. The optimization performance of these two algorithms is compared with that of other popular population-based algorithms, and the effects of their algorithm parameters on the derived optimal solutions and computational speed are also investigated. It is observed that FWA provides the best optimal results for the considered USM processes.
Selecting Optimal Feature Set in High-Dimensional Data by Swarm Search
Directory of Open Access Journals (Sweden)
Simon Fong
2013-01-01
Full Text Available Selecting the right set of features from data of high dimensionality for inducing an accurate classification model is a tough computational challenge. It is almost a NP-hard problem as the combinations of features escalate exponentially as the number of features increases. Unfortunately in data mining, as well as other engineering applications and bioinformatics, some data are described by a long array of features. Many feature subset selection algorithms have been proposed in the past, but not all of them are effective. Since it takes seemingly forever to use brute force in exhaustively trying every possible combination of features, stochastic optimization may be a solution. In this paper, we propose a new feature selection scheme called Swarm Search to find an optimal feature set by using metaheuristics. The advantage of Swarm Search is its flexibility in integrating any classifier into its fitness function and plugging in any metaheuristic algorithm to facilitate heuristic search. Simulation experiments are carried out by testing the Swarm Search over some high-dimensional datasets, with different classification algorithms and various metaheuristic algorithms. The comparative experiment results show that Swarm Search is able to attain relatively low error rates in classification without shrinking the size of the feature subset to its minimum.
Hopmann, Ch.; Windeck, C.; Kurth, K.; Behr, M.; Siegbert, R.; Elgeti, S.
2014-05-01
The rheological design of profile extrusion dies is one of the most challenging tasks in die design. As no analytical solution is available, the quality and the development time for a new design highly depend on the empirical knowledge of the die manufacturer. Usually, prior to start production several time-consuming, iterative running-in trials need to be performed to check the profile accuracy and the die geometry is reworked. An alternative are numerical flow simulations. These simulations enable to calculate the melt flow through a die so that the quality of the flow distribution can be analyzed. The objective of a current research project is to improve the automated optimization of profile extrusion dies. Special emphasis is put on choosing a convenient starting geometry and parameterization, which enable for possible deformations. In this work, three commonly used design features are examined with regard to their influence on the optimization results. Based on the results, a strategy is derived to select the most relevant areas of the flow channels for the optimization. For these characteristic areas recommendations are given concerning an efficient parameterization setup that still enables adequate deformations of the flow channel geometry. Exemplarily, this approach is applied to a L-shaped profile with different wall thicknesses. The die is optimized automatically and simulation results are qualitatively compared with experimental results. Furthermore, the strategy is applied to a complex extrusion die of a floor skirting profile to prove the universal adaptability.
Optimization of routing strategies for data transfer in peer-to-peer networks
International Nuclear Information System (INIS)
Morioka, Atsushi; Igarashi, Akito
2014-01-01
Since peer-to-peer file-sharing systems have become familiar recently, the information traffic in the networks is increasing. Therefore it causes various traffic problems in peer-to-peer networks. In this paper, we model some features of the peer-to-peer networks, and investigate the traffic problems. Peer-to-peer networks have two notable characters. One is that each peer frequently searches for a file and download it from a peer who has the requested file. To decide whether a peer has the requested file or not in modelling of the search and download process, we introduce file-parameter P j , which expresses the amount of files stored in peer j. It is assumed that if P j is large, peer j has many files and can meet other peers' requests with high probability. The other character is that peers leave and join into the network repeatedly. Many researchers address traffic problems of data transfer in computer communication networks. To our knowledge, however, no reports focus on those in peer-to-peer networks whose topology changes with time. For routing paths of data transfer, generally, the shortest paths are used in usual computer networks. In this paper, we introduce a new optimal routing strategy which uses weights of peers to avoid traffic congestion. We find that the new routing strategy is superior to the shortest path strategy in terms of congestion frequency in data transfer
Optimization of fuel cycle strategies with constraints on uranium availability
International Nuclear Information System (INIS)
Silvennoinen, P.; Vira, J.; Westerberg, R.
1982-01-01
Optimization of nuclear reactor and fuel cycle strategies is studied under the influence of reduced availability of uranium. The analysis is separated in two distinct steps. First, the global situation is considered within given high and low projections of the installed capacity up to the year 2025. Uranium is regarded as an exhaustible resource whose production cost would increase proportionally to increasing cumulative exploitation. Based on the estimates obtained for the uranium cost, a global strategy is derived by splitting the installed capacity between light water reactor (LWR) once-through, LWR recycle, and fast breeder reactor (FBR) alternatives. In the second phase, the nuclear program of an individual utility is optimized within the constraints imposed from the global scenario. Results from the global scenarios indicate that in a reference case the uranium price would triple by the year 2000, and the price escalation would continue throughout the planning period. In a pessimistic growth scenario where the global nuclear capacity would not exceed 600 GW(electric) in 2025, the uranium price would almost double by 2000. In both global scenarios, FBRs would be introduced, in the reference case after 2000 and in the pessimistic case after 2010. In spite of the increases in the uranium prices, the levelized power production cost would increase only by 45% up to 2025 in the utility case provided that the plutonium is incinerated as a substitute fuel
Web malware spread modelling and optimal control strategies
Liu, Wanping; Zhong, Shouming
2017-02-01
The popularity of the Web improves the growth of web threats. Formulating mathematical models for accurate prediction of malicious propagation over networks is of great importance. The aim of this paper is to understand the propagation mechanisms of web malware and the impact of human intervention on the spread of malicious hyperlinks. Considering the characteristics of web malware, a new differential epidemic model which extends the traditional SIR model by adding another delitescent compartment is proposed to address the spreading behavior of malicious links over networks. The spreading threshold of the model system is calculated, and the dynamics of the model is theoretically analyzed. Moreover, the optimal control theory is employed to study malware immunization strategies, aiming to keep the total economic loss of security investment and infection loss as low as possible. The existence and uniqueness of the results concerning the optimality system are confirmed. Finally, numerical simulations show that the spread of malware links can be controlled effectively with proper control strategy of specific parameter choice.
Hooke–Jeeves Method-used Local Search in a Hybrid Global Optimization Algorithm
Directory of Open Access Journals (Sweden)
V. D. Sulimov
2014-01-01
Full Text Available Modern methods for optimization investigation of complex systems are based on development and updating the mathematical models of systems because of solving the appropriate inverse problems. Input data desirable for solution are obtained from the analysis of experimentally defined consecutive characteristics for a system or a process. Causal characteristics are the sought ones to which equation coefficients of mathematical models of object, limit conditions, etc. belong. The optimization approach is one of the main ones to solve the inverse problems. In the main case it is necessary to find a global extremum of not everywhere differentiable criterion function. Global optimization methods are widely used in problems of identification and computation diagnosis system as well as in optimal control, computing to-mography, image restoration, teaching the neuron networks, other intelligence technologies. Increasingly complicated systems of optimization observed during last decades lead to more complicated mathematical models, thereby making solution of appropriate extreme problems significantly more difficult. A great deal of practical applications may have the problem con-ditions, which can restrict modeling. As a consequence, in inverse problems the criterion functions can be not everywhere differentiable and noisy. Available noise means that calculat-ing the derivatives is difficult and unreliable. It results in using the optimization methods without calculating the derivatives.An efficiency of deterministic algorithms of global optimization is significantly restrict-ed by their dependence on the extreme problem dimension. When the number of variables is large they use the stochastic global optimization algorithms. As stochastic algorithms yield too expensive solutions, so this drawback restricts their applications. Developing hybrid algo-rithms that combine a stochastic algorithm for scanning the variable space with deterministic local search
Pattern Nulling of Linear Antenna Arrays Using Backtracking Search Optimization Algorithm
Directory of Open Access Journals (Sweden)
Kerim Guney
2015-01-01
Full Text Available An evolutionary method based on backtracking search optimization algorithm (BSA is proposed for linear antenna array pattern synthesis with prescribed nulls at interference directions. Pattern nulling is obtained by controlling only the amplitude, position, and phase of the antenna array elements. BSA is an innovative metaheuristic technique based on an iterative process. Various numerical examples of linear array patterns with the prescribed single, multiple, and wide nulls are given to illustrate the performance and flexibility of BSA. The results obtained by BSA are compared with the results of the following seventeen algorithms: particle swarm optimization (PSO, genetic algorithm (GA, modified touring ant colony algorithm (MTACO, quadratic programming method (QPM, bacterial foraging algorithm (BFA, bees algorithm (BA, clonal selection algorithm (CLONALG, plant growth simulation algorithm (PGSA, tabu search algorithm (TSA, memetic algorithm (MA, nondominated sorting GA-2 (NSGA-2, multiobjective differential evolution (MODE, decomposition with differential evolution (MOEA/D-DE, comprehensive learning PSO (CLPSO, harmony search algorithm (HSA, seeker optimization algorithm (SOA, and mean variance mapping optimization (MVMO. The simulation results show that the linear antenna array synthesis using BSA provides low side-lobe levels and deep null levels.
Optimization of fuel cells for BWR based in Tabu modified search
International Nuclear Information System (INIS)
Martin del Campo M, C.; Francois L, J.L.; Palomera P, M.A.
2004-01-01
The advances in the development of a computational system for the design and optimization of cells for assemble of fuel of Boiling Water Reactors (BWR) are presented. The method of optimization is based on the technique of Tabu Search (Tabu Search, TS) implemented in progressive stages designed to accelerate the search and to reduce the time used in the process of optimization. It was programed an algorithm to create the first solution. Also for to diversify the generation of random numbers, required by the technical TS, it was used the Makoto Matsumoto function obtaining excellent results. The objective function has been coded in such a way that can adapt to optimize different parameters like they can be the enrichment average or the peak factor of radial power. The neutronic evaluation of the cells is carried out in a fine way by means of the HELIOS simulator. In the work the main characteristics of the system are described and an application example is presented to the design of a cell of 10x10 bars of fuel with 10 different enrichment compositions and gadolinium content. (Author)
Using Chemical Reaction Kinetics to Predict Optimal Antibiotic Treatment Strategies.
Abel Zur Wiesch, Pia; Clarelli, Fabrizio; Cohen, Ted
2017-01-01
Identifying optimal dosing of antibiotics has proven challenging-some antibiotics are most effective when they are administered periodically at high doses, while others work best when minimizing concentration fluctuations. Mechanistic explanations for why antibiotics differ in their optimal dosing are lacking, limiting our ability to predict optimal therapy and leading to long and costly experiments. We use mathematical models that describe both bacterial growth and intracellular antibiotic-target binding to investigate the effects of fluctuating antibiotic concentrations on individual bacterial cells and bacterial populations. We show that physicochemical parameters, e.g. the rate of drug transmembrane diffusion and the antibiotic-target complex half-life are sufficient to explain which treatment strategy is most effective. If the drug-target complex dissociates rapidly, the antibiotic must be kept constantly at a concentration that prevents bacterial replication. If antibiotics cross bacterial cell envelopes slowly to reach their target, there is a delay in the onset of action that may be reduced by increasing initial antibiotic concentration. Finally, slow drug-target dissociation and slow diffusion out of cells act to prolong antibiotic effects, thereby allowing for less frequent dosing. Our model can be used as a tool in the rational design of treatment for bacterial infections. It is easily adaptable to other biological systems, e.g. HIV, malaria and cancer, where the effects of physiological fluctuations of drug concentration are also poorly understood.
Survey Strategy Optimization for the Atacama Cosmology Telescope
De Bernardis, F.; Stevens, J. R.; Hasselfield, M.; Alonso, D.; Bond, J. R.; Calabrese, E.; Choi, S. K.; Crowley, K. T.; Devlin, M.; Wollack, E. J.
2016-01-01
In recent years there have been significant improvements in the sensitivity and the angular resolution of the instruments dedicated to the observation of the Cosmic Microwave Background (CMB). ACTPol is the first polarization receiver for the Atacama Cosmology Telescope (ACT) and is observing the CMB sky with arcmin resolution over approximately 2000 square degrees. Its upgrade, Advanced ACTPol (AdvACT), will observe the CMB in five frequency bands and over a larger area of the sky. We describe the optimization and implementation of the ACTPol and AdvACT surveys. The selection of the observed fields is driven mainly by the science goals, that is, small angular scale CMB measurements, B-mode measurements and cross-correlation studies. For the ACTPol survey we have observed patches of the southern galactic sky with low galactic foreground emissions which were also chosen to maximize the overlap with several galaxy surveys to allow unique cross-correlation studies. A wider field in the northern galactic cap ensured significant additional overlap with the BOSS spectroscopic survey. The exact shapes and footprints of the fields were optimized to achieve uniform coverage and to obtain cross-linked maps by observing the fields with different scan directions. We have maximized the efficiency of the survey by implementing a close to 24-hour observing strategy, switching between daytime and nighttime observing plans and minimizing the telescope idle time. We describe the challenges represented by the survey optimization for the significantly wider area observed by AdvACT, which will observe roughly half of the low-foreground sky. The survey strategies described here may prove useful for planning future ground-based CMB surveys, such as the Simons Observatory and CMB Stage IV surveys.
International Nuclear Information System (INIS)
Cox, G.; Beresford, N.A.; Alvarez-Farizo, B.; Oughton, D.; Kis, Z.; Eged, K.; Thorring, H.; Hunt, J.; Wright, S.; Barnett, C.L.; Gil, J.M.; Howard, B.J.; Crout, N.M.J.
2005-01-01
A spatially implemented model designed to assist the identification of optimal countermeasure strategies for radioactively contaminated regions is described. Collective and individual ingestion doses for people within the affected area are estimated together with collective exported ingestion dose. A range of countermeasures are incorporated within the model, and environmental restrictions have been included as appropriate. The model evaluates the effectiveness of a given combination of countermeasures through a cost function which balances the benefit obtained through the reduction in dose with the cost of implementation. The optimal countermeasure strategy is the combination of individual countermeasures (and when and where they are implemented) which gives the lowest value of the cost function. The model outputs should not be considered as definitive solutions, rather as interactive inputs to the decision making process. As a demonstration the model has been applied to a hypothetical scenario in Cumbria (UK). This scenario considered a published nuclear power plant accident scenario with a total deposition of 1.7 x 10 14 , 1.2 x 10 13 , 2.8 x 10 10 and 5.3 x 10 9 Bq for Cs-137, Sr-90, Pu-239/240 and Am-241, respectively. The model predicts that if no remediation measures were implemented the resulting collective dose would be approximately 36 000 person-Sv (predominantly from 137 Cs) over a 10-year period post-deposition. The optimal countermeasure strategy is predicted to avert approximately 33 000 person-Sv at a cost of approximately pound 160 million. The optimal strategy comprises a mixture of ploughing, AFCF (ammonium-ferric hexacyano-ferrate) administration, potassium fertiliser application, clean feeding of livestock and food restrictions. The model recommends specific areas within the contaminated area and time periods where these measures should be implemented
The search for dark matter in xenon: Innovative calibration strategies and novel search channels
Reichard, Shayne Edward
The direct detection dark matter experiment XENON1T became operational in early 2016, heralding the era of tonne-scale dark matter detectors. Direct detection experiments typically search for elastic scatters of dark matter particles off target nuclei. XENON1T's larger xenon target provides the advantage of stronger dark matter signals and lower background rates compared to its predecessors, XENON10 and XENON100; but, at the same time, calibration of the detector's response to backgrounds with traditional external sources becomes exceedingly more difficult. A 220Rn source is deployed on the XENON100 dark matter detector in order to address the challenges in calibration of tonne-scale liquid noble element detectors. I show that the subsequent 212Pb beta emission can be used for low-energy electronic recoil calibration in searches for dark matter. The isotope spreads throughout the entire active region of the detector, and its activity naturally decays below background level within a week after the source is closed. I find no increase in the activity of the troublesome 222Rn background after calibration. Alpha emitters are also distributed throughout the detector and facilitate calibration of its response to 222Rn. Using the delayed coincidence of 220Rn/216Po, I map for the first time the convective motion of particles in the XENON100 detector. Additionally, I make a competitive measurement of the half-life of 212Po, t1/2=293.9+/-(1.0)stat+/-(0.6)ns. In contrast to the elastic scattering of dark matter particles off nuclei, I explore inelastic scattering where the nucleus is excited to a low-lying state of 10-100 keV, with a subsequent prompt de-excitation. I use the inelastic structure factors for the odd-mass xenon isotopes based on state-of-the-art large-scale shell-model calculations with chiral effective field theory WIMP-nucleon currents, finding that the inelastic channel is comparable to or can dominate the elastic channel for momentum transfers around 150 Me
Optimization of Nano-Process Deposition Parameters Based on Gravitational Search Algorithm
Directory of Open Access Journals (Sweden)
Norlina Mohd Sabri
2016-06-01
Full Text Available This research is focusing on the radio frequency (RF magnetron sputtering process, a physical vapor deposition technique which is widely used in thin film production. This process requires the optimized combination of deposition parameters in order to obtain the desirable thin film. The conventional method in the optimization of the deposition parameters had been reported to be costly and time consuming due to its trial and error nature. Thus, gravitational search algorithm (GSA technique had been proposed to solve this nano-process parameters optimization problem. In this research, the optimized parameter combination was expected to produce the desirable electrical and optical properties of the thin film. The performance of GSA in this research was compared with that of Particle Swarm Optimization (PSO, Genetic Algorithm (GA, Artificial Immune System (AIS and Ant Colony Optimization (ACO. Based on the overall results, the GSA optimized parameter combination had generated the best electrical and an acceptable optical properties of thin film compared to the others. This computational experiment is expected to overcome the problem of having to conduct repetitive laboratory experiments in obtaining the most optimized parameter combination. Based on this initial experiment, the adaptation of GSA into this problem could offer a more efficient and productive way of depositing quality thin film in the fabrication process.
Venkateswara Rao, B.; Kumar, G. V. Nagesh; Chowdary, D. Deepak; Bharathi, M. Aruna; Patra, Stutee
2017-07-01
This paper furnish the new Metaheuristic algorithm called Cuckoo Search Algorithm (CSA) for solving optimal power flow (OPF) problem with minimization of real power generation cost. The CSA is found to be the most efficient algorithm for solving single objective optimal power flow problems. The CSA performance is tested on IEEE 57 bus test system with real power generation cost minimization as objective function. Static VAR Compensator (SVC) is one of the best shunt connected device in the Flexible Alternating Current Transmission System (FACTS) family. It has capable of controlling the voltage magnitudes of buses by injecting the reactive power to system. In this paper SVC is integrated in CSA based Optimal Power Flow to optimize the real power generation cost. SVC is used to improve the voltage profile of the system. CSA gives better results as compared to genetic algorithm (GA) in both without and with SVC conditions.
Robust approximate optimal guidance strategies for aeroassisted orbital transfer missions
Ilgen, Marc R.
This thesis presents the application of game theoretic and regular perturbation methods to the problem of determining robust approximate optimal guidance laws for aeroassisted orbital transfer missions with atmospheric density and navigated state uncertainties. The optimal guidance problem is reformulated as a differential game problem with the guidance law designer and Nature as opposing players. The resulting equations comprise the necessary conditions for the optimal closed loop guidance strategy in the presence of worst case parameter variations. While these equations are nonlinear and cannot be solved analytically, the presence of a small parameter in the equations of motion allows the method of regular perturbations to be used to solve the equations approximately. This thesis is divided into five parts. The first part introduces the class of problems to be considered and presents results of previous research. The second part then presents explicit semianalytical guidance law techniques for the aerodynamically dominated region of flight. These guidance techniques are applied to unconstrained and control constrained aeroassisted plane change missions and Mars aerocapture missions, all subject to significant atmospheric density variations. The third part presents a guidance technique for aeroassisted orbital transfer problems in the gravitationally dominated region of flight. Regular perturbations are used to design an implicit guidance technique similar to the second variation technique but that removes the need for numerically computing an optimal trajectory prior to flight. This methodology is then applied to a set of aeroassisted inclination change missions. In the fourth part, the explicit regular perturbation solution technique is extended to include the class of guidance laws with partial state information. This methodology is then applied to an aeroassisted plane change mission using inertial measurements and subject to uncertainties in the initial value
Optimal strategy for selling on group-buying website
Directory of Open Access Journals (Sweden)
Xuan Jiang
2014-09-01
Full Text Available Purpose: The purpose of this paper is to help business marketers with offline channels to make decisions on whether to sell through Group-buying (GB websites and how to set online price with the coordination of maximum deal size on GB websites. Design/methodology/approach: Considering the deal structure of GB websites especially for the service fee and minimum deal size limit required by GB websites, advertising effect of selling on GB websites, and interaction between online and offline markets, an analytical model is built to derive optimal online price and maximum deal size for sellers selling through GB website. This paper aims to answer four research questions: (1 How to make a decision on maximum deal size with coordination of the deal price? (2 Will selling on GB websites always be better than staying with offline channel only? (3 What kind of products is more appropriate to sell on GB website? (4How could GB website operator induce sellers to offer deep discount in GB deals? Findings and Originality/value: This paper obtains optimal strategies for sellers selling on GB website and finds that: Even if a seller has sufficient capacity, he/she may still set a maximum deal size on the GB deal to take advantage of Advertisement with Limited Availability (ALA effect; Selling through GB website may not bring a higher profit than selling only through offline channel when a GB site only has a small consumer base and/or if there is a big overlap between the online and offline markets; Low margin products are more suitable for being sold online with ALA strategies (LP-ALA or HP-ALA than high margin ones; A GB site operator could set a small minimum deal size to induce deep discounts from the sellers selling through GB deals. Research limitations/implications: The present study assumed that the demand function is determinate and linear. It will be interesting to study how stochastic demand and a more general demand function affect the optimal
Directory of Open Access Journals (Sweden)
Jianlei Zhang
Full Text Available We study the evolution of cooperation among selfish individuals in the stochastic strategy spatial prisoner's dilemma game. We equip players with the particle swarm optimization technique, and find that it may lead to highly cooperative states even if the temptations to defect are strong. The concept of particle swarm optimization was originally introduced within a simple model of social dynamics that can describe the formation of a swarm, i.e., analogous to a swarm of bees searching for a food source. Essentially, particle swarm optimization foresees changes in the velocity profile of each player, such that the best locations are targeted and eventually occupied. In our case, each player keeps track of the highest payoff attained within a local topological neighborhood and its individual highest payoff. Thus, players make use of their own memory that keeps score of the most profitable strategy in previous actions, as well as use of the knowledge gained by the swarm as a whole, to find the best available strategy for themselves and the society. Following extensive simulations of this setup, we find a significant increase in the level of cooperation for a wide range of parameters, and also a full resolution of the prisoner's dilemma. We also demonstrate extreme efficiency of the optimization algorithm when dealing with environments that strongly favor the proliferation of defection, which in turn suggests that swarming could be an important phenomenon by means of which cooperation can be sustained even under highly unfavorable conditions. We thus present an alternative way of understanding the evolution of cooperative behavior and its ubiquitous presence in nature, and we hope that this study will be inspirational for future efforts aimed in this direction.
Directory of Open Access Journals (Sweden)
Reza Sirjani
2017-09-01
Full Text Available Currently, many wind farms exist throughout the world and, in some cases, supply a significant portion of energy to networks. However, numerous uncertainties remain with respect to the amount of energy generated by wind turbines and other sophisticated operational aspects, such as voltage and reactive power management, which requires further development and consideration. To fix the problem of poor reactive power compensation in wind farms, optimal capacitor placement has been proposed in existing wind farms as a simple and relatively inexpensive method. However, the use of induction generators, transformers, and additional capacitors represent potential problems for the harmonics of a system and therefore must be taken into account at wind farms. The optimal location and size of capacitors at buses of an 80-MW wind farm were determined according to modelled wind speed, system equivalent circuits, and harmonics in order to minimize energy losses, optimize reactive power and reduce the management costs. The discrete version of the lightning search algorithm (DLSA is a powerful and flexible nature-inspired optimization technique that was developed and implemented herein for optimal capacitor placement in wind farms. The obtained results are compared with the results of the genetic algorithm (GA and the discrete harmony search algorithm (DHSA.
All roads lead to Rome - New search methods for the optimal triangulation problem
Czech Academy of Sciences Publication Activity Database
Ottosen, T. J.; Vomlel, Jiří
2012-01-01
Roč. 53, č. 9 (2012), s. 1350-1366 ISSN 0888-613X R&D Projects: GA MŠk 1M0572; GA ČR GEICC/08/E010; GA ČR GA201/09/1891 Grant - others:GA MŠk(CZ) 2C06019 Institutional support: RVO:67985556 Keywords : Bayesian networks * Optimal triangulation * Probabilistic inference * Cliques in a graph Subject RIV: BD - Theory of Information Impact factor: 1.729, year: 2012 http://library.utia.cas.cz/separaty/2012/MTR/vomlel-all roads lead to rome - new search methods for the optimal triangulation problem.pdf
An Effective Hybrid Firefly Algorithm with Harmony Search for Global Numerical Optimization
Directory of Open Access Journals (Sweden)
Lihong Guo
2013-01-01
Full Text Available A hybrid metaheuristic approach by hybridizing harmony search (HS and firefly algorithm (FA, namely, HS/FA, is proposed to solve function optimization. In HS/FA, the exploration of HS and the exploitation of FA are fully exerted, so HS/FA has a faster convergence speed than HS and FA. Also, top fireflies scheme is introduced to reduce running time, and HS is utilized to mutate between fireflies when updating fireflies. The HS/FA method is verified by various benchmarks. From the experiments, the implementation of HS/FA is better than the standard FA and other eight optimization methods.
Directory of Open Access Journals (Sweden)
Yukai Yao
2015-01-01
Full Text Available We propose an optimized Support Vector Machine classifier, named PMSVM, in which System Normalization, PCA, and Multilevel Grid Search methods are comprehensively considered for data preprocessing and parameters optimization, respectively. The main goals of this study are to improve the classification efficiency and accuracy of SVM. Sensitivity, Specificity, Precision, and ROC curve, and so forth, are adopted to appraise the performances of PMSVM. Experimental results show that PMSVM has relatively better accuracy and remarkable higher efficiency compared with traditional SVM algorithms.
Effects of systematic phase errors on optimized quantum random-walk search algorithm
International Nuclear Information System (INIS)
Zhang Yu-Chao; Bao Wan-Su; Wang Xiang; Fu Xiang-Qun
2015-01-01
This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover’s algorithm. (paper)
A concept for optimizing avalanche rescue strategies using a Monte Carlo simulation approach.
Directory of Open Access Journals (Sweden)
Ingrid Reiweger
Full Text Available Recent technical and strategical developments have increased the survival chances for avalanche victims. Still hundreds of people, primarily recreationists, get caught and buried by snow avalanches every year. About 100 die each year in the European Alps-and many more worldwide. Refining concepts for avalanche rescue means to optimize the procedures such that the survival chances are maximized in order to save the greatest possible number of lives. Avalanche rescue includes several parameters related to terrain, natural hazards, the people affected by the event, the rescuers, and the applied search and rescue equipment. The numerous parameters and their complex interaction make it unrealistic for a rescuer to take, in the urgency of the situation, the best possible decisions without clearly structured, easily applicable decision support systems. In order to analyse which measures lead to the best possible survival outcome in the complex environment of an avalanche accident, we present a numerical approach, namely a Monte Carlo simulation. We demonstrate the application of Monte Carlo simulations for two typical, yet tricky questions in avalanche rescue: (1 calculating how deep one should probe in the first passage of a probe line depending on search area, and (2 determining for how long resuscitation should be performed on a specific patient while others are still buried. In both cases, we demonstrate that optimized strategies can be calculated with the Monte Carlo method, provided that the necessary input data are available. Our Monte Carlo simulations also suggest that with a strict focus on the "greatest good for the greatest number", today's rescue strategies can be further optimized in the best interest of patients involved in an avalanche accident.
Directory of Open Access Journals (Sweden)
Jie-Sheng Wang
2015-01-01
Full Text Available According to the characteristics of grinding process and accuracy requirements of technical indicators, a hybrid multiple soft-sensor modeling method of grinding granularity is proposed based on cuckoo searching (CS algorithm and hysteresis switching (HS strategy. Firstly, a mechanism soft-sensor model of grinding granularity is deduced based on the technique characteristics and a lot of experimental data of grinding process. Meanwhile, the BP neural network soft-sensor model and wavelet neural network (WNN soft-sensor model are set up. Then, the hybrid multiple soft-sensor model based on the hysteresis switching strategy is realized. That is to say, the optimum model is selected as the current predictive model according to the switching performance index at each sampling instant. Finally the cuckoo searching algorithm is adopted to optimize the performance parameters of hysteresis switching strategy. Simulation results show that the proposed model has better generalization results and prediction precision, which can satisfy the real-time control requirements of grinding classification process.
Optimally setting up directed searches for continuous gravitational waves in Advanced LIGO O1 data
Ming, Jing; Papa, Maria Alessandra; Krishnan, Badri; Prix, Reinhard; Beer, Christian; Zhu, Sylvia J.; Eggenstein, Heinz-Bernd; Bock, Oliver; Machenschalk, Bernd
2018-02-01
In this paper we design a search for continuous gravitational waves from three supernova remnants: Vela Jr., Cassiopeia A (Cas A) and G347.3. These systems might harbor rapidly rotating neutron stars emitting quasiperiodic gravitational radiation detectable by the advanced LIGO detectors. Our search is designed to use the volunteer computing project Einstein@Home for a few months and assumes the sensitivity and duty cycles of the advanced LIGO detectors during their first science run. For all three supernova remnants, the sky positions of their central compact objects are well known but the frequency and spin-down rates of the neutron stars are unknown which makes the searches computationally limited. In a previous paper we have proposed a general framework for deciding on what target we should spend computational resources and in what proportion, what frequency and spin-down ranges we should search for every target, and with what search setup. Here we further expand this framework and apply it to design a search directed at detecting continuous gravitational wave signals from the most promising three supernova remnants identified as such in the previous work. Our optimization procedure yields broad frequency and spin-down searches for all three objects, at an unprecedented level of sensitivity: The smallest detectable gravitational wave strain h0 for Cas A is expected to be 2 times smaller than the most sensitive upper limits published to date, and our proposed search, which was set up and ran on the volunteer computing project Einstein@Home, covers a much larger frequency range.
Multi-Robot, Multi-Target Particle Swarm Optimization Search in Noisy Wireless Environments
Energy Technology Data Exchange (ETDEWEB)
Kurt Derr; Milos Manic
2009-05-01
Multiple small robots (swarms) can work together using Particle Swarm Optimization (PSO) to perform tasks that are difficult or impossible for a single robot to accomplish. The problem considered in this paper is exploration of an unknown environment with the goal of finding a target(s) at an unknown location(s) using multiple small mobile robots. This work demonstrates the use of a distributed PSO algorithm with a novel adaptive RSS weighting factor to guide robots for locating target(s) in high risk environments. The approach was developed and analyzed on multiple robot single and multiple target search. The approach was further enhanced by the multi-robot-multi-target search in noisy environments. The experimental results demonstrated how the availability of radio frequency signal can significantly affect robot search time to reach a target.
Directory of Open Access Journals (Sweden)
Darmayenti Darmayenti
2017-02-01
Full Text Available This paper is a report of an experimental research project conducted in a reading comprehension course for first-year students of the Adab Faculty of the State Institute for Islamic Studies Imam Bonjol Padang, West Sumatera, Indonesia, during the academic year 2015/2016. The “Predict Organize Search Summarize Evaluate” (POSSE is one strategy that can enhance students’ comprehension in reading. Two classes of Arabic and History students chosen through cluster random sampling technique were used as the sample of the research. Reading tests were used to collect the data which was given to both of classes on pre-test and post-test. The result of the research showed that the implementation of Predict Organize Search Summarize Evaluate strategy gave a significant difference in term of the students-learning outcome between the students who were taught through POSSE strategy and by traditional one. The finding of the study showed that teaching reading by using POSSE strategy gave significant effect towards students’ reading comprehension. This strategy could improve the students’ reading component on finding topic. It can be concluded that using POSSE Strategy has improved Indonesian students’ reading comprehension. It is also recommended for English lecturers use POSSE strategy as one of teaching strategies for reading comprehension.
Dijkstra, J.; Vries, de B.; Jessurun, A.J.
2014-01-01
There is an underestimation of the conscious and unconscious wayfinding search strategies in a virtual built environment without signage information. Wayfinding is the process of determining and following a path or route between an origin and destination.This is the base of the experiment discussed
Wang, Tsui-Ying; Huang, Ho-Chuan; Huang, Hsiu-Shuang
2006-01-01
We propose a computer-assisted cancellation test system (CACTS) to understand the visual attention performance and visual search strategies in school children. The main aim of this paper is to present our design and development of the CACTS and demonstrate some ways in which computer techniques can allow the educator not only to obtain more…
WANDERER IN THE MIST: THE SEARCH FOR INTELLIGENCE, SURVEILLANCE, AND RECONNAISSANCE (ISR) STRATEGY
2017-06-01
the production of over 383,000 photographic prints to support various intelligence , mapping, and 15...WANDERER IN THE MIST: THE SEARCH FOR INTELLIGENCE , SURVEILLANCE, AND RECONNAISSANCE (ISR) STRATEGY BY MAJOR RYAN D. SKAGGS, USAF...program from the University of California at Los Angeles (UCLA) in 2004. He is a career intelligence officer with over 13 years of experience across a
The “I’m Feeling Lucky Syndrome”: Teacher-Candidates’ Knowledge of Web Searching Strategies
Directory of Open Access Journals (Sweden)
Corinne Laverty
2008-06-01
Full Text Available The need for web literacy has become increasingly important with the exponential growth of learning materials on the web that are freely accessible to educators. Teachers need the skills to locate these tools and also the ability to teach their students web search strategies and evaluation of websites so they can effectively explore the web by themselves. This study examined the web searching strategies of 253 teachers-in-training using both a survey (247 participants and live screen capture with think aloud audio recording (6 participants. The results present a picture of the strategic, syntactic, and evaluative search abilities of these students that librarians and faculty can use to plan how instruction can target information skill deficits in university student populations.
Directory of Open Access Journals (Sweden)
Ali Wagdy Mohamed
2014-11-01
Full Text Available In this paper, a novel version of Differential Evolution (DE algorithm based on a couple of local search mutation and a restart mechanism for solving global numerical optimization problems over continuous space is presented. The proposed algorithm is named as Restart Differential Evolution algorithm with Local Search Mutation (RDEL. In RDEL, inspired by Particle Swarm Optimization (PSO, a novel local mutation rule based on the position of the best and the worst individuals among the entire population of a particular generation is introduced. The novel local mutation scheme is joined with the basic mutation rule through a linear decreasing function. The proposed local mutation scheme is proven to enhance local search tendency of the basic DE and speed up the convergence. Furthermore, a restart mechanism based on random mutation scheme and a modified Breeder Genetic Algorithm (BGA mutation scheme is combined to avoid stagnation and/or premature convergence. Additionally, an exponent increased crossover probability rule and a uniform scaling factors of DE are introduced to promote the diversity of the population and to improve the search process, respectively. The performance of RDEL is investigated and compared with basic differential evolution, and state-of-the-art parameter adaptive differential evolution variants. It is discovered that the proposed modifications significantly improve the performance of DE in terms of quality of solution, efficiency and robustness.
Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor
Directory of Open Access Journals (Sweden)
Hidetoshi Takeshita
2011-01-01
Full Text Available This paper proposes a new replica placement algorithm that expands the exhaustive search limit with reasonable calculation time. It combines a new type of parallel data-flow processor with an architecture tuned for fast calculation. The replica placement problem is to find a replica-server set satisfying service constraints in a content delivery network (CDN. It is derived from the set cover problem which is known to be NP-hard. It is impractical to use exhaustive search to obtain optimal replica placement in large-scale networks, because calculation time increases with the number of combinations. To reduce calculation time, heuristic algorithms have been proposed, but it is known that no heuristic algorithm is assured of finding the optimal solution. The proposed algorithm suits parallel processing and pipeline execution and is implemented on DAPDNA-2, a dynamically reconfigurable processor. Experiments show that the proposed algorithm expands the exhaustive search limit by the factor of 18.8 compared to the conventional algorithm search limit running on a Neumann-type processor.
Directory of Open Access Journals (Sweden)
Zhiwei Ye
2015-01-01
Full Text Available Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper.
Scalable unit commitment by memory-bounded ant colony optimization with A{sup *} local search
Energy Technology Data Exchange (ETDEWEB)
Saber, Ahmed Yousuf; Alshareef, Abdulaziz Mohammed [Department of Electrical and Computer Engineering, King Abdulaziz University, P.O. Box 80204, Jeddah 21589 (Saudi Arabia)
2008-07-15
Ant colony optimization (ACO) is successfully applied in optimization problems. Performance of the basic ACO for small problems with moderate dimension and searching space is satisfactory. As the searching space grows exponentially in the large-scale unit commitment problem, the basic ACO is not applicable for the vast size of pheromone matrix of ACO in practical time and physical computer-memory limit. However, memory-bounded methods prune the least-promising nodes to fit the system in computer memory. Therefore, the authors propose memory-bounded ant colony optimization (MACO) in this paper for the scalable (no restriction for system size) unit commitment problem. This MACO intelligently solves the limitation of computer memory, and does not permit the system to grow beyond a bound on memory. In the memory-bounded ACO implementation, A{sup *} heuristic is introduced to increase local searching ability and probabilistic nearest neighbor method is applied to estimate pheromone intensity for the forgotten value. Finally, the benchmark data sets and existing methods are used to show the effectiveness of the proposed method. (author)
Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei
2015-01-01
Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper.
An Overview of Optimizing Strategies for Flotation Banks
Directory of Open Access Journals (Sweden)
Miguel Maldonado
2012-10-01
Full Text Available A flotation bank is a serial arrangement of cells. How to optimally operate a bank remains a challenge. This article reviews three reported strategies: air profiling, mass-pull (froth velocity profiling and Peak Air Recovery (PAR profiling. These are all ways of manipulating the recovery profile down a bank, which may be the property being exploited. Mathematical analysis has shown that a flat cell-by-cell recovery profile maximizes the separation of two floatable minerals for a given target bank recovery when the relative floatability is constant down the bank. Available bank survey data are analyzed with respect to recovery profiling. Possible variations on recovery profile to minimize entrainment are discussed.
Gradient Material Strategies for Hydrogel Optimization in Tissue Engineering Applications
2018-01-01
Although a number of combinatorial/high-throughput approaches have been developed for biomaterial hydrogel optimization, a gradient sample approach is particularly well suited to identify hydrogel property thresholds that alter cellular behavior in response to interacting with the hydrogel due to reduced variation in material preparation and the ability to screen biological response over a range instead of discrete samples each containing only one condition. This review highlights recent work on cell–hydrogel interactions using a gradient material sample approach. Fabrication strategies for composition, material and mechanical property, and bioactive signaling gradient hydrogels that can be used to examine cell–hydrogel interactions will be discussed. The effects of gradients in hydrogel samples on cellular adhesion, migration, proliferation, and differentiation will then be examined, providing an assessment of the current state of the field and the potential of wider use of the gradient sample approach to accelerate our understanding of matrices on cellular behavior. PMID:29485612
Optimizing urology group partnerships: collaboration strategies and compensation best practices.
Jacoby, Dana L; Maller, Bruce S; Peltier, Lisa R
2014-10-01
Market forces in health care have created substantial regulatory, legislative, and reimbursement changes that have had a significant impact on urology group practices. To maintain viability, many urology groups have merged into larger integrated entities. Although group operations vary considerably, the majority of groups have struggled with the development of a strong culture, effective decision-making, and consensus-building around shared resources, income, and expense. Creating a sustainable business model requires urology group leaders to allocate appropriate time and resources to address these issues in a proactive manner. This article outlines collaboration strategies for creating an effective culture, governance, and leadership, and provides practical suggestions for optimizing the performance of the urology group practice.
Optimal Strategies for Probing Terrestrial Exoplanet Atmospheres with JWST
Batalha, Natasha E.; Lewis, Nikole K.; Line, Michael
2018-01-01
It is imperative that the exoplanet community determines the feasibility and the resources needed to yield high fidelity atmospheric compositions from terrestrial exoplanets. In particular, LHS 1140b and the TRAPPIST-1 system, already slated for observations by JWST’s Guaranteed Time Observers, will be the first two terrestrial planets observed by JWST. I will discuss optimal observing strategies for observing these two systems, focusing on the NIRSpec Prism (1-5μm) and the combination of NIRISS SOSS (1-2.7μm) and NIRSpec G395H (3-5μm). I will also introduce currently unsupported JWST readmodes that have the potential to greatly increase the precision on our atmospheric spectra. Lastly, I will use information content theory to compute the expected confidence interval on the retrieved abundances of key molecular species and temperature profiles as a function of JWST observing cycles.
Optimized control strategy for crowbarless solid state modular power supply
International Nuclear Information System (INIS)
Upadhyay, R.; Badapanda, M.K.; Tripathi, A.; Hannurkar, P.R.; Pithawa, C.K.
2009-01-01
Solid state modular power supply with series connected IGBT based power modules have been employed as high voltage bias power supply of klystron amplifier. Auxiliary compensation of full wave inverter bridge with ZVS/ZCS operations of all IGBTs over entire operating range is incorporated. An optimized control strategy has been adopted for this power supply needing no output filter, making this scheme crowbarless and is presented in this paper. DSP based fully digital control with same duty cycle for all power modules, have been incorporated for regulating this power supply along with adequate protection features. Input to this power supply is taken directly from 11 kV line and the input system is intentionally made 24 pulsed to reduce the input harmonics, improve the input power factor significantly, there by requiring no line filters. Various steps have been taken to increase the efficiency of major subsystems, so as to improve the overall efficiency of this power supply significantly. (author)
Evolution strategy based optimal chiller loading for saving energy
International Nuclear Information System (INIS)
Chang, Y.-C.; Lee, C.-Y.; Chen, C.-R.; Chou, C.-J.; Chen, W.-H.; Chen, W.-H.
2009-01-01
This study employs evolution strategy (ES) to solve optimal chiller loading (OCL) problem. ES overcomes the flaw that Lagrangian method is not adaptable for solving OCL as the power consumption models or the kW-PLR (partial load ratio) curves include convex functions and concave functions simultaneously. The complicated process of evolution by the genetic algorithm (GA) method for solving OCL can also be simplified by the ES method. This study uses the PLR of chiller as the variable to be solved for the decoupled air conditioning system. After analysis and comparison of the case study, it has been concluded that this method not only solves the problems of Lagrangian method and GA method, but also produces results with high accuracy within a rapid timeframe. It can be perfectly applied to the operation of air conditioning systems
Optimal Inspection and Repair Strategies for Structural Systems
DEFF Research Database (Denmark)
Sommer, A. M.; Nowak, A. S.; Thoft-Christensen, Palle
1992-01-01
and a design variable as optimization variables. A model for estimating the total expected costs for structural systems is given including the costs associated with the loss of individual structural members as well as the costs associated with the loss of at least one element of a particular group......A model for reliability-based repair and maintenance strategies of structural systems is described. The total expected costs in the lifetime of the structure are minimized with the number of inspections, the number and positions of the inspected points, the inspection efforts, the repair criteria...... of structural members and the costs associated with the simultaneous loss of all members of a specific group of structural members. The approach is based on the pre-posteriori analysis from the classical decision theory. Special emphasis is given to the problem of selecting the number of points in the structure...
Institutional Embeddedness of Search Strategies and the Implications for Innovation Performance
DEFF Research Database (Denmark)
Grimpe, Christoph; Sofka, Wolfgang
2013-01-01
to experience the negative performance effects of oversearch. Based on a comprehensive sample of almost 8,000 firms from ten European countries, we find that institutions matter considerably for firms’ search activity. Higher market orientation of institutions increases the effectiveness of firms’ search...... ignored the institutional context that provides or denies access to external knowledge at the country level. Combining institutional and knowledge search theory, we suggest that the market orientation of the institutional environment and the magnitude of institutional change influence when firms begin...... for external knowledge while higher magnitudes of institutional change decrease it. Our results provide important insights for management on how to adapt search strategies to the institutional context....
A fast search strategy for gravitational waves from low-mass x-ray binaries
International Nuclear Information System (INIS)
Messenger, C; Woan, G
2007-01-01
We present a new type of search strategy designed specifically to find continuously emitting gravitational wave sources in known binary systems. A component of this strategy is based on the incoherent summation of frequency-modulated binary signal sidebands, a method previously employed in the detection of electromagnetic pulsar signals from radio observations. The search pipeline can be divided into three stages: the first is a wide bandwidth, F-statistic search demodulated for sky position. This is followed by a fast second stage in which areas in frequency space are identified as signal candidates through the frequency domain convolution of the F-statistic with an approximate signal template. For this second stage only precise information on the orbit period and approximate information on the orbital semi-major axis are required a priori. For the final stage we propose a fully coherent Markov chain Monte Carlo based follow-up search on the frequency subspace defined by the candidates identified by the second stage. This search is particularly suited to the low-mass x-ray binaries, for which orbital period and sky position are typically well known and additional orbital parameters and neutron star spin frequency are not. We note that for the accreting x-ray millisecond pulsars, for which spin frequency and orbital parameters are well known, the second stage can be omitted and the fully coherent search stage can be performed. We describe the search pipeline with respect to its application to a simplified phase model and derive the corresponding sensitivity of the search
Rushton, Erin E.; Kelehan, Martha Daisy; Strong, Marcy A.
2008-01-01
Search engine use is one of the most popular online activities. According to a recent OCLC report, nearly all students start their electronic research using a search engine instead of the library Web site. Instead of viewing search engines as competition, however, librarians at Binghamton University Libraries decided to employ search engine…
Collins, Linda M
2018-01-01
This book presents a framework for development, optimization, and evaluation of behavioral, biobehavioral, and biomedical interventions. Behavioral, biobehavioral, and biomedical interventions are programs with the objective of improving and maintaining human health and well-being, broadly defined, in individuals, families, schools, organizations, or communities. These interventions may be aimed at, for example, preventing or treating disease, promoting physical and mental health, preventing violence, or improving academic achievement. This volume introduces the Multiphase Optimization Strategy (MOST), pioneered at The Methodology Center at the Pennsylvania State University, as an alternative to the classical approach of relying solely on the randomized controlled trial (RCT). MOST borrows heavily from perspectives taken and approaches used in engineering, and also integrates concepts from statistics and behavioral science, including the RCT. As described in detail in this book, MOST consists of ...
Optimal Order Strategy in Uncertain Demands with Free Shipping Option
Directory of Open Access Journals (Sweden)
Qing-Chun Meng
2014-01-01
Full Text Available Free shipping with conditions has become one of the most effective marketing tools; more and more companies especially e-business companies prefer to offer free shipping to buyers whenever their orders exceed the minimum quantity specified by them. But in practice, the demands of buyers are uncertain, which are affected by weather, season, and many other factors. Firstly, we model the centralization ordering problem of retailers who face stochastic demands when suppliers offer free shipping, in which limited distributional information such as known mean, support, and some deviation measures of the random data is needed only. Then, based on the linear decision rule mainly for stochastic programming, we analyze the optimal order strategies of retailers and discuss the approximate solution. Further, we present the core allocation between all retailers via dual and cooperative game theory. The existence of core shows that each retailer is pleased to cooperate with others in the centralization problem. Finally, a numerical example is implemented to discuss how uncertain data and parameters affect the optimal solution.
Information search and decision making: effects of age and complexity on strategy use.
Queen, Tara L; Hess, Thomas M; Ennis, Gilda E; Dowd, Keith; Grühn, Daniel
2012-12-01
The impact of task complexity on information search strategy and decision quality was examined in a sample of 135 young, middle-aged, and older adults. We were particularly interested in the competing roles of fluid cognitive ability and domain knowledge and experience, with the former being a negative influence and the latter being a positive influence on older adults' performance. Participants utilized 2 decision matrices, which varied in complexity, regarding a consumer purchase. Using process tracing software and an algorithm developed to assess decision strategy, we recorded search behavior, strategy selection, and final decision. Contrary to expectations, older adults were not more likely than the younger age groups to engage in information-minimizing search behaviors in response to increases in task complexity. Similarly, adults of all ages used comparable decision strategies and adapted their strategies to the demands of the task. We also examined decision outcomes in relation to participants' preferences. Overall, it seems that older adults utilize simpler sets of information primarily reflecting the most valued attributes in making their choice. The results of this study suggest that older adults are adaptive in their approach to decision making and that this ability may benefit from accrued knowledge and experience. 2013 APA, all rights reserved
Optimizing the HLT Buffer Strategy with Monte Carlo Simulations
AUTHOR|(CDS)2266763
2017-01-01
This project aims to optimize the strategy of utilizing the disk buffer for the High Level Trigger (HLT) of the LHCb experiment with the help of Monte-Carlo simulations. A method is developed, which simulates the Event Filter Farm (EFF) -- a computing cluster for the High Level Trigger -- as a compound of nodes with different performance properties. In this way, the behavior of the computing farm can be analyzed at a deeper level than before. It is demonstrated that the current operating strategy might be improved when data taking is reaching a mid-year scheduled stop or the year-end technical stop. The processing time of the buffered data can be lowered by distributing the detector data according to the processing power of the nodes instead of the relative disk size as long as the occupancy level of the buffer is low enough. Moreover, this ensures that data taken and stored on the buffer at the same time is processed by different nodes nearly simultaneously, which reduces load on the infrastructure.
Amin, Alpesh N; Deitelzweig, Steven B
2009-11-01
Venous thromboembolism (VTE) is associated with a substantial health care and economic burden, yet many VTE events are preventable. Despite the availability of evidence-based guidelines derailing effective thromboprophylaxis strategies, the underuse and inappropriate prescribing of VTE prophylaxis are common. Current national quality initiatives were reviewed to identify strategies that may help hospitals and health care professionals optimize current VTE prophylaxis practices. A computerized literature search was performed using PubMed and MEDLINE, and this was complemented by hand searches of relevant journals and Web sites to identify additional literature related to VTE prevention and quality improvement. Many organizations, including the Centers for Medicare & Medicaid Services, the National Quality Forum, the Joint Commission, and the Agency for Healthcare Research and Quality have developed performance measures, quality indicators, public reporting initiatives, incentive programs, and "negative reimbursement" that are designed to help improve VTE prevention. It remains the responsibility of individual hospitals to identify specific areas in which they can improve their VTE prophylaxis rates to obtain positive results from the reporting initiatives and incentive programs. If performance measures are to be met, all hospital departments will need to implement effective VTE prevention policies, including early risk assessment, appropriate prophylaxis prescribing, monitoring, and follow-up. Multifaceted, integrated initiatives involving risk assessment tools, decision support, electronic alert systems, and hospitalwide education, with a mechanism for audit and feedback, may help ensure that all health care professionals comply with VTE-prevention policies and initiatives.
Search method optimization technique for thermal design of high power RFQ structure
International Nuclear Information System (INIS)
Sharma, N.K.; Joshi, S.C.
2009-01-01
RRCAT has taken up the development of 3 MeV RFQ structure for the low energy part of 100 MeV H - ion injector linac. RFQ is a precision machined resonating structure designed for high rf duty factor. RFQ structural stability during high rf power operation is an important design issue. The thermal analysis of RFQ has been performed using ANSYS finite element analysis software and optimization of various parameters is attempted using Search Method optimization technique. It is an effective optimization technique for the systems governed by a large number of independent variables. The method involves examining a number of combinations of values of independent variables and drawing conclusions from the magnitude of the objective function at these combinations. In these methods there is a continuous improvement in the objective function throughout the course of the search and hence these methods are very efficient. The method has been employed in optimization of various parameters (called independent variables) of RFQ like cooling water flow rate, cooling water inlet temperatures, cavity thickness etc. involved in RFQ thermal design. The temperature rise within RFQ structure is the objective function during the thermal design. Using ANSYS Programming Development Language (APDL), various multiple iterative programmes are written and the analysis are performed to minimize the objective function. The dependency of the objective function on various independent variables is established and the optimum values of the parameters are evaluated. The results of the analysis are presented in the paper. (author)
Genetic search for an optimal power flow solution from a high density cluster
Energy Technology Data Exchange (ETDEWEB)
Amarnath, R.V. [Hi-Tech College of Engineering and Technology, Hyderabad (India); Ramana, N.V. [JNTU College of Engineering, Jagityala (India)
2008-07-01
This paper proposed a novel method to solve optimal power flow (OPF) problems. The method is based on a genetic algorithm (GA) search from a High Density Cluster (GAHDC). The algorithm of the proposed method includes 3 stages, notably (1) a suboptimal solution is obtained via a conventional analytical method, (2) a high density cluster, which consists of other suboptimal data points from the first stage, is formed using a density-based cluster algorithm, and (3) a genetic algorithm based search is carried out for the exact optimal solution from a low population sized, high density cluster. The final optimal solution thoroughly satisfies the well defined fitness function. A standard IEEE 30-bus test system was considered for the simulation study. Numerical results were presented and compared with the results of other approaches. It was concluded that although there is not much difference in numerical values, the proposed method has the advantage of minimal computational effort and reduced CPU time. As such, the method would be suitable for online applications such as the present Optimal Power Flow problem. 24 refs., 2 tabs., 4 figs.
Directory of Open Access Journals (Sweden)
Rubenstein Lisa V
2011-08-01
Full Text Available Abstract Background The evidence base for quality improvement (QI interventions is expanding rapidly. The diversity of the initiatives and the inconsistency in labeling these as QI interventions makes it challenging for researchers, policymakers, and QI practitioners to access the literature systematically and to identify relevant publications. Methods We evaluated search strategies developed for MEDLINE (Ovid and PubMed based on free text words, Medical subject headings (MeSH, QI intervention components, continuous quality improvement (CQI methods, and combinations of the strategies. Three sets of pertinent QI intervention publications were used for validation. Two independent expert reviewers screened publications for relevance. We compared the yield, recall rate, and precision of the search strategies for the identification of QI publications and for a subset of empirical studies on effects of QI interventions. Results The search yields ranged from 2,221 to 216,167 publications. Mean recall rates for reference publications ranged from 5% to 53% for strategies with yields of 50,000 publications or fewer. The 'best case' strategy, a simple text word search with high face validity ('quality' AND 'improv*' AND 'intervention*' identified 44%, 24%, and 62% of influential intervention articles selected by Agency for Healthcare Research and Quality (AHRQ experts, a set of exemplar articles provided by members of the Standards for Quality Improvement Reporting Excellence (SQUIRE group, and a sample from the Cochrane Effective Practice and Organization of Care Group (EPOC register of studies, respectively. We applied the search strategy to a PubMed search for articles published in 10 pertinent journals in a three-year period which retrieved 183 publications. Among these, 67% were deemed relevant to QI by at least one of two independent raters. Forty percent were classified as empirical studies reporting on a QI intervention. Conclusions The presented
A dynamic lattice searching method with rotation operation for optimization of large clusters
International Nuclear Information System (INIS)
Wu Xia; Cai Wensheng; Shao Xueguang
2009-01-01
Global optimization of large clusters has been a difficult task, though much effort has been paid and many efficient methods have been proposed. During our works, a rotation operation (RO) is designed to realize the structural transformation from decahedra to icosahedra for the optimization of large clusters, by rotating the atoms below the center atom with a definite degree around the fivefold axis. Based on the RO, a development of the previous dynamic lattice searching with constructed core (DLSc), named as DLSc-RO, is presented. With an investigation of the method for the optimization of Lennard-Jones (LJ) clusters, i.e., LJ 500 , LJ 561 , LJ 600 , LJ 665-667 , LJ 670 , LJ 685 , and LJ 923 , Morse clusters, silver clusters by Gupta potential, and aluminum clusters by NP-B potential, it was found that both the global minima with icosahedral and decahedral motifs can be obtained, and the method is proved to be efficient and universal.
Directory of Open Access Journals (Sweden)
Rabindra Kumar Sahu
2014-09-01
Full Text Available An attempt is made for the effective application of Gravitational Search Algorithm (GSA to optimize PI/PIDF controller parameters in Automatic Generation Control (AGC of interconnected power systems. Initially, comparison of several conventional objective functions reveals that ITAE yields better system performance. Then, the parameters of GSA technique are properly tuned and the GSA control parameters are proposed. The superiority of the proposed approach is demonstrated by comparing the results of some recently published techniques such as Differential Evolution (DE, Bacteria Foraging Optimization Algorithm (BFOA and Genetic Algorithm (GA. Additionally, sensitivity analysis is carried out that demonstrates the robustness of the optimized controller parameters to wide variations in operating loading condition and time constants of speed governor, turbine, tie-line power. Finally, the proposed approach is extended to a more realistic power system model by considering the physical constraints such as reheat turbine, Generation Rate Constraint (GRC and Governor Dead Band nonlinearity.
Evaluating random search strategies in three mammals from distinct feeding guilds.
Auger-Méthé, Marie; Derocher, Andrew E; DeMars, Craig A; Plank, Michael J; Codling, Edward A; Lewis, Mark A
2016-09-01
Searching allows animals to find food, mates, shelter and other resources essential for survival and reproduction and is thus among the most important activities performed by animals. Theory predicts that animals will use random search strategies in highly variable and unpredictable environments. Two prominent models have been suggested for animals searching in sparse and heterogeneous environments: (i) the Lévy walk and (ii) the composite correlated random walk (CCRW) and its associated area-restricted search behaviour. Until recently, it was difficult to differentiate between the movement patterns of these two strategies. Using a new method that assesses whether movement patterns are consistent with these two strategies and two other common random search strategies, we investigated the movement behaviour of three species inhabiting sparse northern environments: woodland caribou (Rangifer tarandus caribou), barren-ground grizzly bear (Ursus arctos) and polar bear (Ursus maritimus). These three species vary widely in their diets and thus allow us to contrast the movement patterns of animals from different feeding guilds. Our results showed that although more traditional methods would have found evidence for the Lévy walk for some individuals, a comparison of the Lévy walk to CCRWs showed stronger support for the latter. While a CCRW was the best model for most individuals, there was a range of support for its absolute fit. A CCRW was sufficient to explain the movement of nearly half of herbivorous caribou and a quarter of omnivorous grizzly bears, but was insufficient to explain the movement of all carnivorous polar bears. Strong evidence for CCRW movement patterns suggests that many individuals may use a multiphasic movement strategy rather than one-behaviour strategies such as the Lévy walk. The fact that the best model was insufficient to describe the movement paths of many individuals suggests that some animals living in sparse environments may use
Lee, Ho Min; Sadollah, Ali
2015-01-01
Water supply systems are mainly classified into branched and looped network systems. The main difference between these two systems is that, in a branched network system, the flow within each pipe is a known value, whereas in a looped network system, the flow in each pipe is considered an unknown value. Therefore, an analysis of a looped network system is a more complex task. This study aims to develop a technique for estimating the optimal pipe diameter for a looped agricultural irrigation water supply system using a harmony search algorithm, which is an optimization technique. This study mainly serves two purposes. The first is to develop an algorithm and a program for estimating a cost-effective pipe diameter for agricultural irrigation water supply systems using optimization techniques. The second is to validate the developed program by applying the proposed optimized cost-effective pipe diameter to an actual study region (Saemangeum project area, zone 6). The results suggest that the optimal design program, which applies an optimization theory and enhances user convenience, can be effectively applied for the real systems of a looped agricultural irrigation water supply. PMID:25874252
Directory of Open Access Journals (Sweden)
Do Guen Yoo
2015-01-01
Full Text Available Water supply systems are mainly classified into branched and looped network systems. The main difference between these two systems is that, in a branched network system, the flow within each pipe is a known value, whereas in a looped network system, the flow in each pipe is considered an unknown value. Therefore, an analysis of a looped network system is a more complex task. This study aims to develop a technique for estimating the optimal pipe diameter for a looped agricultural irrigation water supply system using a harmony search algorithm, which is an optimization technique. This study mainly serves two purposes. The first is to develop an algorithm and a program for estimating a cost-effective pipe diameter for agricultural irrigation water supply systems using optimization techniques. The second is to validate the developed program by applying the proposed optimized cost-effective pipe diameter to an actual study region (Saemangeum project area, zone 6. The results suggest that the optimal design program, which applies an optimization theory and enhances user convenience, can be effectively applied for the real systems of a looped agricultural irrigation water supply.
Mastering Search Analytics Measuring SEO, SEM and Site Search
Chaters, Brent
2011-01-01
Many companies still approach Search Engine Optimization (SEO) and paid search as separate initiatives. This in-depth guide shows you how to use these programs as part of a comprehensive strategy-not just to improve your site's search rankings, but to attract the right people and increase your conversion rate. Learn how to measure, test, analyze, and interpret all of your search data with a wide array of analytic tools. Gain the knowledge you need to determine the strategy's return on investment. Ideal for search specialists, webmasters, and search marketing managers, Mastering Search Analyt
Algorithm of axial fuel optimization based in progressive steps of turned search
International Nuclear Information System (INIS)
Martin del Campo, C.; Francois, J.L.
2003-01-01
The development of an algorithm for the axial optimization of fuel of boiling water reactors (BWR) is presented. The algorithm is based in a serial optimizations process in the one that the best solution in each stage is the starting point of the following stage. The objective function of each stage adapts to orient the search toward better values of one or two parameters leaving the rest like restrictions. Conform to it advances in those optimization stages, it is increased the fineness of the evaluation of the investigated designs. The algorithm is based on three stages, in the first one are used Genetic algorithms and in the two following Tabu Search. The objective function of the first stage it looks for to minimize the average enrichment of the one it assembles and to fulfill with the generation of specified energy for the operation cycle besides not violating none of the limits of the design base. In the following stages the objective function looks for to minimize the power factor peak (PPF) and to maximize the margin of shutdown (SDM), having as restrictions the one average enrichment obtained for the best design in the first stage and those other restrictions. The third stage, very similar to the previous one, it begins with the design of the previous stage but it carries out a search of the margin of shutdown to different exhibition steps with calculations in three dimensions (3D). An application to the case of the design of the fresh assemble for the fourth fuel reload of the Unit 1 reactor of the Laguna Verde power plant (U1-CLV) is presented. The obtained results show an advance in the handling of optimization methods and in the construction of the objective functions that should be used for the different design stages of the fuel assemblies. (Author)
Agoritsas, Thomas; Merglen, Arnaud; Courvoisier, Delphine S; Combescure, Christophe; Garin, Nicolas; Perrier, Arnaud; Perneger, Thomas V
2012-06-12
Clinicians perform searches in PubMed daily, but retrieving relevant studies is challenging due to the rapid expansion of medical knowledge. Little is known about the performance of search strategies when they are applied to answer specific clinical questions. To compare the performance of 15 PubMed search strategies in retrieving relevant clinical trials on therapeutic interventions. We used Cochrane systematic reviews to identify relevant trials for 30 clinical questions. Search terms were extracted from the abstract using a predefined procedure based on the population, interventions, comparison, outcomes (PICO) framework and combined into queries. We tested 15 search strategies that varied in their query (PIC or PICO), use of PubMed's Clinical Queries therapeutic filters (broad or narrow), search limits, and PubMed links to related articles. We assessed sensitivity (recall) and positive predictive value (precision) of each strategy on the first 2 PubMed pages (40 articles) and on the complete search output. The performance of the search strategies varied widely according to the clinical question. Unfiltered searches and those using the broad filter of Clinical Queries produced large outputs and retrieved few relevant articles within the first 2 pages, resulting in a median sensitivity of only 10%-25%. In contrast, all searches using the narrow filter performed significantly better, with a median sensitivity of about 50% (all P PubMed pages. These results can help clinicians apply effective strategies to answer their questions at the point of care.
Search strategy in a complex and dynamic environment (the Indian Ocean case)
Loire, Sophie; Arbabi, Hassan; Clary, Patrick; Ivic, Stefan; Crnjaric-Zic, Nelida; Macesic, Senka; Crnkovic, Bojan; Mezic, Igor; UCSB Team; Rijeka Team
2014-11-01
The disappearance of Malaysia Airlines Flight 370 (MH370) in the early morning hours of 8 March 2014 has exposed the disconcerting lack of efficient methods for identifying where to look and how to look for missing objects in a complex and dynamic environment. The search area for plane debris is a remote part of the Indian Ocean. Searches, of the lawnmower type, have been unsuccessful so far. Lagrangian kinematics of mesoscale features are visible in hypergraph maps of the Indian Ocean surface currents. Without a precise knowledge of the crash site, these maps give an estimate of the time evolution of any initial distribution of plane debris and permits the design of a search strategy. The Dynamic Spectral Multiscale Coverage search algorithm is modified to search a spatial distribution of targets that is evolving with time following the dynamic of ocean surface currents. Trajectories are generated for multiple search agents such that their spatial coverage converges to the target distribution. Central to this DSMC algorithm is a metric for the ergodicity.
Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem
Directory of Open Access Journals (Sweden)
Ho-Yoeng Yun
2013-01-01
Full Text Available We propose a novel heuristic algorithm based on the methods of advanced Harmony Search and Ant Colony Optimization (AHS-ACO to effectively solve the Traveling Salesman Problem (TSP. The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases exponentially by increasing the number of cities. In our algorithm, Ant Colony Optimization (ACO is used to search the local optimum in the solution space, followed by the use of the Harmony Search to escape the local optimum determined by the ACO and to move towards a global optimum. Experiments were performed to validate the efficiency of our algorithm through a comparison with other algorithms and the optimum solutions presented in the TSPLIB. The results indicate that our algorithm is capable of generating the optimum solution for most instances in the TSPLIB; moreover, our algorithm found better solutions in two cases (kroB100 and pr144 when compared with the optimum solution presented in the TSPLIB.
Directory of Open Access Journals (Sweden)
Jian Tang
2017-11-01
Full Text Available In this paper, we optimize the search and rescue (SAR in disaster relief through agent-based simulation. We simulate rescue teams’ search behaviors with the improved Truncated Lévy walks. Then we propose a cooperative rescue plan based on a distributed auction mechanism, and illustrate it with the case of landslide disaster relief. The simulation is conducted in three scenarios, including “fatal”, “serious” and “normal”. Compared with the non-cooperative rescue plan, the proposed rescue plan in this paper would increase victims’ relative survival probability by 7–15%, increase the ratio of survivors getting rescued by 5.3–12.9%, and decrease the average elapsed time for one site getting rescued by 16.6–21.6%. The robustness analysis shows that search radius can affect the rescue efficiency significantly, while the scope of cooperation cannot. The sensitivity analysis shows that the two parameters, the time limit for completing rescue operations in one buried site and the maximum turning angle for next step, both have a great influence on rescue efficiency, and there exists optimal value for both of them in view of rescue efficiency.
A systematic review on the composting of green waste: Feedstock quality and optimization strategies.
Reyes-Torres, M; Oviedo-Ocaña, E R; Dominguez, I; Komilis, D; Sánchez, A
2018-04-27
Green waste (GW) is an important fraction of municipal solid waste (MSW). The composting of lignocellulosic GW is challenging due to its low decomposition rate. Recently, an increasing number of studies that include strategies to optimize GW composting appeared in the literature. This literature review focuses on the physicochemical quality of GW and on the effect of strategies used to improve the process and product quality. A systematic search was carried out, using keywords, and 447 papers published between 2002 and 2018 were identified. After a screening process, 41 papers addressing feedstock quality and 32 papers on optimization strategies were selected to be reviewed and analyzed in detail. The GW composition is highly variable due to the diversity of the source materials, the type of vegetation, and climatic conditions. This variability limits a strict categorization of the GW physicochemical characteristics. However, this research established that the predominant features of GW are a C/N ratio higher than 25, a deficit in important nutrients, namely nitrogen (0.5-1.5% db), phosphorous (0.1-0.2% db) and potassium (0.4-0.8% db) and a high content of recalcitrant organic compounds (e.g. lignin). The promising strategies to improve composting of GW were: i) GW particle size reduction (e.g. shredding and separation of GW fractions); ii) addition of energy amendments (e.g. non-refined sugar, phosphate rock, food waste, volatile ashes), bulking materials (e.g. biocarbon, wood chips), or microbial inoculum (e.g. fungal consortia); and iii) variations in operating parameters (aeration, temperature, and two-phase composting). These alternatives have successfully led to the reduction of process length and have managed to transform recalcitrant substances to a high-quality end-product. Copyright © 2018 Elsevier Ltd. All rights reserved.
Exploring the Optimal Strategy to Predict Essential Genes in Microbes
Directory of Open Access Journals (Sweden)
Yao Lu
2011-12-01
Full Text Available Accurately predicting essential genes is important in many aspects of biology, medicine and bioengineering. In previous research, we have developed a machine learning based integrative algorithm to predict essential genes in bacterial species. This algorithm lends itself to two approaches for predicting essential genes: learning the traits from known essential genes in the target organism, or transferring essential gene annotations from a closely related model organism. However, for an understudied microbe, each approach has its potential limitations. The first is constricted by the often small number of known essential genes. The second is limited by the availability of model organisms and by evolutionary distance. In this study, we aim to determine the optimal strategy for predicting essential genes by examining four microbes with well-characterized essential genes. Our results suggest that, unless the known essential genes are few, learning from the known essential genes in the target organism usually outperforms transferring essential gene annotations from a related model organism. In fact, the required number of known essential genes is surprisingly small to make accurate predictions. In prokaryotes, when the number of known essential genes is greater than 2% of total genes, this approach already comes close to its optimal performance. In eukaryotes, achieving the same best performance requires over 4% of total genes, reflecting the increased complexity of eukaryotic organisms. Combining the two approaches resulted in an increased performance when the known essential genes are few. Our investigation thus provides key information on accurately predicting essential genes and will greatly facilitate annotations of microbial genomes.
Optimizing strategies to improve interprofessional practice for veterans, part 1
Directory of Open Access Journals (Sweden)
Bhattacharya SB
2014-04-01
Full Text Available Shelley B Bhattacharya,1–3 Michelle I Rossi,1,2 Jennifer M Mentz11Geriatric Research Education and Clinical Center (GRECC, Veteran's Affairs Pittsburgh Healthcare System, 2University of Pittsburgh Medical Center, Pittsburgh, PA, USA; 3Albert Schweitzer Fellowship Program, Pittsburgh, PA, USAIntroduction: Interprofessional patient care is a well-recognized path that health care systems are striving toward. The Veteran's Affairs (VA system initiated interprofessional practice (IPP models with their Geriatric Evaluation and Management (GEM programs. GEM programs incorporate a range of specialties, including but not limited to, medicine, nursing, social work, physical therapy and pharmacy, to collaboratively evaluate veterans. Despite being a valuable resource, they are now faced with significant cut-backs, including closures. The primary goal of this project was to assess how the GEM model could be optimized at the Pittsburgh, Pennsylvania VA to allow for the sustainability of this important IPP assessment. Part 1 of the study evaluated the IPP process using program, patient, and family surveys. Part 2 examined how well the geriatrician matched patients to specialists in the GEM model. This paper describes Part 1 of our study.Methods: Three strategies were used: 1 a national GEM program survey; 2 a veteran/family satisfaction survey; and 3 an absentee assessment.Results: Twenty-six of 92 programs responded to the GEM IPP survey. Six strategies were shared to optimize IPP models throughout the country. Of the 34 satisfaction surveys, 80% stated the GEM clinic was beneficial, 79% stated their concerns were addressed, and 100% would recommend GEM to their friends. Of the 24 absentee assessments, the top three reasons for missing the appointments were transportation, medical illnesses, and not knowing/remembering about the appointment. Absentee rate diminished from 41% to 19% after instituting a reminder phone call policy.Discussion: Maintaining the
Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems
Directory of Open Access Journals (Sweden)
Sung Soo Im
2013-01-01
Full Text Available We presented a new hybrid method that combines cellular harmony search algorithms with the Smallest-Small-World theory. A harmony search (HS algorithm is based on musical performance processes that occur when a musician searches for a better state of harmony. Harmony search has successfully been applied to a wide variety of practical optimization problems. Most of the previous researches have sought to improve the performance of the HS algorithm by changing the pitch adjusting rate and harmony memory considering rate. However, there has been a lack of studies to improve the performance of the algorithm by the formation of population structures. Therefore, we proposed an improved HS algorithm that uses the cellular automata formation and the topological structure of Smallest-Small-World network. The improved HS algorithm has a high clustering coefficient and a short characteristic path length, having good exploration and exploitation efficiencies. Nine benchmark functions were applied to evaluate the performance of the proposed algorithm. Unlike the existing improved HS algorithm, the proposed algorithm is expected to have improved algorithmic efficiency from the formation of the population structure.
Fast optimization of binary clusters using a novel dynamic lattice searching method
International Nuclear Information System (INIS)
Wu, Xia; Cheng, Wen
2014-01-01
Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd) 79 clusters with DFT-fit parameters of Gupta potential
Optimization of Signal Region for Dark Matter Search at the ATLAS Detector
Yip, Long Sang Kenny
2015-01-01
This report focused on the optimization of signal region for the search of dark matter produced in proton-proton collision with final states of a single electron or muon, a minimum of four jets, one or two b-jets, and missing transverse momentum at least 100 GeV. A brute-force approach was proposed to scan for the optimal signal region in rectangularly discretized parameter space. Analysis of the leniency of signal regions motivated event-shortlisting and loop-breaking features that allowed efficient optimization of the signal region. With the refined algorithm for the brute-force search, the computation time slimmed from an estimation of three months to one hour, in a test run of a million Monte-Carlo simulated events over densely discretized parameter space of four million signal regions. Further studies could focus on manipulating random numbers, and the interplay between the maximal figure of merit and the lower bound imposed on the background.
Abdul Rani, Khairul Najmy; Abdulmalek, Mohamedfareq; A Rahim, Hasliza; Siew Chin, Neoh; Abd Wahab, Alawiyah
2017-04-20
This research proposes the various versions of modified cuckoo search (MCS) metaheuristic algorithm deploying the strength Pareto evolutionary algorithm (SPEA) multiobjective (MO) optimization technique in rectangular array geometry synthesis. Precisely, the MCS algorithm is proposed by incorporating the Roulette wheel selection operator to choose the initial host nests (individuals) that give better results, adaptive inertia weight to control the positions exploration of the potential best host nests (solutions), and dynamic discovery rate to manage the fraction probability of finding the best host nests in 3-dimensional search space. In addition, the MCS algorithm is hybridized with the particle swarm optimization (PSO) and hill climbing (HC) stochastic techniques along with the standard strength Pareto evolutionary algorithm (SPEA) forming the MCSPSOSPEA and MCSHCSPEA, respectively. All the proposed MCS-based algorithms are examined to perform MO optimization on Zitzler-Deb-Thiele's (ZDT's) test functions. Pareto optimum trade-offs are done to generate a set of three non-dominated solutions, which are locations, excitation amplitudes, and excitation phases of array elements, respectively. Overall, simulations demonstrates that the proposed MCSPSOSPEA outperforms other compatible competitors, in gaining a high antenna directivity, small half-power beamwidth (HPBW), low average side lobe level (SLL) suppression, and/or significant predefined nulls mitigation, simultaneously.
Directory of Open Access Journals (Sweden)
R. A. Swief
2018-01-01
Full Text Available This paper presents an efficient Cuckoo Search Optimization technique to improve the reliability of electrical power systems. Various reliability objective indices such as Energy Not Supplied, System Average Interruption Frequency Index, System Average Interruption, and Duration Index are the main indices indicating reliability. The Cuckoo Search Optimization (CSO technique is applied to optimally place the protection devices, install the distributed generators, and to determine the size of distributed generators in radial feeders for reliability improvement. Distributed generator affects reliability and system power losses and voltage profile. The volatility behaviour for both photovoltaic cells and the wind turbine farms affect the values and the selection of protection devices and distributed generators allocation. To improve reliability, the reconfiguration will take place before installing both protection devices and distributed generators. Assessment of consumer power system reliability is a vital part of distribution system behaviour and development. Distribution system reliability calculation will be relayed on probabilistic reliability indices, which can expect the disruption profile of a distribution system based on the volatility behaviour of added generators and load behaviour. The validity of the anticipated algorithm has been tested using a standard IEEE 69 bus system.
Emergency strategy optimization for the environmental control system in manned spacecraft
Li, Guoxiang; Pang, Liping; Liu, Meng; Fang, Yufeng; Zhang, Helin
2018-02-01
It is very important for a manned environmental control system (ECS) to be able to reconfigure its operation strategy in emergency conditions. In this article, a multi-objective optimization is established to design the optimal emergency strategy for an ECS in an insufficient power supply condition. The maximum ECS lifetime and the minimum power consumption are chosen as the optimization objectives. Some adjustable key variables are chosen as the optimization variables, which finally represent the reconfigured emergency strategy. The non-dominated sorting genetic algorithm-II is adopted to solve this multi-objective optimization problem. Optimization processes are conducted at four different carbon dioxide partial pressure control levels. The study results show that the Pareto-optimal frontiers obtained from this multi-objective optimization can represent the relationship between the lifetime and the power consumption of the ECS. Hence, the preferred emergency operation strategy can be recommended for situations when there is suddenly insufficient power.
Li, Zejing
2012-01-01
This dissertation is mainly devoted to the research of two problems - the continuous-time portfolio optimization in different Wishart models and the effects of discrete rebalancing on portfolio wealth distribution and optimal portfolio strategy.
Verification and synthesis of optimal decision strategies for complex systems
Energy Technology Data Exchange (ETDEWEB)
Summers, S. J.
2013-07-01
that quantifies the probability of hitting a target set at some point during a finite time horizon, while avoiding an obstacle set during each time step preceding the target hitting time. In contrast with the general reach-avoid formulation, which assumes that the target and obstacle sets are constant and deterministic, we allow these sets to be both time-varying and probabilistic. An optimal reach-avoid control policy is derived as the solution to an optimal control problem via dynamic programming. A framework for analyzing probabilistic safety and reachability problems for discrete time stochastic hybrid systems in scenarios where system dynamics are affected by rational competing agents follows. We consider a zero sum game formulation of the probabilistic reach-avoid problem, in which the control objective is to maximize the probability of reaching a desired subset of the hybrid state space, while avoiding an unsafe set, subject to the worst case behavior of a rational adversary. Theoretical results are provided on a dynamic programming algorithm for computing the maximal reach-avoid probability under the worst-case adversary strategy, as well as the existence of a maxmin control policy that achieves this probability. Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic that has become a standard for expressing temporal properties of finite state Markov chains in the context of automated model checking. Here we consider PCTL for non countable-space Markov chains, and we show that there is a substantial affinity between certain of its operators and problems of dynamic programming. We prove some basic properties of the solutions to the latter. The dissertation concludes with a collection of computational examples in the areas of ecology, robotics, aerospace, and finance. (author)
Verification and synthesis of optimal decision strategies for complex systems
International Nuclear Information System (INIS)
Summers, S. J.
2013-01-01
that quantifies the probability of hitting a target set at some point during a finite time horizon, while avoiding an obstacle set during each time step preceding the target hitting time. In contrast with the general reach-avoid formulation, which assumes that the target and obstacle sets are constant and deterministic, we allow these sets to be both time-varying and probabilistic. An optimal reach-avoid control policy is derived as the solution to an optimal control problem via dynamic programming. A framework for analyzing probabilistic safety and reachability problems for discrete time stochastic hybrid systems in scenarios where system dynamics are affected by rational competing agents follows. We consider a zero sum game formulation of the probabilistic reach-avoid problem, in which the control objective is to maximize the probability of reaching a desired subset of the hybrid state space, while avoiding an unsafe set, subject to the worst case behavior of a rational adversary. Theoretical results are provided on a dynamic programming algorithm for computing the maximal reach-avoid probability under the worst-case adversary strategy, as well as the existence of a maxmin control policy that achieves this probability. Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic that has become a standard for expressing temporal properties of finite state Markov chains in the context of automated model checking. Here we consider PCTL for non countable-space Markov chains, and we show that there is a substantial affinity between certain of its operators and problems of dynamic programming. We prove some basic properties of the solutions to the latter. The dissertation concludes with a collection of computational examples in the areas of ecology, robotics, aerospace, and finance. (author)
Ye, Fei; Lou, Xin Yuan; Sun, Lin Fu
2017-01-01
This paper proposes a new support vector machine (SVM) optimization scheme based on an improved chaotic fly optimization algorithm (FOA) with a mutation strategy to simultaneously perform parameter setting turning for the SVM and feature selection. In the improved FOA, the chaotic particle initializes the fruit fly swarm location and replaces the expression of distance for the fruit fly to find the food source. However, the proposed mutation strategy uses two distinct generative mechanisms for new food sources at the osphresis phase, allowing the algorithm procedure to search for the optimal solution in both the whole solution space and within the local solution space containing the fruit fly swarm location. In an evaluation based on a group of ten benchmark problems, the proposed algorithm's performance is compared with that of other well-known algorithms, and the results support the superiority of the proposed algorithm. Moreover, this algorithm is successfully applied in a SVM to perform both parameter setting turning for the SVM and feature selection to solve real-world classification problems. This method is called chaotic fruit fly optimization algorithm (CIFOA)-SVM and has been shown to be a more robust and effective optimization method than other well-known methods, particularly in terms of solving the medical diagnosis problem and the credit card problem.
Lou, Xin Yuan; Sun, Lin Fu
2017-01-01
This paper proposes a new support vector machine (SVM) optimization scheme based on an improved chaotic fly optimization algorithm (FOA) with a mutation strategy to simultaneously perform parameter setting turning for the SVM and feature selection. In the improved FOA, the chaotic particle initializes the fruit fly swarm location and replaces the expression of distance for the fruit fly to find the food source. However, the proposed mutation strategy uses two distinct generative mechanisms for new food sources at the osphresis phase, allowing the algorithm procedure to search for the optimal solution in both the whole solution space and within the local solution space containing the fruit fly swarm location. In an evaluation based on a group of ten benchmark problems, the proposed algorithm’s performance is compared with that of other well-known algorithms, and the results support the superiority of the proposed algorithm. Moreover, this algorithm is successfully applied in a SVM to perform both parameter setting turning for the SVM and feature selection to solve real-world classification problems. This method is called chaotic fruit fly optimization algorithm (CIFOA)-SVM and has been shown to be a more robust and effective optimization method than other well-known methods, particularly in terms of solving the medical diagnosis problem and the credit card problem. PMID:28369096
Computing Optimal Stochastic Portfolio Execution Strategies: A Parametric Approach Using Simulations
Moazeni, Somayeh; Coleman, Thomas F.; Li, Yuying
2010-09-01
Computing optimal stochastic portfolio execution strategies under appropriate risk consideration presents great computational challenge. We investigate a parametric approach for computing optimal stochastic strategies using Monte Carlo simulations. This approach allows reduction in computational complexity by computing coefficients for a parametric representation of a stochastic dynamic strategy based on static optimization. Using this technique, constraints can be similarly handled using appropriate penalty functions. We illustrate the proposed approach to minimize the expected execution cost and Conditional Value-at-Risk (CVaR).
Optimal Stochastic Advertising Strategies for the U.S. Beef Industry
Kun C. Lee; Stanley Schraufnagel; Earl O. Heady
1982-01-01
An important decision variable in the promotional strategy for the beef sector is the optimal level of advertising expenditures over time. Optimal stochastic and deterministic advertising expenditures are derived for the U.S. beef industry for the period `1966 through 1980. They are compared with historical levels and gains realized by optimal advertising strategies are measured. Finally, the optimal advertising expenditures in the future are forecasted.
Search Greedy for radial fuel optimization; Busqueda Greddy para optimizacion radial de combustible
Energy Technology Data Exchange (ETDEWEB)
Ortiz, J. J.; Castillo, J. A. [ININ, 52750 La Marquesa, Estado de Mexico (Mexico); Pelta, D. A. [Universidad de Granada, ETS Ingenieria Informatica y Telecomunicaciones, C/Daniel Saucedo Aranda s/n, 18071 Granada (Spain)]. e-mail: jjortiz@nuclear.inin.mx
2008-07-01
In this work a search algorithm Greedy is presented for the optimization of fuel cells in reactors BWR. As first phase a study was made of sensibility of the Factor of Pick of Local Power (FPPL) of the cell, in function of the exchange of the content of two fuel rods. His way it could settle down that then the rods to exchange do not contain gadolinium, small changes take place in the value of the FPPL of the cell. This knowledge was applied later in the search Greedy to optimize fuel cell. Exchanges of rods with gadolinium takes as a mechanism of global search and exchanges of rods without gadolinium takes as a method of local search. It worked with a cell of 10x10 rods and 2 circular water channels in center of the same one. From an inventory of enrichments of uranium and concentrations of given gadolinium and one distribution of well-known enrichments; the techniques finds good solutions that the FPPL minimizes, maintaining the factor of multiplication of neutrons in a range appropriate of values. In the low part of the assembly of a lot of recharge of a cycle of 18 months the cells were placed. The values of FPPL of the opposing cells are similar or smaller to those of the original cell and with behaviors in the nucleus also comparable to those obtained with the original cell. The evaluation of the cells was made with the code of transport CASMO-IV and the evaluation of the nucleus was made by means of the one simulator of the nucleus SIMULATE-3. (Author)
Rahayu, D. V.; Kusumah, Y. S.; Darhim
2018-05-01
This study examined to see the improvement of prospective teachers’ basic skills of teaching mathematics through search-solve-create-share learning strategy based on overall and Mathematical Prior Knowledge (MPK) and interaction of both. Quasi experiments with the design of this experimental-non-equivalent control group design involved 67 students at the mathematics program of STKIP Garut. The instrument used in this study included pre-test and post-test. The result of this study showed that: (1) The improvement and achievement of the basic skills of teaching mathematics of the prospective teachers who get the learning of search-solve-create-share strategy is better than the improvement and achievement of the prospective teachers who get the conventional learning as a whole and based on MPK; (2) There is no interaction between the learning used and MPK on improving and achieving basic skills of teaching mathematics.
Martian methane plume models for defining Mars rover methane source search strategies
Nicol, Christopher; Ellery, Alex; Lynch, Brian; Cloutis, Ed
2018-07-01
The detection of atmospheric methane on Mars implies an active methane source. This introduces the possibility of a biotic source with the implied need to determine whether the methane is indeed biotic in nature or geologically generated. There is a clear need for robotic algorithms which are capable of manoeuvring a rover through a methane plume on Mars to locate its source. We explore aspects of Mars methane plume modelling to reveal complex dynamics characterized by advection and diffusion. A statistical analysis of the plume model has been performed and compared to analyses of terrestrial plume models. Finally, we consider a robotic search strategy to find a methane plume source. We find that gradient-based techniques are ineffective, but that more sophisticated model-based search strategies are unlikely to be available in near-term rover missions.