Performance Modeling of Hierarchical Memories
|
|
- Diana Bell
- 6 years ago
- Views:
Transcription
1 Performne Modelng of Herrl Memores Mrwn Slemn, Lester Lpsky, Ksor Konwr Deprtment of omputer Sene nd Engneerng Unversty of onnetut Storrs, T Eml: {mrwn, lester, ksor}@engr.uonn.edu Abstrt As te modern omputng envronment expnds memory erry from PU regsters nd lol memory to network storge, te optml gol of omputer rtet beomes to desgn memory erry tt mxmzes te overll desgn of s mne wt mnml ost. Ts requres dedng on te number, speed nd sze of te errl lyers. As te gp between proessor nd memory speed s growng exponentlly, t beomes more mportnt to develop n nlytl model to pture ll tese errl levels nd optmze te memory ess tme to mke good utlzton of bot PU nd memory. In ts pper we study te performne of systems wt mult-level errl memores by modelng ter ess tme w elps te desgner optmze te ost nd ess tme. We use lner-lgebr queung teory ppro to eve our gol nd we expln wy prevous ttempts fled to provde urte models. Our model dffers from ll te prevous relted work by beng globl nd generl nd by usng some probblst equtons tt sow te nterdependene between te dfferent levels nd by usng te P-K formul to dstngus between te memory ess tme nd queung tme. Our ppro s ndependent of te pplton usng te memory wle lssl pproes were progrm dependent. Moreover, our model eves ger levels of ury wle beng expndble to multple levels. Keywords: Memory Herry, Performne Anlyss, Mrkov model, Queung, Aess Tme. INTRODUTION Beng ble to mke urte estmtes of ow long memory ess wll tke to fns n mult-level errl memory system s of prmry nterest n te performne ommunty. In su errl envronment, we ve multple levels of memory strtng from PU regsters nd extendng to es, mn RAM memory, lol dsks, nd network storge [6]. As te memory erry extends to network nd nternet storge pssng by mddle-ter rteture nd ng, te problem of optmzng te memory ess tme beomes more llengng. Dt s stored nd eld n e level untl t s used or repled. E memory level dffers from te oters by ts sze nd speed. As te memory beomes loser to te PU, t beomes fster but smller nd more expensve. Tus, wen desgnng memory erry, our m s to get te fstest desgn wle mntnng ompromse between sze, speed nd ost. Hvng found tt te prevous pproes n studyng memory ess tme were lmted wt te number of memory levels tey n represent, depended on te pplton, nd dd not provde wt g ury, we represented te errl memory by M/G/ queue [] nd we lulted te ess tme by usng lner lgebr queung teory. Ten we onsdered te queung tme of te onseutve memory requests tt n our n dtbse pplton for exmple nd we sowed te dfferene between te ess tme nd te queung tme. Ts dfferene explns te use of te nury of prevous pproes n predtng te memory ess tme. We lso study te bevor of te vrne ess tme w s gly rtl beuse t n drmtlly ffet te mss rto of te memory system nd ts performne. Te model we bult s more generl tn te lssl models beuse t n tke s nput dfferent nput prmeters lke, ess tme, t rto, ost, nd memory request dstrbuton. Te remnng of ts pper s orgnzed s follows: In seton, we present lterture survey bout prevous efforts relted to te top nd we expln our motvton. We dsuss te PK formul metod to lulte te memory request queung tme n seton 3. In seton 4, we present two ses for evlutng our metods. Ten, n seton 5, we sow te lulton results by plottng te vlues resultng from e lterntve nd we sow te dfferene between te two. Fnlly, n seton 6, we propose some tops for furter nvestgton, nd we onlude n seton 7.. BAKGROUND AND MOTIVATION Te errl memory ess tme ws studed by severl reserers but ll te prevous pproes to model nd optmze te ess tme were lmted. Te lmttons re te result eter from te dependene of te models on te pplton or from te lmttons of te nlytl model tt n not represent te deep erres. For exmple, Blsubrmonn et l. expln tt te reent memory erry orgnztons do not mt te ppltons requrements w results n degrdton n te performne []. Jn et l. develop lmted nlytl model tt ptures only two-level e [3], but we see n ter work bg dsrepny between te predted nd mesured memory performne. Most reserers foused on two-level memory s sown n rtles [8] nd [9] nd we don t see ny work tt foused enoug on deep memory erres. None of te prevous reserers tlked bout te vrne of te ess tme of te memory erry. Ts vrne s of prmry mportne beuse g vrne n te ess tme
2 orresponds to ger mss rto nd unexpeted dely - w s undesrble. In prevous work [4], we ve sown tt te ess tme for errl memory wt n nfnte dept s power tled []. In ts pper, we expnd our prevous work nd work on optmzng te memory desgn by tryng to buld memory wt mnml response tme nd mntnng mnml ost. We lso sow nlytlly te use of dsrepny between te nlytl nd mesured vlues for prevous reserers. Our Model s bsed on Mrkov n nlyss w s ndependent of te dstrbuton of memory request tt depends on te pplton. We onsder errl memory tt onssts of L levels nd lowest memory level m s sown n fgure. We model ts erry n stte dgrm s sown n fgure. E pysl memory level,, n fgure orresponds to two sttes n fgure : Te upper stte orresponds to te lookup tme wle te lower stte orresponds to te memory ess tme. Te frst stte orresponds to te memory request from te proessor wle te lst stte orresponds to te lowest memory n te erry. PU Aess Tme t rto n every level nd te ess tme T t every stte. Ts errl memory system s M/G/ queue. In order to buld te lner lgebr model for ts system [], we defne te followng terms: X s te rndom vrble representng te system tme tt orresponds to te totl memory ess tme troug ll memory stges. P s te sub-stost mtrx tt orresponds to te trnston from one stte to noter one. p s te entrne vetor tt orresponds to te stte of te system wen t te frst memory request. p s row vetor of sze L +, were L s te number of ntermedte levels. ε s te unt olumn vetor of sze L +. M s te trnston rte mtrx; t orresponds to te rtes of levng e stte. M s dgonl mtrx of te sme sze s P. I s te dentty mtrx of te sme dmenson s P nd M. B M(I P) Level T V B - s te nverse of B. Level Level l m T T l T m P l l Fgure. Herrl Memory Model: PU wt L ntermedte levels of memory nd mn memory m. - T - (-) T (l-) T l- T T T l Fgure. Stte dgrm of errl memory system wt L ntermedte levels: Intermedte memory levels re represented by two sttes. Te fgure sows te l l l - l M T T 0 0 T m ε We ve sown n [4] tt te memory ess tme s gven by te frst moment of V nd t s ndependent of te dstrbuton of bot te memory ess request (w s dependent on te ompler) nd te serve tme of te nodes (w depend on te rdwre speftons of te memory levels). Te men memory ess tme s gven by: E( X ) x p Vε ()
3 However te vrne of te ess tme s dependent on te dstrbuton of te serve tme of te memory nodes. It s dependent on te frst nd seond moments of V. For exponentl dstrbutons, t s gven by: σ p V ε - (pvε ) () ex For non-exponentl dstrbutons, te vrne s gven by: σ σ + p V T Γ ε X ex Were Γ dg( v-, v-,, vl-) Were v E X of stte n Fg.. ( ) x x s te oeffent of vrton In n pplton tt s multple onseutve memory requests lke dtbse pplton for exmple, te memory requests wll be queued nd must wt to get serve from busy memory, so neter te prevous models nor te bove model wll be suffent to predt te ext tme. Tus we use te P-K formul n te next prgrp to fnd te ext queung tme. 3. THE P-K FORMULA Te Pollzek-Kntne formul (lled P-K formul) [7] gves te expeted verge number of ustomers n queue nd n proess n M/G/ queues. Te P-K formul ws ombned wt Lttle s teorem [] to sow tt te men tme spent by ustomer n n M/G/ queue s gven by: Were, x xρ T + ρ ρ s oeffent of vrton, ρ s te utlzton ftor, nd λ s te rrvl rte. ρ λ x, σ ex, In ts pper we use equton (3) to predt te queung tme for our errl memory system sown n fgure w beomes s sown n fgure 3. Te queung ours wen we ve system wt multple onseutve memory requests tt n not be essed by te sequentl memory t te sme tme, so te memory requests re buffered n queue; ts n be te se of sred memory on prllel mne, smple dtbse ess pplton, or ppelned PU. In te lst two ses te queung uses bottlenek nd ffets te performne of te system beuse t nreses te PI n ppelned proessor [9] x (3) nd nreses te query exeuton tme n dtbse pplton [0]. Te vrne of te queung tme of te model sown n fgure 3 s te sme s tt of te model sown n te prevous prgrp w s sown n equton (). It s obvous from bot equtons () nd (3) tt te men memory ess tmes depend on severl prmeters nludng t rto nd ess tme T t e memory level. λ T T T l Fgure 3. Queung dgrm of errl memory system wt L ntermedte levels: Now te rrvng memory requests rrve wt rte λ nd re queued before te PU. 4. SAMPLE ASES FOR TEST AND EVALUATION In order to sow te dfferene between te men memory ess tme n equton () nd te men queung tme for memory nput/output requests n equton (3), we pply equtons () nd (3) to severl ses ten ompre te results for e se. Our m s to sow tt te men ess tme s not te sme for bot metods nd s dfferent mnm. We suppose tt we ve errl memory system we re buldng nd we ssume tt te system s ost. Przybylsk [] used Agrwl s e mss model [] to sow tt te e mss rto s nversely proportonl to ts sze; so te t rto of e memory level, w s te probblst omplement of te mss rto, s proportonl too to te nverse of ts sze nd tus ts ost. But extendng ts observton to mult-level memory s lttle omplted nd requres more lultons; so we defne te followng prmeters for te system n Fg.: s te probblty of fndng dt n te ntermedte memory level. S s te sze of e ntermedte memory level. s te ost per unt of sze of e ntermedte memory level. β, were β s onstnt. S - T - (-) T (l-) T l- Te totl ost of te L-levels errl system beomes: L S (4) l l l - l m
4 4.. TWO-LEVEL ASH MEMORY SYSTEM We frst onsder te -level s memory system sown n fgure 4. - T T 3 - T 5 - l- - 3 We defne te followng terms: 3 m S s te sze of memory level, M s te ost per unt of sze of memory level, M S s te sze of memory level, M s te ost per unt of sze of memory level, M Y s te rndom vrble representng te probblty of fndng dt n memory level M M Fgure 4. Stte dgrm of two-level s memory: In ts fgure we dstngus between te memory t rto nd te probblty of fndng dt n e level. We nme te frst level M nd te seond level M. Pr( Y M / Y M) Pr( Y M ) T - T 3 3 Pr( Y M M ) Pr( Y M ) ( ) ( ) Pr( Y M / Y M) Were, nd re respetvely te t rtos of memory level nd memory level. Te ost of ts system s gven by: S S + S (5) T T THREE-LEVEL ASH MEMORY SYSTEM Ten we onsder te 3-level s memory system sown n Fg.5. - m l T T 4 T 6 M M M 3 Fgure 5. Stte dgrm of tree-level s memory: In ts fgure we dstngus between te memory t rto nd te probblty of fndng dt n e level. We nme te frst level M, te seond level M, nd te trd one M 3. Agn we defne te followng terms: S s te sze of memory level, M s te t rto t memory level, M, Y M Y M Pr( / ) s te ost per unt of sze of memory level, M s te ost per unt of sze of memory level, M b s te ost per unt of sze of memory level 3, M 3 Y s te rndom vrble representng te probblty of fndng dt n memory level We lso defne te followng probbltes: H H b Pr( Y M ) Pr( Y M ) Pr( Y M ) Pr( Y M ) 3 3 H Pr( Y M ) 3 3 We n proof by smple lulton tt te t rtos re gven by: H H H b HbH( H ) H H H b H( Hb) 3 H H b Te ost of te memory system s gven by: S S + S + S (6) b 3 It s ler from equtons () nd (3) nd from te bove dervtons n ts seton tt te men tme s funton of te t rto nd sze of e ntermedte level, so to optmze
5 te men ess tme, we wll ve to optmze () nd (3) versus tese prmeters. For te two systems we sow ere, we suppose tt we ve onstnt ost nd we try to optmze te ntermedte memory ost nd sze to get te fstest possble desgn s sown n te next seton. 5. ALULATIONS AND RESULTS Now tt we ve te nlytl model to lulte te memory ess tme nd queung tme, we wrote Mtlb ode to mplement our equtons nd to verfy tt wt we mentoned s urte. We ve rred out n exustve set of progrm runs over severl prmeters. Sne te results re onsstent wt e oter we present only few ere. but fnsng too erly s lso undesrble beuse we wste our memory resoures. We remrk ere tt, wle te memory tme s onvex bevor, te vrne dereses s we nrese te memory sze nd ts s norml beuse t depends on te seond moment of te memory ess tme [4] w nreses fster s te memory sze nreses. To empsze more on te dfferene between E(X) nd E(T), we lulte te dfferene between te vlue of te mnmum of E(T) nd te vlue of X t te sme vlue of S. We ll ts dfferene DffT. We plot DffT versus te nput rte λ n fgure 8. We selet te vlues of λ to keep te system utlzton ρ ftor between zero nd one []. We frst onsder te -Level memory system n fgure 4 nd we ssume tt t s n rbtrry fxed ost. To study te men response tme versus S, te sze of memory level, we ssume tt S s n n rbtrry ntervl (4.4<S<7.8). So S, te sze of memory level, wll be gven by dret dervton from Equton (5): S S We plot bot te men memory tme, E(x), nd te queung tme, E(T), versus te sze of te level memory n fgure 6. We remrk tt tey ve dfferent mnm - w onfrms our ssumpton bout te dfferene between tem. Fgure 7. Vrne of te memory ess tme versus te sze S of te Level memory, M, for -Level errl memory system. Te vrne dereses s te memory sze nreses. Fgure 6. Men memory ess tme E(X) nd men queung tme E(T) versus te sze S of te Level memory, M, for -Level errl memory system. E(x) s ts mnmum for S 6.4, wle E(T) s ts mnmum for S 6.8 Ten we plot te vrne of te memory ess tme obtned from equton () for te two-level memory system n fgure 7. Te bevor of te vrne s s mportnt s tt of te men memory tme nd queung tme beuse t uses devton from te men tme. Devton from te e sde of te men tme s undesrble: fnsng too lte s obvously undesrble beuse t n drmtlly ffet te performne (lke nresng te PI n ppelned proessor for exmple), Fgure 8. Dfferene between Mn(T) nd te vlue of X for te sme vlue of S for dfferent vlues of nput rte λ, for - Level errl memory system. We remrk n fgure 8 tt te dfferene s more sgnfnt s te trff nput rte nd system utlzton nreses. Ts vlue goes up to.5 % of te mnmum vlue of te men tme for utlzton ftor lose to.
6 To sow tt our results re ndependent of te number of level n errl memory, we repet wt we dd for te -level s memory to te 3-level s memory sown n fgure 5. Now te system s more omplted beuse we ve more vrbles. Here too, we ssume tt te system s n rbtrry ost nd we ssume tt S nd S 3, te szes of te seond nd trd memory levels, re n rbtrry ntervls (<S <6 nd 6<S 3 <8). So, S, te sze of memory level, wll be gven by dret dervton from Equton (6): bs S S 3 We plot bot te men memory tme, E(x), nd te queung tme, E(T), versus te szes of te memory levels nd 3 n fgure 9. We remrk ere too tt bot surfes re smlr nd tey ve dfferent mnm. sze of te upper level. If we ompre fgure to fgure 7, we remrk te vrne s ger n fgure w mens tt ddng one more level to te erry nreses te vrne nd ts observton s very mportnt beuse te omputer rtet must tke t nto onsderton wen desgnng systems senstve to te vrne. Fgure 0. Dfferene between Mn(T) nd te vlue of X for te sme vlue of S for dfferent vlues of nput rte λ, for 3- Level errl memory system. Fgure 9. Men memory ess tme E(X) nd men queung tme E(T) versus te szes of memory levels nd 3 for 3-Level errl memory system. Bot surfes look onve. E(x) s ts mnmum of.59 for S 4.5 nd S 3 6, wle E(T) s ts mnmum of 3.68 for S 4.75 nd S 3 6. Te plot of te dfferene between te vlue of te mnmum of E (T) nd te vlue of X versus λ n fgure 0 sows ere more sgnfnt dfferene equl to % of te mnml vlue of te memory ess tme. Ts dfferene explns te dfferene between te predted nd mesured performne tt Jn et l. get n ter pper bout performne predton on sred memory progrms (3) n effet te utors tere lulte te men ess tme wle te vlues tey mesure re tose of te queung tme, ts s wy tey get 0% dfferene! Fnlly to ompre te performne of te two memory systems we plot te vrne of te memory ess tme for te tree-level memory system n fgure. We remrk n fgure tt te vrne s more senstve to te upper level memory nd t dereses fster s we nrese Sb, te Fgure. Vrne of te memory ess tme versus te szes of te ntermedte Levels for 3-Level errl memory system. Te vrne dereses s te memory szes nreses. 6. FUTURE WORK Ts pper s prt of lrger work exmnng performne of errl memory systems wt bot nlytl nd smulton tenques. Tere re mny tops we re eter lredy nvestgtng or ope to nvestgte soon. We ntend to vldte our performne model by omprng te predted ess tmes gnst exeuton tmes mesured on rel mnes by usng benmrks. We re lso plnnng to study te bevor of vrne of te memory ess tme more n dept for bot te exponentl nd non exponentl ses. We re workng rgt now on proofng te onvexty of te men tmes obtned n equtons () nd (3) nd we re plnnng to
7 pply severl optmzton tenques on equton (3) to optmze te desgn of mult-level errl memores versus to ome out wt te fstest possble ost-effetve system. 7. ONLUSION We ve developed n nlytl model to evlute te men nd vrne of te ess tme for memory requests n errl mult-level memory envronment. We ve sown nd explned te dfferene between te men memory ess tme nd te memory requests queung tme. Ts dfferene explns te dsrepny between te nlytl vlues nd te prtl vlues obtned by prevous reserers. We ve lso sown te bevor of te vrne of te ess tme s we nrese te levels nd dd more levels to te errl memory system: Inresng te sze of memory redues te vrne; owever ddng more levels nreses t. Our observton elps te desgner dede weter to use bgger levels of memores or use more levels n s desgn. Our nlytl model sown n equton (3), s unversl model nd n represent deep memory erres tt extend beyond te onept of lol mne storge to network storge. Ts model uses Mrkov n nlyss nd n tke dfferent types of memory request dstrbutons. Our model s lso del for optmzton beuse t n tke dfferent nputs lke te t rto, sze, ost nd speed prmeters of te ntermedte memory level. Ts flexblty of tkng dfferent prmeters mkes t esy to expnd nd pture ny level of erry. [7] Dnel P Heymn nd Mttew J Sobel, Stost Models n Opertons Reser: Stost Proesses nd Opertng rtersts, ourer Dover Publtons, 004 [8] A. Smt, e Memores, omputng Surveys, 4(3): p , 98. [9] A. Smt, Dsk e-mss rto nlyss nd desgn onsdertons. AM Trnston on omputer Systems, 3(3), p 6-03, 985. [0] I. MIntyre nd B. Press, Te Effet of e on te Performne of Mult-Treded Ppelned RIS Proessor, te Engneerng Insttute of nd, 99. [] S. Mnegold, P. Bonz, nd M. Kersten, Gener Dtbse ost Models for Herrl Memory Systems, Proeedngs of te 8t VLDB onferene, Hong Kong, n, 00. [] S. Przybylsk, e nd Memory Desgn: A Performne-Dreted Appro, Morgn Kufmnn Publsers, 990. [] A. Agrwl, Anlyss of e Performne for Opertng Systems nd Multprogrmmng, P.D. tess, Stnford unversty, My 987. [3] R. Jn nd G. Agrwl, Performne Predton for Rndom Wrte Redutons: A se Study n Modelng Sred Memory Progrms, Proeedngs of te 00 AM SIGMETRIS nterntonl onferene on Mesurement nd modelng of omputer systems, Mrn Del Rey, lforn p 7-8 REFERENES [] Lester Lpsky, Queueng Teory - A Lner Algebr Appro, Mxwell Mmlln Interntonl publsng group, 99. [] Rjeev Blsubrmonn, Dvd Albonesz, Alper Buyuktosunoglu, nd Sndy Dwrkds, Dynm Memory Herry Performne Optmzton, 7 t nterntonl symposum on omputer rteture, June 000. [3] Ruomng Jn, Ggn Agrwl, Performne Predton for Rndom Wrte Redutons: A se Study n Modelng Sred Memory Progrms, Proeedngs of te 00 AM SIGMETRIS nterntonl onferene on Mesurement nd modelng of omputer systems, Mrn Del Rey, lforn, pges: 7 8, 00. [4] Ksor M. Konwr Lester Lpsky Mrwn Slemn, Moments of Memory Aess Tme for Systems Wt Herrl Memores, st Interntonl onferene on omputers nd Ter Appltons (ATA-006), Settle WA, Mr 006. [5] rstn Hrste, Dnel Lenosk, nd Jon Keen. Mesurng Memory Herry Performne of e- oerent Multproessors Usng Mro Benmrks. Proeedngs of S 97, 997. [6] Jon Wllm Togo, Te Holy Grl of Network Storge Mngement, Prente Hll, 004
Performance Modeling of Hierarchical Memories
Performane Modelng of Herarhal Memores Marwan Sleman, Lester Lpsky, Kshor Konwar Department of omputer Sene and Engneerng Unversty of onnetut Storrs, T 0669-55 Emal: {marwan, lester, kshor}@engr.uonn.edu
More informationEffectiveness and Efficiency Analysis of Parallel Flow and Counter Flow Heat Exchangers
Interntonl Journl of Applton or Innovton n Engneerng & Mngement (IJAIEM) Web Ste: www.jem.org Eml: edtor@jem.org Effetveness nd Effeny Anlyss of Prllel Flow nd Counter Flow Het Exngers oopes wr 1, Dr.Govnd
More informationM/G/1/GD/ / System. ! Pollaczek-Khinchin (PK) Equation. ! Steady-state probabilities. ! Finding L, W q, W. ! π 0 = 1 ρ
M/G//GD/ / System! Pollcze-Khnchn (PK) Equton L q 2 2 λ σ s 2( + ρ ρ! Stedy-stte probbltes! π 0 ρ! Fndng L, q, ) 2 2 M/M/R/GD/K/K System! Drw the trnston dgrm! Derve the stedy-stte probbltes:! Fnd L,L
More informationDennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1
Denns Brcker, 2001 Dept of Industrl Engneerng The Unversty of Iow MDP: Tx pge 1 A tx serves three djcent towns: A, B, nd C. Ech tme the tx dschrges pssenger, the drver must choose from three possble ctons:
More informationME 501A Seminar in Engineering Analysis Page 1
More oundr-vlue Prolems nd genvlue Prolems n Os ovemer 9, 7 More oundr-vlue Prolems nd genvlue Prolems n Os Lrr retto Menl ngneerng 5 Semnr n ngneerng nlss ovemer 9, 7 Outlne Revew oundr-vlue prolems Soot
More informationTELCOM 2130 Time Varying Queues. David Tipper Associate Professor Graduate Telecommunications and Networking Program University of Pittsburgh Slides 7
TELOM 3 Tme Vryng Queues Dvd Tpper Assote Professor Grdute Teleommuntons nd Networkng Progrm Unversty of Pttsburgh ldes 7 Tme Vryng Behvor Teletrff typlly hs lrge tme of dy vrtons Men number of lls per
More informationRank One Update And the Google Matrix by Al Bernstein Signal Science, LLC
Introducton Rnk One Updte And the Google Mtrx y Al Bernsten Sgnl Scence, LLC www.sgnlscence.net here re two dfferent wys to perform mtrx multplctons. he frst uses dot product formulton nd the second uses
More informationChapter Runge-Kutta 2nd Order Method for Ordinary Differential Equations
Cter. Runge-Kutt nd Order Metod or Ordnr Derentl Eutons Ater redng ts cter ou sould be ble to:. understnd te Runge-Kutt nd order metod or ordnr derentl eutons nd ow to use t to solve roblems. Wt s te Runge-Kutt
More informationPrinciple Component Analysis
Prncple Component Anlyss Jng Go SUNY Bufflo Why Dmensonlty Reducton? We hve too mny dmensons o reson bout or obtn nsghts from o vsulze oo much nose n the dt Need to reduce them to smller set of fctors
More informationApplied Statistics Qualifier Examination
Appled Sttstcs Qulfer Exmnton Qul_june_8 Fll 8 Instructons: () The exmnton contns 4 Questons. You re to nswer 3 out of 4 of them. () You my use ny books nd clss notes tht you mght fnd helpful n solvng
More informationConcept of Activity. Concept of Activity. Thermodynamic Equilibrium Constants [ C] [ D] [ A] [ B]
Conept of Atvty Equlbrum onstnt s thermodynm property of n equlbrum system. For heml reton t equlbrum; Conept of Atvty Thermodynm Equlbrum Constnts A + bb = C + dd d [C] [D] [A] [B] b Conentrton equlbrum
More informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vrtonl nd Approxmte Methods n Appled Mthemtcs - A Perce UBC Lecture 4: Pecewse Cubc Interpolton Compled 6 August 7 In ths lecture we consder pecewse cubc nterpolton n whch cubc polynoml
More informationINSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING Dundgl, Hyderbd - 5 3 FRESHMAN ENGINEERING TUTORIAL QUESTION BANK Nme : MATHEMATICS II Code : A6 Clss : II B. Te II Semester Brn : FRESHMAN ENGINEERING Yer : 5 Fulty
More informationAbhilasha Classes Class- XII Date: SOLUTION (Chap - 9,10,12) MM 50 Mob no
hlsh Clsses Clss- XII Dte: 0- - SOLUTION Chp - 9,0, MM 50 Mo no-996 If nd re poston vets of nd B respetvel, fnd the poston vet of pont C n B produed suh tht C B vet r C B = where = hs length nd dreton
More information523 P a g e. is measured through p. should be slower for lesser values of p and faster for greater values of p. If we set p*
R. Smpth Kumr, R. Kruthk, R. Rdhkrshnn / Interntonl Journl of Engneerng Reserch nd Applctons (IJERA) ISSN: 48-96 www.jer.com Vol., Issue 4, July-August 0, pp.5-58 Constructon Of Mxed Smplng Plns Indexed
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson
More informationVariable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia
Vrble tme mpltude mplfcton nd quntum lgorthms for lner lgebr Andrs Ambns Unversty of Ltv Tlk outlne. ew verson of mpltude mplfcton;. Quntum lgorthm for testng f A s sngulr; 3. Quntum lgorthm for solvng
More informationCENTROID (AĞIRLIK MERKEZİ )
CENTOD (ĞLK MEKEZİ ) centrod s geometrcl concept rsng from prllel forces. Tus, onl prllel forces possess centrod. Centrod s tougt of s te pont were te wole wegt of pscl od or sstem of prtcles s lumped.
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationGravity Drainage Prior to Cake Filtration
1 Gravty Dranage Pror to ake Fltraton Sott A. Wells and Gregory K. Savage Department of vl Engneerng Portland State Unversty Portland, Oregon 97207-0751 Voe (503) 725-4276 Fax (503) 725-4298 ttp://www.e.pdx.edu/~wellss
More informationRemember: Project Proposals are due April 11.
Bonformtcs ecture Notes Announcements Remember: Project Proposls re due Aprl. Clss 22 Aprl 4, 2002 A. Hdden Mrov Models. Defntons Emple - Consder the emple we tled bout n clss lst tme wth the cons. However,
More informationGAUSS ELIMINATION. Consider the following system of algebraic linear equations
Numercl Anlyss for Engneers Germn Jordnn Unversty GAUSS ELIMINATION Consder the followng system of lgebrc lner equtons To solve the bove system usng clsscl methods, equton () s subtrcted from equton ()
More informationOnline Appendix to. Mandating Behavioral Conformity in Social Groups with Conformist Members
Onlne Appendx to Mndtng Behvorl Conformty n Socl Groups wth Conformst Members Peter Grzl Andrze Bnk (Correspondng uthor) Deprtment of Economcs, The Wllms School, Wshngton nd Lee Unversty, Lexngton, 4450
More information4. Eccentric axial loading, cross-section core
. Eccentrc xl lodng, cross-secton core Introducton We re strtng to consder more generl cse when the xl force nd bxl bendng ct smultneousl n the cross-secton of the br. B vrtue of Snt-Vennt s prncple we
More informationMath Week 5 concepts and homework, due Friday February 10
Mt 2280-00 Week 5 concepts nd omework, due Fridy Februry 0 Recll tt ll problems re good for seeing if you cn work wit te underlying concepts; tt te underlined problems re to be nded in; nd tt te Fridy
More informationAn Adaptive Control Algorithm for Multiple-Input Multiple-Output Systems Using Neural Networks
An Adptve Control Algorthm for Multple-Input Multple-Output Systems Usng Neurl Networks JOSE NORIEGA Deprtmento de Investgón en Fís Unversdd de Sonor Rosles y Blvd. Lus Enns, Col. Centro, CP, Hllo, Son.
More informationDynamic Power Management in a Mobile Multimedia System with Guaranteed Quality-of-Service
Dynmc Power Mngement n Moble Multmed System wth Gurnteed Qulty-of-Servce Qnru Qu, Qng Wu, nd Mssoud Pedrm Dept. of Electrcl Engneerng-Systems Unversty of Southern Clforn Los Angeles CA 90089 Outlne! Introducton
More informationKULLBACK-LEIBLER DISTANCE BETWEEN COMPLEX GENERALIZED GAUSSIAN DISTRIBUTIONS
0th Europen Sgnl Proessng Conferene (EUSIPCO 0) uhrest, Romn, August 7-3, 0 KULLACK-LEILER DISTANCE ETWEEN COMPLEX GENERALIZED GAUSSIAN DISTRIUTIONS Corn Nfornt, Ynnk erthoumeu, Ion Nfornt, Alexndru Isr
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter 0.04 Newton-Rphson Method o Solvng Nonlner Equton Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson
More informationDefinition of Tracking
Trckng Defnton of Trckng Trckng: Generte some conclusons bout the moton of the scene, objects, or the cmer, gven sequence of mges. Knowng ths moton, predct where thngs re gong to project n the net mge,
More informationModeling uncertainty using probabilities
S 1571 Itroduto to I Leture 23 Modelg uertty usg probbltes Mlos Huskreht mlos@s.ptt.edu 5329 Seott Squre dmstrto Fl exm: Deember 11 2006 12:00-1:50pm 5129 Seott Squre Uertty To mke dgost feree possble
More informationORDINARY DIFFERENTIAL EQUATIONS
6 ORDINARY DIFFERENTIAL EQUATIONS Introducton Runge-Kutt Metods Mult-step Metods Sstem o Equtons Boundr Vlue Problems Crcterstc Vlue Problems Cpter 6 Ordnr Derentl Equtons / 6. Introducton In mn engneerng
More informationShuai Dong. Using Math and Science to improve your game
Computtonl phscs Shu Dong Usng Mth nd Sene to mprove our gme Appromton of funtons Lner nterpolton Lgrnge nterpolton Newton nterpolton Lner sstem method Lest-squres ppromton Mllkn eperment Wht s nterpolton?
More informationLecture 7 Circuits Ch. 27
Leture 7 Cruts Ch. 7 Crtoon -Krhhoff's Lws Tops Dret Current Cruts Krhhoff's Two ules Anlyss of Cruts Exmples Ammeter nd voltmeter C ruts Demos Three uls n rut Power loss n trnsmsson lnes esstvty of penl
More informationReducing the Computational Effort of Stochastic Multi-Period DC Optimal Power Flow with Storage
Redung the Computtonl Effort of Stohst Mult-Perod DC Optml Power Flow wth Storge Olver Mégel Görn Andersson Power Systems Lbortory ETH Zürh Zürh, Swtzerlnd {megel, ndersson}@eeh.ee.ethz.h Johnn L. Mtheu
More informationThe Schur-Cohn Algorithm
Modelng, Estmton nd Otml Flterng n Sgnl Processng Mohmed Njm Coyrght 8, ISTE Ltd. Aendx F The Schur-Cohn Algorthm In ths endx, our m s to resent the Schur-Cohn lgorthm [] whch s often used s crteron for
More information13 Design of Revetments, Seawalls and Bulkheads Forces & Earth Pressures
13 Desgn of Revetments, Sewlls nd Bulkheds Forces & Erth ressures Ref: Shore rotecton Mnul, USACE, 1984 EM 1110--1614, Desgn of Revetments, Sewlls nd Bulkheds, USACE, 1995 Brekwters, Jettes, Bulkheds nd
More informationCOMP4630: λ-calculus
COMP4630: λ-calculus 4. Standardsaton Mcael Norrs Mcael.Norrs@ncta.com.au Canberra Researc Lab., NICTA Semester 2, 2015 Last Tme Confluence Te property tat dvergent evaluatons can rejon one anoter Proof
More informationMathematically, integration is just finding the area under a curve from one point to another. It is b
Numerl Metods or Eg [ENGR 9] [Lyes KADEM 7] CHAPTER VI Numerl Itegrto Tops - Rem sums - Trpezodl rule - Smpso s rule - Rrdso s etrpolto - Guss qudrture rule Mtemtlly, tegrto s just dg te re uder urve rom
More informationINTRODUCTION TO COMPLEX NUMBERS
INTRODUCTION TO COMPLEX NUMBERS The numers -4, -3, -, -1, 0, 1,, 3, 4 represent the negtve nd postve rel numers termed ntegers. As one frst lerns n mddle school they cn e thought of s unt dstnce spced
More informationUNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II
Mcroeconomc Theory I UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS MSc n Economcs MICROECONOMIC THEORY I Techng: A Lptns (Note: The number of ndctes exercse s dffculty level) ()True or flse? If V( y )
More informationMachine Learning: and 15781, 2003 Assignment 4
ahne Learnng: 070 and 578, 003 Assgnment 4. VC Dmenson 30 onts Consder the spae of nstane X orrespondng to all ponts n the D x, plane. Gve the VC dmenson of the followng hpothess spaes. No explanaton requred.
More informationSection 2.1 Special Right Triangles
Se..1 Speil Rigt Tringles 49 Te --90 Tringle Setion.1 Speil Rigt Tringles Te --90 tringle (or just 0-60-90) is so nme euse of its ngle mesures. Te lengts of te sies, toug, ve very speifi pttern to tem
More informationStatic Surface Forces. Forces on Plane Areas: Horizontal surfaces. Forces on Plane Areas. Hydrostatic Forces on Plane Surfaces
Hdrostti ores on Plne Surfes Stti Surfe ores ores on lne res ores on urved surfes Buont fore Stbilit of floting nd submerged bodies ores on Plne res Two tes of roblems Horizontl surfes (ressure is ) onstnt
More informationAnalysis of Variance and Design of Experiments-II
Anly of Vrne Degn of Experment-II MODULE VI LECTURE - 8 SPLIT-PLOT AND STRIP-PLOT DESIGNS Dr Shlbh Deprtment of Mthemt & Sttt Indn Inttute of Tehnology Knpur Tretment ontrt: Mn effet The uefulne of hvng
More informationMATHEMATICS PAPER & SOLUTION
MATHEMATICS PAPER & SOLUTION Code: SS--Mtemtis Time : Hours M.M. 8 GENERAL INSTRUCTIONS TO THE EXAMINEES:. Cndidte must write first is / er Roll No. on te question pper ompulsorily.. All te questions re
More informationQuiz: Experimental Physics Lab-I
Mxmum Mrks: 18 Totl tme llowed: 35 mn Quz: Expermentl Physcs Lb-I Nme: Roll no: Attempt ll questons. 1. In n experment, bll of mss 100 g s dropped from heght of 65 cm nto the snd contner, the mpct s clled
More informationLecture 22: Logic Synthesis (1)
Lecture 22: Logc Synthess (1) Sldes courtesy o Demng Chen Some sldes Courtesy o Pro. J. Cong o UCLA Outlne Redng Synthess nd optmzton o dgtl crcuts, G. De Mchel, 1994, Secton 2.5-2.5.1 Overvew Boolen lgebr
More informationChemical Reaction Engineering
Lecture 20 hemcl Recton Engneerng (RE) s the feld tht studes the rtes nd mechnsms of chemcl rectons nd the desgn of the rectors n whch they tke plce. Lst Lecture Energy Blnce Fundmentls F 0 E 0 F E Q W
More informationChapter Simpson s 1/3 Rule of Integration. ( x)
Cpter 7. Smpso s / Rule o Itegrto Ater redg ts pter, you sould e le to. derve te ormul or Smpso s / rule o tegrto,. use Smpso s / rule t to solve tegrls,. develop te ormul or multple-segmet Smpso s / rule
More informationStatistics 423 Midterm Examination Winter 2009
Sttstcs 43 Mdterm Exmnton Wnter 009 Nme: e-ml: 1. Plese prnt your nme nd e-ml ddress n the bove spces.. Do not turn ths pge untl nstructed to do so. 3. Ths s closed book exmnton. You my hve your hnd clcultor
More informationChemical Reaction Engineering
Lecture 20 hemcl Recton Engneerng (RE) s the feld tht studes the rtes nd mechnsms of chemcl rectons nd the desgn of the rectors n whch they tke plce. Lst Lecture Energy Blnce Fundmentls F E F E + Q! 0
More informationTrigonometry. Trigonometry. Solutions. Curriculum Ready ACMMG: 223, 224, 245.
Trgonometry Trgonometry Solutons Currulum Redy CMMG:, 4, 4 www.mthlets.om Trgonometry Solutons Bss Pge questons. Identfy f the followng trngles re rght ngled or not. Trngles,, d, e re rght ngled ndted
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationStatistics and Probability Letters
Sttstcs nd Probblty Letters 79 (2009) 105 111 Contents lsts vlble t ScenceDrect Sttstcs nd Probblty Letters journl homepge: www.elsever.com/locte/stpro Lmtng behvour of movng verge processes under ϕ-mxng
More informationMultivariate Ratio Estimator of the Population Total under Stratified Random Sampling
Open Journal of Statstcs, 0,, 300-304 ttp://dx.do.org/0.436/ojs.0.3036 Publsed Onlne July 0 (ttp://www.scrp.org/journal/ojs) Multvarate Rato Estmator of te Populaton Total under Stratfed Random Samplng
More information*GMT62* *20GMT6201* Mathematics. Unit T6 Paper 2 (With calculator) Higher Tier [GMT62] MONDAY 11 JUNE 3.00 pm 4.15 pm. 1 hour 15 minutes.
entre Numer ndidte Numer Mtemtis Generl ertifite Seondry Edution 0 Unit T6 Pper (Wit lultor) Higer Tier [GMT6] MONDAY JUNE 3.00 pm4.5 pm *GMT6* *GMT6* TIME our 5 minutes. INSTRUTIONS TO ANDIDATES Write
More informationKatholieke Universiteit Leuven Department of Computer Science
Updte Rules for Weghted Non-negtve FH*G Fctorzton Peter Peers Phlp Dutré Report CW 440, Aprl 006 Ktholeke Unverstet Leuven Deprtment of Computer Scence Celestjnenln 00A B-3001 Heverlee (Belgum) Updte Rules
More informationPythagorean Theorem and Trigonometry
Ptgoren Teorem nd Trigonometr Te Ptgoren Teorem is nient, well-known, nd importnt. It s lrge numer of different proofs, inluding one disovered merin President Jmes. Grfield. Te we site ttp://www.ut-te-knot.org/ptgors/inde.stml
More information1/4/13. Outline. Markov Models. Frequency & profile model. A DNA profile (matrix) Markov chain model. Markov chains
/4/3 I529: Mhne Lernng n onformts (Sprng 23 Mrkov Models Yuzhen Ye Shool of Informts nd omputng Indn Unversty, loomngton Sprng 23 Outlne Smple model (frequeny & profle revew Mrkov hn pg slnd queston Model
More informationJens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers
Jens Sebel (Unversty of Appled Scences Kserslutern) An Interctve Introducton to Complex Numbers 1. Introducton We know tht some polynoml equtons do not hve ny solutons on R/. Exmple 1.1: Solve x + 1= for
More informationPhysics 41 Chapter 22 HW Serway 7 th Edition
yss 41 apter H Serway 7 t Edton oneptual uestons: 1,, 8, 1 roblems: 9, 1, 0,, 7, 9, 48, 54, 55 oneptual uestons: 1,, 8, 1 1 Frst, te effeny of te automoble engne annot exeed te arnot effeny: t s lmted
More informationUsing the Econometric Models in Planning the Service of Several Machines at Random Time Intervals. Authors:
Usng the Econometrc Models n Plnnng the Servce of Severl Mchnes t Rndom Tme Intervls. Authors: ) Ion Constntn Dm, Unversty Vlh of Trgovste, Romn ) Mrce Udrescu, Unversty Artfex of Buchrest, Romn Interntonl
More informationNew Algorithms: Linear, Nonlinear, and Integer Programming
New Algorthms: ner, Nonlner, nd Integer Progrmmng Dhnnjy P. ehendle Sr Prshurmhu College, Tl Rod, Pune-400, Ind dhnnjy.p.mehendle@gml.om Astrt In ths pper we propose new lgorthm for lner progrmmng. Ths
More informationController Design for Networked Control Systems in Multiple-packet Transmission with Random Delays
Appled Mehans and Materals Onlne: 03-0- ISSN: 66-748, Vols. 78-80, pp 60-604 do:0.408/www.sentf.net/amm.78-80.60 03 rans eh Publatons, Swtzerland H Controller Desgn for Networed Control Systems n Multple-paet
More information12 Basic Integration in R
14.102, Mt for Economists Fll 2004 Lecture Notes, 10/14/2004 Tese notes re primrily bsed on tose written by Andrei Bremzen for 14.102 in 2002/3, nd by Mrek Pyci for te MIT Mt Cmp in 2003/4. I ve mde only
More informationStratified Extreme Ranked Set Sample With Application To Ratio Estimators
Journl of Modern Appled Sttstcl Metods Volume 3 Issue Artcle 5--004 Strtfed Extreme Rned Set Smple Wt Applcton To Rto Estmtors Hn M. Smw Sultn Qboos Unversty, smw@squ.edu.om t J. Sed Sultn Qboos Unversty
More informationVECTORS VECTORS VECTORS VECTORS. 2. Vector Representation. 1. Definition. 3. Types of Vectors. 5. Vector Operations I. 4. Equal and Opposite Vectors
1. Defnton A vetor s n entt tht m represent phsl quntt tht hs mgntude nd dreton s opposed to slr tht ls dreton.. Vetor Representton A vetor n e represented grphll n rrow. The length of the rrow s the mgntude
More informationDCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)
DCDM BUSINESS SCHOOL NUMEICAL METHODS (COS -8) Solutons to Assgnment Queston Consder the followng dt: 5 f() 8 7 5 () Set up dfference tble through fourth dfferences. (b) Wht s the mnmum degree tht n nterpoltng
More informationMATH 144: Business Calculus Final Review
MATH 144: Business Clculus Finl Review 1 Skills 1. Clculte severl limits. 2. Find verticl nd horizontl symptotes for given rtionl function. 3. Clculte derivtive by definition. 4. Clculte severl derivtives
More informationCENTROID (AĞIRLIK MERKEZİ )
CENTOD (ĞLK MEKEZİ ) centrod s a geometrcal concept arsng from parallel forces. Tus, onl parallel forces possess a centrod. Centrod s tougt of as te pont were te wole wegt of a pscal od or sstem of partcles
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More information1 Probability Density Functions
Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our
More informationElectromagnetism Notes, NYU Spring 2018
Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system
More informationCENTROID (AĞIRLIK MERKEZİ )
CENTOD (ĞLK MEKEZİ ) centrod s a geometrcal concept arsng from parallel forces. Tus, onl parallel forces possess a centrod. Centrod s tougt of as te pont were te wole wegt of a pscal od or sstem of partcles
More information6 Random Errors in Chemical Analysis
6 Rndom Error n Cheml Anl 6A The ture of Rndom Error 6A- Rndom Error Soure? Fg. 6- Three-dmenonl plot howng olute error n Kjeldhl ntrogen determnton for four dfferent nlt. Anlt Pree Aurte 4 Tle 6- Pole
More informationLecture Note 4: Numerical differentiation and integration. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 4: Numericl differentition nd integrtion Xioqun Zng Sngi Jio Tong University Lst updted: November, 0 Numericl Anlysis. Numericl differentition.. Introduction Find n pproximtion of f (x 0 ),
More informationName: SID: Discussion Session:
Nme: SID: Dscusson Sesson: hemcl Engneerng hermodynmcs -- Fll 008 uesdy, Octoer, 008 Merm I - 70 mnutes 00 onts otl losed Book nd Notes (5 ponts). onsder n del gs wth constnt het cpctes. Indcte whether
More informationPLEASE SCROLL DOWN FOR ARTICLE
Ths rtcle ws downloded by:ntonl Cheng Kung Unversty] On: 1 September 7 Access Detls: subscrpton number 7765748] Publsher: Tylor & Frncs Inform Ltd Regstered n Englnd nd Wles Regstered Number: 17954 Regstered
More informationChapter 5 Worked Solutions to the Problems
Mtemtis for Queenslnd, Yer Mtemtis, Grpis lultor ppro 00. Kiddy olger, Rex oggs, Rond Frger, Jon elwrd pter 5 Worked Solutions to te Problems Hints. Strt by writing formul for te re of tringle. Note tt
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationTopic 6b Finite Difference Approximations
/8/8 Course Instructor Dr. Rymond C. Rump Oice: A 7 Pone: (95) 747 6958 E Mil: rcrump@utep.edu Topic 6b Finite Dierence Approximtions EE 486/5 Computtionl Metods in EE Outline Wt re inite dierence pproximtions?
More informationMAT 1275: Introduction to Mathematical Analysis
1 MT 1275: Intrdutin t Mtemtil nlysis Dr Rzenlyum Slving Olique Tringles Lw f Sines Olique tringles tringles tt re nt neessry rigt tringles We re ging t slve tem It mens t find its si elements sides nd
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More informationLearning Enhancement Team
Lernng Enhnement Tem Worsheet: The Cross Produt These re the model nswers for the worsheet tht hs questons on the ross produt etween vetors. The Cross Produt study gude. z x y. Loong t mge, you n see tht
More information6.6 The Marquardt Algorithm
6.6 The Mqudt Algothm lmttons of the gdent nd Tylo expnson methods ecstng the Tylo expnson n tems of ch-sque devtves ecstng the gdent sech nto n tetve mtx fomlsm Mqudt's lgothm utomtclly combnes the gdent
More informationJean Fernand Nguema LAMETA UFR Sciences Economiques Montpellier. Abstract
Stochstc domnnce on optml portfolo wth one rsk less nd two rsky ssets Jen Fernnd Nguem LAMETA UFR Scences Economques Montpeller Abstrct The pper provdes restrctons on the nvestor's utlty functon whch re
More informationLogic effort and gate sizing
EEN454 Dgtal Integrated rcut Desgn Logc effort and gate szng EEN 454 Introducton hp desgners face a bewlderng arra of choces What s the best crcut topolog for a functon? How man stages of logc gve least
More informationCALIBRATION OF SMALL AREA ESTIMATES IN BUSINESS SURVEYS
CALIBRATION OF SMALL AREA ESTIMATES IN BUSINESS SURVES Rodolphe Prm, Ntle Shlomo Southmpton Sttstcl Scences Reserch Insttute Unverst of Southmpton Unted Kngdom SAE, August 20 The BLUE-ETS Project s fnnced
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationAcceptance Double Sampling Plan using Fuzzy Poisson Distribution
World Appled Scences Journl 6 (): 578-588, 22 SS 88-4952 DOS Publctons, 22 Acceptnce Double Smplng Pln usng Fuzzy Posson Dstrbuton Ezztllh Blou Jmkhneh nd 2 Bhrm Sdeghpour Gldeh Deprtment of Sttstcs, Qemshhr
More informationPartially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism
CS294-40 Lernng for Rootcs nd Control Lecture 10-9/30/2008 Lecturer: Peter Aeel Prtlly Oservle Systems Scre: Dvd Nchum Lecture outlne POMDP formlsm Pont-sed vlue terton Glol methods: polytree, enumerton,
More information8. INVERSE Z-TRANSFORM
8. INVERSE Z-TRANSFORM The proce by whch Z-trnform of tme ere, nmely X(), returned to the tme domn clled the nvere Z-trnform. The nvere Z-trnform defned by: Computer tudy Z X M-fle trn.m ued to fnd nvere
More informationMultireference Correlated Wavefunction Calculations and Reaction Flux Analyses of Methyl Ester Combustion
Multreferene Correlted Wvefunton Clultons nd Reton Flux Anlyses of Methyl Ester Combuston Tsz S. Chwee, Dvd Krsloff, Vtor yeyem, Tng Tn, Mhele Pvone, nd Emly A. Crter Deprtments of Chemstry, Cheml Engneerng,
More informationSolubilities and Thermodynamic Properties of SO 2 in Ionic
Solubltes nd Therodync Propertes of SO n Ionc Lquds Men Jn, Yucu Hou, b Weze Wu, *, Shuhng Ren nd Shdong Tn, L Xo, nd Zhgng Le Stte Key Lbortory of Checl Resource Engneerng, Beng Unversty of Checl Technology,
More information] dx (3) = [15x] 2 0
Leture 6. Double Integrls nd Volume on etngle Welome to Cl IV!!!! These notes re designed to be redble nd desribe the w I will eplin the mteril in lss. Hopefull the re thorough, but it s good ide to hve
More informationUsing a Farmer's Beta for Improved Estimation of Actual Production History (APH) Yields
CARD Workng Ppers CARD Reports nd Workng Ppers 3-005 Usng Frmer's Bet for Improved Estmton of Atul Produton Hstory (APH Yelds Mguel Crrqury Iow Stte Unversty, mguel@stte.edu Brue A. Bbok Iow Stte Unversty,
More informationDynamic Power Management in a Mobile Multimedia System with Guaranteed Quality-of-Service
Dynmc Power Mngement n Moble Multmed System wth Gurnteed Qulty-of-Servce Abstrct In ths pper we ddress the problem of dynmc power mngement n dstrbuted multmed system wth requred qulty of servce (QoS).
More information