Heap Sort. Lecture 35. Robb T. Koether. Hampden-Sydney College. Mon, Apr 25, 2016
|
|
|
- Roy Roberts
- 5 years ago
- Views:
Transcription
1 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, / 14
2 1 Sorting 2 The Heap Sort Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
3 Outline 1 Sorting 2 The Heap Sort Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
4 Total Order Relations Definition (Total Order Relation) A total order relation on a set A is a relation that has the following properties. Reflexive: For all a A, a a. Anti-symmetric: For all a, b A, if a b and b a, then a = b. Transitive: For all a, b, c A, if a b and b c, then a c. Comparable: For all a, b A, a b, or b a. Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
5 Sorting The order is determined by an order operator: <, >, <=, or >=. These operators, together with == and!=, must define a total order on the class. Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
6 Inefficient Sorting Algorithms Most elementary sorting algorithms are inefficient for long lists. Examples Bubble Sort. Selection Sort. Insertion Sort. These algorithms have run times of order O(n 2 ). They are fine for short lists (length < 10, 000) and ok for length < 100, 000. Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
7 Efficient Sorting Algorithms The efficient sorting algorithms are more complicated. Examples Merge Sort Heap Sort Quick Sort These algorithms have run times of order O(n log n). They are fast for lists of any practical length. Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
8 Outline 1 Sorting 2 The Heap Sort Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
9 The Heap Sort Definition (Heap Sort) A heap is a binary tree that has the following structure: At each node, the value at that node is greater than or equal to each of its children. Every level except the lowest level is full. The nodes in the lowest level are as far to the left as possible. The Heap Sort algorithm uses a heap. The nodes are indexed from 0 to size - 1 in level order. Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
10 A heap Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
11 The Heap Sort algorithm is as follows. Heapify the tree (to be explained). Set end equal to size - 1 (last element). While end > 0, do the following. Swap the root value with the end value. Sift down the root value down through the tree (to be explained). Decrement end. Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
12 The siftdown() Function The siftdown() function proceeds as follows. Begin at the root node. While the node value is smaller than at least one of its active children (pos end), Swap it with the larger of its children. Make that child node the current node. Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
13 The heapify() Function The heapify() function proceeds as follows. Begin with node = end/2, i.e., the last node with a child. While node > 1, do the following Sift the node down. Decrement the node. Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
14 Swap 90 and 40 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
15 Swap 80 and 40 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
16 Swap 70 and 40 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
17 Swap 80 and 20 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
18 Swap 70 and 20 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
19 Swap 60 and 20 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
20 Swap 70 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
21 Swap 60 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
22 Swap 40 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
23 Swap 60 and 30 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
24 Swap 50 and 30 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
25 Swap 50 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
26 Swap 40 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
27 Swap 20 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
28 Swap 40 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
29 Swap 30 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
30 Swap 30 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
31 Swap 20 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
32 Swap 20 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
33 Done Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
34 Swap 90 and 40 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
35 Swap 80 and 40 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
36 Swap 70 and 40 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
37 Swap 80 and 20 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
38 Swap 70 and 20 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
39 Swap 60 and 20 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
40 Swap 70 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
41 Swap 60 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
42 Swap 40 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
43 Swap 60 and 30 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
44 Swap 50 and 30 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
45 Swap 50 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
46 Swap 40 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
47 Swap 20 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
48 Swap 40 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
49 Swap 30 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
50 Swap 30 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
51 Swap 20 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
52 Swap 20 and 10 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
53 Done Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, / 14
The Method of Sealed Bids
Lecture 13 Section 3.4 Robb T. Koether Hampden-Sydney College Mon, Feb 16, 2015 Robb T. Koether (Hampden-Sydney College) The Method of Sealed Bids Mon, Feb 16, 2015 1 / 31 1 The Method of Sealed Bids 2
The Lone-Chooser Method
The Lone-Chooser Method Lecture 11 Section 3.3 Robb T. Koether Hampden-Sydney College Fri, Sep 19, 2014 Robb T. Koether (Hampden-Sydney College) The Lone-Chooser Method Fri, Sep 19, 2014 1 / 15 1 Assignment
Project 2 Discussion
Project 2 Discussion Robb T. Koether Hampden-Sydney College Fri, Feb 8, 2013 Robb T. Koether (Hampden-Sydney College) Project 2 Discussion Fri, Feb 8, 2013 1 / 25 1 Introduction 2 Markov Processes 3 The
CS 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
Animation. Lecture 33. Robb T. Koether. Hampden-Sydney College. Fri, Nov 13, 2015
Animation Lecture 33 Robb T. Koether Hampden-Sydney College Fri, Nov 13, 2015 Robb T. Koether (Hampden-Sydney College) Animation Fri, Nov 13, 2015 1 / 22 Outline 1 Animating the Canal Boat Program 2 Models
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
Algorithms 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):
Balanced Binary Trees
CSE : AVL TREES 2 Balanced Binary Trees Recall: Worst case for find in a BST is : Worst case for find in a Balanced BST is: 3 Balanced Binary Trees Deterministic Balancing Change insert and delete operations
CENG 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
Uninformed 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
Dispatching Universität Karlsruhe, System Architecture Group
µ-kernel Construction (6) Dispatching 1 Dispatching Topics Thread switch To a specific thread To next thread to be scheduled To nil Implicitly, when IPC blocks Priorities Preemption Time slices Wakeups,
SEARCH 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:
Problem 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
Uninformed 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
Princess 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
SEARCH 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
Uninformed 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
Redis Graph. A graph database built on top of redis
Redis Graph A graph database built on top of redis What s Redis? Open source in-memory database Key => Data Structure server Key features: Fast, Flexible, Simple A Lego for your database Key "I'm a Plain
Uninformed 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
II. 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
Better 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
Uninformed 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
Performance 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,
Decision 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
Traffic circles. February 9, 2009
Traffic circles February 9, 2009 Abstract The use of a traffic circle is a relatively common means of controlling traffic in an intersection. Smaller Traffic circles can be especially effective in routing
The 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
Artificial 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
DESIGN 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
Introduction. 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
Exercise 11: Solution - Decision tree
Exercise 11: Solution - Decision tree Given the obtained data and the fact that outcome of a match might also depend on the efforts Federera spent on it, we build the following training data set with the
knn & Naïve Bayes Hongning Wang
knn & Naïve Bayes Hongning Wang CS@UVa Today s lecture Instance-based classifiers k nearest neighbors Non-parametric learning algorithm Model-based classifiers Naïve Bayes classifier A generative model
CSE 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,
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 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
4. 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
Uninformed 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
CSC242: 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
ISyE 3103 Introduction to Supply Chain Modeling: Logistics Summer 2012 Homework 8 Issued: July 11, 2012 Due: July 18, 2012
ISyE 3103 Introduction to Supply Chain Modeling: Logistics Summer 2012 Homework 8 Issued: July 11, 2012 Due: July 18, 2012 Single-Vehicle, Multiple-Destination Transportation Routing (Traveling Salesman
Bike Rack Design and Placement Design Standards
Bike Rack Design and Placement Design Standards Table of Contents Overview... 1 Design Specifications... 2 Short Term Parking... 3 Long Term Parking... 6 Overview Sacramento has been a city supportive
Transposition Table, History Heuristic, and other Search Enhancements
Transposition Table, History Heuristic, and other Search Enhancements Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Introduce heuristics for improving the efficiency
Spring 2017 COT 3100 Final Exam: Part A (for all students) Last Name:, First Name : Date: April 27, 2017
Spring 2017 COT 3100 Final Exam: Part A (for all students) Last Name:, First Name : Date: April 27, 2017 1) (20 pts - Induction) Using induction on n, prove for all positive integers n that 2n ( 1) i i
Uninformed 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
Decision Trees. an Introduction
Decision Trees an Introduction Outline Top-Down Decision Tree Construction Choosing the Splitting Attribute Information Gain and Gain Ratio Decision Tree An internal node is a test on an attribute A branch
Incremental ARA*: An Anytime Incremental Search Algorithm For Moving Target Search. University of Southern California Singapore Management University
Incremental ARA*: An Anytime Incremental Search Algorithm For Moving Target Search Xiaoxun Sun Tansel Uras William Yeoh Sven Koenig University of Southern California Singapore Management University Moving
KC Scout Kansas City s Bi-State Transportation Management Center
KC Scout Kansas City s Bi-State Transportation Management Center Operations Report May 216 This report contains statistical and operational data of activities at the Scout TMC for the period Sunday, May
FEATURES. Features. UCI Machine Learning Repository. Admin 9/23/13
Admin Assignment 2 This class will make you a better programmer! How did it go? How much time did you spend? FEATURES David Kauchak CS 451 Fall 2013 Assignment 3 out Implement perceptron variants See how
A 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
UNITED STATES MARINE CORPS WEAPONS TRAINING BATTALION MARINE CORPS COMBAT DEVELOPMENT COMMAND QUANTICO, VIRGINIA
UNITED STATES MARINE CORPS WEAPONS TRAINING BATTALION MARINE CORPS COMBAT DEVELOPMENT COMMAND QUANTICO, VIRGINIA 22134-5040 DETAILED INSTRUCTOR GUIDE LESSON TITLE RIFLE RELOADS COURSE TITLE DIVISION MATCH
Supplementary 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
KISSsoft 03/2016 Tutorial 9
KISSsoft 03/2016 Tutorial 9 Cylindrical Gear Fine Sizing KISSsoft AG Rosengartenstrasse 4 8608 Bubikon Switzerland Phone: +41 55 254 20 50 Fax: +41 55 254 20 51 info@kisssoft.ag www.kisssoft.ag Table of
The Evolution of Transport Planning
The Evolution of Transport Planning On Proportionality and Uniqueness in Equilibrium Assignment Michael Florian Calin D. Morosan Background Several bush-based algorithms for computing equilibrium assignments
Solving Problems by Searching chap3 1. Problem-Solving Agents
Chapter3 Solving Problems by Searching 20070315 chap3 1 Problem-Solving Agents Reflex agents cannot work well in those environments - state/action mapping too large - take too long to learn Problem-solving
Purpose: The following serves to aid Principal Investigators (PI) in the submission of Amendments to AURA-IRB. Document includes: Acronyms and Legend
AURA-IRB Amendment Guidelines Principal Investigators (PI) End Users: Principal Investigators (PI) who enter studies. Purpose: The following serves to aid Principal Investigators (PI) in the submission
Problem Solving as Search - I
Problem Solving as Search - I Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University Slides prepared from Artificial Intelligence A Modern approach by Russell & Norvig Problem-Solving
ECE 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
Exercise 1: Control Functions
Exercise 1: Control Functions EXERCISE OBJECTIVE When you have completed this exercise, you will be able to control the function of an asynchronous ripple counter. You will verify your results by operating
1. What is the SGA Centralised Handicapping System (CHS)?
SGA CENTRALISED HANDICAPPING SYSTEM (CHS) FREQUENTLY ASKED QUESTIONS 1. What is the SGA Centralised Handicapping System (CHS)? Ans: The SGA Centralised Handicapping System (CHS), as its name implies, is
Efficient 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
TERMINATION FOR HYBRID TABLEAUS
TERMINATION FOR HYBRID TABLEAUS THOMAS BOLANDER AND PATRICK BLACKBURN Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Braüner [5]. Their
Diffraction of Water Waves. Pg
Diffraction of Water Waves Pg. 459-461 Diffraction Diffraction is the bending of a wave as the wave passes through an opening or by an obstacle The amount of diffraction depends on the wavelength of the
Chicago Safe Routes to High School (SRHS) Kelly High School Recommended Improvements
Chicago Safe Routes to High School (SRHS) Kelly High School Recommended Improvements March 18, 2014 Presentation Outline Goals Related Programs Project Location/Area Existing Conditions Improvement Types
McKnight Hockey Association
McKnight Hockey Association Electronic Evaluation Tool Manual 2013-2014 Table of Contents Introduction...3 Evaluation Tool...3 Login to OneClickIce...3 Evaluations...4 PROCESS...4 Evaluation Procedure...5
Farm-scale winnower revised 12/2005c
Page 1 of 6 Farm-scale winnower revised 12/2005c By Allen Dong, I-Tech, PO Box 413, Veneta, OR 97487 www.efn.org/~itech/ Public domain, no copyright -a gift to humanity This electric winnower removes chaffs
Special edition paper
Development of a Track Management Method for Shinkansen Speed Increases Shigeaki Ono** Takehiko Ukai* We have examined the indicators of appropriate track management that represent the ride comfort when
Polycom VVX SERIES. Expansion Module Administrator Guide. Table of Contents
Table of Contents Overview...2 Configurations...4 Power Requirements...6 Appendix...7 Additional Support...8 VVX (Color) Expansion Modules The VVX Expansion Module (EM) enables configuration of additional
2018 STATE CUP TEAM REGISTRATION PROCEDURE COMPREHENSIVE GUIDE
2018 STATE CUP TEAM REGISTRATION PROCEDURE COMPREHENSIVE GUIDE CONTENTS 2018 State Cup Team Allocation...3 Creating Teams...4 Team Allocation...6 Support...8 Version 1, issued 13 March 2018 2 2018 STATE
Due on: November 1, 2016: AM Use additional sheets, if necessary. You should staple your exam. Submit on-time at AM
Jackson State University CSC 323 Algorithm Design and Analysis, Fall 2016 Instructor: Dr. Natarajan Meghanathan Exam 2 (Take Home Exam) Maximum Points: 100 Due on: November 1, 2016: 11.30 AM Use additional
Overview. 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
COMP219: 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
KIDS RUN THE OC EVENT DAY - May 5, 2018
KIDS RUN THE OC EVENT DAY - May 5, 2018 WELCOME! Please view this presentation in its entirety. It provides details on directions, parking, picking up your child after their heat, and other important information.
KC Scout Kansas City s Bi-State Transportation Management Center
KC Scout Kansas City s Bi-State Transportation Management Center Operations Report August- 215 This report contains statistical and operational data of activities at the Scout TMC for the period Saturday,
SWIMMER PATHWAYS (SQUADS)
SWIMMER PATHWAYS (SQUADS) Updated: 22 July 2017 Overview of the Pathway (in order of ability)... 3 Expectations for All Squads... 3 Assessment Process... 4 Parent/caregiver Support... 4 Tadpoles Squad...
PLAY DAY Hand Book 2017 Revised 12/26/16
PLAY DAY Hand Book 2017 Revised 12/26/16 Okay, how teams will be chosen. We will use one of the following methods each play day: a. Random pick from the orange bucket for teams. b. Random pick from 2 bins
KIWIDEX GAMES. Running and Walking. On 1 Feb 2012, SPARC changed its name to Sport NZ.
KIWIDEX GAMES 163 Running and Walking On 1 Feb 2012, SPARC changed its name to Sport NZ. www.sportnz.org.nz 164 Section Contents Running and Walking Activities 165 Motivational Ideas 166 Move like a 167
Real 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
3. EXCEL FORMULAS & TABLES
Fall 2017 CS130 - Excel Formulas & Tables 1 3. EXCEL FORMULAS & TABLES Fall 2017 Fall 2017 CS130 - Excel Formulas & Tables 2 Cell References Absolute reference - refer to cells by their fixed position.
Exploring the NFL. Introduction. Data. Analysis. Overview. Alison Smith <alison dot smith dot m at gmail dot com>
Exploring the NFL Alison Smith Introduction The National Football league began in 1920 with 12 teams and has grown to 32 teams broken into 2 leagues and 8 divisions.
CS472 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
Aquatics. notes. Mid-Minnesota Community Aquatic Swim Program. Registration. Now Hiring!
Aquatics District 742 Community Education and City of St. Cloud Park and Recreation have a long standing collaboration in Community Aquatics. Together we provide high quality programs such as preschool
Aryeh 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
WEST POINT GOLF CLUB USING THE GOLFSOFTWARE PROGRAM FOR THE DRAW AND SCORING
USING THE GOLFSOFTWARE PROGRAM FOR THE DRAW AND SCORING The new software is made up of 3 modules - Handicap, Tournament and Player Portal. Note that the Handicap module and the Tournament module have separate
SUBJECT: Board Approval: 4/29/04
1255 Imperial Avenue, Suite 1000 San Diego, CA 92101-7490 619/231-1466 FAX 619/234-3407 Policies and Procedures No. 38 SUBJECT: Board Approval: 4/29/04 OUT-OF-DIRECTION BUS ROUTINGS PURPOSE: To establish
Estimating a Toronto Pedestrian Route Choice Model using Smartphone GPS Data. Gregory Lue
Estimating a Toronto Pedestrian Route Choice Model using Smartphone GPS Data Gregory Lue Presentation Outline Introduction Background Data Smartphone Data Alternative Route Generation Choice Model Toronto
Senior Membership Information and Fees
Senior Membership Information and Fees All people using club facilities are required to be full members. You can pay to be coached at the club for a 6 week period, or try out senior club night a couple
Coupling distributed and symbolic execution for natural language queries. Lili Mou, Zhengdong Lu, Hang Li, Zhi Jin
Coupling distributed and symbolic execution for natural language queries Lili Mou, Zhengdong Lu, Hang Li, Zhi Jin doublepower.mou@gmail.com Outline Introduction to neural enquirers Coupled approach of
Incorporating Sidewalks into Transportation Asset Management. Presentation by Alan S. Kercher, P.E. Kercher Engineering, Inc.
Incorporating Sidewalks into Transportation Asset Management Presentation by Alan S. Kercher, P.E. Kercher Engineering, Inc. Integrated Management of Infrastructure Example: Urban Environment Pavements
EXPERIMENT 6 THE SPEED OF SOUND USING THE RESONANCE OF LONGITUDINAL WAVES
EXPERIMENT 6 THE SPEED OF SOUND USING THE RESONANCE OF LONGITUDINAL WAVES Sound waves produced by a tuning fork are sent down a tube filled with a gas. The waves reflect back up the tube from a water surface
Town of Dayton. ADA Pedestrian Mobility Plan Area Plan Commission of Tippecanoe County
Town of Dayton ADA Pedestrian Mobility Plan Area Plan Commission of Tippecanoe County Purpose and Demographics - Equal access is a federal requirement. The Lafayette MPO has taken responsibility for ensuring
The Ricardian Continuum Model
The Ricardian Continuum Model Notes for Graduate Trade Lectures J. Peter Neary University of Oxford October 12, 213 J.P. Neary (University of Oxford) Ricardian Continuum Model October 12, 213 1 / 17 Plan
INNISFAIL AQUATIC CENTRE
PRE-SCHOOL SWIM LESSONS 3 mos - 6 yrs PARENTED AND TOT CLASSES Starfish/Duck (4 mos - 2 yrs) This is an orientation to the water for babies and their parents/guardians. Babies must be able to hold their
Amanda Meehan, Erica Saleska, Marjorie Hinsdale-Shouse, Nick Kinsey and Casey Tischner. AAPOR May 17,
The Challenges of Locating Young Adults for a Longitudinal Study: Improved Tracing Strategies Implemented for the National Longitudinal Study of Adolescent Health, Wave IV Amanda Meehan, Erica Saleska,
Eastern and South Shore Nova Scotia Lobster LFAs The Fishery. DFO Atlantic Fisheries Stock Status Report 96/117E.
Maritimes Region DFO Atlantic Fisheries Stock Status Report 96/117E Eastern and South Shore Nova Scotia Lobster LFAs 31-33 Background Lobsters first entering the fishery in LFAs 31, 32, and 33 are probably
WorkSHEET 13.3 Univariate data II Name:
WorkSHEET 13.3 Univariate data II Name: 1 The back-to-back stem-and-leaf plot shows the number of people (to the nearest thousand) that attend cricket matches in both Sydney and Melbourne during a season.
Search 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]](/thumbs/84/90666740.jpg "Search 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).
SURFACE CASING SELECTION FOR COLLAPSE, BURST AND AXIAL DESIGN FACTOR LOADS EXERCISE
SURFACE CASING SELECTION FOR COLLAPSE, BURST AND AXIAL DESIGN FACTOR LOADS EXERCISE Instructions Use the example well data from this document or the powerpoint notes handout to complete the following graphs.
Flyweight Pattern. Flyweight: Intent. Use sharing to support large numbers of fine-grained objects efficiently. CSIE Department, NTUT Chien-Hung Liu
Flyweight Pattern CSIE Department, NTUT Chien-Hung Liu Flyweight: Intent Use sharing to support large numbers of fine-grained objects efficiently 1 Flyweight: Motivation (1) Some applications could benefit
Designing a Traffic Circle By David Bosworth For MATH 714
Designing a Traffic Circle By David Bosworth For MATH 714 Abstract We all have had the experience of sitting in a traffic jam, or we ve seen cars bunched up on a road for some no apparent reason. The use
EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 6. Wenbing Zhao. Department of Electrical and Computer Engineering
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 6 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org Outline 2 Review of lecture 5 The
Application of Bayesian Networks to Shopping Assistance
Application of Bayesian Networks to Shopping Assistance Yang Xiang, Chenwen Ye, and Deborah Ann Stacey University of Guelph, CANADA Abstract. We develop an on-line shopping assistant that can help a e-shopper
Uninformed 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
CSE 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 },