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

10th Asia and South Pacific Design Automation Conference

作者： Xiao, Shu Lai, Edmund M-K. Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)0780387368

An instruction word in VLIW (very long instruction word) processors consists of a variable number of individual instructions. Therefore the power consumption variation over time significantly depends on the parallel instruction schedule generated by the compiler. Sharp power variations across time cause power supply noises, degrade chip reliability and accelerate battery exhaustion. This paper proposes a branch and bound algorithm for instruction scheduling of VLIW architectures that effectively minimizing power v ariation without degrading the speed. Our experimental results demonstrate the efficiency of our algorithm compared with previously presented approaches. Finally, a new rough sets based approach to the instruction-level VLIW power model for this instruction scheduling optimization problem is discussed.

关键词： processor scheduling parallel architectures instruction sets optimisation rough set theory VLIW architectures balanced power consumption very long instruction word processors power consumption variation parallel instruction schedule branch and bound algorithm power variation minimization rough sets instruction-level VLIW power model instruction scheduling optimization problem VLIW architecture branch and bound algorithms Instruction Scheduling instruction sets scheduling of multiprocessor Rough sets Parallel architectures Very long instruction word Rough set theory Power consumption power fluctuation instruction statement

来源：评论

学校读者我要写书评

暂无评论

bounding vertex coloring by truncated Multistage branch and bound

引用

NETWORKS 2004年第4期44卷 231-242页

作者： Caramia, M Dell'Olmo, P Ist Applicaz Calcolo M Picone I-00161 Rome Italy Univ Roma La Sapienza Diparimento Stat Probabil & Stat Applicate I-00185 Rome Italy

In this article we design a truncated enumerative algorithm based on branch and bound rules embedded in a multistage scheme that allows iterative visits of subgraphs. The algorithm is designed to find lower bounds on the chromatic number of graphs, and, by means of simple coloring extension rules, it is often capable of finding optimal solutions. In this issue we obtain a very promising result: our algorithm was able to solve benchmarks DSJC125_5, DSJC125_9, DSJC250_1, DSJR500_1c, and DSJR500_5, which had not previously been solved. Furthermore, we show how our method can be employed in finding upper bounds on the chromatic number, and thus, we compare the upper bound-lower bound gaps so obtained with those achieved by known exact algorithms. The comparison highlights that in more than half of the tested benchmarks the gap obtained by our algorithm was lower than that obtained by a recent branch and cut method and by the well-known DSATUR algorithm. To provide a deeper analysis we finally compare the upper bounds found by the proposed algorithm on the same benchmarks with the best heuristic solutions known in the open literature. Also, in this case, the proposed truncated branch and bound was often able to outperform these heuristic solutions. (C) 2004 Wiley Periodicals, Inc.

关键词： branch and bound algorithm chromatic number combinatorial optimization heuristic lower bound

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm based process-planning system for plastic injection mould bases

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2001年第9期18卷 624-632页

作者： Gan, PY Lee, KS Zhang, YF Natl Univ Singapore Dept Mech Engn Singapore 117548 Singapore

This paper describes the use of artificial intelligence in the process planning of plastic injection mould bases. The computer-aided process-planning system, developed for IMOLD(R) will extract and identify the operations required for machining. These operations are considered together with their precedence constraints and the available machines before the process plan for the mould base plate is generated. The process plan is optimised by a branch and bound based algorithm. Overall machining time has been proposed as the objective function for optimisation. The ability of this algorithm to search intelligently for a feasible optimised solution is illustrated by an industrial case study. A brief comparison with a genetic algorithm based process planning system is also made. The result of this development will allow users to optimise process plans easily for any given mould base, with options to suit dynamic changes on the manufacturing shop floor.

关键词： branch and bound algorithm computer-aided process-planning (CAPP) optimisation plastic injection mould base

来源：评论

学校读者我要写书评

暂无评论

A BMI-Based Design of Switched PID Controllers

引用

IFAC Proceedings Volumes 2004年第1期37卷 881-886页

作者： Jun Aoyama Katsumi Konishi Toru Yamamoto Takao Hinamoto Department of Artificial Complex Systems Control Graduate School of Engineering Hiroshima University 1-4-1 Kagamiyama Higashi-hiroshima Hiroshima 739-8527 Japan Information Media Center Hiroshima University. 1-4-2 Kagamiyama Higashi-hiroshima Hiroshima 739-8511 Japan Department of Technology and Information Education Graduate School of Education Hiroshima University 1-1-1 Kagumiyama Higashi-hiroshima Hiroshima 739-8524 Japan

This paper provides a design method for two-degrees-of-freedom PID controllers including switched PD compensator based on bilinear matrix inequalities (BMIs). Two design specifications based on H 2 norm are formulated in BMIs, and PID parameters can be exactly obtained by solving the BMI problems via branch and bound algorithms. A set of PD compensators can be obtained simultaneously by using proposed design method. The most effective parameter is selected out of the set of PD compensator based on the switching criterion which obtained from estimated system conditions using recursive least square algorithms. Numerical example is also shown.

关键词： PID controllers bilinear matrix inequalities H 2 norm process control branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Portfolio optimization of small scale fund using mean-absolute deviation model

引用

International Journal of Theoretical and Applied Finance 2003年第4期6卷 403-418页

作者： Konno, Hiroshi Department of Industrial Engineering Chuo University Bunkyo-ku Tokyo 112 1-13-27 Kasuga Japan

The purpose of this paper is to show that we are now able to apply standard portfolio optimization methods to the management of small and medium scale fund, where transaction cost and minimal transaction unit constraints are not negligible. Unit transaction cost is usually larger when the amount of investment is smaller. Also, rounding of portfolio to the nearest integer multiple of minimal transaction unit will have non negligible effect on the risk-return structure of the portfolio. We will show that the use of mean-absolute deviation model enables one to handle concave transaction cost and minimal transaction unit constraints in an efficient manner using branch and bound algorithm. Also, we will show that the minimal transaction cost rebalancing problem can be solved by using the same algorithm.

关键词： branch and bound algorithm Concave transaction cost Mean-absolute deviation model Minimal transaction unit constraint Small fund

来源：评论

学校读者我要写书评

暂无评论

Desensitized jerk limited-time optimal control of multi-input systems

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2002年第3期25卷 474-481页

作者： Muenchhof, M Singh, T SUNY Buffalo Dept Mech & Aerosp Engn Buffalo NY 14260 USA

The problem of designing jerk limited-time optimal control profiles for rest-to-rest maneuvers of flexible structures with multiple actuators is addressed. The problem formulation includes constraints to cancel the poles corresponding to the rigid-body mode and flexible modes of the system and to satisfy the boundary conditions of the rest-to-rest maneuver. Further constraints can be added to increase robustness to parametric uncertainties of the plant. The technique proposed is applied to a three-mass/two-spring system and the evolution or the shape of the control profile as a function of jerk is illustrated.

关键词： Pontryagin's Maximum Principle Multi Input System Actuators branch and bound algorithm Second Order Differential Equations Stiffness Matrices Large Space Structures Transient Response Vibration Control Total Energy

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for locating input and output points of departments on the block layout

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 1999年第5期50卷 517-525页

作者： Kim, JG Kim, YD Korea Adv Inst Sci & Technol Dept Ind Engn Yusong Gu Taejon 305701 South Korea

We consider the problem of locating input and output (I/O) points of each department for a given layout. The objective of the problem is to minimise the total distance of material flows between the I/O points. Here, distances between the I/O points are computed as the lengths of the shortest path (not the rectilinear distances) between the I/O points. We developed a procedure to eliminate dominated candidate positions of I/O points that do not need to be considered. With this procedure, a large number of dominated candidate positions can be eliminated. A linear programming (LP) model for minimising the total rectilinear distance of flows is used to obtain a lower bound. Using the elimination procedure and the LP model, a branch and bound algorithm is developed to find an optimal location of the I/O points. Results from computational experiments show that the suggested algorithm finds optimal solutions in a very short time even for large-sized problems.

关键词： facility layout input and output points branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Spacecraft trajectory planning with avoidance constraints using mixed-integer linear programming

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2002年第4期25卷 755-764页

作者： Richards, A Schouwenaars, T How, JP Feron, E MIT Space Syst Lab Cambridge MA 02139 USA MIT Informat & Decis Syst Lab Cambridge MA 02139 USA

A method tar finding fuel-optimal trajectories for spacecraft subjected to avoidance requirements is introduced. These include avoidance of collisions with obstacles or other vehicles and prevention of thruster plumes from one spacecraft impinging on another spacecraft. The necessary logical constraints for avoidance are appended to a fuel-optimizing linear program by including binary variables in the optimization. The resulting problem is a mixed-integer linear program (MILP) that can be solved using available software. The logical constraints can also be used to express the configuration requirements for maneuvers where only the final relative alignment of the vehicles is important and the assignment of spacecraft within the fleet is not specified. The collision avoidance, trajectory optimization, and fleet assignment problems can be combined into a single MILE to obtain the optimal solution for these maneuvers. The MILE problem formulation, including these various avoidance constraints, is presented, and then several examples of their application to spacecraft maneuvers, including reconfiguration of a satellite formation and close inspection of the International Space Station by a microsatellite, are shown. These examples clearly show that the trajectory design methods presented are particularly well suited to proposed formation flying missions that involve multiple vehicles operating in close proximity.

关键词： Mixed Integer Linear Programming Monolithic Satellite ISS Trajectory Optimization Linear Programming Spacecraft Trajectories Spacecraft Maneuvers Thruster Plumes Path Planning branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An algorithm for the capacitated, multi-commodity multi-period facility location problem

引用

COMPUTERS & OPERATIONS RESEARCH 2001年第5期28卷 411-427页

作者： Canel, C Khumawala, BM Law, J Loh, A Univ N Carolina Dept Prod & Decis Sci Wilmington NC 28403 USA Univ Houston Dept Informat & Decis Sci Houston TX 77204 USA Chinese Univ Hong Kong Dept Decis Sci & Managerial Econ Shatin Hong Kong Peoples R China Univ Houston Dept Ind Engn Houston TX 77204 USA

There are substantial number of exact and heuristic solution methods proposed for solving the facilities location problems. This paper develops an algorithm to solve the capacitated, multi-commodity, multiperiod (dynamic), multi-stage facility location problem. The literature on such composite facility location problem is still sparse, The proposed algorithm consists of two parts: in the first part branch and bound is used to generate a list of candidate solutions for each period and then dynamic programming is used to find the optimal sequence of configurations over the multi-period planning horizon. bounds commonly known in the location literature as delta and omega are used extensively to effectively reduce the total number of transshipment subproblems needed to be solved. The proposed algorithm is particularly effective when the facility reopening and closing costs are relatively significant in the multi-period problem. An example problem is included to illustrate the proposed solution procedure.

关键词： facility location branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Worst-case analysis of the X-38 crew return vehicle flight control system

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2001年第2期24卷 261-269页

作者： Shin, JY Balas, GJ Packard, AK Univ Minnesota Dept Aerosp Engn & Mech Minneapolis MN 55455 USA Univ Calif Berkeley Dept Mech Engn Berkeley CA 94704 USA

A linear fractional transformation (LFT model of the linearized equation of the lateral-directional axes of the X-38 crew return vehicle is developed to facilitate the analysis of flight control systems. The LFT model represents uncertainty in nine aerodynamic stability derivatives at a given flight condition with frequency-domain performance specifications. The X-38 LFT model combined with a controller at specific Right conditions is used to determine the aerodynamic coefficients that result in the worst-case performance and gain/phase margin of the closed-loop system. The,objective is to verify that a given controller remains stable and achieves desired performance objectives for all predefined aerodynamic variations at select operating conditions along its flight trajectory.

关键词： Crew Return Vehicle Flight Control System Aerodynamic Stability Closed Loop System Digital to Analog Converters Control Systems Ailerons International Space Station branch and bound algorithm Johnson Space Center

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：