A Dissimilarity Measure Based on Singular Value and Its Application in Incremental Discounting

Size: px
Start display at page:

Download "A Dissimilarity Measure Based on Singular Value and Its Application in Incremental Discounting"

Transcription

1 A Dssmarty Measure Based on Snguar Vaue and Its Appcaton n Incrementa Dscountng KE Xaou Department of Automaton, Unversty of Scence and Technoogy of Chna, Hefe, Chna Ema: kxu@ma.ustc.edu.cn MA Lyao Department of Automaton, Unversty of Scence and Technoogy of Chna, Hefe, Chna Ema: yma@ma.ustc.edu.cn WANG Yong Department of Automaton, Unversty of Scence and Technoogy of Chna, Hefe, Chna Ema: yongwang@ustc.edu.cn Abstract A new dssmarty measure between two basc probabty assgnments (BPA) s proposed. Wth ths method, two BPA s are represented by a two-row matrx caed BPA matrx. Aong wth a smarty matrx of foca eements to mantan the orgna reatons between foca eements, the smaest snguar vaue of the modfed BPA matrx s taken as the dssmarty measure between two BPA s. It satsfes severa basc propertes and has good behavors n ots of stuatons. Therefore ths new dssmarty measure s used n pace of the confct coeffcent n an ncrementa dscountng method so as to mprove ts performance. The ncrementa dscountng method aows us to dscount sources to dfferent eves accordng to predefned overa confcts. And a drect dscountng method can be seen as a speca case of the ncrementa one. Numerca exampes show effectveness of ths new proposed method. Keywords evdence theory; dssmarty measure; dscountng; snguar vaue; BPA matrx I. INTRODUCTION Evdence theory [1-3], beng effcent to mode and process uncertan and mprecse data, s wdey used n the fed of nformaton fuson for decson makng. In the frame of ths theory, nformaton from each source s represented as a body of evdence denoted by a beef functon or other reated functons. To aggregate severa bodes of evdence from dfferent sources, the combnaton rue pays a cruca roe. Dempster s rue of combnaton, beng assocatve and commutatve, s the most wdey used one n appcatons. However, when appyng ths rue, every body of evdence s treated euay wth the same reabty, whch s often not the case n rea appcatons. Besdes, a counterntutve resut may be generated when there s a hgh confct between two bodes of evdence as ponted out by Zadeh [4]. In the past years, ots of works on dscountng methods [5-9] have been done so as to sove the above probems. Most of these methods assume that the majorty opnon s the actua one f no pror knowedge s avaabe, and that a source wth a arge dssmarty wth others has a ow reabty and shoud be dscounted heavy. Dscountng factors are often defned as a functon of the dssmarty between bodes of evdence. Gven a set of BPA s and a certan dssmarty measure, then a set of dscountng factors coud be obtaned correspondngy. However, we can t adjust the dscountng eves accordng to dfferent reurements once the method s determned. The seuenta ncrementa dscountng method based on fasty proposed by Schubert et a [8] provdes us an aternatve. Each predefned overa confct woud ead to a set of dscountng factors. But the fasty s defned by confct coeffcent, causng t ess robust than a dstance based method [7]. From the above anayss we can see that the dssmarty measure between two bodes of evdence s cruca to a dscountng method, and t has attracted much attenton n recent years [1-12]. A comprehensve survey on dssmarty measures defned so far can be found n [13] by Jousseme et a. Athough mportant research efforts have been done to characterze the dssmarty between two BPA's, they each capture ony one aspect of the dssmarty and are sutabe for specfc appcatons. In ths paper, we propose a dssmarty measure from a new aspect. The BPA matrx s ntroduced to represent two bodes of evdence and ts smaest snguar vaue s taken as the measure of ther dssmarty, consderng that the snguar vaues of a matrx can refect ts structure property. The smaer the smaest snguar vaue, the coser two bodes of evdence are; and vce verse. A smarty matrx refectng the reatons among foca eements (as defned n defnton 1) s aso used to modfy the BPA matrx n order to get a reasonabe measure resut. Later on ths dssmarty measure s used to defne a new ncrementa dscountng approach. Smar to the seuenta dscountng method proposed by Schubert et a., wth ths ncrementa approach we coud obtan a smooth dscountng process and we are abe to reach any eve of predefned confct accordng to actua reurements. And the new method s more robust to outers (bodes of evdence wth dfferent opnons from the majorty opnon) than the seuenta dscountng method based on fasty. Note that the new dssmarty measure s extended from our eary work[14] wth organzatona modfcaton for better readabty and addtona exampes, whe the new ncrementa dscountng approach s frst proposed here. The rest of the paper s organzed as foows. In secton 2, some basc concepts n evdence theory are revewed, and some reated works are aso ntroduced. In secton 3, we present the new dssmarty measure n deta. The BPA matrx s defned and the smaest snguar vaue of ts

2 modfed form s proposed to be the dssmarty measure. A new ncrementa dscountng method based on ths dssmarty measure s put forward and some comparsons are made n secton 4; and a concuson s drawn n secton 5. II. BACKGROUND A. Fundamenta concepts Evdence theory was frst put forward by Dempster and then extended by Shafer, thus t s aso known as Dempster- Shafer theory. Here we st severa basc defntons that w be used n the foowng sectons. Defnton 1[1]. Let Θ, a fnte set of N mutuay excusve and exhaustve hypotheses, be the frame of dscernment. The set consstng of a ts subsets s caed the power set of Θ, denoted by Ω. A basc probabty assgnment (BPA) s defned as m: Ω [,1], such that ma ( ) A Ω, m( φ) =, ma ( ) = 1 A Θ m s aso caed the mass functon, a subset A s caed a foca eement f m(a)>. The vaue of m(a) s a measure of the beef attrbuted exacty to A, and to none of the subsets of A. One can aso defne severa other functons ke beef functon, pausbty functon and commonaty functon to descrbe a body of evdence. Snce these functons are n oneto-one correspondence, the BPA w be used n ths paper to measure the dssmarty between two bodes of evdence. Defnton 2[1]. Let m 1 and m 2 be two BPA s defned over frame Θ, then they can be combned by Dempster s rue of combnaton: X = φ m 1 m2( X) = (2) m1( A) m2( B) A, B Θ, A B= X X φ 1 k where k = m1 m2( φ ) = m1( A) m2( B) (3) A B= φ and k s caed the confctng coeffcent, whch descrbes the degree of evdence confct. Defnton 3[1]. Let m be a BPA defned over frame Θ, α [, 1] be a dscountng factor, then we can get the BPA dscounted by α as α α ma ( ), A Θ, A Θ m ( A) = (4) 1 α(1 ma ( )), A =Θ The dscountng factor of a body of evdence refects ts reabty, and the more reabe the source s, the bgger α s. Otherwse, f a source s not reabe, t w be dscounted to a bg extent wth a sma α. (1) B. Reated works As a way to manage the confct when usng Dempster s rue, many dscountng methods have been proposed. Dfferent from drect dscountng methods by others, Schubert et a[8,15] deveoped a seuenta dscountng method based on fasty. Wth ths method, dscountng s performed n a seuence of ncrementa steps unt the overa confct s brought down to a predefned acceptabe eve. The fasty of evdence e s defned as m where ( e ) = Δχ χ c c 1 c n n c m φ c m = 1 = 1, = ( ), = ( φ). Based on fasty, dscountng factors at step d was updated by ( d,) ( d, ) ( d, ) c c αε = 1 ε ( d, ) 1 c where ε s a gan factor and ε 1, and c ( d, ) s the vaue of c at step d. If ony one source s n hgh confct wth other sources, then ts remova w yed a steep reducton of the confct degree, and the correspondng dscountng factor w be sma,.e. t w be dscounted heavy. However, when there are more than one sources n confct wth the majorty opnon, removng one of the confctng sources may ony ead to a sma change of the confct degree. Thus, a dstancebased method woud be more robust as ponted out by Ken et a [7], who proposed an teratve method to compute dscountng rates usng Jousseme s evdenta dstance: 1 1 α j j ( j = α dbpa m, mmean) (7) 1 where ( 1, 2) ( 1 2) ( 1 2) 2 m m T d D m m BPA m m = (8) s the evdenta dstance[1] and m mean s the average N N evdence. D s a 2 2 smarty matrx of foca eements. These two works nspred the new ncrementa dscountng method presented n the foowng sectons. The proposed approach s smar to Schubert s method n form whe a new dssmarty measure s used n pace of the confct coeffcent. III. DISSIMILARITY MEASURE BASED ON SINGULAR VALUE The dssmarty between two bodes of evdence conssts of severa aspects, makng t dffcut to uantfy. The confct coeffcent, defned by euaton (3), s commony used to uantfy the degree of confct between two bodes of evdence. However, by ths method there may be a bg confct between two dentca bodes of evdence whe two dfferent bodes of evdence may have no confct at a, unsutabe for (5) (6)

3 many appcatons. Thus many other measures have been put forward, among whch, the evdenta dstance (euaton (8)) proposed by Jousseme et a s an nterestng one. But ts computaton burden w become an mportant ssue as the frame of dscernment ncreases, and t s not good enough to capture the dfference between BPA s n some cases as shown n [5]. In ths secton, we ntroduce a new dssmarty measure between two BPA s from a dfferent aspect. Before that, et s frst reformuate the propertes of dssmarty measure n terms of basc probabty assgnments. Property 1. Gven any two BPA s m 1 and m 2, then ds(m 1, m 2 ) ; Property 2. Gven any two BPA s m 1 and m 2, then ds(m 1,m 2 )= ds(m 2, m 1 ); Property 3. Gven any two BPA s m 1 and m 2, then ds(m 1, m 2 )= ff m 1 = m 2. A. The new dssmarty measure Matrx s an usefu mathematca too for smpfyng notatons and t s effectve for provng theorems as we. It was therefore used for severa probems reated to beef functons by Smets[16]. To the authors knowedge, few reatons have been drecty estabshed between the propertes of a matrx and beef functons so far. In ths secton, we try to estabsh a smpe reaton. Snguar vaues of a matrx refect ts structure propertes. Generay, they are not ony decded by the scaes of ts eements, but aso reated to the dfferences between them. However, when t comes to a speca knd of matrx wth one more constrant that the sum of each row s fxed,.e. the nfuence of eements scaes s amost removed, the snguar vaues w many depend on dstrbuton features,.e. the dfferences between eements. Before ntroducng the new approach, et s see a smpe but enghtenng exampe. x 1 x Exampe 1. Set matrx A = 1, x 1 x B =, 1 x x then when x ncreases contnuousy from to 1, we can get a seres of snguar vaues of A and B as Fg. 1 shows. When x ncreases n nterva [,.5], the two rows n matrx A separate from each other whe the two rows n B become coser and coser. From the fgure, we can fnd that the smaest snguar vaue of A ncreases whe that of B decreases. Smary, when x ncreases n nterva [.5, 1], the two rows separate from each other n both A and B. Correspondngy, ther smaest snguar vaues ncrease as the ncrement of x. Thus, n the entre nterva, the coser the two rows of a matrx are, the smaer ts smaest snguar vaue s, and vce verse. As to the bggest snguar vaue, t decreases n entre nterva n the eft fgure and keeps the same vaue n the rght fgure, thus t shows no necessary connecton wth the dfference of the two rows. Fg. 1. Snguar vaues when x vares Ths exampe gves us enghtenment that t s a good choce to take the smaest snguar vaue as the dssmarty measure between the two rows of a matrx, and f we coud represent two bodes of evdence by a two-row matrx, then the smaest snguar vaue may aso be used to measure the dssmarty between them. For the case where a foca eements are sngetons and excusve, we can mmedatey construct such a matrx, e.g., f there are two BPA s m 1 (ω 1 )=x, m 1 (ω 2 )=1-x; m 2 (ω 1 )= 1-x, m 2 (ω 2 )= x; then we coud use matrx B n exampe 1 to represent them. Generay two BPA s often have dfferent foca eements and some foca eements are not sngetons. As to ths case, the above method cannot be apped drecty and some modfcatons shoud be done. Defnton 4. Let F 1, F 2 be the foca sets of two BPA s defned over Θ, and F=F 1 F 2 ={C 1,C 2,,C n }, then a matrx can be constructed as foows: m1( C1),, m1( Cn ) M = m2( C1),, m2( Cn ) mj( C), C Fj where mj( C) = j = 1, 2; = 1, 2, n., C Fj Through defnton 4, we coud represent two BPA s by a matrx M whch w be caed BPA matrx hereafter, and then the smaest snguar vaue of M coud be used to measure the dssmarty. Nevertheess, evdence theory s dfferent from Bayesan theory that a subsets of the frame coud be foca eements. As a conseuence, the foca eements of a BPA may often have ntersectons and are not ndependent n many cases. But once two BPA s are represented as a BPA matrx, ony ndependent vaues are eft n ths matrx and a the orgna reatons are ost. Thus, n order to mantan the reatons between foca eements and to refect the dssmarty reasonaby, some modfcatons shoud be done to the BPA matrx. So far many works have been done on the measure of smarty between foca eements. In [13], Jousseme et a. made a comprehensve concuson about t. Here we are not gong to st them a snce t s not the man topc of ths paper,

4 and we drecty take A B / A B as the smarty measure between foca eements A and B. Accordng to ths defnton, a smarty matrx w be formed to modfy the BPA matrx. Defnton 5. Let m 1, m 2 be two BPA s defned over frame Θ, M be the BPA matrx, and F={C 1,..., C n }, then the dssmarty between m 1 and m 2 coud be defned as foows: dsv( m1, m2) = mn( σ( MD )). (9) Where σ(m D) denotes snguar vaues of the matrx M D. D s the smarty matrx of foca eements to modfy the BPA matrx and D s an n n matrx wth eements denoted by: j Dj = C C, C, Cj F C Cj (1) The smaest snguar vaue, rather than the bggest one, s seected, because the smaest snguar vaue refects the dssmarty between two BPA s more propery, whe the bggest snguar vaue to a great extent refects the focused degree of each BPA as exampe 1 and many other numerca exampes show. Accordng to the basc propertes of snguar vaue, t s trva to prove that the dssmarty measure defned by euaton (9) s rreevant to the order of coumns of the BPA matrx. Thus, the coumns can be arranged n any order when construct a BPA matrx. However, arrangng them by cardnaty s a good suggeston for the sake of convenence. Agan, from the propertes of snguar vaue, property 1 and property 2 formuated at the begnnng of ths secton can be verfed mmedatey. Property 3 s not so obvous, but t s aso easy to prove and we omt t here. B. Exampes and anayss In ths subsecton, to further verfy the effectveness of the proposed approach, two exampes are ustrated. The frst one s taken from [1], whch s often used to check the behavors of a dssmarty measure. Exampe 2. Let Θ be the frame of dscernment wth 2 eements, and for convenence, 1, 2, etc. w be used to denote eement 1, eement 2, etc. over ths frame. The frst BPA s defned as: m 1 ({2,3,4})=.5, m 1 ({7})=.5, m 1 (A)=.8, m 1 (Θ)=.1; where A s a subset of Θ. The second BPA s defned as: m 2 ({1,2,3,4,5})=1. There are 2 cases where subset A ncreases one more eement at a tme, startng from Case 1 wth A = {1} and endng wth Case 2 wth A = Θ. The vaues of dsv n each case are graphcay ustrated n Fg. 2 wth the bue curve. And the red curve represents Jousseme s evdenta dstance. From the fgure, we can see that the two curves have the same trend. In the begnnng, they decrease as the eements of A ncrease. And they reach the mnmum vaue at the pont where A s {1,2,3,4,5}. After that, they keep ncreasng as the ncrement of A. Ths trend s consstent wth the fact that the Fg. 2. Dssmarty measures as the ncrement of A two BPA s become coser and coser at frst and they separate from each other when A keeps ncreasng afterwards. Exampe 3. Let the frame of dscernment be Θ={ω 1,ω 2,ω 3 }, and three BPA s are defned over ths frame: m 1 ({ω 1 })=1/3, m 1 ({ω 2 })=1/3, m 1 ({ω 3 })=1/3; m 2 (Θ)=1; m 3 ({ω 1 })=1. Athough both m 1 and m 2 are hepess for makng a decson, they are not dentca. They represent two extreme cases,.e. m 1 has a fu randomness whe m 2 s totay gnorant. Athough ther ntrnsc nature of uncertanty s dfferent, from a decson makng pont of vew, they shoud be reatvey coser and ther dssmarty shoud be sma. Snce m 3 supports ω 1 absoutey, dssmar to m 1 and m 2, t shoud have bg dssmarty measures wth both m 1 and m 2. But m 1 supports ω 1 to a certan extent whe m 2 gves no drect support to ω 1, so m 3 and m 1 are coser than m 3 and m 2. From the above anayss, a concuson coud be made that the dssmarty among these three BPA s shoud obey the neuaty: ds(m 1,m 2 )<ds(m 1,m 3 ) <ds(m 2,m 3 ). Accordng to euaton (8), we can compute the evdenta dstance: d BPA (m 1,m 2 )=d BPA (m 1,m 3 )=.5774 and d BPA (m 2,m 3 )=.8165, whch s nconsstent wth our expectaton. However, usng the dssmarty measure based on smaest snguar vaue, we have dsv(m 1,m 2 )=.2961, dsv(m 1,m 3 )=.4419, dsv(m 2,m 3 )=.6667, whch satsfes the order we want. IV. INCREMENTAL DISCOUNTING METHOD WITH THE NEW DISSIMILARITY MEASURE In the above secton we proposed a new dssmarty measure.e. the smaest snguar vaue of the modfed BPA matrx. Inspred by Schubert s seuenta ncrementa dscountng strategy, n ths secton we propose a new ncrementa dscountng approach usng ths new dssmarty measure. An experment s conducted and some comparsons are made between the new proposed ncrementa approach and the orgna one.

5 A. Incrementa dscountng method Suppose we have a set of BPA s m 1, m 2,, m n, then accordng to euaton (9), the average dssmarty between m and the other BPA s can be defned as: 1 d = dsv( m, mj), = 1,2,, n (11) n 1 j A bg d means that m s dssmar to other BPA s, and that t s not supported by other BPA s to a certan extent. Thus, the bgger d s, the more ncredbe m s, and we defne the reatve ncredbty of a BPA as foows d RI =, = 1,2,, n (12) dmax where max 1 2 d = max{ d, d,, d n } The ncredbty of a BPA rests wth not ony the reatve ncredbty, but aso the overa consstency among BPA s. If a set of BPA s are consstent, then a BPA n ths set shoud have a ow ncredbty even wth a bg reatve ncredbty. Generay, the average dssmarty can refect the degree of consstency, and we defne the absoute ncredbty as d AI = RI d = d (13) mean mean d max where dmean = ( d1 + d2 + + dn ) / n AI coud be drecty taken as the dscountng rate. But n order to contro the overa confct accordng to dfferent actua reurements, smar to [8], we take an ncrementa step by assgnng d α = 1 ε AI = 1 ε d mean (14) d max at step, where ε s a gan factor, and ε<1. Agorthm 1. Incrementa dscountng factors computaton for =1 to n, do Compute d usng euaton (11); Compute α usng euaton (14); end for 1 whe K>K, do for =1 to n, do Compute dscounted BPA m usng euaton (15); Compute d usng euaton (11); Compute α usng euaton (14); end for +1; end whe In ths dscountng process we may derve a set of ncrementay dscounted BPA s as 1 1 ( ),, α m A A Θ A Θ m ( A) = (15) α + α m ( Θ ), A =Θ The computaton procedure of ths method s summarzed by Agorthm 1 as Fg. 3 shows. B. Experments and anayss In ths secton we conduct two experments wth sx BPA s as sted n tabeⅠ. Assumng that the majorty opnon s the actua one when no further nformaton s avaabe, then m 2 and m 5 coud be seen as outers and the aggregaton resut shoud gve {A} the bggest support. TABLE I. SIX BPA S OVER THE FRAME Θ={A, B, C} φ A B A, B C A, C B, C Θ m m m m m m As the frst exampe, we consder the case where a the sx BPA s w be aggregated to get a fna decson. Set ε=.1 and K =.3, we coud get the dscountng factors at each step (Fg. 4(a)) and the correspondng fuson resuts by Dempster s rue of combnaton (Fg. 5). For comparson, Schubert s method [8] s aso conducted wth the same parameters (Fg. 4(b)). A steady decne n the overa confct coud be found n Fg. 5 wth the back curve. As a conseuence, the dscountng factors n Fg. 4(a) ncrease sowy as the dscountng steps contnue. What s more, dscountng factors of m 2 and m 5 are aways smaer than other BPA s and there s an obvous gap snce they are outers and are reatvey ncredbe. However, t s not the case n Fg. 4(b) where a dscountng factors tend to be eua after forty steps, whch seems unreasonabe. Fg. 3. Agorthm for ncrementa dscountng (a). Agorthm 1

6 (b). Seuenta dscountng based on fasty Fg. 4. Dscountng factors of dfferent methods Fg. 6. (a) Seuenta dscountng based on fasty Fg. 5. Fuson resuts and overa confct of Agorthm 1 The aggregaton resut of agorthm 1 s m(a)=.4527, m(b)=.1113, m(c)=.1618, m(θ)=.2742; and the resut of Schubert s method s m(a)=.3937, m(b)=.13, m(c)=.1717, m(θ)=.346. Wth the same predefned overa confct eve K, our method has a ower uncertanty, whch s good for decson makng. A hgher K w ead to a more certan resut, f necessary. It coud aso be seen that our method needs more steps to reach the predefned overa confct n contrast to Schubert s method. However, ths coud be overcome by a bgger gan factor ε. As the second exampe, we move away m 2 and m 5. ε=.1 and K =.3 are st used for Schubert s method, and the correspondng resuts are shown n Fg. 6. Athough t s ceary that a four BPA s support proposton A and they are consstent wth each other, a BPA s are heavy dscounted just as n the frst exampe and the fna aggregaton resut s: m(a)=.61, m(b)=.855, m(c)=.1165, m(θ)= Dfferent from the frst exampe, the maxmum dsv measure between any two BPA s s aso used n pace of the Fg. 6. (b) Fuson resuts and overa confct of seuenta dscountng overa confct n agorthm 1 to decde whether the teratvey dscountng process shoud stop. If we st set dsv =.3, then no dscountng s needed at a and the fna resut s the same as drecty combnng them usng Dempster s rue : m(a)=.9923, m(b)=.24, m(c)=.53, m(θ)=. It has a much ower uncertanty compared to Schubert s method, and we can thnk t more reasonabe wth the fact that a bodes of evdence have the same decson. Ths exampe shows the advantage of dsv over the confct coeffcent when usng as the stop condton and that t may be a good choce to use the new dssmarty both n the dscountng process and as the stop condton. Note that drect dscountng coud be seen as a speca case of the ncrementa dscountng process. If we take euaton (13) as the dscountng rate and use (1-AI ) as the dscountng factor of the -th BPA, then the aggregaton resut by drect dscountng s: m(a)=.8351, m(b)=.534, m(c)=.173, m(θ)=.42, wth the overa confct after dscountng be Whe f we set K =.9347 and ε=.1, a smar resut coud be obtaned by the ncrementa dscountng method: m(a)=.8121, m(b)=.627, m(c)=.1195, m(θ)=.56.

7 These exampes above show the performance of our proposed dssmarty measure and the modfed ncrementa dscountng method. In some cases they behave better than exstng methods. V. CONCLUSION As an effectve way to manage confct when combnng beef functons, dfferent dscountng methods have been proposed. Dfferent from others, the ncrementa dscountng method aows us to dscount sources to dfferent eves by settng varous predefned confcts. It provdes us wth more choces and s therefore more appcabe. To mprove the performance, we proposed a modfed ncrementa dscountng method usng a new dssmarty measure. In order to uantfy the dssmarty between two basc probabty assgnments, we use a two-row matrx to represent them. A drect reaton s estabshed between ths matrx and the dssmarty of two BPA s,.e. the smaest snguar vaue s taken as the dssmarty measure. It coud be an nterestng aternatve. Consderng that foca eements are not aways sngetons and excusve whe the BPA matrx aone cannot refect ther reatons, a smarty matrx of foca eements s used to modfy t. Ths new dssmarty measure has some basc propertes and shows ts effectveness n exampes. Based on ths new dssmarty measure, the reatve ncredbty and absoute ncredbty are defned and ncrementa dscountng factors are computed usng these concepts. Comparsons wth the orgna seuenta dscountng method show ts effectveness. We represent two BPA s as a BPA matrx and took the smaest snguar vaue as the dssmarty measure between them n ths paper. Athough t shows ts effectves n exampes, necessary theoretca verfcatons are not founded. Besdes, some other reatons may be estabshed between ths matrx and beef functons. Thus these aspects w be our future research work. REFERENCES [1] G. A. Shafer. A Mathematca Theory of Evdence. Prnceton: Prnceton Unversty Press, [2] P. Smets and R. Kennes, The Transferabe Beef Mode. Artfca Integence, vo. 66, pp , [3] R. R. Yager. On the Dempster-Shafer framework and new combnaton rues. Informaton Scences, vo. 41, pp , [4] L. A. Zadeh. On the vadty of Dempster's rue of combnaton of evdence. Berkey, USA: Eectroncs Research Laboratory, Unversty of Caforna, [5] Z. G. Lu, J. Dezert, Q. Pan, et a. Combnaton of sources of evdence wth dfferent dscountng factors based on a new dssmarty measure. Decson Support Systems, vo. 52, pp , 211. [6] M. C. Forea, A. L. Jousseme and E. Bosse. Dynamc Estmaton of Evdence Dscountng Rates Based on Informaton Credbty. Raro- Operatons Research, vo. 44, pp , 21. [7] J. Ken and O. Coot. Automatc dscountng rate computaton usng a dssent crteron. Proceedngs of the Workshop on the Theory of Beef Functons, Brest, France, pp. 1-6, 21. [8] J. Schubert. Confct management n Dempster-Shafer theory usng the degree of fasty. Internatona Journa of Approxmate Reasonng, vo. 52, pp , 211. [9] Y. Deng, W.K. Sh, Z.F. Zhu, et a. Combnng beef functons based on dstance of evdence. Decson Support Systems,vo.38,pp , 24. [1] A. L. Jousseme, D. Grener and É. Bossé. A new dstance between two bodes of evdence. Informaton Fuson, vo. 2, pp , 21. [11] W. R. Lu. Anayzng the degree of confct among beef functons. Artfca Integence, vo. 17, pp , 26. [12] A. Martn, A. L. Jousseme and C. Osswad. Confct measure for the dscountng operaton on beef functons. 11th Internatona Conference on Informaton Fuson, Coogne, Germany, 28. [13] A.L. Jousseme and P. Maupn. Dstances n evdence theory: Comprehensve survey and generazatons. Internatona Journa of Approxmate Reasonng, vo. 53, pp , 212. [14] X. L. Ke, L. Y. Ma, Y. Wang. A new method to measure evdence confct based on snguar vaue. Acta Eectronca Snca(to be pubshed). [15] J. Schubert. Confct Management n Dempster-Shafer Theory by Seuenta Dscountng Usng the Degree of Fasty. Proceedngs of IPMU, Torremonos, pp , 28. [16] P. Smets, The appcaton of the matrx cacuus to beef functons. Internatona Journa of Approxmate Reasonng, vo. 31, pp. 1-3, 22.

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory Advanced Scence and Technoogy Letters Vo.83 (ISA 205), pp.60-65 http://dx.do.org/0.4257/ast.205.83.2 Research on Compex etworks Contro Based on Fuzzy Integra Sdng Theory Dongsheng Yang, Bngqng L, 2, He

More information

International Journal of Mathematical Archive-3(3), 2012, Page: Available online through ISSN

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

MARKOV CHAIN AND HIDDEN MARKOV MODEL

MARKOV CHAIN AND HIDDEN MARKOV MODEL MARKOV CHAIN AND HIDDEN MARKOV MODEL JIAN ZHANG JIANZHAN@STAT.PURDUE.EDU Markov chan and hdden Markov mode are probaby the smpest modes whch can be used to mode sequenta data,.e. data sampes whch are not

More information

Neural network-based athletics performance prediction optimization model applied research

Neural network-based athletics performance prediction optimization model applied research Avaabe onne www.jocpr.com Journa of Chemca and Pharmaceutca Research, 04, 6(6):8-5 Research Artce ISSN : 0975-784 CODEN(USA) : JCPRC5 Neura networ-based athetcs performance predcton optmzaton mode apped

More information

Image Classification Using EM And JE algorithms

Image Classification Using EM And JE algorithms Machne earnng project report Fa, 2 Xaojn Sh, jennfer@soe Image Cassfcaton Usng EM And JE agorthms Xaojn Sh Department of Computer Engneerng, Unversty of Caforna, Santa Cruz, CA, 9564 jennfer@soe.ucsc.edu

More information

Multispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory

Multispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory Proceedngs of the 2009 IEEE Internatona Conference on Systems Man and Cybernetcs San Antono TX USA - October 2009 Mutspectra Remote Sensng Image Cassfcaton Agorthm Based on Rough Set Theory Yng Wang Xaoyun

More information

L-Edge Chromatic Number Of A Graph

L-Edge Chromatic Number Of A Graph IJISET - Internatona Journa of Innovatve Scence Engneerng & Technoogy Vo. 3 Issue 3 March 06. ISSN 348 7968 L-Edge Chromatc Number Of A Graph Dr.R.B.Gnana Joth Assocate Professor of Mathematcs V.V.Vannaperuma

More information

Power law and dimension of the maximum value for belief distribution with the max Deng entropy

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

A New Evidence Combination Method based on Consistent Strength

A New Evidence Combination Method based on Consistent Strength TELKOMNIKA, Vol.11, No.11, November 013, pp. 697~6977 e-issn: 087-78X 697 A New Evdence Combnaton Method based on Consstent Strength Changmng Qao, Shul Sun* Insttute of Electronc Engneerng, He Longang

More information

Xin Li Department of Information Systems, College of Business, City University of Hong Kong, Hong Kong, CHINA

Xin Li Department of Information Systems, College of Business, City University of Hong Kong, Hong Kong, CHINA RESEARCH ARTICLE MOELING FIXE OS BETTING FOR FUTURE EVENT PREICTION Weyun Chen eartment of Educatona Informaton Technoogy, Facuty of Educaton, East Chna Norma Unversty, Shangha, CHINA {weyun.chen@qq.com}

More information

Associative Memories

Associative Memories Assocatve Memores We consder now modes for unsupervsed earnng probems, caed auto-assocaton probems. Assocaton s the task of mappng patterns to patterns. In an assocatve memory the stmuus of an ncompete

More information

Predicting Model of Traffic Volume Based on Grey-Markov

Predicting Model of Traffic Volume Based on Grey-Markov Vo. No. Modern Apped Scence Predctng Mode of Traffc Voume Based on Grey-Marov Ynpeng Zhang Zhengzhou Muncpa Engneerng Desgn & Research Insttute Zhengzhou 5005 Chna Abstract Grey-marov forecastng mode of

More information

Nested case-control and case-cohort studies

Nested case-control and case-cohort studies Outne: Nested case-contro and case-cohort studes Ørnuf Borgan Department of Mathematcs Unversty of Oso NORBIS course Unversty of Oso 4-8 December 217 1 Radaton and breast cancer data Nested case contro

More information

Numerical integration in more dimensions part 2. Remo Minero

Numerical integration in more dimensions part 2. Remo Minero Numerca ntegraton n more dmensons part Remo Mnero Outne The roe of a mappng functon n mutdmensona ntegraton Gauss approach n more dmensons and quadrature rues Crtca anass of acceptabt of a gven quadrature

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

A finite difference method for heat equation in the unbounded domain

A finite difference method for heat equation in the unbounded domain Internatona Conerence on Advanced ectronc Scence and Technoogy (AST 6) A nte derence method or heat equaton n the unbounded doman a Quan Zheng and Xn Zhao Coege o Scence North Chna nversty o Technoogy

More information

On the Power Function of the Likelihood Ratio Test for MANOVA

On the Power Function of the Likelihood Ratio Test for MANOVA Journa of Mutvarate Anayss 8, 416 41 (00) do:10.1006/jmva.001.036 On the Power Functon of the Lkehood Rato Test for MANOVA Dua Kumar Bhaumk Unversty of South Aabama and Unversty of Inos at Chcago and Sanat

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Lower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle

Lower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle Lower bounds for the Crossng Number of the Cartesan Product of a Vertex-transtve Graph wth a Cyce Junho Won MIT-PRIMES December 4, 013 Abstract. The mnmum number of crossngs for a drawngs of a gven graph

More information

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION European Journa of Mathematcs and Computer Scence Vo. No. 1, 2017 ON AUTOMATC CONTNUTY OF DERVATONS FOR BANACH ALGEBRAS WTH NVOLUTON Mohamed BELAM & Youssef T DL MATC Laboratory Hassan Unversty MORO CCO

More information

Supplementary Material: Learning Structured Weight Uncertainty in Bayesian Neural Networks

Supplementary Material: Learning Structured Weight Uncertainty in Bayesian Neural Networks Shengyang Sun, Changyou Chen, Lawrence Carn Suppementary Matera: Learnng Structured Weght Uncertanty n Bayesan Neura Networks Shengyang Sun Changyou Chen Lawrence Carn Tsnghua Unversty Duke Unversty Duke

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

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

Lecture Notes on Linear Regression

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

3. Stress-strain relationships of a composite layer

3. Stress-strain relationships of a composite layer OM PO I O U P U N I V I Y O F W N ompostes ourse 8-9 Unversty of wente ng. &ech... tress-stran reatonshps of a composte ayer - Laurent Warnet & emo Aerman.. tress-stran reatonshps of a composte ayer Introducton

More information

QUARTERLY OF APPLIED MATHEMATICS

QUARTERLY OF APPLIED MATHEMATICS QUARTERLY OF APPLIED MATHEMATICS Voume XLI October 983 Number 3 DIAKOPTICS OR TEARING-A MATHEMATICAL APPROACH* By P. W. AITCHISON Unversty of Mantoba Abstract. The method of dakoptcs or tearng was ntroduced

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

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

Chapter 6. Rotations and Tensors

Chapter 6. Rotations and Tensors Vector Spaces n Physcs 8/6/5 Chapter 6. Rotatons and ensors here s a speca knd of near transformaton whch s used to transforms coordnates from one set of axes to another set of axes (wth the same orgn).

More information

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

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

A Robust Method for Calculating the Correlation Coefficient

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

Greyworld White Balancing with Low Computation Cost for On- Board Video Capturing

Greyworld White Balancing with Low Computation Cost for On- Board Video Capturing reyword Whte aancng wth Low Computaton Cost for On- oard Vdeo Capturng Peng Wu Yuxn Zoe) Lu Hewett-Packard Laboratores Hewett-Packard Co. Pao Ato CA 94304 USA Abstract Whte baancng s a process commony

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

CHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION

CHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr

More information

corresponding to those of Heegaard diagrams by the band moves

corresponding to those of Heegaard diagrams by the band moves Agebra transformatons of the fundamenta groups correspondng to those of Heegaard dagrams by the band moves By Shun HORIGUCHI Abstract. Ths paper gves the basc resut of [1](1997),.e., a hande sdng and a

More information

Lecture 12: Discrete Laplacian

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

Discriminating Fuzzy Preference Relations Based on Heuristic Possibilistic Clustering

Discriminating Fuzzy Preference Relations Based on Heuristic Possibilistic Clustering Mutcrtera Orderng and ankng: Parta Orders, Ambgutes and Apped Issues Jan W. Owsńsk and aner Brüggemann, Edtors Dscrmnatng Fuzzy Preerence eatons Based on Heurstc Possbstc Custerng Dmtr A. Vattchenn Unted

More information

Quantum Runge-Lenz Vector and the Hydrogen Atom, the hidden SO(4) symmetry

Quantum Runge-Lenz Vector and the Hydrogen Atom, the hidden SO(4) symmetry Quantum Runge-Lenz ector and the Hydrogen Atom, the hdden SO(4) symmetry Pasca Szrftgser and Edgardo S. Cheb-Terrab () Laboratore PhLAM, UMR CNRS 85, Unversté Le, F-59655, France () Mapesoft Let's consder

More information

The line method combined with spectral chebyshev for space-time fractional diffusion equation

The line method combined with spectral chebyshev for space-time fractional diffusion equation Apped and Computatona Mathematcs 014; 3(6): 330-336 Pubshed onne December 31, 014 (http://www.scencepubshnggroup.com/j/acm) do: 10.1164/j.acm.0140306.17 ISS: 3-5605 (Prnt); ISS: 3-5613 (Onne) The ne method

More information

Global Sensitivity. Tuesday 20 th February, 2018

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

Note 2. Ling fong Li. 1 Klein Gordon Equation Probablity interpretation Solutions to Klein-Gordon Equation... 2

Note 2. Ling fong Li. 1 Klein Gordon Equation Probablity interpretation Solutions to Klein-Gordon Equation... 2 Note 2 Lng fong L Contents Ken Gordon Equaton. Probabty nterpretaton......................................2 Soutons to Ken-Gordon Equaton............................... 2 2 Drac Equaton 3 2. Probabty nterpretaton.....................................

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

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

Singular Value Decomposition: Theory and Applications

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

A Unified Elementary Approach to the Dyson, Morris, Aomoto, and Forrester Constant Term Identities

A Unified Elementary Approach to the Dyson, Morris, Aomoto, and Forrester Constant Term Identities A Unfed Eementary Approach to the Dyson, Morrs, Aomoto, and Forrester Constant Term Identtes Ira M Gesse 1, Lun Lv, Guoce Xn 3, Yue Zhou 4 1 Department of Mathematcs Brandes Unversty, Watham, MA 0454-9110,

More information

Cyclic Codes BCH Codes

Cyclic Codes BCH Codes Cycc Codes BCH Codes Gaos Feds GF m A Gaos fed of m eements can be obtaned usng the symbos 0,, á, and the eements beng 0,, á, á, á 3 m,... so that fed F* s cosed under mutpcaton wth m eements. The operator

More information

Nonextensibility of energy in Tsallis statistics and the zeroth law of

Nonextensibility of energy in Tsallis statistics and the zeroth law of Nonextensbty of energy n Tsas statstcs and the zeroth a of thermodynamcs onge Ou and Jncan hen* T Word Laboratory, P. O. 870, eng 00080, Peoe s Reubc of hna and Deartment of Physcs, Xamen nversty, Xamen

More information

CHAPTER 4. Vector Spaces

CHAPTER 4. Vector Spaces man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear

More information

COXREG. Estimation (1)

COXREG. Estimation (1) COXREG Cox (972) frst suggested the modes n whch factors reated to fetme have a mutpcatve effect on the hazard functon. These modes are caed proportona hazards (PH) modes. Under the proportona hazards

More information

G : Statistical Mechanics

G : Statistical Mechanics G25.2651: Statstca Mechancs Notes for Lecture 11 I. PRINCIPLES OF QUANTUM STATISTICAL MECHANICS The probem of quantum statstca mechancs s the quantum mechanca treatment of an N-partce system. Suppose the

More information

Formalisms For Fusion Belief in Design

Formalisms For Fusion Belief in Design XII ADM Internatonal Conference - Grand Hotel - Rmn Italy - Sept. 5 th -7 th, 200 Formalsms For Fuson Belef n Desgn Mchele Pappalardo DIMEC-Department of Mechancal Engneerng Unversty of Salerno, Italy

More information

Key words. corner singularities, energy-corrected finite element methods, optimal convergence rates, pollution effect, re-entrant corners

Key words. corner singularities, energy-corrected finite element methods, optimal convergence rates, pollution effect, re-entrant corners NESTED NEWTON STRATEGIES FOR ENERGY-CORRECTED FINITE ELEMENT METHODS U. RÜDE1, C. WALUGA 2, AND B. WOHLMUTH 2 Abstract. Energy-corrected fnte eement methods provde an attractve technque to dea wth eptc

More information

LECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem

LECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem V. DEMENKO MECHANICS OF MATERIALS 05 LECTURE Mohr s Method for Cacuaton of Genera Dspacements The Recproca Theorem The recproca theorem s one of the genera theorems of strength of materas. It foows drect

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

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

The Application of BP Neural Network principal component analysis in the Forecasting the Road Traffic Accident

The Application of BP Neural Network principal component analysis in the Forecasting the Road Traffic Accident ICTCT Extra Workshop, Bejng Proceedngs The Appcaton of BP Neura Network prncpa component anayss n Forecastng Road Traffc Accdent He Mng, GuoXucheng &LuGuangmng Transportaton Coege of Souast Unversty 07

More information

Crystal Interpretation of Kerov Kirillov Reshetikhin Bijection II

Crystal Interpretation of Kerov Kirillov Reshetikhin Bijection II arxv:math/6697v [math.qa] Jun 7 Crysta Interpretaton of Kerov Krov Reshethn Bjecton II Proof for sn Case Reho Saamoto Department of Physcs, Graduate Schoo of Scence, Unversty of Toyo, Hongo, Bunyo-u, Toyo,

More information

A New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems

A New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence

More information

Optimum Selection Combining for M-QAM on Fading Channels

Optimum Selection Combining for M-QAM on Fading Channels Optmum Seecton Combnng for M-QAM on Fadng Channes M. Surendra Raju, Ramesh Annavajjaa and A. Chockangam Insca Semconductors Inda Pvt. Ltd, Bangaore-56000, Inda Department of ECE, Unversty of Caforna, San

More information

Example: Suppose we want to build a classifier that recognizes WebPages of graduate students.

Example: Suppose we want to build a classifier that recognizes WebPages of graduate students. Exampe: Suppose we want to bud a cassfer that recognzes WebPages of graduate students. How can we fnd tranng data? We can browse the web and coect a sampe of WebPages of graduate students of varous unverstes.

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

More information

Lower Bounding Procedures for the Single Allocation Hub Location Problem

Lower Bounding Procedures for the Single Allocation Hub Location Problem Lower Boundng Procedures for the Snge Aocaton Hub Locaton Probem Borzou Rostam 1,2 Chrstoph Buchhem 1,4 Fautät für Mathemat, TU Dortmund, Germany J. Faban Meer 1,3 Uwe Causen 1 Insttute of Transport Logstcs,

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

THE METRIC DIMENSION OF AMALGAMATION OF CYCLES

THE METRIC DIMENSION OF AMALGAMATION OF CYCLES Far East Journa of Mathematca Scences (FJMS) Voume 4 Number 00 Pages 9- Ths paper s avaabe onne at http://pphm.com/ournas/fms.htm 00 Pushpa Pubshng House THE METRIC DIMENSION OF AMALGAMATION OF CYCLES

More information

Short-Term Load Forecasting for Electric Power Systems Using the PSO-SVR and FCM Clustering Techniques

Short-Term Load Forecasting for Electric Power Systems Using the PSO-SVR and FCM Clustering Techniques Energes 20, 4, 73-84; do:0.3390/en40073 Artce OPEN ACCESS energes ISSN 996-073 www.mdp.com/journa/energes Short-Term Load Forecastng for Eectrc Power Systems Usng the PSO-SVR and FCM Custerng Technques

More information

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

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

The Quadratic Trigonometric Bézier Curve with Single Shape Parameter

The Quadratic Trigonometric Bézier Curve with Single Shape Parameter J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma

More information

Analysis of Bipartite Graph Codes on the Binary Erasure Channel

Analysis of Bipartite Graph Codes on the Binary Erasure Channel Anayss of Bpartte Graph Codes on the Bnary Erasure Channe Arya Mazumdar Department of ECE Unversty of Maryand, Coege Par ema: arya@umdedu Abstract We derve densty evouton equatons for codes on bpartte

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

A MIN-MAX REGRET ROBUST OPTIMIZATION APPROACH FOR LARGE SCALE FULL FACTORIAL SCENARIO DESIGN OF DATA UNCERTAINTY

A MIN-MAX REGRET ROBUST OPTIMIZATION APPROACH FOR LARGE SCALE FULL FACTORIAL SCENARIO DESIGN OF DATA UNCERTAINTY A MIN-MAX REGRET ROBST OPTIMIZATION APPROACH FOR ARGE SCAE F FACTORIA SCENARIO DESIGN OF DATA NCERTAINTY Travat Assavapokee Department of Industra Engneerng, nversty of Houston, Houston, Texas 7704-4008,

More information

REAL-TIME IMPACT FORCE IDENTIFICATION OF CFRP LAMINATED PLATES USING SOUND WAVES

REAL-TIME IMPACT FORCE IDENTIFICATION OF CFRP LAMINATED PLATES USING SOUND WAVES 8 TH INTERNATIONAL CONERENCE ON COMPOSITE MATERIALS REAL-TIME IMPACT ORCE IDENTIICATION O CRP LAMINATED PLATES USING SOUND WAVES S. Atobe *, H. Kobayash, N. Hu 3 and H. ukunaga Department of Aerospace

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

Complement of Type-2 Fuzzy Shortest Path Using Possibility Measure

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

Errors for Linear Systems

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

The Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites

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

Uncertainty Specification and Propagation for Loss Estimation Using FOSM Methods

Uncertainty Specification and Propagation for Loss Estimation Using FOSM Methods Uncertanty Specfcaton and Propagaton for Loss Estmaton Usng FOSM Methods J.W. Baer and C.A. Corne Dept. of Cv and Envronmenta Engneerng, Stanford Unversty, Stanford, CA 94305-400 Keywords: Sesmc, oss estmaton,

More information

Exponential Type Product Estimator for Finite Population Mean with Information on Auxiliary Attribute

Exponential Type Product Estimator for Finite Population Mean with Information on Auxiliary Attribute Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 10, Issue 1 (June 015), pp. 106-113 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) Exponental Tpe Product Estmator

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

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

ECONOMICS 351*-A Mid-Term Exam -- Fall Term 2000 Page 1 of 13 pages. QUEEN'S UNIVERSITY AT KINGSTON Department of Economics

ECONOMICS 351*-A Mid-Term Exam -- Fall Term 2000 Page 1 of 13 pages. QUEEN'S UNIVERSITY AT KINGSTON Department of Economics ECOOMICS 35*-A Md-Term Exam -- Fall Term 000 Page of 3 pages QUEE'S UIVERSITY AT KIGSTO Department of Economcs ECOOMICS 35* - Secton A Introductory Econometrcs Fall Term 000 MID-TERM EAM ASWERS MG Abbott

More information

Subset Topological Spaces and Kakutani s Theorem

Subset Topological Spaces and Kakutani s Theorem MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered

More information

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes Numerca Investgaton of Power Tunabty n Two-Secton QD Superumnescent Dodes Matta Rossett Paoo Bardea Ivo Montrosset POLITECNICO DI TORINO DELEN Summary 1. A smpfed mode for QD Super Lumnescent Dodes (SLD)

More information

SIO 224. m(r) =(ρ(r),k s (r),µ(r))

SIO 224. m(r) =(ρ(r),k s (r),µ(r)) SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Joint Statistical Meetings - Biopharmaceutical Section

Joint Statistical Meetings - Biopharmaceutical Section Iteratve Ch-Square Test for Equvalence of Multple Treatment Groups Te-Hua Ng*, U.S. Food and Drug Admnstraton 1401 Rockvlle Pke, #200S, HFM-217, Rockvlle, MD 20852-1448 Key Words: Equvalence Testng; Actve

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

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

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

Supplementary Notes for Chapter 9 Mixture Thermodynamics

Supplementary Notes for Chapter 9 Mixture Thermodynamics Supplementary Notes for Chapter 9 Mxture Thermodynamcs Key ponts Nne major topcs of Chapter 9 are revewed below: 1. Notaton and operatonal equatons for mxtures 2. PVTN EOSs for mxtures 3. General effects

More information

Decision-making and rationality

Decision-making and rationality Reslence Informatcs for Innovaton Classcal Decson Theory RRC/TMI Kazuo URUTA Decson-makng and ratonalty What s decson-makng? Methodology for makng a choce The qualty of decson-makng determnes success or

More information

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0 Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

Boundary Value Problems. Lecture Objectives. Ch. 27

Boundary Value Problems. Lecture Objectives. Ch. 27 Boundar Vaue Probes Ch. 7 Lecture Obectves o understand the dfference between an nta vaue and boundar vaue ODE o be abe to understand when and how to app the shootng ethod and FD ethod. o understand what

More information

Adaptive and Iterative Least Squares Support Vector Regression Based on Quadratic Renyi Entropy

Adaptive and Iterative Least Squares Support Vector Regression Based on Quadratic Renyi Entropy daptve and Iteratve Least Squares Support Vector Regresson Based on Quadratc Ren Entrop Jngqng Jang, Chu Song, Haan Zhao, Chunguo u,3 and Yanchun Lang Coege of Mathematcs and Computer Scence, Inner Mongoa

More information

829. An adaptive method for inertia force identification in cantilever under moving mass

829. 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 information

Fuzzy Boundaries of Sample Selection Model

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

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

Strain Energy in Linear Elastic Solids

Strain Energy in Linear Elastic Solids Duke Unverst Department of Cv and Envronmenta Engneerng CEE 41L. Matr Structura Anass Fa, Henr P. Gavn Stran Energ n Lnear Eastc Sods Consder a force, F, apped gradua to a structure. Let D be the resutng

More information

IV. Performance Optimization

IV. Performance Optimization IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton

More information

AGGREGATION OF FUZZY OPINIONS UNDER GROUP DECISION-MAKING BASED ON SIMILARITY AND DISTANCE

AGGREGATION OF FUZZY OPINIONS UNDER GROUP DECISION-MAKING BASED ON SIMILARITY AND DISTANCE Jrl Syst Sc & Complexty (2006) 19: 63 71 AGGREGATION OF FUZZY OPINIONS UNDER GROUP DECISION-MAKING BASED ON SIMILARITY AND DISTANCE Chengguo LU Jbn LAN Zhongxng WANG Receved: 6 December 2004 / Revsed:

More information

Calculation of time complexity (3%)

Calculation of time complexity (3%) Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add

More information