System identifications by SIRMs models with linear transformation of input variables
|
|
- Tracey Ferguson
- 5 years ago
- Views:
Transcription
1 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: November, 25 Accepted: March 3, 26 Onlne Publshed: Aprl 6, 26 DOI: 543/arv5n2p55 URL: ABSTRACT Ths paper shows the effectveness of the model proposed n the prevous paper for system dentfcatons In the frst smulaton, whch s for EX-OR, the fundamental dea of the proposed model s explaned In the second smulaton, whch s for classfcaton problems for dataset of Irs, Wne, Sonar and BCW known as benchmark problems, the capablty of the model s evaluated for nvolvng a large number of nput varables In the thrd smulaton, as one of control problems, numercal smulaton for obstacle avodance problem s performed In these smulatons, t s shown that the proposed model outperforms conventonal models n terms of system dentfcatons Key Words: SIRMs models wth LT, Classfcaton problem, Obstacle avodance problem INTRODUCTION There have been many studes on self-tunng fuzzy systems [ 5] Ther am s to construct self-tunng fuzzy systems from learnng data based on the steepest descent method (SDM) The obvous drawbacks of the method are ts large computatonal complexty and gettng stuck n a shallow local mnmum Therefore, neffectve systems wth an nference error and the number of rules are constructed In order to construct effectve systems, some novel methods have been developed whch ) create fuzzy rules one by one startng from a small number of rules, [6] 2) delete fuzzy rules one by one startng from a suffcently large number of rules, [7] 3) use a genetc algorthm to determne the structure of the fuzzy model, [5] 4) use a self-organzaton or a vector quantzaton technque to determne the ntal assgnment of fuzzy rules, [8, 9] 5) use generalzed obectve functons [] However, there are lttle effectve fuzzy nference systems Therefore, the conventonal learnng methods wth mult-obectve fuzzy modelng and fuzzy modelng wth constraned parameters of the ranges have become popular [5] On the other hand, SIRMs (Sngle-Input Rule Modules) model ams to obtan a better soluton by usng fuzzy nference system composed of sngle-nput rule modules [] Although t s easy to apply SIRMs model to the problems wth many nput varables, t s always dffcult to obtan a good performance for nonlnear problems Accordngly, SNIRMs (Small Number of Input Rule Modules) models, whch s a generalzed SIRMs, have been proposed [2 4] However, the capablty of SNIRMs models such as DIRMs (Double-Input Rule Modles) one s stll low compared wth conventonal models Therefore, we proposed SIRMs model wth lnear transformaton (LT) of nput varables and showed ts performance n prevous [5, 6] papers Correspondence: Hrom Myama; Emal: mya@eeekagoshma-uacp; Address: Graduate School of Scence and Engneerng, Kagoshma Unversty, Japan Publshed by Scedu Press 55
2 In ths paper, we nvestgate the performance of the proposed model for varous problems of system dentfcatons In the smulaton of classfcaton problems, we compare the proposed model and the conventonal model n terms of accuracy and the number of parameters Further, t s shown that the proposed model can be appled to an obstacle avodance problem, whch s an applcaton of control problems In the smulaton results, we wll show that the proposed model outperforms conventonal models n terms of accuracy and the number of parameters 2 PRELIMINARY 2 The conventonal model The conventonal model usng the SDM was prevously [, 2, 6] presented Let Z k {,, k} for the postve nteger k Let R denote the set of all real numbers Let x (x,, x m ) and y denote nput and output data, respectvely, where x, y R for Z m Then, for Z n, the -th rule of the conventonal model s expressed as R : f x s M and x m s M m then y s w () where M and w denote a membershp functon and the weght of -th rule, respectvely A membershp value µ for nput x s expressed as follows: m µ M (x ) (2) For Gaussan membershp functon, M s defned as follow: ( M (x ) exp ( ) ) 2 x c (3) 2 where c and b denote the center and wdth parameters, respectvely The output y of fuzzy nference s obtaned as follows: b Then, the followng relaton for Eq(3) hold: µ w n µ (y y r ) (7) µ c n µ (y y r ) (w y ) x c b 2 µ b n µ (y y r ) (w y ) (x c ) 2 b 3 In the followng, Gaussan functon s used as a membershp functon 22 The leanng algorthm A typcal learnng algorthm s ntroduced as the conventonal one [2] Let D {(x p,, xp m, y r p) p Z P } be a gven set of learnng data Fgure shows the learnng algorthm, whch mnmzes the followng obectve functon E P (8) (9) P (yp yp) r 2 () p y µ w µ (4) The obectve functon E, whch s the nference error between the desrable output y r and the output y, s defned as follows: E 2 (y y r ) 2 (5) In order to mnmze the obectve functon E, the procedure based on SDM updates each parameter β {c, b, w } as follows: β(t + ) β(t) K β (6) β where t s the learnng tme and K β s the learnng rate of β, whch s a constant value Fgure The flowchart of the conventonal learnng algorthm In the algorthm, θ and T max are the threshold for nference error and the maxmum number of learnng tme, respectvely 3 SIRMS AND DIRMS MODELS The SIRMs and DIRMs models are ntroduced [2 4] 56 ISSN E-ISSN
3 Each rule of SIRMs model s expressed as SIRM : {R : f x s M then y s w } n SIRM l : {R l : f x l s M l then y l s w} l n SIRM m : {R m : f x m s M m then y m s w m } n A membershp value for nput x and output for the l-th rule are expressed as follows: µ l M l (x l ) () yl µl wl (2) µl Then the output of fuzzy nference s obtaned as follow: m y h l yl (3) l Each parameter for the obectve functon E s updated as follow: h l (y y r )y l (4) w l c l b l h l µ l l µl (y y r ) (5) h l (y y r ) (wl y l ) x c l n µl (b l )2 (6) h l (y y r ) (wl y l ) (x c l )2 n µl (b l )3 (7) where h l, w l, cl and bl are parameters Lkewse, the rule of DIRMs model s expressed as DIRMs-2 {R 2 : f x s M and x 2 s M 2 then y 2 s w 2 } n and output for fuzzy nference system are shown as follows: µ ll2 M l (x l )M l2 (x l 2 ) (8) y l l 2 y µll2 µll2 l l 2 Z 2 m where Z 2 m Z m Z m, and l < l 2 w ll2 (9) h ll 2 y l l 2 (2) Each parameter for the obectve functon E s updated as follow: h ll 2 (y y r )y l l 2 (2) w ll2 c ll2 b ll2 where γ (wl l 2 parameters µ ll2 h ll 2 µll2 (y y r ) (22) h ll 2 (y y r ) γ x c ll2 (23) (b ll2 ) 2 h ll 2 (y y r ) γ (x c ll2 ) 2 (24) (b ll2 ) 3 y l l 2 ) µl l 2, and h ll 2, w ll2, c ll2 and b ll2 are DIRMs-l l 2 {R ll2 : f x l s M l DIRMs-m, m {R m,m where l < l 2 and x l2 s M l2 then y ll 2 s w ll2 } n : f x m s M m and x m s M m then y m,m s w m,m } n In ths case, a membershp value, output for the l l 2 -th rule Fgure 2 The block dagrams of three types of models for m 3 Fgure 2 shows the relaton among conventonal, SIRMs and DIRMs models for m 3 Note that each order of the numbers of rules for three models s O(h m ), O(mh) and O(m 2 h 2 ), respectvely, where h denotes the number of Publshed by Scedu Press 57
4 Artfcal Intellgence Research 26, Vol 5, No 2 parttons n a membershp functon Further, the numbers of parameters for them are (2m + )hm, (3h + )m and (5h2 + )m C2, respectvely Learnng methods for SIRMs and DIRMs models are shown as the same methods as Fgure µ y y M (z ) Pn µ w P n µ l X (26) (27) h y (28) where h for Zl s the weght for the -th module Then, the followng relaton hold: Fgure 3 The proposed model: Input x s transformed nto ntermedate z by the matrx A and SIRMs model wth varable z s formed h µ h Pn w c b Further, ak (y y r )y (29) (y y r ) (3) (w y )µ z c (y y r )h Pn (b )2 µ (3) (w y )µ (z c )2 (y y r )h Pn (32) (b )3 µ µ ak s computed as follows: h (y r y ) Pn n X µ µ (w y ) z c (b )2 (33) Fgure 4 The flowchart of the proposed learnng algorthm The flowchart for learnng algorthm of the proposed model s shown n Fgure 4 4 P ROPOSED FUZZY INFERENCE MODEL The proposed model s shown n Fgure 3[5, 6] The model conssts of two stages The frst stage performs a lnear transformaton (LT) A from nput x nto ntermedate varables z (z,, zl )T as follows: z a z a zl al ak am ak am alk alm x xk (25) xm where A (ak ) for Zl and k Zm {} and z Pm k ak xk for x The second stage s performed by SIRMs model wth z,, zl The output y s calculated as follows: 58 Fgure 5 A schematc explanaton of the proposed model: Three lnes mean the centers of three membershp functons Two nput of (; ) and (; ) are nearly on Lne 2, where and mean output and, respectvely ISSN E-ISSN
5 Artfcal Intellgence Research 26, Vol 5, No 2 In ths case, let θ and Tmax be the threshold for nference problem n the condton or the result s over 25 The MSE error and the maxmum number of learnng tme value s the average value from ten trals In Table, MSE means that the correct output s obtaned for any nput We wll determne the number of ntermedate varables l case, and MSE 25 mean that the correct output s not accordng to the threshold of nference error θ and the maxobtaned for ust 25% nput cases Therefore, the SIRMs mum number of learnng tme Tmax Note that the number model and the DIRMs one for m 3 cannot mplement the of parameters for the proposed model s (m + 3h + 2)l EX-OR problem On the other hand, the proposed model can mplement the EX-OR problem for any m Table The smulaton result for EX-OR problem wth m nput varables m 2 25 The conventonal SIRMs DIRMs The proposed (l m) Fgure 6 Smulaton on obstacle avodance, where r and θ are the dstance and the angle between the agent and the obstacle, and r2 and θ2 are the dstance and the angle between the agent and the destnaton In the followng, the dea of the proposed model s explaned Let us consder the followng fuzzy nference system for l and n 3 obtaned by learnng z 7 5x 64x2 h 93 (35) 5 N UMERICAL SIMULATIONS In ths secton, the effectveness of the proposed model s n R : f z s M then y s 6, vestgated for EX-OR, classfcaton and obstacle avodance SIRM s R : f z s M2 then y s 37, 2 problems R3 : f z s M3 then y s 6, 5 The EX-OR problems The EX-OR problem wth m nput varables s defned by the followng equaton z x x2 xm (34) M M2 M3 (z + )2 exp 2 (z 5)2 exp (z )2 exp 2 (36) (37) (38) where x,, xm, z {, } and s the Exclusve OR operator[2] Let Kc, Kb, Kw, Kh, Ka and Tmax n numercal smulatons be the learnng rate of c, b, w, h and ak and the maxmum number of learnng tme, respectvely Further, ak means each element of the matrx A (See Eq(25)) In ths smulaton, Kc, Kb, Kw 5, Kh 5, Ka and h 3 are used Further, Tmax 5,, 2 and 5 are set for the conventonal SIRMs, DIRMs and proposed methods, respectvely Furthermore, ntal parameters c, b, w, h and ak are as follows: c s set to equal ntervals Fgure 7 Learnng data for smulaton 2h (the doman of nput), and w, h and ak are randomly selected from domans [, ], [, ] and [, ], respectvely The smulaton result s shown n Table, where In Fgure 5, three lnes of Lnes, 2, and 3 mean the centers the symbol - means that t s mpossble to smulate the of three membershp functons for Eqs(36), (37) and (38), Publshed by Scedu Press 59
6 respectvely As two nput of (,) and (,) are nearly on Lne 2, the output s about Further, output of (,) and (,) for Lnes and 3 nearly equal to Therefore, output for (,) and (,) obtaned from all rules nearly equals to Lkewse, we can consder about the cases of (,) and (,) On the other hand, we have already shown that EX-OR problem wth two varables cannot be mplemented by any SIRMs model [6] 52 Classfcaton problems 53 Obstacle avodance problem As an applcaton to control problems, let us show smulatons of an obstacle avodance problem used n the prevous paper [4] See t for the detaled explanaton of the smulatons [4] Untl now, we have already performed some smulatons by the conventonal, SIRMs and DIRMs models As a result, the conventonal and DIRMs models were successful n learnng and test smulatons [4] We wll show that the proposed model s successful wth a small number of parameters For classfcaton problems, the benchmark datasets Irs, Wne, Sonar and BCW from UCI database are used [8] The numbers of data, varables and classes are 5, 4 and 3 for Irs, 78, 3 and 3 for Wne, 28, 6 and 2 for Sonar and 683, 9 and 2 for BCW, respectvely In order to evaluate the model, 5-fold cross-valdaton s used As the ntal condton, K c, K b, K w 5, K h 5, K a, h 3 and T max 5 are used Further, the ntal value of c, b, w, h and a k are as follows: c s set to equal ntervals 2h (the doman of nput), and b, w, h and a k are randomly selected from domans [, ], [, ] and [, ], respectvely Table 2 shows the smulaton result for the classfcaton problems In each box, two numbers from the top show msclassfcaton rate for tranng and test data sets, respectvely, and the bottom number shows the number of parameters The smulaton result s obtaned as the average value from twenty trals Table 2 The smulaton result for classfcaton problems The conventonal SIRMs DIRMs The proposed Irs Wne Sonar BCW 4 55 (729) 2 52 (4) 57 (276) 29 3 (45) (3) 92 (3588) 37 (72) 24 3 (6) - 25 (23) (9) 65 (656) 6 36 (6) In Table 2, the symbol - means that t s mpossble to smulate the problem Table 2 shows that the proposed method s superor to SIRMs and DIRMs models n terms of accuracy and the proposed one s superor to the conventonal model n terms of the number of parameters Fgure 8 Smulaton result for Test As shown n Fgure 6, four parameters are selected as nput varables The problem s to construct a fuzzy system by whch the moble agent avods the obstacle and arrves at the destnaton The moble agent moves wth the vector A (A x, A y ) at each step, where A x s constant and A y s only adusted as an output from the fuzzy system The learnng data wth 2 ponts are obtaned from an examnee Usng the learnng data, fuzzy nference rules are constructed for SIRMs and the proposed models As smulaton 6 ISSN E-ISSN
7 condtons for SIRMs and proposed models, K c, K b, K w 5, K h 5, K a 5, h 3 and T max 5 are selected Intal values for c and b are set to equal ntervals and 2(h ) (the doman of nput), respectvely Intal values for w, h and a k are selected randomly from [, ], [, ] and [, ], respectvely For h 3, the number of parameters of SIRMs s 4 and that of proposed model s 3, respectvely In the smulatons, only when the agent reaches the destnaton unless colldng wth the obstacle, the tral s regarded as a successful one Otherwse, the tral s regarded as a unsuccessful (faled) one There are two types of evaluatons: learnng and test For the learnng evaluaton, the postons of the agent s startng pont, the obstacle and the destnaton are same as the ones of learnng data In the learnng evaluaton, SIRMs fals n the trals but the proposed model s successful For the test evaluaton, one or more of the three postons are dfferent from the ones of learnng data The followng four types of test evaluatons are consdered n the smulatons () Test uses some dfferent agent s startng ponts (see Fgure 8) Fgure 8 shows the movements of the agent from startng ponts (, ), (, 2),, (, 8), (, 9) after learnng The test evaluaton result s shown n Fgure 8 Lke the learnng evaluaton, SIRMs fals n the trals but the proposed model s successful (2) Test 2 assumes the scenaro where the moble agent avods the obstacle placed at a dfferent place and arrves at the dfferent destnaton The proposed model s appled for the obstacle at (4, 4) and the destnaton (, 6) Every tral s successful as shown n Fgure 9 (3) Test 3 assumes the scenaro where the obstacle moves wth the fxed speed As shown n Fgure, every tral s successful Fgure Smulaton result for Test 3 Fgure The movement of the moble obstacle for Test 4 Fgure 2 Smulaton result for Test 4 Fgure 9 Smulaton result for Test 2 (4) Test 4 assumes the scenaro where the obstacle moves randomly wth a random vector B as shown n Fgure, where B s constant and the angle θ b changes randomly at each step As shown n Fgure 2, the proposed model s successful for every tral Publshed by Scedu Press 6
8 In Ref, [4] we have already shown that the smulatons are successful by DIRMs model n almost the same condton In ths paper, t s shown that they are successful by the proposed model wth half of the parameters compared to DIRMs model Lastly, we consder the nterpretaton for fuzzy rules of the proposed model Let us consder fuzzy rules of Table 3 obtaned by learnng Assume that there are three attrbutes small, mddle and large for r, r 2, θ and θ 2, and that there are two attrbutes left (A y > ) and rght (A y < ) for the drecton of A y From ths result, we can obtan the followng fuzzy rules: Z : (r s small) or (θ s large) or (r 2 s large) or (θ 2 s small) A : If Z s small then move to the rght A 2 : If Z s mddle then move to the rght A 3 : If Z s large then move to the left Z 2 : (r s large) or (θ s small) or (r 2 s small) or (θ 2 s large) A 2 : If Z 2 s small then move to the left A 22 : If Z 2 s mddle then move to the left A 23 : If Z 2 s large then move to the rght Let us consder the behavor for two cases on the places of obect (I) The case that the moble agent approaches to the obstacle: In ths case, r s small and r 2 s large are vald () If θ s large, the moble agent move to the left based on A 3 () If θ s not so large, the moble agent move to the rght based on A or A 2 Lkewse, we can also explan about the rule of Z 2 (II) The case that the moble agent approaches to the destnaton: In ths case, r s large and r 2 s small are vald () If θ 2 s large, the moble agent move to the rght based on A 23 () If θ 2 s not so large, the moble agent move to the left based on A 2 or A 22 Lkewse, we can also explan about the rule of Z That s, t s shown that the moble agent moves away from the obstacle when the moble agent approaches to the obstacle and moble agent moves to the drecton of the destnaton when the moble agent approaches to the destnaton 6 CONCLUSIONS In prevous papers, we proposed the SIRMs model wth LT of nput varables In ths paper, we showed the effectveness of the proposed method for system dentfcatons In the second smulaton of classfcaton problems, well-known benchmark datasets Irs, Wne, Sonar and BCW are used Accordng to the smulaton result, t s dffcult for the conventonal model to mplement classfcaton problems wth large number of parameters such as Wne, Sonar and BCW However, the proposed model can mplement them whle keepng hgh accuracy Further, as one of control problems, the smulaton of obstacle avodance problem s performed The smulaton result shows that the proposed model outperforms conventonal models n terms of accuracy and the number of parameters In our future work, we wll consder to refne the proposed model REFERENCES [] Kosko B Neural Networks and Fuzzy Systems: A Dynamcal Systems Approach to Machne Intellgence, Prentce Hall, Englewood Clffs, NJ 992 [2] Gupta MM, Jn L, Homma N Statc and Dynamc Neural Networks IEEE Press 23 [3] Casllas J, Cordon O, Herrera F, et al, Accuracy Improvements n Lngustc Fuzzy Modelng Studes n Fuzzness and Soft Computng 23; 29 [4] Lu B Theory and Practce of Uncertan Programmng Studes n Fuzzness and Soft Computng 29; 239 [5] Cordon O A hstorcal revew of evolutonary learnng methods for Mamdan-type fuzzy rule-based systems: Desgnng nterpretable genetc fuzzy systems Journal of Approxmate Reasonng 2; 52: [6] Arak S, Nomura H, Hayash I, et al A Fuzzy Modelng wth Iteratve Generaton Mechansm of Fuzzy Inference Rules, Journal of Japan Socety for Fuzzy Theory & Systems 992; 4(4): [7] Fukumoto S, Myama H, Kshda K, et al A Destructve Learnng Method of Fuzzy Inference Rules Proc of IEEE on Fuzzy Systems 995: [8] Kshda K, Myama H, Maeda M, et al A Self-tunng Method of Fuzzy Modelng usng Vector Quantzaton Proceedngs of FUZZ- IEEE : [9] Pedrycz W, Izakan H Cluster-Centrc Fuzzy Modelng IEEE Trans on Fuzzy Systems 24; 22(6): /TFUZZ [] Fukumoto S, Myama H Learnng Algorthms wth Regularzaton Crtera for Fuzzy Reasonng Model Journal of Innovatve Computng, Informaton and Control 26; (): [] Y J, Yubazak N, Hrota K A Proposal of SIRMs Dynamcally Connected Fuzzy Inference Model for Plural Input Fuzzy Control Fuzzy Sets and Systems 22; 25: /S65-4()35-4 [2] Shge N, Myama H, Nagamne S A Proposal of Fuzzy Inference Model Composed of Small-Number-of-Input Rule Modules Proc of 62 ISSN E-ISSN
9 Int Symp on Neural Networks: Advances n Neural Networks-Part II 29: 8-26 [3] Mke S, Myama H, Shge N, et al Fuzzy Reasonng Model wth Deleton of Rules Consstng of Small-Number-of-Input Rule Modules Journal of Japan Socety for Fuzzy Theory and Intellgent Informatcs 2: [4] Myama H, Shge N, Myama H Fuzzy Inference Systems Composed of Double-Input Rule Modules for Obstacle Avodance Problems IAENG Internatonal Journal of Computer Scence 24; 4(4): [5] Myama H, Shge N, Myama H A Proposal of SIRMs Model wth Lnear Transformaton of Input Varables Proc Jont 7th Internatonal Conference on Soft Computng and Intellgent Systems and 5th Internatonal Symposum on Advanced Intellgent Systems 24: 3-6 [6] Myama H, Shge N, Myama H SIRMs Fuzzy Inference Model wth Lnear Transformaton of Input Varables and Unversal Approxmaton Advances n Computatonal Intellgence: Proc 3th Internatonal Work Conference on Artfcal Neural Networks, Part I 25: [7] Myama H, Shge N, Myama H Some Propertes on Fuzzy Inference Systems Composed of Small Number of Input Rule Modules Advances n Fuzzy Sets and Systems 25; 2(2): [8] UCI Repostory of Machne Learnng Databases and Doman Theores Publshed by Scedu Press 63
MANY studies on self-tuning fuzzy systems[1], [2]
Proceedngs of te Internatonal MultConference of Engneers and Computer Scentsts 4 Vol I, IMECS 4, Marc - 4, 4, Hong Kong An Applcaton of Fuzz Inference Sstem Composed of Double-Input Rule Modules to Control
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 informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
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 informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationMultilayer Perceptrons and Backpropagation. Perceptrons. Recap: Perceptrons. Informatics 1 CG: Lecture 6. Mirella Lapata
Multlayer Perceptrons and Informatcs CG: Lecture 6 Mrella Lapata School of Informatcs Unversty of Ednburgh mlap@nf.ed.ac.uk Readng: Kevn Gurney s Introducton to Neural Networks, Chapters 5 6.5 January,
More informationMultilayer Perceptron (MLP)
Multlayer Perceptron (MLP) Seungjn Cho Department of Computer Scence and Engneerng Pohang Unversty of Scence and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjn@postech.ac.kr 1 / 20 Outlne
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationThe Chaotic Robot Prediction by Neuro Fuzzy Algorithm (2) = θ (3) = ω. Asin. A v. Mana Tarjoman, Shaghayegh Zarei
The Chaotc Robot Predcton by Neuro Fuzzy Algorthm Mana Tarjoman, Shaghayegh Zare Abstract In ths paper an applcaton of the adaptve neurofuzzy nference system has been ntroduced to predct the behavor of
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
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 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 informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
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 informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationCOEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN
Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
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 informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
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 informationLinear Classification, SVMs and Nearest Neighbors
1 CSE 473 Lecture 25 (Chapter 18) Lnear Classfcaton, SVMs and Nearest Neghbors CSE AI faculty + Chrs Bshop, Dan Klen, Stuart Russell, Andrew Moore Motvaton: Face Detecton How do we buld a classfer to dstngush
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
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 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 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 informationMultiple Sound Source Location in 3D Space with a Synchronized Neural System
Multple Sound Source Locaton n D Space wth a Synchronzed Neural System Yum Takzawa and Atsush Fukasawa Insttute of Statstcal Mathematcs Research Organzaton of Informaton and Systems 0- Mdor-cho, Tachkawa,
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
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 informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationDetermining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application
7 Determnng Transmsson Losses Penalty Factor Usng Adaptve Neuro Fuzzy Inference System (ANFIS) For Economc Dspatch Applcaton Rony Seto Wbowo Maurdh Hery Purnomo Dod Prastanto Electrcal Engneerng Department,
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 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 informationApplication research on rough set -neural network in the fault diagnosis system of ball mill
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(4):834-838 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Applcaton research on rough set -neural network n the
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 informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationA Neuro-Fuzzy System on System Modeling and Its. Application on Character Recognition
A Neuro-Fuzzy System on System Modelng and Its Applcaton on Character Recognton C. J. Chen 1, S. M. Yang 2, Z. C. Wang 3 1 Department of Avaton Servce Management Alethea Unversty Tawan, ROC 2,3 Department
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
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 informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationThe Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites
7 Asa-Pacfc Engneerng Technology Conference (APETC 7) ISBN: 978--6595-443- The Two-scale Fnte Element Errors Analyss for One Class of Thermoelastc Problem n Perodc Compostes Xaoun Deng Mngxang Deng ABSTRACT
More informationRadial-Basis Function Networks
Radal-Bass uncton Networs v.0 March 00 Mchel Verleysen Radal-Bass uncton Networs - Radal-Bass uncton Networs p Orgn: Cover s theorem p Interpolaton problem p Regularzaton theory p Generalzed RBN p Unversal
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationWavelet chaotic neural networks and their application to continuous function optimization
Vol., No.3, 04-09 (009) do:0.436/ns.009.307 Natural Scence Wavelet chaotc neural networks and ther applcaton to contnuous functon optmzaton Ja-Ha Zhang, Yao-Qun Xu College of Electrcal and Automatc Engneerng,
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationA MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS
Journal of Mathematcs and Statstcs 9 (1): 4-8, 1 ISSN 1549-644 1 Scence Publcatons do:1.844/jmssp.1.4.8 Publshed Onlne 9 (1) 1 (http://www.thescpub.com/jmss.toc) A MODIFIED METHOD FOR SOLVING SYSTEM OF
More informationNeural networks. Nuno Vasconcelos ECE Department, UCSD
Neural networs Nuno Vasconcelos ECE Department, UCSD Classfcaton a classfcaton problem has two types of varables e.g. X - vector of observatons (features) n the world Y - state (class) of the world x X
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 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 informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
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 informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationRBF Neural Network Model Training by Unscented Kalman Filter and Its Application in Mechanical Fault Diagnosis
Appled Mechancs and Materals Submtted: 24-6-2 ISSN: 662-7482, Vols. 62-65, pp 2383-2386 Accepted: 24-6- do:.428/www.scentfc.net/amm.62-65.2383 Onlne: 24-8- 24 rans ech Publcatons, Swtzerland RBF Neural
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
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 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 informationSOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More informationCOMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD
COMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD Ákos Jósef Lengyel, István Ecsed Assstant Lecturer, Professor of Mechancs, Insttute of Appled Mechancs, Unversty of Mskolc, Mskolc-Egyetemváros,
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 informationHeuristic Algorithm for Finding Sensitivity Analysis in Interval Solid Transportation Problems
Internatonal Journal of Innovatve Research n Advanced Engneerng (IJIRAE) ISSN: 349-63 Volume Issue 6 (July 04) http://rae.com Heurstc Algorm for Fndng Senstvty Analyss n Interval Sold Transportaton Problems
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 informationA 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 informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationNeural Networks & Learning
Neural Netorks & Learnng. Introducton The basc prelmnares nvolved n the Artfcal Neural Netorks (ANN) are descrbed n secton. An Artfcal Neural Netorks (ANN) s an nformaton-processng paradgm that nspred
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
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 informationSupport Vector Machines
CS 2750: Machne Learnng Support Vector Machnes Prof. Adrana Kovashka Unversty of Pttsburgh February 17, 2016 Announcement Homework 2 deadlne s now 2/29 We ll have covered everythng you need today or at
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationmodeling of equilibrium and dynamic multi-component adsorption in a two-layered fixed bed for purification of hydrogen from methane reforming products
modelng of equlbrum and dynamc mult-component adsorpton n a two-layered fxed bed for purfcaton of hydrogen from methane reformng products Mohammad A. Ebrahm, Mahmood R. G. Arsalan, Shohreh Fatem * Laboratory
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationAn adaptive SMC scheme for ABC. Bayesian Computation (ABC)
An adaptve SMC scheme for Approxmate Bayesan Computaton (ABC) (ont work wth Prof. Mke West) Department of Statstcal Scence - Duke Unversty Aprl/2011 Approxmate Bayesan Computaton (ABC) Problems n whch
More informationAP Physics 1 & 2 Summer Assignment
AP Physcs 1 & 2 Summer Assgnment AP Physcs 1 requres an exceptonal profcency n algebra, trgonometry, and geometry. It was desgned by a select group of college professors and hgh school scence teachers
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationLeast squares cubic splines without B-splines S.K. Lucas
Least squares cubc splnes wthout B-splnes S.K. Lucas School of Mathematcs and Statstcs, Unversty of South Australa, Mawson Lakes SA 595 e-mal: stephen.lucas@unsa.edu.au Submtted to the Gazette of the Australan
More informationRegularized Discriminant Analysis for Face Recognition
1 Regularzed Dscrmnant Analyss for Face Recognton Itz Pma, Mayer Aladem Department of Electrcal and Computer Engneerng, Ben-Guron Unversty of the Negev P.O.Box 653, Beer-Sheva, 845, Israel. Abstract Ths
More informationGA-Based Fuzzy Kalman Filter for Tracking the Maneuvering Target Sun Young Noh*, Bum Jik Lee *, Young Hoon Joo **, and Jin Bae Park *
ICCAS005 June -5, KINEX, Gyeongg-Do, Korea GA-Based uzzy Kalman lter for rackng the aneuverng arget Sun Young Noh*, Bum Jk Lee *, Young Hoon Joo **, and Jn Bae Park * * Department of Electrcal and Electronc
More information6 Supplementary Materials
6 Supplementar Materals 61 Proof of Theorem 31 Proof Let m Xt z 1:T : l m Xt X,z 1:t Wethenhave mxt z1:t ˆm HX Xt z 1:T mxt z1:t m HX Xt z 1:T + mxt z 1:T HX We consder each of the two terms n equaton
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 informationHidden Markov Models
CM229S: Machne Learnng for Bonformatcs Lecture 12-05/05/2016 Hdden Markov Models Lecturer: Srram Sankararaman Scrbe: Akshay Dattatray Shnde Edted by: TBD 1 Introducton For a drected graph G we can wrte
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationModule 14: THE INTEGRAL Exploring Calculus
Module 14: THE INTEGRAL Explorng Calculus Part I Approxmatons and the Defnte Integral It was known n the 1600s before the calculus was developed that the area of an rregularly shaped regon could be approxmated
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More information