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

3rd International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CrownCom 2008)

作者： Nicolas Colson Apostolos Kountouris Armelle Wautier Lionel Husson Orange Laboratories France Telecom Research and Development Center Meylan France Department of Telecommunications SUPELEC Gif-sur-Yvette France

ISBN: (纸本)9781424423019

Cognitive radio is a technological concept pushing for the introduction of intelligent radio operation going beyond system adaptation and reconfiguration on the basis of simple criteria and rules. Insofar, a rather limited amount of work has been published on the cognitive mechanisms that should be embedded into the communicating equipments to achieve such an intelligent behavior. Towards filling this gap, this paper presents an innovative optimization algorithm driving the decision making process supervising the cognitive radio reconfiguration. This cognitive algorithm, called RALFE for "Reason And Learn From Experience", presents interesting features since it allows to perform autonomous decision making with regard to multiple, possibly conflicting, operational objectives in the face of an uncertain environment. The proposed approach is illustrated for a case of cognitive waveform design.

关键词： decision making process Reconfiguration Cognitive radio dynamic reconfiguration Radio RADIO OPERATION optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

optimization of robust asynchronous circuits by local input completeness relaxation 07

Optimization of robust asynchronous circuits by local input ...

引用

12th Asia and South Pacific Design Automation Conference

作者： Jeong, Cheoljoo Nowick, Steven M. Columbia Univ Dept Comp Sci New York NY 10027 USA

ISBN: (纸本)9781424406296

As process, temperature and voltage variations become significant in deep submicron design, timing closure becomes a critical challenge using synchronous CAD flows. One attractive alternative is to use robust asynchronous circuits which gracefully accommodate timing discrepancies. However, these asynchronous circuits typically suffer from high area and latency overhead. In this paper, an optimization algorithm is presented which reduces the area and delay of these circuits by relaxing their overly-restrictive style. The algorithm was implemented and experiments performed on a subset of MCNC circuits. On average, 49.2% of the gates could be implemented in a relaxed manner, 34.9% area improvement was achieved, and 16.1% delay improvement was achieved using a simple heuristic for targeting the critical path in the circuit. This is the first proposed approach that systematically optimizes asynchronous circuits based on the notion of local relaxation while still preserving the circuit's overall timing-robustness.

关键词： asynchronous circuits Electric circuits delay circuits gates optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Virtual reality high dimensional objective spaces for multi-objective optimization:: An improved representation

Virtual reality high dimensional objective spaces for multi-...

引用

IEEE Congress on Evolutionary Computation

作者： Valdes, Julio J. Barton, Alan J. Orchard, Robert Natl Res Council Canada Inst Informat Technol Integrated Reasoning Grp Ottawa ON K1A 0R6 Canada

ISBN: (纸本)9781424413393

This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of multi-objective optimization problems with more than objective functions which lead to high dimensional Pareto fronts. The 3-D representations of m-dimensional Pareto fronts, or their approximations, are constructed via similarity structure mappings between the original objective spaces and the 3-D space. Alpha shapes are introduced for the representation and compared with previous approaches based on convex hulls. In addition, the mappings minimizing a measure of the amount of dissimilarity loss are obtained via genetic programming. This approach is preliminarily investigated using both theoretically derived high dimensional Pareto fronts for a test problem (DTLZ2) and practically obtained objective spaces for the 4 dimensional knapsack problem via multi-objective evolutionary algorithms like HLGA, NSGA, and VEGA. The improved representation captures more accurately the real nature of the m-dimensional objective spaces and the quality of the mappings obtained with genetic programming is equivalent to those computed with classical optimization algorithms.

关键词： optimization algorithms DIMENSIONAL Genetic Algorithm (GA) knapsack problems virtual reality

来源：评论

学校读者我要写书评

暂无评论

Multi-objective optimization based on self-adaptive differential evolution algorithm

Multi-objective optimization based on self-adaptive differen...

引用

IEEE Congress on Evolutionary Computation

作者： Huang, V. L. Qin, A. K. Suganthan, P. N. Tasgetiren, M. F. Nanyang Technol Univ Sch Elect & Elect Engn 50 Nanyang Ave Singapore 639798 Singapore Fatih Univ Dept Management TR-34500 Istanbul Turkey

ISBN: (纸本)9781424413393

In this paper, our recently developed Self-adaptive Differential Evolution algorithm (SaDE) is extended to solve numerical optimization problems with multiple conflicting objectives. The performance of the proposed MOSaDE algorithm is evaluated on a suit of 19 benchmark problems provided for the CEC2007 special session (http://***/home/epnsugan/)on Performance Assessment of Multi-Objective optimization algorithms.

关键词： differential evolution algorithms self-adaptive optimization algorithms Benchmark testing evolutionary algorithm Performance assessment

来源：评论

学校读者我要写书评

暂无评论

Adaptive optimization of time-out policy for dynamic power management based on SMCP

Adaptive optimization of time-out policy for dynamic power m...

引用

IEEE Conference on Control Applications

作者： Jiang, Qi Xi, Hong-Sheng Yin, Bao-Qun Univ Sci & Technol China Dept Automat Hefei 230027 Peoples R China

ISBN: (纸本)9781424404421

Based on reinforcement learning, an adaptive online optimization algorithm of time-out policy is presented for dynamic power management. First the time-out policy driven power-managed systems are formulated as semi-Markov control processes. Under this analytic model, the equivalent effect on performance-power trade-off of time-out and stochastic policies is probed, and the equivalent relation between these two types policies is derived. Then an adaptive optimization algorithm that combines gradient estimation online and stochastic approximation is proposed. This algorithm doesn't depend on the prior knowledge of system parameters, and can achieve a global optimum with less computational cost. Simulation results demonstrate the analytic results and the effectiveness of the proposed algorithm.

关键词： adaptive optimization system parameter Policies optimization algorithms Control procedures stochastic approximation global optimum Time out managed system power markets

来源：评论

学校读者我要写书评

暂无评论

Modified value iteration for chemotherapy scheduling optimization

Modified value iteration for chemotherapy scheduling optimiz...

引用

IEEE International Conference on Industrial Engineering and Engineering Management

作者： Liu, Y. Jiang, H. Su, Z. George Mason Univ Dept Syst Engn & Operat Res Fairfax VA 22030 USA Stanford Univ Inst Computat & Math Engn Stanford CA USA SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY USA

ISBN: (纸本)9781424415281

An optimization algorithm for chemotherapy scheduling study is developed in this paper. We consider the density of host and cancer cells of a patient as states, and define the optimal chemotherapy scheduling as the shortest treatment path that will cure the patient, if possible. Given the fact that the treatment time is always interger-valued in our model, we used a modified version of the value iteration algorithm originally designed for Markov Decision Process. Simulation results and discussions are also given.

关键词： optimization algorithms corrective value Iterative algorithms Antineoplastic Agents Drug Therapy Time-to-Treatment Patients iterative methods cancer cell hosts

来源：评论

学校读者我要写书评

暂无评论

Using SAT-based techniques in power estimation

引用

MICROELECTRONICS JOURNAL 2007年第6-7期38卷 706-715页

作者： Sagahyroon, Assim Aloul, Fadi A. American Univ Sharjah Dept Comp Engn Sharjah U Arab Emirates

Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wide range of applications domains, and particularly in electronic design automation (EDA). SAT is increasingly being used as the underlying model for a number of applications in EDA. This paper describes how to formulate two problems in power estimation of CMOS combinational circuits as SAT problems or 0-1 integer linear programming (ILP). In these circuits, it was proven that maximizing dissipation is equivalent to maximizing gate output activity, appropriately weighted to account for differing load capacitances. The first problem in this work deals with identifying an input vector pair that maximizes the weighted circuit activity. In the second application we attempt to find an estimate for the maximum power-up current in circuits where power cut-off or gating techniques are used to reduce leakage current. Both problems were successfully formulated as SAT problems. SAT-Based and generic Integer Linear Programming (ILP) solvers are then used to find a solution. The experimental results obtained on a large number of benchmark circuits provide promising evidence that the proposed complete approach is both viable and useful and outperforms the random approach. (C) 2007 Elsevier Ltd. All rights reserved.

关键词： CMOS circuits power estimation optimization algorithms integer linear programming boolean satisfiability

来源：评论

学校读者我要写书评

暂无评论

Structured transfer function matrices and integer matrices: the computation of the generic McMillan degree and infinite zero structure

引用

INTERNATIONAL JOURNAL OF CONTROL 2007年第9期80卷 1404-1420页

作者： Karcanias, N. Sagianos, E. Milonidis, E. City Univ London Sch Engn & Math Sci Ctr Control Engn London EC1V 0HB England

The computation of the McMillan degree and structure at infinity of a transfer function model is considered for the family of early design models, referred to as Structured Transfer Function (STF) matrices. Such transfer functions have certain elements fixed to zero, some elements being constant and other elements expressing some identified dominant dynamics of the system. For the family of large dimension STF matrices the computation of the generic McMillan degree and structure at infinity are considered using genericity arguments which lead to optimization problems of integer matrices. A novel approach is introduced here that uses the notion of "irreducibility" of integer matrices, which is developed as the equivalent of irreducibility (properness) of polynomial matrices. This new notion provides the means for exploiting the structure of integer matrices and enables the termination of searching processes in a reduced number of steps, thus leading to an efficient new algorithm for the computation of the generic value of the McMillan degree and the structure at infinity of STFs. Links are made to standard optimization problems and to graph theory. The formulation of the optimization algorithm in terms of bipartite graphs offers better results and reduces the computational effort.

关键词： TRANSFER FUNCTIONS Integer Infinity STF transfer function matrices optimization algorithms Infinite

来源：评论

学校读者我要写书评

暂无评论

Hierarchical approach for H_∞ robust control design:: S/KS mixed sensitivity with genetic algorithm

引用

IET CONTROL THEORY AND APPLICATIONS 2007年第1期1卷 18-24页

作者： Miranda, M. F. Takahashi, R. H. C. Jota, F. G. Univ Fed Minas Gerais Colegio Tecn BR-30123970 Belo Horizonte MG Brazil Univ Fed Minas Gerais Dept Matemat BR-30123970 Belo Horizonte MG Brazil Univ Fed Minas Gerais Dept Engn Eletron BR-30123970 Belo Horizonte MG Brazil

The issue of introducing generic design constraints (practical or 'real-life' constraints) in robust control design procedures is discussed. A strategy, based on a hierarchy of optimisation methods, is proposed here. An H-infinity design algorithm constitutes the bottom level of this hierarchy, and a general-purpose optimisation algorithm (a genetic algorithm) is employed for tuning the parameters of the H-infinity controller, searching for the solutions that satisfy the earlier mentioned 'practical constraints'. Practical results obtained in a pilot-scale plant with fluid-level and flow-rate control as controlled variables are included to show the applicability of the proposed method.

关键词： PILOT SCALE Design Algorithm design process optimization methods Hierarchical Social Hierarchy Robust control optimization algorithms design constraints Genetic Algorithm (GA)

来源：评论

学校读者我要写书评

暂无评论

An application of a gradient theory with dissipative boundary conditions to fully developed turbulent flows

引用

JOURNAL OF FLUIDS ENGINEERING-TRANSACTIONS OF THE ASME 2007年第5期129卷 643-651页

作者： Silber, Gerhard Janoske, Uwe Alizadeh, Mansour Benderoth, Guenther Univ Appl Sci Inst Mat Sci Frankfurt Germany Univ Appl Sci CBME Frankfurt Germany Univ Cooperat Educ Mosbach Germany Univ Sci & Technol Tehran Iran

The paper presents a complete gradient theory of grade two, including new dissipative boundary conditions based on an axiomatic conception of a nonlocal continuum theory for materials of grade n. The total stress tensor of rank two in the equation of linear momentum contains two higher stress tensors of rank two and three. In the case of isotropic materials, both the tensors of rank two and three are tensor valued functions of the second order strain rate tensor and its first gradient. So the vector valued differential equation of motion is of order four, where the necessary, dissipative boundary conditions are generated by using porosity, tensors. An application to hydrodynamic turbulence by a linear theory is shown, whereby fully developed steady, turbulent channel flows with fixed walls and one moving wall are also examined. The velocity distribution parameters are identified by a numerical optimization algorithm, using experimental data of velocity profiles of channel flow with fixed walls from the literature. These profiles were compared with others given in the literature. With these derived parameters, the predicted velocity gradient of a channel flow agrees well with data from the literature. In addition all simulations were successfully carried out using the finite difference method.

关键词： Turbulent Flow stress tensor CONTINUUM THEORY Boundary conditions Equations of motion channel flow Velocity gradient wall linear momentum VELOCITY PROFILING Tensor isotropic materials optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：