CSE 101. Algorithm Design and Analysis Miles Jones Office 4208 CSE Building Lecture 9: Greedy
|
|
- Alaina Hutchinson
- 5 years ago
- Views:
Transcription
1 CSE 101 Algorithm Design and Analysis Miles Jones Office 4208 CSE Building Lecture 9: Greedy
2 GENERAL PROBLEM SOLVING In general, when you try to solve a problem, you are trying to find a solution from among a large space of possibilities. You usually do this by making a series of decisions and continuing based on what the new state of the problem has become.
3 GENERAL PROBLEM SOLVING In general, when you try to solve a problem, you are trying to find a solution from among a large space of possibilities. You usually do this by making a series of decisions and continuing based on what the new state of the problem has become. If you have no information about which choice is best, you may have to use exhaustive enumeration or Brute Force to try out all possibilities and find the optimal one. This might take a long time to do. What are some other ideas in general?
4 THE GREEDY METHOD In some cases (not all!!!!!), there is sufficient structure that allows you to reach the correct solution by just picking the straightforward best decision at each stage. This is called the Greedy Method.
5 THE GREEDY METHOD In some cases (not all!!!!!), there is sufficient structure that allows you to reach the correct solution by just picking the straightforward best decision at each stage. This is called the Greedy Method. It doesn t always work. Just as in life, acting in one s immediate best interest is not always the best longer-term strategy.
6 COOKIES Suppose you are the cookie monster and you have a 6x6 sheet of freshly baked cookies in front of you. The cookies are all chocolate chip cookies but they may have different sizes If you are only allowed to take six cookies. Devise an algorithm to do this.
7 COOKIES What is an algorithm you could use to select the best option? (The best option means that the sum of all the cookie s sizes is the highest possible.)
8 COOKIES What is an algorithm you could use to select the best option? (The best option means that the sum of all the cookie s sizes is the highest possible.) =555
9 COOKIES What is an algorithm you could use to select the best option if you can only select one cookie from each row?
10 COOKIES What is an algorithm you could use to select the best option if you can only select one cookie from each row? =
11 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column?
12 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column?
13 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column?
14 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column?
15 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column?
16 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column? =404
17 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column? = =414
18 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column? = = =458!!!!!!!!
19 COOKIES What is an algorithm you could use to select the best option if you can t select 2 cookies from the same row or column? = = =458!!!!!!!!
20 THE GREEDY METHOD As you have seen, the Greedy Method does not always work. Because of this, in order to use the Greedy Method, we must prove the correctness of the algorithm. Or else, we must present a counterexample to show that a particular greedy method will not work.
21 THE GREEDY METHOD (WARNING!!) As you have seen, the Greedy Method does not always work. Because of this, in order to use the Greedy Method, we must prove the correctness of the algorithm. Furthermore, for a single problem, there may be more than one potential greedy strategy i.e. more than one way to choose the best possible choice at each step. The problem may be solved in one way but not the other.
22 GREEDY DIJKSTRA S We have already seen a greedy algorithm. Instance: a graph with positive edge weights and a vertex s Solution form: dist(v) is the length of a path from s to v Constraints: No constraints that are not obvious Objective: dist(v) is set to the minimum distance from s to v
23 GREEDY DIJKSTRA S What is the greedy property? Pick the next vertex u such that the distance from s to u is smallest (and u has not been picked yet.)
24 EVENT SCHEDULING Suppose you are running a conference and you have a collection of events (or talks) that each have a start time and an end time. Oh no!!! You only have one conference room!!!! Your goal is to schedule the most events possible that day such that no two events overlap.
25 EVENT SCHEDULING Your goal is to schedule the most events possible that day such that no two events overlap. Brute Force: Say that T is the set of events and T =n. Let s check all possibilities. How would we do that?
26 EVENT SCHEDULING Your goal is to schedule the most events possible that day such that no two events overlap. Brute Force: Say that T is the set of events and T =n. Let s check all possibilities. How would we do that? Go through all subsets of T. Check if it is a valid schedule, i.e., no conflicts, and count the number of events. Take the maximum out of all valid schedules. (How many subsets of T are there?)
27 EVENT SCHEDULING
28 EVENT SCHEDULING Your goal is to schedule the most events possible that day such that no two events overlap. Exponential is too slow. Let s try some greedy strategies:
29 EVENT SCHEDULING Your goal is to schedule the most events possible that day such that no two events overlap. Exponential is too slow. Let s try some greedy strategies: Shortest duration Earliest start time Fewest conflicts Earliest end time
30 SHORTEST DURATION
31 EARLIEST START TIME
32 FEWEST CONFLICTS
33 COUNTEREXAMPLE FOR FEWEST CONFLICTS
34 EARLIEST FINISH TIME
35 EVENT SCHEDULING Your goal is to schedule the most events possible that day such that no two events overlap. Exponential is too slow. Let s try some greedy strategies: Shortest duration Earliest start time Fewest conflicts Earliest end time (We can t find a counterexample!!) Let s try to prove it works!!!!!
36 EVENT SCHEDULING
37 MODIFY-THE-SOLUTION There are a few proof techniques to prove greedy strategies work. We will use modify-the-solution to prove the correctness of this greedy strategy. General structure of modify-the-solution: 1. Let d be a decision point, and let g be the greedy choice at d. 2. Let S be a solution achieved by not choosing g. 3. Show how to transform S into some solution S that chooses g, and that is at least as good as S Conclude (by induction) that any S with a series of non-greedy decisions at d 1,, d n can be transformed into an equal-or-better greedy solution, and that therefore the greedy algorithm is optimal.
Route optimization using Hungarian method combined with Dijkstra's in home health care services
Research Journal of Computer and Information Technology Sciences ISSN 2320 6527 Route optimization using Hungarian method combined with Dijkstra's method in home health care services Abstract Monika Sharma
More informationReal-Time Systems Dr. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Real-Time Systems Dr. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No.# 01 Lecture No. # 07 Cyclic Scheduler Goodmorning let us get started.
More informationLecture 3: Nondeterministic Computation
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 3: Nondeterministic Computation David Mix Barrington and Alexis Maciel July 19, 2000
More information1) What is the standard divisor? A) 30.1 B) 903 C) 6.38 D) 6.88 E) 16.74
Sample Exam 2 Name TA Name Be sure to use a #2 pencil. Calculators are allowed, but cell phones or palm pilots are NOT acceptable. MULTIPLE CHOICE. Choose the one alternative that best completes the statement
More informationAlgorithms, Lecture 3 on NP : Nondeterministic Polynomial Time
Algorithms, Lecture 3 on NP : Nondeterministic Polynomial Time Last week: Defined Polynomial Time Reductions: Problem X is poly time reducible to Y X P Y if can solve X using poly computation and a poly
More informationChapter 12. Synchronous Circuits. Contents
Chapter 12 Synchronous Circuits Contents 12.1 Syntactic definition........................ 149 12.2 Timing analysis: the canonic form............... 151 12.2.1 Canonic form of a synchronous circuit..............
More informationUnit 2: Graphing Part 5: Standard Form
Unit 2: Graphing Part 5: Standard Form SWBAT graph linear equations in standard form. Assignments: Take Home Test Review 102 Lesson from Noelani Davis, https://betterlesson.com/lesson/560482/graphing-linear-functions-in-standard-form-day-1-of-2.
More informationPart I: Graph Coloring
Part I: Graph Coloring At some point in your childhood, chances are you were given a blank map of the United States, of Africa, of the whole world and you tried to color in each state or each country so
More informationHeuristic Search & Local Search
Heuristic Search & Local Search CS171 Week 3 Discussion July 7, 2016 Consider the following graph, with initial state S and goal G, and the heuristic function h. Fill in the form using greedy best-first
More informationPrevious Lecture Sequential Circuits. Slide Summary of contents covered in this lecture. (Refer Slide Time: 01:55)
Previous Lecture Sequential Circuits Digital VLSI System Design Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture No 7 Sequential Circuit Design Slide
More informationModelling a master detail scheduler for the laboratory
Fachhochschule Wiesbaden Department 06 Computer Science Modelling a master detail scheduler for the laboratory Reinhold Schäfer 1 Agenda Scenario and definitions Scheduling and re-scheduling Master detail
More informationPeak Dynamic Power Estimation of FPGA-mapped Digital Designs
Peak Dynamic Power Estimation of FPGA-mapped Digital Designs Abstract The Peak Dynamic Power Estimation (P DP E) problem involves finding input vector pairs that cause maximum power dissipation (maximum
More informationMathematics, Proofs and Computation
Mathematics, Proofs and Computation Madhu Sudan Harvard January 4, 2016 IIT-Bombay: Math, Proofs, Computing 1 of 25 Logic, Mathematics, Proofs Reasoning: Start with body of knowledge. Add to body of knowledge
More informationCPSC 121: Models of Computation. Module 1: Propositional Logic
CPSC 121: Models of Computation Module 1: Propositional Logic Module 1: Propositional Logic By the start of the class, you should be able to: Translate back and forth between simple natural language statements
More informationProblem 1 - Protoss. bul. Alexander Malinov 33., Sofia, 1729, Bulgaria academy.telerik.com
Problem - Protoss For a lot of time now, we've wondered how the highly-advanced alien race - the Protoss - can conduct short-range telecommunication without any radio transmitter/receiver. Recent studies
More informationCSC 373: Algorithm Design and Analysis Lecture 17
CSC 373: Algorithm Design and Analysis Lecture 17 Allan Borodin March 4, 2013 Some materials are from Keven Wayne s slides and MIT Open Courseware spring 2011 course at http://tinyurl.com/bjde5o5. 1 /
More informationPermutations of the Octagon: An Aesthetic-Mathematical Dialectic
Proceedings of Bridges 2015: Mathematics, Music, Art, Architecture, Culture Permutations of the Octagon: An Aesthetic-Mathematical Dialectic James Mai School of Art / Campus Box 5620 Illinois State University
More informationLesson 25: Solving Problems in Two Ways Rates and Algebra
: Solving Problems in Two Ways Rates and Algebra Student Outcomes Students investigate a problem that can be solved by reasoning quantitatively and by creating equations in one variable. They compare the
More informationBroadcast Networks with Arbitrary Channel Bit Rates
1 Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates Cheng-Hsin Hsu Joint work with Mohamed Hefeeda Simon Fraser University, Canada April 23, 2009 Outline 2 Motivation Problem
More information6.S084 Tutorial Problems L05 Sequential Circuits
Preamble: Sequential Logic Timing 6.S084 Tutorial Problems L05 Sequential Circuits In Lecture 5 we saw that for D flip-flops to work correctly, the flip-flop s input should be stable around the rising
More informationMelodic Pattern Segmentation of Polyphonic Music as a Set Partitioning Problem
Melodic Pattern Segmentation of Polyphonic Music as a Set Partitioning Problem Tsubasa Tanaka and Koichi Fujii Abstract In polyphonic music, melodic patterns (motifs) are frequently imitated or repeated,
More informationCorinne: I m thinking of a number between 220 and 20. What s my number? Benjamin: Is it 25?
Walk the Line Adding Integers, Part I Learning Goals In this lesson, you will: Model the addition of integers on a number line. Develop a rule for adding integers. Corinne: I m thinking of a number between
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Final Examination CLOSED BOOK
Department of Electrical and Computer Engineering University of Wisconsin Madison Fall 2014-2015 Final Examination CLOSED BOOK Kewal K. Saluja Date: December 14, 2014 Place: Room 3418 Engineering Hall
More informationUsing Scan Side Channel to Detect IP Theft
Using Scan Side Channel to Detect IP Theft Leonid Azriel, Ran Ginosar, Avi Mendelson Technion Israel Institute of Technology Shay Gueron, University of Haifa and Intel Israel 1 Outline IP theft issue in
More informationCryptanalysis of LILI-128
Cryptanalysis of LILI-128 Steve Babbage Vodafone Ltd, Newbury, UK 22 nd January 2001 Abstract: LILI-128 is a stream cipher that was submitted to NESSIE. Strangely, the designers do not really seem to have
More informationB291B. MATHEMATICS B (MEI) Paper 1 Section B (Foundation Tier) GENERAL CERTIFICATE OF SECONDARY EDUCATION. Friday 9 January 2009 Morning
F GENERAL CERTIFICATE OF SECONDARY EDUCATION MATHEMATICS B (MEI) Paper 1 Section B (Foundation Tier) B291B *CUP/T62437* Candidates answer on the question paper OCR Supplied Materials: None Other Materials
More informationCombinational vs Sequential
Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs Changing inputs changes outputs No regard for previous inputs
More informationCS 2104 Intro Problem Solving in Computer Science Test 1 READ THIS NOW!
READ THIS NOW! Print your name in the space provided below. There are 5 short-answer questions, priced as marked. The maximum score is 100. The grading of each question will take into account whether you
More informationMULTI-CYCLE AT SPEED TEST. A Thesis MALLIKA SHREE POKHAREL
MULTI-CYCLE AT SPEED TEST A Thesis by MALLIKA SHREE POKHAREL Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the requirements for the degree
More informationAutoChorale An Automatic Music Generator. Jack Mi, Zhengtao Jin
AutoChorale An Automatic Music Generator Jack Mi, Zhengtao Jin 1 Introduction Music is a fascinating form of human expression based on a complex system. Being able to automatically compose music that both
More informationDouble Patterning OPC and Design for 22nm to 16nm Device Nodes
Double Patterning OPC and Design for 22nm to 16nm Device Nodes Kevin Lucas, Chris Cork, Alex Miloslavsky, Gerry Luk-Pat, Xiaohai Li, Levi Barnes, Weimin Gao Synopsys Inc. Vincent Wiaux IMEC 1 Outline Introduction
More informationAchieving Faster Time to Tapeout with In-Design, Signoff-Quality Metal Fill
White Paper Achieving Faster Time to Tapeout with In-Design, Signoff-Quality Metal Fill May 2009 Author David Pemberton- Smith Implementation Group, Synopsys, Inc. Executive Summary Many semiconductor
More informationVLSI System Testing. BIST Motivation
ECE 538 VLSI System Testing Krish Chakrabarty Built-In Self-Test (BIST): ECE 538 Krish Chakrabarty BIST Motivation Useful for field test and diagnosis (less expensive than a local automatic test equipment)
More informationPreliminaries. for the Benelux Algorithm Programming Contest. Problems
Preliminaries for the Benelux Algorithm Programming Contest Problems A B C D E F G H I J K L Abandoned Animal Booming Business Crowd Control Disastrous Doubling Envious Exponents Flatland Fidget Spinner
More informationBite Size Brownies. Designed by: Jonathan Thompson George Mason University, COMPLETE Math
Bite Size Brownies Designed by: Jonathan Thompson George Mason University, COMPLETE Math The Task Mr. Brown E. Pan recently opened a new business making brownies called The Brown E. Pan. On his first day
More informationOptimization of Multi-Channel BCH Error Decoding for Common Cases. Russell Dill Master's Thesis Defense April 20, 2015
Optimization of Multi-Channel BCH Error Decoding for Common Cases Russell Dill Master's Thesis Defense April 20, 2015 Bose-Chaudhuri-Hocquenghem (BCH) BCH is an Error Correcting Code (ECC) and is used
More informationm RSC Chromatographie Integration Methods Second Edition CHROMATOGRAPHY MONOGRAPHS Norman Dyson Dyson Instruments Ltd., UK
m RSC CHROMATOGRAPHY MONOGRAPHS Chromatographie Integration Methods Second Edition Norman Dyson Dyson Instruments Ltd., UK THE ROYAL SOCIETY OF CHEMISTRY Chapter 1 Measurements and Models The Basic Measurements
More informationFinal Exam CPSC/ECEN 680 May 2, Name: UIN:
Final Exam CPSC/ECEN 680 May 2, 2008 Name: UIN: Instructions This exam is closed book. Provide brief but complete answers to the following questions in the space provided, using figures as necessary. Show
More information140 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 12, NO. 2, FEBRUARY 2004
140 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 12, NO. 2, FEBRUARY 2004 Leakage Current Reduction in CMOS VLSI Circuits by Input Vector Control Afshin Abdollahi, Farzan Fallah,
More informationYale University Department of Computer Science
Yale University Department of Computer Science P.O. Box 208205 New Haven, CT 06520 8285 Slightly smaller splitter networks James Aspnes 1 Yale University YALEU/DCS/TR-1438 November 2010 1 Supported in
More informationA combination of approaches to solve Task How Many Ratings? of the KDD CUP 2007
A combination of approaches to solve Tas How Many Ratings? of the KDD CUP 2007 Jorge Sueiras C/ Arequipa +34 9 382 45 54 orge.sueiras@neo-metrics.com Daniel Vélez C/ Arequipa +34 9 382 45 54 José Luis
More informationTopic 10. Multi-pitch Analysis
Topic 10 Multi-pitch Analysis What is pitch? Common elements of music are pitch, rhythm, dynamics, and the sonic qualities of timbre and texture. An auditory perceptual attribute in terms of which sounds
More informationMath Final Exam Practice Test December 2, 2013
Math 1050-003 Final Exam Practice Test December 2, 2013 Note that this Practice Test is longer than the Final Exam will be. This way you have extra problems to help you practice, so don t let the length
More informationAtlas Drop In Decoder
TCS DCC decoders provide the ultimate in control. This decoder is in # A1 Atlas Drop In Decoder 1.3 amp continuous, 2.0 amp peak motor drive plus four 100 ma function outputs Dither creates the ultimate
More informationMultiple Strategies to Analyze Monty Hall Problem. 4 Approaches to the Monty Hall Problem
Multiple Strategies to Analyze Monty Hall Problem There is a tendency to approach a new problem from a single perspective, often an intuitive one. The first step is to recognize this tendency and take
More informationCPM Schedule Summarizing Function of the Beeline Diagramming Method
CPM Schedule Summarizing Function of the Beeline Diagramming Method Seon-Gyoo Kim Professor, Department of Architectural Engineering, Kangwon National University, Korea Abstract The schedule hierarchy
More informationEEC 116 Fall 2011 Lab #5: Pipelined 32b Adder
EEC 116 Fall 2011 Lab #5: Pipelined 32b Adder Dept. of Electrical and Computer Engineering University of California, Davis Issued: November 2, 2011 Due: November 16, 2011, 4PM Reading: Rabaey Sections
More informationLinköping University Post Print. Quasi-Static Voltage Scaling for Energy Minimization with Time Constraints
Linköping University Post Print Quasi-Static Voltage Scaling for Energy Minimization with Time Constraints Alexandru Andrei, Petru Ion Eles, Olivera Jovanovic, Marcus Schmitz, Jens Ogniewski and Zebo Peng
More informationDaily Team Planner (DTP)
Daily Team Planner (DTP) Click on the Client Details icon Select Daily Team Planner from the Drop down Menu The Daily Team Planner for your team will be displayed. Use the Filter Panel on the left to check
More informationPCIe: EYE DIAGRAM ANALYSIS IN HYPERLYNX
PCIe: EYE DIAGRAM ANALYSIS IN HYPERLYNX w w w. m e n t o r. c o m PCIe: Eye Diagram Analysis in HyperLynx PCI Express Tutorial This PCI Express tutorial will walk you through time-domain eye diagram analysis
More informationProcessing the Output of TOSOM
Processing the Output of TOSOM William Jackson, Dan Hicks, Jack Reed Survivability Technology Area US Army RDECOM TARDEC Warren, Michigan 48397-5000 ABSTRACT The Threat Oriented Survivability Optimization
More informationPHI 3240: Philosophy of Art
PHI 3240: Philosophy of Art Session 5 September 16 th, 2015 Malevich, Kasimir. (1916) Suprematist Composition. Gaut on Identifying Art Last class, we considered Noël Carroll s narrative approach to identifying
More informationProcesses for the Intersection
7 Timing Processes for the Intersection In Chapter 6, you studied the operation of one intersection approach and determined the value of the vehicle extension time that would extend the green for as long
More informationOPERATIONS SEQUENCING IN A CABLE ASSEMBLY SHOP
OPERATIONS SEQUENCING IN A CABLE ASSEMBLY SHOP Ahmet N. Ceranoglu* 1, Ekrem Duman*, M. Hamdi Ozcelik**, * Dogus University, Dept. of Ind. Eng., Acibadem, Istanbul, Turkey ** Yapi Kredi Bankasi, Dept. of
More informationScheduler Activity Instructions
Coastal s Office of Online Learning (COOL) Kearns Hall, 216 (843) 349-6932 coastalonline@coastal.edu www.coastal.edu/online Scheduler Activity Instructions Create Activity The Scheduler activity allows
More informationCPS311 Lecture: Sequential Circuits
CPS311 Lecture: Sequential Circuits Last revised August 4, 2015 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationSudoku Music: Systems and Readymades
Sudoku Music: Systems and Readymades Paper Given for the First International Conference on Minimalism, University of Wales, Bangor, 31 August 2 September 2007 Christopher Hobbs, Coventry University Most
More informationPROF. TAJANA SIMUNIC ROSING. Midterm. Problem Max. Points Points Total 150 INSTRUCTIONS:
CSE 237A FALL 2006 PROF. TAJANA SIMUNIC ROSING Midterm NAME: ID: Solutions Problem Max. Points Points 1 20 2 20 3 30 4 25 5 25 6 30 Total 150 INSTRUCTIONS: 1. There are 6 problems on 11 pages worth a total
More informationLow-Floor Decoders for LDPC Codes
Low-Floor Decoders for LDPC Codes Yang Han and William E. Ryan University of Arizona {yhan,ryan}@ece.arizona.edu Abstract One of the most significant impediments to the use of LDPC codes in many communication
More informationAnalysis of Caprice No. 42. Throughout George Rochberg s Caprice No. 42, I hear a kind of palindrome and inverse
Mertens 1 Ruth Elisabeth Mertens Dr. Schwarz MUTH 2500.004 6 March 2017 Analysis of Caprice No. 42 Throughout George Rochberg s Caprice No. 42, I hear a kind of palindrome and inverse effect, both in the
More informationA Framework for Segmentation of Interview Videos
A Framework for Segmentation of Interview Videos Omar Javed, Sohaib Khan, Zeeshan Rasheed, Mubarak Shah Computer Vision Lab School of Electrical Engineering and Computer Science University of Central Florida
More informationMidiFind: Fast and Effec/ve Similarity Searching in Large MIDI Databases
1 MidiFind: Fast and Effec/ve Similarity Searching in Large MIDI Databases Gus Xia Tongbo Huang Yifei Ma Roger B. Dannenberg Christos Faloutsos Schools of Computer Science Carnegie Mellon University 2
More informationCombinational Logic Design
Lab #2 Combinational Logic Design Objective: To introduce the design of some fundamental combinational logic building blocks. Preparation: Read the following experiment and complete the circuits where
More informationTHE MAJORITY of the time spent by automatic test
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 17, NO. 3, MARCH 1998 239 Application of Genetically Engineered Finite-State- Machine Sequences to Sequential Circuit
More informationCS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 4: Latches, Flip-Flops, and Sequential Circuits Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
More informationVISUAL CONTENT BASED SEGMENTATION OF TALK & GAME SHOWS. O. Javed, S. Khan, Z. Rasheed, M.Shah. {ojaved, khan, zrasheed,
VISUAL CONTENT BASED SEGMENTATION OF TALK & GAME SHOWS O. Javed, S. Khan, Z. Rasheed, M.Shah {ojaved, khan, zrasheed, shah}@cs.ucf.edu Computer Vision Lab School of Electrical Engineering and Computer
More informationImplementing a Rudimentary Oscilloscope
EE-3306 HC6811 Lab #4 Implementing a Rudimentary Oscilloscope Objectives The purpose of this lab is to become familiar with the 68HC11 on chip Analog-to-Digital converter. This lab builds on the knowledge
More informationAlgorithmic Music Composition
Algorithmic Music Composition MUS-15 Jan Dreier July 6, 2015 1 Introduction The goal of algorithmic music composition is to automate the process of creating music. One wants to create pleasant music without
More informationProofs That Are Not Valid. Identify errors in proofs. Area = 65. Area = 64. Since I used the same tiles: 64 = 65
1.5 Proofs That Are Not Valid YOU WILL NEED grid paper ruler scissors EXPLORE Consider the following statement: There are tthree errorss in this sentence. Is the statement valid? GOAL Identify errors in
More informationG.709 FEC testing Guaranteeing correct FEC behavior
Technical Note G.709 FEC testing Guaranteeing correct FEC behavior Capabilities and Benefits Techniques in Detail Example The ONT-503/506/5 optical network tester from JDSU which delivers in-depth analysis
More informationLAB 1: Plotting a GM Plateau and Introduction to Statistical Distribution. A. Plotting a GM Plateau. This lab will have two sections, A and B.
LAB 1: Plotting a GM Plateau and Introduction to Statistical Distribution This lab will have two sections, A and B. Students are supposed to write separate lab reports on section A and B, and submit the
More informationLossless Compression Algorithms for Direct- Write Lithography Systems
Lossless Compression Algorithms for Direct- Write Lithography Systems Hsin-I Liu Video and Image Processing Lab Department of Electrical Engineering and Computer Science University of California at Berkeley
More informationWhat is Statistics? 13.1 What is Statistics? Statistics
13.1 What is Statistics? What is Statistics? The collection of all outcomes, responses, measurements, or counts that are of interest. A portion or subset of the population. Statistics Is the science of
More informationPhrasal Verbs to Use at Work
Phrasal Verbs to Use at Work 20 Phrasal Verbs Plus Common Expressions to Use to talk About Work With Kat from High Level Listening Are phrasal verbs too informal for the workplace? At Work Small Talk is
More informationCambridge International Examinations Cambridge International General Certificate of Secondary Education
Cambridge International Examinations Cambridge International General Certificate of Secondary Education *3811432581* COMPUTER SCIENCE 0478/21 Paper 2 Problem-solving and Programming May/June 2017 1 hour
More informationMusic Source Separation
Music Source Separation Hao-Wei Tseng Electrical and Engineering System University of Michigan Ann Arbor, Michigan Email: blakesen@umich.edu Abstract In popular music, a cover version or cover song, or
More informationGeneral Certificate of Education Advanced Subsidiary Examination June Problem Solving, Programming, Data Representation and Practical Exercise
General Certificate of Education Advanced Subsidiary Examination June 2012 Computing COMP1 Unit 1 Problem Solving, Programming, Data Representation and Practical Exercise Friday 25 May 2012 9.00 am to
More informationRandom Access Scan. Veeraraghavan Ramamurthy Dept. of Electrical and Computer Engineering Auburn University, Auburn, AL
Random Access Scan Veeraraghavan Ramamurthy Dept. of Electrical and Computer Engineering Auburn University, Auburn, AL ramamve@auburn.edu Term Paper for ELEC 7250 (Spring 2005) Abstract: Random Access
More informationPerformance evaluation of I 3 S on whale shark data
Performance evaluation of I 3 S on whale shark data Date: 25 January 2012 Version: 0.3 Authors: Jurgen den Hartog & Renate Reijns (i3s@reijns.com) Introduction I 3 S (Classic, v2.0) has been used since
More informationVISSIM TUTORIALS This document includes tutorials that provide help in using VISSIM to accomplish the six tasks listed in the table below.
VISSIM TUTORIALS This document includes tutorials that provide help in using VISSIM to accomplish the six tasks listed in the table below. Number Title Page Number 1 Adding actuated signal control to an
More informationPrecision testing methods of Event Timer A032-ET
Precision testing methods of Event Timer A032-ET Event Timer A032-ET provides extreme precision. Therefore exact determination of its characteristics in commonly accepted way is impossible or, at least,
More informationAnalysis of MPEG-2 Video Streams
Analysis of MPEG-2 Video Streams Damir Isović and Gerhard Fohler Department of Computer Engineering Mälardalen University, Sweden damir.isovic, gerhard.fohler @mdh.se Abstract MPEG-2 is widely used as
More informationBach in a Box - Real-Time Harmony
Bach in a Box - Real-Time Harmony Randall R. Spangler and Rodney M. Goodman* Computation and Neural Systems California Institute of Technology, 136-93 Pasadena, CA 91125 Jim Hawkinst 88B Milton Grove Stoke
More informationFacedown Low-Inductance Solder Pad and Via Schemes Revision 0 - Aug 8, Low ESL / 7343 Package
Update Facedown Low-Inductance Solder Pad and Via Schemes Revision 0 - Aug 8, 2008 Low ESL / 7343 Package In the quest for lower ESL devices, having the ESL reduced in the package is only half of the battle;
More informationSlide Set 9. for ENCM 501 in Winter Steve Norman, PhD, PEng
Slide Set 9 for ENCM 501 in Winter 2018 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary March 2018 ENCM 501 Winter 2018 Slide Set 9 slide
More informationPost-Routing Layer Assignment for Double Patterning
Post-Routing Layer Assignment for Double Patterning Jian Sun 1, Yinghai Lu 2, Hai Zhou 1,2 and Xuan Zeng 1 1 Micro-Electronics Dept. Fudan University, China 2 Electrical Engineering and Computer Science
More informationECE 4220 Real Time Embedded Systems Final Project Spectrum Analyzer
ECE 4220 Real Time Embedded Systems Final Project Spectrum Analyzer by: Matt Mazzola 12222670 Abstract The design of a spectrum analyzer on an embedded device is presented. The device achieves minimum
More informationCalculated Percentage = Number of color specific M&M s x 100% Total Number of M&M s (from the same row)
Name: Date: Period: The M&M (not the rapper) Lab Who would have guessed that the idea for M&M s Plain Chocolate Candies was hatched against the backdrop of the Spanish Civil War? Legend has it that, while
More informationDUE to the popularity of portable electronic products,
64 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 1, NO. 4, APRIL 013 Effective and Efficient Approach for Power Reduction by Using Multi-Bit Flip-Flops Ya-Ting Shyu, Jai-Ming Lin,
More information(Refer Slide Time: 1:45)
(Refer Slide Time: 1:45) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 30 Encoders and Decoders So in the last lecture
More informationAdvanced Data Structures and Algorithms
Data Compression Advanced Data Structures and Algorithms Associate Professor Dr. Raed Ibraheem Hamed University of Human Development, College of Science and Technology Computer Science Department 2015
More informationBuilding a Better Bach with Markov Chains
Building a Better Bach with Markov Chains CS701 Implementation Project, Timothy Crocker December 18, 2015 1 Abstract For my implementation project, I explored the field of algorithmic music composition
More informationJazz Melody Generation and Recognition
Jazz Melody Generation and Recognition Joseph Victor December 14, 2012 Introduction In this project, we attempt to use machine learning methods to study jazz solos. The reason we study jazz in particular
More informationPower Reduction Approach by using Multi-Bit Flip-Flops
International Journal of Emerging Engineering Research and Technology Volume 2, Issue 4, July 2014, PP 60-77 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Power Reduction Approach by using Multi-Bit
More informationMusic Segmentation Using Markov Chain Methods
Music Segmentation Using Markov Chain Methods Paul Finkelstein March 8, 2011 Abstract This paper will present just how far the use of Markov Chains has spread in the 21 st century. We will explain some
More informationDigital Video Recorder From Waitsfield Cable
www.waitsfieldcable.com 496-5800 Digital Video Recorder From Waitsfield Cable Pause live television! Rewind and replay programs so you don t miss a beat. Imagine coming home to your own personal library
More informationGRAPH-BASED RHYTHM INTERPRETATION
GRAPH-BASED RHYTHM INTERPRETATION Rong Jin Indiana University School of Informatics and Computing rongjin@indiana.edu Christopher Raphael Indiana University School of Informatics and Computing craphael@indiana.edu
More informationAdaptive decoding of convolutional codes
Adv. Radio Sci., 5, 29 214, 27 www.adv-radio-sci.net/5/29/27/ Author(s) 27. This work is licensed under a Creative Commons License. Advances in Radio Science Adaptive decoding of convolutional codes K.
More informationLaboratory Assignment 3. Digital Music Synthesis: Beethoven s Fifth Symphony Using MATLAB
Laboratory Assignment 3 Digital Music Synthesis: Beethoven s Fifth Symphony Using MATLAB PURPOSE In this laboratory assignment, you will use MATLAB to synthesize the audio tones that make up a well-known
More informationAskDrCallahan Calculus 1 Teacher s Guide
AskDrCallahan Calculus 1 Teacher s Guide 3rd Edition rev 080108 Dale Callahan, Ph.D., P.E. Lea Callahan, MSEE, P.E. Copyright 2008, AskDrCallahan, LLC v3-r080108 www.askdrcallahan.com 2 Welcome to AskDrCallahan
More information