Performance Plus Software Parameter Definitions
|
|
- Phillip Ernest Parsons
- 6 years ago
- Views:
Transcription
1 Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03
2 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios Total Profile The Total Profile represets the measuremet of a surface profilig istrumet. The Total Profile cotais both roughess ad waviess iformatio. Waviess Waviess is calculated from the Total Profile ad represets the loger spatial wavelegth features of the surface. Waviess over log distaces is typically called form, figure, or bow. Waviess parameters are calculated after removal of the mea Waviess value. Typically, waviess parameters are give by "W sub " where sub is the appropriate subscript for the parameter. For example, W a is the average waviess. oughess The roughess data is calculated by subtractig the Waviess from the Total Profile data. The oughess shows the fier, or shorter, spatial wavelegth features of the surface. Typically, roughess parameters are give by " sub " where sub is the appropriate subscript for the parameter. For example, a is the average roughess. Figure shows the relatioship of Total Profile, Waviess, ad oughess. Figure
3 Performace Plus+ Software Parameter Defiitios/3 Cutoff Filter Legth The cutoff filter legth is a iteratioal stadard defiitio for the filter legth used to produce the waviess ad roughess data. I moder profilig istrumets, this is a digital filter i the aalysis software. The cutoff filter is used to specify the rage of spatial wavelegths (or the spatial frequecies) i the waviess ad roughess data. Thus, roughess umbers, such as a ad MS, are meaigless without specifyig the cutoff filter used i the roughess calculatio. The cocept of the cutoff filter is similar to a high pass filter i electroics. A high pass filter will pass frequecies higher tha its cutoff ad block lower frequecies. For surface profile data, it is useful to describe a high pass filter as passig high spatial frequecies (or short wavelegths). Thus, the user must defie the cutoff filter ad the iteded spatial frequecies for aalysis i either the roughess or waviess data. It is possible to choose ay cutoff filter legth. However, there are five stadard cutoff filter legths that are defied by various stadard orgaizatios. These five cutoff legths represet a method to divide the spatial frequecy iformatio ito differet regios. The three orgaizatios have differet recommedatios for the umber of cutoff filter legths ad the correspodig overall evaluatio legth. Followig is the recommedatio for three curret stadards:! U.S. stadard: For proper statistics, the evaluatio legth should cotai a umber of cutoff filter legths.! ISO (Iteratioal Stadard): The evaluatio legth should cotai oe or more cutoff filter legths.! Germa (DIN 4768) stadard: The evaluatio legth is five times the cutoff filter legth. The followig table shows the five cutoff filter legths ad the recommeded evaluatio legth usig five segmets. The table also shows the umber of sectios for a full 00 mm sca. Our recommedatio is to use at least five cutoff legths for a good statistical evaluatio. Table Stadard Cutoff Filter Defiitios Cutoff Filter Legth (mm) Sca Legth with 5 Cutoff Legths (mm) Number of Sectios for a 00 mm Sca ,
4 Performace Plus+ Software Parameter Defiitios/4 Uits Vertical Scale The vertical scale is typically displayed i Agstroms (Å). Other uits that ca be used iclude, aometers (m), micrometers (µm) ad microiches (µi). Horizotal scale The horizotal scale is typically displayed i metric uits i micrometers (µm). Other possible uits are mm ad microiches (µi). Uit coversios micrometer.0 x 0-6 M µm Agstrom.0 x0-4 µm Å aometer 0 Agstroms m microich oe millioth of a ich µm 254 Å µi oughess Height Parameters oughess parameters are calculated from the roughess data ad typically defied by a "" variable. Followig are defiitios ad examples of these parameters. Several of these defiitios use the term y i to describe the height y at positio I, to describe the umber of poits i the sca (evaluatio legth), λ to describe the cutoff filter legth, ad k to describe the umber of cutoff filter legths. Geeral Parameters The followig parameters are calculated over the etire data set. The calculatio is ot depedet o the umber of cutoff filter legths.
5 Performace Plus+ Software Parameter Defiitios/5 a ad q (MS) Parameters a, oughess Average The roughess average is the most typically used oe umber descriptio to specify the roughess of a surface. The advatage to this parameter is that it teds to provide a average value, less depedet o small spikes such as foud with local defects. The a umber should oly be provided with it s associated cutoff filter legth. A a value quoted without the cutoff filter legth is meaigless. The roughess average does ot provide ay iformatio o the shape or size of surface features. For example, Figure 2 shows four profiles with obviously differet shapes, but the same a value. The formula for the a parameter is: a or a yi y + y2 + y3! + y q, root mea square (MS) roughess The MS value is aother geeral averaged roughess parameter. The MS value is obtaied from the formula:. q or q yi2 2 2 y + y2 + y3! + y 2 2
6 Performace Plus+ Software Parameter Defiitios/6 Figure 2
7 Performace Plus+ Software Parameter Defiitios/7 Peak ad Valley Parameters The followig peak ad valley parameters are calculated over the etire data set. They all provide the maximum or miimum values. p, maximum profile peak height The distace betwee the highest poit of the profile ad the mea lie withi the evaluatio legth. v, maximum profile valley depth The distace betwee the lowest poit of the profile ad the mea lie withi the evaluatio legth. t, maximum height of the profile (or Peak to Valley) The vertical distace betwee the highest ad lowest poits of the profile withi the evaluatio legth. Figure 3 shows a example of these three parameters. These parameters are most sesitive to ay defects, dirt, scratches, or high peaks or deep valleys. Correspodigly, these values will typically be the least repeatable of ay of the parameters. Figure 3 oughess Parameters Calculated Over Segmets
8 Performace Plus+ Software Parameter Defiitios/8 The followig roughess parameters are calculated over several cutoff filter legths to provide a better average value tha p, v ad t. pm, average maximum profile peak height pm is the average of the successive values of pi calculated over the evaluatio legth pm k k pi where pi is the distace betwee the highest poit of the profile ad the mea lie withi each cutoff filter legth. For example, pi is the highest peak i the first cutoff legth, p2 i the secod, etc. pm is the average of idividual p values calculated over successive cutoff filter legths. It provides a more repeatable value for the maximum profile height, especially for a large umber of segmets. Figure 4 shows a example of the pm value. Figure 4
9 Performace Plus+ Software Parameter Defiitios/9 vm, average maximum valley depth vm is the average of the successive values of vi calculated over the evaluatio legth. vm k k vi where vi is the distace betwee the lowest poit of the profile ad the mea lie withi each cutoff filter legth. vm is also a average, ad provides a more repeatable value for the miimum valley depth. Figure 4 shows a example of the vm value. tm, average maximum height tm is the average of the successive values of ti calculated over the evaluatio legth. This parameter is the same as z (DIN) whe there are five cutoff filter legths withi a evaluatio legth. tm k k ti where ti is the vertical distace betwee the highest ad lowest poits of the profile withi each cutoff filter legth. Figure 5 shows a example of the tm value. Figure 5 max is the largest ti withi the evaluatio legth.
10 Performace Plus+ Software Parameter Defiitios/0 max, like t, will ot be as repeatable because it will be more sesitive to local scratches, pits ad peaks. Figure 5 shows a example of max. 3z, average roughess depth This parameter is the mea of the idividual roughess depths. The roughess depth i each cutoff filter legth is defied as the distace betwee the third highest peak ad third lowest valley. Figure 6 k k 3z 3zi where 3zi is the vertical distace betwee the third highest peak ad the third lowest valley withi each cutoff legth. This parameter is useful to calculate a roughess depth, ot icludig the extreme peaks ad valleys. This may be useful for situatios where a wear process chages or smoothes the peaks, ad fills the valleys. See figure 6 for a example of the 3z parameter. z,te-poit oughess Height z is calculated by averagig the five highest peaks ad five lowest valleys over each cutoff legth. The total z is the calculated by averagig over all cutoff legths. z provides the most repeatable value of a peak to valley parameter, sice may averages are used i the calculatio. The equatio for z over oe cutoff legth is give by: 5 z pi + 0 vi
11 Performace Plus+ Software Parameter Defiitios/ The total z calculatio is provided over the etire evaluatio legth by averagig the cotributios of each segmet. Figure 7 shows a example of a z calculatio for oe cutoff filter legth. Figure 7 Waviess Height Parameters The waviess height parameters are calculated after removal of a mea value. The subscript o the W parameter has the same meaig as the parameters. W t W t is the peak to valley height of the waviess profile. W a W a is the waviess average ad the most typically used umber to describe waviess of the surface. The calculatio is similar to a. W q W q is the waviess MS with a calculatio similar to q. W p W p is the maximum peak height of the waviess. It is defied as the distace betwee the highest poit of the waviess profile ad the mea lie withi the evaluatio legth. The calculatio is similar to p. W v W v is the maximum valley depth. It is defied as the distace betwee the lowest poit of the waviess profile ad the mea lie withi the evaluatio legth. The calculatio is similar to v.
12 Performace Plus+ Software Parameter Defiitios/2 Spacig Parameters Several spacig parameters are provided to calculate a averaged spacig. This is especially useful for calculatig the spacig of irregularities o the surface. For example, two sie waves of the same amplitude but differet spacig would have the same a ad q (MS) values, but differet values for a spacig parameter. Two spacig parameters are defied, S m ad S. The spacig parameters are ot depedet o the profile height values. S m, mea spacig of profile irregularities S m is the mea distace of the spacig betwee successive poits as they cross the mea lie. The fial value of S m is calculated over the evaluatio legth. S m S mi where S mi is the legth of the mea lie sectio cotaiig a profile peak ad adjacet profile valley. S, mea spacig of local peaks of the profile The mea spacig of adjacet local peaks, S, is give by: S Si where S i is the spacig of local peaks ad the umber of local peaks. Figures 8 ad 9 show examples of both the S m ad S spacig parameters. These spacig parameters are most useful for examples such as rollig processes, platig, ad visual appearace. Figure 8
13 Performace Plus+ Software Parameter Defiitios/3 Figure 9 Shape Parameters sk, skewess A measure of the asymmetry of the profile about the mea lie sk N y 3 i Nq 3 If the profile is a perfect radom surface, the peaks ad valleys will be equally spread about a height histogram. I this case, sk (skew) 0. If the peaks have bee pushed dow by either a load o the surface, or a abrasio process of oe surface slidig over the other, the the profile peaks will be affected, but ot the valleys. I this case the skew will be egative. A coatig or platig process will typically fill i the valleys while leavig the peaks itact. This results i a positive skew. ku, kurtosis A measure of the sharpess of the histogram. ku N 4 q N y 4 i For a radom profile, the shape of the height histogram will be Gaussia ad the kurtosis 3. If the distributio has a sharp profile the the kurtosis will be greater tha 3. Correspodigly, if the distributio has a broad shape, the the kurtosis will be less tha 3. Oe example is that a sharp diamod tool will ted to produce a kurtosis of less tha 3.
14 Performace Plus+ Software Parameter Defiitios/4 Hybrid Parameters Peak Coutig Peak coutig ca be a useful parameter i situatios where the umber of peaks above a certai threshold ca be of iterest. Examples iclude texture of computer hard disk media, bearig surfaces, ad roll processes. Two peak cout methods or parameters are provided: the stadard Pc, or peak cout desity that icludes values both above ad below the mea lie, ad the High Spot Cout (HSC) that icludes oly values above the mea. Pc, peak cout desity Pc is the umber of couted peaks per uit legth (i cm or iches) measured at a specific peak cout level. The peak cout level is the vertical distace (user set) betwee boudary lies. A couted peak is the a profile irregularity where the profile itersects cosecutively a lower ad a upper boudary lie. Figure 0 shows a example of the upper referece level ad the lower referece level ad the associated umber of peaks. The value is always give as a desity, i peaks/cm. Figure 0
15 Performace Plus+ Software Parameter Defiitios/5 HSC, High Spot Cout The high spot cout couts oly the umber of profile peaks projectig above a user set lie parallel to the mea lie. Figure shows a example of the HSC. Figure Slope Parameters Δa, average absolute slope The average of the rate of chage of the profile height calculated over the evaluatio legth. a i ω where ω i is the surface slope at the ith locatio. The surface slope is the derivative of the height ad ca be expressed as ωi (y i+ -y i )/d where d is the samplig iterval of the data. Δq, root mea square slope The root mea square average rate of chage of the profile height calculated over the evaluatio legth.
16 Performace Plus+ Software Parameter Defiitios/6 q 2 ω i where ω i is the surface slope at the ith locatio. The surface slope is the derivative of the height ad ca be expressed as ω i (y i+ -y i )/d where d is the samplig iterval of the data. Parameter Curves All of the parameter curves ca be calculated o either the roughess, waviess, or total profile. Power Spectrum The power spectrum is a calculatio of the power of idividual spatial frequecies of the profile. The power spectrum is useful to examie the specific amplitudes of various spatial wavelegths. For example, the four profiles i Figure 2 have the same a but differet shapes. The power spectrum would show the distiguishig characteristics of these four profiles. Autocovariace Fuctio The autocovariace fuctio is useful to test for repeatig patters o the surface. Frequetly, a repeatig patter may be difficult to detect i the roughess plot if the amplitude is less tha the backgroud roughess. The autocovariace fuctio provides a method for accetuatig ay periodic features. Amplitude Distributio Fuctio The amplitude distributio fuctio, or height histogram, is useful to examie the distributio of surface features above ad below the mea lie. This fuctio is useful to examie surfaces with ether positive or egative skew, for example, machied surfaces ad/or plated or coated surfaces. Bearig Area Curve The bearig area curve, or cumulative height histogram, is the itegral of the amplitude distributio fuctio. This fuctio is also used to aalyze the cotributios of surface heights for applicatios such as platig, gridig, burishig, etc.
Roughness parameters
Joural of Materials Processig Techology 123 2002) 133±145 Roughess parameters E.S. Gadelmawla a, M.M. Koura b, T.M.A. Maksoud c,*, I.M. Elewa a, H.H. Solima d a Productio Egieerig ad Mechaical Desig Departmet,
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 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 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 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 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 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 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 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 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 informationDATA MINING II - 1DL460
DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,
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 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 informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
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 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 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 informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationBezier 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 informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationData Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types
Data Aalysis Cocepts ad Techiques Chapter 2 1 Chapter 2: Gettig to Kow Your Data Data Objects ad Attribute Types Basic Statistical Descriptios of Data Data Visualizatio Measurig Data Similarity ad Dissimilarity
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
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 informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
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 informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
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 informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
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 informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
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 informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
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 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 informationPanel for Adobe Premiere Pro CC Partner Solution
Pael for Adobe Premiere Pro CC Itegratio for more efficiecy The makes video editig simple, fast ad coveiet. The itegrated pael gives users immediate access to all medialoopster features iside Adobe Premiere
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
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 informationSize and Shape Parameters
Defied i the At the momet there is miimal stadardizatio for defiig particle size shape whe usig automated image aalsis. Although particle size distributio calculatios are defied i several stadards (1,
More informationFEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING
FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter
More informationChapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4
More informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
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 informationCOMP 558 lecture 6 Sept. 27, 2010
Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout
More informationOptimized Aperiodic Concentric Ring Arrays
24th Aual Review of Progress i Applied Computatioal Electromagetics March 30 - April 4, 2008 - iagara Falls, Caada 2008 ACES Optimized Aperiodic Cocetric Rig Arrays Rady L Haupt The Pesylvaia State Uiversity
More informationCapability Analysis (Variable Data)
Capability Aalysis (Variable Data) Revised: 0/0/07 Summary... Data Iput... 3 Capability Plot... 5 Aalysis Summary... 6 Aalysis Optios... 8 Capability Idices... Prefereces... 6 Tests for Normality... 7
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationAPPLICATION GUIDE MANUAL FOR SURFCOM SERIES SURFACE ROUGHNESS & WAVINESS PARAMETERS
DT00300-R00-E7 APPLICATION GUIDE MANUAL FOR SURFCOM SERIES SURFACE ROUGHNESS & WAVINESS PARAMETERS TOKYO SEIMITSU CO., LTD. TOKYO, JAPAN No part of this documet shall be reproduced i ay form or by ay electroic
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationSAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.
SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie
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 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 informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationName Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #1
Name Date Hr. ALGEBRA - SPRING FINAL MULTIPLE CHOICE REVIEW #. The high temperatures for Phoeix i October of 009 are listed below. Which measure of ceter will provide the most accurate estimatio of the
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
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 informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
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 informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
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 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 informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
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 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 informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
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 informationDETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION
Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme
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 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 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 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 informationAP B mirrors and lenses websheet 23.2
Name: Class: _ Date: _ ID: A AP B mirrors ad leses websheet 232 Multiple Choice Idetify the choice that best completes the statemet or aswers the questio 1 The of light ca chage whe light is refracted
More informationEE 435. Lecture 26. Data Converters. Architectures. Characterization
EE 435 Lecture 26 Data Coverters Architectures Characterizatio . Review from last lecture. Data Coverters Types: A/D (Aalog to Digital) Coverts Aalog Iput to a Digital Output D/A (Digital to Aalog) Coverts
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
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 informationAlgorithm. Counting Sort Analysis of Algorithms
Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationUsing the Keyboard. Using the Wireless Keyboard. > Using the Keyboard
1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries
More informationGraphics (Output) Primitives. Chapters 3 & 4
Graphics (Output) Primitives Chapters 3 & 4 Graphic Output ad Iput Pipelie Sca coversio coverts primitives such as lies, circles, etc. ito pixel values geometric descriptio Þ a fiite scee area Clippig
More informationFire Recognition in Video. Walter Phillips III Mubarak Shah Niels da Vitoria Lobo.
Fire Recogitio i Video Walter Phillips III Mubarak Shah Niels da Vitoria Lobo {wrp65547,shah,iels}@cs.ucf.edu Computer Visio Laboratory Departmet of Computer Sciece Uiversity of Cetral Florida Orlado,
More informationVision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1
Visio & Perceptio Simple model: simple reflectace/illumiatio model Eye illumiatio source i( 1, 2 ) image: x( 1, 2 )=i( 1, 2 )r( 1, 2 ) reflectace term r( 1, 2 ) where 0 < i( 1, 2 ) < 0 < r( 1, 2 ) < 1
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 informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationArea As A Limit & Sigma Notation
Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationConsider the following population data for the state of California. Year Population
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 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationAPPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview
APPLICATION NOTE Automated Gai Flatteig Scope ad Overview A flat optical power spectrum is essetial for optical telecommuicatio sigals. This stems from a eed to balace the chael powers across large distaces.
More informationApparent Depth. B' l'
REFRACTION by PLANE SURFACES Apparet Depth Suppose we have a object B i a medium of idex which is viewed from a medium of idex '. If '
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 informationTerm Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.
CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig
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 informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More information