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

integer linear programming models for the weighted total domination problem

APPLIED MATHEMATICS AND COMPUTATION 2019年 358卷 146-150页

作者： Ma, Yuede Cai, Qingqiong Yao, Shunyu Xian Technol Univ Sch Sci Xian 710021 Shanxi Peoples R China Nankai Univ Coll Comp Sci Tianjin 300350 Peoples R China Nankai Univ Ctr Combinator Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China

A total dominating set of a graph G = (V, E) is a subset D of V such that every vertex in V (including the vertices from D) has at least one neighbour in D. Suppose that every vertex v is an element of V has an integer weight w(v) >= 0 and every edge e is an element of E has an integer weight w(e) >= 0. Then the weighted total domination (WTD) problem is to find a total dominating set D which minimizes the cost f (D) := Sigma(u is an element of D )w(u) + Sigma(e is an element of E[D]) w(e) + Sigma(v is an element of V\D) min{w(uv) vertical bar u is an element of N(v) boolean AND D}. In this paper, we put forward three integer linear programming (ILP) models with a polynomial number of constraints, and present some numerical results implemented on random graphs for WTD problem. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Weighted total domination integer linear programming Combinatorial optimization Graph theory

来源：评论

学校读者我要写书评

暂无评论

integer linear programming for Influence Maximization

引用

IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY-TRANSACTIONS OF ELECTRICAL ENGINEERING 2019年第3期43卷 627-634页

作者： Baghbani, Farzaneh Ghayour Asadpour, Masoud Faili, Heshaam Univ Tehran Dept Elect & Comp Engn Tehran Iran

Influence Maximization is one of the important research topics in social networks which has many applications, e.g., in marketing, politics and social science. The goal of Influence Maximization is to select a limited number of vertices (called seed set) in a social graph, so that upon their direct activation, the maximum number of vertices is activated through social interaction of the seed set with the other vertices. Social interaction is modeled by diffusion models among which linear Threshold Model is one of the most popular ones. In linear Threshold Model, influence of nodes on each other is quantized by edge weights and nodes have a threshold for activation. If sum of the influence of activated neighbors of a node reaches a certain threshold, the node is activated. When thresholds are fixed, Influence Maximization reduces to Target Set Selection Problem. Ackerman et al. solved Target Set Selection Problem by integer linear programming. In this paper, we analyze their work and show that their method cannot properly solve the problem in specific situations, e.g., when graph has cycle. We fix this problem and propose a new method based on integer linear programming and show in the results that our method can handle graphs with cycles as well.

关键词： Influence Maximization linear Threshold Model Target Set Selection Problem integer linear programming

来源：评论

学校读者我要写书评

暂无评论

integer linear programming for optimizing the position of IEDs in Medium Voltage smart grids

Integer Linear Programming for optimizing the position of IE...

引用

IEEE International Instrumentation and Measurement Technology Conference (I2MTC)

作者： Sterle, Claudio Caragallo, Vincenzo Liccardo, Annalisa Masone, Adriano Fatica, Alessandro Bonavolonta, Francesco Univ Federico II Dept Elect Engn & Informat Technol Naples Italy E Distribuz SpA Operat & Maintenance Network Anal & Maintenance Naples Italy

ISBN: (纸本)9781728195391

The paper deals with an analytical method for solving the problem of optimal positioning of IEDs used as circuit breakers for isolating the fault in medium voltage grids. The use of IEDs allows to automatically select the faulty section by means of a logic selectivity approach on medium voltage grids with radial topology. The optimization of their position assures the maximum benefits granted by the set number of IEDs installed. Two different approaches to solve the problem are presented. The first one solves the problem through an exhaustive analysis of all possible scenarios. The second one exploits integer linear programming with the branch and bound technique. The latter, being an exact resolution technique, will provide, like the first approach, the exact solution to the problem, with notable advantages in terms of computational effort.

关键词： integer linear programming Branch and Bound IEDs optimal positioning logic selectivity

来源：评论

学校读者我要写书评

暂无评论

integer linear programming Reformulations for the linear Ordering Problem 5th

Integer Linear Programming Reformulations for the Linear Ord...

引用

4th International Conference on Optimization and Learning (OLA)

作者： Dupin, Nicolas Univ Angers LERIA SFR MATHSTIC F-49000 Angers France

ISBN: (纸本)9783031220388;9783031220395

This article studies the linear ordering problem, with applications in social choice theory and databases for biological datasets. integer linear programming (ILP) formulations are available for linear ordering and some extensions. ILP reformulations are proposed, showing relations with the Asymmetric Travel Salesman Problem. If a strictly tighter ILP formulation is found, numerical results justify the quality of the reference formulation for the problem in the Branch&Bound convergence. The quality of the continuous relaxation allows to design rounding heuristics, it offers perspectives to design matheuristics.

关键词： Optimization integer linear programming linear ordering Median of permutations Consensus ranking Polyhedral analysis

来源：评论

学校读者我要写书评

暂无评论

integer linear programming for Three-Subset Meet-in-the-Middle Attacks: Application to GIFT 13th

Integer Linear Programming for Three-Subset Meet-in-the-Midd...

引用

13th International Workshop on Security (IWSEC)

作者： Sasaki, Yu NTT Secure Platform Labs 3-9-11 Midori Cho Musashino Tokyo 1808585 Japan

ISBN: (纸本)9783319979168;9783319979151

This article presents a new usage of integer-linearprogramming (ILP) for block-cipher analysis, in particular for automating a procedure to search for optimal independent key bits used in a meet-in-the-middle (MitM) attack. The research is motivated by a recent lightweight block-cipher design GIFT, in which the evaluation by the designers has some room to be improved. The developed tool finds optimal choices of independent key bits, which improves the complexity of the 15-round MitM attack, the current best attack, on GIFT-64 from 2(120) to 2(112).

关键词： GIFT Block cipher Cryptanalysis Symmetric-key Meet-in-the-middle integer linear programming

来源：评论

学校读者我要写书评

暂无评论

integer linear programming for Speaker Diarization and Cross-Modal Identification in TV Broadcast

Integer Linear Programming for Speaker Diarization and Cross...

引用

14th Annual Conference of the International-Speech-Communication-Association (INTERSPEECH 2013)

作者： Bredin, Herve Poignant, Johann Univ Paris Sud CNRS LIMSI UPR 3251 Orsay France UJF Grenoble 1 UPMF Grenoble 2 Grenoble INP CNRSLIG UMR 5217 Grenoble France

ISBN: (纸本)9781629934433

Most state-of-the-art approaches address speaker diarization as a hierarchical agglomerative clustering problem in the audio domain. In this paper, we propose to revisit one of them: speech turns clustering based on the Bayesian Information Criterion (a.k.a. BIC clustering). First, we show how to model it as an integer linear programming (ILP) problem. Its resolution leads to the same overall diarization error rate as standard BIC clustering but generates significantly purer speaker clusters. Then, we describe how this approach can easily be extended to the audiovisual domain and TV broadcast in particular. The straightforward integration of detected overlaid names (used to introduce guests or journalists, and obtained via video OCR) into a multimodal ILP problem yields significantly better speaker diarization results. Finally, we explain how this novel paradigm can incidentally be used for unsupervised speaker identification (i.e. not relying on any prior acoustic speaker models). Experiments on the REPERE TV broadcast corpus show that it achieves performance close to that of an oracle capable of identifying any speaker as long as their name appears on screen at least once in the video.

关键词： speaker diarization integer linear programming speaker identification multimodal fusion optical character recognition

来源：评论

学校读者我要写书评

暂无评论

integer linear programming Based Design of Deadlock-Free Routing for Chiplet-Based Systems 37

Integer Linear Programming Based Design of Deadlock-Free Rou...

引用

37th IEEE International System-on-Chip Conference, SOCC 2024

作者： Liu, Shuang Radetzki, Martin University of Stuttgart Embedded Systems Institute of Computer Architecture and Computer Engineering Stuttgart Germany

ISBN: (纸本)9798350377569

Chiplet-based systems have become prominent in large Systems-on-Chips (SoCs) as a means to mitigate increasing design costs. However, the integration of multiple chiplets introduces new challenges in the interconnection network, potentially leading to deadlocks. In this paper, we propose an integer linear programming (ILP) based design approach to address this issue. Our method considers various design factors for deadlock-free routing, such as topology, latency, load balancing, path diversity, and fault tolerance, applicable to both general-purpose chiplets and application-specific chiplets. It facilitates the determination of optimal turn restrictions for general-purpose chiplets or constructs optimal deadlock-free routing paths for application-specific chiplets if the communication patterns are known. The results demonstrate the capability of the method to find optimal solutions under various design considerations. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Topology optimization of binary structures using integer linear programming

引用

FINITE ELEMENTS IN ANALYSIS AND DESIGN 2018年 139卷 49-61页

作者： Sivapuram, R. Picelli, R. Univ Calif San Diego Struct Engn La Jolla CA 92093 USA Cardiff Univ Cardiff Sch Engn Queens Bldg14-17 Parade Cardiff CF24 3AA S Glam Wales

This work proposes an improved method for gradient-based topology optimization in a discrete setting of design variables. The method combines the features of BESO developed by Huang and Xie [1] and the discrete topology optimization method of Svanberg and Werme [2] to improve the effectiveness of binary variable optimization. Herein the objective and constraint functions are sequentially linearized using Taylor's first order approximation, similarly as carried out in [2]. integer linear programming (ILP) is used to compute globally optimal solutions for these linear optimization problems, allowing the method to accommodate any type of constraints explicitly, without the need for any Lagrange multipliers or thresholds for sensitivities (like the modern BESO [1]), or heuristics (like the early ESO/BESO methods [3]). In the linearized problems, the constraint targets are relaxed so as to allow only small changes in topology during an update and to ensure the existence of feasible solutions for the ILP. This process of relaxing the constraints and updating the design variables by using ILP is repeated until convergence. The proposed method does not require any gradual refinement of mesh, unlike in [2] and the sensitivities every iteration are smoothened by using the mesh-independent BESO filter. Few examples of compliance minimization are shown to demonstrate that mathematical programming yields similar results as that of BESO for volume-constrained problems. Some examples of volume minimization subject to a compliance constraint are presented to demonstrate the effectiveness of the method in dealing with a non-volume constraint. Volume minimization with a compliance constraint in the case of design-dependent fluid pressure loading is also presented using the proposed method. An example is presented to show the effectiveness of the method in dealing with displacement constraints. The results signify that the method can be used for topology optimization problems involvin

关键词： Topology optimization integer linear programming Relaxation Filter Truncation error Compliance Displacement constraint

来源：评论

学校读者我要写书评

暂无评论

Diagnosing Multiple Byzantine Open-Segment Defects Using integer linear programming

引用

JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS 2011年第6期27卷 723-739页

作者： Kao, Chen-Yuan Liao, Chien-Hui Wen, Charles H. -P. Natl Chiao Tung Univ Dept Elect Engn Hsinchu Taiwan

Faulty behaviors of open-segment defects are non-deterministic due to the Byzantine effect induced by the physical circuit layout. It is the test pattern and difficult for traditional ATPGs to manifest the corresponding faulty effect. Therefore, we propose a three-stage diagnosis approach for finding multiple open-segment defects. Stage one applies path tracing to help extract candidate fault sites from error outputs of failing patterns. An ILP solver in stage two effectively enumerates all fault combinations when considering fault candidates and simulation responses simultaneously. During stage three, fault simulation with support of physical information is responsible for identifying true open-segment defects by pruning false cases. Experimental results show good resolutions (only 1.7X and 1.5X total numbers of segments on average under 1,000 random and 5-detect patterns, respectively) for all ISCAS'85 circuits with 2-5 randomly-injected open-segment defects.

关键词： Open defect Diagnosis Open segment Byzantine effect integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Efficient large-scale configuration via integer linear programming

引用

AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING 2013年第1期27卷 37-49页

作者： Feinerer, Ingo Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

Configuration of large-scale applications in an engineering context requires a modeling environment that allows the design engineer to draft the configuration problem in a natural way and efficient methods that can process the modeled setting and scale with the number of components. Existing configuration methods in artificial intelligence typically perform quite well in certain subareas but are hard to use for general-purpose modeling without mathematical or logics background (the so-called knowledge acquisition bottleneck) and/or have scalability issues. As a remedy to this important issue both in theory and in practical applications, we use a standard modeling environment like the Unified Modeling Language that has been proposed by the configuration community as a suitable object-oriented formalism for configuration problems. We provide a translation of key concepts of class diagrams to inequalities and identify relevant configuration aspects and show how they are treated as an integer linear program. Solving an integer linear program can be done efficiently, and integer linear programming scales well to large configurations consisting of several thousands components and interactions. We conduct an empirical study in the context of package management for operating systems and for the Linux kernel configuration. We evaluate our methodology by a benchmark and obtain convincing results in support for using integer linear programming for configuration applications of realistic size and complexity.

关键词： Configuration integer linear programming Linux Kernel Configuration Package Management Unified Modeling Language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：