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

作者： Rodman, Michael R. Naval Postgraduate School

学位级别：硕士

Theater Security Cooperation (TSC) is a U. S. strategy for improving multi-national relationships through cooperative efforts. Spitz develops the Central-West Africa Resource and Mission Allocation (CARMA) optimization model, which posits a naval vessel carrying various expeditionary partnership teams to transit an area of responsibility and conduct missions garnering the maximum amount of TSC value. CARMA can be solved with formal, mixed-integer optimization, at the expense of computational time. This thesis modifies the original Spitz's scenarios to test H-CARMA, a fast heuristic algorithm developed by Dwyer, and its performance under shorter planning horizons, multiple budget constraints and different distribution of missions and TSC value across countries. Most of the scenarios evidence shortcomings of H-CARMA that were not apparent in the earlier scenarios tested by Dwyer. In all but one of the reviewed cases, H-CARMA generates solutions with total TSC value less than 81% of those using Spitz's algorithms, and, in the worst of these cases, the solution only achieves 51 percent. When there is no slack in terms of time and budget, MIP solutions outperform those of H-CARMA by more than 25% in most cases examined. We identify sources for some of these deficiencies and recommend changes to address them.

关键词： Gulf of Guinea Logistics Scheduling Optimization Mission Routing Theater Security Cooperation algorithm comparison

来源：评论

学校读者我要写书评

暂无评论

The algorithm comparison for solving eigen problem in open optical waveguides

The algorithm comparison for solving eigen problem in open o...

引用

Conference on Optical Design and Testing II

作者： Zhu, JX Tang, SY Zhejiang Univ Dept Matemat Hangzhou 310027 Peoples R China

ISBN: (纸本)0819455938

In this paper, based on the Rayleigh quotient and its generalized Rayleigh quotient, two treatments are developed to solve the complex eigenvalue problems, which arise from the analysis of the optical wave propagation in Stab waveguides with some perfectly matched layers. Numerical examples illustrate that these treatments are efficient and feasible, and the generalized Rayleigh quotient method is better than the Rayleigh quotient method for some eigenvalues with smaller norm.

关键词： algorithm comparison Rayleigh quotient slab waveguide PML eigenvalue

来源：评论

学校读者我要写书评

暂无评论

Hybrid algorithms for electromagnetic problems and the no-free-lunch framework

引用

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 2007年第3期55卷 742-749页

作者： Quevedo-Teruel, Oscar Rajo-Iglesias, Eva Oropesa-Garcia, Alicia Univ Carlos III Madrid Dept Signal Theory & Commun Madrid 28911 Spain

A popular approach to electromagnetic design is based on generic optimization algorithms which mimic natural phenomena. These algorithms have been proved feasible through multiple experiments even though there is no standard procedure to their design for a particular problem. Hybrid schemes allow an insightful and quite efficient approach towards their design. Furthermore, an intrinsic characteristic of this class of algorithms is their randomness, which is precisely the base the no-free-lunch theorem exploits to measure their fit to a particular problem. This characterization permits a reproducible comparison between algorithms through their fitness density functions.

关键词： algorithm comparison hybrid algorithms no-free-lunch (NFL) framework

来源：评论

学校读者我要写书评

暂无评论

Improved retrieval of sea ice total concentration from spaceborne passive microwave observations using numerical weather prediction model fields: An intercomparison of nine algorithms

引用

REMOTE SENSING OF ENVIRONMENT 2006年第4期104卷 374-392页

作者： Andersen, Soren Tonboe, Rasmus Kern, Stefan Schyberg, Harald Danish Meteorol Inst Ice Charting & Remote Sensing Div DK-2100 Copenhagen Denmark Univ Hamburg Inst Oceanog D-20146 Hamburg Germany Norwegian Meterorol Inst N-0313 Oslo Norway

The accuracy of the sea ice concentration estimates in polar regions is reduced by the effects of atmospheric emission and absorption. A method is presented where a fast atmospheric radiative transfer model and Numerical Weather Prediction (NWP) model fields are used to correct brightness temperatures before they enter the sea ice concentration algorithm. The skill of the method is a function of the errors in the NWP model fields modulated by the sensitivities of the sea ice concentration algorithm used. The NWP model fields representing the most significant atmospheric parameters, i.e. water vapour, cloud liquid water, surface temperature and wind speed over open water are evaluated using remote sensing data. For wind speed and total water vapour, it is found that the standard deviation of the difference is less than the RMS error quoted for the remote sensing algorithms. The best consistency is found for water vapour followed by wind speed. The NWP model cloud liquid water displays standard deviations much higher than the RMS error of the remote sensing algorithm and close to the total average content. Nine sea ice concentration algorithms are further evaluated in a sensitivity study to the above-mentioned atmospheric constituents using a detailed atmospheric radiative transfer model. The result shows that the class of algorithms based solely on the 19 and 37 GHz vertically polarised channels display the smallest sensitivity to all three atmospheric parameters: total water vapour, wind speed and cloud liquid water. Finally, it is demonstrated that this method overcomes many problems associated with conventional weather filtering over mixed ice-water and new-ice pixels and allows the retrieval of sea ice concentrations below 10%. (c) 2006 Elsevier Inc. All rights reserved.

关键词： sea ice sea ice concentration passive microwave atmospheric correction algorithm comparison sensitivity analysis atmospheric contamination SSM/I HIRLAM NWP

来源：评论

学校读者我要写书评

暂无评论

A note on "a hybrid genetic algorithm for the dynamic plant layout problem"

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2006年第1期103卷 87-89页

作者： Balakrishnan, J Cheng, CH Univ Calgary Haskayne Sch Business Operat Management Area Calgary AB T2N 1N4 Canada Chinese Univ Hong Kong Dept Syst Engn & Engn Management Shatin Hong Kong Peoples R China

The dynamic plant layout problem (DPLP) deals with multi-period layout. Since a seminal work published in 1986 by Rosenblatt, many researchers have followed up with a number of solution methods. Among those, genetic algorithms and simulated annealing have been proposed. In this paper, we compare the performance of these algorithms in solving the DPLP. (c) 2005 Elsevier B.V. All rights reserved.

关键词： dynamic layout genetic algorithms simulated annealing algorithm comparison

来源：评论

学校读者我要写书评

暂无评论

Recent developments in CANDECOMP/PARAFAC algorithms: a critical review

引用

CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS 2003年第1期65卷 119-137页

作者： Faber, NM Bro, R Hopke, PK Royal Vet & Agr Univ DK-1958 Frederiksberg C Denmark ATO Dept Prod & Control Syst NL-6700 AA Wageningen Netherlands Clarkson Univ Dept Chem Engn Potsdam NY 13699 USA

Several recently proposed algorithms for fitting the PARAFAC model are investigated and compared to more established alternatives. Alternating least squares (ALS), direct trilinear decomposition (DTLD), alternating trilinear decomposition (ATLD), self-weighted alternating trilinear decomposition (SWATLD), pseudo alternating least squares (PALS), alternating coupled vectors resolution (ACOVER), alternating slice-wise diagonalization (ASD) and alternating coupled matrices resolution (ACOMAR) are compared on both simulated and real data. For the recent algorithms, only unconstrained three-way models can be fitted. In contrast, for example, ALS allows modeling of higher-order data, as well as incorporating constraints on the parameters and handling of missing data. Nevertheless, for three-way data, the newer algorithms are interesting alternatives. It is found that the ALS estimated models are generally of a better quality than any of the alternatives even when overfactoring the model, but it is also found that ALS is significantly slower. Based on the results (in particular the poor performance of DTLD), it is advised that (a slightly modified) ASD may be a good alternative to ALS when a faster algorithm is desired. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： trilinear overfactoring algorithm comparison speed

来源：评论

学校读者我要写书评

暂无评论

The effect of overabundant projection directions on 3D reconstruction algorithms

引用

JOURNAL OF STRUCTURAL BIOLOGY 2001年第2-3期133卷 108-118页

作者： Sorzano, COS Marabini, R Boisset, N Rietzel, E Schröder, R Herman, GT Carazo, JM Univ Autonoma Madrid CSIC Ctr Nacl Biotecnol E-28049 Madrid Spain Temple Univ Ctr Comp Sci & Appl Math Philadelphia PA 19122 USA Max Planck Inst Med Forsch D-69120 Heidelberg Germany Univ Paris 06 Equipte Syst Mol & Biol Struct Lab Mineral Cristallog F-75252 Paris 05 France

The experimental process of collecting images from macromolecules in an electron microscope is such that it does not allow for prior specification of the angular distribution of the projection images. As a consequence, an uneven distribution of projection directions may occur. Concerns have been raised recently about the behavior of 3D reconstruction algorithms for the case of unevenly distributed projections. It has been illustrated on experimental data that in the case of a heavily uneven distribution of projection directions some algorithms tend to elongate the reconstructed volumes along the overloaded direction so much as to make a quantitative biological analysis impossible. In answer to these concerns we have developed a strategy for quantitative comparison and optimization of 3D reconstruction algorithms. We apply this strategy to quantitatively analyze algebraic reconstruction techniques (ART) with blobs, simultaneous iterative reconstruction techniques (SIRT) with voxels, and weighted backprojection (WBP). We show that the elongation artifacts that had been previously reported can be strongly reduced. With our specific choices for the free parameters of the three algorithms, NMP reconstructions tend to be inferior to those obtained with either SIRT or ART and the results obtained with ART are comparable to those with SIRT, but at a very small fraction of the computational cost of SIRT. (C) 2001 Academic Press.

关键词： 3D reconstruction algorithms algorithm optimization algorithm comparison collection geometry

来源：评论

学校读者我要写书评

暂无评论

Ordinal comparison of heuristic algorithms using stochastic optimization

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1999年第1期15卷 44-56页

作者： Chen, CH Wu, SD Dai, LY Univ Penn Dept Syst Engn Philadelphia PA 19104 USA Lehigh Univ Dept Ind & Mfg Syst Engn Bethlehem PA 18015 USA Washington Univ Dept Syst Sci & Math St Louis MO 63130 USA

The performance of heuristic algorithms for combinatorial optimization is often sensitive to problem instances. In extreme cases, a specialized heuristic algorithm may perform exceptionally well on a particular set of instances while fail to produce acceptable solutions on others, Such a problem-sensitive nature is most evident in algorithms for combinatorial optimization problems such as job shop scheduling, vehicle routing, and cluster analysis. This paper proposes a formal method for comparing and selecting heuristic algorithms (or equivalently, different settings of a same algorithm) given a desired confidence level and a particular set of problem instances. We formulate this algorithm comparison problem as a stochastic optimization problem. Two approaches for stochastic optimization, Ordinal Optimization and Optimal Computing Budget Allocation are applied to solve this algorithm selection problem. Computational testing on a set of statistical clustering algorithms in the IMSL library is conducted. The results demonstrate that our method can determine the relative performance of heuristic algorithms with high confidence probability while using a small fraction of computer times that conventional methods require.

关键词： algorithm comparison cluster analysis computing budget allocation manufacturing scheduling problems ordinal optimization stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

A survey on evaluation methods for image segmentation

引用

PATTERN RECOGNITION 1996年第8期29卷 1335-1346页

作者： Zhang, YJ SHANTOU UNIV INST AI & PRSHANTOU 515063PEOPLES R CHINA

This paper studies different methods proposed so far for segmentation evaluation. Most methods can be classified into three groups: the analytical, the empirical goodness and the empirical discrepancy groups. Each group has its own characteristics. After a brief description of each method in every group, some comparative discussions about different method groups are first carried out. An experimental comparison for some empirical (goodness and discrepancy) methods commonly used is then performed to provide a rank of their evaluation abilities. In addition, some special methods are also discussed. This study is helpful for an appropriate use of existing evaluation methods and for improving their performance as well as for systematically designing new evalution methods. Copyright (C) 1996 Pattern Recognition Society. Published by Elsevier Science Ltd.

关键词： image analysis image segmentation segmentation evaluation analytical and empirical study performance assessment criteria function algorithm comparison image quality measure method characterization

来源：评论

学校读者我要写书评

暂无评论

Data compression and archiving software implementation and their algorithm comparison

Data compression and archiving software implementation and t...

引用

作者： Jung, Young Je Naval Postgraduate School

学位级别：硕士

Although data compression has been studied for over 30 years, many new techniques are still evolving. There is considerable software available that incorporates compression schemes and archiving techniques. The U. S. Navy is interested in knowing the performance of this software. This thesis studies and compares the software. The testing files consist of the file types specified by the U. S. Naval Security Detachment at Pensacola, Florida.

关键词： Data Compression and Archiving Software Performance Analysis Compression Ratios and Execution Time comparison algorithm comparison

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：