The Role of Science and Mathematics in Software Development


 Alexandra Price
 2 years ago
 Views:
Transcription
1 The cienific mehod i eenial in applicaion of compuaion A peronal opinion formed on he bai of decade of experience a a The Role of Science and Mahemaic in Sofware Developmen CS educaor auhor algorihm deigner Rober Sedgewick Princeon Univeriy ofware engineer Silicon Valley conribuor CS reearcher Peronal opinion or unpoken conenu? Unforunae fac Many cieni lack baic knowledge of compuer cience One way o addre he iuaion Teach he ame coure o all cience/engineering uden wwwcprinceonedu/inroc Many compuer cieni lack back knowledge of cience 1970: Wan o ue he compuer? Take inro CS 2000: Inro CS coure relevan only o fuure cubicledweller All uden learn he imporance of One way o addre he iuaion modern programming model idenify fundamenal he cienific mehod in underanding program behavior each hem o all uden who need o know hem fundamenal precep of compuer cience compuaion in a broad variey of applicaion a early a poible preparing for a lifeime of engaging wih compuaion
2 Science/engineering uden a Princeon ake he ame inro CS coure, mo in he fir year modern programming model Baic conrol rucure Sandard inpu and oupu ream Drawing, image and ound Daa abracion Ue any compuer, and he web relevan CS concep Applicaion programming Underanding of he co Fundamenal daa ype Compuer archiecure Compuabiliy and Inracabiliy Example and aignmen ue familiar eayomoivae applicaion Ideal programming example/aignmen eache a baic CS concep olve an imporan problem appeal o uden inellecual inere illurae modular programming Bouncing ball imulaion i eay Bouncing ball Nbody BoeEinein Goal demyify compuer yem empower uden o exploi compuaion build awarene of inellecual underpinning of CS OOP i helpful daadriven program are ueful efficien algorihm are neceary Underlying meage: performance maer in a large number of inereing applicaion The cienific mehod i eenial in underanding program performance Simple fac: quadraic algorihm are uele in modern applicaion million or billion of inpu nanoecond i 15+ minue nanoecond i 31+ year Web commerce BoeEinein model Sring maching for genomic Naural language analyi Nbody problem [ long li ] Scienific mehod creae a model decribing naural world ue model o develop hypohee run experimen o validae hypohee refine model and repea model hypohei experimen Simple e: Doubling hypohei Perform experimen, meaure T(N) and T(2N) if T(2N)/T(N) ~ 4, need anoher algorihm Leon: 1 Efficien algorihm enable oluion of problem ha could no oherwie be addreed 2 Scienific mehod i eenial in underanding program performance Imporan leon for beginner ofware engineer cieni [everyone] 1950: ue cienific mehod 2000: ue cienific mehod? Algorihm deigner who doe no experimen ge lo in abracion Sofware developer who ignore co rik caarophic conequence
3 Preliminary hypohei (need checking) Modern ofware require huge amoun of code Preliminary hypohei (need checking) Modern ofware developmen require huge amoun of code bu performancecriical code implemen relaively few fundamenal algorihm Warmup: random number generaion Problem: wrie a program o generae random number model: claical probabiliy and aiic hypohei: frequency value hould be uniform weak experimen: generae random number check for uniform frequencie beer experimen: generae random number ue 2 e o check frequency value again uniform diribuion beer hypohee/experimen ill needed many documened diaer acive area of cienific reearch applicaion: imulaion, crypography connec o core iue in heory of compuaion model hypohei experimen in k = 0; while ( rue ) Syemouprin(k++ % V); V = random? in k = 0; while ( rue ) { k = k* ); Syemouprin(k % V); exbook algorihm ha flunk 2 e Warmup (coninued) Q I a given equence of number random? A No Q Doe a given equence exhibi ome propery ha random number equence exhibi? Birhday paradox Average coun of random number generaed unil a duplicae happen i abou Example of a beer experimen: generae number unil duplicae check ha coun i cloe o V/2 V/2 V = 365 even beer: repea many ime, check again diribuion ill beer: run many imilar e for oher properie Anyone who conider arihmeical mehod of producing random digi i, of coure, in a ae of in John von Neumann average probe unil duplicae i abou 24
4 Deailed example: pah in graph A lecure wihin a lecure Finding an pah in a graph i a fundamenal operaion ha demand underanding Ground rule for hi alk work in progre (more queion han anwer) baic reearch ave deep dive for he righ problem Applicaion graphbaed opimizaion model nework percolaion compuer viion ocial nework (many more) Baic reearch fundamenal abrac operaion wih numerou applicaion worh doing even if no immediae applicaion rei empaion o premaurely udy impac : maxflow FordFulkeron maxflow cheme find any  pah in a (reidual) graph augmen flow along pah (may creae or delee edge) ierae unil no pah exi : max flow Compare performance of FordFulkeron implemenaion hore augmening pah maximumcapaciy augmening pah Graph parameer number of verice V number of edge E maximum capaciy C How many augmening pah? Goal: compare performance of wo baic implemenaion hore augmening pah maximum capaciy augmening pah Key ep in analyi reearch lieraure How many augmening pah? Wha i he co of finding each pah? hi alk hore max capaciy wor cae upper bound VE/2 VC 2E lg C How many ep o find each pah? E (worcae upper bound)
5 : max flow Compare performance of FordFulkeron implemenaion hore augmening pah maximumcapaciy augmening pah : max flow Compare performance of FordFulkeron implemenaion hore augmening pah maximumcapaciy augmening pah Graph parameer for example graph number of verice V = 177 number of edge E = 2000 maximum capaciy C = 100 Graph parameer for example graph number of verice V = 177 number of edge E = 2000 maximum capaciy C = 100 How many augmening pah? How many augmening pah? wor cae upper bound for example wor cae upper bound for example acual hore VE/2 VC 177,000 17,700 hore VE/2 VC 177,000 17, max capaciy 2E lg C 26,575 max capaciy 2E lg C 26,575 7 How many ep o find each pah? 2000 (worcae upper bound) How many ep o find each pah? < 20, on average oal i a facor of 1 million high for houandnode graph! : max flow Compare performance of FordFulkeron implemenaion hore augmening pah maximumcapaciy augmening pah Graph parameer number of verice V number of edge E maximum capaciy C Toal number of ep? hore max capaciy wor cae upper bound VE 2 /2 VEC 2E 2 lg C WARNING: The Algorihm General ha deermined ha uing uch reul o predic performance or o compare algorihm may be hazardou : leon Goal of algorihm analyi predic performance (running ime) guaranee ha co i below pecified bound Common widom random graph model are unrealiic averagecae analyi of algorihm i oo difficul worcae performance bound are he andard Unforunae ruh abou worcae bound ofen uele for predicion (ficional) ofen uele for guaranee (oo high) ofen miued o compare algorihm Bound are ueful in ome applicaion: worcae bound which one?? Open problem: Do beer! acual co
6 Surely, we can do beer An acual exchange wih a heoreical compuer cieni: Finding an pah in a graph i a baic operaion in a grea many applicaion Q Wha i he be way o find an pah in a graph? Algorihm A i bad TCS (in a alk): Google hould be inereed in my new Algorihm B Wha he maer wih Algorihm A? RS: I i no opimal I ha an exra O(log log N) facor TCS: Bu Algorihm B i very complicaed, lg lg N i le han 6 in hi univere, and ha i ju an upper bound Algorihm A i cerainly going o run 10 o 100 ime faer in any conceivable realworld iuaion Why hould Google care abou Algorihm B? RS: A Several welludied exbook algorihm are known Breadhfir earch (BFS) find he hore pah Dephfir earch (DFS) i eay o implemen UnionFind (UF) need wo pae BUT all hree proce all E edge in he wor cae divere kind of graph are encounered in pracice Worcae analyi i uele for predicing performance Which baic algorihm hould a praciioner ue? TCS:?? Well, I like i I don care abou Google Algorihm performance depend on he graph model Applicaion of grid graph conduciviy concree complee random grid neighbor mallworld granular maerial porou media Example polymer 1: Percolaion widelyudied model few anwer from analyi arbirarily huge graph fore fire epidemic Inerne (many appropriae candidae) Iniial choice: grid graph ufficienly challenging o be inereing found in pracice (or imilar o graph found in pracice) calable poenial for analyi Ex: eay o find hor pah quickly wih A* in geomeric graph (ay uned) Ground rule algorihm hould work for all graph algorihm hould no ue any pecial properie of he model reior nework evoluion ocial influence Fermi paradox fracal geomery ereo viion image reoraion objec egmenaion cene reconrucion Example 2: Image proceing model pixel in image DFS, maxflow/mincu, and oher alg huge graph
7 Finding an pah in a grid graph M by M grid of verice undireced edge connecing each verex o i HV neighbor ource verex a cener of op boundary deinaion verex a cener of boom boundary Find any pah connecing o M 2 verice abou 2M 2 edge Co meaure: number of graph edge examined M verice edge Finding an pah in a grid graph Similar problem are covered exenively in he lieraure Percolaion Random walk Nonelfinerecing pah in grid Graph covering Elemenary algorihm are found in exbook Dephfir earch (DFS) Breadhfir earch (BFS) Unionfind Which baic algorihm hould a praciioner ue o find a pah in a gridlike graph? Lieraure i no help, o Implemen elemenary algorihm Ue cienific mehod o udy performance?? Daa abracion a modern ool o eparae clien from implemenaion Implemening a GRAPH daa ype i an exercie in ofware engineering A daa ype i a e of value and he operaion performed on hem An abrac daa ype (ADT) i a daa ype whoe repreenaion i hidden An applicaion programming inerface (API) i a pecificaion Sample deign paern (for hi alk) GRAPH API public cla GRAPH GRAPH(Edge[] a) void findpah(in, in ) in (in v) Verice are ineger in [0, V) Edge are verex pair conruc a GRAPH from an array of edge conduc a earch from o reurn predeceor of v on pah found Clien Inerface Implemenaion invoke operaion API pecifie how o code ha implemen invoke operaion operaion Implemenaion hould no be ailored o paricular clien Develop implemenaion ha work properly for all clien Sudy heir performance for he clien a hand Clien code for grid graph in e = 0; Edge[] a = new Edge[E]; for (in i = 0; i < V; i++) { if (i < VM) a[e++] = new Edge(i, i+m); if (i >= M) a[e++] = new Edge(i, im); if ((i+1) % M!= 0) a[e++] = new Edge(i, i+1); if (i % M!= 0) a[e++] = new Edge(i, i1); GRAPH G = new GRAPH(a); GfindPah(V1M/2, M/2); for (in k = ; k!= ; k = G(k)) Syemouprinln( ); M =
8 Three andard way o find a pah Dephfir earch (DFS): recurive (ackbaed) earch Breadhfir earch (BFS): queuebaed horepah earch Unionfind (UF): ue claic eequivalence algorihm DFS BFS UF Dephfir earch: a andard implemenaion GRAPH conrucor code for (in k = 0; k < E; k++) { in v = a[k]v, w = a[k]w; adj[v] = new Node(w, adj[v]); adj[w] = new Node(v, adj[w]); graph repreenaion verexindexed array of linked li wo node per edge DFS() pu on Q while Q i nonempy DFS(v):!! ge x from Q done if v = done if x = if v unmarked for each v adj o x mark v if v unmarked DFS(v) pu v on Q mark v Fir ep: Implemen GRAPH uing each algorihm for each edge uv union (u, v) done if and are in he ame e run DFS or BFS on e conaining and DFS implemenaion (code o ave pah omied) void findpahr(in, in ) { if ( == ) reurn; viied() = rue; for(node x = adj[]; x!= null; x = xnex) if (!viied[xv]) findpahr(xv, ); void findpah(in, in ) { viied = new boolean[v]; earchr(, ); Baic flaw in andard DFS cheme co rongly depend on arbirary deciion in clien (!!) for (in i = 0; i < V; i++) { if ((i+1) % M!= 0) a[e++] = new Edge(i, i+1); if (i % M!= 0) a[e++] = new Edge(i, i1); if (i < VM) a[e++] = new Edge(i, i+m); if (i >= M) a[e++] = new Edge(i, im); we, ea, norh, ouh ouh, norh, ea, we ~E/2 ~E 1/2 order of hee aemen deermine order in li order in li ha draic effec on running ime bad new for ANY graph model Addreing he baic flaw Advie he clien o randomize he edge? no, very poor ofware engineering lead o nonrandom edge li (!) Randomize each edge li before ue? no, may no need he whole li Soluion: Ue a randomized ieraor andard ieraor in N = adj[x]lengh; for(in i = 0; i < N; i++) { proce verex adj[x][i]; randomized ieraor in N = adj[x]lengh; for(in i = 0; i < N; i++) { exch(adj[x], i, i + (in) Mahrandom()*(Ni)); proce verex adj[x][i]; exchange random verex from adj[x][in1] wih adj[x][i] x i N x x repreen graph wih array, no li i i N
9 Ue of randomized ieraor urn every graph algorihm ino a randomized algorihm Imporan pracical effec: abilize algorihm performance co depend on problem no i repreenaion (Revied) andard DFS implemenaion graph ADT conrucor code for (in k = 0; k < E; k++) { in v = a[k]v, w = a[k]w; adj[v][deg[v]++] = w; adj[w][deg[w]++] = v; graph repreenaion verexindexed array of variablelengh array Yield welldefined and fundamenal analyic problem Averagecae analyi of algorihm X for graph family Y(N)? Diribuion? Full employmen for algorihm analy DFS implemenaion (code o ave pah omied) void findpahr(in, in ) { in N = adj[]lengh; if ( == ) reurn; viied() = rue; for(in i = 0; i < N; i++) { in v = exch(adj[], i, i+(in) Mahrandom()*(Ni)); if (!viied[v]) earchr(v, ); void findpah(in, in ) { viied = new boolean[v]; findpahr(, ); BFS: andard implemenaion Ue a queue o hold fringe verice pu on Q while Q i nonempy!! ge x from Q done if x = for each unmarked v adj o x pu v on Q mark v ree verex fringe verex uneen verex Animaion give inuiion on performance and ugge hypohee o verify wih experimenaion Aide: Are you uing animaion like hi regularly? Why no? void findpah(in, in ) FIFO queue for BFS { Queue Q = new Queue(); Qpu(); viied[] = rue; while (!Qempy()) { in x = Qge(); in N = adj[x]lengh; if (x == ) reurn; randomized ieraor for (in i = 0; i < N; i++) { in v = exch(adj[x], i, i + (in) Mahrandom()*(Ni)); if (!viied[v]) { Qpu(v); viied[v] = rue; BFS DFS UF (code omied) Generalized graph earch: oher queue yield DFS, A* and oher algorihm
10 Experimenal reul how ha DFS i faer han BFS and UF on he average A faer algorihm for finding an pah in a graph M V E BFS DFS UF Analyic proof? Faer algorihm available? BFS DFS UF Ue wo dephfir earche one from he ource one from he deinaion inerleave he wo M V E BFS DFS UF wo Examine 13% of he edge 38 ime faer han andard implemenaion No bad (bu ill apparenly linear) Are oher approache faer? Oher earch algorihm randomized? farhefir? Muliple earche? inerleaving raegy? merge raegy? how many? which algorihm? Hybrid algorihm which combinaion? probabiliic rear? merge raegy? randomized choice? Experimen wih oher approache Randomized earch ue random queue in BFS eay o implemen Reul: no much differen from BFS Muliple earcher ue N earcher one from he ource one from he deinaion N2 from random verice Addiional facor of 2 for N>2 Reul: no much help anyway BFS Beer han conanfacor improvemen poible? Proof? Be mehod found (by far): DFS wih 2 earcher DFS
11 Hamle John Gielguld Enigma Murder on he Orien Expre Eernal Sunhine of he Spole Mind Caligola Vernon Dobcheff Glenn Cloe Porrai of a Lady Jude Kae Winle Cold Mounain An American Hauning The Sepford Wive Nicole Kidman The Woodman Wild Thing John Beluhi Meryl Sreep Parick Allen The Eagle ha Landed Donald Suherland Animal Houe Kevin Bacon The River Wild Tianic Dial M for Murder To Cach a Thief Kahleen Quinlan Apollo 13 Bill Paxon Paul Herber Yve Auber Grace Kelly The Da Vinci Code High Noon Lloyd Bridge Joe Veru he Volcano Tom Hank Shane Zaza Audrey Tauou Smallworld graph are a widely udied graph model wih many applicaion Smallworld graph Applicaion of mallworld graph Smallworld graph A mallworld graph ha large number of verice low average verex degree (pare) low average pah lengh local cluering Example: Add random edge o grid graph Add random edge o any pare graph wih local cluering Many cienific model Q How do we find an pah in a mallworld graph? ocial nework airline road neurobiology evoluion ocial influence proein ineracion percolaion inerne elecric power grid poliical rend Example 1: Social nework infeciou dieae exenive imulaion ome analyic reul huge graph Example 2: Proein ineracion mallworld model naural proce experimenal validaion A iny porion of he movieperformer relaionhip graph Finding a pah in a mallworld graph i a heavily udied problem Smallworld graph Finding a pah in a mallworld graph i much eaier han finding a pah in a grid graph Smallworld graph Milgram experimen (1960) Conjecure: Twoway DFS find a hor pah in ublinear ime in any mallworld graph Smallworld graph model Random (many varian) WaSrogaz Kleinberg add V random horcu o grid graph and oher A* ue ~ log E ep o find a pah Evidence in favor 1 Experimen on many graph 2 Proof kech for grid graph wih V horcu ep 1: 2 E 1/2 ep ~ 2 V 1/2 random verice ep 2: like birhday paradox How doe 2way DFS do in hi model? no change a all in graph code ju a differen graph model Pah lengh? wo e of 2V 1/2 randomly choen verice are highly unlikely o be dijoin Experimen: add M ~ E 1/2 random edge o an MbyM grid graph ue 2way DFS o find pah Surpriing reul: Find hor pah in ~ E 1/2 ep! Muliple earcher reviied? Nex ep: refine model, more experimen, deailed proof
12 Deailed example: pah in graph End of lecurewihinalecure Concluding remark on he role of mahemaic in underanding performance Worriome poin Complicaed mahemaic eem o be needed for model Do all programmer need o know he mah? Good new Many people are working on he problem Simple univeral underlying model are emerging Leon We know much le abou graph algorihm han you migh hink The cienific mehod i eenial in underanding performance Appropriae mahemaical model are eenial for cienific udie of program behavior Analyic Combinaoric i a modern bai for udying dicree rucure Pioneering work by Don Knuh Developed by Philippe Flajole and many coauhor baed on claical combinaoric and analyi Analyic Combinaoric Philippe Flajole Rober Sedgewick Coming in 2008, now available on he web Cambridge Univeriy Pre Large and acive analyi of algorihm reearch communiy i acively udying model and mehod Cauion: No all mahemaical model are appropriae! Example (from beginning of alk): Onoaion in he heory of algorihm hide deail of implemenaion ake inpu ou by doing worcae ueful for claifying algorihm and complexiy clae no a all ueful for predicing or comparing performance Generaing funcion (GF) encapulae equence Symbolic mehod rea GF a formal objec formal definiion of combinaorial conrucion direc aociaion wih generaing funcion Complex aympoic rea GF a funcion in he complex plane Sudy hem wih ingulariy analyi and oher echnique Accuraely approximae original equence
13 Analyi of algorihm: claic example A binary ree i a node conneced o wo binary ree How many binary ree wih N node? : claic example A ree i a node conneced o a equence of ree How many ree wih N node? Given a recurrence relaion inroduce a generaing funcion B N = B 0 B N1 ++ B k B N1k ++ B N1 B 0 B(z) $ B 0 z 0 + B 1 z 1 + B 2 z 2 + B 3 z 3 + Combinaorial conrucion <G> = " + <G> + <G> <G> + <G> <G> <G> + muliply boh ide by z N and um o ge an equaion B(z) = 1 + z B(z) 2 direcly map o GF G(z) = 1 + G(z) + G(z) 2 + G(z) 3 + ha we can olve algebraically and expand o ge coefficien B(z) = z 2z B N = 1 ( 2N ) N+1 N Quadraic equaion Binomial heorem ha we can manipulae algebraically G(z) = z 2 by quadraic equaion 1 ince G(z) =, 1  G(z) o G(z) 2  G(z) + z = 0 ha we can approximae B N! Baic challenge: need a new derivaion for each problem N 4 N "N Sirling approximaion Appear in birhday paradox (and counle oher problem) Coincidence? and rea a a complex funcion o approximae growh G N! 4 N 4 N = 2N #(½) N 2N "N N Fir principle: locaion of ingulariy deermine exponenial growh Second principle: naure of ingulariy deermine ubexponenial facor : ingulariy analyi i a key o exracing coefficien aympoic Exponenial growh facor depend on locaion of dominan ingulariy i eaily exraced Ex: [z N ](1  bz) c = b N [z N ](1  z) c Combinaorial conrucion : univeral law of weeping generaliy derive from he ame echnology Ex Conex free conrucion < G 0 > = OP 0 (< G 0 >, < G 1 >,, < G >) < G 1 > = OP 1 (< G 0 >, < G 1 >,, < G >) < G > = OP (< G 0 >, < G 1 >,, < G >) like conexfree language (or Java daa ype) Ex: Polynomial growh facor depend on naure of dominan ingulariy can ofen be compued via conour inegraion 1! " z N+1 [z N ](1  z) c (1  z) = c dz 2"i C 1! " z N+1 ~ (1  z) c dz 2"i H 1 ~ #(c)n c+1 Cauchy coefficien formula Hankel conour many deail omied! C H direcly map o a yem of GF ha we can manipulae algebraically o ge a ingle complex funcion ha i amenable o ingulariy analyi G 0 (z) = F 0 ( G 0 (z), G 1 (z), G (z)) G 1 (z) = F 1 ( G 0 (z), G 1 (z), G (z)) G (z) = F ( G 0 (z), G 1 (z), G (z)) G(z) $ G 0 (z) = F( G 0 (z), G (z))! (1  z ) c Groebnerbai eliminaion G N! a b N N c for any conexfree conrucion! Good new: Several uch law have been dicovered DrmoaLalleyWood Beer new: Diribuion alo available (ypically normal, mall igma)
14 A general hypohei from analyic combinaoric The running ime of your program i ~ a b N N c (lg N) d he conan a depend on boh complex funcion and properie of machine and implemenaion he exponenial growh facor b hould be 1 he exponen c depend on ingulariie he log facor d i reconciled in deailed udie Final remark Wriing a program wihou underanding performance i like no knowing where a rocke will go no knowing he rengh of a bridge Why? daa rucure evolve from combinaorial conrucion univeral law from analyic combinaoric have hi form To compue value: lg(t(2n)/t(n) # c he doubling e ha we each o beginner! T(N)/b N N c # a Pleny of cavea, bu provide a bai for udying program performance We need o no knowing he doage of a drug each he cienific mehod hroughou he curriculum ue he cienific mehod whenever developing ofware do he reearch neceary o develop underlying model The Role of Science and Mahemaic in Sofware Developmen Rober Sedgewick Princeon Univeriy
The Role of the Scientific Method in Software Development. Robert Sedgewick Princeton University
The Role of he Scienific Mehod in Sofware Developmen Rober Sedgewick Princeon Univeriy The cienific mehod i neceary in algorihm deign and ofware developmen Scienific mehod creae a model decribing naural
More informationChapter 13. Network Flow III Applications. 13.1 Edge disjoint paths. 13.1.1 Edgedisjoint paths in a directed graphs
Chaper 13 Nework Flow III Applicaion CS 573: Algorihm, Fall 014 Ocober 9, 014 13.1 Edge dijoin pah 13.1.1 Edgedijoin pah in a direced graph 13.1.1.1 Edge dijoin pah queiong: graph (dir/undir)., : verice.
More information2.4 Network flows. Many direct and indirect applications telecommunication transportation (public, freight, railway, air, ) logistics
.4 Nework flow Problem involving he diribuion of a given produc (e.g., waer, ga, daa, ) from a e of producion locaion o a e of uer o a o opimize a given objecive funcion (e.g., amoun of produc, co,...).
More informationHow Much Can Taxes Help Selfish Routing?
How Much Can Taxe Help Selfih Rouing? Tim Roughgarden (Cornell) Join wih Richard Cole (NYU) and Yevgeniy Dodi (NYU) Selfih Rouing a direced graph G = (V,E) a ource and a deinaion one uni of raffic from
More informationA Comparative Study of Linear and Nonlinear Models for Aggregate Retail Sales Forecasting
A Comparaive Sudy of Linear and Nonlinear Model for Aggregae Reail Sale Forecaing G. Peer Zhang Deparmen of Managemen Georgia Sae Univeriy Alana GA 30066 (404) 6514065 Abrac: The purpoe of hi paper i
More informationChapter 7. Response of FirstOrder RL and RC Circuits
Chaper 7. esponse of FirsOrder L and C Circuis 7.1. The Naural esponse of an L Circui 7.2. The Naural esponse of an C Circui 7.3. The ep esponse of L and C Circuis 7.4. A General oluion for ep and Naural
More informationFortified financial forecasting models: nonlinear searching approaches
0 Inernaional Conference on Economic and inance Reearch IPEDR vol.4 (0 (0 IACSIT Pre, Singapore orified financial forecaing model: nonlinear earching approache Mohammad R. Hamidizadeh, Ph.D. Profeor,
More informationThe Role of the Scientific Method in Programming. Robert Sedgewick Princeton University
The Role of the Scientific Method in Programming Robert Sedgewick Princeton University The scientific method is essential in applications of computation A personal opinion formed on the basis of decades
More informationOptimal Investment and Consumption Decision of Family with Life Insurance
Opimal Invesmen and Consumpion Decision of Family wih Life Insurance Minsuk Kwak 1 2 Yong Hyun Shin 3 U Jin Choi 4 6h World Congress of he Bachelier Finance Sociey Torono, Canada June 25, 2010 1 Speaker
More informationOn the Connection Between MultipleUnicast Network Coding and SingleSource SingleSink Network Error Correction
On he Connecion Beween MulipleUnica ework Coding and SingleSource SingleSink ework Error Correcion Jörg Kliewer JIT Join work wih Wenao Huang and Michael Langberg ework Error Correcion Problem: Adverary
More informationChabot College Physics Lab RC Circuits Scott Hildreth
Chabo College Physics Lab Circuis Sco Hildreh Goals: Coninue o advance your undersanding of circuis, measuring resisances, currens, and volages across muliple componens. Exend your skills in making breadboard
More informationFourier series. Learning outcomes
Fourier series 23 Conens. Periodic funcions 2. Represening ic funcions by Fourier Series 3. Even and odd funcions 4. Convergence 5. Halfrange series 6. The complex form 7. Applicaion of Fourier series
More informationPROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE
Profi Tes Modelling in Life Assurance Using Spreadshees PROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE Erik Alm Peer Millingon 2004 Profi Tes Modelling in Life Assurance Using Spreadshees
More informationProcess Modeling for Object Oriented Analysis using BORM Object Behavioral Analysis.
Proce Modeling for Objec Oriened Analyi uing BORM Objec Behavioral Analyi. Roger P. Kno Ph.D., Compuer Science Dep, Loughborough Univeriy, U.K. r.p.kno@lboro.ac.uk 9RMW FKMerunka Ph.D., Dep. of Informaion
More informationThe Application of Multi Shifts and Break Windows in Employees Scheduling
The Applicaion of Muli Shifs and Brea Windows in Employees Scheduling Evy Herowai Indusrial Engineering Deparmen, Universiy of Surabaya, Indonesia Absrac. One mehod for increasing company s performance
More informationHeat demand forecasting for concrete district heating system
Hea demand forecaing for concree diric heaing yem Bronilav Chramcov Abrac Thi paper preen he reul of an inveigaion of a model for horerm hea demand forecaing. Foreca of hi hea demand coure i ignifican
More information17 Laplace transform. Solving linear ODE with piecewise continuous right hand sides
7 Laplace ransform. Solving linear ODE wih piecewise coninuous righ hand sides In his lecure I will show how o apply he Laplace ransform o he ODE Ly = f wih piecewise coninuous f. Definiion. A funcion
More informationHow has globalisation affected inflation dynamics in the United Kingdom?
292 Quarerly Bullein 2008 Q3 How ha globaliaion affeced inflaion dynamic in he Unied Kingdom? By Jennifer Greenlade and Sephen Millard of he Bank Srucural Economic Analyi Diviion and Chri Peacock of he
More informationCHARGE AND DISCHARGE OF A CAPACITOR
REFERENCES RC Circuis: Elecrical Insrumens: Mos Inroducory Physics exs (e.g. A. Halliday and Resnick, Physics ; M. Sernheim and J. Kane, General Physics.) This Laboraory Manual: Commonly Used Insrumens:
More informationMaking a Faster Cryptanalytic TimeMemory TradeOff
Making a Faser Crypanalyic TimeMemory TradeOff Philippe Oechslin Laboraoire de Securié e de Crypographie (LASEC) Ecole Polyechnique Fédérale de Lausanne Faculé I&C, 1015 Lausanne, Swizerland philippe.oechslin@epfl.ch
More informationAnalogue and Digital Signal Processing. First Term Third Year CS Engineering By Dr Mukhtiar Ali Unar
Analogue and Digial Signal Processing Firs Term Third Year CS Engineering By Dr Mukhiar Ali Unar Recommended Books Haykin S. and Van Veen B.; Signals and Sysems, John Wiley& Sons Inc. ISBN: 073807 Ifeachor
More informationIssues Using OLS with Time Series Data. Time series data NOT randomly sampled in same way as cross sectional each obs not i.i.d
These noes largely concern auocorrelaion Issues Using OLS wih Time Series Daa Recall main poins from Chaper 10: Time series daa NOT randomly sampled in same way as cross secional each obs no i.i.d Why?
More informationMathematics in Pharmacokinetics What and Why (A second attempt to make it clearer)
Mahemaics in Pharmacokineics Wha and Why (A second aemp o make i clearer) We have used equaions for concenraion () as a funcion of ime (). We will coninue o use hese equaions since he plasma concenraions
More informationDIFFERENTIAL EQUATIONS with TI89 ABDUL HASSEN and JAY SCHIFFMAN. A. Direction Fields and Graphs of Differential Equations
DIFFERENTIAL EQUATIONS wih TI89 ABDUL HASSEN and JAY SCHIFFMAN We will assume ha he reader is familiar wih he calculaor s keyboard and he basic operaions. In paricular we have assumed ha he reader knows
More informationPerformance Center Overview. Performance Center Overview 1
Performance Cener Overview Performance Cener Overview 1 ODJFS Performance Cener ce Cener New Performance Cener Model Performance Cener Projec Meeings Performance Cener Execuive Meeings Performance Cener
More informationPhysical Topology Discovery for Large MultiSubnet Networks
Phyical Topology Dicovery for Large MuliSubne Nework Yigal Bejerano, Yuri Breibar, Mino Garofalaki, Rajeev Raogi Bell Lab, Lucen Technologie 600 Mounain Ave., Murray Hill, NJ 07974. {bej,mino,raogi}@reearch.belllab.com
More informationAn approach for designing a surface pencil through a given geodesic curve
An approach for deigning a urface pencil hrough a given geodeic curve Gülnur SAFFAK ATALAY, Fama GÜLER, Ergin BAYRAM *, Emin KASAP Ondokuz Mayı Univeriy, Faculy of Ar and Science, Mahemaic Deparmen gulnur.affak@omu.edu.r,
More informationRotational Inertia of a Point Mass
Roaional Ineria of a Poin Mass Saddleback College Physics Deparmen, adaped from PASCO Scienific PURPOSE The purpose of his experimen is o find he roaional ineria of a poin experimenally and o verify ha
More informationAcceleration Lab Teacher s Guide
Acceleraion Lab Teacher s Guide Objecives:. Use graphs of disance vs. ime and velociy vs. ime o find acceleraion of a oy car.. Observe he relaionship beween he angle of an inclined plane and he acceleraion
More informationRC, RL and RLC circuits
Name Dae Time o Complee h m Parner Course/ Secion / Grade RC, RL and RLC circuis Inroducion In his experimen we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors.
More informationSKF Documented Solutions
SKF Documened Soluions Real world savings and we can prove i! How much can SKF save you? Le s do he numbers. The SKF Documened Soluions Program SKF is probably no he firs of your supplier parners o alk
More informationDuration and Convexity ( ) 20 = Bond B has a maturity of 5 years and also has a required rate of return of 10%. Its price is $613.
Graduae School of Business Adminisraion Universiy of Virginia UVAF38 Duraion and Convexiy he price of a bond is a funcion of he promised paymens and he marke required rae of reurn. Since he promised
More informationJournal Of Business & Economics Research September 2005 Volume 3, Number 9
Opion Pricing And Mone Carlo Simulaions George M. Jabbour, (Email: jabbour@gwu.edu), George Washingon Universiy YiKang Liu, (yikang@gwu.edu), George Washingon Universiy ABSTRACT The advanage of Mone Carlo
More informationCalculation of variable annuity market sensitivities using a pathwise methodology
cuing edge Variable annuiie Calculaion of variable annuiy marke eniiviie uing a pahwie mehodology Under radiional finie difference mehod, he calculaion of variable annuiy eniiviie can involve muliple Mone
More informationThe Transport Equation
The Transpor Equaion Consider a fluid, flowing wih velociy, V, in a hin sraigh ube whose cross secion will be denoed by A. Suppose he fluid conains a conaminan whose concenraion a posiion a ime will be
More informationcooking trajectory boiling water B (t) microwave 0 2 4 6 8 101214161820 time t (mins)
Alligaor egg wih calculus We have a large alligaor egg jus ou of he fridge (1 ) which we need o hea o 9. Now here are wo accepable mehods for heaing alligaor eggs, one is o immerse hem in boiling waer
More informationRobust Bandwidth Allocation Strategies
Robu Bandwidh Allocaion Sraegie Oliver Heckmann, Jen Schmi, Ralf Seinmez Mulimedia Communicaion Lab (KOM), Darmad Univeriy of Technology Merckr. 25 D64283 Darmad Germany {Heckmann, Schmi, Seinmez}@kom.udarmad.de
More informationChapter 8: Regression with Lagged Explanatory Variables
Chaper 8: Regression wih Lagged Explanaory Variables Time series daa: Y for =1,..,T End goal: Regression model relaing a dependen variable o explanaory variables. Wih ime series new issues arise: 1. One
More information4 Convolution. Recommended Problems. x2[n] 1 2[n]
4 Convoluion Recommended Problems P4.1 This problem is a simple example of he use of superposiion. Suppose ha a discreeime linear sysem has oupus y[n] for he given inpus x[n] as shown in Figure P4.11.
More informationLecture III: Finish Discounted Value Formulation
Lecure III: Finish Discouned Value Formulaion I. Inernal Rae of Reurn A. Formally defined: Inernal Rae of Reurn is ha ineres rae which reduces he ne presen value of an invesmen o zero.. Finding he inernal
More informationThe Grantor Retained Annuity Trust (GRAT)
WEALTH ADVISORY Esae Planning Sraegies for closelyheld, family businesses The Granor Reained Annuiy Trus (GRAT) An efficien wealh ransfer sraegy, paricularly in a low ineres rae environmen Family business
More informationANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS
ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS R. Caballero, E. Cerdá, M. M. Muñoz and L. Rey () Deparmen of Applied Economics (Mahemaics), Universiy of Málaga,
More informationOptimal Path Routing in Single and Multiple Clock Domain Systems
IEEE TRANSACTIONS ON COMPUTERAIDED DESIGN, TO APPEAR. 1 Opimal Pah Rouing in Single and Muliple Clock Domain Syem Soha Haoun, Senior Member, IEEE, Charle J. Alper, Senior Member, IEEE ) Abrac Shrinking
More informationAppendix A: Area. 1 Find the radius of a circle that has circumference 12 inches.
Appendi A: Area workedou s o OddNumbered Eercises Do no read hese workedou s before aemping o do he eercises ourself. Oherwise ou ma mimic he echniques shown here wihou undersanding he ideas. Bes wa
More information1 HALFLIFE EQUATIONS
R.L. Hanna Page HALFLIFE EQUATIONS The basic equaion ; he saring poin ; : wrien for ime: x / where fracion of original maerial and / number of halflives, and / log / o calculae he age (# ears): age (halflife)
More informationThe Chase Problem (Part 2) David C. Arney
The Chae Problem Par David C. Arne Inroducion In he previou ecion, eniled The Chae Problem Par, we dicued a dicree model for a chaing cenario where one hing chae anoher. Some of he applicaion of hi kind
More informationMultiprocessor SystemsonChips
Par of: Muliprocessor SysemsonChips Edied by: Ahmed Amine Jerraya and Wayne Wolf Morgan Kaufmann Publishers, 2005 2 Modeling Shared Resources Conex swiching implies overhead. On a processing elemen,
More informationCapacity Planning and Performance Benchmark Reference Guide v. 1.8
Environmenal Sysems Research Insiue, Inc., 380 New York S., Redlands, CA 923738100 USA TEL 9097932853 FAX 9093073014 Capaciy Planning and Performance Benchmark Reference Guide v. 1.8 Prepared by:
More informationInformation Theoretic Evaluation of Change Prediction Models for LargeScale Software
Informaion Theoreic Evaluaion of Change Predicion Models for LargeScale Sofware Mina Askari School of Compuer Science Universiy of Waerloo Waerloo, Canada maskari@uwaerloo.ca Ric Hol School of Compuer
More informationTEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS
TEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS RICHARD J. POVINELLI AND XIN FENG Deparmen of Elecrical and Compuer Engineering Marquee Universiy, P.O.
More informationCHAPTER 11 NONPARAMETRIC REGRESSION WITH COMPLEX SURVEY DATA. R. L. Chambers Department of Social Statistics University of Southampton
CHAPTER 11 NONPARAMETRIC REGRESSION WITH COMPLEX SURVEY DATA R. L. Chamber Deparmen of Social Saiic Univeriy of Souhampon A.H. Dorfman Office of Survey Mehod Reearch Bureau of Labor Saiic M.Yu. Sverchkov
More informationAP Calculus BC 2010 Scoring Guidelines
AP Calculus BC Scoring Guidelines The College Board The College Board is a noforprofi membership associaion whose mission is o connec sudens o college success and opporuniy. Founded in, he College Board
More informationµ r of the ferrite amounts to 1000...4000. It should be noted that the magnetic length of the + δ
Page 9 Design of Inducors and High Frequency Transformers Inducors sore energy, ransformers ransfer energy. This is he prime difference. The magneic cores are significanly differen for inducors and high
More information11/6/2013. Chapter 14: Dynamic ADAS. Introduction. Introduction. Keeping track of time. The model s elements
Inroducion Chaper 14: Dynamic DS dynamic model of aggregae and aggregae supply gives us more insigh ino how he economy works in he shor run. I is a simplified version of a DSGE model, used in cuingedge
More informationOn the degrees of irreducible factors of higher order Bernoulli polynomials
ACTA ARITHMETICA LXII.4 (1992 On he degrees of irreducible facors of higher order Bernoulli polynomials by Arnold Adelberg (Grinnell, Ia. 1. Inroducion. In his paper, we generalize he curren resuls on
More informationTwo Compartment Body Model and V d Terms by Jeff Stark
Two Comparmen Body Model and V d Terms by Jeff Sark In a onecomparmen model, we make wo imporan assumpions: (1) Linear pharmacokineics  By his, we mean ha eliminaion is firs order and ha pharmacokineic
More informationPart 1: White Noise and Moving Average Models
Chaper 3: Forecasing From Time Series Models Par 1: Whie Noise and Moving Average Models Saionariy In his chaper, we sudy models for saionary ime series. A ime series is saionary if is underlying saisical
More informationCaring for trees and your service
Caring for rees and your service Line clearing helps preven ouages FPL is commied o delivering safe, reliable elecric service o our cusomers. Trees, especially palm rees, can inerfere wih power lines and
More informationFormulating CyberSecurity as Convex Optimization Problems
Formulaing CyberSecuriy a Convex Opimizaion Problem Kyriako G. Vamvoudaki, João P. Hepanha, Richard A. Kemmerer, and Giovanni Vigna Univeriy of California, Sana Barbara Abrac. Miioncenric cyberecuriy
More informationThree Dimensional Grounding Grid Design
Three Dimenional Grounding Grid Deign Fikri Bari Uzunlar 1, Özcan Kalenderli 2 1 Schneider Elecric Turkey, Ianbul, Turkey bari.uzunlar@r.chneiderelecric.com 2 Ianbul Technical Univeriy, ElecricalElecronic
More information5.8 Resonance 231. The study of vibrating mechanical systems ends here with the theory of pure and practical resonance.
5.8 Resonance 231 5.8 Resonance The sudy of vibraing mechanical sysems ends here wih he heory of pure and pracical resonance. Pure Resonance The noion of pure resonance in he differenial equaion (1) ()
More informationA Note on Using the Svensson procedure to estimate the risk free rate in corporate valuation
A Noe on Using he Svensson procedure o esimae he risk free rae in corporae valuaion By Sven Arnold, Alexander Lahmann and Bernhard Schwezler Ocober 2011 1. The risk free ineres rae in corporae valuaion
More information9. Capacitor and Resistor Circuits
ElecronicsLab9.nb 1 9. Capacior and Resisor Circuis Inroducion hus far we have consider resisors in various combinaions wih a power supply or baery which provide a consan volage source or direc curren
More informationDifferential Equations and Linear Superposition
Differenial Equaions and Linear Superposiion Basic Idea: Provide soluion in closed form Like Inegraion, no general soluions in closed form Order of equaion: highes derivaive in equaion e.g. dy d dy 2 y
More informationVector Autoregressions (VARs): Operational Perspectives
Vecor Auoregressions (VARs): Operaional Perspecives Primary Source: Sock, James H., and Mark W. Wason, Vecor Auoregressions, Journal of Economic Perspecives, Vol. 15 No. 4 (Fall 2001), 101115. Macroeconomericians
More informationGraduate Macro Theory II: Notes on Neoclassical Growth Model
Graduae Macro Theory II: Noes on Neoclassical Growh Model Eric Sims Universiy of Nore Dame Spring 2011 1 Basic Neoclassical Growh Model The economy is populaed by a large number of infiniely lived agens.
More informationTable of contents Chapter 1 Interest rates and factors Chapter 2 Level annuities Chapter 3 Varying annuities
Table of conens Chaper 1 Ineres raes and facors 1 1.1 Ineres 2 1.2 Simple ineres 4 1.3 Compound ineres 6 1.4 Accumulaed value 10 1.5 Presen value 11 1.6 Rae of discoun 13 1.7 Consan force of ineres 17
More informationChapter 2 Kinematics in One Dimension
Chaper Kinemaics in One Dimension Chaper DESCRIBING MOTION:KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings moe how far (disance and displacemen), how fas (speed and elociy), and how
More informationAP Calculus AB 2013 Scoring Guidelines
AP Calculus AB 1 Scoring Guidelines The College Board The College Board is a missiondriven noforprofi organizaion ha connecs sudens o college success and opporuniy. Founded in 19, he College Board was
More informationCrosssectional and longitudinal weighting in a rotational household panel: applications to EUSILC. Vijay Verma, Gianni Betti, Giulio Ghellini
Croecional and longiudinal eighing in a roaional houehold panel: applicaion o EUSILC Viay Verma, Gianni Bei, Giulio Ghellini Working Paper n. 67, December 006 CROSSSECTIONAL AND LONGITUDINAL WEIGHTING
More informationEntropy: From the Boltzmann equation to the Maxwell Boltzmann distribution
Enropy: From he Bolzmann equaion o he Maxwell Bolzmann disribuion A formula o relae enropy o probabiliy Ofen i is a lo more useful o hink abou enropy in erms of he probabiliy wih which differen saes are
More information11. Tire pressure. Here we always work with relative pressure. That s what everybody always does.
11. Tire pressure. The graph You have a hole in your ire. You pump i up o P=400 kilopascals (kpa) and over he nex few hours i goes down ill he ire is quie fla. Draw wha you hink he graph of ire pressure
More informationExplore the Application of Financial Engineering in the Management of Exchange Rate Risk
SHS Web o Conerence 17, 01006 (015) DOI: 10.1051/ hcon/01517 01006 C Owned by he auhor, publihed by EDP Science, 015 Explore he Applicaion o Financial Engineering in he Managemen o Exchange Rae Rik Liu
More informationINVESTIGATION OF THE INFLUENCE OF UNEMPLOYMENT ON ECONOMIC INDICATORS
INVESTIGATION OF THE INFLUENCE OF UNEMPLOYMENT ON ECONOMIC INDICATORS Ilona Tregub, Olga Filina, Irina Kondakova Financial Universiy under he Governmen of he Russian Federaion 1. Phillips curve In economics,
More informationFormulating CyberSecurity as Convex Optimization Problems Æ
Formulaing CyberSecuriy a Convex Opimizaion Problem Æ Kyriako G. Vamvoudaki,João P. Hepanha, Richard A. Kemmerer 2, and Giovanni Vigna 2 Cener for Conrol, Dynamicalyem and Compuaion (CCDC), Univeriy
More informationYTM is positively related to default risk. YTM is positively related to liquidity risk. YTM is negatively related to special tax treatment.
. Two quesions for oday. A. Why do bonds wih he same ime o mauriy have differen YTM s? B. Why do bonds wih differen imes o mauriy have differen YTM s? 2. To answer he firs quesion les look a he risk srucure
More informationTopK Structural Diversity Search in Large Networks
TopK Srucural Diversiy Search in Large Neworks Xin Huang, Hong Cheng, RongHua Li, Lu Qin, Jeffrey Xu Yu The Chinese Universiy of Hong Kong Guangdong Province Key Laboraory of Popular High Performance
More informationMorningstar Investor Return
Morningsar Invesor Reurn Morningsar Mehodology Paper Augus 31, 2010 2010 Morningsar, Inc. All righs reserved. The informaion in his documen is he propery of Morningsar, Inc. Reproducion or ranscripion
More informationSection 7.1 Angles and Their Measure
Secion 7.1 Angles and Their Measure Greek Leers Commonly Used in Trigonomery Quadran II Quadran III Quadran I Quadran IV α = alpha β = bea θ = hea δ = dela ω = omega γ = gamma DEGREES The angle formed
More informationHANDOUT 14. A.) Introduction: Many actions in life are reversible. * Examples: Simple One: a closed door can be opened and an open door can be closed.
Inverse Funcions Reference Angles Inverse Trig Problems Trig Indeniies HANDOUT 4 INVERSE FUNCTIONS KEY POINTS A.) Inroducion: Many acions in life are reversible. * Examples: Simple One: a closed door can
More informationNanocubes for RealTime Exploration of Spatiotemporal Datasets
Nanocube for RealTime Exploraion of Spaioemporal Daae Lauro Lin, Jame T Kloowki, and arlo Scheidegger Fig 1 Example viualizaion of 210 million public geolocaed Twier po over he coure of a year The daa
More informationMax Flow, Min Cut. Maximum Flow and Minimum Cut. Soviet Rail Network, 1955. Minimum Cut Problem
Maximum Flow and Minimum u Max Flow, Min u Max flow and min cu. Two very rich algorihmic problem. ornerone problem in combinaorial opimizaion. eauiful mahemaical dualiy. Minimum cu Maximum flow Maxflow
More informationInternet Engineering. Jacek Mazurkiewicz, PhD Softcomputing. Part 1: Introduction, Elementary ANNs
Inerne Engineering Jacek azurkieicz, PhD Sofcompuing Par : Inroducion, Elemenary As Formal Inroducion conac hours, room o. 5 building C3: onday: :455:5, Friday: 4:306:00, slides:.zsk.ic.pr.roc.pl Professor
More informationStochastic Optimal Control Problem for Life Insurance
Sochasic Opimal Conrol Problem for Life Insurance s. Basukh 1, D. Nyamsuren 2 1 Deparmen of Economics and Economerics, Insiue of Finance and Economics, Ulaanbaaar, Mongolia 2 School of Mahemaics, Mongolian
More informationIndividual Health Insurance April 30, 2008 Pages 167170
Individual Healh Insurance April 30, 2008 Pages 167170 We have received feedback ha his secion of he e is confusing because some of he defined noaion is inconsisen wih comparable life insurance reserve
More informationStatistical Analysis with Little s Law. Supplementary Material: More on the Call Center Data. by SongHee Kim and Ward Whitt
Saisical Analysis wih Lile s Law Supplemenary Maerial: More on he Call Cener Daa by SongHee Kim and Ward Whi Deparmen of Indusrial Engineering and Operaions Research Columbia Universiy, New York, NY 1799
More informationChapter 4. Properties of the Least Squares Estimators. Assumptions of the Simple Linear Regression Model. SR3. var(e t ) = σ 2 = var(y t )
Chaper 4 Properies of he Leas Squares Esimaors Assumpions of he Simple Linear Regression Model SR1. SR. y = β 1 + β x + e E(e ) = 0 E[y ] = β 1 + β x SR3. var(e ) = σ = var(y ) SR4. cov(e i, e j ) = cov(y
More informationAutomatic measurement and detection of GSM interferences
Auomaic measuremen and deecion of GSM inerferences Poor speech qualiy and dropped calls in GSM neworks may be caused by inerferences as a resul of high raffic load. The radio nework analyzers from Rohde
More informationDYNAMIC MODELS FOR VALUATION OF WRONGFUL DEATH PAYMENTS
DYNAMIC MODELS FOR VALUATION OF WRONGFUL DEATH PAYMENTS Hong Mao, Shanghai Second Polyechnic Universiy Krzyszof M. Osaszewski, Illinois Sae Universiy Youyu Zhang, Fudan Universiy ABSTRACT Liigaion, exper
More informationsdomain Circuit Analysis
Domain ircui Analyi Operae direcly in he domain wih capacior, inducor and reior Key feaure lineariy i preered c decribed by ODE and heir Order equal number of plu number of Elemenbyelemen and ource ranformaion
More informationOptimal Stock Selling/Buying Strategy with reference to the Ultimate Average
Opimal Sock Selling/Buying Sraegy wih reference o he Ulimae Average Min Dai Dep of Mah, Naional Universiy of Singapore, Singapore Yifei Zhong Dep of Mah, Naional Universiy of Singapore, Singapore July
More informationPermutations and Combinations
Permuaions and Combinaions Combinaorics Copyrigh Sandards 006, Tes  ANSWERS Barry Mabillard. 0 www.mah0s.com 1. Deermine he middle erm in he expansion of ( a b) To ge he kvalue for he middle erm, divide
More informationPresent Value Methodology
Presen Value Mehodology Econ 422 Invesmen, Capial & Finance Universiy of Washingon Eric Zivo Las updaed: April 11, 2010 Presen Value Concep Wealh in Fisher Model: W = Y 0 + Y 1 /(1+r) The consumer/producer
More informationAP Calculus AB 2010 Scoring Guidelines
AP Calculus AB 1 Scoring Guidelines The College Board The College Board is a noforprofi membership associaion whose mission is o connec sudens o college success and opporuniy. Founded in 1, he College
More informationChapter 4: Exponential and Logarithmic Functions
Chaper 4: Eponenial and Logarihmic Funcions Secion 4.1 Eponenial Funcions... 15 Secion 4. Graphs of Eponenial Funcions... 3 Secion 4.3 Logarihmic Funcions... 4 Secion 4.4 Logarihmic Properies... 53 Secion
More informationInformation Systems for Business Integration: ERP Systems
Informaion Sysems for Business Inegraion: ERP Sysems (December 3, 2012) BUS3500  Abdou Illia, Fall 2012 1 LEARNING GOALS Explain he difference beween horizonal and verical business inegraion. Describe
More informationLAB 6: SIMPLE HARMONIC MOTION
1 Name Dae Day/Time of Lab Parner(s) Lab TA Objecives LAB 6: SIMPLE HARMONIC MOTION To undersand oscillaion in relaion o equilibrium of conservaive forces To manipulae he independen variables of oscillaion:
More informationCapacitors and inductors
Capaciors and inducors We coninue wih our analysis of linear circuis by inroducing wo new passive and linear elemens: he capacior and he inducor. All he mehods developed so far for he analysis of linear
More informationSupply Chain Management Using Simulation Optimization By Miheer Kulkarni
Supply Chain Managemen Using Simulaion Opimizaion By Miheer Kulkarni This problem was inspired by he paper by Jung, Blau, Pekny, Reklaii and Eversdyk which deals wih supply chain managemen for he chemical
More informationDifferential Equations. Solving for Impulse Response. Linear systems are often described using differential equations.
Differenial Equaions Linear sysems are ofen described using differenial equaions. For example: d 2 y d 2 + 5dy + 6y f() d where f() is he inpu o he sysem and y() is he oupu. We know how o solve for y given
More information