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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Data aggregation in Wireless Sensor Network: An integer linear programming formulation for energy optimization

Data aggregation in Wireless Sensor Network: An integer line...

引用

IFIP International Conference on Wireless and Optical Communications Networks (WOCN)

作者： Raman Choudharyl Sujeet Kumar Akshay Deepak Dinesh Dash National Institute of Technology Patna Patna Bihar IN Department of Computer science and Engineering National Institute of Technology Patna

ISBN: (纸本)9781467389761

Wireless Sensor Network is huge number of sensor nodes disposed randomly in severe field to gather data. It monitors physical phenominan changes such as temperature, pressure, humidity, solar radiation, ambident light extra. Sensor nodes are small in size, having less energy, less communication power, less cost and multi functional nodes. This paper we firstly discuss about different types types of network, protocols extra i.e Network such as Direct network, hierarchical network etc and protocols like LEACH, PEGASIS. Next in this paper we deployed sensor nodes randomly in the grid network, We focus on data aggregation in different type of situation known as critical zone, in critical zone(critical grid) senor nodes are heavily loaded with information. Our objective is to maximize the data generation rate of sensor nodes. To got this objective we form different integer linear programming formulation. A optimization tool such as CPLEX IBM ILOG used for optimization and to show critical grids aggregation used MATLAB.

关键词： Protocols linear programming Wireless sensor networks integer linear programming Optimization Monitoring

来源：评论

学校读者我要写书评

暂无评论

A Concept-Based integer linear programming Approach for Single-Document Summarization

A Concept-Based Integer Linear Programming Approach for Sing...

引用

Brazilian Conference on Intelligent Systems (BRACIS)

作者： Hilário Oliveira Rinaldo Lima Rafael Dueire Lins Fred Freitas Marcelo Riss Steven J. Simske Informatics Center - UFPE Recife Brazil HP Brazil R&D Porto Alegre Brazil HP Labs Fort Collins CO USA

ISBN: (纸本)9781509035670

Automatic single-document summarization is a process that receives a single input document and outputs a condensed version with only the most relevant information. This paper proposes an unsupervised concept-based approach for single-document summarization using integer linear programming (ILP). Such an approach maximizes the coverage of the important concepts in the summary, avoiding redundancy, and taking into consideration some readability aspects of the generated summary as well. A new weighting method that combines both coverage and position of the sentences is proposed to estimate the importance of a concept. Moreover, a weighted distribution strategy that prioritizes sentences at the beginning of the document if they have relevant concepts is investigated. The readability of the generated summaries is improved by the inclusion of constraints into the ILP model to avoid dangling coreferences and breaks in the normal discourse flow of the document. Experimental results on the DUC 2001-2002 and the CNN corpora demonstrated that the proposed approach is competitive with state-of-the-art summarizers evaluated regarding the traditional ROUGE scores.

关键词： Mathematical model Coherence Optimization integer linear programming Computational modeling Natural language processing Analytical models

来源：评论

学校读者我要写书评

暂无评论

Accelerating phase unwrapping based on integer linear programming by processing of subgraphs

Accelerating phase unwrapping based on integer linear progra...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Markus Even Fraunhofer Institute of Optronics System Technologies and Image Exploitation Ettlingen Germany

Unwrapping is a crucial step when analyzing ground displacements with InSAR techniques. Formulations of unwrapping as integer linear programming (ILP) problem suitable for PSInSAR were given by Costantini et al. under the name redundant integration of finite differences and by Shanker et al. under the name edge list algorithm. They allow the treatment of “4D”-graphs, in the sense of making use of the redundancy both in the PS-net and temporal graph, in a consistent way. This important advantage is paid for by a high computational load, which for large graphs even might prevent the algorithm from finishing in an acceptable time. The approach presented in this paper suggests subdividing the graph into spatio-temporal regions, thereby maintaining the advantage of redundancy, and solving the corresponding ILPs. This results in a considerable acceleration. Besides explaining our approach we report on results obtained for simulated and real data.

关键词： Acceleration Redundancy integer linear programming Finite difference methods Algorithm design and analysis Joining processes Market research

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Phasor Measurement Unit Placement in Electric Power Networks: integer linear programming Formulation

引用

ELECTRIC POWER COMPONENTS AND SYSTEMS 2015年第17期43卷 1902-1911页

作者： Aghaei, Jamshid Baharvandi, Amir Akbari, Mohammad-Amin Muttaqi, Kashem M. Asban, Mohammad-Reza Heidari, Alireza Shiraz Univ Technol Dept Elect & Elect Engn Shiraz *** Iran Univ Wollongong Australian Power Qual & Reliabil Ctr Sch Elect Comp & Telecommun Engn Wollongong NSW Australia Univ New S Wales Australian Energy Res Inst Sydney NSW Australia Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW Australia

A multi-objective optimal phasor measurement unit placement model using integer linear programming is presented in this article. The proposed model simultaneously optimizes two objectives, i.e., minimization of phasor measurement unit numbers and maximization of measurement redundancy. To calculate the redundancy criteria, the single-line outage and the phasor measurement unit loss are considered simultaneously. A linear formulation is presented for both objective functions. Also herein, to address conflicting attributes and identify Pareto optimal solutions of the multi-objective optimal phasor measurement unit placement problem, a new multi-objective mathematical programming method is proposed. Finally, a new index, i.e., minimum distance to utopia point, is implemented to select the most preferred solution among the available Pareto front based options on the goal to achieve judicious decision makers. Two test systems, i.e., a modified 9-bus and an IEEE 118-bus test systems, are used to illustrate the effectiveness of the proposed framework.

关键词： phasor measurement unit integer linear programming phasor measurement unit placement redundancy observability analysis multi-objective mathematical programming line outage Pareto solution optimization state estimation

来源：评论

学校读者我要写书评

暂无评论

Quasi-dynamic Load and Battery Sizing and Scheduling for Stand-Alone Solar System Using Mixed-integer linear programming

Quasi-dynamic Load and Battery Sizing and Scheduling for Sta...

引用

IEEE Multi-Conference on Systems and Control

作者： Abdulelah H. Habib Vahid R. Disfani Jan Kleissl Raymond A. de Callafon Department of Mechanical and Aerospace Engineering University of California

ISBN: (纸本)9781509007561

Considering the intermittency of renewable energy systems, a sizing and scheduling model is proposed for a finite number of static electric loads. The model objective is to maximize solar energy utilization with and without storage. For the application of optimal load size selection, the energy production of a solar photovoltaic is assumed to be consumed by a finite number of discrete loads in an off-grid system using mixed-integer linear programming. Additional constraints are battery charge and discharge limitations and minimum uptime and downtime for each unit. For a certain solar power profile the model outputs optimal unit size as well as the optimal scheduling for both units and battery charge and discharge (if applicable). The impact of different solar power profiles and minimum up and down time constraints on the optimal unit and battery sizes are studied. The battery size required to achieve full solar energy utilization decreases with the number of units and with increased flexibility of the units (shorter on and off-time). A novel formulation is introduced to model quasi-dynamic units that gradually start and stop and the quasi-dynamic units increase solar energy utilization. The model can also be applied to search for the optimal number of units for a given cost function.

关键词： BATTERY CHARGING energy utilisation Solar System integer linear programming Cost functions Batteries SIZING Solar Energy scheduling model Solar PV Optimal scheduling downtime Solar power Time constraints intermittency

来源：评论

学校读者我要写书评

暂无评论

Mixed-integer linear programming for Multibeam Satellite Systems Design: Application to the Beam Layout Optimization

Mixed-Integer Linear Programming for Multibeam Satellite Sys...

引用

Annual IEEE International Systems Conference

作者： Jean-Thomas Camino Christian Artigues Laurent Houssin Stephane Mourgues Airbus Defence and Space Space Systems Telecommunication Systems Department CNRS LAAS

ISBN: (纸本)9781467395205

In a society where the demand for multimedia applications and data exchange is experiencing an unstoppable growth, multibeam systems have proven to be one of the most relevant solutions for satellite-based communication systems. Though already well represented among the geostationary satellites today, there are still several unresolved design optimization challenges for these complex systems that could lead to improved performances and to better system costs. The satellite platform, the repeater, and the antennas are examples of subsystems that should be designed jointly in order to reach an optimized technical solution that fulfills the service requirements. Traditionally, such complex tasks are addressed through a decomposition of the overall system design into a sequence of smaller decision problems. In this article, we propose to rely on operations research techniques to, on the one hand, take into account explicitly the interdependencies of these decomposed problems, and on the other hand, to handle the own constraints of each subsystem and their interactions. In this paper, the focus is laid on the optimization of the beam layouts of the multibeam satellites. Indeed, in addition to being a perfect example of the aforementioned importance of dealing with subsystem constraints, this problem appears early in the chain of design of a multibeam satellite system and is therefore critical for the quality of the telecommunication system;the weaknesses of a beam layout cannot be made up for later on in the system design. For this crucial optimization phase, the strength of the methodology we propose in this paper is to use mixed-integer linear programming to incorporate explicitly technological feasibility constraints of the subsystems involved, while preparing at best the subsequent design problems. Most importantly, our approach allows to overcome several resisting flaws of the already existing algorithms.

关键词： Satellite Telecommunications Systems Design Mixed-integer linear programming Operations Research Operations Research SUB-SYSTEM System design Mixed integer linear programming Satellite communication systems engineering Satellite systems layouts Telecommunication systems Satellite platforms integer linear programming Beams and girders

来源：评论

学校读者我要写书评

暂无评论

Solving odd even sudoku puzzles by binary integer linear programming

Solving odd even sudoku puzzles by binary integer linear pro...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Hui Yu Yuchao Tang Chunxiang Zong School of Information Engineering Nanchang University Nanchang P.R. China Numerical Simulation and High-Performance Computing Laboratory Nanchang University Nanchang P.R. China Department of Mathematics Nanchang University Nanchang P.R. China

ISBN: (纸本)9781509040940

Solving sudoku is a very challenging problem. It is not only a logic problem, but also can be seen as a mathematic problem. In this paper, we develop a binary integer linear programming (BILP) model for solving Odd/Even sudoku puzzles. Consequently, we solve the BILP model by using the optimization toolbox of MATLAB software. The performance of the proposed model was tested under different difficulty levels of Odd/Even sudoku puzzles. Numerical results show that it can successfully solve the Odd/Even sudoku puzzles in a quick time.

关键词： Mathematical model integer linear programming Optimization Numerical models MATLAB

来源：评论

学校读者我要写书评

暂无评论

Estimating the strength of poker hands by integer linear programming techniques

引用

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2015年第3期23卷 625-640页

作者： Dalpasso, Marcello Lancia, Giuseppe Univ Padua Dipartimento Ingn Informaz I-35131 Padua Italy Univ Udine Dipartimento Informat & Matemat I-33100 Udine Italy

We illustrate how integer linear programming techniques can be applied to the popular game of poker Texas Hold'em in order to evaluate the strength of a hand. In particular, we give models aimed at (1) minimizing the number of features that a player should look at when estimating his winning probability (called his equity), (2) giving weights to such features so that the equity is approximated by the weighted sum of the selected features. We show that ten features or less are enough to estimate the equity of a hand with high precision.

关键词： Poker Texas Hold'em integer linear programming Equity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：