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

Partitioning of Behavioral Descriptions with Exploiting Function-Level Parallelism

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2010年第2期E93A卷 488-499页

作者： Hara, Yuko Tomiyama, Hiroyuki Honda, Shinya Takada, Hiroaki Nagoya Univ Grad Sch Informat Sci Nagoya Aichi 4648603 Japan

A novel method to efficiently synthesize hardware from a large behavioral description in behavioral synthesis is proposed. For a program with functions executable in parallel, this proposed method determines a behavioral partitioning which simultaneously minimizes the overall datapath area and the complexity of the controller while maximizing performance of a synthesized circuit by fully exploiting function-level parallelism of a behavioral description. This method is formulated as an integer programming problem. Experimental results demonstrate that this method leads to a shift of the explorable design space so that superior solutions which could not be explored by earlier work are included, showing the effectiveness of our proposed method.

关键词： behavioral synthesis function-level partitioning integer programming problem

来源：评论

学校读者我要写书评

暂无评论

integer programming Approach to PCB Assembly Optimization of Modular Mounters

Integer Programming Approach to PCB Assembly Optimization of...

引用

2010 IEEE World Congress on Computational Intelligence

作者： Park, Tae-Hyoung Kim, Kyung-Min Chungbuk Natl Univ Dept Control & Robot Eng CBITRC Cheongju 361763 Chungbuk South Korea Samsung Elect Co Mobile Commun Ctr Suwon 433742 Kyunggi South Korea

ISBN: (纸本)9781424481262

We propose an optimization method to maximize the productivity of PCB (printed circuit board) assembly of modular mounters. The modular mounter is a series of compact SMD (surface mount device) placement modules, where each module has assembly head and feeder lanes. The throughput of the mounter is maximized by balancing the assembly time of each module. We indentify the problem as an integer programming problem, and divide the problem into feeder arrangement problem and mount sequence problem by decoupling the path into forward arcs and backward arcs. The integer-programming based algorithms such as branch-and-bound algorithm and transportation algorithm are applied to solve the formulated problems. Simulation results are presented to verify the usefulness of the proposed method.

关键词： PCB assembly optimization assembling assembly time branch-and-bound algorithm feeder arrangement problem integer programming integer programming based algorithm integer programming problem modular mounter mount sequence problem optimisation printed circuit board assembly printed circuit manufacture printed circuits productivity surface mount device placement module transportation algorithm

来源：评论

学校读者我要写书评

暂无评论

Prediction of RNA secondary structure with pseudoknots using integer programming

引用

BMC BIOINFORMATICS 2009年第Sup1期10卷 1-11页

作者： Poolsap, Unyanee Kato, Yuki Akutsu, Tatsuya Kyoto Univ Inst Chem Res Bioinformat Ctr Kyoto 6110011 Japan

Background: RNA secondary structure prediction is one major task in bioinformatics, and various computational methods have been proposed so far. Pseudoknot is one of the typical substructures appearing in several RNAs, and plays an important role in some biological processes. Prediction of RNA secondary structure with pseudoknots is still challenging since the problem is NP-hard when arbitrary pseudoknots are taken into consideration. Results: We introduce a new method of predicting RNA secondary structure with pseudoknots based on integer programming. In our formulation, we aim at minimizing the value of the objective function that reflects free energy of a folding structure of an input RNA sequence. We focus on a practical class of pseudoknots by setting constraints appropriately. Experimental results for a set of real RNA sequences show that our proposed method outperforms several existing methods in sensitivity. Furthermore, for a set of sequences of small length, our approach achieved good performance in both sensitivity and specificity. Conclusion: Our integer programming-based approach for RNA structure prediction is flexible and extensible.

关键词： integer programming integer programming problem integer programming Formulation Pseudoknotted Structure Grammatical Approach

来源：评论

学校读者我要写书评

暂无评论

Methods of Chebyshev Points of Convex Sets and Their Applications

引用

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2008年第1期48卷 16-29页

作者： Belykh, T. I. Bulatov, V. P. Yas'kova, E. N. Baikal State Univ Econ & Law Irkutsk 664003 Russia Russian Acad Sci Siberian Branch Melentiev Energy Syst Inst Irkutsk 664033 Russia

Chebyshev points of bounded convex sets, search algorithms for them, and various applications to convex programming are considered for simple approximations of reachable sets, optimal control, global optimization of additive functions on convex polyhedra, and integer programming. The problem of searching for Chebyshev points in multicriteria models of development and operation of electric power systems is considered.

关键词： convex programming problem convex sets Chebyshev points integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Function-level partitioning of sequential programs for efficient behavioral synthesis

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2007年第12期E90A卷 2853-2862页

作者： Hara, Yuko Tomiyama, Hiroyuki Honda, Shinya Takada, Hiroaki Ishii, Katsuya Nagoya Univ Grad Sch Informat Sci Dept Informat Engn Nagoya Aichi 4648603 Japan Nagoya Univ Ctr Informat Technol Nagoya Aichi 4648603 Japan

This paper proposes a behavioral level partitioning method for efficient behavioral synthesis from a large sequential program consisting of a set of functions. Our method optimally determines functions to be inlined into the main module and the other functions to be synthesized into sub modules in such a way that the overall datapath is minimized while the complexity of individual modules is lower than a certain level. The partitioning problem is formulated as an integer programming problem. Experimental results show the effectiveness of the proposed method.

关键词： behavioral synthesis function-level partitioning integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Identification of petri nets from knowledge of their language

引用

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS 2007年第4期17卷 447-474页

作者： Cabasino, Maria Paola Giua, Alessandro Seatzu, Carla Univ Cagliari Dept Elect & Elect Engn I-09123 Cagliari Italy

In this paper we deal with the problem of identifying a Petri net system, given a finite language generated by it. First we consider the problem of identifying a free labeled Petri net system, i.e., all transition labels are distinct. The set of transitions and the number of places is assumed to be known, while the net structure and the initial marking are computed solving an integer programming problem. Then we extend this approach in several ways introducing additional information about the model (structural constraints, conservative components, stationary sequences) or about its initial marking. We also treat the problem of synthesizing a bounded net system starting from an automaton that generates its language. Finally, we show how the approach can also be generalized to the case of labeled Petri nets, where two or more transitions may share the same label. In particular, in this case we impose that the resulting net system is deterministic. In both cases the identification problem can still be solved via an integer programming problem.

关键词： petri nets identification integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Auto search algorithm for antenna structure by gradient method combined with method of moment

Auto search algorithm for antenna structure by gradient meth...

引用

2nd International ITG Conference on Antennas (INICA)

作者： Takei, Ken Ikegaya, Morihiko Hitachi Cable Ltd Cross Technol Dev Ctr Hitachi Ibaraki 3191418 Japan

ISBN: (纸本)9783000216442

We propose a novel antenna design method consisting of the gradient method and method of moment is proposed. An antenna structure is represented by the combination of small segments. By regarding the 0/1 state segment variable as a real parameter, a matrix equation for the gradient method is derived. Fast computation causing of automatic decisions of simultaneous changing segments achieves practical design for various antennas, including large-scale antennas.

关键词： method of moment gradient method DMB ISDB integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Complexity-Constrainted Partitioning of Sequential Programs for Efficient Behavioral Synthesis

Complexity-Constrainted Partitioning of Sequential Programs ...

引用

17th Great Lakes Symposium on VLSI

作者： Hara, Yuko Tomiyama, Hiroyuki Honda, Shinya Takada, Hiroaki Ishii, Katsuya Nagoya Univ Grad Sch Informat Sci Chikusa Ku Nagoya Aichi 4648603 Japan

ISBN: (纸本)9781595936059

This paper proposes a behavioral level partitioning method for efficient behavioral synthesis from a large sequential program consisting of a set of functions. Our method optimally determines functions to be inlined into the main module and ones to be synthesized into sub modules in such a way that the overall datapath is minimized while the complexity of individual modules is lower than a certain level. The partitioning problem is formulated as an integer programming problem. Experimental results show the effectiveness of the proposed method.

关键词： Behavioral Synthesis Function Calls integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Auto Search Algorithm for Antenna Structure by Gradient Method Combined with Method of Moment

Auto Search Algorithm for Antenna Structure by Gradient Meth...

引用

International ITG-Conference on Antennas

作者： Ken TAKEI Morihiko IKEGAYA Cross Technology Development Center Hitachi Cable Ltd.

关键词： Method of moment Gradient method DMB ISDB integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Unified particle swarm optimization for tackling operations research problems

Unified particle swarm optimization for tackling operations ...

引用

IEEE Swarm Intelligence Symposium

作者： Parsopoulos, KE Vrahatis, MN Univ Patras CI Lab Dept Math GR-26110 Patras Greece

ISBN: (纸本)0780389166

We investigate the performance of the recently proposed Unified Particle Swarm Optimization algorithm on two categories of operations research problems, namely minimax and integer programming problems. Different variants of the algorithm are employed and compared with established variants of the Particle Swarm Optimization algorithm. Statistical hypothesis testing is performed to justify the significance of the results. Conclusions regarding the ability of the Unified Particle Swarm Optimization method to tackle operations research problems as well as on the performance of each variant are derived and discussed.

关键词： integer programming minimax techniques operations research particle swarm optimisation statistical testing integer programming problem minimax problem operation research problem statistical hypothesis testing unified particle swarm optimization Particle swarm optimization integer programming minimax techniques Statistical tests Hypothesis testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：