Available at ISSN: Vol. 4, Issue 2 (December 2009) pp (Previously Vol. 4, No.
|
|
- Elinor Bryan
- 5 years ago
- Views:
Transcription
1 Avilble t ISSN: Vol. 4, Issue December 009 pp Previously Vol. 4, No. Applictions nd Applied Mthemtics: An Interntionl Journl AAM On -ry Subdivision for Curve Design III. m-point nd m + -Point Interpoltory Schemes Jin-o Lin Deprtment of Mthemtics Pririe View A&M University Pririe View, TX USA JiLin@pvmu.edu Received: September 30, 009; Accepted: Jnury 7, 00 Abstrct In this pper, we investigte both the m-point -ry for ny nd m + -point -ry for ny odd 3 interpoltory subdivision schemes for curve design. These schemes include the extended fmily of the clssicl 4- nd 6-point interpoltory -ry schemes nd the fmily of the 3- nd 5-point -ry interpoltory schemes, both hving been estblished in our previous ppers Lin [9 nd Lin [0. Keywords: Subdivision; Curve design; Sttionry; Refinble functions; -ry MSC 000 #: 4H50; 7A4; 65D7; 68U07. Introduction THIS is continution of both Lin [9 nd Lin [0. The former ws for extending the clssicl 4- nd 6-point binry interpoltory subdivision schemes for curve design in Dyn, et l. [5 nd Weissmn [3 to -ry interpoltory schemes for ny 3, nd the ltter ws for the 3- nd 5-point -ry interpoltory schemes for ny odd
2 AAM: Intern. J., Vol. 4, Issue December 009, [Previously Vol. 4, No. 435 Recll tht function φ L R is sid to be refinble with diltion fctor Z +, which is, if φ stisfies the two-scle eqution φx Z p φx, with p } Z l R being φ s two-scle sequence. The simplest setting of is. cf., e.g., Chui [ nd Dubechies [4. A refinble φ is clled scling function, if, in ddition, the fmily φ : Z} genertes Riesz bsis of V φ 0 L R, mening there re constnts 0 < A B < such tht A n n φ n B n, n } n Z l R, n Z n Z where V φ 0 is the L -closure of ll liner combintions of the integer trnsltes of φ, nmely, n Z V φ 0 Clos L spn φ : Z}. By ting the Fourier trnsforms of both sides, φω P e iω/ ω φ, 3 P z p z, 4 Z where P is clled the two-scle symbol of φ. The two-scle sequence p } Z is normlly finitely supported, mening it hs finitely mny nonzero entries. Such scling function is sid to hve polynomil preservtion of order d +, denoted by φ PP d, if π d spn V φ 0, 5 where π d is the collection of ll polynomils of degree d. It is well-nown tht 5 is equivlent to the two-scle symbol P in 4 with the fctor + z + + z d+. A subdivision scheme corresponding to such scling function is given by λ n+ +l j p j+l λ n j, l 0,..., ; n Z +, 6 where λ 0, Z, re the initil control points. When, it is clled binry scheme, nd when 3, it is clled ternry scheme. For the generic, it is simply clled n -ry scheme. The min objective of this note is to extend both results in Lin [9 nd Lin [0 to m-point -ry for ny nd m + -point -ry for ny odd 3 interpoltory subdivision schemes, respectively. Our results re stted in Section s Theorem nd Theorem, with their proofs given in Section 3. Another short wy of proving Theorems & is given in Section 4. Two explicit exmples, s direct consequences of our elegnt formultions, re demonstrted in Section 5.. Min Results
3 436 Jin-o Lin Let φ m nd φ m+ be the scling functions with diltion fctor, which correspond the mnd m +-point interpoltory subdivision schemes for curve design. The smoothness of φ m nd φ m+ for ll diltion fctors is importnt for the convergence of their corresponding interpoltory subdivision schemes. We do not go to detils here. However, for some previous studies of scling functions their smoothness with different diltion fctors 3, the reders re referred to, e.g., Chui & Lin [3, Hn [6, Belogy & Wng [, Shui, Bo, & Zhng [, Peng & Wng [. For φ m, we hve the following: Theorem. The scling function φ m PP m with the smllest support, is determined by the two-scle symbol P m of the form where P m z mp 0 for > m, nd mp mp Z z m m p z m l! m + l! m z m S m z, 7 z m l ξ m+l ξ + η, l, l +,..., l + ; l 0,..., m, 8 nd S m is polynomil of exct degree m, stisfying S m nd S m z z m S m /z. η It then follows from 6 nd 8 tht the m-point -ry interpoltory subdivision scheme is λ n+ λ n+ +l λ n, m mp j+l λ n j m +j, l,..., ; n Z +, 9 for ny diltion fctor. For φ m+ PP m+, we hve the following. Theorem. The scling function φ m+ PP m+ with the smllest support, is determined from the two-scle symbol P m+ of the form P m+ z Z m+p z z m / z m+ S mz, 0 z
4 AAM: Intern. J., Vol. 4, Issue December 009, [Previously Vol. 4, No. 437 where Z + is odd, 3, m+ p m+ p 0 for > m + /, nd m+ p m l! m + l! m 0,..., /, when l 0; m l m+l ξ + η, l /,..., l + /, when l,..., m, nd S m is polynomil of exct degree m, stisfying S m nd S m z z m S m /z. ξ η Correspondingly, it follows from 6 nd tht the m + -point -ry interpoltory subdivision scheme is λ n+ λ n+ +l λ n m, j m m+ p j+l λ n +j, l,..., /; n Z Proofs of Min Results Proof of Theorem. Anlogous to the proof in Lin [9, n -ry m-point scheme needs t most m weights, i.e., the two-scle sequence mp j } Z of φ m hs t most m consecutive nontrivil entries. For PP m, the two-scle symbol P m must hve the form P m z z m z m S m z z for some polynomil S m π m of exct degree m stisfying S m nd S m z z m S m /z. It suffices to show tht S m is uniquely determined under the interpoltory condition P m w l z, z, 3 l0 where w l } l0 re the distinct roots of z, nmely, lπi w l exp, l 0,...,. First, with S m z m s z, we define m g j z j S m z z s m z j0 l0 m + l z l, m
5 438 Jin-o Lin so tht g j j m + j s, j Z +. 4 j Second, by defining g j 0 for j < 0, [ P m z m z m z m S m z z m m m m z m z g l z l l Z m z m z m l g j +l z j l0 j Z Z m z m l g j +l z j m+. j Z l0 Z Third, the interpoltory condition 3 now leds to which is equivlent to j+m m m j Z m Z g j+m z j, g j+m m δ j,0, j m +,, m. 5 Fourth, solving the lower tringulr system 5, we hve m + j g j m, j,, m, 6 m nd the coefficients s 0,..., s m of S m cn now be evluted from 4 nd 6, nmely, m m + j m s m + j m, j,,m. 7 m Solving 7 for s 0,..., s m nd computing g j } j Z+ by 4, we hve g l l + m! m l +, l Z +. 8 Finlly, by using 7, we rrive t the vlues of mp in 8. This completes the proof of Theorem. Proof of Theorem.
6 AAM: Intern. J., Vol. 4, Issue December 009, [Previously Vol. 4, No. 439 Denote by P m+ the two-scle symbol of φ m+. Completely nlogous to the proof of Theorem, both P m+ PP m+ nd φ m+ hving symmetric two-scle sequence led to P m+ z z m / z m+ S mz z m+p } m+ / m / for to-be-determined polynomil S m of exct degree m, stisfying S m nd S m z z m S m /z, where 3 is positive odd integer. Agin, by writing S m z m s z, introducing g j z j S m z z m+, j0 g j j m + j s, j Z +. 9 j nd defining g j 0 for j < 0, we hve / P m+ z m z m + l g j +l+ / z j m. l / j Z Z The interpoltory property yields m + g j+m + / m δ j,0, j m,,m, which leds to Z Solving the liner system m m + j s m m + j g j+ / m, j 0,, m. 0 m m + j for s 0,..., s m nd computing g j } j Z+ for generl j by 9, we hve g l l m + l l s m m! m m m, j 0,,m, l +, l Z +. Finlly, m+p } m+ / m / is obtined s listed in. 4. Another Short Wy of Proving Theorem & Theorem The proofs of our two theorems in Section 3 were direct nd cler-cut. We show in this section nother short or mybe not so-short wy, by using the Tylor expnsions of the expression
7 440 Jin-o Lin m z. For, see Dubechies [4. For 3, see Chui & Lin [3. For generic z nd multiwvelet setting, see Lin [8. First, for subdivision scheme generted from scling function φ to be symmetric, the two-scle symbol P of φ hs to be reciprocl. For this purpose, Pz needs to be function of z + z. m z For this reson, the fctor, requirement for φ PP z m, hs to be function of z + z. This is equivlent to the positive integer m hs to be even. Hence, if m is even then the diltion fctor or smpling rte cn be ny positive integer. However, if m is odd, hs to be even. Tht is why for m + -point subdivision scheme, hs to be odd. To get redy for the new short proofs of the two theorems, we estblish the following: Lemm. For ny positive even integer, + z + + z [ z + + z z z + z For ny positive odd integer, + z + + z z / + [ z + / + z + 5/ z 3/ + z 3/+. 4 The proof of Lemm is strightforwrd. We re now in the position of the new proofs of Theorems &. Another Short Proof of Theorem. When the polynomil preservtion is of even order, we cn write P m z m p z z m n z m S nz, 5 z Z for some reciprocl polynomil S n. Then the interpoltory condition 3 yields [ m z n S n z z + z + + z m z w m n l S n w l z. 6 w l z l It follows from Lemm tht for either even or odd, the first term in 6 is function of z z m nd the lst terms in 6 hve the fctor. Hence, the minimum z z
8 AAM: Intern. J., Vol. 4, Issue December 009, [Previously Vol. 4, No. 44 degree of n is m, nd z m S m z is the m th order Tylor polynomil of m z m 7 + z + + z z in terms of the vrible t. More precisely, by using Lemm, when is even, z [ m m z m z + z + + z + z + + z + z z [ nd when is odd, m [ z m z / + z + + z + z + + z + z z [ + / + 5/ + z + z ++ m m, 8 z 3/ + z 3/+ m.9 In other words, the exct expressions of P m z re formed from either the Tylor polynomils of 8 for even or the Tylor polynomils of 9 for odd. This completes the short proof of Theorem. Another Short Proof of Theorem. When the polynomil preservtion is of odd order, the diltion fctor hs to be odd s well, nd we cn write P m+ z m+p z Z + z + + z z m+ / n m+ S nz, 30 for some reciprocl polynomil S n. Agin, the interpoltory condition 3 leds to [ z n z / m+ S n z + z + + z m z w m+/ n l S n w l z. 3 w l z l Therefore, n m, nd z m S m z is the m + st order Tylor polynomil of z / m+ 3 + z + + z
9 44 Jin-o Lin in terms of the vrible t For convenience, we fix z. This completes the short proof of Theorem. z t z z z z in the sequel, so tht the Tylor expnsions re in terms of t. For exmple, it is esy to see, by using t in 33, tht for, 3, 4, nd 5, the expressions we need for Tylor expnsions in t re z + z t ; z + z + z t ; z + z + z 3 z 3 5z + z + z + z 3 + z 4 t 6 0 8t + t 33 ; 36 t 5 5 t Demonstrtion by Two Explicit Exmples We demonstrte our elegnt formultions in this section by giving two explicit exmples s direct consequences of Theorems &. Exmple. 8-point binry interpoltory: m 4,. It follows from 8, 7, nd 8 tht g 0,,g 6 } 5 6, 0, 9 6 s 0,,s 6 } 5 6, 5, 3 6 8p 7, 8p 5,, 8p 7 } 49, 0, 33, 0, 6 6 } ;, 3, 3 6, 5, 5 6 } ; 5 048, , , 5 048, 5 048, , , so tht, by using 9, the 8-point binry interpoltory scheme is given by λ n+ λ n, λ n+ + 3 j 4 8p j+ λ n +j 38 },
10 AAM: Intern. J., Vol. 4, Issue December 009, [Previously Vol. 4, No. 443 [ 5 λ n λn λ n 3 + λn λ n + λn λ n + λn +, n Z The subdivision scheme in cn lso be estblished by 6, with m 4 nd, or by using the cubic Tylor polynomil expnsion of 34, with t in 33. More explicitly, it follows from tht z 3 S 6 z t z + z 40 [ 8 + z P 8 z z 3 S z 4 6 z [ z 3 + z 4 z + z, 4 which lso yields the subdivision scheme in Exmple. 7-point ternry interpoltory: m 3. Agin, it follows from,, nd tht g 0,,g 6 } 8 9, 0, 35 9, 44 } 9, 0, 9 9, 5 ; 9 s 0,,s 6 } 8 9, 96 9, 553 9, 779 9, 553 9, 96 } 9, 8 ; p 0, 3 7 p 9,, 3 7 p 0} 8 656, 0, , 80, 0, 87 87, , 0, 87 87, ,, , , 0, 80 87, 35 8, 0, }., 0, , Hence, it follows from tht the 7-point ternry interpoltory scheme is given by 3 λ n p 3j λ n +j λ n+ 3 j [ 35λ n 3 336λn + 00λn λn 050λ n λn + 8λn +3, 4 λ n, 43 λ n j 3 3 7p 3j+ λ n +j
11 444 Jin-o Lin [ 8λ n λn 050λn λn +00λ n + 336λn λn +3, n Z Similr to 40 4 in Exmple, 4 44 cn lso be estblished by pplying 30, with m 3, or, with t in 33, by using the cubic Tylor polynomil expnsion of 35. More explicitly, it follows from t z z z 3 S 6 z 3 3 tht + z + z 3 7 P 7 z z 3 S 6 z 3z + z + z z z, 3z 3 which lso genertes the subdivision scheme in Acnowledgment The uthor would lie to thn the nonymous referees for their vluble comments tht helped improve the presenttion of the pper. References [ Belogy, E. nd Wng, Y Compctly supported orthogonl symmetric scling functions, Appl. Comput. Hrmonic Anl. 7, [ Chui, C. K. 99. An Introduction to Wvelets, Acdemic Press, Boston. [3 Chui, C. K. nd Lin, J.-A Construction of compctly supported symmetric nd ntisymmetric orthonorml wvelets with scle 3, Appl. Comput. Hrmonic Anl., -5. [4 Dubechies, I. 99. Ten Lectures on Wvelets, CBMS-NSF Regionl Conference Series in Applied Mth., Vol. 6, SIAM, Phildelphi. [5 Dyn, N., Levin, D., nd Gregory, J A 4-point interpoltory subdivision scheme for curve design, Computer Aided Geometric Design 4, [6 Hn, B orthonorml scling functions nd wvelets with diltion fctor 4, Appl. Comput. Hrmonic Anl. 8, -47. [7 Hssn, M. F. nd Dodgson, N. A. 00. Ternry nd three-point univrite subdivision schemes, in: Curve nd Surfce Fitting: Sint-Mlo 00, A. Cohen, J.-L. Merrien, nd L. L. Schumer eds., Nshboro Press, Brentwood, TN, [8 Lin, J.-A. 00. Polynomil identities of Bezout type, in: Trends in Approximtion Theory, K. Kopotun, T. Lyche, nd M. Nemtu eds., Vnderbilt University Press, Nshville, TN, [9 Lin, J.-A On -ry subdivision for curve design: I. 4-point nd 6-point interpoltory schemes, Appliction & Applied Mth. 3, 8 9. [0 Lin, J.-A On -ry subdivision for curve design: II. 3-point nd 5-point interpoltory schemes, Appliction & Applied Mth. 3, [ Peng, L. nd Wng, Y Construction of compctly supported orthonorml wvelets with beutiful structure, Science in Chin Series F: Informtion Sciences 47, [ Shui, P.-L., Bo, Z., nd Zhng, X.-D. 00. M-bnd compctly supported orthogonl symmetric interpolting scling functions, IEEE Trns. Signl Proc., Vol. 49, Issue 8, pp [3 Weissmn, A A 6-point interpoltory subdivision scheme for curve design, Msters Thesis, Tel-Aviv University.
10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationA Fixed Point Approach of Quadratic Functional Equations
Int. Journl of Mth. Anlysis, Vol. 7, 03, no. 30, 47-477 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.988/ijm.03.86 A Fixed Point Approch of Qudrtic Functionl Equtions Mudh Almhlebi Deprtment of Mthemtics,
More informationIntegration. October 25, 2016
Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve
More informationAVolumePreservingMapfromCubetoOctahedron
Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online
More informationIntegration. September 28, 2017
Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationOn Reduced Zagreb Indices of Polycyclic Aromatic Hydrocarbons and Benzenoid Systems
Annls of Pure nd Applied Mthemtics Vol. 8, No., 08, 73-78 ISSN: 79-087X (P), 79-0888(online) Published on 0 August 08 www.reserchmthsci.org DOI: http://dx.doi.org/0.457/pm.v8n0 Annls of On Reduced Zgreb
More informationMath 142, Exam 1 Information.
Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At
More informationComplete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li
2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationRepresentation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation
Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationx )Scales are the reciprocal of each other. e
9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.
More informationa(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X
4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationConvergence of Wachspress coordinates: from polygons to curved domains
Convergence of Wchspress coordintes: from polygons to curved domins Jiří Kosink Computer Lbortory University of Cmbridge Jiri.Kosink@cl.cm.c.uk Michel Brtoň Numericl Porous Medi Center King Abdullh University
More informationPointwise convergence need not behave well with respect to standard properties such as continuity.
Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples
More informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More informationAML710 CAD LECTURE 16 SURFACES. 1. Analytical Surfaces 2. Synthetic Surfaces
AML7 CAD LECTURE 6 SURFACES. Anlticl Surfces. Snthetic Surfces Surfce Representtion From CAD/CAM point of view surfces re s importnt s curves nd solids. We need to hve n ide of curves for surfce cretion.
More informationIntroduction to Integration
Introduction to Integrtion Definite integrls of piecewise constnt functions A constnt function is function of the form Integrtion is two things t the sme time: A form of summtion. The opposite of differentition.
More information9 Graph Cutting Procedures
9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric
More informationBanach Journal of Mathematical Analysis ISSN: (electronic)
Bnch J. Mth. Anl. 4 (2010), no. 1, 170 184 Bnch Journl of Mthemticl Anlysis ISSN: 1735-8787 (electronic) www.emis.de/journls/bjma/ GENERALIZATIONS OF OSTROWSKI INEQUALITY VIA BIPARAMETRIC EULER HARMONIC
More informationMath 464 Fall 2012 Notes on Marginal and Conditional Densities October 18, 2012
Mth 464 Fll 2012 Notes on Mrginl nd Conditionl Densities klin@mth.rizon.edu October 18, 2012 Mrginl densities. Suppose you hve 3 continuous rndom vribles X, Y, nd Z, with joint density f(x,y,z. The mrginl
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 12, December ISSN
Interntionl Journl of Scientific & Engineering Reserch, Volume 4, Issue 1, December-1 ISSN 9-18 Generlised Gussin Qudrture over Sphere K. T. Shivrm Abstrct This pper presents Generlised Gussin qudrture
More informationComputing offsets of freeform curves using quadratic trigonometric splines
Computing offsets of freeform curves using qudrtic trigonometric splines JIULONG GU, JAE-DEUK YUN, YOONG-HO JUNG*, TAE-GYEONG KIM,JEONG-WOON LEE, BONG-JUN KIM School of Mechnicl Engineering Pusn Ntionl
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationDetermining Single Connectivity in Directed Graphs
Determining Single Connectivity in Directed Grphs Adm L. Buchsbum 1 Mrtin C. Crlisle 2 Reserch Report CS-TR-390-92 September 1992 Abstrct In this pper, we consider the problem of determining whether or
More informationLecture Overview. Knowledge-based systems in Bioinformatics, 1MB602. Procedural abstraction. The sum procedure. Integration as a procedure
Lecture Overview Knowledge-bsed systems in Bioinformtics, MB6 Scheme lecture Procedurl bstrction Higher order procedures Procedures s rguments Procedures s returned vlues Locl vribles Dt bstrction Compound
More informationLecture 12 : Topological Spaces
Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X
More informationSOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES
SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationCS201 Discussion 10 DRAWTREE + TRIES
CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the
More informationStep-Voltage Regulator Model Test System
IEEE PES GENERAL MEETING, JULY 5 Step-Voltge Regultor Model Test System Md Rejwnur Rshid Mojumdr, Pblo Arboley, Senior Member, IEEE nd Cristin González-Morán, Member, IEEE Abstrct In this pper, 4-node
More informationImproper Integrals. October 4, 2017
Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here
More information[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116
[Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth
More information50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:
5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )
More informationLily Yen and Mogens Hansen
SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst
More informationThis notebook investigates the properties of non-integer differential operators using Fourier analysis.
Frctionl erivtives.nb Frctionl erivtives by Fourier ecomposition by Eric Thrne 4/9/6 This notebook investigtes the properties of non-integer differentil opertors using Fourier nlysis. In[]:=
More informationON THE NUMBER OF ISOMORPHISM CLASSES OF JACOBI QUARTIC CURVES OVER A FINITE FIELD
O THE UMBER OF ISOMORPHISM CLASSES OF JACOBI QUARTIC CURVES OVER A FIITE FIELD HOGFEG WU LI ZHU College of Sciences orth Chin University of Technology Beijing 0044 Chin College of Sciences orth Chin University
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationRevisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network
Interntionl Journl of Distributed nd Prllel Systems (IJDPS) Vol., No.6, November 0 Revisiting the notion of Origin-Destintion Trffic Mtrix of the Hosts tht re ttched to Switched Locl Are Network Mondy
More information1 The Definite Integral
The Definite Integrl Definition. Let f be function defined on the intervl [, b] where
More informationON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS. S.S. Kim, S.S. Dragomir, A. White and Y.J. Cho. 1.
ON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS S.S. Kim, S.S. Drgomir, A. White nd Y.J. Cho Abstrct. In this pper, we shll give generliztion of the Grüss type inequlity nd obtin
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationThe Fundamental Theorem of Calculus
MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is
More informationClass-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts
Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round
More informationResearch Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES
Volume 2, 1977 Pges 349 353 http://topology.uburn.edu/tp/ Reserch Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES by J. A. Guthrie, H. E. Stone, nd M. L. Wge Topology Proceedings Web: http://topology.uburn.edu/tp/
More informationHomework. Context Free Languages III. Languages. Plan for today. Context Free Languages. CFLs and Regular Languages. Homework #5 (due 10/22)
Homework Context Free Lnguges III Prse Trees nd Homework #5 (due 10/22) From textbook 6.4,b 6.5b 6.9b,c 6.13 6.22 Pln for tody Context Free Lnguges Next clss of lnguges in our quest! Lnguges Recll. Wht
More informationTopic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords
Tody s Topics 3. Trnsformtions in 2D 4. Coordinte-free geometry 5. (curves & surfces) Topic 3: 2D Trnsformtions 6. Trnsformtions in 3D Simple Trnsformtions Homogeneous coordintes Homogeneous 2D trnsformtions
More information4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E
4-1 NAME DATE PERIOD Pges 142 147 Prllel Lines nd Plnes When plnes do not intersect, they re sid to e prllel. Also, when lines in the sme plne do not intersect, they re prllel. But when lines re not in
More informationSubtracting Fractions
Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding
More informationarxiv: v2 [math.ho] 4 Jun 2012
Volumes of olids of Revolution. Unified pproch Jorge Mrtín-Morles nd ntonio M. Oller-Mrcén jorge@unizr.es, oller@unizr.es rxiv:5.v [mth.ho] Jun Centro Universitrio de l Defens - IUM. cdemi Generl Militr,
More informationTASK SPECIFIC DESCRIPTION
MYP Algebr II/Trig Unit 2 Ch. 4 Trnsformtions Project Nme: Block: - Due Dte: Tuesdy, 11/7 (B-dy) & Wednesdy, 11/8 (A-dy) Mterils: Grph pper, ruler, protrctor, compss, highlight mrkers/colored pencils SCORE:
More informationMatrices and Systems of Equations
Mtrices Mtrices nd Sstems of Equtions A mtri is rectngulr rr of rel numbers. CHAT Pre-Clculus Section 8. m m m............ n n n mn We will use the double subscript nottion for ech element of the mtri.
More informationCHAPTER 8 Quasi-interpolation methods
CHAPTER 8 Qusi-interpoltion methods In Chpter 5 we considered number of methods for computing spline pproximtions. The strting point for the pproximtion methods is dt set tht is usully discrete nd in the
More informationMath/CS 467/667 Programming Assignment 01. Adaptive Gauss Quadrature. q(x)p 4 (x) = 0
Adptive Guss Qudrture 1. Find n orthogonl polynomil p 4 of degree 4 such tht 1 1 q(x)p 4 (x) = 0 for every polynomil q(x) of degree 3 or less. You my use Mple nd the Grm Schmidt process s done in clss.
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More informationIMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho
IMAGE QUALITY OPTIMIZATIO BASED O WAVELET FILTER DESIG AD WAVELET DECOMPOSITIO I JPEG2000 Do Qun nd Yo-Sung Ho School of Informtion & Mechtronics Gwngju Institute of Science nd Technology (GIST) 26 Cheomdn-gwgiro
More informationA Transportation Problem Analysed by a New Ranking Method
(IJIRSE) Interntionl Journl of Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 A Trnsporttion Problem Anlysed by New Rnking Method Dr. A. Shy Sudh P. Chinthiy Associte Professor PG Scholr
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationCHAPTER 5 Spline Approximation of Functions and Data
CHAPTER 5 Spline Approximtion of Functions nd Dt This chpter introduces number of methods for obtining spline pproximtions to given functions, or more precisely, to dt obtined by smpling function. In Section
More informationApproximation by NURBS with free knots
pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde
More informationTheory of Computation CSE 105
$ $ $ Theory of Computtion CSE 105 Regulr Lnguges Study Guide nd Homework I Homework I: Solutions to the following problems should be turned in clss on July 1, 1999. Instructions: Write your nswers clerly
More informationIf f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.
Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the
More informationMATH 2530: WORKSHEET 7. x 2 y dz dy dx =
MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl
More informationConstruction and Application of Subdivision Surface Scheme Using Lagrange Interpolation Polynomial
Alied Mthemtics 4 5 87-97 Published Online Februry 4 (htt://wwwscirorg/ournl/m htt://dxdoiorg/46/m454 Construction Aliction o Subdivision Surce Scheme Using grnge Interoltion Polynomil Fheem Khn * Noreen
More information5/9/17. Lesson 51 - FTC PART 2. Review FTC, PART 1. statement as the Integral Evaluation Theorem as it tells us HOW to evaluate the definite integral
Lesson - FTC PART 2 Review! We hve seen definition/formul for definite integrl s n b A() = lim f ( i )Δ = f ()d = F() = F(b) F() n i=! where F () = f() (or F() is the ntiderivtive of f() b! And hve seen
More informationChapter Spline Method of Interpolation More Examples Electrical Engineering
Chpter. Spline Method of Interpoltion More Exmples Electricl Engineering Exmple Thermistors re used to mesure the temperture of bodies. Thermistors re bsed on mterils chnge in resistnce with temperture.
More informationResearch Article Subdivision Depth Computation for Tensor Product n-ary Volumetric Models
Abstrct nd Applied Anlysis Volume 2011, Article ID 203453, 22 pges doi:10.1155/2011/203453 Reserch Article Subdivision Depth Computtion for Tensor Product n-ary Volumetric Models Ghulm Mustf nd Muhmmd
More informationMisrepresentation of Preferences
Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from
More informationIllumination and Shading
Illumintion nd hding In order to produce relistic imges, we must simulte the ppernce of surfces under vrious lighting conditions. Illumintion models: given the illumintion incident t point on surfce, wht
More informationBasic Geometry and Topology
Bsic Geometry nd Topology Stephn Stolz Septemer 7, 2015 Contents 1 Pointset Topology 1 1.1 Metric spces................................... 1 1.2 Topologicl spces................................ 5 1.3 Constructions
More informationRational Numbers---Adding Fractions With Like Denominators.
Rtionl Numbers---Adding Frctions With Like Denomintors. A. In Words: To dd frctions with like denomintors, dd the numertors nd write the sum over the sme denomintor. B. In Symbols: For frctions c nd b
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More information1 Drawing 3D Objects in Adobe Illustrator
Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationTree Structured Symmetrical Systems of Linear Equations and their Graphical Solution
Proceedings of the World Congress on Engineering nd Computer Science 4 Vol I WCECS 4, -4 October, 4, Sn Frncisco, USA Tree Structured Symmetricl Systems of Liner Equtions nd their Grphicl Solution Jime
More informationFunctor (1A) Young Won Lim 8/2/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationLecture 7: Integration Techniques
Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.
More informationExplicit Decoupled Group Iterative Method for the Triangle Element Solution of 2D Helmholtz Equations
Interntionl Mthemticl Forum, Vol. 12, 2017, no. 16, 771-779 HIKARI Ltd, www.m-hikri.com https://doi.org/10.12988/imf.2017.7654 Explicit Decoupled Group Itertive Method for the Tringle Element Solution
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationIntroduction. Chapter 4: Complex Integration. Introduction (Cont d)
Introduction Chpter 4: Complex Integrtion Li, Yongzho Stte Key Lbortory of Integrted Services Networks, Xidin University October 10, 2010 The two-dimensionl nture of the complex plne required us to generlize
More informationParallel Square and Cube Computations
Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationAn Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization
An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction
More informationComparison of Numerical Solution of 1D Hyperbolic Telegraph Equation using B-Spline and Trigonometric B-Spline by Differential Quadrature Method
Indin Journl of Science Technology, Vol 9(45), DOI: 7485/ijst/6/v9i45/6356, December 6 ISSN (Prin : 974-6846 ISSN (Online) : 974-5645 Comprison of Numericl Solution of D Hyperbolic Telegrph Eqution using
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn Michael S. Floater Kai Hormann Abstract. We present a new four-point subdivision scheme that generates C 2 curves.
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes
More informationFunctor (1A) Young Won Lim 10/5/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationStudy Guide for Exam 3
Mth 05 Elementry Algebr Fll 00 Study Guide for Em Em is scheduled for Thursdy, November 8 th nd ill cover chpters 5 nd. You my use "5" note crd (both sides) nd scientific clcultor. You re epected to no
More informationSummer Review Packet For Algebra 2 CP/Honors
Summer Review Pcket For Alger CP/Honors Nme Current Course Mth Techer Introduction Alger uilds on topics studied from oth Alger nd Geometr. Certin topics re sufficientl involved tht the cll for some review
More informationCS 130 : Computer Systems - II. Shankar Balachandran Dept. of Computer Science & Engineering IIT Madras
CS 3 : Computer Systems - II Shnkr Blchndrn (shnkr@cse.iitm.c.in) Dept. of Computer Science & Engineering IIT Mdrs Recp Differentite Between s nd s Truth Tbles b AND b OR NOT September 4, 27 Introduction
More informationMatrix-valued 4-point Spline and 3-point Non-spline Interpolatory Curve Subdivision Schemes
Matrix-valued 4-point Spline and -point Non-spline Interpolatory Curve Subdivision Schemes Charles K. Chui, Qingtang Jiang Department of Mathematics and Computer Science University of Missouri St. Louis
More informationMath 35 Review Sheet, Spring 2014
Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided
More information