Research Article Intuitionistic Fuzzy Time Series Forecasting Model Based on Intuitionistic Fuzzy Reasoning

Size: px
Start display at page:

Download "Research Article Intuitionistic Fuzzy Time Series Forecasting Model Based on Intuitionistic Fuzzy Reasoning"

Transcription

1 Mathematical Problems i Egieerig Volume 2016, Article ID , 12 pages Research Article Ituitioistic Fuzzy Time Series Forecastig Model Based o Ituitioistic Fuzzy Reasoig Ya a Wag, Yigjie Lei, Xiaoshi Fa, ad Yi Wag Air ad Missile Defese College, Air Force Egieerig Uiversity, Xi a , Chia Correspodece should be addressed to Ya a Wag; wy @163.com Received 30 Jue 2015; Revised 10 October 2015; Accepted 20 October 2015 Academic Editor: Reik Doer Copyright 2016 Ya a Wag et al. This is a ope access article distributed uder the Creative Commos Attributio Licese, which permits urestricted use, distributio, ad reproductio i ay medium, provided the origial work is properly cited. Fuzzy sets theory caot describe the data comprehesively, which has greatly limited the objectivity of fuzzy time series i ucertai data forecastig. I this regard, a ituitioistic fuzzy time series forecastig model is built. I the ew model, a fuzzy clusterig algorithm is used to divide the uiverse of discourse ito uequal itervals, ad a more objective techique for ascertaiig the membership fuctio ad omembership fuctio of the ituitioistic fuzzy set is proposed. O these bases, forecast rules based o ituitioistic fuzzy approximate reasoig are established. At last, cotrast experimets o the erollmets of the Uiversity of Alabama ad the Taiwa Stock Exchage Capitalizatio Weighted Stock Idex are carried out. The results show that the ew model has a clear advatage of improvig the forecast accuracy. 1. Itroductio Time series forecastig theory plays a importat role i the fields of ecoomy, society, ad ature. However, covetioal forecastigmethodsar ybasedostatisticalaalysis, such as ARMA ad ARIMA. These methods have two drawbacks: firstly, they eed lots of historical data meetig certai coditios; secodly, they caot hadle liguistic values or imprecise data. Therefore, Sog ad Chissom [1 3] proposed the fuzzy time series (FTS) forecastig model which could effectively maage fuzzy iformatio with the combiatio of fuzzy sets ad fuzzy logic. The basic idea of FTS is that historical data are expressed as fuzzy sets ad series variatio treds are expressed as fuzzy relatios. Data are forecasted by fuzzy reasoig while there are ot eough historical data or just some imprecise data. The FTS theory has aroused wide cocers sice its first appearace, ad lots of excellet works have bee doe i the past twety years. Sog et al. [4] built a fuzzy stochastic fuzzy time series model focusig o a special kid of fuzzy historicaldatawhoseprobabilitiesarealsofuzzysets.hwagetal. [5] used the variatios of historical data istead of the data themselves to build a time-variat FTS model. This model is quite differet from Sog ad Chissom s oe, but it got a more accurate result. Cheg et al. [6] used the probabilities of fuzzy relatios to costruct a weighted 0-1 matrix for forecastig, which is simpler to calculate tha previous models. Aladag adcoworkers[7,8]usedaoptimizatioalgorithmad artificial eural etworks to build a few high-order models, which were obviously superior to first-order models. Sigh ad Borah [9] developed the model of referece [6] by usig the importace of fuzzy relatios as their weights. Accordig to this chage, they also proposed a ew defuzzificatio method. Huarg [10] discussed the effects of differet legths of itervals to forecast accuracy at the first time ad put forward distributio-based legth ad average-based legth to approach this issue. Lu et al. [11, 12] itegrated the iformatio graules ad graular computig with Che s method to get better approaches for uiverse partitio. S.-M. Che ad S.-W. Che [13] classified the fuzzy relatios ito three groups: the dowtred group, equal-tred group, ad uptred group. The probabilities of three groups were used to build a two-factor secod-order model. I FTS models, thezadehfuzzyset[14]isusedtofuzzifyhistoricaldata; amely, there is oly oe attribute membership measurig the subjectio degree. This is either objective or comprehesive ad cosequetly limits the FTS models to deal with ucertai iformatio ad improve their forecast accuracy.

2 2 Mathematical Problems i Egieerig The ituitioistic fuzzy set [15] has three idicators to describe data: the membership, the omembership, ad the ituitioistic idex, which make it more objective ad careful i fuzzy iformatio descriptio. Therefore, Castillo et al. [16] combied the ituitioistic fuzzy set with time series aalysis ad put forward a ituitioistic fuzzy reasoig system for data forecastig. However, the mai structure was just a weighted average of two subreasoig systems based o membership ad omembership fuctios. Joshi ad Kumar [17] built the first ituitioistic fuzzy time series (IFTS) forecastig model based o the FTS model, but there is a drawback i the costructio of ituitioistic fuzzy set: the ituitioistic idex is 0.2 all the time. Zheg et al. [18, 19] used the ituitioistic fuzzy c-meas clusterig algorithm to get uequal itervals of the uiverse of discourse, ad they also used the trace-back mechaism ad vector quatizatio to forecast. Their models effectively advaced the forecast results, but how to trasform the historical data ito a suitable form for the ituitioistic fuzzy c-meas clusterig algorithm is still a urget problem. The itroductio of ituitioistic fuzzy sets dramatically exteds the ability for time series to hadle with ucertai ad imprecise data. It also sets a ew research directio for FTS. However, the study o IFTS theory is just gettig started. There are oly a few academic achievemets, ad there is a lack of uificatio ad theoretical depth; the forecast accuracy eeds further improvemet as well. I view of the above problems, we propose a IFTS model with modificatios i three aspects: uiverse partitio, ituitioistic fuzzy set costructio, ad forecast rules establishmet.thepaperisorgaizedasfollows:sectio2briefly reviews some cocepts o ituitioistic fuzzy sets ad ituitioistic fuzzy time series. Sectio 3 details how to establish the ovel IFTS model i four steps. I Sectio 4, several existigmodelsaswellastheproposedmodelareusedtoperform profoud experimets ad validate the effectiveess of the proposed model. Fially, Sectio 5 gives some coclusios. 2. Basic Cocepts I this sectio, some basic defiitios of ituitioistic fuzzy set ad IFTS are preseted. Defiitio 1. Let X be a fiite uiversal set. A ituitioistic fuzzy set A i X is a object havig the form A = { x, μ A (x),γ A (x) x X}, (1) where the fuctio μ A (x) : X [0, 1] defies the degree of membership ad the fuctio γ A (x) : X [0, 1] defies the degree of omembership of the elemet x Xto set A.For every x X, 0 μ A (x)+γ A (x) 1. π A (x) = 1 μ A (x) γ A (x) is called the ituitioistic idex of x i A. It is the hesitacy of x to A. Whe X={x 1,x 2,...,x } is discrete, the ituitioistic fuzzy set A ca be oted as A= μ A (x i ),γ A (x i ) x i, x i X. (2) Defiitio 2. Let X ad Y be two fiite uiversal sets. A biary ituitioistic fuzzy relatio R from X to Y is a ituitioistic fuzzy set i the direct product space X Y: R = { (x, y), μ R (x, y), γ R (x, y) (x, y) X Y}, (3) where 0 μ A (x, y) + γ A (x, y) 1, (x, y) X Y for μ R (x,y):x Y [0,1],adγ R (x,y):x Y [0,1]. Defiitio 3. Let X(t) (t = 1,2,...),asubsetofR, be the uiverse of discourse o which ituitioistic fuzzy sets f i (t) = μ i (X(t)), γ i (X(t)) (i = 1, 2,...) are defied. F(t) = {f 1 (t), f 2 (t),...} is a collectio of f i (t) ad defies a ituitioistic fuzzy time series o X(t). Defiitio 4. Let R(t, t 1) be a ituitioistic fuzzy relatio from F(t 1) to F(t).SupposethatF(t) is caused oly by F(t 1), deoted as F (t) =F(t 1) R(t, t 1), (4) where is the ituitioistic fuzzy compositioal operator. The R(t, t 1) is called a first-order ituitioistic fuzzy logical relatioship of F(t). Defiitio 5. If R(t, t 1) is idepedet of time t, R (t, t 1) =R(t 1,t 2) t, (5) the F(t) is called a time-ivariat ituitioistic fuzzy time series. Otherwise, F(t) is called a time-variat ituitioistic fuzzy time series. The IFTS model studied i this paper is first order ad time-ivariat. 3. The Novel Ituitioistic Fuzzy Time Series Forecastig Model The IFTS model ca be summarized i four steps as the FTS model: (1)Defieadpartitiotheuiverseofdiscourse. (2) Costruct ituitioistic fuzzy set ad ituitioistically fuzzify the historical data. (3) Establish forecast rules ad get the forecasted value. (4) Defuzzify ad output the forecast result. The rest of this sectio will detail the proposed IFTS model followig this procedure Uequal Uiverse Partitio Based o Fuzzy Clusterig. First of all, the uiverse of discourse U=[x mi ε 1,x max +ε 2 ] should be defied, where x mi ad x max are the miimum ad maximum historical data, respectively. ε 1 ad ε 2 are two proper positive umbers. Usually, for simplicity, ε 1 ad ε 2 are chose to roud dow x mi ad roud up x max to two proper itegers. Secodly, partitio the uiverse U ito several itervals. Refereces [21 23] proved that uequal itervals do ot oly

3 Mathematical Problems i Egieerig 3 have actual meaigs for regular uderstadig but also lead to a better outcome tha equal oes. Some researchers [22, 24, 25] have already made achievemets i this step byadoptigmethodssuchasgeeticalgorithms,particle swarm optimizatio, ad fuzzy c-meas clusterig algorithm. Butthesekidsofmethodsusuallyeedahugeamoutof historical data to get a good performace, which deviates from the small database of historical iformatio of IFTS. What is more, i practice, the IFTS model is geerally used for problems which have ot too may historical data such as i ecoomic ad evirometal forecastig. So i this paper, we decide to use a more coveiet ad real-time method to solve this problem [26]. Let X={x 1,x 2,...,x } be the uiverse of objects to be classified, where x j =(x j1,x j2,...,x jm ) (j = 1,2,...,)has m characteristics. Let R =(r jk ) be the similarity matrix of X, wherer jk is the similarity betwee x j ad x k (j, k = 1,2,...,). A maximum spaig tree is a tree with all x j beig the vertices ad r jk beig the weights of every edge. Let λ [0,1]be the clusterig threshold. Cuttig dow the edges whoseweightsaresmallerthaλ, wecagetafewsubtrees. Hece, the vertices of differet subtrees make up differet groups. The mai steps are as follows. Step 1. Stadardize historical data. Sice the elemets of fuzzy matrix should be i [0, 1], data i differet dimesios should be trasformed ito the iterval [0, 1] to meet the requiremet of similarity matrix R [26]. Geerally, two kids of trasformatio are required. (1) Stadard deviatio trasformatio is as follows: x jh = x jh x h s h, (6) where x h =(1/) j=1 x jh ad s h = (1/) j=1 (x jh x h ) 2, j = 1,2,...,, h = 1,2,...,m. With this trasformatio, themeaofeveryvariablebecomes0,thestadarddeviatio becomes 1, ad the dimesioal differeces are elimiated. But it caot esure that x jh will locate i [0, 1]. (2) Rage trasformatio is as follows: x jh = x jh mi 1 j {x jh } max 1 j {x jh } mi 1 j {x jh }, (7) where, obviously, 0 x jh 1. Step 2. Establish the fuzzy similarity matrix R. Let r jk be the similarity betwee x j ad x k ;thewewill have a fuzzy similarity matrix R =(r jk ). There are differet ways to get r jk. Sice the Euclidea distace is widely used i similarity matrix establishmet [26], we also choose it to calculate r jk : r jk =1 d(x m j,x k )=1 h=1 (x jh x kh )2. (8) Step 3. Buildamaximumspaigtreeadclassifyhistorical data. I this step, the Kruskal algorithm [26] is used to build the maximum spaig tree. Firstly, draw every vertex x j. Secodly, draw the edges by the value of their weights r jk i descedig order, util all of the vertices are coected but with o circles. At last, cut dow the edges with smaller weights tha the threshold λ.the vertices of each coected brach make up a group. Step 4. Calculate the best λ. The value of λ varies from 0 to 1, ad the best λ leads to thebestclassificatio.sohowtogetthebestλ is a importat step. I this paper, we also use a widely used F-statistic to fid the best λ: F= r i m h=1 (x ih x h ) 2 / (r 1) r i j=1 m h=1 (x jh x ih ) 2 / ( r) F(r 1, r), where r istheumberofgroupsforagiveλ, i is the umber of objects i group i (i = 1,2,...,r), x ih = (1/) i j=1 x jh is the average of the hth (h = 1,2,...,m) characteristic of the objects i group i,adx h is the hth characteristic of all objects. I (9), the umerator represets the distaces betwee groups, ad the deomiator represets the distaces withi groups. So the bigger F is, the better the classificatio we get. For a give cofidece level α, weca fid several values of F which are larger tha F α.theλwhich leads to the largest F is the best λ, ad the correspodig classificatio is the best as well. The best classificatio ca be oted as {x 1 1,x2 1,...,x 1 1 },...,{x1 i 1,x2 i 1,...,x i 1 i 1 }, {x 1 i,x2 i,...,x i i },{x 1 i+1,x2 i+1,...,x i+1 i+1 },..., {x 1 r,x2 r,...,x r r }, (9) (10) where i = 1,2,...,r, x i 1 i 1 x1 i, x1 i x 2 i x i i,ad x i i x 1 i+1. Let x mi ε 1, i = 0 { d i = x i i +x 1 i+1, { 2,2,...,r 1 { x max +ε 2, i = r. (11) Therefore, we partitio the uiverse U ito r uequal itervals: u 1 =[d 0,d 1 ], u 2 =[d 1,d 2 ],...,adu r =[d r 1,d r ] Costructio of Ituitioistic Fuzzy Sets. Correspodig to the above r itervals, we defie r ituitioistic fuzzy sets represetig r liguistic values: A i ={ x,μ Ai (x),γ Ai (x) x X},,2,...,r. (12)

4 4 Mathematical Problems i Egieerig Costructig their membership fuctios ad omembership fuctios is the key poit i this sectio. Sice the ituitioistic fuzzy set has a special characteristic, ituitioistic idex, the desig of membership fuctio ad omembership fuctio has bee quite comprehesive. However, existig methods based o fuzzy statistics, trichotomy, or biary compariso sequecig usually set the ituitioistic idex to a fixed value, which does ot take full advatage of the ituitioistic fuzzy set [27]. Therefore, accordig to the characteristics of IFTS itervals, a more objective method is proposed i this sectio. First of all, two rules based o objective aalysis are as follows: (1) Whe x is located i the middle of a iterval, amely, x=(d i 1 +d i )/2, we defie that μ Ai ((d i 1 +d i )/2) = 1 ad γ Ai ((d i 1 +d i )/2) = 0. (2) Whe x is located o the boudaries of a iterval, amely, x = d i, we defie that ituitioistic idex has the maximum value ad μ Ai (d i ) = γ Ai (d i ).Let π Ai (d i )=α(0 α 1);thewecagetμ Ai (d i )= γ Ai (d i ) = (1 α)/2. The, i view of above rules, the membership fuctio is defied as a Gaussia fuctio: μ Ai = exp ( (x c μi) 2 ). (13) 2σ 2 μi The omembership fuctio is a trasformatio of Gaussia fuctio: γ Ai (x) =1 exp ( (x c γi) 2 ). (14) 2σ 2 γi Hece, the ituitioistic idex fuctio reads π Ai (x) =1 μ Ai (x) γ Ai (x), (15) where i = 1,2,...,r ad c μi, σ μi, c γi,adσ γi are importat fuctio parameters. The calculatios of them are based o the above two rules: c μi =c γi = d i 1 +d i, 2 σ 2 μi = (d i 1 c μi ) 2 2 l ((1 α) /2), σ 2 γi = (d i c γi ) 2 2 l (1+(1 α) /2). (16) Defiitio 6. Let A be a ituitioistic fuzzy set i a fiite uiverse X.If (1) 0 μ A (x) 1, 0 γ A (x) 1, (2) 0 π A (x) 1, 0 μ A (x) + γ A (x) 1, (3) π A (x) + μ A (x) + γ A (x) = 1, the A is a ormal ituitioistic fuzzy set. Therefore, we obtai the followig theorem. Theorem 7. The membership fuctio ad omembership fuctio of A i (i = 1,2,...,r) are stadard; that is, A i is a ormal ituitioistic fuzzy set. Proof. (1) y = exp( (x c) 2 /2σ 2 ) is a Gaussia fuctio, so we have 0 exp ( (x c)2 2σ 2 ) 1, (17) 0 1 exp ( (x c)2 2σ 2 ) 1. Therefore, 0 μ Ai (x) 1, (18) 0 γ Ai (x) 1. (2) Give 0 α 1ad c μi =c γi =(d i 1 +d i )/2,wehave Hece, exp ( (x c μi) 2 2σ 2 μi exp ( (x c μi) 2 2σ 2 μi σ 2 μi σ2 γi. (19) ) exp ( (x c γi) 2 2σ 2 γi ) exp ( (x c γi) 2 2σ 2 γi ), ) 0. (20) O the other had, sice 0 exp( (x c μi ) 2 /2σ 2 μi ) 1ad 0 exp( (x c γi ) 2 /2σ 2 γi ) 1,wehave 1 exp ( (x c μi) 2 Therefore, 2σ 2 μi 1 exp ( (x c μi) 2 That is, 0, 2σ 2 μi 0 exp ( (x c μi) σ 2 μi 0 μ Ai (x) +γ Ai (x) 1, ) exp ( (x c γi) 2 2σ 2 γi ) exp ( (x c γi) 2 2σ 2 γi ) 1. (21) ) )+1 exp ( (x c γi) 2 2σ 2 γi 0 π Ai (x) =1 μ Ai (x) γ Ai (x) 1. ) (22) (23) (3) Accordig to the calculatio of π Ai (x),itcabeeasily foud that π Ai (x) + μ Ai (x) + γ Ai (x) = 1. Thiscompletesthe proof.

5 Mathematical Problems i Egieerig 5 Theorem 7 shows that the calculatio of the membership fuctio ad omembership fuctio of the ituitioistic fuzzy set is correct ad appropriate Forecast Rules Based o Ituitioistic Fuzzy Reasoig Ituitioistic Fuzzy Multiple Modus Poes. Let A i (i = 1,2,...,) ad A be ituitioistic fuzzy sets i uiverse U ad let B i (,2,...,)ad B be ituitioistic fuzzy sets i uiverse V. The geeralized multiple modus poes based o ituitioistic fuzzy relatio [27] is that a ew propositio that y is B cabeiferredfrom+1 propositios: if x is A i,they is B i ad x is A. The reasoig model is as follows: Rules: IF x is A 1 THEN y is B 1 IF x is A 2 THEN y is B 2. IF x is A THEN y is B Iput: IF x is A Output: y is B Every rule has a correspodig iput-output relatio R i. For R i, differet operators result i differet μ R ad γ R,but the reasoig outputs are all the same. Sice it has a better performace ad is easier to calculate tha other operators [27], the Mamdai implicatio operator R c is used here: R i = (A B) ={ (x,y),μ Ri (x, y), γ Ri (x, y) (x, y) U V}, where μ Ri (x, y) = μ Ai (x) μ Bi (x), γ Ri (x, y) = γ Ai (x) γ Bi (y). (24) (25) The, accordig to the compositioal operatio of ituitioistic fuzzy rules, we get the total relatio: R= where R i ={ (x,y),μ R (x, y), γ R (x,y) (x,y) U V}, μ R (x, y) = γ R (x, y) = The reasoig output is μ Ri (x, y) = γ Ri (x, y) = (μ Ai (x) μ Bi (y)), (γ Ai (x) γ Bi (y)). (26) (27) B =A R, (28) where is defied as the maximum ad miimum operators: ad : μ B (y) = (μ A (x) μ R (x, y)), x U γ B (y) = (γ A (x) γ R (x, y)). x U (29) Forecast Rules of IFTS Model. Ispired by the ituitioistic fuzzy multiple modus poes, we exchage the positios of historical data ad ituitioistic fuzzy sets A i (i = 1,2,...,r) i the IFTS model; that is, let the historical data be ituitioistic fuzzy sets, oted as F i (j = 1,2,...,t),ad let A i be the elemets i F j, ad let μ Ai (x) ad γ Ai (x) be the membership ad omembership of A i to F j.thef j is as follows: F j = r μ Fj (x i ),γ Fj (x i ) x i, (30) where μ Fj (x i )=μ Ai (f i (t)), (31) γ Fj (x i )=γ Ai (f i (t)). Hece, we apply the ituitioistic fuzzy multiple modus poes to A i ad F j.thereasoigmodelisasfollows: Rules: IF x is F 1 THEN y is F 2 IF x is F 2 THEN y is F 3. IF x is F j THEN y is F j+1. IF x is F t 1 THEN y is F t Iput: IF x is F t Output: y is F t+1 Thereasoigoutputisasfollows: F t+1 =F t R, (32) where μ R (x, y) = γ R (x, y) = t 1 j=1 t 1 j=1 μ Rj (x, y) = γ Rj (x, y) = t 1 j=1 t 1 j=1 (μ Fj (x) μ Fj+1 (y)), (γ Fj (x) γ Fj+1 (y)). (33) So, the membership ad omembership of the output ituitioistic fuzzy set are μ F t+1 (y) = (μ Ft (x) μ R (x, y)), x U (34) γ F t+1 (y) = (γ Ft (x) γ R (x, y)). x U That is to say, the membership ad omembership of the forecasted result f t+1 (t) to every ituitioistic fuzzy set A i are μ F t+1 (y) ad γ F t+1 (y).

6 6 Mathematical Problems i Egieerig Figure 1: The maximum spaig tree of historical data Defuzzificatio Algorithm. The widely used defuzzificatio algorithms iclude the maximum truth-value algorithm, gravity algorithm, ad weighted average algorithm [27]. I this paper, we utilize the gravity algorithm, which has a more obvious ad smoother output tha others eve whe the iput has tiy chages [27]. The calculatio is as follows: C= U c(μ F (c) + (1/2) π F (c)) dc U (μ F (c) + (1/2) π F (c)) dc = U c(1+μ F (c) +γ F (c)) dc U (1 + μ F (c) +γ F (c)) dc, (35) where U is the output domai ad F is a ituitioistic fuzzy set i U. 4. Applicatios I this sectio, we focus o two umerical experimets to demostrate the performace of the proposed IFTS model. I each experimet, several existig FTS ad IFTS models are also applied o the same data set to make comparisos. The experimetal results ad associatig aalyses are show, respectively Erollmets of the Uiversity of Alabama. The erollmet of the Uiversity of Alabama has bee firstly used i Sog s paper o FTS model [2]. Sice the, this data set has bee used by most of the scholars to test their FTS or IFTS models. The detailed test process of our model is as follows. Step 1. Defie ad partitio the uiverse of discourse. The erollmets from year 1971 to 1991 are chose as historical data to forecast the erollmet of year I the historical data, x mi = ad x max = 19337, sothe uiverse of discourse is set to U = [13000, 20000]. The U is partitioed ito uequal itervals based o the fuzzy clusterig algorithm desiged i Sectio 3.1. The stepby-step details are as follows: (1) Stadardize historical data accordig to (6) ad (7). (2) Establish the fuzzy similarity matrix R as show i Table 1. (3) Use the Kruskal algorithm metioed i Sectio 3.1 to buildamaximumspaigtreebasedomatrixr.thetree is show i Figure 1. Let λ be 0.93, 0.94, 0.95, ad 0.96, respectively. We ca get differet classificatios of historical data as show i Table 2. (4) For differet classificatios, calculate the values of F accordig to (9). The results are also show i Table 2. From Table 2, we ca see that whe λ = 0.95, its correspodig F is maximum ad bigger tha F α (α = 0.05) at the same time. So this classificatio is the best. Therefore, the uiverse of discourse U is partitioed ito 9 uequal itervals accordig to the above classificatio. The boudaries of each iterval are calculated accordig to (11). The itervals are u 1 = [13000, 13309], u 2 = [13309, 14282]. u 3 = [14282, 14921], u 4 = [14921, 16186], u 5 = [16186, 16598], u 6 = [16598, 17535], u 7 = [17535, 18560], u 8 = [18560, 19149], u 9 = [19149, 20000]. (36) Step 2. Costruct ituitioistic fuzzy sets ad ituitioistically fuzzify the historical data. Correspodig to the 9 itervals, there should be 9 ituitioistic fuzzy sets A 1,A 2,...,A 9,adtheirrealistic sigificace is as follows: very very very few, very very few, very few, few, ormal, may, very may, very very may, very very very may. The calculate the parameters of the membership ad omembership fuctios based o Sectio 3.2. For α=0.4, the parameters are show i Table 3. The membership fuctio, omembership fuctio, ad ituitioistic idex fuctio of every ituitioistic fuzzy set are show i Figures 2, 3, ad 4, respectively.

7 Mathematical Problems i Egieerig 7 Table 1: The fuzzy similarity matrix R

8 8 Mathematical Problems i Egieerig Figure 2: Membership fuctios. λ Table 2: Classificatios of differet λ. Number of classificatios Classificatio F 0.05 F {1971}, {1972, 1973}, {1974}, {1979, 1980, 1987}, {1988}, {1989, 1990, 1991}, {1975, 1976, 1977, 1978, 1981, 1982, 1983, 1984, 1985, 1986} {1971}, {1972, 1973}, {1974}, {1981}, {1979, 1980, 1987}, {1988}, {1989, 1990, 1991}, {1975, 1976, 1977, 1978, 1982, 1983, 1984, 1985, 1986} {1971}, {1972, 1973}, {1974}, {1981}, {1979, 1980, 1987}, {1988}, {1989}, {1990, 1991}, {1975, 1976, 1977, 1978, 1982, 1983, 1984, 1985, 1986} {1971}, {1972}, {1973}, {1974}, {1981}, {1979, 1980, 1987}, {1988}, {1989}, {1990, 1991}, {1975, 1976, 1977, 1978, 1982, 1983, 1984, 1985, 1986} Figure 3: Nomembership fuctios Figure 4: Ituitioistic idex fuctios.

9 Mathematical Problems i Egieerig 9 TAIEX Sectio is as follows: Rules: IF x is F 1 THEN y is F 2 IF x is F 2 THEN y is F 3. IF x is F 20 THEN y is F 21 Iput: IF x is F 21 Output: y is F 22 ThewegetF 22 : Date F 22 0, 1 0, 1 0, 1 0, 1 0, 1 = A 1 A 2 A 3 A 4 A 5 Actual values Model [17] Model [13] Model [20] Model [2] Our model Figure 5: Forecast results of TAIEX , 1 0, , A 6 A 7 A , A 9, (37) The we ca calculate the membership, omembership, ad ituitioistic idex of every historical value to every ituitioistic fuzzy set. Step 3. Establish forecast rules ad forecast the erollmets. The erollmets of year 1971 to 1991 ca be deoted as F 1,F 2,...,F 21, ad the reasoig model based o where the membership of F 22 to A 8 is the biggest ad the omembership is the smallest, so the ituitioistic forecasted result is A 8. Step 4. Defuzzify ad output the forecast result. The defuzzificatio result based o Sectio 3.4 is C= U c(2+exp ( (c )2 / ( )) exp ( (c ) 2 / ( ))) dc U (2 + exp ( (c ) 2 / ( )) exp ( (c ) 2 / ( ))) dc = (38) That is to say, the erollmet of year 1992 is To test the performace of our model, we use the models ofiferece[2],[12],ad[17]aswellasourstoforecast every year s erollmet, respectively. The results are show i Table 4. The models of iferece [2, 12] are FTS models, ad the model of iferece [17] is a IFTS model. I iferece [12],therearethreekidsofuiversepartitio:7,17,ad 22 itervals. Sice there are oly 22 historical data, the 17- iterval partitio ad 22-iterval partitio are ot applicable, so we choose the 7-iterval partitio. The root mea square error (RMSE) ad average forecast error (AFE) are exploited to evaluate the performace of every model: RMSE = 1 AFE = 1 (actual value i forecast value i ) 2, actual value i forecast value i actual value i 100%. (39) The results are show i Table 5. TheresultsiTables4ad5idicatethatourmodelca ot oly reach the forecast goal but also achieve a better result tha the other tested models. That is to say, the proposed model is feasible ad efficiet Experimets o TAIEX. The Taiwa Stock Exchage Capitalizatio Weighted Stock Idex (TAIEX) is a typical ecoomic data set widely used i fuzzy time series forecastig [13, 20, 23, 25, 28, 29]. I this experimet, TAIEX values from 11/1/2004 to 12/31/2004 are used as historical data, which are show i Table 6. The ituitioistic fuzzified value of historical data whe forecasted by our model are also show i Table 6. For compariso, we also applied the models of referece [2,13,17,20]toforecastTAIEXatthesametime.Theforecast results of every model are show i Table 7 ad Figure 5. The performace of all models is compared i Table 8. Table 8 idicates that the RMSE ad MSE of proposed model are both smaller tha the other models. Therefore, our two experimets both idicate that the IFTS model proposed i this paper could effectively icrease forecast accuracy. 5. Coclusios I this paper, a ovel IFTS model is proposed for improvig the performace of FTS model. I order to be succict, we use

10 10 Mathematical Problems i Egieerig Ituitioistic fuzzy set Table 3: Fuctio parameters of A i. c μi σ μi c γi σ γi A A A A A A A A A Table 4: Forecast results of the erollmets. Year Actual Forecasted erollmet erollmet Model [2] Model [12] Model [17] Our model Table 5: Forecast performace of erollmets. Criterio Model [2] Model [12] Model [17] Our model RMSE AFE 3.35% 2.3% 2.07% 1.72% Date Table 6: Historical data of TAIEX. TAIEX Ituitioistic fuzzified value 11/1/ A 1 11/2/ A 2 11/3/ A 5 11/4/ A 5 11/5/ A 7 11/8/ A 7 11/9/ A 8 11/10/ A 8 11/11/ A 5 11/12/ A 7 11/15/ A 7 11/16/ A 7 11/17/ A 11 11/18/ A 12 11/19/ A 11 11/22/ A 5 11/23/ A 5 11/24/ A 7 11/25/ A 5 11/26/ A 3 11/29/ A 3 11/30/ A 5 12/1/ A 4 12/2/ A 5 12/3/ A 6 12/6/ A 7 12/7/ A 7 12/8/ A 6 12/9/ A 7 12/10/ A 7 12/13/ A 5 12/14/ A 7 12/15/ A 10 12/16/ A 11 12/17/ A 10 12/20/ A 9 12/21/ A 9 12/22/ A 10 12/23/ A 10 themaximumspaigtreebasedfuzzyclusterigalgorithm to partitio the uiverse of discourse ito uequal itervals. Accordig to the characteristics of partitioed data, a more objective method is proposed to ascertai membership fuctio ad omembership fuctio of the ituitioistic fuzzy set. Besides, ituitioistic fuzzy reasoig is utilized to establish forecast rules, which make the model more sesitive 12/24/ A 11 12/27/ A 9 12/28/ A 10 12/29/ A 13 12/30/ A 14 12/31/ A 15

11 Mathematical Problems i Egieerig 11 Table 7: Forecast results of TAIEX. Actual TAIEX Forecasted TAIEX Model [2] Model [20] Model [13] Model [17] Our model Table 8: Forecast performace of TAIEX. Criterio Model [2] Model [20] Model [13] Model [17] Our model RMSE AFE 0.83% 0.51% 0.65% 0.65% 0.51% to the fuzzy variatio of ucertai data. Fially, based o experimets with two data sets, the feasibility ad advatage of the ew model are verified. Coflict of Iterests The authors declare that there is o coflict of iterests regardig the publicatio of this paper. Ackowledgmet The research is sposored by Natural Sciece Foudatio of Chia (Grat o ). Refereces [1] Q. Sog ad B. S. Chissom, Fuzzy time series ad its models, Fuzzy Sets ad Systems,vol.54,o.3,pp ,1993. [2] Q. Sog ad B. S. Chissom, Forecastig erollmets with fuzzy time series part I, Fuzzy Sets ad Systems,vol.54,o.1,pp.1 9, [3] Q. Sog ad B. S. Chissom, Forecastig erollmets with fuzzy time series part II, Fuzzy Sets ad Systems, vol.62,o.1,pp. 1 8, [4] Q. Sog, R. P. Lelad, ad B. S. Chissom, Fuzzy stochastic fuzzy time series ad its models, Fuzzy Sets ad Systems, vol. 88, o. 3, pp , [5] J.-R. Hwag, S.-M. Che, ad C.-H. Lee, Hadlig forecastig problems usig fuzzy time series, Fuzzy Sets ad Systems, vol. 100, o. 1 3, pp , [6] C.-H. Cheg, Y.-S. Che, ad Y.-L. Wu, Forecastig iovatio diffusio of products usig tred-weighted fuzzy time-series model, Expert Systems with Applicatios, vol. 36, o. 2, pp , [7] C.H.Aladag,M.A.Basara,E.Egrioglu,U.Yolcu,adV.R. Uslu, Forecastig i high order fuzzy times series by usig eural etworks to defie fuzzy relatios, Expert Systems with Applicatios,vol.36,o.3,pp ,2009. [8]E.Egrioglu,C.H.Aladag,U.Yolcu,V.R.Uslu,adM.A. Basara, Fidig a optimal iterval legth i high order fuzzy time series, Expert Systems with Applicatios,vol.37,o.7,pp , [9] P. Sigh ad B. Borah, A efficiet time series forecastig model based o fuzzy time series, Egieerig Applicatios of Artificial Itelligece, vol. 26, o. 10, pp , [10] K. Huarg, Effective legths of itervals to improve forecastig i fuzzy time series, Fuzzy Sets ad Systems, vol. 123, o. 3, pp , [11] W. Lu, W. Pedrycz, X. Liu, J. Yag, ad P. Li, The modelig of time series based o fuzzy iformatio graules, Expert Systems with Applicatios,vol.41,o.8,pp ,2014. [12] W.Lu,X.Y.Che,W.Pedrycz,X.D.Liu,adJ.Yag, Usig iterval iformatio graules to improve forecastig i fuzzy

12 12 Mathematical Problems i Egieerig time series, Iteratioal Approximate Reasoig, vol. 57, o. 1, pp. 1 18, [13] S.-M. Che ad S.-W. Che, Fuzzy forecastig based o twofactors secod-order fuzzy-tred logical relatioship groups ad the probabilities of treds of fuzzy logical relatioships, IEEE Trasactios o Cyberetics, vol.45,o.3,pp , [14] L. A. Zadeh, Fuzzy sets, Iformatio ad Cotrol, vol. 8, o. 3, pp , [15] K. T. Ataassov, Ituitioistic fuzzy sets, Fuzzy Sets ad Systems,vol.20,o.1,pp.87 96,1986. [16] O.Castillo,A.Alais,M.Garcia,adH.Arias, Aituitioistic fuzzy system for time series aalysis i plat moitorig ad diagosis, Applied Soft Computig, vol.7,o.4,pp , [17] B. P. Joshi ad S. Kumar, Ituitioistic fuzzy sets based method for fuzzy time series forecastig, Cyberetics ad Systems, vol. 43,o.1,pp.34 47,2012. [18] K.-Q. Zheg, Y.-J. Lei, R. Wag, ad Y. Wag, Predictio of IFTS based o determiistic trasitio, Applied Scieces Electroics ad Iformatio Egieerig, vol.31,o. 2, pp , [19] K.-Q. Zheg, Y.-J. Lei, R. Wag, ad Y.-Q. Xig, Method of log-term IFTS forecastig based o parameter adaptatio, Systems Egieerig ad Electroics, vol.36,o.1,pp , [20] S.-M. Che, H.-P. Chu, ad T.-W. Sheu, TAIEX forecastig usig fuzzy time series ad automatically geerated weights of multiple factors, IEEE Trasactios o Systems, Ma, ad Cyberetics Part A:Systems ad Humas,vol.42,o.6,pp , [21] K. Huarg ad T. H.-K. Yu, Ratio-based legths of itervals to improve fuzzy time series forecastig, IEEE Trasactios o Systems, Ma, ad Cyberetics Part B: Cyberetics,vol.36,o. 2, pp , [22] S.-M. Che ad K. Tauwijaya, Multivariate fuzzy forecastig based o fuzzy time series ad automatic clusterig techiques, Expert Systems with Applicatios,vol.38,o.8,pp , [23] Q. Cai, D. Zhag, W. Zheg, ad S. C. Leug, A ew fuzzy time series forecastig model combied with at coloy optimizatio ad auto-regressio, Kowledge-Based Systems, vol. 74, pp , [24] Q. Cai, D. Zhag, B. Wu, ad S. C. H. Leug, A ovel stock forecastig model based o fuzzy time series ad geetic algorithm, Procedia Computer Sciece, vol. 18, pp , [25] S.-M. Che ad P.-Y. Kao, TAIEX forecastig based o fuzzy time series, particle swarm optimizatio techiques ad support vector machies, Iformatio Scieces,vol.247,pp.62 71, [26] B. S. Liag ad D. L. Cao, Fuzzy Mathematics ad Applicatios, Sciece Press, Beijig, Chia, [27] Y.J.Lei,J.Zhao,Y.L.Lu,Y.Wag,Y.Lei,adZ.H.Shi,Theories ad Applicatios of Ituitioistic Fuzzy Set, Sciece Press, Beijig, Chia, [28] K. Huarg ad T. H.-K. Yu, The applicatio of eural etworks to forecast fuzzy time series, Physica A,vol.363,o.2,pp , [29] J.-W. Liu, T.-L. Che, C.-H. Cheg, ad Y.-H. Che, Adaptiveexpectatio based multi-attribute FTS model for forecastig TAIEX, Computers ad Mathematics with Applicatios, vol. 59, o. 2, pp , 2010.

13 Advaces i Operatios Research Advaces i Decisio Scieces Applied Mathematics Algebra Probability ad Statistics The Scietific World Joural Iteratioal Differetial Equatios Submit your mauscripts at Iteratioal Advaces i Combiatorics Mathematical Physics Complex Aalysis Iteratioal Mathematics ad Mathematical Scieces Mathematical Problems i Egieerig Mathematics Discrete Mathematics Discrete Dyamics i Nature ad Society Fuctio Spaces Abstract ad Applied Aalysis Iteratioal Stochastic Aalysis Optimizatio

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship between augmented eccentric connectivity index and some other graph invariants Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats

More information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

More information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

The identification of key quality characteristics based on FAHP

The identification of key quality characteristics based on FAHP Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment Problems with fuzzy costs using Ones Assignment Method IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps

Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag

More information

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies Evaluatio of Support Vector Machie Kerels for Detectig Network Aomalies Prera Batta, Maider Sigh, Zhida Li, Qigye Dig, ad Ljiljaa Trajković Commuicatio Networks Laboratory http://www.esc.sfu.ca/~ljilja/cl/

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Fuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter

Fuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

Exponential intuitionistic fuzzy entropy measure based image edge detection.

Exponential intuitionistic fuzzy entropy measure based image edge detection. Expoetial ituitioistic fuzzy etropy measure based image edge detectio. Abdulmajeed Alsufyai 1, Hassa Badry M. El-Owy 2 1 Departmet of Computer Sciece, College of Computers ad Iformatio Techology, Taif

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

More information

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex

More information

EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL

EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL Iteratioal Joural of Iformatio Techology ad Kowledge Maagemet July-December 2012, Volume 5, No. 2, pp. 371-375 EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

HIGH-LEVEL FUZZY PETRI NETS AS A BASIS FOR MANAGING SYMBOLIC AND NUMERICAL INFORMATION

HIGH-LEVEL FUZZY PETRI NETS AS A BASIS FOR MANAGING SYMBOLIC AND NUMERICAL INFORMATION Iteratioal Joural o Artificial Itelligece Tools Vol. 9, No. 4 (2000) 569 588 fc World Scietific Publishig Compay HIGH-LEVEL FUZZY PETRI NETS AS A BASIS FOR MANAGING SYMBOLIC AND NUMERICAL INFORMATION KEVIN

More information

A New Bit Wise Technique for 3-Partitioning Algorithm

A New Bit Wise Technique for 3-Partitioning Algorithm Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai

More information

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types Data Aalysis Cocepts ad Techiques Chapter 2 1 Chapter 2: Gettig to Kow Your Data Data Objects ad Attribute Types Basic Statistical Descriptios of Data Data Visualizatio Measurig Data Similarity ad Dissimilarity

More information

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp

More information

Random Graphs and Complex Networks T

Random Graphs and Complex Networks T Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

Research on K-Means Algorithm Based on Parallel Improving and Applying

Research on K-Means Algorithm Based on Parallel Improving and Applying Sed Orders for Reprits to reprits@bethamsciece.ae 288 The Ope Cyberetics & Systemics Joural, 2015, 9, 288-294 Ope Access Research o K-Meas Algorithm Based o Parallel Improvig ad Applyig Deg Zherog 1,2,*,

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System Mappig Publishig ad Mappig Adaptatio i the Middleware of Railway Iformatio Grid ystem You Gamei, Liao Huamig, u Yuzhog Istitute of Computig Techology, Chiese Academy of cieces, Beijig 00080 gameiu@ict.ac.c

More information

Study on effective detection method for specific data of large database LI Jin-feng

Study on effective detection method for specific data of large database LI Jin-feng Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog

More information

We are IntechOpen, the first native scientific publisher of Open Access books. International authors and editors. Our authors are among the TOP 1%

We are IntechOpen, the first native scientific publisher of Open Access books. International authors and editors. Our authors are among the TOP 1% We are ItechOpe, the first ative scietific publisher of Ope Access books 3,350 108,000 1.7 M Ope access books available Iteratioal authors ad editors Dowloads Our authors are amog the 151 Coutries delivered

More information

An Image Retrieval Method Based on Hu Invariant Moment and Improved Annular Histogram

An Image Retrieval Method Based on Hu Invariant Moment and Improved Annular Histogram http://dx.doi.org/10.5755/j01.eee.0.4.6888 ELEKTROIKA IR ELEKTROTECHIKA ISS 139 115 VOL. 0 O. 4 014 A Image Retrieval Method Based o Hu Ivariat Momet ad Improved Aular Histogram F. Xiag 1 H. Yog 1 S. Dada

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

A Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna

A Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna al Joural o Recet ad Iovatio Treds i Computig ad Commuicatio ISSN: 221-8169 A Modified Multibad U Shaped ad Microcotroller Shaped Fractal Atea Shweta Goyal 1, Yogedra Kumar Katiyar 2 1 M.tech Scholar,

More information

are two specific neighboring points, F( x, y)

are two specific neighboring points, F( x, y) $33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

Text Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree

Text Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree Available olie at www.ijpe-olie.com vol. 13, o. 7, November 017, pp. 1159-1164 DOI: 10.3940/ijpe.17.07.p19.11591164 Text Feature Selectio based o Feature Dispersio Degree ad Feature Cocetratio Degree Zhifeg

More information

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas

More information

Fuzzy Linear Regression Analysis

Fuzzy Linear Regression Analysis 12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical

More information

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION

ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated

More information

On Computing the Fuzzy Weighted Average Using the KM Algorithms

On Computing the Fuzzy Weighted Average Using the KM Algorithms O Computig the Fuzzy Weighted Average Usig the KM Algorithms Feilog iu ad Jerry M Medel Sigal ad Image Processig Istitute, Departmet of Electrical Egieerig Uiversity of Souther Califoria, 3740 McClitock

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-order iterative methods free from second derivative for solving nonlinear equations Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order

More information

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based

More information

1 Enterprise Modeler

1 Enterprise Modeler 1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio

More information

Algorithms Chapter 3 Growth of Functions

Algorithms Chapter 3 Growth of Functions Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios

More information