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

IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)

作者： Yamamura, Kiyotaka Taki, Hiroshi Chuo Univ Fac Sci & Engn Tokyo 1128551 Japan

ISBN: (纸本)9781479952304

An efficient and practical method is proposed for finding all characteristic curves of piecewise-linear resistive circuits using integer programming. In this method, the problem of finding all characteristic curves is formulated as a mixed integer programming problem, and it is solved by a high-performance integer programming solver such as CPLEX. It is shown that the proposed method can easily be implemented without making complicated programs, and all characteristic curves are obtained by solving mixed integer programming problems only twice. It is also shown that the proposed method can be extended to the tolerance analysis of nonlinear resistive circuits.

关键词： integer programming nonlinear network analysis piecewise linear techniques tolerance analysis CPLEX mixed integer programming problem nonlinear resistive circuits piecewise-linear resistive circuits Equations Linear programming Resistors Software Tolerance analysis Transistors Vectors

来源：评论

学校读者我要写书评

暂无评论

An Effective Reduction of Subproblems in Design of CSD Coefficient FIR Filters

An Effective Reduction of Subproblems in Design of CSD Coeff...

引用

Annual Summit and Conference of Asia-Pacific-Signal-and-Information-Processing-Association (APSIPA)

作者： Imaizumi, Takuya Suyama, Kenji Tokyo Denki Univ Sch Engn Adachi Ku 5 Senju Asahi Cho Tokyo 1208551 Japan

ISBN: (纸本)9786163618238

In this paper, an effective reduction method of the number of subproblems for the design of CSD (Canonic Signed Digit) coefficient FIR (Finite Impulse Response) filters using BB (Branch and Bound method) is studied. The problem can be formulated as a mixed integer programming problem. The problem can be optimally solved by using the BB. For solving the problem, it is required to solve a large number of subproblems, and it causes a high computational time. Recently, a novel method for the reduction of the number of subproblems has been proposed. In the method, the subproblems can be reduced by starting from an initial branch tree constructed by an approximate solution obtained by any heuristic method. However, the reduction of subproblems depends on the heuristic method applied. In this paper, the effective methods for the reduction of subproblems are studied. Several examples are shown to present the efficiency of the studied methods.

关键词： FIR filters integer programming tree searching BB method CSD coefficient branch and bound method branch tree canonic signed digit coefficient finite impulse response filters heuristic method mixed integer programming problem reduction method Approximation methods Educational institutions Finite impulse response filters Genetic algorithms Hardware Linear programming Resource management

来源：评论

学校读者我要写书评

暂无评论

Cloud Aided Safety-based Route Planning

Cloud Aided Safety-based Route Planning

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Zhaojian Li Ilya Kolmanovsky Ella Atkins Jianbo Lu Dimitar Filev John Michelini Department of Aerospace Engineering The University of Michigan Research & Advanced Engineering Ford Motor Company

ISBN: (纸本)9781479938414

This paper proposes a novel multi-objective route planning approach within the framework of a Vehicle-to-Cloud-to-Vehicle (V2C2V) architecture. Time and road risk index (RRI) are both considered as metrics. To evaluate road segment risk, an accident database from the Highway Safety Information System (HSIS) is processed to build a comprehensive road risk assessment model. Route planning is formulated as a multi-objective network flow problem and further reduced to a mixed integer programming (MIP) problem. A real-world case study, route planning through the city of Columbus, Ohio, is presented. The Vehicle-to-Cloud-to-Vehicle (V2C2V) based implementation of our safety-based route planning approach is proposed to facilitate access to real-time information and computing resources.

关键词： cloud computing integer programming path planning risk management road safety traffic information systems Columbus HSIS MIP problem Ohio RRI accident database cloud aided safety-based route planning highway safety information system mixed integer programming problem multiobjective route planning approach road risk assessment model road risk index road segment risk vehicle-to-cloud-to-vehicle architecture Accidents Indexes Neural networks Planning Rail to rail inputs Roads Vehicles

来源：评论

学校读者我要写书评

暂无评论

Robust Resource Allocation for Bidirectional Decode-and-Forward OFDM Relaying Systems with Network Coding and Imperfect CSI

Robust Resource Allocation for Bidirectional Decode-and-Forw...

引用

IEEE Vehicular Technology Conference

作者： Xiaolin Ma Fangmin Li Jacek Ilow Zhizhang Chen School of Information Engineering Wuhan University of Technology Department of Electrical and Computer Engineering Dalhousie University

ISBN: (纸本)9781479944811

In this paper, we investigate the joint optimization of power allocation and subcarrier assignment in the OFDM bidirectional systems where two users exchange data assisted by multiple decode-and-forward (DF) relays. We assume the availability of imperfect channel state information (CSI) that contains a probabilistic uncertainty component and consider its worst effect when performing resource allocation. Moreover, we adopt dynamic network coding to exploit channel diversity. The objective of the resource allocation problem is to maximize the weighted sum rates of the two users subject to quality-of-service (QoS) requirements and individual power constraints. We formulate the problem as a mixed integer programming problem and solve it efficiently in an asymptotic manner by using the dual method. Simulation results show that the proposed scheme is robust to imperfect CSI and provides better performance compared to the scheme with static network coding.

关键词： OFDM modulation decode and forward communication integer programming probability quality of service relay networks (telecommunication) resource allocation CSI QoS bidirectional decode-and-forward OFDM relaying systems channel diversity channel state information mixed integer programming problem network coding power allocation probabilistic uncertainty quality-of-service subcarrier assignment weighted sum rates Encoding Network coding OFDM Optimization Relays Resource management Uncertainty Quality of service Resource utilization Network coding Orthogonal frequency division multiplexing management of resources power splitting relay Channel state information integer programming weight sums

来源：评论

学校读者我要写书评

暂无评论

Virtual prototyping and pre-sizing methodology for buck DC-DC converters using genetic algorithms

引用

IET POWER ELECTRONICS 2012年第1期5卷 41-52页

作者： Lefranc, P. Jannot, X. Dessante, P. Supelec E3S Dept Power & Energy Syst F-91192 Gif Sur Yvette France

In this article, the authors study the pre-sizing approach of DC-DC buck converters useful for electronics and system designers. The pre-sizing step in an indutrial process is suitable to obtain a preliminary precise sizing of a sub-system (here a buck DC-DC converter): it permits the system designer to perform a feasibility analysis of an overall system (e. g. that contains a buck DC-DC converter). First, static modelling of power devices is proposed: MOSFET, diode, inductor and heatsink. According to an industrial context, the MOSFETs, diodes and heatsinks fitting curves are issued from the manufacturer's datasheets. Second, the objective functions are explained in the case of mixed integer programming problems. Then, the optimisation variables and constraints are highlighted. Third, a section describes the choice of a multi-objective optimisation technique that leads to genetic algorithms (GAs). Fourth, the optimisation results are given. The choice of a final solution of the pre-sizing approach is discussed, considering additional constraints such as diode and MOSFET junctions temperatures, switching frequency etc. The authors focus on the general aspect of the optimisation method proposed here. It can also be used by power electronics designers with the help of additional constraints in accordance to their specific applications.

关键词： power MOSFET multiobjective optimisation technique presizing methodology indutrial process Optimisation Transformers and reactors industrial context Optimisation techniques power devices static modelling diodes power electronics designer manufacturer datasheet MOSFET junction temperature heatsink fitting curve Industrial applications of IT power heatsink heat sinks DC-DC power convertors genetic algorithm power inductor buck DC-DC converter integer programming Power convertors and power supplies to apparatus Design power diode power inductors objective function virtual prototyping mixed integer programming problem system designer genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Reliability constrained coordination of generation and transmission expansion planning in power systems using mixed integer programming

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2011年第9期5卷 948-960页

作者： Alizadeh, B. Jadid, S. Iran Univ Sci & Technol Ctr Excellence Power Syst Automat & Operat Dept Elect Engn Tehran Iran

This paper presents a new approach on expansion planning problem in power systems. The simultaneous expansion of generation and transmission subsystems has been formulated as a mixed integer programming problem to cover different constraints. The method introduces a static planning method which models the least cost deviation from the initial point (pre-expansion condition) in a manner that matches the peak load requirements of the planning horizon (post-expansion condition). The DC power flow model is used to reflect transmission flow constraint in a framework that automatically eliminates disconnected bus problem. Instead of considering just one candidate design for a corridor, different types of designs have been included in the model. This fact makes the model more practical in the transmission expansion planning section. Environmental constraints and fuel supply limitations have been also included for thermal units. Besides, a heuristic algorithm has been proposed to assure the required amount of reliability at hierarchical level II. The algorithm is based on reinforcing the economically optimal plan to upgrade its reliability level to any desired value. The scheme is capable of suggesting an economical level of reliability for a given system by reflecting cost and worth of reinforcements. To numerically evaluate the efficiency of the proposed method, simulation results on the modified Garver6-bus and IEEE 30-bus systems are provided. In spite of huge computation burden at hierarchical level II (HLII) reliability assessment, the results indicate high efficiency of the proposed method.

关键词： power transmission planning Power transmission, distribution and supply Power system planning and layout DC power flow model reliability constrained coordination power generation economics Power system management, operation and economics thermal power stations Optimisation techniques power transmission reliability integer programming fuel supply limitation transmission expansion planning static planning method IEEE 30-bus system power generation reliability power generation planning generation expansion planning Garver6-bus system peak load requirement mixed integer programming problem Reliability disconnected bus problem elimination load flow transmission flow constraint power system planning thermal units

来源：评论

学校读者我要写书评

暂无评论

Joint Relay Selection and Power Allocation for Decode-and-Forward Cellular Relay Network with Imperfect CSI

Joint Relay Selection and Power Allocation for Decode-and-Fo...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Mallick, Shankhanaad Rashid, Mohammad M. Bhargava, Vijay K. Univ British Columbia Vancouver BC V5Z 1M9 Canada

ISBN: (纸本)9781424492688

In this paper, we propose a joint relay selection and power allocation algorithm for a multi-user, multi relay cellular network using decode-and-forward cooperation strategy with imperfect knowledge of channels. The objective is to minimize the total uplink power of the network taking each user's target data rate as the quality of service constraint under imperfect channel state information (CSI), assuming some statistical knowledge is known about the channel estimation error. Joint relay selection and power allocation is a mixed integer programming problem which is combinatorially hard. For that an efficient sub-optimal solution with low complexity using convex relaxation approach is proposed. After relay selection, a centralized power allocation scheme is developed to optimally allocate the power among the users and the selected relay nodes. Then a low-complexity distributed algorithm is proposed based on a standard primal decomposition approach, where each selected relay can independently minimize its own power. Numerical results demonstrate the effectiveness of the proposed algorithms.

关键词： Channel estimation Distributed algorithms Joints Optimization Relays Resource management Throughput cellular radio centralized power allocation scheme channel estimation channel estimation error channel state information combinatorially hard communication complexity convex relaxation approach decode and forward communication decode-and-forward cellular relay network decode-and-forward cooperation strategy imperfect CSI integer programming joint relay selection low-complexity distributed algorithm mixed integer programming problem multirelay cellular network multiuser cellular network primal decomposition approach quality of service quality of service constraint

来源：评论

学校读者我要写书评

暂无评论

Dynamic Resource Allocation for Heterogeneous Services in Cognitive Radio Networks with Imperfect Channel Sensing

Dynamic Resource Allocation for Heterogeneous Services in Co...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Xie, Renchao Yu, F. Richard Ji, Hong Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Ottawa ON Canada Carleton Univ Sch Informat Technol Dept Syst & Comp Engn Ottawa ON Canada Beijing Univ Posts & Telecommun Minist Educ Key Lab Univ Wireless Commun Beijing 100876 Peoples R China

ISBN: (纸本)9781424492688

In cognitive radio networks (CRNs), perfect knowledge of a dynamic radio environment is hard to know due to hardware limitation, short sensing time and network connectivity issues in CRNs. In this paper, we study the dynamic resource allocation problem for heterogeneous services in CRNs with imperfect channel sensing. We formulate the optimization problem as a mixed integer programming problem under constraints. Then we solve the optimal joint power and channel allocation problem using discrete stochastic optimization method. The proposed algorithm has low computation complexity and fast convergence to approximate to the optimal solution under imperfect channel sensing. Another advantage of this method is that it can track the changing radio environment to allocate the resources dynamically. Simulation results are presented to demonstrate the effectiveness of the proposed scheme.

关键词： Approximation algorithms Base stations Channel allocation Cognitive radio Heuristic algorithms Resource management Sensors channel allocation channel allocation problem cognitive radio cognitive radio networks computational complexity discrete stochastic optimization method dynamic radio environment dynamic resource allocation heterogeneous services imperfect channel sensing integer programming low computational complexity mixed integer programming problem network connectivity optimal joint power allocation problem optimization problem radio networks resource allocation stochastic programming

来源：评论

学校读者我要写书评

暂无评论

A Joint Resource Allocation Scheme for Relay Aided Uplink Multi-User OFDMA System

A Joint Resource Allocation Scheme for Relay Aided Uplink Mu...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Sidhu, Guftaar Ahmad Sardar Gao, Feifei Fan, Lisheng Nallanathan, Arumugam

ISBN: (纸本)9781424492688

In this paper, we study the problem of resource allocation in orthogonal frequency division multiple access (OFDMA) based multi-user dual-hop uplink transmission where a single relay station is deployed between the mobile users and the base station which operates under amplify-and-forward (AF) relaying mode. The optimization targets to maximize the overall system throughput through joint optimization of sub-carrier allocation, sub-carrier pairing, and the power allocation, subject to individual power constraint at each node. The optimization results in mixed integer programming problem and a near optimal solution is obtained through dual decomposition approach. Further, we develop a suboptimal scheme to trade the performance for lower complexity. Finally, numerical examples are provided to demonstrate the performance gain of the proposed schemes.

关键词： Complexity theory Joints OFDM modulation Optimization Relays Resource management Signal to noise ratio Throughput amplify and forward communication amplify-and-forward relaying mode base station dual decomposition approach frequency division multiple access integer programming joint resource allocation scheme mixed integer programming problem multiuser dual-hop uplink transmission orthogonal frequency division multiple access system power allocation relay aided uplink multiuser OFDMA system resource allocation single relay station subcarrier allocation joint optimization

来源：评论

学校读者我要写书评

暂无评论

Electrical load tracking scheduling of a steel plant

引用

COMPUTERS & CHEMICAL ENGINEERING 2010年第11期34卷 1899-1903页

作者： Nolde, Kristian Morari, Manfred ETH Automat Control Lab CH-8092 Zurich Switzerland

This paper presents a scheduling solution for electrical load tracking of a steel plant. In the scheduling problem the electricity consumption of the plant is pre-specified by an energy curve. During production all tasks must be scheduled such that the total electricity consumption of all machines tracks the scheduled consumption as closely as possible while respecting all production constraints. All energy over-and underconsumption is penalized since it results in fines from the electricity producer. The problem is formulated as a mixed integer programming problem. The scheduling model uses a continuous time formulation. The model is tested on production data from industry. The results show that the continuous time scheduling model can be successfully applied for the electrical load tracking scheduling of a steel plant. By using this type of scheduling the plant owner can potentially minimize over-and underconsumption and thereby reduce his costs. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Steel plant mixed integer programming problem Load tracking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：