Composite Pattern Matching in Time Series

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Composite Pattern Matching in Time Series"

Transcription

1 Composite Pttern Mthing in Time Series Asif Slekin, 1 M. Mustfizur Rhmn, 1 n Rihnul Islm 1 1 Deprtment of Computer Siene n Engineering, Bnglesh University of Engineering n Tehnology Dhk-1000, Bnglesh Astrt For lst few yers mny reserh hve een tken ple to reognize vrious meningful ptterns from time series t. These reserhes re se on reognizing si time series ptterns. Most of these works use templte se, rule se n neurl network se tehniques to reognize si ptterns. But in time series there exist mny omposite ptterns omprise of simple si ptterns. In this pper we propose two novel pprohes of reognizing omposite ptterns from time series t. In our propose pproh we use omintion of templte se n rule se pprohes n neurl network n rule se pprohes to reognize these omposite ptterns. Inex Terms Pttern reognition, Rule se pproh, Neurl network, Templte se pproh,composite pttern I. INTRODUCTION There is wie rnge of pplitions in lmost every omin where time series t is eing generte. For exmple, ily?ututions of the stok mrket, tres proue y omputer luster, meil n iologil experimentl oservtions, reings otine from sensor networks, position uptes of moving ojets in lotion-se servies, et, re ll represente in time series. Consequently, there is n enormous interest in nlysing (inluing query proessing n mining) time series t, whih hs resulte in lrge numer of works on new methoologies for inexing, lssifying, lustering, n summrizing time series t. Stok mrket prie flutution lso genertes time series t. Tehnil nlysts n trers lim ertin stok mrket time series pttern n shpes le to profitle tre opportunity. For lst few yers mny reserh hve een onute to reognize meningful ptterns from time series t. We fin tht mny omposite ptterns whih frequently ourre in the time series n e forme y simply omining simple si time series ptterns. As fr we re onerne tht the urrent sttes of the rt re not yet onerne out this emerging omposite. In this pper we hve worke with six si ptterns illustrte in Fig-1 n the omposite ptterns generte from these six si ptterns. Sientists hve een use templte se pprohes, He n Shouler Reverse He n Shouler Fig. 1. Tripple Top Reverse Tripple Top Doule Top Reverse Doule Top Six si ptterns for stok t. rule se pprohes n neurl network se pprohes to reognize ptterns from time series t. In this pper we hve propose two novel pprohes to reognize omposite pttern from time series t. We pply vrile size sliing winow on time series t n extrt fetures from it. In our first pproh we use Spermns rnk orreltion oeffiient to reognize preferre ptterns n use rule sets to provie more ury in lssifition proess. In seon pproh we use neurl network s lssifier of vrious preferre ptterns in time series n lso use rule sets to enhne the ury of pttern reognition. II. PREVIOUS WORK Severl pprohes hve een evelope to extrting meningful ptterns from time series. Two mjor pprohes for pttern reognition in stok time series re templte se n rule se pprohes [1],[2]. In pst few yers mny pproh lso fouse on pplition of ANNs to stok mrket preition [3],[4]. Reent reserh tens re using hyriize pprohes for pttern reognition in stok time series. Tsihet l. [7] use omintion of the rule-se tehnique n ANN to preit the iretion of the stok n prie 500 stok inex futures on ily sis. Shtky et l. [5] suggeste iviing time series t sequene into meningful susequene n Ds et l. [6] introue fixe length winow to segment time series into susequenes n time series ws then represente y the primitive shpe ptterns tht were forme. Chung et l. [8] introue Time series pttern mthing se on Pereptully Importnt Point (PIP) ientifition. PIP lgorithm is se on pturing the flutution of the sequene n /12/$ IEEE 173

2 ientifying the highly flutute points s PIPs. Zhng et l.[9] introue omintion of templte se n rule se pprohes for pttern mthing in stok time series. Their pproh propose flexile online ptternmthing sheme se on fixe size sliing winow, whih is involve in the whole mthing proess, inluing oth in feture point extrtion n pttern mthing. Zhng et l.[9] use PIP onept, introue y Chung et l. [8] for feture point extrtion from the time series t within sliing winow.sine the urrent sttes of the rt re not yet onerne out this emerging omposite ptterns,in this pper we hve propose two novel pprohes to reognize omposite pttern from time series t. III. COMPOSITE PATTERN MATCHING APPROACHES In this setion we will give rief esription out two propose omposite pttern mthing pprohes. As shown in Fig.1 eh pproh hs three steps. Both of this pproh is se on vrile size sliing winow. On the first step, we extrt the feture points from time series t in vrile length sliing winow. The feture point extrtion metho is se on fining Pereptully Importnt Points (PIP)[8] from time series t. On the next step, for our first pproh we reognize omposite ptterns se on Spermns Rnk Correltion Coeffiient. For our seon pproh we propose pttern mthing sheme relying on neurl network where the inputs of the network re the normlize PIP points. On the thir step for oth of our pprohes we use the rule sets to improve the ility of ientifying ptterns n istinguish them more effetively. In oth of our pprohes we try to mth si pttern in sliing winow whih hs fixe initil length n we will use the nottion of primry winow length for this fixe winow length throughout the pper. However if we fil to fin ny si pttern in primry winow, then we inrese the winow length inrementlly to threshol vlue. But if the length of winow rehes to tht threshol vlue n no preferre si pttern is mthe in tht winow then we move the sliing winow to the next rw t where the length of the sliing winow is set equl to primry winow length gin. However, if mth is foun in tht sliing winow, then we move leftmost sie of sliing winow over the rw t epening on whih si pttern is mthe n the length of the sliing winow is set equl to primry winow length. If ny preferre si pttern is mthe for this new sliing winow, omposite pttern is foun. This omposite pttern is onstitute y these two si mthe ptterns. A. Feture extrtion A time series is olletion of oservtions of wellefine t items otine through repete mesurements over time. for exmple Stok time series is urve where x-oorinte represents the tring ys while the y-oorinte the losing pries. Time series sequene ontins lrge numer of time points. So, it is ostly n time onsuming to nlyze the ptterns from the time series iretly. A simple n effiient metho is neee for representtion or pproximtion of the time series sequene. Chung et l. [8] introue Time series pttern mthing se on Pereptully Importnt Point (PIP). In our pproh PIP is use for feture point extrtion. The PIP lgorithm is se on fining the flutution of the sequene n tkes these highly flutute points s PIPs. Initilly, the first two PIPs re efine s the first n lst point of input sequene (P ) where input sequene (P ) is tully the time series t within sliing winow(sw). The next PIP will e the point in P with mximum istne D to the first two PIPs. The fourth PIP will e the point in input sequene P with mximum istne D to its two jent PIPs. In this wy we extrt the PIPs from the input sequene P where the numer of PIPs(N) is user efine n we will ll this series s extrte series(sp). Chung et l. [8] pplie ifferent forms of mximum istne D n foun tht tht it ws effiient n effetive to extrt the feture points when D ws perpeniulr istne etween the test point n the line onneting the two jent PIPs. Hene, perpeniulr istne is use s D in PIP lgorithm. The pseuo oe of extrting Pereptully Importnt Point (PIP) is stte elow: 1: proeure EXTRACTING PERCEPTUALLY IMPOR- TANT POINTS(P [1 : n]) Input sequene (P[1:n]) of stok time series 2: SP[1] P [1] The first point of input sequene 3: SP[N] P [N] The lst point of input sequene 4: repet 5: Selet P [i] with mximum perpeniulr istne 6: PD to the jent PIP points in P 7: SP[j] P [i] 8: until j = N 9: en proeure B. Rule Sets For Bsi Ptterns In Spermns rnk se si pttern reognition pproh, there is loss of informtion when the t re onverte to rnks. Also in our pproh of si pttern reognition using neurl network hs some error. So, we efine set of rules for eh si ptterns. These rules esrie the si ptterns more expliitly. Using rule-se metho we n eliminte the error ours in rnk se n neurl network se tehniques, s this pproh istinguishe eh pttern more urtely /12/$ IEEE 174

3 Suh s in He n Shoulers pttern mplitue ifferene etween two shoulers will e elow 15%. In our pproh if potentil si pttern is mthe s output either from neurl network se or rnk se pproh, we pply previously efine rules on extrte PIP series of tht winow. The preefine rules for six si ptterns re stte elow. He & Shoulers Pttern SP[2] SP[6] <15% SP[4] is the top most point SP[2] n SP[6] must e the seon n thir top point SP[1] n SP[7] must e the lowest two points He & Shoulers Pttern (Reverse) SP[2] SP[6] <15% SP[4] is the lowest point SP[2] n SP[6] must e the seon n thir lowest point. SP[1] n SP[7] must e the highest two points Doule Top Pttern(UP) Differene etween the top two points < 15% SP[3] n SP[5] re the top two points. SP[2] is higher thn SP[1] SP[6] is higher thn SP[7] Doule Top Pttern(DOWN) Differene etween the top two points < 15% SP[3] n SP[5] re lowest two points. SP[2] is lower thn SP[1] SP[6] is lower thn SP[7] Triple Tops Pttern(UP) Mx( SP[2] SP[4], SP[2] SP[6], SP[4] SP[6] ) < 15% Sp[2],sp[4], sp[6] must e three highest points Triple Tops Pttern(DOWN) Mx( SP[2] SP[4], SP[2] SP[6], SP[4] SP[6] ) < 15% Sp[2],sp[4], sp[6] must e three lowest points C. Pttern reognition se on Spermns rnk orreltion oeffiient The Spermn rnk orreltion oeffiient is nonprmetri tehnique whih evlute the egree of orreltion etween two vriles. This tehnique works on the rnks of the time series t rther thn the rw time series t. In our first pproh we onvert the extrte feture points SP[1 : n] from eh sliing winow into rnk vlues. In Tle I rnk onversion for eh of the si ptterns is shown. Eh of the six preferre si ptterns in Fig-1 hs preefine rnk vlues. Converte rnk vlues from eh sliing winow is then ompre with the rnk vlues of eh preferre si ptterns. As in (1) we lulte the Spermns Correltion Coeffiient etween rnk vlues of preferre si ptterns n the onverte rnk vlues from sliing winow. Here where i is the ifferene etween rnks for eh x i, y i t pir, n n is numer of t pirs. γ =1 6 n i=1 2 i n(n 2 1) (1) For preferre si pttern, If vlue of γ is more then threshol vlue then rule sets for tht preferre si pttern is pplie on SP[1 : n] vlues of sliing winow. If this SP[1 : n] vlues psse the rule sets, tht preferre si pttern is onsiere to e mthe in this sliing winow. D. Pttern reognition using lssifition neurl network In vrious time series sequene t points vry extensively. For exmple in stok time series the vrine of prie of extrte PIPs will epen upon vrious prmeters of rel stok mrket. Hene we normlize the prie of PIPs into uniform intervl ([0, 1]) to eliminte the influenes use y this vrine. Suppose extrte PIP series SP[1 : N]. SP[i] is the highest prie point n SP[j] is the lowest prie point in stok time series. Then SP hight = SP[i] SP[j]. We get the normlize extrte series SN[1 : N], where for every k =1to N, SN[k] =(SP[k] SP[j])/SP hight. In our propose pproh we investigte the six (6) kins of si ptterns of time series. Our pproh is proess of lssifition using three-lyer feeforwr neurl network, whose inputs re extrte normlize series SN[1:N] efine in setion III-A. n outputs will e the preefine si pttern shown in Fig-1. A three-lyer feeforwr neurl network is typilly ompose of one input lyer, one output lyer n one hien lyers. In the input lyer, eh neuron orrespons to feture; while in the output lyer, eh neuron orrespons to preefine si pttern. Clssifition proess strts with trining the neurl network with group of trining smples. Every trining smple elongs to ertin preefine si pttern. Then the testing smples re use to test the performne of the trine network. For input feture vetor the est output woul e output vetor with ll elements s zero, exept one orresponing to whih si pttern the input smple elongs to. But, ue to lssifition errors some smple input oul not give the expete output. In our experiment, if ny output neuron of network gives more thn threshol perent similrity, then tht lss of si pttern is the potentil mth for input smple. In our pprohes primry winow length is W 0.Both /12/$ IEEE 175

4 TABLE I RANK OF BASIC PATTERNS Ptterns Pttern Figure Position Rnk Nme Orer He n He n Shouler [6241 [ Shouler 537] ] 6.5] 1 2 Doule Doule Top [6413 [ Top 257] ] 6.5] Triple Tripple Top [6142 [6.5 2 Top 537] ] 6.5] Reverse 7 Reverse He n Shouler [1537 [ He n 462] ] Shouler 1.5] Reverse Reverse Tripple Top [1536 [1.5 6 Triple 472] ] Top 1.5] Reverse Reverse Doule Top [1365 [ Doule 742] ] Top 1.5] 6 of our Spermns rnk orreltion oeffiient pproh n neurl network se pproh strts with pplying W = W 0 length sliing winow SW[1 : W ] on time series t S[1 : n]. Then we extrt feture points SP[1 : n]. For Spermns rnk orreltion oeffiient pproh we extrt rnk vlues from sliing winow SW. Then we ompre the rnk vlues extrte from eh sliing winow with the preefine rnk vlues of eh of the preferre si ptterns. If Spermns rnk orreltion oeffiient γ for ny of the preferre si pttern is more then threshol vlue then the orresponing input time series within the sliing winow (SW) is the potentil si mthe pttern. For our neurl network se pproh we extrt normlize feture points SN[1 : N] from sliing winow SW.Then we pply SN[1 : N] s input vetor of trine neurl network. If ny of the six (6) output neurons gives lssifition ury more thn user efine threshol in perentge (i.e. 90 perent), then the orresponing input time series within the sliing winow (SW) is the potentil si mthe pttern. After tht, for oth of our pprohes we pply previously efine rules in setion III-B on SP[1 : N] of tht sliing winow for potentil si pttern. If SP[1 : N] n pss these rules, then we onsier preefine si pttern is foun n then we move leftmost sie of winow over the rw t epening on whih si preferre pttern is mthe. If we fin He n Shouler or Reverse He n Shouler or Tripple Top or Reverse Tripple Top pttern we move leftmost sie of the winow over the rw t to the thir extrte point SP[3] of SP[1 : N] n the length of the winow is set equl to primry winow length. If we fin Doule Top or Reverse Doule Top pttern, we move leftmost sie of winow over the rw t to the fourth extrte point SP[4] of SP[1 : N] n the length of the winow is set equl to primry winow length. If ny preferre si pttern is mthe for this new sliing winow, omposite pttern is foun. However if we fil to fin ny pttern in primry winow, then we inrese the winow length inrementlly to threshol vlue. But if the length of winow rehes to tht threshol vlue n no preferre pttern is foun in tht winow then we move the winow to the next rw t where the length of the winow is set equl to primry winow length W 0. Then the sme proess will e gin pplie on the new winow. This will ontinue until the en of the Stok time series S. In Fig-2() for winow etween the points n we fin He n Shouler pttern. Hene move leftmost sie of winow over the rw t to the thir extrte point SP[3] whih is point. For winow etween the points n we fin Tripple Top pttern. These /12/$ IEEE 176

5 () He n Shouler n Tripple top omposite pttern () Reverse He n Shouler (e) Two Reverse tripple (f) Fig. 2. n Reverse Tripple Top omposite pttern () Doule Top n Tripple Top omposite pttern top omposite pttern () Tripple top n He n Shouler omposite pttern Reverse trippe top n Reverse He n Shouler omposite pttern Some exmple of omposite ptterns. two ptterns onstitute He n Shouler n Tripple top omposite pttern. Also in Fig-2() for winow etween the points n we fin Doule Top pttern. Hene move leftmost sie of winow over the rw t to the fourth extrte point SP[4] whih is point. For winow etween the points n we fin Tripple Top pttern. These two ptterns onstitute Doule Top n Tripple top omposite pttern. The pseuo oe of overll pproh of omposite pttern reognition is stte elow: 1: proeure COMPOSITE PATTERN MATCHING ON SLIDING WINDOW(S[1 : n]) full time series t 2: Set primry Winow With, W 0 3: Set Winow With, W = W 0 4: Threshol Winow Size W t 5: Set the numer of feture points extrte from 6: time series within sliing winow, N 7: repet 8: Apply sliing winows on S[1 : n] to extrt 9: feture points SP[1 : N] 10: For neurl network se pproh extrt 11: normlize feture points SN[1 : N], within 12: sliing winow, SW[1 : W ] 13: 14: Apply normlize feture points SN[1 : N] 15: s inputs of neurl network n hek the 6 16: outputs. If ny of the output gives more thn 17: 90% mth, then this pttern lss is 18: onsiere s potentil mthe pttern 19: (MP). 20: 21: For rnk se pproh extrt 22: rnk vlues from feture points SP[1 : N], 23: within sliing winow, SW[1 : W ] 24: If Spermns rnk orreltion oeffiient 25: with ny of the preferre si pttern is 26: more then threshol vlue then this si 27: pttern lss isonsiere s potentil 28: mthe pttern (MP). 29: 30: Chek whether SP[1 : N] n pss the 31: efine rules for MP pttern. 32: if pttern mth foun then 33: Move the winow epening on whih 34: si pttern is mthe with winow 35: withw = W 0 36: if If ny si pttern mthe for this 37: winow then 38: A omposite pttern is mthe 39: en if 40: else if winow with W<W t then 41: Inrese the winow with, 42: W = W + next rw t 43: else if winow with W equl W t then 44: Move the winow with 45: step=next rw t SW[1] 46: en if 47: until finish the time series S 48: en proeure IV. EXPERIMENTAL RESULT In this setion we present the experimentl results tht we onute on our propose pproh. We hve implemente our lgorithm in MATLAB n run extensive simultion on PC with Intel ore i5 proessor with lok spee 2.3GHz n 4 GB memory. We hve uploe our oe, whih is pulily ville to ess, t [12]. We hve performe extensive experiments n ompre our two propose pprohes. We run experiments on two rel stok prie tset nmely Dow Jones Inustril Averge [10] (20904 t points) n Generl Eletri Compny (GE) [11] (12691 t points). Aoring to the experiment on oth tsets, winow length of 15 to 20 t gives the est results for our oth pprohes. A. Neurl network n rule se pproh For trining the neurl network we prtition the tset of oth [10] n [11] tset into trining n testing tset. For tset [10] the trining tset ontins first points n rest of the t elongs to testing tset. Similrly,we prtition first points of tset [11] s trining tset n rest of the t s testing tset. We trin neurl network using vrious numer of neurons in hien lyer n vrious numer of itertion on trining t n then pply our neurl network n rule se pproh with vrile winow length with initil winow length of 15 t n inrese winow length y one rw t until winow length rehe the threshol Winow Length of 20 t on test t. Numer of omposite ptterns foun from Dtset [11] for using vrious numer of hien lyer n vrious numer of itertion is shown in Fig-4. From Dtset [10] for trining fee-forwr neurl network of 40 neurons in hien lyer n 4500 itertion on trining t we fin highest verge of 25 ptterns. An From Dtset [11] for trining fee-forwr neurl network of 35 neurons in hien /12/$ IEEE 177

6 30 25 COMPARISON BETWEEN TWO APPROACH se on vrile length sliing winow. Our hyri pprohes n effiiently reognize omposite ptterns. In Neurl network n rule se pproh Numer of omposite ptterns Dow Jones Inustril Averge Generl Eletri Compny Dt set Numer of Composite ptterns Numer of hien lyer neuron Numer of itertion Fig. 3. Comprison of two pprohes. On the left neurl network se pproh n on the right rnk se pproh TABLE II ERROR OF TWO APPROACHES(IN PERCENTAGE) Stok Time Neurl network n Rnk se n Series Rule se Rule se Dow Jones Inustril Averge Generl Eletri Compny lyer n 3500 itertion on trining t we fin highest verge of 28 ptterns. B. Spermns rnk se n rule se pproh In this omposite pttern reognition pproh we extrt seven (7) feture points from eh sliing winow. In this pproh initil winow length of sliing winow is 15 t n inrese winow length y one rw t until winow length rehe the threshol Winow Length of 20 t on test t. From test tset of Dtset [10] using this Spermns rnk se n rule se pproh we fin 20 omposite ptterns n from test tset of Dtset [11] using this Spermns rnk se n rule se pproh we fin 21 omposite ptterns Fig-3 epits omprison of the numer of omposite ptterns foun using our vrious pprohes. Atul numer of Composite pttern in [10] Dtset is 23 n tul numer of Composite pttern in [11] Dtset is 26. Tle II epits the error of our propose two pprohes. V. CONCLUSIONS In this pper we introue omposite ptterns n propose two hyri omposite pttern mthing pproh Fig. 4. Composite ptterns foun in Dtset of Generl Eletri Compny using neurl network pproh this pper we work with si six ptterns n omposite ptterns originte from them. There re severl more si ptterns n vrious omposite struture n e generte from them. In future work n e one to reognize these severl other ptterns using these hyri pprohes. REFERENCES [1] C. L. Osler, n P. H. K. Chng, He n Shoulers: Not Just Flky Ptternl, Stff Report No.4, Feerl Reserve Bnk of New York. [2] F. Collopy, n J. S. Armstrong, Rule-se foresting:development n vlition of n expert systems pproh to omining time series extrpoltions, Mngement Siene, vol. 38, pp , Otoer [3] H. Ahmi, Testility of the ritrge priing theory y neurl networks, in Proeeings of the Interntionl Conferene on Neurl Networks, Sn Diego, CA, 1990, pp [4] J.H. Choi, M.K. Lee, M.W. Rhee, Tring S& P 500 stok inex futures using neurl network, in Proeeings of the Annul Interntionl Conferene on Arti-il Intelligene Applitions on Wll Street, New York, 1995, pp [5] H. Shtky, S. B. Zonik, Approximte queries n representtions for lrge t sequenes, in Proeeings of Interntionl Conferene on Dt Engineering, Los Almitos, CA: IEEE Computer Soiety Press, 1996, pp [6] G. Ds, K. I. Lin,H. Mnnil, Rule isovery from time series, in Proeeings of the ACM SIGKDD Interntionl Conferene on Knowlege Disovery n Dt Mining, 1998, pp [7] R. Tsih, Y. Hsu, C.C. Li, Foresting S&P 500 stok inex futures with hyri AI system, Deision Support Systems., vol. 23, pp , June [8] T. C. Fu, F. L. Chung, R. Luk, n C. Ng, Stok time series pttern mthing: Templte-se vs. rule-se pprohes, Engineering Applitions of Artifiil Intelligene., vol. 20(3), pp , April [9] Z. Zhng, J. Jing, X. Liu, R. Lu, H. Wng, R. Zhng, A Rel Time Hyri Pttern Mthing Sheme for Stok Time Series, in Pro. ADC2010, [10] DJI+Historil+Pries; Lst esse : June 25, 2012, 1 m GMT. [11] Lst esse : June 25, 2012, 1 m GMT. [12] https://gist.githu.om/ ; Lst esse : June 25, 2012, 1mGMT /12/$ IEEE 178

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

CS 360 Exam 2 Fall 2014 Name

CS 360 Exam 2 Fall 2014 Name CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output

More information

APPROXIMATION AND ESTIMATION MATHEMATICAL LANGUAGE THE FUNDAMENTAL THEOREM OF ARITHMETIC LAWS OF ALGEBRA ORDER OF OPERATIONS

APPROXIMATION AND ESTIMATION MATHEMATICAL LANGUAGE THE FUNDAMENTAL THEOREM OF ARITHMETIC LAWS OF ALGEBRA ORDER OF OPERATIONS TOPIC 2: MATHEMATICAL LANGUAGE NUMBER AND ALGEBRA You shoul unerstn these mthemtil terms, n e le to use them ppropritely: ² ition, sutrtion, multiplition, ivision ² sum, ifferene, prout, quotient ² inex

More information

Computing all-terminal reliability of stochastic networks with Binary Decision Diagrams

Computing all-terminal reliability of stochastic networks with Binary Decision Diagrams Computing ll-terminl reliility of stohsti networks with Binry Deision Digrms Gry Hry 1, Corinne Luet 1, n Nikolos Limnios 2 1 LRIA, FRE 2733, 5 rue u Moulin Neuf 80000 AMIENS emil:(orinne.luet, gry.hry)@u-pirie.fr

More information

Ranking Generalized Fuzzy Numbers using centroid of centroids

Ranking Generalized Fuzzy Numbers using centroid of centroids Interntionl Journl of Fuzzy Logi Systems (IJFLS) Vol. No. July ning Generlize Fuzzy Numers using entroi of entrois S.Suresh u Y.L.P. Thorni N.vi Shnr Dept. of pplie Mthemtis GIS GITM University Vishptnm

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

More information

Section 4.4. Green s Theorem

Section 4.4. Green s Theorem The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

New centroid index for ordering fuzzy numbers

New centroid index for ordering fuzzy numbers Interntionl Sientifi Journl Journl of Mmtis http://mmtissientifi-journlom New entroi inex for orering numers Tyee Hjjri Deprtment of Mmtis, Firoozkooh Brnh, Islmi z University, Firoozkooh, Irn Emil: tyeehjjri@yhooom

More information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

Solutions to Problem Set #1

Solutions to Problem Set #1 CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors

More information

mesuring ro referene points Trget point Pile Figure 1. Conventionl mesurement metho of the pile position In the pst reserh the uthors hve evelope Bum

mesuring ro referene points Trget point Pile Figure 1. Conventionl mesurement metho of the pile position In the pst reserh the uthors hve evelope Bum Development of New Metho for Mesurement of Centrl Ais of Clinril Strutures Using Totl Sttion Kzuhie Nkniw 1 Nouoshi Yuki Disuke Nishi 3 Proshhnk Dzinis 4 1 CEO KUMONOS Corportion Osk Jpn. Emil: nkniw09@knkou.o.jp

More information

ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS

ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS Dvid Miller West Virgini University P.O. BOX 6310 30 Armstrong Hll Morgntown, WV 6506 millerd@mth.wvu.edu

More information

U Q W The First Law of Thermodynamics. Efficiency. Closed cycle steam power plant. First page of S. Carnot s paper. Sadi Carnot ( )

U Q W The First Law of Thermodynamics. Efficiency. Closed cycle steam power plant. First page of S. Carnot s paper. Sadi Carnot ( ) 0-9-0 he First Lw of hermoynmis Effiieny When severl lterntive proesses involving het n work re ville to hnge system from n initil stte hrterize y given vlues of the mrosopi prmeters (pressure p i, temperture

More information

Automatic Synthesis of New Behaviors from a Library of Available Behaviors

Automatic Synthesis of New Behaviors from a Library of Available Behaviors Automti Synthesis of New Behviors from Lirry of Aville Behviors Giuseppe De Giomo Università di Rom L Spienz, Rom, Itly degiomo@dis.unirom1.it Sestin Srdin RMIT University, Melourne, Austrli ssrdin@s.rmit.edu.u

More information

A Non-parametric Approach in Testing Higher Order Interactions

A Non-parametric Approach in Testing Higher Order Interactions A Non-prmetri Approh in Testing igher Order Intertions G. Bkeerthn Deprtment of Mthemtis, Fulty of Siene Estern University, Chenkldy, Sri Lnk nd S. Smit Deprtment of Crop Siene, Fulty of Agriulture University

More information

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1) Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

Tree-based Classifiers for Bilayer Video Segmentation

Tree-based Classifiers for Bilayer Video Segmentation Tree-se Clssifiers for Bilyer Vieo Segmenttion Pei Yin 1 Antonio Criminisi 2 John Winn 2 Irfn Ess 1 1 Shool of Intertive Computing, Georgi Institute of Tehnology, Atlnt, GA 30332, USA 2 Mirosoft Reserh

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P. Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

More information

Mining Frequent Web Access Patterns with Partial Enumeration

Mining Frequent Web Access Patterns with Partial Enumeration Mining Frequent We Aess Ptterns with Prtil Enumertion Peiyi Tng Deprtment of Computer Siene University of Arknss t Little Rok 2801 S. University Ave. Little Rok, AR 72204 Mrkus P. Turki Deprtment of Computer

More information

Outline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression

Outline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression 5-2 Dt Strutures n Algorithms Dt Compression n Huffmn s Algorithm th Fe 2003 Rjshekr Rey Outline Dt ompression Lossy n lossless Exmples Forml view Coes Definition Fixe length vs. vrile length Huffmn s

More information

Prefix-Free Regular-Expression Matching

Prefix-Free Regular-Expression Matching Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings

More information

f (x)dx = f(b) f(a). a b f (x)dx is the limit of sums

f (x)dx = f(b) f(a). a b f (x)dx is the limit of sums Green s Theorem If f is funtion of one vrible x with derivtive f x) or df dx to the Fundmentl Theorem of lulus, nd [, b] is given intervl then, ording This is not trivil result, onsidering tht b b f x)dx

More information

( ) as a fraction. Determine location of the highest

( ) as a fraction. Determine location of the highest AB/ Clulus Exm Review Sheet Solutions A Prelulus Type prolems A1 A A3 A4 A5 A6 A7 This is wht you think of doing Find the zeros of f( x) Set funtion equl to Ftor or use qudrti eqution if qudrti Grph to

More information

Bi-decomposition of large Boolean functions using blocking edge graphs

Bi-decomposition of large Boolean functions using blocking edge graphs Bi-eomposition of lrge Boolen funtions using loking ege grphs Mihir Chouhury n Krtik Mohnrm Deprtment of Eletril n Computer Engineering, Rie University, Houston {mihir,kmrm}@rie.eu Astrt Bi-eomposition

More information

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt

More information

Chapter 19: The Second Law of Thermodynamics

Chapter 19: The Second Law of Thermodynamics hpter 9: he Seon Lw of hermoynmis Diretions of thermoynmi proesses Irreversile n reversile proesses hermoynmi proesses tht our in nture re ll irreversile proesses whih proee spontneously in one iretion

More information

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp. MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.

More information

Section 6.1 Definite Integral

Section 6.1 Definite Integral Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Automata and Regular Languages

Automata and Regular Languages Chpter 9 Automt n Regulr Lnguges 9. Introution This hpter looks t mthemtil moels of omputtion n lnguges tht esrie them. The moel-lnguge reltionship hs multiple levels. We shll explore the simplest level,

More information

Tree Pattern Aggregation for Scalable XML Data Dissemination

Tree Pattern Aggregation for Scalable XML Data Dissemination Tree Pttern Aggregtion for Slle XML Dt Dissemintion Chee-Yong Chn, Wenfei Fn Λ, Psl Feler y, Minos Groflkis, Rjeev Rstogi Bell Ls, Luent Tehnologies fyhn,wenfei,minos,rstogig@reserh.ell-ls.om, Psl.Feler@eureom.fr

More information

ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee

ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee Kngweon-Kyungki Mth. Jour. 10 (2002), No. 2, pp. 117 122 ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups Sng Keun Lee Astrt. In this pper, we give some properties of left(right) semi-regulr nd g-regulr

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

SIDESWAY MAGNIFICATION FACTORS FOR STEEL MOMENT FRAMES WITH VARIOUS TYPES OF COLUMN BASES

SIDESWAY MAGNIFICATION FACTORS FOR STEEL MOMENT FRAMES WITH VARIOUS TYPES OF COLUMN BASES Advned Steel Constrution Vol., No., pp. 7-88 () 7 SIDESWAY MAGNIFICATION FACTORS FOR STEEL MOMENT FRAMES WIT VARIOUS TYPES OF COLUMN BASES J. ent sio Assoite Professor, Deprtment of Civil nd Environmentl

More information

The Trapezoidal Rule

The Trapezoidal Rule _.qd // : PM Pge 9 SECTION. Numericl Integrtion 9 f Section. The re of the region cn e pproimted using four trpezoids. Figure. = f( ) f( ) n The re of the first trpezoid is f f n. Figure. = Numericl Integrtion

More information

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

More information

Stress concentration in castellated I-beams under transverse bending

Stress concentration in castellated I-beams under transverse bending 466 ISSN 13921207. MECHANIKA. 2016 olume 22(6): 466473 Stress onentrtion in stellte I-ems uner trnsverse ening A. Pritykin Kliningr Stte Tehnil University (KGTU), Sovetsky v. 1, 236022, Kliningr, Russi,

More information

LECTURE NOTE #12 PROF. ALAN YUILLE

LECTURE NOTE #12 PROF. ALAN YUILLE LECTURE NOTE #12 PROF. ALAN YUILLE 1. Clustering, K-mens, nd EM Tsk: set of unlbeled dt D = {x 1,..., x n } Decompose into clsses w 1,..., w M where M is unknown. Lern clss models p(x w)) Discovery of

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

OPEN NEWTON - COTES QUADRATURE WITH MIDPOINT DERIVATIVE FOR INTEGRATION OF ALGEBRAIC FUNCTIONS

OPEN NEWTON - COTES QUADRATURE WITH MIDPOINT DERIVATIVE FOR INTEGRATION OF ALGEBRAIC FUNCTIONS IJRET: Interntionl Journl of Reserch in Engineering nd Technology eissn: 9-6 pissn: -78 OPEN NEWTON - COTES QUADRATURE WITH MIDPOINT DERIVATIVE FOR INTEGRATION OF ALGEBRAIC FUNCTIONS T. Rmchndrn R.Priml

More information

ON THE INEQUALITY OF THE DIFFERENCE OF TWO INTEGRAL MEANS AND APPLICATIONS FOR PDFs

ON THE INEQUALITY OF THE DIFFERENCE OF TWO INTEGRAL MEANS AND APPLICATIONS FOR PDFs ON THE INEQUALITY OF THE DIFFERENCE OF TWO INTEGRAL MEANS AND APPLICATIONS FOR PDFs A.I. KECHRINIOTIS AND N.D. ASSIMAKIS Deprtment of Eletronis Tehnologil Edutionl Institute of Lmi, Greee EMil: {kehrin,

More information

Håkan Lennerstad, Lars Lundberg

Håkan Lennerstad, Lars Lundberg GENERALIZATIONS OF THE FLOOR AND CEILING FUNCTIONS USING THE STERN-BROCOT TREE Håkn Lennerstd, Lrs Lunderg Blekinge Institute of Tehnology Reserh report No. 2006:02 Generliztions of the floor nd eiling

More information

INTRODUCTION TO AUTOMATA THEORY

INTRODUCTION TO AUTOMATA THEORY Chpter 3 INTRODUCTION TO AUTOMATA THEORY In this hpter we stuy the most si strt moel of omputtion. This moel els with mhines tht hve finite memory pity. Setion 3. els with mhines tht operte eterministilly

More information

A Region-based Algorithm for Discovering Petri Nets from Event Logs

A Region-based Algorithm for Discovering Petri Nets from Event Logs A Region-se Algorithm for Disovering Petri Nets from Event Logs J. Crmon 1, J. Cortell 1, n M. Kishinevsky 2 1 Universitt Politèni e Ctluny, Spin 2 Intel Corportion, USA Astrt. The pper presents new metho

More information

Periodic string comparison

Periodic string comparison Periodi string omprison Alexnder Tiskin Deprtment of Computer Siene University of Wrwik http://www.ds.wrwik..uk/~tiskin Alexnder Tiskin (Wrwik) Periodi string omprison 1 / 51 1 Introdution 2 Semi-lol string

More information

5: The Definite Integral

5: The Definite Integral 5: The Definite Integrl 5.: Estimting with Finite Sums Consider moving oject its velocity (meters per second) t ny time (seconds) is given y v t = t+. Cn we use this informtion to determine the distnce

More information

Common Voting Rules as Maximum Likelihood Estimators

Common Voting Rules as Maximum Likelihood Estimators Common Voting Rules s Mximum Likelihoo Estimtors Vinent Conitzer Computer Siene Deprtment Crnegie Mellon University 5000 Fores Avenue Pittsurgh, PA 1513 onitzer@s.mu.eu Astrt Voting is very generl metho

More information

Stochastic Subsurface Data Integration Assessing Aquifer Parameter and Boundary Condition Uncertainty

Stochastic Subsurface Data Integration Assessing Aquifer Parameter and Boundary Condition Uncertainty Journl of Hyrology mnusript No. (will e inserte y the eitor) Stohsti Susurfe Dt Integrtion Assessing Aquifer Prmeter n Bounry Conition Unertinty Dongong Wng Ye Zhng Reeive: te / Aepte: te Astrt This reserh

More information

arxiv: v1 [cs.dm] 24 Jul 2017

arxiv: v1 [cs.dm] 24 Jul 2017 Some lsses of grphs tht re not PCGs 1 rxiv:1707.07436v1 [s.dm] 24 Jul 2017 Pierluigi Biohi Angelo Monti Tizin Clmoneri Rossell Petreshi Computer Siene Deprtment, Spienz University of Rome, Itly pierluigi.iohi@gmil.om,

More information

Separable discrete functions: recognition and sufficient conditions

Separable discrete functions: recognition and sufficient conditions Seprle isrete funtions: reognition n suffiient onitions Enre Boros Onřej Čepek Vlimir Gurvih Novemer 21, 217 rxiv:1711.6772v1 [mth.co] 17 Nov 217 Astrt A isrete funtion of n vriles is mpping g : X 1...

More information

Materials Analysis MATSCI 162/172 Laboratory Exercise No. 1 Crystal Structure Determination Pattern Indexing

Materials Analysis MATSCI 162/172 Laboratory Exercise No. 1 Crystal Structure Determination Pattern Indexing Mterils Anlysis MATSCI 16/17 Lbortory Exercise No. 1 Crystl Structure Determintion Pttern Inexing Objectives: To inex the x-ry iffrction pttern, ientify the Brvis lttice, n clculte the precise lttice prmeters.

More information

Tree Pattern Aggregation for Scalable XML Data Dissemination

Tree Pattern Aggregation for Scalable XML Data Dissemination Tree Pttern Aggregtion or Slle XML Dt Dissemintion Chee-Yong Chn, Wenei Fn, Psl Feler, Minos Grolkis, Rjeev Rstogi Bell Ls, Luent Tehnologies yhn,wenei,minos,rstogi @reserh.ell-ls.om, Psl.Feler@eureom.r

More information

Nondeterministic Finite Automata

Nondeterministic Finite Automata Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)

More information

Where did dynamic programming come from?

Where did dynamic programming come from? Where did dynmic progrmming come from? String lgorithms Dvid Kuchk cs302 Spring 2012 Richrd ellmn On the irth of Dynmic Progrmming Sturt Dreyfus http://www.eng.tu.c.il/~mi/cd/ or50/1526-5463-2002-50-01-0048.pdf

More information

The GATE frame. GATE Graphic Approach To Epidemiology. GATE study design (PECOT) GATE study application. GATE study appraisal (RAMMbo)

The GATE frame. GATE Graphic Approach To Epidemiology. GATE study design (PECOT) GATE study application. GATE study appraisal (RAMMbo) GA Grphi Approh o piemiology he GA frme Grphi Apprisl ool for piemiology Grphi Arhiteturl ool for piemiology the shpe of every epiemiologil stuy GA stuy esign () GA stuy nlyses (G & G) G G GA stuy pprisl

More information

Math 360: A primitive integral and elementary functions

Math 360: A primitive integral and elementary functions Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:

More information

Generic Decoupled Image-Based Visual Servoing for Cameras Obeying the Unified Projection Model

Generic Decoupled Image-Based Visual Servoing for Cameras Obeying the Unified Projection Model Generi Deouple Imge-Bse Visul Servoing for Cmers Oeying the Unifie Projetion Moel Omr Thri, Youef Mezour, Frnçois Chumette n Peter Corke Astrt In this pper generi eouple imge-se ontrol sheme for lirte

More information

Thermodynamics. Question 1. Question 2. Question 3 3/10/2010. Practice Questions PV TR PV T R

Thermodynamics. Question 1. Question 2. Question 3 3/10/2010. Practice Questions PV TR PV T R /10/010 Question 1 1 mole of idel gs is rought to finl stte F y one of three proesses tht hve different initil sttes s shown in the figure. Wht is true for the temperture hnge etween initil nd finl sttes?

More information

Introduction to Graphical Models

Introduction to Graphical Models Introution to Grhil Moels Kenji Fukumizu The Institute of Sttistil Mthemtis Comuttionl Methoology in Sttistil Inferene II Introution n Review 2 Grhil Moels Rough Sketh Grhil moels Grh: G V E V: the set

More information

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive

More information

The Word Problem in Quandles

The Word Problem in Quandles The Word Prolem in Qundles Benjmin Fish Advisor: Ren Levitt April 5, 2013 1 1 Introdution A word over n lger A is finite sequene of elements of A, prentheses, nd opertions of A defined reursively: Given

More information

A Mathematical Model for Unemployment-Taking an Action without Delay

A Mathematical Model for Unemployment-Taking an Action without Delay Advnes in Dynmil Systems nd Applitions. ISSN 973-53 Volume Number (7) pp. -8 Reserh Indi Publitions http://www.ripublition.om A Mthemtil Model for Unemployment-Tking n Ation without Dely Gulbnu Pthn Diretorte

More information

The Riemann-Stieltjes Integral

The Riemann-Stieltjes Integral Chpter 6 The Riemnn-Stieltjes Integrl 6.1. Definition nd Eistene of the Integrl Definition 6.1. Let, b R nd < b. ( A prtition P of intervl [, b] is finite set of points P = { 0, 1,..., n } suh tht = 0

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Computerised Retinal Image Analysis to Detect and Quantify Exudates Associated with Diabetic Retinopathy

Computerised Retinal Image Analysis to Detect and Quantify Exudates Associated with Diabetic Retinopathy Computerise Retinl Imge Anlysis to Detet n Quntify Exutes Assoite with Dieti Retinopthy ABSTRACT M. Ponni Bl Assistnt Professor(SRG) Kongu Engineering College Perunuri, Eroe, Tmilnu One of the gretest

More information

Tests for the Ratio of Two Poisson Rates

Tests for the Ratio of Two Poisson Rates Chpter 437 Tests for the Rtio of Two Poisson Rtes Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson

More information

An Efficient Algorithm for Discovering Frequent Subgraphs

An Efficient Algorithm for Discovering Frequent Subgraphs To pper in IEEE Trnstions on Knowledge nd Dt Engineering 1 An Effiient Algorithm for Disovering Frequent Sugrphs Mihihiro Kurmohi nd George Krpis, Memer, IEEE Deprtment of Computer Siene Universit of Minnesot

More information

SECOND HARMONIC GENERATION OF Bi 4 Ti 3 O 12 FILMS

SECOND HARMONIC GENERATION OF Bi 4 Ti 3 O 12 FILMS SECOND HARMONIC GENERATION OF Bi 4 Ti 3 O 12 FILMS IN-SITU PROBING OF DOMAIN POLING IN Bi 4 Ti 3 O 12 THIN FILMS BY OPTICAL SECOND HARMONIC GENERATION YANIV BARAD, VENKATRAMAN GOPALAN Mterils Reserh Lortory

More information

Available online at Procedia Computer Science 5 (2011)

Available online at  Procedia Computer Science 5 (2011) Aville online t www.sieneiret.om Proei Computer Siene 5 (20) 505 52 The 2n Interntionl Conferene on Amient Systems, Networks n Tehnologies Spe Vetor Moultion Diret Torque Spee Control Of Inution Motor

More information

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

1.3 SCALARS AND VECTORS

1.3 SCALARS AND VECTORS Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd

More information

Modeling of Catastrophic Failures in Power Systems

Modeling of Catastrophic Failures in Power Systems Modeling of tstrophi Filures in Power Systems hnn Singh nd lex Sprintson Deprtment of Eletril nd omputer Engineering Texs &M hnn Singh nd lex Sprintson Modeling of tstrophi Filures Motivtion Reent events

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

Solutions to Assignment 1

Solutions to Assignment 1 MTHE 237 Fll 2015 Solutions to Assignment 1 Problem 1 Find the order of the differentil eqution: t d3 y dt 3 +t2 y = os(t. Is the differentil eqution liner? Is the eqution homogeneous? b Repet the bove

More information

H (2a, a) (u 2a) 2 (E) Show that u v 4a. Explain why this implies that u v 4a, with equality if and only u a if u v 2a.

H (2a, a) (u 2a) 2 (E) Show that u v 4a. Explain why this implies that u v 4a, with equality if and only u a if u v 2a. Chpter Review 89 IGURE ol hord GH of the prol 4. G u v H (, ) (A) Use the distne formul to show tht u. (B) Show tht G nd H lie on the line m, where m ( )/( ). (C) Solve m for nd sustitute in 4, otining

More information

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations Introduction: Binding Prt of 4-lecture introduction Scheduling Resource inding Are nd performnce estimtion Control unit synthesis This lecture covers Resources nd resource types Resource shring nd inding

More information

Pre-Lie algebras, rooted trees and related algebraic structures

Pre-Lie algebras, rooted trees and related algebraic structures Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers

More information

A new algorithm for generating Pythagorean triples 1

A new algorithm for generating Pythagorean triples 1 A new lgorithm for generting Pythgoren triples 1 RH Dye 2 nd RWD Nicklls 3 The Mthemticl Gzette (1998; 82 (Mrch, No. 493, pp. 86 91 http://www.nicklls.org/dick/ppers/mths/pythgtriples1998.pdf 1 Introduction

More information

Functions. mjarrar Watch this lecture and download the slides

Functions. mjarrar Watch this lecture and download the slides 9/6/7 Mustf Jrrr: Leture Notes in Disrete Mthemtis. Birzeit University Plestine 05 Funtions 7.. Introdution to Funtions 7. One-to-One Onto Inverse funtions mjrrr 05 Wth this leture nd downlod the slides

More information

INF1383 -Bancos de Dados

INF1383 -Bancos de Dados 3//0 INF383 -ncos de Ddos Prof. Sérgio Lifschitz DI PUC-Rio Eng. Computção, Sistems de Informção e Ciênci d Computção LGER RELCIONL lguns slides sedos ou modificdos dos originis em Elmsri nd Nvthe, Fundmentls

More information

The master ring problem

The master ring problem 2005 Interntionl Conferene on Anlysis of Algorithms DMTCS pro. AD, 2005, 287 296 The mster ring problem Hs Shhni 1 n Lis Zhng 2 1 Computer Siene Dept., Tehnion, Hif 32000, Isrel. 2 Bell Lbs, Luent Tehnologies,

More information

Creating A New Planck s Formula of Spectral Density of Black-body Radiation by Means of AF(A) Diagram

Creating A New Planck s Formula of Spectral Density of Black-body Radiation by Means of AF(A) Diagram nd Jogj Interntionl Physics Conference Enhncing Network nd Collortion Developing Reserch nd Eduction in Physics nd Nucler Energy Septemer 6-9, 007, Yogykrt-Indonesi Creting A New Plnck s Formul of Spectrl

More information

Pythagoras theorem and surds

Pythagoras theorem and surds HPTER Mesurement nd Geometry Pythgors theorem nd surds In IE-EM Mthemtis Yer 8, you lernt out the remrkle reltionship etween the lengths of the sides of right-ngled tringle. This result is known s Pythgors

More information

Harmonic Mean Derivative - Based Closed Newton Cotes Quadrature

Harmonic Mean Derivative - Based Closed Newton Cotes Quadrature IOSR Journl of Mthemtics (IOSR-JM) e-issn: - p-issn: 9-X. Volume Issue Ver. IV (My. - Jun. 0) PP - www.iosrjournls.org Hrmonic Men Derivtive - Bsed Closed Newton Cotes Qudrture T. Rmchndrn D.Udykumr nd

More information

MAC-solutions of the nonexistent solutions of mathematical physics

MAC-solutions of the nonexistent solutions of mathematical physics Proceedings of the 4th WSEAS Interntionl Conference on Finite Differences - Finite Elements - Finite Volumes - Boundry Elements MAC-solutions of the nonexistent solutions of mthemticl physics IGO NEYGEBAUE

More information

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses Chpter 9: Inferences bsed on Two smples: Confidence intervls nd tests of hypotheses 9.1 The trget prmeter : difference between two popultion mens : difference between two popultion proportions : rtio of

More information

Arc Consistency during Search

Arc Consistency during Search Ar Consisten uring Serh Chvlit Likitvivtnvong Shool of Computing Ntionl Universit of Singpore Yunlin Zhng Sott Shnnon Dept of Computer Siene Tes Teh Universit, USA Jmes Bowen Eugene C Freuer Cork Constrint

More information

We use metres to measure length. There are 100 centimetres in a metre. a 6 m = cm b 3 m = cm c 9 m = cm

We use metres to measure length. There are 100 centimetres in a metre. a 6 m = cm b 3 m = cm c 9 m = cm Units of length metres We use metres to mesure length. There re 00 entimetres in metre. 00 m = m Convert these metres to entimetres: 6 m = m 3 m = m 9 m = m 600 300 900 Estimte nd then mesure the length

More information

specication language which is used to describe the behavior of the protocol functions.

specication language which is used to describe the behavior of the protocol functions. 1 Prtil Orer Simultion of SDL Speitions Dniel Toggweiler, Jens Growski, n Dieter Hogrefe University of Berne, Institute for Informtis, Neurukstr. 10, CH-3012 Berne, Switzerln, ftoggweil, growsk, hogrefeg@im.unie.h

More information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

Neighborhood Based Fast Graph Search in Large Networks

Neighborhood Based Fast Graph Search in Large Networks Neighborhood Bsed Fst Grph Serh in Lrge Networks Arijit Khn Dept. of Computer Siene University of Cliforni Snt Brbr, CA 9306 rijitkhn@s.usb.edu Ziyu Gun Dept. of Computer Siene University of Cliforni Snt

More information

H 4 H 8 N 2. Example 1 A compound is found to have an accurate relative formula mass of It is thought to be either CH 3.

H 4 H 8 N 2. Example 1 A compound is found to have an accurate relative formula mass of It is thought to be either CH 3. . Spetrosopy Mss spetrosopy igh resolution mss spetrometry n e used to determine the moleulr formul of ompound from the urte mss of the moleulr ion For exmple, the following moleulr formuls ll hve rough

More information

SEQUENTIAL MOVEMENT IN THE GREAT FISH WAR: A PRELIMINARY ANALYSIS

SEQUENTIAL MOVEMENT IN THE GREAT FISH WAR: A PRELIMINARY ANALYSIS Mjlh Bdn Pengkjin dn Penerpn Teknologi No. 79, Feruri 997 ISSN 06-6569 SEQUENTIAL MOVEMENT IN THE GREAT FISH WAR: A PRELIMINARY ANALYSIS Budy P. Resosudrmo Direktort Pengkjin Sistem Sosil, Ekonomi dn Pengemngn

More information

Tool Support for Checking Railway Interlocking Designs

Tool Support for Checking Railway Interlocking Designs Tool Support for Cheking Rilwy Interloking Designs K. Winter W. Johnston P. Roinson P. Strooper L. vn en Berg Shool of Informtion Tehnology n Eletril Engineering University of Queensln Emil: kirsten@itee.uq.eu.u

More information

Example 3 Find the tangent line to the following function at.

Example 3 Find the tangent line to the following function at. Emple Given n fin eh of the following. () () () () Emple Given fin. Emple Fin the tngent line to the following funtion t. Now ll tht we nee is the funtion vlue n erivtive (for the slope) t. The tngent

More information

Key compiler algorithms (for embedded systems)

Key compiler algorithms (for embedded systems) Key ompiler lgorithms (for emee systems) Peter Mrweel University of Dortmun, Germny P. Mrweel, Univ. Dortmun/Informtik 2 ICD/ES, 2006 Fri 0 0. 0.0 Universität Dortmun Opertions/Wtt [MOPS/mW].0µ ASIC Reonfigurle

More information

4.3 The Sine Law and the Cosine Law

4.3 The Sine Law and the Cosine Law 4.3 Te Sine Lw nd te osine Lw Te ee Tower is te tllest prt of nd s rliment uildings. ronze mst, wi flies te ndin flg, stnds on top of te ee Tower. From point 25 m from te foot of te tower, te ngle of elevtion

More information