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

IEEE International Symposium on Quality Electronic design

作者： Zhenyu Qi Hang Li S.X.-D. Tan Lifeng Wu Yici Cai Xianlong Hong Department of Electrical Engineering University of California Riverside CA USA Cadence Design Systems Inc. San Jose CA USA Department of Computer Science and Technology Tsinghua University Beijing China

Adding on-chip decoupling capacitors (decaps) is an effective way to reduce voltage noise in power/ground networks and ensure robust power delivery. We present a fast decap allocation algorithm, which is able to confine voltage fluctuations below a user specified threshold by adding decaps in an area efficient way. The new algorithm adopts the recently proposed time-domain adjoint network method for sensitivity calculation. To avoid the time consuming line search at each iteration in the conjugate gradient method, we propose a simple, yet efficient, search step computation method to accelerate the optimization process. The experimental results show that the proposed algorithm is at least 10 times faster than the fastest conjugate gradient method reported so far with similar optimization results.

关键词： Noise robustness Gradient methods Optimization methods Network-on-a-chip Capacitors Noise reduction Voltage fluctuations Threshold voltage Time domain analysis Acceleration

来源：评论

学校读者我要写书评

暂无评论

Robust adaptive control of quasi-LPV systems

Robust adaptive control of quasi-LPV systems

引用

IEEE/ASME (AIM) International Conference on Advanced Intelligent Mechatronics

作者： Xiukun Wei L. Del Re Jindong Tan Faculty of the institute of Design and Control of Machatronical Systems Johannes Kepler University Linz Austria Johannes Kepler Universitat Linz Linz AT Faculty of Department of Electrical and Computer Engineering Michigan Technological University USA

In this paper a robust adaptive pole placement method for a class of linear parameter varying (LPV) system based on input-output description is constructed after the LPV system model, including its un-modeled error model term, is presented. The recursive least square estimation algorithm with dead zone is applied for the parameter estimation. The robust stability of closed-loop system is analyzed and the robust bound is derived. One simulation example illustrates the effectiveness of the control algorithm and demonstrates that the adaptive control based on LPV model can achieve better performance than the controller based on linear time varying (LTV) model

关键词： Robust control Adaptive control Least squares approximation Robustness Parameter estimation Nonlinear systems Control systems Programmable control State feedback Robust stability

来源：评论

学校读者我要写书评

暂无评论

Generation expansion under risk using stochastic programming

Generation expansion under risk using stochastic programming

引用

Annual North-American Power Symposium

作者： J. Alvarez K. Ponnambalam V.H. Quintana Dept. of Electr. & Comput. Eng. Waterloo Univ. Ont. Canada Department of Systems Design Engineering University of Waterloo Waterloo Ontario Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo Ontario Canada

In this work, the problem of power plant expansion for electricity generation under risk from demand uncertainty and supply is addressed. We begin with a deterministic model. Then, this model is expanded to a stochastic model by means of considering the various demands for different operation modes as random. After this model is analyzed, a way of quantifying risk using the value at risk methodology (VaR) is proposed. The last model presented is such that randomness in the availability factors is considered. The concepts of expected value of perfect information (EVPI) and value of stochastic solution (VSS) are also studied. The models presented are based on an extended form of the well known stochastic programming and chance constrained programming.

关键词： Stochastic processes Power system modeling Power generation Uncertainty Reactive power Variable structure systems Random variables Risk analysis Investments Cost function

来源：评论

学校读者我要写书评

暂无评论

Magnetic Resonance Based Ventricle System Classification by Multi-Species Genetic Algorithm

Magnetic Resonance Based Ventricle System Classification by ...

引用

International IEEE/EMBS Conference on Neural engineering, CNE

作者： J. Levman J. Alirezaie Gul Khan Department of Electrical and Computer Engineering Ryerson University Toronto ONT Canada Sunnybrook and Women's College Health Sciences Centre Department of Medical Biophysics University of Toronto Toronto ONT Canada Department of Systems Design Engineering University of Waterloo Waterloo ONT Canada

Early detection of medical abnormalities is an essential component in the accurate diagnosis and treatment of disease and disability. Automatically isolating the structure of the brain's ventricle system has the potential to assist neurologists in identifying abnormalities such as tumors, hydrocephalus and damage due to stroke. In this paper we present a multi-species genetic algorithm for isolating the ventricle system from multiple layers of brain images produced by magnetic resonance imaging (MRI) technology. Significant research has been performed on automatic classification of brain components from MRI images. To the best of our knowledge, this is the first approach to utilize multi-species genetic algorithms as a means of classifying brain components from MRI scans whereby the genomes control vertical and horizontal edge detection and locality based information suppression. This method requires a simple set of input data to be used for training the genetic algorithm. The results illustrate an effective method for isolating a patient's ventricle system

关键词： Magnetic resonance Genetic algorithms Magnetic resonance imaging Biomedical imaging Medical diagnostic imaging Medical treatment Diseases Neoplasms Brain Isolation technology

来源：评论

学校读者我要写书评

暂无评论

Dynamic abstraction using SAT-based BMC

Dynamic abstraction using SAT-based BMC

引用

design Automation Conference

作者： Liang Zhang M.R. Prasad M.S. Hsiao T. Sidle Cadence Design Systems San Jose CA USA Fujitsu Laboratories of America Advanced CAD Technology Sunnyvale CA USA Department of Electrical & Computer Engineering Virginia Polytechnic Institute and State University Blacksburg VA USA

ISBN: (纸本)1595930582

We propose a new dynamic method of abstraction, which can be applied during successive steps of the model checking algorithm to further reduce the model produced by traditional static abstraction methods. This is facilitated by information gathered from an analysis of the proof of unsatisfiability of SAT-based bounded model checking problems formulated on the original design. The dynamic abstraction effectively allows the model checker to work with smaller abstract models. Experiments on several industrial benchmarks demonstrate that dynamic abstraction can significantly improve both the performance and the capacity of typical abstraction refinement flows.

关键词： Refining Information analysis Permission Latches Algorithm design and analysis design automation Laboratories design engineering Explosions Circuits

来源：评论

学校读者我要写书评

暂无评论

PHD filter multi-target tracking in 3D sonar

PHD filter multi-target tracking in 3D sonar

引用

OCEANS - Europe

作者： D.E. Clark J. Bell Y. de Saint-Pern Y. Petillot Ocean Systems Lab Electrical and Computer Engineering Heriot-Watt University Edinburgh UK Key Laboratory of Education Ministry for Modern Design and Rotor-Bearing System Xi'an Jiaotong University Xi'an PR China Shenji Kunming Machine Tool Company Limited

The Probability Hypothesis Density (PHD) Filter was developed as a method for tracking a time varying number of targets without data association. The first order statistical moment of the multiple target posterior distribution called the Probability Hypothesis Density which is represented by discrete samples or particles gives the expected locations of the targets. This property is used instead of the full multi-target posterior distribution as it is rcquires significantly less computation and particle tilter implementations have demonstrated lhe potential of the algorithm to be used for real-time tracking applications. In this article, an application of the Particle PHD Filler is demonstrated to track a variable number of objects in threedimensiond sonar images estimating both the number of targets and their locations. The number of targets is estimated at each iteration by computing the mass of lhe particle weights. The locations of the targets are determined by extracting peaks of the PHD which is a distinct task from the computation of the particles. Previous approaches have used the Expectation Maximisation (EM) algorithm to fit a Gaussian mixture model whose time complexity is quadratic in the number of targets which is not ideal for a real-time tracking appiication and so alternative clustering techniques are considered here. A comparison is made between the methods for the accuracy of estimation, robustness and the time taken.

关键词： Filters Target tracking Sonar navigation Probability Particle tracking Underwater tracking Robustness Underwater vehicles Acoustic sensors Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Transport of Mars-Crossing Asteroids from the Quasi-Hilda Region

引用

Physical Review Letters 2005年第23期94卷 231102-231102页

作者： Michael Dellnitz Oliver Junge Martin W. Lo Jerrold E. Marsden Kathrin Padberg Robert Preis Shane D. Ross Bianca Thiere Faculty of Computer Science Electrical Engineering and Mathematics University of Paderborn D-33095 Paderborn Germany Navigation and Mission Design Jet Propulsion Laboratory California Institute of Technology M/S 301-140L 4800 Oak Grove Drive Pasadena California 91109 USA Control and Dynamical Systems California Institute of Technology MC 107-81 Pasadena California 91125 USA Department of Aerospace and Mechanical Engineering University of Southern California Los Angeles California 90089 USA

We employ set oriented methods in combination with graph partitioning algorithms to identify key dynamical regions in the Sun-Jupiter-particle three-body system. Transport rates from a region near the 3∶2 Hilda resonance into the realm of orbits crossing Mars’ orbit are computed. In contrast to common numerical approaches, our technique does not depend on single long term simulations of the underlying model. Thus, our statistical results are particularly reliable since they are not affected by a dynamical behavior which is almost nonergodic (i.e., dominated by strongly almost invariant sets).

关键词： .graph orbits partitioning week ending Asteroids Preis Mars-Crossing Quasi-Hilda

来源：评论

学校读者我要写书评

暂无评论

Recursive backstepping stabilization of a wheeled mobile robot

引用

International Journal of Advanced Robotic systems 2004年第1期1卷 287-294页

作者： Mnif, Faical Sultan Qaboos University Department of Electrical and Computer Engineering Oman Intelligent Control Design and Optimization of Complex Systems Research Unit Tunisia

This research is aimed to the development of a dynamic control to enhance the performance of the existing dynamic controllers for mobile robots. System dynamics of the car-like robot with nonholonomic constraints were employed. A Backstepping approach for the design of discontinuous state feedback controller is used for the design of the controller. It is shown that the origin of the closed loop system can be made stable in the sense of Lyapunov. The control design is made on the basis of a suitable Lyapunov function candidate. The effectiveness of the proposed approach is tested through simulation on a car-like vehicle mobile robot.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Optimized space frequency kernel for texture classification

Optimized space frequency kernel for texture classification

引用

2004 International Conference on Image Processing, ICIP 2004

作者： Sabri, Mahdi Alirezaie, Javad Department of Electrical and Computer Engineering Ryerson University Toronto Ont. Canada Department of Systems Design Engineering University of Waterloo Waterloo Canada

ISBN: (纸本)0780385543

The performance of the Support Vector Machine(SVM) algorithm is highly dependent on the choice of the kernel function suited to the problem at hand. In a Support Vector Machine algorithm feature selection is implicitly performed by kernel function. On the other hand, feature selection is the most important stage in any texture classification algorithm. In this work, the performance of SVM is improved by choosing an optimized space-frequency (SFR) kernel function. The proposed method is evaluated in a two-texture and multi-texture problems. The results are compared with the original SVM and other recently published texture classification methods. The comparison shows a significant improvement in error rates. Improvement of more than 40% in compare with original SVM and about 60% in compare with logical operators (LO) and wavelet co-occurrence features (WCOF) are obtained. © 2004 IEEE.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

Implementing Branch-Predictor Decay Using Quasi-Static Memory Cells

引用

ACM Transactions on Architecture and Code Optimization 2004年第2期1卷 180-219页

作者： Juang, Philo Martonosi, Margaret Clark, Douglas W. Skadron, Kevin Hu, Zhigang Diodato, Philip W. Kaxiras, Stefanos Departments of Electrical Engineering and Computer Science Princeton University Princeton NJ 08544 United States Department of Computer Science University of Virginia United States IBM T.J. Watson Research Center United States Agere Systems United States University of Patras Greece

With semiconductor technology advancing toward deep submicron, leakage energy is of increasing concern, especially for large on-chip array structures such as caches and branch predictors. Recent work has suggested that larger, aggressive branch predictors can and should be used in order to improve microprocessor performance. A further consideration is that more aggressive branch predictors, especially multiported predictors for multiple branch prediction, may be thermal hot spots, thus further increasing leakage. Moreover, as the branch predictor holds state that is transient and predictive, elements can be discarded without adverse effect. For these reasons, it is natural to consider applying decay techniques—already shown to reduce leakage energy for caches—to branch-prediction structures. Due to the structural difference between caches and branch predictors, applying decay techniques to branch predictors is not straightforward. This paper explores the strategies for exploiting spatial and temporal locality to make decay effective for bimodal, gshare, and hybrid predictors, as well as the branch target buffer (BTB). Furthermore, the predictive behavior of branch predictors steers them towards decay based not on state-preserving, static storage cells, but rather quasi-static, dynamic storage cells. This paper will examine the results of implementing. © 2004, ACM. All rights reserved.

关键词： design Energy aware computing Performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：