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

23rd European Conference on Modelling and Simulation (ECMS)

作者： Pereira, Antonio Reis, Luis Paulo Duarte, Pedro Univ Porto Fac Engn DEI FEUP NIAD&R LIACC Rua Dr Roberto Frias S-N P-4200465 Oporto Portugal Univ Fernando Pessoa CIAGEB P-4249004 Porto Portugal

ISBN: (纸本)9780955301896

Simulating ecological models is always a difficult task, not only because of its complexity but also due to the slowness associated with each simulation run as more variables and processes are incorporated into the complex ecosystem model. The computational overhead becomes a very important limitation for model calibration and scenario analysis, due to the large number of model runs generally required. This paper presents a framework for ecological simulations that intends to increase system performance through the ability to do parallel simulations, allowing the joint analysis of different scenarios. This framework evolved from the usage of one simulator and several agents, that configure the simulator to run specific scenarios, related to possible ecosystem management options, one at a time, to the use of several simulators, each one simulating a different scenario concurrently, speeding up the process and reducing the time for decision between the alternative scenarios proposed by the agents. This approach was tested with a farmer agent that seeks optimal combinations of bivalve seeding areas in a large mariculture region, maximizing the production without exceeding the total allowed seeding area. Results obtained showed that the time needed to acquire a "near" optimal solution decreases proportionally with the number of simulators in the network, improving the performance of the agent's optimization process, without compromising its rationality. This work is a step forward towards an agent based decision support system to optimize complex environmental problems.

关键词： Ecological Simulations optimization algorithms Intelligent Agents

来源：评论

学校读者我要写书评

暂无评论

Realization on PSO Based Induction Motor Design Via SPEED/PC-IMD

Realization on PSO Based Induction Motor Design Via SPEED/PC...

引用

International Conference on Advanced Computer Control

作者： Raj, C. Thanga Srivastava, S. P. Agarwal, Pramod Indian Inst Technol Roorkee Dept Elect Engn Roorkee Uttar Pradesh India

ISBN: (纸本)9780769535166

This paper presents an optimal design and its realization of poly-phase induction motor using Particle Swarm optimization (PSO). The optimization algorithm considers the efficiency, starting torque and temperature rise as objective function (which are considered separately) and nine performance related items as constraints. The PSO algorithm was implemented on a test motor and the results are compared with the Simulated Annealing (SA) technique and normal design. From the test results PSO gave better results and more suitable to motor's design optimization. Optimized variables are realized by PC-IMD (Induction Motor Drives) of SPEED (Scottish Power Electronics and Electric Drives) software. C++ code is used for implementing entire algorithms.

关键词： Design Induction motor Particle Swarm optimization SPEED Software induction motors Particle swarm optimization Optimal design optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

COMPUTATIONAL MODELING AND EXPERIMENTAL INVESTIGATION OF STATIC STRAIGHT-THROUGH LABYRINTH SEALS

引用

ASME International Mechanical Engineering Congress and Exposition

作者： Untaroiu, Alexandrina Goyne, Christopher P. Untaroiu, Costin D. Wood, Houston G. Rockwell, Robert Allaire, Paul E. Univ Virginia Charlottesville VA 22903 USA

ISBN: (纸本)9780791848661

To design highly efficient and stable turbomachines, engineers require accurate methods to model seal flows and calculate clearance-excitation forces generated by the eccentric position of the rotor. One of the most widely used methods to predict leakage flow and dynamic coefficients is the use of computer codes developed based on bulk flow theory. In recent years, computational fluid dynamics (CFD) modeling is increasingly being recognized as an accurate assessment tool for flow parameters and dynamic coefficients evaluation as compared to the bulk flow codes. This paper presents computational and experimental investigations that were carried out to calculate flow parameters in a stationary straight-through model labyrinth seal. The main objective of this study is to explore the capabilities of Ansys-CFX, a commercially available state of the art 3D numerical code, to accurately model compressible flow through the seals. The flow behavior is analyzed using CFD and the flow parameters calculated by CFD are validated against experimental data taken for the same seal configuration. The integrated values of leakage flow rates estimated from the computational results agree with the experimental data within 7.6%. This study serves as a benchmark case that supports further efforts in applying CFD analysis in conjunction with automatic design optimization techniques for seals used for compressible media. It was shown that optimization algorithms combined with CFD simulations have good potential for improving seal design.

关键词： Flow (Dynamics) Simulation Compressible flow Rotors Turbomachinery Excitation Leakage flows optimization Engineers Modeling Engineering simulation Clearances (Engineering) Design Computer simulation Computers optimization algorithms Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

A simpler unified analysis of budget perceptrons 09

A simpler unified analysis of budget perceptrons

引用

26th International Conference On Machine Learning, ICML 2009

作者： Sutskever, Ilya University of Toronto 6 King's College Rd. Toronto ON M5S 3G4 Canada

ISBN: (纸本)9781605585161

The kernel Perception is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing if the number of errors is large. The Forgetron and the Randomized Budget Perception algorithms overcome this problem by restricting the number of support vectors the Perception is allowed to have. These algorithms have regret bounds whose proofs are dissimilar. In this paper we propose a unified analysis of both of these algorithms by observing that the way in which they remove support vectors can be seen as types of L 2-regularization. By casting these algorithms as instances of online convex optimization problems and applying a variant of Zinkevich's theorem for noisy and incorrect gradient, we can bound the regret of these algorithms more easily than before. Our bounds are similar to the existing ones, but the proofs are less technical.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A MAJORIZE-MINIMIZE LINE SEARCH ALGORITHM FOR BARRIER FUNCTION optimization

A MAJORIZE-MINIMIZE LINE SEARCH ALGORITHM FOR BARRIER FUNCTI...

引用

European signal processing conference

作者： Emilie Chouzenoux Said Moussaoui Jerome Idler IRCCYN CNRS UMR 6597 1 rue de la Noe BP 92101 F-44321 Nantes Cedex 03 France

ISBN: (纸本)9781617388767

Many signal and image estimation problems such as maximum entropy reconstruction and positron emission tomography, require the minimization of a criterion containing a barrier function i.e., an unbounded function at the boundary of the feasible solution domain. This function has to be carefully handled in the optimization algorithm. When an iterative descent method is used for the minimization, a search along the line supported by the descent direction is usually performed at each iteration. However, standard line search strategies tend to be inefficient in this context. In this paper, we propose an original line search algorithm based on the majorize-minimize principle. A tangent majorant function is built to approximate a scalar criterion containing a barrier function. This leads to a simple line search ensuring the convergence of several classical descent optimization strategies, including the most classical variants of nonlinear conjugate gradient. The practical efficiency of the proposal scheme is illustrated by means of two examples of signal and image reconstruction.

关键词： line retrieval barrier function Unbounded Function optimization algorithms algorithms Maximum entropy image reconstruction SEARCHING ALGORITHM

来源：评论

学校读者我要写书评

暂无评论

optimization Design Algorithm Based on Artificial Immune System for Mechanical Systems 2nd

Optimization Design Algorithm Based on Artificial Immune Sys...

引用

Second International Symposium on Electronic Commerce and Security(第二届电子商务与安全国际研究大会)(ISECS 2009)

作者： Tao Liu FengWen Cao Yan Zhou Suzhou Vocational University 1158 Yuehu road Suzhou P.R.China

ISBN: (纸本)9781424442843

In order to solve the nonlinear constraint problem,a new and feasible optimization algorithm, i.e. the distance concentration artificial immune algorithm (DCAIA), was presented and applied to structural optimization *** distance concentration and the affinity, between antibody and antigen, and between antibody and antibody, were defined. The proposed algorithm was applied in the optimization design for the mechanical systems. The example shows it is better for an axis design than that of the gene algorithm (GA) and the classical artificial immune algorithm (CAIA).

关键词： optimization algorithms affinity Mechanical systems Antibodies algorithms Structural optimization nonlinear constraint Optimal design artificial immune systems antigens

来源：评论

学校读者我要写书评

暂无评论

The proof of the sufficient descent condition of the Wei-Yao-Liu conjugateg radient method under the strong Wolfe-Powell line search

引用

南宁师范高等专科学校学报 2009年第S1期 21-23页

作者： Hai Huang Zengxin Wei

1. IntroductionThe conjugate gradient (CG) method has played a special role for solving large-scale nonlinear optimization due to the simplicity of their iteration and their very low memory requirements. In fact, the CG method is not among the fastest or more robust optimization algorithms for nonlinear problems available today,but it remains very popular for engineers and mathematicians who are interested in solving large problems [16,17].

关键词： line search descent condition optimization algorithms nonlinear optimization conjugate gradient problems special remains robust memory fact

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Generalized Linear Models for Multiple Quantitative Trait Locus Mapping

引用

GENETICS 2009年第3期181卷 1101-1113页

作者： Yi, Nengjun Banerjee, Samprit Univ Alabama Birmingham Dept Biostat Sect Stat Genet Birmingham AL 35294 USA Cornell Univ Weill Med Coll Dept Publ Hlth Div Biostat & Epidemiol New York NY 10021 USA

We develop hierarchical generalized linear models and computationally efficient algorithms for genomewide analysis of quantitative trait loci (QTL) for various types of phenotypes ill experimental crosses. The proposed models can fit it large number of effects, including covariates, main effects of numerous loci, and gene-gene (epistasis) and gene-environment. (G X E) interactions. The key to the approach is the use of continuous prior distribution oil coefficients that favors sparseness ill the filled model and facilitates computation. We develop it fast expectation-maximization (EM) algorithm to fit models by estimating posterior modes of coefficients. We incorporate our algorithm into the iteratively weighted least squares For classical generalized linear models as implemented ill the package R. We propose a model search strategy, to build a parsimonious model. Our method takes advantage of the special correlation structure in QTL (lata. Simulation studies demonstrate reasonable power to detect true effects, while controlling the rate of false positives. We illustrate with three real data sets and compare our method to existing methods for multilple-QTL. mapping. Our method has been implemented in our freely available package R/qtlbim (***), providing a valuable addition to our previous Markov chain Monte Carlo (MCMC) approach.

关键词： Software Studies Genomics Generalized linear models Variables Research methodology optimization algorithms Methods Gene expression Advantages Data analysis

来源：评论

学校读者我要写书评

暂无评论

A Tale of Three Actuators: How Mechanics, Business Models and Position Sensing Affect Different Mechatronic Servo Problems

A Tale of Three Actuators: How Mechanics, Business Models an...

引用

2009 American Control Conference (ACC 2009)

作者： Daniel Y. Abramovitch Nanotechnology Group at Agilent Laboratories 5301 Stevens Creek Blvd. M/S: 4U-SB Santa Clara CA 95051 USA

ISBN: (纸本)9781424445233

Students studying control problems often learn a lot of wondrous algorithms that impart near mythical properties to the systems that they are applied to. At least this is how it works in theory and simulation. In practice, however, a thorough understanding of the system, the use model, and the market is often far more important than the differences between any two optimization algorithms. Knowing when and where a particular algorithm is useful is typically at the heart of real control problems. This paper will focus on three servo systems with which the author has had considerable experience: hard disks, optical disks, and atomic force microscopes. By examining how the particulars of these three systems affect the use of control algorithms, the author will try to extract some general lessons.

关键词： optimization algorithms Position Sense Atomic Force Microscopy Servo systems Computer algorithms Microelectromechanical devices Servo actuators mechanic Mechanics Writers Compact disc Students

来源：评论

学校读者我要写书评

暂无评论

Research on Electronic Cam Based on Nurbs Interpolation Algorithm

Research on Electronic Cam Based on Nurbs Interpolation Algo...

引用

2009 9th International Conference on Electronic Measurement & Instruments(第九届电子测量与仪器国际会议 ICEMI'2009)

作者： Xu Jiazhong Zhang Lei Qiao Ming Automation college Harbin University of Science and Technology Xuefu Road150086 HarbinChina

ISBN: (纸本)9781424438631;9781424438624

This paper discusses the influence of basic mathematical model, knot vector, control point, weight and basis function on the shape of curve. According to the mathematical principle of NURBS curve and using the equal time division interpolation method, a kind of interpolation algorithm based on Non-Uniform Rational B-Spline (NURBS) is applied to electronic cam under the precondition of meeting the design requirements. Meanwhile, combined with the practical, the impact of the constraint conditions including the velocity, the acceleration, the jerk and the chord error on NURBS curve interpolation has been thoroughly discussed. ' And a kind of optimization algorithm has been adopted to solve problems that the algorithm can not satisfy the requirement of the constraint conditions. The analysis of the algorithm and the simulation trial proves that, this algorithm can fit the profile curve accurately by decreasing the downloaded parameter number, and the gliding property of curve is decent when processing complex profile curve.

关键词： Interpolation Arithmetic constraint condition generating curve Camelopardalis Computer aided manufacturing curve interpolation Curves analysis of algorithm basis functions Design Requirements optimization algorithms algorithms Electronics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：