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

Size: px
Start display at page:

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

Transcription

1 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 nformaton bult nto a hgh-fdelty fnte element model for smulatng structural behavour, are ncorporated nto the system n order to montor structural condton, track structural changes and dentfy the locaton, type and extent of the damage. The methodology for damage detecton combnes the nformaton contaned n a set of measurement modal data wth the nformaton provded by a famly of compettve, parameterzed, fnte element model classes smulatng plausble damage scenaros n the structure. The computatonal challenges encountered n Bayesan tools for structural damage dentfcaton are addressed. Smulated modal data from the etsovo Brdge are used to valdate the effectveness of the methodology. Keywords: Bayesan nference, structural health montorng, damage dentfcaton, model reducton, krgng, hgh performance computng. 1 Introducton Cvl-Comp Press, 2015 Proceedngs of the Fourth Internatonal Conference on Soft Computng Technology n Cvl, Structural and Envronmental Engneerng, Y. Tsompanaks, J. Krus and B.H.V. Toppng, (Edtors), Cvl-Comp Press, Strlngshre, Scotland A Computatonally Effcent Bayesan Framework for Structural Health ontorng usng Physcs-Based odels C. Papadmtrou 1, C. Argyrs 1 and P. Panetsos 2 1 Department of echancal Engneerng Unversty of Thessaly, Volos, Greece 2 Egnata Odos S.A., Captal antenance Department Therm, Greece Bayesan nference s used for quantfyng and calbratng uncertanty models n structural dynamcs based on vbraton measurements, as well as propagatng these uncertantes n smulatons for updatng robust predctons of system performance, relablty and safety [1-3]. The Bayesan tools are based on Laplace methods of asymptotc approxmaton [4,5] and samplng algorthms [6]. These tools nvolve solvng optmzaton problems, generatng samples for tracng and then populatng the mportant uncertanty regon n the parameter space, as well as evaluatng ntegrals over hgh-dmensonal spaces of the uncertan model and loadng parameters. They requre a moderate to very large number of system re-analyses to be performed over the space of uncertan parameters. For hgh-fdelty fnte element 1

2 (FE) models requred n model-based structural health montorng applcatons, the use of Bayesan technque may result n excessve computatons. The computatonal challenges encountered n Bayesan tools for structural damage dentfcaton are addressed. An effectve structural health montorng system requres the development of computatonally effcent technques and specalzed software that ntegrates nformaton from physcs-based mathematcal models of structural components wth the nformaton collected from vbraton measurements under varous operatonal condtons, ncludng normal operaton under the acton of everyday loads, wnd loads and envronmental effects (e.g. temperature), as well as sudden extreme load events such as moderate to strong earthquakes or strong wnds. The specfcatons of a complete montorng system of collectng and processng data for structural health montorng based on physcsbased FE models [7,8] are revewed and the mportance of FE model updatng technques s emphaszed. Novel methods to drastcally reduce computatons n SH systems are presented. Specfcally, hgh performance computng technques are ntegrated wth Bayesan technques for structural damage dentfcaton to effcently handle largeorder models of hundreds of thousands or mllons degrees of freedom, and nonlnear actons actvated durng system operaton. Fast and accurate component mode synthess technques [9] are proposed, consstent wth the fnte element model parameterzaton, to acheve drastc reductons n computatonal effort n a sngle fnte element model smulaton. Surrogate models are also used wthn mult-chan CC algorthms wth annealng propertes to substantally speed-up computatons [10], avodng full system re-analyses. Sgnfcant computatonal savngs are also acheved for hghly-parallelzed operatons manfested n system smulatons and samplng algorthms, by adoptng the Π4U software [11] to effcently dstrbute the computatons n avalable mult-core CPUs. Such technques allow one to handle detaled lnear and nonlnear models of structural components and thus mprove SH capabltes. The mportance of the proposed computatonal framework s demonstrated for applcatons on model-based structural damage dentfcaton of cvl nfrastructure. The developed structural health montorng methodology s llustrated usng smulated damage and correspondng modal data from a brdge of the Egnata Odos motorway. 2 Damage dentfcaton methodology The Bayesan nference methodology for model class selecton based on measured modal data s presented n order to detect the locaton and severty of damage n a structure. A substructure approach s followed where t s assumed that the structure s comprsed of a number of substructures and damage n the structure causes stffness reducton n one of the substructures. In order to dentfy whch substructure contans the damage and predct the level of damage, a famly of model classes,, s ntroduced, and the damage dentfcaton s 1 m accomplshed by assocatng each model class to damage contaned wthn a 2

3 substructure. For ths, each model class s parameterzed by a number of structural model parameters q controllng the stffness dstrbuton n the substructure, whle all other substructures are taken to have fxed stffness dstrbutons equal to those correspondng to the undamaged structure. Damage n the substructure wll cause stffness reducton whch wll alter the measured modal characterstcs of the structure. The model class that contans the damaged substructure wll be the most lkely model class to observe the modal data snce the parameter values q can adjust to the modfed stffness dstrbuton of the substructure, whle the other model classes that do not contan the substructure wll provde a poor ft to the modal data. Thus, the model class can predct damage that occurs n the substructure and provde the best ft to the data. Bayesan nference s used to dentfy the most probable damaged substructure gven the modal data [1,12]. 2.1 Bayesan model class selecton 0 Let D {ˆ, ˆ N = w f Î R, r = 1,, m } be the avalable measured data consstng of r r modal frequences ˆr and modeshape components f ˆr at N 0 measured DOFs, where m s the number of observed modes. Let P ( ; ) = N0 q Μ { w ( q; Μ ), f( q; Μ ) Î R, r = 1,, m} be the predctons of the r r modal frequences and modeshapes from a partcular model n the model class Μ correspondng to a partcular value of the parameter set q. Before the selecton of data, each model class Μ s assgned a probablty P( Μ ) of beng the approprate class of models for modelng the structural behavor. Usng Bayes theorem, the posteror probabltes P( Μ D) of the varous model classes gven the data D s pd ( Μ ) P( Μ ) P( Μ D) = m å pd ( Μ ) P( Μ ) = 1 (1) where pd ( Μ ) s the probablty of observng the data from the model class Μ, gven by pd ( Μ ) = (,, ) (, ) ò pd q s Μ p q s Μ ds dq (2) Q where { : u q 0 q q } s the doman of ntegraton n Equaton (2) that u depends on the range of varaton of the parameter set q, and q are the values of 3

4 q at the undamaged condton of the structure. In Equaton (2), pd ( q, s, ) s the lkelhood of observng the data from a gven model n the model class Μ. For each model class Μ ths lkelhood s obtaned usng predctons P( q ; Μ ) and the () () () assocated probablty models for the vector of predcton errors e = [ e,, e ] 1 m defned as the dfference between the measured modal propertes nvolved n D for all modes r = 1,, m and the correspondng modal propertes predcted by a model () () () n the model class Μ. The model error e = [ e ] r w e r f for the model class Μ are r assumed to be gven separately for the modal frequences and mode shapes from the predcton error equatons: () wˆ = w ( q ; Μ ) + wˆ e r = 1,, m (3) r r r wr ˆ () ˆ () f = b f( q; Μ ) + f e r = 1,, m (4) r r r r () () () () where ˆ T T () b = ff / f f, wth f º f( q ; Μ ), s a normalzaton constant r r r r r r r that accounts for the dfferent scalng between the measured and the predcted modeshape. The model predcton errors are due to modelng error and measurement nose. Assumng that they are modeled as ndependent Gaussan zero-mean random varables wth varance s, the lkelhood s gven by [13] where 2 f r é 1 N ù J pd ( q, s, Μ ) exp J( ˆ ;, D) N /2 - q Μ 2 (5) J s 2s j êë j úû ˆ 1 1 a J( q ; Μ, D) = + (6) m m 2 m é m w ( ; ) wˆ ù ( ; )- r r r r r q Μ - å 2 r= 1 wˆ å f q Μ f êë r úû r= 1 fˆ r 2 represents the measure of ft between the measured modal data and the modal data predcted by a partcular model n the class, s the usual Eucldan norm, and N = m( N + 1). J 0 Also, gven the model class Μ, the pror probablty dstrbuton p( q, s Μ ), nvolved n Equaton (2), of the model and the predcton error parameters [ q, s ] of the model class Μ are assumed to be ndependent and of the form p ( q, s Μ ) = p ( q ) p ( s ). q s The optmal model class s selected as the model class that maxmzes the best probablty P( D) gven by Equaton (5). The probablty dstrbuton 4

5 p( q D, ) quantfyng the uncertanty n the parameters q of a model class gven the data s obtaned by applyng Bayes theorem [1], as follows pd ( q, s, Μ ) p( q, s Μ ) p( q, s D, Μ ) = (8) pd ( Μ ) Where pdμ ( ) s the evdence of the model class Μ. The most probable value of the parameter set that corresponds to the most probable model class Μ s denoted best by q ˆbest. Usng the Bayesan model selecton framework n Secton 2, the model classes are ranked accordng to the posteror probabltes based on the modal data. The most probable model class that maxmzes p( D) n Equaton (5), through best ts assocaton wth a damage scenaro on a specfc substructure, wll be ndcatve of the substructure that s damaged, whle the most probable value q ˆbest of the model parameters of the correspondng most probable model class, compared to the best parameter values of the undamaged structure, wll be ndcatve of the severty of damage n the dentfed damaged substructure. The percentage change Dq between the best estmates of the model parameters q ˆ of each model class and the values q ˆ of the reference (undamaged) structure und, s used as a measure of the severty (magntude) of damage computed by each model class, = 1,, m. The selecton of the compettve model classes, = 1,, m depends on the type and number of alternatve damage scenaros that are expected to occur or desred to be montored n the structure. The m model classes can be ntroduced by a user experenced wth the type of structure montored. The pror dstrbuton P( ) n Equaton (5) of each model class or assocated damage scenaro s selected based on the prevous experence for the type of brdge that s studed. For the case where no pror nformaton s avalable, the pror probabltes are assumed to be equal, P( ) = 1/ m, for all ntroduced damage scenaros. 3 Computatonally Effcent Technques The Bayesan tools for FE model selecton and parameter estmaton used for structural damage dentfcaton are Laplace methods of asymptotc approxmaton and stochastc smulaton algorthms. These tools requre a moderate to very large number of repeated system analyses to be performed over the space of uncertan parameters. Consequently, the computatonal demands depend hghly on the number of system analyses and the tme requred for performng a system analyss. The 5

6 Transtonal CC (TCC) algorthm [14] s employed n ths work to carry out the computatons. Hgh performance computng technques are ntegrated wthn the TCC tool to effcently handle large number of DOF n FE models. Specfcally, fast and accurate component mode synthess technques [9] are used, consstent wth the FE model parameterzaton, to acheve drastc reductons n computatonal effort. Surrogate models [10] are also used to replace full system smulatons by fast approxmatons. Fnally computatonal savngs are acheved by adoptng parallel computng algorthms to effcently dstrbute the computatons n avalable multcore CPU [15]. Detals of such HPC technques are presented n [11] where the software Π4U s ntroduced to perform a model non-ntrusve Bayesan analyss n a parallel envronment. The model reducton technques and the surrogate modelng based on krgng algorthm are brefly descrbed n the followng. 3.1 odel Reducton At the model level, model reductons technques have been proposed to consderably reduce the sze of the stffness and mass matrces by several orders of magntude. In partcular, computatonal effcent model reducton technques based on component mode synthess have been developed to handle certan parameterzaton schemes for whch the mass and stffness matrces of a component depend ether lnearly or nonlnearly on only one of the free model parameters to be updated, often encountered n FE model updatng formulatons. In such schemes, t has been shown that the repeated solutons of the component egen-problems are completely avoded, reducng substantally the computatonal demands, wthout compromsng the soluton accuracy. For the case of lnear dependence of the stffness matrx of a structural component on a model parameter, the methodology s presented n [9]. The method can readly be extended to treat the case of nonlnear dependence of the stffness matrx of a structural component on a model parameter. 3.2 Surrogate models At the level of the TCC algorthm, an adaptve krgng model has been ntroduced n [10,15] to reduce the computatonal tme by avodng the full model runs at a large number of samplng pont n the parameters space. Ths s done by explotng the functon evaluatons that are avalable at the neghbour ponts from prevous full model runs n order to generate an estmate at a new samplng pont n the parameter space. Surrogate models are well-suted to be used wthn the TCC algorthm, resultng to the X-TCC algorthm proposed n [10]. In X- TCC, the krgng technque s used to approxmate the functon evaluaton at a samplng pont usng the functon evaluatons at neghbour ponts n the parameter space. To ensure a hgh qualty approxmaton, certan condtons are mposed n order a surrogate estmate be accepted. Detals can be found n [10]. In contrast to the model reducton technque n whch several orders of magntude reducton n computatonal effort may be achevable, for surrogate models wthn TCC only an order of magntude reducton n the number of full model runs nvolved n 6

7 TCC algorthm has been reported whch results n addtonal computatonal savngs. 4 Applcaton The methodology s demonstrate usng a smulated damage scenaro and smulated modal data from the etsovo brdge, shown n Fgure 1. The brdge s the hghest renforced concrete brdge of Egnata Odos motorway located n Greece, wth the heght of the taller per P2 equal to 110m. The total length of the brdge s 537m. The commercal software package COSOL ultphyscs s used for developng the FE model of the brdge based on the desgn plans, the geometrc detals and the materal propertes of the structure. The followng nomnal values of the materal propertes of the concrete deck, pers and foundatons are consdered: Young s 3 modulus E= 37Gpa, Poson s rato n = 0.2 and densty r = 2548 kg m. For the pers and the foundaton the nomnal value of the Young s modulus s E = 34GPa. A detaled FE model s created usng three-dmensonal tetrahedron quadratc Lagrange fnte elements. The selected model has 97,636 fnte elements and 562,101 DOF. Fgure 1: etsovo brdge. 7

8 [2] [4] [5] [8] [10] Fgure 2: Parameterzed FE models correspondng to sngle damage scenaros. To demonstrate the methodology, the etsovo brdge s dvded nto 15 [] [, j] substructures. A number of compettve model classes and are ntroduced to montor varous probable damage scenaros for the brdge correspondng to sngle [] and multple damages at dfferent substructures. The model class contans one parameter related to the stffness of substructure. Representatve models correspondng to a sngle damage scenaro at dfferent substructures are shown n Fgure 2. These models can montor damage assocated wth the stffness reducton [, j] n the substructure. The model class contans two parameters related to the 8

9 stffness of substructures and j. Representatve models are shown n Fgure 3 and they can be used to montor damage assocated wth the stffness reducton n ether substructures and j or smultaneously at both substructures. A fve-parameter model shown n Fgure 3 s also ncluded n the famly of model classes to montor smultaneous damages at fve dfferent substructures. Ths fve-parameter model [5-par ] class s denoted by. All model classes are generated from the updated FE model of the undamaged structure. For each model class, CS technques are used to allevate the computatonal burden assocated wth the model updatng problems that needs to be solved. For ths, two dfferent cases of reduced-order FE models are consdered. The frst case corresponds to models obtaned by reducng the nternal DOF, whle the second case corresponds to models obtaned by reducng both the nternal and nterface DOF. [7,10] [8,10] [2-par] Fgure 3: Parameterzed FE models correspondng to multple damage scenaros. The number of components ntroduced for each model class depends on the [] parameterzaton. Specfcally, the model class s dvded nto two, three or four components. One component s selected to be the substructure shown n Fgure 2, whle the remanng components are selected to be the parts of the remanng [1] structure that connect to the nterfaces of component. The model classes, [10], [14] and [15] have one nterface, the model classes [2], [5] to [8], [11] 9

10 [12] [3] [9] [13] and have two nterfaces, whle the model classes, and have three nterfaces wth the remanng structure. A smlar dvson nto components s [, j] [10,8] ntroduced for the famly of model classes. For example, model class s dvded nto four components, the frst two components concde wth the physcal substructures 10 and 8, the thrd ncludes the physcal substructures 9, 11 to 15 and [5-par ] the fourth ncludes the substructures 1 to 7. The components n the model class are kept the same as the ones shown n Fgure 3. odel Evdence Dq DOF Class (log) (%) (NFES) [2] ,724 (8,000) [4] (8,000) [5] ,747 (9,000) [8] ,824 (9,000) [10] ,393 (12,000) [10,7] , (14,000) [10,8] , (14,000) [5 -par ] , (19,000) CE (n) Total 2155 Table 1: Damage dentfcaton results, model DOF, number of FE smulatons (NFES) and computatonal effort (CE) n mnutes for each model classes A. The effectveness of the proposed methodology, n terms of computatonal effcency and accuracy, s nvestgated by ntroducng a smulated damage at the hghest per. The nflcted damage corresponds to a stffness reducton of 30% the nomnal stffness value. Smulated, nose contamnated, measured modal frequences and mode shapes are generated for the damaged structure. Among all [10] [10, ] [5-par ] models n Fgure 2 and 3,, and contan the actual damage. The model class selecton and the model updatng s performed usng the TCC algorthm wth 1000 samples per TCC stage. The results for the log evdence for representatve model classes and the correspondng magntude of 10

11 damages D q predcted by each model class are reported n Tables 1 and 2 for the two cases A and B of reduced-order models. Heren, for demonstraton purposes, the percentage change D q between the mean estmates of the model parameters of each model class and the correspondng values of the reference (undamaged) structure measures the severty (magntude) of damage computed by each model class. odel Evdence Dq DOF Class (log) (%) (NFES) [2] (8,000) [4] (8,000) [5] (9,000) [8] (9,000) [10] (12,000) [10,7] (13,000) [10,8] (13,000) [5 -par ] (19,000) CE (n) Total 40.1 Table 2: Damage dentfcaton results, model DOF, number of FE smulatons (NFES) and computatonal effort (CE) n mnutes for model classes B. Comparng the log evdence of each model class and also the correspondng magntude of damages D q predcted by each model class n Table 1 t s evdent that the proposed methodology correctly predcts the locaton and magntude of damage usng the reduced-order model classes. Specfcally, based on the reducedorder models A, the most probable model class s whch predcts a mean [10] 29.2% reducton n stffness whch s very close to the nflcted 30%. Among all [10] [10,7] [10,8] [5-par ] alternatve model classes,, and that contan the actual damage, the proposed methodology favors the model class [10] wth the least [5-par ] number of parameters and t predcts the fve parameter model class as the least probable model. Ths s consstent wth theoretcal results for model class penalzaton for over parameterzaton, avalable for Bayesan model class selecton 11

12 [5]. The model classes that do not contan the damage are not favored by the proposed methodology. Based on the reduced-order models B n Table 2, the predctons of the locaton and severty of damage are very close to the ones obtaned from the reduced-order models A for most model classes ncluded n Table 1. In partcular, the most probable model class for models B s also predcted to be [10], whle the mean damage severty s predcted to correspond to 29.2% reducton n stffness, exactly the same as the one predcted wth the reduced-order models A. In addton the use of krgng wthn TCC (algorthm K-TCC) also provdes accurate estmates of the evdence that lead to damage dentfcaton results that are dentcal to the ones obtaned wthout the krgng estmates. The resultng number of FE model re-analyses and the computatonal demands n mnutes for each model class are also s shown n Tables 1 and 2. The number of FE model runs for each model class depends on the number of TCC stages whch vary for each model class from 8 for the one-parameter model class to 19 for the fve-parameter model class. The resultng varable number of stages per model class was automatcally obtaned from the TCC algorthm by keepng constant the value tolcov of the TCC parameter to tolcov= 1.0. The parallelzaton features of TCC [11] were also exploted, takng advantage of the avalable four-core mult-threaded computer unt to smultaneously run eght TCC samples n parallel. For comparson purposes, the computatonal effort for solvng the egenvalue problem of the orgnal unreduced FE model s approxmately 139 seconds. ultplyng ths by the number of TCC samples shown n Tables 1 and 2 and consderng parallel mplementaton n a four-core mult-threaded computer unt, the total computatonal effort for each model class s expected to be of the order of 3 to 7 days for 8,000 to 19,000 samples, respectvely. For all eght model classes consdered n Tables 1 and 2, the total computatonal effort usng the unreduced models s estmated to be approxmately one month and seven days. In contrast, for the reduced-order models A, the computatonal demands for runnng all model classes are reduced to 30 hours (2155 mnutes as shown n the last row of Table 1), whle for the reduced-order models B these computatonal demands are drastcally reduced to 40 mnutes (see Table 2). The use of surrogate models such as K-TCC [10] reduces the computatonal effort by an addtonal 85% makng the total computatonal effort equal to approxmately 6 mnutes. It s thus evdent that a drastc reducton n computatonal effort for performng the structural dentfcaton based on a set of montorng data s acheved from approxmately 37 days for the unreduced model classes to 40 mnutes for the reduced model classes B, wthout compromsng the predctve capabltes of the proposed damage dentfcaton methodology. Ths results n a drastc reducton n the computatonal effort of more than three orders of magntude. Addtonal substantal reductons n computatonal effort are possble f one has avalable more computer workers to effcently dstrbute the CC samples n each TCC stage, as well as to run the dfferent model classes, correspondng to dfferent possble damage scenaros, n parallel. The avalablty of such computer workers s expected to yeld the damage dentfcaton results n a few seconds, provded that a database of reduced parameterzed fnte element models that cover all damage scenaros have been ntroduced. 12

13 6 Conclusons A structural dentfcaton framework based on vbraton measurements was outlned n ths work. The framework ntegrates Bayesan computng tools wth hgh fdelty fnte element models of the montorng structure. It requres a large number of fnte element model analyses that can result n excessve computatonal effort. HPC technques were proposed to drastcally reduce the computatonal burden by several orders of magntude. The effectveness of the algorthms, n terms of computatonal effcency and accuracy was demonstrated usng smulated modal data from the etsovo Brdge of the Egnata Odos motorway n Greece. The proposed framework can be used by managng authortes as part of an ntellgent structural management system to provde a useful tool for structural montorng, structural ntegrty assessment and desgn cost-effectve mantenance strateges. Acknowledgements Ths research has been mplemented under the ARISTEIA Acton of the Operatonal Programme Educaton and Lfelong Learnng and was co-funded by the European Socal Fund (ESF) and Greek Natonal Resources. References [1] J.L. Beck, L.S. Katafygots, Updatng models and ther uncertantes. I: Bayesan statstcal framework, Journal of Engneerng echancs (ASCE), 124 (4), , [2] C. Papadmtrou, J.L. Beck, L.S. Katafygots, Updatng robust relablty usng structural test data, Probablstc Engneerng echancs, 16(2), , [3] H. Sohn, K.H. Law, Bayesan probablstc approach for structural damage detecton, Earthquake Engneerng and Structural Dynamcs, 26, , [4] C. Papadmtrou, J.L. Beck, L.S. Katafygots, Asymptotc Expansons for Relablty and oments of Uncertan Systems, Journal of Engneerng echancs (ASCE), 123(12), , [5] J.L. Beck, K.V. Yuen, odel selecton usng response measurements: Bayesan probablstc approach, Journal of Engneerng echancs (ASCE), 130(2), , [6] J.L. Beck, S.K. Au, Bayesan Updatng of Structural odels and Relablty usng arkov Chan onte Carlo Smulaton, Journal of Engneerng echancs (ASCE), 128 (4), , [7] E. Ntotsos, Ch. Karakostas, V. Lekds, P. Panetsos, G. Nkolaou, C. Papadmtrou, T. Salonkos, "Structural Identfcaton of Egnata Odos Brdges based on Ambent and Earthquake Induced Vbratons", Bulletn of Earthquake Engneerng, 7(2), ,

14 [8].W. Vank, J.L. Beck, S.K. Au, Bayesan probablstc approach to structural health montorng, Journal of Engneerng echancs (ASCE), 126 (7), , [9] C. Papadmtrou, D.C. Papadot, "Component ode Synthess Technques for Fnte Element odel Updatng", Computers and Structures, 126, 15-28, [10] P. Angelkopoulos, C. Papadmtrou, P. Koumoutsakos, "X-TCC: Adaptve krgng for Bayesan Inverse odelng", Computer ethods n Appled echancs and Engneerng, 289, , [11] P.E. Hadjdoukas, P. Angelkopoulos, C. Papadmtrou, P. Koumoutsakos, "Π4U: A Hgh Performance Computng Framework for Bayesan Uncertanty Quantfcaton of Complex odels", Journal of Computatonal Physcs, 284(1), 1 21, [12] L.S. Katafygots, C. Papadmtrou, H.F. Lam, A probablstc approach to structural model updatng, Internatonal Journal of Sol Dynamcs and Earthquake Engneerng, 17 (7-8), , [13] C. Papadmtrou, L.S. Katafygots, Bayesan modelng and updatng, In Engneerng Desgn Relablty Handbook, N. Nkolads, D.. Ghocel, S. Snghal (Eds), CRC Press, [14] J.Y. Chng, Y.C. Chen, Transtonal markov chan monte carlo method for Bayesan model updatng, model class selecton, and model averagng, J. Eng. ech.-asce, 133, , [15] P. Angelkopoulos, C. Papadmtrou, P. Koumoutsakos, "Bayesan Uncertanty Quantfcaton and Propagaton n olecular Dynamcs Smulatons: A Hgh Performance Computng Framework", The Journal of Chemcal Physcs, 137(14), ,

Fusion Performance Model for Distributed Tracking and Classification

Fusion Performance Model for Distributed Tracking and Classification Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.

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

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

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

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

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

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

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

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

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

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

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

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

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

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

Methodology of optimal sampling planning based on VoI for soil contamination investigation

Methodology of optimal sampling planning based on VoI for soil contamination investigation Japanese Geotechncal Socety Specal Publcaton The 5th Asan Regonal Conference on Sol echancs and Geotechncal Engneerng ethodology of optmal samplng plannng based on VoI for sol contamnaton nvestgaton Iumasa

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

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

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

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

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

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

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

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More 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

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

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

A Performance Measure Approach to composites reliability: a transmission loss application

A Performance Measure Approach to composites reliability: a transmission loss application 10 th World Congress on Structural and Multdscplnary Optmzaton May 19-24, 2013, Orlando, Florda, USA A Performance Measure Approach to compostes relablty: a transmsson loss applcaton Roberto d Ippolto

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More 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

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

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

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

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

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

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

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

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

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More 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

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

Study on Fuzzy Models of Wind Turbine Power Curve

Study on Fuzzy Models of Wind Turbine Power Curve Proceedngs of the 006 IASME/WSEAS Internatonal Conference on Energy & Envronmental Systems, Chalkda, Greece, May 8-0, 006 (pp-7) Study on Fuzzy Models of Wnd Turbne Power Curve SHU-CHEN WANG PEI-HWA HUANG

More information

Bayesian evidence for Finite element model updating

Bayesian evidence for Finite element model updating 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

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More 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

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

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

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

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

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

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

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

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

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

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

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

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More 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

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

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

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

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

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

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087

More 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

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research

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

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

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

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

Anytime Predictive Navigation of an Autonomous Robot

Anytime Predictive Navigation of an Autonomous Robot Anytme Predctve Navgaton of an Autonomous Robot Shu Yun Chung Department of Mechancal Engneerng Natonal Tawan Unversty Tape, Tawan Emal shuyun@robot0.me.ntu.edu.tw Abstract To acheve fully autonomous moble

More information

A Post Randomization Framework for Privacy-Preserving Bayesian. Network Parameter Learning

A Post Randomization Framework for Privacy-Preserving Bayesian. Network Parameter Learning A Post Randomzaton Framework for Prvacy-Preservng Bayesan Network Parameter Learnng JIANJIE MA K.SIVAKUMAR School Electrcal Engneerng and Computer Scence, Washngton State Unversty Pullman, WA. 9964-75

More information

A Workflow for Spatial Uncertainty Quantification using Distances and Kernels

A Workflow for Spatial Uncertainty Quantification using Distances and Kernels A Workflow for Spatal Uncertanty Quantfcaton usng Dstances and Kernels Célne Schedt and Jef Caers Stanford Center for Reservor Forecastng Stanford Unversty Abstract Assessng uncertanty n reservor performance

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

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

Preconditioning Parallel Sparse Iterative Solvers for Circuit Simulation

Preconditioning Parallel Sparse Iterative Solvers for Circuit Simulation Precondtonng Parallel Sparse Iteratve Solvers for Crcut Smulaton A. Basermann, U. Jaekel, and K. Hachya 1 Introducton One mportant mathematcal problem n smulaton of large electrcal crcuts s the soluton

More information

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Computational layout design optimization of frame structures

Computational layout design optimization of frame structures Interfaces: archtecture.engneerng.scence 5-8th September, 017, Hamburg, Germany Annette Bögle, Manfred Grohmann (eds.) Computatonal layout desgn optmzaton of frame structures Jun Ye*, Paul Shepherd a,

More information

Kinematics of pantograph masts

Kinematics of pantograph masts Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n

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

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

Parallel Implementation of Classification Algorithms Based on Cloud Computing Environment

Parallel Implementation of Classification Algorithms Based on Cloud Computing Environment TELKOMNIKA, Vol.10, No.5, September 2012, pp. 1087~1092 e-issn: 2087-278X accredted by DGHE (DIKTI), Decree No: 51/Dkt/Kep/2010 1087 Parallel Implementaton of Classfcaton Algorthms Based on Cloud Computng

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

Monte Carlo Rendering

Monte Carlo Rendering Monte Carlo Renderng Last Tme? Modern Graphcs Hardware Cg Programmng Language Gouraud Shadng vs. Phong Normal Interpolaton Bump, Dsplacement, & Envronment Mappng Cg Examples G P R T F P D Today Does Ray

More information

Multilevel Analysis with Informative Weights

Multilevel Analysis with Informative Weights Secton on Survey Research Methods JSM 2008 Multlevel Analyss wth Informatve Weghts Frank Jenkns Westat, 650 Research Blvd., Rockvlle, MD 20850 Abstract Multlevel modelng has become common n large scale

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

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan

More information

Classification Based Mode Decisions for Video over Networks

Classification Based Mode Decisions for Video over Networks Classfcaton Based Mode Decsons for Vdeo over Networks Deepak S. Turaga and Tsuhan Chen Advanced Multmeda Processng Lab Tranng data for Inter-Intra Decson Inter-Intra Decson Regons pdf 6 5 6 5 Energy 4

More information