Research Article Shape Preserving Interpolation Using C 2 Rational Cubic Spline

Size: px
Start display at page:

Download "Research Article Shape Preserving Interpolation Using C 2 Rational Cubic Spline"

Transcription

1 Applied Mahemaics Volume 1, Aricle ID 73, 1 pages hp://dx.doi.org/1.11/1/73 Research Aricle Shape Preserving Inerpolaion Using C Raional Cubic Spline Samsul Ariffin Abdul Karim 1 and Kong Voon Pang 1 Fundamenal and Applied Sciences Deparmen, Universii Teknologi PETRONAS, Bandar Seri Iskandar, 31 Seri Iskandar, Perak Darul Ridzuan, Malaysia School of Mahemaical Sciences, Universii Sains Malaysia (USM), 11 Minden, Penang, Malaysia Correspondence should be addressed o Samsul Ariffin Abdul Karim; samsul ariffin@peronas.com.my Received 1 January 1; Revised 1 April 1; Acceped 1 April 1 Academic Edior: Francisco J. Marcellán Copyrigh 1 S. A. Abdul Karim and K. Voon Pang. This is an open access aricle disribued under he Creaive Commons Aribuion License, which permis unresriced use, disribuion, and reproducion in any medium, provided he original work is properly cied. This paper discusses he consrucion of new C raional cubic spline inerpolan wih cubic numeraor and quadraic denominaor. The idea has been exended o shape preserving inerpolaion for posiive daa using he consruced raional cubic spline inerpolaion. The raional cubic spline has hree parameers α i, β i,andγ i. The sufficien condiions for he posiiviy are derived on one parameer γ i while he oher wo parameers α i and β i are free parameers ha can be used o change he final shape of he resuling inerpolaing curves. This will enable he user o produce many varieies of he posiive inerpolaing curves. Cubic spline inerpolaion wih C coninuiyisnoableopreserveheshapeofheposiivedaa.noablyourschemeiseasyouse and does no require knos inserion and C coninuiy can be achieved by solving ridiagonal sysems of linear equaions for he unknown firs derivaives d i, i=1,...,n 1. Comparisons wih exising schemes also have been done in deail. From all presened numerical resuls he new C raional cubic spline gives very smooh inerpolaing curves compared o some esablished raional cubic schemes. An error analysis when he funcion o be inerpolaed is f() C 3 [, n ] is also invesigaed in deail. 1. Inroducion Spline inerpolaion has been used exensively in many research disciplines such as in car design and airplane fuselage. Univariae and bivariae spline can be used o approximae or inerpolae he given finie daa ses. Even hough he cubic spline has second-order parameric coninuiy, C, i has some weakness such ha he inerpolaing curves may give few unwaned behavior of he original daa due o he exising wiggles along some inerval. This uncharacerisic behavior may desroy he daa. If he given daa is posiive cubic spline may give some negaive values along he whole inerval he inerpolaing curves will lie below xaxis. For some applicaion any negaiviy is unaccepable. For example, he wind speed, solar energy, and rainfall received are always having posiive values and any negaiviy values need o be avoided as i may desroy any imporan informaion ha may exisn he original daa. Similarly if he daa is monoone, hen he resuling inerpolaing curves also mus be monoone oo. Furhermore if he given daa is convex, he raional cubic spline inerpolaion should be able o mainain he shape of he original daa. Thus shape preserving inerpolaion is imporann compuer graphics and compuer aided geomeric design (CAGD). Due o he fac ha cubic spline is no able o produce compleely he posiive, monoone, and convex inerpolaing curves on enire given inerval, many researchers have proposed several mehods and idea o preserve he posiiviy, monooniciy, and convexiy of he daa. Frisch and Carlson [1] and Doughery e al. [] have discussed he monooniciy, posiiviy, and convexiy preserving by using cubic spline inerpolaion by modifying he firs derivaive values in which he shape violaion is found. Bu and Brodlie [3] and Brodlie and Bu [] have used cubic spline inerpolaion o preserve he posiiviy and convexiy of he finie daa by insering exra knos in he inerval in which he posiiviy and/or convexiy is no preserved by he cubic spline. Their mehods did no give any exra freedom o he user in conrolling he final shape of he inerpolaing curves. In order o change he final shape of he inerpolaing curves, he user needs o

2 Applied Mahemaics change he given daa. Anoher hing is ha heir mehods require he modificaion of he firs derivaive parameers. Sarfraz [], Sarfraz e al. [, 7], and Abbas [] sudied he use of raional cubic inerpolan for preserving he posiive daa. Meanwhile M. Z. Hussain and M. Hussain [9] sudied posiiviy preserving for curves and surfaces by uilizing raional cubic spline wih quadraic denominaor. In works by Hussain e al. [1] and Sarfraz e al. [11] he raional cubic spline wih quadraic denominaor has been used for posiiviy, monooniciy, and convexiy preserving wih C coninuiy. Hussain e al. [1] have only one free parameer meanwhile Sarfraz e al. [11] have no free parameer. Abbas [] and Abbas e al. [1] have discussed he posiiviy by using new C raional cubic spline wih wo free parameers. Anoher paper concerning C raionalsplinecanbefound by Delbourgo [13], Gregory [1], and Delbourgo and Gregory [1]. Karim and Kong [1 19] have proposed new C 1 raional cubic spline (cubic/quadraic) wih hree parameers wo of hem are free parameers. The raional cubic spline has been successfully applied o he local conrol of he inerpolaing funcions, posiiviy, monooniciy, and convexiy preserving as well as he derivaive conrol including an error analysis when he funcion o be inerpolaed is f() C 3 [, n ]. Moivaed by he works of Tian e al. [], Abbaseal.[1],Hussaineal.[1],andSarfrazeal.[11],in his paper he auhors will proposed new C raional cubic spline for posiiviy, monooniciy, and convexiy preserving and daa consrained modeling. Under some circumsances our C raional cubic spline will give new C raional cubic spline based on raional cubic spline defined by Tian e al. []. Numerical comparison beween C raional cubic spline and he works of Hussain e al. [1], Abbas [], Abbas e al. [1], and Sarfraz e al. [11] also has been made comprehensively. From all presened numerical resuls shape preserving inerpolaion by using he new C raional cubic spline gives comparable resuls wih exising raional cubic spline schemes. The main scienific conribuion of his paper is summarized as follows: (i) In his paper C raional cubic spline (cubic/ quadraic) wih hree parameers has been used for posiiviy, monooniciy, and convexiy preserving and consrained daa modeling while in works by Karim and Kong [17 19], M. Z. Hussain and M. Hussain[9],andSarfraz[]hedegreeofsmoohness aained is C 1. (ii) Hussain e al. [1] and Sarfraz e al. [11] discussed he posiiviy by using C raional cubic spline (cubic/quadraic) wih wo parameers wih one or no free parameer while our raional cubic spline has wo free parameers. Even hough Abbas e al. [1] also proposed C raional cubic spline (cubic/quadraic) wih wo parameers, heir raional spline is differen form our raional cubic spline. Furhermore i was noiced ha schemes of Abbas e al. [1] may no be able o produce compleely posiive inerpolaing curves wih C coninuiy. (iii) When γ i =,wemayobainhenewc raional cubic spline wih wo parameers, an exension o he original C 1 raional cubic spline of Tian e al. []. Thus our C raional cubic spline gives a larger class of raional cubic spline which also includes he raional cubicsplineoftianeal.[]. (iv)ourraionalschemeislocalwhileinlamberiand Manni [1] heir scheme is global. Furhermore our raional scheme works well for boh equally and unequally spaced daa while he raional spline inerpolan by Duan e al. [] and Bao e al. [3] only works for equally spaced daa. (v) Numerical comparisons beween he C raional cubic spline and he exising schemes such as Hussain e al. [1], Sarfraz e al. [11], and Abbas e al. [1] for posiiviy preserving and C 1 raional spline of Karim and Kong [17 19] also have been done comprehensively. (vi) Our mehod also does no require any knos inserion. Meanwhile he cubic spline inerpolaion by Bu and Brodlie[3],BrodlieandBu[],andFioroandTabka [] requires knos inserion in he inerval he inerpolaing curves produce he negaive values (lies below ) for posiive daa, nonmonoone inerpolaing curves (for monoone daa), and nonconvex inerpolaing curves for convex daa. (vii) This paper uilized he raional cubic spline meanwhile in Dube and Tiwari [], Pan and Wang [], and Ibraheem e al. [7] he raional rigonomeric spline is used in place of sandard raional cubic spline. Thus no rigonomeric funcions are involved. Therefore he mehod is no compuaionally expensive. The remainder of he paper is organized as follows. Secion inroduces he new C raional cubic spline wih hree parameers, wih some discussion on he mehods o esimae he firs derivaives values as well as shape conrols of he raional cubic spline inerpolaion. Meanwhile Secion 3 discusses he posiiviy preserving by using C raional cubic spline ogeher wih numerical demonsraions as well as comparison wih some exising schemes including error analysis. Secion is devoed for research discussion. Finally a summary and conclusions are given in Secion.. C Raional Cubic Spline Inerpolan This secion will inroduce C raional cubic spline inerpolan wih hree parameers. Originally his raional cubic spline has been iniiaed by Karim and Kong [1]. The main difference is han his paper he raional cubic spline has C coninuiywhileinworkbykarimandkong[1]ihas C 1 coninuiy. We begin wih he definiion of C raional cubic spline inerpolan, given se of daa poins (x i,f i ), i =,1,...,n}such ha x <x 1 < <x n.leh i =x i+1 x i, Δ i =(f i+1 f i )/h i and θ=(x x i )/h i, θ 1.For

3 Applied Mahemaics 3 x [x i,x i+1 ], i =, 1,,..., n 1, he raional cubic spline inerpolan wih hree parameers is defined as follows: s (x) s i (x) = A i (1 θ) 3 +A i1 θ (1 θ) +A i θ (1 θ) +A i3 θ 3 (1 θ) α i +θ(1 θ) (α i β i +γ i )+θ β i. The following condiions will assure ha he raional cubic spline inerpolann (1) has C coninuiy: s(x i )=f i, s(x i+1 )=f i+1, s (1) (x i )=d i, s (1) (x i+1 )=d i+1, (1) () Now C coninuiy, s () (x i+ )=s () (x i ), i = 1,,...,n 1, will give [γ i 1 (d i Δ i 1 ) α i 1 (Δ i 1 d i 1 β i 1 (d i Δ i 1 ))] h i 1 β i 1 = (γ i (Δ i d i ) β i (d i+1 Δ i ) α i β i (d i Δ i )) h i α i. Now () provides he following sysem of linear equaions ha can be used o compue he firs derivaive parameers, d i, i=1,,...,n 1,suchha wih () a i d i 1 +b i d i +c i d i+1 =e i, i=1,,...,n 1, (7) a i =h i α i 1 α i, b i =h i α i (γ i 1 +α i 1 β i 1 )+h i 1 β i 1 (γ i +α i β i ), s () (x i+ )=s () (x i ), c i =h i 1 β i 1 β i, () s (1) (x i ) and s () (x i ) denoe he firs- and second-order derivaive wih respec o x, respecively. Meanwhile he noaions s () (x i+ ) and s () (x i ) correspond o he righ and lef second derivaives values. Furhermore d i denoes he derivaive value which is given a he kno x i, i=,1,,...,n. By using (), he required C raional cubic spline inerpolan wih hree parameers defined by (1) has he unknowns A ij, j =, 1,, 3, and is given as follows: A i =α i f i, A i1 =(α i β i +α i +γ i )f i +α i h i d i, A i =(α i β i +β i +γ i )f i+1 β i h i d i+1, A i3 =β i f i+1. The parameers α i,β i >, γ i areusedoconrolhefinal shape of he inerpolaing curves. From work by Karim and Kong [19], he second-order derivaive s () (x) is given as s () (x) = 3 j= C ij (1 θ) 3 j θ j (3) h i [Q i (θ)] 3, () e i =h i α i (γ i 1 +α i 1 +α i 1 β i 1 )Δ i 1 +h i 1 β i 1 (γ i +β i +α i β i )Δ i. The sysem of linear equaions given by (7) is sricly ridiagonalandhasauniquesoluionforheunknownderivaive parameers d i, i=1,,...,n 1,forallα i,β i >, γ i.the sysem in (7) gives n 1linear equaions for n+1unknown derivaive values. Thus wo more equaions are required in order o obain he unique soluion in (7). The following is common choices for he end poins condiion, has, d and d n : s (1) (x )=d, s (1) (x n )=d n. By using (3), C raional cubic spline inerpolann (1) can be reformulaed and is given as follows: P i (θ) =α i f i (1 θ) 3 (9) s (x) s i (x) = P i (θ) Q i (θ), (1) C i =α i (γ i (Δ i d i ) β i (d i+1 Δ i ) α i β i (d i Δ i )), +((α i β i +α i +γ i )f i +α i h i d i )θ(1 θ) +((α i β i +β i +γ i )f i+1 β i h i d i+1 )θ (1 θ) (11) C i1 =α i β i (Δ i d i ), C i =α i β i (d i+1 Δ i ), C i3 =β i [γ i (d i+1 Δ i ) α i (Δ i d i β i (d i+1 Δ i ))]. () +β i f i+1 θ 3, Q i (θ) = (1 θ) α i +θ(1 θ) (α i β i +γ i )+θ β i. The daa-dependen sufficien condiions on parameers γ i will be developed in order o preserve he posiiviy, daa consrained, monooniciy, and convexiy on he enire inerval

4 Applied Mahemaics [x i,x i+1 ], i =,1,,...,n 1. The remaining parameers α i and β i canbeusedorefineheresulinginerpolaingcurves. Thus he raional cubic spline provides greaer flexibiliy o he user in conrolling he final shape of he inerpolaing curves. Theorem 1 (C raional cubic spline inerpolan). The raional cubic spline wih hree parameers defined by (1) is C [x,x n ] if here exis posiive parameers α i,β i >,γ i, and d i, i=1,,...,n 1,hasaisfy(7). The choice of he end poin derivaives d and d n depended on he original daa which are chosen as follows. Choice 1 (Geomeric Mean Mehod (GMM)). Consider d =, Δ =or Δ, = Δ (1+h /h 1 ) Δ ( h /h 1 ),1 oherwise, d n = Δ n 1 =or Δ n,n = Δ (1+h n 1/h n ) n 1 Δ ( h n 1/h n ) n,n oherwise. Choice (Arihmeic Mean Mehod (AMM)). Consider d =Δ +(Δ Δ 1 )( h h +h 1 ), h n 1 d n =Δ n 1 +(Δ n 1 Δ n )( ). h n 1 +h n (1) (13) Delbourgo and Gregory [9] give more deails abou he mehodhacanbeusedoesimaehefirsderivaivevalue. InhispaperheAMMwillbeusedoesimaeheendpoin derivaives d and d n,respecively. Some observaion and shape conrol analysis of he new C raional cubic spline inerpolan defined by (1) are given as follows: (1) When α i >, β i >, and γ i =,heraional inerpolann (1) reduces o he raional spline of he formcubic/quadraicbytianeal.[]andwemay obain C raional cubic spline wih wo parameers, an exension o C 1 raional cubic spline originally proposed by Tian e al. []. Thus by rewriing C condiion in (7), we can obain C raional cubic of Tian e al. []. () When α i = β i = 1; γ i =,heraionalcubic inerpolann (1) is jus a sandard cubic Hermie spline wih C 1 coninuiy ha may no be able o compleely preserve he posiiviy of he daa [1]: s (x) = (1 θ) (1 θ) f i +θ (3 θ) f i+1 +θ(1 θ) d i θ (1 θ) d i+1, for i=,1,...,n 1. (1) Table 1: A daa from work by Sarfraz e al. []. i x i f i h i 1 Δ i.. 1/3 d i (C 1 ) d i (C ) (3) Furhermore he raional inerpolann (1) can be wrien as [1] s (x) = (1 θ) f i +θf i+1 + h iθ (1 θ)[α i (d i Δ i ) (1 θ) +β i (Δ i d i+1 )θ]. Q i (θ) (1) () Obviously when α i, β i,orγ i, he raional inerpolann (1) converges o following sraigh line: lim α i,β i,γ i s (x) = (1 θ) f i +θf i+1. (1) Eiher he decrease of he parameers α i and β i or he increase of γ i will reduce he raional cubic spline o a linear inerpolan. Figure 1 shows his example. We es shape conrol analysis by using he daa from work by Sarfraz e al. [] given in Table 1. To show he difference beween C raional cubic spline wih hree parameers and C 1 raional cubic spline of Karim andkong[17 19],wechooseα i = β i = 1; γ i = for boh cases. The main difference is ha o generae C 1 raional inerpolaing curves he firs derivaive parameer d i, i =,1,,...,n,iscalculaedbyusingArihmeicMean Mehod (AMM); meanwhile o generae C raional cubic spline wih hree parameers, he firs derivaive parameer d i, i=1,,...,n 1, is calculaed by solving (7) wih suiable choices of he end poin derivaives d and d n. Remark. If Δ i d i =or d i+1 Δ i =,hend i =d i+1 =Δ i. In his case he raional inerpolann (1) will be linear in he corresponding inerval or region; has, s (x) = (1 θ) f i +θf i+1. (17) Figure shows he shape conrol using he raional cubic splineforhegivendaaintable1. Figure (f) shows he combinaion of Figures (a), (d), and (e). Meanwhile Figure (g) shows he combinaion of Figures (a), (b), and (c), respecively. Clearly he curves approach o he sraigh line if α i, β i,orγ i. Furhermore decreases in he value of β i will pull he curves upward and vice versa. This shape conrol will be useful for shape preserving inerpolaion as well as local conrol of he inerpolaing curves. MeanwhilefromFigure1(d),icanbeseenclearlyha C raional cubic spline inerpolaion (shown as red color) is

5 Applied Mahemaics (a) (b) (c) (d) Figure 1: Inerpolaing curve for daa in Table 1. (a) Defaul C 1 cubic spline wih α i =β i =1and γ i =.(b)c 1 raionalcubicsplinewih α i =β i =1and γ i =.(c)c raional cubic spline by using derivaive calculaed from ridiagonal equaion (7) wih α i =β i =1and γ i =. (d) The graphs of (b) C 1 raional cubic spline (blue) and (c) C raional cubic spline (red). smooher han C 1 raional cubic spline inerpolaion (shown as black color). Thus he new C raional cubic spline provides good alernaive o he exising C 1 and C raional cubic spline. Remark 3. Since he consruced C raional cubic spline has hree parameers, hen how do we choose he parameer values? To answer his quesion, he choices of he parameers oally depend on he daa ha are under consideraions by he main user. The main difference beween our C raional cubic spline and C cubic spline inerpolaion is ha, in order o change he final shape of he inerpolaing curves, our schemes are only required o change he parameers values wihou he need o change he daa poins iself. Bu here arenofreeparameersinhedescripionsofc cubic spline inerpolaion. 3. Posiiviy Preserving Using C Raional Cubic Spline Inerpolaion In his secion, he posiiviy preserving by using he proposed C raional cubic spline inerpolaion defined by (1) will be discussed in deail. We follow he same idea of KarimandKong[1]andAbbaseal.[1]suchhasimple daa-dependen condiions for posiiviy are derived on one parameer γ i while he remaining parameers α i and β i are free o be uilized. The main objecive is ha, in order o preserve he posiiviy of he posiive daa, he raional cubic spline inerpolan mus be posiive on he enire given inerval. The simple way o achieve is by finding he auomaed choice of he shape parameer γ i.webeginby giving he definiion of sricly posiive daa. Given he sricly posiive se of daa (x i,f i ), i =,1,...,n, x <x 1 < <x n,suchha f i >, i=,1,...,n. (1) Now from (1), he raional cubic spline will preserve he posiiviy of he daa if and only if P i (θ) > and Q i (θ) >. Since for all α i,β i >and γ i, he denominaor Q i (θ) >, i=,1,...,n 1.Thuss(x) > if and only if P i (θ) >, i =,1,...,n 1.The cubic polynomial P i (θ), i=,1,...,n 1 can be wrien as follows [1]: P i (θ) =B i θ 3 +C i θ +D i θ+e i, (19)

6 Applied Mahemaics (a) (b) (c) (d) (e) (f) (g) (h) Figure : Coninued.

7 Applied Mahemaics (i) (j) Figure : Shape conrol of raional cubic inerpolaing curves wih various values of shape parameers lisn Table. Table : Shape parameers value for Figure. Figure i 1 3 α i Figure (a) β i γ i α i Figure (b) β i γ i α i Figure (c) β i γ i α i Figure (d) β i γ i α i Figure (e) β i γ i α i Figure (h) β i γ i α i Figure (i) β i γ i α i Figure (j) β i γ i B i =α i h i d i +β i h i d i+1 +α i β i f i +γ i f i α i β i f i+1 γ i f i+1, C i = α i h i d i β i h i d i+1 +α i f i α i β i f i γ i f i +β i f i+1 +α i β i f i+1 +γ i f i+1, D i =α i h i d i α i f i +α i β i f i +γ i f, E i =α i f i. () From Schmid and Hess [3], wih variable subsiuion θ= s/(1 + s), s, P i (θ), i =,1,...,n 1,canberewrienas follows: P i (s) =As 3 +Bs +Cs+D, (1) A=β i f i+1, B=(α i β i +β i +γ i )f i+1 β i h i d i+1, C=(α i β i +α i +γ i )f i α i h i d i, D=α i f i. () Theorem. For sricly posiive daa defined in (1), C raional cubic inerpolan defined over he inerval [x,x n ] is posiive if in each subinerval [x i,x i+1 ], i =,1,...,n 1, he involving parameers α i,β i,andγ i saisfy he following sufficien condiions: α i,β i >, γ i > Max, α i [ h id i +(β i +1)f i f i ], β i [ h id i+1 (α i +1)f i+1 f i+1 ]}. (3) Remark. The sufficien condiion for posiiviy preserving by using C raional cubic inerpolans differen from he sufficien condiion for posiiviy preserving by using C 1 raional cubic inerpolan of Karim and Kong [1]. To achieve C coninuiy, he derivaive parameers d i, i=1,,...,n 1, mus be calculaed from C condiion given in (7); meanwhile o achieve C 1 coninuiy, he derivaive parameers d i, i =, 1,,..., n, areesimaedbyusingsandardapproximaion mehods such as Arihmeic Mean Mehod (AMM).

8 Applied Mahemaics Table 3: A posiive daa from work by Hussain e al. [1]. i 1 3 x i f i Table : A Posiive daa from work by Sarfraz e al. []. i 1 3 x i f i Table : Numerical resuls. i 1 3 d i (C 1 ) Δ i α i... β i... γ i d i (C ) Table : Numerical resuls. i 1 3 d i (C 1 ) Δ i α i β i γ i d i (C ) Remark. The sufficien condiion in (3) can be rewrien as α i,β i >, γ i =λ i + Max, α i [ h id i +(β i +1)f i f i ], β i [ h id i+1 (α i +1)f i+1 f i+1 ]}, λ i >. () The following is an algorihm ha can be used o generae C posiiviy-preserving curves. Algorihm 7 (C posiiviy preserving). Consider he following: (1) Inpu he daa poins x i,f i } n i=, d,andd n. () For i=,1,...,n 1, calculae he parameer γ i using () wih suiable choices of α i >, β i >,andλ i >. (3) For i=1,,...,n 1, calculae he value of derivaive, d i,bysolving(7)byusinglu decomposiion and so forh. () For i=,1,...,n 1, consruc he piecewise posiive C raional inerpolaing curves defined by (1) Numerical Demonsraions. In his secion several numerical resuls for posiiviy preserving by using C raional inerpolaing curves will be shown including comparison wih exising raional cubic spline schemes. Two ses of posiive daa aken from works by Hussain e al. [1] and Sarfraz e al. [] were used. Figures3andshowheposiiviypreservingbyusingC raional cubic spline for daa in Tables 3 and, respecively. Figures 3(a) and (a) show he defaul cubic Hermie spline polynomialfordaaintables3and,respecively.numerical resuls of Figure 3(d) were obained by using he parameers from he daa in Table. Meanwhile numerical resuls of Figure (e) were generaed by using he daa in Table. I canbeseenclearlyhaheposiiviypreservingbyusingour C raional cubic spline gives more smooh resuls compared wih he works of Hussain e al. [1] and Abbas e al. [1]. The graphical resuls in Figure 3(e) were very smooh and visually pleasing. Meanwhile for he posiive daa given in Table, our C raional cubic spline gives comparable resuls wih he works of Abbas e al. [1], Hussain e al. [1], and Sarfraz e al. [11]. The final resuling posiive curves by using he proposed C raional cubic spline inerpolan are slighly differen beween he works of Abbas e al. [1], Hussain eal.[1],andsarfrazeal.[11].finallyfigureshows he examples of posiive inerpolaing by using Frisch and Carlson [1] cubic spline schemes ha are well documened in MalabasPCHIP.Icanbeseenclearlyhashapepreserving by using PCHIP does no give smooh resuls and is no visually pleasing enough. Some of he inerpolaing curves end o oversho on some inerval ha he inerpolaing curves are igh when compared wih our work in his paper. For insance, in Figure (b), he inerpolaing curves are very igh and no visually pleasing. Error Analysis. Inhissecion,heerroranalysisforhe funcion o be inerpolaed is f() C 3 [, n ] using our C raional cubic spline which will be discussed in deail. Noe ha he consruced raional cubic spline wih hree parameers is a local inerpolan and wihou loss of generaliy, we may jus consider he error on he subinerval I i =[,+1 ]. By using Peano Kernel Theorem [31] he error of inerpolaion in each subinerval I i =[,+1 ] is defined as R [f] =f() P i () = 1 i+1 f (3) R [( τ) + ] dτ, () R [( τ) + ]= r (τ, ), <τ<, () s (τ, ), < τ < +1

9 Applied Mahemaics (a) (b) (c) (d) (e) Figure 3: Comparison of (a) cubic Hermie spline curve, (b) Hussain e al. [1], (c) Abbas e al. [1], and posiiviy-preserving raional cubic spline wih values of shape parameers: (d) α i =β i =.;(e)α i =β i =.

10 1 Applied Mahemaics (a) (b) (c) (d) (e) Figure : Comparison of (a) cubic Hermie spline curve, (b) Sarfraz e al. [11], (c) Abbas e al. [1], and posiiviy-preserving raional cubic spline wih values of shape parameers: (d) α i =β i =.;(e)α i =β i =..

11 Applied Mahemaics (a) (b) Figure wih r (τ, ) = ( τ) +s(τ, ), s (τ, ) = [(α iβ i +β i +γ i )ζ h i β i ζ} θ (1 θ) +β i ζ θ 3 ] Q i (θ) (7) wih ζ=(+1 τ). The absolue error in each subinerval I i = [x i,x i+1 ] is given as follows: f () P i () 1 f(3) (τ) i+1 R [( τ) + ]dτ. () In order o enable us o derive he error analysis of C raional cubic spline inerpolaion, we need o sudy he properies of he kernel funcions r(τ, ) and s(τ, ) andevaluaehe following definie inegrals: H= (ρ i β i )(α i +ρ i θ) α i ρ i θ. (31) The roos of s(τ, ) = are τ 3 =+1, τ =+1 β i h i (1 θ)/(β i +(1 θ)ρ i ). Thus he following hree cases can be obained. Case 1. For β i /ρ i 1,<θ<θ,hen()akeshe following form: f () P i () 1 f(3) (τ) i+1 R [( τ) + ]dτ = 1 f(3) (τ) G i (τ) (3) +1 R [( τ) + ]dτ= r (τ, x) dτ +1 + s (τ, x) dτ. (9) To simplify he inegrals in (9) we begin by finding he roos of r(, ) =, r(τ, ) =,ands(τ, ) =,respecively.iiseasy o see ha he roos of r(, ) = in [, 1] are θ=,1and θ =1 β i /ρ i,ρ i =α i β i +γ i. Meanwhile he roos of r(τ, ) = are wih Hence G i (τ) = r (τ, ) dτ s (τ, ) dτ}. τ τ s (τ, ) dτ (33) τ k =x θh i (θρ i + ( 1) k+1 H) α i +θρ i, k = 1,, (3) f () P i () f(3) (τ) ζ 1 (α i,β i,γ i,θ), (3)

12 1 Applied Mahemaics ζ 1 (α i,β i,γ i,θ)= h3 i θ3 3 + β ih 3 i θ3 3Q i (θ) (ρ i +β i ) (h 3 i θ (1 θ) ) 3(ρ i (1 θ) +β i ) 3 Q i (θ) Case 3. For β i /ρ i following form: > 1, < θ < 1,hen()akeshe f () P i () 1 f(3) (τ) i+1 R [( τ) + ]dτ = 1 f(3) (τ) i+1 r (τ, ) dτ + s (τ, ) dτ} () β i + (h3 i θ (1 θ) ) 3(ρ i (1 θ) +β i ) Q i (θ) 1β i h 3 i θ3 (1 θ) 3 3(ρ i (1 θ) +β i ) 3 Q i (θ) + h3 i (1 θ) θ 3Q i (θ) [ρ i β i ]. (3) = f(3) (τ) ζ 3 (α i,β i,γ i,θ), ζ 3 (α i,β i,γ i,θ)= h3 i θ3 3 (ρ i +β i )h 3 i (1 θ) θ 3Q i (θ) + β ih 3 i (1 θ) θ Q i (θ) β ih 3 i θ3 3Q i (θ). (1) Case. For β i /ρ i 1,θ <θ<1,hen()akeshe following form: Theorem. The error for he inerpolaing raional cubic spline inerpolan defined by (1) in each subinerval I i = [,+1 ],whenf() C 3 [, n ],isgivenby f () P i () 1 f(3) (τ) i+1 R [( τ) + ]dτ = 1 f(3) (τ) G (τ) (3) f () P i () 1 f(3) (τ) i+1 R [( τ) + ]dτ = 1 f(3) (τ) i+1 r (τ, ) dτ + s (τ, ) dτ} () wih = f(3) (τ) c i, Hence τ G (τ) = +1 + s (τ, ) dτ}. r (τ, ) dτ + r (τ, ) dτ τ (37) f () P i () f(3) (τ) ζ (α i,β i,γ i,θ), (3) ζ (α i,β i,γ i,θ)= h3 i θ3 (θρ i H) 3 3 β ih 3 i θ3 [G 3 (θ)] 3 3Q i (θ) (ρ i +β i )h 3 i (1 θ) θ [G 3 (θ)] 3 3Q i (θ) + β ih 3 i (1 θ) θ [G 3 (θ)] 3 Q i (θ) wih G 3 (θ) = (1 θ) + θ(θρ i H)/(α i +ρ i θ). (39) wih c i = max ζ(α i,β i,γ i,θ), ζ 1 (α i,β i,γ i,θ), ζ(α i,β i,γ i,θ)= ζ (α i,β i,γ i,θ), ζ 3 (α i,β i,γ i,θ), θ θ θ θ 1 θ 1. (3) Remark 9. When α i =1,β i =1,andγ i =, he inerpolaion funcion defined by (1) is reduced o he sandard cubic Hermie inerpolaion wih ζ 1 (α i,β i,γ i,θ)= θ (1 θ) 3 (3 (3 θ) ), θ 1, ζ (α i,β i,γ i,θ)= θ3 (1 θ) (3 (1+θ) ), 1 θ 1, ζ 3 (α i,β i,γ i, θ) =, θ 1, () and c i = 1/9. This is sandard error for cubic Hermie polynomial spline.. Discussions From all numerical resuls presened in Secion 3.1, i can be seen clearly ha he proposed C raional cubic spline

13 Applied Mahemaics 13 works very well and is comparable wih exising schemes such as Hussain e al. [1], Sarfraz e al. [11], and Abbas e al. [1] for posiiviy preserving. Furhermore similar o he consrucion of raional cubic of Abbas e al. [] our C raional cubic spline inerpolaion also has hree parameers wo are free parameers. Bu based on our numerical experimens, i was noiced ha schemes of Abbas e al. [1] may no be able o produce compleely C posiive inerpolaing curves. Meanwhile he sufficien condiion for posiiviy, monooniciy, and convexiy preserving and daa consrained are derived on he remaining parameer. One of he advanages by using our C raional cubic spline is ha when γ i =we may obain he new varian of C raional cubicsplineofhussainandali[3],m.z.hussainandm. Hussain [9], and Tian e al. [] for posiiviy- and convexiypreserving inerpolaion. Thus our C raional cubic spline has a larger spline class compared o he works by Abbas e al. [1]. Furhermore he error analysis when he funcion o be inerpolaed is f() C 3 [, n ] also has been derived in deail.. Conclusions In his paper he new C raional cubic spline wih hree parameers has been inroduced. Is an exension o he work of Karim and Pang [1]. To achieve C coninuiy a he join knos x i, i = 1,,...,n 1, he firs derivaive value, d i,is calculaed by solving sysems of linear equaion (ridiagonal) has sricly posiive and he soluion is unique. Shape conrol of he new C raional cubic inerpolaion wih numerical examples also was presened. Finally C raional cubic spline has been used for posiiviy preserving including a comparison wih exising schemes. From he numerical resuls clearly our C raional cubic spline gives comparable resuls wih exising schemes. Finally work in parameric shapepreservingisunderwaybyheauhors. Compeing Ineress The auhors declare ha here are no compeing ineress regarding he publicaion of his paper. Acknowledgmens Samsul Ariffin Abdul Karim would like o acknowledge Universii Teknologi PETRONAS (UTP) for he financial suppor received in he form of a research gran: Shor Term Inernal Research Funding (STIRF) no. 13AA-D91 including he Mahemaica Sofware. References [1] F. N. Frisch and R. E. Carlson, Monoone piecewise cubic inerpolaion, SIAM Journal on Numerical Analysis, vol. 17,no., pp. 3, 19. [] R.L.Doughery,A.S.Edelman,andJ.M.Hyman, Nonnegaiviy-, monooniciy-, or convexiy-preserving cubic and quinic Hermie inerpolaion, Mahemaics of Compuaion, vol.,no.1,pp.71 9,199. [3] S. Bu and K. W. Brodlie, Preserving posiiviy using piecewise cubic inerpolaion, Compuers and Graphics, vol.17,no.1,pp., [] K. W. Brodlie and S. Bu, Preserving convexiy using piecewise cubic inerpolaion, Compuers and Graphics,vol.1,no.1,pp. 1 3, [] M. Sarfraz, Visualizaion of posiive and convex daa by a raional cubic spline inerpolaion, Informaion Sciences, vol. 1, no. 1, pp. 39,. [] M. Sarfraz, S. Bu, and M. Z. Hussain, Visualizaion of shaped daa by a raional cubic spline inerpolaion, Compuers & Graphics,vol.,no.,pp.33,1. [7] M. Sarfraz, M. Z. Hussain, and A. Nisar, Posiive daa modeling using spline funcion, Applied Mahemaics and Compuaion, vol. 1, no. 7, pp. 3 9, 1. [] M. Abbas, Shape preserving daa visualizaion for curves and surfaces using raional cubic funcions [Ph.D. hesis], School of Mahemaical Sciences, Universii Sains Malaysia, Penang, Malaysia, 1. [9] M.Z.HussainandM.Hussain, Visualizaionofdaasubjec o posiive consrain, Informaion and Compuing Sciences,vol.1,no.3,pp.19 1,. [1] M. Z. Hussain, M. Sarfraz, and T. S. Shaikh, Shape preserving raional cubic spline for posiive and convex daa, Egypian Informaics Journal,vol.1,no.3,pp.31 3,11. [11] M. Sarfraz, M. Z. Hussain, T. S. Shaikh, and R. Iqbal, Daa visualizaion using shape preserving C raional spline, in Proceeding of h Inernaional Conference on Informaion Visualisaion, pp. 33, London, UK, July 11. [1] M. Abbas, A. A. Majid, M. N. H. Awang, and J. M. Ali, Posiiviy-preserving C raional cubic spline inerpolaion, ScienceAsia,vol.39,no.,pp. 13,13. [13] R. Delbourgo, Accurae C raional inerpolans in ension, SIAM Journal on Numerical Analysis,vol.3,no.,pp.9 7, [1] J. A. Gregory, Shape preserving spline inerpolaion, Compuer-Aided Design,vol.1,no.1,pp.3 7,19. [1] R.DelbourgoandJ.A.Gregory, C raional quadraic spline inerpolaion o monoonic daa, IMA Numerical Analysis,vol.3,no.,pp.11 1,193. [1] S. A. A. Karim and K. V. Pang, Local conrol of he curves using raional cubic spline, Applied Mahemaics,vol.1, Aricle ID 737, 1 pages, 1. [17] S. A. A. Karim and K. V. Pang, Monooniciy-preserving using raional cubic spline inerpolaion, Research Applied Sciences,vol.9,no.,pp.1 3,1. [1] S. A. A. Karim and V. P. Kong, Shape preserving inerpolaion using raional cubic spline, Research Applied Sciences, Engineering and Technology,vol.,no.,pp.17 1,1. [19] S. A. A. Karim and V. P. Kong, Convexiy-preserving using raional cubic spline inerpolaion, Research Applied Sciences, Engineering and Technology,vol.,no.3,pp.31 3, 1. [] M.Tian,Y.Zhang,J.Zhu,andQ.Duan, Convexiy-preserving piecewise raional cubic inerpolaion, Informaion and Compuaional Science,vol.,no.,pp.799 3,. [1] P. Lamberi and C. Manni, Shape-preserving C funcional inerpolaion via parameric cubics, Numerical Algorihms,vol.,no.1,pp.9,1.

14 1 Applied Mahemaics [] Q. Duan, L. Wang, and E. H. Twizell, A new C raional inerpolaionbasedonfuncionvaluesandconsrainedconrolof he inerpolan curves, Applied Mahemaics and Compuaion, vol.11,no.1,pp.311 3,. [3] F. Bao, Q. Sun, and Q. Duan, Poin conrol of he inerpolaing curve wih a raional cubic spline, JournalofVisualCommunicaion and Image Represenaion, vol.,no.,pp.7, 9. [] J.-C. Fioro and J. Tabka, Shape-preserving C cubic polynomial inerpolaing splines, Mahemaics of Compuaion,vol.7, no. 19, pp. 91 9, [] M. Dube and P. Tiwari, Convexiy preserving C raional quadraic rigonomeric spline, in Proceedings of he Inernaional Conference of Numerical Analysis and Applied Mahemaics (ICNAAM 1),vol.179,pp.99 99,Sepember1. [] Y.-J. Pan and G.-J. Wang, Convexiy-preserving inerpolaion of rigonomeric polynomial curves wih a shape parameer, Zhejiang Universiy SCIENCE A,vol.,no.,pp , 7. [7] F. Ibraheem, M. Hussain, M. Z. Hussain, and A. A. Bhai, Posiive daa visualizaion using rigonomeric funcion, Journal of Applied Mahemaics, vol.1,aricleid71,19pages, 1. [] M. Sarfraz, M. Z. Hussain, and F. S. Chaudary, Shape preserving cubic spline for daa visualizaion, Compuer Graphics and CAD/CAM,vol.1,pp.1 193,. [9] R. Delbourgo and J. A. Gregory, The deerminaion of derivaive parameers for a monoonic raional quadraic inerpolan, IMA Numerical Analysis, vol.,no.,pp.397, 19. [3] J. W. Schmid and W. Hess, Posiiviy of cubic polynomials on inervals and posiive spline inerpolaion, BIT Numerical Mahemaics, vol., no., pp. 3 3, 19. [31] M. H. Schulz, Spline Analysis, Prenice-Hall, Englewood-Cliffs, NJ, USA, [3] M. Z. Hussain and J. M. Ali, Posiiviy preserving piecewise raional cubic inerpolaion, Maemaika,vol.,no.,pp.17 13,.

15 Advances in Operaions Research Volume 1 Advances in Decision Sciences Volume 1 Applied Mahemaics Algebra Volume 1 Probabiliy and Saisics Volume 1 The Scienific World Journal Volume 1 Inernaional Differenial Equaions Volume 1 Volume 1 Submi your manuscrips a Inernaional Advances in Combinaorics Mahemaical Physics Volume 1 Complex Analysis Volume 1 Inernaional Mahemaics and Mahemaical Sciences Mahemaical Problems in Engineering Mahemaics Volume 1 Volume 1 Volume 1 Volume 1 Discree Mahemaics Volume 1 Discree Dynamics in Naure and Sociey Funcion Spaces Absrac and Applied Analysis Volume 1 Volume 1 Volume 1 Inernaional Sochasic Analysis Opimizaion Volume 1 Volume 1

EECS 487: Interactive Computer Graphics

EECS 487: Interactive Computer Graphics EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified

More information

Integro-differential splines and quadratic formulae

Integro-differential splines and quadratic formulae Inegro-differenial splines and quadraic formulae I.G. BUROVA, O. V. RODNIKOVA S. Peersburg Sae Universiy 7/9 Universiesaya nab., S.Persburg, 9934 Russia i.g.burova@spbu.ru, burovaig@mail.ru Absrac: This

More information

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics A non-saionary uniform ension conrolled inerpolaing 4-poin scheme reproducing conics C. Beccari a, G. Casciola b, L. Romani b, a Deparmen of Pure and Applied Mahemaics, Universiy of Padova, Via G. Belzoni

More information

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures Las Time? Adjacency Daa Srucures Geomeric & opologic informaion Dynamic allocaion Efficiency of access Curves & Surfaces Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

X-Splines : A Spline Model Designed for the End-User

X-Splines : A Spline Model Designed for the End-User X-Splines : A Spline Model Designed for he End-User Carole Blanc Chrisophe Schlic LaBRI 1 cours de la libéraion, 40 alence (France) [blancjschlic]@labri.u-bordeaux.fr Absrac his paper presens a new model

More information

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves

More information

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many

More information

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets? Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal

More information

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures. Schedule Curves & Surfaces Sunday Ocober 5 h, * 3-5 PM *, Room TBA: Review Session for Quiz 1 Exra Office Hours on Monday (NE43 Graphics Lab) Tuesday Ocober 7 h : Quiz 1: In class 1 hand-wrien 8.5x11 shee

More information

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar

More information

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes. 8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged

More information

Nonparametric CUSUM Charts for Process Variability

Nonparametric CUSUM Charts for Process Variability Journal of Academia and Indusrial Research (JAIR) Volume 3, Issue June 4 53 REEARCH ARTICLE IN: 78-53 Nonparameric CUUM Chars for Process Variabiliy D.M. Zombade and V.B. Ghue * Dep. of aisics, Walchand

More information

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz

More information

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves Precise Voronoi Cell Exracion of Free-form Raional Planar Closed Curves Iddo Hanniel, Ramanahan Muhuganapahy, Gershon Elber Deparmen of Compuer Science Technion, Israel Insiue of Technology Haifa 32000,

More information

Collision-Free and Curvature-Continuous Path Smoothing in Cluttered Environments

Collision-Free and Curvature-Continuous Path Smoothing in Cluttered Environments Collision-Free and Curvaure-Coninuous Pah Smoohing in Cluered Environmens Jia Pan 1 and Liangjun Zhang and Dinesh Manocha 3 1 panj@cs.unc.edu, 3 dm@cs.unc.edu, Dep. of Compuer Science, Universiy of Norh

More information

On Continuity of Complex Fuzzy Functions

On Continuity of Complex Fuzzy Functions Mahemaical Theory and Modeling www.iise.org On Coninuiy of Complex Fuzzy Funcions Pishiwan O. Sabir Deparmen of Mahemaics Faculy of Science and Science Educaion Universiy of Sulaimani Iraq pishiwan.sabir@gmail.com

More information

STEREO PLANE MATCHING TECHNIQUE

STEREO PLANE MATCHING TECHNIQUE STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo

More information

Learning in Games via Opponent Strategy Estimation and Policy Search

Learning in Games via Opponent Strategy Estimation and Policy Search Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen

More information

Image Content Representation

Image Content Representation Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an

More information

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report) Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,

More information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley. Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah

More information

A Fast Non-Uniform Knots Placement Method for B-Spline Fitting

A Fast Non-Uniform Knots Placement Method for B-Spline Fitting 2015 IEEE Inernaional Conference on Advanced Inelligen Mecharonics (AIM) July 7-11, 2015. Busan, Korea A Fas Non-Uniform Knos Placemen Mehod for B-Spline Fiing T. Tjahjowidodo, VT. Dung, and ML. Han Absrac

More information

Design Alternatives for a Thin Lens Spatial Integrator Array

Design Alternatives for a Thin Lens Spatial Integrator Array Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of

More information

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models Simulaneous Precise Soluions o he Visibiliy Problem of Sculpured Models Joon-Kyung Seong 1, Gershon Elber 2, and Elaine Cohen 1 1 Universiy of Uah, Sal Lake Ciy, UT84112, USA, seong@cs.uah.edu, cohen@cs.uah.edu

More information

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u Send Orders for Reprins o reprins@benhamscience.ae The Open Biomedical Engineering Journal, 5, 9, 9-3 9 Open Access Research on an Improved Medical Image Enhancemen Algorihm Based on P-M Model Luo Aijing

More information

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008 MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o

More information

CENG 477 Introduction to Computer Graphics. Modeling Transformations

CENG 477 Introduction to Computer Graphics. Modeling Transformations CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World

More information

Handling uncertainty in semantic information retrieval process

Handling uncertainty in semantic information retrieval process Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,

More information

Optimal trajectory approximation by cubic splines on fed-batch control problems

Optimal trajectory approximation by cubic splines on fed-batch control problems Opimal rajecory approximaion by cubic splines on fed-bach conrol problems A. ISMAEL F. VAZ Producion and Sysems Deparmen Minho Universiy, Engineering School aivaz@dps.uminho.p EUGÉNIO C. FERREIRA Cenro

More information

An efficient approach to improve throughput for TCP vegas in ad hoc network

An efficient approach to improve throughput for TCP vegas in ad hoc network Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: 395-0056 Volume: 0 Issue: 03 June-05 www.irje.ne p-issn: 395-007 An efficien approach o improve hroughpu for TCP vegas in ad hoc

More information

Coded Caching with Multiple File Requests

Coded Caching with Multiple File Requests Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a

More information

An Adaptive Spatial Depth Filter for 3D Rendering IP

An Adaptive Spatial Depth Filter for 3D Rendering IP JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod

More information

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR . ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral

More information

Applications of N-Structures to Ideal Theory of LA-Semigroup

Applications of N-Structures to Ideal Theory of LA-Semigroup Appl. Mah. Inf. Sci. Le. 4, No. 3, 97-02 (206) 97 Applied Mahemaics & Informaion Sciences Leers An Inernaional Journal hp://d.doi.org/0.8576/amisl/04030 Applicaions of N-Srucures o Ideal Theor of LA-Semigroup

More information

Video Content Description Using Fuzzy Spatio-Temporal Relations

Video Content Description Using Fuzzy Spatio-Temporal Relations Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer

More information

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker. Slide A Principled Approach o MILP Modeling John Hooer Carnegie Mellon Universiy Worshop on MIP Columbia Universiy, Augus 008 Proposal MILP modeling is an ar, bu i need no be unprincipled. Slide Proposal

More information

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional); QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is

More information

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen

More information

Construction new rational cubic spline with application in shape preservations

Construction new rational cubic spline with application in shape preservations COMPUTER SCIENCE RESEARCH ARTICLE Construction new rational cubic spline with application in shape preservations Samsul Ariffin Abdul Karim* 1 Received: 03 May 2018 Accepted: 23 July 2018 First Published:

More information

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2

More information

4.1 3D GEOMETRIC TRANSFORMATIONS

4.1 3D GEOMETRIC TRANSFORMATIONS MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions

More information

Computer representations of piecewise

Computer representations of piecewise Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom

More information

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12].

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12]. In Proceedings of CVPR '96 Srucure and Moion of Curved 3D Objecs from Monocular Silhouees B Vijayakumar David J Kriegman Dep of Elecrical Engineering Yale Universiy New Haven, CT 652-8267 Jean Ponce Compuer

More information

DAGM 2011 Tutorial on Convex Optimization for Computer Vision

DAGM 2011 Tutorial on Convex Optimization for Computer Vision DAGM 2011 Tuorial on Convex Opimizaion for Compuer Vision Par 3: Convex Soluions for Sereo and Opical Flow Daniel Cremers Compuer Vision Group Technical Universiy of Munich Graz Universiy of Technology

More information

Functional Data Smoothing Methods and Their Applications

Functional Data Smoothing Methods and Their Applications Universiy of Souh Carolina Scholar Commons Theses and Disseraions 2017 Funcional Daa Smoohing Mehods and Their Applicaions Songqiao Huang Universiy of Souh Carolina Follow his and addiional works a: hps://scholarcommons.sc.edu/ed

More information

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate 20 TUTA/IOE/PCU Journal of he Insiue of Engineering, 205, (): 20-27 TUTA/IOE/PCU Prined in Nepal M()/M/ Queueing Sysem wih Sinusoidal Arrival Rae A.P. Pan, R.P. Ghimire 2 Deparmen of Mahemaics, Tri-Chandra

More information

1.4 Application Separable Equations and the Logistic Equation

1.4 Application Separable Equations and the Logistic Equation 1.4 Applicaion Separable Equaions and he Logisic Equaion If a separable differenial equaion is wrien in he form f ( y) dy= g( x) dx, hen is general soluion can be wrien in he form f ( y ) dy = g ( x )

More information

A Formalization of Ray Casting Optimization Techniques

A Formalization of Ray Casting Optimization Techniques A Formalizaion of Ray Casing Opimizaion Techniques J. Revelles, C. Ureña Dp. Lenguajes y Sisemas Informáicos, E.T.S.I. Informáica, Universiy of Granada, Spain e-mail: [jrevelle,almagro]@ugr.es URL: hp://giig.ugr.es

More information

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened

More information

A Matching Algorithm for Content-Based Image Retrieval

A Matching Algorithm for Content-Based Image Retrieval A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using

More information

Definition and examples of time series

Definition and examples of time series Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is

More information

COMP26120: Algorithms and Imperative Programming

COMP26120: Algorithms and Imperative Programming COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48

More information

4. Minimax and planning problems

4. Minimax and planning problems CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems

More information

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple

More information

Voltair Version 2.5 Release Notes (January, 2018)

Voltair Version 2.5 Release Notes (January, 2018) Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For

More information

Dynamic Route Planning and Obstacle Avoidance Model for Unmanned Aerial Vehicles

Dynamic Route Planning and Obstacle Avoidance Model for Unmanned Aerial Vehicles Volume 116 No. 24 2017, 315-329 ISSN: 1311-8080 (prined version); ISSN: 1314-3395 (on-line version) url: hp://www.ijpam.eu ijpam.eu Dynamic Roue Planning and Obsacle Avoidance Model for Unmanned Aerial

More information

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = ); Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)

More information

An Improved Square-Root Nyquist Shaping Filter

An Improved Square-Root Nyquist Shaping Filter An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com

More information

In this paper we discuss the automatic construction of. are Delaunay triangulations whose smallest angles are bounded and, in

In this paper we discuss the automatic construction of. are Delaunay triangulations whose smallest angles are bounded and, in uomaic consrucion of qualiy nonobuse boundary Delaunay riangulaions Nancy Hischfeld and ara-ecilia Rivara Deparmen of ompuer Science, Universiy of hile, casilla 2777, Saniago, HILE e-mail: nancy@dcc.uchile.cl,

More information

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image

More information

Real Time Integral-Based Structural Health Monitoring

Real Time Integral-Based Structural Health Monitoring Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy

More information

Improving Ranking of Search Engines Results Based on Power Links

Improving Ranking of Search Engines Results Based on Power Links IPASJ Inernaional Journal of Informaion Technology (IIJIT) Web Sie: hp://www.ipasj.org/iijit/iijit.hm A Publisher for Research Moivaion... Email: edioriiji@ipasj.org Volume 2, Issue 9, Sepember 2014 ISSN

More information

IROS 2015 Workshop on On-line decision-making in multi-robot coordination (DEMUR 15)

IROS 2015 Workshop on On-line decision-making in multi-robot coordination (DEMUR 15) IROS 2015 Workshop on On-line decision-making in muli-robo coordinaion () OPTIMIZATION-BASED COOPERATIVE MULTI-ROBOT TARGET TRACKING WITH REASONING ABOUT OCCLUSIONS KAROL HAUSMAN a,, GREGORY KAHN b, SACHIN

More information

Research Article Data Visualization Using Rational Trigonometric Spline

Research Article Data Visualization Using Rational Trigonometric Spline Applied Mathematics Volume Article ID 97 pages http://dx.doi.org/.//97 Research Article Data Visualization Using Rational Trigonometric Spline Uzma Bashir and Jamaludin Md. Ali School of Mathematical Sciences

More information

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services Improving he Efficiency of Dynamic Service Provisioning in Transpor Neworks wih Scheduled Services Ralf Hülsermann, Monika Jäger and Andreas Gladisch Technologiezenrum, T-Sysems, Goslarer Ufer 35, D-1585

More information

Evaluation and Improvement of Region-based Motion Segmentation

Evaluation and Improvement of Region-based Motion Segmentation Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac

More information

SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis

SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis REM: A Novel Mulicas Rouing Algorihm - Comprehensive Cos Analysis Yewen Cao and Khalid Al-Begain chool of Compuing, Universiy of Glamorgan, CF37 DL, Wales, U.K E-mail:{ycao,kbegain}@glam.ac.uk Absrac Ever-increasing

More information

LOW-VELOCITY IMPACT LOCALIZATION OF THE COMPOSITE TUBE USING A NORMALIZED CROSS-CORRELATION METHOD

LOW-VELOCITY IMPACT LOCALIZATION OF THE COMPOSITE TUBE USING A NORMALIZED CROSS-CORRELATION METHOD 21 s Inernaional Conference on Composie Maerials Xi an, 20-25 h Augus 2017 LOW-VELOCITY IMPACT LOCALIZATION OF THE COMPOSITE TUBE USING A NORMALIZED CROSS-CORRELATION METHOD Hyunseok Kwon 1, Yurim Park

More information

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu

More information

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research

More information

MB86297A Carmine Timing Analysis of the DDR Interface

MB86297A Carmine Timing Analysis of the DDR Interface Applicaion Noe MB86297A Carmine Timing Analysis of he DDR Inerface Fujisu Microelecronics Europe GmbH Hisory Dae Auhor Version Commen 05.02.2008 Anders Ramdahl 0.01 Firs draf 06.02.2008 Anders Ramdahl

More information

Parallel and Distributed Systems for Constructive Neural Network Learning*

Parallel and Distributed Systems for Constructive Neural Network Learning* Parallel and Disribued Sysems for Consrucive Neural Nework Learning* J. Flecher Z. Obradovi School of Elecrical Engineering and Compuer Science Washingon Sae Universiy Pullman WA 99164-2752 Absrac A consrucive

More information

Research Article Auto Coloring with Enhanced Character Registration

Research Article Auto Coloring with Enhanced Character Registration Compuer Games Technology Volume 2008, Aricle ID 35398, 7 pages doi:0.55/2008/35398 Research Aricle Auo Coloring wih Enhanced Characer Regisraion Jie Qiu, Hock Soon Seah, Feng Tian, Quan Chen, Zhongke Wu,

More information

ME 406 Assignment #1 Solutions

ME 406 Assignment #1 Solutions Assignmen#1Sol.nb 1 ME 406 Assignmen #1 Soluions PROBLEM 1 We define he funcion for Mahemaica. In[1]:= f@_d := Ep@D - 4 Sin@D (a) We use Plo o consruc he plo. In[2]:= Plo@f@D, 8, -5, 5

More information

STRING DESCRIPTIONS OF DATA FOR DISPLAY*

STRING DESCRIPTIONS OF DATA FOR DISPLAY* SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac

More information

NEWTON S SECOND LAW OF MOTION

NEWTON S SECOND LAW OF MOTION Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during

More information

Algorithm for image reconstruction in multi-slice helical CT

Algorithm for image reconstruction in multi-slice helical CT Algorihm for image reconsrucion in muli-slice helical CT Kasuyuki Taguchi a) and Hiroshi Aradae Medical Engineering Laboraory, Toshiba Corporaion, 1385 Shimoishigami, Oawara, Tochigi 324-855, Japan Received

More information

A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER

A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER ABSTRACT Modern graphics cards for compuers, and especially heir graphics processing unis (GPUs), are designed for fas rendering of graphics.

More information

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto Visual Percepion as Bayesian Inference David J Flee Universiy of Torono Basic rules of probabiliy sum rule (for muually exclusive a ): produc rule (condiioning): independence (def n ): Bayes rule: marginalizaion:

More information

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab CMOS INEGRAED CIRCUI DESIGN ECHNIQUES Universiy of Ioannina Clocking Schemes Dep. of Compuer Science and Engineering Y. siaouhas CMOS Inegraed Circui Design echniques Overview 1. Jier Skew hroughpu Laency

More information

Gauss-Jordan Algorithm

Gauss-Jordan Algorithm Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried

More information

Reinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi

Reinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi Reinforcemen Learning by Policy Improvemen Making Use of Experiences of The Oher Tasks Hajime Kimura and Shigenobu Kobayashi Tokyo Insiue of Technology, JAPAN genfe.dis.iech.ac.jp, kobayasidis.iech.ac.jp

More information

Automatic Calculation of Coverage Profiles for Coverage-based Testing

Automatic Calculation of Coverage Profiles for Coverage-based Testing Auomaic Calculaion of Coverage Profiles for Coverage-based Tesing Raimund Kirner 1 and Waler Haas 1 Vienna Universiy of Technology, Insiue of Compuer Engineering, Vienna, Ausria, raimund@vmars.uwien.ac.a

More information

A time-space consistency solution for hardware-in-the-loop simulation system

A time-space consistency solution for hardware-in-the-loop simulation system Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong

More information

Hermite Curves. Jim Armstrong Singularity November 2005

Hermite Curves. Jim Armstrong Singularity November 2005 TechNoe TN-5- Herie Curves Ji Arsrong Singulariy Noveer 5 This is he second in a series of TechNoes on he sujec of applied curve aheaics in Adoe Flash TM. Each TechNoe provides a aheaical foundaion for

More information

Visual Indoor Localization with a Floor-Plan Map

Visual Indoor Localization with a Floor-Plan Map Visual Indoor Localizaion wih a Floor-Plan Map Hang Chu Dep. of ECE Cornell Universiy Ihaca, NY 14850 hc772@cornell.edu Absrac In his repor, a indoor localizaion mehod is presened. The mehod akes firsperson

More information

DETC2004/CIE VOLUME-BASED CUT-AND-PASTE EDITING FOR EARLY DESIGN PHASES

DETC2004/CIE VOLUME-BASED CUT-AND-PASTE EDITING FOR EARLY DESIGN PHASES Proceedings of DETC 04 ASME 004 Design Engineering Technical Conferences and Compuers and Informaion in Engineering Conference Sepember 8-Ocober, 004, Sal Lake Ciy, Uah USA DETC004/CIE-57676 VOLUME-BASED

More information

Relevance Ranking using Kernels

Relevance Ranking using Kernels Relevance Ranking using Kernels Jun Xu 1, Hang Li 1, and Chaoliang Zhong 2 1 Microsof Research Asia, 4F Sigma Cener, No. 49 Zhichun Road, Beijing, China 100190 2 Beijing Universiy of Poss and Telecommunicaions,

More information

AUTOMATIC 3D FACE REGISTRATION WITHOUT INITIALIZATION

AUTOMATIC 3D FACE REGISTRATION WITHOUT INITIALIZATION Chaper 3 AUTOMATIC 3D FACE REGISTRATION WITHOUT INITIALIZATION A. Koschan, V. R. Ayyagari, F. Boughorbel, and M. A. Abidi Imaging, Roboics, and Inelligen Sysems Laboraory, The Universiy of Tennessee, 334

More information

Rule-Based Multi-Query Optimization

Rule-Based Multi-Query Optimization Rule-Based Muli-Query Opimizaion Mingsheng Hong Dep. of Compuer cience Cornell Universiy mshong@cs.cornell.edu Johannes Gehrke Dep. of Compuer cience Cornell Universiy johannes@cs.cornell.edu Mirek Riedewald

More information

A Bayesian Approach to Video Object Segmentation via Merging 3D Watershed Volumes

A Bayesian Approach to Video Object Segmentation via Merging 3D Watershed Volumes A Bayesian Approach o Video Objec Segmenaion via Merging 3D Waershed Volumes Yu-Pao Tsai 1,3, Chih-Chuan Lai 1,2, Yi-Ping Hung 1,2, and Zen-Chung Shih 3 1 Insiue of Informaion Science, Academia Sinica,

More information

DEFINITION OF THE LAPLACE TRANSFORM

DEFINITION OF THE LAPLACE TRANSFORM 74 CHAPER 7 HE LAPLACE RANSFORM 7 DEFINIION OF HE LAPLACE RANSFORM REVIEW MAERIAL Improper inegral wih infinie limi of inegraio Inegraion y par and parial fracion decompoiion INRODUCION In elemenary calculu

More information

Chapter Six Chapter Six

Chapter Six Chapter Six Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)

More information

NURBS rendering in OpenSG Plus

NURBS rendering in OpenSG Plus NURS rering in OpenSG Plus F. Kahlesz Á. alázs R. Klein Universiy of onn Insiue of Compuer Science II Compuer Graphics Römersrasse 164. 53117 onn, Germany Absrac Mos of he indusrial pars are designed as

More information

EP2200 Queueing theory and teletraffic systems

EP2200 Queueing theory and teletraffic systems EP2200 Queueing heory and eleraffic sysems Vikoria Fodor Laboraory of Communicaion Neworks School of Elecrical Engineering Lecure 1 If you wan o model neworks Or a comple daa flow A queue's he key o help

More information

Win, Yuzana; Masada, Tomonari. Citation. Issue Date Right. this work in other works.

Win, Yuzana; Masada, Tomonari. Citation. Issue Date Right. this work in other works. NAOSITE: Nagasaki Universiy's Ac Tile Exploring Technical Phrase Frames f Auhor(s) Ciaion Win, Yuzana; Masada, Tomonari 05 IEEE 9h Inernaional Confer Neworking and Applicaions Worksho Issue Dae 05-04-7

More information

*Corresponding author: Mattenstrasse 26, CH-4058 Basel,

*Corresponding author: Mattenstrasse 26, CH-4058 Basel, Simulaing Organogenesis in COMSOL: Image-based Modeling Z. Karimaddini 1,, E. Unal 1,,3, D. Menshykau 1, and D. Iber* 1, 1 Deparemen for Biosysems Science and Engineering, ETH Zurich, Swizerland Swiss

More information

A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER

A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER Gusaf Hendeby, Jeroen D. Hol, Rickard Karlsson, Fredrik Gusafsson Deparmen of Elecrical Engineering Auomaic Conrol Linköping Universiy,

More information

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons Journal of Graph Algorihms and Applicaions hp://jgaa.info/ vol. 15, no. 5, pp. 569 586 (2011) Consan-Work-Space Algorihms for Shores Pahs in Trees and Simple Polygons Tesuo Asano 1 Wolfgang Mulzer 2 Yajun

More information