Active Contour Model driven by Globally Signed Region Pressure Force
|
|
- Emory Caldwell
- 5 years ago
- Views:
Transcription
1 Ative Contour Moel riven y Glolly Signe Region Pressure Fore Mohmme M. Aelsme n Sotirios A. Tsftris IMT Institute for Avne Stuies, Pizz S. Ponzino, 6, Lu, Itly mohmme.elsme@imtlu.it; s.tsftris@imtlu.it Astrt One of the most populr n wiely use glol tive ontour moels (ACM) is the region-se ACM, whih relies on the ssumption of homogeneous intensity in the regions of interest. As result, most often thn not, when imges violte this ssumption the performne of this metho is limite. Thus, hnling imges tht ontin foregroun ojets hrterize y multiple intensity lsses present hllenge. In this pper, we propose novel tive ontour moel se on new Signe Pressure Fore (SPF) funtion whih we term Glolly Signe Region Pressure Fore (GSRPF). It is esigne to inorporte, in glol fshion, the skewness of the intensity istriution of the region of interest (ROI). It n urtely moulte the signs of the pressure fore insie n outsie the ontour, it n hnle imges with multiple intensity lsses in the foregroun, it is roust to itive noise, n offers high effiieny n rpi onvergene. The propose GSRPF is roust to ontour initiliztion n hs the ility to stop the urve evolution lose to even ill-efine (wek) eges. Our moel provies prmeterfree environment to llow minimum user intervention, n offers oth lol n glol segmenttion properties. Experimentl results on severl syntheti n rel imges emonstrte the high ury of the segmenttion results in omprison to other methos opte from the literture. Inex Terms region-se segmenttion; vritionl level set metho; tive ontours; signe pressure fore I. INTRODUCTION One of the most known pprohes to ojet segmenttion re tive ontour methos. Overll, suh moels n e tegorize into three tegories: ege-se, region-se n hyri moels tht omine the vntges of oth ege n regionl informtion. One of the most populr ege-se moels is the geoesi tive ontours (GAC) moel, first propose in [1]. This moel, n its mny vrints, uses n ege-etetor, usully the grient of the imge, to stop the initil ontour on the ounry of the ojets of interest [1] [7]. As result, the moel hs the ility to hnle well imges with well-efine ege informtion; however, when imges hve high level of noise or the ojet is hrterize y wek eges, they nnot onverge t the right ounries. An lternte pproh, the Chn-Vese tive ontours (C V ) moel [8], is one of the most ommon region-se moels. The min ie ehin this kin of moel is to use region s sttistil intensity informtion to onstrut stopping funtion tht n stop the ontour evolution mong ifferent regions. Compre to ege-se moels, the region-se moel usully performs etter in imges with lurre eges n is less sensitive to the ontour initiliztion. However, y esign, this moel ssumes ertin hrteristi shpe for the intensity istriution for the foregroun n kgroun. A moel tht omines the vntges of the ege-se n region-se moels is the Geoesi-Aie Chn-Vese (GACV ) moel [9]. This hyri moel inlues region n ege informtion in its level set flow funtion. Thus, it n seletively just to lol or glol segmenttion. Zhng et l. [10] propose region-se tive ontour moel (ACM). It utilizes sttistil informtion insie n outsie the ontour to onstrut region-se signe pressure fore (SPF) funtion, whih is le to etter ontrol the iretion of evolution. However, oth moels still ssume Gussin intensity within the ROI. Severl uthors hve onsiere to introue terms tht relte to lol n glol intensity informtion in the SPF funtion to hnle itionl intensity lsses n imge inhomogeneity [11] [14]. However, these moels re sensitive to ontour initiliztion n itive noise of high strength. Furthermore, when the ontour is lose to the ojet ounries, the influene of the glol intensity fore my istrt the ontour from the rel ojet ounry, leing to ojet leking [15]. It is evient tht glol moels nnot ommote ojets tht re onstitute of more thn one intensity lsses n on the other hn lol moels lthough they my e le to hnle suh osions, they re sensitive to initiliztion n my le to leking. In this pper, motivte y these oservtions we propose new energy formultion tht inorportes higher orer sttistis for the intensity istriution insie the ontour. To eliminte the nee for re-initiliztion n elerte the urve evolution, we propose new SPF funtion whih we term Glol Signe Region Pressure Fore (GSRPF) funtion, whih n urtely moulte the signs of the pressure fores insie n outsie the ROIs. This pper is orgnize s follows. In Setion 2 we isuss previous glol tive ontour moels. Setion 3 presents the mthemtil formultion of the propose moel n its numeril implementtion. Setion 4 presents the experimentl results ompring the GSRPF with known moels in the literture on segmenttion ury se on numer of syntheti n rel imges. Finlly, Setion 5 offers onlusions.
2 II. DISCUSSION OF PREVIOUS ACMS In this setion, to ppreite the ontriution of the propose moel we riefly review two wiely use glol region-se tive ontour moels. A. Chn-Vese (C V ) Moel The (C V ) moel [8], the lssil region-se moel, uses the region s sttistil informtion to onstrut region stopping funtion tht n stop the ontour evolution etween ifferent regions. The level set formultion of the C V moel, regring the time evolution of the level set funtion φ, n e esrie s = δ (φ)[µ ( φ/ φ ) v λ 1 (I (x) 1 ) 2 +λ 2 (I (x) 2 ) 2 ], (1) where, I(x) enotes n imge inexe y pixel lotion x, µ 0, v inreses the propgtion spee, λ 1 0, n λ 2 0 re prmeters tht ontrol the influene of eh term. The first term keeps the level set funtion smooth, while the seon n thir terms re the internl n externl fores respetively tht rive the ontour towrs the ojet ounries, n δ (φ) is the Dir funtion. 1 n 2 re efine s follows: Ω I (x) H (φ)x 1 = Ω H (φ)x, (2) 2 = Ω I (x) (1 H (φ))x Ω (1 H (φ))x, (3) where, H (φ) is the Hevisie funtion n Ω is the imge omin. Plinly esrie the C V moel rives the ontour (towrs smooth solution) to enlose regions tht mximize the ifferene in their verge intensity. Overll, ompre to GAC moels tht rely on ege grients the C V moel is less sensitive to initiliztion n n reognize the ojet s ounries effiiently. Furthermore, the implementtion of this moel requires the re-initilize of the evolution urve to e signe istne funtion, whih is omputtionlly expensive opertion. B. Seletive Binry n Gussin Filtering Regulrize (SBGFRLS) Moel The SBGFRLS moel [10] omines the vntges of the C V n GAC moels. It utilizes the sttistil informtion insie n outsie the ontour to onstrut region-se signe pressure fore (SPF) funtion, whih is use in ple of the ege stopping funtion (ie., the informtion relte to imge grients) in the GAC moel. Its level set formultion n e esrie s = sp f (I (x)) α φ, (4) where, α is the lloon fore prmeter (ontrolling the rte expnsion of the level set funtion) n the sp f is efine s I (x) sp f (I (x)) = mx ( I (x) 1 + ), 2 (5) 2 where, 1 n 2 re efine in Eqs. 2 n 3. Oserve tht ompre to the C V moel, in Eq. 1 here the Dir funtion δ(φ) hs een reple y φ whih oring to the uthors hs n effetive rnge of the whole imge, rther thn the smll rnge of the Dir funtionl. Also, the rket in Eq. 1 is reple y the sp f funtion efine in Eq. 5. To regulrize the urve the uthors in [10] (following the prtie of others, e.g., [3], [10], [16]), rther thn relying on the omputtionlly ostly µ ( φ/ φ ) term, they onvolve the level set urve with Gussin kernel (K σ ), ie., φ = K σ φ. (6) This σ ontrols the interfe of the urve s µ oes in Eq. 1 of the C V moel. If the vlue of σ is smll, then the level set funtion is sensitive to the noise n it oes not llow the level set funtion to flow into the nrrow regions of the ojet. Overll this moel is fster, omputtionlly effiient, n performs etter thn the onventionl C V moel s pointe in [10]. III. THE PROPOSED MODEL The mjority of glol intensity se tive ontour moels (s reviewe in the previous setion) ssume tht regions of interest re ompose y flt homogeneous (in intensity) regions. Consequently, when these ssumptions re violte the performne of these moels is fr from the esire. We propose new intensity riven moel tht n effiiently moel the foregroun (ie., the ojet(s)) when they re hrterize y non symmetri istriution. This non symmetry oul rise either from intensity vritions or from the ft tht the ojet oul e ompose y two or more intensity lsses. To provie omputtionlly effiient solution n reue the possiility of trpping into lol minim we provie n SPFlike formultion (whih we term GSRPF). A. Moel Desription It is ovious tht relying only on the glol men (insie n outsie the ontour s in C V moel is not suffiient when esriing intensity istriutions when imges hve foregrouns with more omplex intensity istriutions. To overome this prolem, we minimize the segmenttion energy y introuing the glol mein in ition to the glol men. Assuming ontour C, x pixel lotion in the imge I(x), the energy term is efine s E G ( C, +,m +, ) = + in(c) out(c) λ + e + (x)x 2λ e (x)x (7) e + (x) = I(x) I(x) m + 2, (8) e (x) = I(x) 2, (9) where, λ + n λ efine the weight of eh term (insie n outsie the ontour), + n m + re the slr pproximtions of the men n mein respetively for imge I insie the
3 ontour, n is the slr pproximtion of the men outsie the ontour. Following stnr level set formultions [8] we reple the ontour urve C with the level set funtion φ [17] E G ( φ, +,m +, ) = + φ 0 φ 0 λ + e + (x)x 2λ e (x)x. (10) The sttistil esriptors +, m +, n now n e efine in similr fshion to other intensity riven tive ontour moels s sttistil verges n meins + (φ) = verge(i φ(x) 0), m + (φ) = mein(i φ(x) 0), (11) (φ) = verge(i φ(x) 0), Using the level set funtion φ to represent the ontour C in the omin Ω, the energy funtionl n e written s follows: E G ( φ, +,m +, ) = λ + e + (x)h(φ(x))x Ω + 2λ e (x)(1 H(φ(x)))x, (12) Ω where H is the Hevisie funtion. By keeping +, m +, n fixe, we minimize the energy funtion E G (φ, +,m +, ) with respet to φ to otin the grient esent flow s = δ (φ) [ λ + e + (x) + 2λ e (x) ], (13) where δ is the Dir elt funtion. By onsiering the higher orer sttistis, our moel n overome the limittion of the C V moel s symmetri sttistil ssumption, whih is not urte most of the rellife imges. In the inry gry level imges, our moel s n energy minimiztion moel ehves extly the sme s C V moel where m + = +. However, y hving our moel s GSRPF, implementtion with SPF funtion, it is still more roust to the initiliztion thn C V in hnling inry gry imges. B. The GSRPF sign pressure funtion formultion Although we oul rely on Eq. 13 to upte our level set, otining n SPF like formultion woul reue the possiility of trpping into the lol minimum y well moulting the interior n exterior fores. In this setion we propose suh formultion whih we term Glolly Signe Region Pressure Fore (GSRPF) funtion. It is erive suh tht it n moulte the signs of the pressure fore insie n outsie the ojet of interest using the sttistil quntities efine in Eq. 11 n the minimiztion of the propose energy funtionl of Eq. 13. First, we ssume λ + = λ = 1, then we efine the SPF funtion s follows: sp f (I(x)) = sp f 1 sp f 2 (I(x)), (14) where, { sp f1 = sign( m + 4 ), sp f 2 (I(x)) = sign(i(x) +2 +m m + 4 ), (15) where, +,m +, n re efine in Eq. 11. Rther thn onstnt fore (the α in Eq. 4), we use fore tht is qurti funtion of I(x) to ontrol the propgtion of the evolving urve α(i(x)) = (I(x) +2 + m ) m + 4. (16) The signifine of the propose propgtion funtion α(i(x)) is to ynmilly inrese the interior n exterior fores of the urve when it is fr from the ounries (thus reuing the possiility of entrpment in lol miniml) n erese the fores when the urve is lose to the ounries (thus llowing the urve to stop very lose to the tul ounries). The (per-pixel) multiplition of the propose α(i(x)) n sp f (I(x)) results in new region-se signe pressure fore funtion, whih we term Glolly Signe Region Pressure Fores (GSRPF): gsrp f (I(x)) = α(i(x)) sp f (I(x)). (17) The propose GSRPF hs the pity to moulte the sign of the pressure fores n impliitly ontrol the propgtion of the evolving urve so tht the ontour shrinks when it is outsie the ojet of interest n expns when it is insie the ojet. Following the sp f formultion in setion II-B the finl level set formultion of our moel is: = gsrp f (I (x)) φ. (18) For omputtionl effiieny, s in setion II-B, we use Gussin kernel to regulrize the level set funtion to keep the interfe regulr. The σ of the smoothing kernel is the only ontrol prmeter of the moel. As we will emonstrte in the results setion the propose moel: is ple of ientifying ojets of omplex intensity istriution (y onsiering the skewness of the istriution); is roust to itive noise (e.g. higher orer sttistis is onsiere in our moel to ommote the non symmetri n noisy istriutions); is not sensitive to initiliztion (sine only glol informtion is onsiere for the urve evolution); is omputtionlly effiient (sine it oes not require reinitiliztion of the level set funtion n regulrizes the ontour effiiently); n requires few itertions to onverge.
4 C. Implementtion To illustrte the ese of implementtion of our moel, the min steps of the lgorithm n e summrize s: 1) Initilize the level set funtion φ to e inry s follows: ρ x Ω 0 Ω 0 φ(x,t = 0) = 0 x Ω (19) 0 ρ x Ω Ω 0 where ρ 0 is onstnt, Ω 0 is suset in the imge omin Ω n Ω 0 is the ounry of Ω 0; 2) Clulte the GSRPF with Eq. 17; 3) Evolve the level set oring to Eq. 18; 4) Regulrize the level set oring to Eq. 6; 5) If the urve evolution hs onverge, stop n return the result. Otherwise return to Step 2. IV. EXPERIMENTAL RESULTS In this setion we emonstrte the superiority of the propose metho, ompre to referene implementtions of the methos propose in Setion II, when presente with hllenging syntheti n rel imges. We implemente the propose lgorithm in Mtl R2009 on PC (2.5-GHz Intel(R) Core(TM) 2 Duo, 2.00 GB RAM). For fir omprison we use referene Mtl implementtions of the C V n SBGFRLS. To emonstrte the effetiveness of our pproh in hnling imges where the kgroun hs multiple intensity lsses we rete syntheti imge for this purpose shown in Fig. 1, without itive noise n with noise. We ompre the performne of the propose moel with the C V n SBGFRLS moels, n vry the prmeters. As Fig. 1() illustrtes, y inresing the vlue of σ, the propose GSRPF is less sensitive to the noise n fins ll the regions of the ojet for lrge spn of σ. On the other hn, the SBGFRLS moel (Fig. 1()) is not le to evolve properly through the noisy regions even when ltering the vlues of α n σ vlues. Similrly, s Fig. 1(e) shows, the C V moel is unle to segment the imge with ifferent µ vlues. To emonstrte the ury of the propose metho quntittively we opt the preision n rell metris, n ompre the lgorithms result with the groun truth. Fig. 2 shows the effet of σ on the ury of the segmenttion result using the syntheti imge with noise shown in Fig. 1() using the groun truth. Bse on this experiment, σ = 1.4 is reommene to hnle noisy imges with multiple lsses in the foregroun. Tle I shows the roustness of our moel when ifferent levels of noise is e to the syntheti imge of Fig. 1. The high preision t most noise levels onfirms the ility of the propose GSRPF to fin ll the regions of the ojet irrespetive of noise strength. Fig. 3() illustrtes the ility of the GSRPF moel to fin urtely the ounries of ojets with vrious onvexities, shpes, n noisy kgroun. SBGFRLS n ientify the ojets, however, it is unle to segment the hole insie the ojet, s shown in Fig. 3(). The C V moel is unle to e Fig. 1: A syntheti imge with multiple lsses in the foregroun n the performne of the propose, SBGFRLS, n C V, moels s funtion of their prmeters. () the originl 123 x 80 imge with three ifferent intensities 100, 150 n 200, n its histogrm; () the sme imge with Gussin noise e of stnr evition (SD) 30, n its histogrm. Overli lso is the initil ontour (in re) use in ll susequent tests. From left to right the segmenttion results in () of our moel with ifferent σ vlues (1.4, 1.6, 1.8, n 2); () of SBGFRLS with ifferent σ n α vlues ((2,10), (2,50), (2.5, 10), n (2.5,50) respetively); n (e) of the C V moel with ifferent µ vlues (1.4, 1.6, 1.8, n 2). TABLE I: The roustness of GSRPF moel (σ = 1.4) to noise level: the preision n rell with ifferent Gussin noise levels ontrolle y stnr evition (SD). SD Preision(%) Rell (%) segment this imge (s shown in Fig. 3()) euse C V moel is trppe into the lol minim. To emonstrte the spee n ptility of the propose funtion, in Fig. 4 we show the urve evolution for few itertions. It is reily evient tht our moel onverges fst to n urte elinetion of the foregroun ojet.
5 % e f g h i j k l m n o p 40 Rell Preision Σ Fig. 2: The sensitivity of our moel to the prmeter σ, in segmenting the imge in Fig. 1 with Gussin noise, SD = 30, in terms of Rell n Preision. Fig. 3: The segmenttion results on 101 x 99 syntheti imge ontining ifferent ojets of vrile onvexity n shpe, n noisy kgroun. Left to right: the originl imge (with the initil ontour), propose (σ = 1.4), SBGFRLS, n C V moels. Fig. 4: Demonstrting the rpi evolution of the propose moel (σ = 3.5) on 481 x 321 rel imge (ownloe from [18]). Left to right: initil ontour, ontour t 6 n 9 itertions, n finl ontour (15 itertions). Fig. 5 shows the roustness of the propose GSRPF moel ut the sensitivity of the SBGFRLS n C V moels to ifferent ontour initiliztions. The interior n exterior fores re urtely efine inepenent of the initil ontour s lotion. The initil position of the ontour oes not ffet the finl segmenttion, s Fig. 5(), (f), (j), n (n) show, n the presene of the plne s show oes not le to oversegmenttion. On the other hn, the SBGFRLS moel is unle to urtely segment the ojet when the ontour is initilize outsie the ojet, s shown in Fig. 5(g), (k), n (o). On the other hn, the C V moel is more roust to the initiliztion ompre to SBGFRLS, with the exeption of Fig. 5(p). Fig. 6 emonstrtes the ility of our metho in hnling imges rising in the life n nturl sienes. In Fig. 6() ll moels urtely elinete the ounries of rin mlignny. Fig. 6() shows the ility of our moel to extrt urtely n Ariopsis rosette from omplite kgroun (e.g. soil, pot, try); however, the other two Fig. 5: Testing roustness to initiliztion when segmenting 135 x 125 plne imge otine from [19]. Arrnge s olumns re the originl imge with ifferent ontour initiliztions, n then from left to right the results of the propose GSRPF (σ = 1.4), SBGFRLS (with σ = 1 n α = 25), n C V (with µ = 0.2) moels respetively, when using the sme initil ontour. moels re not le to extrt ll the plnt prts, s seen in Fig. 6() n 6(). Similrly, Fig. 6() n () show the ility of GSRPF to segment multiple ojets in the sene, suh s ells n hromosomes. On the other hn the segmenttion results of the SBGFRLS n C V moels re not stisftory. This is minly ttriute to the ft tht oth moels impose ertin onitions on the foregroun intensity istriution, n s suh they nnot minimize the overlp etween the ojet n kgroun istriutions. To emonstrte the omputtionl effiieny of the propose metho when ompre to other glol methos, Tle II shows the CPU time in seons n finl numer of itertions (to onvergene) for ll the imges use here. Overll it is le to segment the imges in roughly hlf the numer of itertions when ompre to SBGFRLS, nother sp f -like moel. V. C ONCLUSION In this pper, we propose novel energy se-tive ontour moel se on new Glolly Signe Region Pressure Fore (GSRPF) funtion. GSRPF onsiers the glol informtion extrte from n ROI n ommotes lso foregroun intensity istriutions tht re not neessrily symmetri. It utomtilly n effiiently moultes the signs of the pressure fores insie n outsie the ontour. The resulting lgorithm is less sensitive to noise, ontour initiliztion, n n hnle imges with omplexity in the foregroun
6 TABLE II: The CPU time n numer of itertions require y the propose GSRPF, SBGFRLS, n C V moels to segment the foregroun in some of the imges use here. Figure GSRPF SBGFRLS C-V CPU Time(s) Itertions CPU Time(s) Itertions CPU Time(s) Itertions Fig. 3() Fig. 5() Fig. 6() Fig. 6() Fig. 6() Fig. 6() Fig. 6: Segmenttion results when ifferent rel imges enountere in the life or nturl sienes re use. Arrnge s rows re: () 109 x 119 rin MRI imge, from [20]; () 436 x 422 Ariopsis optil imge with omplex kgroun; () 256 x 256 ellulose mirosopy imge, from [21]; n () 256 x 256 hromosome mirosopy imge, from [21]. Arrnge s olumns re the originl imge (with the initil ontour), n then from left to right the results of the propose GSRPF, SBGFRLS, n C V moels respetively, when using the sme initil ontour. (Prmeters s in Fig. 5, exept () of GSRPF (σ = 1)). n/or kgroun. Our moel is Gussin regulrizing level set moel tht relies only on single prmeter. It is esigne to hve qurti ehvior to onverge in few itertions without penlizing segmenttion ury. Results on syntheti n rel imges from vriety of senrios emonstrte the superiority of our moel in segmenttion ury when ompre with well regre glol level set methos, suh s the SBGFRLS [10] n C V [8] moels. REFERENCES [1] V. Cselles, R. Kimmel, n G. Spiro, Geoesi Ative Contours, Interntionl Journl of Computer Vision, vol. 22, no. 1, pp , Fe [2] S. Kihenssmy, A. Kumr, n P. Olver, Conforml Curvture Flows: From Phse Trnsitions to Ative Vision, [3] G. Zhu, Bounry-se imge segmenttion using inry level set metho, Optil Engineering, vol. 46, no. 5, pp , My [4] N. Prgios n R. Derihe, Geoesi tive ontours n level sets for the etetion n trking of moving ojets, Pttern Anlysis n Mhine Intelligene, IEEE Trnstions on, vol. 22, no. 3, pp , Mr [5] C. Xu n J. L. Prine, Snkes, Shpes, n Grient Vetor Flow, in IEEE Trnstions on Imge Proessing, 1998, pp [6] A. Vsilevskiy n K. Siiqi, Flux Mximizing Geometri Flows, in IEEE Trnstions on Pttern Anlysis n Mhine Intelligene, 2001, pp [7] C. Li, C. Xu, C. Gui, n M. D. Fox, Level set evolution without re-initiliztion: A new vritionl formultion, in in Pro. of IEEE Conferene on Computer Vision n Pttern Reognition, 2005, pp [8] T. F. Chn n L. A. Vese, Ative ontours without eges, Imge Proessing, IEEE Trnstions on, vol. 10, no. 2, pp , Fe [9] L. Chen, Y. Zhou, Y. Wng, n J. Yng, GACV: Geoesi-Aie CV metho, Pttern Reognition, vol. 39, no. 7, pp , Jul [10] K. Zhng, L. Zhng, H. Song, n W. Zhou, Ative ontours with seletive lol or glol segmenttion: A new formultion n level set metho, Imge n Vision Computing, vol. 28, no. 4, pp , Apr [11] L. Wng, L. He, A. Mishr, n C. Li, Ative ontours riven y lol Gussin istriution fitting energy, Signl Proessing, vol. 89, no. 12, pp , De [12] P. Wng, K. Sun, n Z. Chen, Lol n Glol Intensity Informtion Integrte Geoesi Moel for Imge Segmenttion, in Computer Siene n Eletronis Engineering (ICCSEE), 2012 Interntionl Conferene on, vol. 2. IEEE, Mr. 2012, pp [13] T.-T. Trn, V.-T. Phm, Y.-J. Chiu, n K.-K. Shyu, Ative ontour with seletive lol or glol segmenttion for intensity inhomogeneous imge, in Computer Siene n Informtion Tehnology (ICCSIT), r IEEE Interntionl Conferene on, vol. 1. IEEE, Jul. 2010, pp [14] U. Vovk, F. Pernus, n B. Likr, A Review of Methos for Corretion of Intensity Inhomogeneity in MRI, Meil Imging, IEEE Trnstions on, vol. 26, no. 3, pp , Mr [15] S. Liu n Y. Peng, A lol region-se ChnVese moel for imge segmenttion, Pttern Reognition, vol. 45, no. 7, pp , Jul [16] Y. Shi n W. C. Krl, Rel-time trking using level sets, in Computer Vision n Pttern Reognition, CVPR IEEE Computer Soiety Conferene on, vol. 2. IEEE, Jun. 2005, pp vol. 2. [17] H.-K. Zho, T. Chn, B. Merrimn, n S. Osher, A Vritionl Level Set Approh to Multiphse Motion, Journl of Computtionl Physis, vol. 127, no. 1, pp , [18] [19] skhzhng/. [20] liw/. [21]
CS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationRanking 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 informationNow we must transform the original model so we can use the new parameters. = S max. Recruits
MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with
More informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More informationAlgebra 2 Semester 1 Practice Final
Alger 2 Semester Prtie Finl Multiple Choie Ientify the hoie tht est ompletes the sttement or nswers the question. To whih set of numers oes the numer elong?. 2 5 integers rtionl numers irrtionl numers
More informationfor 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 informationA Primer on Continuous-time Economic Dynamics
Eonomis 205A Fll 2008 K Kletzer A Primer on Continuous-time Eonomi Dnmis A Liner Differentil Eqution Sstems (i) Simplest se We egin with the simple liner first-orer ifferentil eqution The generl solution
More informationEdexcel Level 3 Advanced GCE in Mathematics (9MA0) Two-year Scheme of Work
Eexel Level 3 Avne GCE in Mthemtis (9MA0) Two-yer Sheme of Work Stuents stuying A Level Mthemtis will tke 3 ppers t the en of Yer 13 s inite elow. All stuents will stuy Pure, Sttistis n Mehnis. A level
More informationTechnology Mapping Method for Low Power Consumption and High Performance in General-Synchronous Framework
R-17 SASIMI 015 Proeeings Tehnology Mpping Metho for Low Power Consumption n High Performne in Generl-Synhronous Frmework Junki Kwguhi Yukihie Kohir Shool of Computer Siene, the University of Aizu Aizu-Wkmtsu
More informationSOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES
Avne Mth Moels & Applitions Vol3 No 8 pp63-75 SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVE STOCHASTIC PROCESSES ON THE CO-ORDINATES Nurgül Okur * Imt Işn Yusuf Ust 3 3 Giresun University Deprtment
More informationNecessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationThe DOACROSS statement
The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More informationFactorising FACTORISING.
Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will
More informationParticle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap
Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly
More informationOn a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journl of Grph Algorithms n Applitions http://jg.info/ vol. 13, no. 2, pp. 153 177 (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of
More informationI 3 2 = I I 4 = 2A
ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents
More informationEigenvectors and Eigenvalues
MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.
More information2.4 Theoretical Foundations
2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level
More informationCommon intervals of genomes. Mathieu Raffinot CNRS LIAFA
Common intervls of genomes Mthieu Rffinot CNRS LIF Context: omprtive genomis. set of genomes prtilly/totlly nnotte Informtive group of genes or omins? Ex: COG tse Mny iffiulties! iology Wht re two similr
More informationLecture 8: Abstract Algebra
Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this
More informationEngr354: Digital Logic Circuits
Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost
More informationSection 2.3. Matrix Inverses
Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue
More informationCSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4
Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones
More informationTIME-VARYING AND NON-LINEAR DYNAMICAL SYSTEM IDENTIFICATION USING THE HILBERT TRANSFORM
Proeeings of ASME VIB 5: th Biennil Conferene on Mehnil Virtion n Noise Septemer 4-8, 5 Long Beh, CA, USA DETC5-84644 TIME-VARYING AND NON-LINEAR DYNAMICAL SYSTEM IDENTIFICATION USING THE HILBERT TRANSFORM
More informationMomentum and Energy Review
Momentum n Energy Review Nme: Dte: 1. A 0.0600-kilogrm ll trveling t 60.0 meters per seon hits onrete wll. Wht spee must 0.0100-kilogrm ullet hve in orer to hit the wll with the sme mgnitue of momentum
More informationSolutions 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 informationVISIBLE AND INFRARED ABSORPTION SPECTRA OF COVERING MATERIALS FOR SOLAR COLLECTORS
AGRICULTURAL ENGINEERING VISIBLE AND INFRARED ABSORPTION SPECTRA OF COVERING MATERIALS FOR SOLAR COLLECTORS Ltvi University of Agriulture E-mil: ilze.pelee@llu.lv Astrt Use of solr energy inreses every
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationCARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005
RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationCompression of Palindromes and Regularity.
Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht
More informationLet s divide up the interval [ ab, ] into n subintervals with the same length, so we have
III. INTEGRATION Eonomists seem muh more intereste in mrginl effets n ifferentition thn in integrtion. Integrtion is importnt for fining the epete vlue n vrine of rnom vriles, whih is use in eonometris
More informationUniversity of Sioux Falls. MAT204/205 Calculus I/II
University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques
More informationSOME COPLANAR POINTS IN TETRAHEDRON
Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON
More informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More information22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:
22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)
More informationMonochromatic Plane Matchings in Bicolored Point Set
CCCG 2017, Ottw, Ontrio, July 26 28, 2017 Monohromti Plne Mthings in Biolore Point Set A. Krim Au-Affsh Sujoy Bhore Pz Crmi Astrt Motivte y networks interply, we stuy the prolem of omputing monohromti
More informationReview Topic 14: Relationships between two numerical variables
Review Topi 14: Reltionships etween two numeril vriles Multiple hoie 1. Whih of the following stterplots est demonstrtes line of est fit? A B C D E 2. The regression line eqution for the following grph
More informationFor a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then
Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:
More informationCS261: A Second Course in Algorithms Lecture #5: Minimum-Cost Bipartite Matching
CS261: A Seon Course in Algorithms Leture #5: Minimum-Cost Biprtite Mthing Tim Roughgren Jnury 19, 2016 1 Preliminries Figure 1: Exmple of iprtite grph. The eges {, } n {, } onstitute mthing. Lst leture
More informationOutline 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 informationU 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 informationTree-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 informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationNON-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 informationDIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS
Krgujev Journl of Mthemtis Volume 38() (204), Pges 35 49. DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS MOHAMMAD W. ALOMARI Abstrt. In this pper, severl bouns for the ifferene between two Riemn-
More informationOn Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras
Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationCH 17: Flexible Mechanical Elements
CH 17: lexible Mehnil Elements lexible mehnil elements (belts, hins, ropes re use in onveying systems n to trnsmit power over long istnes (inste of using shfts n gers. The use of flexible elements simplifies
More informationAPPLICATION OF STRASSEN S ALGORITHM IN RHOTRIX ROW-COLUMN MULTIPLICATION
Informtion Tehnology for People-entre Development (ITePED ) APPLIATION OF STRASSEN S ALGORITHM IN RHOTRIX ROW-OLUMN MULTIPLIATION Ezugwu E. Aslom 1, Aullhi M., Sni B. 3 n Juniu B. Shlu 4 Deprtment of Mthemtis,
More informationwhere the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b
CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}
More informationPOSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS
Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive
More informationGeneric 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 informationMATH 122, Final Exam
MATH, Finl Exm Winter Nme: Setion: You must show ll of your work on the exm pper, legily n in etil, to reeive reit. A formul sheet is tthe.. (7 pts eh) Evlute the following integrls. () 3x + x x Solution.
More informationCOMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY TREES OF BOUNDED DEGREE
COMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY TREES OF BOUNDED DEGREE M. STISSING, C. N. S. PEDERSEN, T. MAILUND AND G. S. BRODAL Bioinformtis Reserh Center, n Dept. of Computer Siene, University
More informationSurds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,
Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.
More informationUnit 4. Combinational Circuits
Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationComposite Pattern Matching in Time Series
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 slekin@gmil.om
More informationLecture 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 informationBivariate drought analysis using entropy theory
Purue University Purue e-pus Symposium on Dt-Driven Approhes to Droughts Drought Reserh Inititive Network -3- Bivrite rought nlysis using entropy theory Zengho Ho exs A & M University - College Sttion,
More informationResearch Article. ISSN (Print) *Corresponding author Askari, A
Sholrs Journl of Engineering n Tehnology (SJET) Sh. J. Eng. Teh., 4; (6B):84-846 Sholrs Aemi n Sientifi Pulisher (An Interntionl Pulisher for Aemi n Sientifi Resoures) www.sspulisher.om ISSN 3-435X (Online)
More informationThe Stirling Engine: The Heat Engine
Memoril University of Newfounln Deprtment of Physis n Physil Oenogrphy Physis 2053 Lortory he Stirling Engine: he Het Engine Do not ttempt to operte the engine without supervision. Introution Het engines
More informationLearning Objectives of Module 2 (Algebra and Calculus) Notes:
67 Lerning Ojetives of Module (Alger nd Clulus) Notes:. Lerning units re grouped under three res ( Foundtion Knowledge, Alger nd Clulus ) nd Further Lerning Unit.. Relted lerning ojetives re grouped under
More informationImplication Graphs and Logic Testing
Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,
More informationAppendix A: HVAC Equipment Efficiency Tables
Appenix A: HVAC Equipment Effiieny Tles Figure A.1 Resientil Centrl Air Conitioner FEMP Effiieny Reommention Prout Type Reommene Level Best Aville 11.0 or more EER 14.6 EER Split Systems 13.0 or more SEER
More informationLaboratory for Foundations of Computer Science. An Unfolding Approach. University of Edinburgh. Model Checking. Javier Esparza
An Unfoling Approh to Moel Cheking Jvier Esprz Lbortory for Fountions of Computer Siene University of Einburgh Conurrent progrms Progrm: tuple P T 1 T n of finite lbelle trnsition systems T i A i S i i
More informationComputing 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 informationMetaheuristics for the Asymmetric Hamiltonian Path Problem
Metheuristis for the Asymmetri Hmiltonin Pth Prolem João Pero PEDROSO INESC - Porto n DCC - Fule e Ciênis, Universie o Porto, Portugl jpp@f.up.pt Astrt. One of the most importnt pplitions of the Asymmetri
More informationSIMPLE NONLINEAR GRAPHS
S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle
More informationDistributed Generation Placement in Unbalanced Distribution System with Seasonal Load Variation
Distriuted Genertion Plement in Unlned Distriution System with Sesonl Lod Vrition Rvi Tej Bhimrsetti Dept. of Eletril Engg., NT Kurukshetr Kurukshetr, ndi svrtej@gmil.om Ashwni Kumr, Memer, EEE Dept. of
More informationSolids of Revolution
Solis of Revolution Solis of revolution re rete tking n re n revolving it roun n is of rottion. There re two methos to etermine the volume of the soli of revolution: the isk metho n the shell metho. Disk
More informationStatistics in medicine
Sttistis in meiine Workshop 1: Sreening n ignosti test evlution Septemer 22, 2016 10:00 AM to 11:50 AM Hope 110 Ftm Shel, MD, MS, MPH, PhD Assistnt Professor Chroni Epiemiology Deprtment Yle Shool of Puli
More informationSignificantly Improved Multi-bit Differentials for Reduced Round Salsa and ChaCha
Signifintly Improve Multi-it Differentils for Reue Roun Sls n ChCh Ark Ri Chouhuri n Suhmoy Mitr Deprtment of Computer Siene, Johns Hopkins University, 3400 N Chrles St, Bltimore, MD 8, USA hou@s.jhu.eu
More information1 This diagram represents the energy change that occurs when a d electron in a transition metal ion is excited by visible light.
1 This igrm represents the energy hnge tht ours when eletron in trnsition metl ion is exite y visile light. Give the eqution tht reltes the energy hnge ΔE to the Plnk onstnt, h, n the frequeny, v, of the
More informationStochastic 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 informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationNew 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 informationData 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 informationOn the properties of the two-sided Laplace transform and the Riemann hypothesis
On the properties of the two-sie Lple trnsform n the Riemnn hypothesis Seong Won Ch, Ph.D. swh@gu.eu Astrt We will show interesting properties of two-sie Lple trnsform, minly of positive even funtions.
More informationModel Reduction of Finite State Machines by Contraction
Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900
More informationA Disambiguation Algorithm for Finite Automata and Functional Transducers
A Dismigution Algorithm for Finite Automt n Funtionl Trnsuers Mehryr Mohri Cournt Institute of Mthemtil Sienes n Google Reserh 51 Merer Street, New York, NY 1001, USA Astrt. We present new ismigution lgorithm
More informationCSC2542 State-Space Planning
CSC2542 Stte-Spe Plnning Sheil MIlrith Deprtment of Computer Siene University of Toronto Fll 2010 1 Aknowlegements Some the slies use in this ourse re moifitions of Dn Nu s leture slies for the textook
More informationEXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED
EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED Astrt. The GCD Str of Dvi Theorem n the numerous ppers relte to it hve lrgel een evote to shoing the equlit
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationINTRODUCTION 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 informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationA Family of Logical Fault Models for Reversible Circuits
A Fmily of Logil Fult Moels for Reversile Ciruits Ili Polin John P. Hyes Thoms Fiehn Bern Beker Alert-Luwigs-University Georges-Köhler-Allee 5 79 Freiurg i. Br., Germny {polin fiehn eker}@informtik.uni-freiurg.e
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationCS 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 informationAVL Trees. D Oisín Kidney. August 2, 2018
AVL Trees D Oisín Kidne August 2, 2018 Astrt This is verified implementtion of AVL trees in Agd, tking ides primril from Conor MBride s pper How to Keep Your Neighours in Order [2] nd the Agd stndrd lirr
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More information8 THREE PHASE A.C. CIRCUITS
8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),
More information