Statistical Leakage and Timing Optimization for Submicron Process Variation

Size: px
Start display at page:

Download "Statistical Leakage and Timing Optimization for Submicron Process Variation"

Transcription

1 Statstcal Leakage and Tmng Optmzaton for Submcron Process araton Yuanln Lu and shwan. grawal uburn Unversty epartment of Electrcal and omputer Engneerng uburn, L 36849, US luyuanl@auburn.edu, vagrawal@eng.auburn.edu bstract Leakage power s becomng a domnant contrbutor to e total power consumpton and dual- assgnment s an cent technque to decrease leakage power, for whch ectve desgn meods have been proposed. However, due to e exponental relaton of subreshold current w process parameters, such as, e ectve gate leng, oxde ckness and dopng concentraton, process varatons can severely affect bo power and tmng yelds of e desgns obtaned by ose meods. n s paper, we propose a mxed nteger lnear programmng meod for dual- desgn at mnmzes e leakage power and crcut delay n a statstcal sense such at e mpact of process varaton on e respectve yelds s mnmzed. The expermental results show at 3% more leakage power reducton can be acheved by usng statstcal approach when compared w e determnstc approach.. ntroducton W e contnung trend n e MOS technology scalng, leakage power s becomng a domnant contrbutor to e total power consumpton. To reduce leakage power, many technques have been proposed, ncludng transstor szng, mult-, dual-, optmal standby nput vector selecton, dual-, transstor stackng, and body bas. ual- assgnment [-6, 7-9,, ] s an cent technque for leakage reducton. Tradtonal determnstc approaches for dual-reshold assgnment [-6,, ] to mnmze e leakage power utlze e tmng slack of noncrtcal pas to assgn hgh to some or all gates on ose pas to decrease e leakage. These approaches can be dvded nto two groups: heurstc algorms [-4] and lnear programmng [5, 6,, ]. Unlke a heurstc algorm at can only guarantee a locally optmal soluton, lnear programmng formulaton ensures a global optmzaton. However, e ncreased varaton of process parameters of nanoscale devces can cause a sgnfcant ncrease n e leakage current because of an exponental relaton between e leakage current and some key process parameters. Gate leakage s most senstve to e varaton n oxde ckness (T ox ). The subreshold current s extremely senstve to e varaton n oxde ckness (T ox ), ectve gate leng (L ) and dopng concentraton (N dop ). ompared w e gate leakage, e subreshold leakage s more senstve to parameter varatons []. Twenty percent varatons n ectve channel leng and oxde ckness can cause up to 3 and 5 tmes dfferences, respectvely, n e amount of subreshold leakage current. Gate leakage can have 8 tmes dfference due to a % varaton n oxde ckness. araton of process parameters not only affects e leakage current but also changes e gate delay, degradng eer one or bo, power and tmng yelds of an optmzed desgn. To mnmze e ect of process varaton, some technques [7-9] statstcally optmze e leakage power and crcut performance by dual- assgnment. Leakage current and delay are treated as random varables. dynamc programmng approach for leakage optmzaton by dual- assgnment has been proposed [7] usng two prunng crtera at stochastcally dentfy pareto-optmal solutons and prune e sub-optmal ones. noer approach [9] solves e statstcal leakage mnmzaton problem usng a eoretcally rgorous formulaton for dual- assgnment and gate szng. Our work s motvated by e above research. mxed nteger lnear programmng (MLP) model s proposed to mnmze leakage power w specfed tmng yeld under process varaton. Ths MLP meod s specfcally devsed w a set of constrants whose sze s lnear n e number of gates. lough eoretcal worst-case complexty of MLP s exponental, our expermental results show at actual complexty depends on e nature of e problem. To deal w e complextes of delay models and leakage calculaton, two look up tables for e nomnal delay and leakage current are pre-constructed for each cell. Ths greatly smplfes e optmzaton procedure. Expermental results show at 3% more reducton of leakage power can be acheved by usng e statstcal approach when e result s compared to a determnstc approach. Ths paper s organzed as follows. Secton presents a determnstc lnear programmng formulaton. Secton 3 onference Proceedngs: LS esgn - 6 Embedded Systems, January 7. opyrght 7 by The nsttute of Electrcal and Electroncs Engneers, nc. ll rghts Reserved.

2 dscusses e statstcal leakage and gate delay modelng, and proposes a statstcal lnear programmng meod for leakage mnmzaton under process varaton. n Secton 4, expermental results are presented and dscussed. concluson s gven n Secton 5.. etermnstc ual- LP n e determnstc approach, e delay and subreshold current of every gate are assumed to be fxed and wout any ect of e process parameter varaton. ascally, s type of meods can be dvded nto two groups: heurstc algorms [-4] and lnear programmng [5-6,, ]. Heurstc algorms gve a locally optmal soluton and lnear programmng formulaton ensures a globally optmum soluton. n LP at optmzes e leakage power and assgns dual- to gates n one step [, ] has an advantage over an teratve procedure [5], whch must assume power-delay senstvtes to be constants n a small range. Fgure gves e basc dea of e LP meod [, ] to mnmze total subreshold leakage whle keepng e crcut performance by dual- assgnment. subnom, Mnmze gate number Fgure. asc dea of LP for leakage mnmzaton Subject to T POk T k PO max Fgure. asc dea of usng LP to optmze leakage. Mnmze { subnom, L, + ( ) subnom, H, } Fgure. etaled determnstc LP formulaton for leakage mnmzaton. detaled verson for e LP formulaton s presented n Fgure. s an nteger at can only be eer or. value means at gate s assgned low, and means at gate s assgned hgh. T s e latest arrval tme at e output of gate. Each gate n e desgn lbrary w low and hgh reshold versons s characterzed for ts leakage n varous nput states and gate delay, whch also depends on e fanout number, usng Spce smulaton. 3. Statstcal ual- ssgnment Process varatons nclude nter-de and ntra-de varatons, or global and local varatons. For nter-de (-O) Subject to = nom, L, + ( ) nom, H, (-) T Tj + j fann of gate (-) = or (-3) T POk T max k PO (-4) varatons, e determnstc and statstcal approaches are exactly e same. Snce our objectve s to have a statstcal LP formulaton at enhances e determnstc approach to leakage optmzaton under process varatons, we gnore e nter-de varaton. n e remander of s paper, process varaton wll only mean ntra-de varaton. Leakage current s composed of reverse based PN juncton leakage, gate leakage and subreshold leakage. n a sub-mcron process, PN juncton leakage s much smaller an e oer two components. Gate leakage s most senstve to e varaton n T ox and changes n e gate leakage due to oer process parameter varatons can be gnored []. Furer, assumng T ox to be a well-controlled process parameter [4, 5], we gnore e gate leakage varaton n our desgn, focusng only on changes n e subreshold leakage due to process varaton. ue to e exponental relaton of subreshold current w process parameters, such as, e ectve gate leng, oxde ckness and dopng concentraton, process varaton can severely affect bo power and tmng yelds of a desgn obtaned by a determnstc meod. ecause fxed subreshold leakage and gate delay do not represent e real crcut condton, statstcal modelng should be used. Ths s dscussed next. 3. Statstcal Subreshold Leakage Modelng Subreshold current has an exponental relaton w e reshold voltage, whch n turn s a functon of oxde ckness, ectve channel leng, dopng concentraton, etc. T ox s a farly well-controlled process parameter and does not sgnfcantly nfluence subreshold leakage varaton [4, 5]. Therefore, we only consder varatons n L and N dop. The statstcal subreshold model can be wrtten as [5]: L, nom exp + c LL + c3, Ndop sub = sub () c Where, L s e change n e ectve channel leng due to e process varaton and,ndop s e change n e reshold voltage due to e random dstrbuton of dopng concentraton, N dop. o are random varables w a normal dstrbuton, N(,). Fttng parameters c, c and c 3 are determned from Spce smulaton. From equaton (), t s obvous at sub has a lognormal dstrbuton. The total leakage current n a crcut, whch s e sum of subreshold currents of ndvdual gates, has an approxmately lognormal dstrbuton. Rao et al. [5] use e central lmt eorem to estmate s lognormal dstrbuton by ts mean value w e assumpton at ere s a large number of gates n e crcut, whch ndeed s e case for most present day chps. Hence, e total leakage can be expressed as: onference Proceedngs: LS esgn - 6 Embedded Systems, January 7. opyrght 7 by The nsttute of Electrcal and Electroncs Engneers, nc. ll rghts Reserved.

3 sub, total= sub, E sub, = SL S subnom, () Where, S L = λ + λ L exp λ + 4 L L λ λ (3) λ 3 =, Ndop S exp (4) λ S L and S are scale factors ntroduced due to local varatons n L and,ndop. λ, λ and λ 3 are fttng parameters. For a gven process, L and,ndop are predetermned. Therefore, n our statstcal lnear programmng formulaton, e objectve functon s a sum of all nomnal subreshold leakage currents, multpled by scale factors, S L and S. 3. Statstc elay Modelng The determnstc gate delay s gven by [3]: dd (5) ( ) α dd where α equals.3 for e short channel model. Smlar to e subreshold current model, e devaton due to e process parameter varaton s also a consderaton n our statstcal delay model. The change of due to e varaton of process parameters can be expressed as [7]: = β (6) where s a process parameter, s e nomnal value of, and β s a constant for e specfc technology. To get an approxmated lnear relaton between and e varatons of e process parameters, equaton (5) s expanded nto a Taylor seres (7) n whch only e frst order term s retaned because hgher orders terms are relatvely small and can be gnored. (... d =,, ) + ( ) (7),,... d Let {,, 3 } = {L, T ox, N dop }. ombnng equatons (6) and (7), we get: L T N ox dop = nom, c c c 3 (8) L Tox Ndop where, c, c, and c 3 are senstvtes of gate delay w respect to e varaton of each process parameter and can be acqured from Spce smulaton. L, T ox and N dop are normal N(,) random varables. Therefore, n statstcal analyss, becomes a random varable, whch also has a normal dstrbuton. Let L T N ox dop = c + c + c3, (9) L Tox N dop r Equaton (8) becomes: ( r ) = + nom, () ecause r s a normal N(,) random varable,, e mean value of, s equvalent to nom, e nomnal delay of gate. 3.3 Statstcal ual- ssgnment LP n statstcal approach to mnmze leakage power by dual- assgnment (Fgure 3), e delay and subreshold current are bo random varables, and η s e expected tmng yeld. The power yeld s not consdered because n Secton 4 (Results) we wll fnd at e statstcal approach can get about 3% addtonal leakage power reducton for most crcuts compared to e determnstc approach. Mnmze Fgure 3. asc LP for statstcal dual- assgnment. n Fgure 3, T PO s e pa delay from prmary nput to e prmary output and s assumed to have a normal (Gaussan) dstrbuton N( TPO, TPO). nequalty () allows leakage to be optmzed w tmng yeld η and t can be expressed nto a lnear format by e percent pont functon Φ - [6]: T PO + sub, total () P T PO T max () Subject to ( ) η ( η) Tmax PO Φ (3) n statstcal lnear programmng (Fgure 4) all varables, except, are random varables w normal dstrbuton. omparng e determnstc LP (Fgure ) and statstcal LP (Fgure 4), we observe e followng dfferences: The determnstc gate delay n (-) s extended to (S-) and (S-) to get e mean and standard devaton of e statstcal delay. (-) s extended to to (S-3) rough (S-6) to get e mean and standard devaton of e statstcal arrval tme T at e output of gate. onference Proceedngs: LS esgn - 6 Embedded Systems, January 7. opyrght 7 by The nsttute of Electrcal and Electroncs Engneers, nc. ll rghts Reserved.

4 (-4) s updated to (S-8) to ensure certan tmng yeld under process varaton. Mnmze S L = S S L S Fgure 4. etaled formulaton of statstcal dual- assgnment LP. 3.4 Lnear pproxmatons n lnear programmng, all e expressons and constrants should be lnear functons. However, n statstcal analyss, some nonlnear operatons are present. We, erefore, use lnear approxmatons., = + Subject to f and are N(, ) random varables, en er sum also has a normal dstrbuton. dd s a lnear functon, but n statstcal analyss, to obtan e standard devaton, we must deal w = +, whch s a nonlnear operaton. onsderng, ( + ) { + ( ) H } subnom, L, subnom,, subnom, gate number + ( + ) one can fnd a lnear approxmaton [9, ]: gate number = + = k( + ) w k [,] ( ) nom, H nom, L, +, (S-O) = (S-) = (S-) r j fan n of gate (S-3) + T Tj Tj, = k( Tj + ) (S-4) temp + + 3, T (S-5) Tj T ( temp T T ) /3 Tj = (S-6) = or (S-7) k PO T POk + Φ ( η) Tmax PO (S-8) k M, = M(, ) f and are N(, ) random varables, does not necessarly have a normal dstrbuton [7, 8]. However, a normal approxmaton w followng mean and standard devaton has been used [9, ]: = max(, ) (4) { max( + 3, + 3 ) }/ 3 = (5) The error n s approxmaton has been shown to be small [9, ]. M, = M(+, +) Smlarly, for functon =Max(+,+), we use (6) and (7) to estmate e mean value and standard devaton of random varable. = max(, ) + (6) { max( + + 3, ) }/ 3 = (7) The above lnear approxmatons are used n our statstcal analyss to model e leakage optmzaton problem under process varaton by a lnear programmng formulaton. 4. Results We use e PTM 7nm MOS technology []. Low for NMOS and PMOS are. and -., respectvely. Hgh for NMOS and PMOS are.3 and -.34, respectvely. We regenerated e netlsts of SS 85 benchmark crcuts usng a cell lbrary n whch e maxmum gate fann s fve. Two look-up tables for nomnal gate delays and nomnal leakage currents, respectvely, for each type of cell were constructed usng Spce smulaton. program parsed e netlst and generated e constrant set for e PLE LP solver n e MPL software package []. PLE en gave e optmal assgnment as well as e mnmzed leakage current for e crcut. 4. omparson of Leakage Power Reducton by etermnstc and Statstcal Meods To compare e power optmzaton results of e statstcal LP w ose from e determnstc approach, we assume at all e gates have e same c, c and c 3 (senstvtes of gate delay to e varaton of dfferent process parameters) n equaton (8). Therefore, each gate has e same r. (= /u ). We assume t to be %. Ths assumpton s only for e smplcty and does not change e cacy of e statstcal approach. n Table, columns 4, 6 and 9 gve e optmzed leakage power by determnstc LP, by statstcal LP w 99% tmng yeld and by statstcal LP w 95% tmng yeld. onference Proceedngs: LS esgn - 6 Embedded Systems, January 7. opyrght 7 by The nsttute of Electrcal and Electroncs Engneers, nc. ll rghts Reserved.

5 Table. omparson of leakage power savng due to statstcal modelng w two dfferent tmng yelds (η). rcut etermnstc Optmzaton (η =%) Statstcal Optmzaton (η =99%) Statstcal Optmzaton (η =95%) Name # gates Unoptmzed Leakage Power (W) Optmzed Leakage Power (W) Run Tme (s) Optmzed Leakage Power (W) Extra Power Savng Run Tme (s) Optmzed Leakage Power (W) Extra Power Savng Run Tme (s) % % % % % % % % % % % % % % % % % %.58 verage of SS 85 benchmarks.4 9.% % 4.64 RM7 5.5k % % From Table, we see at compared to e determnstc meod, whch uses e fxed values, when we use statstcal models for gate delay and subreshold leakage current, SS85 benchmarks can acheve on average 9% greater leakage power savng w 99% tmng yeld and 4% greater power savng w 95% tmng yeld. The reason s at statstcal model has a more flexble optmzaton space, whle e determnstc approach assumes e worst case. For c499 and c355, whch have many crtcal pas due to er extremely symmetrcal crcut structures, e optmzaton space s lmted and erefore e addtonal power savng contrbuted by optmzaton s much smaller, especally w e hgher tmng yeld (99%). Normalzed Leakage Power etermnstc LP Statstcal LP ( 99% Tmng Yeld) Statstcal LP ( 95% Tmng Yeld) Normalzed Tmng Fgure 5. Power-delay curves of determnstc and statstcal approaches for 43. t s also obvous at w a decreased tmng yeld, hgher power savng can be acheved due to e relaxed tmng constrants, resultng n larger optmzaton space. Fgure 5 shows e power-delay curves for 43 for determnstc and statstcal approaches. The startng ponts of e ree curves, (,), (,.65) and (,.59), ndcate at f we can reduce e leakage power to some unt by determnstc approach,.65 unt and.59 unt leakage power can be acheved by usng statstc approach w 99% and 95% tmng yelds, respectvely. Lower e tmng yeld, hgher s power savng. W a furer relaxed T max, all ree curves wll gve more reducton n leakage power because more gates wll be assgned hgh. 4. Run Tme of MLP lgorm The run tme of LP s always a bg concern snce ts complexty s exponental n e number of varables and constrants of e problem n e worst case. However, our expermental results show at e real computng tme may depend on e crcut structure, logc dep, etc., and may not be exponental. Runnng on a.4ghz M Opteron 5 processor w 3G memory, many PU run tmes for solvng e LP problem were less an one second (columns 5, 8 and n Table ). Ths s an advantage over oer technques [9] because we acheve 3% more leakage reducton w 99% tmng yeld but n much less PU tme. onference Proceedngs: LS esgn - 6 Embedded Systems, January 7. opyrght 7 by The nsttute of Electrcal and Electroncs Engneers, nc. ll rghts Reserved.

6 esdes SS 85 benchmark crcuts, we also optmzed e leakage for an RM7 P core, whch has 5.5k combnatonal cells and.4k sequental cells mplemented n TSM 9nm MOS process. The expermental results n e last row of Table show 4% more leakage reducton acheved w 37 seconds run tme and partly demonstrate e feasblty of applyng our MLP approach to real crcuts. lough today's SO may have over one mllon gates, t always has a herarchcal structure. LP constrants can be generated for submodules at a lower level and e run tmes wll be determned by e number of gates n e ndvdual submodules. Such a technque may not guarantee a global optmzaton, but stll would get a reasonable result wn acceptable run tme. 5. oncluson mxed nteger lnear programmng formulaton to statstcally mnmze e leakage power n a dual- process under process varatons s proposed n s paper. The expermental results show at 3% more leakage power reducton can be acheved by usng s statstcal approach compared w e determnstc approach. n e statstcal approach, e mpact of process varaton on leakage power and crcut performance s smultaneously mnmzed when a small yeld loss s permtted. cknowledgment uors are grateful for assstance from nalog evces. 6. References [] M. Ketkar and S. S. Sapatnekar, Standby Power Optmzaton va Transstor Szng and ual Threshold oltage ssgnment, Proc.,, pp [] L. We, Z. hen, M. Johnson and K. Roy, esgn and Optmzaton of Low oltage Hgh Performance ual Threshold MOS rcuts, Proc., 998, pp [3] L. We, Z. hen, K. Roy, Y. Ye and. e, Mxed- (MT) MOS rcut esgn Meodology for Low Power pplcatons, Proc., 999, pp [4] Q. Wang, and S.. K. rudhula, "Statc Power Optmzaton of eep Submcron MOS rcuts for ual T Technology," Proc,, 998, pp [5]. Nguyen,. avare, M. Orshansky,. hnney,. Thompson, and K. Keutzer, Mnmzaton of ynamc and Statc Power Through Jont ssgnment of Threshold oltages and Szng Optmzaton, Proc. SLPE, 3, pp [6] F. Gao and J. P. Hayes, Gate szng and t ssgnment for ctve-mode Leakage Power Reducton, Proc., 4, pp [7]. avood and. Srvastava, Probablstc ual- Optmzaton Under arablty, Proc. SLPE, 5, pp [8]. Srvastava,. Sylvester,. laauw, Statstcal Optmzaton of Leakage Power onsderng Process aratons Usng ual- and Szng, Proc., 4, pp [9] M. Man,. evgan and M. Orshansky, n Effcent lgorm for Statstcal Mnmzaton of Total Power Under Tmng Yeld onstrants, Proc., 5, pp [] S. Mukhopadhyay and K. Roy, Modelng and Estmaton of Total Leakage urrent n Nano-Scaled MOS evces onsderng e Effect of Parameter araton, Proc. SLPE, 3, pp [] Y. Lu and.. grawal, Leakage and ynamc Gltch Power Mnmzaton Usng nteger Lnear Programmng for ssgnment and Pa alancng, PTMOS, 5, pp [] Y. Lu and.. grawal, MOS Leakage and Gltch Power Mnmzaton for Power-Performance Tradeoff, Journal of Low Power Electroncs, vol., no. 3, ecember 6. [3] T. Sakura and. R. Newton, lpha-power Law MOSFET Model and ts pplcatons to MOS nverter elay and Oer Formulas, EEE Journal of Sold-State rcuts, vol. 5, no., pp , February 99. [4] R. Rao,. Srvastava,. laauw and. Sylvester, Statstcal nalyss of Subreshold Leakage urrent for LS rcuts, EEE Transactons on LS Systems, vol., no., Feb. 4, pp [5] R. Rao,. evgan,. laauw and. Sylvester, Parametrc Yeld Estmaton onsderng Leakage arablty, Proc., 4, pp [6] M. Man and M. Orshansky, New Statstcal Optmzaton lgorm for Gate Szng, Proc., 4, pp [7] E. T.. F. Jacobs and M. R.. M. erkelaar, Gate Szng Usng a Statstcal elay Model, Proc. TE,, pp [8]. E. lark, The Greatest of a Fnte Set of Random arables, J. Operatons Research Soc. merca, vol. 9, pp. 45-6, 96. [9] F. Hu, Process-araton-Resstant ynamc Power Optmzaton for LS rcuts, Ph ssertaton, ept. of EE, uburn Unversty, uburn, labama, May 6. [] F. Hu and.. grawal, nput-specfc ynamc Power Optmzaton for LS rcuts, Proc. SLPE, 6, pp [] R. Fourer,. M. Gay, and. W. Kernghan, MPL: Modelng Language for Maematcal Programmng. Sou San Francsco, alforna: The Scentfc Press, 993. [] PTM: erkeley Predctve Technology Model. See onference Proceedngs: LS esgn - 6 Embedded Systems, January 7. opyrght 7 by The nsttute of Electrcal and Electroncs Engneers, nc. ll rghts Reserved.

Leakage and Dynamic Glitch Power Minimization Using Integer Linear Programming for V th Assignment and Path Balancing

Leakage and Dynamic Glitch Power Minimization Using Integer Linear Programming for V th Assignment and Path Balancing Leakage and Dynamc Gltch Power Mnmzaton Usng Integer Lnear Programmng for V th Assgnment and Path Balancng Yuanln Lu and Vshwan D. Agrawal Auburn Unversty, Department of ECE, Auburn, AL 36849, USA luyuanl@auburn.edu,

More information

Statistical Circuit Optimization Considering Device and Interconnect Process Variations

Statistical Circuit Optimization Considering Device and Interconnect Process Variations Statstcal Crcut Optmzaton Consderng Devce and Interconnect Process Varatons I-Jye Ln, Tsu-Yee Lng, and Yao-Wen Chang The Electronc Desgn Automaton Laboratory Department of Electrcal Engneerng Natonal Tawan

More information

POWER AND PERFORMANCE OPTIMIZATION OF STATIC CMOS CIRCUITS WITH PROCESS VARIATION

POWER AND PERFORMANCE OPTIMIZATION OF STATIC CMOS CIRCUITS WITH PROCESS VARIATION POWER AND PERFORMANCE OPTIMIZATION OF STATIC CMOS CIRCUITS WITH PROCESS VARIATION Except where reference s made to the work of others, the work descrbed n ths dssertaton s my own or was done n collaboraton

More information

Effective Power Optimization combining Placement, Sizing, and Multi-Vt techniques

Effective Power Optimization combining Placement, Sizing, and Multi-Vt techniques Effectve Power Optmzaton combnng Placement, Szng, and Mult-Vt technques Tao Luo, Davd Newmark*, and Davd Z Pan Department of Electrcal and Computer Engneerng, Unversty of Texas at Austn *Advanced Mcro

More information

Variability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning

Variability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning Asa and South Pacfc Desgn Automaton Conference 2008 Varablty-Drven Module Selecton wth Jont Desgn Tme Optmzaton and Post-Slcon Tunng Feng Wang, Xaoxa Wu, Yuan Xe The Pennsylvana State Unversty Department

More information

An Efficient Algorithm for Statistical Minimization of Total Power under Timing Yield Constraints

An Efficient Algorithm for Statistical Minimization of Total Power under Timing Yield Constraints 19.1 An Effcent Algorthm for Statstcal Mnmzaton of otal Power under mng Yeld Constrants Murar Man 1, Anrudh Devgan 2, and Mchael Orshansky 1 1 Unversty of exas, Austn, 2 Magma Desgn Automaton ABSRAC Power

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Coarse-Grain MTCMOS Sleep

Coarse-Grain MTCMOS Sleep Coarse-Gran MTCMOS Sleep Transstor Szng Usng Delay Budgetng Ehsan Pakbazna and Massoud Pedram Unversty of Southern Calforna Dept. of Electrcal Engneerng DATE-08 Munch, Germany Leakage n CMOS Technology

More information

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

Basic Statistical Analysis and Yield Calculations

Basic Statistical Analysis and Yield Calculations October 17, 007 Basc Statstcal Analyss and Yeld Calculatons Dr. José Ernesto Rayas Sánchez 1 Outlne Sources of desgn-performance uncertanty Desgn and development processes Desgn for manufacturablty A general

More information

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

Lecture Notes on Linear Regression

Lecture 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 information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

Queueing Networks II Network Performance

Queueing 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 information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Interconnect Optimization for Deep-Submicron and Giga-Hertz ICs

Interconnect Optimization for Deep-Submicron and Giga-Hertz ICs Interconnect Optmzaton for Deep-Submcron and Gga-Hertz ICs Le He http://cadlab.cs.ucla.edu/~hele UCLA Computer Scence Department Los Angeles, CA 90095 Outlne Background and overvew LR-based STIS optmzaton

More information

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable

More information

Support Vector Machines. Vibhav Gogate The University of Texas at dallas

Support Vector Machines. Vibhav Gogate The University of Texas at dallas Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest

More information

Clock-Gating and Its Application to Low Power Design of Sequential Circuits

Clock-Gating and Its Application to Low Power Design of Sequential Circuits Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

Chapter 6. Supplemental Text Material

Chapter 6. Supplemental Text Material Chapter 6. Supplemental Text Materal S6-. actor Effect Estmates are Least Squares Estmates We have gven heurstc or ntutve explanatons of how the estmates of the factor effects are obtaned n the textboo.

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010 Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Computing Correlated Equilibria in Multi-Player Games

Computing Correlated Equilibria in Multi-Player Games Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,

More information

Lab 2e Thermal System Response and Effective Heat Transfer Coefficient

Lab 2e Thermal System Response and Effective Heat Transfer Coefficient 58:080 Expermental Engneerng 1 OBJECTIVE Lab 2e Thermal System Response and Effectve Heat Transfer Coeffcent Warnng: though the experment has educatonal objectves (to learn about bolng heat transfer, etc.),

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

Estimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort

Estimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort Estmatng Delas Would be nce to have a back of the envelope method for szng gates for speed Logcal Effort ook b Sutherland, Sproull, Harrs Chapter s on our web page Gate Dela Model Frst, normalze a model

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

x i1 =1 for all i (the constant ).

x i1 =1 for all i (the constant ). Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Curve Fitting with the Least Square Method

Curve Fitting with the Least Square Method WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

Run-time Active Leakage Reduction By Power Gating And Reverse Body Biasing: An Energy View

Run-time Active Leakage Reduction By Power Gating And Reverse Body Biasing: An Energy View Run-tme Actve Leakage Reducton By Power Gatng And Reverse Body Basng: An Energy Vew Hao Xu, Ranga Vemur and Wen-Ben Jone Department of Electrcal and Computer Engneerng, Unversty of Cncnnat Cncnnat, Oho

More information

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Statistics Chapter 4

Statistics Chapter 4 Statstcs Chapter 4 "There are three knds of les: les, damned les, and statstcs." Benjamn Dsrael, 1895 (Brtsh statesman) Gaussan Dstrbuton, 4-1 If a measurement s repeated many tmes a statstcal treatment

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence

More information

Measurement and Model Identification of Semiconductor Devices

Measurement and Model Identification of Semiconductor Devices Measurement and Model Identfcaton of Semconductor evces JOSEF OBEŠ MARTIN GRÁBNER epartment of Rado Engneerng Faculty of Electrcal Engneerng zech Techncal Unversty n Prague Techncá 2 6627 Praha 6 zech

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy Compression. Compromise accuracy of reconstruction for increased compression. Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost

More information

Distributed Sleep Transistor Network for Power Reduction

Distributed Sleep Transistor Network for Power Reduction 11.3 Dstrbuted Sleep Transstor Network for Power Reducton Changbo Long ECE Department Unversty of Wsconsn, Madson clong@cae.wsc.edu Le He EE Department UCLA lhe@ee.ucla.edu ABSTRACT Sleep transstors are

More information

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD 90 CHAPTER 7 STOCHASTIC ECOOMIC EMISSIO DISPATCH-MODELED USIG WEIGHTIG METHOD 7.1 ITRODUCTIO early 70% of electrc power produced n the world s by means of thermal plants. Thermal power statons are the

More information

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton

More information

3.6 Limiting and Clamping Circuits

3.6 Limiting and Clamping Circuits 3/10/2008 secton_3_6_lmtng_and_clampng_crcuts 1/1 3.6 Lmtng and Clampng Crcuts Readng Assgnment: pp. 184-187 (.e., neglect secton 3.6.2) Another applcaton of juncton dodes Q: What s a lmter? A: A 2-port

More information

PHYS 450 Spring semester Lecture 02: Dealing with Experimental Uncertainties. Ron Reifenberger Birck Nanotechnology Center Purdue University

PHYS 450 Spring semester Lecture 02: Dealing with Experimental Uncertainties. Ron Reifenberger Birck Nanotechnology Center Purdue University PHYS 45 Sprng semester 7 Lecture : Dealng wth Expermental Uncertantes Ron Refenberger Brck anotechnology Center Purdue Unversty Lecture Introductory Comments Expermental errors (really expermental uncertantes)

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Appendix B: Resampling Algorithms

Appendix B: Resampling Algorithms 407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles

More information

Chapter 8 Indicator Variables

Chapter 8 Indicator Variables Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n

More information

Laboratory 3: Method of Least Squares

Laboratory 3: Method of Least Squares Laboratory 3: Method of Least Squares Introducton Consder the graph of expermental data n Fgure 1. In ths experment x s the ndependent varable and y the dependent varable. Clearly they are correlated wth

More information

Chapter 5 Multilevel Models

Chapter 5 Multilevel Models Chapter 5 Multlevel Models 5.1 Cross-sectonal multlevel models 5.1.1 Two-level models 5.1.2 Multple level models 5.1.3 Multple level modelng n other felds 5.2 Longtudnal multlevel models 5.2.1 Two-level

More information

Boise State University Department of Electrical and Computer Engineering ECE 212L Circuit Analysis and Design Lab

Boise State University Department of Electrical and Computer Engineering ECE 212L Circuit Analysis and Design Lab Bose State Unersty Department of Electrcal and omputer Engneerng EE 1L rcut Analyss and Desgn Lab Experment #8: The Integratng and Dfferentatng Op-Amp rcuts 1 Objectes The objectes of ths laboratory experment

More information

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for

More information

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models

More information

System in Weibull Distribution

System in Weibull Distribution Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

Laboratory 1c: Method of Least Squares

Laboratory 1c: Method of Least Squares Lab 1c, Least Squares Laboratory 1c: Method of Least Squares Introducton Consder the graph of expermental data n Fgure 1. In ths experment x s the ndependent varable and y the dependent varable. Clearly

More information

Maximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method

Maximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC

More information

Week 11: Differential Amplifiers

Week 11: Differential Amplifiers ELE 0A Electronc rcuts Week : Dfferental Amplfers Lecture - Large sgnal analyss Topcs to coer A analyss Half-crcut analyss eadng Assgnment: hap 5.-5.8 of Jaeger and Blalock or hap 7. - 7.3, of Sedra and

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Note 10. Modeling and Simulation of Dynamic Systems

Note 10. Modeling and Simulation of Dynamic Systems Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada

More information

A Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

A Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.

More information

Optimum Design of Steel Frames Considering Uncertainty of Parameters

Optimum Design of Steel Frames Considering Uncertainty of Parameters 9 th World Congress on Structural and Multdscplnary Optmzaton June 13-17, 211, Shzuoka, Japan Optmum Desgn of Steel Frames Consderng ncertanty of Parameters Masahko Katsura 1, Makoto Ohsak 2 1 Hroshma

More information

Answers Problem Set 2 Chem 314A Williamsen Spring 2000

Answers Problem Set 2 Chem 314A Williamsen Spring 2000 Answers Problem Set Chem 314A Wllamsen Sprng 000 1) Gve me the followng crtcal values from the statstcal tables. a) z-statstc,-sded test, 99.7% confdence lmt ±3 b) t-statstc (Case I), 1-sded test, 95%

More information

Advanced Circuits Topics - Part 1 by Dr. Colton (Fall 2017)

Advanced Circuits Topics - Part 1 by Dr. Colton (Fall 2017) Advanced rcuts Topcs - Part by Dr. olton (Fall 07) Part : Some thngs you should already know from Physcs 0 and 45 These are all thngs that you should have learned n Physcs 0 and/or 45. Ths secton s organzed

More information

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Regression Analysis

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Regression Analysis Resource Allocaton and Decson Analss (ECON 800) Sprng 04 Foundatons of Regresson Analss Readng: Regresson Analss (ECON 800 Coursepak, Page 3) Defntons and Concepts: Regresson Analss statstcal technques

More information

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,

More information

Energy-Delay Space Exploration of Clocked Storage Elements Using Circuit Sizing

Energy-Delay Space Exploration of Clocked Storage Elements Using Circuit Sizing Energy-elay Space Exploraton of locked Storage Elements Usng rcut Szng Mustafa Aktan Svakumar Paramesvaran Joosk Moon Vojn Oklobdzja Electrcal Engneerng Rchardson, TX 75080 e-mal:aktanmus@utdallas.edu

More information

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7

Stanford 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 information

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS M. Krshna Reddy, B. Naveen Kumar and Y. Ramu Department of Statstcs, Osmana Unversty, Hyderabad -500 007, Inda. nanbyrozu@gmal.com, ramu0@gmal.com

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys

More information

Estimation: Part 2. Chapter GREG estimation

Estimation: Part 2. Chapter GREG estimation Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information