Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
|
|
- Wesley Pearson
- 5 years ago
- Views:
Transcription
1 Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract. A new approach for nsertng repeaters n 3-D nterconnects s proposed. The allocaton of repeaters along an nterplane nterconnect s teratvely determned. The proposed approach s compared wth two other technques based on conventonal methods used for 2-D nterconnects. Smulaton results show that the proposed approach decreases the total wre delay up to 42% as compared to conventonal approaches. The complexty of the proposed algorthm s lnear to the number of planes that the wre spans. Key words: 3-D ICs, repeater nserton, on-chp nterconnect, tmng optmzaton Introducton In 3-D ICs, the wre length s sgnfcantly reduced due to the short vertcal nterconnects. Although 3-D ICs are expected to greatly reduce the wre length as compared to planar crcuts, methods to further mprove the nterconnect delay are requred. Ths stuaton s due to the length of the global nterconnects that lmt the overall performance of a 3-D crcut. Many repeater nserton algorthms have been proposed for 2-D nterconnects. The optmal number and sze of the repeaters to acheve the mnmum nterconnect delay for a dstrbuted RC nterconnect are descrbed n [], [2]. A unform repeater desgn methodology for effcently drvng RC tree structures s presented n [3]. Alpert and Devgan present theoretcal results, whch determne the requred number of repeaters for a wre wth unform mpedance characterstcs [4]. Applyng these repeater nserton technques for 2-D nterconnects to 3-D nets traversng multple planes does not result n the mnmum nterconnect delay. In a 3-D system, each physcal plane can be fabrcated wth a dfferent process or technology node resultng n dverse nterconnect mpedance characterstcs. In addton, the varous manufacturng technologes for the vertcal nterconnects (e.g., through slcon va (TSV)) affect the delay of the nterplane nterconnects [5]. All of these factors complcate the repeater nserton task for 3-D nterconnects. Recently, a smultaneous buffer and TSV plannng algorthm for 3-D crcuts has been presented n [6] where the sze and number of the repeaters are consdered known. The mpedance characterstcs of each plane are
2 2 Hu Xu et al. consdered unform. In practce, however, the sze and number of repeaters on dfferent planes need to be determned consderng the dsparate nterconnect mpedance characterstcs. Addtonally, the repeaters nserted n one plane affect the total delay of the nterconnect and the sze, number, and locaton of the repeaters nserted n adjacent planes. The objectve of ths paper, therefore, s to determne the sze, number, and locaton of the repeaters cohesvely nserted n all of the segments. A methodology for determnng these solutons for a 3-D wre that spans several physcal planes s ntroduced, where the trats of the 3-D nterconnects are properly consdered. The proposed approach consders the effect of repeaters on the delay of the wre segments on adjacent planes and teratvely decreases the delay of a 3-D wre. The remander of the paper s organzed as follows. The delay model for a 3-D nterconnect wth repeaters used n ths paper s ntroduced n Secton 2. The proposed method for nsertng repeaters n 3-D nterconnects s presented n Secton 3. Smulaton results are shown n Secton 4. The conclusons are summarzed n the last secton. 2 Delay Model for a 3-D Wre The delay model of a wre segment wthn one physcal plane of a 3-D crcut and the method to determne the number, sze, and locaton of the repeaters for ths segment s dscussed n ths secton. The delay model for a 3-D wre comprsng several of these segments s also presented. A 3-D wre wth repeaters s llustrated n Fgure. x ( n) s the dstance between the frst repeater and the TSV for > or the drver of the wre for =. y s the dstance between the last repeater and the TSV for < n or the recever of the wre for = n. k s the number of repeaters nserted n plane. h represents the sze of the repeaters, whch s the multple of the mnmum sze of the repeater that can be used n plane. ln xn kn, hn yn l2 TSVn- x2 k2, h2 y2 TSV2 TSV x k, h y l Fg. : A 3-D wre wth repeaters.
3 Repeater Inserton for 3-D Interconnects 3 The total delay of a 3-D nterconnect can be dvded nto 2n components ncludng the delay of the horzontal segments on the n planes where repeaters can be nserted and the delay of the TSVs. The delay of the TSVs can be consdered constant. The delay of a horzontal segment can be modeled by an RC dstrbuted lne wth repeaters, as llustrated n Fgure 2. R n_ r ( l x y ) k r x c ( l x y ) k c x R b / h R b / h R b / h r c y y h C b hc b h C b C L_ T x T repeater_chan T y Fg. 2: The electrcal model of one nterconnect segment of a 3-D wre. In Fgure 2, R n s the nput resstance of the segment. C L s the load capactance. For the segment on the frst plane, R n = R source and for the segment on the last plane, C L = C snk. R b and C b are the resstance and capactance, respectvely, of the mnmum sze repeater on plane. If R n and C L are known and there are k repeaters wth sze h, where k 2, the total delay of a wre segment on plane based on Elmore delay model [7] can be wrtten as T seg =T x + T repeater chan + T y =R b C b (k ) + (l x y ) 2 r c 2(k ) C b (R n + (l y )r )h + R n c x + x2 r c 2 + R b(c L + (l x )c ) h + + y2 r c 2 + y r C L. () The varables n () are h, k, x, and y. The physcal constrants for these varables, respectvely, are h ; k 2; x l ; y l ; x + y l. (2) To mnmze () s a rather formdable task. Alternatvely, () can be wrtten as a two-varable functon. For gven x and y, T seg s convex wth respect to k and h, whch means that for each par of (x, y ), there s a par of (k, h ) that produces the mnmum delay. Let T seg h = and T seg k =, (k, h ) can be wrtten as a functon of (x, y ), R b (C L + (l x )c ) C b (R n + (l y )r ). (3) r c k = (l x y ) +, h = 2R C
4 4 Hu Xu et al. Replacng (k, h ) by (3), the delay T seg (x, y ) s T seg (x, y ) = (l x y ) 2R b C b r c + R n c x + x2 r c + y2 r c y r C L + 2 R b C b (C L + (l x )c )(R n + (l y )r ). (4) Snce x and y are constraned accordng to (2), the mnmum of (4) and a feasble soluton (x, y ) can be determned wth numercal methods [8]. If there s only one repeater nserted along the segment, k = and y = l x. The total delay s T seg = T x + T l x. The expressons for the delay of the segment where k 2 or k = are consstent. For a horzontal segment wthn a 3-D crcut consstng of n planes, the expressons for the nput resstance and the output capactance of each segment are modfed to nclude the mpedance of the TSVs and the nterconnect sectons x + and y, respectvely, { Rsource, f = R n = R b( ) h + r y + R tsv, f, { Csnk, f = n C L = C b(+) h + + c + x + + C tsv, f n. (5) Due to (5), the repeaters nserted n segments and + can consderably affect the repeaters nserted n segment. For a 3-D nterconnect shown n Fgure, expressons (5) and (3) are used to determne (k, h ) for segments to n. T total can be expressed as a functon of {(h, x, y ) n}, T total = n = ( (l x y ) 2R b C b r c + R b((l x )c + C L ) h + (R n + (l y )r )C b h + R n c x + x2 r c 2 where R n = + y2 r c 2 + y r C L ), { Rsource f = R tsv f. (6) By replacng R n and C L n (3) wth (5), h s coupled to the soluton for the two adjacent segments. Ths dependency complcates the optmzaton process. To formally mnmze (6) requres computatonally expensve optmzaton technques snce (6) s a non-polynomal functon. Instead, (4) s utlzed n the proposed approach to mnmze the delay of each segment teratvely and results n a near-optmum soluton for nsertng repeaters n a multplane net. Ths approach completes the repeater nserton n O(n) tme, where n s the number of planes. Note that the effect of the repeaters nserted n adjacent segments on the delay of the nvestgated segment s consdered n (4) through (5).
5 3 Repeater Inserton Algorthm Repeater Inserton for 3-D Interconnects 5 In ths secton, an algorthm for nsertng repeaters n 3-D nterconnects s presented. The proposed algorthm determnes a near-optmal soluton S based on (4). The pseudo-code of ths algorthm (Iterated Optmzaton) s llustrated n Algorthm. The proposed algorthm conssts of two phases descrbed n the followng subsectons. Algorthm Iterated Optmzaton Input: 3-D wre W. Output: T, {(h, k, x, y ) n}. : R n R source; C L n C snk ; T = {frst phase} 2: for all segment n W do 3: R n R b ( ) + r tsv ( ) 4: end for 5: for = n to do 6: [T, (h, k, x, y )] T + segt opt(r n, C L ); 7: Update(R n +, C L ); 8: end for {second phase} 9: whle T > target rato do : T : for = n to do 2: [T, (h, k, x, y )] T + seg opt(r n, C L ); 3: Update(R n +, C L ); 4: end for 5: end whle 3. Determne an ntal soluton In the frst phase, an ntal soluton s obtaned. The mnmum delay of each segment s successvely determned, for = n to, assumng that a mnmum sze repeater (.e., h = ) s nserted n the precedng segment, exactly before the TSV (.e., y = ), as llustrated n Fgure 3. The algorthm starts from plane n. The correspondng h n, k n, x n and y n are determned based on (3) - (4) by the procedure seg opt(r n, C L ) n Algorthm. In the procedure Update(R n +, C L ), the load for segment n s determned by the resultng h n and x n. By assumng that R n n = R tsv + R b(n 2), a soluton for segment n can be determned. Steps 7 to n Algorthm are appled to all of the wre segments. In ths way, the ntal delay T total of the entre wre s determned, where the superscrpt ndcates the number of teratons. Wth the ntal soluton S, the set {(R n, C L ) n} for all segments s updated (see expresson (5)).
6 6 Hu Xu et al. segment - segment segment + x h l -x -y, k h y TSV C L_ Fg. 3: A mnmum sze repeater next to the TSV n segment s assumed. 3.2 Refnement of the soluton In the second phase, the nterconnect delay s teratvely mproved. The second phase starts wth the updated set {(R n, C L ) n} obtaned n the frst phase. Smlar to the frst phase, from = n to, (3) and (4) are used to determne a new (h, k, x, y ), as descrbed n lnes 2-6 n Algorthm. Compared wth the frst phase, the R n used for each segment s updated. Snce the R n and C L used n (3) - (4) nclude the effect of the new (h, k, x, y ) on the delay of segments and +, the delay determned n ths teraton s smaller or at least no greater than the prevously determned delay. Proposton Gven the ntal delay T total, the soluton S obtaned n the frst phase and the delay T total obtaned by the soluton S determned n the frst teraton of the second phase, T total T total. Proof. Proposton s proved by nducton.. Assumng that segment ( n ) s processed, the new soluton for ths segment s s = (h, k, x, y ) and the prevous soluton s s = (h, k, x, y ), where the superscrpts ndcate the number of teraton. The new solutons s + to s n for segment + to n have been determned, snce the wre s traversed from the snk towards the drver. The solutons for segment to, however, are those of the prevous teraton s to s, as llustrated n Fgure 4(a). y TSV x h l x y, k y c L _ y TSV x h l x y, k y c L _ h (a) An ntal soluton for segment. (b) Refnement of the soluton. Fg. 4: Iteratve process to nsert repeaters n segment. The allocaton of the repeaters n segment based on the soluton s s llustrated n Fgure 4(a), whle the repeaters n segments + to n are adjusted accordng to s + to s n durng teraton. The total delay of the 3-D wre n Fgure 4(a) s T+, where the subscrpt ndcates that segments + to n have been processed n teraton. For segment, s s determned based on the assumpton of placng a repeater n segment depcted by h
7 Repeater Inserton for 3-D Interconnects 7 the dashed lne n Fgure 4(a). s, therefore, does not provde the mnmum delay from the last repeater (depcted by the sold lne) n segment to the frst repeater n segment + n teraton. Ths behavor s due to the updated nput resstance and the load capactance of segment accordng to s and s +, respectvely. The allocaton of the repeaters n segment after ths segment has been processed n the frst teraton s depcted n Fgure 4(b). The total delay of the 3-D wre n Fgure 4(b) s now T. For Rn and C L, s s determned through (3) and (4). s results n a smaller delay from the last repeater n segment to the frst repeater n segment + as compared to s, snce s s determned by usng the updated R n and C L. Consequently, the total delay of the 3-D wre n Fgure 4(b) s not greater than the total delay of the 3-D wre n Fgure 4(a),.e., T T+. 2. For segment n, CL n = C snk. Smlar to the aforementoned proof, Tn Ttotal. Consequently, from and 2, T total = T Tn Ttotal. T + After the frst teraton, a new soluton S and delay Ttotal are obtaned, as well as a new set {(Rn, C L ) n}. Snce h and y can be dfferent from h and y, R n also dffers from R n. The soluton s for segment, however, s determned based on Rn. Consequently, n the next teraton, the total wre delay s further decreased by re-determnng the soluton for segment based on Rn. Based on S and {(Rn, C L ) n}, the second teraton commences. Smlar to Proposton, Ttotal 2 T total. The resultng delay of the 3-D wre at each teraton wll be no greater than the result of the prevous teraton. As llustrated n lne of Algorthm, when T = T total total s smaller Ttotal than target rato, the algorthm termnates. The target rato s consdered to be user-specfed. Consderng that the tme used to mnmze (4) s constant O(), the complexty of the proposed algorthm s O(n). 4 Smulaton Results In ths secton, the smulaton results are presented. The Iterated Optmzaton s appled to several 3-D nterconnects. The ASU predctve technology model (PTM) [9] s used to extract the parameters of the nterconnect and the repeaters. To nvestgate the effectveness of the proposed algorthm, two other approaches for nsertng repeaters n 3-D nterconnects have been adapted from the methods used for 2-D nterconnects. The frst approach assumes that the repeaters are equally spaced n each segment [], [3]. There s a repeater nserted before and after each TSV, respectvely, as llustrated n Fgure 5(a). Wth ths assumpton, each segment s treated as a 2-D nterconnect. The delay of the segments s decoupled and repeaters are ndvdually nserted n each segment based on []. In ths approach, {x =, y = n}. The optmum number k and sze h of the repeaters can be determned by (3). Alternatvely n the second approach, the last repeater n each plane s nserted rght before the TSV that connects ths segment, as llustrated n Fgure
8 8 Hu Xu et al. 5(b). In Fgure 5(b), the soluton {(h, k, x ) n} s determned through (3) and (4) from plane to plane n, respectvely. h+ h+ h l, k h TSV2 h l, k h TSV2 TSV TSV h-= h-= (a) Approach (b) Approach 2 Fg. 5: Approaches from the repeater nserton method used n 2-D. All of the approaches are appled to 3-D wres of dfferent length that span three physcal planes. The parameters used n the smulatons are lsted n Table. The locaton of the repeaters nserted by employng the Iterated Optmzaton algorthm and the wre delay after applyng the three approaches are lsted n Table 2. The number and sze of the repeaters nserted n the three approaches are reported n Table 3. Table : Smulaton Parameters. Tech. r c Rb Cb Rsource Csnk Rtsv Ctsv Rtsv 2 Ctsv 2 Plane [nm] [Ω/mm] [ff/mm] [Ω] [ff] [Ω] [ff] [Ω] [ff] [Ω] [ff] Table 2: 3-D Wre Delay after Applyng the Three Approaches. The wre spans three planes. l, l 2, l 3 are the length of the segment on plane, 2, and 3, respectvely; Itnum s the number of teratons and the target rato s %; Area = 3 = hk. %Impr = T T mn, %Impr2 = T 2 T mn T 2. Iterated Optmzaton Approach Approach 2 l l 2 l 3 x y x 2 y 2 x 3 y 3 Itnum Tmn T T 2 % Impr % Impr2 [mm] [mm] [mm] [mm] [mm] [mm] [mm] [mm] [mm] [ps] [ps] [ps] % % % % % % % % % % % % % % % % % % % % Average decrease n delay 9.69% 7.84% T
9 Repeater Inserton for 3-D Interconnects 9 Table 3: The Number and Sze of Repeaters Assgned by Dfferent Approaches. k, h are the number and sze, respectvely, of the repeaters nserted on plane. Area = 3 = h k. Iterated Optmzaton Approach Approach 2 h h 2 h 3 k k 2 k 3 h h 2 h 3 k k 2 k 3 h h 2 h 3 k k 2 k Average area Average area Average area 3. Compared wth approach and approach 2, the Iterated Optmzaton decreases the nterconnect delay by % to 42% and 3% to 26%, respectvely. To utlze the methods used n 2-D nterconnects n approaches and 2, at least two (one) repeaters are nserted n each segment n approach (2) to decouple the delay of the nvestgated segment from the adjacent segments. In the Iterated Optmzaton, the locaton of the frst and the last repeater can be teratvely adjusted. In addton, no repeater s nserted for specfc short segments as lsted n Table 3. Consequently, the Iterated Optmzaton produces the smallest nterconnect delay. Note that when the total number of nverters nserted along the wre s the same for all of the approaches, the Iterated Optmzaton produces the smallest delay. For each segment of a 3-D wre, the effect of the adjacent segments on the delay of the segment s consdered durng the repeater nserton process. Redundant or overszed repeaters are therefore not nserted. As reported n Table 3, fewer repeaters are nserted nto 3-D nterconnects where the Iterated Optmzaton s appled as compared to the other two approaches. Consequently, the proposed approach decreases the power consumed and the area occuped by repeaters. In addton, for the nvestgated nterconnects, the teratons of the proposed approach are approxmately four, whch shows that the algorthm converges fast. 5 Conclusons A method to nsert repeaters for 3-D nterconnects s descrbed. The sze and number of repeaters s teratvely adapted to decrease the delay of a 3-D wre. Ths novel technque s compared to two approaches adapted from repeater nserton technques for 2-D nterconnects. Smulaton results demonstrate that the proposed approach for nsertng repeaters n 3-D crcuts decreases the total delay up to 42% and reduces the number and area of the nserted repeaters wthn
10 Hu Xu et al. a few teratons. By properly nsertng repeaters nto 3-D wres, the nterconnect performance of 3-D crcuts s sgnfcantly mproved. References. Bakoglu, H. B., Mendl, J. D.: Optmal Interconnecton Crcuts for VLSI. IEEE Transactons on Electron Devces, vol. 32, no. 5, pp (985) 2. Dhar, S., Frankln, M. A.: Optmal Buffer Crcuts for Drvng Long Unform Lnes. IEEE Journal of Sold-State Crcuts, vol. 26, no., pp (99) 3. Adler, V., Fredman, E. G.: Unform Repeater Inserton n RC Trees. IEEE Transactons on Crcuts and Systems I, vol. 47, no., pp (2) 4. Alpert, C., Devgan, A.: Wre Segmentng for Improved Buffer Inserton. In: IEEE/ACM Desgn Automaton Conference, pp (997) 5. Pavlds, V. F., Fredman, E. G.: Tmng-Drven Va Placement Heurstcs For Three-dmensonal ICs. Integraton, the VLSI Journal, vol. 4, no. 4, pp (28) 6. He, X., Dong, S., Ma, Y., Hong, X.: Smultaneous Buffer and Interlayer Va Plannng for 3D Floorplannng. In: IEEE Internatonal Symposum on Qualty Electronc Desgn, pp (29) 7. Elmore, W. C.: The Transent Analyss of Damped Lnear Networks wth Partcular Regard to Wdeband Amplfers. Journal of Appled Physcs, vol. 9, no., pp (948) 8. Waltz, R. A., Morales, J. L., Nocedal, J., Orban, D.: An Interor Algorthm For Nonlnear Optmzaton that Combnes Lne Search and Trust Regon Steps. Mathematcal Programmng, vol. 7, no. 3, pp (26) 9. ASU Predctve Technology Model, ptm/
Parallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationExplicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements
Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationHow Accurately Can We Model Timing In A Placement Engine?
How Accurately Can We Model Tmng In A Placement Engne? Amt Chowdhary, Karth Raagopal, Satsh Venatesan, Tung Cao, Vladmr Tourn, Yegna Parasuram, Bll Halpn Intel Corporaton Serra Desgn Automaton Synplcty,
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationRoutability Driven Modification Method of Monotonic Via Assignment for 2-layer Ball Grid Array Packages
Routablty Drven Modfcaton Method of Monotonc Va Assgnment for 2-layer Ball Grd Array Pacages Yoch Tomoa Atsush Taahash Department of Communcatons and Integrated Systems, Toyo Insttute of Technology 2 12
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationMulti-objective Design Optimization of MCM Placement
Proceedngs of the 5th WSEAS Int. Conf. on Instrumentaton, Measurement, Crcuts and Systems, Hangzhou, Chna, Aprl 6-8, 26 (pp56-6) Mult-objectve Desgn Optmzaton of MCM Placement Chng-Ma Ko ab, Yu-Jung Huang
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationPost-Layout Timing-Driven Cell Placement Using an Accurate Net Length Model with Movable Steiner Points *
Post-Layout mng-drven Cell Placement Usng an Accurate Net Length Model wth Movable Stener Ponts * Amr H. Ajam and Massoud Pedram Department of Electrcal Engneerng - Systems Unversty of Southern Calforna
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More information3D-GCP: An Analytical Model for the Impact of Process Variations on the Critical Path Delay Distribution of 3D ICs
3D-GCP: An Analytcal Model for the Impact of Process Varatons on the Crtcal Path Delay Dstrbuton of 3D ICs Sddharth Garg, Dana Marculescu Dept. of ECE, Carnege-Mellon Unversty, PA USA E-mal: sgarg1@andrew.cmu.edu,
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
More informationCrosstalk-Affected Propagation Delay in Nanometer Technologies
Int'l Journal of Electroncs, 2008 ABSTRACT Crosstalk-Affected Propagaton Delay n Nanometer Technologes Shahn Nazaran Massoud Pedram Unversty of Southern Calforna, EE Dept., Los Angeles, CA shahn@usc.edu
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationMemory Modeling in ESL-RTL Equivalence Checking
11.4 Memory Modelng n ESL-RTL Equvalence Checkng Alfred Koelbl 2025 NW Cornelus Pass Rd. Hllsboro, OR 97124 koelbl@synopsys.com Jerry R. Burch 2025 NW Cornelus Pass Rd. Hllsboro, OR 97124 burch@synopsys.com
More informationA Multilevel Analytical Placement for 3D ICs
A Multlevel Analytcal Placement for 3D ICs Jason Cong, and Guoje Luo Computer Scence Department Unversty of Calforna, Los Angeles Calforna NanoSystems Insttute Los Angeles, CA 90095, USA Tel : (30) 06-775
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationConfiguration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations*
Confguraton Management n Mult-Context Reconfgurable Systems for Smultaneous Performance and Power Optmzatons* Rafael Maestre, Mlagros Fernandez Departamento de Arqutectura de Computadores y Automátca Unversdad
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationObstacle-Aware Routing Problem in. a Rectangular Mesh Network
Appled Mathematcal Scences, Vol. 9, 015, no. 14, 653-663 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.015.411911 Obstacle-Aware Routng Problem n a Rectangular Mesh Network Norazah Adzhar Department
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationA Dual-MST Approach for Clock Network Synthesis
A Dual-MST Approach for Clock Network Synthess Jngwe Lu Wng-Ka Chow Chu-Wng Sham Evangelne F.Y. Young Electronc and Electronc and Electronc and Computer Scence Informaton Engneerng Informaton Engneerng
More informationParallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations
Journal of Physcs: Conference Seres Parallel Branch and Bound Algorthm - A comparson between seral, OpenMP and MPI mplementatons To cte ths artcle: Luco Barreto and Mchael Bauer 2010 J. Phys.: Conf. Ser.
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationMOBILE Cloud Computing (MCC) extends the capabilities
1 Resource Sharng of a Computng Access Pont for Mult-user Moble Cloud Offloadng wth Delay Constrants Meng-Hs Chen, Student Member, IEEE, Mn Dong, Senor Member, IEEE, Ben Lang, Fellow, IEEE arxv:1712.00030v2
More informationA Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme
Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty
More informationOptimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition
Optmal Desgn of onlnear Fuzzy Model by Means of Independent Fuzzy Scatter Partton Keon-Jun Park, Hyung-Kl Kang and Yong-Kab Km *, Department of Informaton and Communcaton Engneerng, Wonkwang Unversty,
More informationAdaptive Virtual Support Vector Machine for the Reliability Analysis of High-Dimensional Problems
Proceedngs of the ASME 2 Internatonal Desgn Engneerng Techncal Conferences & Computers and Informaton n Engneerng Conference IDETC/CIE 2 August 29-3, 2, Washngton, D.C., USA DETC2-47538 Adaptve Vrtual
More informationA Min-Cost Flow Based Detailed Router for FPGAs
A Mn-Cost Flow Based Detaled Router for FPGAs eokn Lee Dept. of ECE The Unversty of Texas at Austn Austn, TX 78712 Yongseok Cheon Dept. of Computer cences The Unversty of Texas at Austn Austn, TX 78712
More informationPreconditioning Parallel Sparse Iterative Solvers for Circuit Simulation
Precondtonng Parallel Sparse Iteratve Solvers for Crcut Smulaton A. Basermann, U. Jaekel, and K. Hachya 1 Introducton One mportant mathematcal problem n smulaton of large electrcal crcuts s the soluton
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationDesign for Reliability: Case Studies in Manufacturing Process Synthesis
Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationRouting on Switch Matrix Multi-FPGA Systems
Routng on Swtch Matrx Mult-FPGA Systems Abdel Enou and N. Ranganathan Center for Mcroelectroncs Research Department of Computer Scence and Engneerng Unversty of South Florda Tampa, FL 33620 Abstract In
More informationLS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationConvolutional interleaver for unequal error protection of turbo codes
Convolutonal nterleaver for unequal error protecton of turbo codes Sna Vaf, Tadeusz Wysock, Ian Burnett Unversty of Wollongong, SW 2522, Australa E-mal:{sv39,wysock,an_burnett}@uow.edu.au Abstract: Ths
More informationTest-Cost Modeling and Optimal Test-Flow Selection of 3D-Stacked ICs
Test-Cost Modelng and Optmal Test-Flow Selecton of 3D-Stacked ICs Mukesh Agrawal, Student Member, IEEE, and Krshnendu Chakrabarty, Fellow, IEEE Abstract Three-dmensonal (3D) ntegraton s an attractve technology
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationAdaptive Weighted Sum Method for Bi-objective Optimization
45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamcs & Materals Conference 19-22 Aprl 2004, Palm Sprngs, Calforna AIAA 2004-1680 Adaptve Weghted Sum Method for B-objectve Optmzaton Olver de Weck
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationImperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments
Fourth Internatonal Conference Modellng and Development of Intellgent Systems October 8 - November, 05 Lucan Blaga Unversty Sbu - Romana Imperalst Compettve Algorthm wth Varable Parameters to Determne
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationChannel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7
Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationA 3D Physical Design Flow Based on OpenAccess
A 3D Physcal Desgn Flow Based on OpenAccess Jason Cong 1,2, Fellow, IEEE, and Guoje Luo 1, Student Member, IEEE 1 Computer Scence Department, Unversty of Calforna, Los Angeles, CA 90095, USA 2 Calforna
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationModeling Multiple Input Switching of CMOS Gates in DSM Technology Using HDMR
1 Modelng Multple Input Swtchng of CMOS Gates n DSM Technology Usng HDMR Jayashree Srdharan and Tom Chen Dept. of Electrcal and Computer Engneerng Colorado State Unversty, Fort Collns, CO, 8523, USA (jaya@engr.colostate.edu,
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationAnalog Circuit Sizing using Adaptive Worst-Case Parameter Sets
Analog Crcut Szng usng Adaptve Worst-Case Parameter Sets R. Schwencker 1,2, F. Schenkel 1, M. Pronath 1, H. Graeb 1 1 Insttute for Electronc Desgn Automaton 2 Infneon Technologes Techncal Unversty of Munch
More informationShape Optimization of Shear-type Hysteretic Steel Damper for Building Frames using FEM-Analysis and Heuristic Approach
The Seventh Chna-Japan-Korea Jont Symposum on Optmzaton of Structural and Mechancal Systems Huangshan, June, 18-21, 2012, Chna Shape Optmzaton of Shear-type Hysteretc Steel Damper for Buldng Frames usng
More informationCategories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms
3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu
More informationOptimization of integrated circuits by means of simulated annealing. Jernej Olenšek, Janez Puhan, Árpád Bűrmen, Sašo Tomažič, Tadej Tuma
Optmzaton of ntegrated crcuts by means of smulated annealng Jernej Olenšek, Janez Puhan, Árpád Bűrmen, Sašo Tomažč, Tadej Tuma Unversty of Ljubljana, Faculty of Electrcal Engneerng, Tržaška 25, Ljubljana,
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More information