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

Power Tech Conference

作者： A.H. Mantawy M.S. Al-Ghamdi Electrical Engineering Department King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia

This paper presents an algorithm for optimizing reactive power using particle swarm algorithm. A new implementation for the particle swarm algorithm has been applied. The objective function of the proposed algorithm is to minimize the system active power loss. The control variables are generator bus voltages, transformer tap positions and switch-able shunt capacitor banks. The proposed algorithm has been applied to practical IEEE 6-bus system. The proposed algorithm shows better results as compared to previous work.

关键词： Reactive power Optimization methods Power generation Voltage linear programming integer linear programming Reactive power control Automatic control Particle swarm optimization Power supplies

来源：评论

学校读者我要写书评

暂无评论

Stabilization conditions for model predictive control of constrained PWA systems

Stabilization conditions for model predictive control of con...

引用

IEEE Conference on Decision and Control

作者： M. Lazar W.P.M.H. Heemels S. Weiland A. Bemporad Department of Electrical Engineering Eindhovan University of Technology Eindhoven Netherlands Embedded Systems Institute Eindhoven Netherlands Dipartimento di Ingegneria dellInformazione Universitá di Siena Siena Italy

ISBN: (纸本)0780386825

Model predictive control (MPC) has recently been applied to several relevant classes of hybrid systems with promising results. These developments generated an increasing interest towards issues such as stability and computational problems that arise in hybrid MPC. Stability aspects have been addressed only marginally. In this paper we present an extension of the terminal cost and constraint set method for guaranteeing stability in MPC to the class of constrained piecewise affine systems. Semidefinite programming is used to calculate the employed terminal weight matrix that ensures stability for quadratic cost based MPC. A procedure for computing a robust positively invariant set for piecewise linear systems is also developed. The implementation of the proposed method is illustrated by an example.

关键词： Predictive models Predictive control Costs linear matrix inequalities Quadratic programming integer linear programming Stability analysis Lyapunov method Hybrid power systems Robustness

来源：评论

学校读者我要写书评

暂无评论

Synthesis of Approximate Parametric Circuits for Variational Quantum Algorithms

Synthesis of Approximate Parametric Circuits for Variational...

引用

Quantum Computing and Engineering (QCE), IEEE International Conference on

作者： Blake Burgstahler Ellis Wilson Scott Pakin Frank Mueller North Carolina State University Los Alamos National Laboratory

ISBN: (数字)9798331541378

ISBN: (纸本)9798331541385

This work presents a novel approach to synthesize approximate circuits for the ansatze of variational quantum algorithms (VQA) and demonstrates its effectiveness in the context of solving integer linear programming (ILP) problems. Synthesis is generalized to produce parametric circuits in close approximation of the original circuit and to do so offline . This removes synthesis from the (online) critical path between repeated quantum circuit executions of VQA. We hypothesize that this approach will yield novel high fidelity results beyond those discovered by the baseline without synthesis. Simulation and real device experiments complement the baseline in finding correct results in many cases where the baseline fails to find any and do so with on average 32% fewer CNOTs in circuits.

关键词： Quantum algorithm Program processors Logic gates integer linear programming Approximation algorithms Quantum circuit

来源：评论

学校读者我要写书评

暂无评论

A polynomial algorithm solving a special class of hybrid optimal control problems

A polynomial algorithm solving a special class of hybrid opt...

引用

IEEE International Conference on Computer-Aided Design

作者： Dario Bauso Raffaele Pesenti Dipartimento di Ingegneria Informatica Università di Palermo Palermo Italy

Hybrid optimal control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions [5]. In this paper, we identify a special class of hybrid optimal control problems which are easy to solve. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the hybrid optimal control problem via an integer-linear programming reformulation. The integer-linear programming problem is a Set-covering one with a totally unimodular constraint matrix and therefore solving the Set-covering problem is equivalent to solving its linear relaxation. It turns out that any solution of the linear relaxation is a feasible solution for the hybrid optimal control problem. Then, given the feasible solution, obtained solving the linear relaxation, we find the optimal solution via local search.

关键词： Polynomials Optimal control Control systems Operations research integer linear programming Costs linear programming Computational complexity Manufacturing Inventory management

来源：评论

学校读者我要写书评

暂无评论

Explicit solution of system of two higher-order recurrences

arXiv

引用

arXiv 2024年

作者： Németh, László Szalay, László University of Sopron Institute of Basic Sciences Departement of Mathematics Bajcsy-Zs. u. 4 Sopron9400 Hungary J. Selye University Department of Mathematics Komárno Slovakia

We give a method to determine an explicit solution to a system of two inhomogeneous linear recursive sequences of higher order. Our approach can be used efficiently in solving certain combinatorial problems. We finish the paper by considering a tiling problem with black and white dominoes, and we use the method as a demonstration to find the *** Codes 11B37, 05B45, 52C20 © 2024, CC BY.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A global router for sea-of-gates circuits

A global router for sea-of-gates circuits

引用

European Conference on Design Automation

作者： Kai-Win Lee C. Sechen Department of Electrical Engineering Yale University USA

Describes a new global routing algorithm designed specifically for sea-of-gates circuits. The algorithm has been generalized to handle gate array and standard cell circuits. The main features of the algorithm are: (1) interconnection length minimization using a new Steiner tree generation method, (2) a two-stage coarse global routing method which seeks to even congestion, (3) a maze routing procedure which removes overflows and reduces the congestion, (4) vertical track assignment, and (5) congestion evening at the detailed global routing level. In tests on the MCNC benchmark circuits, the algorithm produced layouts with an average of 11% fewer routing tracks than the other algorithms. In tests on gate array benchmark circuits, the algorithm not only achieved uniform channel densities, but the maximum channel densities it produced are the lowest values that have ever been reported.< >

关键词： Routing Circuit testing Algorithm design and analysis Benchmark testing Pins Integrated circuit interconnections Very large scale integration integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Analysis of multidimensional loops with non-uniform dependences

Analysis of multidimensional loops with non-uniform dependen...

引用

Proceedings of the Advances in Parallel and Distributed Computing

作者： J.-C. Sogno INRIA France

For a parallelizing compiler, mainly based on loop transformations, dependence information that is as complete and precise as possible is required. In this paper, we propose a generalized method for computing, in any multi-dimensional loop, information which proved to be useful in the case of irregular dependences. Firstly, we solve the basic problem of the existence of a dependence with an algorithm composed of a preprocessing phase of reduction and of an integer simplex resolution. If a solution exists, we compute by integer simplex the bounds of the distances associated with loop indices. Depending on the values of these bounds, we finally define problems consisting in evaluating the bounds of slopes of dependence vectors, which we solve by integer linear fractional programming. The amount of computation for each new problem is very low. This algorithm has been implemented as an extension of the Janus Test, which was presented in a previous work.

关键词： Multidimensional systems Information analysis Vectors integer linear programming Testing Performance evaluation Program processors Parallel processing Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Fuzzy approaches to the production problems: the case of refinery industry

Fuzzy approaches to the production problems: the case of ref...

引用

International Conference on Information Fusion

作者： M. Gunes Department of Econometrics University of Dokuz Eylul Fac. of Econ. and Adm. Sciences Buca Izmir Turkey

The fuzzy principle states that everything is a matter of degree. So far, many business production problems are solved by operational research optimization techniques, under the considerations of some assumptions. In the current literature, we still have several applications of fuzzy linear, integer, goal and other programming applications. The main aim of the study is to add a new application to the literature and to solve the refinery production problem by using fuzzy principles. In application, the real refinery model has been developed and an alternative fuzzy model solution has been criticized to determine which one is better. Finally, comparing the classical solution with one of the obtained best solutions of the fuzzy models, one can obtain more suitable output of the models than the traditional methods.

关键词： Production Computer aided software engineering Refining linear programming Econometrics integer linear programming Fuzzy logic Multivalued logic Arithmetic Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Specification and support for multidimensional DSP in the SILAGE language

Specification and support for multidimensional DSP in the SI...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： I.M. Verbauwhede C.J. Scheers J.M. Rabaey EECS Department University of California Berkeley Berkeley CA USA Zycad Corporation Fremont CA USA

Data flow languages are a natural way to describe the flow of computations in a DSP application. The SILAGE language has been developed for this purpose. It contains also more-dimensional arrays of signals and a natural extension of it, delayed versions of arrays, e.g. to represent previous frames in video applications. The paper describes new data flow analysis techniques, to support multi-dimensional arrays. It checks single assignment of arrays, checks if for each consumption of an indexed signal, there is a production, and it will create data dependencies between productions and consumptions. These problems are formulated as integer linear programming problems. This formulation is independent of the number of signals in the arrays. Results show very fast running times (<1 s) for problems more than a hundred nodes.< >

关键词： Multidimensional systems Digital signal processing Delay Production Data analysis Data flow computing integer linear programming Filters Testing High level synthesis

来源：评论

学校读者我要写书评

暂无评论

Efficient FPGA Implementation of Equalizer for Finite Interval Constant Modulus Algorithm

Efficient FPGA Implementation of Equalizer for Finite Interv...

引用

International Symposium on Industrial Embedded Systems

作者： Premysl Sucha Zdenek Hanzalek Antonin Hermanek Jan Schier Centre for Applied Cybernetics Department of Control Engineering Czech Technical University Prague Czech Republic Institute of Information Theory and Automation Academy of Sciences슠of the슠Czech Republic Czech Republic

This paper deals with the optimization of iterative algorithms with matrix operations or nested loops for hardware implementation in Field Programmable Gate Arrays (FPGA), using integer linear programming (ILP). The method is demonstrated on an implementation of the Finite Interval Constant Modulus Algorithm, proposed for 4G communication systems. We used two pipelined arithmetic ibraries based on the logarithmic number system or the floating-point number system, using the widely known IEEE format for the floating-point calculations required in the algorithm. Traditional approaches to the scheduling of nested loops lead to a relatively large code, which is unsuitable for FPGA implementation. This paper presents a new high-level synthesis methodology, which models both, iterative loops and imperfectly nested loops, by means of the system of linear inequalities. Moreover, memory access is considered as an additional resource constraint. Since the solutionns of ILP formulated problems are known to be computationally intensive, important part of the article is devoted to the reduction of the problem size.

关键词： Field programmable gate arrays Equalizers Processor scheduling Optimal scheduling Iterative algorithms Signal processing algorithms Scheduling algorithm Hardware integer linear programming Libraries

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：