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

An Exact Virtual Network Embedding Algorithm Based on integer linear programming for Virtual Network Request with Location Constraint

引用

China Communications 2016年第8期13卷 177-183页

作者： Zeheng Yang Yongan Guo School of Computer Science and Engineering University of Electronic Science and Technology of China(UESTC) College of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the *** exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link *** on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on integer linear programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate *** topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

关键词： network virtualization virtual network embedding exact VNE algorithm integer linear programming location constraint VNR acceptance ratio

来源：评论

学校读者我要写书评

暂无评论

Using integer linear programming to minimize the embodied CO2 emissions of the opaque part of a facade

引用

BUILDING AND ENVIRONMENT 2020年 177卷 106883-106883页

作者： Soler, David Salandin, Andrea Bevivino, Michele Univ Politecn Valencia Inst Univ Matemat Multidisciplinar Cami Vera S-N Valencia 46022 Spain Univ Politecn Valencia Ctr Tecnol Fis Cami Vera S-N Valencia 46022 Spain Via Fiume 6 I-39100 Bolzano Italy

Buildings are responsible for about 36% of the CO2 emissions in Europe but there is a significant potential to reduce these emissions. This paper deals with the embodied CO2 emissions of the opaque part of a facade, which include the life cycle of any material used in its construction: excavation, processing, construction, operation, maintenance, demolition and waste or recycling. With the aim of minimizing such embodied CO2 emissions, an integer linear programming problem is presented, in which CO2 emissions are minimized depending on other parameters involved in the construction of the facade, like the maximal thermal transmittance allowed by current legislation, thickness of the wall, budget, availability of materials for the different layers of the wall, etc. The paper also shows a case study based on a constructive solution for the opaque part of the envelope defined by up to six layers, with more than 1.1 million possible combinations. This case study considers seventy scenarios depending on maximal allowed thermal transmittances and thickness intervals for five different technologies applied to the structural element of the wall. Results show that an adequate selection of materials can reduce the embodied CO2 emissions of the opaque part of the envelope up to 78.5% for similar values of transmittance and thickness.

关键词： Embodied CO2 emissions Thermal transmittance Facade integer linear programming Minimization

来源：评论

学校读者我要写书评

暂无评论

Two-phase node deployment for target coverage in rechargeable WSNs using genetic algorithm and integer linear programming

引用

JOURNAL OF SUPERCOMPUTING 2021年第4期77卷 4172-4200页

作者： Zameni, Mahsa Rezaei, Aref Farzinvash, Leili Univ Tabriz Fac Elect & Comp Engn Tabriz Iran

Node deployment is a matter of considerable concern in designing wireless sensor networks (WSNs). This paper studies this issue in the context of rechargeable WSNs (RWSNs). We propose an efficient algorithm, namely node deployment for target coverage in RWSNs (NDTCR), which determines the number and positions of installed sensors in two phases. The first phase applies genetic algorithm to construct a mesh over a subset of positions. The mentioned mesh covers the targets and connects them to the sink. In the second phase of NDTCR, we propose an integer linear programming (ILP) model to install some sensors at each position of the mesh. The advantage of applying the first phase is that it prunes the solution space considerably. Therefore, the proposed ILP model can be solved in a reasonable time. The experimental results demonstrate that NDTCR requires 29% fewer sensors on average in comparison with the previous approaches.

关键词： Node deployment Energy harvesting Rechargeable sensor network Genetic algorithm integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Mixed integer linear programming and heuristic methods for feature selection in clustering

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2018年第9期69卷 1379-1395页

作者： Benati, Stefano Garcia, Sergio Puerto, Justo Univ Trento Sch Int Studies Trento Italy Univ Edinburgh Sch Math Edinburgh Midlothian Scotland Univ Seville IMUS Seville Spain

This paper studies the problem of selecting relevant features in clustering problems, out of a data-set in which many features are useless, or masking. The data-set comprises a set U of units, a set V of features, a set R of (tentative) cluster centres and distances d(ijk) for every i is an element of U, k is an element of R, j is an element of V. The feature selection problem consists of finding a subset of features Q subset of V such that the total sum of the distances from the units to the closest centre is minimised. This is a combinatorial optimisation problem that we show to be NP-complete, and we propose two mixed integer linear programming formulations to calculate the solution. Some computational experiments show that if clusters are well separated and the relevant features are easy to detect, then both formulations can solve problems with many integer variables. Conversely, if clusters overlap and relevant features are ambiguous, then even small problems are unsolved. To overcome this difficulty, we propose two heuristic methods to find that, most of the time, one of them, called q-vars, calculates the optimal solution quickly. Then, the q-vars heuristic is combined with the k-means algorithm to cluster some simulated data. We conclude that this approach outperforms other methods for clustering with variable selection that were proposed in the literature.

关键词： integer linear programming heuristics q-yars cluster analysis p-median problem

来源：评论

学校读者我要写书评

暂无评论

Analysis of Authorization Constraints via integer linear programming

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2023年第3期35卷 2258-2271页

作者： Yang, Benyuan Hu, Hesuan Xidian Univ Sch Electromech Engn Xian 710071 Shaanxi Peoples R China Nanyang Technol Univ Coll Engn Sch Comp Sci & Engn Singapore 639798 Singapore Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn Xian 710054 Shaanxi Peoples R China

This paper focuses on constraint verification and violation resolution for Petri nets (PNs) modeling of role-based access control (RBAC) policy. Checking the satisfiability of authorization constraints imposes a major challenge when the number of states of a target system is large. To overcome this difficulty, we provide three necessary and sufficient conditions to check three different constraints, namely Separation of Duties (SoDs), Binding of Duties (BoDs), and Constraints of Cardinality (CoCs). The proposed results are based on the solutions of integer linear programming problems (ILPs). By relying on an ILP formulation that does not require the explicit computation of the net reachability set, the proposed approach is particularly well suited for large-size PNs. When the given system does not satisfy a considered constraint, the objective is to propose a suitable violation resolution strategy to correctly enforce the given constraint. In this paper, enforcement of control places and administration of RBAC are presented to solve the SoD, BoD, and CoC violations. All violations can be corrected in a once for all manner while simultaneously ensuring the satisfaction of all other constraints. The comparison between our approach and the existing ones is given to illustrate the effectiveness and efficiency of ours.

关键词： Authorization Blacklisting Mathematical models Petri nets integer linear programming Optimization Monitoring Role-based access control authorization constraints integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Trip-Based integer linear programming Model for Static Multi-Car Elevator Operation Problems

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2017年第2期E100A卷 385-394页

作者： Inamoto, Tsutomu Higami, Yoshinobu Kobayashi, Shin-ya Ehime Univ Grad Sch Sci & Engn Matsuyama Ehime 7908577 Japan

In this paper, the authors propose an integer linear programming (ILP) model for static multi-car elevator operation problems. Here, "static" means that all information which make the behavior of the elevator system indeterministic is known before scheduling. The proposed model is based on the trip-based ILP model for static single-car elevator operation problems. A trip of an elevator is a one-directional movement of that elevator, which is labaled upward or downward. In the trip-based ILP model, an elevator trajectory is scheduled according to decision variables which determine allocations of trips to users of an elevator system. That model has such an advantage that the difficulty in solving ILP formulations resulted by that model does not depend on the length of the planning horizon nor the height of the considered building, thus is effective when elevator trajectories are simple. Moreover, that model has many variables relevant to elevators' positions. The proposed model is resulted by adding 3 constraints which are basically based on those variables and make it possible to prevent elevators in a same shaft from interfering. The first constraint simply imposes the first and last floors of an upper trip to be above those of its lower trip. The second constraint imagines the crossing point between upper and lower trips and imposes it ahead of or behind the lower trip according to their directions. The last constraint estimates future positions of elevators and imposes the upper trip to be above floors of passengers on the lower trip. The basic validity of the proposed model is displayed by solving 90 problem instances and examining elevator trajectories generated from them, then comparing objective function values of elevator trajectories on a multi-car elevator system with those on single-car elevator systems.

关键词： elevator operation problem multi-car elevator system integer linear programming interference prevention

来源：评论

学校读者我要写书评

暂无评论

Learning Bayesian network structure: Towards the essential graph by integer linear programming tools

引用

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING 2014年第4期55卷 1043-1071页

作者： Studeny, Milan Haws, David Inst Informat Theory & Automat ASCR Prague Czech Republic IBM TJ Watson Res Ctr Yorktown Hts NY 10598 USA

The basic idea of the geometric approach to learning a Bayesian network (BN) structure is to represent every BN structure by a certain vector. If the vector representative is chosen properly, it allows one to re-formulate the task of finding the global maximum of a score over BN structures as an integer linear programming (ILP) problem. Such a suitable zero-one vector representative is the characteristic imset, introduced by Student, Hemmecke and Lindner in 2010, in the proceedings of the 5th PGM workshop. In this paper, extensions of characteristic imsets are considered which additionally encode chain graphs without flags equivalent to acyclic directed graphs. The main contribution is a polyhedral description of the respective domain of the ILP problem, that is, by means of a set of linear inequalities. This theoretical result opens the way to the application of ILP software packages. The advantage of our approach is that, as a by-product of the ILP optimization procedure, one may get the essential graph, which is a traditional graphical BN representative. We also describe some computational experiments based on this idea. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Learning Bayesian network structure integer linear programming Characteristic imset Essential graph

来源：评论

学校读者我要写书评

暂无评论

On K-diagnosability of Petri nets via integer linear programming

引用

AUTOMATICA 2012年第9期48卷 2047-2058页

作者： Basile, F. Chiacchio, P. De Tommasi, G. Univ Salerno Dipartimento Ingn Elettron & Ingn Informat I-84100 Salerno Italy Univ Naples Federico II Dipartimento Informat & Sistemist Naples Italy Univ Salerno Dipartimento Ingn Informaz & Ingn Elettr I-84100 Salerno Italy Univ Salerno Dept Elect & Comp Engn I-84100 Salerno Italy

This paper deals with the problem of diagnosability of a fault after the firing of a finite number events (i.e., K-diagnosability). This problem corresponds to diagnosability of a fault within a finite delay in the context of discrete event systems. The main contribution of this paper is a necessary and sufficient condition for K-diagnosability of bounded nets. The proposed approach exploits the mathematical representation of Petri nets and the integer linear programming optimization tool. In particular no specific assumptions are made on the structure of the net induced by the unobservable transitions, since the proposed approach permits to detect also the undiagnosability due to the presence of unobservable cycles. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Diagnosability Discrete event systems Petri nets integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Acoustic event diarization in TV/movie audios using deep embedding and integer linear programming

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2019年第23期78卷 33999-34025页

作者： Li, Yanxiong Zhang, Yuhan Li, Xianku Liu, Mingle Wang, Wucheng Yang, Jichen South China Univ Technol Sch Elect & Informat Engn Room 223Shaw Sci Bldg381 Wushan Rd Guangzhou 510640 Guangdong Peoples R China

In this study, we propose a method for acoustic event diarization based on a feature of deep embedding and a clustering algorithm of integer linear programming. The deep embedding learned by deep auto-encoder network is used to represent the properties of different classes of acoustic events, and then the integer linear programming is adopted for merging audio segments belonging to the same class of acoustic events. Four kinds of TV/movie audios (21.5 h in total) are used as experimental data, including Sport, Situation comedy, Award ceremony, and Action movie. We compare the deep embedding with state-of-the-art features. Further, the clustering algorithm of integer linear programming is compared with other clustering algorithms adopted in previous works. Finally, the proposed method is compared to both supervised and unsupervised methods on four kinds of TV/movie audios. The results show that the proposed method is superior to other unsupervised methods based on agglomerative information bottleneck, Bayesian information criterion and spectral clustering, and is little inferior to the supervised method based on deep neural network in terms of acoustic event error.

关键词： Deep embedding integer linear programming acoustic event detection audio content analysis

来源：评论

学校读者我要写书评

暂无评论

An integer linear programming approach for pavement maintenance and rehabilitation optimization

引用

INTERNATIONAL JOURNAL OF PAVEMENT ENGINEERING 2022年第8期23卷 2710-2727页

作者： Gomes Correia, Matheus Bonates, Tiberius de Oliveira e Prata, Bruno de Athayde Nobre Junior, Ernesto Ferreira Univ Fed Ceara Dept Transportat Engn Fortaleza Ceara Brazil Univ Fed Ceara Dept Stat & Appl Math Fortaleza Ceara Brazil Univ Fed Ceara Dept Ind Engn Fortaleza Ceara Brazil

A highway in poor conditions can raise transportation costs. Due to budgetary constraints, pavement maintenance programming is considered a difficult decision-making problem. In this article we propose a novel mathematical model and a different variant of the pavement maintenance management problem, solved with integer linear programming. The novelty of this approach is the use of the Pavement Surface Rating as the condition indicator, along with a proposed conversion strategy between most used performance indices. Additionally, we propose a simpler and broader deterioration model, when compared to existent ones, using a table system. This renders the model to be solved easily, allowing it to be implemented worldwide, given its generic characteristics. Many computational experiments were performed, both on artificial benchmark instances and on a real-world case study. The proposed model is shown to obtain optimal solutions in short computational times, and it is able to solve much larger instances than the ones found in the literature. Optimal solutions from benchmark instances, consisting of 5,000 segments and an analysis period of 30 years, were found in less than 45 minutes. Additionally, the optimal solutions have a difference of more than 20% in average, when compared to a greedy algorithm.

关键词： Pavement management integer linear programming network-level maintenance optimization model pavement maintenance and rehabilitation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：