Consider the following population data for the state of California. Year Population
|
|
- Eleanore Hensley
- 5 years ago
- Views:
Transcription
1 Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB to draw the graphs. For #4 do part (d) carefully. For #13 use MATLAB routie piterp; capture the formula ad graph to iclude with your aswer to the questio. For #14 part (b) use MATLAB routie piterp capture the formula ad graph to iclude with your aswer to part (c) Read Pages Exercises for Sectio 5.3 Divided Differece Form of Iterpolatio #3, #6, #7, #10, #11, #15, Califoria Problem, DD-Table Problem For #3 ad #6 do the calculatios by had; show the work. For #7 costruct the divided differece table by had; do ot compute the values of ay logarithms. For #15 use MATLAB routies divdiff ad divpoly; iclude prit outs from MATALB. Califoria Problem Cosider the followig populatio data for the state of Califoria. Year Populatio i Millios Table 1. We are to build a iterpolatio polyomial model to this data. To simplify the values ivolved ad also possibly to aid i the prevetio of roudoff error we 'rescale' the data as follows. Year Populatio i Millios Table 2.
2 Eter the data i Table 2, ito MATLAB. Call the years x ad the populatios y. Use routie divpoly i MATLAB do the followig. a) The populatio i 1930 was about 5.7 millio. Evaluate the iterpolatio polyomial to the data i Table 2 at x = 30. Compute the absolute ad relative error i the value obtaied from the evaluatio of the iterpolat. b) Use divpoly as i part a, but predict the populatios i 1985, 2000, ad Do these values seem reasoable? Explai. c) Use routie piterp with the data i Table 2 ad sketch the iterpolat over 1900 to 2010 by settig the miimum value of x to 0 ad the maximum to 110. Prit out the graph ad aotate it to explai your aswers to parts a ad b. (Geerate the sketch with y-coordiates 0.) DD-Table Problem Give the followig divided differece table. 0th DD 1st DD 2d DD 3rd DD 4th DD 4 a 7 b m f g 9 c t 10 d p 12 e h k r s (a) Write a expressio for the iterpolat that goes through the set of ordered pairs {(4,a), (7,b), (9, c)}. (b) Write a expressio for the iterpolat that goes through the set of ordered pairs { (7,b), (9, c), (10, d), (12, e)}. (c) The poit (15, w) is to be added to the table. Write ad expressio for the iterpolat through the ordered pairs {(12, e), (15, w)}
3 Sectio 5.5 Piecewise Iterpolatio Read my Notes for Piecewise Iterpolatio Do the followig Exercises. #1. Give a curve, collect a sample of poits, geerate the correspodig polyomial iterpolat, ad the compare the graph of the iterpolat with the origial curve. Sice a limited sample of poits will be permitted it is importat to take the sample from portios of the curve that i some sese cotrol or sigificatly affect its shape. Such a strategy ca aid the model costructed by the iterpolat, but is ot a guaratee that the model produced will match the shape of the etire curve. Eter the followig MATLAB commads: help iprob To see a picture of the curve you are asked to sample ad build a iterpolatio model for, type iprob,figure(gcf) The x-coordiates are i the vector x ad the y-coordiates i the vector y. To retai this image so we ca superimpose models you create, type axis(axis),hold o PRACTICE SAMPLING THE CURVE MATLAB has a commad that lets us sample a curve usig your mouse. For a descriptio type help giput To try this commad we will collect a sample of 3 poits from the curve. Type commad [px py] =giput(3) Positio your mouse over the curve ad click the left mouse butto whe you are at the poit you wat to iclude i the sample. Press ENTER after you have selected the 3 poits. The coordiates will be displayed. To see your poits o the graph use the followig commads.
4 plot(px,py,'*r'), figure(gcf) Experimet with this a few times to get the feel for the mouse ad thik about where you will collect the sample data #2. Next type hold off,close(gcf) followed by iprob,figure(gcf),axis(axis),hold o to get a fresh picture. Use the followig commads to sample the curve at 6 poits ad geerate a polyomial iterpolat of degree 5. [sx sy]=giput(6) %collect the 6 poit sample usig your mouse plot(sx,sy,'*r'),figure(gcf) %plottig the sample A=vader(sx);c5=A\sy; % set up Vadermode matrix & %solve for coefficiets of quitic iterpolat z5=polyval(c5,x); % evaluate quitic model at x-coords for the curve plot(x,z5,':k'),figure(gcf) % plot the cubic model If your model is t very good to start aew type hold off,close(gcf) followed by iprob,figure(gcf),axis(axis),hold o the repeat the code for samplig. Oce you get a good approximatio to the curve, put your ame i the title of the graph ad prit it out. Tur i your graph. #3. Repeat Exercise 2, but this time sample the curve at 20 poit istead of 6. If your model is t very good to start aew type hold off,close(gcf) followed by iprob,figure(gcf),axis(axis),hold o the repeat the code for samplig. Were there ay warigs from MATLAB? If so copy them as part of your solutio. Try to get a good approximatio to the curve, put your
5 ame i the title of the graph ad prit it out. Were you able to get a good approximatio? Discuss you attempts. Tur i your graph #4. A alterative to polyomial iterpolatio through a etire data set is to costruct polyomial iterpolats to subsets of the data. Thus differet polyomials ca be used over subitervals of the data poits ivolved. The simplest such procedure is piecewise liear iterpolatio which amouts to coectig successive data poits with straight lies ( coect-the-dots ). While the iterpolatig fuctio costructed i this way is cotiuous, it is usually ot differetiable because sharp poits occur at the data poits. Such procedures geeralize to piecewise quadratic ad piecewise cubics by appropriately subdividig the data set ito successive subsets of three ad four poits respectively with oe poit overlap to esure cotiuity. To experimet with piecewise polyomial iterpolatio of this type use routie pwiterp. A brief descriptio follows. PWINTERP Piecewise polyomial iterpolatio usig: LINEAR QUADRATIC or CUBIC pieces. INPUT: Vectors x ad y must cotai the x ad y coordiates of the data poits respectively. OUTPUT: The coefficiets the pieces are i arrays lf qf ad cf respectively. Various iterpolats ca be superimposed graphically. => pwiterp(x,y) or [lf,qf,cf]=pwiterp(x,y) <= x Cosider the serpetie curve' f(x) over [-2, 2] x I MATLAB type figure (a) Sketch the curve f(x) usig routie ezplot. Prit out the curve or draw a facsimile. (b) Let x = [-2, -1, -0.5, -0.25, 0, 0.25, 0.5, 1, 2] be the x-coordiates of sample poits. Eter this vector of data i to MATLAB. Compute the correspodig y-coordiates i MATLAB usig commad y = x./(0.25+x.*x); Record the data set. (c) Use piterp to costruct the polyomial iterpolat to this data ad graph it. (Set the viewig widow so that -2 x 2 ad -11 y 11. Superimpose the graph of f(x) eterig the formula as x/( x^2). Briefly discuss the approximatio qualities of the polyomial model. Prit out the superimposed graph or draw a facsimile.
6 (d) Use pwiterp o the data from part (b). Prit out each of the three possible models. Briefly discuss the approximatio qualities of the piecewise polyomial models. Which model seems better tha the others ad why? Read Pages ; Read the documet spliedefs. See the website. Exercises for Sectio 5.6 Cubic Splie Iterpolatio #1, 2, 3, 10, 15, ad H1 Use MATLAB files for splie computatios. Display the coefficiets of the cubic pieces i all the problems. The mfiles are splie, csplie, ad aksplie. It is assumed that you have read the documet spliedefs. See also Sectio 5_6 Example with details. H1. Sectio 5.6 The 1995 Ketucky Derby was wo by a horse amed Thuder Gulch i a time of 2:01 1/5 (2 mi 1 ad 1/5 sec) for the 1.25 mile race course. Times at the quarter mile, halfmile, ad mile poles were 22.4 secs, 45.8 secs, ad 1 mi 35.6 secs. a) Use the previous data together with the iitial data, t = 0, dist = 0, to costruct a atural cubic splie for Thuder Gulch's race. b) Use the splie to predict the time at the three-quarter-mile pole, ad compare this to the actual time of 1 mi 10.2 secs. c) Use the splie to predict the speed at which Thuder Gulch left the startig gate ad the speed at which he crossed the fiish lie. Give aswers i miles per hour. Show all your work. For #1, discuss the questio also discuss the type of relatioship betwee z a T implied by the splie. For #2, discuss the questio also discuss the type of relatioship betwee z a p implied by the splie. For #10 use the MATLAB routies to geerate the requested graphs. Iclude a copy of the graphs as part of your solutio. For #15, iclude a graph of the error for the atural cubic splie
7 Read pages Sectio 5.7 Hermite Iterpolatio ad Cubic Hermite Iterpolatio #8, 10 (i the text) There is a mfile for the data set for #8 & 10; Bradie_data_Sec5_7_Exer8.m Dr. Hill s problems #1, 2, 3 For #8 use MATLAB routie pwhermitecubic.m. For #10 use MATLAB routie csplie.m. IMPORTANT: For Dr. Hill s problems use the geeralizatio of divided differeces to compute ay Hermite iterpolatio polyomial. Show the divided differece tables for each problem. 1. The followig sample of fuctio f is give. a) Approximate f(0.5) usig a polyomial iterpolat. b) Approximate f(0.5) usig a Hermite iterpolat. x f(x) f (x) c) The fuctio sample is from f(x) = 2xe x e 3x. Compute the absolute error i each of the results from parts a ad b. d) Graph the absolute error expressios for parts a ad b over [-1,1]. Commet o the accuracy of part a vs that i part b. 2. A switchig track is to be costructed betwee a pair of parallel trolley tracks as show i the figure. The trasitio betwee the two tracks is to be smooth. Assume that the tracks are horizotal ad the switch poits have coordiates (3,2) ad (0,0) o tracks #1 ad #2 respectively. Costruct a Hermite iterpolatig polyomial that goes through the poits ad matches the slope of the track at each of the two poits. Geerate a graph of your track over [0,3].
8 3. At aother costructio site a switchig track like that i Exercise 2 is to be costructed with a additioal requiremet. Namely, the track must also go through poit (1,1). Modify the result from Exercise 2 to iclude this requiremet. Geerate a graph of your track over [0,3]. Are there ay costructio difficulties i this case? Explai Read Pages Exercises for Sectio 5.8 Regressio #2, 5, 8, 13, ad Dr. Hill s problems Use MATLAB ad the matrix approach for computig least squares lies ad liearized fits. Use MATLAB to geerate appropriate graphs for #2 ad 13 Dr. Hill s problems. 1. The ormal system of equatios for the least squares lie has a uique solutio provided the matrix C L NM i1 x i1 x i 2 i i1 x i O QP is osigular. To verify that this is ideed true x1 1 Mx2 1 whe all the x i are distict we use the matrix formulatio, C = A T A, where A =. L Let k N M k1o Q P k 2 L M NM x 1. The we kow the followig: the homogeeous liear system Ck = 0 has O QP
9 oly the trivial solutio if ad oly if matrix C is osigular. Verify the followig to show that C is osigular. a) Explai why the colums of A are liearly idepedet. b) Explai why Ak ca oly be equal to the zero vector 0 if k = 0. c) Explai why k T A T = (Ak) T. d) Assume Ck = 0. Explai why (Ak) T (Ak) = 0. (Note: the right side is the zero scalar.) e) Explai why (Ak) T (Ak) = 0 is the same as the dot product (Ak)(Ak) = 0. f) Whe ca the dot product of a vector with itself be zero? g) Use parts b, e, ad f to explai why k = 0 ad hece C is osigular. 2. For a give data set S, let lie L be the least squares lie ad E L be the miimum value of the sum of the squares of the deviatios. For the same data set D let quadratic Q be the least squares quadratic ad E Q be the miimum value of the sum of the squares of its deviatios. Why must E Q E L? (Hit: We ca thik that the least squares process for determiig L looks over all polyomials of degree 1 or less to determie the oe that miimizes the sum of the squares of the deviatios. Similarly, the least squares process for determiig Q looks over all polyomials of degree 2 or less.)
Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More informationConvex hull ( 凸殻 ) property
Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationReading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended:
Readig Recommeded: Stollitz, DeRose, ad Salesi. Wavelets for Computer Graphics: Theory ad Applicatios, 996, sectio 6.-6.3, 0., A.5. Subdivisio curves ad surfaces Note: there is a error i Stollitz, et al.,
More information9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4
1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationIntro to Scientific Computing: Solutions
Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationSouth Slave Divisional Education Council. Math 10C
South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve
More informationCMPT 125 Assignment 2 Solutions
CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationThe golden search method: Question 1
1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())
More informationRecursive Procedures. How can you model the relationship between consecutive terms of a sequence?
6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationLecture 24: Bezier Curves and Surfaces. thou shalt be near unto me Genesis 45:10
Lecture 24: Bezier Curves ad Surfaces thou shalt be ear uto me Geesis 45:0. Iterpolatio ad Approximatio Freeform curves ad surfaces are smooth shapes ofte describig ma-made objects. The hood of a car,
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationUsing VTR Emulation on Avid Systems
Usig VTR Emulatio o Avid Systems VTR emulatio allows you to cotrol a sequece loaded i the Record moitor from a edit cotroller for playback i the edit room alog with other sources. I this sceario the edit
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationParametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015
Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics
ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More informationME 261: Numerical Analysis Lecture-9&10: Numerical Interpolation
ME 6: Numerical Aalysis Lecture-9&: Numerical Iterpolatio Md. Taver Hossai Departmet o Mechaical Egieerig BUET http://tatusher.uet.ac.d To estimate itermediate values etwee precise data poits most commoly
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More information2) Give an example of a polynomial function of degree 4 with leading coefficient of -6
Math 165 Read ahead some cocepts from sectios 4.1 Read the book or the power poit presetatios for this sectio to complete pages 1 ad 2 Please, do ot complete the other pages of the hadout If you wat to
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationThe Graphs of Polynomial Functions
Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationBAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8
BAAN IVc/BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationIt just came to me that I 8.2 GRAPHS AND CONVERGENCE
44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot
More informationReading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.
Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for
More informationCS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June
CS 1313 010: Programmig for No-Majors, Summer 2007 Programmig Project #3: Two Little Calculatios Due by 12:00pm (oo) Wedesday Jue 27 2007 This third assigmet will give you experiece writig programs that
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationFURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)
Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES
More informationMathematical Stat I: solutions of homework 1
Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationPackage popkorn. R topics documented: February 20, Type Package
Type Pacage Pacage popkor February 20, 2015 Title For iterval estimatio of mea of selected populatios Versio 0.3-0 Date 2014-07-04 Author Vi Gopal, Claudio Fuetes Maitaier Vi Gopal Depeds
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More information1.8 What Comes Next? What Comes Later?
35 1.8 What Comes Next? What Comes Later? A Practice Uderstadig Task For each of the followig tables, CC BY Hiroaki Maeda https://flic.kr/p/6r8odk describe how to fid the ext term i the sequece, write
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationThe VSS CCD photometry spreadsheet
The VSS CCD photometry spreadsheet Itroductio This Excel spreadsheet has bee developed ad tested by the BAA VSS for aalysig results files produced by the multi-image CCD photometry procedure i AIP4Wi v2.
More informationThe Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation
The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationLinearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)
1st Iteratioal Coferece o Sesig Techology November 21-23, 2005 Palmersto North, New Zealad Liearisig Calibratio Methods for a Geeric Embedded Sesor Iterface (GESI) Abstract Amra Pašić Work doe i: PEI Techologies,
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationNormal Distributions
Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationK-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns
K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge
More informationA Resource for Free-standing Mathematics Qualifications
Ope.ls The first sheet is show elow. It is set up to show graphs with equatios of the form = m + c At preset the values of m ad c are oth zero. You ca chage these values usig the scroll ars. Leave the
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationOrientation. Orientation 10/28/15
Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy
More informationIntermediate Statistics
Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More information