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

Lossless re-coding using integer linear programming for H.264/MPEG-4 AVC

IET IMAGE PROCESSING 2010年第1期4卷 49-60页

作者： Dong, P. Y. Lin, T. Tongji Univ VLSI Inst Shanghai 200092 Peoples R China

This study addresses the multi-generation distortion (re-loss) issue of intra-coding, which is introduced by the irreversible operation of current clip operation. In order to implement the lossless re-coding in intra-coding in modified H.264/AVC, this study first proposes a novel optimal clipping algorithm based on integer linear programming (ILP) to eliminate the re-loss caused by traditional saturation clipping. Furthermore, a new cost function of intra-prediction guarantees the prediction mode of successive coding generations to be the same as that of the first generation. Experimental results show that the ILP-based intra-coding method completely eliminates the video degradation occurred in the second and later generations of encoding/decoding and achieves superior performance in comparison with current intra-coding method in H.264.

关键词： intracoding linear programming Optimisation techniques lossless recoding coding generation integer programming Image and video coding multigeneration distortion intraprediction H.264/MPEG-4 AVC saturation clipping video degradation video coding integer linear programming decoding Video signal processing encoding prediction mode cost function optimal clipping

来源：评论

学校读者我要写书评

暂无评论

A symbiosis between population based incremental learning and LP-relaxation based parallel genetic algorithm for solving integer linear programming models

引用

COMPUTING 2023年第5期105卷 1121-1139页

作者： Fallah, Mohammad K. Fazlali, Mahmood Daneshtalab, Masoud GC Shahid Beheshti Univ Fac Math Sci Dept Data & Comp Sci Tehran Iran Malardalen Univ Intelligent Future Technol Vasteras Sweden

Solving integer linear programming (ILP) models generally lies in the category of NP-hard problems and finding the optimal answer for large models is a computational challenge. Genetic algorithms are a family of metaheuristic algorithms capable of adjusting and redesigning parameters and operations according to the characteristics of ILP models. On the other hand, still the genetic algorithm performs a lot of operations to solve large models, and parallel processing is a suitable technique to tackle this problem. This paper introduces an LP-Relaxation based parallel genetic algorithm that uses a population-based incremental learning technique to presents an expandable solver for large ILP models derived from a behavioral synthesis of digital circuits. In the proposed algorithm, each chromosome provides a state subspace of possible solutions, and each generation is produced based on a probability vector as well as elitism. Our experiments verify the efficiency of the proposed algorithm on multicore platforms, as it outperformed four previous genetic algorithms for solving mixed integer programming problems. The proposed genetic algorithm solved 20 ILP models include up to 5183 int / binary decision variables in less than 20 min using four 16-core AMD Opteron 6386 SE processors. Also, the results indicate that for models with more than 4000 variables, the speedup and the efficiency of the proposed parallel genetic algorithm on 60 CPU cores is more than 18X and 30%, respectively.

关键词： integer linear programming LP-relaxation Genetic algorithm Incremental learning

来源：评论

学校读者我要写书评

暂无评论

Stopping Set Elimination by Parity-Check Matrix Extension via integer linear programming

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2015年第5期63卷 1533-1540页

作者： Falsafain, Hossein Mousavi, Sayyed Rasoul Isfahan Univ Technol Dept Elect & Comp Engn Esfahan *** Iran Inst Res Fundamental Sci IPM Sch Comp Sci Tehran *** Iran

Error-rate floor phenomenon is known to be a serious impediment to the use of low-density parity-check (LDPC) codes for some practical applications that demand high data reliability. In the case of binary erasure channels (BECs), certain error-prone patterns, known as stopping sets, are proven to cause this performance degradation. A possible approach to diminish this drawback over BECs is to eliminate stopping sets by parity-check matrix extension. Given a parity-check matrix H, and a list L of its stopping sets, we present an integer linear programming (ILP) formulation to find a parity-check equation which eliminates the maximum number of stopping sets in L. One of the distinguishing advantages of the proposed scheme is its flexibility for modifications such as: limiting the weight of the new parity-check row, making the new row redundant or linearly independent, 4-cycle avoidance, and taking into account the sizes of stopping sets. Armed with these adjustments, the method can provide good performance improvements, as evidenced by simulation results. Furthermore, for a given rho is an element of N, by extending the basic formulation, we provide an ILP formulation for finding a set of size rho of parity-check equations which can best eliminate the stopping sets in L, among all such sets.

关键词： Binary erasure channel error floor integer linear programming LDPC code stopping set

来源：评论

学校读者我要写书评

暂无评论

An integer linear programming model to support customer-driven material planning in synchronised, multi-tier supply chains

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年第14期52卷 4267-4278页

作者： Mula, Josefa Lyons, Andrew C. Hernandez, Jorge E. Poler, Raul Univ Politecn Valencia Res Ctr Prod Management & Engn CIGIP Alcoy Spain Univ Liverpool Management Sch Liverpool L69 3BX Merseyside England

This paper describes an integer linear programming model conceived as an alternative to a traditional material requirements planning (MRP) system for extending the concept of supply chain synchronisation upstream in a multi-tier supply chain. In this model, we assume there is an incumbent application for transmitting original equipment manufacturer (OEM) requirements to first-, second- and third-tier suppliers. The proposed model is regarded as being embedded within a web-enabled, multi-tier, supply chain information system that provides the application for transmitting the production requirements. The principal motivation for having second-and third-tier suppliers that are synchronised with OEM and first-tier activity is the significant inventory, lead time and responsiveness gains that can potentially be achieved. Here, inventory is considered as a whole across a supply chain, and stock-outs are prohibited for the first-tier supplier. For illustration purposes, an example based on a real, automotive case study is provided. The model results proved better in terms of inventory and bullwhip reduction than those found in a previous simulation-based approach. Also, a comparison of the proposed case results with those of a conventional MRP application is provided.

关键词： MRP supply chain management integer linear programming sequenced and synchronised suppliers automotive sector

来源：评论

学校读者我要写书评

暂无评论

A novel algorithm for privacy preserving utility mining based on integer linear programming

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2019年 81卷 300-312页

作者： Li, Shaoxin Mu, Nankun Le, Junqing Liao, Xiaofeng Chongqing Univ Coll Comp Chongqing 400044 Peoples R China

As an important research topic, high-utility itemset mining (HUIM) has, of late years, attracted increasing attention, where both the significance and quantity factors of items are taken into account to mine high-utility itemsets (HUIs). Privacy breaches have always been a major issue existing in the field of data mining, which usually inevitably arise, especially when private data collections are publicly published or shared by organizations. To tackle this problem, plentiful methodologies regarding privacy-preserving data mining (PPDM) have been proposed. Due to the high practicality of HUIM, in recent years, privacy-preserving utility mining (PPUM) has become a popular research orientation in PPDM. The main goal of PPUM is to hide sensitive HUIs ( SHUIs) so as to leave no confidential information uncovered in the resulting sanitized database. However, all the previously proposed approaches have suffered from the defect of introducing numerous side effects by performing database perturbation. To alleviate this issue, in this paper, a novel algorithm based on integer linear programming (ILP) is proposed to obtain a lower ratio of side effects produced in the hiding process while does not reveal any sensitive information in the sanitized database. We formulate the hiding process as a constraint satisfaction problem (CSP), which pursuing the protection of SHUIs as well as the minimization of side effects. A solution to the hiding problem is expected to be obtained by exploiting ILP technique to solve the mapped problem, which properly indicates the processing manner of perturbation operation. In addition, a relaxation procedure is also adopted in the designed algorithm to provide an approximate solution of the CSP when the optimal one does not exist. Extensive experimental evaluations between our proposed method and other stateof-the-art algorithms are conducted on several real-world datasets. The comparative results demonstrate the superiorities of the proposed algo

关键词： Privacy preserving High-utility itemset mining Constraint satisfaction problem integer linear programming Minimum side effects

来源：评论

学校读者我要写书评

暂无评论

An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2008年第3期191卷 1004-1022页

作者： Prandtstetter, Matthias Raidl, Guenther R. Vienna Univ Technol Inst Comp Graph & Algorithms A-1040 Vienna Austria

In this paper we present two major approaches to solve the car sequencing problem, in which the goal is to find an optimal arrangement of commissioned vehicles along a production line with respect to constraints of the form "no more than 1, cars are allowed to require a component c in any subsequence of m(c) consecutive cars". The first method is an exact one based on integer linear programming (ILP). The second approach is hybrid: it uses ILP techniques within a general variable neighborhood search (VNS) framework for examining large neighborhoods. We tested the two methods on benchmark instances provided by CSPLIB and the automobile manufacturer RENAULT for the ROADEF Challenge 2005. These tests reveal that our approaches are competitive to previous reported algorithms. For the CSPLIB instances we were able to shorten the required computation time for reaching and proving optimality. Furthermore, we were able to obtain tight bounds on some of the ROADEF instances. For two of these instances the proposed ILP-method could provide new optimality proofs for already known solutions. For the VNS, the individual contributions of the used neighborhoods are also experimentally analyzed. Results highlight the significant impact of each structure. In particular the large ones examined using ILP techniques enhance the overall performance significantly, so that the hybrid approach clearly outperforms variants including only commonly defined neighborhoods. Crown Copyright (C) 2007 Published by Elsevier B.V. All rights reserved.

关键词： car sequencing problem integer linear programming variable neighborhood search hybrid meta-heuristics

来源：评论

学校读者我要写书评

暂无评论

SUTIL - Network selection based on utility function and integer linear programming

引用

COMPUTER NETWORKS 2010年第13期54卷 2117-2136页

作者： Pirmez, Luci Carvalho, Jaime C., Jr. Delicato, Flavia C. Protti, Fabio Carmo, Luiz F. R. C. Pires, Paulo F. Pirmez, Marcos Univ Fed Rio de Janeiro NCE IM BR-20001970 Rio De Janeiro Brazil Univ Fed Rio Grande do Norte DIMAp BR-59072970 Natal RN Brazil Inmetro BR-25250020 Duque De Caxias RJ Brazil

This work presents SUTIL, a mechanism for network selection in the context of next generation networks (NGN). SUTIL selection mechanism prioritizes networks with higher relevance to the application and lower energy consumption and it enables full and seamless connectivity to mobile user devices and applications. Consequently, SUTIL contributes to realize the vision of ubiquitous computing, in which services, devices, and sensor-enriched environments interact anytime, anywhere to accomplish human designed tasks. The provided solution is based on utility function and integer linear programming and it aims at: (i) maximizing the user satisfaction while meeting application QoS and (ii) minimizing the energy consumption of devices when connecting to a target network. The solution is global since it considers for a given base station all devices that are simultaneously candidate for handoff. Simulation results showed the benefits of SUTIL usage in NGN environments. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Wireless networks Mobility management Network selection Seamless connectivity Utility function integer linear programming

来源：评论

学校读者我要写书评

暂无评论

SENSITIVITY THEOREMS IN integer linear-programming

引用

MATHEMATICAL programming 1986年第3期34卷 251-264页

作者： COOK, W GERARDS, AMH SCHRIJVER, A TARDOS, E TILBURG UNIV DEPT ECONOMETR5000 LE TILBURGNETHERLANDS MATH CENTRUM 1098 SJ AMSTERDAMNETHERLANDS

We consider integer linear programming problems with a fixed coefficient matrix and varying objective function and right-hand-side vector. Among our results, we show that, for any optimal solution to a linear program max{wx: Ax≤b}, the distance to the nearest optimal solution to the corresponding integer program is at most the dimension of the problem multiplied by the largest subdeterminant of the integral matrixA. Using this, we strengthen several integer programming ‘proximity’ results of Blair and Jeroslow; Graver; and Wolsey. We also show that the Chvátal rank of a polyhedron {x: Ax≤b} can be bounded above by a function of the matrixA, independent of the vectorb, a result which, as Blair observed, is equivalent to Blair and Jeroslow's theorem that ‘each integer programming value function is a Gomory function.’

关键词： integer linear programming Chvátal Rank Cutting Planes Sensitivity Analysis

来源：评论

学校读者我要写书评

暂无评论

Computation of optimal break point set of relays-an integer linear programming approach

引用

IEEE TRANSACTIONS ON POWER DELIVERY 2007年第4期22卷 2087-2098页

作者： Gajbhiye, Rajeev Kumar De, Anindya Soman, S. A. Indian Inst Technol Bombay 400076 Maharashtra India Indian Inst Technol Kanpur 208016 Uttar Pradesh India

We propose an integer linear programming (ILP) formulation for the minimum relay break point set (BPS) computation. Subsequently, in the ILP framework, we propose an alternate maximum-independent relay BPS formulation with the intention of minimizing dependency within the BPS. We show that 1) in practice, the relaxed version of the ILP suffices to obtain an integral vertex and 2) the relaxed version of the ILP can be efficiently solved by the dual-simplex method. The performance of the proposed algorithm is compared and contrasted with existing algorithms. Case studies on various test systems show the efficacy of the proposed approach.

关键词： greedy algorithms integer linear programming minimum break point set (MBPS) NP-complete problem

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation in Cloud Computing Environments Based on integer linear programming

引用

COMPUTER JOURNAL 2015年第2期58卷 300-314页

作者： Rezvani, Mostafa Akbari, Mohammad Kazem Javadi, Bahman Amirkabir Univ Technol Dept Comp Engn & Informat Technol Tehran Iran Univ Western Sydney Sch Comp Engn & Math Sydney NSW Australia

Resource allocation is one of the main influential factors to provide efficient and economical processing of resources in the infrastructure as a service Clouds. While there are many challenges in providing an efficient resource allocator, maximizing the utilization of physical resources is of great importance. There are several works focused on optimizing the selection of virtual machines (VMs) for migration, however, there is less attention on the placement of the selected VMs on the available physical machines, especially for the advanced reservation request model. In this paper, the placement method and the impacts of different parameters are studied. First, different states of the problem are classified. Then, an algorithm based on integer linear programming (ILP) is proposed to solve some common cases of the problem. Finally, the algorithm is implemented in a Haizea simulator and the results are compared with the Haizea greedy algorithm and some other heuristics. The results reveal that the Haizea greedy algorithm is not able to utilize around 40% of the physical resources. Moreover, at low heterogeneity loads, the proposed ILP-based algorithm shows the same results as a Best-Fit algorithm, but at higher heterogeneity loads, the results of the proposed algorithm outperform other algorithms.

关键词： scheduling resource allocation cloud computing IaaS advanced reservation integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：