Data Compression LZ77. Jens Müller Universität Stuttgart

Size: px
Start display at page:

Download "Data Compression LZ77. Jens Müller Universität Stuttgart"

Transcription

1 Dt Compession LZ77 Jens Mülle Univesität Stuttgt

2 Outline Intoution Piniple of itiony methos LZ77 Sliing winow Exmples Optimiztion Pefomne ompison Applitions/Ptents Jens Mülle- IPVS Univesität Stuttgt 2

3 Piniple of itiony methos Compessing multiple stings n e moe effiient thn ompessing single symols only (e.g. Huffmn enoing). Stings of symols e e to itiony. Lte ouenes e efeene. Stti itiony: Enties e peefine n onstnt oing to the pplition of the text Aptive itiony: Enties e tken fom the text itself n ete on-the-fly Jens Mülle- IPVS Univesität Stuttgt 3

4 LZ77 Fist ppe y Ziv n Lempel in 1977 out lossless ompession with n ptive itiony. Goes though the text in sliing winow onsisting of seh uffe n look he uffe. Seh uffe this is text tht is eing Look-he uffe e though the winow The seh uffe is use s itiony Sizes of these uffes e pmetes of the implementtion. Assumption: Pttens in text ou within nge of the seh uffe. Jens Mülle- IPVS Univesität Stuttgt 4

5 LZ77 Exmple (Enoing) Enoing of the sting: output tuple: (offset, length, symol) output (0,0,) (0,0,) (0,0,) (3,1,) (2,1,) (7,4,) Seh uffe Look-he uffe 12 htes ompesse into 6 tuples Compession te: (12*8)/(6*(5+2+3))=96/60=1,6=60%. Jens Mülle- IPVS Univesität Stuttgt 5

6 Size of output Size fo eh output tuple (offset, length, symol) when using fixe-length stoge: log 2 S + log2( S+ L) + log2 A whee S is the length of the seh uffe, L the length of the look he winow, A the size of the lphet. Why S+L n not only S? See next slie. Wost se if no symol epets in the seh uffe: n ( ) log2 S + log2( S+ L) log2 A log2 A Blow up of n + inste of Jens Mülle- IPVS Univesität Stuttgt 6

7 Enoing ehes into look-he uffe Speil se he he e s : HA output s i : H A H A H AHA! (0,0,H) s i : H A H A H A HH! (0,0,A) i : H A H A H A H A! (2,4,H) H A H A H A H A! (2,1,!) H A H A H A! Seh uffe Look-he uffe Jens Mülle- IPVS Univesität Stuttgt 7

8 Enoing Pseuo oe lgoithm while look-he uffe is not empty go kws in seh uffe to fin longest mth of the look-he uffe if mth foun else fi en while pint: (offset fom winow ouny, length of mth, next symol in lookhe uffe); shift winow y length+1; pint: (0, 0, fist symol in look-he uffe); shift winow y 1; Jens Mülle- IPVS Univesität Stuttgt 8

9 Exmple (Deoing) input (0,0,) (0,0,) (0,0,) (3,1,) (2,1,) (7,4,) Jens Mülle- IPVS Univesität Stuttgt 9

10 Deoing Pseuo oe lgoithm fo eh token (offset, length, symol) next if offset = 0 then pint symol; else fi go evese in pevious output y offset htes n opy hte wise fo length symols; pint symol; LZ77 is symmeti, enoing is moe iffiult thn eoing s it nees to fin the longest mth. Jens Mülle- IPVS Univesität Stuttgt 10

11 Optimiztions Suessos following LZ77 use iffeent optimiztions: Use vile size offset n length fiels in the tuples inste of fixe-length. Bette if smll offsets n sizes pevil. Don t output (0,0,x) token when hte is not foun ut inste iffeentite using flg-it: 0 x o 1 o,l Use ette suite t stutue (e.g. tee, hsh set) fo the uffes. This llows fste seh n/o lge uffes. Aitionl Huffmn oing of tuples/efeenes. -> LZSS, LZB, LZH, LZR, LZFG, LZMA, Deflte, Jens Mülle- IPVS Univesität Stuttgt 11

12 Pefomne 8 Bits/Symol 7 6 LZ77 LZR LZSS LZH i ook1 ook2 geo news oj1 oj2 ppe1 pi pog pog1 pogp tns Benhmk (Fom Bell/Cley/Witten: Text Compession) Jens Mülle- IPVS Univesität Stuttgt 12

13 Applitions, Ptents Unlike LZ78, LZ77 hs not een ptente. This my e eson why its suessos sing on LZ77 e so wiely use: Deflte is omintion of LZSS togethe with Huffmn enoing n uses winow size of 32kB. This lgoithm is open soue n use in wht is wiely known s ZIP ompession (lthough the ZIP fomt itself is only ontine fomt, like AVI n n e use with sevel lgoithms), n y the fomts PNG, TIFF, PDF n mny othes. Jens Mülle- IPVS Univesität Stuttgt 13

14 Refeenes SOLOMON, D.: Dt Compession, The Complete Refeene., Spinge, New Yok, 1998 BELL, T. C., CLEARY, J. G., WITTEN, I. H.: Text Compession, Pentie Hll Avne Refeene Seies, 1990 SAYOOD, K.: Intoution to Dt Compession, Aemi Pess, Sn Diego, CA,1996, ZIV, J., LEMPEL, A.: A univesl lgoithm fo sequentil t ompession. IEEE Tnstions on Infomtion Theoy 23 (1977), Jens Mülle- IPVS Univesität Stuttgt 14

International Journal of Computer Engineering and Applications, Volume XII, Issue III, March 18, ISSN

International Journal of Computer Engineering and Applications, Volume XII, Issue III, March 18,   ISSN Intentionl Jounl of Compute Engineeing n Applitions, Volume XII, Issue III, Mh 18, www.ije.om ISSN 2321-3469 WORTHWHILE STRATAGEM FOR PROCUREMENT OF LOSSLESS COMPRESSION BY ENCOMPASSED EXTENDED HUFFMAN

More information

Andersen s Algorithm. CS 701 Final Exam (Reminder) Friday, December 12, 4:00 6:00 P.M., 1289 Computer Science.

Andersen s Algorithm. CS 701 Final Exam (Reminder) Friday, December 12, 4:00 6:00 P.M., 1289 Computer Science. CS 701 Finl Exm (Reminde) Fidy, Deeme 12, 4:00 6:00 P.M., 1289 Comute Siene. Andesen s Algoithm An lgoithm to uild oints-to gh fo C ogm is esented in: Pogm Anlysis nd Seiliztion fo the C ogmming Lnguge,

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Module 4: Moral Hazard - Linear Contracts

Module 4: Moral Hazard - Linear Contracts Module 4: Mol Hzd - Line Contts Infomtion Eonomis (E 55) Geoge Geogidis A pinipl employs n gent. Timing:. The pinipl o es line ontt of the fom w (q) = + q. is the sly, is the bonus te.. The gent hooses

More information

Chapter 7. Kleene s Theorem. 7.1 Kleene s Theorem. The following theorem is the most important and fundamental result in the theory of FA s:

Chapter 7. Kleene s Theorem. 7.1 Kleene s Theorem. The following theorem is the most important and fundamental result in the theory of FA s: Chpte 7 Kleene s Theoem 7.1 Kleene s Theoem The following theoem is the most impotnt nd fundmentl esult in the theoy of FA s: Theoem 6 Any lnguge tht cn e defined y eithe egul expession, o finite utomt,

More information

Illustrating the space-time coordinates of the events associated with the apparent and the actual position of a light source

Illustrating the space-time coordinates of the events associated with the apparent and the actual position of a light source Illustting the spe-time oointes of the events ssoite with the ppent n the tul position of light soue Benh Rothenstein ), Stefn Popesu ) n Geoge J. Spi 3) ) Politehni Univesity of Timiso, Physis Deptment,

More information

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

Toward Mechanized Music Pedagogy

Toward Mechanized Music Pedagogy Tow Mehnize Musi Pegogy Lingfeng Yng Stnfo Univesity stt We n pt existing tehniques fo the sttistil moeling of musi to the moeling of the qulity of musil pefomne, esulting in fine-gine sttistil unestning

More information

Review of Mathematical Concepts

Review of Mathematical Concepts ENEE 322: Signls nd Systems view of Mthemticl Concepts This hndout contins ief eview of mthemticl concepts which e vitlly impotnt to ENEE 322: Signls nd Systems. Since this mteil is coveed in vious couses

More information

A Study of Some Integral Problems Using Maple

A Study of Some Integral Problems Using Maple Mthemtis n Sttistis (): -, 0 DOI: 0.89/ms.0.000 http://www.hpub.og A Stuy of Some Integl Poblems Ug Mple Chii-Huei Yu Deptment of Mngement n Infomtion, Nn Jeon Univesity of Siene n Tehnology, Tinn City,

More information

Week 8. Topic 2 Properties of Logarithms

Week 8. Topic 2 Properties of Logarithms Week 8 Topic 2 Popeties of Logithms 1 Week 8 Topic 2 Popeties of Logithms Intoduction Since the esult of ithm is n eponent, we hve mny popeties of ithms tht e elted to the popeties of eponents. They e

More information

Data Structures. Element Uniqueness Problem. Hash Tables. Example. Hash Tables. Dana Shapira. 19 x 1. ) h(x 4. ) h(x 2. ) h(x 3. h(x 1. x 4. x 2.

Data Structures. Element Uniqueness Problem. Hash Tables. Example. Hash Tables. Dana Shapira. 19 x 1. ) h(x 4. ) h(x 2. ) h(x 3. h(x 1. x 4. x 2. Element Uniqueness Poblem Dt Stuctues Let x,..., xn < m Detemine whethe thee exist i j such tht x i =x j Sot Algoithm Bucket Sot Dn Shpi Hsh Tbles fo (i=;i

More information

10.3 The Quadratic Formula

10.3 The Quadratic Formula . Te Qudti Fomul We mentioned in te lst setion tt ompleting te sque n e used to solve ny qudti eqution. So we n use it to solve 0. We poeed s follows 0 0 Te lst line of tis we ll te qudti fomul. Te Qudti

More information

( ) D x ( s) if r s (3) ( ) (6) ( r) = d dr D x

( ) D x ( s) if r s (3) ( ) (6) ( r) = d dr D x SIO 22B, Rudnick dpted fom Dvis III. Single vile sttistics The next few lectues e intended s eview of fundmentl sttistics. The gol is to hve us ll speking the sme lnguge s we move to moe dvnced topics.

More information

This immediately suggests an inverse-square law for a "piece" of current along the line.

This immediately suggests an inverse-square law for a piece of current along the line. Electomgnetic Theoy (EMT) Pof Rui, UNC Asheville, doctophys on YouTube Chpte T Notes The iot-svt Lw T nvese-sque Lw fo Mgnetism Compe the mgnitude of the electic field t distnce wy fom n infinite line

More information

COMPUTER AIDED ANALYSIS OF KINEMATICS AND KINETOSTATICS OF SIX-BAR LINKAGE MECHANISM THROUGH THE CONTOUR METHOD

COMPUTER AIDED ANALYSIS OF KINEMATICS AND KINETOSTATICS OF SIX-BAR LINKAGE MECHANISM THROUGH THE CONTOUR METHOD SINTIFI PROINGS XIV INTRNTIONL ONGRSS "MHINS. THNOLОGIS. MTRILS." 17 - SUMMR SSSION W ISSN 55-X PRINT ISSN 55-1 OMPUTR I NLYSIS OF KINMTIS N KINTOSTTIS OF SIX-R LINKG MHNISM THROUGH TH ONTOUR MTHO Pof.so..

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Mathematical Reflections, Issue 5, INEQUALITIES ON RATIOS OF RADII OF TANGENT CIRCLES. Y.N. Aliyev

Mathematical Reflections, Issue 5, INEQUALITIES ON RATIOS OF RADII OF TANGENT CIRCLES. Y.N. Aliyev themtil efletions, Issue 5, 015 INEQULITIES ON TIOS OF DII OF TNGENT ILES YN liev stt Some inequlities involving tios of dii of intenll tngent iles whih inteset the given line in fied points e studied

More information

Electric Potential. and Equipotentials

Electric Potential. and Equipotentials Electic Potentil nd Euipotentils U Electicl Potentil Review: W wok done y foce in going fom to long pth. l d E dl F W dl F θ Δ l d E W U U U Δ Δ l d E W U U U U potentil enegy electic potentil Potentil

More information

Equilibria of a cylindrical plasma

Equilibria of a cylindrical plasma // Miscellaneous Execises Cylinical equilibia Equilibia of a cylinical plasma Consie a infinitely long cyline of plasma with a stong axial magnetic fiel (a geat fusion evice) Plasma pessue will cause the

More information

Data Compression Techniques (Spring 2012) Model Solutions for Exercise 4

Data Compression Techniques (Spring 2012) Model Solutions for Exercise 4 58487 Dt Compressio Tehiques (Sprig 0) Moel Solutios for Exerise 4 If you hve y fee or orretios, plese ott jro.lo t s.helsii.fi.. Prolem: Let T = Σ = {,,, }. Eoe T usig ptive Huffm oig. Solutio: R 4 U

More information

Language Processors F29LP2, Lecture 5

Language Processors F29LP2, Lecture 5 Lnguge Pocessos F29LP2, Lectue 5 Jmie Gy Feuy 2, 2014 1 / 1 Nondeteministic Finite Automt (NFA) NFA genelise deteministic finite utomt (DFA). They llow sevel (0, 1, o moe thn 1) outgoing tnsitions with

More information

10 Statistical Distributions Solutions

10 Statistical Distributions Solutions Communictions Engineeing MSc - Peliminy Reding 1 Sttisticl Distiutions Solutions 1) Pove tht the vince of unifom distiution with minimum vlue nd mximum vlue ( is ) 1. The vince is the men of the sques

More information

Mark Scheme (Results) January 2008

Mark Scheme (Results) January 2008 Mk Scheme (Results) Jnuy 00 GCE GCE Mthemtics (6679/0) Edecel Limited. Registeed in Englnd nd Wles No. 4496750 Registeed Office: One90 High Holbon, London WCV 7BH Jnuy 00 6679 Mechnics M Mk Scheme Question

More information

Chapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1

Chapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1 Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

Energy Dissipation Gravitational Potential Energy Power

Energy Dissipation Gravitational Potential Energy Power Lectue 4 Chpte 8 Physics I 0.8.03 negy Dissiption Gvittionl Potentil negy Powe Couse wesite: http://fculty.uml.edu/andiy_dnylov/teching/physicsi Lectue Cptue: http://echo360.uml.edu/dnylov03/physicsfll.html

More information

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

More information

Lecture 10. Solution of Nonlinear Equations - II

Lecture 10. Solution of Nonlinear Equations - II Fied point Poblems Lectue Solution o Nonline Equtions - II Given unction g : R R, vlue such tht gis clled ied point o the unction g, since is unchnged when g is pplied to it. Whees with nonline eqution

More information

Find this material useful? You can help our team to keep this site up and bring you even more content consider donating via the link on our site.

Find this material useful? You can help our team to keep this site up and bring you even more content consider donating via the link on our site. Find this mteil useful? You cn help ou tem to keep this site up nd bing you even moe content conside donting vi the link on ou site. Still hving touble undestnding the mteil? Check out ou Tutoing pge to

More information

SIMPLE NONLINEAR GRAPHS

SIMPLE NONLINEAR GRAPHS S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle

More information

Mitosis vs meiosis: Lecture Outline 10/26/05. Independent Assortment

Mitosis vs meiosis: Lecture Outline 10/26/05. Independent Assortment Lectue Outline 10/26/05 Consequences of meiosis Gmetes e geneticlly vile Inepenent ssotment Cossing ove Lots of pctice polems Eos in meiosis Why epouce sexully? Mitosis vs meiosis: Mitosis ensues exct

More information

The Area of a Triangle

The Area of a Triangle The e of Tingle tkhlid June 1, 015 1 Intodution In this tile we will e disussing the vious methods used fo detemining the e of tingle. Let [X] denote the e of X. Using se nd Height To stt off, the simplest

More information

Conjugate Gradient (CG) Method

Conjugate Gradient (CG) Method Optimization II Conugate Gaient CG Metho Anothe metho oes not equie explicit secon eivatives, an oes not even stoe appoximation to Hessian matix CG geneates sequence of conugate seach iections, implicitly

More information

Homework 3 MAE 118C Problems 2, 5, 7, 10, 14, 15, 18, 23, 30, 31 from Chapter 5, Lamarsh & Baratta. The flux for a point source is:

Homework 3 MAE 118C Problems 2, 5, 7, 10, 14, 15, 18, 23, 30, 31 from Chapter 5, Lamarsh & Baratta. The flux for a point source is: . Homewok 3 MAE 8C Poblems, 5, 7, 0, 4, 5, 8, 3, 30, 3 fom Chpte 5, msh & Btt Point souces emit nuetons/sec t points,,, n 3 fin the flux cuent hlf wy between one sie of the tingle (blck ot). The flux fo

More information

ITI Introduction to Computing II

ITI Introduction to Computing II ITI 1121. Intoduction to Computing II Mcel Tucotte School of Electicl Engineeing nd Compute Science Abstct dt type: Stck Stck-bsed lgoithms Vesion of Febuy 2, 2013 Abstct These lectue notes e ment to be

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

Week 10: DTMC Applications Ranking Web Pages & Slotted ALOHA. Network Performance 10-1

Week 10: DTMC Applications Ranking Web Pages & Slotted ALOHA. Network Performance 10-1 Week : DTMC Alictions Rnking Web ges & Slotted ALOHA etwok efonce - Outline Aly the theoy of discete tie Mkov chins: Google s nking of web-ges Wht ge is the use ost likely seching fo? Foulte web-gh s Mkov

More information

Properties and Formulas

Properties and Formulas Popeties nd Fomuls Cpte 1 Ode of Opetions 1. Pefom ny opetion(s) inside gouping symols. 2. Simplify powes. 3. Multiply nd divide in ode fom left to igt. 4. Add nd sutt in ode fom left to igt. Identity

More information

Influence of the Magnetic Field in the Solar Interior on the Differential Rotation

Influence of the Magnetic Field in the Solar Interior on the Differential Rotation Influene of the gneti Fiel in the Sol Inteio on the Diffeentil ottion Lin-Sen Li * Deptment of Physis Nothest Noml Univesity Chnghun Chin * Coesponing utho: Lin-Sen Li Deptment of Physis Nothest Noml Univesity

More information

DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING FLUID MECHANICS III Solutions to Problem Sheet 3

DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING FLUID MECHANICS III Solutions to Problem Sheet 3 DEPATMENT OF CIVIL AND ENVIONMENTAL ENGINEEING FLID MECHANICS III Solutions to Poblem Sheet 3 1. An tmospheic vote is moelle s combintion of viscous coe otting s soli boy with ngul velocity Ω n n iottionl

More information

Prerna Tower, Road No 2, Contractors Area, Bistupur, Jamshedpur , Tel (0657) ,

Prerna Tower, Road No 2, Contractors Area, Bistupur, Jamshedpur , Tel (0657) , R Pen Towe Rod No Conttos Ae Bistupu Jmshedpu 8 Tel (67)89 www.penlsses.om IIT JEE themtis Ppe II PART III ATHEATICS SECTION I (Totl ks : ) (Single Coet Answe Type) This setion ontins 8 multiple hoie questions.

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

Kleene s Theorem. Kleene s Theorem. Kleene s Theorem. Kleene s Theorem. Kleene s Theorem. Kleene s Theorem 2/16/15

Kleene s Theorem. Kleene s Theorem. Kleene s Theorem. Kleene s Theorem. Kleene s Theorem. Kleene s Theorem 2/16/15 Models of Comput:on Lecture #8 Chpter 7 con:nued Any lnguge tht e defined y regulr expression, finite utomton, or trnsi:on grph cn e defined y ll three methods We prove this y showing tht ny lnguge defined

More information

Topic II.1: Frequent Subgraph Mining

Topic II.1: Frequent Subgraph Mining Topi II.1: Fequent Sugph Mining Disete Topis in Dt Mining Univesität des Slndes, Süken Winte Semeste 2012/13 T II.1-1 TII.1: Fequent Sugph Mining 1. Definitions nd Polems 1.1. Gph Isomophism 2. Apioi-Bsed

More information

r r E x w, y w, z w, (1) Where c is the speed of light in vacuum.

r r E x w, y w, z w, (1) Where c is the speed of light in vacuum. ISSN: 77-754 ISO 900:008 Cetified Intentionl Jonl of Engineeing nd Innovtive Tehnology (IJEIT) olme, Isse 0, Apil 04 The Replement of the Potentils s Conseene of the Limittions Set by the Lw of the Self

More information

Fourier-Bessel Expansions with Arbitrary Radial Boundaries

Fourier-Bessel Expansions with Arbitrary Radial Boundaries Applied Mthemtics,,, - doi:./m.. Pulished Online My (http://www.scirp.og/jounl/m) Astct Fouie-Bessel Expnsions with Aity Rdil Boundies Muhmmd A. Mushef P. O. Box, Jeddh, Sudi Ai E-mil: mmushef@yhoo.co.uk

More information

PH126 Exam I Solutions

PH126 Exam I Solutions PH6 Exam I Solutions q Q Q q. Fou positively chage boies, two with chage Q an two with chage q, ae connecte by fou unstetchable stings of equal length. In the absence of extenal foces they assume the equilibium

More information

Suggested t-z and q-z functions for load-movement responsef

Suggested t-z and q-z functions for load-movement responsef 40 Rtio (Exponent = 0.5 80 % Fnction (.5 times 0 Hypeolic ( = 0 % SHAFT SHEAR (% of lt 00 80 60 ULT Zhng = 0.0083 / = 50 % Exponentil (e = 0.45 80 % (stin-softening 40 0 0 0 5 0 5 0 5 RELATIVE MOVEMENT

More information

Equivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts.

Equivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts. Frtions equivlent frtions Equivlent frtions hve the sme vlue ut they hve ifferent enomintors. This mens they hve een ivie into ifferent numer of prts. Use the wll to fin the equivlent frtions: Wht frtions

More information

Incremental Maintenance of XML Structural Indexes

Incremental Maintenance of XML Structural Indexes Inementl Mintenne of XML Stutul Indexes Ke Yi Ho He Ion Stnoi Jun Yng Dept. Compute Siene Duke Univesity yike@s.duke.edu Dept. Compute Siene Duke Univesity hohe@s.duke.edu IBMT.J.Wtson Reseh Cente is@us.ibm.om

More information

Physics 604 Problem Set 1 Due Sept 16, 2010

Physics 604 Problem Set 1 Due Sept 16, 2010 Physics 64 Polem et 1 Due ept 16 1 1) ) Inside good conducto the electic field is eo (electons in the conducto ecuse they e fee to move move in wy to cncel ny electic field impessed on the conducto inside

More information

Ch 26 - Capacitance! What s Next! Review! Lab this week!

Ch 26 - Capacitance! What s Next! Review! Lab this week! Ch 26 - Cpcitnce! Wht s Next! Cpcitnce" One week unit tht hs oth theoeticl n pcticl pplictions! Cuent & Resistnce" Moving chges, finlly!! Diect Cuent Cicuits! Pcticl pplictions of ll the stuff tht we ve

More information

Lecture 4. Electric Potential

Lecture 4. Electric Potential Lectue 4 Electic Ptentil In this lectue yu will len: Electic Scl Ptentil Lplce s n Pissn s Eutin Ptentil f Sme Simple Chge Distibutins ECE 0 Fll 006 Fhn Rn Cnell Univesity Cnsevtive Ittinl Fiels Ittinl

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

Discrete Model Parametrization

Discrete Model Parametrization Poceedings of Intentionl cientific Confeence of FME ession 4: Automtion Contol nd Applied Infomtics Ppe 9 Discete Model Pmetition NOKIEVIČ, Pet Doc,Ing,Cc Deptment of Contol ystems nd Instumenttion, Fculty

More information

Outline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression

Outline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression 5-2 Dt Strutures n Algorithms Dt Compression n Huffmn s Algorithm th Fe 2003 Rjshekr Rey Outline Dt ompression Lossy n lossless Exmples Forml view Coes Definition Fixe length vs. vrile length Huffmn s

More information

CS 360 Exam 2 Fall 2014 Name

CS 360 Exam 2 Fall 2014 Name CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output

More information

Solutions to Problem Set #1

Solutions to Problem Set #1 CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors

More information

Physical Security Countermeasures. This entire sheet. I m going to put a heptadecagon into game.

Physical Security Countermeasures. This entire sheet. I m going to put a heptadecagon into game. Phsicl Secuit Countemesues This entie sheet Telmo, AHI I m going to put heptdecgon into gme. Cssie Hung Mechnicl lockpicking is mechnicked geometic constuctions with compss nd stightedge. Ech lock will

More information

The DOACROSS statement

The DOACROSS statement The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete

More information

Empirical equations for electrical parameters of asymmetrical coupled microstrip lines

Empirical equations for electrical parameters of asymmetrical coupled microstrip lines Epl equons fo elel petes of syel ouple osp lnes I.M. Bsee Eletons eseh Instute El-h steet, Dokk, o, Egypt Abstt: Epl equons e eve fo the self n utul nutne n ptne fo two syel ouple osp lnes. he obne ptne

More information

Lecture 14. Protocols. Key Distribution Center (KDC) or Trusted Third Party (TTP) KDC generates R1

Lecture 14. Protocols. Key Distribution Center (KDC) or Trusted Third Party (TTP) KDC generates R1 Lectue 14 Potocols 1 Key Distiution Cente (KDC) o Tusted Thid Pty (TTP) KDC genetes R1 lice otins R1 Msg1: K () Msg2: K (R1 K (R1) ) Msg3: K (R1) o otins R1 nd knows to use s key fo communicting with lice

More information

Previously. Extensions to backstepping controller designs. Tracking using backstepping Suppose we consider the general system

Previously. Extensions to backstepping controller designs. Tracking using backstepping Suppose we consider the general system 436-459 Advnced contol nd utomtion Extensions to bckstepping contolle designs Tcking Obseves (nonline dmping) Peviously Lst lectue we looked t designing nonline contolles using the bckstepping technique

More information

BİL 354 Veritabanı Sistemleri. Relational Algebra (İlişkisel Cebir)

BİL 354 Veritabanı Sistemleri. Relational Algebra (İlişkisel Cebir) BİL 354 Veritnı Sistemleri Reltionl lger (İlişkisel Ceir) Reltionl Queries Query lnguges: llow mnipultion nd retrievl of dt from dtse. Reltionl model supports simple, powerful QLs: Strong forml foundtion

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

Chapter 2 Finite Automata

Chapter 2 Finite Automata Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht

More information

Solids of Revolution

Solids of Revolution Solis of Revolution Solis of revolution re rete tking n re n revolving it roun n is of rottion. There re two methos to etermine the volume of the soli of revolution: the isk metho n the shell metho. Disk

More information

Section 35 SHM and Circular Motion

Section 35 SHM and Circular Motion Section 35 SHM nd Cicul Motion Phsics 204A Clss Notes Wht do objects do? nd Wh do the do it? Objects sometimes oscillte in simple hmonic motion. In the lst section we looed t mss ibting t the end of sping.

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

Ch. 2.3 Counting Sample Points. Cardinality of a Set

Ch. 2.3 Counting Sample Points. Cardinality of a Set Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of

More information

Equations from the Millennium Theory of Inertia and Gravity. Copyright 2004 Joseph A. Rybczyk

Equations from the Millennium Theory of Inertia and Gravity. Copyright 2004 Joseph A. Rybczyk Equtions fo the illenniu heoy of Ineti nd vity Copyight 004 Joseph A. Rybzyk ollowing is oplete list of ll of the equtions used o deived in the illenniu heoy of Ineti nd vity. o ese of efeene the equtions

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

Using integration tables

Using integration tables Using integrtion tbles Integrtion tbles re inclue in most mth tetbooks, n vilble on the Internet. Using them is nother wy to evlute integrls. Sometimes the use is strightforwr; sometimes it tkes severl

More information

Finite-State Automata: Recap

Finite-State Automata: Recap Finite-Stte Automt: Recp Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute of Science, Bnglore. 09 August 2016 Outline 1 Introduction 2 Forml Definitions nd Nottion 3 Closure under

More information

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister Kurs INF5080 Ifi, UiO Norsk Rgnsntrl Vårsmstr 2005 Wolfgng Listr This prt of th ours...... is hl t Ifi, UiO... (Wolfgng Listr) n t ontins mtril from Univrsity Collg Krlsruh (Ptr Ol, Clmns Knorzr) Informtion

More information

Class Summary. be functions and f( D) , we define the composition of f with g, denoted g f by

Class Summary. be functions and f( D) , we define the composition of f with g, denoted g f by Clss Summy.5 Eponentil Functions.6 Invese Functions nd Logithms A function f is ule tht ssigns to ech element D ectly one element, clled f( ), in. Fo emple : function not function Given functions f, g:

More information

Pushdown Automata (PDAs)

Pushdown Automata (PDAs) CHAPTER 2 Context-Fee Languages Contents Context-Fee Gammas definitions, examples, designing, ambiguity, Chomsky nomal fom Pushdown Automata definitions, examples, euivalence with context-fee gammas Non-Context-Fee

More information

Lesson 55 - Inverse of Matrices & Determinants

Lesson 55 - Inverse of Matrices & Determinants // () Review Lesson - nverse of Mtries & Determinnts Mth Honors - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n

More information

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

1 From NFA to regular expression

1 From NFA to regular expression Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work

More information

Data Structures and Algorithm. Xiaoqing Zheng

Data Structures and Algorithm. Xiaoqing Zheng Dt Strutures nd Algorithm Xioqing Zheng zhengxq@fudn.edu.n String mthing prolem Pttern P ours with shift s in text T (or, equivlently, tht pttern P ours eginning t position s + in text T) if T[s +... s

More information

Answers to test yourself questions

Answers to test yourself questions Answes to test youself questions opic Descibing fields Gm Gm Gm Gm he net field t is: g ( d / ) ( 4d / ) d d Gm Gm Gm Gm Gm Gm b he net potentil t is: V d / 4d / d 4d d d V e 4 7 9 49 J kg 7 7 Gm d b E

More information

Lossless Compression Lossy Compression

Lossless Compression Lossy Compression Administrivi CSE 39 Introdution to Dt Compression Spring 23 Leture : Introdution to Dt Compression Entropy Prefix Codes Instrutor Prof. Alexnder Mohr mohr@s.sunys.edu offie hours: TBA We http://mnl.s.sunys.edu/lss/se39/24-fll/

More information

The transformation to right derivation is called the canonical reduction sequence. Bottom-up analysis

The transformation to right derivation is called the canonical reduction sequence. Bottom-up analysis Bottom-up nlysis Shift-reduce prsing. Constructs the derivtion tree from ottom to top. Reduces the string to the strt symol. Produces reverse right derivtion. Exmple: G(E): 1. E E + T 2. T 3. T T * F 4.

More information

ELECTROSTATICS. 4πε0. E dr. The electric field is along the direction where the potential decreases at the maximum rate. 5. Electric Potential Energy:

ELECTROSTATICS. 4πε0. E dr. The electric field is along the direction where the potential decreases at the maximum rate. 5. Electric Potential Energy: LCTROSTATICS. Quntiztion of Chge: Any chged body, big o smll, hs totl chge which is n integl multile of e, i.e. = ± ne, whee n is n intege hving vlues,, etc, e is the chge of electon which is eul to.6

More information

Physics 505 Fall 2005 Midterm Solutions. This midterm is a two hour open book, open notes exam. Do all three problems.

Physics 505 Fall 2005 Midterm Solutions. This midterm is a two hour open book, open notes exam. Do all three problems. Physics 55 Fll 5 Midtem Solutions This midtem is two hou open ook, open notes exm. Do ll thee polems. [35 pts] 1. A ectngul ox hs sides of lengths, nd c z x c [1] ) Fo the Diichlet polem in the inteio

More information

Chapter Introduction to Partial Differential Equations

Chapter Introduction to Partial Differential Equations hpte 10.01 Intodtion to Ptil Diffeentil Eqtions Afte eding this hpte o shold be ble to: 1. identif the diffeene between odin nd ptil diffeentil eqtions.. identif diffeent tpes of ptil diffeentil eqtions.

More information

CISC 4090 Theory of Computation

CISC 4090 Theory of Computation 9/6/28 Stereotypicl computer CISC 49 Theory of Computtion Finite stte mchines & Regulr lnguges Professor Dniel Leeds dleeds@fordhm.edu JMH 332 Centrl processing unit (CPU) performs ll the instructions

More information

3.1 Magnetic Fields. Oersted and Ampere

3.1 Magnetic Fields. Oersted and Ampere 3.1 Mgnetic Fields Oested nd Ampee The definition of mgnetic induction, B Fields of smll loop (dipole) Mgnetic fields in mtte: ) feomgnetism ) mgnetiztion, (M ) c) mgnetic susceptiility, m d) mgnetic field,

More information

Important design issues and engineering applications of SDOF system Frequency response Functions

Important design issues and engineering applications of SDOF system Frequency response Functions Impotnt design issues nd engineeing pplictions of SDOF system Fequency esponse Functions The following desciptions show typicl questions elted to the design nd dynmic pefomnce of second-ode mechnicl system

More information

Analysis of Variance for Multiple Factors

Analysis of Variance for Multiple Factors Multiple Fto ANOVA Notes Pge wo Fto Anlsis Anlsis of Vine fo Multiple Ftos Conside two ftos (tetments) A nd B with A done t levels nd B done t levels. Within given tetment omintion of A nd B levels, leled

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

More information

Graph Theory. Presentation Outline. Introduction. Introduction. Introduction

Graph Theory. Presentation Outline. Introduction. Introduction. Introduction Pesenttion Otline Gp Teo Apil 8 t, 4 Olie Kiki An Plo Intotion Fnmentl Conepts Repesenttions Speil Gps Bet-Fist Se Dept-Fist Se Topologil Se Stongl Connet Components Intotion Intotion Mn ee ptil polems

More information

15.081J/6.251J Introduction to Mathematical Programming. Lecture 6: The Simplex Method II

15.081J/6.251J Introduction to Mathematical Programming. Lecture 6: The Simplex Method II 15081J/6251J Intoduction to Mathematical Pogamming ectue 6: The Simplex Method II 1 Outline Revised Simplex method Slide 1 The full tableau implementation Anticycling 2 Revised Simplex Initial data: A,

More information

Chapter 2: Introduction to Implicit Equations

Chapter 2: Introduction to Implicit Equations Habeman MTH 11 Section V: Paametic and Implicit Equations Chapte : Intoduction to Implicit Equations When we descibe cuves on the coodinate plane with algebaic equations, we can define the elationship

More information

( ) { } [ ] { } [ ) { } ( ] { }

( ) { } [ ] { } [ ) { } ( ] { } Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or

More information