Analyzing Control Structures

Size: px
Start display at page:

Download "Analyzing Control Structures"

Transcription

1 Aalyzg Cotrol Strutures sequeg P, P : two fragmets of a algo. t, t : the tme they tae the tme requred to ompute P ;P s t t Θmaxt,t For loops for to m do P t: the tme requred to ompute P total tme requred by the loop s smply mt? Cosder loop otrol? whle m do P

2 Aalyss of For Loops Whe the tme t requred for P vares as a futo of the tme taes s Ex: Fboa sequee f the strutos sde the for loop tae ostat tme, what does the algorthm tae? Is t reasoable to out the addtos at ut ost? m t futo Fboa ; j for to do j j j - retur j

3 Example: Computg Fboa Sequee It s ot reasoable to out the addtos at ut ost uless s vary small assume the tme eeded s the exat order of the umber of fgures the operads the values of ad j at the ed of -th terato are f - ad f, respetvely Movre s: the sze of f s Θ the -th terato taes Θ- Θ Θ the tme tae by the algorthm O

4 Aalyss of Reursve Algorthms futo Fbre f < the retur else retur Fbre- Fbre- Let T be the tme tae by a all o Fbre f <, the algorthm taes some ostat tme a otherwse, t taes T- T- h a T T T h f or otherwse solvg ths reurree relato, we have T Θf, o matter h s bouded by a ostat or h Θ 4

5 Whle ad Repeat Loops futo Bary_SearhT[..], x ; j ; whle < j do j ; ase x < T[]: j - ; ase x T[]:, j {retur }; ase x > T[]: ; retur No obvous way to ow how may tmes the loop wll terate two approahes fd a futo of the varables volved whose value dereases eah tme aroud treat whle le reursve algorthms 5

6 6 Aalyss of Bary_Searh Fd a futo of the varables volved whose value dereases eah tme roud the loop osder d j - ; x < T[] x T[] x > T[] / / ˆ ˆ ˆ ; - ] [ ˆ ; ˆ d j j j d j j < / / ˆ ˆ ˆ ; ˆ ; ] [ ˆ d j j j j j d j j j s at least / ˆ d d d The value of d s at least halved eah tme roud the loop the loop s etered at most tmes lg lg log

7 The Alteratve Approah Th of the whle loop as f t were mplemeted reursvely let td deote the maxmum tme eeded to termate the whle loop whe there are at most d elemets : the tme to determe that the loop s fshed b: the tme requred to go roud the loop oe t d b t d f d otherwse d s at least halved eah tme roud the loop 7

8 Usg a Barometer Barometer struto exeuted at least as ofte as ay other struto the algorthm o harm f some strutos are exeuted up to a ostat umber of tmes more ofte tha barometer Whe a algorthm volves several ested loops ay struto of the er most loop a usually be used as barometer ths should be doe arefully 8

9 Usg a Barometer: A Example pgeo T[] T[] T[] T[] T[] pgeo hole 4 s U[] Pgeo-hole sortg for to s do whle U [] do T [] U [] U [] - hoose ay of the strutos the er loop as a barometer? ths taes a tme the exat order of? 9

10 Pgeo-Hole Sortg: The Corret Aalyss for to s do whle U [] do T [] U [] U [] - Let a be the tme eeded for U[] eah tme roud the loop Let b be the tme tae by oe struto exeuto the loop for a gve, t U[]a U[]b, d: ostat tme eeded to talze ad otrol the outer loop the omplete tme s d t a d s a b Θ s

11 Example: Seleto Sort proedure selett [..] for to - do mj ; mx T [] for j to do f T [j] < mx the mj j mx T [j] T [mj] T [] T [] mx For eah, the strutos the er loop are exeuted - tmes b O j

12 Example: Iserto Sort proedure sertt [..] for to do x T []; j - whle j > ad x < T[j] do T[j] T[j] j j - T [j ] x For a gve the whle test s performed tmes the worst ase the barometer test s performed / tmes, whh s Θ j

13 Average-Case Aalyss should assume a pror prob. dstrbuto of the staes Example: serto sort T [..]: subarray of T [..], the partal ra of T []: the posto t would oupy f subarray T [..] were sorted f all! permutatos of T[..] are equally lely, the partal ra of T[] s equally lely to tae ay value [,] let be the partal ra of T [] the test s performed - tmes the avg. um the test s performed total avg. Σ

14 Solvg Reurrees: Itellget Guesswor T T f otherwse Restrt to beg eve? Restrt to beg power of? T T

15 5 Itellget Guesswor Se, t follows that lg T lg - lg T lg - T Θ lg What happes f s ot a power of? Se T s a o-dereasg futo T Θ lg / T L a b b a lg lg Q

16 6 Homogeeous Reurrees a t a t - a t - lear homogeeous: equal to zero wth ostat oeffets f f - f - f - f - - f - ay lear ombato of solutos s tself a soluto f ad g satsfy a t a t - a t - ad set t f d g f a g a d g a g a g a d f a f a f a dg f a dg f a dg f a t a t a t a L L L L

17 The Charaterst Polyomal tellget guesswor suggests loog for solutos as t x a x a x - a x - a x a x - a the haraterst polyomal px a x a x - a p x x f x r s a soluto to the haraterst equato r haraterst equato r s a soluto to the reurree a lear t r ombatos r : roots of px satsfes the reurree for ay hoe of ostats,,, 7

18 8 Example: Fboa f - f - - f - haraterst polyomal x - x - roots geeral soluto f r r determe ad otherwse or f f f f 5 ad 5 r r 5 ad 5 r r f f

19 Example t - t - - 4t - haraterst polyomal x - x -4 x x - 4 roots t 5 t 4t r - ad r 4 geeral soluto t - 4 f f otherwse determe ad 4 5 t 4 ad 9

20 Whe Roots Are Not All Dstt a t a t - a t - has oly solutos of the form provded all r are dstt whe the roots are ot all dstt ths s o loger the most geeral soluto f the t r m m p x x r x r L x rl t l m j j r j m l

21 Example t 5t t - 5t - 8t - - 4t - haraterst polyomal x - 5x 8x - 4 x - x - roots - 8t 4t r, m, r, m geeral soluto t f,, or otherwse determe,, ad 4 8 -,, -/

22 Ihomogeeous Reurree The lear ombato s o loger zero Example 4.7.4: t - t - frst step: redue to the homogeeous ase multply by : t - 6t - replae by - t - - 6t - substrate from t - 5t - 6t - d step: get the geeral form x - 5x 6 x - x - t

23 Ihomogeeous Reurrees ot. rd step: determe ostats some equatos are obtaed from the tal odto some equatos are obtaed from the reurree tself o eed to solve all ostats substtute to >, therefore t Θ ad t t t t t t t

24 Example t - t - 5 replae by - ad multply by -6-6t - t replae by - ad multply by 9 9t - - 8t t - 8t - t - - 8t - haraterst polyomal x - 8x x - 8 x - x - geeral-form soluto t solve ostats t t t -9 Θ t 8 4t 99 4

25 Smple Ihomogeeous Reurrees a t a t - a t - b p b s a ostat p s a polyomal of degree d the haraterst polyomal a x a x - a x - b d Example 4.7.4: t - t - x - x - Example 4.7.5: t - t - 5 x - x - Example 4.7.6: t t - x - x - Example 4.7.7: t t - x - x - 5

26 Geeralzed Ihomogeeous Reurrees a t a t - a t - b p b p b p b are dstt ostats p are polyomals respetvely of degree d the haraterst polyomal a x a x - a x - b d x - b d x - b d Example t t otherwse haraterst polyomal x - x - x - f 6

27 Chage of Varables T: the term of a geeral reurree t : the term of the ew reurree Example T T / Let t T f f s a power of, > t T T - t - t - t - har. polyomal: x -x - t whe, T t lg ad thus T lg lg lg lg T O lg? depeds o 7

28 8 Example 4.7. T l T/b > T: N R, l, b, ad are tegers s a strtly postve real whe / s a exat power of b T l T/b > > Θ Θ < Θ l b l b l b l T b f f log f log > Ο Ο < Ο l b l b l b l T b f f log f log

29 Rage Trasformato / f T T / otherwse let t T t T T - t - let u lg t u lg t lg t - u - u - u - har. polyomal: x - x - u substtuteto - - -, - t u -- T t lg -lg- /4 by the talzato odto: -lg 9

30 Asymptot Reurrees Whe reurrees our the aalyss of algorthms, we usually have to deal wth T 4T f f s the exat order of tal odto uow T s postve for all geeral tehque: to sadwh T betwee two reurrees defe a Ta, b 4Ta, b b f f > T a,b a b - b Θ regardless of the values of a ad b

31 To aheve our goal prove the exstee of four postve real ostats r, s, u ad v suh that T r,s T T u,v Kow T a,a a T, T a,b T a,b whe a a ad b b let ad d be postve real ostats ad let be a teger suffetly large that f d ad T 4T f for all > hoose rmt/t,, smr,, umaxt/t, ad vmaxu,d T r T, T r,r T r,s T u T, T u,u T u,v

MONOPOLISTIC COMPETITION MODEL

MONOPOLISTIC COMPETITION MODEL MONOPOLISTIC COMPETITION MODEL Key gredets Cosumer utlty: log (/ ) log (taste for varety of dfferetated goods) Produto of dfferetated produts: y (/ b) max[ f, ] (reasg returs/fxed osts) Assume that good,

More information

Ruin Probability-Based Initial Capital of the Discrete-Time Surplus Process

Ruin Probability-Based Initial Capital of the Discrete-Time Surplus Process Ru Probablty-Based Ital Captal of the Dsrete-Tme Surplus Proess by Parote Sattayatham, Kat Sagaroo, ad Wathar Klogdee AbSTRACT Ths paper studes a surae model uder the regulato that the surae ompay has

More information

Computational Geometry

Computational Geometry Problem efto omputatoal eometry hapter 6 Pot Locato Preprocess a plaar map S. ve a query pot p, report the face of S cotag p. oal: O()-sze data structure that eables O(log ) query tme. pplcato: Whch state

More information

Problems and Solutions

Problems and Solutions Problems ad Solutos Let P be a problem ad S be the set of all solutos to the problem. Deso Problem: Is S empty? Coutg Problem: What s the sze of S? Searh Problem: fd a elemet of S Eumerato Problem: fd

More information

The Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis)

The Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis) We have covered: Selecto, Iserto, Mergesort, Bubblesort, Heapsort Next: Selecto the Qucksort The Selecto Problem - Varable Sze Decrease/Coquer (Practce wth algorthm aalyss) Cosder the problem of fdg the

More information

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set. Addtoal Decrease ad Coquer Algorthms For combatoral problems we mght eed to geerate all permutatos, combatos, or subsets of a set. Geeratg Permutatos If we have a set f elemets: { a 1, a 2, a 3, a } the

More information

PTAS for Bin-Packing

PTAS for Bin-Packing CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,

More information

A Mean- maximum Deviation Portfolio Optimization Model

A Mean- maximum Deviation Portfolio Optimization Model A Mea- mamum Devato Portfolo Optmzato Model Wu Jwe Shool of Eoom ad Maagemet, South Cha Normal Uversty Guagzhou 56, Cha Tel: 86-8-99-6 E-mal: wujwe@9om Abstrat The essay maes a thorough ad systemat study

More information

Math 10 Discrete Mathematics

Math 10 Discrete Mathematics Math 0 Dsrete Mathemats T. Heso REVIEW EXERCISES FOR EXM II Whle these problems are represetatve of the types of problems that I mght put o a exam, they are ot lusve. You should be prepared to work ay

More information

This lecture and the next. Why Sorting? Sorting Algorithms so far. Why Sorting? (2) Selection Sort. Heap Sort. Heapsort

This lecture and the next. Why Sorting? Sorting Algorithms so far. Why Sorting? (2) Selection Sort. Heap Sort. Heapsort Ths lecture ad the ext Heapsort Heap data structure ad prorty queue ADT Qucksort a popular algorthm, very fast o average Why Sortg? Whe doubt, sort oe of the prcples of algorthm desg. Sortg used as a subroute

More information

Spring Ammar Abu-Hudrouss Islamic University Gaza

Spring Ammar Abu-Hudrouss Islamic University Gaza ١ ١ Chapter Chapter 4 Cyl Blo Cyl Blo Codes Codes Ammar Abu-Hudrouss Islam Uversty Gaza Spr 9 Slde ٢ Chael Cod Theory Cyl Blo Codes A yl ode s haraterzed as a lear blo ode B( d wth the addtoal property

More information

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method

More information

Design maintenanceand reliability of engineering systems: a probability based approach

Design maintenanceand reliability of engineering systems: a probability based approach Desg mateaead relablty of egeerg systems: a probablty based approah CHPTER 2. BSIC SET THEORY 2.1 Bas deftos Sets are the bass o whh moder probablty theory s defed. set s a well-defed olleto of objets.

More information

2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America

2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America SOLUTION OF SYSTEMS OF SIMULTANEOUS LINEAR EQUATIONS Gauss-Sedel Method 006 Jame Traha, Autar Kaw, Kev Mart Uversty of South Florda Uted States of Amerca kaw@eg.usf.edu Itroducto Ths worksheet demostrates

More information

Econometric Methods. Review of Estimation

Econometric Methods. Review of Estimation Ecoometrc Methods Revew of Estmato Estmatg the populato mea Radom samplg Pot ad terval estmators Lear estmators Ubased estmators Lear Ubased Estmators (LUEs) Effcecy (mmum varace) ad Best Lear Ubased Estmators

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Postpoed exam: ECON430 Statstcs Date of exam: Jauary 0, 0 Tme for exam: 09:00 a.m. :00 oo The problem set covers 5 pages Resources allowed: All wrtte ad prted

More information

Chapter 9 Jordan Block Matrices

Chapter 9 Jordan Block Matrices Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.

More information

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model Lecture 7. Cofdece Itervals ad Hypothess Tests the Smple CLR Model I lecture 6 we troduced the Classcal Lear Regresso (CLR) model that s the radom expermet of whch the data Y,,, K, are the outcomes. The

More information

Mu Sequences/Series Solutions National Convention 2014

Mu Sequences/Series Solutions National Convention 2014 Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed

More information

8.1 Hashing Algorithms

8.1 Hashing Algorithms CS787: Advaced Algorthms Scrbe: Mayak Maheshwar, Chrs Hrchs Lecturer: Shuch Chawla Topc: Hashg ad NP-Completeess Date: September 21 2007 Prevously we looked at applcatos of radomzed algorthms, ad bega

More information

(This summarizes what you basically need to know about joint distributions in this course.)

(This summarizes what you basically need to know about joint distributions in this course.) HG Ot. ECON 430 H Extra exerses for o-semar week 4 (Solutos wll be put o the et at the ed of the week) Itroduto: Revew of multdmesoal dstrbutos (Ths summarzes what you basally eed to kow about jot dstrbutos

More information

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter LOGISTIC REGRESSION Notato Model Logstc regresso regresses a dchotomous depedet varable o a set of depedet varables. Several methods are mplemeted for selectg the depedet varables. The followg otato s

More information

Lecture Notes Types of economic variables

Lecture Notes Types of economic variables Lecture Notes 3 1. Types of ecoomc varables () Cotuous varable takes o a cotuum the sample space, such as all pots o a le or all real umbers Example: GDP, Polluto cocetrato, etc. () Dscrete varables fte

More information

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class) Assgmet 5/MATH 7/Wter 00 Due: Frday, February 9 class (!) (aswers wll be posted rght after class) As usual, there are peces of text, before the questos [], [], themselves. Recall: For the quadratc form

More information

Lecture 3 Probability review (cont d)

Lecture 3 Probability review (cont d) STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto

More information

Unsupervised Learning and Other Neural Networks

Unsupervised Learning and Other Neural Networks CSE 53 Soft Computg NOT PART OF THE FINAL Usupervsed Learg ad Other Neural Networs Itroducto Mture Destes ad Idetfablty ML Estmates Applcato to Normal Mtures Other Neural Networs Itroducto Prevously, all

More information

Lecture 3. Sampling, sampling distributions, and parameter estimation

Lecture 3. Sampling, sampling distributions, and parameter estimation Lecture 3 Samplg, samplg dstrbutos, ad parameter estmato Samplg Defto Populato s defed as the collecto of all the possble observatos of terest. The collecto of observatos we take from the populato s called

More information

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015 Fall 05 Homework : Solutos Problem : (Practce wth Asymptotc Notato) A essetal requremet for uderstadg scalg behavor s comfort wth asymptotc (or bg-o ) otato. I ths problem, you wll prove some basc facts

More information

Assignment 7/MATH 247/Winter, 2010 Due: Friday, March 19. Powers of a square matrix

Assignment 7/MATH 247/Winter, 2010 Due: Friday, March 19. Powers of a square matrix Assgmet 7/MATH 47/Wter, 00 Due: Frday, March 9 Powers o a square matrx Gve a square matrx A, ts powers A or large, or eve arbtrary, teger expoets ca be calculated by dagoalzg A -- that s possble (!) Namely,

More information

ENGI 3423 Simple Linear Regression Page 12-01

ENGI 3423 Simple Linear Regression Page 12-01 ENGI 343 mple Lear Regresso Page - mple Lear Regresso ometmes a expermet s set up where the expermeter has cotrol over the values of oe or more varables X ad measures the resultg values of aother varable

More information

Chapter 4 Multiple Random Variables

Chapter 4 Multiple Random Variables Revew for the prevous lecture: Theorems ad Examples: How to obta the pmf (pdf) of U = g (, Y) ad V = g (, Y) Chapter 4 Multple Radom Varables Chapter 44 Herarchcal Models ad Mxture Dstrbutos Examples:

More information

Lecture 9: Tolerant Testing

Lecture 9: Tolerant Testing Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have

More information

MA 524 Homework 6 Solutions

MA 524 Homework 6 Solutions MA 524 Homework 6 Solutos. Sce S(, s the umber of ways to partto [] to k oempty blocks, ad c(, s the umber of ways to partto to k oempty blocks ad also the arrage each block to a cycle, we must have S(,

More information

COMP26120: Introducing Complexity Analysis (2018/19) Lucas Cordeiro

COMP26120: Introducing Complexity Analysis (2018/19) Lucas Cordeiro COMP60: Itroduig Complexity Aalysis (08/9) Luas Cordeiro luas.ordeiro@mahester.a.uk Itroduig Complexity Aalysis Textbook: Algorithm Desig ad Appliatios, Goodrih, Mihael T. ad Roberto Tamassia (hapter )

More information

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled

More information

best estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best

best estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best Error Aalyss Preamble Wheever a measuremet s made, the result followg from that measuremet s always subject to ucertaty The ucertaty ca be reduced by makg several measuremets of the same quatty or by mprovg

More information

III-16 G. Brief Review of Grand Orthogonality Theorem and impact on Representations (Γ i ) l i = h n = number of irreducible representations.

III-16 G. Brief Review of Grand Orthogonality Theorem and impact on Representations (Γ i ) l i = h n = number of irreducible representations. III- G. Bref evew of Grad Orthogoalty Theorem ad mpact o epresetatos ( ) GOT: h [ () m ] [ () m ] δδ δmm ll GOT puts great restrcto o form of rreducble represetato also o umber: l h umber of rreducble

More information

Simple Linear Regression

Simple Linear Regression Statstcal Methods I (EST 75) Page 139 Smple Lear Regresso Smple regresso applcatos are used to ft a model descrbg a lear relatoshp betwee two varables. The aspects of least squares regresso ad correlato

More information

Chapter 1 Counting Methods

Chapter 1 Counting Methods AlbertLudwgs Uversty Freburg Isttute of Empral Researh ad Eoometrs Dr. Sevtap Kestel Mathematal Statsts - Wter 2008 Chapter Coutg Methods Am s to determe how may dfferet possbltes there are a gve stuato.

More information

Chapter 14 Logistic Regression Models

Chapter 14 Logistic Regression Models Chapter 4 Logstc Regresso Models I the lear regresso model X β + ε, there are two types of varables explaatory varables X, X,, X k ad study varable y These varables ca be measured o a cotuous scale as

More information

7.0 Equality Contraints: Lagrange Multipliers

7.0 Equality Contraints: Lagrange Multipliers Systes Optzato 7.0 Equalty Cotrats: Lagrage Multplers Cosder the zato of a o-lear fucto subject to equalty costrats: g f() R ( ) 0 ( ) (7.) where the g ( ) are possbly also olear fuctos, ad < otherwse

More information

Chapter 5 Properties of a Random Sample

Chapter 5 Properties of a Random Sample Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample

More information

L5 Polynomial / Spline Curves

L5 Polynomial / Spline Curves L5 Polyomal / Sple Curves Cotets Coc sectos Polyomal Curves Hermte Curves Bezer Curves B-Sples No-Uform Ratoal B-Sples (NURBS) Mapulato ad Represetato of Curves Types of Curve Equatos Implct: Descrbe a

More information

Multiple Regression. More than 2 variables! Grade on Final. Multiple Regression 11/21/2012. Exam 2 Grades. Exam 2 Re-grades

Multiple Regression. More than 2 variables! Grade on Final. Multiple Regression 11/21/2012. Exam 2 Grades. Exam 2 Re-grades STAT 101 Dr. Kar Lock Morga 11/20/12 Exam 2 Grades Multple Regresso SECTIONS 9.2, 10.1, 10.2 Multple explaatory varables (10.1) Parttog varablty R 2, ANOVA (9.2) Codtos resdual plot (10.2) Trasformatos

More information

Algorithms Theory, Solution for Assignment 2

Algorithms Theory, Solution for Assignment 2 Juor-Prof. Dr. Robert Elsässer, Marco Muñz, Phllp Hedegger WS 2009/200 Algorthms Theory, Soluto for Assgmet 2 http://lak.formatk.u-freburg.de/lak_teachg/ws09_0/algo090.php Exercse 2. - Fast Fourer Trasform

More information

F. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties

F. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties 進佳數學團隊 Dr. Herbert Lam 林康榮博士 HKAL Pure Mathematcs F. Ieualtes. Basc propertes Theorem Let a, b, c be real umbers. () If a b ad b c, the a c. () If a b ad c 0, the ac bc, but f a b ad c 0, the ac bc. Theorem

More information

All-Pairs shortest paths via fast matrix multiplication

All-Pairs shortest paths via fast matrix multiplication All-Pars shortest paths va fast matrx multplato Ur Zw Tel Avv Uversty Summer Shool o Shortest Paths (PATH0) DIKU, Uversty of Copehage 1. Algebra matrx multplato a. Strasse s algorthm b. Retagular matrx

More information

1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers.

1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers. PROBLEMS A real umber s represeted appromately by 63, ad we are told that the relatve error s % What s? Note: There are two aswers Ht : Recall that % relatve error s What s the relatve error volved roudg

More information

( ) 2 2. Multi-Layer Refraction Problem Rafael Espericueta, Bakersfield College, November, 2006

( ) 2 2. Multi-Layer Refraction Problem Rafael Espericueta, Bakersfield College, November, 2006 Mult-Layer Refracto Problem Rafael Espercueta, Bakersfeld College, November, 006 Lght travels at dfferet speeds through dfferet meda, but refracts at layer boudares order to traverse the least-tme path.

More information

MEASURES OF DISPERSION

MEASURES OF DISPERSION MEASURES OF DISPERSION Measure of Cetral Tedecy: Measures of Cetral Tedecy ad Dsperso ) Mathematcal Average: a) Arthmetc mea (A.M.) b) Geometrc mea (G.M.) c) Harmoc mea (H.M.) ) Averages of Posto: a) Meda

More information

Log1 Contest Round 2 Theta Complex Numbers. 4 points each. 5 points each

Log1 Contest Round 2 Theta Complex Numbers. 4 points each. 5 points each 01 Log1 Cotest Roud Theta Complex Numbers 1 Wrte a b Wrte a b form: 1 5 form: 1 5 4 pots each Wrte a b form: 65 4 4 Evaluate: 65 5 Determe f the followg statemet s always, sometmes, or ever true (you may

More information

Tail Factor Convergence in Sherman s Inverse Power Curve Loss Development Factor Model

Tail Factor Convergence in Sherman s Inverse Power Curve Loss Development Factor Model Tal Fator Covergee Sherma s Iverse Power Curve Loss Developmet Fator Model Jo Evas ABSTRACT The fte produt of the age-to-age developmet fators Sherma s verse power urve model s prove to overge to a fte

More information

Ideal multigrades with trigonometric coefficients

Ideal multigrades with trigonometric coefficients Ideal multgrades wth trgoometrc coeffcets Zarathustra Brady December 13, 010 1 The problem A (, k) multgrade s defed as a par of dstct sets of tegers such that (a 1,..., a ; b 1,..., b ) a j = =1 for all

More information

On the Nonlinear Difference Equation

On the Nonlinear Difference Equation Joural of Appled Mathemats ad Phss 6 4-9 Pulshed Ole Jauar 6 SRes http://wwwsrporg/joural/jamp http://ddoorg/436/jamp644 O the Nolear Dfferee Equato Elmetwall M Elaas Adulmuhaem A El-Bat Departmet of Mathemats

More information

Mathematical Statistics

Mathematical Statistics Mathematal Statsts 2 1 Chapter II Probablty 21 Bas Coepts The dsple of statsts deals wth the olleto ad aalyss of data Whe measuremets are tae, eve seemgly uder the same odtos, the results usually vary

More information

Introduction to local (nonparametric) density estimation. methods

Introduction to local (nonparametric) density estimation. methods Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest

More information

MOLECULAR VIBRATIONS

MOLECULAR VIBRATIONS MOLECULAR VIBRATIONS Here we wsh to vestgate molecular vbratos ad draw a smlarty betwee the theory of molecular vbratos ad Hückel theory. 1. Smple Harmoc Oscllator Recall that the eergy of a oe-dmesoal

More information

Some Different Perspectives on Linear Least Squares

Some Different Perspectives on Linear Least Squares Soe Dfferet Perspectves o Lear Least Squares A stadard proble statstcs s to easure a respose or depedet varable, y, at fed values of oe or ore depedet varables. Soetes there ests a deterstc odel y f (,,

More information

ON THE LAWS OF LARGE NUMBERS FOR DEPENDENT RANDOM VARIABLES

ON THE LAWS OF LARGE NUMBERS FOR DEPENDENT RANDOM VARIABLES Joural of Sees Islam Republ of Ira 4(3): 7-75 (003) Uversty of Tehra ISSN 06-04 ON THE LAWS OF LARGE NUMBERS FOR DEPENDENT RANDOM VARIABLES HR Nl Sa * ad A Bozorga Departmet of Mathemats Brjad Uversty

More information

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture) CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.

More information

ρ < 1 be five real numbers. The

ρ < 1 be five real numbers. The Lecture o BST 63: Statstcal Theory I Ku Zhag, /0/006 Revew for the prevous lecture Deftos: covarace, correlato Examples: How to calculate covarace ad correlato Theorems: propertes of correlato ad covarace

More information

r 1,2 = a 1 (a 2 2 4a 2 a 0 )

r 1,2 = a 1 (a 2 2 4a 2 a 0 ) Fall emester- 6 Numeral Methods Mehaal Egeerg - ME Dr. aeed J. Almalow, smalow@taahu.edu.sa CHAPTER. Roots of Equatos, Lear ystems ad Algera ystems.. Roots of Polyomal The polyomal equato s: f( ) = a +

More information

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then Secto 5 Vectors of Radom Varables Whe workg wth several radom varables,,..., to arrage them vector form x, t s ofte coveet We ca the make use of matrx algebra to help us orgaze ad mapulate large umbers

More information

QR Factorization and Singular Value Decomposition COS 323

QR Factorization and Singular Value Decomposition COS 323 QR Factorzato ad Sgular Value Decomposto COS 33 Why Yet Aother Method? How do we solve least-squares wthout currg codto-squarg effect of ormal equatos (A T A A T b) whe A s sgular, fat, or otherwse poorly-specfed?

More information

KLT Tracker. Alignment. 1. Detect Harris corners in the first frame. 2. For each Harris corner compute motion between consecutive frames

KLT Tracker. Alignment. 1. Detect Harris corners in the first frame. 2. For each Harris corner compute motion between consecutive frames KLT Tracker Tracker. Detect Harrs corers the frst frame 2. For each Harrs corer compute moto betwee cosecutve frames (Algmet). 3. Lk moto vectors successve frames to get a track 4. Itroduce ew Harrs pots

More information

ECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity

ECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity ECONOMETRIC THEORY MODULE VIII Lecture - 6 Heteroskedastcty Dr. Shalabh Departmet of Mathematcs ad Statstcs Ida Isttute of Techology Kapur . Breusch Paga test Ths test ca be appled whe the replcated data

More information

MA/CSSE 473 Day 27. Dynamic programming

MA/CSSE 473 Day 27. Dynamic programming MA/CSSE 473 Day 7 Dyamc Programmg Bomal Coeffcets Warshall's algorthm (Optmal BSTs) Studet questos? Dyamc programmg Used for problems wth recursve solutos ad overlappg subproblems Typcally, we save (memoze)

More information

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen. .5 x 54.5 a. x 7. 786 7 b. The raked observatos are: 7.4, 7.5, 7.7, 7.8, 7.9, 8.0, 8.. Sce the sample sze 7 s odd, the meda s the (+)/ 4 th raked observato, or meda 7.8 c. The cosumer would more lkely

More information

Numerical Analysis Formulae Booklet

Numerical Analysis Formulae Booklet Numercal Aalyss Formulae Booklet. Iteratve Scemes for Systems of Lear Algebrac Equatos:.... Taylor Seres... 3. Fte Dfferece Approxmatos... 3 4. Egevalues ad Egevectors of Matrces.... 3 5. Vector ad Matrx

More information

THE COMPLETE ENUMERATION OF FINITE GROUPS OF THE FORM R 2 i ={R i R j ) k -i=i

THE COMPLETE ENUMERATION OF FINITE GROUPS OF THE FORM R 2 i ={R i R j ) k -i=i ENUMERATON OF FNTE GROUPS OF THE FORM R ( 2 = (RfR^'u =1. 21 THE COMPLETE ENUMERATON OF FNTE GROUPS OF THE FORM R 2 ={R R j ) k -= H. S. M. COXETER*. ths paper, we vestgate the abstract group defed by

More information

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution: Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed

More information

1 0, x? x x. 1 Root finding. 1.1 Introduction. Solve[x^2-1 0,x] {{x -1},{x 1}} Plot[x^2-1,{x,-2,2}] 3

1 0, x? x x. 1 Root finding. 1.1 Introduction. Solve[x^2-1 0,x] {{x -1},{x 1}} Plot[x^2-1,{x,-2,2}] 3 Adrew Powuk - http://www.powuk.com- Math 49 (Numercal Aalyss) Root fdg. Itroducto f ( ),?,? Solve[^-,] {{-},{}} Plot[^-,{,-,}] Cubc equato https://e.wkpeda.org/wk/cubc_fucto Quartc equato https://e.wkpeda.org/wk/quartc_fucto

More information

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations HP 30S Statstcs Averages ad Stadard Devatos Average ad Stadard Devato Practce Fdg Averages ad Stadard Devatos HP 30S Statstcs Averages ad Stadard Devatos Average ad stadard devato The HP 30S provdes several

More information

To use adaptive cluster sampling we must first make some definitions of the sampling universe:

To use adaptive cluster sampling we must first make some definitions of the sampling universe: 8.3 ADAPTIVE SAMPLING Most of the methods dscussed samplg theory are lmted to samplg desgs hch the selecto of the samples ca be doe before the survey, so that oe of the decsos about samplg deped ay ay

More information

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat

More information

Random Variables and Probability Distributions

Random Variables and Probability Distributions Radom Varables ad Probablty Dstrbutos * If X : S R s a dscrete radom varable wth rage {x, x, x 3,. } the r = P (X = xr ) = * Let X : S R be a dscrete radom varable wth rage {x, x, x 3,.}.If x r P(X = x

More information

18.413: Error Correcting Codes Lab March 2, Lecture 8

18.413: Error Correcting Codes Lab March 2, Lecture 8 18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse

More information

PPCP: The Proofs. 1 Notations and Assumptions. Maxim Likhachev Computer and Information Science University of Pennsylvania Philadelphia, PA 19104

PPCP: The Proofs. 1 Notations and Assumptions. Maxim Likhachev Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 PPCP: The Proofs Maxm Lkhachev Computer ad Iformato Scece Uversty of Pesylvaa Phladelpha, PA 19104 maxml@seas.upe.edu Athoy Stetz The Robotcs Isttute Carege Mello Uversty Pttsburgh, PA 15213 axs@rec.r.cmu.edu

More information

Generalized Linear Regression with Regularization

Generalized Linear Regression with Regularization Geeralze Lear Regresso wth Regularzato Zoya Bylsk March 3, 05 BASIC REGRESSION PROBLEM Note: I the followg otes I wll make explct what s a vector a what s a scalar usg vec t or otato, to avo cofuso betwee

More information

Algorithms Design & Analysis. Hash Tables

Algorithms Design & Analysis. Hash Tables Algorthms Desg & Aalyss Hash Tables Recap Lower boud Order statstcs 2 Today s topcs Drect-accessble table Hash tables Hash fuctos Uversal hashg Perfect Hashg Ope addressg 3 Symbol-table problem Symbol

More information

THE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE

THE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE THE ROYAL STATISTICAL SOCIETY 00 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutos to assst caddates preparg for the examatos future years ad for the

More information

Newton s Power Flow algorithm

Newton s Power Flow algorithm Power Egeerg - Egll Beedt Hresso ewto s Power Flow algorthm Power Egeerg - Egll Beedt Hresso The ewto s Method of Power Flow 2 Calculatos. For the referece bus #, we set : V = p.u. ad δ = 0 For all other

More information

AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET

AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET Abstract. The Permaet versus Determat problem s the followg: Gve a matrx X of determates over a feld of characterstc dfferet from

More information

Q-analogue of a Linear Transformation Preserving Log-concavity

Q-analogue of a Linear Transformation Preserving Log-concavity Iteratoal Joural of Algebra, Vol. 1, 2007, o. 2, 87-94 Q-aalogue of a Lear Trasformato Preservg Log-cocavty Daozhog Luo Departmet of Mathematcs, Huaqao Uversty Quazhou, Fua 362021, P. R. Cha ldzblue@163.com

More information

Section 2:00 ~ 2:50 pm Thursday in Maryland 202 Sep. 29, 2005

Section 2:00 ~ 2:50 pm Thursday in Maryland 202 Sep. 29, 2005 Seto 2:00 ~ 2:50 pm Thursday Marylad 202 Sep. 29, 2005. Homework assgmets set ad 2 revews: Set : P. A box otas 3 marbles, red, gree, ad blue. Cosder a expermet that ossts of takg marble from the box, the

More information

Simulation Output Analysis

Simulation Output Analysis Smulato Output Aalyss Summary Examples Parameter Estmato Sample Mea ad Varace Pot ad Iterval Estmato ermatg ad o-ermatg Smulato Mea Square Errors Example: Sgle Server Queueg System x(t) S 4 S 4 S 3 S 5

More information

CHAPTER 4 RADICAL EXPRESSIONS

CHAPTER 4 RADICAL EXPRESSIONS 6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube

More information

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights CIS 800/002 The Algorthmc Foudatos of Data Prvacy October 13, 2011 Lecturer: Aaro Roth Lecture 9 Scrbe: Aaro Roth Database Update Algorthms: Multplcatve Weghts We ll recall aga) some deftos from last tme:

More information

Supervised learning: Linear regression Logistic regression

Supervised learning: Linear regression Logistic regression CS 57 Itroducto to AI Lecture 4 Supervsed learg: Lear regresso Logstc regresso Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 57 Itro to AI Data: D { D D.. D D Supervsed learg d a set of eamples s

More information

1 Onto functions and bijections Applications to Counting

1 Onto functions and bijections Applications to Counting 1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of

More information

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines It J Cotemp Math Sceces, Vol 5, 2010, o 19, 921-929 Solvg Costraed Flow-Shop Schedulg Problems wth Three Maches P Pada ad P Rajedra Departmet of Mathematcs, School of Advaced Sceces, VIT Uversty, Vellore-632

More information

Logistic regression (continued)

Logistic regression (continued) STAT562 page 138 Logstc regresso (cotued) Suppose we ow cosder more complex models to descrbe the relatoshp betwee a categorcal respose varable (Y) that takes o two (2) possble outcomes ad a set of p explaatory

More information

Algorithms. Elementary Sorting. Dong Kyue Kim Hanyang University

Algorithms. Elementary Sorting. Dong Kyue Kim Hanyang University Algorithms Elemetary Sortig Dog Kyue Kim Hayag Uiversity dqkim@hayag.a.kr Cotets Sortig problem Elemetary sortig algorithms Isertio sort Merge sort Seletio sort Bubble sort Sortig problem Iput A sequee

More information

Lecture Notes 2. The ability to manipulate matrices is critical in economics.

Lecture Notes 2. The ability to manipulate matrices is critical in economics. Lecture Notes. Revew of Matrces he ablt to mapulate matrces s crtcal ecoomcs.. Matr a rectagular arra of umbers, parameters, or varables placed rows ad colums. Matrces are assocated wth lear equatos. lemets

More information

CHAPTER VI Statistical Analysis of Experimental Data

CHAPTER VI Statistical Analysis of Experimental Data Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca

More information

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions.

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions. Ordary Least Squares egresso. Smple egresso. Algebra ad Assumptos. I ths part of the course we are gog to study a techque for aalysg the lear relatoshp betwee two varables Y ad X. We have pars of observatos

More information

ESS Line Fitting

ESS Line Fitting ESS 5 014 17. Le Fttg A very commo problem data aalyss s lookg for relatoshpetwee dfferet parameters ad fttg les or surfaces to data. The smplest example s fttg a straght le ad we wll dscuss that here

More information

Analysis of Variance with Weibull Data

Analysis of Variance with Weibull Data Aalyss of Varace wth Webull Data Lahaa Watthaacheewaul Abstract I statstcal data aalyss by aalyss of varace, the usual basc assumptos are that the model s addtve ad the errors are radomly, depedetly, ad

More information

2. Higher Order Consensus

2. Higher Order Consensus Prepared by F.L. Lews Updated: Wedesday, February 3, 0. Hgher Order Cosesus I Seto we dsussed ooperatve otrol o graphs for dyamal systems that have frstorder dyams, that s, a sgle tegrator or shft regster

More information