COOLER- A Fast Multiobjective Fixed-outline Thermal Floorplanner
|
|
- Allan Waters
- 6 years ago
- Views:
Transcription
1 COOLER- A Fast Multobectve Fxed-outlne Thermal Floorplanner Debarsh Chatteree Stanford Unversty debarsh@stanford.edu Theodore W. Mankas Unversty of Tulsa theodore-mankas@utulsa.edu Igor Markov Unversty of Mchgan markov@eecs.umch.edu Abstract In ths work, we study multobectve thermal-aware floorplannng n the fxed-outlne context. Our baselne mplementaton demonstrates a 14% average nterconnect mprovement over Parquet for am49, and can addtonally optmze peak on-chp temperature. To crcumvent the expense of Compact Thermal Models, we develop a novel approach to power-densty aware floorplannng, but rgorously evaluate fnal layouts usng a standard methodology based on the Hotspot tool. Wth these technques, our multobectve floorplanner COOLER, reduces peak temperature on MCNC crcuts by 15.3 C, whch s smlar to the 15.1 C reducton acheved by Hotfloorplan. However, our tool s tmes faster than Hotfloorplan. We also show that solutons found by Hotfloorplan le on the Pareto front generated by COOLER. 1. Introducton Automated floorplannng performs placement of on-chp blocks to facltate early estmaton, as well as to mprove crcut performance and yeld. These blocks typcally nclude crcut modules generated by parttonng, as well as embedded memores, IP blocks, and analog devces. The Classcal Floorplannng Problem CFP) seeks to optmze area and nterconnect, but has recently undergone several paradgm shfts due to maor changes n mcroarchtecture desgn flows. The ncreasng scale and complexty of Integrated Crcuts, as well as tme-tomarket pressures n commercal IC desgn, necesstate a top-down herarchcal approach [1]. Such an approach can be enabled by fxed-outlne floorplannng of crcut modules f module outlnes are vewed as outlnes of nested floorplans. However, n computatonal terms, fxed-outlne floorplannng s consderably harder than the correspondng CFP []. Another maor shft n floorplan desgn technology s the ntroducton of maxmum on-chp temperature as a key optmzaton obectve. Ths has become crucal n vew of the ncreasng power dsspaton n portable and statonary electroncs, due to consderable leakage current at the 65nm technology node and below, as well as ncreasng clock frequences. If ths trend contnues unchecked, power densty may reach 10,000 W/cm by the year 015 [3]. Operatng temperature may ncrease due to greater local power densty, trggerng several harmful effects, such as electromgraton and exponental ncrease n leakage, whch decreases mean tme-to-falure and ncreases the probablty of thermal runaways. Addtonally, the dependence of carrer moblty and nterconnect resstvty on temperature causes the current-drvng capablty of transstors to decrease and the nterconnect delay to ncrease as chps get hotter. As maxmum on-chp temperature T) ncreases, burnn tests used to weed out devces wth latent defects are becomng more and more tme-consumng [4]. Ths s because the dfference between maxmum burn-n temperature lmted by thermal runaway) and maxmum on-chp temperature s decreasng steadly, makng t dffcult to smulate accelerated use. Thermal optmzaton s partcularly mportant for future ICs wth memory stacked on top of random logc and for true-3d ICs, snce n both cases ar coolng s less effectve. As the peak on-chp temperature ncreases, the costs of packagng and coolng grow at the rate of $1/W above 40W [5]. Wthout proper desgn methodology, ths burgeonng overhead alone may hamper future devce scalng. In lght of thermal challenges, we consder the followng Modern Floorplannng Problem MFP): Gven a set of blocks Π = { B1, B,..., BN } wth fxed areas, a set of nets η = { N1, N,..., N m} specfyng the block nterconnectons and average power dsspaton values P = { P1, P,..., PN } of the modules, fnd the set of non-domnated W+T optmzed packngs of Π that ft n a fxed outlne specfed byw outlne H. A outlne non-domnated set also termed a Pareto-optmal set) by defnton excludes solutons whose all parameters are ether nferor or dentcal to those of another soluton. 1
2 Outlne Floorplans Fgure 1. Dependency of the fnal optmal soluton n a conventonal floorplanner on the slope of the ftness lne. To compare MFP and CFP, recall that CFP s typcally solved by mnmzng the obectve functon: f CFP = α * Area + β * Wrelength 1) where α and β are weghts determnng the relatve mportance of the obectves. Graphcally ths means that the constant-ftness lne wth slope m = α / β ) s shfted towards the orgn as far as possble to locate an optmal soluton, as llustrated n Fgure 1. Now consder the problem n whch the desgner wants to optmze wrelength subect to the constrant A A. max From the Pareto-optmal set n Fgure 1, soluton pont 4 can be quckly dentfed as optmal. However, the conventonal, sngle-obectve approach would requre a sweep through many m values to fnd ths soluton. A large m ensures that the optmal soluton wll satsfy the area constrant, but wll generate a poor wrelength soluton example: ponts 1,, and 3). However, a ftness lne wth low m may not satsfy the area constrant, as llustrated by ponts 5 and 6. In practce, the number of Pareto-optmal soluton ponts close to A = A may be so large that even max dynamcally updatng the weghts n dscrete steps mght not relably fnd the requred soluton. MFP nherts all dffcultes of the CFP, n the sense that t optmzes wrelength and temperature subect to the fxed-outlne constrant, but s much harder because the two optmzatons are performed smultaneously. The naïve approach to mappng out the Pareto front by varyng the weghts n Eqn. 1) s neffcent as t requres multple starts of the sngle-obectve annealer. Genetc Algorthms GA) promse better effcency n multobectve optmzaton by trackng multple solutons wth varyng ftness values, and can also employ annealng-style moves n the form of mutatons. Therefore we develop such a genetc Fgure. Possble varatons n floorplan aspect rato whle satsfyng the outlne constrant. algorthm and emprcally compare t wth a popular sngle-obectve floorplanner based on smulated annealng SA). The rest of the paper s organzed as follows, Secton covers necessary background and related work. Secton 3 ntroduces our multobectve floorplannng and fast thermal optmzaton technque for the MFP. Secton 4 dscusses emprcal valdaton, and Secton 5 concludes our work.. Background and prevous work Modern floorplannng has generated much nterest among researchers snce the year 000, and several sophstcated methods have been proposed to deal wth the manfold complextes of the MFP..1. Prevous work Prevous technques for fxed-outlne floorplannng rely on sngle-obectve optmzaton. In [], the fxedoutlne constrant was acheved by nvokng a specally desgned subroutne from tme to tme n course of floorplannng. The subroutne compared the aspect rato of the floorplan wth that of the prescrbed outlne and ntated slack-based moves to repar aspect rato dstortons. In [6] fxed-outlne floorplannng was acheved by ntroducng an aspect-rato dfference term n the ftness functon and dynamcally updatng the weghts. [, 6] assume that the aspect ratos of the outlne and the optmal floorplan would be the same. Fgure shows that the floorplan aspect rato can be sgnfcantly dfferent from outlne aspect rato and yet satsfy the fxed-outlne constrant. Ths flexblty n aspect rato can be exploted for better nterconnect optmzaton. An evolutonary technque for fxedoutlne area-packng was proposed n [7] but t does not consder nterconnect optmzaton.
3 The need for thermal-aware mcroarchtecture desgn has been establshed n [8]. The computatonal cost of embeddng a hghly accurate temperature smulator usng FEM, FDM or Green s functon method) wthn a floorplanner can be prohbtvely hgh. Thus Compact Thermal Model CTM) s used for temperature smulatons durng floorplannng. Tsa et al. [9] proposed a CTM that can be used to estmate temperature profle from a dstrbuton of power dsspatng sources on chp. Thermal floorplanners [10] and [11] use Hotspot wthn SA and GA procedures respectvely, but are very slow, especally on large crcuts, as CTM-based temperature smulaton domnates runtme. In contrast, the runtme of CFP s domnated by nterconnect evaluaton [1]. Alternatve approaches to thermal optmzaton based on power analyss, ncludng the matrx synthess approach n [13], have faled to reduce maxmum on-chp temperature. Skadron et al. [8] found very small correlaton between the total power dsspaton n a block and ts temperature. To ths end, our study reveals a hgh correlaton between the steady-state temperature at the center of a block and the gradent of power densty reducton computed at ts perphery. We thus ntroduce powerdensty aware thermal floorplannng and study ts role n reducng the maxmum on-chp temperature as well as mprovng the runtme of exstng thermal-aware floorplanners... Sequence par floorplan representaton Over the years a varety of floorplan data-structures such as Slcng Tree, Sequence Par SP), Bounded Slcng Grd, O-tree and B* tree have been proposed. Our mplementaton s based on the Sequence Par SP) [14] floorplan representaton, snce ths has been used by prevous fxed-outlne floorplanners []. In SP representaton, a par of permutaton of { 1,,..., N} s used to encode the floorplan. Dependng on the relatve order of elements n these pars, certan topologcal constrants are mposed. For example:.., B,.., B,..) &.., B,.., B,..) B s rght of B ).., B,.., B,..) &.., B,.., B,..) B s below B 3) Gven a sequence par, block locatons can be found n O n ) tme, and even faster n O nlog n)) or O nloglog n))) tme, usng more recent algorthms. However, t has been shown n [] that for n < 100, the O n ) tme algorthm by Tang et al. [15] outperforms more sophstcated algorthms. Therefore we adopted ths algorthm n our work..3. Hotspot Hotspot s a temperature smulator. The thermal model n Hotspot s based on the well-known dualty between electrc and thermal quanttes. The average power dsspaton wthn a block s modeled by a current source and the lateral heat flow from a block s modeled by thermal resstors connected to another block or the ambent. The values of resstors and capactors are calculated from the relatve postonng of the blocks, assumng typcal values for snk dmenson, conductvty etc. For steady-state analyss, the capactors are open-crcuted. The temperature at the center of each block s then computed by solvng the nodal equatons of the equvalent RC crcut. 3. Multobectve optmzaton To solve the MFP va multobectve optmzaton, we consder an obectve functon whch s a 3D vector of the form: F =< f1, f, f3 > 4) Where f1 = Φ and f = Θ are the wrelength obectve and thermal obectve respectvely. The functon f s 3 ether the outlne obectve Ω) or the area obectve Α ), dependng on the mode of operaton of the floorplanner. The followng defntons are useful n understandng the multobectve approach: DEFINITION 1: A floorplan a s sad to domnate a floorplan b also wrtten asa f b ) f and only f all elements n the obectve vector of a are greater than or equal to the correspondng elements n the obectve vector of b and at least one element n the obectve vector of a s strctly greater than the correspondng element n the obectve vector of b. Mathematcally, we saya f b ff: f a) f b) =1,, 3 {1,,3}: f a) > f b) 5) DEFINITION : A floorplan a s sad to cover a floorplan b f and only f a domnates b or ther obectve vectors are dentcal. Mathematcally, we say a covers b ff: a f b or F a) = F b) 6) DEFINITION 3: A floorplan a s called Pareto-optmal f and only f a s not domnated by any other floorplan. The set of all non-domnated floorplans consttutes the so-called Pareto-optmal set. 3
4 3.1. Genetc algorthm Our multobectve solver mplements a Genetc Algorthm GA). Fgure 3 shows the basc flowchart of the multobectve GA. In a Smple Genetc Algorthm, there s a sngle evolvng populaton. To generate the Pareto-optmal soluton set, an external non-domnated populaton has to be mantaned. At each step of the GA, non-domnated members from the evolvng populaton P are stored n the external populaton P. However, members whch are non-domnated n P may be covered or mght cover prevously stored members n P. Thus, each tme members are coped to the external populaton, the covered members have to be removed to ensure Pareto-optmalty of the external populaton. Parent selecton s done from the unon set of the external and evolvng populaton usng the Bnary Tournament Selecton scheme. Next Partally Mapped Crossover and Swap Mutaton are appled to the selected parents and a new populaton s generated. The ftness assgnment has been done accordng to the well-known Strength Pareto Evolutonary Approach SPEA) that ensures that members n the external populaton have hgher probablty of beng selected n the matng pool. The procedure for ftness assgnment n SPEA s a two-step process. At frst, each member n the external populaton s assgned a ftness value strength) gven by: n f = 7) N +1 where n denotes the number of ndvduals n P that are covered by and N s the sze of P. Once the ftness has been assgned to the members n the external populaton, ftness s assgned to each member n the evolvng populaton accordng to the followng equaton: f = 1 + 8) f, f 3.. Fxed-outlne mode For fxed-outlne floorplannng, the functon f 3 n the obectve vector s drven by the outlne-obectve Ω ) defned below: [ V V V )] f 3 = Ω = exp + 9) H VV = H chp H outlne ) U H chp H outlne ) 10) V = W W ) U W W ) 11) H chp outlne chp outlne where V V and V H are measures of the volaton of the outlne constrant n the vertcal and horzontal drectons respectvely and U x) s the step functon defned as: U x) = 1 when x > 0 and U x) = 0 when x 0. If the maxmum allowable percentage whtespace ω and outlne aspect rato ρ are provded, then the wdth and heght of the outlne can be easly computed from: W outlne + ω A 1/ = [ 1 /100) / ρ] 1) H outlne + ω A 1/ = [ 1 /100) ρ] 13) Fgure 3. Multobectve genetc algorthm. Theorem 1: Ω = 1 s a necessary and suffcent condton for satsfyng the fxed outlne constrant. Proof: Wchp W and oultne H chp H oultne W Woutlne) U W chp W ) = 0 and chp outlne H H ) U H chp H ) = 0 Ω = 1 chp outlne Random Intalzaton End? no Compute Φ, Θ, and Ω or Α for each populaton member Create external populaton and copy non-domnated members Remove covered members from external populaton Assgn ftness to members n the external populaton Selecton of the matng pool from unon set of the two populatons Crossover and Mutaton outlne Stop Note that Ω = 1 does not necesstate that the floorplan and outlne aspect ratos be dentcal. The fxed-outlne floorplanner works n two phases. In the frst phase, the external non-domnated populaton s not pruned. Durng ths phase the GA explores the soluton space unformly. In the second phase, a selectve prunng mechansm s appled on the external populaton to weed out solutons wth low Ω, whenever the sze of the external populaton ncreases a preset value ~5). yes 4
5 3.3. Outlne-free mode For outlne-free floorplannng, the functon f 3 n the obectve vector s drven by the area-obectve Α ) defned below: N f3 = Α = = A B ) A 14) 1 chp where AB ) s the area of block and A chp s the area of the chp represented by the sequence par Wrelength optmzaton The half-permeter of the boundng box of a net serves as a good approxmaton for the total wrelength n that net. The Half Permeter Wre Length HPWL) s used to defne the wrelength-obectve Φ ) as follows: Φ = x x ) + y y ) 15) [ ] η max mn max mn Where x max, ymax ) and xmn, y mn ) denote the coordnates of the top-rght and bottom-left corners of the boundng box of net. Fgure 4. Imagnary rectangular boundary surroundng a floorplan module for computng gradent of power-densty reducton Thermal obectves and optmzaton In ths secton, we ntroduce power-densty aware floorplannng for thermal optmzaton. Our ntenton s to model maxmum on-chp temperature T max ) usng a power-densty based metrc. Snce nformaton about the block power-densty s readly avalable, such an approach s computatonally effcent. To understand the relaton between power-densty and temperature, consder the equaton for steady-state temperature n a 3D substrate: T T T k + + +,, ) = 0 Q x y z 16) x y z Subect to the boundary condton: T k + h T = f x, y, z ) 17) n where T s the temperature as a functon of poston; k and ρ are thermal conductvty W/m C) and densty Kg/m 3 ) of the materal respectvely, h s the heat transfer coeffcent of the packagng components W/m C), Q s the power-densty W/m 3 ), / n represents the dfferentaton along the outward normal drawn at the boundary surface, and f s an arbtrary functon. If the power-densty Q s unformly dstrbuted across the spatal coordnates and the ntal and boundary condtons are dentcal for all ponts, then from symmetry of the dfferental terms n 16) t can concluded that the temperature dstrbuton wll also be unform. The assumpton of unform ntal and boundary condton s ustfed because any thermalaware methodology, ncludng CTMs must be Boundary and Intal Condton Independent [8]. Because power denstes are localzed and t s not possble to make any changes to the crcutry wthn a block, perfectly unform power densty or temperature dstrbuton cannot be acheved by redstrbutng the blocks. However, t s possble to dentfy modules wth hgh power densty as potental canddates for developng hotspots and surround them by whtespace or modules wth low power densty to cool down potental hotspots. In order to carry out a mathematcal analyss of the problem, let us defne the followng terms: H: Ordered set of hgh power-densty modules modules havng power denstes greater than the 80 percentle value) sorted n descendng order. λ : Set of all blocks adacent to block H W : Shared boundary-length between H and λ P : Surface power densty of block W, L : Wdth and length of module respectvely. Let us construct an magnary rectangle of length L + x and wdth W + x around block as shown n Fgure 4.The effectve power densty wthn the magnary rectangle s gven by: P eff PW L + W xp + O x ) = λ 18) W + x) L + x) The rate at whch power densty dmnshes wth x can be calculated from 18) and s gven by: P P P = x x eff = 1 P P ) W 19) W L λ 5
6 begn Input: Sequence Par, Module Dmensons, Power Densty Output: Θ 1: H vector of hgh power-densty blocks n descendng order : for all H 3: λ set of blocks adacent to, Scale 1 4: for all λ 5: Θ Θ + P P ) W / W L * Scale ) 6: Scale Scale* S End Fgure 5. Algorthm for calculatng the thermal obectve. Table 1. Correlaton coeffcents between thermal obectve Θ and maxmum and mean on-chp temperature. BENCHMARKS Θ VS TMAX Θ VS TMEAN apte xerox hp am am Runtmesec) Number of Modules CLRA+T) PQTA+W) HFPA+T) Fgure 6. Fxed-outlne W+T optmzed layouts of am49 wthω = 0. 0 and ρ = 1,,3. Fgure 7. Comparson of runtmes for A+T optmzaton usng Hotfloorplan HFP), A+T optmzaton usng COOLERCLR) and A+W optmzaton usng Parquet PQT). The dea s to determne a layout whch mnmzes the effectve power denstes around modules wth hgh power densty. Ths s equvalent to maxmzng the gradent of power-densty reducton H. In order to reduce T max, P / x for the frst element n H.e. the hghest power-densty block) must be maxmzed. Next, P / x for the second element n H s maxmzed keepng the relatve locaton of the hghest power-densty block and ts neghbours unaltered. Thus, t wll not be correct to develop a scalar thermalobectve smply by summng up P / x from dfferent blocks n H. Ths s because, the block wth second hghest power densty may have a much greater permeter, n whch case maxmzng P/ x would result n surroundng t wth blocks of low power densty. Ths wll neglect the block wth hghest power densty and hence would fal to reduce T max. To overcome ths problem, we defne the thermal obectve Θ as follows: Θ = H 1 1 P P ) W 0) S W L λ where S s the scalng factor ~10). The entre procedure s summarzed n Fgure 5. From expermental results we fnd that Θ as defned n 0) has hgh degree of correlaton wth maxmum and mean temperature across the chp. The correlaton coeffcents are gven n Table Smulaton Results All results were computed on an Intel Pentum IV laptop runnng at 1.8 GHz wth a 1GB RAM. In the absence of detals on power dsspaton for MCNC benchmarks, power denstes were randomly assgned n the range from 1mW/mm to 1W/mm. At frst we run Parquet n fxed-outlne mode on the largest MCNC benchmark am49). We also run COOLER under the same condtons and compare the HPWL for dfferent aspect ratos and percentage whtespace n Table. Block rotatons n Parquet were dsabled to make far comparson wth COOLER. It s observed that our approach mproves the average HPWL by 14.39%. Fgure 6 shows fxed outlne W+T optmzed layouts of am49 wth dfferent outlne aspect ratos. 6
7 Table. Comparson of average HPWL results over 10 ndependent runs) produced by Parquet and COOLER for fxed-outlne placements of am49 wthout block rotaton maxws ω ) HPWL mm) ρ = 1 ρ = ρ = 3 Parquet COOLER %dff Parquet COOLER %dff Parquet COOLER %dff Max. Temp. Kelvn) Percentage Deadspace CLR-APTE CLR-XEROX CLR-HP CLR-AMI33 CLR-AMI49 HFP-APTE HFP-XEROX HFP-HP HFP-AMI33 HFP-AMI49 Fgure 8. a) Thermal-aware layout of apte generated by COOLER and b) spatal dstrbuton of temperature for the same layout. Table 3. Percentage whtespace, maxmum and mean on-chp temperatures and runtme for A+T optmzaton usng Hotfloorplan MCNC Benchmarks Percentage Whtespace T max K) T mean K) Runtme sec) apte xerox hp am am For thermal-aware floorplannng, we use Hotfloorplan [10] to obtan area and temperature A+T) optmzed layouts for MCNC benchmarks. The percentage whtespace, mean and maxmum temperatures of the layouts are gven n Table 3. Next, we use Parquet for obtanng area and wrelength A+W) optmzed layouts for the same crcuts. The runtme for these two cases are compared n Fgure 7. It s found that for am33 and am49, A+T optmzaton usng Hotfloorplan s around 10,000-0,000 tmes longer than A+W optmzaton usng Parquet. Ths trend may become even more pronounced for larger crcuts. We thus conclude that temperature smulaton usng CTM can become a performance bottleneck for placng large benchmarks. Results n Table 3 show clearly a cubc growth n runtme as the number of modules ncrease. Fgure 9. Pareto-optmal solutons generated by COOLER CLR) and solutons produced by Hotfloorplan HFP) for MCNC benchmarks. It s also observed that reducton n peak temperature for am33 and am49 s accompaned by consderable ncrease n whtespace, whch may not ft desgn specfcatons. On the other hand for apte and xerox, t s possble to brng down the temperature further by relaxng the area constrant. In short, a sngle run of Hotfloorplan does not gve us a clear dea of the tradeoff surface or the Pareto-optmal solutons at our dsposal. Next we used COOLER n outlne-free mode) to generate thermal-aware layouts for all MCNC benchmarks. One such layout for apte s shown n Fgure 8a). It was found that the runtme for A+T optmzaton usng COOLER vares from 3 sec for apte to 401 sec for am49. Thus our method s around tmes faster than Hotfloorplan for MCNC benchmarks. Fgure 7 compares runtmes for COOLER and Hotfloorplan. Ths clearly demonstrates the superorty of our method over CTM-based floorplanners, especally when the number of modules s large. We use Hotspot [16] to analyze the spatal temperature dstrbuton at the block level for the layouts produced by COOLER. The temperature dstrbuton for the apte layout n Fgure 8a) s plotted n Fgure 8b). For each MCNC benchmark, COOLER produces a Pareto-optmal soluton set. T max for each 7
8 Max. Temp. Kelvn) HFP CLR ONLY AREA OPT apte xerox hp am33 am49 Fgure 10. Reducton n Tmax by COOLER CLR) and Hotfloorplan HFP) as compared to non-thermal floorplanner. layout n the Pareto-optmal set s extracted usng Hotspot and plotted n Fgure 9. The maxmum temperature and deadspace percentage correspondng to the layouts generated by Hotfloorplan are also plotted on the same fgure. It s observed that the solutons produced by Hotfloorplan le on the Pareto front generated by COOLER. We thus conclude that COOLER s as effectve n reducng T max as CTM-based temperature-aware floorplanners but runs much faster. Moreover, our method allows the desgner to explore varous desgn possbltes wthout havng to modfy the obectve functon n the source code. For example, Fgure 9 ndcates that T max n apte can be reduced from 357K to 347K by ncreasng the deadspace by 7%. In short, by usng Multobectve GA as opposed to conventonal SA t s possble to get a complete pcture of the tradeoff surface. Fgure 10 shows that COOLER and Hotfloorplan are capable of reducng T max by 15.3 C and 15.1 C on an average over smple area optmzed layouts. Fnally, COOLER was run n an outlne free mode and the Pareto-optmal soluton set for A+W+T optmzaton was generated. Fgure 11 shows the Pareto-optmal solutons for am49 benchmark n the outlne free mode. 5. Concluson In ths paper, we proposed a novel multobectve approach drven by a new outlne obectve functon for better nterconnect optmzaton n fxed-outlne context. We also presented a maxmum on-chp temperature reducton technque that mproves the runtme of exstng thermal floorplanners by several orders of magntude. Fgure 11. Non-domnated surface showng 38 Pareto-optmal soluton ponts for outlnefree A+W+T optmzed floorplannng of am References [1] A. B. Kahng, Classcal Floorplannng Harmful?, ISPD, 000, [] S. N. Adya, and I. L. Markov, Fxed Outlne Floorplannng: Enablng Herarchcal Desgn, IEEE Trans. on VLSI, 11, 6, 003, [3] /platform htm [4] A. Vassgh, O. Semenov, M. Sachdev, A. Keshavarz, and C. Hawkns, CMOS IC Technology and ts Impact on Burn-n, IEEE Trans. on devce and materals relablty, 4,, 004, [5] S. Borkar, Desgn Challenges of Technology Scalng, IEEE Mcro, Jul.-Aug. 1999, 3-9. [6] T.-C. Chen, and Y.-W. Chang, Modern Floorplannng Based on Fast Smulated Annealng, ISPD, 005. [7] C. T. Ln, D.-S. Chen, Y. W. Wang, Robust Fxed-outlne Floorplannng through Evolutonary Search, IEEE/ACM ASPDAC, 004, [8] K. Skadron, M. R. Stan, W. Huang, S. Velusamy, K. Sankaranarayanan, and D. Taran, Temperature-Aware Mcroarchtecture, 30th Intl. Symp. on Comp. Archtecture, June 003, -13. [9] C.-H. Tsa, and S.-M. Kang, Cell-Level Placement for Improvng Substrate Thermal Dstrbuton, IEEE Trans. on CAD of IC and Systems, 19,, Feb. 000, [10] K. Sankaranarayanan, S. Velusamy, M. R. Stan, and K. Skadron, A Case for Thermal-Aware Floorplannng at the Mcroarchtectural Level, Journal of Instructon-Level Parallelsm, Sept [11] W.-L. Hung, Y. Xe, N. Vaykrshnan, C. Addo-Quaye, T. Theochardes, and M. J. Irwn, Thermal Aware Floorplannng usng Genetc Algorthms, 6th ISQED, 005, [1] H. H. Chan, S. N. Adya, and I. L. Markov, Are Floorplan Representatons Important n Dgtal Desgn? Intl. Symposum on Physcal Desgn ISPD), San Francsco, Aprl 005, [13] C. N. Chu, and D. F. Wong, A Matrx Synthess Approach to Thermal Placement, IEEE Trans. on CAD of IC and Systems, 17, 11, Nov. 1998, [14] H. Murata, K. Fuyosh, S. Nakatake, and Y. Katan, VLSI Module Placement based on Rectangle-Packng by Sequence Par, IEEE Transactons on Computer Aded Desgn, 15, 1, 1996, [15] X. Tang, D. F. Wong, R. Tan, Fast Evaluaton of Sequence Par n Block Placement by Longest Common Subsequence Computaton,DATE, 000, [16] 8
POWER-DENSITY AWARE FLOORPLANNING FOR REDUCING MAXIMUM ON-CHIP TEMPERATURE
Proceedngs of the 18 th IASTED Internatonal Conference MODELLIG AD SIMULATIO May 30-June 1, 007, Montreal, Quebec, Canada ISB Hardcopy: 978-0-88986-663-8/ CD: 978-0-88986-664-5 POWER-DESITY AWARE FLOORPLAIG
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationOptimal Slack-Driven Block Shaping Algorithm in Fixed-Outline Floorplanning
Optmal Slack-Drven Block Shapng Algorthm n Fxed-Outlne Floorplannng Jackey Z. Yan Placement Technology Group Cadence Desgn Systems San Jose, CA 9134 USA zyan@cadence.com Chrs Chu Department of ECE Iowa
More informationModule 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 informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationProblem 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 informationFeature 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 informationNumerical 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 informationVariability-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 informationA 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 informationDUE: 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 informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationA 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 informationChapter - 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 informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationReliable Power Delivery for 3D ICs
Relable Power Delvery for 3D ICs Pngqang Zhou Je Gu Pulkt Jan Chrs H. Km Sachn S. Sapatnekar Unversty of Mnnesota Power Supply Integrty n 3D Puttng the power n s as mportant as gettng the heat out Hgher
More informationStatistical 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 informationEffective 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 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 informationChapter 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 informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationResource 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 informationGeneralized 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 informationChapter 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 informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationGlobal 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 informationPsychology 282 Lecture #24 Outline Regression Diagnostics: Outliers
Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.
More informationOptimal Slack-Driven Block Shaping Algorithm in Fixed-Outline Floorplanning
Optmal Slack-Drven Block Sapng Algortm n Fxed-Outlne Floorplannng Jackey Z. Yan Placement Tec. Group Cadence Desgn Systems San Jose, CA 95134, U.S.A. Crs Cu Department of ECE Iowa State Unversty Ames,
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationCHAPTER 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 informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationInterconnect 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 informationCollege 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 informationParametric 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 informationCOMPARISON 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 informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationEcon107 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 informationEEE 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 informationNUMERICAL 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 informationKernel 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 informationAnalytical Thermal Placement for VLSI Lifetime Improvement and Minimum Performance Variation
Analytcal Thermal Placement for VLSI Lfetme Improvement and Mnmum Performance Varaton Andrew B Kahng Sung-Mo Kang We L Bao Lu CSE Dept, UC San Dego, CA 92093, Emal:{blu,abk}@csucsdedu CSE Dept, UC Santa
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationAnnexes. 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 informationDepartment of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification
Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled
More informationReal-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 informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationThe Finite Element Method
The Fnte Element Method GENERAL INTRODUCTION Read: Chapters 1 and 2 CONTENTS Engneerng and analyss Smulaton of a physcal process Examples mathematcal model development Approxmate solutons and methods of
More informationA 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 informationLinear 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 informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationBasic 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 informationOpen Systems: Chemical Potential and Partial Molar Quantities Chemical Potential
Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,
More informationNegative 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 informationComputing 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 informationLecture 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 informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationCoarse-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 informationx = , 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 informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationMMA 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 informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationSpeeding 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 information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationLecture 7: Boltzmann distribution & Thermodynamics of mixing
Prof. Tbbtt Lecture 7 etworks & Gels Lecture 7: Boltzmann dstrbuton & Thermodynamcs of mxng 1 Suggested readng Prof. Mark W. Tbbtt ETH Zürch 13 März 018 Molecular Drvng Forces Dll and Bromberg: Chapters
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationAppendix 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 informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationLOW 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 informationarxiv:cs.cv/ Jun 2000
Correlaton over Decomposed Sgnals: A Non-Lnear Approach to Fast and Effectve Sequences Comparson Lucano da Fontoura Costa arxv:cs.cv/0006040 28 Jun 2000 Cybernetc Vson Research Group IFSC Unversty of São
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationFeb 14: Spatial analysis of data fields
Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s
More informationLecture 14: Forces and Stresses
The Nuts and Bolts of Frst-Prncples Smulaton Lecture 14: Forces and Stresses Durham, 6th-13th December 2001 CASTEP Developers Group wth support from the ESF ψ k Network Overvew of Lecture Why bother? Theoretcal
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationStatistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )
Ismor Fscher, 8//008 Stat 54 / -8.3 Summary Statstcs Measures of Center and Spread Dstrbuton of dscrete contnuous POPULATION Random Varable, numercal True center =??? True spread =???? parameters ( populaton
More informationA Fast Computer Aided Design Method for Filters
2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method
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 informationTurbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH
Turbulence classfcaton of load data by the frequency and severty of wnd gusts Introducton Oscar Moñux, DEWI GmbH Kevn Blebler, DEWI GmbH Durng the wnd turbne developng process, one of the most mportant
More informationChapter 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 informationprinceton 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 informationThermal-Fluids I. Chapter 18 Transient heat conduction. Dr. Primal Fernando Ph: (850)
hermal-fluds I Chapter 18 ransent heat conducton Dr. Prmal Fernando prmal@eng.fsu.edu Ph: (850) 410-6323 1 ransent heat conducton In general, he temperature of a body vares wth tme as well as poston. In
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationNote 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 informationWinter 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 informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More informationWeek 9 Chapter 10 Section 1-5
Week 9 Chapter 10 Secton 1-5 Rotaton Rgd Object A rgd object s one that s nondeformable The relatve locatons of all partcles makng up the object reman constant All real objects are deformable to some extent,
More informationCSci 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 informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More information