131 resultados para global optimization algorithms
Resumo:
Evolutionary algorithms perform optimization using a population of sample solution points. An interesting development has been to view population-based optimization as the process of evolving an explicit, probabilistic model of the search space. This paper investigates a formal basis for continuous, population-based optimization in terms of a stochastic gradient descent on the Kullback-Leibler divergence between the model probability density and the objective function, represented as an unknown density of assumed form. This leads to an update rule that is related and compared with previous theoretical work, a continuous version of the population-based incremental learning algorithm, and the generalized mean shift clustering framework. Experimental results are presented that demonstrate the dynamics of the new algorithm on a set of simple test problems.
Resumo:
Elevated ocean temperatures can cause coral bleaching, the loss of colour from reef-building corals because of a breakdown of the symbiosis with the dinoflagellate Symbiodinium. Recent studies have warned that global climate change could increase the frequency of coral bleaching and threaten the long-term viability of coral reefs. These assertions are based on projecting the coarse output from atmosphere-ocean general circulation models (GCMs) to the local conditions around representative coral reefs. Here, we conduct the first comprehensive global assessment of coral bleaching under climate change by adapting the NOAA Coral Reef Watch bleaching prediction method to the output of a low- and high-climate sensitivity GCM. First, we develop and test algorithms for predicting mass coral bleaching with GCM-resolution sea surface temperatures for thousands of coral reefs, using a global coral reef map and 1985-2002 bleaching prediction data. We then use the algorithms to determine the frequency of coral bleaching and required thermal adaptation by corals and their endosymbionts under two different emissions scenarios. The results indicate that bleaching could become an annual or biannual event for the vast majority of the world's coral reefs in the next 30-50 years without an increase in thermal tolerance of 0.2-1.0 degrees C per decade. The geographic variability in required thermal adaptation found in each model and emissions scenario suggests that coral reefs in some regions, like Micronesia and western Polynesia, may be particularly vulnerable to climate change. Advances in modelling and monitoring will refine the forecast for individual reefs, but this assessment concludes that the global prognosis is unlikely to change without an accelerated effort to stabilize atmospheric greenhouse gas concentrations.
Resumo:
Coal fired power generation will continue to provide energy to the world for the foreseeable future. However, this energy use is a significant contributor to increased atmospheric CO2 concentration and, hence, global warming. Capture and disposal Of CO2 has received increased R&D attention in the last decade as the technology promises to be the most cost effective for large scale reductions in CO2 emissions. This paper addresses CO2 transport via pipeline from capture site to disposal site, in terms of system optimization, energy efficiency and overall economics. Technically, CO2 can be transported through pipelines in the form of a gas, a supercritical. fluid or in the subcooled liquid state. Operationally, most CO2 pipelines used for enhanced oil recovery transport CO2 as a supercritical fluid. In this paper, supercritical fluid and subcooled liquid transport are examined and compared, including their impacts on energy efficiency and cost. Using a commercially available process simulator, ASPEN PLUS 10.1, the results show that subcooled liquid transport maximizes the energy efficiency and minimizes the Cost Of CO2 transport over long distances under both isothermal and adiabatic conditions. Pipeline transport of subcooled liquid CO2 can be ideally used in areas of cold climate or by burying and insulating the pipeline. In very warm climates, periodic refrigeration to cool the CO2 below its critical point of 31.1 degrees C, may prove economical. Simulations have been used to determine the maximum safe pipeline distances to subsequent booster stations as a function of inlet pressure, environmental temperature and ground level heat flux conditions. (c) 2005 Published by Elsevier Ltd.
Resumo:
In this letter, we propose a class of self-stabilizing learning algorithms for minor component analysis (MCA), which includes a few well-known MCA learning algorithms. Self-stabilizing means that the sign of the weight vector length change is independent of the presented input vector. For these algorithms, rigorous global convergence proof is given and the convergence rate is also discussed. By combining the positive properties of these algorithms, a new learning algorithm is proposed which can improve the performance. Simulations are employed to confirm our theoretical results.
Resumo:
Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.
Resumo:
Ancillary service plays a key role in maintaining operation security of the power system in a competitive electricity market. The spinning reserve is one of the most important ancillary services that should be provided effectively. This paper presents the design of an integrated market for energy and spinning reserve service with particular emphasis on coordinated dispatch of bulk power and spinning reserve services. A new market dispatching mechanism has been developed to minimize the cost of service while maintaining system security. Genetic algorithms (GA) are used for finding the global optimal solutions for this dispatch problem. Case studies and corresponding analyses have been carried out to demonstrate and discuss the efficiency and usefulness of the proposed method.
Resumo:
We investigate analytically the first and the second law characteristics of fully developed forced convection inside a porous-saturated duct of rectangular cross-section. The Darcy-Brinkman flow model is employed. Three different types of thermal boundary conditions are examined. Expressions for the Nusselt number, the Bejan number, and the dimensionless entropy generation rate are presented in terms of the system parameters. The conclusions of this analytical study will make it possible to compare, evaluate, and optimize alternative rectangular duct design options in terms of heat transfer, pressure drop, and entropy generation. (c) 2006 Elsevier Ltd. All rights reserved.
Resumo:
Market-based transmission expansion planning gives information to investors on where is the most cost efficient place to invest and brings benefits to those who invest in this grid. However, both market issue and power system adequacy problems are system planers’ concern. In this paper, a hybrid probabilistic criterion of Expected Economical Loss (EEL) is proposed as an index to evaluate the systems’ overall expected economical losses during system operation in a competitive market. It stands on both investors’ and planner’s point of view and will further improves the traditional reliability cost. By applying EEL, it is possible for system planners to obtain a clear idea regarding the transmission network’s bottleneck and the amount of losses arises from this weak point. Sequentially, it enables planners to assess the worth of providing reliable services. Also, the EEL will contain valuable information for moneymen to undertake their investment. This index could truly reflect the random behaviors of power systems and uncertainties from electricity market. The performance of the EEL index is enhanced by applying Normalized Coefficient of Probability (NCP), so it can be utilized in large real power systems. A numerical example is carried out on IEEE Reliability Test System (RTS), which will show how the EEL can predict the current system bottleneck under future operational conditions and how to use EEL as one of planning objectives to determine future optimal plans. A well-known simulation method, Monte Carlo simulation, is employed to achieve the probabilistic characteristic of electricity market and Genetic Algorithms (GAs) is used as a multi-objective optimization tool.
Resumo:
Wolbachia are maternally inherited intracellular α-Proteobacteria found in numerous arthropod and filarial nematode species [1, 2 and 3]. They influence the biology of their hosts in many ways. In some cases, they act as obligate mutualists and are required for the normal development and reproduction of the host [4 and 5]. They are best known, however, for the various reproductive parasitism traits that they can generate in infected hosts. These include cytoplasmic incompatibility (CI) between individuals of different infection status, the parthenogenetic production of females, the selective killing of male embryos, and the feminization of genetic males [1 and 2]. Wolbachia infections of Drosophila melanogaster are extremely common in both wild populations and long-term laboratory stocks [6, 7 and 8]. Utilizing the newly completed genome sequence of Wolbachia pipientis wMel [9], we have identified a number of polymorphic markers that can be used to discriminate among five different Wolbachia variants within what was previously thought to be the single clonal infection of D. melanogaster. Analysis of long-term lab stocks together with wild-caught flies indicates that one of these variants has replaced the others globally within the last century. This is the first report of a global replacement of a Wolbachia strain in an insect host species. The sweep is at odds with current theory that cannot explain how Wolbachia can invade this host species given the observed cytoplasmic incompatibility characteristics of Wolbachia infections in D. melanogaster in the field [6].
Resumo:
Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.
Resumo:
The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.