Bayesian evidence for Finite element model updating

Size: px
Start display at page:

Download "Bayesian evidence for Finite element model updating"

Transcription

1 Bayesan evdence for Fnte element model updatng Lnda Mthembu, PhD student, Electrcal and Informaton Engneerng, Unversty of the Wtwatersrand, Johannesburg Prvate Bag 3, Johannesburg, 050, South Afrca Tshldz Marwala, Professor of Electrcal and Informaton Engneerng, Unversty of the Wtwatersrand, Prvate Bag 3, Johannesburg, 050, South Afrca Mchael I. Frswell, Sr George Whte Professor of Aerospace Engneerng, Department of Aerospace Engneerng, Queens Buldng, Unversty of Brstol, Brstol BS8 1TR, UK Sondpon Adhkar, Char of Aerospace Engneerng, School of Engneerng, Swansea Unversty, Sngleton Park, Swansea SA 8PP, Unted Kngdom Abstract Ths paper consders the problem of model selecton wthn the context of fnte element model updatng. Gven that a number of FEM updatng models, wth dfferent updatng parameters, can be desgned, ths paper proposes usng the Bayesan evdence statstc to assess the probablty of each updatng model. Ths makes t possble then to evaluate the need for alternatve updatng parameters n the updatng of the ntal FE model. The model evdences are compared usng the Bayes factor, whch s the rato of evdences. The Jeffrey s scale s used to determne the dfferences n the models. The Bayesan evdence s calculated by ntegratng the lkelhood of the data gven the model and ts parameters over the a pror model parameter space usng the new nested samplng algorthm. The nested algorthm samples ths lkelhood dstrbuton by usng a hard lkelhood-value constrant on the samplng regon whle provdng the posteror samples of the updatng model parameters as a by-product. Ths method s used to calculate the evdence of a number of plausble fnte element models. Nomenclature θ D H Z N Max L π c k m & x& ( t) x& ( t) ( t) w φ Model Parameters Real measured system data Fnte element model (Mathematcal model) Evdence Number of samples Maxmum number of teratons Lkelhood probablty Pror Probablty Dampng matrx Stffness matrx Mass matrx Node acceleraton Node velocty x Node dsplacement Natural frequency vector Mode shape vector FEM Fnte element model FEMUP Fnte element model updatng problem PDF Probablty Dstrbuton Functon MCMC Markov Chan Monte Carlo

2 1. Introducton System modelng forms an mportant stage of many engneerng desgn problems. The results from the model ether confrm or hghlght lmtatons of the desgn. An analyst s usually nterested n the accuracy, confdence range and more crtcally the correctness of the assumed mathematcal model. In ths paper the model doman s structural fnte element models (FEMs). These models are used to approxmate the dynamcs of structural systems, e.g. tran chasss, arcraft fuselages, bcycle frames, cvl structures etc. The fnte element model updatng problem (FEMUP) arses when a real system s dynamc behavor s measured (e.g. the natural frequences at whch partcular system deformatons occur) and the results of the mathematcal model of that system do not correspond to the measured data [6, 8]. Ths problem s compounded by the fact that a multtude of mathematcal models of the structure, wth varyng levels of complexty, can be developed, leadng to non-unque solutons for a partcular system. Fnte element models are lmted by defnton; they are an approxmaton of a real system and wll thus never produce dynamc results that are equal to the measured system s data. The challenge s then what can be done to the ntal model for t to better reflect the real system s dynamc results? Ths leads to the need for ntellgently mproved or updated models. Specfcally an automatc methodology of determnng salent model parameters that requre updatng needs to be developed. Ths has to be attaned whlst usng realstc characterstc parameters of the system n queston. Two man drectons of research have been establshed n the area of fnte element model updatng (FEMU); drect and ndrect (teratve) methods [8]. In the drect model updatng paradgm [3, 5, 8] the model modal parameters are drectly equated to the measured modal data. Model updatng s then characterzed by the drect updatng of mass or stffness matrx elements. Ths effectvely constrans the modal propertes and frees the system matrces for updatng. Ths approach often results n unrealstc elements n the system matrces e.g. large and physcally mpossble mass elements. In the ndrect or teratve model updatng approach the updatng problem s formulated as a relaxed optmzaton problem, often approached by the use of maxmum lkelhood methods [8, 9, 1 and 19]. A select few parameters are vared n model elements and the resultng model s optmzed to mnmze ts dfference from the measured data. Gven the non-unqueness of updatng models, ths paper proposes gong back to the ntal stage of modelng and questons the choce of the ntal fnte element model(s). We propose the FEMUP should ntally be approached from a model selecton [, 10, 17] perspectve. Before model updatng, a number of fundamental questons need to be addressed, these are; () Is the model we want to update the correct one? () Whch aspects of the model do we need to update? () Havng determned the updatng parameters, wth what certanty can we guarantee that our updated model s correct? The frst pont can be recast as; what evdence do we have that our model s the correct one gven that a number of models can be generated? Ths we propose ought to be an essental and necessary statstc to establsh before any model updatng scheme can proceed. Havng establshed that the most probable model s found from a set of possble models we can then focus on the updatng process. In ths paper we focus on the frst problem whch lends tself well to Bayesan nference. Bayesan analyss allows one to deal wth ntal and subsequent fnte element model uncertantes n an ntutve and systematc way [, 10]. Ths paper s concerned wth calculatng the evdence of fnte element models. In the next secton we formally present the fnte element model formulaton and very compactly revew the current approaches to the FEMUP. In secton 3 we revew Bayes theorem and ntroduce the evdence calculaton n the Bayesan framework. Secton 4 presents the evdence calculaton algorthm. Secton 5 presents proof of concept smulatons of evdence calculaton usng a smple beam structure. We then conclude the paper.. Fnte element background.1 Formal defnton In engneerng, dynamc structures are often analyzed from bottom to systems (component) level. At the bottom most level the structure s dscretzed nto consttuent elements, for mathematcal analyss and computatonal feasblty, to a system of a second-order matrx of the form [6, 8]: M & x ( t) + Cx& ( t) + Kx( t) = 0 (1)

3 where M, C and K are of equal sze and are called the mass, dampng and stffness matrces respectvely or system matrces. Assumng each fnte element s dynamc dsplacement response behaves accordng to wt x( t) = φ e equaton 1 above s transformed to: [ w M + wc + K] φ = 0 () In cases where the structure s small, lghtly damped or undamped the dampng matrx C = 0 the above equaton reduces to: where { ε } w and [ w M + K] φ = { ε } φ are the th system natural frequency and mode shapes, together known as modal propertes, s the th error of the error vector. Gven a set of measured real system modal data, the FEMU problem s then for the model to realstcally approxmate the mass and stffness matrces that wll produce modal data that s as close to the real systems as possble. If the model does not result n matchng modal propertes the error vector s non-zero and some model parameters wll need to be updated. Basc physcs relates elastc element stffness wth Young s modulus; the mass s a functon of ts geometry and densty. By consderng these varables as random values that are defned wthn certan ntervals for partcular materals, t s possble to closely approxmate the measured modal values n a formal way. In ths paper we treat the Young s modulus as a varable to be updated. Measurement of structural dynamcs produces one set of, not necessarly repeatable data, e.g. buldng vbratons, earthquakes and vehcle dynamc performances. Tradtonal approaches to prevent data basng models are to repeat the measurements a number of tmes to generate a general trend and averagng the data. Ths s not a smple process and can become very expensve [6]. Ths stuaton s well suted to the Bayesan approach as opposed to a frequentst paradgm. In Bayesan nference we are gven one observed data set whch our model s supposed to approxmate well. In the frequentst approach the data acquston or experment s assumed to be repeatable, such that a pattern could be determned from a large dataset. The Bayesan perspectve s bold n that t nfers a lot from one dataset []. In the next secton we present the tools of ths paradgm, Bayes theorem and then explan Bayesan nference n the context of the fnte element updatng problem. 3. Bayesan Inference In current tmes of massve data, the ablty to quantfy the model s posteror confdence and to compare one model s ablty to approxmate data wth another has become the focus of data analyss. One paradgm n ths drecton that has seen a recent resurgence s Bayesan nference [, 10 and 0]. Bayesan nference allows one to quantfy uncertantes n quanttes of nterest n a formal way. Bayesan nference s often mplemented n two settngs; parameter estmaton and model selecton. Parameter estmaton s concerned wth the plausblty of a gven model s parameters and ths s often carred out usng standard samplng methods e.g. Markov Chan Monte Carlo (MCMC) [, 10, 11 and see 16 for recent advances n these technques]. Model selecton on the other hand deals wth the evdence for each canddate mathematcal model to approxmate a partcular observed dataset. 3.1 Parameter estmaton In parameter estmaton the mathematcal model s assumed to be true, the model s then ftted to the data and the posteror plausblty of the model parameters can be nferred. Ths probablty s calculated va Bayes theorem as follows: D θ, H ) θ H ) θ D, H ) = D H ) where the left hand sde s the posteror probablty of the updatng parameters for the true model H, gven some data D, the pror probablty of the model parameters s θ H ), D θ, H ) s called the lkelhood of the model. The denomnator D H ) s called the margnal lkelhood, or the evdence, of the model where the parameters have been margnalzed out. Bayes theorem automatcally ncorporates the updatng of the (4) (3)

4 parameters by defnton; t updates the a pror probablty dstrbuton of the model parameters wth the lkelhood of the model explanng the measured data. In the FEM context the parameter varables that typcally govern the dynamcs of the fnte elements of the mathematcal model are the followng: Young s modulus, cross-sectonal areas, dampng coeffcent etc. These parameters n turn affect the stffness, mass and dampng matrces n equaton 1. In [11] the parameter estmaton context of the Bayesan framework was mplemented to obtan the posteror probablty dstrbuton of model parameters. By obtanng the posteror probablty of the updatng parameters the probablty dstrbuton of the modal propertes may then be calculated. Ths gves the researcher a quanttatve measure of the probable ranges of the modal and updatng parameters of the model. In ths paper the nterest s not n the posteror probablty of the updatng parameters per se but n the evdence of the chosen updatng model thus a model selecton problem although the algorthm mplemented provdes the posteror probabltes of the updatng parameters as a by-product. 3. Model Comparson In model comparson one dataset s observed and a number of possble models can be formulated. Bayesan nference provdes a platform for calculatng whch model s the most plausble from ths set. The posteror probablty of each model wthn a set of plausble models s gven by Bayes theorem: where H ) ( H D) = D H ) H ) D) P s the pror probablty of each model and D) (5) s the probablty of the data. Snce for all models the denomnator s ndependent of the model we may gnore t and the theorem then reduces to: P ( H D) D H ) H ) (6) The frst term on the rght of equaton 6 s the evdence from equaton 4. Gven that each model may be equally lkely to ft the data, the evdence term s the decdng factor on whch model s the most plausble for a partcular observed dataset. One standard method of comparng models n Bayesan analyss s Bayes factor defned as; Bayes Factor = D H ) = D H ) dθ D θ, H ) θ H ) dθ D θ, H ) θ H ) (7) So by calculatng each model s evdence we can quantfy ther ratos. In [1, 4 and 17] the concept of model selecton for engneerng structures was used. In [1] the posteror dstrbuton of the model was assumed to be Gaussan whch only works for certan types of models [1,, 4, 10 and 17]. The method proposed n ths paper does not place any assumpton of the form of the posteror dstrbuton of the model. In [17] a recently proposed MCMC type posteror probablty samplng algorthm (TMCMC from [4]) was mplemented. Ths algorthm estmates the model evdence by samplng the posteror probablty dstrbuton of the model by a sequence of non-normalzed ntermedate probablty functons. Ths algorthm suffers from the use of many free parameters; e.g. a varable to balance the samplng steps, the number of ntermedate probablty dstrbuton functons (PDF), the temperng parameter and the sample weghts [4, 17]. The algorthm proposed here s beleved to be smpler and to have fewer free-parameters. In the next secton we explan the Bayesan evdence. We then ntroduce an algorthm called nested samplng for effcently estmatng the model evdence that s theoretcally and practcally smpler than TMCMC. 3.3 Bayesan evdence From the prevous equaton each model s evdence s gven by equaton 8: = evdence = P D H ) dθ D θ, H ) θ H ) ( (8)

5 dθ wth a model havng a pror Ths equaton may be nterpreted as follows; gven a unt of parameter space probablty of P θ H ) over ths space, the posteror probablty dstrbuton of the model over the same space ( wll depend on how the model parameters ft the data D, H ) P θ. In ths paper the lkelhood functon s defned ( as the normalzed exponental error between measured and real natural frequences (the error gven n equaton 1) at the measured modes as n [Ref.13]. The model posteror probablty wll be hghest at the most probable parameter set whch occupes a small regon of the orgnal parameter space. In smple models an ntally smaller, by defnton, pror parameter space would almost be fully utlzed to ft the data as the posteror probablty would occupy a large porton of the pror parameter space resultng n a correspondngly large evdence value. Complex models have larger parameter spaces because they have many free parameters that allow them to ft almost any data and ths often results n over-fttng [, 10]. Ths larger parameters space s wasted n accountng for the resultant, relatvely narrow posteror densty. The Bayesan nference paradgm thus automatcally penalzes complex models wthout the need for a model regularzaton term often ncorporated n non-bayesan approaches [, 10, 19]. Contnung wth the evdence formulaton, equaton 8 can be re-wrtten n the followng form: Z = L( θ ) π ( θ ) dθ (9) Analytcally evaluatng ths ntegral may be dffcult or mpossble f the product of the pror and lkelhood s not smple. Ths often happens when for example the parameter space s hgh dmensonal whch requres calculatng multdmensonal lkelhoods. The most popular approach to approxmatng such ntegrals has been to apply numercal technques such as mportance samplng and thermodynamc ntegraton but these confront the problem that the pror parameters are dstrbuted n regons where the lkelhood functon s not hghly concentrated [,10,16]. Other recent samplng technques for example TMCMC n [4] that are based on MCMC paradgm can be used but these tend to only sample the peaks of the posteror dstrbuton whch can under sample most of the narrow best-ft regons. Recently Skllng n [18] proposed an algorthm, nested samplng, whch s able to estmate ntegrals of the form shown n equaton 9 effcently. The algorthm works by transformng the multdmensonal parameter space ntegral to a one dmensonal one where classcal numercal approxmaton technques of estmatng the area under the functon can be appled. The algorthm has been successfully appled and further modfed n a number of recent astronomy and cosmology papers [7, 14, 15, 0] 4. Samplng 4.1 Nested samplng Nested samplng s a Monte Carlo but not a Markov Chan method of samplng. The man dea behnd the method s to dvde the pror parameter space nto equal mass unts and to order these by model lkelhood. The total pror mass s denoted X and each unt n ths pror mass s P ( θ H ) dθ = π ( θ ) dθ = dx. The lkelhood functon s wrtten P ( D θ, H ) = L( θ ) = L( X ) n ths space. Ths formulaton transforms the lkelhood nto a functon of a one-dmenson parameter. The evdence ntegral can now be wrtten: evdence = Z = L θ ) π ( θ ) dθ = ( L dx The algorthm then supposes lkelhoods can be evaluated at all 1 0 X so that L = L( X ), where < <... < X < X < X 0 X N 1 0 = (10) X s a sequence of values that decrease from 1 to 0 such that 1as llustrated n the bottom mage of fgure 1. The top mage shows a number of samples and the lkelhood so-contours n the -dmensonal posteror probablty parameter space.

6 Fgure 1: Samplng from a D parameter space by nested samplng Such a one dmensonal ntegral functon, equaton 10, can easly be estmated by any numercal method such as the trapezod rule: N Z = 1 N Z = Z = Lb = 1 (11) 1 where b = ( 1 +1 ) X X and L s the lkelhood at that sample. In the context of fnte element updatng, the algorthm acheves the above approxmaton n the followng manner: 1. Sample N updatng parameters from the pror probablty dstrbuton. Evaluate ther lkelhoods.. From the N samples select the sample wth the lowest lkelhood ( L ). 3. Increment the evdence by = L Z ( 1 +1) X X. 4. Dscard the sample wth the lowest lkelhood and replace t wth a new pont from wthn the remanng pror volume [ 0, X ]. The new sample must satsfy the constrant L new > L 5. Repeat steps -4 untl some stoppng crteron s reached. Ths could be the desred precson on the evdence or some teraton count (Max n our algorthm). For further detals on nested samplng see [18]. The next secton presents the experments performed on dfferent fnte element models and the evaluaton of ther evdences. 4. Model defnton and comparson In FEM a mathematcal model ( H n secton 3) s defned by the quantty and locaton of free-parameters (updatng parameters). Here fnte element models were desgned to have a dfferent number of free-parameters at dfferent postons along the same structure, effectvely creatng dfferent mathematcal models for the same structure. In mathematcs the number of free-parameters s related to the complexty of a mathematcal model and to advocate Occam s razor; a model wth fewer parameters s preferred. Ths s useful n not only determnng whch parameters need to be updated but also how many can be deemed suffcent to approxmate the measured data well. To determne how well dfferent models compare n fttng the data, Jeffrey s scale [10], shown n table 1, was used.

7 Table 1: Jeffrey's factor scale Z / Z log ( Z / Z ) loge ( Z / Z ) log 10 ( Z / Z ) Evdence aganst model H 1 to 3. 0 to to 1. 0 to 0.5 Weak 3. to to to to 1 Substantal 10 to to to to Strong > 100 > 6.6 > 4.6 > Decsve > 1000 > 10 > 7 >3 Beyond reasonable doubt 5. Experments A smple unsymmetrcal H-beam, wth sx degrees of freedom, prevously used n [13], s modeled. The measured natural frequences of ths structure occur at; 53.9Hz, 117.3Hz, 08.4Hz, 54Hz and 445Hz whch correspond to modes 7, 8, 10, 11 and 13 respectvely. To valdate that model evdence calculaton can reveal the most plausble fnte element model(s), four randomly desgned models of one beam structure are developed and the evdence of each s calculated. The example assumes no a pror knowledge of whch updatng parameters should be chosen s avalable. The obectve s then to determne from evdence ratos, the most probable model from ths random set. The structure was modeled usng the SDT verson 6.0 Matlab toolbox. Each model used standard sotropc materal propertes and Euler Bernoull beam elements to approxmate the beam sectons of the structure. It s assumed that the Young s modulus of some elements s not certan and was thus consdered a varable to be updated n the partcular updatng parameters. 5.1 Unsymmetrcal H beam Fgures and 3 llustrate a sketch of a 600mm long unsymmetrcal alumnum structure wth the left vertcal beam of 400mm and the rght beam of 00mm. It s dvded nto 1 elements. Each cross-sectonal area s 9.8mm by 3. mm (see [13] for more detals on the structure and expermental set-up). The structure s elements are numbered to clarfy the readng of table, where two sets of models are shown; model 1[A-C] and model [A-C] Fgure : Model 1A of a 1 Element Unsymmetrcal H beam. 3. The updatng parameters were sampled from a Gaussan pror probablty dstrbuton wth a mean of 7.x10 10 N.m - and an exponental nverse varance of 4.0e-0 for Young s modulus values between 6.8x10 10 N.m - and 8.0x10 10 N.m - for alumnum. The number of samples, N, was set to 100 (to sample the dstrbuton well) and the samplng algorthm stoppng crteron s expermentally set to a maxmum of 50 teratons. Model 1A n table s the modeled structure such that the elements labeled n fgure are set to a constant value of Young s modulus for alumnum (7.x10 10 N.m - ). The Young s modulus values for elements labeled are sampled from a pror wth a Gaussan probablty dstrbuton as mentoned above. Model 1B s the opposte settng where now the labeled parameters are fxed and the parameters are sampled from a Gaussan pror dstrbuton. All the elements that are free or updated n each model are lsted under the headng Parameter label n table. The set of updated parameters does not necessarly have to be fxed; all parameters can be vared smultaneously as shown by models 1C and C n table. Fgure 3 llustrates model A from the second set of models.

8 Table : Updated parameters and model evdences Model Log(Evdence) Quantty of parameters Parameter label 1A.188 ± ,3,5,10,11 1B ± ,4,6,7,8,9,1 1C 1.15 ± All A ± ,5,6,7,8,9,10 B.188 ± ,3,4,11,1 C 1.74 ± All Fgure 3: Model A of a 1 Element Unsymmetrcal H beam. Table 3 shows the results usng Jeffrey s scale. Models 1A and A are very dfferent; model 1A s a better model for ths data than model A. It s nterestng to note that the models wth the least number of updatng parameters produced the best evdences and ths s because t s relatvely smple and n accordance wth Occam s razor whch states that the least complex model that best descrbes the data s the correct one. Model 1A and B are shown to be relatvely smlar whle there s strong evdence aganst model A from model 1B. So evdence calculaton can provde a mechansm for elmnatng poor models from the onset. It also provdes a platform to determne salent parameters to consder n the updatng process. Table 3: Bayes factors for Unsymmetrcal beam model H p / H q Bayes Factor Jeffrey s Scale Evdence aganst model H q ( p q Z / Z ) log ( Z / Z ) 1A/1B Beyond reasonable doubt 1A/A Beyond reasonable doubt 1A/B 1 0 Weak 1B/ A Strong 6. Concluson e In ths paper we have ntroduced the model selecton concept to the problem of fnte element model updatng. It was argued that plausble model evdences should be calculated before models can be updated. A recently proposed method of comparng mathematcal models was ntroduced and mplemented n the fnte element model context. Ths algorthm, nested samplng, effcently calculates the Bayesan evdence of a model and provdes the posteror probablty dstrbuton of the model parameters as a by-product. A smple beam structure wth a number of random mathematcal model formulatons, defned by the number and poston of updatng parameters, s used as proof-of-concept for the algorthm n ths doman. Clear dstnctons between the models are evdent from ther relatve evdences.

9 7. Acknowledgements Ths research was supported by the fnancal assstance of the Natonal Research Foundaton of South Afrca. I would lke to thank members of the Wts Computatonal Intellgence group for ther helpful dscussons. 8. References [1] Beck JL and Yuen K-V. Model selecton usng response measurements: Bayesan Probablstc Approach. Journal of Engneerng Mechancs, Vol. 130, No., pp 19-03, February 004. [] Bshop CM. Pattern Recognton and Machne Learnng. Sprnger, 006. [3] Carvalho J, Datta BN, Gupta A, Lagadapat M. A drect method for model updatng wth ncomplete measured data and wthout spurous modes. Mechancal Systems and Sgnal Processng. Vol. 1, pp , 007. [4] Chng JY, Chen YC. Transtonal Markov Chan Monte Carlo method for Bayesan model updatng, model class selecton, and model averagng. Journal of Engneerng Mechancs-ASCE, Vol.133, No. 7, pp , 007. [5] Datta BN Fnte element Model Updatng, Egenstructure Assgnment and Egenvalue Embeddng Technques for vbratng Systems. [6] Ewn DJ. Modal Testng: Theory and Practce. Publsher Letchworth, Research Studes Press, [7] Feroz F and Hobson M.P Multmodal nested samplng: an effcent and robust alternatve to MCMC methods for astronomcal data analyss. Monthly Notces of the Royal Astronomcal Socety, Vol. 384, No., pp , 007. [8] Frswell MI and Mottershead JE. Fnte element model updatng n structural dynamcs. Kluwer Academc Publshers: Boston, [9] Km G-H, Park Y-S. An automated parameter selecton procedure for fnte element model updatng and ts applcatons. Journal of Sound and Vbraton. Vol. 309, No. 3-5, pp , 008 [10] MacKay DJC. Informaton theory, nference, and learnng algorthms. Cambrdge Unversty Press, 003. [11] Marwala T, Sbs S. Fnte Element Model Updatng usng Bayesan Framework and Modal Propertes. Journal of Arcraft. Vol. 4, No. 1, pp January-February 005. [1] Marwala T. Fnte element model updatng usng wavelet data and genetc algorthm. Journal of Arcraft, Vol. 39, No. 4, pp , July August 00. [13] Marwala T. Fnte element model updatng usng response surface method. Proceedngs of the 45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamcs & Materals Conference, Palm Sprngs, Calforna, USA, Aprl 004, AIAA Paper pp , [14] Mukheree P, Parknson D and Lddle AR. A nested samplng algorthm for cosmologcal model selecton. Draft verson. ArXv: astro-ph/ v. 11 January 006. [15] Parknson D, Mukheree P and Lddle AR. A Bayesan model selecton analyss of WMAP3. ArXv: astroph/ v. 19 th June 006 [16] Murray I. Advances n Markov Chan Monte Carlo methods. PhD thess, Gatsby computatonal neuroscence unt, Unversty College London, 007. [17] Muto M, Beck LJ. Bayesan updatng and model class selecton for hysteretc structural models usng stochastc smulaton. Journal of Vbraton and Control, Vol. 14, No. 1-, pp 7-34, 008.

10 [18] Skllng J. Nested samplng for Bayesan computatons. In J. M. Bernardo, M. J. Bayarr, J. O. Berger, A. P. Dawd, D. Heckerman, A. F. M. Smth, and M. West, edtors, Bayesan Statstcs 8, Proceedngs of the Valenca / ISBA 8th World Meetng on Bayesan Statstcs. Oxford Unversty Press, 007. [19] Tturus B and Frswell MI. Regularzaton n model updatng. Internatonal Journal for numercal methods n engneerng.vol. 75, pp , 008. [0] Trotta R. Applcatons of Bayesan model selecton to cosmologcal parameters. ArXv: astro-ph/0540v

Mathematics 256 a course in differential equations for engineering students

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

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

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

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

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

S1 Note. Basis functions.

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

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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 information

A Binarization Algorithm specialized on Document Images and Photos

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

Analysis of Continuous Beams in General

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

An Entropy-Based Approach to Integrated Information Needs Assessment

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

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

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

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Classifier Selection Based on Data Complexity Measures *

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

Design of Structure Optimization with APDL

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

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

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

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. 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 information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

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

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Cluster Analysis of Electrical Behavior

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

Support Vector Machines

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

Three supervised learning methods on pen digits character recognition dataset

Three supervised learning methods on pen digits character recognition dataset Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru

More information

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

CS 534: Computer Vision Model Fitting

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

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

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

Unsupervised Learning

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

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

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

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

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

Hermite Splines in Lie Groups as Products of Geodesics

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

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

An Optimal Algorithm for Prufer Codes *

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

Wavefront Reconstructor

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

A New Approach For the Ranking of Fuzzy Sets With Different Heights

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

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

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

Feature Reduction and Selection

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

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves AVO Modelng of Monochromatc Sphercal Waves: Comparson to Band-Lmted Waves Charles Ursenbach* Unversty of Calgary, Calgary, AB, Canada ursenbach@crewes.org and Arnm Haase Unversty of Calgary, Calgary, AB,

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

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

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

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

Virtual Machine Migration based on Trust Measurement of Computer Node

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

Wishing you all a Total Quality New Year!

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

A Robust Method for Estimating the Fundamental Matrix

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

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

More information

Bayesian Approach for Fatigue Life Prediction from Field Inspection

Bayesian Approach for Fatigue Life Prediction from Field Inspection Bayesan Approach for Fatgue Lfe Predcton from Feld Inspecton Dawn An, and Jooho Cho School of Aerospace & Mechancal Engneerng, Korea Aerospace Unversty skal@nate.com, jhcho@kau.ac.kr Nam H. Km, and Srram

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

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

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status

More information

Genetic Tuning of Fuzzy Logic Controller for a Flexible-Link Manipulator

Genetic Tuning of Fuzzy Logic Controller for a Flexible-Link Manipulator Genetc Tunng of Fuzzy Logc Controller for a Flexble-Lnk Manpulator Lnda Zhxa Sh Mohamed B. Traba Department of Mechancal Unversty of Nevada, Las Vegas Department of Mechancal Engneerng Las Vegas, NV 89154-407

More information

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL GROUP ANALYSIS Martn M. Mont UCLA Psychology NITP AGGREGATING MULTIPLE SUBJECTS When we conduct mult-subject analyss we are tryng to understand whether an effect s sgnfcant across a group of people. Whether

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

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

The Codesign Challenge

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

Help for Time-Resolved Analysis TRI2 version 2.4 P Barber,

Help for Time-Resolved Analysis TRI2 version 2.4 P Barber, Help for Tme-Resolved Analyss TRI2 verson 2.4 P Barber, 22.01.10 Introducton Tme-resolved Analyss (TRA) becomes avalable under the processng menu once you have loaded and selected an mage that contans

More information

APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET

APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty

More information

X- Chart Using ANOM Approach

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

EXTENDED BIC CRITERION FOR MODEL SELECTION

EXTENDED BIC CRITERION FOR MODEL SELECTION IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET

APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Vibration Characteristic Analysis of Axial Fan Shell Based on ANSYS Workbench

Vibration Characteristic Analysis of Axial Fan Shell Based on ANSYS Workbench Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 2015) Vbraton Characterstc Analyss of Axal Fan Shell Based on ANSYS Workbench Lchun Gu College of Mechancal and Electrcal

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and

More information

Boundary Condition Simulation for Structural Local Refined Modeling Using Genetic Algorithm

Boundary Condition Simulation for Structural Local Refined Modeling Using Genetic Algorithm 2016 Internatonal Conference on Artfcal Intellgence: Technques and Applcatons (AITA 2016) ISBN: 978-1-60595-389-2 Boundary Condton Smulaton for Structural Local Refned Modelng Usng Genetc Algorthm Zhong

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

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

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

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

Support Vector Machines

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

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

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

Reducing Frame Rate for Object Tracking

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

Edge Detection in Noisy Images Using the Support Vector Machines

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

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Monte Carlo Integration

Monte Carlo Integration Introducton Monte Carlo Integraton Dgtal Image Synthess Yung-Yu Chuang 11/9/005 The ntegral equatons generally don t have analytc solutons, so we must turn to numercal methods. L ( o p,ωo) = L e ( p,ωo)

More information

TESTING AND IMPROVING LOCAL ADAPTIVE IMPORTANCE SAMPLING IN LJF LOCAL-JT IN MULTIPLY SECTIONED BAYESIAN NETWORKS

TESTING AND IMPROVING LOCAL ADAPTIVE IMPORTANCE SAMPLING IN LJF LOCAL-JT IN MULTIPLY SECTIONED BAYESIAN NETWORKS TESTING AND IMPROVING LOCAL ADAPTIVE IMPORTANCE SAMPLING IN LJF LOCAL-JT IN MULTIPLY SECTIONED BAYESIAN NETWORKS Dan Wu 1 and Sona Bhatt 2 1 School of Computer Scence Unversty of Wndsor, Wndsor, Ontaro

More information

Review of approximation techniques

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

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

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

A Topology-aware Random Walk

A Topology-aware Random Walk A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble

More information

Related-Mode Attacks on CTR Encryption Mode

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

Complex Filtering and Integration via Sampling

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

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

Optimization of integrated circuits by means of simulated annealing. Jernej Olenšek, Janez Puhan, Árpád Bűrmen, Sašo Tomažič, Tadej Tuma

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

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

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

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

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

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

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

Intelligent Information Acquisition for Improved Clustering

Intelligent Information Acquisition for Improved Clustering Intellgent Informaton Acquston for Improved Clusterng Duy Vu Unversty of Texas at Austn duyvu@cs.utexas.edu Mkhal Blenko Mcrosoft Research mblenko@mcrosoft.com Prem Melvlle IBM T.J. Watson Research Center

More information

A Bilinear Model for Sparse Coding

A Bilinear Model for Sparse Coding A Blnear Model for Sparse Codng Davd B. Grmes and Rajesh P. N. Rao Department of Computer Scence and Engneerng Unversty of Washngton Seattle, WA 98195-2350, U.S.A. grmes,rao @cs.washngton.edu Abstract

More information

A fault tree analysis strategy using binary decision diagrams

A fault tree analysis strategy using binary decision diagrams Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:

More information

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET 1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School

More information

Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance

Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 2 Sofa 2016 Prnt ISSN: 1311-9702; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-2016-0017 Hybrdzaton of Expectaton-Maxmzaton

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

A Computationally Efficient Bayesian Framework for Structural Health Monitoring using Physics-Based Models

A Computationally Efficient Bayesian Framework for Structural Health Monitoring using Physics-Based Models Paper 27 Abstract A Bayesan nference framework for structural damage dentfcaton s presented. Sophstcated structural dentfcaton methods, combnng vbraton nformaton from the sensor network wth the theoretcal

More information