BMBF Project ROBUKOM: Robust Communication Networks
|
|
- Arleen Lambert
- 6 years ago
- Views:
Transcription
1 BMBF Project ROBUKOM: Robust Communication Networks Arie M.C.A. Koster Christoph Helmberg Andreas Bley Martin Grötschel Thomas Bauschert supported by BMBF grant 03MS616A: ROBUKOM Robust Communication Networks, EuroView July 2012 Lehrstuhl II für Mathematik
2 Project ROBUKOM ROBUKOM - Robust Communication Networks joint BMBF project started in Oct 2010, until Jun academics in 5 research groups: 2 industrial partners: mathematical planning and operation of robust telecommunication networks different robustness concepts: classical survivability, demand uncertainty For further information, visit Arie Koster RWTH Aachen University 2 / 17
3 Project ROBUKOM ROBUKOM - Robust Communication Networks joint BMBF project started in Oct 2010, until Jun academics in 5 research groups: 2 industrial partners: mathematical planning and operation of robust telecommunication networks different robustness concepts: classical survivability, demand uncertainty For further information, visit Project 1 Robust Network Design under Demand Uncertainties RWTH Aachen: AK, Manuel Kutschka, Christina Büsing (associated) Project 2 Convex Chance-Constrained Models for Robust Communication Networks TU Chemnitz: Christoph Helmberg, Peter Hoffmann Project 3 Scalable Optimization Methods for Survivable IP-Networks TU Berlin: Andreas Bley, Daniel Karch Project 4 Efficient Algorithms for Survivable Multi-Layer Networks Zuse Institute Berlin: Martin Grötschel, Fabio D Andreagiovanni Project 5 Robust Design of IP-Networks with Multiple Transport-Technologies TU Chemnitz: Thomas Bauschert, Uwe Steglich Arie Koster RWTH Aachen University 2 / 17
4 Project ROBUKOM ROBUKOM - Robust Communication Networks joint BMBF project started in Oct 2010, until Jun academics in 5 research groups: 2 industrial partners: mathematical planning and operation of robust telecommunication networks different robustness concepts: classical survivability, demand uncertainty For further information, visit Project 1 Robust Network Design under Demand Uncertainties RWTH Aachen: AK, Manuel Kutschka, Christina Büsing (associated) Project 2 Convex Chance-Constrained Models for Robust Communication Networks TU Chemnitz: Christoph Helmberg, Peter Hoffmann Project 3 Scalable Optimization Methods for Survivable IP-Networks TU Berlin: Andreas Bley, Daniel Karch Project 4 Efficient Algorithms for Survivable Multi-Layer Networks Zuse Institute Berlin: Martin Grötschel, Fabio D Andreagiovanni Project 5 Robust Design of IP-Networks with Multiple Transport-Technologies TU Chemnitz: Thomas Bauschert, Uwe Steglich Arie Koster RWTH Aachen University 2 / 17
5 Outline 1 Network Design under Demand Uncertainty 2 WDM Replacement Problem Arie Koster RWTH Aachen University 3 / 17
6 How robust is a network design? Demand uncertainties Traffic fluctuations in the US abilene Internet2 network in time intervals of 5 minutes during one week: Traffic fluctuates heavily between node-pairs Arie Koster RWTH Aachen University 4 / 17
7 How robust is a network design? Demand uncertainties Traffic fluctuations in the US abilene Internet2 network in time intervals of 5 minutes during one week: Traffic fluctuates heavily between node-pairs Load of links will fluctuate alike Arie Koster RWTH Aachen University 4 / 17
8 How robust is a network design? Demand uncertainties Traffic fluctuations in the US abilene Internet2 network in time intervals of 5 minutes during one week: Traffic fluctuates heavily between node-pairs Load of links will fluctuate alike To avoid congestion, demand is overestimated by, e.g., 300% Can we do better? Arie Koster RWTH Aachen University 4 / 17
9 Design of Telecommunication Networks discrete decisions: given a potential network topology, demand forecast, link modules with capacities/costs find a hardware configuration, and a routing, such that demands are satisfied and total installation cost is minimised. Arie Koster RWTH Aachen University 5 / 17
10 Design of Telecommunication Networks discrete decisions: given a potential network topology, demand forecast, link modules with capacities/costs find a hardware configuration, and a routing, such that demands are satisfied and total installation cost is minimised. Variations / Extensions: Single path routing Integer routing Survivability requirements Node hardware (switching capacity) Wavelength assignment Multi-layer scenarios Arie Koster RWTH Aachen University 5 / 17
11 Deterministic Network Design f k ij = fraction of demand k K routed along arc (i, j) A. x e = number of link capacity modules to be installed on link e E. Arie Koster RWTH Aachen University 6 / 17
12 Deterministic Network Design f k ij = fraction of demand k K routed along arc (i, j) A. x e = number of link capacity modules to be installed on link e E. Integer Linear Programming formulation: min e E κ e x e s.t. {i,j} δ(i) k K (fij k fji k ) = (1) 1 i = s(k) 1 i = t(k), i V, k K (2) 0 else d k f k e Cx e, e E (3) f, x 0 (4) x Z E (5) Arie Koster RWTH Aachen University 6 / 17
13 Uncertain Demands Demand values d k are uncertain, i.e., random variables Arie Koster RWTH Aachen University 7 / 17
14 Uncertain Demands Demand values d k are uncertain, i.e., random variables Sufficient capacity cannot be guaranteed anymore! Arie Koster RWTH Aachen University 7 / 17
15 Uncertain Demands Demand values d k are uncertain, i.e., random variables Sufficient capacity cannot be guaranteed anymore! Capacity constraint (3) for edge e E changes to ( ) P d k fe k Cx e 1 ɛ, k K a so-called chance-constraint. Arie Koster RWTH Aachen University 7 / 17
16 Uncertain Demands Demand values d k are uncertain, i.e., random variables Sufficient capacity cannot be guaranteed anymore! Capacity constraint (3) for edge e E changes to ( ) P d k fe k Cx e 1 ɛ, k K a so-called chance-constraint. How to deal with such constraints in (integer) linear programs? Arie Koster RWTH Aachen University 7 / 17
17 Γ-Robust Network Design Approach by Bertsimas and Sim (2003,2004): d k [0, d k + ˆd k ], with nominal value d k and deviation ˆd k Arie Koster RWTH Aachen University 8 / 17
18 Γ-Robust Network Design Approach by Bertsimas and Sim (2003,2004): d k [0, d k + ˆd k ], with nominal value d k and deviation ˆd k Parameter Γ stating number of simultaneous deviations from nominal values Arie Koster RWTH Aachen University 8 / 17
19 Γ-Robust Network Design Approach by Bertsimas and Sim (2003,2004): d k [0, d k + ˆd k ], with nominal value d k and deviation ˆd k Parameter Γ stating number of simultaneous deviations from nominal values For each deviating demand, the peak value d k + ˆd k describes the worst-case (capacity-wise) Arie Koster RWTH Aachen University 8 / 17
20 Γ-Robust Network Design Approach by Bertsimas and Sim (2003,2004): d k [0, d k + ˆd k ], with nominal value d k and deviation ˆd k Parameter Γ stating number of simultaneous deviations from nominal values For each deviating demand, the peak value d k + ˆd k describes the worst-case (capacity-wise) Capacity constraint (3) for e E changes to: d k fe k + max ˆd k fe k Cx e, (6) k K Q K, Q Γ k Q (7) Arie Koster RWTH Aachen University 8 / 17
21 Γ-Robust Network Design Approach by Bertsimas and Sim (2003,2004): d k [0, d k + ˆd k ], with nominal value d k and deviation ˆd k Parameter Γ stating number of simultaneous deviations from nominal values For each deviating demand, the peak value d k + ˆd k describes the worst-case (capacity-wise) Capacity constraint (3) for e E changes to: d k fe k + max ˆd k fe k Cx e, (6) k K Q K, Q Γ k Q (7) Linearization by LP duality. Arie Koster RWTH Aachen University 8 / 17
22 Γ-Robust Network Design Approach by Bertsimas and Sim (2003,2004): d k [0, d k + ˆd k ], with nominal value d k and deviation ˆd k Parameter Γ stating number of simultaneous deviations from nominal values For each deviating demand, the peak value d k + ˆd k describes the worst-case (capacity-wise) Capacity constraint (3) for e E changes to: k K d k f k e + Γπ e + k K p k e Cx e, (6) π e + p k e ˆd k f k e (7) Linearization by LP duality. Arie Koster RWTH Aachen University 8 / 17
23 Computations Network Abilene Géant Germany17 Germany50 # nodes # links # demands available traffic period 6 months 4 months 1 day 1 day traffic granularity 5 min 15 min 5 min 5 min # available traffic matrices # traffic matrices used instances Abilene1 Geant1 Germany17 Germany50 Abilene2 Geant2 Arie Koster RWTH Aachen University 9 / 17
24 Computations Network Abilene Géant Germany17 Germany50 # nodes # links # demands available traffic period 6 months 4 months 1 day 1 day traffic granularity 5 min 15 min 5 min 5 min # available traffic matrices # traffic matrices used instances Abilene1 Geant1 Germany17 Germany50 Abilene2 Geant2 d k = geometric mean of 1 week / 1 day ˆd k = 95% percentile of 1 week / 1 day Arie Koster RWTH Aachen University 9 / 17
25 Gain of Robustness = Cost savings compared with 95% deterministic model Price of Robustness Arie Koster RWTH Aachen University 10 / 17
26 Gain of Robustness = Cost savings compared with 95% deterministic model Price of Robustness How robust are the network designs? Evaluation of 8064 traffic matrices (Abilene1, 4 weeks) realized robustness = maximal fraction of the total demand that can be routed for a traffic matrix Arie Koster RWTH Aachen University 10 / 17
27 Gain of Robustness = Cost savings compared with 95% deterministic model Price of Robustness How robust are the network designs? Evaluation of 8064 traffic matrices (Abilene1, 4 weeks) realized robustness = maximal fraction of the total demand that can be routed for a traffic matrix Arie Koster RWTH Aachen University 10 / 17
28 Gain of Robustness = Cost savings compared with 95% deterministic model Price of Robustness How robust are the network designs? Evaluation of 8064 traffic matrices (Abilene1, 4 weeks) realized robustness = maximal fraction of the total demand that can be routed for a traffic matrix Arie Koster RWTH Aachen University 10 / 17
29 Gain of Robustness = Cost savings compared with 95% deterministic model Price of Robustness How robust are the network designs? Evaluation of 8064 traffic matrices (Abilene1, 4 weeks) realized robustness = maximal fraction of the total demand that can be routed for a traffic matrix Arie Koster RWTH Aachen University 10 / 17
30 Realized Robustness Abilene network: Evaluation of 8064 traffic matrices (4 weeks) Géant network: Evaluation of 2688 traffic matrices (4 weeks) Γ ABILENE1 ABILENE2 GEANT1 GEANT K Arie Koster RWTH Aachen University 11 / 17
31 Realized Robustness Abilene network: Evaluation of 8064 traffic matrices (4 weeks) Géant network: Evaluation of 2688 traffic matrices (4 weeks) Γ ABILENE1 ABILENE2 GEANT1 GEANT K About 10% cost savings for Γ = 5 without losing robustness! Arie Koster RWTH Aachen University 11 / 17
32 Outline 1 Network Design under Demand Uncertainty 2 WDM Replacement Problem Arie Koster RWTH Aachen University 12 / 17
33 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Arie Koster RWTH Aachen University 13 / 17
34 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Arie Koster RWTH Aachen University 13 / 17
35 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Arie Koster RWTH Aachen University 13 / 17
36 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Arie Koster RWTH Aachen University 13 / 17
37 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Arie Koster RWTH Aachen University 13 / 17
38 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Arie Koster RWTH Aachen University 13 / 17
39 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Workforce constraint Step (2) requires personel at nodes and regenerators. Arie Koster RWTH Aachen University 13 / 17
40 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Workforce constraint Step (2) requires personel at nodes and regenerators. Arie Koster RWTH Aachen University 13 / 17
41 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Workforce constraint Step (2) requires personel at nodes and regenerators. Manpower sufficient to upgrade each single fiber Must upgrade fibers sequentially over multiple periods Arie Koster RWTH Aachen University 13 / 17
42 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Workforce constraint Step (2) requires personel at nodes and regenerators. Manpower sufficient to upgrade each single fiber Must upgrade fibers sequentially over multiple periods Arie Koster RWTH Aachen University 13 / 17
43 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Workforce constraint Step (2) requires personel at nodes and regenerators. Manpower sufficient to upgrade each single fiber Must upgrade fibers sequentially over multiple periods Arie Koster RWTH Aachen University 13 / 17
44 WDM replacement WDM upgrade procedure (1) Install new OXCs at node (In parallel to old one) (2) Shut down fiber(s) Replace regenerators Connect fiber(s) to new OXCs (3) Remove old OXCs from node Workforce constraint Step (2) requires personel at nodes and regenerators. Manpower sufficient to upgrade each single fiber Must upgrade fibers sequentially over multiple periods Arie Koster RWTH Aachen University 13 / 17
45 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. Arie Koster RWTH Aachen University 14 / 17
46 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. Arie Koster RWTH Aachen University 14 / 17
47 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. Arie Koster RWTH Aachen University 14 / 17
48 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. (b) Upgrade fibers non-simultaneously Critical: Connection down until all fibers are upgraded. Why: Old & new WDM systems incompatible No mixed new-old connectons Arie Koster RWTH Aachen University 14 / 17
49 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. (b) Upgrade fibers non-simultaneously Critical: Connection down until all fibers are upgraded. Why: Old & new WDM systems incompatible No mixed new-old connectons Arie Koster RWTH Aachen University 14 / 17
50 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. (b) Upgrade fibers non-simultaneously Critical: Connection down until all fibers are upgraded. Why: Old & new WDM systems incompatible No mixed new-old connectons Arie Koster RWTH Aachen University 14 / 17
51 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. (b) Upgrade fibers non-simultaneously Critical: Connection down until all fibers are upgraded. Why: Old & new WDM systems incompatible No mixed new-old connectons Arie Koster RWTH Aachen University 14 / 17
52 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. (b) Upgrade fibers non-simultaneously Critical: Connection down until all fibers are upgraded. Why: Old & new WDM systems incompatible No mixed new-old connectons Arie Koster RWTH Aachen University 14 / 17
53 Upgrading an Existing Network Existing connections are disrupted (a) Upgrade all fibers at once Uncritical: Only short break. (b) Upgrade fibers non-simultaneously Critical: Connection down until all fibers are upgraded. Why: Old & new WDM systems incompatible No mixed new-old connectons Planning task (simplified) Schedule fiber upgrades such that total disruption is minimized. Arie Koster RWTH Aachen University 14 / 17
54 Effect of Disruption on Different Services IP service Down if IP network disconnected Arie Koster RWTH Aachen University 15 / 17
55 Effect of Disruption on Different Services IP service Down if IP network disconnected Arie Koster RWTH Aachen University 15 / 17
56 Effect of Disruption on Different Services IP service Down if IP network disconnected Unprotected WDM connection Down if (single) path disrupted Arie Koster RWTH Aachen University 15 / 17
57 Effect of Disruption on Different Services IP service Down if IP network disconnected Unprotected WDM connection Down if (single) path disrupted Arie Koster RWTH Aachen University 15 / 17
58 Effect of Disruption on Different Services IP service Down if IP network disconnected Unprotected WDM connection Down if (single) path disrupted Protected WDM connection (1+1) Arie Koster RWTH Aachen University 15 / 17
59 Effect of Disruption on Different Services IP service Down if IP network disconnected Unprotected WDM connection Down if (single) path disrupted Protected WDM connection (1+1) Down if both paths disrupted Arie Koster RWTH Aachen University 15 / 17
60 Effect of Disruption on Different Services IP service Down if IP network disconnected Unprotected WDM connection Down if (single) path disrupted Protected WDM connection (1+1) Down if both paths disrupted Unprotected if one path disrupted Arie Koster RWTH Aachen University 15 / 17
61 Effect of Disruption on Different Services IP service Down if IP network disconnected Unprotected WDM connection Down if (single) path disrupted Protected WDM connection (1+1) Down if both paths disrupted Unprotected if one path disrupted Planning task Schedule fiber upgrades such that (1) IP service is never down (2) total WDM down time min (3) total WDM unprot. time min Arie Koster RWTH Aachen University 15 / 17
62 Conclusions Robust Network Design New ways to model network planning problem, allowing more information Mathematical Models are challenging generalization of existing theory Promising results: cheaper and better network designs Non-linear optimization approaches; techonology-dependent models WDM Replacement Problem New Problem many dependencies in solutions Straightforward formulation extremely weak First improvement results work in progress Arie Koster RWTH Aachen University 16 / 17
63 BMBF Project ROBUKOM: Robust Communication Networks Arie M.C.A. Koster Christoph Helmberg Andreas Bley Martin Grötschel Thomas Bauschert supported by BMBF grant 03MS616A: ROBUKOM Robust Communication Networks, EuroView July 2012 Lehrstuhl II für Mathematik
Decision Analysis. Decision-Making Problem. Decision Analysis. Part 1 Decision Analysis and Decision Tables. Decision Analysis, Part 1
Decision Support: Decision Analysis Jožef Stefan International Postgraduate School, Ljubljana Programme: Information and Communication Technologies [ICT3] Course Web Page: http://kt.ijs.si/markobohanec/ds/ds.html
More informationRegret-based Reward Elicitation for Markov Decision Processes
444 REGAN & BOUTILIER UAI 2009 Regret-based Reward Elicitation for Markov Decision Processes Kevin Regan Department of Computer Science University of Toronto Toronto, ON, CANADA kmregan@cs.toronto.edu
More informationSeminar - Organic Computing
Seminar - Organic Computing Self-Organisation of OC-Systems Markus Franke 25.01.2006 Typeset by FoilTEX Timetable 1. Overview 2. Characteristics of SO-Systems 3. Concern with Nature 4. Design-Concepts
More informationYour Partner for Additive Manufacturing in Aachen. Community R&D Services Education
Your Partner for Additive Manufacturing in Aachen Community R&D Services Education Mission of the ACAM Direct access for industry members to the AM relevant resources Center for information exchange, joint
More informationGiven a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations
4 Interior point algorithms for network ow problems Mauricio G.C. Resende AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 USA Panos M. Pardalos The University of Florida, Gainesville, FL 32611-6595
More informationAN EXAMPLE OF THE GOMORY CUTTING PLANE ALGORITHM. max z = 3x 1 + 4x 2. 3x 1 x x x x N 2
AN EXAMPLE OF THE GOMORY CUTTING PLANE ALGORITHM Consider the integer programme subject to max z = 3x 1 + 4x 2 3x 1 x 2 12 3x 1 + 11x 2 66 The first linear programming relaxation is subject to x N 2 max
More informationYour Partner for Additive Manufacturing in Aachen. Community R&D Services Education
Your Partner for Additive Manufacturing in Aachen Community R&D Services Education Mission of the ACAM Direct access for industry members to the AM relevant resources Center for information exchange, joint
More informationThe Good Judgment Project: A large scale test of different methods of combining expert predictions
The Good Judgment Project: A large scale test of different methods of combining expert predictions Lyle Ungar, Barb Mellors, Jon Baron, Phil Tetlock, Jaime Ramos, Sam Swift The University of Pennsylvania
More informationTesting A Moving Target: How Do We Test Machine Learning Systems? Peter Varhol Technology Strategy Research, USA
Testing A Moving Target: How Do We Test Machine Learning Systems? Peter Varhol Technology Strategy Research, USA Testing a Moving Target How Do We Test Machine Learning Systems? Peter Varhol, Technology
More informationReinforcement Learning by Comparing Immediate Reward
Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate
More informationSoftware Maintenance
1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories
More informationEvaluation of Usage Patterns for Web-based Educational Systems using Web Mining
Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining Dave Donnellan, School of Computer Applications Dublin City University Dublin 9 Ireland daviddonnellan@eircom.net Claus Pahl
More informationEvaluation of Usage Patterns for Web-based Educational Systems using Web Mining
Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining Dave Donnellan, School of Computer Applications Dublin City University Dublin 9 Ireland daviddonnellan@eircom.net Claus Pahl
More informationA GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING
A GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING Yong Sun, a * Colin Fidge b and Lin Ma a a CRC for Integrated Engineering Asset Management, School of Engineering Systems, Queensland
More informationSchool of Innovative Technologies and Engineering
School of Innovative Technologies and Engineering Department of Applied Mathematical Sciences Proficiency Course in MATLAB COURSE DOCUMENT VERSION 1.0 PCMv1.0 July 2012 University of Technology, Mauritius
More informationPython Machine Learning
Python Machine Learning Unlock deeper insights into machine learning with this vital guide to cuttingedge predictive analytics Sebastian Raschka [ PUBLISHING 1 open source I community experience distilled
More informationCarter M. Mast. Participants: Peter Mackenzie-Helnwein, Pedro Arduino, and Greg Miller. 6 th MPM Workshop Albuquerque, New Mexico August 9-10, 2010
Representing Arbitrary Bounding Surfaces in the Material Point Method Carter M. Mast 6 th MPM Workshop Albuquerque, New Mexico August 9-10, 2010 Participants: Peter Mackenzie-Helnwein, Pedro Arduino, and
More informationBeyond the Pipeline: Discrete Optimization in NLP
Beyond the Pipeline: Discrete Optimization in NLP Tomasz Marciniak and Michael Strube EML Research ggmbh Schloss-Wolfsbrunnenweg 33 69118 Heidelberg, Germany http://www.eml-research.de/nlp Abstract We
More informationAn Introduction to Simio for Beginners
An Introduction to Simio for Beginners C. Dennis Pegden, Ph.D. This white paper is intended to introduce Simio to a user new to simulation. It is intended for the manufacturing engineer, hospital quality
More informationLecture 1: Machine Learning Basics
1/69 Lecture 1: Machine Learning Basics Ali Harakeh University of Waterloo WAVE Lab ali.harakeh@uwaterloo.ca May 1, 2017 2/69 Overview 1 Learning Algorithms 2 Capacity, Overfitting, and Underfitting 3
More informationSTA 225: Introductory Statistics (CT)
Marshall University College of Science Mathematics Department STA 225: Introductory Statistics (CT) Course catalog description A critical thinking course in applied statistical reasoning covering basic
More informationAUTOMATED TROUBLESHOOTING OF MOBILE NETWORKS USING BAYESIAN NETWORKS
AUTOMATED TROUBLESHOOTING OF MOBILE NETWORKS USING BAYESIAN NETWORKS R.Barco 1, R.Guerrero 2, G.Hylander 2, L.Nielsen 3, M.Partanen 2, S.Patel 4 1 Dpt. Ingeniería de Comunicaciones. Universidad de Málaga.
More informationProbability and Statistics Curriculum Pacing Guide
Unit 1 Terms PS.SPMJ.3 PS.SPMJ.5 Plan and conduct a survey to answer a statistical question. Recognize how the plan addresses sampling technique, randomization, measurement of experimental error and methods
More informationA simulated annealing and hill-climbing algorithm for the traveling tournament problem
European Journal of Operational Research xxx (2005) xxx xxx Discrete Optimization A simulated annealing and hill-climbing algorithm for the traveling tournament problem A. Lim a, B. Rodrigues b, *, X.
More informationArtificial Neural Networks written examination
1 (8) Institutionen för informationsteknologi Olle Gällmo Universitetsadjunkt Adress: Lägerhyddsvägen 2 Box 337 751 05 Uppsala Artificial Neural Networks written examination Monday, May 15, 2006 9 00-14
More informationAn Effective Framework for Fast Expert Mining in Collaboration Networks: A Group-Oriented and Cost-Based Method
Farhadi F, Sorkhi M, Hashemi S et al. An effective framework for fast expert mining in collaboration networks: A grouporiented and cost-based method. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(3): 577
More informationMathematics subject curriculum
Mathematics subject curriculum Dette er ei omsetjing av den fastsette læreplanteksten. Læreplanen er fastsett på Nynorsk Established as a Regulation by the Ministry of Education and Research on 24 June
More informationCircuit Simulators: A Revolutionary E-Learning Platform
Circuit Simulators: A Revolutionary E-Learning Platform Mahi Itagi Padre Conceicao College of Engineering, Verna, Goa, India. itagimahi@gmail.com Akhil Deshpande Gogte Institute of Technology, Udyambag,
More informationA Comparison of Annealing Techniques for Academic Course Scheduling
A Comparison of Annealing Techniques for Academic Course Scheduling M. A. Saleh Elmohamed 1, Paul Coddington 2, and Geoffrey Fox 1 1 Northeast Parallel Architectures Center Syracuse University, Syracuse,
More informationModerator: Gary Weckman Ohio University USA
Moderator: Gary Weckman Ohio University USA Robustness in Real-time Complex Systems What is complexity? Interactions? Defy understanding? What is robustness? Predictable performance? Ability to absorb
More informationAlgebra 1, Quarter 3, Unit 3.1. Line of Best Fit. Overview
Algebra 1, Quarter 3, Unit 3.1 Line of Best Fit Overview Number of instructional days 6 (1 day assessment) (1 day = 45 minutes) Content to be learned Analyze scatter plots and construct the line of best
More informationUniversity of Groningen. Systemen, planning, netwerken Bosman, Aart
University of Groningen Systemen, planning, netwerken Bosman, Aart IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document
More informationBADM 641 (sec. 7D1) (on-line) Decision Analysis August 16 October 6, 2017 CRN: 83777
BADM 641 (sec. 7D1) (on-line) Decision Analysis August 16 October 6, 2017 CRN: 83777 SEMESTER: Fall 2017 INSTRUCTOR: Jack Fuller, Ph.D. OFFICE: 108 Business and Economics Building, West Virginia University,
More informationEECS 700: Computer Modeling, Simulation, and Visualization Fall 2014
EECS 700: Computer Modeling, Simulation, and Visualization Fall 2014 Course Description The goals of this course are to: (1) formulate a mathematical model describing a physical phenomenon; (2) to discretize
More informationMath 1313 Section 2.1 Example 2: Given the following Linear Program, Determine the vertices of the feasible set. Subject to:
Math 1313 Section 2.1 Example 2: Given the following Linear Program, Determine the vertices of the feasible set Subject to: Min D 3 = 3x + y 10x + 2y 84 8x + 4y 120 x, y 0 3 Math 1313 Section 2.1 Popper
More informationTABLE OF CONTENTS TABLE OF CONTENTS COVER PAGE HALAMAN PENGESAHAN PERNYATAAN NASKAH SOAL TUGAS AKHIR ACKNOWLEDGEMENT FOREWORD
TABLE OF CONTENTS TABLE OF CONTENTS COVER PAGE HALAMAN PENGESAHAN PERNYATAAN NASKAH SOAL TUGAS AKHIR ACKNOWLEDGEMENT FOREWORD TABLE OF CONTENTS LIST OF FIGURES LIST OF TABLES LIST OF APPENDICES LIST OF
More informationLecture 10: Reinforcement Learning
Lecture 1: Reinforcement Learning Cognitive Systems II - Machine Learning SS 25 Part III: Learning Programs and Strategies Q Learning, Dynamic Programming Lecture 1: Reinforcement Learning p. Motivation
More informationThe Strong Minimalist Thesis and Bounded Optimality
The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this
More information"On-board training tools for long term missions" Experiment Overview. 1. Abstract:
"On-board training tools for long term missions" Experiment Overview 1. Abstract 2. Keywords 3. Introduction 4. Technical Equipment 5. Experimental Procedure 6. References Principal Investigators: BTE:
More informationUsing the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees Cognitive Skills in Algebra on the SAT
The Journal of Technology, Learning, and Assessment Volume 6, Number 6 February 2008 Using the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees Cognitive Skills in Algebra on the
More informationFUZZY EXPERT. Dr. Kasim M. Al-Aubidy. Philadelphia University. Computer Eng. Dept February 2002 University of Damascus-Syria
FUZZY EXPERT SYSTEMS 16-18 18 February 2002 University of Damascus-Syria Dr. Kasim M. Al-Aubidy Computer Eng. Dept. Philadelphia University What is Expert Systems? ES are computer programs that emulate
More informationContinual Curiosity-Driven Skill Acquisition from High-Dimensional Video Inputs for Humanoid Robots
Continual Curiosity-Driven Skill Acquisition from High-Dimensional Video Inputs for Humanoid Robots Varun Raj Kompella, Marijn Stollenga, Matthew Luciw, Juergen Schmidhuber The Swiss AI Lab IDSIA, USI
More informationCollege Pricing. Ben Johnson. April 30, Abstract. Colleges in the United States price discriminate based on student characteristics
College Pricing Ben Johnson April 30, 2012 Abstract Colleges in the United States price discriminate based on student characteristics such as ability and income. This paper develops a model of college
More informationOn the Combined Behavior of Autonomous Resource Management Agents
On the Combined Behavior of Autonomous Resource Management Agents Siri Fagernes 1 and Alva L. Couch 2 1 Faculty of Engineering Oslo University College Oslo, Norway siri.fagernes@iu.hio.no 2 Computer Science
More informationThe presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing.
Lecture 4: OT Syntax Sources: Kager 1999, Section 8; Legendre et al. 1998; Grimshaw 1997; Barbosa et al. 1998, Introduction; Bresnan 1998; Fanselow et al. 1999; Gibson & Broihier 1998. OT is not a theory
More informationData Modeling and Databases II Entity-Relationship (ER) Model. Gustavo Alonso, Ce Zhang Systems Group Department of Computer Science ETH Zürich
Data Modeling and Databases II Entity-Relationship (ER) Model Gustavo Alonso, Ce Zhang Systems Group Department of Computer Science ETH Zürich Database design Information Requirements Requirements Engineering
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationFY16 UW-Parkside Institutional IT Plan Report
FY16 UW-Parkside Institutional IT Plan Report A. Information Technology & University Strategic Objectives [1-2 pages] 1. How was the plan developed? The plan is a compilation of input received from a wide
More informationProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis Thomas Hofmann Presentation by Ioannis Pavlopoulos & Andreas Damianou for the course of Data Mining & Exploration 1 Outline Latent Semantic Analysis o Need o Overview
More informationLearning Methods for Fuzzy Systems
Learning Methods for Fuzzy Systems Rudolf Kruse and Andreas Nürnberger Department of Computer Science, University of Magdeburg Universitätsplatz, D-396 Magdeburg, Germany Phone : +49.39.67.876, Fax : +49.39.67.8
More informationCooperative Game Theoretic Models for Decision-Making in Contexts of Library Cooperation 1
Cooperative Game Theoretic Models for Decision-Making in Contexts of Library Cooperation 1 Robert M. Hayes Abstract This article starts, in Section 1, with a brief summary of Cooperative Economic Game
More informationMGT/MGP/MGB 261: Investment Analysis
UNIVERSITY OF CALIFORNIA, DAVIS GRADUATE SCHOOL OF MANAGEMENT SYLLABUS for Fall 2014 MGT/MGP/MGB 261: Investment Analysis Daytime MBA: Tu 12:00p.m. - 3:00 p.m. Location: 1302 Gallagher (CRN: 51489) Sacramento
More informationCalibration of Confidence Measures in Speech Recognition
Submitted to IEEE Trans on Audio, Speech, and Language, July 2010 1 Calibration of Confidence Measures in Speech Recognition Dong Yu, Senior Member, IEEE, Jinyu Li, Member, IEEE, Li Deng, Fellow, IEEE
More informationImproving Action Selection in MDP s via Knowledge Transfer
In Proc. 20th National Conference on Artificial Intelligence (AAAI-05), July 9 13, 2005, Pittsburgh, USA. Improving Action Selection in MDP s via Knowledge Transfer Alexander A. Sherstov and Peter Stone
More informationRadius STEM Readiness TM
Curriculum Guide Radius STEM Readiness TM While today s teens are surrounded by technology, we face a stark and imminent shortage of graduates pursuing careers in Science, Technology, Engineering, and
More informationHonors Mathematics. Introduction and Definition of Honors Mathematics
Honors Mathematics Introduction and Definition of Honors Mathematics Honors Mathematics courses are intended to be more challenging than standard courses and provide multiple opportunities for students
More informationSpecification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments
Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments Cristina Vertan, Walther v. Hahn University of Hamburg, Natural Language Systems Division Hamburg,
More informationTruth Inference in Crowdsourcing: Is the Problem Solved?
Truth Inference in Crowdsourcing: Is the Problem Solved? Yudian Zheng, Guoliang Li #, Yuanbing Li #, Caihua Shan, Reynold Cheng # Department of Computer Science, Tsinghua University Department of Computer
More informationSARDNET: A Self-Organizing Feature Map for Sequences
SARDNET: A Self-Organizing Feature Map for Sequences Daniel L. James and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 dljames,risto~cs.utexas.edu
More informationReduce the Failure Rate of the Screwing Process with Six Sigma Approach
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 Reduce the Failure Rate of the Screwing Process with Six Sigma Approach
More informationSpring 2015 IET4451 Systems Simulation Course Syllabus for Traditional, Hybrid, and Online Classes
Spring 2015 IET4451 Systems Simulation Course Syllabus for Traditional, Hybrid, and Online Classes Instructor: Dr. Gregory L. Wiles Email Address: Use D2L e-mail, or secondly gwiles@spsu.edu Office: M
More informationCollege Pricing and Income Inequality
College Pricing and Income Inequality Zhifeng Cai U of Minnesota, Rutgers University, and FRB Minneapolis Jonathan Heathcote FRB Minneapolis NBER Income Distribution, July 20, 2017 The views expressed
More informationWhile you are waiting... socrative.com, room number SIMLANG2016
While you are waiting... socrative.com, room number SIMLANG2016 Simulating Language Lecture 4: When will optimal signalling evolve? Simon Kirby simon@ling.ed.ac.uk T H E U N I V E R S I T Y O H F R G E
More informationRule-based Expert Systems
Rule-based Expert Systems What is knowledge? is a theoretical or practical understanding of a subject or a domain. is also the sim of what is currently known, and apparently knowledge is power. Those who
More informationDocument number: 2013/ Programs Committee 6/2014 (July) Agenda Item 42.0 Bachelor of Engineering with Honours in Software Engineering
Document number: 2013/0006139 Programs Committee 6/2014 (July) Agenda Item 42.0 Bachelor of Engineering with Honours in Software Engineering Program Learning Outcomes Threshold Learning Outcomes for Engineering
More informationProbability and Game Theory Course Syllabus
Probability and Game Theory Course Syllabus DATE ACTIVITY CONCEPT Sunday Learn names; introduction to course, introduce the Battle of the Bismarck Sea as a 2-person zero-sum game. Monday Day 1 Pre-test
More informationIntel-powered Classmate PC. SMART Response* Training Foils. Version 2.0
Intel-powered Classmate PC Training Foils Version 2.0 1 Legal Information INFORMATION IN THIS DOCUMENT IS PROVIDED IN CONNECTION WITH INTEL PRODUCTS. NO LICENSE, EXPRESS OR IMPLIED, BY ESTOPPEL OR OTHERWISE,
More informationHARPER ADAMS UNIVERSITY Programme Specification
HARPER ADAMS UNIVERSITY Programme Specification 1 Awarding Institution: Harper Adams University 2 Teaching Institution: Askham Bryan College 3 Course Accredited by: Not Applicable 4 Final Award and Level:
More informationCommunities in Networks. Peter J. Mucha, UNC Chapel Hill
Communities in Networks Peter J. Mucha, UNC Chapel Hill Outline & Acknowledgements 1. What is community detection and why is it useful? 2. How do you calculate communities? Descriptive: e.g., Modularity
More informationA theoretic and practical framework for scheduling in a stochastic environment
J Sched (2009) 12: 315 344 DOI 10.1007/s10951-008-0080-x A theoretic and practical framework for scheduling in a stochastic environment Julien Bidot Thierry Vidal Philippe Laborie J. Christopher Beck Received:
More informationGenerative models and adversarial training
Day 4 Lecture 1 Generative models and adversarial training Kevin McGuinness kevin.mcguinness@dcu.ie Research Fellow Insight Centre for Data Analytics Dublin City University What is a generative model?
More informationPRINCE2 Foundation (2009 Edition)
Foundation (2009 Edition) Course Overview PRINCE2 is a world recognised process based project management method that is easily tailored and scaleable for the management of all types of projects within
More informationBluetooth mlearning Applications for the Classroom of the Future
Bluetooth mlearning Applications for the Classroom of the Future Tracey J. Mehigan, Daniel C. Doolan, Sabin Tabirca Department of Computer Science, University College Cork, College Road, Cork, Ireland
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationRunning Head: Implementing Articulate Storyline using the ADDIE Model 1. Implementing Articulate Storyline using the ADDIE Model.
Running Head: Implementing Articulate Storyline using the ADDIE Model 1 Implementing Articulate Storyline using the ADDIE Model Daniel Littleton The University of Arkansas at Little Rock LSTE 7320 Implementing
More informationEmergency Management Games and Test Case Utility:
IST Project N 027568 IRRIIS Project Rome Workshop, 18-19 October 2006 Emergency Management Games and Test Case Utility: a Synthetic Methodological Socio-Cognitive Perspective Adam Maria Gadomski, ENEA
More informationOPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS
OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS Václav Kocian, Eva Volná, Michal Janošek, Martin Kotyrba University of Ostrava Department of Informatics and Computers Dvořákova 7,
More informationSpring 2014 SYLLABUS Michigan State University STT 430: Probability and Statistics for Engineering
Spring 2014 SYLLABUS Michigan State University STT 430: Probability and Statistics for Engineering Time and Place: MW 3:00-4:20pm, A126 Wells Hall Instructor: Dr. Marianne Huebner Office: A-432 Wells Hall
More informationActive Learning. Yingyu Liang Computer Sciences 760 Fall
Active Learning Yingyu Liang Computer Sciences 760 Fall 2017 http://pages.cs.wisc.edu/~yliang/cs760/ Some of the slides in these lectures have been adapted/borrowed from materials developed by Mark Craven,
More informationStopping rules for sequential trials in high-dimensional data
Stopping rules for sequential trials in high-dimensional data Sonja Zehetmayer, Alexandra Graf, and Martin Posch Center for Medical Statistics, Informatics and Intelligent Systems Medical University of
More informationCSC200: Lecture 4. Allan Borodin
CSC200: Lecture 4 Allan Borodin 1 / 22 Announcements My apologies for the tutorial room mixup on Wednesday. The room SS 1088 is only reserved for Fridays and I forgot that. My office hours: Tuesdays 2-4
More informationProcess to Identify Minimum Passing Criteria and Objective Evidence in Support of ABET EC2000 Criteria Fulfillment
Session 2532 Process to Identify Minimum Passing Criteria and Objective Evidence in Support of ABET EC2000 Criteria Fulfillment Dr. Fong Mak, Dr. Stephen Frezza Department of Electrical and Computer Engineering
More informationPlanning with External Events
94 Planning with External Events Jim Blythe School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 blythe@cs.cmu.edu Abstract I describe a planning methodology for domains with uncertainty
More informationUncertainty concepts, types, sources
Copernicus Institute SENSE Autumn School Dealing with Uncertainties Bunnik, 8 Oct 2012 Uncertainty concepts, types, sources Dr. Jeroen van der Sluijs j.p.vandersluijs@uu.nl Copernicus Institute, Utrecht
More informationVisit us at:
White Paper Integrating Six Sigma and Software Testing Process for Removal of Wastage & Optimizing Resource Utilization 24 October 2013 With resources working for extended hours and in a pressurized environment,
More informationExecutive Guide to Simulation for Health
Executive Guide to Simulation for Health Simulation is used by Healthcare and Human Service organizations across the World to improve their systems of care and reduce costs. Simulation offers evidence
More informationTeam Formation for Generalized Tasks in Expertise Social Networks
IEEE International Conference on Social Computing / IEEE International Conference on Privacy, Security, Risk and Trust Team Formation for Generalized Tasks in Expertise Social Networks Cheng-Te Li Graduate
More informationWhy Did My Detector Do That?!
Why Did My Detector Do That?! Predicting Keystroke-Dynamics Error Rates Kevin Killourhy and Roy Maxion Dependable Systems Laboratory Computer Science Department Carnegie Mellon University 5000 Forbes Ave,
More information48 contact hours using STANDARD version of Study & Solutions Kit
Proposed course outline for: ICB Management Accounting Control Systems 48 contact hours using STANDARD version of Study & Solutions Kit Note: Should learners use the PRO version of the Study & Solutions
More informationA Data Fusion Model for Location Estimation in Construction
26th International Symposium on Automation and Robotics in Construction (ISARC 2009) A Data Fusion Model for Location Estimation in Construction S.N.Razavi 1 and C.T.Hass 2 1 PhD Candidate, Department
More information1.11 I Know What Do You Know?
50 SECONDARY MATH 1 // MODULE 1 1.11 I Know What Do You Know? A Practice Understanding Task CC BY Jim Larrison https://flic.kr/p/9mp2c9 In each of the problems below I share some of the information that
More informationMassachusetts Institute of Technology Tel: Massachusetts Avenue Room 32-D558 MA 02139
Hariharan Narayanan Massachusetts Institute of Technology Tel: 773.428.3115 LIDS har@mit.edu 77 Massachusetts Avenue http://www.mit.edu/~har Room 32-D558 MA 02139 EMPLOYMENT Massachusetts Institute of
More informationFive Challenges for the Collaborative Classroom and How to Solve Them
An white paper sponsored by ELMO Five Challenges for the Collaborative Classroom and How to Solve Them CONTENTS 2 Why Create a Collaborative Classroom? 3 Key Challenges to Digital Collaboration 5 How Huddle
More informationHigh-level Reinforcement Learning in Strategy Games
High-level Reinforcement Learning in Strategy Games Christopher Amato Department of Computer Science University of Massachusetts Amherst, MA 01003 USA camato@cs.umass.edu Guy Shani Department of Computer
More informationCS Machine Learning
CS 478 - Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing
More informationAgents and environments. Intelligent Agents. Reminders. Vacuum-cleaner world. Outline. A vacuum-cleaner agent. Chapter 2 Actuators
s and environments Percepts Intelligent s? Chapter 2 Actions s include humans, robots, softbots, thermostats, etc. The agent function maps from percept histories to actions: f : P A The agent program runs
More informationProbability estimates in a scenario tree
101 Chapter 11 Probability estimates in a scenario tree An expert is a person who has made all the mistakes that can be made in a very narrow field. Niels Bohr (1885 1962) Scenario trees require many numbers.
More informationTIMSS ADVANCED 2015 USER GUIDE FOR THE INTERNATIONAL DATABASE. Pierre Foy
TIMSS ADVANCED 2015 USER GUIDE FOR THE INTERNATIONAL DATABASE Pierre Foy TIMSS Advanced 2015 orks User Guide for the International Database Pierre Foy Contributors: Victoria A.S. Centurino, Kerry E. Cotter,
More informationGeorgetown University at TREC 2017 Dynamic Domain Track
Georgetown University at TREC 2017 Dynamic Domain Track Zhiwen Tang Georgetown University zt79@georgetown.edu Grace Hui Yang Georgetown University huiyang@cs.georgetown.edu Abstract TREC Dynamic Domain
More information