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

European Signal Processing Conference

作者： Zaka Ullah Sheikh Oscar Gustafsson Department of Electrical Engineering Linkoping University

In this work a new technique for design of narrow-band and wide-band linear-phase finite-length impulse response (FIR) frequency-response masking based filters is introduced. The technique is based on a sparse FIR filter design method for both the model (bandedge shaping) filter as well as the masking filter using mixed integer linear programming optimization. The proposed technique shows promising results for realization of efficient low arithmetic complexity structures.

关键词： Finite impulse response filters Complexity theory Design methodology Passband linear programming mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Clock Skew Scheduling for Soft-Error-Tolerant Sequential Circuits 10

Clock Skew Scheduling for Soft-Error-Tolerant Sequential Cir...

引用

Design, Automation & Test in Europe Conference & Exhibition

作者： Kai-Chiang Wu Diana Marculescu Carnegie Mellon University

ISBN: (纸本)9783981080162

Soft errors have been a critical reliability concern in nano-scale integrated circuits, especially in sequential circuits where a latched error can be propagated for multiple clock cycles and affect more than one output, more than once. This paper presents an analytical methodology for enhancing the soft error tolerance of sequential circuits. By using clock skew scheduling, we propose to minimize the probability of unwanted transient pulses being latched and also prevent latched errors from propagating through sequential circuits repeatedly. The overall methodology is formulated as a piecewise linear programming problem whose optimal solution can be found by existing mixed integer linear programming solvers. Experiments reveal that 30-40% reduction in the soft error rate for a wide range of benchmarks can be achieved.

关键词： Clocks Sequential circuits integer linear programming Piecewise linear techniques Logic circuits Scheduling Computer errors mixed integer linear programming Error analysis Degradation

来源：评论

学校读者我要写书评

暂无评论

A model for the optimal design of the Hospital Drug Distribution Chain

A model for the optimal design of the Hospital Drug Distribu...

引用

IEEE Workshop on Health Care Management (WHCM)

作者： Nicola Costantino Mariagrazia Dotoli Marco Falagario Maria Pia Fanti Agostino Marcello Mangini Fabio Sciancalepore Walter Ukovich Dipartimento di Ingegneria Meccanica e Gestionale Politecnico di Bari Italy Dipartimento di Elettrotecnica ed Elettronica Politecnico di Bari Italy Dipartimento di Elettrotecnica Elettronica e Informatica Università di Trieste Italy

ISBN: (纸本)9781424449972;9781424449989

The paper addresses the optimal design of the last branch of the pharmaceutical supply chain, i.e., the hospital drug distribution chain (HDDC), starting from suppliers till the patients of a department. Considering a distributed healthcare system composed of different stages connected by medicine and information links labeled with suitable performance indices, a procedure employing digraph modeling and mixed integer linear programming is presented to select the (sub)optimal HDDC configuration. The optimization model is applied under structural constraints to a case study describing an Italian healthcare regional distribution chain. The problem solution provides different HDDC structures allowing the improvement of the healthcare supply chain flexibility and performance.

关键词： Hospitals Drugs Pharmaceuticals Medical services Supply chains mixed integer linear programming Logistics Costs Constraint optimization Supply chain management

来源：评论

学校读者我要写书评

暂无评论

Exact and Performance-Guaranteed Multicast Algorithms for Lifetime Optimization in WANETs

引用

NETWORKS 2010年第3期55卷 287-297页

作者： Guo, Song Leung, Victor Univ Aizu Sch Engn & Comp Sci Aizu Wakamatsu Fukushima Japan Univ British Columbia Dept Elect & Comp Engn Vancouver BC V5Z 1M9 Canada

We consider the problem of maximizing the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. We provide a globally optimal solution to this problem by developing a general MILP formulation that can apply to many directional antenna models, some of which are not supported by the existing formulations. We also investigate the theoretical performance of a well-known heuristic algorithm for this optimization problem in terms of its approximation ratio. We use a graph theoretic approach, for the first time, to derive an upper bound on its approximation ratio in an analytical expression and discover that it is a constant-factor approximation algorithm. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 55(3), 287-297 2010

关键词： wireless ad hoc networks lifetime multicast maximization mixed integer linear programming directional antenna

来源：评论

学校读者我要写书评

暂无评论

Transition-aware real-time task scheduling for reconfigurable embedded systems 10

Transition-aware real-time task scheduling for reconfigurabl...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Hessam Kooti Elaheh Bozorgzadeh Shenghui Liao Lichun Bao Computer Sciences Department University of California Irvine USA

ISBN: (纸本)9783981080162

Due to increase in demand for reconfigurability in embedded systems, real-time task scheduling is challenged by non-negligible reconfiguration overheads. If such overheads are not considered, tasks may not be schedulable under given deadlines, and hence, affecting the quality of service. We introduce the problem of real-time periodic task scheduling under transition overhead on heterogeneous reconfigurable systems. We formulate the problem as a network flow problem and provide a mixed integer linear programming solution. We compare our proposed solution with optimal scheduling under maximum fixed transition overhead. We deployed our method on task scheduling for multiple communication protocols on reconfigurable FPGA-like systems. Results show that our proposed scheduling improves the task schedulability by 24.2% in comparison with non-preemptive EDF and by 17.5% in comparison with maximum-transition-overhead scheduling.

关键词： Real time systems Embedded system Optimal scheduling Processor scheduling Dynamic scheduling Hardware Multiaccess communication Embedded computing Quality of service mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimization Model for Remanufacturing Logistics Network with Fuzzy Parameters

Optimization Model for Remanufacturing Logistics Network wit...

引用

International Conference on Measuring Technology and Mechatronics Automation, ICMTMA

作者： Ling Zhang Zhengxiao Wang Xiaohong Pan Tianyang Dong Inst. of Manuf. Eng. Zhejiang Univ. Hangzhou China Coll. of Comput. Zhejiang Univ. of Technol. Hangzhou China

In this paper, a multi-product multi-echelon remanufacturing logistics network based on forward flows is designed. A fuzzy mixed integer linear programming (FMILP) model is developed accounting for the uncertainty of the quantities of returned products as fuzzy parameters. Regarding the quantity of the returned products as triangle fuzzy parameter, the proposed model is solved by converting fuzzy chance constraints to their respective crisp equivalents. An illustrative example is presented to demonstrate the effectiveness of the model.

关键词： Reverse logistics Uncertainty mixed integer linear programming Heuristic algorithms Stochastic processes Software algorithms Mechatronics Manufacturing automation Technology management Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Maximizing Weighted Sum Min-Rate in Downlink Cellular OFDMA Systems

Resource Allocation for Maximizing Weighted Sum Min-Rate in ...

引用

IEEE International Conference on Communications (ICC)

作者： T. Wang L. Vandendorpe Communications and Remote Sensing Laboratory Université Catholique de Louvain Louvain-la-Neuve Belgium

This paper considers the downlink of a cellular orthogonal frequency division multi-access (OFDMA) system, in which multiple base stations (BS) are coordinated by a centralized resource allocation algorithm. We address the problem of maximizing the weighted sum min-rate (WSMR) subject to a total power constraint at each BS, in terms of jointly optimizing coordinated BSs' subcarrier and power allocation. In particular, this problem leads to a resource allocation that guarantees similar rates to users in each cell. An iterative algorithm is proposed to optimize subcarrier and power allocation alternatively, so that the WSMR keeps increasing until convergence. In each iteration, the subcarrier allocation is updated by solving a mixed integer linear programming problem for each cell, while the power allocation is updated by solving a successive set of convex optimization problems with an algorithm based on Karush-KuhnTucker conditions. The effectiveness of the algorithm is illustrated by numerical experiments.

关键词： Resource management Downlink Iterative algorithms Convergence Frequency conversion Base stations Constraint optimization mixed integer linear programming Interchannel interference Radiofrequency interference

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming Trajectory Generation for Autonomous Nap-of-the-Earth Flight in a Threat Environment

Mixed Integer Linear Programming Trajectory Generation for A...

引用

IEEE Conference on Aerospace

作者： C.S. Ma R.H. Miller Northrop Grumman Integrated Systems El Segundo CA USA

This paper extends a recently developed approach to the optimal path planning of an autonomous vehicle in an obstacle field to three dimensions with specific applications to terrestrial navigation, with obstacle, terrain, and threat avoidance. We present a scenario where this approach can be applied to a rotorcraft performing nap-of-the-Earth flight in challenging terrain with multiple known surface threats, in both urban and non-urban type settings. mixed-integer linear programming (MILP) is the underlying problem formulation, from which an optimal solution can be obtained through the use of a commercially available MILP solver such as CPLEX. The solution obtained would be optimal in terms of the cost function specified in terms of fuel, time, altitude and threat exposure, and other predefined criteria. A receding horizon implementation of this MILP algorithm makes it suitable for real-time or near real-time applications

关键词： mixed integer linear programming Path planning linear programming Remotely operated vehicles Mobile robots Trajectory Mathematical programming Mathematical model Paper technology Navigation

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm-based approach for solving the resource-sharing and scheduling problem

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2009年第3期57卷 1131-1143页

作者： Pinto, Gaby Ainbinder, Inessa Rabinowitz, Gad Ben Gurion Univ Negev Dept Ind Engn & Management IL-84105 Beer Sheva Israel

We introduce a heuristic that is based on a unique genetic algorithm (GA) to solve the resource-sharing and scheduling problem ( RSSP). This problem was previously formulated as a continuous-time mixed integer linear programming model and was solved optimally using a branch-and-bound (B&B) algorithm. The RSSP considers the use of a set of resources for the production of several products. Producing each product requires a set of operations with precedence relationships among them. Each operation can be performed using alternative modes which define the subset of the resources needed, and an operation may share different resources simultaneously. The problem is to select a single mode for each operation and accordingly to schedule the resources, while minimizing the makespan time. The GA we propose is based on a new encoding schema that adopts the structure of a DNA in nature. In our experiments we compared the effectiveness and runtime of our GA versus a B&B algorithm and two truncated B&B algorithms that we developed on a set of 118 problem instances. The results demonstrate that the GA solved all the problems ( 10 runs each), and reaches optimality in 75% of the runs, had an average deviation of less than 1% from the optimal makespan, and a runtime that was much less sensitive to the size of the problem instance. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Resource-sharing and scheduling problem mixed integer linear programming Genetic algorithm Branch-and-bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Travelling Route of Mobile Surveillance Camera

Travelling Route of Mobile Surveillance Camera

引用

IEEE Asia Pacific Conference on Circuits and Systems

作者： Yoichi TOMIOKA Atsushi TAKARA Hitoshi KITAZAWA Department of Electrical and Electronic Engineering Tokyo University of Agriculture and Technology

ISBN: (纸本)9781424474547

A video surveillance system is becoming more and more important for investigation and deterrent of crimes, and cameras installed in public space are increasing. However, a number of cameras is required to observe a wide and complex area with cameras installed at fixed positions. In order to efficiently observe a wide and complex area at lower cost, mobile robots have attracted attention. In this paper, we propose a method to plan a travelling route of mobile surveillance camera. Our method is based on mixed integer linear programming, and obtains an optimum travelling route such that a camera with certain visual angle and distance can observe all regions at the shortest intervals. Our method is applied to artificially generated data with various parameters, and it is shown that the shortest route which is more appropriate for the observation is obtained compared to a TSP-based method.

关键词： Detective cameras Cameras mixed integer linear programming shortest path crime open spaces Deterrents Mobile robots Mobile

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：