Week_11: Network Models

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Week_11: Network Models 1

2 1.Introduction The network models include the traditional applications of finding the most efficient way to link a number of locations directly or indirectly, finding the shortest route between two cities, determining the maximum flow in a pipeline network, determining the minimum-cost flow in a network that satisfies supply and demand requirements at different locations, and scheduling the activities of a project. A multitude of operations research situations can be modeled and solved as networks (nodes connected by branches): 1. Design of an offshore natural-gas pipeline network connecting well heads in the Gulf of Mexico to an inshore delivery point. The objective of the model is to minimize the cost of constructing the pipeline. 2. Determination of the shortest route between two cities in an existing networkof roads. 3. Determination of the maximum capacity (in tons per year) of a coal slurry pipeline network joining coal mines in Wyoming with power plants in Houston. (Slurry pipelines transport coal by pumping water through specially designed pipes.) 4. Determination of the time schedule (start and completion dates) for the activities of a construction project. 5. Determination of the minimum-cost flow schedule from oil fields to refineries through a pipeline network. The solution of these situations, and others like it, is accomplished through a variety of network optimization algorithms. This chapter presents four of these algorithms. 1. Minimal spanning tree (situation 1) 2. Shortest-route algorithm (situation 2) 3. Maximal-flow algorithm (situation 3) 4. Critical path (CPM) algorithm (situation 4) Network Definitions: A network consists of a set of nodes linked by arcs (or branches). The notation for describing a network is (N, A), where N is the set of nodes and A is the set of arcs. As an illustration, the network in Figure below is described as N = {1,2,3,4,5} A = {(l, 2), (1,3), (2,3), (2,5), (3,4), (3,5), (4,2), (4, 5)} 2

3 Associated with each network is a flow (e.g., oil products flow in a pipeline and automobile traffic flows in highways). In general, the flow in a network is limited by the capacity of its arcs, which may be finite or infinite. An arc is said to be directed or oriented if it allows positive flow in one direction and zero flow in the opposite direction. A directed network has all directed arcs. A path is a sequence of distinct arcs that join two nodes through other nodes regardless of the direction of flow in each arc. A path forms a cycle or a loop if it connects a node to itself through other nodes. For example, in Figure above, the arcs (2,3), (3, 4), and (4,2) form a cycle. A connected network is such that every two distinct nodes are linked by at least one path. The network in Figure above demonstrates this type of network. A trce is a cycle-free connected network comprised of a subset of all the nodes, and a spanning tree is a tree that links all the nodes of the network. Figure below provides examples of a tree and a spanning tree from the network in Figure above 2. Minimal Spanning Tree Algorithm The minimal spanning tree algorithm deals with linking the nodes of a network, directly or indirectly, using the shortest total length of connecting branches. A typical application occurs in the construction of paved roads that link several rural towns. The road between two towns may pass through one or more other towns. The most economical design of the road system calls for minimizing the total miles of paved roads, a result that is achieved by implementing the minimal spanning tree algorithm, 3

4 The steps of the procedure are given as follows. Let N = {l, 2,..., n} be the set of nodes of the network and define Ck = Set of nodes that have been permanently connected at iteration k Ck = Set of nodes as yet to be connected permanently after iteration k Step 0: Set Co = ϕ and C0 = N Step 1: Start with any node i in the unconnected set Co and set C1 = {i}, which renders C1 = N i. Set k= 2 General step k. Select a node,j*, in the unconnected set Ck 1 that yields the shortest arc to a node in the connected set Ck - 1 Link j* permanently to Ck - l and remove it from Ck 11; that is, C k = C k 1 + j Ck = Ck 1 j If the set of unconnected nodes, C k is empty, stop. Otherwise, set k = k + 1 and repeat the step. Example: Midwest TV Cable Company is in the process of providing cable service to five new housing development areas. Figure below depicts possible TV linkages among the five areas. The cable miles are shown on each arc. Determine the most economical cable network. Solution: Iteration 1: C1={1} 4

5 Ck = {2,3,4,5,6} The thin arcs provide all the candidate links between C and C. The thick branches represent the permanent links between the nodes of the connected set C, and the dashed branch represents the new (permanent) link added at each iteration. Iteration 2 in iteration 1, branch (1,2) is the shortest link (= 1 mile) among all the candidate branches from node 1 to nodes 2, 3, 4, 5, and 6 of the unconnected set C1 Hence, link (1,2) is made permanent and j* =2, which yields C1={1,2} Ck = {3,4,5,6} 5

6 Iteration 3: in iteration 2, branch (2,5) is the shortest link (= 3 mile) among all the candidate branches from nodes {1,2} to nodes 3, 4, 5, and 6 of the unconnected set C1 Hence, link (2,5) is made permanent and j* =5, which yields C1={1,2,5} Ck = {3,4,6} Iteration 4: in iteration 3, branch (2,4) is the shortest link (= 4 mile) among all the candidate branches from nodes {1,2,5} to nodes 3, 4, and 6 of the unconnected set C1 Hence, link (2,4) is made permanent and j* =4, which yields C1={1,2,4,5} Ck = {3,6} 6

7 Iteration 5: in iteration 4, branch (4,6) is the shortest link (= 3 mile) among all the candidate branches from nodes {1,2,4,5} to nodes 3, and 6 of the unconnected set C1 Hence, link (4,6) is made permanent and j* =4, which yields C1={1,2,4,5,6} Ck = {3} Iteration 6: in iteration 5, branches (1,3)and (4,5) is the shortest link (= 5 mile) among all the candidate branches from nodes {1,2,4,5,6} to node 3 of the unconnected set C1 Hence, C1={1,2,3,4,5,6} Ck = {φ} The solution is given by the minimal spanning tree shown in iteration 6 of Figure above. The resulting minimum cable miles needed to provide the desired cable service are = 16 miles 7

IE 680 Special Topics in Production Systems: Networks, Routing and Logistics*

IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti

Chapter 10: Network Flow Programming

Chapter 10: Network Flow Programming Linear programming, that amazingly useful technique, is about to resurface: many network problems are actually just special forms of linear programs! This includes,

Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

Block Diagram Reduction

Appendix W Block Diagram Reduction W.3 4Mason s Rule and the Signal-Flow Graph A compact alternative notation to the block diagram is given by the signal- ow graph introduced Signal- ow by S. J. Mason

The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

7.1 Modelling the transportation problem

Chapter Transportation Problems.1 Modelling the transportation problem The transportation problem is concerned with finding the minimum cost of transporting a single commodity from a given number of sources

The number of marks is given in brackets [ ] at the end of each question or part question. The total number of marks for this paper is 72.

ADVANCED SUBSIDIARY GCE UNIT 4736/01 MATHEMATICS Decision Mathematics 1 THURSDAY 14 JUNE 2007 Afternoon Additional Materials: Answer Booklet (8 pages) List of Formulae (MF1) Time: 1 hour 30 minutes INSTRUCTIONS

Triple Bottom Line Case Studies by Nancy Kralik,, P.E., LEED AP, M.ASCE

Triple Bottom Line Case Studies by Nancy Kralik,, P.E., LEED AP, M.ASCE Civil Engineering Leadership in Developing Sustainable Infrastructure October 30, 2009 ASCE International Program Sustainable Infrastructure

Dynamic Programming 11.1 AN ELEMENTARY EXAMPLE

Dynamic Programming Dynamic programming is an optimization approach that transforms a complex problem into a sequence of simpler problems; its essential characteristic is the multistage nature of the optimization

ALASKA NATURAL GAS PIPELINE PROJECT Testimony on AGIA of W. H. Sparger House Resources Committee May 11, 2007 EPC Energy Project Consultants, LLC Introduction William H. (Bill) Sparger Energy Project Consultants.

Network Models 8.1 THE GENERAL NETWORK-FLOW PROBLEM

Network Models 8 There are several kinds of linear-programming models that exhibit a special structure that can be exploited in the construction of efficient algorithms for their solution. The motivation

AI: A Modern Approach, Chpts. 3-4 Russell and Norvig

AI: A Modern Approach, Chpts. 3-4 Russell and Norvig Sequential Decision Making in Robotics CS 599 Geoffrey Hollinger and Gaurav Sukhatme (Some slide content from Stuart Russell and HweeTou Ng) Spring,

6.02 Practice Problems: Routing

1 of 9 6.02 Practice Problems: Routing IMPORTANT: IN ADDITION TO THESE PROBLEMS, PLEASE SOLVE THE PROBLEMS AT THE END OF CHAPTERS 17 AND 18. Problem 1. Consider the following networks: network I (containing

A Labeling Algorithm for the Maximum-Flow Network Problem

A Labeling Algorithm for the Maximum-Flow Network Problem Appendix C Network-flow problems can be solved by several methods. In Chapter 8 we introduced this topic by exploring the special structure of

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 9 Basic Scheduling with A-O-A Networks Today we are going to be talking

12 Abstract Data Types

12 Abstract Data Types 12.1 Source: Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT).

Chapter-6. Developing a Project Plan

MGMT 4135 Project Management Chapter-6 Where we are now Developing the Project Network Why? Graphical representation of the tasks to be completed Logical sequence of activities Determines dependencies

HIPPS Application in the Gulf of Mexico. Christopher Lindsey-Curran BP Senior Subsea Engineer

HIPPS Application in the Gulf of Mexico Christopher Lindsey-Curran BP Senior Subsea Engineer Agenda Introduction and background HIPPS overview Codes and standards System design Regulatory issues Conclusions

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers Ho Trong Viet, Yves Deville, Olivier Bonaventure, Pierre François ICTEAM, Université catholique de Louvain (UCL), Belgium.

Chapter 6: Graph Theory

Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET)

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print), ISSN 0976 6367(Print) ISSN 0976 6375(Online)

10.2 Series and Convergence

10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

Dynamic programming. Doctoral course Optimization on graphs - Lecture 4.1. Giovanni Righini. January 17 th, 2013

Dynamic programming Doctoral course Optimization on graphs - Lecture.1 Giovanni Righini January 1 th, 201 Implicit enumeration Combinatorial optimization problems are in general NP-hard and we usually

Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is

6.231 Dynamic Programming Midterm, Fall 2008. Instructions

6.231 Dynamic Programming Midterm, Fall 2008 Instructions The midterm comprises three problems. Problem 1 is worth 60 points, problem 2 is worth 40 points, and problem 3 is worth 40 points. Your grade

MATHEMATICS Unit Decision 1

General Certificate of Education January 2008 Advanced Subsidiary Examination MATHEMATICS Unit Decision 1 MD01 Tuesday 15 January 2008 9.00 am to 10.30 am For this paper you must have: an 8-page answer

Classification/Decision Trees (II)

Classification/Decision Trees (II) Department of Statistics The Pennsylvania State University Email: jiali@stat.psu.edu Right Sized Trees Let the expected misclassification rate of a tree T be R (T ).

Question 1. [7 points] Consider the following scenario and assume host H s routing table is the one given below:

Computer Networks II Master degree in Computer Engineering Exam session: 11/02/2009 Teacher: Emiliano Trevisani Last name First name Student Identification number You are only allowed to use a pen and

Lecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol

Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem

Scheduling Problem of Job-Shop with Blocking: A Taboo Search Approach

MIC 2001-4th Metaheuristics International Conference 643 Scheduling Problem of Job-Shop with Blocking: A Taboo Search Approach Yazid Mati Nidhal Rezg Xiaolan Xie INRIA/MACSI Project & LGIPM ENIM-ILE DU

Water Supply. Simulation of Water Distribution Networks. Mohammad N. Almasri. Optimal Design of Water Distribution Networks Mohammad N.

Water Supply Simulation of Water Distribution Networks The Use of EPANET Mohammad N. Almasri 1 Introduction This presentation focuses on two issues: The simulation of water distribution networks (WDNs)

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents

A Quantitative Decision Support Framework for Optimal Railway Capacity Planning

A Quantitative Decision Support Framework for Optimal Railway Capacity Planning Y.C. Lai, C.P.L. Barkan University of Illinois at Urbana-Champaign, Urbana, USA Abstract Railways around the world are facing

G52APT AI Programming Techniques

G52APT AI Programming Techniques Lecture 8: Depth first search in Prolog Brian Logan School of Computer Science bsl@cs.nott.ac.uk Outline of this lecture recap: definition of a search problem state spaces

REQUIREMENTS FOR REGISTRATION AS A PROFESSIONAL ENGINEER WITH THE PROFESSIONAL ENGINEERS BOARD SINGAPORE

ATTACHMENT 9 REQUIREMENTS FOR REGISTRATION AS A PROFESSIONAL ENGINEER WITH THE PROFESSIONAL ENGINEERS BOARD SINGAPORE Requirements 1 The Professional Engineers Board will register a candidate as a professional

Decision Mathematics 1 TUESDAY 22 JANUARY 2008

ADVANCED SUBSIDIARY GCE 4736/01 MATHEMATICS Decision Mathematics 1 TUESDAY 22 JANUARY 2008 Additional materials: Answer Booklet (8 pages) Graph paper Insert for Questions 3 and 4 List of Formulae (MF1)

OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION

OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION Sérgio Pequito, Stephen Kruzick, Soummya Kar, José M. F. Moura, A. Pedro Aguiar Department of Electrical and Computer Engineering

Freight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry

Freight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry Xiangshang Tong, Ph.D. Menlo Worldwide Logistics Kimberly Ellis, Ph.D. Virginia Tech Amy Brown Greer

Network Structure or Topology

Volume 1, Issue 2, July 2013 International Journal of Advance Research in Computer Science and Management Studies Research Paper Available online at: www.ijarcsms.com Network Structure or Topology Kartik

Introduction to LAN/WAN. Network Layer

Introduction to LAN/WAN Network Layer Topics Introduction (5-5.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues Store-and-Forward Packet Switching Services

2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

PhUSE 2008. Paper TU01. Today's Project Management Software: It's Easier Than You Think!

Paper TU01 Today's Project Management Software: It's Easier Than You Think! Jenny Gandhi, Quanticate International Ltd, Manchester, United Kingdom ABSTRACT Project management is an application of knowledge,

CHAPTER 8 WATER DISTRIBUTION SYSTEMS

CHAPTER 8 WATER DISTRIBUTION SYSTEMS Distribution system is a network of pipelines that distribute water to the consumers. They are designed to adequately satisfy the water requirement for a combination

2.1 Introduction. 2.2 Terms and definitions

.1 Introduction An important step in the procedure for solving any circuit problem consists first in selecting a number of independent branch currents as (known as loop currents or mesh currents) variables,

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 15 Limited Resource Allocation Today we are going to be talking about

Circuits 1 M H Miller

Introduction to Graph Theory Introduction These notes are primarily a digression to provide general background remarks. The subject is an efficient procedure for the determination of voltages and currents

Table 1 DENSITY Density Solids Percent By Volume

Willard Says Useful stuff to know about hydraulic dredging. The Discharge Pipeline Slurry Density Slurry density is: Poorly understood. The ratio of the weights of a volume of slurry relative to an identical

B. Rothfarb; H. Frank; D. M. Rosenbaum; K. Steiglitz; D. J. Kleitman. Operations Research, Vol. 18, No. 6. (Nov. - Dec., 1970), pp. 992-1020.

Optimal Design of Offshore Natural-Gas Pipeline Systems B. Rothfarb; H. Frank; D. M. Rosenbaum; K. Steiglitz; D. J. Kleitman Operations Research, Vol. 18, No. 6. (Nov. - Dec., 1970), pp. 992-1020. Stable

SUPPLEMENT TO CHAPTER 6 MINIMUM SPANNING-TREE PROBLEMS

S h 6- SUPPLMNT TO HPTR 6 MINIMUM SPNNIN-TR PROLMS hapter 6 focuses on network optimization problems. These are problems that can be described in terms of a complete network that has both nodes and links

Network-Wide Prediction of BGP Routes

Network-Wide Prediction of BGP Routes Nick Feamster Jennifer Rexford Georgia Tech Princeton University feamster@cc.gatech.edu jrex@cs.princeton.edu Abstract This paper presents provably correct algorithms

Informatics 2D Reasoning and Agents Semester 2, 2015-16

Informatics 2D Reasoning and Agents Semester 2, 2015-16 Alex Lascarides alex@inf.ed.ac.uk Lecture 30 Markov Decision Processes 25th March 2016 Informatics UoE Informatics 2D 1 Sequential decision problems

Project Scheduling: PERT/CPM

Project Scheduling: PERT/CPM Project Scheduling with Known Activity Times (as in exercises 1, 2, 3 and 5 in the handout) and considering Time-Cost Trade-Offs (as in exercises 4 and 6 in the handout). This

Detection of local affinity patterns in big data

Detection of local affinity patterns in big data Andrea Marinoni, Paolo Gamba Department of Electronics, University of Pavia, Italy Abstract Mining information in Big Data requires to design a new class

Lecture 26 CPM / PERT Network Diagram

Lecture 26 CPM / PERT Network Diagram 26.1 Introduction to CPM / PERT Techniques CPM (Critical Path Method) was developed by Walker to solve project scheduling problems. PERT (Project Evaluation and Review

LOAD BALANCING IN WDM NETWORKS THROUGH DYNAMIC ROUTE CHANGES

LOAD BALANCING IN WDM NETWORKS THROUGH DYNAMIC ROUTE CHANGES S.Ramanathan 1, G.Karthik 1, Ms.G.Sumathi 2 1 Dept. of computer science Sri Venkateswara College of engineering, Sriperumbudur, 602 105. 2 Asst.professor,

Context-Aware Route Planning

Context-Aware Route Planning A. W. ter Mors, C. Witteveen, J. Zutt, F. A. Kuipers Delft University of Technology September 28, 2010 Problem description A set of agents, each with their own start and destination

Y. Xiang, Constraint Satisfaction Problems

Constraint Satisfaction Problems Objectives Constraint satisfaction problems Backtracking Iterative improvement Constraint propagation Reference Russell & Norvig: Chapter 5. 1 Constraints Constraints are

ProCurve Networking. LAN Aggregation Through Switch Meshing. Technical White paper

ProCurve Networking LAN Aggregation Through Switch Meshing Technical White paper Introduction... 3 Understanding Switch Meshing... 3 Creating Meshing Domains... 5 Types of Meshing Domains... 6 Meshed and

Submitted to Transportation Science manuscript (Please, provide the mansucript number!) Collaboration for Truckload Carriers Okan Örsan Özener H. Milton Stewart School of Industrial and Systems Engineering,

Chinese postman problem

PTR hinese postman problem Learning objectives fter studying this chapter, you should be able to: understand the hinese postman problem apply an algorithm to solve the problem understand the importance

Regulation of Natural Gas Pipelines. June 23, 2008

Regulation of Natural Gas Pipelines June 23, 2008 Federal and State Regulations Federal: 49 United States Code 60101. et. seq. Title 49 Code of Federal Regulations The Office of Pipeline Safety (OPS),

Business Opportunities for Scotland and the UK. Dr Fiona Porter 19 October 2005

Business Opportunities for Scotland and the UK Dr Fiona Porter 19 October 2005 Contents A global market On Scotland s doorstep The range of opportunities Making them happen The Future Commercial Prospects

HPAM: Hybrid Protocol for Application Level Multicast. Yeo Chai Kiat

HPAM: Hybrid Protocol for Application Level Multicast Yeo Chai Kiat Scope 1. Introduction 2. Hybrid Protocol for Application Level Multicast (HPAM) 3. Features of HPAM 4. Conclusion 1. Introduction Video

Technology Solution Guide. Deploying Omnitron PoE Media Converters with Aruba Access Points and AirMesh Routers

Technology Solution Guide Deploying Omnitron PoE Media Converters with Aruba Access Points and AirMesh Routers WARRANTY DISCLAIMER THE FOLLOWING DOCUMENT, AND THE INFORMATION CONTAINED HEREIN IS PROVIDED

1. Sorting (assuming sorting into ascending order) a) BUBBLE SORT

DECISION 1 Revision Notes 1. Sorting (assuming sorting into ascending order) a) BUBBLE SORT Make sure you show comparisons clearly and label each pass First Pass 8 4 3 6 1 4 8 3 6 1 4 3 8 6 1 4 3 6 8 1

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The

Decision Mathematics D1 Advanced/Advanced Subsidiary. Tuesday 5 June 2007 Afternoon Time: 1 hour 30 minutes

Paper Reference(s) 6689/01 Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Tuesday 5 June 2007 Afternoon Time: 1 hour 30 minutes Materials required for examination Nil Items included with

AsicBoost A Speedup for Bitcoin Mining

AsicBoost A Speedup for Bitcoin Mining Dr. Timo Hanke March 31, 2016 (rev. 5) Abstract. AsicBoost is a method to speed up Bitcoin mining by a factor of approximately 20%. The performance gain is achieved

8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension.

8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension. 8.1 Definitions Definition If every point in a set S has arbitrarily small neighborhoods whose boundaries do not intersect

Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams

Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery

INTERACTIVE SEARCH FOR COMPROMISE SOLUTIONS IN MULTICRITERIA GRAPH PROBLEMS. Lucie Galand. LIP6, University of Paris 6, France

INTERACTIVE SEARCH FOR COMPROMISE SOLUTIONS IN MULTICRITERIA GRAPH PROBLEMS Lucie Galand LIP6, University of Paris 6, France Abstract: In this paper, the purpose is to adapt classical interactive methods

Software Pipelining - Modulo Scheduling

EECS 583 Class 12 Software Pipelining - Modulo Scheduling University of Michigan October 15, 2014 Announcements + Reading Material HW 2 Due this Thursday Today s class reading» Iterative Modulo Scheduling:

WAN Wide Area Networks. Packet Switch Operation. Packet Switches. COMP476 Networked Computer Systems. WANs are made of store and forward switches.

Routing WAN Wide Area Networks WANs are made of store and forward switches. To there and back again COMP476 Networked Computer Systems A packet switch with two types of I/O connectors: one type is used

NEW HAMPSHIRE PIPELINE INSTALLATION

NORTHEAST ENERGY DIRECT NEW HAMPSHIRE PIPELINE INSTALLATION Benefits to New Hampshire January 2015 Overview of Proposed New Hampshire Facilities The proposed Northeast Energy Direct Pipeline (NED) routed

WAN Performance Analysis A Study on the Impact of Windows 7

A Talari Networks White Paper WAN Performance Analysis A Study on the Impact of Windows 7 Test results demonstrating WAN performance changes due to upgrading to Windows 7 and the network architecture and

Research Article ISSN 2277 9140 Copyright by the authors - Licensee IJACIT- Under Creative Commons license 3.0

INTERNATIONAL JOURNAL OF ADVANCES IN COMPUTING AND INFORMATION TECHNOLOGY An international, online, open access, peer reviewed journal Volume 2 Issue 2 April 2013 Research Article ISSN 2277 9140 Copyright

PIPELINE / WIRE LINE PROCESS INSTRUCTIONS

PIPELINE / WIRE LINE PROCESS INSTRUCTIONS Licensing Process: 1. Once the application package is received by Jones Lang LaSalle Brokerage, Inc. (JLL), the application and drawing will be forwarded to the

Class notes Program Analysis course given by Prof. Mooly Sagiv Computer Science Department, Tel Aviv University second lecture 8/3/2007

Constant Propagation Class notes Program Analysis course given by Prof. Mooly Sagiv Computer Science Department, Tel Aviv University second lecture 8/3/2007 Osnat Minz and Mati Shomrat Introduction This

ENERGY PRODUCING SYSTEMS

ENERGY PRODUCING SYSTEMS SOLAR POWER INTRODUCTION Energy from the sun falls on our planet on a daily basis. The warmth of the sun creates conditions on earth conducive to life. The weather patterns that

Texas: An Energy and Economic Analysis

Texas: An Energy and Economic Analysis Posted on 9/30/2013 Texas leads the nation in oil and natural gas reserves and production. In just over 2 years, Texas has doubled its oil production with large quantities

A WEB-BASED TRAFFIC INFORMATION SYSTEM USING WIRELESS COMMUNICATION TECHNIQUES

Advanced OR and AI Methods in Transportation A WEB-BASED TRAFFIC INFORMATION SYSTEM USING WIRELESS COMMUNICATION TECHNIQUES Akmal ABDELFATAH 1, Abdul-Rahman AL-ALI 2 Abstract. This paper presents a procedure

The work breakdown structure can be illustrated in a block diagram:

1 Project Management Tools for Project Management Work Breakdown Structure A complex project is made manageable by first breaking it down into individual components in a hierarchical structure, known as

Optimizations. Optimization Safety. Optimization Safety. Control Flow Graphs. Code transformations to improve program

Optimizations Code transformations to improve program Mainly: improve execution time Also: reduce program size Control low Graphs Can be done at high level or low level E.g., constant folding Optimizations

Minimum cost maximum flow, Minimum cost circulation, Cost/Capacity scaling

6.854 Advanced Algorithms Lecture 16: 10/11/2006 Lecturer: David Karger Scribe: Kermin Fleming and Chris Crutchfield, based on notes by Wendy Chu and Tudor Leu Minimum cost maximum flow, Minimum cost circulation,

Optimum Path Computation Algorithms for Multimedia and Real Time Services over IP-Networks

Optimum Path Computation Algorithms for Multimedia and Real Time Services over IP-Networks 1 Optimum Path Computation Algorithms for Multimedia and Real Time Services over IP-Networks Rajiv kumar, Yuvraj

Algorithms are the threads that tie together most of the subfields of computer science.

Algorithms Algorithms 1 Algorithms are the threads that tie together most of the subfields of computer science. Something magically beautiful happens when a sequence of commands and decisions is able to

System Interconnect Architectures. Goals and Analysis. Network Properties and Routing. Terminology - 2. Terminology - 1

System Interconnect Architectures CSCI 8150 Advanced Computer Architecture Hwang, Chapter 2 Program and Network Properties 2.4 System Interconnect Architectures Direct networks for static connections Indirect

SYSM 6304: Risk and Decision Analysis Lecture 5: Methods of Risk Analysis

SYSM 6304: Risk and Decision Analysis Lecture 5: Methods of Risk Analysis M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas Email: M.Vidyasagar@utdallas.edu October 17, 2015 Outline

GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

A Representative Oil Field Development Sequence

The CO2 Enhanced Oil Recovery Story Tim Bradley President Kinder Morgan CO2 Company Outline 1. CO2 Enhanced Oil Recovery Overview Oil Field Development Sequence US: Current and Future 2. A Deeper Look

Lecture notes: single-agent dynamics 1

Lecture notes: single-agent dynamics 1 Single-agent dynamic optimization models In these lecture notes we consider specification and estimation of dynamic optimization models. Focus on single-agent models.

Network (Tree) Topology Inference Based on Prüfer Sequence

Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,

Introduction to IP v6

IP v 1-3: defined and replaced Introduction to IP v6 IP v4 - current version; 20 years old IP v5 - streams protocol IP v6 - replacement for IP v4 During developments it was called IPng - Next Generation

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

A Computer Application for Scheduling in MS Project

Comput. Sci. Appl. Volume 1, Number 5, 2014, pp. 309-318 Received: July 18, 2014; Published: November 25, 2014 Computer Science and Applications www.ethanpublishing.com Anabela Tereso, André Guedes and

Project Time Management

Project Time Management Plan Schedule Management is the process of establishing the policies, procedures, and documentation for planning, developing, managing, executing, and controlling the project schedule.

Introduction to Scheduling Theory

Introduction to Scheduling Theory Arnaud Legrand Laboratoire Informatique et Distribution IMAG CNRS, France arnaud.legrand@imag.fr November 8, 2004 1/ 26 Outline 1 Task graphs from outer space 2 Scheduling