Electrical Engineering Department, University of Texas at Dallas, Richardson, TX, USA 3

Size: px
Start display at page:

Download "Electrical Engineering Department, University of Texas at Dallas, Richardson, TX, USA 3"

Transcription

1 Effiient Performane odeling via Dual-Prior Baesian odel Fusion for Analog and ixed-signal Ciruits Qiheng Huang Chenlei Fang Fan Yang * Xuan Zeng * Dian Zhou and Xin i 3 State Ke ab of ASIC & Sstem iroeletronis Department Fudan Universit Shanghai P R China Eletrial Engineering Department Universit of exas at Dallas Rihardson X USA 3 Eletrial & Computer Engineering Department Carnegie ellon Universit Pittsburgh PA USA ABSRAC In this paper we propose a novel Dual-Prior Baesian odel Fusion (DP-BF) algorithm for performane modeling Different from the previous BF methods whih use onl one soure of prior knowledge DP-BF takes advantage of multiple soures of prior knowledge to full exploit the available information and hene further redue the modeling ost Based on a graphial model an effiient Baesian inferene is developed to fuse two different prior models and ombine the prior information with a small number of training samples to ahieve high modeling aura Several iruit examples demonstrate that the proposed method an ahieve up to 83 ost redution over the traditional one-prior BF method without surrendering an aura INRODUCION he ontinuous saling of integrated iruits (ICs) leads to severe proess variations hese devie level proess variations (eg Vth ox et) pose large-sale unertainties in iruit performanes and hene impat the parametri ield of analog and mixed-signal (AS) iruits [] o model analze and optimize proess variations at all levels of design hierarh various tehniques have been developed for performane modeling during the past deades []-[4] he objetive is to desribe the performane of interest (eg offset of an operational amplifier) b an analtial (eg linear quadrati et) funtion of devie-level variations and/or environmental onditions One the performane models are reated the an be applied to various appliations suh as parametri ield predition [5] and worstase orner extration [6] Although man performane modeling tehniques were developed the evolution of AS iruits espeiall the inrease of iruit size and omplexit has posed a number of new hallenges in this area On one hand a large number of random variables have to be used to model the proess variations assoiated with large-sale iruits In onsequene a huge amount of simulation samples must be generated for highdimensional modeling On the other hand the omputational ost of iruit simulation inreases signifiantl due to inreasingl large iruit size whih makes iruit simulation extremel timeonsuming hese reent trends have made performane modeling prohibitivel expensive toda [7] o address this hallenging issue of modeling ost several advaned performane modeling tehniques (eg sparse * Corresponding authors: {angfan xzeng}@fudanedun Permission to make digital or hard opies of all or part of this work for personal or lassroom use is granted without fee provided that opies are not made or distributed for profit or ommerial advantage and that opies bear this notie and the full itation on the first page Coprights for omponents of this work owned b others than AC must be honored Abstrating with redit is permitted o op otherwise or republish to post on servers or to redistribute to lists requires prior speifi permission and/or a fee Request permissions from Permissions@amorg DAC '6 June Austin X USA 06 AC ISBN /6/06 $500 DOI: regression [8] elasti net regularization [9] et) have been proposed In partiular a framework of Baesian odel Fusion (BF) was developed for effiient high-dimensional performane modeling [0]-[] BF optimall ombines the earl-stage (eg shemati-level) information and a small number of late-stage (eg post-laout) samples via Baesian inferene he late-stage model oeffiients are then determined b maximizing the posterior distribution An extended version of BF referred to as Co-earning BF (C-BF) was reentl proposed to further redue the modeling ost [] C-BF trains an extra lowomplexit model to generate pseudo samples for fitting a highomplexit performane model In this wa it greatl redues the number of required phsial samples and hene the overall modeling ost he aforementioned BF approahes attempt to exploit onl one soure of prior knowledge (ie earl-stage model oeffiients) In pratie we an often obtain useful knowledge from multiple soures to failitate late-stage performane modeling For example to model the performane metris based on post-silion measurements we an take advantages of the models fitted b (i) the pre-silion data olleted from simulation and (ii) the postsilion data measured from a previous tape-out Consider another important appliation of modeling the aging behavior for analog iruits o apture the aged performane metris at the postlaout stage we an borrow the prior knowledge from the models fitted b (i) the shemati-level simulation data for the aged performane metris and (ii) the post-laout simulation data at t = 0 hese various soures of prior knowledge are expeted to provide the useful information that failitates us to effiientl fit the performane model of interest herefore a new BF framework must be reated to properl fuse multiple soures of prior knowledge for performane modeling owards this goal we propose a novel BF tehnique referred to as Dual-Prior Baesian odel Fusion (DP-BF) that takes into aount multiple soures of prior knowledge DP-BF is derived from the Baesian inferene that an be represented as a graphial model [3]-[4] he performane model of interest is built b ombining multiple prior models and a small number of training samples As will be demonstrated b our experimental results in Setion 5 the proposed method an ahieve up to 83 ost redution over the onventional BF approah he reminder of this paper is organized as follows We briefl review the bakground of BF in Setion and then derive our DP-BF method in Setion 3 In Setion 4 several implementation issues are further disussed he effia of the proposed method is demonstrated b two iruit examples in Setion 5 Finall we onlude in Setion 6 BACKGROUND he performane modeling of an AS iruit aims to desribe ertain performanes of interests with an analtial funtion of devie-level variations and/or environmental onditions For example we an approximate the offset of an operational amplifier as a polnomial funtion of variables like Vth and DC bias urrent

2 Generall the performane model of a given iruit an be desribed as: f( ) = α m gm( ) x x () denotes the performane metri to be estimated x is a vetor representing the variations and operation point f is the performane funtion he performane funtion is a linear ombination of basis funtions (eg linear or quadrati polnomials) {gm(x); m = } and {m; m = } are the model oeffiients he unknown oeffiients in () are traditionall determined b solving the following least-squares regression problem: min G () () () () g( x ) g( x ) g ( x ) () () () g( x ) g( x ) g ( x ) 3 G = (3) ( K) ( K) ( K) g( x ) g( x ) g ( x ) 4 = [ α α α ] (4) () () ( K ) 5 = [ ] (5) In ()-(5) stands for the -norm of a vetor K represents the total number of sampling points and x (k) and (k) are the k-th sampling values of x and respetivel is a vetor ontaining all the model oeffiients and is a vetor onsisting of all the samples of When applied to high-dimensional performane modeling the least-squares fitting method requires a huge number of sampling points and thus leads to extremel expensive modeling ost o address the omplexit issue of least-squares fitting sparse regression method [9] has reentl been developed b exploiting the fat that most high-dimension model oeffiients are lose to zero However traditional sparse regression approah onl fits the performane model based on the simulation data of a single stage BF an be applied to further ombine the knowledge from earl stage and thus redue the performane modeling ost In the onventional BF method the prior knowledge of model oeffiients obtained from earl stage data (eg shematilevel simulation data) is enoded into a nonzero-mean Gaussian prior distribution With onl a few samples from late-stage data (eg post-laout simulation data) the estimated late-stage model oeffiients an then be derived as: 6 = η D+ G G η D E+ G (6) = [ α α α ] (7) 7 E E E E 8 D = diag( α E α E α E ) E is the oeffiient vetor of a model fitted b the earl-stage data G and are defined b (3) and (5) respetivel and diag() represents the operator to onstrut a diagonal matrix is a hper-parameter ontrolling the onfidene in prior knowledge In the ase that is suffiientl large (6) an be redued as: 9 E (9) whih reveals that the prior knowledge is ver aurate; In another extreme ase that is ver small we have: 0 ( ) (8) = G G G (0) whih implies that the prior knowledge is inaurate so the leastsquares regression is applied on the late-stage data alone for model fitting he optimal value of an be determined b the ross-validation tehnique [3] While the aforementioned BF method proves to ahieve signifiant speedup over least-squares regression it restrits the prior knowledge to single soure In pratie we often have multiple soures of prior knowledge It is possible to exploit more orrelated information from different aspets to further failitate the late-stage statistial analsis With this motivation we propose a new BF strateg to utilize two soures of prior knowledge 3 PROPOSED APPROACH In this setion we develop our proposed DP-BF method to borrow prior knowledge from two soures of earl-stage data for more effiient performane modeling 3 Problem Formulation Speifiall we denote the two groups of prior model oeffiients as E and E = [ α α α ] () E E E E E = αe αe αe [ ] () he two groups of oeffiients are obtained b fitting from two different soures of existing data respetivel using the same set of basis funtions for late-stage performane modeling herefore we are supposed to know the two groups of oeffiients before fitting the late-stage model he fundamental problem of the proposed method then beomes: with the input information of (i) two groups of earlstage model oeffiients {Em; m = } and {Em; m = } and (ii) a few late-stage samples of x and how to properl estimate the late-stage model oeffiients b borrowing prior knowledge of the two soures o this end a Baesian inferene strateg will be onstruted and represented b a graphial model 3 Graphial odel and ikelihood Funtion We onsider three different performane models: two singleprior model f(x) f(x) and the late-stage model f(x) we aim to fit: 3 f( ) = α m gm( ) x x (3) 4 f( ) = α m gm( ) x x (4) 5 f( ) = α m gm( ) x x (5) {m; m = } and {m; m = } represent the oeffiients of two single-prior models and {m; m = } denote the late-stage model oeffiients to be estimated We assume f(x) f(x) and f(x) share the same set of basis funtions he meaning of single-prior models will be explained soon in the details of the graphial model As shown in figure a graphial model is onstruted to illustrate the main strateg of our method Eah node represents a random quantit and eah direted/undireted edge represents a unidiretional/non-diretional dependen he two small solid irles stand for the two soures of prior knowledge he filled node indiates that the orresponding data (ie the phsial samples of ) have been observed We all f(x) and f(x) singleprior models beause the aim to predit the late-stage model oeffiients based on single soure of prior knowledge (ie E or E) respetivel Our target model f(x) then works as a onsensus funtion to balane the two single-prior models and ombine the useful information the extrat from their respetive

3 prior information We expet that the three models f(x) f(x) and f(x) are onsistent sine the are supposed to predit the same performane metri although in different was Figure A graphial model is shown to illustrate the Baesian inferene strateg of DP-BF Aording to the graphial model in Figure we an derive the joint probabilit densit funtion (PDF) as: ( f f ) pdf( f f f ) exp 6 (6) ( f f) ( f) exp exp Here we assume the distribution of the differene between < f f> < f f> and <f > are all zero-mean Gaussian with and to be the orresponding standard deviations Given a number of independent late-stage samples {(x (r) (r) ); r = K} the joint PDF for all the olleted samples an be desribed as: 7 f f pdf( f f f ) exp f f f exp exp 8 () () ( K ) f f( x ) f( x ) f( x ) 9 () () ( K ) f f( x ) f( x ) f( x ) 0 () () ( K ) f f( x ) f( x ) f( x ) (7) = (8) = (9) = (0) and is defined as (5) Aording to (3)-(5) f f and f an be re-written as: f = G () f= G () 3 f = (3) G and are defined as (3) and (4) respetivel and = [ α α α ] (4) 4 5 = α α α [ ] (5) hen b substituting ()-(3) into the joint PDF (7) we an get the likelihood funtion: G G ( ) pdf exp 6 (6) G G G exp exp he first two -norm terms represent the differenes between the target model f and two single-prior models f and f respetivel and the third -norm term stands for the modeling error of f as ompared to the observed samples of 33 Prior Distribution Definition Sine f(x) and f(x) aim to estimate the late-stage model oeffiients based on prior knowledge E and E respetivel we expet that the model oeffiients {m; m = } are lose to {Em; m = } and the oeffiients {; m = } are lose to {Em; m = } herefore we onstrut two nonzero-mean Gaussian distributions for eah of the two sets of oeffiients: pdf α Gauss α k α (7) 7 ( m) ( E m E m) ( ) 8 pdf ( α ) Gauss( α k α ) ( m = ) (8) m E m E m k and k are two hper-parameters that an be determined b ross-validation as will be disussed in detail in Setion 4 In the prior distribution (7) we assume pdf(m) is peaked at its mean value m = Em impling the earl-stage oeffiient Em and the late-stage m are likel to be similar Also the standard deviation of pdf(m) is assumed to be proportional to Em whih provides eah late-stage oeffiient m with a relativel equal opportunit to deviate from the orresponding earl-stage oeffiient Em he prior distribution pdf(m) in (8) an be interpreted in a similar wa hen we further assume that all late-stage model oeffiients are statistiall independent In this wa we an enode the prior knowledge of and as the joint PDF funtion pdf( ): 9 pdf ( ) E D 0 E E 0 D E (9) exp 30 ( = k diag α E α E α E ) 3 ( = k diag α E α E α E ) D (30) D (3) Sine we have no prior knowledge for f(x) and its oeffiients the ontribution of to the joint distribution is represented as a at the end of (9) 34 aximum-a-posteriori Estimation One the prior distribution pdf( ) is defined b (9) we an ombine it with K late-stage phsial samples {(x (r) (r) ); r = K} and estimate the optimal values of late-stage model oeffiients b maximum-a-posteriori (AP) estimation Based on Baes theorem the posterior distribution is proportional to the prior distribution pdf( ) multiplied b the likelihood funtion pdf( ): 3 pdf( ) pdf( ) pdf( ) (3) AP attempts to find the optimal values of and to maximize the posterior distribution pdf( ) Namel it aims to find the solutions and that are most likel to our aording to the posterior distribution although we atuall onl are about the value of as it ontains the oeffiients of the target model athematiall the AP solution an be found b solving the following optimization problem: 33 max pdf( ) (33) Substituting (3) b (6) and (9) and taking the logarithm for the posterior distribution we an onvert (33) to the following equivalent optimization problem: min h (34) 34 ( )

4 35 h X X X X X = + + ( ) ( ) D ( ) k ( ) D ( ) + k + E E E E (35) In this ost funtion the first two terms penalize the disrepan between the predition results of the target model f(x) and the other two single-prior models f(x) and f(x) he third term represents the error of traditional least-squares fitting he last two terms penalize the differenes between the model oeffiients of f(x) f(x) and their prior knowledge E E respetivel We an see the ost funtion aims to ompromise among three parts: f(x) s predition error its similarit to the other two single-prior models and the similarit of the single-prior models to their perspetive prior knowledge Although our target is to get the solution of in (34) the model oeffiients and are solved together B taking partial derivatives of h( ) with respet to and then setting them to zero we an get the AP estimation of the target model oeffiients : 36 = b (36) G G = + + I 4 + k G G k 4 D G G D G G (37) + GG b= + k D k D E GG k D kd E ( GG) G (38) From (36)-(38) we an see the estimated result is ontrolled b five hper-parameters k and k hese parameters ontrol the balane in two aspets: (i) the balane between trusting prior knowledge (E and E) and trusting late-stage samples in ; (ii) the balane between the onfidene in two soures of prior knowledge o alulate the oeffiient vetor in (36) these hper-parameters must be arefull determined In pratie onl three of them are independent and we an determine their values b a two-dimensional ross-validation proess In Setion 4 we will disuss in detail about the respetive influene of these hperparameters and the method to find their optimal values 4 IPEENAION ISSUES o make the proposed DP-BF method pratiall effiient we also need to onsider several implementation issues In this setion we disuss these issues in detail inluding (i) the influene of hper-parameters and how to determine their optimal values and (ii) the detetion method of two highl biased soures of prior knowledge 4 Hper-Parameters he hper-parameters k and k in (37)-(38) ontrol the trust in prior information E prior information E and the late-stage data samples in he should be arefull determined so that we an properl exploit the information from prior knowledge and data samples to get an aurate estimation result In fat are not independent As shown in Figure sine we suppose the distributions of differenes between < f f> and <f > are all zero-mean Gaussian with variane and respetivel the distribution of differene between f and is then Figure he distribution of the differenes between models and observed data zero-mean Gaussian with variane : 39 γ= + (39) B running the onventional single-prior BF in Setion with prior information E and late-stage samples we an then estimate the value of from the variane of modeling error Similarl the distribution of differene between f and is another zero-mean Gaussian distribution with variane : 40 γ = + (40) he value of an be estimated b running another single-prior BF with prior information E One we get the estimated values of and both and an be uniquel determined b hus overall we onl need to find the optimal values for three independent hper-parameters k and k Now we disuss the influene of the hper-parameters k and k b onsidering several extreme ases: Case : k and k are small enough (lose to zero) In this ase the terms onerning k and k in (37)-(38) an all be eliminated and we an then redue (36) to: 4 ( ) G G G (4) whih is exatl the least-squares estimation It indiates that both soures of prior knowledge are inaurate so the model oeffiients are fitted simpl b the late-stage data samples Case : k >> k and k is lose to zero In this ase (37)-(38) an be redued and transformed to: 4 G G = + I k + γ γ D G G (4) ( γ ) E 43 G G b= k k + D D + ( G G) γ γ G (43) whih then ields: 44 E when γ ; (44) γ G G G when (45) 45 ( ) From these ases we an interpret k and k as the trust in prior information E and E respetivel With larger value of k (or k) more weight is assigned to E (or E) in estimation he ratio of k and k then ontrols the balane between two soures of prior knowledge hat is wh we have (4) when k and k are both small and have (44) in the ase that k is obviousl larger than k On the other hand an be interpreted as the distrust in late-stage samples Intuitivel large implies small (or ) whih then indiates that f is muh loser to f (or f) than to the observed samples of herefore the estimation result is similar to the prior information as shown in (44) Small then implies that the estimation based on observed samples of is

5 aurate so the estimation result tends to largel rel on late-stage samples as (45) shows It is important to find the optimal values of the hperparameters k and k to minimize the modeling error owards this goal we first set the value of as: 46 = λ min ( γ γ) (46) is a sale fator between 0 and sine we an see from (39)-(40) that should be no more than or In pratie we set lose to It is beause the number of late-stage samples is far less than the number of model oeffiients so that simpl estimating from late-stage samples would be ver inaurate whih then leads to large value of hen we use two-dimensional ross-validation [5] to find the optimal values for k and k based on few late-stage samples All ombinations of k and k within a pre-defined range are hosen as andidates For eah ombination we appl a Q-fold rossvalidation strateg We divide the entire set of data samples into Q groups and modeling error is estimated from Q independent runs At eah run Q- groups are used to alulate the model oeffiients and the remaining group is used to estimate the modeling error Different groups are seleted for error estimation in different runs After a omplete ross-validation proess of Q runs we then alulate the average error of the Q modeling errors and use it to indiate the estimation aura of the given hperparameters k and k he ombination with the least modeling error is then seleted as the optimal values of k and k 4 Highl Biased Prior Knowledge Given two soures of earl-stage information eah of whih an failitate the late-stage performane modeling we still need to onsider the senario when there is great ompetene disparit between the two soures of prior knowledge Namel when one soure of prior knowledge provides far more useful information for oeffiient estimation than the other one does Ideall the two soures of prior knowledge are equall ompetent and omplementar to eah other hus we an extrat more useful information for modeling and ahieve higher estimation aura than using single soure With two highl biased soures however we an expet that ross-validation will automatiall assign an extremel small weight value to the less useful prior information When k >> k for example the estimation result is then similar to (44) In this ase modeling b borrowing two soures of prior knowledge annot ahieve better result than using single prior knowledge E sine our result is alwas a ompromise between two soures and one of them now beomes a pure hindrane Fortunatel suh situation an be easil deteted from two signs he first sign is the values of or after appling two times of single-prior BF For example if is muh larger than then obviousl its orresponding prior knowledge E is far less useful than E he seond sign is the ratio of k to k after the two-dimensional ross-validation proess If the ratio is extremel high for instane then it implies we should trust muh more in E than in E beause E is useless If both signs show that the two soures of prior knowledge are highl biased then DP-BF annot do an better than traditional single-prior BF with the more ompetent soure as prior knowledge 43 Summar Algorithm summarizes the major steps of our proposed DP- BF method for performane modeling from two soures of prior knowledge Starting from two groups of given earl-stage model oeffiients as prior knowledge and a set of late-stage samples we first determine the values of hper-parameters b the method in Setion 4 he hper-parameters ontrol the weights of eah soure of prior knowledge and information from late-stage samples One the optimal values of hper-parameters are obtained we estimate the late-stage model oeffiients based on AP Algorithm :Dual-Prior BF for Performane odeling Start from two groups of existing oeffiients {Em; m = } and {Em; m = } and a set of late-stage samples {(x (r) (r) ); r = K} Run single-prior BF method as defined in Setion twie with {Em; m = } and {Em; m = } as prior knowledge respetivel hen estimate and from the fitting error of eah time 3 Determine the value of hper-parameter b (45) and the values of k and k b two-dimensional ross-validation hen alulate the values of and aording to (39) and (40) respetivel 4 Estimate the late-stage model oeffiients b (36)-(38) 5 NUERICA EXAPES In this setion we use two iruit examples to demonstrate the effiien of our proposed DP-BF method Our objetive is to build performane models for pre-silion verifiation of these iruits o illustrate the improvement b using multiple soures of prior knowledge we ompare three different performane modeling methods: (i) single-prior BF using one soure of prior information (ii) single-prior BF using another soure of prior information and (iii) the proposed DP-BF using both soures of prior information All experiments are performed on a server with 5GHz dual-ore CPU and 6GB memor 5 Operational Amplifier In this example we use a two-stage operational amplifier (Opamp) designed in a 45nm COS proess We onsider the postlaout verifiation as late-stage and generate the data samples b post-laout simulation he first soure of prior knowledge is from least-squares fitting from man existing data samples of shemati-level simulations On the other hand b exploiting the underling sparsit of model oeffiients we appl the sparse regression method [8] on a small set of obtained post-laout samples to get a group of oeffiients as the seond soure of prior knowledge We aim to auratel estimate the model oeffiients of ertain performane metris in post-laout simulation b borrowing the prior knowledge of two groups of the given oeffiients It is noted that the soures of prior knowledge are not restrited to these we use Other orrelated information from simulation/measurement data of different working modes different environment orners or previous time an also be reused as prior knowledge In this example we use 58 independent random variables to model the devie-level proess variations inluding both inter-die variations and random mismathes Our objetive is to approximate the offset of the Op-amp as a linear funtion of these 58 random variables For testing and omparison purpose we generate a set of onte-carlo samples b both shemati-level and post-laout simulations in whih the devie-level variations of all transistors are onsidered We use onte-carlo samples of shemati-level simulation to alulate the model oeffiients as prior information and appl the sparse regression method on 80 samples of postlaout simulation to get another group of oeffiients as prior information A group of another 000 post-laout simulation samples is used as test group to measure the modeling error Figure 4 shows the modeling error as a funtion of the number of late-stage samples he errors are alulated from 50 repeated runs based on independent samples to average out random

6 flutuations Note that the DP-BF method ahieves higher aura than traditional BF using single soure of prior information In partiular DP-BF onl needs 0 samples to ahieve high modeling aura However even the single-prior BF with better performane (denoted as Single-prior ) takes about 0 samples to ahieve the same aura Studing the plot reveals that DP-BF ahieves more than 83 ost redution over single-prior BF We also examine whether DP-BF an effetivel adjust the weights assigned to eah soure of prior knowledge In Figure 4 traditional BF ahieves higher modeling aura with the first soure of prior knowledge whih means that the first soure provides more useful information than the seond one his is refleted in the values of hper-parameters k and k determined b ross-validation he optimized ratio of k to k is relativel small for all the different sample numbers (eg k/k = 0 when post-stage sample number is 40) his implies that we trust the first soure of prior knowledge more beause it provides more useful information odeling error (mv) Single-prior Single-prior Dual-prior #Samples Figure 4 he modeling error is plotted as a funtion of the number of late-stage samples 5 Analog to Digital Converter In this example we onsider a flash analog to digital onverter (ADC) in a 08m COS proess he soures of prior information are the same as the previous example We use 3 independent random variables to model the devie-level proess variations he objetive is to approximate the power of the ADC as a linear funtion of these 3 random variables odeling error (mw) Single-prior Single-prior Dual-prior #Samples Figure 5 he modeling error is plotted as a funtion of the number of late-stage samples We use onte-carlo samples of shemati-level simulation to alulate the model oeffiients as prior information and appl the sparse regression method on 50 samples of post-laout simulation to get another group of oeffiients as prior information A group of another 000 post-laout simulation samples is used as test group to measure the modeling error Figure 5 shows the modeling error as a funtion of the number of late-stage samples Studing the plot reveals that DP-BF ahieves more than 83 ost redution over single-prior BF In addition in Figure 5 we an see that the seond soure of prior knowledge provides more useful information than the first one hat is wh the optimized ratio of k to k is obviousl larger than for all the different sample numbers (eg k/k = 44 when post-stage sample number is 58) his implies that we trust the seond soure of prior knowledge more beause it is more useful 6 CONCUSIONS In this paper we propose a novel performane modeling algorithm DP-BF o ahieve high modeling aura with low modeling ost an effiient Baesian inferene is developed to fuse two different prior models and ombine the prior information with a small number of training samples Several iruit examples demonstrate that the proposed method an ahieve up to 83 ost redution over the traditional method without surrendering an aura 7 ACKNOWEDGEENS his work is supported partl b National Natural Siene Foundation of China researh projet and partl b the Reruitment Program of Global Experts (the housand alents Plan) partl b Chen Guang projet supported b Shanghai uniipal Eduation Commission and Shanghai Eduation Development Foundation and National Siene Foundation under ontrat CCF and grant REFERENCES [] Semiondutor Industr Assoiate (0) International ehnolog Roadmap for Semiondutors [Online] Available: wwwiersnet/inks/0irs/home0htm [] A Singhee et al Beond low-order statistial response surfaes: latent variable regression for effiient highl nonlinear fitting IEEE DAC pp [3] A itev et al Priniple Hessian diretion based parameter redution for interonnet networks with proess variation IEEE ICCAD pp [4] Conagh et al emplate-free smboli performane modeling of analog iruits via anonial-form funtions and geneti programming IEEE rans on CAD vol 8 no 8 pp [5] X i et al Asmptoti probabilit extration for nonnormal performane distributions IEEE rans on CAD vol 6 no pp [6] Sengupta et al Appliation-speifi worst ase orners using response surfaes and statistial models Computer-Aided Design of Integrated Ciruits and Sstems IEEE rans on CAD vol 4 no 9 pp [7] V Natarajan et al Yield reover of RF transeiver sstems using iterative tuning-driven power-onsious performane optimization IEEE Design & est of Comp vol 3 no pp [8] X i Finding deterministi solution from underdetermined equation: large-sale performane variabilit modeling of analog/rf iruits IEEE rans on CAD vol 9 no pp [9] Conagh High-dimensional statistial modeling and analsis of ustom integrated iruits IEEE CICC pp -8 0 [0] X i et al Effiient parametri ield estimation of analog/mixed-signal iruits via Baesian model fusion IEEE ICCAD pp [] F Wang et al Baesian model fusion: large-sale performane modeling of analog and mixed-signal iruits b reusing earl-stage data IEEE DAC pp [] F Wang et al Co-learning Baesian model fusion: effiient performane modeling of analog and mixed-signal iruits using side information IEEE ICCAD pp [3] S Yu et al Baesian o-training NIPS pp [4] C Bishop Pattern Reognition and ahine earning Springer 006 [5] Q Huang et al Effiient multivariate moment estimation via Baesian model fusion for analog and mixed-signal iruits IEEE DAC pp 69:-69:6 05

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of

More information

WIRELESS CAPSULE ENDOSCOPY IMAGES ENHANCEMENT BASED ON ADAPTIVE ANISOTROPIC DIFFUSION

WIRELESS CAPSULE ENDOSCOPY IMAGES ENHANCEMENT BASED ON ADAPTIVE ANISOTROPIC DIFFUSION WIRELESS CAPSULE ENDOSCOPY IMAGES ENHANCEMENT BASED ON ADAPTIVE ANISOTROPIC DIFFUSION Lei Li 1, Y. X. ZOU 1* and Yi Li 1 ADSPLAB/ELIP, Shool of ECE, Peking Universit, Shenzhen 518055, China Shenzhen JiFu

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

Exploiting Enriched Contextual Information for Mobile App Classification

Exploiting Enriched Contextual Information for Mobile App Classification Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Improved Circuit-to-CNF Transformation for SAT-based ATPG

Improved Circuit-to-CNF Transformation for SAT-based ATPG Improved Ciruit-to-CNF Transformation for SAT-based ATPG Daniel Tille 1 René Krenz-Bååth 2 Juergen Shloeffel 2 Rolf Drehsler 1 1 Institute of Computer Siene, University of Bremen, 28359 Bremen, Germany

More information

Discrete sequential models and CRFs. 1 Case Study: Supervised Part-of-Speech Tagging

Discrete sequential models and CRFs. 1 Case Study: Supervised Part-of-Speech Tagging 0-708: Probabilisti Graphial Models 0-708, Spring 204 Disrete sequential models and CRFs Leturer: Eri P. Xing Sribes: Pankesh Bamotra, Xuanhong Li Case Study: Supervised Part-of-Speeh Tagging The supervised

More information

Semi-Supervised Affinity Propagation with Instance-Level Constraints

Semi-Supervised Affinity Propagation with Instance-Level Constraints Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel

More information

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else 3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

New Fuzzy Object Segmentation Algorithm for Video Sequences *

New Fuzzy Object Segmentation Algorithm for Video Sequences * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department

More information

Performance Benchmarks for an Interactive Video-on-Demand System

Performance Benchmarks for an Interactive Video-on-Demand System Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

Boosted Random Forest

Boosted Random Forest Boosted Random Forest Yohei Mishina, Masamitsu suhiya and Hironobu Fujiyoshi Department of Computer Siene, Chubu University, 1200 Matsumoto-ho, Kasugai, Aihi, Japan {mishi, mtdoll}@vision.s.hubu.a.jp,

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors

Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

Using Augmented Measurements to Improve the Convergence of ICP

Using Augmented Measurements to Improve the Convergence of ICP Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

Chromaticity-matched Superimposition of Foreground Objects in Different Environments

Chromaticity-matched Superimposition of Foreground Objects in Different Environments FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology

More information

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty

More information

NOISE REMOVAL FOR OBJECT TRACKING BASED ON HSV COLOR SPACE PARAMETER USING CAMSHIFT

NOISE REMOVAL FOR OBJECT TRACKING BASED ON HSV COLOR SPACE PARAMETER USING CAMSHIFT International Journal of Computational Intelligene & Teleommuniation Sstems () 0 pp. 39-45 NOISE REOVAL FOR OBJECT TRACKING BASED ON HSV COLOR SPACE PARAETER USING CASHIFT P. Raavel G. Appasami and R.

More information

Recursive estimation of generative models of video

Recursive estimation of generative models of video Reursive estimation of generative models of video Nemanja Petrovi Google In. Sumit Basu Mirosoft Researh Aleksandar Ivanovi Universit of Illinois Urbana Thomas Huang Universit of Illinois Urbana Nebojsa

More information

An Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results

An Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results An Alternative Approah to the Fuzziier in Fuzzy Clustering to Obtain Better Clustering Results Frank Klawonn Department o Computer Siene University o Applied Sienes BS/WF Salzdahlumer Str. 46/48 D-38302

More information

Stable Road Lane Model Based on Clothoids

Stable Road Lane Model Based on Clothoids Stable Road Lane Model Based on Clothoids C Gakstatter*, S Thomas**, Dr P Heinemann*, Prof Gudrun Klinker*** *Audi Eletronis Venture GmbH, **Leibniz Universität Hannover, ***Tehnishe Universität Münhen

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

Cluster Centric Fuzzy Modeling

Cluster Centric Fuzzy Modeling 10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

Spatial-Aware Collaborative Representation for Hyperspectral Remote Sensing Image Classification

Spatial-Aware Collaborative Representation for Hyperspectral Remote Sensing Image Classification Spatial-Aware Collaborative Representation for Hyperspetral Remote Sensing Image ifiation Junjun Jiang, Member, IEEE, Chen Chen, Member, IEEE, Yi Yu, Xinwei Jiang, and Jiayi Ma Member, IEEE Representation-residual

More information

Sparse Certificates for 2-Connectivity in Directed Graphs

Sparse Certificates for 2-Connectivity in Directed Graphs Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale

More information

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper

More information

arxiv: v1 [cs.gr] 10 Apr 2015

arxiv: v1 [cs.gr] 10 Apr 2015 REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,

More information

2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,

2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any urrent or future media, inluding reprinting/republishing this material for advertising

More information

FOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW

FOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW FOREGROUND OBJECT EXTRACTION USING FUZZY C EANS WITH BIT-PLANE SLICING AND OPTICAL FLOW SIVAGAI., REVATHI.T, JEGANATHAN.L 3 APSG, SCSE, VIT University, Chennai, India JRF, DST, Dehi, India. 3 Professor,

More information

Alleviating DFT cost using testability driven HLS

Alleviating DFT cost using testability driven HLS Alleviating DFT ost using testability driven HLS M.L.Flottes, R.Pires, B.Rouzeyre Laboratoire d Informatique, de Robotique et de Miroéletronique de Montpellier, U.M. CNRS 5506 6 rue Ada, 34392 Montpellier

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Weak Dependence on Initialization in Mixture of Linear Regressions

Weak Dependence on Initialization in Mixture of Linear Regressions Proeedings of the International MultiConferene of Engineers and Computer Sientists 8 Vol I IMECS 8, Marh -6, 8, Hong Kong Weak Dependene on Initialization in Mixture of Linear Regressions Ryohei Nakano

More information

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing Defet Detetion and Classifiation in Cerami Plates Using Mahine Vision and Naïve Bayes Classifier for Computer Aided Manufaturing 1 Harpreet Singh, 2 Kulwinderpal Singh, 1 Researh Student, 2 Assistant Professor,

More information

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur

More information

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS Proeedings of ASME 0 International Mehanial Engineering Congress & Exposition IMECE0 November 5-, 0, San Diego, CA IMECE0-6657 BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

More information

Query Evaluation Overview. Query Optimization: Chap. 15. Evaluation Example. Cost Estimation. Query Blocks. Query Blocks

Query Evaluation Overview. Query Optimization: Chap. 15. Evaluation Example. Cost Estimation. Query Blocks. Query Blocks Query Evaluation Overview Query Optimization: Chap. 15 CS634 Leture 12 SQL query first translated to relational algebra (RA) Atually, some additional operators needed for SQL Tree of RA operators, with

More information

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints 5 JOURNAL OF SOFTWARE VOL. 8 NO. 8 AUGUST Optimization of Two-Stage Cylindrial Gear Reduer with Adaptive Boundary Constraints Xueyi Li College of Mehanial and Eletroni Engineering Shandong University of

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

Design of tree-type support structure of free-form shell generated using fractal geometry

Design of tree-type support structure of free-form shell generated using fractal geometry 6 30 September, 06, Too, Japan K. Kawaguhi, M. Ohsai, T. Taeuhi (eds.) Design of tree-tpe support struture of free-form shell generated using fratal geometr Jinglan CUI*, Guanghun ZHOU a, Maoto OHSAKI

More information

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using

More information

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology

More information

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects Raabe, Roters, Wang Simulation of Crystallographi Texture and Anisotropie of Polyrystals during Metal Forming with Respet to Saling Aspets D. Raabe, F. Roters, Y. Wang Max-Plank-Institut für Eisenforshung,

More information

User-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming

User-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming User-level Fairness Delivered: Network Resoure Alloation for Adaptive Video Streaming Mu Mu, Steven Simpson, Arsham Farshad, Qiang Ni, Niholas Rae Shool of Computing and Communiations, Lanaster University

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless

More information

Detection of RF interference to GPS using day-to-day C/No differences

Detection of RF interference to GPS using day-to-day C/No differences 1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster

More information

Runtime Support for OOLs Part II Comp 412

Runtime Support for OOLs Part II Comp 412 COMP 412 FALL 2017 Runtime Support for OOLs Part II Comp 412 soure IR Front End Optimizer Bak End IR target Copright 2017, Keith D. Cooper & Linda Torzon, all rights reserved. Students enrolled in Comp

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

Face and Facial Feature Tracking for Natural Human-Computer Interface

Face and Facial Feature Tracking for Natural Human-Computer Interface Fae and Faial Feature Traking for Natural Human-Computer Interfae Vladimir Vezhnevets Graphis & Media Laboratory, Dept. of Applied Mathematis and Computer Siene of Mosow State University Mosow, Russia

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Fast Rigid Motion Segmentation via Incrementally-Complex Local Models

Fast Rigid Motion Segmentation via Incrementally-Complex Local Models Fast Rigid Motion Segmentation via Inrementally-Complex Loal Models Fernando Flores-Mangas Allan D. Jepson Department of Computer Siene, University of Toronto {mangas,jepson}@s.toronto.edu Abstrat The

More information

Accommodations of QoS DiffServ Over IP and MPLS Networks

Accommodations of QoS DiffServ Over IP and MPLS Networks Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering

More information

Acoustic Links. Maximizing Channel Utilization for Underwater

Acoustic Links. Maximizing Channel Utilization for Underwater Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it

More information

Gradient based progressive probabilistic Hough transform

Gradient based progressive probabilistic Hough transform Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti

More information

Space- and Time-Efficient BDD Construction via Working Set Control

Space- and Time-Efficient BDD Construction via Working Set Control Spae- and Time-Effiient BDD Constrution via Working Set Control Bwolen Yang Yirng-An Chen Randal E. Bryant David R. O Hallaron Computer Siene Department Carnegie Mellon University Pittsburgh, PA 15213.

More information

Improved Real-Time Shadow Mapping for CAD Models

Improved Real-Time Shadow Mapping for CAD Models Improved Real-Time Shado Mapping for CAD Models Vitor Barata R. B. Barroso TeGraf, Computer Siene Dept., PUC-Rio vbarata@tegraf.pu-rio.br Waldemar Celes TeGraf, Computer Siene Dept., PUC-Rio eles@tegraf.pu-rio.br

More information

The AMDREL Project in Retrospective

The AMDREL Project in Retrospective The AMDREL Projet in Retrospetive K. Siozios 1, G. Koutroumpezis 1, K. Tatas 1, N. Vassiliadis 2, V. Kalenteridis 2, H. Pournara 2, I. Pappas 2, D. Soudris 1, S. Nikolaidis 2, S. Siskos 2, and A. Thanailakis

More information

Bring Your Own Coding Style

Bring Your Own Coding Style Bring Your Own Coding Style Naoto Ogura, Shinsuke Matsumoto, Hideaki Hata and Shinji Kusumoto Graduate Shool of Information Siene and Tehnology, Osaka University, Japan {n-ogura, shinsuke, kusumoto@ist.osaka-u.a.jp

More information

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8 Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4

More information

Preliminary investigation of multi-wavelet denoising in partial discharge detection

Preliminary investigation of multi-wavelet denoising in partial discharge detection Preliminary investigation of multi-wavelet denoising in partial disharge detetion QIAN YONG Department of Eletrial Engineering Shanghai Jiaotong University 8#, Donghuan Road, Minhang distrit, Shanghai

More information

An Efficient and Scalable Approach to CNN Queries in a Road Network

An Efficient and Scalable Approach to CNN Queries in a Road Network An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,

More information

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm

More information

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

AUTOMATIC TRACKING OF MOVING OBJECT WITH EYE-IN- HAND ROBOT MANIPULATOR

AUTOMATIC TRACKING OF MOVING OBJECT WITH EYE-IN- HAND ROBOT MANIPULATOR AUTOATIC TRACKING OF OVING OBJECT WITH EYE-IN- HAND ROBOT ANIPULATOR 1 JIN-SIANG SHAW, WEN-LIN CHI Institute of ehatroni Engineering, Taipei Teh, Taipei, Taiwan Email: 1 jshaw@ntut.edu.tw, ton455448@gmail.om

More information

Mean Deviation Similarity Index: Efficient and Reliable Full-Reference Image Quality Evaluator

Mean Deviation Similarity Index: Efficient and Reliable Full-Reference Image Quality Evaluator 1 Mean Deviation Similarity Index: Effiient and Reliable Full-Referene Image Quality Evaluator Hossein Ziaei Nafhi, Atena Shahkolaei, Rahid Hedjam, and Mohamed Cheriet, Senior Member, IEEE two images of

More information

PROJECT PERIODIC REPORT

PROJECT PERIODIC REPORT FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise

More information

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient

More information

We don t need no generation - a practical approach to sliding window RLNC

We don t need no generation - a practical approach to sliding window RLNC We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,

More information

Model Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology

Model Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology The International Arab Journal of Information Tehnology, Vol. 12, No. 6, November 15 519 Model Based Approah for Content Based Image Retrievals Based on Fusion and Relevany Methodology Telu Venkata Madhusudhanarao

More information

A Hybrid Neuro-Genetic Approach to Short-Term Traffic Volume Prediction

A Hybrid Neuro-Genetic Approach to Short-Term Traffic Volume Prediction A Hybrid Neuro-Geneti Approah to Short-Term Traffi Volume Predition 1. Introdution Shahriar Afandizadeh 1,*, Jalil Kianfar 2 Reeived: January 2003, Revised: July 2008, Aepted: January 2009 Abstrat: This

More information

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,

More information