Research on Fault Tolerance for the Static Segment of FlexRay Protocol
|
|
- Chester Small
- 6 years ago
- Views:
Transcription
1 Research o Fault Tolerace for the Statc Segmet of FlexRay Protocol Ru I a, Ye ZHU a, Zhyg WANG b a Embedded System & Networkg aboratory, Hua Uversty, Cha b the School of Computer, Natoal Uversty of Defese Techology, Cha ru@hueduc, zhukovyear@foxmalcom, zywag@udteducom Abstract FlexRay s the ext geerato commucato protocol automotve etwork But the developmet was hdered because most of the researches gored traset fault message trasmsso I ths work, a complete framework s preseted to creases the relablty by retrasmttg messages the statc segmet It cludes system model, mathematcal abstracto ad a heurstc algorthm Gve a specfcato of the system model, our work wll ot oly get the system satsfy the relablty goal but also optmze the badwdth utlzato rate Smulato results show that our approach performs better tha the exstg algorthm badwdth utlzato rate (-9%), relablty (+007%) ad rug tme (-372%) I our opo, ths algorthm s so geerc that t ca be wdely used other tme-trggered ad relablty crtcal applcatos eywords Fault tolerace, Badwdth utlzato rate, FlexRay, retrasmt message, statc segmet I INTRODUCTION I moder hgh-ed cars, lke the BMW X7 seres, t s commo to see about 70 electroc cotrol uts (ECUs) exchagg 2500 electrc sgals sde the cars [] These ECUs are dstrbuted varous parts of the car ad are hardwred wth dfferet actuators or sesors Wth the crease of the ECU umber, tradtoal pot-pot lks have bee replaced by bus etwork [3] FlexRay appeared as a fast, fault-tolerat ext geerato etwork protocols 2004 Although FlexRay have a great advatage compared to other bus etwork protocol, ts developmet was stll be hdered for ts lackage of a applcato layer scheme to prevet traset fault the process of message trasmt Ad t caot guaratee relablty [] Varous techques for etwork parameters optmzato, tme aalyzg framework ad task schedulg have bee studed the feld of the FlexRay research The work [3] descrbes a FlexRay etwork parameters optmzato method that focuses o the legth of commucato cycle wth mmum worst case respose tmes (WCRTs) Performace aalyss framework for a etwork of ECUs that commucate va a FlexRay bus was troduced [2] Referece [5] provdes solutos for dfferet task schedulg polces based o a mx teger lear programmg framework However, oly a few of them focus o relablty of FlexRay I 200, Taasa presets a framework of geeratg fault-tolerat message schedules by retrasmttg messages the statc segmet of FlexRay [] But ther algorthm caot geerate the optmal retrasmsso scheme savg the badwdth The ma cotrbuto of ths paper s a algorthm of fdg the retrasmsso scheme whch performs better tha the exstg works badwdth utlzato rate, relablty ad rug tme Frst, a system model ad mathematcal abstracto were made for the fault tolerace problem FlexRay The a heurstc algorthm H- whch ca be used to fd the optmal retrasmsso scheme savg the badwdth ad at the same tme satsfy the relablty goal was preseted At last, some smulato tests were doe Matlab200 The results show that our approach performs better tha the exstg works badwdth utlzato rate (-9%), relablty (+007%) ad rug tme (-372%) I our opo, ths algorthm s so geerc that t ca be wdely used other tme-trggered ad relablty crtcal applcatos The rest of the paper s orgazed as follows I Secto II, formal model was proposed to aalyze fault tolerace the statc segmet of FlexRay Secto III troduces mathematcal abstracto of the problem ad a ew heurstc retrasmsso algorthm I Secto IV, a smulato comparso test was desged for the algorthms The cocluso of ths paper was preseted Secto V II SYSTEM MODE AND EQUATIO A Meda Access Cotrol of the FlexRay Our system model s based o the commucato level of FlexRay As show Fgure, every commucato cycle cotas the statc segmet, the dyamc segmet, the symbol wdow ad the etwork dle tme (NIT) [4] Statc segmet are desged for tme trggered messages usg Tme Dvso Multple Access (TDMA) scheme Whle the dyamc segmet s usg m-slottg based scheme to trasmt evet trggered messages The symbol wdow s a commucato perod whch a symbol ca be trasmtted o the etwork The NIT s a commucato-free perod that cocludes each cycle [4]
2 Fgure The system model cludg some parameters metoed our work Ths work oly cocetrates o the statc segmet As show Fgure, the statc segmet s made up of cosecutve tme tervals called slots Each slot s allocated to a task ad ca be used to trasmt oe FlexRay message If the task has o message to sed, the slot goes empty [2] B System model The system model s dvded to two parts: the message model ad the bus model Message model s a message set whch cludes messages M { M, M 2, M } ad some parameters about the message ) Cycle tme: The cycle tme set T { T T T }, 2, Cycle tme T s the costat tme terval betwee message producg twce successo M 2) Error rate: The message error rate set P { P P P},, 2 Error rate P s the falure probablty of trasmttg message M oce 3) Number of retrasmsso tmes: The umber of retrasmsso tmes set {, 2, } s the umber of tmes that message M wll be retrasmtted cycle tme T The bus model s preseted as follows: ) Commucato cycle legth: FC FC s the legth of a commucato cycle 2) Number of slots: It stads for the totally umber of slots oe statc segmet 3) Relablty goal: ρ It meas how relable the system message trasmsso process eeds to be 4) Global probablty of success: GP GP s the probablty that all messages trasmt successfully test perod τ If GP > ρ, t s beleved that the system s relable 5) Test perod: τ τ s the statstcal rug tme of the system As show Fgure, there are 4 messages trasmttg T ms,2 ms,4 ms,8ms o the bus ad the cycle tme set s { } FC s 2ms ad s 5 C Equatos I order to fd the optmal retrasmsso scheme badwdth utlzato ad satsfy the relablty goal, three equatos eed to be preseted frst () ad (2) were preseted by Taasa [] s defed as the lower boud of whch satsfy GP > ρ I (3), the badwdth utlzato rate s defed as the rato of the umber of used slots to the umber of slots suppled τ, whch ca be used to show the stuato of the used slots τ τ + T GP ( P ) () T log ρ τ log P (2) used slots + FC Badwdth utlzato rate (3) all slots T I T, M wll trasmt oce ad retrasmt tmes So ( ) + τ T slots wll be used to trasmt or retrasmt
3 all of the messages τ The, there are τ FC commucato cycles supplyg τ FC slots τ Fally, (3) was proofed by gettg the umber of used slots τ dvded by the umber of slots suppled τ Taasa regarded the umber of used slot oe FC as ts optmal obectve [] But we beleve the badwdth utlzato rate s much more sutable tha t A aalyss about ths wll be preseted wth the help of a example Ths example has oly oe message M wth oe retrasmsso ad cycle tme T 0ms The FlexRay cycle s FC 5ms wth 5 slots the statc segmet The the umber of used slots oe FC ca be computed as 0, or 2 Ths s because there are two FC oe T tme The trasmsso ad retrasmsso of M may happe the frst FC or the secod oe As a result, the umber of used slots oe FC s ot a proper optmal obectve for ths problem because t oly evaluates the stuato of oe FC ad T may be loger tha FC O the other sde, the badwdth utlzato rate s much more sutable to be the optmal obectve tha the umber of used slots oe FC I the example above, the badwdth utlzato rate ca be computed as 20% accordg to (3) Obvously, t shows the stuato of used slots test tme τ stead of FC correctly I our opo, the optmzato of the badwdth utlzato rate wll reduce the complexty schedulablty aalyss Ad the parameter cofgurato process could also beeft from t mmzg worst case respose tme [3] I cocluso, the badwdth utlzato rate was regarded as the optmal obectve ths work III RETRAMISSION AGORITHMS A Mathematcal Abstracto Dfferet from the exstg works usg () drectly, t s foud that after takg a logarthm computato to both sde of GP > ρ ad some smple trasformatos, GP > ρ wll log( + P ) τ be trasformed to < whch ca be T log ρ used to measure the effect of creasg oe message s retrasmsso tmes So the left part of t was defed as a ew fucto f( ) whch ca be regarded as the cotrbuto of M retrasmttg tmes The less f( ), the more relable the trasmsso wll be log( + P ) τ f( k) (4) T log ρ The the relable costra GP > ρ was trasformed to f ( ) < If f ( ) < we ca beleve that the system s relable The the mathematcal abstracto of the problem was preseted as follows T, P, τ, ρ, FC, are all kow The retrasmsso tmes set should be computed to satsfy the relablty goal f ( ) < The optmal obectve s to mmze the badwdth utlzato rate + FC T I order to descrbe the algorthm smply, aother auxlary fucto g( ) was defed (5) It descrbes the dfferece of cotrbuto retrasmttg M from to + tmes g ( ) f ( ) f ( + ) (5) B H- algorthm s dea The basc dea of the H- algorthm s: each loop, H- creases the curretly most effectve message s retrasmsso tmes oce utl the relablty goal f ( ) < s satsfed The most effectve message s the message that has the maxmum rato of cotrbuto dfferece g( ) to badwdth utlzato rate crease For example, f H- retrasmts M oe more tme, t wll reduce f ( ) by g( ) ad badwdth utlzato rate wll crease FC T accordg to (3) The crease of the badwdth utlzato rate s cosdered as T because both of FC ad are costat So the most effectve message we select to crease ts s the message wth maxmum cotrbuto dfferece value g( ) T badwdth utlzato crease C H- algorthm descrpto I our algorthm below, s talzed to usg (2) (le 2,3) The each loop (le 7), H- chooses the message wth the maxmum g( ) T(le 9) ad creases ts retrasmsso tmes by oe (le ) to optmze the badwdth utlzato rate utl the relablty goal s satsfed (le 7) or the badwdth utlzato rate s larger tha 00% (le 8) Iput: Message set M, probablty of falure set P, cycle tme set T, relablty goal ρ, commucato cycle FC ad the umber of slots the statc segmet for {, 2, } 2 compute 3 4 compute f( ) 5 ed for 6 SumOfCotrbuto f( ) 7 whle ( SumOfCotrbuto > )
4 (a) (b) (c) Fgure 2 Smulato test result (a) Badwdth utlzato rate (b) Relablty (c) Rug tme + FC 8 f ( < ) the T 9 the message umber wth max g( ) T { g( ) T, g2( 2) T2, g( ) T} 0 SumOfCotrbuto g ( ) + 2 else retur badwdth overflow 3 ed f 4 ed whle 5 retur {, 2, } As oted before, the H- algorthm s a ew method of fdg the retrasmsso scheme whch performs better tha the exstg work badwdth utlzato rate, relablty ad rug tme IV SIMUATION TEST As preseted above, ths work s focusg o fdg the retrasmsso scheme whch ca satsfy the relablty goal ad optmze the badwdth utlzato rate So the smulato expermet cocetrates o three evaluato dcators: the badwdth utlzato rate, the relablty goal s acheved or ot ad the rug tme 6 cases were geerated durg the umber of messages from 5 to 20 ad for each case 00 examples were studed For radomess ad accuracy, each example wll ru 00 tmes ad all of the examples were geerated radomly by varyg some message parameters For example, T were selected from 5ms to 20ms, P were set 0% to 50% Whle the others are assged statcally as follows: FC 5ms, 50, ρ 99%, τ hour The etre smulato has bee mplemeted a Wdows XP mache rug a Itel(R) Petum(R) Dual E GHz processor wth MATAB 200a The average badwdth utlzato rate of each case was preseted Fgure 2(a) ad the badwdth overflowg tmes 00 examples were show Fgure 3 Compared to the exstg works, our H- reduces the average badwdth utlzato rate by 9% ad t also grows slower tha Taasa s badwdth overflowg tmes Because our algorthm s optmal obectve s the badwdth utlzato rate stead of the umber of used slots oe FC Fgure 2 (b) shows the average relablty of each case Ad the relablty suffcet tmes 6 00 examples were plotted Fgure 3 Both of them satsfy the relablty goal wthout ay relablty suffcet examples ad our algorthm s a lttle bt more relable (average +007%) tha the prevous ways At last, we focus o the least cocered evaluato dcator: rug tme because H- s a statc algorthm for the statc segmet After tme complexty aalyss, H- s less or equal to the exstg algorthm 2 ( O ( )) As show Fgure 2(c), the average rug tme s reduced by 372% our algorthm Fgure 3 Badwdth overflow ad relablty suffcet tmes 00 examples
5 V CONCUSIO I ths work, a complete framework s preseted to creases the relablty by retrasmttg messages the statc segmet It cludes system model, mathematcal abstracto ad a heurstc algorthm amed H- whch ams at fdg the optmal retrasmsso scheme savg the badwdth ad satsfyg the relablty goal The smulato results show that H- algorthm performs better tha the exstg works ot oly badwdth utlzato rate (-9%) but also relablty (+007%) ad rug tme (-372%) I our opo, ths algorthm s so geerc that t ca be wdely used other tme-trggered ad relablty crtcal applcatos REFERENCES [] BTaasa, U D Bordolo, P Eles, ad P Zebo, Schedulg for Fault-Tolerat Commucato o the Statc Segmet of FlexRay, Real-Tme Systems Symposum (RTSS), 200 IEEE 3st, 200, pp [2] A Hagescu, U D Bordolo, S Chakraborty, P Sampath, P V V Gaesa, ad S Ramesh, Performace Aalyss of FlexRay-based ECU Networks, Desg Automato Coferece, 2007 DAC '07 44th ACM/IEEE, 2007, pp [3] P Iseok ad S Myougho, FlexRay Network Parameter Optmzato Method for Automotve Applcatos, Idustral Electrocs, IEEE Trasactos o, vol 58, pp , 20 [4] The FlexRay Commucatos System Protocol Specfcato 2 Rev A [O-le] Avalable: wwwflexraycom [5] Z Habo, Z We, M D Natale, A Ghosal, P Gusto, ad A Sagova-Vcetell, Schedulg the FlexRay bus usg optmzato techques, Desg Automato Coferece, 2009 DAC '09 46th ACM/IEEE, 2009, pp [6] Feg, et al, Research o FlexRay commucato system, Vehcle Power ad Propulso Coferece, 2008 VPPC '08 IEEE, 2008, pp -5 [7] lobedaz, et al, A recofgurato approach for fault-tolerat FlexRay etworks, Desg, Automato & Test Europe Coferece & Exhbto (DATE), 20, 20, pp -6 [8] H opetz, A tegrated archtecture for depedable embedded systems, Relable Dstrbuted Systems, 2004 Proceedgs of the 23rd IEEE Iteratoal Symposum o, 2004, pp 60-6 [9] M ukasewycz, et al, FlexRay schedule optmzato of the statc segmet, preseted at the Proceedgs of the 7th IEEE/ACM teratoal coferece o Hardware/software codesg ad system sythess, Greoble, Frace, 2009 [0] P Maro, et al, Electrocs Automotve Egeerg: A Top- Dow Approach for Implemetg Idustral Feldbus Techologes Cty Buses ad Coaches, Idustral Electrocs, IEEE Trasactos o, vol 56, pp , 2009
Solving Constrained Flow-Shop Scheduling. Problems with Three Machines
It J Cotemp Math Sceces, Vol 5, 2010, o 19, 921-929 Solvg Costraed Flow-Shop Schedulg Problems wth Three Maches P Pada ad P Rajedra Departmet of Mathematcs, School of Advaced Sceces, VIT Uversty, Vellore-632
More informationComparing Different Estimators of three Parameters for Transmuted Weibull Distribution
Global Joural of Pure ad Appled Mathematcs. ISSN 0973-768 Volume 3, Number 9 (207), pp. 55-528 Research Ida Publcatos http://www.rpublcato.com Comparg Dfferet Estmators of three Parameters for Trasmuted
More informationA Method for Damping Estimation Based On Least Square Fit
Amerca Joural of Egeerg Research (AJER) 5 Amerca Joural of Egeerg Research (AJER) e-issn: 3-847 p-issn : 3-936 Volume-4, Issue-7, pp-5-9 www.ajer.org Research Paper Ope Access A Method for Dampg Estmato
More informationEstimation of Stress- Strength Reliability model using finite mixture of exponential distributions
Iteratoal Joural of Computatoal Egeerg Research Vol, 0 Issue, Estmato of Stress- Stregth Relablty model usg fte mxture of expoetal dstrbutos K.Sadhya, T.S.Umamaheswar Departmet of Mathematcs, Lal Bhadur
More informationBlock-Based Compact Thermal Modeling of Semiconductor Integrated Circuits
Block-Based Compact hermal Modelg of Semcoductor Itegrated Crcuts Master s hess Defese Caddate: Jg Ba Commttee Members: Dr. Mg-Cheg Cheg Dr. Daqg Hou Dr. Robert Schllg July 27, 2009 Outle Itroducto Backgroud
More informationThe Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis)
We have covered: Selecto, Iserto, Mergesort, Bubblesort, Heapsort Next: Selecto the Qucksort The Selecto Problem - Varable Sze Decrease/Coquer (Practce wth algorthm aalyss) Cosder the problem of fdg the
More informationAnalysis of System Performance IN2072 Chapter 5 Analysis of Non Markov Systems
Char for Network Archtectures ad Servces Prof. Carle Departmet of Computer Scece U Müche Aalyss of System Performace IN2072 Chapter 5 Aalyss of No Markov Systems Dr. Alexader Kle Prof. Dr.-Ig. Georg Carle
More informationFunctions of Random Variables
Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,
More informationAnalysis of Lagrange Interpolation Formula
P IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue, December 4. www.jset.com ISS 348 7968 Aalyss of Lagrage Iterpolato Formula Vjay Dahya PDepartmet of MathematcsMaharaja Surajmal
More informationPTAS for Bin-Packing
CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,
More informationBeam Warming Second-Order Upwind Method
Beam Warmg Secod-Order Upwd Method Petr Valeta Jauary 6, 015 Ths documet s a part of the assessmet work for the subject 1DRP Dfferetal Equatos o Computer lectured o FNSPE CTU Prague. Abstract Ths documet
More informationFor combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.
Addtoal Decrease ad Coquer Algorthms For combatoral problems we mght eed to geerate all permutatos, combatos, or subsets of a set. Geeratg Permutatos If we have a set f elemets: { a 1, a 2, a 3, a } the
More informationFeature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)
CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.
More informationIntroduction to local (nonparametric) density estimation. methods
Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest
More informationUnimodality Tests for Global Optimization of Single Variable Functions Using Statistical Methods
Malaysa Umodalty Joural Tests of Mathematcal for Global Optmzato Sceces (): of 05 Sgle - 5 Varable (007) Fuctos Usg Statstcal Methods Umodalty Tests for Global Optmzato of Sgle Varable Fuctos Usg Statstcal
More informationSpecial Instructions / Useful Data
JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth
More informationA tighter lower bound on the circuit size of the hardest Boolean functions
Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the
More informationAnalysis of Variance with Weibull Data
Aalyss of Varace wth Webull Data Lahaa Watthaacheewaul Abstract I statstcal data aalyss by aalyss of varace, the usual basc assumptos are that the model s addtve ad the errors are radomly, depedetly, ad
More informationDiscrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b
CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package
More informationA New Family of Transformations for Lifetime Data
Proceedgs of the World Cogress o Egeerg 4 Vol I, WCE 4, July - 4, 4, Lodo, U.K. A New Famly of Trasformatos for Lfetme Data Lakhaa Watthaacheewakul Abstract A famly of trasformatos s the oe of several
More informationBayes Estimator for Exponential Distribution with Extension of Jeffery Prior Information
Malaysa Joural of Mathematcal Sceces (): 97- (9) Bayes Estmator for Expoetal Dstrbuto wth Exteso of Jeffery Pror Iformato Hadeel Salm Al-Kutub ad Noor Akma Ibrahm Isttute for Mathematcal Research, Uverst
More informationLecture 3. Sampling, sampling distributions, and parameter estimation
Lecture 3 Samplg, samplg dstrbutos, ad parameter estmato Samplg Defto Populato s defed as the collecto of all the possble observatos of terest. The collecto of observatos we take from the populato s called
More informationNewton s Power Flow algorithm
Power Egeerg - Egll Beedt Hresso ewto s Power Flow algorthm Power Egeerg - Egll Beedt Hresso The ewto s Method of Power Flow 2 Calculatos. For the referece bus #, we set : V = p.u. ad δ = 0 For all other
More informationEconometric Methods. Review of Estimation
Ecoometrc Methods Revew of Estmato Estmatg the populato mea Radom samplg Pot ad terval estmators Lear estmators Ubased estmators Lear Ubased Estmators (LUEs) Effcecy (mmum varace) ad Best Lear Ubased Estmators
More informationAnalysis of a Repairable (n-1)-out-of-n: G System with Failure and Repair Times Arbitrarily Distributed
Amerca Joural of Mathematcs ad Statstcs. ; (: -8 DOI:.593/j.ajms.. Aalyss of a Reparable (--out-of-: G System wth Falure ad Repar Tmes Arbtrarly Dstrbuted M. Gherda, M. Boushaba, Departmet of Mathematcs,
More informationComputational Geometry
Problem efto omputatoal eometry hapter 6 Pot Locato Preprocess a plaar map S. ve a query pot p, report the face of S cotag p. oal: O()-sze data structure that eables O(log ) query tme. pplcato: Whch state
More informationAnalyzing Fuzzy System Reliability Using Vague Set Theory
Iteratoal Joural of Appled Scece ad Egeerg 2003., : 82-88 Aalyzg Fuzzy System Relablty sg Vague Set Theory Shy-Mg Che Departmet of Computer Scece ad Iformato Egeerg, Natoal Tawa versty of Scece ad Techology,
More informationRuntime analysis RLS on OneMax. Heuristic Optimization
Lecture 6 Rutme aalyss RLS o OeMax trals of {,, },, l ( + ɛ) l ( ɛ)( ) l Algorthm Egeerg Group Hasso Platter Isttute, Uversty of Potsdam 9 May T, We wat to rgorously uderstad ths behavor 9 May / Rutme
More informationMu Sequences/Series Solutions National Convention 2014
Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed
More informationEECE 301 Signals & Systems
EECE 01 Sgals & Systems Prof. Mark Fowler Note Set #9 Computg D-T Covoluto Readg Assgmet: Secto. of Kame ad Heck 1/ Course Flow Dagram The arrows here show coceptual flow betwee deas. Note the parallel
More informationChapter 14 Logistic Regression Models
Chapter 4 Logstc Regresso Models I the lear regresso model X β + ε, there are two types of varables explaatory varables X, X,, X k ad study varable y These varables ca be measured o a cotuous scale as
More informationbest estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best
Error Aalyss Preamble Wheever a measuremet s made, the result followg from that measuremet s always subject to ucertaty The ucertaty ca be reduced by makg several measuremets of the same quatty or by mprovg
More information8.1 Hashing Algorithms
CS787: Advaced Algorthms Scrbe: Mayak Maheshwar, Chrs Hrchs Lecturer: Shuch Chawla Topc: Hashg ad NP-Completeess Date: September 21 2007 Prevously we looked at applcatos of radomzed algorthms, ad bega
More informationA Robust Total Least Mean Square Algorithm For Nonlinear Adaptive Filter
A Robust otal east Mea Square Algorthm For Nolear Adaptve Flter Ruxua We School of Electroc ad Iformato Egeerg X'a Jaotog Uversty X'a 70049, P.R. Cha rxwe@chare.com Chogzhao Ha, azhe u School of Electroc
More informationNP!= P. By Liu Ran. Table of Contents. The P versus NP problem is a major unsolved problem in computer
NP!= P By Lu Ra Table of Cotets. Itroduce 2. Prelmary theorem 3. Proof 4. Expla 5. Cocluso. Itroduce The P versus NP problem s a major usolved problem computer scece. Iformally, t asks whether a computer
More informationDerivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations
Dervato of -Pot Block Method Formula for Solvg Frst Order Stff Ordary Dfferetal Equatos Kharul Hamd Kharul Auar, Kharl Iskadar Othma, Zara Bb Ibrahm Abstract Dervato of pot block method formula wth costat
More informationPart 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))
art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the
More informationKernel-based Methods and Support Vector Machines
Kerel-based Methods ad Support Vector Maches Larr Holder CptS 570 Mache Learg School of Electrcal Egeerg ad Computer Scece Washgto State Uverst Refereces Muller et al. A Itroducto to Kerel-Based Learg
More informationLaboratory I.10 It All Adds Up
Laboratory I. It All Adds Up Goals The studet wll work wth Rema sums ad evaluate them usg Derve. The studet wll see applcatos of tegrals as accumulatos of chages. The studet wll revew curve fttg sklls.
More informationEP2200 Queueing theory and teletraffic systems. Queueing networks. Viktoria Fodor KTH EES/LCN KTH EES/LCN
EP2200 Queueg theory ad teletraffc systems Queueg etworks Vktora Fodor Ope ad closed queug etworks Queug etwork: etwork of queug systems E.g. data packets traversg the etwork from router to router Ope
More informationConfidence Intervals for Double Exponential Distribution: A Simulation Approach
World Academy of Scece, Egeerg ad Techology Iteratoal Joural of Physcal ad Mathematcal Sceces Vol:6, No:, 0 Cofdece Itervals for Double Expoetal Dstrbuto: A Smulato Approach M. Alrasheed * Iteratoal Scece
More informationAn Introduction to. Support Vector Machine
A Itroducto to Support Vector Mache Support Vector Mache (SVM) A classfer derved from statstcal learg theory by Vapk, et al. 99 SVM became famous whe, usg mages as put, t gave accuracy comparable to eural-etwork
More informationNP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer
NP!= P By Lu Ra Table of Cotets. Itroduce 2. Strategy 3. Prelmary theorem 4. Proof 5. Expla 6. Cocluso. Itroduce The P vs. NP problem s a major usolved problem computer scece. Iformally, t asks whether
More informationWireless Link Properties
Opportustc Ecrypto for Robust Wreless Securty R. Chadramoul ( Moul ) moul@steves.edu Multmeda System, Networkg, ad Commucatos (MSyNC) Laboratory, Departmet of Electrcal ad Computer Egeerg, Steves Isttute
More informationOn Modified Interval Symmetric Single-Step Procedure ISS2-5D for the Simultaneous Inclusion of Polynomial Zeros
It. Joural of Math. Aalyss, Vol. 7, 2013, o. 20, 983-988 HIKARI Ltd, www.m-hkar.com O Modfed Iterval Symmetrc Sgle-Step Procedure ISS2-5D for the Smultaeous Icluso of Polyomal Zeros 1 Nora Jamalud, 1 Masor
More informationAn Improved Differential Evolution Algorithm Based on Statistical Log-linear Model
Sesors & Trasducers, Vol. 59, Issue, November, pp. 77-8 Sesors & Trasducers by IFSA http://www.sesorsportal.com A Improved Dfferetal Evoluto Algorthm Based o Statstcal Log-lear Model Zhehuag Huag School
More informationResearch Article A New Derivation and Recursive Algorithm Based on Wronskian Matrix for Vandermonde Inverse Matrix
Mathematcal Problems Egeerg Volume 05 Artcle ID 94757 7 pages http://ddoorg/055/05/94757 Research Artcle A New Dervato ad Recursve Algorthm Based o Wroska Matr for Vadermode Iverse Matr Qu Zhou Xja Zhag
More informationLecture Notes Types of economic variables
Lecture Notes 3 1. Types of ecoomc varables () Cotuous varable takes o a cotuum the sample space, such as all pots o a le or all real umbers Example: GDP, Polluto cocetrato, etc. () Dscrete varables fte
More informationComparison of Dual to Ratio-Cum-Product Estimators of Population Mean
Research Joural of Mathematcal ad Statstcal Sceces ISS 30 6047 Vol. 1(), 5-1, ovember (013) Res. J. Mathematcal ad Statstcal Sc. Comparso of Dual to Rato-Cum-Product Estmators of Populato Mea Abstract
More informationARQ Optimization for UMTS Networks
IOSR Joural of Electrocs ad Commucato Egeerg (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 3, Ver. III (May - Ju. 2014), PP 110-114 ARQ Optmzato for UMTS Networks 1 Eduardo Rodrgues
More informationLecture 16: Backpropogation Algorithm Neural Networks with smooth activation functions
CO-511: Learg Theory prg 2017 Lecturer: Ro Lv Lecture 16: Bacpropogato Algorthm Dsclamer: These otes have ot bee subected to the usual scruty reserved for formal publcatos. They may be dstrbuted outsde
More informationC-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory
ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?
More informationENGI 3423 Simple Linear Regression Page 12-01
ENGI 343 mple Lear Regresso Page - mple Lear Regresso ometmes a expermet s set up where the expermeter has cotrol over the values of oe or more varables X ad measures the resultg values of aother varable
More information2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America
SOLUTION OF SYSTEMS OF SIMULTANEOUS LINEAR EQUATIONS Gauss-Sedel Method 006 Jame Traha, Autar Kaw, Kev Mart Uversty of South Florda Uted States of Amerca kaw@eg.usf.edu Itroducto Ths worksheet demostrates
More information1 0, x? x x. 1 Root finding. 1.1 Introduction. Solve[x^2-1 0,x] {{x -1},{x 1}} Plot[x^2-1,{x,-2,2}] 3
Adrew Powuk - http://www.powuk.com- Math 49 (Numercal Aalyss) Root fdg. Itroducto f ( ),?,? Solve[^-,] {{-},{}} Plot[^-,{,-,}] Cubc equato https://e.wkpeda.org/wk/cubc_fucto Quartc equato https://e.wkpeda.org/wk/quartc_fucto
More informationL5 Polynomial / Spline Curves
L5 Polyomal / Sple Curves Cotets Coc sectos Polyomal Curves Hermte Curves Bezer Curves B-Sples No-Uform Ratoal B-Sples (NURBS) Mapulato ad Represetato of Curves Types of Curve Equatos Implct: Descrbe a
More informationConvergence of the Desroziers scheme and its relation to the lag innovation diagnostic
Covergece of the Desrozers scheme ad ts relato to the lag ovato dagostc chard Méard Evromet Caada, Ar Qualty esearch Dvso World Weather Ope Scece Coferece Motreal, August 9, 04 o t t O x x x y x y Oservato
More informationBayes (Naïve or not) Classifiers: Generative Approach
Logstc regresso Bayes (Naïve or ot) Classfers: Geeratve Approach What do we mea by Geeratve approach: Lear p(y), p(x y) ad the apply bayes rule to compute p(y x) for makg predctos Ths s essetally makg
More informationOn generalized fuzzy mean code word lengths. Department of Mathematics, Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India
merca Joural of ppled Mathematcs 04; (4): 7-34 Publshed ole ugust 30, 04 (http://www.scecepublshggroup.com//aam) do: 0.648/.aam.04004.3 ISSN: 330-0043 (Prt); ISSN: 330-006X (Ole) O geeralzed fuzzy mea
More informationPGE 310: Formulation and Solution in Geosystems Engineering. Dr. Balhoff. Interpolation
PGE 30: Formulato ad Soluto Geosystems Egeerg Dr. Balhoff Iterpolato Numercal Methods wth MATLAB, Recktewald, Chapter 0 ad Numercal Methods for Egeers, Chapra ad Caale, 5 th Ed., Part Fve, Chapter 8 ad
More informationVOL. 3, NO. 11, November 2013 ISSN ARPN Journal of Science and Technology All rights reserved.
VOL., NO., November 0 ISSN 5-77 ARPN Joural of Scece ad Techology 0-0. All rghts reserved. http://www.ejouralofscece.org Usg Square-Root Iverted Gamma Dstrbuto as Pror to Draw Iferece o the Raylegh Dstrbuto
More informationOptimal Strategy Analysis of an N-policy M/E k /1 Queueing System with Server Breakdowns and Multiple Vacations
Iteratoal Joural of Scetfc ad Research ublcatos, Volume 3, Issue, ovember 3 ISS 5-353 Optmal Strategy Aalyss of a -polcy M/E / Queueg System wth Server Breadows ad Multple Vacatos.Jayachtra*, Dr.A.James
More informationQR Factorization and Singular Value Decomposition COS 323
QR Factorzato ad Sgular Value Decomposto COS 33 Why Yet Aother Method? How do we solve least-squares wthout currg codto-squarg effect of ormal equatos (A T A A T b) whe A s sgular, fat, or otherwse poorly-specfed?
More informationLecture 9: Tolerant Testing
Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have
More information1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers.
PROBLEMS A real umber s represeted appromately by 63, ad we are told that the relatve error s % What s? Note: There are two aswers Ht : Recall that % relatve error s What s the relatve error volved roudg
More informationd dt d d dt dt Also recall that by Taylor series, / 2 (enables use of sin instead of cos-see p.27 of A&F) dsin
Learzato of the Swg Equato We wll cover sectos.5.-.6 ad begg of Secto 3.3 these otes. 1. Sgle mache-fte bus case Cosder a sgle mache coected to a fte bus, as show Fg. 1 below. E y1 V=1./_ Fg. 1 The admttace
More informationRademacher Complexity. Examples
Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed
More informationComparison of Parameters of Lognormal Distribution Based On the Classical and Posterior Estimates
Joural of Moder Appled Statstcal Methods Volume Issue Artcle 8 --03 Comparso of Parameters of Logormal Dstrbuto Based O the Classcal ad Posteror Estmates Raja Sulta Uversty of Kashmr, Sragar, Ida, hamzasulta8@yahoo.com
More informationA Multi-Entry Simulated and Inversed Function Approach. for Alternative Solutions
Iteratoal Mathematcal Forum,, 2006, o. 40, 2003 207 A Mult-Etry Smulated ad Iversed Fucto Approach for Alteratve Solutos Kev Wag a, Che Chag b ad Chug Pg Lu b a Computg ad Mathematcs School Joh Moores
More informationSummary of the lecture in Biostatistics
Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the
More information{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:
Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed
More informationf f... f 1 n n (ii) Median : It is the value of the middle-most observation(s).
CHAPTER STATISTICS Pots to Remember :. Facts or fgures, collected wth a defte pupose, are called Data.. Statstcs s the area of study dealg wth the collecto, presetato, aalyss ad terpretato of data.. The
More informationCross-Layer Strategies for Throughput Maximization in a Data Aggregating Wireless Network
Cross-Layer Strateges for Throughput Maxmzato a Data Aggregatg Wreless Network Easwar Vvek Magpud Emal: easwar.vvek@gmal.com Vekatesh Ramaya Emal: rvekat@ee.tm.ac. Srkrsha Bhashyam Emal: skrsha@ee.tm.ac.
More informationAnalyzing Control Structures
Aalyzg Cotrol Strutures sequeg P, P : two fragmets of a algo. t, t : the tme they tae the tme requred to ompute P ;P s t t Θmaxt,t For loops for to m do P t: the tme requred to ompute P total tme requred
More informationSupervised learning: Linear regression Logistic regression
CS 57 Itroducto to AI Lecture 4 Supervsed learg: Lear regresso Logstc regresso Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 57 Itro to AI Data: D { D D.. D D Supervsed learg d a set of eamples s
More informationA Sequential Optimization and Mixed Uncertainty Analysis Method Based on Taylor Series Approximation
11 th World Cogress o Structural ad Multdscplary Optmsato 07 th -1 th, Jue 015, Sydey Australa A Sequetal Optmzato ad Med Ucertaty Aalyss Method Based o Taylor Seres Appromato aoqa Che, We Yao, Yyog Huag,
More informationOPTIMAL LAY-OUT OF NATURAL GAS PIPELINE NETWORK
23rd World Gas Coferece, Amsterdam 2006 OPTIMAL LAY-OUT OF NATURAL GAS PIPELINE NETWORK Ma author Tg-zhe, Ne CHINA ABSTRACT I cha, there are lots of gas ppele etwork eeded to be desged ad costructed owadays.
More informationConsensus Control for a Class of High Order System via Sliding Mode Control
Cosesus Cotrol for a Class of Hgh Order System va Sldg Mode Cotrol Chagb L, Y He, ad Aguo Wu School of Electrcal ad Automato Egeerg, Taj Uversty, Taj, Cha, 300072 Abstract. I ths paper, cosesus problem
More informationIJOART. Copyright 2014 SciResPub.
Iteratoal Joural of Advacemets Research & Techology, Volume 3, Issue 10, October -014 58 Usg webull dstrbuto the forecastg by applyg o real data of the umber of traffc accdets sulama durg the perod (010-013)
More informationUNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS
Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method
More informationThis lecture and the next. Why Sorting? Sorting Algorithms so far. Why Sorting? (2) Selection Sort. Heap Sort. Heapsort
Ths lecture ad the ext Heapsort Heap data structure ad prorty queue ADT Qucksort a popular algorthm, very fast o average Why Sortg? Whe doubt, sort oe of the prcples of algorthm desg. Sortg used as a subroute
More informationUniform asymptotical stability of almost periodic solution of a discrete multispecies Lotka-Volterra competition system
Iteratoal Joural of Egeerg ad Advaced Research Techology (IJEART) ISSN: 2454-9290, Volume-2, Issue-1, Jauary 2016 Uform asymptotcal stablty of almost perodc soluto of a dscrete multspeces Lotka-Volterra
More informationCubic Nonpolynomial Spline Approach to the Solution of a Second Order Two-Point Boundary Value Problem
Joural of Amerca Scece ;6( Cubc Nopolyomal Sple Approach to the Soluto of a Secod Order Two-Pot Boudary Value Problem W.K. Zahra, F.A. Abd El-Salam, A.A. El-Sabbagh ad Z.A. ZAk * Departmet of Egeerg athematcs
More informationResearch on SVM Prediction Model Based on Chaos Theory
Advaced Scece ad Techology Letters Vol.3 (SoftTech 06, pp.59-63 http://dx.do.org/0.457/astl.06.3.3 Research o SVM Predcto Model Based o Chaos Theory Sog Lagog, Wu Hux, Zhag Zezhog 3, College of Iformato
More informationESS Line Fitting
ESS 5 014 17. Le Fttg A very commo problem data aalyss s lookg for relatoshpetwee dfferet parameters ad fttg les or surfaces to data. The smplest example s fttg a straght le ad we wll dscuss that here
More informationOptimization Design and Analysis of Systematic LT codes over AWGN Channel
Optmzato Desg ad Aalyss of Systematc LT codes over AWGN Chael Shegka Xu, Dazhua Xu, Xaofe Zhag ad Haq Shao College of Electroc ad Iformato Egeerg Najg Uversty of Aeroautcs ad Astroautcs Emal: xudazhua@uaa.edu.c
More informationA New Measure of Probabilistic Entropy. and its Properties
Appled Mathematcal Sceces, Vol. 4, 200, o. 28, 387-394 A New Measure of Probablstc Etropy ad ts Propertes Rajeesh Kumar Departmet of Mathematcs Kurukshetra Uversty Kurukshetra, Ida rajeesh_kuk@redffmal.com
More informationHomework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015
Fall 05 Homework : Solutos Problem : (Practce wth Asymptotc Notato) A essetal requremet for uderstadg scalg behavor s comfort wth asymptotc (or bg-o ) otato. I ths problem, you wll prove some basc facts
More information( ) 2 2. Multi-Layer Refraction Problem Rafael Espericueta, Bakersfield College, November, 2006
Mult-Layer Refracto Problem Rafael Espercueta, Bakersfeld College, November, 006 Lght travels at dfferet speeds through dfferet meda, but refracts at layer boudares order to traverse the least-tme path.
More informationABOUT ONE APPROACH TO APPROXIMATION OF CONTINUOUS FUNCTION BY THREE-LAYERED NEURAL NETWORK
ABOUT ONE APPROACH TO APPROXIMATION OF CONTINUOUS FUNCTION BY THREE-LAYERED NEURAL NETWORK Ram Rzayev Cyberetc Isttute of the Natoal Scece Academy of Azerbaa Republc ramrza@yahoo.com Aygu Alasgarova Khazar
More informationChapter 9 Jordan Block Matrices
Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.
More informationEulerian numbers revisited : Slices of hypercube
Eulera umbers revsted : Slces of hypercube Kgo Kobayash, Hajme Sato, Mamoru Hosh, ad Hroyosh Morta Abstract I ths talk, we provde a smple proof o a terestg equalty coectg the umber of permutatos of,...,
More informationStatistics Descriptive and Inferential Statistics. Instructor: Daisuke Nagakura
Statstcs Descrptve ad Iferetal Statstcs Istructor: Dasuke Nagakura (agakura@z7.keo.jp) 1 Today s topc Today, I talk about two categores of statstcal aalyses, descrptve statstcs ad feretal statstcs, ad
More informationReliability evaluation of distribution network based on improved non. sequential Monte Carlo method
3rd Iteratoal Coferece o Mecatrocs, Robotcs ad Automato (ICMRA 205) Relablty evaluato of dstrbuto etwork based o mproved o sequetal Mote Carlo metod Je Zu, a, Cao L, b, Aog Tag, c Scool of Automato, Wua
More informationPoint Estimation: definition of estimators
Pot Estmato: defto of estmators Pot estmator: ay fucto W (X,..., X ) of a data sample. The exercse of pot estmato s to use partcular fuctos of the data order to estmate certa ukow populato parameters.
More information2. Independence and Bernoulli Trials
. Ideedece ad Beroull Trals Ideedece: Evets ad B are deedet f B B. - It s easy to show that, B deedet mles, B;, B are all deedet ars. For examle, ad so that B or B B B B B φ,.e., ad B are deedet evets.,
More informationSimulation Output Analysis
Smulato Output Aalyss Summary Examples Parameter Estmato Sample Mea ad Varace Pot ad Iterval Estmato ermatg ad o-ermatg Smulato Mea Square Errors Example: Sgle Server Queueg System x(t) S 4 S 4 S 3 S 5
More informationThe internal structure of natural numbers, one method for the definition of large prime numbers, and a factorization test
Fal verso The teral structure of atural umbers oe method for the defto of large prme umbers ad a factorzato test Emmaul Maousos APM Isttute for the Advacemet of Physcs ad Mathematcs 3 Poulou str. 53 Athes
More informationChapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements
Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall
More informationSimple Linear Regression
Statstcal Methods I (EST 75) Page 139 Smple Lear Regresso Smple regresso applcatos are used to ft a model descrbg a lear relatoshp betwee two varables. The aspects of least squares regresso ad correlato
More information