A Trust Model Based on Cloud Model and Bayesian Networks
|
|
- Bertram Flynn
- 6 years ago
- Views:
Transcription
1 Avalable onlne at roceda Envronmental Scences (20) A Trust Model Based on Cloud Model and Bayesan Networs Bo Jn a,yong Wang b, Zhenyan Lu b, Jngfeng Xue b a Key Lab of Informaton Networ Securty of Mnstry of ublc Securty(The Thrd Research Insttute of Mnstry of ublc Securty),Shangha, Chna,jnbo@stars.org.cn b School of Software,Bejng Insttute of Technology Bejng, Chna,wangyong@bt.edu.cn Abstract the Internet has been becomng the most mportant nfrastructure for dstrbuted applcatons whch are composed of onlne servces. In such open and dynamc envronment, servce selecton becomes a challenge. The approaches based on subjectve trust models are more adaptve and effcent than tradtonal bnary logc based approaches. Most well nown trust models use probablty or fuzzy set theory to hold randomness or fuzzness respectvely. Only cloud model based models consder both aspects of uncertanty. Although cloud model s deal for representng trust degrees, t s not effcent for context aware trust evaluaton and dynamc updates. By contrast, Bayesan networ as an uncertan reasonng tool s more effcent for dynamc trust evaluaton. An uncertan trust model that combnes cloud model and Bayesan networ s proposed n ths paper. 20 ublshed by Elsever Ltd. Open access under CC BY-NC-ND lcense. Selecton and/or peer-revew under responsblty of the Intellgent Informaton Technology Applcaton Research Assocaton. Keywords:trust model; cloud model;bayesan networ; context aware; unceratnty.introducton In recent years, the popularty of the Internet boosts many new concepts such as cloud computng, The Internet of Thngs, and Internetware. The common dea of these concepts s servce-orented, whch means that the dstrbuted applcatons are constructed based on ndependent component servces wth standard nterfaces []. How to select trustworthy servces automatcally becomes the ey part of software development. Tradtonal securty approaches such as authentcaton s bnary logc, whch cannot present multple trust degrees or the human s servce selecton prncple of good enough. The subjectve trust models can mae up for the defcences by reasonng about a servce s trustworthness n future nteractons accordng to one entty s drect nteractons wth that entty and recommendatons (ratngs) from other enttes. Trust s a concept wth many uncertantes, among whch, randomness and fuzzness are the two most mportant uncertantes. To grasp the uncertanty of trust accurately, most well nown trust models use ublshed by Elsever Ltd. Open access under CC BY-NC-ND lcense. Selecton and/or peer-revew under responsblty of the Intellgent Informaton Technology Applcaton Research Assocaton. do:0.06/j.proenv
2 Bo Jn et al. / roceda Envronmental Scences (20) probablty or fuzzy set theory to hold randomness or fuzzness respectvely. Although the randomness and fuzzness are qute dfferent n nature, many lngustc concepts contan smultaneous randomness and fuzzness. Keepng ths n mnd, L et al. proposed a new cogntve model- Cloud model [2], whch can synthetcally descrbe the randomness and fuzzness of concepts and mplement the uncertan transformaton between a qualtatve concept and ts quanttatve nstantatons. Durng recent years, several researchers proposed cloud model based trust models n order to consder both randomness and fuzzness n trust evaluaton. Although cloud model s deal for representng uncertan trust value, ts logcal operatons and algebra operatons lac sound theoretcal bass. As the result, all exstng trust models [3], [4], [5] based on cloud model have two common shortcomngs n the aspect of trust aggregaton (.e. an agent usually estmates an unnown servce entty s trust value by aggregatng recommendatons from other relable agents.). Frst, the trust aggregaton reles on cloud algebra operatons, whch s n fact the weghted average of cloud numercal parameters, and all weghts are preset accordng to the trustor s experence, whch cannot reflect the dfference between recommendatons and the ratngs gven by the source trustor, and causes to reduce the aggregaton accuracy. Second, they cannot resst malcous recommendaton attacs, because the relablty of recommendatons s not evaluated and all recommendatons are treated equally. In addton, these models don t consder context nformaton, whch maes t mpossble to evaluate trust values and mae decsons accordng to context nformaton. Our prevous research wor shows that Bayesan networs can help mae context aware trust evaluaton and aggregaton n a ratonal (sound theoretcal bass), ntutve (graphcal representaton) and robust (malcous recommendaton attacs resstant) way [6]. So, we propose a trust model to combne cloud model and Bayesan networs, whch can represent and evaluate the uncertanty of trust more accurately and effcently. 2.Trust representaton usng cloud model 2..Cloud Model Gven a qualtatve concept T de ned over a unverse of dscourse U, let x U s a random nstantaton of the concept T and μt(x) [0,] s the certanty degree of x belongng to T,whch corresponds to a random number wth a steady tendency. Then, the dstrbuton of x n the unverse U can be de ned as a cloud and x can be called as a cloud drop. A cloud descrbes the overall quanttatve property of a concept by the three numercal characterstcs as follows: Expectaton Ex s the mathematcal expectaton of the cloud drops belongng to a concept n the unversal. Entropy En represents the uncertanty measurement of a qualtatve concept. It s determned by both the randomness and the fuzzness of the concept. In one aspect, as the measurement of randomness, En re ects the dspersng extent of the cloud drops and n the other aspect, t s also the measurement of fuzzness, representng the scope of the unverse that can be accepted by the concept. Hyperentropy He s the uncertan degree of entropy En. 2.2.Trust Cloud We use cloud to represent subjectve trust, called trust cloud. The unverse of dscourse U= [0, n], n s any postve nteger. Trust T s a qualtatve concept defned over U. Because trust for a servce entty s
3 454 Bo Jn et al. / roceda Envronmental Scences (20) evaluated from ratngs from raters or recommenders, any ratng r U can be regarded as a random nstantaton of T. Every r s a cloud drop of trust cloud, whch means a quanttatve nstantaton of the qualtatve concept T. The certanty degree of r belongng to T s denoted byμt(r) [0, ]. Besdes of cloud drops, we can also descrbe the overall quanttatve property of T by Ex, En, and He. That s to say, the overall trust for a servce entty can be represented usng a tuple T (Ex, En, He). Next, we wll descrbe brefly how to compute Ex, En, He, and μt(r) from all r. In real ratng systems, t s common to rate servce qualty usng dscrete satsfactory levels (level,,leveln). Each level represents the extent to whch an agent s satsfed wth the nteracton, n whch level means extremely unsatsfed and leveln means extremely satsfed. A ratng r can be any nteger n set I= {, 2,, n}, obvously, I U. We use a Bayesan networ to calculate Ex, whch taes all cloud drops r together wth the context nformaton as evdence, and the expectaton of the cloud drops s Ex. Ex changes when new ratng r s taen, and the newer the ratng, the closer t s to the real value of Ex. So we adopt a tme decay mechansm to mae newer ratngs effect on Ex stronger. lease refer to art III for the detals of Ex calculaton. As to entropy En calculaton, L et.al use the standard devaton or the frst-order absolute central moment of all cloud drops [7], we mprove the algorthm by consderng tme decay n Ex calculaton, as n En = r j= j Ex, 2. () Hyperentropy He s calculated as the frst-order absolute central moment of all En, as n He = En j j= = En, 3. (2) The certanty degree of r belongng to concept T s calculated usng (3), n whch Ex and En s the current value of expectaton and entropy respectvely. T ( r ) ( r Ex) 2 2En 2 μ = e. (3) 3.Trust evaluaton usng bayesan networs Subject trust s a context-specfc concept, but nether exstng trust models based on cloud model consder context nformaton explctly. The man reason s that t s not easy to ntegrate context nformaton nto cloud algebra and logc operatons, whch all tae the overall three numercal characterstcs as operands. If consderng complex compound context nformaton, the case would be even worse. Our prevous wor [6] shows that Bayesan networs can be used to ntegrate context nformaton nto trust evaluaton to mprove accuracy. In ths secton, we wll descrbe how to combne the trust cloud descrbed n prevous secton wth Bayesan networs to form a context-aware uncertan trust model.
4 Bo Jn et al. / roceda Envronmental Scences (20) Basc Context-aware Trust Evaluaton The ratng about an nteracton between agents can be one of n dscrete levels (level,,leveln). Each level represents the extent to whch an agent s satsfed wth the nteracton, n whch level means extremely unsatsfed and leveln means extremely satsfed. Context nformaton of nteractons should also be consdered to mprove trust evaluaton accuracy. We consder m types of context nformaton, and Cj ( {, 2,, }) use m to represent the jth value of context type, then the context nformaton of an ( C, C,, C ) j nteracton can be represented as a tuple C 2 j 2 mj m. It s reasonable to assume that states of dfferent context types are ndependent. To sum up, a ratng conssts of a servce level nteger and a context tuple. We use a naïve-bayesan networ for trust evaluaton, where trust value s the root node and context nformaton corresponds to leaves. Thus structure s hghly extensble, when addng a new context type, the only thng to do s nsertng a leaf node and exstng condtonal probablty tables (CTs) are stll vald. Smlarly, removng a context type doesn t have any effect to left nodes ether. An example s shown n Fg., where trust s related to two types of contexts (Context_ and Context_2). Node Trust has fve states, from level to level5, correspondng to fve possble ratngs. Node Context_ has two states: context and context2, and node Context_2 s two states are context2 and context22 respectvely. The CTs (.e. ( Trust = level ), {,2,3,4,5} ( Context _ = context j Trust = level ), j {,2}, {,2,3,4,5 } ( Context _ 2 = context2 Trust = level ), j {,2}, {,2,3,4,5 }, j can be learned from the ratngs (cases). The tme decay process can be done after a perod of tme or after learnng some number of cases by fadng old probabltes before tang new ratngs nto consderaton. Equaton (4) shows the CT updatng process of node Trust, n whch, (m) (m 0) s the probablty after m fadng rounds; λ [0,] s the fadng factor. (0) ( Trust = level ) ( m+ ) ( Trust = level ) = n ( = m) ( Trust = level )( λ ) m + ( 2 m) λ + λ En λ = e [ 0,] We beleve that the fadng factor should reflect the stablty of servce enttes behavor, rather than tang fxed value as n most exstng trust models. In fact, the certanty degree of ratngs can represent the change of trust value, because the more the entty changes ts behavor, the more the dfference between the current ratng and the expectaton of trust value s,.e., the smaller the certanty degree s. So we set the fadng factor be the certanty degree of the last (newest) ratng that has been taen by the Bayesan networ as evdence. Gven the ratngs, the trust evaluaton process, that s the calculaton of numercal characterstcs (.e., Ex, En, He) and each ratng s certanty degree (.e., μt(r)), can be descrbed as Algorthm. Algorthm Basc context-aware trust evaluaton Input: The set of ratngs (cloud drops) R whch ncludes context nformaton Output: Trust cloud s three parameters Ex, En, He and each ratng s certanty degreeμ T (r) Step: Intalze all the CTs to be unform dstrbuton Step2: = repeat Read n a ratng r and related context nformaton tuple C from R If needed, do tme decay process as n (4) Use the ratng as a new case to update the CTs = + untl read n all ratngs ) (4)
5 456 Bo Jn et al. / roceda Envronmental Scences (20) Step3: Infer the probablty that an agent s servce qualty s on level n each dfferent context C (.e., ( Trust = level C), {, 2,, n}) Step4: Calculate Ex n each dfferent context C as the expectaton of node Trust n context C usng n Ex = ( Trust = level C) = Step5: Calculate En n each dfferent context C as n () Step6: Calculate He n each dfferent context C as n (2) Step7: for j = to - do Calculate μ T (r j ) n the related context C as n (3) end for Fgure. Bayesan networ for context dependent trust estmaton. 3.2.Unfar Ratng Flterng In order to avod unfar ratngs affectng the accuracy of trust evaluaton, trustors should frst evaluate raters relablty and then select the most relable ones. For each rater, ts relablty can be estmated by the average certanty degree (μt(r)) of all ratngs from t. The larger the average certanty degree, the more relable s the rater. For sae of computaton, we select at most two relable raters whose relablty s larger than some specfc value, say 0.6, and flter out all other ones. 3.3.Servce rovder Selecton Based on Trust Cloud We argue that uncertanty of trust should be taen nto consderaton for servce provder selecton. So, we use trust cloud as the decson crtera, that s to say, not only the trust value (whch s represented by Ex) but also ts uncertanty (whch can be represented by En+He accordng to () and (2)) s compared. Obvously, enttes wth hgher trust value and lower uncertanty are more trustworthy, whle those wth lower trust value and hgher uncertanty are not trustworthy. Varous servce entty selecton approaches can be desgned for specfc applcatons. In ths paper, we select the entty wth smaller En+He from the two enttes wth the most largest Ex.
6 Bo Jn et al. / roceda Envronmental Scences (20) Expermental analyss 4..Experment Settng There are 00 enttes, 60 of whch belong to group A and 40 belong to group B. Each entty s behavor s determned by a behavoral probablty tuple (p, p2, p3), whch s correspondng to servce level (level, level2, level3). We consder two context attrbutes and both have two states as descrbed n prevous secton, so there are four dfferent context stuatons. The orgnal (change later) probablty tuples for the two groups are shown n Table I. The smulaton s dvded nto 00 rounds and around 25 rounds for each stuaton. In each round, each entty selects a servce provder entty accordng to some crtera (see Secton B). In order to smulate the dynamc nature of entty behavor, the probablty tuples are changed randomly after every 0 rounds as n (6). p = p Δ, p2 = p2 +Δ, p3 = p3 Δ (wth probablty 0.33) 2 2 (6) p = p + Δ, p2 = p2 Δ, p3 = p3 + Δ (wth probablty 0.33) 2 2 p = p, p2 = p2, p3 = p3 (wth probablty 0.34) Δ= 0.0 So the enttes fade all the CTs each tme after learnng every 0 cases, and then ncorporate the latest cases. The fadng factor λ equals 0.0. The proporton of unfar raters s 40%. Table. Enttes orgnal behavor patterns Behavoral Group robablty Tuple A B Context, Context 2 (0.05,0.05,0.9) (0.9,0.05,0.05) Context, Context 22 (0.,0.,0.8) (0.8,0.,0.) Context 2, Context 2 (0.,0.2,0.7) (0.7,0.2,0.) Context 2, Context 22 (0.2,0.2,0.6) (0.6,0.2,0.2) 4.2.Experment Results We use successful servce rato to evaluate the accuracy of our trust model. If a selected servce provder behave good, that s ts servce level s level3, then the servce s successful, otherwse, t s fal. We compare the ratos n the followng three dfferent scenaros. Enttes don t use trust evaluaton, that s, they select servce provders randomly. Enttes use the trust evaluaton but don t consder context nformaton. Enttes use the trust evaluaton and consder context nformaton. Table II shows the results n four possble context stuatons. Table II Successful servce rato n dfferent scenaros Successful Trust Evaluaton Scenaros Servce Rato (%) Random Trust wthout context Trust wth context Context, Context
7 458 Bo Jn et al. / roceda Envronmental Scences (20) Successful Trust Evaluaton Scenaros Servce Rato (%) Random Trust wthout context Trust wth context Context, Context Context 2, Context 2 Context 2, Context We can see from Table II that our trust model wth can help mprove the successful servce ratos largely, from around 60% (Random) to hgher than 77% (Trust wthout context). In addton, context nformaton has good effect on estmaton accuracy, the ratos n the rght most column (Trust wthout context) are around 5% hgher than those n the mddle column (Trust wth context). The only excepton s n the last context stuaton (Context2, Context22), because entty behavor s more uncertan than n other stuatons, the rato wth context (79.%) s a lttle bt lower than that wthout context (80.8%). As enttes only select relable recommenders, t would be expected that the proporton of unfar recommenders has lttle effect on the accuracy of estmaton. The proporton of unfar recommenders n the experments shown by Table II s 40%. When the proporton of unfar recommenders s 70%, the smallest successful servce rato s as hgh as 75% (Trust wthout context). 5.Conclusons A trust evaluaton model whch combnes the cloud model and Bayesan networs s proposed n ths paper. The model has the followng features. The uncertanty of trust s explctly represented and evaluated usng sound theores for uncertan reasonng, whch mae the evaluaton more accurate even when enttes behavors change dynamcally. Context nformaton s explctly ntegrated nto trust evaluaton to mae the servce provder selecton be context-ware. Our future wors wll focus on unfar ratng flterng and trust aggregaton. Acnowledgment Ths paper s supported by the Openng roject of Key Lab of Informaton Networ Securty of Mnstry of ublc Securty (The Thrd Research Insttute of Mnstry of ublc Securty), Chna (Grant No. C0604); and by the Key rogram of Shangha Commttee of Scence and Technology, Chna (Grant No ); and by the Soft Scence Research rogram of Shangha Commttee of Scence and Technology, Chna (Grant No ).
8 Bo Jn et al. / roceda Envronmental Scences (20) References [] W.T. Tsa, Y.N. Chen, X. Sun, C. Cheng, G. Btter, and M. Whte, Servce-Orented Computng, Learnng & Leadng wth Technology, vol. 35, May 2008, pp [2] D.Y. L, C.Y. Lu, and W.Y. Gan, A new cogntve model: Cloud model, Internatonal Journal of Intellgent Systems, vol. 24, March 2009, pp [3] X.Y. Meng, G.W. Zhang, J.C. Kang, H.S. L, and D.Y. L, A New Subjectve Trust Model Based on Cloud Model, roc. IEEE Internatonal Conference on Networng, Sensng and Control (ICNSC 2008), IEEE ress, Apr. 2008, pp [4] S.X. Wang, L. Zhang, S. Wang, and N. Ma, An evaluaton approach of subjectve trust based on cloud model, roc Internatonal Conference on Computer Scence and Software Engneerng (CSSE 2008), IEEE ress, Dec. 2008, vol.3, pp [5] F. Lu, H.Z. Wu, Research of Trust Valuaton and Decson-mang Based on Cloud Model n Grd Envronment, Journal of System Smulaton, vol. 2, Jan. 2009, pp [6] Y. Wang, M. L, J.F. Xue, J.J. Hu, L.F. Zhang, and L.J. Lao, A Context-aware Trust Establshment and Mappng Framewor for Web Applcatons, roc Internatonal Conference on Computatonal Intellgence and Securty (CIS 07), IEEE ress, Dec. 2007, pp do:0.09/cis [7] D. Y. L, and Y. Du, Artfcal Intellgence wth Uncertanty. Natonal Defense Industry ress, 2005.
A New Evolutionary Computation Based Approach for Learning Bayesian Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationDETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH
Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata TC XVII IMEKO World Congress Metrology n the 3rd Mllennum June 7, 3,
More informationAn Improved multiple fractal algorithm
Advanced Scence and Technology Letters Vol.31 (MulGraB 213), pp.184-188 http://dx.do.org/1.1427/astl.213.31.41 An Improved multple fractal algorthm Yun Ln, Xaochu Xu, Jnfeng Pang College of Informaton
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationA New Scrambling Evaluation Scheme based on Spatial Distribution Entropy and Centroid Difference of Bit-plane
A New Scramblng Evaluaton Scheme based on Spatal Dstrbuton Entropy and Centrod Dfference of Bt-plane Lang Zhao *, Avshek Adhkar Kouch Sakura * * Graduate School of Informaton Scence and Electrcal Engneerng,
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationOrientation Model of Elite Education and Mass Education
Proceedngs of the 8th Internatonal Conference on Innovaton & Management 723 Orentaton Model of Elte Educaton and Mass Educaton Ye Peng Huanggang Normal Unversty, Huanggang, P.R.Chna, 438 (E-mal: yepeng@hgnc.edu.cn)
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationAverage Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1
Average Decson hreshold of CA CFAR and excson CFAR Detectors n the Presence of Strong Pulse Jammng Ivan G. Garvanov and Chrsto A. Kabachev Insttute of Informaton echnologes Bulgaran Academy of Scences
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationRecover plaintext attack to block ciphers
Recover plantext attac to bloc cphers L An-Png Bejng 100085, P.R.Chna apl0001@sna.com Abstract In ths paper, we wll present an estmaton for the upper-bound of the amount of 16-bytes plantexts for Englsh
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationAdaptive Consensus Control of Multi-Agent Systems with Large Uncertainty and Time Delays *
Journal of Robotcs, etworkng and Artfcal Lfe, Vol., o. (September 04), 5-9 Adaptve Consensus Control of Mult-Agent Systems wth Large Uncertanty and me Delays * L Lu School of Mechancal Engneerng Unversty
More informationOperating conditions of a mine fan under conditions of variable resistance
Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationrisk and uncertainty assessment
Optmal forecastng of atmospherc qualty n ndustral regons: rsk and uncertanty assessment Vladmr Penenko Insttute of Computatonal Mathematcs and Mathematcal Geophyscs SD RAS Goal Development of theoretcal
More informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
More informationA Network Intrusion Detection Method Based on Improved K-means Algorithm
Advanced Scence and Technology Letters, pp.429-433 http://dx.do.org/10.14257/astl.2014.53.89 A Network Intruson Detecton Method Based on Improved K-means Algorthm Meng Gao 1,1, Nhong Wang 1, 1 Informaton
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationExperience with Automatic Generation Control (AGC) Dynamic Simulation in PSS E
Semens Industry, Inc. Power Technology Issue 113 Experence wth Automatc Generaton Control (AGC) Dynamc Smulaton n PSS E Lu Wang, Ph.D. Staff Software Engneer lu_wang@semens.com Dngguo Chen, Ph.D. Staff
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationUncertainty and auto-correlation in. Measurement
Uncertanty and auto-correlaton n arxv:1707.03276v2 [physcs.data-an] 30 Dec 2017 Measurement Markus Schebl Federal Offce of Metrology and Surveyng (BEV), 1160 Venna, Austra E-mal: markus.schebl@bev.gv.at
More informationA Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function
Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,
More informationTurbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH
Turbulence classfcaton of load data by the frequency and severty of wnd gusts Introducton Oscar Moñux, DEWI GmbH Kevn Blebler, DEWI GmbH Durng the wnd turbne developng process, one of the most mportant
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationInternational Journal of Mathematical Archive-3(3), 2012, Page: Available online through ISSN
Internatonal Journal of Mathematcal Archve-3(3), 2012, Page: 1136-1140 Avalable onlne through www.ma.nfo ISSN 2229 5046 ARITHMETIC OPERATIONS OF FOCAL ELEMENTS AND THEIR CORRESPONDING BASIC PROBABILITY
More informationMAXIMUM A POSTERIORI TRANSDUCTION
MAXIMUM A POSTERIORI TRANSDUCTION LI-WEI WANG, JU-FU FENG School of Mathematcal Scences, Peng Unversty, Bejng, 0087, Chna Center for Informaton Scences, Peng Unversty, Bejng, 0087, Chna E-MIAL: {wanglw,
More informationCryptanalysis of pairing-free certificateless authenticated key agreement protocol
Cryptanalyss of parng-free certfcateless authentcated key agreement protocol Zhan Zhu Chna Shp Development Desgn Center CSDDC Wuhan Chna Emal: zhuzhan0@gmal.com bstract: Recently He et al. [D. He J. Chen
More informationChapter 8 Indicator Variables
Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n
More informationModeling of Risk Treatment Measurement Model under Four Clusters Standards (ISO 9001, 14001, 27001, OHSAS 18001)
Avalable onlne at www.scencedrect.com Proceda Engneerng 37 (202 ) 354 358 The Second SREE Conference on Engneerng Modelng and Smulaton Modelng of Rsk Treatment Measurement Model under Four Clusters Standards
More informationCS47300: Web Information Search and Management
CS47300: Web Informaton Search and Management Probablstc Retreval Models Prof. Chrs Clfton 7 September 2018 Materal adapted from course created by Dr. Luo S, now leadng Albaba research group 14 Why probabltes
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationProbability Theory (revisited)
Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationDepartment of Computer Science Artificial Intelligence Research Laboratory. Iowa State University MACHINE LEARNING
MACHINE LEANING Vasant Honavar Bonformatcs and Computatonal Bology rogram Center for Computatonal Intellgence, Learnng, & Dscovery Iowa State Unversty honavar@cs.astate.edu www.cs.astate.edu/~honavar/
More informationBayesian Networks. Course: CS40022 Instructor: Dr. Pallab Dasgupta
Bayesan Networks Course: CS40022 Instructor: Dr. Pallab Dasgupta Department of Computer Scence & Engneerng Indan Insttute of Technology Kharagpur Example Burglar alarm at home Farly relable at detectng
More informationA New Grey Relational Fusion Algorithm Based on Approximate Antropy
Journal of Computatonal Informaton Systems 9: 20 (2013) 8045 8052 Avalable at http://www.jofcs.com A New Grey Relatonal Fuson Algorthm Based on Approxmate Antropy Yun LIN, Jnfeng PANG, Ybng LI College
More informationREAL-TIME DETERMINATION OF INDOOR CONTAMINANT SOURCE LOCATION AND STRENGTH, PART II: WITH TWO SENSORS. Beijing , China,
REAL-TIME DETERMIATIO OF IDOOR COTAMIAT SOURCE LOCATIO AD STREGTH, PART II: WITH TWO SESORS Hao Ca,, Xantng L, Wedng Long 3 Department of Buldng Scence, School of Archtecture, Tsnghua Unversty Bejng 84,
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationA Method for Filling up the Missed Data in Information Table
A Method for Fllng up the Mssed Data Gao Xuedong, E Xu, L Teke & Zhang Qun A Method for Fllng up the Mssed Data n Informaton Table Gao Xuedong School of Management, nversty of Scence and Technology Beng,
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationStatistical Foundations of Pattern Recognition
Statstcal Foundatons of Pattern Recognton Learnng Objectves Bayes Theorem Decson-mang Confdence factors Dscrmnants The connecton to neural nets Statstcal Foundatons of Pattern Recognton NDE measurement
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationInvestigation of a New Monte Carlo Method for the Transitional Gas Flow
Investgaton of a New Monte Carlo Method for the Transtonal Gas Flow X. Luo and Chr. Day Karlsruhe Insttute of Technology(KIT) Insttute for Techncal Physcs 7602 Karlsruhe Germany Abstract. The Drect Smulaton
More informationInternational Journal of Pure and Applied Sciences and Technology
Int. J. Pure Appl. Sc. Technol., 4() (03), pp. 5-30 Internatonal Journal of Pure and Appled Scences and Technology ISSN 9-607 Avalable onlne at www.jopaasat.n Research Paper Schrödnger State Space Matrx
More informationGaussian Mixture Models
Lab Gaussan Mxture Models Lab Objectve: Understand the formulaton of Gaussan Mxture Models (GMMs) and how to estmate GMM parameters. You ve already seen GMMs as the observaton dstrbuton n certan contnuous
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationExponential Type Product Estimator for Finite Population Mean with Information on Auxiliary Attribute
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 10, Issue 1 (June 015), pp. 106-113 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) Exponental Tpe Product Estmator
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationA Hybrid Evaluation model for Distribution Network Reliability Based on Matter-element Extension Method
Advanced Scence and Technology Letters Vol.74 (ASEA 204), pp.87-95 http://dx.do.org/0.4257/astl.204.74.7 A Hybrd Evaluaton model for Dstrbuton Network Relablty Based on Matter-element Extenson Method Huru
More information829. An adaptive method for inertia force identification in cantilever under moving mass
89. An adaptve method for nerta force dentfcaton n cantlever under movng mass Qang Chen 1, Mnzhuo Wang, Hao Yan 3, Haonan Ye 4, Guola Yang 5 1,, 3, 4 Department of Control and System Engneerng, Nanng Unversty,
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationSystem identifications by SIRMs models with linear transformation of input variables
ORIGINAL RESEARCH System dentfcatons by SIRMs models wth lnear transformaton of nput varables Hrofum Myama, Nortaka Shge, Hrom Myama Graduate School of Scence and Engneerng, Kagoshma Unversty, Japan Receved:
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationComputers and Mathematics with Applications. State fusion of fuzzy automata with application on target tracking
Computers and Mathematcs wth Applcatons 57 2009) 949 960 Contents lsts avalable at ScenceDrect Computers and Mathematcs wth Applcatons ournal homepage: www.elsever.com/locate/camwa State fuson of fuzzy
More informationCorrelation and Regression. Correlation 9.1. Correlation. Chapter 9
Chapter 9 Correlaton and Regresson 9. Correlaton Correlaton A correlaton s a relatonshp between two varables. The data can be represented b the ordered pars (, ) where s the ndependent (or eplanator) varable,
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationMODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS
The 3 rd Internatonal Conference on Mathematcs and Statstcs (ICoMS-3) Insttut Pertanan Bogor, Indonesa, 5-6 August 28 MODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS 1 Deky Adzkya and 2 Subono
More informationSemi-supervised Classification with Active Query Selection
Sem-supervsed Classfcaton wth Actve Query Selecton Jao Wang and Swe Luo School of Computer and Informaton Technology, Beng Jaotong Unversty, Beng 00044, Chna Wangjao088@63.com Abstract. Labeled samples
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationPARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY
POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 86 Electrcal Engneerng 6 Volodymyr KONOVAL* Roman PRYTULA** PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY Ths paper provdes a
More informationModify Bayesian Network Structure with Inconsistent Constraints
Modfy Bayesan Network Structure wth Inconsstent Constrants Y Sun and Yun Peng Department of Computer Scence and Electrcal Engneerng Unversty of Maryland Baltmore County Baltmore, MD, 21250 Abstract Ths
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationCredit Card Pricing and Impact of Adverse Selection
Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n
More informationStudy on Active Micro-vibration Isolation System with Linear Motor Actuator. Gong-yu PAN, Wen-yan GU and Dong LI
2017 2nd Internatonal Conference on Electrcal and Electroncs: echnques and Applcatons (EEA 2017) ISBN: 978-1-60595-416-5 Study on Actve Mcro-vbraton Isolaton System wth Lnear Motor Actuator Gong-yu PAN,
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationA New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic
Internatonal Journal of Computer Applcatons Technology and Research A New Desgn of Multpler usng Modfed Booth Algorthm and Reversble Gate Logc K.Nagarjun Department of ECE Vardhaman College of Engneerng,
More information} Often, when learning, we deal with uncertainty:
Uncertanty and Learnng } Often, when learnng, we deal wth uncertanty: } Incomplete data sets, wth mssng nformaton } Nosy data sets, wth unrelable nformaton } Stochastcty: causes and effects related non-determnstcally
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationDiscretization of Continuous Attributes in Rough Set Theory and Its Application*
Dscretzaton of Contnuous Attrbutes n Rough Set Theory and Its Applcaton* Gexang Zhang 1,2, Lazhao Hu 1, and Wedong Jn 2 1 Natonal EW Laboratory, Chengdu 610036 Schuan, Chna dylan7237@sna.com 2 School of
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More informationAGGREGATION OF FUZZY OPINIONS UNDER GROUP DECISION-MAKING BASED ON SIMILARITY AND DISTANCE
Jrl Syst Sc & Complexty (2006) 19: 63 71 AGGREGATION OF FUZZY OPINIONS UNDER GROUP DECISION-MAKING BASED ON SIMILARITY AND DISTANCE Chengguo LU Jbn LAN Zhongxng WANG Receved: 6 December 2004 / Revsed:
More informationMDL-Based Unsupervised Attribute Ranking
MDL-Based Unsupervsed Attrbute Rankng Zdravko Markov Computer Scence Department Central Connectcut State Unversty New Brtan, CT 06050, USA http://www.cs.ccsu.edu/~markov/ markovz@ccsu.edu MDL-Based Unsupervsed
More informationLab 2e Thermal System Response and Effective Heat Transfer Coefficient
58:080 Expermental Engneerng 1 OBJECTIVE Lab 2e Thermal System Response and Effectve Heat Transfer Coeffcent Warnng: though the experment has educatonal objectves (to learn about bolng heat transfer, etc.),
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationErrors in Nobel Prize for Physics (7) Improper Schrodinger Equation and Dirac Equation
Errors n Nobel Prze for Physcs (7) Improper Schrodnger Equaton and Drac Equaton u Yuhua (CNOOC Research Insttute, E-mal:fuyh945@sna.com) Abstract: One of the reasons for 933 Nobel Prze for physcs s for
More informationCONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION
CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationUsing Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*
Advances n Computer Scence Research (ACRS), volume 54 Internatonal Conference on Computer Networks and Communcaton Technology (CNCT206) Usng Immune Genetc Algorthm to Optmze BP Neural Network and Its Applcaton
More informationChapter 3 Describing Data Using Numerical Measures
Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationAssignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.
Assgnment 5 Smulaton for Logstcs Mont, N.E. Yunta, T. November 26, 2007 1. Smulaton Desgn The frst objectve of ths assgnment s to derve a 90% two-sded Confdence Interval (CI) for the average watng tme
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationParameter Estimation for Dynamic System using Unscented Kalman filter
Parameter Estmaton for Dynamc System usng Unscented Kalman flter Jhoon Seung 1,a, Amr Atya F. 2,b, Alexander G.Parlos 3,c, and Klto Chong 1,4,d* 1 Dvson of Electroncs Engneerng, Chonbuk Natonal Unversty,
More information