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

A programming model and foundation for lineage-based distributed computation

JOURNAL OF FUNCTIONAL programming 2018年 28卷 e7-e7页

作者： Haller, Philipp Miller, Heather Mueller, Normen KTH Royal Inst Technol Sch Elect Engn & Comp Sci SE-10044 Stockholm Sweden Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA Safeplace DE-40667 Meerbusch Germany

The most successful systems for "big data" processing have all adopted functional APIs. We present a new programming model, we call function passing, designed to provide a more principled substrate, or middleware, upon which to build data-centric distributed systems like Spark. A key idea is to build up a persistent functional data structure representing transformations on distributed immutable data by passing well-typed serializable functions over the wire and applying them to this distributed data. Thus, the function passing model can be thought of as a persistent functional data structure that is distributed, where transformations performed on distributed data are stored in its nodes rather than the distributed data itself. One advantage of this model is that failure recovery is simplified by design - data can be recovered by replaying function applications atop immutable data loaded from stable storage. Deferred evaluation is also central to our model;by incorporating deferred evaluation into our design only at the point of initiating network communication, the function passing model remains easy to reason about while remaining efficient in time and memory. Moreover, we provide a complete formalization of the programming model in order to study the foundations of lineage-based distributed computation. In particular, we develop a theory of safe, mobile lineages based on a subject reduction theorem for a typed core language. Furthermore, we formalize a progress theorem that guarantees the finite materialization of remote, lineage-based data. Thus, the formal model may serve as a basis for further developments of the theory of data-centric distributed programming, including aspects such as fault tolerance. We provide an open-source implementation of our model in and for the Scala programming language, along with a case study of several example frameworks and end-user programs written atop this model.

关键词： open source Distribute Fault tolerance descent programming integer programming models linear programming models Data structures failure recovery Middleware

来源：评论

学校读者我要写书评

暂无评论

models for the two-dimensional rectangular single large placement problem with guillotine cuts and constrained pattern

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2020年第2期27卷 767-793页

作者： Martin, Mateus Birgin, Ernesto G. Lobato, Rafael D. Morabito, Reinaldo Munari, Pedro Univ Fed Sao Carlos Dept Prod Engn Via Washington Luiz Km 235 BR-13565905 Sao Carlos SP Brazil Univ Sao Paulo Dept Comp Sci Sao Paulo Brazil

In this paper, we address the constrained two-dimensional rectangular guillotine single large placement problem (2D_R_CG_SLOPP). This problem involves cutting a rectangular object to produce smaller rectangular items from orthogonal guillotine cuts. In addition, there is an upper limit on the number of copies that can be produced of each item type. To model this problem, we propose a new pseudopolynomial integer nonlinear programming (INLP) formulation and obtain an equivalent integer linear programming (ILP) formulation from it. Additionally, we developed a procedure to reduce the numbers of variables and constraints of the integer linear programming (ILP) formulation, without loss of optimality. From the ILP formulation, we derive two new pseudopolynomial models for particular cases of the 2D_R_CG_SLOPP, which consider only two-staged or one-group patterns. Finally, as a specific solution method for the 2D_R_CG_SLOPP, we apply Benders decomposition to the proposed ILP formulation and develop a branch-and-Benders-cut algorithm. All proposed approaches are evaluated through computational experiments using benchmark instances and compared with other formulations available in the literature. The results show that the new formulations are appropriate in scenarios characterized by few item types that are large with respect to the object's dimensions.

关键词： cutting and packing problems constrained two-dimensional guillotine cuts integer programming models branch-and-Benders-cut algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheduling the Italian football league: an ILP-based approach

引用

COMPUTERS & OPERATIONS RESEARCH 2006年第7期33卷 1963-1974页

作者： Della Croce, F Oliveri, D Politecn Turin DAI Turin Italy

Scheduling the Italian Major Football League (the so-called "Serie A") consists in finding for that league a double round robin tournament schedule that takes into account both typical requirements such as conditions on home-away matches and specific requests of the Italian Football Association such as twin-schedules for teams belonging to the same home-town. In this paper, we present a solution procedure able to derive feasible schedules that are also balanced with respect to additional cable televisions requirements. This procedure adapts the recent approach by Nemhauser and Trick to schedule a College Basketball Conference that considers however only half of the teams involved here. The proposed procedure is divided into three phases: phase I generates a pattern set respecting the cable televisions requirements and several other constraints;phase 2 produces a feasible round robin schedule compatible with the above pattern set;finally, phase 3 generates the actual calendar assigning the teams to the patterns. The procedure allows to generate within short time several different reasonable calendars satisfying the cable television companies requirements and satisfying various other operational constraints while minimizing the total number of violations on the home-away matches conditions. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： sports scheduling round robin tournaments integer programming models

来源：评论

学校读者我要写书评

暂无评论

A Coordinated Routing Model with Optimized Velocity for Train Scheduling on a Single-Track Railway Line

引用

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2015年第1期30卷 3-22页

作者： Yang, Lixing Li, Shukai Gao, Yuan Gao, Ziyou Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Beijing Jiaotong Univ Beijing Lab Urban Rail Transit Beijing 100044 Peoples R China

Train scheduling aims to seek a set of space-time paths for multiple trains on a railway line such that resources can be utilized efficiently with respect to prespecified criteria. By representing the train trajectory through a time-space path in its space-time network, this paper proposes an integer programming model for train scheduling on a single-track railway line, in which velocity choice is particularly considered to further decrease the expected energy consumption and interactions between different trains, and the link energy consumption is derived by the Davis formula with respect to different train speeds. The proposed model is implemented in the GAMS optimization software to solve an approximate optimal solution. Numerical examples show that the optimal timetable with optimized velocities can further decrease the energy consumption and coupling effects in comparison to the fixed velocity based schedule. (C) 2014 Wiley Periodicals, Inc.

关键词： MONORAILS Railway lines TRAIN integer programming models train scheduling energy consumption

来源：评论

学校读者我要写书评

暂无评论

A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system

引用

JOURNAL OF SCHEDULING 2013年第6期16卷 605-628页

作者： Lusby, Richard Muller, Laurent Flindt Petersen, Bjorn Tech Univ Denmark Dept Engn Management DK-2800 Lyngby Denmark

This paper describes a Benders decomposition-based framework for solving the large scale energy management problem that was posed for the ROADEF 2010 challenge. The problem was taken from the power industry and entailed scheduling the outage dates for a set of nuclear power plants, which need to be regularly taken down for refueling and maintenance, in such a way that the expected cost of meeting the power demand in a number of potential scenarios is minimized. We show that the problem structure naturally lends itself to Benders decomposition;however, not all constraints can be included in the mixed integer programming model. We present a two phase approach that first uses Benders decomposition to solve the linear programming relaxation of a relaxed version of the problem. In the second phase, integer solutions are enumerated and a procedure is applied to make them satisfy constraints not included in the relaxed problem. To cope with the size of the formulations arising in our approach we describe efficient preprocessing techniques to reduce the problem size and show how aggregation can be applied to each of the subproblems. Computational results on the test instances show that the procedure competes well on small instances of the problem, but runs into difficulty on larger ones. Unlike heuristic approaches, however, this methodology can be used to provide lower bounds on solution quality.

关键词： TWO-PHASE ENERGY SYSTEMS Power demand integer programming models Benders decomposition Power industry energy industries

来源：评论

学校读者我要写书评

暂无评论

Economic Model-Based Controller Design Framework for Hydraulic Fracturing To Optimize Shale Gas Production and Water Usage

引用

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2019年第27期58卷 12097-12115页

作者： Cao, Kaiyu Siddhamshetty, Prashanth Ahn, Yuchan Mukherjee, Rajib Kwon, Joseph Sang-Il Texas A&M Univ Texas A&M Energy Inst College Stn TX 77843 USA Texas A&M Univ Artie McFerrin Dept Chem Engn College Stn TX 77845 USA

As water issues associated with hydraulic fracturing have received much attention, several optimization approaches have been developed for effective water management. However, most of them have not considered pumping schedules for hydraulic fracturing, which determine the productivity of a shale well as well as the total amount of freshwater required. Because of this, a novel model-based control framework is proposed for hydraulic fracturing to maximize the net profit from shale gas development which simultaneously minimizes the total cost associated with water management. The framework is as follows: initially a reduced-order model and a Kalman filter are developed based on the simulation data generated from a high-fidelity hydraulic fracturing model to correlate the pumping schedule and the final fracture geometry. Then, a numerical reservoir simulator and mixed-integer nonlinear programming model are used to generate two maps describing the revenue from selling shale gas produced and cost from managing wastewater recovered, respectively. Finally, by applying a data-based dynamic input-output model to connect the two maps, an economic model predictive control system is formulated. The proposed control framework enables 62% of the generated wastewater to be reused through the application of thermal membrane distillation technology in the treatment process and results in a 11% reduction in overall freshwater consumption, while maintaining the productivity of a shale well at its theoretical maximum.

关键词： Gas production integer programming models membrane distillation GASEOUS DEVELOPMENT simulated data Hydraulic Fracking Frameworks Kalman filters productivity Water Management TREATMENT TECHNOLOGIES controller design Water utilization

来源：评论

学校读者我要写书评

暂无评论

An effective integer program for a general assembly line balancing problem with parallel workers and additional assignment restrictions

引用

JOURNAL OF MANUFACTURING SYSTEMS 2019年 50卷 180-192页

作者： Pearce, Bryan W. Antani, Kavit Mears, Laine Funk, Kilian Mayorga, Maria E. Kurz, Mary E. Clemson Univ Clemson SC 29634 USA

The scope of the assembly line balancing problem in research is clear, with well-defined sets of assumptions, parameters, and objective functions. In application, these borders are frequently transgressed. Many of these deviations are internal to the assembly line balancing problem itself, arising from any of the physical or technological features in modem assembly lines. Other issues are founded in the tight coupling of assembly line balancing with external production planning and management problems, as assembly lines are at the intersection of multiple related problems in job sequencing, part flow logistics, worker safety, and quality. General assembly line balancing is devoted to studying the solution techniques necessary to model these applied line balancing problems. This article presents a complex line balancing problem based on the real production environment of our industrial partner, featuring several extensions for task-to-task relationships, station characteristics limiting assignment, and parallel worker zoning interactions. A heuristic, combining rank-position-weighting, last-fit improvement and iterative blocking scheme, and an integer program that can manage multiple constraint types simultaneously, are developed. An experiment is conducted testing each of these new solution methods upon a battery of testbed problems, measuring solution quality, runtime, and achievement of feasibility. Results indicate that the integer programming model provides a viable solution method for those industries with access to commercial solvers.

关键词： General assembly line balancing Heuristics integer programming models

来源：评论

学校读者我要写书评

暂无评论

Optimization of Classification Track Assignment Considering Block Sequence at Train Marshaling Yard

引用

JOURNAL OF ADVANCED TRANSPORTATION 2018年第Pt.5期2018卷 1-11页

作者： Zhang, Yingqun Song, Rui He, Shiwei Li, Haodong Guo, Xiaole Beijing Jiaotong Univ MOE Key Lab Urban Transportat Complex Syst Theory Beijing 100044 Peoples R China

An operational process at train marshaling yard is considered in this study. The inbound trains are decoupled and disassembled into individual railcars, which are then moved to a series of classification tracks, forming outbound trains after being assembled and coupled. We focus on the allocation plan of the classification tracks. Given are the disassembling and assembling sequence, the railcars connection plan, and a number of classification tracks. Output is the assignment of the railcars to the classification tracks. An integer programming model is proposed, aimed at reducing the number of coupling operations, as well as the number of dirty tracks which is related to the rehumping operation, and the order of the railcars on the outbound train must satisfy the block sequence. Tabu algorithm is designed to solve the problem, and the model is also tested by CPLEX in comparison. A numerical experiment based on a real-world case is analyzed, and the result can be reached within a reasonable amount of time. We also discussed a number of factors that may affect the track assignment and gave suggestions for the real-world case.

关键词： TRAIN integer programming models rail vehicle Tracks outbound

来源：评论

学校读者我要写书评

暂无评论

A programming model and system infrastructure for real-time synchronization in distributed multimedia systems

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1996年第1期14卷 249-263页

作者： Blair, GS Coulson, G Papathomas, M Robin, P Stefani, JB Horn, F Hazard, L CTR NATL ETUD TELECOMMUN F-92131 ISSY MOULINEAXFRANCE

One of the major requirements of distributed multimedia applications is the need to maintain often complex, real-time synchronization constraints, More specifically, it is necessary to be able to manage arbitrary intra- and inter-media synchronization across activities in the distributed environment. Furthermore, it is important that such developments are integrated into emerging object-oriented standards for distributed computing. This paper presents an object-oriented programming model and associated implementation to meet these requirements. The main concepts behind the proposed approach are, firstly, the use of reactive objects for real-time control and synchronization and, secondly, quality of service controlled bindings for predictable communication between objects, The flexibility of the approach is demonstrated by three contrasting examples of real-time synchronization. The implementation extends the realtime capabilities of the Chorus micro-kernel by introducing the concepts of rtports, rthandlers and quality of service controlled connections, The paper demonstrates how reactive objects and bindings are realized on this infrastructure.

关键词： distributed multimedia system INFRASTRUCTURE Real time control integer programming models real-time synchronization clock recovery MULTIMEDIA APPLICATION MULTI-MEDIA SYSTEM linear programming models Quality of service

来源：评论

学校读者我要写书评

暂无评论

Production planning problems in printed circuit board assembly

引用

DISCRETE APPLIED MATHEMATICS 2002年第1-3期123卷 339-361页

作者： Crama, Y van de Klundert, J Spieksma, FCR Univ Liege Ecole Adm Affaires B-4000 Liege Belgium Katholieke Univ Leuven Dept Appl Econ B-3000 Louvain Belgium

This survey describes some of the main optimization problems arising in the context of production planning for the assembly of printed circuit boards. The discussion is structured around a hierarchical decomposition of the planning process into distinct optimization subproblems, addressing issues such as the assignment of board types to machine groups, the allocation of component feeders to individual machines, the determination of optimal production sequences, etc, The paper reviews the literature on this topic with an emphasis on the most recent developments, on the fundamental structure of the mathematical models and on the relation between these models and some 'environmental' variables such as the layout of the shop or the product mix. (C) 2002 Elsevier Science B.V, All rights reserved.

关键词： production planning scheduling sequencing printed circuit boards integer programming models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：