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

10th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Jurcik, Petr Hanzalek, Zdenek Czech Tech Univ Fac Elect Engn Dept Control Engn CR-16635 Prague Czech Republic

ISBN: (纸本)9780780394018

The geographically distribuited system can be interconnected via a overlay multicast network. In this overlay network the multicast data are routed and replicated on the application layer along a multicast tree. This paper presents the techniques of the network reduction and the multicast tree construction. The multicast tree in the form of shortest path tree (SPT) can be build up upon the linear programming formulation. To control the load of each host, the additional constraints on the maximal number of directly outgoing connections and integer variables are added and subsequently form the degree-bounded shortest path tree problem (db-SPT). This theoretically based problem is formulated in integer linear programming framework.

关键词： Application-layer multicast overlay network shortest path tree problem degree-bounded shortest path tree problem integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Decentralized Fault Diagnosis by Petri Nets and integer linear programming

Decentralized Fault Diagnosis by Petri Nets and Integer Line...

引用

20th World Congress of the International-Federation-of-Automatic-Control (IFAC)

作者： Cong, Xuya Fanti, Maria Pia Mangini, Agostino Marcello Li, Zhiwu Xidian Univ Sch Electromech Engn 2 South Taibai Rd Xian 710071 Shaanxi Peoples R China Polytech Bari Dept Elect & Informat Engn I-70125 Bari Italy Macau Univ Sci & Technol Inst Syst Engn Taipa Macau Peoples R China

This paper addresses the problem of decentralized on-line fault diagnosis in the Petri net framework by using integer linear programming. The decentralized architecture consists of a set of local sites communicating with a coordinator that determines whether the behaviour of a system is normal or faulty. In particular, a protocol is presented for the communication between the local sites and the coordinator, and the rules for the coordinator to decide the global diagnosis results are proposed. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Fault diagnosis Petri nets integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Rest Area Parking Design Using integer linear programming 19

Rest Area Parking Design Using Integer Linear Programming

引用

5th International Conference on Industrial and Business Engineering (ICIBE)

作者： Dianawati, Fauzia Kristianto, Joshua Univ Indonesia Depok Indonesia

ISBN: (纸本)9781450376532

Indonesia's logistic performance index in 2018 was ranked 46th in the world, and 5th in the ASEAN region, with the infrastructure sub-indicator was the second lowest of six others. The government added new 200 to the 760 kilometres Trans-Java toll road. It will be equipped with 61 rest areas along the road. In Eid al-Fitr holiday, where traffic increased up to 460%, rest areas were full, resulting in heavy congestion. In this research, integer linear programming (ILP) is used to model the parking layout to determine the optimal parking angle and the parking lot number. The objective is to maximize the parking area capacity. The decision variables are the number of parking rows (X-et,X-theta, X-ep,X-theta, X-e,X-theta, X-ip,(theta), X-i,X-theta) and the number of parking vehicles (N-et,N-theta, N-ep,N-theta, N-e,N-theta, N-ip,(theta), N-ip,N-theta) both based on five parking angles (0 degrees, 30 degrees, 45 degrees, 60 degrees, 90 degrees). The constraints are the width of the parking lot (W), the length (L), and length of area in the middle line (L') and non-negative constraints. The study was conducted at rest area km 207A in Palikanci toll road. The existing parking area was divided into 15 areas to fit the model. The result showed that integer linear programming can enhance the parking capacity, from 41 to 105 buses/trucks and 258 to 473 cars. This research will give impact to business profit of the parking management, reduce toll road traffic congestion, and improve the comfort of the rest area.

关键词： Optimization Parking capacity Rest area integer linear programming Ttransportation infrastructure

来源：评论

学校读者我要写书评

暂无评论

A GRAPHICAL SOFTWARE TOOL WITH integer linear programming FOR MICROCONTROLLER INPUT/OUTPUT INTERFACE SELECTION FEASIBILITY

A GRAPHICAL SOFTWARE TOOL WITH INTEGER LINEAR PROGRAMMING FO...

引用

26th IEEE Annual Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： Manjikian, Naraig Ferdynus, Alexander Katona, Laszlo Queens Univ Dept Elect & Comp Engn Kingston ON K7L 3N6 Canada Aztech Associates Inc Kingston ON Canada

ISBN: (纸本)9781479900336;9781479900312

This paper describes a graphical and interactive software tool to support embedded systems engineering with highly integrated microcontrollers such as the ColdFire MCF54418. Such products have many input/output interfaces that share chip pins, hence not all possible combinations of active interfaces are feasible due to pin conflicts. To address challenges stemming from such conflicts, the software tool described in this paper provides early decision support for selection and subsequent hardware configuration of interfaces. An XML input file describes pins and interfaces of a microcontroller. From this information, the software tool generates an interactive graphical representation for a designer to interactively explore interfaces and pins, to visualize interface conflicts due to shared pins, and to incrementally develop conflict-free interface combinations. More importantly, the tool provides higher-level automated decision support with integer linear programming to solve an optimization problem and conclusively determine whether there exists a feasible conflict-free selection for given specifications on desired types and numbers of interfaces. Finally, for general-purpose input/output, the tool also has a more specialized mode that enables a user to indicate application-specific grouping and direction of pins. From this information, the tool automatically tailors an application programming interface in C code.

关键词： Embedded systems microcontrollers integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Novel Genomic Duplication Models through integer linear programming 21

Novel Genomic Duplication Models through Integer Linear Prog...

引用

12th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB)

作者： Paszek, Jaroslaw Eulenstein, Oliver Gorecki, Pawel Univ Warsaw Fac Math Informat & Mech Warsaw Poland Iowa State Univ Dept Comp Sci Ames IA USA

ISBN: (纸本)9781450384506

Unveiling ancient whole-genome duplications, or WGDs, in the evolutionary history of species is elementary to understand how gene families have formed over time and genomes evolved. A classic framework of WGD models for deciphering ancient species in which genome duplications occurred is based on reconciling multiple gene trees with a species tree. Reconciling gene trees with a species tree reveals evolutionary scenarios describing how genes have evolved along species tree branches through speciation and single duplication events. Clustering single duplication events from different gene trees occurring in the same species can reveal duplication episodes indicative of remnants of ancient WGDs. WGD models can be categorized into restricted and unrestricted models. Restricted models only consider scenarios where single duplications are limited by the timing of their ancestor speciation, while unrestricted models consider all possible evolutionary scenarios. Representing two extremes of the overall spectrum of possible scenarios, unconstrained models are biased towards locating duplication episodes close to the root of the species tree, while the constrained models tend to locate episodes close to the most recent species that theoretically could have contained them. Adding flexibility for improved biological realism, in this work, we develop and analyze a novel framework of WGD models encompassing the whole range of intermediate locations by defining, implementing, and testing models under multiple constraint strategies. We achieve this by formulating the first ILP model for the NP-hard problem of computing duplication episodes under the classic unrestricted WGD model from Fellows et al. and then incorporating constraints into this formulation reflecting WGD models for intermediate locations. Finally, we demonstrate the exemplary performance of our models and that our ILP formulations allow computing typical problem instances occurring in practice.

关键词： genomic duplication reconciliation duplication clustering whole genome duplication minimum episodes integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On the path-width of integer linear programming 5

On the path-width of integer linear programming

引用

5th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF)

作者： Enea, Constantin Habermehl, Peter Inverso, Omar Parlato, Gennaro Univ Paris Diderot IRIF F-75205 Paris 13 France CNRS F-75205 Paris 13 France Gran Sasso Sci Inst Viale Francesco Crispi 7 Laquila Italy Univ Southampton Sch Elect & Comp Sci Southampton SO9 5NH Hants England

We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it. However, one of these graphs is of path-width at most 2n, where n is the number of variables in the instance. Since FO is decidable on graphs of bounded path-width, we obtain an alternative decidability result for ILP. The technique we use underlines a common principle to prove decidability which has previously been employed for automata with auxiliary storage. We also show how this new result links to automata theory and program verification. (C) 2016 Elsevier Inc. All rights reserved.

关键词： integer linear programming Bounded path-width First-order logic on graphs Automata

来源：评论

学校读者我要写书评

暂无评论

Formulating Data-arrival Synchronizers in integer linear programming for CGRA Mapping 58

Formulating Data-arrival Synchronizers in Integer Linear Pro...

引用

58th ACM/IEEE Design Automation Conference (DAC)

作者： Guo, Yijiang Wang, Jiarui Zhang, Jiaxi Luo, Guojie Peking Univ Ctr Energy Efficient Comp & Applicat Beijing Peoples R China Peng Cheng Lab Shenzhen Guangdong Peoples R China

ISBN: (纸本)9781665432740

Coarse-grained reconfigurable architecture (CGRA) is a promising programmable device with high performance and power efficiency. The CGRA compilation problem is to map an application onto a 3D time-space model of CGRA. Adding the circuitry of synchronizers can relax the mapping constraint for data alignment in time;and thus, it significantly influences the compilation performance. However, data-departure synchronizers may be infeasible, because an output value may be used multiple times and has a high fan-out. Instead, data-arrival synchronizers can further improve performance and mappability of CGRAs with acceptable overhead, compared to the synchronization methods based on detour routing, register files, and FIFO. In this work, we design two kinds of data-arrival synchronizers and formulate them in an integer linear programming (ILP) based mapping approach. The separate ILP formulations of placement and routing speed up the architecture exploration with synchronizers by up to 3.03x. The experimental study shows that data-arrival synchronizers improve CGRA performance by 19.8% on average. The results of our quantitative study show that synchronizers also improve the mapping success rate by 1.91x on average. In conclusion, CGRAs with appropriate synchronizers have better mappability while using fewer resources.

关键词： Performance evaluation Solid modeling Three-dimensional displays Design automation integer linear programming Routing Registers

来源：评论

学校读者我要写书评

暂无评论

Towards Coherent Single-Document Summarization: An integer linear programming-based Approach 18

Towards Coherent Single-Document Summarization: An Integer L...

引用

33rd Annual ACM Symposium on Applied Computing (ACM SAC)

作者： Garcia, Rodrigo Lima, Rinaldo Espinasse, Bernard Oliveira, Hilario Univ Fed Rural Pernambuco Recife PE Brazil Aix Marseille Univ LSIS UMR CNRS Marseille France Univ Fed Pernambuco Recife PE Brazil

ISBN: (纸本)9781450351911

Automatic Text Summarization (ATS) is a viable option to reduce the content of textual documents, e.g., as a possible preprocessing step in many text mining applications. Single-document extractive summarizers have been developed based on different approaches, but many of them have the drawback of producing summaries with low coherence among the selected sentences in the generated summaries. In this paper, we present an unsupervised summarization system as an attempt towards coherent extractive single-document summarization. This system relies on integer linear programming (ILP) as an optimization technique for selecting the smallest subset of sentences of a document maximizing the coverage of relevant concepts. Furthermore, our solution uses a graph-based algorithm for two goals: representing both sentences and concepts and enabling local coherence scoring among the sentences in the generated summaries. The proposed system is evaluated on two single-document benchmark datasets (DUC 2001-2002) using ROUGE measures, and compared with other state-of-the-art summarizers. The achieved results are very competitive.

关键词： Single-document Summarization Extractive Summarization Coherence Entity Graph integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Regression-based Approach using integer linear programming for Single-document Summarization 29

A Regression-based Approach using Integer Linear Programming...

引用

29th Annual IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Oliveira, Hilario Lins, Rafael Dueire Lima, Rinaldo Freitas, Fred Simske, Steven J. Univ Fed Pernambuco Informat Ctr Recife PE Brazil HP Labs Ft Collins CO 80528 USA

ISBN: (纸本)9781538638767

Most of the existing approaches for extractive single-document summarization of news articles rely on a single method to summarize all input documents. Recent work demonstrated that this is a significant limitation, since no summarization technique can achieve high performance for all input articles. In this context, this paper proposes a new regression-based approach using integer linear programming (ILP) for single-document summarization. The proposed solution relies on a concept-based ILP method to generate multiple candidate summaries for each input article exploring different concept weighting methods and representation forms. Afterward, a regression model enriched with several extracted features at summary, sentence and n-gram level is applied to select among the candidates the most informative summary based on an estimation of the traditional ROUGE-1 score. The investigated features are derived from indicators of content importance such as frequency, position, and coverage. Experiments conducted on the DUC 2001-2002 and CNN corpora show that the proposed method statistically outperforms other state-of-the-art extractive summarization approaches in most scenarios regarding ROUGE-1 and ROUGE-2 recall measures.

关键词： Feature extraction Task analysis Mathematical model Frequency measurement integer linear programming Optimization Coherence

来源：评论

学校读者我要写书评

暂无评论

Comparison of Some Cutting-Plane Methods for the integer linear programming Problem

引用

Computational Mathematics and Modeling 2015年第2期26卷 244-251页

作者： Shalbuzov, K.D. Moscow State University Moscow Russian Federation

The article proposes a modification of the Gomory cyclic algorithm for the integer linear programming problem. The proposed algorithm is numerically compared with the loop algorithm, the all-integer Gomory algorithm, and Martin’s algorithm with improved choice of the generating row. Comparisons are carried out by running time and by the number of added cutting planes. © 2015, Springer Science+Business Media New York.

关键词： all-integer Gomory algorithm Gomory cutting plane Gomory cyclic algorithms integer linear programming Martin’s algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：