Analog Circuit Sizing using Adaptive Worst-Case Parameter Sets
|
|
- Juliet Porter
- 6 years ago
- Views:
Transcription
1 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 P.O. Box Munch, Germany Munch, Germany Abstract In ths paper, a method for nomnal desgn of analog ntegrated crcuts s presented that ncludes process varatons and operatng ranges by worst-case parameter sets. These sets are calculated adaptvely durng the szng process based on senstvty analyses. The method leads to robust desgns wth hgh parametrc yeld, whle beng much more effcent than desgn centerng methods. 1 Introducton In ntegrated crcut technologes wth ever shrnkng feature szes and growng performance requrements, the nfluence of process varatons on the behavor and yeld of analog crcuts cannot be neglected. In order to be able to desgn robust crcuts, random process fluctuatons and also varatons of the operatng condtons (e.g. temperature and supply voltage must be taken nto account as early as possble n the desgn cycle. Furthermore a hgh degree of automaton s needed for analog crcut desgn n order to cope wth the demand of an ever shorter tme-to-market [9]. Powerful tools for nomnal desgn, e.g. [5, 14, 15], were developed and some are commercally avalable. Nomnal desgn usually does not consder process fluctuatons and varatons of the operatng condtons. Therefore, nomnal desgn can only guarantee that the gven specfcatons are fulflled for the typcal process and nomnal operatng condtons. Due to the growng nfluence of process fluctuaton and changes n the operatng condtons, desgn centerng s necessary n addton to nomnal desgn n order to ensure a hgh producton yeld. Many approaches to desgn centerng, based on statstcal, e.g. [2, 11], and determnstc methods, e.g. [1, 6, 12], were presented. Usually desgn centerng algorthms are computatonally very expensve. Hence the desgn centerng process should be started from a good nomnal desgn n order to keep the computatonal cost small. Ths can be acheved by ntroducng worst-case parameter sets for process and operatng condtons nto nomnal desgn [4, 6]. In the dgtal doman, process fluctuatons are beng consdered by means of slow and fast worst-case parameter sets. These are calculated for a gven process and typcal crcut performance lke delay, but ndependent from a specfc crcut. For dgtal cell lbrares, these parameter sets gve a good estmaton of the nfluence of random fluctuatons on the relevant dgtal crcut performances, delay and power. However t s well known that such dgtal corners cases are not suffcent for analog desgn [6, 13]. Usng dgtal corner cases for analog crcut desgn bears a hgh rsk of leavng yeld problems undetected untl producton. For analog desgn, worst-case parameter sets therefore need to be calculated for each crcut topology and each crcut performance ndvdually. Usng such performance-specfc worst-case parameter sets for crcut szng faces the problem that they depend on the nomnal desgn parameter set and hence vary durng the szng process. In ths paper, a new effcent szng algorthm s presented that smultaneously consders process fluctuaton and operatng condtons. It features: calculaton of ndvdual worst-case parameter sets for each performance, adaptve calculaton of worst-case parameter sets n each teraton step of the szng process based on smple and fast senstvty analyses. effcent trust regon optmzaton algorthm usng szng rules [10]. The paper s structured as follows: The next secton formulates worst-case parameter sets. The new szng algorthm s dscussed n Secton 3, and the results are presented n Secton 4. 2 Worst-case parameter sets and yeld For a gven topology, a crcut can be descrbed by ts parameters and performances. Three types of parameters can be dstngushed: Desgn parameters d R n d (e.g. nomnal transstor wdths and lengths can be adjusted by the crcut desgner. Process fluctuatons for nstance at oxde thckness, threshold voltage, or transstor wdth varaton, are modeled by statstcal parameters s R ns and ther dstrbuton functon. As shown n [7], all practcally mportant parameter dstrbutons can be transformed nto a
2 Gaussan dstrbuton wth zero mean value and covarance matrx C: s N(0, C. The probablty densty functon pdf (s s then gven by: ( pdf (s = (2π ns 2 (det C 1 2 exp β2 (s (1 2 β 2 (s = s T C 1 s. (2 In ntegrated crcut desgn, most statstcal parameters appear as transstor model parameters (e.g. tox, or vth0 and cannot be adjusted by the crcut desgner f a frozen, fully qualfed producton process s assumed. Operatng parameters θ R n θ (e.g. supply voltage, temperature descrbe the crcut s operatng condtons. The crcut must satsfy ts performance specfcaton for a gven range T θ of the operatng parameters, defned by ther lower bounds θ L and upper bounds θ U : T θ = {θ θ L θ θ U }. (3 The crcut s performance values f (e.g. gan, delay can be calculated for a gven parameter set usng an analog crcut smulator: (d, s, θ f. Dependng on the performance, a crcut smulaton means solvng a system of nonlnear equatons (DC- and AC-analyss or ntegratng a system of nonlnear algebro-dfferental equatons (transent analyss. For the crcut performances, lower and/or upper specfcaton bounds f b,, = 1,..., n b are defned that have to be met for a correctly operatng crcut: f (d, s, θ f b, f(d, s, θ f b. (4 =1,...,n b Here, upper bounds are ncluded by f f b, where f b, < 0. Consderng varatons n the operatng condtons, the specfcaton bounds have to be met for the whole operatng range: f(d, s, θ f b. (5 θ T θ The parametrc yeld Y s the percentage of crcuts that satsfy (5: Y (d = pdf (s ds. (6 {s f(d,s,θ f b} θ T θ Durng szng, process and operatng varatons can be consdered by means of worst-case parameter sets that represent a certan standard devaton β max of process varatons [3]: For each performance specfcaton bound f b,, a worst-case parameter devaton s determned accordng to (s, θ = argmn f (d, s, θ s,θ subject to β 2 (s β 2 max and θ T θ. For nstance, β max = 3 corresponds to a 3σ desgn. Satsfyng (5 at the worst-case parameter sets guarantees a mnmum parametrc yeld (7 Y Y l 1 (n s = F ns (β 2 max, (8 Performance nomnal 3σ slow/fast 3σ worst-case Delay [ns] (+42% 1.92 (+42% Delay [ns] (+33% 1.90 (+33% Hysteress [mv] ( 8.0% 441 ( 28% Table 1: Performance values for a Schmtt trgger compared at slow/fast parameter sets and at worst-case parameter sets accordng to Eq. (7. where F ns s the probablty functon of a χ 2 -dstrbuton wth n s degrees of freedom. If f s monotonous wth regard to s, then another loose lower bound can be gven by Y Y l 2 (n f = 1 Φ( β max n b, (9 where Φ s the probablty functon of the normal dstrbuton. For example, f β max = 3 then Y l 2 (n f 100% 0.135% n b. (10 Snce Y1 l depends on the number n s of statstcal parameters, and Y2 l depends on the number n b of bounds, ether lower bound can be the greater one. For dgtal crcuts, t turned out that the s of delay and power consumpton are practcally ndependent from szng and topology. Therefore t s common practce to calculate a set of slow/fast worst-case parameter sets once for a manufacturng process and then use t for all dgtal cells. The worst-case operatng ponts θ are also practcally ndependent from szng and topology, but T θ s part of the crcut specfcaton, not of the process. Therefore, the θ of delay and power are to be determned once for T θ. For analog crcuts, slow/fast sets are nsuffcent. Frst they do not ncorporate non-dgtal performances. Tab. 1 compares the performance values of the Schmtt trgger buffer of Fg. 2 at the slow/fast corners of a 0.18µm-process wth the performance values at the actual worst-case parameter sets calculated drectly for ths topology and szng accordng to Eq. (7. As can be seen, the slow/fast performance values of the delays conform to the actual worst-case performance values. In contrast to that, the 3σ worst-case value of the thrd performance hysteress s n fact much worse than ndcated by a smulaton at the slow or fast parameter set. Usng these parameter sets to verfy a specfcaton regardng hysteress wll therefore pretend an unrealstcally hgh robustness. Secondly, worst-case parameter sets depend on the analog crcut s topology. Assume for nstance a process consstng of only two random varables, s n that nfluences solely NMOS transstors and s p for the PMOS transstors. Further gven are a current mrror completely bult of NMOS transstors and another one completely bult of PMOS transstors. It s then obvous, that the frst crcut s only affected by s n, whereas the second one s affected only by s p. Hence the 3σ worst-case parameter sets wll be orthogonal. Thrd, worst-case parameter sets depend on szng, see Sec. 4.
3 3 Szng and adapton of worst-case parameter sets Worst-case szng s the task of fndng a desgn parameter vector d that guarantees a mnmum yeld accordng to Eqs. (8, 9. Snce the worst-case parameter sets depend on the szng n a non-lnear manner, we propose an teratve numercal optmzaton. Snce the exact calculaton of the worst-case parameter sets (s, θ s computatonally expensve, we ntroduce an approach to relaxed calculaton of worst-case parameter sets based on lnear approxmatons. An update of the approxmated worst-case parameter sets s performed at each teraton step. Begnnng wth µ = 0, the followng actons are performed n each teraton step of the algorthm, The steps 1 through 6 are performed for each specfcaton f b, (see Fg the correspondng performance f s lnearzed wth respect to the operatng parameters θ at ts respectve worst-case parameter set ( s (µ 1 (µ 1, θ and desgn parameter set d (µ 1 of the prevous step : = θ f. (11 (µ 1, s (µ 1, θ (µ 1 2. Then, the components j of the worst-case operatng parameter set g θ ( θ = j are calculated: { ( (θl j f (θ U j else g j 0. (12 3. Performance f s lnearzed wth respect to the statstcal parameters s at the worst-case parameter set from the prevous teraton step ( s (µ 1 and at the worst-case operatng parameter set of the current teraton step ( θ h 4. Thereafter, s s defned by = s : = s f. (13 (µ 1, s (µ 1, θ h β 2 max T C h C h. (14 5. Performance f s then lnearzed wth respect to desgn parameters d at the worst-case parameter set of the current teraton step ( s, θ 1 : k = d f (µ 1, s, θ (15 1 Please note that each teraton step s dvded nto 3 update steps accordng to the 3 parameter types. Frst, the worst-case operatng parameter (µ 1 set s updated: θ wc θ wc. Thereafter ths updated worst-case operatng parameter set θ wc s already used for the senstvty calculaton that leads to an updated worst-case parameter set s (µ 1 wc s wc. The updated worst-case parameter set s then used for the senstvty calculaton leadng to an updated desgn parameter set d (µ 1 d. Usng the latest avalable parameter sets for each update step contrbutes to the effcency of the algorthm. µ := 0, d := d (0 µ := µ + 1 For each specfcaton f b, Determne g, θ Determne h, s Determne k Mnmze ϕ (d subject to d F d Untl f (d, s, θ > f b, Fgure 1: Structure of optmzaton algorthm. f (d = f (d (µ 1, s, θ +k T (d d. (16 6. The parameter dstance functon α (d [15] s then defned as α (d = f (d f b,. (17 k The objectve functon ϕ (d s calculated based on the parameter dstances α for the specfcatons f b,, = 1,..., n b : n b ( ϕ (d = exp a α (d, a > 0. (18 =1 The postve constant factor a s a weghtng factor. Hgh values of a make the optmzer focus stronger on volated specfcatons. 7. The objectve functon ϕ (d s then mnmzed by means of a trust regon method presented n [15]: d = argmn ϕ (d subject to d F, (19 d where F s the feasblty regon that guarantees the basc functonalty and robustness of a crcut [10]. The constrant d F ensures that functonal constrants lke all transstors must be n saturaton are fulflled durng the szng. The feasblty regon F s the subset of the desgn space where all functonal constrants are fulflled. Consderng F s crucal for automated szng of crcuts: The result of the szng has to be feasble n order to represent a techncally correct crcut. Only parameter vectors d F are techncally vald solutons. Most performances are only weakly nonlnear n the feasblty regon. Therefore, the reducton of the desgn space to the feasblty regon sgnfcantly mproves the precson of the used lnearzed performance models.
4 Intal Fnal Performance Hysteress Delay Delay [V] [ns] [ns] Spec. f b, > 0.50 < 1.75 < 1.75 f (d (Intal, s (Intal Y 2.0% 55.0% 73.5% Y tot 2.0% f (d (Fnal, s (Fnal f (d (Fnal, s (Intal Y 100.0% 99.5% 100.0% Y tot 99.5% Table 2: Results for Schmtt trgger, wth partal yelds Y and total yeld Y tot. The constrants reduce the exploraton space for the optmzaton algorthm and therefore mprove the convergence of the algorthm. Durng the optmzaton, a lnear approxmaton F s used and s updated n each teraton step. 4 Results The proposed method was appled to two example crcuts usng statstcal data of an ndustral fabrcaton process. The frst crcut, a Schmtt trgger (Fg. 2, s a typcal dgtal crcut from a cell lbrary. enabq pad VDDP VDD Fgure 2: Schematc of a Schmtt trgger. out The yeld values lsted n ths secton were all obtaned from a 200 sample Monte-Carlo analyss, wth consderaton of operatonal parameters accordng to Eq. (6. Please note, that ths Monte-Carlo analyss s not part of the algorthm tself, but only to llustrate the yeld mprovement obtaned wth ths approach. The results of the optmzaton are compled n Table 2. As can be seen, the ntal total yeld Y tot was nsuffcent 2.0% for ths crcut, manly due to the low partal yeld Y of the hysteress. The row f (d (Intal, s (Intal unvels that all specfcatons were volated at ther approprate 3σ worst-case parameter set before the optmzaton. After only 5 teratons of the worst-case szng algorthm all specfcatons could be met at ther fnal worst-case parameter sets (d (Fnal, s (Fnal. Ths mprovement led to a total yeld of 99.5%. In Table 2, the performance values for the fnal desgn parameter set d (Fnal have been smulated for both, the ntal worst-case parameter sets s (Intal and the fnal worstcase parameter sets s (Fnal. Obvously, both worst-case parameter sets lead to dentcal performance values. Performance Hysteress Delay Delay (s (Intal, s (Fnal Table 3: Angles between ntal and fnal worst-case parameter sets of the same performance of the Schmtt trgger. bas nn np Cc Cload Fgure 3: Schematc of a Mller operatonal amplfer. In Table 3, the angles between the ntal and fnal worstcase parameter sets are gven for each performance. Apparently, the ntal and fnal worst-case parameter sets are very smlar for the hysteress and nearly dentcal for the two delays. In Table 4, angles of ntal and fnal worst-case parameter sets are compared between the dfferent performances. The dfferences between ntal and fnal angles are around 10 comparng the hysteress wth the delays and almost 0 between rsng and fallng delay. Hysteress Delay Delay Hysteress Delay Delay Table 4: Angles between the worst-case parameter sets of dfferent performances of the Schmtt trgger before the optmzaton (unshaded upper rght trangle and after the optmzaton (lght gray shaded lower left trangle. These experments llustrate, that for dgtal crcuts, worst-case parameter sets are rather ndependent from the szng. The second example, a Mller operatonal amplfer (Fg. 3, s a typcal analog crcut. For the ntal szng all specfcatons but the one for the power consumpton were volated at ther 3σ worst-case parameter sets (row f (d (Intal, s (Intal of Table 5, leadng to a total yeld of 0.0%. Agan after 5 teratons of the szng algorthm, all specfcatons could be fulflled at ther worst-case ponts (d (Fnal, s (Fnal. Unlke the Schmtt trgger, the worst-case parameter sets of the Mller operatonal amplfer change sgnfcantly wth the szng. Conductng the same experment as wth the Schmtt trgger of transferng the ntal worst-case parameter sets s (Intal to the fnal szngs d (Fnal agan, ths tme leads to consderably dfferent performance values compared to the values at the actual fnal worst-case parameter sets (d (Fnal, s (Fnal. The same holds for the postons of the ntal and fnal worst-case parameter sets (Table 6 and 7. Gven these varabltes and the spread of the worst-case parameter sets over the space of the statstcal parameters (Table 7, t becomes apparent that the worst-case condtons for analog crcuts cannot be represented only by pre-
5 Intal Fnal Performance A 0 f t Φ m SR p Power [db] [MHz] [ ] [V/µs] [mw] Spec. f b, > 80 > 1.3 > 60 > 3 < 1.3 f (d (Intal, s (Intal Y 95.5% 0.0% 0.0% 0.0% 100.0% Y tot 0.0% f (d (Fnal, s (Fnal f (d (Fnal, s (Intal Y 100.0% 100.0% 100.0% 100.0% 100.0% Y tot 100.0% Table 5: Results for Mller operatonal amplfer, wth partal yelds Y and total yeld Y tot. Performance A 0 f t Φ m SR p Power (s (Intal, s (Fnal Table 6: Angles between ntal and fnal worst-case parameter sets of the same performance of the Mller operatonal amplfer. defned dgtal slow/fast worst-case parameter sets. In consequence one worst-case parameter set has to be determned for each specfcaton at every szng ndvdually. Table 8 comples the computatonal costs for the szng of both crcuts. The results were obtaned on a network of 5 computers (Sun Ultra I for the Schmtt trgger and 500 MHz Pentum III for the Mller operatonal amplfer, usng the Infneon n-house smulator TITAN [8]. One can see that the whole synthess process takes 385 and 685 smulatons respectvely (1 smulaton ncludes DC, AC and transent smulaton, equvalent to 20 mnutes and 5 mnutes elapsed tme (exclusve computer usage. Hence a complete szng can be done at the cost of a Monte Carlo analyss. Concluson A method for analog crcut szng has been presented that performs nomnal desgn at worst-case parameter sets for operatng condtons and for manufacturng varatons. It has been llustrated that these worst-case parameter sets are dependent on the crcut topology, on the crcut performances and of the desgn parameter values. The presented method features a relaxed calculaton of worst-case parameter sets based on performance lnearzatons. In ths way, szng of robust analog crcuts can be acheved at lower smulaton costs than by desgn centerng approaches. A 0 f t Φ m SR p Power A f t Φ m SR p Power Table 7: Angles between the worst-case parameter sets of dfferent performances of the Mller operatonal amplfer before the optmzaton (unshaded upper rght trangle and after the optmzaton (lght gray shaded lower left trangle. Crcut # Smulatons Wall clock tme Schmtt trgger mn (5 Sun Ultra I Mller mn (5 Pentum III 500 MHz Acknowledgments Table 8: Computatonal costs Ths work was supported by the German Federal Mnstry of Educaton, Scence, Research and Technology under grant 01 M 3050 A wthn the MEDEA+ project Analog Enhancements for a System to Slcon Automated Desgn (ANASTASIA+. References [1] H. Abdel-Malek and A. Hassan. The ellpsodal technque for desgn centerng and regon approxmaton. IEEE IS- CAS, [2] S. A. Aftab and M. A. Styblnsk. IC varablty mnmzaton usng a new Cp and Cpk based varablty/performance measure. IEEE ISCAS, [3] K. Antrech, H. Graeb, and C. Weser. Crcut analyss and optmzaton drven by worst-case dstances. IEEE TCAD, 13(1, [4] G. Debyser and G. Gelen. Effcent analog crcut synthess wth smultaneous yeld and robustness optmzaton. In IEEE/ACM ICCAD, [5] M. del Mar Hershenson, S. P. Boyd, and T. H. Lee. Optmal desgn of a CMOS Op-Amp va geometrc programmng. IEEE TCAD, 20(1, [6] A. Dharchoudhury and S. M. Kang. Worst-case analyss and optmzaton of VLSI crcut performances. IEEE TCAD, 14(4, [7] K. S. Eshbaugh. Generaton of correlated parameters for statstcal crcut smulaton. IEEE TCAD, 11(10, [8] U. Feldmann, U. Wever, Q. Zheng, R. Schultz, and H. Wredt. Algorthms for modern crcut smulaton. Archv für Elektronk und Übertragungstechnk, 46, [9] G. G. E. Gelen and R. A. Rutenbar. Computer-aded desgn of analog and mxed-sgnal ntegrated crcuts. Proceedngs of the IEEE, 88(12, [10] H. Graeb, S. Zzala, J. Eckmueller, and K. Antrech. The szng rules method for analog ntegrated crcut desgn. In IEEE/ACM ICCAD, [11] M. Keramat and R. Kelbasa. OPTOMEGA: an envronment for analog crcut optmzaton. In IEEE ISCAS, [12] K. Krshna and S. W. Drector. The lnearzed performance penalty (LPP method for optmzaton of parametrc yeld and ts relablty. IEEE TCAD, 14(12, [13] G. Müller-Lebler. Lmt-parameters: the general soluton of the worst-case problem for the lnearzed case. IEEE ISCAS, [14] R. Phelps, M. Krasnck, R. A. Rutenbar, L. R. Carley, and J. R. Hellums. Anaconda: Smulaton-based synthess of analog crcuts va stochastc pattern search. IEEE TCAD, 19(6, [15] R. Schwencker, F. Schenkel, H. Gräb, and K. Antrech. The generalzed boundary curve A common method for automatc nomnal desgn and desgn centerng of analog crcuts. DATE, 2000.
Learning 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 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 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 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 informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
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.
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
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 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 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 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 informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
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 informationParallelism 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 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 information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
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 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 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 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 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 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 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 informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
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 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 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 informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
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 informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
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 informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
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 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 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 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 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 informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
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 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 informationPetri Net Based Software Dependability Engineering
Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013
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 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 informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationA Background Subtraction for a Vision-based User Interface *
A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton
More informationProjection-Based Performance Modeling for Inter/Intra-Die Variations
Proecton-Based Performance Modelng for Inter/Intra-De Varatons Xn L, Jayong Le 2, Lawrence. Plegg and Andrze Strowas Dept. of Electrcal & Computer Engneerng Carnege Mellon Unversty Pttsburgh, PA 523, USA
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 informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
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 informationImproving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
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 informationCable optimization of a long span cable stayed bridge in La Coruña (Spain)
Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span
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 informationDynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution
Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan
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 informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
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 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 informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
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 informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationSequential Projection Maximin Distance Sampling Method
APCOM & ISCM 11-14 th December, 2013, Sngapore Sequental Projecton Maxmn Dstance Samplng Method J. Jang 1, W. Lm 1, S. Cho 1, M. Lee 2, J. Na 3 and * T.H. Lee 1 1 Department of automotve engneerng, Hanyang
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationExercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005
Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed
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 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 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 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 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 informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
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 informationInvestigations of Topology and Shape of Multi-material Optimum Design of Structures
Advanced Scence and Tecnology Letters Vol.141 (GST 2016), pp.241-245 ttp://dx.do.org/10.14257/astl.2016.141.52 Investgatons of Topology and Sape of Mult-materal Optmum Desgn of Structures Quoc Hoan Doan
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 informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
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 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 informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationENERGY EFFICIENCY OPTIMIZATION OF MECHANICAL NUMERICAL CONTROL MACHINING PARAMETERS
ENERGY EFFICIENCY OPTIMIZATION OF MECHANICAL NUMERICAL CONTROL MACHINING PARAMETERS Zpeng LI*, Ren SHENG Yellow Rver Conservancy Techncal Insttute, School of Mechancal Engneerng, Henan 475000, Chna. Correspondng
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 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 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 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 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 informationComplex Filtering and Integration via Sampling
Overvew Complex Flterng and Integraton va Samplng Sgnal processng Sample then flter (remove alases) then resample onunform samplng: jtterng and Posson dsk Statstcs Monte Carlo ntegraton and probablty theory
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationOptimal Scheduling of Capture Times in a Multiple Capture Imaging System
Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435,
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
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 informationA Performance Measure Approach to composites reliability: a transmission loss application
10 th World Congress on Structural and Multdscplnary Optmzaton May 19-24, 2013, Orlando, Florda, USA A Performance Measure Approach to compostes relablty: a transmsson loss applcaton Roberto d Ippolto
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 information