3.2 What Do We Gain from the mr Chart?

Size: px
Start display at page:

Download "3.2 What Do We Gain from the mr Chart?"

Transcription

1 Guide to Data Analysis While it is true that the X Chart tells the story, and that we will undoubtedly find the X Chart to be the most interesting part of the XmR Chart, there are times when the mr Chart can clarify and extend what we see on the X Chart. 3.2 What Do We Gain from the mr Chart? It has been suggested that the Moving Range Chart adds so little to the Chart for Individual Values that you should not bother to show it Simply show the X Chart and forget the mr Chart. The basis for this recommendation seems to be the documented fact that the combined XmR Chart does not have any appreciably greater ability to detect signals than does the X Chart alone. However, this mathematical analysis overlooks the interpretative benefits to be gained by including the mr Chart. Consider the XmR Chart for the Data from Bead Board No. 7 in Figure 3.3. The six moving ranges that exceed their upper limit identify six points where the funnel of the bead board was moved (see the dashed lines on the running record for the X values). Two of these six shifts do not correspond to points outside the limits on the X Chart. Thus, this Moving Range Chart provides additional information and reinforces the message of the X Chart X mr Figure 3.3: The XmR Chart for the Data from Bead Board No. 7 44

2 3 / Process Behavior Charts 11 1 X mr Figure 3.4: The XmR Chart for the Batch Weight Data When computing the limits for the Batch Weight Data in Figure 3.4, I only used the first 59 moving ranges to compute the Average Moving Range. Inspection of the mr Chart in Figure 3.4 will show why I did this there is an increase in the process variation after the first sixty values. Since the objective is to compute limits that characterize what the process is capable of doing, the first 59 moving ranges do this better than the rest. The XmR Chart in Figure 3.5 has limits based on the Median Moving Range. The six spikes on the mr Chart allow us to break the original data into seven segments and use a separate central line for each segment, resulting in an X Chart that shows the changes in level and also reveals the presence of other types of nonhomogeneity. Thus, while the mr Chart may not add much to the likelihood of detecting a change, it can be very helpful in interpreting changes that occur. The second reason that I cannot agree to the suppression of the mr Chart is that there are many people, and many software packages, that actually compute three standard deviation limits rather than three-sigma limits. If you are shown a naked X Chart you will have no way of knowing if the limits have been computed correctly. However, if you are shown an XmR Chart, you will immediately have a higher level of confidence that the limits have been computed correctly. Moreover, by using the central line of the mr Chart, you can quickly check to see if the limits are indeed cor-

3 Guide to Data Analysis Yield Values Moving Ranges Figure 3.5: The XmR Chart for the Creel Yield Data rectly computed. Thus, the mr Chart is the secret handshake of those who know the correct way of computing limits for an X Chart. Omit it and your readers cannot be sure that you are a member of the club. Finally, the mr Chart allows you and your audience to check for a problem that will be explained in Section 3.7, the problem of chunky data. Thus, while there may be little mathematical justification for showing the mr Chart, there are three practical reasons to do so, any one of which is sufficient to justify the inclusion of the mr Chart with your X Chart. 3.3 What Makes the XmR Chart Work? There are two basic ideas or principles that need to be respected when creating an XmR Chart. The first is that successive values need to be logically comparable. The second is that the moving ranges need to isolate and capture the local, shortterm, routine variation that is inherent in the data. While the use of the time-order sequence of the data will usually be sufficient to satisfy these two requirements of the XmR Chart, there are times when a careful con- 46

4 3 / Process Behavior Charts sideration of the structure in the data will require a different organization. As a case in point consider the Camshaft Bearing Diameters shown in Table 2.4. The strict time-order for these data is: Camshaft No. 1; Bearing 1, Bearing 2, Bearing 3, Camshaft No. 2; Bearing 1, Bearing 2, Bearing 3, etc. When the data are arranged in this order the Average Moving Range is 3.1. With an Average of we obtain Natural Process Limits of 41.6 to These limits are shown in Figure Piece Figure 3.6: An X Chart for the Camshaft Bearing Diameter Data in Time-Order With this arrangement the moving ranges represent the differences between the three bearings. Since the three bearings were produced by three separate parallel processes there could be systematic differences between the three bearings that have nothing to do with routine variation. Even though the three bearings are supposed to be the same, the fact that they are produced by parallel operations makes it a bit naive to assume that they are indeed the same. The idea of checking your data for homogeneity is based on a skeptical view of homogeneity, not a gullible one. Therefore, rather than using the strict time order shown in Figure 3.6, a more rational approach is to organize these data according to bearing number, and then to use the time order within each bearing to create moving ranges. When this is done the moving ranges will represent the natural, short-term, routine variation within each production process rather than the differences, if any, between the three processes. Now the Average Moving Range is 1.91, giving the limits of 44.7 to 54.9 shown in Figure 3.7. This running record and these limits allow us to see the differences between the bearings with greater clarity. 47

5 Guide to Data Analysis Bearing One Bearing Two Bearing Three Figure 3.7: The Second X Chart for the Camshaft Bearing Diameter Data Thus, when there is a structure within your data, it is imperative that you consider that structure when organizing the data for an XmR Chart. If there are logical partitions or subsets in your data, isolate those subsets from each other so that successive values will be logically comparable and the moving ranges can characterize the routine variation rather than the differences between the subsets. 55 Bearing One Bearing Two Bearing Three Figure 3.8: The Third X Chart for the Camshaft Bearing Diameter Data In fact, for the Camshaft Bearing Diameters we could take the next step and compute a separate set of limits for each bearing. This X Chart is in Figure 3.8. Not only are the three bearings different, but each bearing shows evidence of nonhomogeneity in the production processes. With the Hot Metal Delivery Times the changes occur so often that it is virtually impossible to obtain an Average Moving Range that will characterize the routine variation. In cases like this it is customary to shift to using the Median Moving Range. Since median values are less severely inflated by extreme values than averages, the use of the Median Moving Range allows us to extract an estimate of routine 48

6 3 / Process Behavior Charts Figure 3.9: The XmR Chart for the Hot Metal Delivery Times variation even in the face of an abundance of signals of change. Here the Median is and the Median Moving Range is 2, giving the limits shown in Figure 3.9. No Lower Natural Process Limit is shown in Figure 3.9 because the computed value was less than zero while the delivery times cannot be less than zero. Whenever a boundary or barrier value falls within the computed Natural Process Limits, that boundary value will take precedence over the computed limit, and you end up with a one-sided chart. While the Median Moving Range provided tighter limits and a more sensitive chart in Figure 3.9, you could argue that the Median Moving Range and the limits have still been inflated by the sheer multiplicity of large ranges. While this may be true, it is useful to recall that we are not trying to estimate the parameters of a probability model, but we are instead examining the data for evidence of nonhomogeneity. Having found this evidence, we know that these data did not come from one universe, but from several, so the whole question of estimation is moot. The limits are good enough to do their job. We need to discover why the process is operating with multiple personalities, and do something about this problem. Estimation will not help here; action is required. Once you have organized the data in a rational manner, there are many ways to use the limits to tell the story that is contained within the data. The objective is understanding and insight rather than computing a particular value. There is an ele- 49

Scaling Factors for Process Behavior Charts

Scaling Factors for Process Behavior Charts Quality Digest Daily, Mar. 1, 2010 Manuscript No. 207 Scaling Factors for Process Behavior Charts A Quick Reference Guide In the 1940s the War Production Board trained approximately 50,000 individuals

More information

Beware the Tukey Control Chart

Beware the Tukey Control Chart Quality Digest Daily, August, 213 Manuscript 28 Another bad idea surfaces Donald J. Wheeler I recently read about a technique for analyzing data called the Tukey control chart. Since Professor John Tukey

More information

Assignment 4/5 Statistics Due: Nov. 29

Assignment 4/5 Statistics Due: Nov. 29 Assignment 4/5 Statistics 5.301 Due: Nov. 29 1. Two decision rules are given here. Assume they apply to a normally distributed quality characteristic, the control chart has three-sigma control limits,

More information

Cpk: What is its Capability? By: Rick Haynes, Master Black Belt Smarter Solutions, Inc.

Cpk: What is its Capability? By: Rick Haynes, Master Black Belt Smarter Solutions, Inc. C: What is its Capability? By: Rick Haynes, Master Black Belt Smarter Solutions, Inc. C is one of many capability metrics that are available. When capability metrics are used, organizations typically provide

More information

i M E C H A N I A i CHAPTER 1

i M E C H A N I A i CHAPTER 1 i M E C H A N I A i CHAPTER 1 1 EXPLODING DOTS CHAPTER 1 MACHINES Welcome to a journey. It is a mathematical journey based on a story from me, James, that isn t true. When I was a child I invented a machine

More information

Statistics Case Study 2000 M. J. Clancy and M. C. Linn

Statistics Case Study 2000 M. J. Clancy and M. C. Linn Statistics Case Study 2000 M. J. Clancy and M. C. Linn Problem Write and test functions to compute the following statistics for a nonempty list of numeric values: The mean, or average value, is computed

More information

NCSS Statistical Software

NCSS Statistical Software Chapter 245 Introduction This procedure generates R control charts for variables. The format of the control charts is fully customizable. The data for the subgroups can be in a single column or in multiple

More information

6.001 Notes: Section 8.1

6.001 Notes: Section 8.1 6.001 Notes: Section 8.1 Slide 8.1.1 In this lecture we are going to introduce a new data type, specifically to deal with symbols. This may sound a bit odd, but if you step back, you may realize that everything

More information

1.1 The Real Number System

1.1 The Real Number System 1.1 The Real Number System Contents: Number Lines Absolute Value Definition of a Number Real Numbers Natural Numbers Whole Numbers Integers Rational Numbers Decimals as Fractions Repeating Decimals Rewriting

More information

Re: Exposure Draft Proposed ISAE 3402 on Assurance Reports on Controls at a Third Party Service Organization

Re: Exposure Draft Proposed ISAE 3402 on Assurance Reports on Controls at a Third Party Service Organization Date Le Président Fédération Avenue d Auderghem 22-28 des Experts 1040 Bruxelles 31 May 2008 Comptables Tél. 32 (0) 2 285 40 85 Européens Fax: 32 (0) 2 231 11 12 AISBL E-mail: secretariat@fee.be Mr. Jim

More information

3.5 Indeterminate Forms. Consider the function given by the rule f(x) = Whenever direct substitution into lim x c f(x) yields a 0 0

3.5 Indeterminate Forms. Consider the function given by the rule f(x) = Whenever direct substitution into lim x c f(x) yields a 0 0 3.5 Indeterminate Forms Introduction; Consider the function given by the rule f() = ; its graph is shown below. 0 0 situations Clearly, = 3. Note, however, that if one merely tried to plug in 0 for when

More information

Six Sigma Green Belt Part 5

Six Sigma Green Belt Part 5 Six Sigma Green Belt Part 5 Process Capability 2013 IIE and Aft Systems, Inc. 5-1 Process Capability Is the measured, inherent reproducibility of the product turned out by the process. It can be quantified

More information

Chapter 4: Writing and Designing a Complete Program. Programming Logic and Design, Third Edition Introductory

Chapter 4: Writing and Designing a Complete Program. Programming Logic and Design, Third Edition Introductory Chapter 4: Writing and Designing a Complete Program Programming Logic and Design, Third Edition Introductory Objectives After studying Chapter 4, you should be able to: Plan the mainline logic for a complete

More information

SELECTION OF A MULTIVARIATE CALIBRATION METHOD

SELECTION OF A MULTIVARIATE CALIBRATION METHOD SELECTION OF A MULTIVARIATE CALIBRATION METHOD 0. Aim of this document Different types of multivariate calibration methods are available. The aim of this document is to help the user select the proper

More information

Black-box Testing Techniques

Black-box Testing Techniques T-76.5613 Software Testing and Quality Assurance Lecture 4, 20.9.2006 Black-box Testing Techniques SoberIT Black-box test case design techniques Basic techniques Equivalence partitioning Boundary value

More information

Lecture 25 Spanning Trees

Lecture 25 Spanning Trees Lecture 25 Spanning Trees 15-122: Principles of Imperative Computation (Fall 2018) Frank Pfenning, Iliano Cervesato The following is a simple example of a connected, undirected graph with 5 vertices (A,

More information

Ananta: Cloud Scale Load Balancing. Nitish Paradkar, Zaina Hamid. EECS 589 Paper Review

Ananta: Cloud Scale Load Balancing. Nitish Paradkar, Zaina Hamid. EECS 589 Paper Review Ananta: Cloud Scale Load Balancing Nitish Paradkar, Zaina Hamid EECS 589 Paper Review 1 Full Reference Patel, P. et al., " Ananta: Cloud Scale Load Balancing," Proc. of ACM SIGCOMM '13, 43(4):207-218,

More information

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 8 Consistency and Redundancy in Project networks In today s lecture

More information

A. Incorrect! This would be the negative of the range. B. Correct! The range is the maximum data value minus the minimum data value.

A. Incorrect! This would be the negative of the range. B. Correct! The range is the maximum data value minus the minimum data value. AP Statistics - Problem Drill 05: Measures of Variation No. 1 of 10 1. The range is calculated as. (A) The minimum data value minus the maximum data value. (B) The maximum data value minus the minimum

More information

The Basics of Variation

The Basics of Variation Variation A question that is often asked is, How much variance is acceptable? Taking the work arrival time example, your boss probably doesn t care how long it takes you to get to work, as long as you

More information

A-SSE.1.1, A-SSE.1.2-

A-SSE.1.1, A-SSE.1.2- Putnam County Schools Curriculum Map Algebra 1 2016-2017 Module: 4 Quadratic and Exponential Functions Instructional Window: January 9-February 17 Assessment Window: February 20 March 3 MAFS Standards

More information

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 An Introduction to Graphs A few centuries ago, residents of the city of Königsberg, Prussia were interested in a certain problem.

More information

Lecture Notes on Contracts

Lecture Notes on Contracts Lecture Notes on Contracts 15-122: Principles of Imperative Computation Frank Pfenning Lecture 2 August 30, 2012 1 Introduction For an overview the course goals and the mechanics and schedule of the course,

More information

SOME TYPES AND USES OF DATA MODELS

SOME TYPES AND USES OF DATA MODELS 3 SOME TYPES AND USES OF DATA MODELS CHAPTER OUTLINE 3.1 Different Types of Data Models 23 3.1.1 Physical Data Model 24 3.1.2 Logical Data Model 24 3.1.3 Conceptual Data Model 25 3.1.4 Canonical Data Model

More information

A4.8 Fitting relative potencies and the Schild equation

A4.8 Fitting relative potencies and the Schild equation A4.8 Fitting relative potencies and the Schild equation A4.8.1. Constraining fits to sets of curves It is often necessary to deal with more than one curve at a time. Typical examples are (1) sets of parallel

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite

More information

Chapter 3. Set Theory. 3.1 What is a Set?

Chapter 3. Set Theory. 3.1 What is a Set? Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any

More information

ANSYS. DesignXplorer - Design for Six Sigma. Crane Hook

ANSYS. DesignXplorer - Design for Six Sigma. Crane Hook ANSYS DesignXplorer - Crane Hook Purpose Using the crane hook model at right we will demonstrate how the design for six sigma results can be used in DesignXplorer 8.1 Goal Our first goal is to verify that

More information

Testing & Debugging TB-1

Testing & Debugging TB-1 Testing & Debugging TB-1 Need for Testing Software systems are inherently complex» Large systems 1 to 3 errors per 100 lines of code (LOC) Extensive verification and validiation is required to build quality

More information

15 212: Principles of Programming. Some Notes on Induction

15 212: Principles of Programming. Some Notes on Induction 5 22: Principles of Programming Some Notes on Induction Michael Erdmann Spring 20 These notes provide a brief introduction to induction for proving properties of ML programs. We assume that the reader

More information

10.2 Basic Concepts of Limits

10.2 Basic Concepts of Limits 10.2 Basic Concepts of Limits Question 1: How do you evaluate a limit from a table? Question 2: How do you evaluate a limit from a graph? In this chapter, we ll examine the concept of a limit. in its simplest

More information

3 Graphical Displays of Data

3 Graphical Displays of Data 3 Graphical Displays of Data Reading: SW Chapter 2, Sections 1-6 Summarizing and Displaying Qualitative Data The data below are from a study of thyroid cancer, using NMTR data. The investigators looked

More information

11.4 Bipartite Multigraphs

11.4 Bipartite Multigraphs 11.4 Bipartite Multigraphs Introduction Definition A graph G is bipartite if we can partition the vertices into two disjoint subsets U and V such that every edge of G has one incident vertex in U and the

More information

MARKET RESEARCH AND EVALUATION2017. Reporting Guidelines

MARKET RESEARCH AND EVALUATION2017. Reporting Guidelines MARKET RESEARCH AND EVALUATION2017 Reporting Guidelines July 25, 2017 At NEEA, we are dedicated to providing strategic and relevant insight to our primary audiences through market research and evaluation

More information

Lecture 1 Contracts : Principles of Imperative Computation (Fall 2018) Frank Pfenning

Lecture 1 Contracts : Principles of Imperative Computation (Fall 2018) Frank Pfenning Lecture 1 Contracts 15-122: Principles of Imperative Computation (Fall 2018) Frank Pfenning In these notes we review contracts, which we use to collectively denote function contracts, loop invariants,

More information

3 Graphical Displays of Data

3 Graphical Displays of Data 3 Graphical Displays of Data Reading: SW Chapter 2, Sections 1-6 Summarizing and Displaying Qualitative Data The data below are from a study of thyroid cancer, using NMTR data. The investigators looked

More information

Section 5.2: BUY OR SELL A CAR OBJECTIVES

Section 5.2: BUY OR SELL A CAR OBJECTIVES Section 5.2: BUY OR SELL A CAR OBJECTIVES Compute mean, median, mode, range, quartiles, and interquartile range. Key Terms statistics data measures of central tendency mean arithmetic average outlier median

More information

Understanding and Comparing Distributions. Chapter 4

Understanding and Comparing Distributions. Chapter 4 Understanding and Comparing Distributions Chapter 4 Objectives: Boxplot Calculate Outliers Comparing Distributions Timeplot The Big Picture We can answer much more interesting questions about variables

More information

Lecture 10: Introduction to Correctness

Lecture 10: Introduction to Correctness Lecture 10: Introduction to Correctness Aims: To look at the different types of errors that programs can contain; To look at how we might detect each of these errors; To look at the difficulty of detecting

More information

Order from Chaos. University of Nebraska-Lincoln Discrete Mathematics Seminar

Order from Chaos. University of Nebraska-Lincoln Discrete Mathematics Seminar Order from Chaos University of Nebraska-Lincoln Discrete Mathematics Seminar Austin Mohr Department of Mathematics Nebraska Wesleyan University February 8, 20 The (, )-Puzzle Start by drawing six dots

More information

Inital Starting Point Analysis for K-Means Clustering: A Case Study

Inital Starting Point Analysis for K-Means Clustering: A Case Study lemson University TigerPrints Publications School of omputing 3-26 Inital Starting Point Analysis for K-Means lustering: A ase Study Amy Apon lemson University, aapon@clemson.edu Frank Robinson Vanderbilt

More information

Learning internal representations

Learning internal representations CHAPTER 4 Learning internal representations Introduction In the previous chapter, you trained a single-layered perceptron on the problems AND and OR using the delta rule. This architecture was incapable

More information

TE Teacher s Edition PE Pupil Edition Page 1

TE Teacher s Edition PE Pupil Edition Page 1 Standard 4 WRITING: Writing Process Students discuss, list, and graphically organize writing ideas. They write clear, coherent, and focused essays. Students progress through the stages of the writing process

More information

Overview. State-of-the-Art. Relative cost of error correction. CS 619 Introduction to OO Design and Development. Testing.

Overview. State-of-the-Art. Relative cost of error correction. CS 619 Introduction to OO Design and Development. Testing. Overview CS 619 Introduction to OO Design and Development ing! Preliminaries! All sorts of test techniques! Comparison of test techniques! Software reliability Fall 2012! Main issues: There are a great

More information

= = P. IE 434 Homework 2 Process Capability. Kate Gilland 10/2/13. Figure 1: Capability Analysis

= = P. IE 434 Homework 2 Process Capability. Kate Gilland 10/2/13. Figure 1: Capability Analysis Kate Gilland 10/2/13 IE 434 Homework 2 Process Capability 1. Figure 1: Capability Analysis σ = R = 4.642857 = 1.996069 P d 2 2.326 p = 1.80 C p = 2.17 These results are according to Method 2 in Minitab.

More information

30. Constrained Optimization

30. Constrained Optimization 30. Constrained Optimization The graph of z = f(x, y) is represented by a surface in R 3. Normally, x and y are chosen independently of one another so that one may roam over the entire surface of f (within

More information

Anadarko Public Schools MATH Power Standards

Anadarko Public Schools MATH Power Standards Anadarko Public Schools MATH Power Standards Kindergarten 1. Say the number name sequence forward and backward beginning from a given number within the known sequence (counting on, spiral) 2. Write numbers

More information

Lesson 21: Solution Sets to Inequalities with Two Variables

Lesson 21: Solution Sets to Inequalities with Two Variables Student Outcomes Students recognize and identify solutions to two variable inequalities. They represent the solution set graphically. They create two variable inequalities to represent a situation. Students

More information

HEURISTIC OPTIMIZATION USING COMPUTER SIMULATION: A STUDY OF STAFFING LEVELS IN A PHARMACEUTICAL MANUFACTURING LABORATORY

HEURISTIC OPTIMIZATION USING COMPUTER SIMULATION: A STUDY OF STAFFING LEVELS IN A PHARMACEUTICAL MANUFACTURING LABORATORY Proceedings of the 1998 Winter Simulation Conference D.J. Medeiros, E.F. Watson, J.S. Carson and M.S. Manivannan, eds. HEURISTIC OPTIMIZATION USING COMPUTER SIMULATION: A STUDY OF STAFFING LEVELS IN A

More information

Lecture 15 Software Testing

Lecture 15 Software Testing Lecture 15 Software Testing Includes slides from the companion website for Sommerville, Software Engineering, 10/e. Pearson Higher Education, 2016. All rights reserved. Used with permission. Topics covered

More information

Generating Functions

Generating Functions 6.04/8.06J Mathematics for Computer Science Srini Devadas and Eric Lehman April 7, 005 Lecture Notes Generating Functions Generating functions are one of the most surprising, useful, and clever inventions

More information

A Model of Machine Learning Based on User Preference of Attributes

A Model of Machine Learning Based on User Preference of Attributes 1 A Model of Machine Learning Based on User Preference of Attributes Yiyu Yao 1, Yan Zhao 1, Jue Wang 2 and Suqing Han 2 1 Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada

More information

Chapter 4: Analyzing Bivariate Data with Fathom

Chapter 4: Analyzing Bivariate Data with Fathom Chapter 4: Analyzing Bivariate Data with Fathom Summary: Building from ideas introduced in Chapter 3, teachers continue to analyze automobile data using Fathom to look for relationships between two quantitative

More information

Advanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret

Advanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret Advanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret Greedy Algorithms (continued) The best known application where the greedy algorithm is optimal is surely

More information

6.001 Notes: Section 31.1

6.001 Notes: Section 31.1 6.001 Notes: Section 31.1 Slide 31.1.1 In previous lectures we have seen a number of important themes, which relate to designing code for complex systems. One was the idea of proof by induction, meaning

More information

For example, let's say that we have the following functional specification:

For example, let's say that we have the following functional specification: FRAME IT: THE NUTS AND BOLTS OF RAD Marty Brown, CommScope, Inc., Claremont, NC INTRODUCTION The road to finishing a quality application does not have to be a long and confusing one. With the advent of

More information

Figure 2.1: A bipartite graph.

Figure 2.1: A bipartite graph. Matching problems The dance-class problem. A group of boys and girls, with just as many boys as girls, want to dance together; hence, they have to be matched in couples. Each boy prefers to dance with

More information

Two Comments on the Principle of Revealed Preference

Two Comments on the Principle of Revealed Preference Two Comments on the Principle of Revealed Preference Ariel Rubinstein School of Economics, Tel Aviv University and Department of Economics, New York University and Yuval Salant Graduate School of Business,

More information

1: Software Development and.net. An approach to building software

1: Software Development and.net. An approach to building software 1: Software Development and.net An approach to building software Overview Programming in software development Life-Cycles for software development Object-orientation and modelling Requirements analysis

More information

Data Mining Chapter 9: Descriptive Modeling Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University

Data Mining Chapter 9: Descriptive Modeling Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Data Mining Chapter 9: Descriptive Modeling Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Descriptive model A descriptive model presents the main features of the data

More information

Lecture 1 Getting Started with SAS

Lecture 1 Getting Started with SAS SAS for Data Management, Analysis, and Reporting Lecture 1 Getting Started with SAS Portions reproduced with permission of SAS Institute Inc., Cary, NC, USA Goals of the course To provide skills required

More information

Verification and Validation. Verification and validation

Verification and Validation. Verification and validation Verification and Validation Verification and validation Verification and Validation (V&V) is a whole life-cycle process. V&V has two objectives: Discovery of defects, Assessment of whether or not the system

More information

Encryption à la Mod Name

Encryption à la Mod Name Rock Around the Clock Part Encryption à la Mod Let s call the integers,, 3,, 5, and the mod 7 encryption numbers and define a new mod 7 multiplication operation, denoted by, in the following manner: a

More information

Overview for Families

Overview for Families unit: Picturing Numbers Mathematical strand: Data Analysis and Probability The following pages will help you to understand the mathematics that your child is currently studying as well as the type of problems

More information

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: Management Information Systems

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: Management Information Systems Sample Questions: Section I: Subjective Questions 1. Which factors are considered critical for the success/failure of the Decision Support System? 2. List the categories of data warehousing tools. 3. "MIS

More information

Exploratory Data Analysis EDA

Exploratory Data Analysis EDA Exploratory Data Analysis EDA Luc Anselin http://spatial.uchicago.edu 1 from EDA to ESDA dynamic graphics primer on multivariate EDA interpretation and limitations 2 From EDA to ESDA 3 Exploratory Data

More information

1 Algorithm and Proof for Minimum Vertex Coloring

1 Algorithm and Proof for Minimum Vertex Coloring Solutions to Homework 7, CS 173A (Fall 2018) Homework 7 asked you to show that the construction problems Maximum Independent Set, Minimum Vertex Coloring, and Maximum Clique could all be solved in polynomial

More information

Paperclip graphs. Steve Butler Erik D. Demaine Martin L. Demaine Ron Graham Adam Hesterberg Jason Ku Jayson Lynch Tadashi Tokieda

Paperclip graphs. Steve Butler Erik D. Demaine Martin L. Demaine Ron Graham Adam Hesterberg Jason Ku Jayson Lynch Tadashi Tokieda Paperclip graphs Steve Butler Erik D. Demaine Martin L. Demaine Ron Graham Adam Hesterberg Jason Ku Jayson Lynch Tadashi Tokieda Abstract By taking a strip of paper and forming an S curve with paperclips

More information

What's that? Why? Is one "better" than the other? Terminology. Comparison. Loop testing. Some experts (e.g. Pezze & Young) call it structural testing

What's that? Why? Is one better than the other? Terminology. Comparison. Loop testing. Some experts (e.g. Pezze & Young) call it structural testing Week 9: More details of white-box testing What is it? Comparison with black-box testing What we should not validate Automated versus interactive testing Testing conditional and loop constructs COMP 370

More information

GRAPH THEORY: AN INTRODUCTION

GRAPH THEORY: AN INTRODUCTION GRAPH THEORY: AN INTRODUCTION BEGINNERS 3/4/2018 1. GRAPHS AND THEIR PROPERTIES A graph G consists of two sets: a set of vertices V, and a set of edges E. A vertex is simply a labeled point. An edge is

More information

6.001 Notes: Section 6.1

6.001 Notes: Section 6.1 6.001 Notes: Section 6.1 Slide 6.1.1 When we first starting talking about Scheme expressions, you may recall we said that (almost) every Scheme expression had three components, a syntax (legal ways of

More information

1 More configuration model

1 More configuration model 1 More configuration model In the last lecture, we explored the definition of the configuration model, a simple method for drawing networks from the ensemble, and derived some of its mathematical properties.

More information

Lab Assignment 3 for ECE374

Lab Assignment 3 for ECE374 Lab Assignment 3 for ECE374 Posted: 02/25/18 Due: 03/08/18 In this lab, we ll take a quick look at the UDP and TCP transport protocol. Whenever possible you should hand in a Wireshark screenshot that you

More information

SFU CMPT week 11

SFU CMPT week 11 SFU CMPT-363 2004-2 week 11 Manuel Zahariev E-mail: manuelz@cs.sfu.ca Based on course material from Arthur Kirkpatrick, Alissa Antle and Paul Hibbits July 21, 2004 1 Analytic Methods Advantages can be

More information

Usability Testing. November 14, 2016

Usability Testing. November 14, 2016 Usability Testing November 14, 2016 Announcements Wednesday: HCI in industry VW: December 1 (no matter what) 2 Questions? 3 Today Usability testing Data collection and analysis 4 Usability test A usability

More information

H. W. Kuhn. Bryn Mawr College

H. W. Kuhn. Bryn Mawr College VARIANTS OF THE HUNGARIAN METHOD FOR ASSIGNMENT PROBLEMS' H. W. Kuhn Bryn Mawr College The author presents a geometrical modelwhich illuminates variants of the Hungarian method for the solution of the

More information

Computer Science and Software Engineering University of Wisconsin - Platteville 9-Software Testing, Verification and Validation

Computer Science and Software Engineering University of Wisconsin - Platteville 9-Software Testing, Verification and Validation Computer Science and Software Engineering University of Wisconsin - Platteville 9-Software Testing, Verification and Validation Yan Shi SE 2730 Lecture Notes Verification and Validation Verification: Are

More information

6.867 Machine Learning

6.867 Machine Learning 6.867 Machine Learning Problem set 3 Due Tuesday, October 22, in class What and how to turn in? Turn in short written answers to the questions explicitly stated, and when requested to explain or prove.

More information

Chapter 8 Software Testing. Chapter 8 Software testing

Chapter 8 Software Testing. Chapter 8 Software testing Chapter 8 Software Testing 1 Topics covered Introduction to testing Stages for testing software system are: Development testing Release testing User testing Test-driven development as interleave approach.

More information

Open and Closed Sets

Open and Closed Sets Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

More information

Increasing/Decreasing Behavior

Increasing/Decreasing Behavior Derivatives and the Shapes of Graphs In this section, we will specifically discuss the information that f (x) and f (x) give us about the graph of f(x); it turns out understanding the first and second

More information

2.2 Absolute Value Functions

2.2 Absolute Value Functions . Absolute Value Functions 7. Absolute Value Functions There are a few was to describe what is meant b the absolute value of a real number. You ma have been taught that is the distance from the real number

More information

MONIKA HEINER.

MONIKA HEINER. LESSON 1 testing, intro 1 / 25 SOFTWARE TESTING - STATE OF THE ART, METHODS, AND LIMITATIONS MONIKA HEINER monika.heiner@b-tu.de http://www.informatik.tu-cottbus.de PRELIMINARIES testing, intro 2 / 25

More information

DSCI 325: Handout 9 Sorting and Options for Printing Data in SAS Spring 2017

DSCI 325: Handout 9 Sorting and Options for Printing Data in SAS Spring 2017 DSCI 325: Handout 9 Sorting and Options for Printing Data in SAS Spring 2017 There are a handful of statements (TITLE, FOOTNOTE, WHERE, BY, etc.) that can be used in a wide variety of procedures. For example,

More information

Lecture 1 Contracts. 1 A Mysterious Program : Principles of Imperative Computation (Spring 2018) Frank Pfenning

Lecture 1 Contracts. 1 A Mysterious Program : Principles of Imperative Computation (Spring 2018) Frank Pfenning Lecture 1 Contracts 15-122: Principles of Imperative Computation (Spring 2018) Frank Pfenning In these notes we review contracts, which we use to collectively denote function contracts, loop invariants,

More information

2013 Association Marketing Benchmark Report

2013 Association  Marketing Benchmark Report 2013 Association Email Marketing Benchmark Report Part I: Key Metrics 1 TABLE of CONTENTS About Informz.... 3 Introduction.... 4 Key Findings.... 5 Overall Association Metrics... 6 Results by Country of

More information

i W E I R D U T O P I A i

i W E I R D U T O P I A i i W E I R D U T O P I A i CHAPTER 9 1 EXPLODING DOTS CHAPTER 9 WEIRD AND WILD MACHINES All right. It is time to go wild and crazy. Here is a whole host of quirky and strange machines to ponder on, some

More information

Graph Structure Over Time

Graph Structure Over Time Graph Structure Over Time Observing how time alters the structure of the IEEE data set Priti Kumar Computer Science Rensselaer Polytechnic Institute Troy, NY Kumarp3@rpi.edu Abstract This paper examines

More information

ANNUAL REPORT OF HAIL STUDIES NEIL G, TOWERY AND RAND I OLSON. Report of Research Conducted. 15 May May For. The Country Companies

ANNUAL REPORT OF HAIL STUDIES NEIL G, TOWERY AND RAND I OLSON. Report of Research Conducted. 15 May May For. The Country Companies ISWS CR 182 Loan c.l ANNUAL REPORT OF HAIL STUDIES BY NEIL G, TOWERY AND RAND I OLSON Report of Research Conducted 15 May 1976-14 May 1977 For The Country Companies May 1977 ANNUAL REPORT OF HAIL STUDIES

More information

Rational Number Operations on the Number Line

Rational Number Operations on the Number Line The Mathematics Enthusiast Volume 14 Number 1 Numbers 1, 2, & 3 Article 18 1-2017 Rational Number Operations on the Number Line Christopher Yakes Let us know how access to this document benefits you. Follow

More information

Problem Set 1. Solution. CS4234: Optimization Algorithms. Solution Sketches

Problem Set 1. Solution. CS4234: Optimization Algorithms. Solution Sketches CS4234: Optimization Algorithms Sketches Problem Set 1 S-1. You are given a graph G = (V, E) with n nodes and m edges. (Perhaps the graph represents a telephone network.) Each edge is colored either blue

More information

Mean Tests & X 2 Parametric vs Nonparametric Errors Selection of a Statistical Test SW242

Mean Tests & X 2 Parametric vs Nonparametric Errors Selection of a Statistical Test SW242 Mean Tests & X 2 Parametric vs Nonparametric Errors Selection of a Statistical Test SW242 Creation & Description of a Data Set * 4 Levels of Measurement * Nominal, ordinal, interval, ratio * Variable Types

More information

Prentice Hall Pre-Algebra (c) 2007 Correlated to: WYOMING MATHEMATICS CONTENT AND PERFORMANCE STANDARDS (Grade 8)

Prentice Hall Pre-Algebra (c) 2007 Correlated to: WYOMING MATHEMATICS CONTENT AND PERFORMANCE STANDARDS (Grade 8) GRADE 8 1. NUMBER OPERATIONS AND CONCEPTS Students use numbers, number sense, and number relationships in a problemsolving situation. 1. Students represent and apply numbers in a variety of equivalent

More information

Semantics via Syntax. f (4) = if define f (x) =2 x + 55.

Semantics via Syntax. f (4) = if define f (x) =2 x + 55. 1 Semantics via Syntax The specification of a programming language starts with its syntax. As every programmer knows, the syntax of a language comes in the shape of a variant of a BNF (Backus-Naur Form)

More information

5 Applications of Definite Integrals

5 Applications of Definite Integrals 5 Applications of Definite Integrals The previous chapter introduced the concepts of a definite integral as an area and as a limit of Riemann sums, demonstrated some of the properties of integrals, introduced

More information

Year Long Mathematics Plan Fourth Grade First Quarter: Discovering Patterns and Relationships (~5 weeks)

Year Long Mathematics Plan Fourth Grade First Quarter: Discovering Patterns and Relationships (~5 weeks) Year Long Mathematics Plan Fourth Grade First Quarter: Discovering Patterns and Relationships (~5 weeks) *Concepts covered: patterns, relationships, T-tables, and graphs. *Critical Content: comparing,

More information

Math 214 Introductory Statistics Summer Class Notes Sections 3.2, : 1-21 odd 3.3: 7-13, Measures of Central Tendency

Math 214 Introductory Statistics Summer Class Notes Sections 3.2, : 1-21 odd 3.3: 7-13, Measures of Central Tendency Math 14 Introductory Statistics Summer 008 6-9-08 Class Notes Sections 3, 33 3: 1-1 odd 33: 7-13, 35-39 Measures of Central Tendency odd Notation: Let N be the size of the population, n the size of the

More information

Order from Chaos. Nebraska Wesleyan University Mathematics Circle

Order from Chaos. Nebraska Wesleyan University Mathematics Circle Order from Chaos Nebraska Wesleyan University Mathematics Circle Austin Mohr Department of Mathematics Nebraska Wesleyan University February 2, 20 The (, )-Puzzle Start by drawing six dots at the corners

More information

Lecture 3: Chapter 3

Lecture 3: Chapter 3 Lecture 3: Chapter 3 C C Moxley UAB Mathematics 12 September 16 3.2 Measurements of Center Statistics involves describing data sets and inferring things about them. The first step in understanding a set

More information

THE EVALUATION OF OPERANDS AND ITS PROBLEMS IN C++

THE EVALUATION OF OPERANDS AND ITS PROBLEMS IN C++ Proceedings of the South Dakota Academy of Science, Vol. 85 (2006) 107 THE EVALUATION OF OPERANDS AND ITS PROBLEMS IN C++ Dan Day and Steve Shum Computer Science Department Augustana College Sioux Falls,

More information