EFFICIENT CONSTANT K-DOMINATING SET APPROXIMATION
|
|
- Charles Jackson
- 6 years ago
- Views:
Transcription
1 EFFICIENT CONSTANT K-DOMINATING SET APPROXIMATION SEMESTER THESIS Jauary 7, 005 Author Patrce Müller Supervsor Thomas Moscbroda Professor Roger Wattehofer Abstract Calculatg a mmal domatg set s kow to be NP-complete It would be ce to have a approxmato whch s ot much bgger but could be calculated much faster I ths paper a algorthm s proposed whch costructs a k-domatg set It s mathematcally proved that the algorthm produces a costat approxmato to the MDS ad termates very quckly INTRODUCTION - - ALGORITHM - - DOMINATING SET - - K-DOMINATING SET RELATED WORK EXPECTATION HIGH PROBABILITY HIERARCHICAL ANALYSIS K-DOMINATING SET EXPECTATION HIGH PROBABILITY HIERARCHICAL ANALYSIS PHASE I ( ) 43 PHASE II ( ) OVERALL BOUND CONCLUSION FUTURE WORK ACKNOWLEDGMENTS REFERENCES Itroducto I wreless ad-hoc etworks collaborato amog odes s a extremely mportat task I small workg evromets wth oly a few odes the same trasmsso rage very smple ad prmtve algorthms lke floodg ca be used As the etworks get bgger ad more complex these basc approaches to solvg problems caot be used aymore There eeds to be establshed a overlay etwork layer o top of TCP/IP Wthout t scalablty ad relablty caot be guarateed Ths paper s focusg o domatg sets ut dsk graphs There s already a lot of work avalable dealg wth domatg set problems However a relable etwork mght eed to have more tha just oe domator per ode I ths paper t s show how a k-domatg set wth a costat approxmato ca be costructed usg oly local formato Algorthm The frst algorthm preseted below about costructg a domatg set s take from [] To exted the acheved result from domatg set to k-domatg set the algorthm was slghtly modfed Domatg Set At the start-up of a ode t eeds to assg tself a radom umber whch wll be ts uque detfer UID practce f the radomzato s usg a large eough rage of umbers Startg wth a small trasmsso rage ad the state of a domatg set every ode queres all odes rage about ther UID ad selects the ode wth the hghest UID as ts domator Selectg here meas that the ode forms the selected ode about ts selecto The ode recevg ths formato must accept to become a domatg ode f t s ot already the domatg set After such a domator beg foud ad formed the selectg ode ca remove ts domatg state I the specal case where the selectg ode s also the ode wth the hghest UID the t wll just rema the domatg state For establshg a smaller domatg set the above descrbed selecto process s appled recursvely to all odes stll the domatg state The trasmsso rage s doubled after every roud ad s of the form δ = log, for > 0 Itally every ode s the domatg set ad may fall out of t at ay roud Thereafter the algorthm stops o that ode Obvously certa odes ever drop out of the domatg set or there would be o domatg set at all After loglog rouds the algorthm must stop ad Wth costat approxmato a approxmato to the mmal domatg set s meat Ths approxmato s worse oly by a costat factor to the MDS s the total umber of odes the maxmum trasmsso rage of the ode executg the algorthm - -
2 the ode wll rema the domatg set f o ode wth th hgher UID was foud At the loglog roud the trasmsso rage s set to δ = After ths roud o other ode ca cover all the odes the processg ode was resposble for Eve the full trasmsso rage caot be eough aymore to cover all o-domatg odes K-Domatg Set The same dea as above for buldg up a domatg set s used to costruct a k-domatg set Every ode chooses a radom umber as ts UID ad starts wth a small trasmsso rage to fd the k hghest odes Those k odes are selected ad must become domators after gettg otfed If the ode executg the algorthm tself s amog the k hghest odes the t wll rema the domatg set Otherwse t ca remove ts domatg state If less tha k odes are avalable the curret trasmsso rage the all avalable odes wll be otfed to become a domator as ths wll be the best possble approxmato to a k- domatg set The same herarchcal techque as above for the domatg set algorthm s the appled o the remag domators The trasmsso rage wll be doubled every roud utl the ode s o loger a domator or reachg δ = as half of the maxmum trasmsso rage ad the the algorthm stops At each step the k hghest odes wll be forced to the domatg set ad the executg ode wll become a o-domatg ode f t s ot amog the k hghest odes 3 Related Work May deas for ths paper s work come from [] The followg three subcategores were aalyzed very carefully ad the modfed ad exteded to proof the requested propertes for the k-domatg case I all the aalyss squares are supposed to be the vsble rage of the wreless devces Ths s a method for smplfyg the aalyss It does ot exactly match the actual trasmsso rage whch would rather be a rregular crcle depedg o the earby evromet The squares could as well be replaced by crcles ad the outcome of all the results would ot be affected up to a costat factor 3 Expectato To get the expected umber of domators after oe step of the domatg set algorthm the close proxmty of oe vsble rage s aalyzed I Fgure 4 the model for the vsble rage two dmesos s show It s assumed that there are o more tha m odes the vsble rage L of S ad that the sde legth of S s oe half of the trasmsso rage Havg ths setup t was show [] that the expected umber of domators sde S s boud by O ( m) Ths s a very mportat property as t shows a drastc reducto domators by executg the domatg set algorthm to all the odes L 3 Hgh probablty It was also show that the reducto of odes sde S holds wth hgh probablty To be more precse the probablty that S cotas more tha m l m + domators s l m bouded by O( m ) ( m m) Ths meas that there are more tha O l domators S wth a very small probablty that goes towards zero quckly By kowg ths the proposed algorthm guaratees a reducto the umber of domators Furthermore the calculated expectato s more trustful by kowg the result wth hgh probablty 33 Herarchcal aalyss I the paper [] t s sad that the recursve algorthm wll evetually produce a costat approxmato O( d ) to the mmal domatg set wth d domators by usg at most steps To show ths property the expectato of ( m) O for oe step was terated o tself Ths calculato caot be regarded as correct as the expected reducto of the remag domators may chage after oe roud of executo The frst roud s ot ad caot be cosdered to be depedet from the followg rouds For aalyzg the herarchcal algorthm ad showg a costat approxmato of the mmal domatg set a dfferet approach eeds to be used 4 K-domatg set Costructg a domatg set ca be a very mportat task wreless ad-hoc etworks Geerally there s o structure amog wreless devces as they ca be located aywhere I certa areas the desty may be very hgh ad other parts t may be very sparse Buldg up a domatg set ca help to solve problems lke routg The stadard domatg set has the property that every ode has at least oe ode ts rage as ts domator If we cosder usg such a domatg set for stace for solvg a routg problem t s easy to see that the whole system s ot very fault tolerat If the domatg set problem ca be exteded to be more relable eve f odes are ustable the problems may be solved o top of ths k-domatg evromet by esurg a hgher relablty The algorthm for costructg such a k-domatg set s already gve above I ths secto t s to prove ts propertes The frst step s to show that the algorthm reduces the amout of domators Ths s doe by aalyzg the expected umber of domators after the executo of oe step of the algorthm I a secod aalyss t s show that ot oly the expectato holds but that a slghtly hgher result holds wth hgh probablty Ths proof s essetal to be covced that the algorthm almost caot be ufavorable I a thrd subchapter the whole algorthm usg ts herarchcal structure s aalyzed Ths leads to the fal result ad does show that the proposed algorthm fulflls the wated requremets 4 Expectato At a frst step to aalyze the algorthm for k-domatg sets the reducto domators s calculated To do ths oe roud of the algorthm s take a close look at I Fgure 4 the model used ca be see The expectato for the umber of domators sde S after oe roud s calculated All the areas are squares to smplfy the setup The sde legths are equal to / There s a cetral area S ad a eghborg area S' I total there are eght equal eghbor- - -
3 g areas to S Therefore oly oe eghborg area eeds to be aalyzed relato to the cetral area The other seve eghborg areas do have the exact same propertes L S' S 3 Fgure 4: Vsble rage L of S Frst the umber of odes omated from sde S must be examed The sde legth of S s assumed to be half the trasmsso rage of the odes executg the algorthm Due to ths fact all the odes resdg sde S are mutually vsble Every ode kows about all the other odes presece ad also kows all ther UIDs The algorthm omates from every ode k odes to become ther domators As a result of the mutual vsblty o more tha k odes sde S ca become domators from odes wth S (4) E k Secod the umber of odes omated from outsde S must be examed Let x be the umber of odes S ad y sde S' x = S, y = S' Ay ode p S ca be omated by a q S' oly f p has ts UID wth the k-largest of q's vsblty The radom selecto of UIDs at the begg of the algorthm gves a uformly dstrbuto of UIDs o S ad S' Therefore the probablty for ode p beg wth the k-hghest odes of q's vsblty s k (4) P + y Havg x odes S the expected umber of odes omated S from S' s xk (43) E + y Those pots are omated to be domators from pots S' As there are y pots S' there s a absolute maxmum of omated pots sde S from pots q S' of (44) E yk Wth the two expectatos E ad E the overall expectato for omated pots from S' ca be calculated The varable m s the total umber of odes L before the algorthm starts (45) E xk = m, yk + y x = km, y as xy, 0 + y k x+ y+ ( ) < k m To get the total expectato the odes omated from sde ad those omated from outsde of S must be added There are equal squares aroud S A ew costat c s used to smplfy the equato (46) E = E+ E < k+ k m < c m From ths result the upper boud of expected domators after oe roud ca be see easly It s (47) E O( m) 4 Hgh probablty I ths subchapter a stroger boud tha the expectato s show By kowg oly the expectato the dstrbuto of all the possble cases remas ukow It would be ce f almost all the possbltes were close to the expectato I ths case the expectato seems to be a very reasoable boud But what f the dstrbuto s ot so favorable? There mght be a very hgh probablty for almost o reducto domators ad a hgh probablty of a very good reducto If the algorthm happes to produce the ufavorable reducto t does t help much to kow about the expectato sce a good reducto s amed at Showg a good reducto wth hgh probablty s much more covcg that the proposed algorthm works wth all crcumstaces ad at all tmes As a frst step to get a hgh probablty boud the probablty that the umber of odes omated S from S' ca reach a certa bechmark s s calculated Oce ths fucto s evaluated a bechmark ca be searched Ths bechmark wll be somewhere above the umber expectato ad must lead to a very low probablty The probablty that s (or more) pots S ca be omated from S' s eeded To get ths probablty the two areas S ad S' are aalyzed detal Lemma 4: Out of the s+k- hghest odes S S' at least s must be S for S' beg able to omate s or more domators S Proof: If there are less tha s of the s+k- hghest odes S tha the odes S' have o possblty to omate s domators S They are forced to select more odes S' as ther domators If the s odes S are chose from a smaller group tha the s+k- hghest odes ot all the possbltes for havg selected s domators S are covered Ths comes from the fact that each ode S' chooses the k hghest odes as domators Therefore t s possble that a ode chooses the frst k- domators S' ad the k th domator S For ths reaso the s+k- hghest group must be cosdered - 3 -
4 Fgure 4: Dstrbutg the s+k- hghest odes Kowg Lemma 4 the probablty ca be calculated by aalyzg the combatos The umber of possbltes for choosg the s pots S s x (4) s The umber of possbltes for choosg the k- pots S' s y (49) k The umber of possbltes for choosg the s+k- hghest pots amog the odes S S' (cotag x,y odes respectvely) s x + y (40) s+ k At ths pot the probablty ca be wrtte by usg #umber of 'good' cases #umber of total cases whch leads to the equato s+ k x y ( )( s+ k) = s (4) p = x+ y ( s+ k) I the above equato the top part adds up all the possbltes for havg more tha s odes S out of the s+k- hghest odes The lower part couts all the possbltes for placg the s+k- hghest odes amog the x+y odes of S S' By testg the probablty of equato (4) a fast degradato ca be observed Usg the same asymptotcal boud as [] for the proof wth hgh probablty the also the same low probablty s foud It was proofed by Thomas Moscbroda that wth a expoetally small probablty (4) k- s S S p m log m a maxmal boud of O max mlog m, k ( ) (43) ( ) exsts as m gets large By kowg ths result the proposed algorthm for the k-domatg set seems to be very assurg to decrease the umber of domators sde S sgfcatly wth oe step Whe the umber of odes s hgh the resultg umber of domators wll be < mlog m wth very hgh probablty The umber of domators ca always reach k whch s just a costat umber ad ca be assumed to be small Now a upper boud wth hgh probablty was show Ths boud s just a lttle hgher tha the value expectato Due to ths fact the algorthm performs well all practcal cases 43 Herarchcal Aalyss I ths secto the whole k-domatg set algorthm s aalyzed I the prevous sectos oly oe step of the algorthm was executed The whole process cotues though by doublg the trasmsso rage after each roud ad proceedg wth the remag domators I [] oly the expectato of domators was recursvely calculated to show a costat approxmato at the ed Ths calculato s msleadg as cosecutve rouds are ot fully depedet For the mathematcal aalyss ths secto the hgh probablty result s used All the possbltes combed wth ther umber of remag domators are added up Ths wll gve the fal expectato of domators uder a hgh probablty codto after the algorthm termates The reducto domators from dow to a costat approxmato s dvded to phases I Fgure 43 t ca be see that the frst phase reduces the domators to a loglog approxmato ad the secod phase brgs the algorthm to ts stop at a costat approxmato Fgure 43 Herarchcal algorthm dvded to phases for mathematcal aalyss 43 Phase I ( ) Startg from a total umber of domators the whole evromet the umber gets reduced at each step wth a hgh probablty Stll there remas a slght possblty that the umber does t get reduced very much At the begg there are 0 = domators ad after the th roud there rema domators For roud + oly the 'good' ( + ) cases up to roud are of terest As soo as a 'bad' ( ) case happes the executo stops for the aalyss ad couts the umber of domators before the 'bad' case Followg the frst 3 rouds are lsted Roud ( ) p = log o 0 o phase I phase II Remember that at the begg of the k-domatg set algorthm all odes are marked to be the domatg set ad rema domators utl they are ot omated aymore at some roud At ths stage the terest of the aalyss s o all odes a square wth a sde legth of half the maxmal trasmsso rage ad ot oly o same specfc area S aymore Oly ths aalyss wll lead to the desred costat overall approxmato - 4 -
5 ( + ) p = log o 0 o log o Roud ( ) see Roud ( + ) p = log o log 0 o log o ( ++ ) p = log o log 0 log Roud 3 ( ) see Roud ( + ) see Roud ( ++ ) p = log o log log 0 3 ( +++ ) p = log o log log 0 3 log From the above frst 3 rouds t s ow easy to deduce the expected umber of domators for the 'bad' cases the frst phase To do ths the sum of the probabltes multpled wth the umber of domators of all the cases wth a 'bad' fshg roud must be calculated To smplfy the calculato the probabltes are augmeted a lttle bt Istead of usg the true ad hgh probabltes of havg the 'good' cases before the abortg 'bad' case, those probabltes are set to Usg ths smplfcato the expected umber of domators from the frst phase ca be calculated by > loglog > loglog (44) E[ Phase] = = log log = 0 = 0 Now two propertes must be show for the fucto (44) to receve a costat expectato Frst t must be show that the term S s suffcetly small ad secod t must be show that there are ot too may addtos Lemma 4: > S < Proof: For a that s large eough t s true that log > As s ot a costat > ca be assumed to meet the prevous requremet Out of ths follows mmedately that S = log < < O steps applyg Lemma 43: There are oly ( ) log recursvely to tself utl the result s smaller or equal to Proof: Usg Maple t was show that the umber of recursos s growg proportoally slower tha for S = 0,0,0 The umber of recursos wth 000 odes s ad log log(000) 93 Ths meas there are about 6 tmes more recursos as wth Due to the structure of the fuctos aalyzed they have o dscotutes ad wll ot chage ther behavor the large Therefore the umber of recursos s boud as Lemma 43 says Now the expectato for the frst phase ca be calculated usg fucto (44) leadg to the fal expectato of the frst phase c c (45) E[ Phase] S < O() = 0 As show for Lemma 43 3 c 6 s true f 0 Therefore the above result proofs that the umber of domators from phase s boud by O () 43 Phase II ( ) For the secod phase as see Fgure 43 the umber of domators must be reduced from to As the aalyss here s cotued from the prevous result the umber of domators s At ths stage whe the umber of domators s gettg fewer the the probablty for 'bad' cases s gettg bgger It s ot possble just to sum up all the cases as the frst phase or the expected umber of domators from the secod phase wll be too hgh To proceed the secod phase s dvded to X rouds As t would be ce to have the algorthm acheve the costat approxmato wth rouds the maxmum umber of rouds s set to (46) X Each roud ow has a falure rate of (47) log m, 3 m m = m [ ] = < ( m ) P falure + Out of ths equato follows mmedately the success rate at each roud whch s equals to Psuccess, m 3 (4) [ ] ( ) m = m log m + From here o the secod phase s dvded to cases The frst oe s that there are X 4 successful rouds o the total of X rouds The secod case s the oe wth > X 4 successful rouds For solvg the frst case the Cheroff boud s very helpful Cheroff boud: (49) P E ( δ ) µ e δ µ Applyg the Cheroff boud to the frst case the probablty for havg X 4 successful rouds ca be calculated wth For the umercal aalyss the logarthm to the base 0 was used The falure rate s equal to the probablty of havg a 'bad' case that partcular roud - 5 -
6 X X (40) X X 4 P E P E e e 4 = = Usg the above probablty the expected umber of domators from the frst case ca be calculated To smplfy the calculato the worst case s take where o reducto has take place sce reachg domators Therefore the expectato s X E case e loglog (4) [ ] As X was boud by the assumpto (46) the above equato ca by smplfed as follows (4) [ ] loglog Ecase e loglog ( log ) () = = log O Now t s also show that the frst case of the secod phase bouds the umber of domators by O () It remas to show that the secod case does t leave too may domators ether Cotug wth the domators reduced to the algorthm executes ad due to the precodto there are more tha X 4 rouds These 'good' rouds all lower the umber of domators to m = + m log m It was show that the recursve applcato of the above mplct reducto fucto ca be boud wth a expoetally decreasg explct fucto 34 (43) mlog m m, m 5504 Ths makes t possble to use the explct fucto for estmatg the upper boud of expected remag domators for the secod case The probablty s just set to as ths wll lead to a suffcetly small boud X 4 34 Ecase loglog (44) [ ] ( ) ( )( ) = ( ) ( 34 ) ( ) ( log ) ( ) ( log ) () 4 log log log (I) = log log, k log (II) O (III) I the above calculato for the secod case several propertes were used These propertes are lsted here (I) X 4loglog (II) 4 log (III) X X O() Wth (44) t s show that the secod case of phase reduces the umber of remag domators below the boud of O () k 433 Overall boud Due to the splt up of ths herarchcal aalyss the dvdual parts eed to be combed to get the overall boud for the whole algorthm The total process was dvded to 3 dfferet parts I the frst phase the possble domators due to falures were estmated I the secod phase two cases had to be cosdered The frst case s ufavorable as t has few successful rouds The umber of possble domators stll stays small as the possblty for ths ufavorable case s relatvely small The last case s the 'good' case whe there are may favorable rouds I ths case t s almost obvous that the umber of domators gets reduced as desred Summg up all the expectatos the overall boud s foud by (45) E O() + O + O = O () () () Cocluso I ths paper t s show how a k-domatg set ca be costructed usg oly local formato The proposed herarchcal algorthm performs ths task ad t could be show that t acheves a overall boud of O () domators each ut dsk square of sde legth / Suppose a mmal domatg set cotas d domators the whole evromet The proposed herarchcal algorthm ca cover the whole evromet wth 4d ut squares of sde legth / ad all of them havg O () domators It follows mmedately that ths paper's algorthm costructs a k- domatg set usg oly local formato wth a O( d ) approxmato to the optmal domatg The tme requre for executo of the algorthm ca also be boud asymptotcally Both phases of the herarchcal aalyss termate O( ) Therefore the total algorthm also termates O( ) 6 Future work The mathematcal aalyss of ths paper focuses maly o the asymptotcal boud Certa fuctoal trasformatos ca oly be realzed whe the umber of odes s very bg It may be ecessary for future work to aalyze the algorthm detal o a 'reasoable' umber of odes depedg o the requred applcato Ackowledgmets For the supportve ad dspesable suggestos I would lke to thak my supervsor Thomas Moscbroda May crucal steps the mathematcal aalyss would ot have bee possble wthout hs help A very grateful thak you also goes to Faba Kuh who helped to fd the rght track several dscussos Refereces [] Je Gao, Leodas J Gubas, Joh Hershberger, L Zhag, A Zhu Dscrete Moble Ceters, pages -, 003 [] Fe Da, Je Wu A Exteded Localzed Algorthm for Coected Domatg Set Formato Ad Hoc Wreless Networks, pages -4,
Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions
Iteratoal Joural of Computatoal Egeerg Research Vol, 0 Issue, Estmato of Stress- Stregth Relablty model usg fte mxture of expoetal dstrbutos K.Sadhya, T.S.Umamaheswar Departmet of Mathematcs, Lal Bhadur
More informationFunctions of Random Variables
Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,
More informationLecture 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 informationHomework 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 informationDiscrete 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 informationChapter 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 informationCHAPTER 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 informationChapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements
Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall
More informationEconometric 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 informationCS286.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 information5 Short Proofs of Simplified Stirling s Approximation
5 Short Proofs of Smplfed Strlg s Approxmato Ofr Gorodetsky, drtymaths.wordpress.com Jue, 20 0 Itroducto Strlg s approxmato s the followg (somewhat surprsg) approxmato of the factoral,, usg elemetary fuctos:
More informationFor 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 informationLecture 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 informationIntroduction 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 informationPTAS 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 informationThe 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 informationCHAPTER 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 informationLecture 02: Bounding tail distributions of a random variable
CSCI-B609: A Theorst s Toolkt, Fall 206 Aug 25 Lecture 02: Boudg tal dstrbutos of a radom varable Lecturer: Yua Zhou Scrbe: Yua Xe & Yua Zhou Let us cosder the ubased co flps aga. I.e. let the outcome
More informationbest 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 informationA tighter lower bound on the circuit size of the hardest Boolean functions
Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the
More informationLecture 2 - What are component and system reliability and how it can be improved?
Lecture 2 - What are compoet ad system relablty ad how t ca be mproved? Relablty s a measure of the qualty of the product over the log ru. The cocept of relablty s a exteded tme perod over whch the expected
More informationLecture 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{ }{ ( )} (, ) = ( ) ( ) ( ) 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 information8.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(b) By independence, the probability that the string 1011 is received correctly is
Soluto to Problem 1.31. (a) Let A be the evet that a 0 s trasmtted. Usg the total probablty theorem, the desred probablty s P(A)(1 ɛ ( 0)+ 1 P(A) ) (1 ɛ 1)=p(1 ɛ 0)+(1 p)(1 ɛ 1). (b) By depedece, the probablty
More informationLaboratory I.10 It All Adds Up
Laboratory I. It All Adds Up Goals The studet wll work wth Rema sums ad evaluate them usg Derve. The studet wll see applcatos of tegrals as accumulatos of chages. The studet wll revew curve fttg sklls.
More informationMultiple 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 informationChapter 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 informationUNIVERSITY 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 informationSolving 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 informationBlock-Based Compact Thermal Modeling of Semiconductor Integrated Circuits
Block-Based Compact hermal Modelg of Semcoductor Itegrated Crcuts Master s hess Defese Caddate: Jg Ba Commttee Members: Dr. Mg-Cheg Cheg Dr. Daqg Hou Dr. Robert Schllg July 27, 2009 Outle Itroducto Backgroud
More informationClass 13,14 June 17, 19, 2015
Class 3,4 Jue 7, 9, 05 Pla for Class3,4:. Samplg dstrbuto of sample mea. The Cetral Lmt Theorem (CLT). Cofdece terval for ukow mea.. Samplg Dstrbuto for Sample mea. Methods used are based o CLT ( Cetral
More informationPart 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))
art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the
More informationOutline. Point Pattern Analysis Part I. Revisit IRP/CSR
Pot Patter Aalyss Part I Outle Revst IRP/CSR, frst- ad secod order effects What s pot patter aalyss (PPA)? Desty-based pot patter measures Dstace-based pot patter measures Revst IRP/CSR Equal probablty:
More informationSummary of the lecture in Biostatistics
Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the
More informationUNIT 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 informationUNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS
UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Exam: ECON430 Statstcs Date of exam: Frday, December 8, 07 Grades are gve: Jauary 4, 08 Tme for exam: 0900 am 00 oo The problem set covers 5 pages Resources allowed:
More informationBeam Warming Second-Order Upwind Method
Beam Warmg Secod-Order Upwd Method Petr Valeta Jauary 6, 015 Ths documet s a part of the assessmet work for the subject 1DRP Dfferetal Equatos o Computer lectured o FNSPE CTU Prague. Abstract Ths documet
More informationThe Mathematical Appendix
The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.
More informationSTATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1
STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Recall Assumpto E(Y x) η 0 + η x (lear codtoal mea fucto) Data (x, y ), (x 2, y 2 ),, (x, y ) Least squares estmator ˆ E (Y x) ˆ " 0 + ˆ " x, where ˆ
More informationAlgorithms 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 informationDimensionality Reduction and Learning
CMSC 35900 (Sprg 009) Large Scale Learg Lecture: 3 Dmesoalty Reducto ad Learg Istructors: Sham Kakade ad Greg Shakharovch L Supervsed Methods ad Dmesoalty Reducto The theme of these two lectures s that
More informationDerivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations
Dervato of -Pot Block Method Formula for Solvg Frst Order Stff Ordary Dfferetal Equatos Kharul Hamd Kharul Auar, Kharl Iskadar Othma, Zara Bb Ibrahm Abstract Dervato of pot block method formula wth costat
More informationInvestigating Cellular Automata
Researcher: Taylor Dupuy Advsor: Aaro Wootto Semester: Fall 4 Ivestgatg Cellular Automata A Overvew of Cellular Automata: Cellular Automata are smple computer programs that geerate rows of black ad whte
More informationSimulation 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 informationBounds 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 informationLecture 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 informationhp 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 informationAnalysis 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 informationEvaluating Polynomials
Uverst of Nebraska - Lcol DgtalCommos@Uverst of Nebraska - Lcol MAT Exam Expostor Papers Math the Mddle Isttute Partershp 7-7 Evaluatg Polomals Thomas J. Harrgto Uverst of Nebraska-Lcol Follow ths ad addtoal
More informationA Combination of Adaptive and Line Intercept Sampling Applicable in Agricultural and Environmental Studies
ISSN 1684-8403 Joural of Statstcs Volume 15, 008, pp. 44-53 Abstract A Combato of Adaptve ad Le Itercept Samplg Applcable Agrcultural ad Evrometal Studes Azmer Kha 1 A adaptve procedure s descrbed for
More informationDependence In Network Reliability
Depedece I Network Relablty Nozer D. Sgpurwalla George Washgto Uversty Washgto, DC, U.S.A. ozer@reasearch.crc.gwu.edu Abstract It s farly easy to calculate the relablty of a etwork wth depedet odes va
More informationChapter 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 informationA New Family of Transformations for Lifetime Data
Proceedgs of the World Cogress o Egeerg 4 Vol I, WCE 4, July - 4, 4, Lodo, U.K. A New Famly of Trasformatos for Lfetme Data Lakhaa Watthaacheewakul Abstract A famly of trasformatos s the oe of several
More informationarxiv:math/ v1 [math.gm] 8 Dec 2005
arxv:math/05272v [math.gm] 8 Dec 2005 A GENERALIZATION OF AN INEQUALITY FROM IMO 2005 NIKOLAI NIKOLOV The preset paper was spred by the thrd problem from the IMO 2005. A specal award was gve to Yure Boreko
More informationSimple 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 informationLecture 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 information1 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 informationAnalysis of System Performance IN2072 Chapter 5 Analysis of Non Markov Systems
Char for Network Archtectures ad Servces Prof. Carle Departmet of Computer Scece U Müche Aalyss of System Performace IN2072 Chapter 5 Aalyss of No Markov Systems Dr. Alexader Kle Prof. Dr.-Ig. Georg Carle
More information9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d
9 U-STATISTICS Suppose,,..., are P P..d. wth CDF F. Our goal s to estmate the expectato t (P)=Eh(,,..., m ). Note that ths expectato requres more tha oe cotrast to E, E, or Eh( ). Oe example s E or P((,
More information1 Lyapunov Stability Theory
Lyapuov Stablty heory I ths secto we cosder proofs of stablty of equlbra of autoomous systems. hs s stadard theory for olear systems, ad oe of the most mportat tools the aalyss of olear systems. It may
More informationChapter 3 Sampling For Proportions and Percentages
Chapter 3 Samplg For Proportos ad Percetages I may stuatos, the characterstc uder study o whch the observatos are collected are qualtatve ature For example, the resposes of customers may marketg surveys
More informationf f... f 1 n n (ii) Median : It is the value of the middle-most observation(s).
CHAPTER STATISTICS Pots to Remember :. Facts or fgures, collected wth a defte pupose, are called Data.. Statstcs s the area of study dealg wth the collecto, presetato, aalyss ad terpretato of data.. The
More informationSection l h l Stem=Tens. 8l Leaf=Ones. 8h l 03. 9h 58
Secto.. 6l 34 6h 667899 7l 44 7h Stem=Tes 8l 344 Leaf=Oes 8h 5557899 9l 3 9h 58 Ths dsplay brgs out the gap the data: There are o scores the hgh 7's. 6. a. beams cylders 9 5 8 88533 6 6 98877643 7 488
More informationThis 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 informationThe 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 informationSpecial Instructions / Useful Data
JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth
More informationTESTS BASED ON MAXIMUM LIKELIHOOD
ESE 5 Toy E. Smth. The Basc Example. TESTS BASED ON MAXIMUM LIKELIHOOD To llustrate the propertes of maxmum lkelhood estmates ad tests, we cosder the smplest possble case of estmatg the mea of the ormal
More informationRuntime analysis RLS on OneMax. Heuristic Optimization
Lecture 6 Rutme aalyss RLS o OeMax trals of {,, },, l ( + ɛ) l ( ɛ)( ) l Algorthm Egeerg Group Hasso Platter Isttute, Uversty of Potsdam 9 May T, We wat to rgorously uderstad ths behavor 9 May / Rutme
More informationChapter 8: Statistical Analysis of Simulated Data
Marquette Uversty MSCS600 Chapter 8: Statstcal Aalyss of Smulated Data Dael B. Rowe, Ph.D. Departmet of Mathematcs, Statstcs, ad Computer Scece Copyrght 08 by Marquette Uversty MSCS600 Ageda 8. The Sample
More informationAssignment 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å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018
Chrs Pech Fal Practce CS09 Dec 5, 08 Practce Fal Examato Solutos. Aswer: 4/5 8/7. There are multle ways to obta ths aswer; here are two: The frst commo method s to sum over all ossbltes for the rak of
More informationA Markov Chain Competition Model
Academc Forum 3 5-6 A Marov Cha Competto Model Mchael Lloyd, Ph.D. Mathematcs ad Computer Scece Abstract A brth ad death cha for two or more speces s examed aalytcally ad umercally. Descrpto of the Model
More informationENGI 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 informationStatistics: Unlocking the Power of Data Lock 5
STAT 0 Dr. Kar Lock Morga Exam 2 Grades: I- Class Multple Regresso SECTIONS 9.2, 0., 0.2 Multple explaatory varables (0.) Parttog varablty R 2, ANOVA (9.2) Codtos resdual plot (0.2) Exam 2 Re- grades Re-
More informationChapter 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 information18.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 informationMean is only appropriate for interval or ratio scales, not ordinal or nominal.
Mea Same as ordary average Sum all the data values ad dvde by the sample sze. x = ( x + x +... + x Usg summato otato, we wrte ths as x = x = x = = ) x Mea s oly approprate for terval or rato scales, ot
More informationX ε ) = 0, or equivalently, lim
Revew for the prevous lecture Cocepts: order statstcs Theorems: Dstrbutos of order statstcs Examples: How to get the dstrbuto of order statstcs Chapter 5 Propertes of a Radom Sample Secto 55 Covergece
More informationLECTURE - 4 SIMPLE RANDOM SAMPLING DR. SHALABH DEPARTMENT OF MATHEMATICS AND STATISTICS INDIAN INSTITUTE OF TECHNOLOGY KANPUR
amplg Theory MODULE II LECTURE - 4 IMPLE RADOM AMPLIG DR. HALABH DEPARTMET OF MATHEMATIC AD TATITIC IDIA ITITUTE OF TECHOLOGY KAPUR Estmato of populato mea ad populato varace Oe of the ma objectves after
More informationQR 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 informationNP!= P. By Liu Ran. Table of Contents. The P versus NP problem is a major unsolved problem in computer
NP!= P By Lu Ra Table of Cotets. Itroduce 2. Prelmary theorem 3. Proof 4. Expla 5. Cocluso. Itroduce The P versus NP problem s a major usolved problem computer scece. Iformally, t asks whether a computer
More information2006 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 informationLecture 4 Sep 9, 2015
CS 388R: Radomzed Algorthms Fall 205 Prof. Erc Prce Lecture 4 Sep 9, 205 Scrbe: Xagru Huag & Chad Voegele Overvew I prevous lectures, we troduced some basc probablty, the Cheroff boud, the coupo collector
More informationUnsupervised 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 informationPoint Estimation: definition of estimators
Pot Estmato: defto of estmators Pot estmator: ay fucto W (X,..., X ) of a data sample. The exercse of pot estmato s to use partcular fuctos of the data order to estmate certa ukow populato parameters.
More informationPROJECTION PROBLEM FOR REGULAR POLYGONS
Joural of Mathematcal Sceces: Advaces ad Applcatos Volume, Number, 008, Pages 95-50 PROJECTION PROBLEM FOR REGULAR POLYGONS College of Scece Bejg Forestry Uversty Bejg 0008 P. R. Cha e-mal: sl@bjfu.edu.c
More informationChapter 8. Inferences about More Than Two Population Central Values
Chapter 8. Ifereces about More Tha Two Populato Cetral Values Case tudy: Effect of Tmg of the Treatmet of Port-We tas wth Lasers ) To vestgate whether treatmet at a youg age would yeld better results tha
More informationNP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer
NP!= P By Lu Ra Table of Cotets. Itroduce 2. Strategy 3. Prelmary theorem 4. Proof 5. Expla 6. Cocluso. Itroduce The P vs. NP problem s a major usolved problem computer scece. Iformally, t asks whether
More informationUnimodality Tests for Global Optimization of Single Variable Functions Using Statistical Methods
Malaysa Umodalty Joural Tests of Mathematcal for Global Optmzato Sceces (): of 05 Sgle - 5 Varable (007) Fuctos Usg Statstcal Methods Umodalty Tests for Global Optmzato of Sgle Varable Fuctos Usg Statstcal
More informationC-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory
ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?
More information9.1 Introduction to the probit and logit models
EC3000 Ecoometrcs Lecture 9 Probt & Logt Aalss 9. Itroducto to the probt ad logt models 9. The logt model 9.3 The probt model Appedx 9. Itroducto to the probt ad logt models These models are used regressos
More informationOrdinary 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 information2.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 informationMedian as a Weighted Arithmetic Mean of All Sample Observations
Meda as a Weghted Arthmetc Mea of All Sample Observatos SK Mshra Dept. of Ecoomcs NEHU, Shllog (Ida). Itroducto: Iumerably may textbooks Statstcs explctly meto that oe of the weakesses (or propertes) of
More informationANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK
Far East Joural of Appled Mathematcs Volume, Number, 2008, Pages Ths paper s avalable ole at http://www.pphm.com 2008 Pushpa Publshg House ANALYSIS ON THE NATURE OF THE ASI EQUATIONS IN SYNERGETI INTER-REPRESENTATION
More informationSTA 105-M BASIC STATISTICS (This is a multiple choice paper.)
DCDM BUSINESS SCHOOL September Mock Eamatos STA 0-M BASIC STATISTICS (Ths s a multple choce paper.) Tme: hours 0 mutes INSTRUCTIONS TO CANDIDATES Do ot ope ths questo paper utl you have bee told to do
More informationNaïve Bayes MIT Course Notes Cynthia Rudin
Thaks to Şeyda Ertek Credt: Ng, Mtchell Naïve Bayes MIT 5.097 Course Notes Cytha Rud The Naïve Bayes algorthm comes from a geeratve model. There s a mportat dstcto betwee geeratve ad dscrmatve models.
More informationChapter Two. An Introduction to Regression ( )
ubject: A Itroducto to Regresso Frst tage Chapter Two A Itroducto to Regresso (018-019) 1 pg. ubject: A Itroducto to Regresso Frst tage A Itroducto to Regresso Regresso aalss s a statstcal tool for the
More informationLecture 16: Backpropogation Algorithm Neural Networks with smooth activation functions
CO-511: Learg Theory prg 2017 Lecturer: Ro Lv Lecture 16: Bacpropogato Algorthm Dsclamer: These otes have ot bee subected to the usual scruty reserved for formal publcatos. They may be dstrbuted outsde
More information