DESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017)
|
|
- Rosemary Butler
- 5 years ago
- Views:
Transcription
1 DESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017) Veli Mäkinen 12/05/2017 1
2 COURSE STRUCTURE 7 weeks: video lecture -> demo lecture -> study group -> exercise Video lecture: Overview, main concepts, algorithm animations, simple examples Demonstration lecture (blackboard): Proofs, model solutions, corner cases, derivations, problem solving Study group: Problem solving in groups following the model from the lecture Exercise session: Problem solving on your own DAA 2017 week 1 / Veli Mäkinen 12/05/2017 2
3 DAA 2017 week 1 / Veli Mäkinen 12/05/2017 3
4 BACKGROUND Balanced trees, recursion, merge sort, big-o-notation, shortest paths in graphs, topological sort, connected components, spanning trees, Bellman-Ford, Dijkstra, Floyd-Warshall Chapters 1, 2, 3, 22, 23, 24, 25 We will revisit these when needed DAA 2017 week 1 / Veli Mäkinen 12/05/2017 4
5 TOPICS Week I: Simple recursions and their analysis (4-4.1, , 7.1). Overview of amortized analysis (Cartesian tree construction, dynamic arrays ). Week II : More complex recurrences for divide and conquer type of problems (4.2,9.3) Week III: Network flows with an aim to introduce to reductions and shortest paths ( ). Simple dynamic programming tasks like segmentation (1d clustering). Week IV: More complex dynamic programming, like those related to trees (15.2, 15.5) Week V: NP-hardness without formalities, example reductions, approximation algorithms (34 and 35 lightweight) Week VI: NP-hardness with formalities, including Cook theorem and encodings (34 heavyweight) Week VII: Randomized algorithms touching someway all the previous topics (5,7 + relevant parts of other chapters) DAA 2017 week 1 / Veli Mäkinen 12/05/2017 5
6 ANALYSIS OF RECURRENCES & AMORTIZED ANALYSIS DAA 2017 week 1 / Veli Mäkinen 12/05/2017 6
7 ANALYSIS OF RECURRENCES Three methods Substitution method (pp ) Recursion-tree method (pp ) Master method (pp ) Quicksort (Chapter 7, animation) We will continue on Week II with this topic, combining advanced recursive algorithms to the game DAA 2017 week 1 / Veli Mäkinen 12/05/2017 7
8 QUICKSORT pivot Bad pivot causes recursion tree to be skewed O(n 2 ) worst case. We learn next week how to select median as pivot in linear time! DAA 2017 week 1 / Veli Mäkinen 12/05/2017 8
9 QUICKSORT WITH PERFECT PIVOT log n levels O(n) work on each level O(n log n) time This is called the recursion tree method. DAA 2017 week 1 / Veli Mäkinen 12/05/2017 9
10 QUICKSORT WITH PERFECT PIVOT Running time can also be stated as T(n) = 2T(n/2)+O(n), with base case T(1)=O(1). We can use substitution method to show that T(n)=O(n log n) Substitution method: 1. Assume by induction that the guessed bound holds true for inputs shorter than n. 2. Substitute the recurrences with the bounds assumed true by induction. 3. Show that the bound holds also for n. 4. Check that the induction base cases also hold. DAA 2017 week 1 / Veli Mäkinen 12/05/
11 SUBSTITUTION METHOD EXAMPLE Observation: big-o() notation is not compatible with substitution method, as we need more exact claims for induction to work. Hence, to solve T(n) = 2T(n/2)+O(n), we claim T(n) c n log n, where c is some constant. We also assume n=2 k for some integer k>0 (why is this fine to assume?). 1. Assume by induction T(n/2) cn/2 log (n/2). 2. T(n) = 2T(n/2)+O(n) cn log n-cn+an, for some constant a. 3. We notice that T(n) cn log n, for any c a. 4. T(1)=a by definition, T(2)=4a by definition, T(2) c2 log 2=c2, so we can pick e.g. c=2a to make the base case hold, so that T(n) cn log n holds by induction. DAA 2017 week 1 / Veli Mäkinen 12/05/
12 MASTER METHOD The pattern to analyse a recurrence by substitution method is usually quite similar, yet we will see more complex examples. Master Theorem characterizes many cases of recurrences of type T(n) = at(n/b)+f(n). Depending on the relationship between a,b, and f(n), three different outcomes for T(n) follow. This gives a Master method to solve this kind of recurrences: Check for which of the three cases your recurrence belongs, if any. We will state this theorem on demonstration lecture and practice the use of it. DAA 2017 week 1 / Veli Mäkinen 12/05/
13 AMORTIZED ANALYSIS Consider algorithms whose running time can be expressed as (time of a step) * (number of steps)=t step * #steps = t total E.g. linked list: O(1) append * n items added = O(n) Sometimes a single step can take long time, but the total time is much smaller than what the simple analysis gives Work done on heavy steps can be charged on the light steps Amortized cost of a step = t total / #steps Examples: Cartesian tree construction (separate pdf, animation) Dynamic array (17.4.2, animation) DAA 2017 week 1 / Veli Mäkinen 12/05/
14 CARTESIAN TREE CT(A) A = DAA 2017 week 1 / Veli Mäkinen 12/05/
15 CARTESIAN TREE CONSTRUCTION 7 DAA 2017 week 1 / Veli Mäkinen 12/05/
16 CARTESIAN TREE CONSTRUCTION 7 9 DAA 2017 week 1 / Veli Mäkinen 12/05/
17 CARTESIAN TREE CONSTRUCTION 7 9 DAA 2017 week 1 / Veli Mäkinen 12/05/
18 CARTESIAN TREE CONSTRUCTION DAA 2017 week 1 / Veli Mäkinen 12/05/
19 CARTESIAN TREE CONSTRUCTION DAA 2017 week 1 / Veli Mäkinen 12/05/
20 CARTESIAN TREE CONSTRUCTION DAA 2017 week 1 / Veli Mäkinen 12/05/
21 CARTESIAN TREE CONSTRUCTION DAA 2017 week 1 / Veli Mäkinen 12/05/
22 CARTESIAN TREE Comparing a new item to all items in the right-most path may take O(n) time But after comparing an old item, you either do a local arrangement to insert the new item, or never compare that old item again (by-pass). The total running time is #by-passes + #insertions, which both are O(n). Hence, the amortized cost of modifying CT(A[1..n-1]) into CT(A[1..n]) is O(1). DAA 2017 week 1 / Veli Mäkinen 12/05/
23 DYNAMIC ARRAY / TABLE After last expansion to size n, there are at least n/4 deletions before shrinking (contracting). Before next doubling, there are at least n/2 insertions. Bad idea Think of charging 2 copies on each insertion / deletion. Before each doubling / shrinking you have already payed the copy work. Constant amortized insert / delete in an array. DAA 2017 week 1 / Veli Mäkinen 12/05/
24 STRATEGIES FOR AMORTIZED ANALYSIS Aggregate method Show that each step grows some quantity that is bounded. The bound on the quantity can be used to show that total time used for all steps is proportional to that same bound. In Cartesian tree construction, each operation added one to #by-passes or #insertions. Both are bounded by n, and hence the total number of operations is at most 2n. Accounting method Pay in advance the expensive operations by charging them from the cheap operations. Then show that any sequence of operations has more operations in bank account than the number of true operations. In Dynamic array we pay 2 copy operations at each insertion or deletion. Consider any sequence of operations after a shrink / doubling to size n until next a) shrink or b) doubling. In case a) n/4 deletions have gathered deposit n/2, which is sufficient to copy n/4 elements to a new location. In case b) n/2 insertions have gathered deposit n which is sufficient to copy n elements to a new location. DAA 2017 week 1 / Veli Mäkinen 12/05/
25 STRATEGIES FOR AMORTIZED ANALYSIS Potential method Let p(t), p(t) 0, be a potential of data structure after t operations with p(0)=0. Let at(t)=c(t)+p(t)-p(t-1) be the amortized time of operation t, where c(t) is the actual cost of that operation. By telescoping cancellation one can see that the sum of amortized times of n operations is c(1)+c(2)+ c(n)+p(n) and thus an upper bound for the actual running time. To show e.g. that total running time is linear, it is sufficient to show that for each type of operation amortized time is constant! This kind of analysis requires a good guess on p(t). Consider Dynamic array with insertions only. Let p(t)=2m-n, where n is the size of the array and m is the number of elements: For insertions not causing doubling, at(t)=1+2m-n-(2(m-1)-n)=3. For insertions causing doubling, at(t)=n/2+1+2(n/2+1)-n-(2n/2-n/2)=3. DAA 2017 week 1 / Veli Mäkinen 12/05/
26 AMORTIZED ANALYSIS VS COMPLEXITY Amortized analysis is a technique to analyse (worst case) complexity of an algorithm E.g. Cartesian tree construction takes linear worst case time. Amortized complexity refers to operations on data structures: Any series of n operations takes t total time, hence one operation takes amortized t total / n time. One can talk about amortized complexity or amortized cost of an operation. Some subset of supported operations might even have good worst case bounds. E.g. Insert / delete on dynamic arrays have amortized complexity O(1) Any series of n intermixed insertions / deletions take O(n) worst case time. DAA 2017 week 1 / Veli Mäkinen 12/05/
27 AMORTIZED ANALYSIS ELSEWHERE String processing algorithms, Period II, Autumn 2018: Knuth-Morris-Pratt, Aho-Corasick, suffix tree construction, LCP array construction We will also come back to this, connecting Cartesian trees with dynamic programming on Weeks III-IV DAA 2017 week 1 / Veli Mäkinen 12/05/
SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY :: PUTTUR (AUTONOMOUS) Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
Subject with Code : Data Structures(16MC806) Course & Specialization: MCA UNIT I Sorting, Searching and Directories 1. Explain how to sort the elements by using insertion sort and derive time complexity
More informationVisual Traffic Jam Analysis Based on Trajectory Data
Visual Traffic Jam Analysis Based on Trajectory Data Zuchao Wang, Min Lu, Xiaoru Yuan, Peking University Junping Zhang, Fudan University Huub van de Wetering, Technische Universiteit Eindhoven Introduction
More informationBulgarian Olympiad in Informatics: Excellence over a Long Period of Time
Olympiads in Informatics, 2017, Vol. 11, 151 158 2017 IOI, Vilnius University DOI: 10.15388/ioi.2017.12 151 Bulgarian Olympiad in Informatics: Excellence over a Long Period of Time Emil KELEVEDJIEV 1,
More information6/16/2010 DAG Execu>on Model, Work and Depth 1 DAG EXECUTION MODEL, WORK AND DEPTH
6/16/2010 DAG Execu>on Model, Work and Depth 1 DAG EXECUTION MODEL, WORK AND DEPTH 6/16/2010 DAG Execu>on Model, Work and Depth 2 Computa>onal Complexity of (Sequen>al) Algorithms Model: Each step takes
More informationAlgorithms and Data Structures
Algorithms and Data Structures CMPSC 465 LECTURES 22-23 Binary Search Trees Adam Smith S. Raskhodnikova and A. Smith. Based on slides by C. Leiserson and E. Demaine. 1 Heaps: Review Heap-leap-jeep-creep(A):
More informationCSE 3401: Intro to AI & LP Uninformed Search II
CSE 3401: Intro to AI & LP Uninformed Search II Required Readings: R & N Chapter 3, Sec. 1-4. 1 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea }, {Zerind,
More information1.1 The size of the search space Modeling the problem Change over time Constraints... 21
Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 I What Are the Ages of My Three Sons? : : : : : : : : : : : : : : : : : 9 1 Why Are Some Problems Dicult to Solve? : : :
More informationCT PET-2018 Part - B Phd COMPUTER APPLICATION Sample Question Paper
CT PET-2018 Part - B Phd COMPUTER APPLICATION Sample Question Paper Note: All Questions are compulsory. Each question carry one mark. 1. Error detection at the data link layer is achieved by? [A] Bit stuffing
More informationBetter Search Improved Uninformed Search CIS 32
Better Search Improved Uninformed Search CIS 32 Functionally PROJECT 1: Lunar Lander Game - Demo + Concept - Open-Ended: No One Solution - Menu of Point Options - Get Started NOW!!! - Demo After Spring
More informationCS Lecture 5. Vidroha debroy. Material adapted courtesy of Prof. Xiangnan Kong and Prof. Carolina Ruiz at Worcester Polytechnic Institute
CS 3353 Lecture 5 Vidroha debroy Material adapted courtesy of Prof. Xiangnan Kong and Prof. Carolina Ruiz at Worcester Polytechnic Institute Searching for a number Find a specific number 91-3 26 54 73
More informationAlgebra I: A Fresh Approach. By Christy Walters
Algebra I: A Fresh Approach By Christy Walters 2005 A+ Education Services All rights reserved. No part of this publication may be reproduced, distributed, stored in a retrieval system, or transmitted,
More informationQuadratic Probing. Hash Tables (continued) & Disjoint Sets. Quadratic Probing. Quadratic Probing Example insert(40) 40%7 = 5
Hash Tables (continued) & Disjoint ets Chapter & in Weiss Quadratic Probing f(i) = i Probe sequence: th probe = h(k) mod Tableize th probe = (h(k) + ) mod Tableize th probe = (h(k) + ) mod Tableize th
More informationECE 697B (667) Spring 2003
ECE 667 - Synthesis & Verification - Lecture 2 ECE 697 (667) Spring 23 Synthesis and Verification of Digital Systems unctional Decomposition Slides adopted (with permission) from. Mishchenko, 23 Overview
More informationPlanning and Acting in Partially Observable Stochastic Domains
Planning and Acting in Partially Observable Stochastic Domains Leslie Pack Kaelbling and Michael L. Littman and Anthony R. Cassandra (1998). Planning and Acting in Partially Observable Stochastic Domains,
More informationCS 4649/7649 Robot Intelligence: Planning
CS 4649/7649 Robot Intelligence: Planning Roadmap Approaches Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu) 1 *Slides
More informationCSE 3402: Intro to Artificial Intelligence Uninformed Search II
CSE 3402: Intro to Artificial Intelligence Uninformed Search II Required Readings: Chapter 3, Sec. 1-4. 1 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea },
More informationThe system design must obey these constraints. The system is to have the minimum cost (capital plus operating) while meeting the constraints.
Computer Algorithms in Systems Engineering Spring 2010 Problem Set 6: Building ventilation design (dynamic programming) Due: 12 noon, Wednesday, April 21, 2010 Problem statement Buildings require exhaust
More informationAlgebra I: Strand 3. Quadratic and Nonlinear Functions; Topic 1. Pythagorean Theorem; Task 3.1.2
Algebra I: Strand 3. Quadratic and Nonlinear Functions; Topic. Pythagorean Theorem; Task 3.. TASK 3..: 30-60 RIGHT TRIANGLES Solutions. Shown here is a 30-60 right triangle that has one leg of length and
More informationCritical Systems Validation
Critical Systems Validation Objectives To explain how system reliability can be measured and how reliability growth models can be used for reliability prediction To describe safety arguments and how these
More informationDecision Trees. Nicholas Ruozzi University of Texas at Dallas. Based on the slides of Vibhav Gogate and David Sontag
Decision Trees Nicholas Ruozzi University of Texas at Dallas Based on the slides of Vibhav Gogate and David Sontag Announcements Course TA: Hao Xiong Office hours: Friday 2pm-4pm in ECSS2.104A1 First homework
More informationAuthor s Name Name of the Paper Session. Positioning Committee. Marine Technology Society. DYNAMIC POSITIONING CONFERENCE September 18-19, 2001
Author s Name Name of the Paper Session PDynamic Positioning Committee Marine Technology Society DYNAMIC POSITIONING CONFERENCE September 18-19, 2001 POWER PLANT SESSION A New Concept for Fuel Tight DP
More informationCalculation of Trail Usage from Counter Data
1. Introduction 1 Calculation of Trail Usage from Counter Data 1/17/17 Stephen Martin, Ph.D. Automatic counters are used on trails to measure how many people are using the trail. A fundamental question
More information77.1 Apply the Pythagorean Theorem
Right Triangles and Trigonometry 77.1 Apply the Pythagorean Theorem 7.2 Use the Converse of the Pythagorean Theorem 7.3 Use Similar Right Triangles 7.4 Special Right Triangles 7.5 Apply the Tangent Ratio
More informationTwo Special Right Triangles
Page 1 of 7 L E S S O N 9.3 In an isosceles triangle, the sum of the square roots of the two equal sides is equal to the square root of the third side. Two Special Right Triangles In this lesson you will
More informationSearch I. Tuomas Sandholm Carnegie Mellon University Computer Science Department. [Read Russell & Norvig Chapter 3]
Search I Tuomas Sandholm Carnegie Mellon University Computer Science Department [Read Russell & Norvig Chapter 3] Search I Goal-based agent (problem solving agent) Goal formulation (from preferences).
More informationCH 34 MORE PYTHAGOREAN THEOREM AND RECTANGLES
CH 34 MORE PYTHAGOREAN THEOREM AND RECTANGLES 317 Recalling The Pythagorean Theorem a 2 + b 2 = c 2 a c 90 b The 90 angle is called the right angle of the right triangle. The other two angles of the right
More informationLEARNING OBJECTIVES. Overview of Lesson. guided practice Teacher: anticipates, monitors, selects, sequences, and connects student work
D Rate, Lesson 1, Conversions (r. 2018) RATE Conversions Common Core Standard N.Q.A.1 Use units as a way to understand problems and to guide the solution of multi-step problems; choose and interpret units
More informationUninformed search methods II.
CS 1571 Introduction to AI Lecture 5 Uninformed search methods II. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Uninformed methods Uninformed search methods use only information available in
More informationRulebook Revision 2016 v1.0 Published September 18, 2015 Sponsored By
Rulebook Revision 2016 v1.0 Published September 18, 2015 Sponsored By 1 Table of Contents 1 General Overview... 3 1.1 General Team Rules... 3 2 Mini-Urban Challenge... 4 2.1 The Challenge... 4 2.2 Navigation...
More information#7 Still more DP, Scoring Matrices 9/5/07
#7 Still more DP, Scoring Matrices 9/5/7 BB 444/544 Lecture 7 Still more: Dynamic Programming Global vs Local lignment Scoring Matrices & lignment Statistics BLS nope #7_Sept5 Required Reading (before
More informationCS 351 Design of Large Programs Zombie House
CS 351 Design of Large Programs Zombie House Instructor: Joel Castellanos e-mail: joel@unm.edu Web: http://cs.unm.edu/~joel/ Office: Electrical and Computer Engineering building (ECE). Room 233 2/23/2017
More informationA COURSE OUTLINE (September 2001)
189-265A COURSE OUTLINE (September 2001) 1 Topic I. Line integrals: 2 1 2 weeks 1.1 Parametric curves Review of parametrization for lines and circles. Paths and curves. Differentiation and integration
More informationEngineering Note. Algorithms. Overview. Detailed Algorithm Description. NeoFox Calibration and Measurement. Products Affected: NeoFox
Engineering Note Topic: NeoFox Calibration and Measurement Products Affected: NeoFox Date Issued: 04/18/2011 Algorithms Overview NeoFox is a dynamic measurement system that has been designed to work with
More informationCOMP219: Artificial Intelligence. Lecture 8: Combining Search Strategies and Speeding Up
COMP219: Artificial Intelligence Lecture 8: Combining Search Strategies and Speeding Up 1 Overview Last time Basic problem solving techniques: Breadth-first search complete but expensive Depth-first search
More informationOverview. Depth Limited Search. Depth Limited Search. COMP219: Artificial Intelligence. Lecture 8: Combining Search Strategies and Speeding Up
COMP219: Artificial Intelligence Lecture 8: Combining Search Strategies and Speeding Up Last time Basic problem solving techniques: Breadth-first search complete but expensive Depth-first search cheap
More informationWhy We Should Use the Bullpen Differently
Why We Should Use the Bullpen Differently A look into how the bullpen can be better used to save runs in Major League Baseball. Andrew Soncrant Statistics 157 Final Report University of California, Berkeley
More informationEfficient Minimization of Routing Cost in Delay Tolerant Networks
Computer Science Department Christos Tsiaras tsiaras@aueb.gr Master Thesis Presentation (short edition) Efficient Minimization of Routing Cost in Delay Tolerant Networks Supervised by Dr. Stavros Toumpis
More informationTIMETABLING IN SPORTS AND ENTERTAINMENT
TIMETABLING IN SPORTS AND ENTERTAINMENT Introduction More complicated applications of interval scheduling and timetabling: scheduling of games in tournaments scheduling of commercials on network television
More informationAlgebra I: A Fresh Approach. By Christy Walters
Algebra I: A Fresh Approach By Christy Walters 2016 A+ Education Services All rights reserved. No part of this publication may be reproduced, distributed, stored in a retrieval system, or transmitted,
More informationA study on the relation between safety analysis process and system engineering process of train control system
A study on the relation between safety analysis process and system engineering process of train control system Abstract - In this paper, the relationship between system engineering lifecycle and safety
More informationORF 201 Computer Methods in Problem Solving. Final Project: Dynamic Programming Optimal Sailing Strategies
Princeton University Department of Operations Research and Financial Engineering ORF 201 Computer Methods in Problem Solving Final Project: Dynamic Programming Optimal Sailing Strategies Due 11:59 pm,
More informationPrediction Market and Parimutuel Mechanism
Prediction Market and Parimutuel Mechanism Yinyu Ye MS&E and ICME Stanford University Joint work with Agrawal, Peters, So and Wang Math. of Ranking, AIM, 2 Outline World-Cup Betting Example Market for
More informationCMIMC 2018 Official Contest Information
CMIMC 2018 Official Contest Information CMIMC Staff Latest version: January 14, 2018 1 Introduction 1. This document is the official contest information packet for the 2018 Carnegie Mellon Informatics
More informationLABORATORY EXERCISE 1 CONTROL VALVE CHARACTERISTICS
Date: Name: LABORATORY EXERCISE 1 CONTROL VALVE CHARACTERISTICS OBJECTIVE: To demonstrate the relation between valve stem position and the fluid flow through a control valve, for both linear and equal
More informationApplication of Dijkstra s Algorithm in the Evacuation System Utilizing Exit Signs
Application of Dijkstra s Algorithm in the Evacuation System Utilizing Exit Signs Jehyun Cho a, Ghang Lee a, Jongsung Won a and Eunseo Ryu a a Dept. of Architectural Engineering, University of Yonsei,
More informationAllocations vs Announcements
Allocations vs Announcements A comparison of RIR IPv4 Allocation Records with Global Routing Announcements Geoff Huston May 2004 (Activity supported by APNIC) BGP Prefix Length Filters Some years back
More informationOptimizing Cyclist Parking in a Closed System
Optimizing Cyclist Parking in a Closed System Letu Qingge, Killian Smith Gianforte School of Computing, Montana State University, Bozeman, MT 59717, USA Abstract. In this paper, we consider the two different
More informationAnnouncements. Unit 7: Multiple Linear Regression Lecture 3: Case Study. From last lab. Predicting income
Announcements Announcements Unit 7: Multiple Linear Regression Lecture 3: Case Study Statistics 101 Mine Çetinkaya-Rundel April 18, 2013 OH: Sunday: Virtual OH, 3-4pm - you ll receive an email invitation
More informationLecture 10. Support Vector Machines (cont.)
Lecture 10. Support Vector Machines (cont.) COMP90051 Statistical Machine Learning Semester 2, 2017 Lecturer: Andrey Kan Copyright: University of Melbourne This lecture Soft margin SVM Intuition and problem
More informationLecture 16: Chapter 7, Section 2 Binomial Random Variables
Lecture 16: Chapter 7, Section 2 Binomial Random Variables!Definition!What if Events are Dependent?!Center, Spread, Shape of Counts, Proportions!Normal Approximation Cengage Learning Elementary Statistics:
More informationReduction of Bitstream Transfer Time in FPGA
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 2, Ver. III (Mar - Apr. 2014), PP 82-86 Reduction of Bitstream Transfer Time in
More informationNavigate to the golf data folder and make it your working directory. Load the data by typing
Golf Analysis 1.1 Introduction In a round, golfers have a number of choices to make. For a particular shot, is it better to use the longest club available to try to reach the green, or would it be better
More information5.8 The Pythagorean Theorem
5.8. THE PYTHAGOREAN THEOREM 437 5.8 The Pythagorean Theorem Pythagoras was a Greek mathematician and philosopher, born on the island of Samos (ca. 582 BC). He founded a number of schools, one in particular
More informationII. NORMAL BUBBLE SORT (WORST CASE)
A New Approach to Improve Worst Case Efficiency of Bubble Sort Vipul Sharma * Department of Computer Science & Engineering National Institute of Technology (Srinagar, J&K) Abstract Sorting is one of the
More informationExcel Solver Case: Beach Town Lifeguard Scheduling
130 Gebauer/Matthews: MIS 213 Hands-on Tutorials and Cases, Spring 2015 Excel Solver Case: Beach Town Lifeguard Scheduling Purpose: Optimization under constraints. A. GETTING STARTED All Excel projects
More informationCITTT CLUB PLAY SYSTEM
CITTT CLUB PLAY SYSTEM JED YANG First Draft October 14, 2007 http://clubs.caltech.edu/~tabletennis/ccps.pdf Abstract. We claim that the quality of table tennis club play can be increased if players are
More informationPiecewise Functions. Updated: 05/15/10
Connecting Algebra 1 to Advanced Placement* Mathematics A Resource and Strategy Guide Updated: 05/15/ Objectives: Students will review linear functions and their properties and be introduced to piecewise
More informationAcknowledgement: Author is indebted to Dr. Jennifer Kaplan, Dr. Parthanil Roy and Dr Ashoke Sinha for allowing him to use/edit many of their slides.
Acknowledgement: Author is indebted to Dr. Jennifer Kaplan, Dr. Parthanil Roy and Dr Ashoke Sinha for allowing him to use/edit many of their slides. Topic for this lecture 0Today s lecture s materials
More informationOverview. Time Learning Activities Learning Outcomes. 10 Workshop Introduction
Overview Time Learning Activities Learning Outcomes 10 Workshop Introduction 40 Town Hall Presentation Pitching Phases 20 Jig Saw Grips Pair and Share, Storm and Solve, Fish Bowl 55 Understanding your
More informationChapter 10. Right Triangles
Chapter 10 Right Triangles If we looked at enough right triangles and experimented a little, we might eventually begin to notice some relationships developing. For instance, if I were to construct squares
More informationPREAMBLE. Why the Informatics Olympiad in Team were born
PREAMBLE Why the Informatics Olympiad in Team were born 1. The primary objective is to stimulate the interest of young people in Computer Science and Information Technologies alongside to Personal Computer
More informationDynamic Programming: The Matrix Chain Algorithm
Dynamic Programming: The Matrix Chain Algorithm Andreas Klappenecker [partially based on slides by Prof. Welch] Matrix Chain Problem Suppose that we want to multiply a sequence of rectangular matrices.
More informationThe development and testing of a manual notation system for identifying successful and unsuccessful shooting ratio in football / soccer
The development and testing of a manual notation system for identifying successful and unsuccessful shooting ratio in football / soccer Hughes (1973) stated that shooting is not only the most exciting
More informationPaul Burkhardt. May 19, 2016
GraphEx Symposium 2016 U.S. National Security Agency Research Directorate May 19, 2016 Graphs are everywhere! Why graph? Graph-theoretic approaches are appealing to many fields simple data abstraction
More informationTHE MAGICAL PROPERTY OF 60 KM/H AS A SPEED LIMIT? JOHN LAMBERT,
THE MAGICAL PROPERTY OF 60 KM/H AS A SPEED LIMIT? JOHN LAMBERT, MIEAust, CPENG 180 785, B.Eng (Agric), ARMIT (Mech). John Lambert and Associates Pty Ltd ABSTRACT Kloeden et al (1997) found that in a 60
More information4.7 Arithmetic Sequences. Arithmetic sequences
4.7 Arithmetic Sequences (Recursive & Explicit Formulas) Arithmetic sequences are linear functions that have a domain of positive consecutive integers in which the difference between any two consecutive
More informationMathematics 7 WORKBOOK
EXAM FEVER Mathematics 7 WORKBOOK This book belongs to: Exam Fever Publishers PIETERMARITZBURG www.examfever.co.za Table of Contents TERM 1 Chapter and Topic Page 1. Whole Numbers 1 2. Exponents 15 3.
More informationSimplifying Radical Expressions and the Distance Formula
1 RD. Simplifying Radical Expressions and the Distance Formula In the previous section, we simplified some radical expressions by replacing radical signs with rational exponents, applying the rules of
More informationAlgebra Date Lesson Independent Work Computer Tuesday, Introduction (whole class) Problem with Dice
Tuesday, Introduction (whole class) Problem with Dice Critical Thinking Puzzles 3 Station expectations Count the Squares Math Riddles Wednesday, Computer expectations (whole class) Tangrams Read permission
More informationintended velocity ( u k arm movements
Fig. A Complete Brain-Machine Interface B Human Subjects Closed-Loop Simulator ensemble action potentials (n k ) ensemble action potentials (n k ) primary motor cortex simulated primary motor cortex neuroprosthetic
More informationIntroduction to Algorithms
Introduction to Algorithms 6.46J/.4J LECTURE 7 Shortest Paths I Properties o shortest paths Dijkstra s Correctness Analysis Breadth-irst Paths in graphs Consider a digraph G = (V, E) with edge-weight unction
More informationENHANCED PARKWAY STUDY: PHASE 2 CONTINUOUS FLOW INTERSECTIONS. Final Report
Preparedby: ENHANCED PARKWAY STUDY: PHASE 2 CONTINUOUS FLOW INTERSECTIONS Final Report Prepared for Maricopa County Department of Transportation Prepared by TABLE OF CONTENTS Page EXECUTIVE SUMMARY ES-1
More informationBasketball Agent 101 Syllabus
Basketball Agent 101 Syllabus Course Description Examines the skills, tools and techniques needed to become a NBA sports agent; as well as an overview of the interconnected positions associated with the
More informationRUGBY is a dynamic, evasive, and highly possessionoriented
VISUALIZING RUGBY GAME STYLES USING SOMS 1 Visualizing Rugby Game Styles Using Self-Organizing Maps Peter Lamb, Hayden Croft Abstract Rugby coaches and analysts often use notational data describing match
More informationNCCP Swimming 301 Course Summary
1 INTRODUCTION 3:30 This module provides coaches with an overview of the 301 course, what is expected of the coaches and most importantly what coaches can expect to get out of attending the 301 course.
More informationDepartment of Internal Affairs Mandatory Non-Financial Performance Measures 2013 Roads and Footpaths
Road Asset Technical Accord - RATA The Centre of Excellence for Road Asset Planning in the Waikato Region Department of Internal Affairs Mandatory Non-Financial Performance Measures 2013 Roads and Footpaths
More informationIn memory of Dr. Kevin P. Granata, my graduate advisor, who was killed protecting others on the morning of April 16, 2007.
Acknowledgement In memory of Dr. Kevin P. Granata, my graduate advisor, who was killed protecting others on the morning of April 16, 2007. There are many others without whom I could not have completed
More informationSEARCH TREE. Generating the children of a node
SEARCH TREE Node: State in state tree Root node: Top of state tree Children: Nodes that can be reached from a given node in 1 step (1 operator) Expanding: Generating the children of a node Open: Closed:
More informationSection 8: Right Triangles
The following Mathematics Florida Standards will be covered in this section: MAFS.912.G-CO.2.8 Explain how the criteria for triangle congruence (ASA, SAS, SSS, and Hypotenuse-Leg) follow from the definition
More informationSEARCH SEARCH TREE. Node: State in state tree. Root node: Top of state tree
Page 1 Page 1 Page 2 SEARCH TREE SEARCH Node: State in state tree Root node: Top of state tree Children: Nodes that can be reached from a given node in 1 step (1 operator) Expanding: Generating the children
More informationUnachievable Region in Precision-Recall Space and Its Effect on Empirical Evaluation
Unachievable Region in Precision-Recall Space and Its Effect on Empirical Evaluation Kendrick Boyd 1 Vítor Santos Costa 2 Jesse Davis 3 David Page 1 1 University of Wisconsin Madison 2 University of Porto,
More informationChapter 11 Waves. Waves transport energy without transporting matter. The intensity is the average power per unit area. It is measured in W/m 2.
Energy can be transported by particles or waves: Chapter 11 Waves A wave is characterized as some sort of disturbance that travels away from a source. The key difference between particles and waves is
More informationInternational Journal of Technical Research and Applications e-issn: , Volume 4, Issue 3 (May-June, 2016), PP.
DESIGN AND ANALYSIS OF FEED CHECK VALVE AS CONTROL VALVE USING CFD SOFTWARE R.Nikhil M.Tech Student Industrial & Production Engineering National Institute of Engineering Mysuru, Karnataka, India -570008
More informationCENG 466 Artificial Intelligence. Lecture 4 Solving Problems by Searching (II)
CENG 466 Artificial Intelligence Lecture 4 Solving Problems by Searching (II) Topics Search Categories Breadth First Search Uniform Cost Search Depth First Search Depth Limited Search Iterative Deepening
More informationCitation for published version (APA): Canudas Romo, V. (2003). Decomposition Methods in Demography Groningen: s.n.
University of Groningen Decomposition Methods in Demography Canudas Romo, Vladimir IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please
More informationChapter 11 Waves. Waves transport energy without transporting matter. The intensity is the average power per unit area. It is measured in W/m 2.
Chapter 11 Waves Energy can be transported by particles or waves A wave is characterized as some sort of disturbance that travels away from a source. The key difference between particles and waves is a
More informationProbability: Bernoulli Trials, Expected Value, and More About Human Beings!
Probability: Bernoulli Trials, Expected Value, and More About Human Beings! CSCI 2824, Fall 2011! http://l3d.cs.colorado.edu/~ctg/ classes/struct11/home.html!! Assignments For this week: Read Chapter 6,
More informationOIL AND GAS INDUSTRY
This case study discusses the sizing of a coalescer filter and demonstrates its fouling life cycle analysis using a Flownex model which implements two new pressure loss components: - A rated pressure loss
More information8th Grade. Data.
1 8th Grade Data 2015 11 20 www.njctl.org 2 Table of Contents click on the topic to go to that section Two Variable Data Line of Best Fit Determining the Prediction Equation Two Way Table Glossary Teacher
More informationMarch Madness Basketball Tournament
March Madness Basketball Tournament Math Project COMMON Core Aligned Decimals, Fractions, Percents, Probability, Rates, Algebra, Word Problems, and more! To Use: -Print out all the worksheets. -Introduce
More informationApplication of Geometric Mean
Section 8-1: Geometric Means SOL: None Objective: Find the geometric mean between two numbers Solve problems involving relationships between parts of a right triangle and the altitude to its hypotenuse
More informationRight Sizing VE Studies CSVA Conference. Markham, ON October 27, BRIAN RUCK, P. Eng., C.V.S. AECOM Canada
Right Sizing VE Studies 2008 CSVA Conference Markham, ON October 27, 2008 BRIAN RUCK, P. Eng., C.V.S. AECOM Canada Presentation Outline Traditional VE Approach Key VE Principles Sample Projects Conclusion
More informationAlgebra Date Lesson Independent Work Computer Tuesday, Introduction (whole class) Problem with Dice
Tuesday, Introduction (whole class) Problem with Dice Critical Thinking Puzzles 3 Station expectations Count the Squares Math Riddles Wednesday, Computer expectations (whole class) Tangrams Read permission
More informationWeek 8, Lesson 1 1. Warm up 2. ICA Scavanger Hunt 3. Notes Arithmetic Series
CAN WE ADD AN ARITHMETIC SEQUENCE? Essential Question Essential Question Essential Question Essential Question Essential Question Essential Question Essential Question Week 8, Lesson 1 1. Warm up 2. ICA
More informationUninformed search methods
Lecture 3 Uninformed search methods Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework 1 Access through the course web page http://www.cs.pitt.edu/~milos/courses/cs2710/ Two
More informationSHOT ON GOAL. Name: Football scoring a goal and trigonometry Ian Edwards Luther College Teachers Teaching with Technology
SHOT ON GOAL Name: Football scoring a goal and trigonometry 2006 Ian Edwards Luther College Teachers Teaching with Technology Shot on Goal Trigonometry page 2 THE TASKS You are an assistant coach with
More informationSafety assessments for Aerodromes (Chapter 3 of the PANS-Aerodromes, 1 st ed)
Safety assessments for Aerodromes (Chapter 3 of the PANS-Aerodromes, 1 st ed) ICAO MID Seminar on Aerodrome Operational Procedures (PANS-Aerodromes) Cairo, November 2017 Avner Shilo, Technical officer
More informationIf you need to reinstall FastBreak Pro you will need to do a complete reinstallation and then install the update.
Using this Beta Version of FastBreak Pro First, this new beta version (Version 6.X) will only work with users who have version 5.X of FastBreak Pro. We recommend you read this entire addendum before trying
More informationCalspan Loss-of-Control Studies Using In-flight Simulation. Lou Knotts, President November 20, 2012
Calspan Loss-of-Control Studies Using In-flight Simulation Lou Knotts, President November 20, 2012 Overview Calspan URT Background and URT Studies General Observations From These Studies Recommended Loss
More informationUninformed search methods II.
CS 2710 Foundations of AI Lecture 4 Uninformed search methods II. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before
More information