Hashing. Alexandra Stefan
|
|
- Winfred Farmer
- 6 years ago
- Views:
Transcription
1 Hashng Alexandra Stefan 1
2 Hash tables Tables Drect access table (or key-ndex table): key => ndex Hash table: key => hash value => ndex Man components Hash functon Collson resoluton Dfferent keys mapped to the same ndex Dynamc hashng reallocate the table as needed If an Insert operaton brngs the load factor to ½, double the table. If a Delete operaton brngs the load factor to 1/8, half the table. Propertes: Good tme-space trade-off Good for: Search, nsert, delete O(1) Not good for: Select, sort not supported, must use a dfferent method Readng: chapter 11, CLRS (chapter 1, Sedgewck has more complexty analyss)
3 Example Let M = 10, h(k) = k%10 Insert keys: 6 -> > 5 0 -> > 7 3 -> 3 5 -> 5 collson 35 -> 9 -> Collson resoluton: - Separate channg - Open addressng - Lnear probng - Quadratc probng ndex k Double hashng 3 8 9
4 Hash functons M table sze. h hash functon that maps a key to an ndex We want random-lke behavor: any key can be mapped to any ndex wth equal probablty. Typcal functons: h(k,m) = floor( ((k-s)/(t-s))* M ) Here s k<t. Smple, good f keys are random, not so good otherwse. h(k,m) = k % M Best M s a prme number. (Avod M that has a power of factor, wll generate more collsons). Choose M a prme number that s closest to the desred table sze. If M = p, t uses only the lower order p bts => bad, deally use all bts. h(k,m) = floor(m*(k*a mod 1)), 0<A<1 (n CLRS) Good A = (the golden rato) Useful when M s not prme (can pck M to be a power of ) Alternatve: h(k,m) = (16161 * (unsgned)k ) % M (from Sedgewck)
5 Collson Resoluton: Separate Channg α = N/M (N tems n the table, M table sze) load factor Separate channg Each table entry ponts to a lst of all tems whose keys were mapped to that ndex. Requres extra space for lnks n lsts Lsts wll be short. On average, sze α. Preferred when the table must support deletons. Operatons: Chan_Insert(T,x) - O(1) nsert x n lst T[h(x.key)] at begnnng. No search for duplcates Chan_Delete(T,x) O(1) delete x from lst T[h(x.key)] Chan_Search(T, k) Θ(1+ α) (both successful and unsuccessful) search n lst T[h(k)] for an tem x wth x.key == k. 5
6 Separate Channg Example: nsert 5 Let M = 10, h(k) = k%10 Insert keys: 6 -> > 5 0 -> > 7 3 -> 3 5 -> 5 collson > ndex k Insertng at the begnnng of the lst s advantageous n cases where the more recent data s more lkely to be accessed agan (e.g. new students wll have to go see several offces at UTA and so they wll be lookedup more frequently than contnung students. α = 6
7 Collson Resoluton: Open Addressng α = N/M (N tems n the table, M table sze) load factor Open addressng: Use empty cells n the table to store colldng elements. M > N α rato of used cells from the table (<1). Probng examnng slots n the table. Number of probes = number of slots examned. Lnear probng: h(k,,m) = (h 1 (k) + )% M, If the slot where the key s hashed s taken, use the next avalable slot. Long chans Quadratc probng: h(k,,m) = (h 1 (k) + c 1 + c )% M, If two keys hash to the same value, they follow the same set of probes. Double hashng: h(k,,m) = (h 1 (k) + * h (k)) % M, h (k) should not evaluate to 0. (E.g. use: h (k) = 1 + k%(m-1) ) Use a second hash value as the jump sze (as opposed to sze 1 n lnear probng). Want: h (k) relatvely prme wth M. M prme and h (k) = 1 + k%(m-1) M= p and h (k) = odd (M and h (k) wll be relatvely prme snce all the dvsors of M are powers of, thus even). See fgure 1.10, page 596 (Sedgewck) for clusterng produced by lnear probng and double hashng. 7
8 Open Addressng: quadratc Worksheet M = 10, h 1 (k) = k%10. Table already contans keys: 6, 15, 0, 37, 3 Next want to nsert 5: h 1 (5) = 5 (collson: 5 wth 15) Lnear probng Index Lnear Quadratc Double hashng h (k) = 1+(k%7) Double hashng h (k) = 1+(k%9) - h(k,,m) = (h 1 (k) + )% M (try slots: 5,6,7,8) Quadratc probng example: 1 - h(k,,m) = (h 1 (k) + + )% M (try slots: 5, 8) - Insertng 35(not shown n table): (probe) 0 h 1 (k) + + % (try slots: 5, 8, 3,0) Where wll 9 be nserted now (after 35)?
9 Open Addressng: quadratc Answers M = 10, h 1 (k) = k%10. Table already contans keys: 6, 15, 0, 37, 3 Next want to nsert 5: h 1 (5) = 5 (collson: 5 wth 15) Lnear probng - h(k,,m) = (h 1 (k) + )% M (try slots: 5,6,7,8) Quadratc probng example: - h(k,,m) = (h 1 (k) + + )% M (try slots: 5, 8) - Insertng 35(not shown n table): (try slots: 5, 8, 3,0) (probe) h 1 (k) + + % = = = *3+3 = 5+15=0 0 Index Lnear Quadratc Double hashng h (k) = 1+(k%7) Double hashng h (k) = 1+(k%9) Where wll 9 be nserted now (after 35)?
10 Open Addressng : double hashng - Worksheet M = 10, h 1 (k) = k%10. Table already contans keys: 6, 15, 0, 37, 3 Try to nsert 5: h 1 (5) = 5 (collson: 5 wth 15) Double hashng example - h(k,,m) = (h 1 (k) + * h (k)) % M Choce of h matters: - h a (k) = 1+(k%7): try slots: 5, 9, - h (5) = 1+ (5%7) = 1+ = 5 => h(k,,m) = (5 + *5)%M => slots: 5,0,5,0, Cannot nsert 5. - h b (k) = 1+(k%9): - h (5) = 1 + (5%9) = = 8 => h(k,,m) = (5 + *8)%M => slots: 5,3,1,7,5, (probe) h 1 (k) + + % = = = *3+3 = 5+15=0 0 Index Lnear Quadratc Double hashng h (k) = 1+(k%7) Double hashng h (k) = 1+(k%9) (pro be) 0 1 Inde x (h 1 (k) + *h a (k) )%M (5+*5)%10 (pro be) 0 1 Index (h 1 (k) + *h b (k) )%M (5+*8)% Where wll 9 be nserted now? 10
11 Open Addressng : double hashng - Answers M = 10, h 1 (k) = k%10. Table already contans keys: 6, 15, 0, 37, 3 Try to nsert 5: h 1 (5) = 5 (collson: 5 wth 15) Double hashng example - h(k,,m) = (h 1 (k) + * h (k)) % M Choce of h matters: - h a (k) = 1+(k%7): try slots: 5, 9, - h (5) = 1+ (5%7) = 1+ = 5 => h(k,,m) = (5 + *5)%M => slots: 5,0,5,0, Cannot nsert 5. - h b (k) = 1+(k%9): - h (5) = 1 + (5%9) = = 8 => h(k,,m) = (5 + *8)%M => slots: 5,3,1,7,5, (probe) h 1 (k) + + % = = = *3+3 = 5+15=0 0 Index Lnear Quadratc Double hashng h (k) = 1+(k%7) Double hashng h (k) = 1+(k%9) (pro be) Inde x (h 1 (k) + *h a (k) )%M (5+*5)% (5+0)%10=5 1 0 (5+5)%10=0 5 (5+*5)%10 =15%10= 5 Cycles back to 5 => Cannot nsert (5+3*5)%10=0%10= 0 (pro be) Index (h 1 (k) + *h b (k) )%M (5+*8)% (5+0)%10=5 1 3 (5+8)%10=3 1 (5+*8)%10 =1%10= (5+3*8)%10=9%10= 9 7 (5+*8)%10=37%10= (5+5*8)%10=5%10= 5 Cycles back to Where wll 9 be nserted now? 11
12 Open Addressng: Quadratc vs double hashng M = 10, h 1 (k) = k%10. Table already contans keys: 6, 15, 0, 37, 3 Try to nsert 5: h 1 (5) = 5 (collson: 5 wth 15) Quadratc hashng wth: + h(k)= (h 1 (k) + + )%M where h 1 (k) = k%m (probe) Index h(k)=(h 1 (k) + + )%M =(5 + + )%10 (k=5) Double hashng: h(k)=(h 1 (k)+*h (k) )%M where: h 1 (k) = k%m h (k) = 1+(k%(M-1)) = 1+(k%9) h (5) = 1+(5%9) = 1+7 = 8 (pro be) Index h(k)=(h 1 (k)+*h (k) )%M = (5+*8)%10 (for k=5) Index Lnear Quadratc Double hashng h (k) = 1+(k%7) Double hashng h (k) = 1+(k%9) Choce of h matters. See h (k) = 1+(k%7) h (5) = 1+ = 5 => h(5) cycles: 5,0,5,0 => Could not nsert Where wll 9 be nserted now? 1
13 Open Addressng: Quadratc vs double hashng M = 10, h 1 (k) = k%10. Table already contans keys: 6, 15, 0, 37, 3 Try to nsert 5: h 1 (5) = 5 (collson: 5 wth 15) Quadratc hashng wth: + h(k)= (h 1 (k) + + )%M where h 1 (k) = k%m (probe) Index = = =13 h(k)=(h 1 (k) + + )%M =(5 + + )%10 (k=5) *3+3 = 5+15=0 Double hashng: h(k)=(h 1 (k)+*h (k) )%M where: h 1 (k) = k%m h (k) = 1+(k%(M-1)) = 1+(k%9) h (5) = 1+(5%9) = 1+7 = 8 (pro be) Index 0 5 (5+0)%10=5 1 3 (5+8)%10=3 h(k)=(h 1 (k)+*h (k) )%M = (5+*8)%10 (for k=5) 1 (5+*8)%10 =31%10= (5+3*8)%10=9%10= 9 7 (5+*8)%10=37%10= (5+5*8)%10=5%10= 5 Cycles back to 5 Choce of h matters. See h (k) = 1+(k%7) h (5) = 1+ = 5 => h(5) cycles: 5,0,5,0 => Could not nsert 5. Index Lnear Quadratc Double hashng h (k) = 1+(k%7) Double hashng h (k) = 1+(k%9) Where wll 9 be nserted now? 13
14 Searchng: Search and Deleton n Open Addressng Report as not found when land on an EMPTY cell Deleton: Mark the cell as DELETED, not as an EMPTY cell Otherwse you wll break the chan and not be able to fnd elements followng n that chan. E.g., wth lnear probng, and hash functon h(k,,10) = (k + ) %10, nsert 15,5,35,5, search for 5, then delete 5 and search for 5 or 35. 1
15 Open Addressng: clusterng Lnear probng prmary clusterng: the longer the chan, the hgher the probablty that t wll ncrease. Gven a chan of sze T n a table of sze M, what s the probablty that ths chan wll ncrease after a new nserton? Quadratc probng 15
16 Expected Tme Complexty for Hash Operatons (under perfect condtons) Operaton \Methods Separate channg Open Addressng Successful search Θ(1+α) (1/α)ln(1/(1-α)) Unsuccessful search Θ(1+α) 1/(1-α) Insert Delete Θ(1) When: nsert at begnnng and no search for duplcates Θ(1) Assumes: doubly-lnked lst and node wth tem to be deleted s gven. 1/(1-α) Perfect condtons: smple unform hashng unform hashng The tme complexty does not depend only on α, (but also on the deleted cells). In such cases separate channg may be preferred to open addressng as ts behavor has better guarantees. Reference Theorem 11.1 and 11. Theorem 11.6 and 11.8 and corollary 11.7 n CLRS α = N/M s the load factor 16
17 Perfect Hashng Smlar to separate channg, but use another hash table nstead of a lnked lst. Can be done for statc keys (once the keys are stored n the table, the set of keys never changes). Corollary 11.11:Suppose that we store N keys n a hash table usng perfect hashng. Then the expected storage used for the secondary hash tables s less than N. 17
18 Hashng Strngs Gven strngs wth 7-bt encoded characters Vew the strng as a number n base 18 where each letter s a dgt. Convert t to base 10 Apply mod M Example: now : n = 110, o = 111, w = 119: h( now,m) = (110* * ) % M See Sedgewck page 576 (fgure 1.3) for the mportance of M for collsons M = 31 s better than M = 6 When M = 6, t s a dvsor of 18 => (110* * ) % M = 119 % M => only the last letter s used. => f lowercase Englsh letters: a,,z=> 97,,1 => (%6) => 6 ndexes, [33,...,58], used out of [0,63] avalable. Addtonal collsons wll happen due to last letter dstrbuton (how many words end n t?). 18
19 Hashng Long Strngs For long strngs, the prevous method wll result n number overflow. E.g.: 6-bt ntegers 11 character long word: c*18 10 = c*( 7 ) 10 = c* 70 Vew the word as a number n base 18 (each letter s a dgt ). Soluton: partal calculatons: Replace: c 10 * c 9 * c 1 * c 0 wth: ((c 10 * 18 + c 9 ) * 18 + c 8 )*18+.+ c 1 )*18 + c 0 ) Compute t teratvely and apply mod M at each teraton: // (Sedgewck) nt hash(char *v, nt M) { nt h = 0, a = 18; for (; *v!= '\0'; v++) h = (a*h + *v) % M; return h; } // mprovement: use 17, not 18: (Sedgewck) nt hash(char *v, nt M) { nt h = 0, a = 17; for (; *v!= '\0'; v++) h = (a*h + *v) % M; return h; 19 }
Introduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/18.401J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) What data structures
More informationLecture 3 January 31, 2017
CS 224: Advanced Algorthms Sprng 207 Prof. Jelan Nelson Lecture 3 January 3, 207 Scrbe: Saketh Rama Overvew In the last lecture we covered Y-fast tres and Fuson Trees. In ths lecture we start our dscusson
More informationSome Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM
Example of Extended Eucldean Algorthm Recall that gcd(84, 33) = gcd(33, 18) = gcd(18, 15) = gcd(15, 3) = gcd(3, 0) = 3 We work backwards to wrte 3 as a lnear combnaton of 84 and 33: 3 = 18 15 [Now 3 s
More informationCHAPTER 17 Amortized Analysis
CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationLecture 8 Modal Analysis
Lecture 8 Modal Analyss 16.0 Release Introducton to ANSYS Mechancal 1 2015 ANSYS, Inc. February 27, 2015 Chapter Overvew In ths chapter free vbraton as well as pre-stressed vbraton analyses n Mechancal
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationDiscussion 11 Summary 11/20/2018
Dscusson 11 Summary 11/20/2018 1 Quz 8 1. Prove for any sets A, B that A = A B ff B A. Soluton: There are two drectons we need to prove: (a) A = A B B A, (b) B A A = A B. (a) Frst, we prove A = A B B A.
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationLecture Space-Bounded Derandomization
Notes on Complexty Theory Last updated: October, 2008 Jonathan Katz Lecture Space-Bounded Derandomzaton 1 Space-Bounded Derandomzaton We now dscuss derandomzaton of space-bounded algorthms. Here non-trval
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationGraphs and Trees: cycles detection and stream segmentation. Lorenzo Cioni Dipartimento di Informatica Largo Pontecorvo 3 Pisa
Graphs and Trees: cycles detecton and stream segmentaton Lorenzo Con Dpartmento d Informatca Largo Pontecorvo 3 Psa lcon@d.unp.t Man topcs of the talk Two algorthms: segmentaton of a stream of data applcaton:
More informationSplit alignment. Martin C. Frith April 13, 2012
Splt algnment Martn C. Frth Aprl 13, 2012 1 Introducton Ths document s about algnng a query sequence to a genome, allowng dfferent parts of the query to match dfferent parts of the genome. Here are some
More information04 - Treaps. Dr. Alexander Souza
Algorths Theory 04 - Treaps Dr. Alexander Souza The dctonary proble Gven: Unverse (U,
More informationA 2D Bounded Linear Program (H,c) 2D Linear Programming
A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms CSE 53 Lecture 4 Dynamc Programmng Junzhou Huang, Ph.D. Department of Computer Scence and Engneerng CSE53 Desgn and Analyss of Algorthms The General Dynamc Programmng Technque
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationInsert Sorted List Insert as the Last element (the First element?) Delete Chaining. 2 Slide courtesy of Dr. Sang-Eon Park
1617 Preview Data Structure Review COSC COSC Data Structure Review Linked Lists Stacks Queues Linked Lists Singly Linked List Doubly Linked List Typical Functions s Hash Functions Collision Resolution
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationGeneral theory of fuzzy connectedness segmentations: reconciliation of two tracks of FC theory
General theory of fuzzy connectedness segmentatons: reconclaton of two tracks of FC theory Krzysztof Chrs Ceselsk Department of Mathematcs, West Vrgna Unversty and MIPG, Department of Radology, Unversty
More informationQuadratic speedup for unstructured search - Grover s Al-
Quadratc speedup for unstructured search - Grover s Al- CS 94- gorthm /8/07 Sprng 007 Lecture 11 001 Unstructured Search Here s the problem: You are gven a boolean functon f : {1,,} {0,1}, and are promsed
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationGraphical Analysis of a BJT Amplifier
4/6/2011 A Graphcal Analyss of a BJT Amplfer lecture 1/18 Graphcal Analyss of a BJT Amplfer onsder agan ths smple BJT amplfer: ( t) = + ( t) O O o B + We note that for ths amplfer, the output oltage s
More informationRyan (2009)- regulating a concentrated industry (cement) Firms play Cournot in the stage. Make lumpy investment decisions
1 Motvaton Next we consder dynamc games where the choce varables are contnuous and/or dscrete. Example 1: Ryan (2009)- regulatng a concentrated ndustry (cement) Frms play Cournot n the stage Make lumpy
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationNice plotting of proteins II
Nce plottng of protens II Fnal remark regardng effcency: It s possble to wrte the Newton representaton n a way that can be computed effcently, usng smlar bracketng that we made for the frst representaton
More informationProvable Security Signatures
Provable Securty Sgnatures UCL - Louvan-la-Neuve Wednesday, July 10th, 2002 LIENS-CNRS Ecole normale supéreure Summary Introducton Sgnature FD PSS Forkng Lemma Generc Model Concluson Provable Securty -
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for U Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Adjusted Control Lmts for U Charts Copyrght 207 by Taylor Enterprses, Inc., All Rghts Reserved. Adjusted Control Lmts for U Charts Dr. Wayne A. Taylor Abstract: U charts are used
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationAlgebraic properties of polynomial iterates
Algebrac propertes of polynomal terates Alna Ostafe Department of Computng Macquare Unversty 1 Motvaton 1. Better and cryptographcally stronger pseudorandom number generators (PRNG) as lnear constructons
More informationMean Field / Variational Approximations
Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but
More informationNovember 5, 2002 SE 180: Earthquake Engineering SE 180. Final Project
SE 8 Fnal Project Story Shear Frame u m Gven: u m L L m L L EI ω ω Solve for m Story Bendng Beam u u m L m L Gven: m L L EI ω ω Solve for m 3 3 Story Shear Frame u 3 m 3 Gven: L 3 m m L L L 3 EI ω ω ω
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationProf. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model
EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationEN40: Dynamics and Vibrations. Homework 4: Work, Energy and Linear Momentum Due Friday March 1 st
EN40: Dynamcs and bratons Homework 4: Work, Energy and Lnear Momentum Due Frday March 1 st School of Engneerng Brown Unversty 1. The fgure (from ths publcaton) shows the energy per unt area requred to
More informationUnit 5: Quadratic Equations & Functions
Date Perod Unt 5: Quadratc Equatons & Functons DAY TOPIC 1 Modelng Data wth Quadratc Functons Factorng Quadratc Epressons 3 Solvng Quadratc Equatons 4 Comple Numbers Smplfcaton, Addton/Subtracton & Multplcaton
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationIV. Performance Optimization
IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationAttacks on RSA The Rabin Cryptosystem Semantic Security of RSA Cryptology, Tuesday, February 27th, 2007 Nils Andersen. Complexity Theoretic Reduction
Attacks on RSA The Rabn Cryptosystem Semantc Securty of RSA Cryptology, Tuesday, February 27th, 2007 Nls Andersen Square Roots modulo n Complexty Theoretc Reducton Factorng Algorthms Pollard s p 1 Pollard
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #16 Scribe: Yannan Wang April 3, 2014
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #16 Scrbe: Yannan Wang Aprl 3, 014 1 Introducton The goal of our onlne learnng scenaro from last class s C comparng wth best expert and
More informationLecture Nov
Lecture 18 Nov 07 2008 Revew Clusterng Groupng smlar obects nto clusters Herarchcal clusterng Agglomeratve approach (HAC: teratvely merge smlar clusters Dfferent lnkage algorthms for computng dstances
More informationFundamental Algorithms
Chapter 5: Hash Tables, Winter 2018/19 1 Fundamental Algorithms Chapter 5: Hash Tables Jan Křetínský Winter 2018/19 Chapter 5: Hash Tables, Winter 2018/19 2 Generalised Search Problem Definition (Search
More informationChapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.
Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where y + = β + β e for =,..., y and are observable varables e s a random error How can an estmaton rule be constructed for the
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationPopulation element: 1 2 N. 1.1 Sampling with Replacement: Hansen-Hurwitz Estimator(HH)
Chapter 1 Samplng wth Unequal Probabltes Notaton: Populaton element: 1 2 N varable of nterest Y : y1 y2 y N Let s be a sample of elements drawn by a gven samplng method. In other words, s s a subset of
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationFormal solvers of the RT equation
Formal solvers of the RT equaton Formal RT solvers Runge- Kutta (reference solver) Pskunov N.: 979, Master Thess Long characterstcs (Feautrer scheme) Cannon C.J.: 970, ApJ 6, 55 Short characterstcs (Hermtan
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationData Structures and Algorithm. Xiaoqing Zheng
Data Structures and Algorithm Xiaoqing Zheng zhengxq@fudan.edu.cn Dictionary problem Dictionary T holding n records: x records key[x] Other fields containing satellite data Operations on T: INSERT(T, x)
More information11 Tail Inequalities Markov s Inequality. Lecture 11: Tail Inequalities [Fa 13]
Algorthms Lecture 11: Tal Inequaltes [Fa 13] If you hold a cat by the tal you learn thngs you cannot learn any other way. Mark Twan 11 Tal Inequaltes The smple recursve structure of skp lsts made t relatvely
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More information