CS Lecture 5. Vidroha debroy. Material adapted courtesy of Prof. Xiangnan Kong and Prof. Carolina Ruiz at Worcester Polytechnic Institute
|
|
- Mildred Goodwin
- 5 years ago
- Views:
Transcription
1 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
2 Searching for a number Find a specific number 91 - what about now? Why Sorting? Practical Application People by last name Countries by population Search engine results by relevance Fundamental to other algorithms Different algorithms have different asymtotic and constantfactor trade-offs no single best sort for all scenarios knowing one way to sort just isn't enough Keeping data in order allows it to be searched more efficiently 2
3 Sorting Sorting: Rearranging the values in an array or collection into a specific order (usually into their "natural ordering"). one of the fundamental problems in computer science it is estimated that 25~50% of all computing power is used for sorting activities. Popular Sorting algorithms: bubble sort: swap adjacent pairs that are out of order selection sort: look for the smallest element, move to front insertion sort: build an increasingly large sorted front portion merge sort: recursively divide the array in half and sort it heap sort: place the values into a sorted tree structure quick sort: recursively partition array based on a middle value Sorting Example Bubble Sort 3
4 Problem Definition Sorting takes an unordered collection and makes it an ordered one Input: Output: One Idea: Bubble Water Air
5 "Bubbling Up" the Largest Element Traverse a collection of elements Move from the front to the end Bubble the largest value to the end using pairwise comparisons and swapping "Bubbling Up" the Largest Element Traverse a collection of elements Move from the front to the end Bubble the largest value to the end using pairwise comparisons and swapping
6 "Bubbling Up" the Largest Element Traverse a collection of elements Move from the front to the end Bubble the largest value to the end using pairwise comparisons and swapping "Bubbling Up" the Largest Element Traverse a collection of elements Move from the front to the end Bubble the largest value to the end using pairwise comparisons and swapping
7 "Bubbling Up" the Largest Element Traverse a collection of elements Move from the front to the end Bubble the largest value to the end using pairwise comparisons and swapping No need to swap "Bubbling Up" the Largest Element Traverse a collection of elements Move from the front to the end Bubble the largest value to the end using pairwise comparisons and swapping
8 "Bubbling Up" the Largest Element Traverse a collection of elements Move from the front to the end Bubble the largest value to the end using pairwise comparisons and swapping Largest value correctly placed The Bubble Up Algorithm Bubble-Sort-step1( A ): for k = 1 (N 1): if A[k] > A[k+1]: ( A, k, k+1 ) ( A, x, y ): tmp = A[x] A[x] = A[y] A[y] = tmp 8
9 Need More Iterations Notice that only the largest value is correctly placed All other values are still out of order So we need to repeat this process Largest value correctly placed Repeat Bubble Up How Many Times? If we have N elements And if each time we bubble an element, we place it in its correct location Then we repeat the bubble up process N 1 times. This guarantees we ll correctly place all N elements. 9
10 N - 1 2/1/2016 Bubbling All the Elements The Bubble Up Algorithm Bubble-Sort( A ): for k = 1 (N 1): if A[k] > A[k+1]: ( A, k, k+1 ) 10
11 Inner loop Outer loop 2/1/2016 The Bubble Up Algorithm Bubble-Sort( A ): for i = 1 (N 1): for k = 1 (N 1): if A[k] > A[k+1]: ( A, k, k+1 ) The Bubble Up Algorithm Bubble-Sort( A ): for i = 1 (N 1): To do N-1 iterations To bubble a value for k = 1 (N 1): if A[k] > A[k+1]: ( A, k, k+1 ) 11
12 Reducing the Number of Comparisons Reducing the Number of Comparisons Assume the array size N On the i th iteration, we only need to do N-i comparisons. For example: N = 6 i = 4 (4 th iteration) Thus, we have 2 comparisons to do
13 The Bubble Up Algorithm Bubble-Sort( A ): for i = 1 (N 1): for k = 1 (N 1): if A[k] > A[k+1]: ( A, k, k+1 ) The Bubble Up Algorithm Bubble-Sort( A ): for i = 1 (N 1): for k = 1 (N i): if A[k] > A[k+1]: ( A, k, k+1 ) 13
14 Code Demo An Animated Example i 1 k
15 An Animated Example i 1 k An Animated Example i 1 k
16 An Animated Example i 1 k An Animated Example i 1 k
17 An Animated Example i 1 k An Animated Example i 1 k
18 An Animated Example i 1 k An Animated Example i 1 k
19 An Animated Example i 1 k An Animated Example i 1 k
20 An Animated Example i 1 k An Animated Example i 1 k
21 An Animated Example i 1 k An Animated Example i 1 k
22 An Animated Example i 1 k An Animated Example i 1 k
23 An Animated Example i 1 k An Animated Example i 1 k
24 An Animated Example i 1 k An Animated Example i 1 k
25 An Animated Example i 1 k After First Pass of Outer Loop i 1 k 8 Finished first Bubble Up
26 The Second Bubble Up i 2 k The Second Bubble Up i 2 k 1 No
27 The Second Bubble Up i 2 k The Second Bubble Up i 2 k
28 The Second Bubble Up i 2 k The Second Bubble Up i 2 k
29 The Second Bubble Up i 2 k The Second Bubble Up i 2 k
30 The Second Bubble Up i 2 k The Second Bubble Up i 2 k 4 No
31 The Second Bubble Up i 2 k The Second Bubble Up i 2 k
32 The Second Bubble Up i 2 k The Second Bubble Up i 2 k
33 The Second Bubble Up i 2 k The Second Bubble Up i 2 k
34 After Second Pass of Outer Loop i 2 k 7 Finished second Bubble Up The Third Bubble Up i 3 k
35 The Third Bubble Up i 3 k The Third Bubble Up i 3 k
36 The Third Bubble Up i 3 k The Third Bubble Up i 3 k
37 The Third Bubble Up i 3 k The Third Bubble Up i 3 k
38 The Third Bubble Up i 3 k 3 No The Third Bubble Up i 3 k
39 The Third Bubble Up i 3 k The Third Bubble Up i 3 k
40 The Third Bubble Up i 3 k The Third Bubble Up i 3 k
41 The Third Bubble Up i 3 k After Third Pass of Outer Loop i 3 k 6 Finished third Bubble Up
42 The Fourth Bubble Up i 4 k The Fourth Bubble Up i 4 k
43 The Fourth Bubble Up i 4 k The Fourth Bubble Up i 4 k
44 The Fourth Bubble Up i 4 k 2 No The Fourth Bubble Up i 4 k
45 The Fourth Bubble Up i 4 k 3 No The Fourth Bubble Up i 4 k
46 The Fourth Bubble Up i 4 k 4 No After Fourth Pass of Outer Loop i 4 k 5 Finished fourth Bubble Up
47 The Fifth Bubble Up i 5 k The Fifth Bubble Up i 5 k 1 No
48 The Fifth Bubble Up i 5 k The Fifth Bubble Up i 5 k 2 No
49 The Fifth Bubble Up i 5 k The Fifth Bubble Up i 5 k 3 No
50 After Fifth Pass of Outer Loop i 5 k 4 Finished fifth Bubble Up i 5 k
51 Inner loop Outer loop 2/1/2016 Analysis of Bubble Sort and Loop Invariant Bubble Sort Algorithm Bubble-Sort( A ): for i = 1 (N 1): To do N-1 iterations To bubble a value for k = 1 (N 1): if A[k] > A[k+1]: ( A, k, k+1 ) 51
52 Inner loop Inner loop Outer loop Outer loop 2/1/2016 Loop Invariant It is a condition or property that is guaranteed to be correct with each iteration in the loop Usually used to prove the correctness of the algorithm for i = 1 (N 1): To do N-1 iterations To bubble a value for k = 1 (N 1): if A[k] > A[k+1]: ( A, k, k+1 ) Loop Invariant for Bubble Sort for i = 1 (N 1): To do N-1 iterations To bubble a value for k = 1 (N 1): if A[k] > A[k+1]: ( A, k, k+1 ) By the end of iteration i the right-most i items (largest) are sorted and in place 52
53 N - 1 2/1/2016 N-1 Iterations st 2 nd 3 rd 4 th 5 th Correctness of Bubble Sort (using Loop Invariant) Bubble sort has N-1 Iterations Invariant: By the end of iteration i the right-most i items (largest) are sorted and in place Then: After the N-1 iterations The rightmost N-1 items are sorted This implies that all the N items are sorted 53
54 Bubble Sort Time Complexity Best-Case Time Complexity The scenario under which the algorithm will do the least amount of work (finish the fastest) What if we had a pass and nothing was swapped? What does that tell us? Worst-Case Time Complexity The scenario under which the algorithm will do the largest amount of work (finish the slowest) Summary Bubble Up algorithm will move largest value to its correct location (to the right) Repeat Bubble Up until all elements are correctly placed: Maximum of N-1 times Can finish early if no swapping occurs We reduce the number of elements we compare each time one is correctly placed Not the most efficient algorithm around but is easy to understand 54
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 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 informationHeap Sort. Lecture 35. Robb T. Koether. Hampden-Sydney College. Mon, Apr 25, 2016
Heap Sort Lecture 35 Robb T. Koether Hampden-Sydney College Mon, Apr 25, 2016 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, 2016 1 / 14 1 Sorting 2 The Heap Sort Robb T. Koether (Hampden-Sydney
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 informationProblem Solving Agents
Problem Solving Agents A problem solving agent is one which decides what actions and states to consider in completing a goal Examples: Finding the shortest path from one city to another 8-puzzle Problem
More informationCS 4649/7649 Robot Intelligence: Planning
CS 4649/7649 Robot Intelligence: Planning Partially Observable MDP Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu)
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 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 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 informationSupplementary Material for Bayes Merging of Multiple Vocabularies for Scalable Image Retrieval
Supplementary Material for Bayes Merging of Multiple Vocabularies for Scalable Image Retrieval 1. Overview This document includes supplementary material to Bayes Merging of Multiple Vocabularies for Scalable
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 informationPrincess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department
Princess Nora University Faculty of Computer & Information Systems 1 ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department (CHAPTER-3-PART2) PROBLEM SOLVING AND SEARCH (Course coordinator) Searching
More informationDESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017)
DESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017) Veli Mäkinen 12/05/2017 1 COURSE STRUCTURE 7 weeks: video lecture -> demo lecture -> study group -> exercise Video lecture: Overview, main concepts, algorithm
More informationPerformance Visualization of Bubble Sort in Worst Case Using R Programming in Personal Computer
Performance Visualization of Bubble Sort in Worst Case Using R Programming in Personal Computer Dipankar Das 1, Priyanka Das 2, Rishab Dey 3, Sreya Modak 4 1 Assistant Professor, The Heritage Academy,
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 informationUninformed Search (Ch )
1 Uninformed Search (Ch. 3-3.4) 3 Terminology review State: a representation of a possible configuration of our problem Action: -how our agent interacts with the problem -can be different depending on
More informationUninformed Search (Ch )
1 Uninformed Search (Ch. 3-3.4) 7 Small examples 8-Queens: how to fit 8 queens on a 8x8 board so no 2 queens can capture each other Two ways to model this: Incremental = each action is to add a queen to
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 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 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 information4. Please Do Break the Crystal
4. Please Do Break the Crystal Tell the broken plate you are sorry. Mary Robertson. Programming constructs and algorithmic paradigms covered in this puzzle: Break statements, radix representations. You
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 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 informationChapter 4 (sort of): How Universal Are Turing Machines? CS105: Great Insights in Computer Science
Chapter 4 (sort of): How Universal Are Turing Machines? CS105: Great Insights in Computer Science Some Probability Theory If event has probability p, 1/p tries before it happens (on average). If n distinct
More informationUninformed search strategies
AIMA sections 3.4,3.5 search use only the information available in the problem denition Breadth-rst search Uniform-cost search Depth-rst search Depth-limited search Iterative deepening search Breadth-rst
More informationIntroduction to Algorithms 6.046J/18.401J/SMA5503
Itroductio to Algorithms 6.046J/8.40J/SMA5503 Lecture 4 Prof. Charles E. Leiserso Quicsort Proposed by C.A.R. Hoare i 962. Divide-ad-coquer algorithm. Sorts i place lie isertio sort, but ot lie merge sort.
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 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 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 informationCS 221 PROJECT FINAL
CS 221 PROJECT FINAL STUART SY AND YUSHI HOMMA 1. INTRODUCTION OF TASK ESPN fantasy baseball is a common pastime for many Americans, which, coincidentally, defines a problem whose solution could potentially
More informationIn my left hand I hold 15 Argentine pesos. In my right, I hold 100 Chilean
Chapter 6 Meeting Standards and Standings In This Chapter How to standardize scores Making comparisons Ranks in files Rolling in the percentiles In my left hand I hold 15 Argentine pesos. In my right,
More informationReal World Search Problems. CS 331: Artificial Intelligence Uninformed Search. Simpler Search Problems. Example: Oregon. Search Problem Formulation
Real World Search Problems S 331: rtificial Intelligence Uninformed Search 1 2 Simpler Search Problems ssumptions bout Our Environment Fully Observable Deterministic Sequential Static Discrete Single-agent
More informationA Coach s Guide to Using USA Swimming s OME (Online Meet Entry) for North Carolina Swimming (NCS) Championship Meet Entry
A Coach s Guide to Using USA Swimming s OME (Online Meet Entry) for North Carolina Swimming (NCS) Championship Meet Entry OME is a service provided by USA Swimming that North Carolina Swimming uses for
More informationPREDICTING the outcomes of sporting events
CS 229 FINAL PROJECT, AUTUMN 2014 1 Predicting National Basketball Association Winners Jasper Lin, Logan Short, and Vishnu Sundaresan Abstract We used National Basketball Associations box scores from 1991-1998
More informationUninformed search methods
Lecture 3 Uninformed search methods Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before the lecture Report and programming
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 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 informationChapter 23 Traffic Simulation of Kobe-City
Chapter 23 Traffic Simulation of Kobe-City Yuta Asano, Nobuyasu Ito, Hajime Inaoka, Tetsuo Imai, and Takeshi Uchitane Abstract A traffic simulation of Kobe-city was carried out. In order to simulate an
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 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 informationAgent Based Urban Models The Notting Hill Carnival Model
Lectures on Complexity and Spatial Simulation Thursday, 21 March, 2013 Session 5: Lecture 6: Agent Based Urban Models The Notting Hill Carnival Model Michael Batty m.batty@ucl.ac.uk @jmichaelbatty http://www.complexcity.info/
More informationCOMP 406 Lecture 05. Artificial. Fiona Yan Liu Department of Computing The Hong Kong Polytechnic University
COMP 406 Lecture 05 Artificial Intelligence Fiona Yan Liu Department of Computing The Hong Kong Polytechnic University Learning Outcomes of Intelligent Agents Search agents Uninformed search Informed search
More informationHighway 111 Corridor Study
Highway 111 Corridor Study June, 2009 LINCOLN CO. HWY 111 CORRIDOR STUDY Draft Study Tea, South Dakota Prepared for City of Tea Sioux Falls Metropolitan Planning Organization Prepared by HDR Engineering,
More informationDobbin Day - User Guide
Dobbin Day - User Guide Introduction Dobbin Day is an in running performance form analysis tool. A runner s in-running performance is solely based on the price difference between its BSP (Betfair Starting
More informationAutomating Injection Molding Simulation using Autonomous Optimization
Automating Injection Molding Simulation using Autonomous Optimization Matt Proske, Rodrigo Gutierrez, & Gabriel Geyne SIGMASOFT Virtual Molding Autonomous optimization is coupled to injection molding simulation
More informationArtificial Intelligence. Uninformed Search Strategies
Artificial Intelligence Uninformed search strategies Uninformed Search Strategies Uninformed strategies use only the information available in the problem definition Also called Blind Search No info on
More informationDiameter in cm. Bubble Number. Bubble Number Diameter in cm
Bubble lab Data Sheet Blow bubbles and measure the diameter to the nearest whole centimeter. Record in the tables below. Try to blow different sized bubbles. Name: Bubble Number Diameter in cm Bubble Number
More informationOptimizing positional scoring rules for rank aggregation
Optimizing positional scoring rules for rank aggregation Ioannis Caragiannis Xenophon Chatzigeorgiou George Krimpas Alexandros Voudouris University of Patras AAAI 2017 An application Find a pizza place
More informationUninformed Search Strategies
Uninformed Search Strategies Instructor: Dr. Wei Ding Fall 2010 1 Uninformed Search Strategies Also called blind search. Have no additional information about states beyond that provided in the problem
More informationFun with M&M s. By: Cassandra Gucciardo. Sorting
Fun with M&M s Sorting Fractions Objectives: The students will be able to review the measures of central tendency by determining mean, median, mode and range. They will review their understanding of estimation,
More informationHAP e-help. Obtaining Consistent Results Using HAP and the ASHRAE 62MZ Ventilation Rate Procedure Spreadsheet. Introduction
Introduction A key task in commercial building HVAC design is determining outdoor ventilation airflow rates. In most jurisdictions in the United States, ventilation airflow rates must comply with local
More informationWilliams, Justin à Player name (last name, first name) CAR
CSCI 2110 Data Structures and Algorithms Assignment No. 2 Date Given: Tuesday, October 9, 2018 Date Due: Wednesday, October 24, 2018, 11.55 p.m. (5 minutes to midnight) This assignment has two exercises,
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 informationThe only high-speed filling system for LPG cylinders in the world
GENERAL DESCRIPTION The only high-speed filling system for LPG cylinders in the world www.flexspeed.info All position numbers in the following description refer to the drawing FLEX- SPEED LAYOUT. The core
More informationShot-by-shot directional source deghosting and directional designature using near-gun measurements
H1-1-3 Shot-by-shot directional source deghosting and directional designature using near-gun measurements Neil Hargreaves, Rob Telling, Sergio Grion Dolphin Geophysical, London, UK Introduction In this
More informationThe next criteria will apply to partial tournaments. Consider the following example:
Criteria for Assessing a Ranking Method Final Report: Undergraduate Research Assistantship Summer 2003 Gordon Davis: dagojr@email.arizona.edu Advisor: Dr. Russel Carlson One of the many questions that
More informationSTICTION: THE HIDDEN MENACE
STICTION: THE HIDDEN MENACE How to Recognize This Most Difficult Cause of Loop Cycling By Michel Ruel Reprinted with permission from Control Magazine, November 2000. (Most figures courtesy of ExperTune
More informationIntroduction. AI and Searching. Simple Example. Simple Example. Now a Bit Harder. From Hammersmith to King s Cross
Introduction AI and Searching We have seen how models of the environment allow an intelligent agent to dry run scenarios in its head without the need to act Logic allows premises to be tested Machine learning
More informationA new Decomposition Algorithm for Multistage Stochastic Programs with Endogenous Uncertainties
A new Decomposition Algorithm for Multistage Stochastic Programs with Endogenous Uncertainties Vijay Gupta Ignacio E. Grossmann Department of Chemical Engineering Carnegie Mellon University, Pittsburgh
More informationRevision 2013 Vacuum Technology 1-3 day Good Vacuum Practice 1 Day Course Outline
Revision 2013 Vacuum Technology 1-3 day Good Vacuum Practice 1 Day Course Outline This training course outline is intended to cover the following: Introduction to vacuum Measurement Lubricated rotary pumps
More informationPolicy Gradient RL to learn fast walk
Policy Gradient RL to learn fast walk Goal: Enable an Aibo to walk as fast as possible Policy Gradient RL to learn fast walk Goal: Enable an Aibo to walk as fast as possible Start with a parameterized
More informationSystems Theoretic Process Analysis (STPA)
Systems Theoretic Process Analysis (STPA) 1 Systems approach to safety engineering (STAMP) STAMP Model Accidents are more than a chain of events, they involve complex dynamic processes. Treat accidents
More informationSupplementary Figures
Supplementary Figures Supplementary Figure 1 Optimal number of pair extractions. The plots show the relationships between average number of checkerboard units in sets of 1000 randomizations of the Vanuatu
More informationRepetition Structures
Repetition Structures Chapter 5 5-1 Chapter 5 Objectives The Loop Instruction The While Instruction Nested Loops 5-2 The Loop Instruction Simple control structure allows o Instruction (or block of instructions)
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 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 informationFront derailleur. Dealer's Manual DURA-ACE FD-R9100 ULTEGRA FD-R FD ROAD MTB Trekking. City Touring/ Comfort Bike DM-RAFD001-03
(English) DM-RAFD001-03 Dealer's Manual ROAD MTB Trekking City Touring/ Comfort Bike URBAN SPORT E-BIKE Front derailleur DURA-ACE FD-R9100 ULTEGRA FD-R8000 105 FD-5801 Procedures for cable tension adjustment
More informationINTRODUCTION AND METHODS OF CMAP SOFTWARE BY IPC-ENG
INTRODUCTION AND METHODS OF CMAP SOFTWARE BY IPC-ENG What is Cmap? CMAP is a software designed to perform easily and quickly centrifugal compressors performance evaluations. CMAP provides all quantitative
More informationThe Incremental Evolution of Gaits for Hexapod Robots
The Incremental Evolution of Gaits for Hexapod Robots Abstract Gait control programs for hexapod robots are learned by incremental evolution. The first increment is used to learn the activations required
More informationCS472 Foundations of Artificial Intelligence. Final Exam December 19, :30pm
CS472 Foundations of Artificial Intelligence Final Exam December 19, 2003 12-2:30pm Name: (Q exam takers should write their Number instead!!!) Instructions: You have 2.5 hours to complete this exam. The
More informationAlgorithm for Line Follower Robots to Follow Critical Paths with Minimum Number of Sensors
International Journal of Computer (IJC) ISSN 2307-4523 (Print & Online) Global Society of Scientific Research and Researchers http://ijcjournal.org/ Algorithm for Line Follower Robots to Follow Critical
More informationERCBH2S Frequently Asked Questions.
ERCBHS Frequently Asked Questions. Issue: Sweet pipeline tie-in to a sour gathering system A company is tying a sweet pipeline into one containing HS. Since the model assumes flow from either end of the
More informationThree New Methods to Find Initial Basic Feasible. Solution of Transportation Problems
Applied Mathematical Sciences, Vol. 11, 2017, no. 37, 1803-1814 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.75178 Three New Methods to Find Initial Basic Feasible Solution of Transportation
More informationA IMPROVED VOGEL S APPROXIMATIO METHOD FOR THE TRA SPORTATIO PROBLEM. Serdar Korukoğlu 1 and Serkan Ballı 2.
Mathematical and Computational Applications, Vol. 16, No. 2, pp. 370-381, 2011. Association for Scientific Research A IMPROVED VOGEL S APPROXIMATIO METHOD FOR THE TRA SPORTATIO PROBLEM Serdar Korukoğlu
More informationRollover Warning/Control for Sports Utility Vehicles
Rollover Warning/Control for Sports Utility Vehicles Bo-Chiuan Chen, GSRA Huei Peng, Associate Prof. Dept. of Mechanical Engineering and Applied Mechanics University of Michigan 1 Outline Introduction
More informationAryeh Rappaport Avinoam Meir. Schedule automation
Aryeh Rappaport Avinoam Meir Schedule automation Introduction In this project we tried to automate scheduling. Which is to help a student to pick the time he takes the courses so they want collide with
More informationAgile project management with scrum
Agile project management with scrum CS 236503 Dr. Oren Mishali Based on the book Agile Project Management with Scrum Overview of the Scrum process The following slides give an overview of the Scrum process,
More informationAnalysis of Professional Cycling Results as a Predictor for Future Success
Analysis of Professional Cycling Results as a Predictor for Future Success Alex Bertrand Introduction As a competitive sport, road cycling lies in a category nearly all its own. Putting aside the sheer
More informationCSC242: Intro to AI. Lecture 21
CSC242: Intro to AI Lecture 21 Quiz Stop Time: 2:15 Learning (from Examples) Learning Learning gives computers the ability to learn without being explicitly programmed (Samuel, 1959)... agents that can
More informationCSM Pre-Test. 3) Who is responsible for achieving a Sprint Goal? A) ScrumMaster B) Product Owner C) Project Manager D) Scrum Development Team
CSM Pre-Test 1) According to Agile development principles, the primary measure of progress is... A) largely subjective. B) working software. C) lines of code. D) a comparison of estimates to actuals. 2)
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 informationSeismic waves. Seismic waves, like all waves, transfer energy from one place to another without moving material. Seismic Waves 1 Author Paul Denton
Seismic waves When an earthquake happens deep underground a crack will start to open on a pre-existing line of weakness in the Earth s brittle crust. This crack will then grow larger and larger, relieving
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 informationArtificial Intelligence for the EChO Mission Scheduler
Artificial Intelligence for the EChO Mission Scheduler Álvaro García Piquer Ignasi Ribas Josep Colomé Institute of Space Sciences (CSIC/IEEC), Barcelona, Spain SCIOPS 2013 September 10 13, 2013 Introduction
More informationTeam assignment strategies in youth sports
University of Arkansas, Fayetteville ScholarWorks@UARK Industrial Engineering Undergraduate Honors Theses Industrial Engineering 5-2011 Team assignment strategies in youth sports Stephanie Marhefka University
More informationFREQUENTLY ASKED QUESTIONS ANSWERED! MOUNTING TO MY BIKE
FREQUENTLY ASKED QUESTIONS ANSWERED! MOUNTING TO MY BIKE Will a Rohloff hub work on my bike? It is likely that the Rohloff hub will work on your bike as there are number of different hub configurations,
More informationIteration: while, for, do while, Reading Input with Sentinels and User-defined Functions
Iteration: while, for, do while, Reading Input with Sentinels and User-defined Functions This programming assignment uses many of the ideas presented in sections 6 and 7 of the course notes. You are advised
More informationLOCOMOTION CONTROL CYCLES ADAPTED FOR DISABILITIES IN HEXAPOD ROBOTS
LOCOMOTION CONTROL CYCLES ADAPTED FOR DISABILITIES IN HEXAPOD ROBOTS GARY B. PARKER and INGO CYLIAX Department of Computer Science, Indiana University, Bloomington, IN 47405 gaparker@cs.indiana.edu, cyliax@cs.indiana.edu
More informationOnline Companion to Using Simulation to Help Manage the Pace of Play in Golf
Online Companion to Using Simulation to Help Manage the Pace of Play in Golf MoonSoo Choi Industrial Engineering and Operations Research, Columbia University, New York, NY, USA {moonsoo.choi@columbia.edu}
More informationFIRE PROTECTION. In fact, hydraulic modeling allows for infinite what if scenarios including:
By Phil Smith, Project Manager and Chen-Hsiang Su, PE, Senior Consultant, Lincolnshire, IL, JENSEN HUGHES A hydraulic model is a computer program configured to simulate flows for a hydraulic system. The
More information2600T Series Pressure Transmitters Plugged Impulse Line Detection Diagnostic. Pressure Measurement Engineered solutions for all applications
Application Description AG/266PILD-EN Rev. C 2600T Series Pressure Transmitters Plugged Impulse Line Detection Diagnostic Pressure Measurement Engineered solutions for all applications Increase plant productivity
More informationWind Flow Validation Summary
IBHS Research Center Validation of Wind Capabilities The Insurance Institute for Business & Home Safety (IBHS) Research Center full-scale test facility provides opportunities to simulate natural wind conditions
More informationCalculating Forces in the Pulley Mechanical Advantage Systems Used in Rescue Work By Ralphie G. Schwartz, Esq
Calculating Forces in the Pulley Mechanical Advantage Systems Used in Rescue Work By Ralphie G. Schwartz, Esq Introduction If you have not read the companion article: Understanding Mechanical Advantage
More informationEstimating balanced detailed SUT using benchmark SUT
Estimating balanced detailed SUT using benchmark SUT Martins Ferreira, Pedro European Commission, Eurostat E-mails: Pedro-Jorge.MARTINS-FERREIRA@ec.europa.eu Abstract Given an aggregate set of balanced
More informationDensity of Individual Airborne Wind Energy Systems in AWES Farms
16-Mar-2014, Request for Comments, AWELabs-002 Density of Individual Airborne Wind Energy Systems in AWES Farms Leo Goldstein Airborne Wind Energy Labs Austin, TX, USA ABSTRACT The paper shows that individual
More informationPressure Vessel Calculation for Yavin Thruster
Pressure Vessel Calculation for Yavin Thruster J. Simmons June 16, 2015 1 Requirements The Pressure Vessel Calculation module is being created to model the stresses in the chamber wall for use in a sizing
More information1 GENERAL PROCEDURES THAT APPLY TO ANY RACE
Heat Management System 2013 Race committees are recommended to read the rules of this system in conjunction with the HMS Advice Notes that are part of this document. 1 GENERAL PROCEDURES THAT APPLY TO
More informationSTAT 155 Introductory Statistics. Lecture 2: Displaying Distributions with Graphs
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL STAT 155 Introductory Statistics Lecture 2: Displaying Distributions with Graphs 8/29/06 Lecture 2-1 1 Recall Statistics is the science of data. Collecting
More informationProvably Secure Camouflaging Strategy for IC Protection
Provably Secure Camouflaging Strategy for IC Protection Meng Li 1 Kaveh Shamsi 2 Travis Meade 2 Zheng Zhao 1 Bei Yu 3 Yier Jin 2 David Z. Pan 1 1 Electrical and Computer Engineering, University of Texas
More information