检索结果-内蒙古大学图书馆

13th Annual Genetic and Evolutionary Computation Conference (GECCO)

作者： Goschin, Sergiu Littman, Michael L. Ackley, David H. Rutgers State Univ RL3 Piscataway NJ 08854 USA Univ New Mexico Albuquerque NM 87131 USA

ISBN: (纸本)9781450305570

This paper examines how the choice of the selection mechanism in an evolutionary algorithm impacts the objective function it optimizes, specifically when the fitness function is noisy. We provide formal results showing that, in an abstract infinite-population model, proportional selection optimizes expected fitness, truncation selection optimizes order statistics, and tournament selection can oscillate. The "winner" in a population depends on the choice of selection rule, especially when fitness distributions differ between individuals resulting in variable risk. These findings are further developed through empirical results on a novel stochastic optimization problem called "Die4", which, while simple, extends existing benchmark problems by admitting a variety of interpretations of optimality.

关键词： Evolutionary noisy optimization convergence analysis selection algorithms

来源：评论

学校读者我要写书评

暂无评论

Searching for selection algorithms

引用

Electronic Notes in Discrete Mathematics 2006年 27卷 77-77页

作者： Oksanen, Kenneth Laboratory of Software Technology Helsinki University of Technology Espoo Finland

来源：评论

学校读者我要写书评

暂无评论

Fast algorithms for finding disjoint subsequences with extremal densities

引用

PATTERN RECOGNITION 2006年第12期39卷 2281-2292页

作者： Bergkvist, Anders Damaschke, Peter Chalmers Univ Technol Sch Engn & Comp Sci S-41296 Gothenburg Sweden Univ Gothenburg Dept Mol Biol S-40530 Gothenburg Sweden

We derive fast algorithms for the following problem: given a set of n points on the real line and two parameters s and p, find s disjoint intervals of maximum total length that contain at most p of the given points. Our main contribution consists of algorithms whose time bounds improve upon a straightforward dynamic programming algorithm, in the relevant case that input size n is much bigger than parameters s and p. These results are achieved by selecting a few candidate intervals that are provably sufficient for building an optimal solution via dynamic programming. As a byproduct of this idea we improve an algorithm for a similar subsequence problem of Chen et al. [Disjoint segments with maximum density, in: International Workshop on Bioinformatics Research and Applications IWBRA 2005, (within ICCS 2005), Lecture Notes in Computer Science, vol. 3515, Springer, Berlin, pp. 845-850]. The problems are motivated by the search for significant patterns in biological data. Finally, we propose several heuristics that further reduce the time complexity in typical instances. One of them leads to an apparently open subsequence sum problem of independent interest. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

关键词： holes in data range prediction protein torsion angle protein structure prediction dynamic programming selection algorithms time complexity

来源：评论

学校读者我要写书评

暂无评论

Reserve networks based on richness hotspots and representation vary with scale

引用

ECOLOGICAL APPLICATIONS 2006年第5期16卷 1660-1673页

作者： Shriner, Susan A. Wilson, Kenneth R. Flather, Curtis H. Natl Wildlife Res Ctr USDA APHIS WS Ft Collins CO 80521 USA Colorado State Univ Dept Fish Wildlife & Conservat Biol Ft Collins CO 80523 USA US Forest Serv Rocky Mt Forest & Range Expt Stn Ft Collins CO 80526 USA

While the importance of spatial scale in ecology is well established, few studies have investigated the impact of data grain on conservation planning outcomes. In this study, we compared species richness hotspot and representation networks developed at five grain sizes. We used species distribution maps for mammals and birds developed by the Arizona and. New Mexico Gap Analysis Programs (GAP) to produce 1-km(2), 100-km(2) 625-km(2), 2500-km(2), and 10000-km(2) grid cell resolution distribution maps. We used these distribution maps to generate species richness and hotspot (95th quantile) maps for each taxon in each state. Species composition information at each grain size was used to develop two types of representation networks using the reserve selection software MARXAN. Reserve selection analyses were restricted to Arizona birds due to considerable computation requirements. We used MARXAN to create best reserve networks based on the minimum area required to represent each species at least once and equal area networks based on irreplaceability values. We also measured the median area of each species' distribution included in hotspot (mammals and birds of Arizona and New Mexico) and irreplaceability (Arizona birds) networks across all species. Mean area overlap between richness hotspot reserves identified at the five grain sizes was 29% (grand mean for four within-taxon/state comparisons), mean overlap for irreplaceability reserve networks was 32%, and mean overlap for best reserve networks was 53%. Hotspots for mammals and birds showed low overlap with a mean of 30%. Comparison of hotspots and irreplaceability networks showed very low overlap with a mean of 13%. For hotspots;median species distribution area protected within reserves declined monotonically from a high of 11% for 1-km(2) networks down to 6% for 10000-km(2) networks. Irreplaceability networks showed a similar, but more variable, pattern of decline. This work clearly shows that map resolution has a prof

关键词： biodiversity conservation planning grain hotspots map resolution MARXAN representation reserve selection selection algorithms spatial scale species richness

来源：评论

学校读者我要写书评

暂无评论

Fast algorithms for finding disjoint subsequences with extremal densities

引用

16th International Symposium on algorithms and Computations (ISAAC 2005)

作者： Bergkvist, Anders Damaschke, Peter Chalmers Univ Technol Sch Engn & Comp Sci S-41296 Gothenburg Sweden Univ Gothenburg Dept Mol Biol S-40530 Gothenburg Sweden

ISBN: (纸本)3540309357

关键词： holes in data range prediction protein torsion angle protein structure prediction dynamic programming selection algorithms time complexity

来源：评论

学校读者我要写书评

暂无评论

Using vascular plants as a surrogate taxon to maximize fungal species richness in reserve design

引用

CONSERVATION BIOLOGY 2005年第5期19卷 1644-1652页

作者： Chiarucci, A D'Auria, F De Dominicis, V Laganà, A Perini, C Salerni, E Univ Siena Dipartimento Sci Ambientali G Sarfatti I-53100 Siena Italy

Fungi are a hyperdiverse taxonomic group that may be disappearing at a very high rate. Identifying fungal species is difficult in the field, and the use of highly specialized taxonomists is required. Data and expertise on vascular plants are, on the other band, much more common and easy to find. We tested the potential of using vascular plants as surrogates to select reserve sites that maximize the pooled number of fungal species. We used data from 25 forest plots in Tuscany, Italy, that were sampled for woody plants, all other plants, and fungi. Species richness of woody plants and all other plants did not correlate with species richness of fungi. The gradients in species composition were similar among the three considered groups, as indicated by a detrended correspondence analysis ordination and species complementarity between pairs of plots. Fungal communities of the 25 plots had a lower beta diversity than plant communities, and there were no pairs of totally complementary sites. Site prioritization for conservation was obtained through integer linear programming to find for any given number of sites those combinations containing the maximum pooled species richness of woody plants or all plants. The combinations of sites obtained by optimizing vascular plant species did not maximize the pooled species richness of fungi, whereas those obtained by maximizing woody plant species provided better results for sets of four to. eight plots, but not for all the possible combinations. These results indicated that, in general, vascular plants cannot be used to maximize fungal species richness.

关键词： selection algorithms FRUIT BODIES OAK WOODS CONSERVATION DIVERSITY FOREST BIODIVERSITY BRYOPHYTES MACROFUNGI COMPLEMENTARITY

来源：评论

学校读者我要写书评

暂无评论

A new hybrid multibias analytical/decomposition-based FET parameter extraction algorithm with intelligent bias point selection

引用

IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES 2003年第3期51卷 893-902页

作者： van Niekerk, C du Preez, JA Schreurs, DMMP Univ Stellenbosch Dept Elect & Elect Engn ZA-7602 Stellenbosch South Africa Catholic Univ Louvain Dept Elect Engn ESAT TELEMIC B-3000 Louvain Belgium

A new hybrid multibias analytical/decomposition-based parameter extraction procedure for GaAs FETs is described. The analytical calculations are integrated into an existing decomposition-based optimizer in a complementary approach, further increasing the robustness of the existing algorithm. It is illustrated that, in order to increase the reliability with which the full 15-element small-signal model can be extracted, it is necessary to exploit the underlaying characteristics of the system and the measured data used. This is achieved through the use of cold S-parameter data, along with simple modifications to the extraction algorithm, and a new intelligent selection algorithm for the active bias points used in the multi-bias extraction. The selection algorithm employs a simple geometric abstraction for the S-parameter data that allows it to select bias points that maximize the information available to the extraction procedure. The new selection algorithm shows for the first time what the influence of the bias points is on the performance of a multibias extraction procedure. Experimental results proving the robustness and accuracy of the described procedures are presented.

关键词： centroids FET modeling multibias parameter extraction S-parameters selection algorithms small-signal

来源：评论

学校读者我要写书评

暂无评论

Explanation of goal softening in ordinal optimization

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1999年第1期44卷 94-99页

作者： Lee, LH Lau, TWE Ho, YC Natl Univ Singapore Dept Ind & Syst Engn Singapore 117548 Singapore Harvard Univ Div Engn & Appl Sci Cambridge MA 02138 USA

The authors explain the role of goal softening in the convergence of alignment probability employed in Ordinal Optimization. Using the an order statistics formulation, they examine the exponential decrease of misalignment probability bounds when two or more designs are compared. Their conclusion states that, by relaxing the good enough subset and selected subset criteria it is exponentially efficient in terms of matching good designs in a selected group.

关键词： alignment probability order statistics selection algorithms stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

Designing bioreserve networks to satisfy multiple, conflicting demands

引用

ECOLOGICAL APPLICATIONS 1999年第3期9卷 741-750页

作者： Rothley, KD Yale Univ Sch Forestry & Environm Studies New Haven CT 06511 USA

Reserve designers typically strive to create reserves that satisfy a variety of potentially conflicting criteria. Rather than optimizing with respect to just one criterion, reserve planners are likely to seek some compromise. To facilitate bioreserve design, I propose the use of multiobjective programming to identify these compromise alternatives, and then the use of the simple multiattribute rating technique to rank these alternatives and to explore the sensitivity of the rankings to the relative value placed on the individual criteria. An example is provided for the selection of a reserve system in Nova Scotia, Canada, based on three criteria: (1) connectedness, (2) area, and (3) rare species representation. First, multiobjective programming was used to reduce the set of over 15 000 potential reserve-system alternatives to a list of 36 candidate systems representing the optimal tradeoffs among the three criteria. The simple attribute-rating technique was then used to identify a single best solution for an arbitrary set of relative criteria values and to test the robustness of this solution to changes in relative preferences for the criteria. The techniques presented here can simplify the evaluation of reserve alternatives, enabling planners to refocus their efforts on the complex biological, social, and economic aspects of reserve design.

关键词： biodiversity preservation bioreserve design multiobjective programming Nova Scotia reserve network reserve selection selection algorithms reserves simple multiattribute rating technique

来源：评论

学校读者我要写书评

暂无评论

Integrated protected area selection in Australian biogeographic regions

引用

ENVIRONMENTAL MANAGEMENT 1997年第3期21卷 395-404页

作者： Lockwood, M Bos, DG Glazebrook, H Johnstone Centre of Parks Recreation and Heritage Charles Sturt University PO Box 789 Albury Australia 2640 AU

This paper reports on the development of a biogeographic-based protected area selection procedure (PASP) that addresses limitations of current reserve selection methods such as inflexibility, restrictive criteria structures, and disregard of social criteria. We argue that selection criteria are legitimately identified through the political process and can therefore have both social and biological content. PASP provides a systematic, flexible and efficient procedure for identifying a network of protected areas that satisfies a given set of selection criteria. PASP has 11 steps divided into three main stages: compilation, selection, and validation. A selection algorithm is used into which criteria specific to the biogeographic region under study can be incorporated. The procedure is able to accommodate both nominal and ranking criteria and gives the analyst the opportunity to specify thresholds and targets for each criterion. Other features of PASP include the minimization of data collection effort, consideration of reserve design principles, and inclusion of a network evaluation as a check to ensure that politically determined objectives have been met.

关键词： land use protected area networks selection algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：