Cubic smoothing spline

Size: px
Start display at page:

Download "Cubic smoothing spline"

Transcription

1 Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable y. Number of points (x i, y i ) is n. e regression model y = f(x) + ε is composed of p cubic curves defined on p adjacent segments, xu,1 xu,1, xu,2... xu, p 1, of te x-axis separated by p 1 knots. e values x u,i are knots and can be defined by te user. Analytical properties of te curve (like smootness, curvature, continuity) and statistical properties (residual variance, prediction variance) are subject to modeling. e polynomial regression spline can be written generally as y x S x a, 2 S x 1, x, x,..., x ; 0 were is te polynomial order, in case of =3 it is a cubic spline. S (x) is te vector or predictors and a k is vector of regression coefficients in te k-t segment. If te measured value at x i is y i, and x i is in te k-t interval (k-t segment) wic is te interval (x u,k-1 ; x u,k ), ten te predicted value f(x i ) is given by f(x i ) = a k,1 + a k,2 x i + a k,3 x i 2 + a k,4 x i 3 Parameters a k,i are computed by linear least squares regression. If no continuity for te function at knots was required, te model would be p independent regression polynomials as sown on Fig. 1. e sape of te regression curve depends eavily on te cosen number of segments as sown on Fig. 2a, b. k Fig. 1 Example four independent cubic regression polynomials (discontinuous spline)

2 Fig. 2 a, b Discontinuous regression splines for p = 3 and p = 6 e above models are discontinuous, tey sow flexibility of regression splines, tey are of little use owever. Usually, we want te model to be continuous in f(x), so we impose te condition S x k 1 S x a a k. Furter, we can make use of easy differentiability of polynomials and introduce conditions of continuous first and second derivatives at knots. For our cubic splines we ave = 3. S x k 1 S x a a, S x a S x k k 1 a were te first and second derivative of te polynomial are defined as follows: x 2 1 S S x 0,1,2 x,3 x,..., x x 2 S x 2 S x 0,0,2,6 x,..., 1 x 2 x Imposing tese conditions will result in a curve wit second order differentiability. Suc a spline curve will be suitable for a wide class of applications. is smoot curve will. k

3 ave continuous second derivative and smoot first derivative in te sense tat S 3 '' (x) S 3 '' (x+δ) < ε for any ε > 0 and sufficiently small nonzero δ. Compared to kernel smooters or moving average (see Basic Statistics module), cubic splines eliminate bias in estimating mean, especially near maxima or minima. anks to using a linear regression model it is possible to compute statistical caracteristics suc as confidence intervals, standard deviation, covariance matrices, error estimates. Curves on Fig. 3 troug Fig. 5 sow te same data fitted wit splines wit continuous f(x), continuous f(x) and f '(x), and continuous f(x), f '(x) and f ' '(x). e data are te same as in Fig. 1. No boundary conditions are posed at te beginning or te end of te curve in te Cubic Spline module. Fig. 3 Fit te data wit a continuous spline function f(x) Fig. 4 Fit te data wit continuous f(x) and f '(x)

4 Fig. 5 Fit te data wit continuous f(x) and f '(x) and f ''(x) (te smootest curve) Knots can be defined by te user (by default, te knots are spaced on x so tat te number of points in eac segment be te same if possible). e influence of number and position of knots on te spline curve is illustrated on Fig. 6. e smallest number of knots is 1, dividing te spline into two segments (number of segments p = 2). Maximum number of knots is n 1 (not generally recommended), were n is number of data points. In tis case, te spline can provide no statistical information (suc as variances or confidence intervals) as it passes troug all points. Since te spines can sometimes be overdetermined a generalized Moore-Penrose pseudoinverse is used to compute te regression coefficients to ensure correct solution. Fig. 6 Influence of knots selection (same data in all 4 plots)

5 Polynomial form of te spline curve allows analytical evaluation of derivatives and integrals of te curve wic can be used for analysis of pysical or cemical processes as suggested on Fig. 7 and Fig. 8. Fig. 7 Using spline to find area under curve and derivatives Fig. 8 Using Spline module to determine inflex points on a titration curve Data and parameters Data X and Y are expected in two columns in te Data seet. Furter columns may contain positions of user-defined knots, new x-data for prediction and weigts for individual measurements. An example of data structure is sown on Fig. 9 Fig. 10. It is good to keep in mind tat eac segment may contain at most one maximum, one minimum and one inflex

6 point. If te data for prediction is defined, te predicted y-values, teir 1 α confidence interval and analytical derivatives and integrals are computed in te protocol. Note: e number m of columns of te caracteristic matrix is m = 4p. ere may be an issue of numerical instability in case of too many segments. It is recommended to use rater small number of segments, say 2 to 10, but not more tan 50. A possible consequence of too many segments is illustrated on Fig. 11. Fig. 9 Basic data structure for spline Fig. 10 Full possible structure of spline data A: p=5 B: p=30 C: p=50 Fig. 11 Suitable (A, B) and too big (B, C) number of segments p for n=150

7 Fig. 12 Dialog window for Cubic spline module Open te Cubic Spline dialog window (Menu: QC.Expert Regression Cubic Spline). Coose te columns wit independent and dependent variable. Optionally, coose te column wit description of individual cases, ceck te Weigts and Prediction ceck boxes and select appropriate columns. In te group Knots select No of segments (knots will be cosen automatically), or Knots from table (knots must be given in te selected column of te data table). It is recommended to coose number of segments p so tat number of points n is divisible by p. Generally, number of points in te first (p 1) segments is equal to IN(n/p), te last p t segment contains te rest of te points. For example, if n=12 and p=7 ten first six segments will contain one point wile te last segment will contain 6 points. Continuity requirements are set in te group Continuity in. e user may select any combination of continuity in function values, first and second derivatives. By default, all boxes are cecked (recommended). Cecking te box Data and residuals in te group Protocol will produce a table of data and residuals. is table as as many rows as te original data and may be avoided if not necessary. Clicking OK will run te computation. Protocol ask name ask name from te dialog window Data Selected data subset (All, Marked, Unmarked, or user-defined filter) Independent variable Selected independent variable column Dependent variable Selected dependent variable column No of points Number of data rows n No of knots Number of knots (p 1) No of sections Number of segments p Continuous function Required continuity in function values (Yes / No) Continuous first derivatives Required continuity in first derivatives (Yes / No)

8 Continuous second derivatives Required continuity in second derivatives (Yes / No) Knots positions Number and x-position of knots Model parameters Number of data points in individual segments and estimated regression coefficients of te polynomial y = a 0 + a 1 x + a 2 x 2 + a 3 x 3 ; A(0)=absolute term, A(1)=linear term, A(2)=quadratic term, A(3)=cubic term able of predicted values If Prediction was selected in te Cubic Spline dialog window tis table gives predicted value (Y-pred) for all a-values given in te Prediction column (X-value) togeter wit confidence interval of prediction (Lower bound, Upper bound), and values of first and second derivatives. Residual squares sum Sum of te squared residuals (estimated errors) Residual std. deviation Standard deviation of te residuals Residual variance Variance of te residuals Mean std. deviation Residual standard deviation Eff. degrees of freedom Effective degrees of freedom, ν eff = n + c*(p 1) 4p, were p is number of segments and c is number of continuity requirements. If te degrees of freedom is less tan 1 no statistics is computed. ables of extremes and inflexes Consists of two tables a table of extremes and a table of inflexes in te interval of x-data (x min, x max ). If no extremes and inflexes are found tis table is not created. No of extremes is table provides analytically computed extremes (minima and maxima) on te regression curve. Columns in te table include: ype of extreme (MIN or MAX), X- and Y-coordinate and second derivative (first derivative is always zero at te extreme). able of inflexes is table provides analytically computed inflexes on te regression curve. Columns in tis table include: X- and Y- coordinate and first derivative (second derivative is always zero at te inflex point). able of data and residuals It te ceckbox Data and residuals was cecked in te Cubic Spline dialog window tis table provides original data ( measured X and Y values), predicted Y-values and residuals (difference between measured and predicted Y values). Graps Spline function Plot of regression spline function. If degrees of freedom ν eff > 0 confidence intervals of te mean are plotted as red lines around te spline curve (plot A). If ν eff = 0 te curve is called interpolation spline as it passes troug data (plots B-D). Plots (C) and (D) are splines wit loosened continuity conditions. However, in most real

9 cases, ν eff > 0 and p<<n wit all continuity conditions imposed will be advisable. (A) (B) (C) (D) Spline function wit knots Same as te previous plot wit visible knot values.

10 First derivative f (1) (x). of te spline function. Zero-points correspond to local minima and maxima of te spline function. Numerical values of te first derivative are also available in Protocol in able of predicted values and ables of extremes and inflexes. Second derivative f (2) (x). of te spline function. Zero-points correspond to inflex points of te spline function. Numerical values of te second derivative are also available in Protocol in able of predicted values and ables of extremes and inflexes. Integral of te spline function. x xmin f z dz Plot of residuals y i f(x i ). It tere is a trend in te residuals te knots may ave been cosen improperly and canges in te model sould be considered. Q-Q plot of te residuals. If te points lie close to te line te residuals (not necessarily te actual errors) ave approximately normal distribution. Plot of Y-prediction plots te measured data against predicted y- values. e closer lie te points to a line te closer fit troug te data. It is not generally te goal to ave te closest fit (like interpolation spline). Rater we try to find reasonably complex model to describe te data realistically.

Linear Interpolating Splines

Linear Interpolating Splines Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation

More information

Piecewise Polynomial Interpolation, cont d

Piecewise Polynomial Interpolation, cont d Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined

More information

More on Functions and Their Graphs

More on Functions and Their Graphs More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in

More information

4.2 The Derivative. f(x + h) f(x) lim

4.2 The Derivative. f(x + h) f(x) lim 4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially

More information

Fast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation

Fast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,

More information

4.1 Tangent Lines. y 2 y 1 = y 2 y 1

4.1 Tangent Lines. y 2 y 1 = y 2 y 1 41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange

More information

Materials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector.

Materials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Adam Clinc Lesson: Deriving te Derivative Grade Level: 12 t grade, Calculus I class Materials: Witeboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Goals/Objectives:

More information

2.8 The derivative as a function

2.8 The derivative as a function CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in

More information

2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically

2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically 2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use

More information

, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result

, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions

More information

13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR

13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR 13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f

More information

ANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS

ANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT

More information

MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2

MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found

More information

Implementation of Integral based Digital Curvature Estimators in DGtal

Implementation of Integral based Digital Curvature Estimators in DGtal Implementation of Integral based Digital Curvature Estimators in DGtal David Coeurjolly 1, Jacques-Olivier Lacaud 2, Jérémy Levallois 1,2 1 Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205, F-69621,

More information

Section 2.3: Calculating Limits using the Limit Laws

Section 2.3: Calculating Limits using the Limit Laws Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give

More information

CHAPTER 7: TRANSCENDENTAL FUNCTIONS

CHAPTER 7: TRANSCENDENTAL FUNCTIONS 7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of

More information

19.2 Surface Area of Prisms and Cylinders

19.2 Surface Area of Prisms and Cylinders Name Class Date 19 Surface Area of Prisms and Cylinders Essential Question: How can you find te surface area of a prism or cylinder? Resource Locker Explore Developing a Surface Area Formula Surface area

More information

MAPI Computer Vision

MAPI Computer Vision MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -

More information

Haar Transform CS 430 Denbigh Starkey

Haar Transform CS 430 Denbigh Starkey Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar

More information

3.6 Directional Derivatives and the Gradient Vector

3.6 Directional Derivatives and the Gradient Vector 288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te

More information

8/6/2010 Assignment Previewer

8/6/2010 Assignment Previewer Week 4 Friday Homework (1321979) Question 1234567891011121314151617181920 1. Question DetailsSCalcET6 2.7.003. [1287988] Consider te parabola y 7x - x 2. (a) Find te slope of te tangent line to te parabola

More information

Numerical Derivatives

Numerical Derivatives Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten

More information

12.2 TECHNIQUES FOR EVALUATING LIMITS

12.2 TECHNIQUES FOR EVALUATING LIMITS Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of

More information

Multi-Stack Boundary Labeling Problems

Multi-Stack Boundary Labeling Problems Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,

More information

Chapter K. Geometric Optics. Blinn College - Physics Terry Honan

Chapter K. Geometric Optics. Blinn College - Physics Terry Honan Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental

More information

Interference and Diffraction of Light

Interference and Diffraction of Light Interference and Diffraction of Ligt References: [1] A.P. Frenc: Vibrations and Waves, Norton Publ. 1971, Capter 8, p. 280-297 [2] PASCO Interference and Diffraction EX-9918 guide (written by Ann Hanks)

More information

Zernike vs. Zonal Matrix Iterative Wavefront Reconstructor. Sophia I. Panagopoulou, PhD. University of Crete Medical School Dept.

Zernike vs. Zonal Matrix Iterative Wavefront Reconstructor. Sophia I. Panagopoulou, PhD. University of Crete Medical School Dept. Zernie vs. Zonal Matrix terative Wavefront Reconstructor opia. Panagopoulou PD University of Crete Medical cool Dept. of Optalmology Daniel R. Neal PD Wavefront ciences nc. 480 Central.E. Albuquerque NM

More information

Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number

Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various

More information

RECONSTRUCTING OF A GIVEN PIXEL S THREE- DIMENSIONAL COORDINATES GIVEN BY A PERSPECTIVE DIGITAL AERIAL PHOTOS BY APPLYING DIGITAL TERRAIN MODEL

RECONSTRUCTING OF A GIVEN PIXEL S THREE- DIMENSIONAL COORDINATES GIVEN BY A PERSPECTIVE DIGITAL AERIAL PHOTOS BY APPLYING DIGITAL TERRAIN MODEL IV. Évfolyam 3. szám - 2009. szeptember Horvát Zoltán orvat.zoltan@zmne.u REONSTRUTING OF GIVEN PIXEL S THREE- DIMENSIONL OORDINTES GIVEN Y PERSPETIVE DIGITL ERIL PHOTOS Y PPLYING DIGITL TERRIN MODEL bsztrakt/bstract

More information

Four equations are necessary to evaluate these coefficients. Eqn

Four equations are necessary to evaluate these coefficients. Eqn 1.2 Splines 11 A spline function is a piecewise defined function with certain smoothness conditions [Cheney]. A wide variety of functions is potentially possible; polynomial functions are almost exclusively

More information

Investigating an automated method for the sensitivity analysis of functions

Investigating an automated method for the sensitivity analysis of functions Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands

More information

Our Calibrated Model has No Predictive Value: An Example from the Petroleum Industry

Our Calibrated Model has No Predictive Value: An Example from the Petroleum Industry Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial

More information

Classification of Osteoporosis using Fractal Texture Features

Classification of Osteoporosis using Fractal Texture Features Classification of Osteoporosis using Fractal Texture Features V.Srikant, C.Dines Kumar and A.Tobin Department of Electronics and Communication Engineering Panimalar Engineering College Cennai, Tamil Nadu,

More information

PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION

PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION Martin Kraus Computer Grapics and Visualization Group, Tecnisce Universität Müncen, Germany krausma@in.tum.de Magnus Strengert Visualization and Interactive

More information

Non-Interferometric Testing

Non-Interferometric Testing NonInterferometric Testing.nb Optics 513 - James C. Wyant 1 Non-Interferometric Testing Introduction In tese notes four non-interferometric tests are described: (1) te Sack-Hartmann test, (2) te Foucault

More information

Obstacle Avoiding Real-Time Trajectory Generation and Control of Omnidirectional Vehicles

Obstacle Avoiding Real-Time Trajectory Generation and Control of Omnidirectional Vehicles 2009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 10-12, 2009 FrC10.6 Obstacle Avoiding Real-Time Trajectory Generation and Control of Omnidirectional Veicles Ji-wung Coi,

More information

An Algorithm for Loopless Deflection in Photonic Packet-Switched Networks

An Algorithm for Loopless Deflection in Photonic Packet-Switched Networks An Algoritm for Loopless Deflection in Potonic Packet-Switced Networks Jason P. Jue Center for Advanced Telecommunications Systems and Services Te University of Texas at Dallas Ricardson, TX 75083-0688

More information

z = x 2 xy + y 2 clf // c6.1(2)contour Change to make a contour plot of z=xy.

z = x 2 xy + y 2 clf // c6.1(2)contour Change to make a contour plot of z=xy. 190 Lecture 6 3D equations formatting Open Lecture 6. See Capter 3, 10 of text for details. Draw a contour grap and a 3D grap of z = 1 x 2 y 2 = an upper emispere. For Classwork 1 and 2, you will grap

More information

Tolerancing of single point diamond turned diffractive. Carl Zeiss AG, Oberkochen, Germany. with. ρ = 1/R

Tolerancing of single point diamond turned diffractive. Carl Zeiss AG, Oberkochen, Germany. with. ρ = 1/R J O U R N A L O F Journal of te European Optical Society - Rapid Publications, 0708 (007) www.jeos.org T H E E U R O P E A N Tolerancing of single point diamond turned diffractive O Poptical T elements

More information

THANK YOU FOR YOUR PURCHASE!

THANK YOU FOR YOUR PURCHASE! THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions

More information

Moving Beyond Linearity

Moving Beyond Linearity Moving Beyond Linearity Basic non-linear models one input feature: polynomial regression step functions splines smoothing splines local regression. more features: generalized additive models. Polynomial

More information

CESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm

CESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer

More information

Tilings of rectangles with T-tetrominoes

Tilings of rectangles with T-tetrominoes Tilings of rectangles wit T-tetrominoes Micael Korn and Igor Pak Department of Matematics Massacusetts Institute of Tecnology Cambridge, MA, 2139 mikekorn@mit.edu, pak@mat.mit.edu August 26, 23 Abstract

More information

Classify solids. Find volumes of prisms and cylinders.

Classify solids. Find volumes of prisms and cylinders. 11.4 Volumes of Prisms and Cylinders Essential Question How can you find te volume of a prism or cylinder tat is not a rigt prism or rigt cylinder? Recall tat te volume V of a rigt prism or a rigt cylinder

More information

Density Estimation Over Data Stream

Density Estimation Over Data Stream Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University

More information

16th European Signal Processing Conference (EUSIPCO 2008), Lausanne, Switzerland, August 25-29, 2008, copyright by EURASIP

16th European Signal Processing Conference (EUSIPCO 2008), Lausanne, Switzerland, August 25-29, 2008, copyright by EURASIP 16t European Signal Processing Conference (EUSIPCO 008), Lausanne, Switzerland, August 5-9, 008, copyrigt by EURASIP ADAPTIVE WINDOW FOR LOCAL POLYNOMIAL REGRESSION FROM NOISY NONUNIFORM SAMPLES A. Sreenivasa

More information

Section 1.2 The Slope of a Tangent

Section 1.2 The Slope of a Tangent Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt

More information

Soft sensor modelling by time difference, recursive partial least squares and adaptive model updating

Soft sensor modelling by time difference, recursive partial least squares and adaptive model updating Soft sensor modelling by time difference, recursive partial least squares adaptive model updating Y Fu 1, 2, W Yang 2, O Xu 1, L Zou 3, J Wang 4 1 Zijiang College, Zejiang University of ecnology, Hangzou

More information

Communicator for Mac Quick Start Guide

Communicator for Mac Quick Start Guide Communicator for Mac Quick Start Guide 503-968-8908 sterling.net training@sterling.net Pone Support 503.968.8908, option 2 pone-support@sterling.net For te most effective support, please provide your main

More information

2.5 Evaluating Limits Algebraically

2.5 Evaluating Limits Algebraically SECTION.5 Evaluating Limits Algebraically 3.5 Evaluating Limits Algebraically Preinary Questions. Wic of te following is indeterminate at x? x C x ; x x C ; x x C 3 ; x C x C 3 At x, x isofteform 0 xc3

More information

Grid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid Flows

Grid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid Flows Journal of Computational Pysics 176, 40 69 (2002) doi:10.1006/jcp.2001.6967, available online at ttp://www.idealibrary.com on Grid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid

More information

Mean Shifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy.

Mean Shifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy. Mean Sifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy. Margret Keuper Cair of Pattern Recognition and Image Processing Computer Science Department

More information

12.2 Techniques for Evaluating Limits

12.2 Techniques for Evaluating Limits 335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing

More information

( )( ) ( ) MTH 95 Practice Test 1 Key = 1+ x = f x. g. ( ) ( ) The only zero of f is 7 2. The only solution to g( x ) = 4 is 2.

( )( ) ( ) MTH 95 Practice Test 1 Key = 1+ x = f x. g. ( ) ( ) The only zero of f is 7 2. The only solution to g( x ) = 4 is 2. Mr. Simonds MTH 95 Class MTH 95 Practice Test 1 Key 1. a. g ( ) ( ) + 4( ) 4 1 c. f ( x) 7 7 7 x 14 e. + 7 + + 4 f g 1+ g. f 4 + 4 7 + 1+ i. g ( 4) ( 4) + 4( 4) k. g( x) x 16 + 16 0 x 4 + 4 4 0 x 4x+ 4

More information

When the dimensions of a solid increase by a factor of k, how does the surface area change? How does the volume change?

When the dimensions of a solid increase by a factor of k, how does the surface area change? How does the volume change? 8.4 Surface Areas and Volumes of Similar Solids Wen te dimensions of a solid increase by a factor of k, ow does te surface area cange? How does te volume cange? 1 ACTIVITY: Comparing Surface Areas and

More information

A Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science

A Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu

More information

12.2 Investigate Surface Area

12.2 Investigate Surface Area Investigating g Geometry ACTIVITY Use before Lesson 12.2 12.2 Investigate Surface Area MATERIALS grap paper scissors tape Q U E S T I O N How can you find te surface area of a polyedron? A net is a pattern

More information

You should be able to visually approximate the slope of a graph. The slope m of the graph of f at the point x, f x is given by

You should be able to visually approximate the slope of a graph. The slope m of the graph of f at the point x, f x is given by Section. Te Tangent Line Problem 89 87. r 5 sin, e, 88. r sin sin Parabola 9 9 Hperbola e 9 9 9 89. 7,,,, 5 7 8 5 ortogonal 9. 5, 5,, 5, 5. Not multiples of eac oter; neiter parallel nor ortogonal 9.,,,

More information

Lesson 6 MA Nick Egbert

Lesson 6 MA Nick Egbert Overview From kindergarten we all know ow to find te slope of a line: rise over run, or cange in over cange in. We want to be able to determine slopes of functions wic are not lines. To do tis we use te

More information

Local features and image matching May 8 th, 2018

Local features and image matching May 8 th, 2018 Local features and image matcing May 8 t, 2018 Yong Jae Lee UC Davis Last time RANSAC for robust fitting Lines, translation Image mosaics Fitting a 2D transformation Homograpy 2 Today Mosaics recap: How

More information

Polymath 6. Overview

Polymath 6. Overview Polymath 6 Overview Main Polymath Menu LEQ: Linear Equations Solver. Enter (in matrix form) and solve a new system of simultaneous linear equations. NLE: Nonlinear Equations Solver. Enter and solve a new

More information

Optimal In-Network Packet Aggregation Policy for Maximum Information Freshness

Optimal In-Network Packet Aggregation Policy for Maximum Information Freshness 1 Optimal In-etwork Packet Aggregation Policy for Maimum Information Fresness Alper Sinan Akyurek, Tajana Simunic Rosing Electrical and Computer Engineering, University of California, San Diego aakyurek@ucsd.edu,

More information

All truths are easy to understand once they are discovered; the point is to discover them. Galileo

All truths are easy to understand once they are discovered; the point is to discover them. Galileo Section 7. olume All truts are easy to understand once tey are discovered; te point is to discover tem. Galileo Te main topic of tis section is volume. You will specifically look at ow to find te volume

More information

Intra- and Inter-Session Network Coding in Wireless Networks

Intra- and Inter-Session Network Coding in Wireless Networks Intra- and Inter-Session Network Coding in Wireless Networks Hulya Seferoglu, Member, IEEE, Atina Markopoulou, Member, IEEE, K K Ramakrisnan, Fellow, IEEE arxiv:857v [csni] 3 Feb Abstract In tis paper,

More information

An Intuitive Framework for Real-Time Freeform Modeling

An Intuitive Framework for Real-Time Freeform Modeling An Intuitive Framework for Real-Time Freeform Modeling Mario Botsc Leif Kobbelt Computer Grapics Group RWTH Aacen University Abstract We present a freeform modeling framework for unstructured triangle

More information

Symmetric Tree Replication Protocol for Efficient Distributed Storage System*

Symmetric Tree Replication Protocol for Efficient Distributed Storage System* ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University

More information

Areas of Parallelograms and Triangles. To find the area of parallelograms and triangles

Areas of Parallelograms and Triangles. To find the area of parallelograms and triangles 10-1 reas of Parallelograms and Triangles ommon ore State Standards G-MG..1 Use geometric sapes, teir measures, and teir properties to descrie ojects. G-GPE..7 Use coordinates to compute perimeters of

More information

A Statistical Approach for Target Counting in Sensor-Based Surveillance Systems

A Statistical Approach for Target Counting in Sensor-Based Surveillance Systems Proceedings IEEE INFOCOM A Statistical Approac for Target Counting in Sensor-Based Surveillance Systems Dengyuan Wu, Decang Cen,aiXing, Xiuzen Ceng Department of Computer Science, Te George Wasington University,

More information

Single and Multi-View Reconstruction of Structured Scenes

Single and Multi-View Reconstruction of Structured Scenes ACCV2002: Te 5t Asian Conference on Computer Vision 23 25 January 2002 Melbourne Australia 1 Single and Multi-View econstruction of Structured Scenes Etienne Grossmann Diego Ortin and José Santos-Victor

More information

Spatial Interpolation & Geostatistics

Spatial Interpolation & Geostatistics (Z i Z j ) 2 / 2 Spatial Interpolation & Geostatistics Lag Lag Mean Distance between pairs of points 1 Tobler s Law All places are related, but nearby places are related more than distant places Corollary:

More information

each node in the tree, the difference in height of its two subtrees is at the most p. AVL tree is a BST that is height-balanced-1-tree.

each node in the tree, the difference in height of its two subtrees is at the most p. AVL tree is a BST that is height-balanced-1-tree. Data Structures CSC212 1 AVL Trees A binary tree is a eigt-balanced-p-tree if for eac node in te tree, te difference in eigt of its two subtrees is at te most p. AVL tree is a BST tat is eigt-balanced-tree.

More information

Some Handwritten Signature Parameters in Biometric Recognition Process

Some Handwritten Signature Parameters in Biometric Recognition Process Some Handwritten Signature Parameters in Biometric Recognition Process Piotr Porwik Institute of Informatics, Silesian Uniersity, Bdziska 39, 41- Sosnowiec, Poland porwik@us.edu.pl Tomasz Para Institute

More information

Multi-dimensional Numerical Simulation of Wind-induced Flow and Transport Processes in an Urban Water System

Multi-dimensional Numerical Simulation of Wind-induced Flow and Transport Processes in an Urban Water System ICHE 214, Hamburg - Lefeldt & Kopmann (eds) - 214 Bundesanstalt für Wasserbau ISBN 978-3-93923-32-8 Multi-dimensional Numerical Simulation of Wind-induced Flow and Transport Processes in an Urban Water

More information

Alternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method

Alternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X

More information

2.3 Additional Relations

2.3 Additional Relations 3 2.3 Additional Relations Figure 2.3 identiies additional relations, indicating te locations o te object and image, and te ratio o teir eigts (magniication) and orientations. Ray enters te lens parallel

More information

The (, D) and (, N) problems in double-step digraphs with unilateral distance

The (, D) and (, N) problems in double-step digraphs with unilateral distance Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica

More information

Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks

Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks Okan Yilmaz and Ing-Ray Cen Computer Science Department Virginia Tec {oyilmaz, ircen}@vt.edu

More information

A library of biorthogonal wavelet transforms originated from polynomial splines

A library of biorthogonal wavelet transforms originated from polynomial splines A library of biortogonal wavelet transforms originated from polynomial splines Amir Z. Averbuc a and Valery A. Zeludev a a Scool of Computer Science, Tel Aviv University Tel Aviv 69978, Israel ABSTRACT

More information

The Euler and trapezoidal stencils to solve d d x y x = f x, y x

The Euler and trapezoidal stencils to solve d d x y x = f x, y x restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study

More information

Unsupervised Learning for Hierarchical Clustering Using Statistical Information

Unsupervised Learning for Hierarchical Clustering Using Statistical Information Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama

More information

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms CE Data Structures and Algoritms Capter 4: Trees (AVL Trees) Text: Read Weiss, 4.4 Izmir University of Economics AVL Trees An AVL (Adelson-Velskii and Landis) tree is a binary searc tree wit a balance

More information

Real-Time Wireless Routing for Industrial Internet of Things

Real-Time Wireless Routing for Industrial Internet of Things Real-Time Wireless Routing for Industrial Internet of Tings Cengjie Wu, Dolvara Gunatilaka, Mo Sa, Cenyang Lu Cyber-Pysical Systems Laboratory, Wasington University in St. Louis Department of Computer

More information

Spatial Interpolation - Geostatistics 4/3/2018

Spatial Interpolation - Geostatistics 4/3/2018 Spatial Interpolation - Geostatistics 4/3/201 (Z i Z j ) 2 / 2 Spatial Interpolation & Geostatistics Lag Distance between pairs of points Lag Mean Tobler s Law All places are related, but nearby places

More information

Fault Localization Using Tarantula

Fault Localization Using Tarantula Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all

More information

Lecture 8. Divided Differences,Least-Squares Approximations. Ceng375 Numerical Computations at December 9, 2010

Lecture 8. Divided Differences,Least-Squares Approximations. Ceng375 Numerical Computations at December 9, 2010 Lecture 8, Ceng375 Numerical Computations at December 9, 2010 Computer Engineering Department Çankaya University 8.1 Contents 1 2 3 8.2 : These provide a more efficient way to construct an interpolating

More information

Excel based finite difference modeling of ground water flow

Excel based finite difference modeling of ground water flow Journal of Himalaan Eart Sciences 39(006) 49-53 Ecel based finite difference modeling of ground water flow M. Gulraiz Akter 1, Zulfiqar Amad 1 and Kalid Amin Kan 1 Department of Eart Sciences, Quaid-i-Azam

More information

Network Coding-Aware Queue Management for Unicast Flows over Coded Wireless Networks

Network Coding-Aware Queue Management for Unicast Flows over Coded Wireless Networks Network Coding-Aware Queue Management for Unicast Flows over Coded Wireless Networks Hulya Seferoglu, Atina Markopoulou EECS Dept, University of California, Irvine {seferog, atina}@uci.edu Abstract We

More information

Introduction to Computer Graphics 5. Clipping

Introduction to Computer Graphics 5. Clipping Introduction to Computer Grapics 5. Clipping I-Cen Lin, Assistant Professor National Ciao Tung Univ., Taiwan Textbook: E.Angel, Interactive Computer Grapics, 5 t Ed., Addison Wesley Ref:Hearn and Baker,

More information

Inference Based on SVARs Identified with Sign and Zero Restrictions: Theory and Applications

Inference Based on SVARs Identified with Sign and Zero Restrictions: Theory and Applications FEDERAL RESERVE BANK of ATLANTA WORKING PAPER SERIES Inference Based on SVARs Identified wit Sign and Zero Restrictions: Teory and Applications Jonas E. Arias, Juan F. Rubio-Ramírez, and Daniel F. Waggoner

More information

Two Modifications of Weight Calculation of the Non-Local Means Denoising Method

Two Modifications of Weight Calculation of the Non-Local Means Denoising Method Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising

More information

The impact of simplified UNBab mapping function on GPS tropospheric delay

The impact of simplified UNBab mapping function on GPS tropospheric delay Te impact of simplified UNBab mapping function on GPS troposperic delay Hamza Sakidin, Tay Coo Cuan, and Asmala Amad Citation: AIP Conference Proceedings 1621, 363 (2014); doi: 10.1063/1.4898493 View online:

More information

Handout 4 - Interpolation Examples

Handout 4 - Interpolation Examples Handout 4 - Interpolation Examples Middle East Technical University Example 1: Obtaining the n th Degree Newton s Interpolating Polynomial Passing through (n+1) Data Points Obtain the 4 th degree Newton

More information

CRASHWORTHINESS ASSESSMENT IN AIRCRAFT DITCHING INCIDENTS

CRASHWORTHINESS ASSESSMENT IN AIRCRAFT DITCHING INCIDENTS 27 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES CRASHWORTHINESS ASSESSMENT IN AIRCRAFT DITCHING INCIDENTS C. Candra*, T. Y. Wong* and J. Bayandor** * Te Sir Lawrence Wackett Aerospace Centre

More information

1.4 RATIONAL EXPRESSIONS

1.4 RATIONAL EXPRESSIONS 6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions

More information

( ) ( ) Mat 241 Homework Set 5 Due Professor David Schultz. x y. 9 4 The domain is the interior of the hyperbola.

( ) ( ) Mat 241 Homework Set 5 Due Professor David Schultz. x y. 9 4 The domain is the interior of the hyperbola. Mat 4 Homework Set 5 Due Professor David Scultz Directions: Sow all algebraic steps neatly and concisely using proper matematical symbolism. Wen graps and tecnology are to be implemented, do so appropriately.

More information

Chapter 18. Geometric Operations

Chapter 18. Geometric Operations Chapter 18 Geometric Operations To this point, the image processing operations have computed the gray value (digital count) of the output image pixel based on the gray values of one or more input pixels;

More information

Nonparametric Approaches to Regression

Nonparametric Approaches to Regression Nonparametric Approaches to Regression In traditional nonparametric regression, we assume very little about the functional form of the mean response function. In particular, we assume the model where m(xi)

More information

Overcomplete Steerable Pyramid Filters and Rotation Invariance

Overcomplete Steerable Pyramid Filters and Rotation Invariance vercomplete Steerable Pyramid Filters and Rotation Invariance H. Greenspan, S. Belongie R. Goodman and P. Perona S. Raksit and C. H. Anderson Department of Electrical Engineering Department of Anatomy

More information

Efficient Content-Based Indexing of Large Image Databases

Efficient Content-Based Indexing of Large Image Databases Efficient Content-Based Indexing of Large Image Databases ESSAM A. EL-KWAE University of Nort Carolina at Carlotte and MANSUR R. KABUKA University of Miami Large image databases ave emerged in various

More information

5.4 Sum and Difference Formulas

5.4 Sum and Difference Formulas 380 Capter 5 Analtic Trigonometr 5. Sum and Difference Formulas Using Sum and Difference Formulas In tis section and te following section, ou will stud te uses of several trigonometric identities and formulas.

More information