Chapter 7b - Point Estimation and Sampling Distributions

Size: px
Start display at page:

Download "Chapter 7b - Point Estimation and Sampling Distributions"

Transcription

1 Chater 7b - Point Estimation and Samling Distributions Chater 7 (b) Point Estimation and Samling Distributions Point estimation is a form of statistical inference. In oint estimation we use the data from the samle to comute a value of a samle statistic that serves as an estimate of a oulation arameter. We refer to mean. as the oint estimator of the oulation s is the oint estimator of the oulation standard deviation. is the oint estimator of the oulation roortion. 1 Point Estimation Out of a total number of 2500 emloyees, a simle random samle of 30 emloyees and corresonding data on annual salary and management training rogram articiation are shown in the given table. 1, 2.. n is used to denote annual salary of the emloyees and the articiation in the management training rogram is indicated by a yes / no. Annual Salary ($) Management Training Program Annual Salary ($) Management Training Program Annual Salary ($) Management Training Program X 1 = YES 45, YES 45, YES X 2 = YES 57, NO 51, YES 49, YES 55, YES 54, NO 49, YES 51, NO 50, NO 47, NO 56, NO 52, NO 55, YES 51, YES 50, NO 49, YES 52, NO 52, NO 51, YES YES 50, YES 50, YES 51, YES 55, YES 55, YES 52, YES 57, NO 2 Point Estimation Poulation Parameter = Poulation mean annual salary = Poulation standard deviation for annual salary = Poulation roortion having comleted MTP Summary of Point Estimates Obtained from a Simle Random Samle Parameter value Point estimator Point estimate $ 51,800 $ 51,814 $ 4,000 s = Samle standard deviation for annual salary $ 3, Practical Advice The target oulation is the oulation we want to make inferences about. The samled oulation is the oulation from which the samle is actually taken. Samling Distribution of Process of Statistical Inference Poulation with mean =? A simle random samle of n elements is selected from the oulation. Whenever a samle is used to make inferences about a oulation, we should make sure that the targeted oulation and the samled oulation are in close agreement. The value of is used to make inferences about the value of. The samle data rovide a value for the samle mean

2 Chater 7b - Point Estimation and Samling Distributions Samling Distribution of Samling Distribution of Standard Deviation of We will use the following notation to define the standard deviation of the samling distribution of. where: µ = the oulation mean When the eected value of the oint estimator equals the oulation arameter, we say the oint estimator is unbiased. = the standard deviation of = the standard deviation of the oulation n = the samle size N = the oulation size 7 8 Samling Distribution of Standard Deviation of Finite Poulation N n ( ) N 1 n Infinite Poulation n A finite oulation is treated as being infinite if n/n <.05. ( N n) / ( N 1) is the finite oulation correction factor. is referred to as the standard error of the mean. In cases where the oulation is highly skewed or outliers are resent, samles of size 50 may be needed Central Limit Theorem Note: n/n = 30/2500 =.012 Because samle is less than 5% of the oulation size, We ignore the finite oulation correction factor

3 Chater 7b - Point Estimation and Samling Distributions Suose the ersonnel director believes the samle mean will be an accetable estimate of oulation mean if the samle mean is within $500 of the oulation mean. Ste 1: Calculate the z-value at the uer endoint of the interval. z = (52,300 51,800)/ =.68 What is the robability that the samle mean comuted using a simle random samle of 30 emloyees will be within $500 of oulation mean? Ste 2: Find the area under the curve to the left of the uer endoint. P(z <.68) = Cumulative Probabilities for the Standard Normal Distribution Z Function used - NORM.DIST We do not have to make searate comutation of z value. Evaluating NORM.DIST function at each end oint of the interval rovides cumulative robability at the secified end oint of the interval. The result obtained using NORM.DIST is more accurate

4 Chater 7b - Point Estimation and Samling Distributions µ Samling Distribution of The samling distribution of is the robability distribution of all ossible values of the samle roortion ṗ Eected Value of E( ) where: = the oulation roortion Samling Distribution of Standard Deviation of Finite Poulation Infinite Poulation N n (1 ) ( 1 ) N 1 n n is referred to as the standard error of the roortion. ( N n) / ( N 1) is the finite oulation correction factor

5 Chater 7b - Point Estimation and Samling Distributions Form of the Samling Distribution of The samling distribution of can be aroimated by a normal distribution whenever the samle size is large enough to satisfy the two conditions: n > 5 and n(1 ) > 5 For the EAI study we know that the oulation roortion of emloyees who articiated in the management training rogram is = because when these conditions are satisfied, the robability distribution of in the samle roortion, = /n, can be aroimated by normal distribution (and because n is a constant). What is the robability that a simle random samle of 30 emloyees will rovide an estimate of the oulation roortion of emloyees attending management rogram that is within lus or minus.05 of the actual oulation roortion? For our eamle, with n = 30 and =.6, the normal distribution is an accetable aroimation because: n = 30(.6) = 18 > 5 And n(1 - ) = 30(.4) = 12 > 5 Ste 1: Calculate the z-value at the uer endoint of the interval. z = ( )/.0894 =.56 Ste 2: Find the area under the curve to the left of the uer endoint. P(z <.56) = Z Ste 3: Calculate the z-value at the lower endoint of the interval. z = ( )/.0894 = -.56 Ste 4: Find the area under the curve to the left of the lower endoint. P(z < -.56) = Ste 5: Calculate the area under the curve between the lower and uer endoints of the interval. P(-.56 < z <.56) = P(z <.56) - P(z < -.56) = =

6 Chater 7b - Point Estimation and Samling Distributions Other Tyes of Samling Stratified Random Samling Cluster Samling The oulation is first divided into grous of elements called strata. Each element in the oulation belongs to one and only one stratum. Best results are obtained when the elements within each stratum are as much alike as ossible (i.e. a homogeneous grou) Systematic Samling If a samle size of n is desired from a oulation containing N elements, we might samle one element for every n/n elements in the oulation. This method has the roerties of a simle random samle, esecially if the list of the oulation elements is a random ordering. We randomly select one of the first n/n elements from the oulation list. We then select every n/nth element that follows in the oulation list. Advantage: The samle usually will be easier to identify than it would be if simle random samling were used. Eamle: Selecting every 100 th listing in a telehone book after the first randomly selected listing Convenience Samling It is a nonrobability samling technique. Items are included in the samle without known robabilities of being selected. The samle is identified rimarily by convenience. Eamle: A rofessor conducting research might use student volunteers to constitute a samle. Advantage: Samle selection and data collection are relatively easy. Disadvantage: It is imossible to determine how reresentative of the oulation the samle is Judgment Samling The erson most knowledgeable on the subject of the study selects elements of the oulation that he or she feels are most reresentative of the oulation. It is a nonrobability samling technique. Eamle: A reorter might samle three or four senators, judging them as reflecting the general oinion of the senate. Advantage: It is a relatively easy way of selecting a samle. Disadvantage: The quality of the samle results deends on the judgment of the erson selecting the samle. Recommendation It is recommended that robability samling methods (simle random, stratified, cluster, or systematic) be used. For these methods, formulas are available for evaluating the goodness of the samle results in terms of the closeness of the results to the oulation arameters being estimated. An evaluation of the goodness cannot be made with non-robability (convenience or judgment) samling methods

Chapter 7, Part B Sampling and Sampling Distributions

Chapter 7, Part B Sampling and Sampling Distributions Slides Preared by JOHN S. LOUCKS St. Edward s University Slide 1 Chater 7, Part B Samling and Samling Distributions Samling Distribution of Proerties of Point Estimators Other Samling Methods Slide 2 Samling

More information

Randomized algorithms: Two examples and Yao s Minimax Principle

Randomized algorithms: Two examples and Yao s Minimax Principle Randomized algorithms: Two examles and Yao s Minimax Princile Maximum Satisfiability Consider the roblem Maximum Satisfiability (MAX-SAT). Bring your knowledge u-to-date on the Satisfiability roblem. Maximum

More information

Convex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101

Convex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101 Convex Hulls Helen Cameron Helen Cameron Convex Hulls 1/101 What Is a Convex Hull? Starting Point: Points in 2D y x Helen Cameron Convex Hulls 3/101 Convex Hull: Informally Imagine that the x, y-lane is

More information

The concept of set is a very basic one. It is simple; yet, it suffices as the basis on which all abstract notions in mathematics can be built.

The concept of set is a very basic one. It is simple; yet, it suffices as the basis on which all abstract notions in mathematics can be built. Chater 1 Sets and functions Section 1.1 Sets The concet of set is a very basic one. It is simle; yet, it suffices as the basis on which all abstract notions in mathematics can be built. A set is determined

More information

CMSC 425: Lecture 16 Motion Planning: Basic Concepts

CMSC 425: Lecture 16 Motion Planning: Basic Concepts : Lecture 16 Motion lanning: Basic Concets eading: Today s material comes from various sources, including AI Game rogramming Wisdom 2 by S. abin and lanning Algorithms by S. M. LaValle (Chats. 4 and 5).

More information

1. Here is the power function for a particular test about p = fraction of beverage orders for Coke in a restaurant. Suppose that p 0 = 0.3.

1. Here is the power function for a particular test about p = fraction of beverage orders for Coke in a restaurant. Suppose that p 0 = 0.3. Recitation Assignment due 12-8-09. Exam 5 coverage: Most of the exam questions go to material from chaters 16 and 20, but some may touch on suorting material from chater 15. Exect to see questions relating

More information

Improving Trust Estimates in Planning Domains with Rare Failure Events

Improving Trust Estimates in Planning Domains with Rare Failure Events Imroving Trust Estimates in Planning Domains with Rare Failure Events Colin M. Potts and Kurt D. Krebsbach Det. of Mathematics and Comuter Science Lawrence University Aleton, Wisconsin 54911 USA {colin.m.otts,

More information

Automatic Editing with Hard and Soft Edits Some First Experiences

Automatic Editing with Hard and Soft Edits Some First Experiences WP 39 ENGLIH ONLY UNITED NATION ECONOMIC COMMIION FOR EUROPE CONFERENCE OF EUROPEAN TATITICIAN Wor ession on tatistical Data Editing (Oslo, Norway, 4-6 etember ) Toic (vi): New and emerging methods Automatic

More information

Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks

Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks Journal of Comuting and Information Technology - CIT 8, 2000, 1, 1 12 1 Comlexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks Eunice E. Santos Deartment of Electrical

More information

A Method to Determine End-Points ofstraight Lines Detected Using the Hough Transform

A Method to Determine End-Points ofstraight Lines Detected Using the Hough Transform RESEARCH ARTICLE OPEN ACCESS A Method to Detere End-Points ofstraight Lines Detected Using the Hough Transform Gideon Kanji Damaryam Federal University, Lokoja, PMB 1154, Lokoja, Nigeria. Abstract The

More information

A Study of Protocols for Low-Latency Video Transport over the Internet

A Study of Protocols for Low-Latency Video Transport over the Internet A Study of Protocols for Low-Latency Video Transort over the Internet Ciro A. Noronha, Ph.D. Cobalt Digital Santa Clara, CA ciro.noronha@cobaltdigital.com Juliana W. Noronha University of California, Davis

More information

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.) Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual

More information

Simple example. Analysis of programs with pointers. Points-to relation. Program model. Points-to graph. Ordering on points-to relation

Simple example. Analysis of programs with pointers. Points-to relation. Program model. Points-to graph. Ordering on points-to relation Simle eamle Analsis of rograms with ointers := 5 tr := @ *tr := 9 := rogram S1 S2 S3 S4 deendences What are the deendences in this rogram? Problem: just looking at variable names will not give ou the correct

More information

Source Coding and express these numbers in a binary system using M log

Source Coding and express these numbers in a binary system using M log Source Coding 30.1 Source Coding Introduction We have studied how to transmit digital bits over a radio channel. We also saw ways that we could code those bits to achieve error correction. Bandwidth is

More information

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH Jin Lu, José M. F. Moura, and Urs Niesen Deartment of Electrical and Comuter Engineering Carnegie Mellon University, Pittsburgh, PA 15213 jinlu, moura@ece.cmu.edu

More information

Blind Separation of Permuted Alias Image Base on Four-phase-difference and Differential Evolution

Blind Separation of Permuted Alias Image Base on Four-phase-difference and Differential Evolution Sensors & Transducers, Vol. 63, Issue, January 204,. 90-95 Sensors & Transducers 204 by IFSA Publishing, S. L. htt://www.sensorsortal.com lind Searation of Permuted Alias Image ase on Four-hase-difference

More information

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network 1 Sensitivity Analysis for an Otimal Routing Policy in an Ad Hoc Wireless Network Tara Javidi and Demosthenis Teneketzis Deartment of Electrical Engineering and Comuter Science University of Michigan Ann

More information

1.5 Case Study. dynamic connectivity quick find quick union improvements applications

1.5 Case Study. dynamic connectivity quick find quick union improvements applications . Case Study dynamic connectivity quick find quick union imrovements alications Subtext of today s lecture (and this course) Stes to develoing a usable algorithm. Model the roblem. Find an algorithm to

More information

What is the difference between a statistician and a mortician? Nobody's dying to see the statistician! Chapter 8 Interval Estimation

What is the difference between a statistician and a mortician? Nobody's dying to see the statistician! Chapter 8 Interval Estimation Slides Preared by JOHN S. LOUCKS St. Edward s Uiversity Slide 1 What is the differece betwee a statisticia ad a morticia? Nobody's dyig to see the statisticia! Slide Chater 8 Iterval Estimatio Poulatio

More information

Analyzing Borders Between Partially Contradicting Fuzzy Classification Rules

Analyzing Borders Between Partially Contradicting Fuzzy Classification Rules Analyzing Borders Between Partially Contradicting Fuzzy Classification Rules Andreas Nürnberger, Aljoscha Klose, Rudolf Kruse University of Magdeburg, Faculty of Comuter Science 39106 Magdeburg, Germany

More information

Leak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method

Leak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method ITB J. Eng. Sci. Vol. 39 B, No. 1, 007, 1-19 1 Leak Detection Modeling and Simulation for Oil Pieline with Artificial Intelligence Method Pudjo Sukarno 1, Kuntjoro Adji Sidarto, Amoranto Trisnobudi 3,

More information

Sage Estimating. (formerly Sage Timberline Estimating) Getting Started Guide

Sage Estimating. (formerly Sage Timberline Estimating) Getting Started Guide Sage Estimating (formerly Sage Timberline Estimating) Getting Started Guide This is a ublication of Sage Software, Inc. Document Number 20001S14030111ER 09/2012 2012 Sage Software, Inc. All rights reserved.

More information

Using Kullback-Leibler Divergence to Model Opponents in Poker

Using Kullback-Leibler Divergence to Model Opponents in Poker Comuter Poker and Imerfect Information: Paers from the I-14 Worksho Using Kullback-Leibler Divergence to Model Oonents in Poker Jiajia Zhang 1, Xuan Wang, Lin Yao 3, Jingeng Li 1, Xuedong Shen 1 1 Intelligence

More information

Single character type identification

Single character type identification Single character tye identification Yefeng Zheng*, Changsong Liu, Xiaoqing Ding Deartment of Electronic Engineering, Tsinghua University Beijing 100084, P.R. China ABSTRACT Different character recognition

More information

Grouping of Patches in Progressive Radiosity

Grouping of Patches in Progressive Radiosity Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate

More information

A DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans

A DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans Available online at htt://ijdea.srbiau.ac.ir Int. J. Data Enveloment Analysis (ISSN 2345-458X) Vol.5, No.2, Year 2017 Article ID IJDEA-00422, 12 ages Research Article International Journal of Data Enveloment

More information

Truth Trees. Truth Tree Fundamentals

Truth Trees. Truth Tree Fundamentals Truth Trees 1 True Tree Fundamentals 2 Testing Grous of Statements for Consistency 3 Testing Arguments in Proositional Logic 4 Proving Invalidity in Predicate Logic Answers to Selected Exercises Truth

More information

We will then introduce the DT, discuss some of its fundamental properties and show how to compute a DT directly from a given set of points.

We will then introduce the DT, discuss some of its fundamental properties and show how to compute a DT directly from a given set of points. Voronoi Diagram and Delaunay Triangulation 1 Introduction The Voronoi Diagram (VD, for short) is a ubiquitious structure that aears in a variety of discilines - biology, geograhy, ecology, crystallograhy,

More information

Sage Estimating (formerly Sage Timberline Estimating) Getting Started Guide. Version has been retired. This version of the software

Sage Estimating (formerly Sage Timberline Estimating) Getting Started Guide. Version has been retired. This version of the software Sage Estimating (formerly Sage Timberline Estimating) Getting Started Guide Version 14.12 This version of the software has been retired This is a ublication of Sage Software, Inc. Coyright 2014. Sage Software,

More information

TD C. Space filling designs in R

TD C. Space filling designs in R TD C Sace filling designs in R 8/05/0 Tyical engineering ractice : One-At-a-Time (OAT design X P P3 P X Main remarks : OAT brings some information, but otentially wrong Eloration is oor : on monotonicity?

More information

Perception of Shape from Shading

Perception of Shape from Shading 1 Percetion of Shae from Shading Continuous image brightness variation due to shae variations is called shading Our ercetion of shae deends on shading Circular region on left is erceived as a flat disk

More information

A Multi-Objective Genetic Algorithm Based Optimum Schedule under Variety Capacity Restriction

A Multi-Objective Genetic Algorithm Based Optimum Schedule under Variety Capacity Restriction 2016 First International Conerence on Micro and Nano Technologies, Modelling and Simulation A Multi-Objective Genetic Algorithm Based Otimum Schedule under Variety Caacity Restriction Fanrong Sun College

More information

521493S Computer Graphics Exercise 3 (Chapters 6-8)

521493S Computer Graphics Exercise 3 (Chapters 6-8) 521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of

More information

The Normal Distribution & z-scores

The Normal Distribution & z-scores & z-scores Distributions: Who needs them? Why are we interested in distributions? Important link between distributions and probabilities of events If we know the distribution of a set of events, then we

More information

Facial Expression Recognition using Image Processing and Neural Network

Facial Expression Recognition using Image Processing and Neural Network Keerti Keshav Kanchi / International Journal of Comuter Science & Engineering Technology (IJCSET) Facial Exression Recognition using Image Processing and eural etwork Keerti Keshav Kanchi PG Student, Deartment

More information

Face Recognition Using Legendre Moments

Face Recognition Using Legendre Moments Face Recognition Using Legendre Moments Dr.S.Annadurai 1 A.Saradha Professor & Head of CSE & IT Research scholar in CSE Government College of Technology, Government College of Technology, Coimbatore, Tamilnadu,

More information

Chapter 8: Adaptive Networks

Chapter 8: Adaptive Networks Chater : Adative Networks Introduction (.1) Architecture (.2) Backroagation for Feedforward Networks (.3) Jyh-Shing Roger Jang et al., Neuro-Fuzzy and Soft Comuting: A Comutational Aroach to Learning and

More information

Distributed Algorithms

Distributed Algorithms Course Outline With grateful acknowledgement to Christos Karamanolis for much of the material Jeff Magee & Jeff Kramer Models of distributed comuting Synchronous message-assing distributed systems Algorithms

More information

AN early generation of unstructured P2P systems is

AN early generation of unstructured P2P systems is 1078 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 16, NO. 11, NOVEMBER 2005 Dynamic Layer Management in Suereer Architectures Li Xiao, Member, IEEE, Zhenyun Zhuang, and Yunhao Liu, Member,

More information

PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS

PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS Kevin Miller, Vivian Lin, and Rui Zhang Grou ID: 5 1. INTRODUCTION The roblem we are trying to solve is redicting future links or recovering missing links

More information

Model-Based Annotation of Online Handwritten Datasets

Model-Based Annotation of Online Handwritten Datasets Model-Based Annotation of Online Handwritten Datasets Anand Kumar, A. Balasubramanian, Anoo Namboodiri and C.V. Jawahar Center for Visual Information Technology, International Institute of Information

More information

Chapter 3: Graphics Output Primitives. OpenGL Line Functions. OpenGL Point Functions. Line Drawing Algorithms

Chapter 3: Graphics Output Primitives. OpenGL Line Functions. OpenGL Point Functions. Line Drawing Algorithms Chater : Grahics Outut Primitives Primitives: functions in grahics acage that we use to describe icture element Points and straight lines are the simlest rimitives Some acages include circles, conic sections,

More information

IMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model

IMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model IMS Network Deloyment Cost Otimization Based on Flow-Based Traffic Model Jie Xiao, Changcheng Huang and James Yan Deartment of Systems and Comuter Engineering, Carleton University, Ottawa, Canada {jiexiao,

More information

has been retired This version of the software Sage Timberline Office Get Started Document Management 9.8 NOTICE

has been retired This version of the software Sage Timberline Office Get Started Document Management 9.8 NOTICE This version of the software has been retired Sage Timberline Office Get Started Document Management 9.8 NOTICE This document and the Sage Timberline Office software may be used only in accordance with

More information

Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming

Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Weimin Chen, Volker Turau TR-93-047 August, 1993 Abstract This aer introduces a new technique for source-to-source code

More information

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics structure arises in many alications of geometry. The dual structure, called a Delaunay triangulation also has many interesting roerties. Figure 3: Voronoi diagram and Delaunay triangulation. Search: Geometric

More information

Privacy Preserving Moving KNN Queries

Privacy Preserving Moving KNN Queries Privacy Preserving Moving KNN Queries arxiv:4.76v [cs.db] 4 Ar Tanzima Hashem Lars Kulik Rui Zhang National ICT Australia, Deartment of Comuter Science and Software Engineering University of Melbourne,

More information

Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes

Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes Parimala, A., Asstt. Prof., Det. of Telecommunication, MSRIT; Jain University Research Scholar, Bangalore. Raol, J. R., Prof. Emeritus,

More information

Computer Graphics. Computer Graphics. Lecture 3 Line & Circle Drawing

Computer Graphics. Computer Graphics. Lecture 3 Line & Circle Drawing Comuter Grahics Comuter Grahics Lecture 3 Line & Circle Drawing Comuter Grahics Towards the Ideal Line We can onl do a discrete aroimation Illuminate iels as close to the true ath as ossible, consider

More information

Constrained Path Optimisation for Underground Mine Layout

Constrained Path Optimisation for Underground Mine Layout Constrained Path Otimisation for Underground Mine Layout M. Brazil P.A. Grossman D.H. Lee J.H. Rubinstein D.A. Thomas N.C. Wormald Abstract The major infrastructure comonent reuired to develo an underground

More information

An improved algorithm for Hausdorff Voronoi diagram for non-crossing sets

An improved algorithm for Hausdorff Voronoi diagram for non-crossing sets An imroved algorithm for Hausdorff Voronoi diagram for non-crossing sets Frank Dehne, Anil Maheshwari and Ryan Taylor May 26, 2006 Abstract We resent an imroved algorithm for building a Hausdorff Voronoi

More information

Condence Intervals about a Single Parameter:

Condence Intervals about a Single Parameter: Chapter 9 Condence Intervals about a Single Parameter: 9.1 About a Population Mean, known Denition 9.1.1 A point estimate of a parameter is the value of a statistic that estimates the value of the parameter.

More information

Storage Allocation CSE 143. Pointers, Arrays, and Dynamic Storage Allocation. Pointer Variables. Pointers: Review. Pointers and Types

Storage Allocation CSE 143. Pointers, Arrays, and Dynamic Storage Allocation. Pointer Variables. Pointers: Review. Pointers and Types CSE 143 Pointers, Arrays, and Dynamic Storage Allocation [Chater 4,. 148-157, 172-177] Storage Allocation Storage (memory) is a linear array of cells (bytes) Objects of different tyes often reuire differing

More information

IEEE Coyright Notice Personal use of this material is ermitted. However, ermission to rerint/reublish this material for advertising or romotional uroses or for creating new collective works for resale

More information

A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism

A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism Erlin Yao, Mingyu Chen, Rui Wang, Wenli Zhang, Guangming Tan Key Laboratory of Comuter System and Architecture Institute

More information

Parallel Construction of Multidimensional Binary Search Trees. Ibraheem Al-furaih, Srinivas Aluru, Sanjay Goil Sanjay Ranka

Parallel Construction of Multidimensional Binary Search Trees. Ibraheem Al-furaih, Srinivas Aluru, Sanjay Goil Sanjay Ranka Parallel Construction of Multidimensional Binary Search Trees Ibraheem Al-furaih, Srinivas Aluru, Sanjay Goil Sanjay Ranka School of CIS and School of CISE Northeast Parallel Architectures Center Syracuse

More information

A Concise Workbook for College Algebra

A Concise Workbook for College Algebra City University of New York (CUNY) CUNY Academic Works Oen Educational Resources Queensborough Community College Summer 6--08 A Concise Workbook for College Algebra Fei Ye Queensborough Community College

More information

Curve Reconstruction taken from [1]

Curve Reconstruction taken from [1] Notes by Tamal K. Dey, OSU 47 Curve Reconstruction taken from [1] The simlest class of manifolds that ose nontrivial reconstruction roblems are curves in the lane. We will describe two algorithms for curve

More information

Parametric Optimization in WEDM of WC-Co Composite by Neuro-Genetic Technique

Parametric Optimization in WEDM of WC-Co Composite by Neuro-Genetic Technique Parametric Otimization in WEDM of WC-Co Comosite by Neuro-Genetic Technique P. Saha*, P. Saha, and S. K. Pal Abstract The resent work does a multi-objective otimization in wire electro-discharge machining

More information

6-1 THE STANDARD NORMAL DISTRIBUTION

6-1 THE STANDARD NORMAL DISTRIBUTION 6-1 THE STANDARD NORMAL DISTRIBUTION The major focus of this chapter is the concept of a normal probability distribution, but we begin with a uniform distribution so that we can see the following two very

More information

An Efficient End-to-End QoS supporting Algorithm in NGN Using Optimal Flows and Measurement Feed-back for Ubiquitous and Distributed Applications

An Efficient End-to-End QoS supporting Algorithm in NGN Using Optimal Flows and Measurement Feed-back for Ubiquitous and Distributed Applications An Efficient End-to-End QoS suorting Algorithm in NGN Using Otimal Flows and Measurement Feed-back for Ubiquitous and Distributed Alications Se Youn Ban, Seong Gon Choi 2, Jun Kyun Choi Information and

More information

Pujan Ziaie, Thomas Müller, Mary Ellen Foster, Alois Knoll

Pujan Ziaie, Thomas Müller, Mary Ellen Foster, Alois Knoll Using a Naïve Bayes Classifier based on K-Nearest Neighbors with Distance Weighting for Static Hand- esture Recognition in a Human-Robot Dialog System Puan Ziaie, Thomas Mülle Mary Ellen Foste Alois Knoll

More information

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data Efficient Processing of To-k Dominating Queries on Multi-Dimensional Data Man Lung Yiu Deartment of Comuter Science Aalborg University DK-922 Aalborg, Denmark mly@cs.aau.dk Nikos Mamoulis Deartment of

More information

arxiv: v1 [math.gt] 1 May 2018

arxiv: v1 [math.gt] 1 May 2018 CIRCUIT PRESENTATION AND LATTICE STICK NUMBER WITH EXACTLY 4 z-sticks HYOUNGJUN KIM AND SUNGJONG NO arxiv:805.0023v [math.gt] May 208 Abstract. The lattice stick number s L(L) of a link L is defined to

More information

To Do. Computer Graphics (Fall 2004) Course Outline. Course Outline. Motivation. Motivation

To Do. Computer Graphics (Fall 2004) Course Outline. Course Outline. Motivation. Motivation Comuter Grahics (Fall 24) COMS 416, Lecture 3: ransformations 1 htt://www.cs.columbia.edu/~cs416 o Do Start (thinking about) assignment 1 Much of information ou need is in this lecture (slides) Ask A NOW

More information

EP2200 Performance analysis of Communication networks. Topic 3 Congestion and rate control

EP2200 Performance analysis of Communication networks. Topic 3 Congestion and rate control EP00 Performance analysis of Communication networks Toic 3 Congestion and rate control Congestion, rate and error control Lecture material: Bertsekas, Gallager, Data networks, 6.- I. Kay, Stochastic modeling,

More information

Theoretical Analysis of Graphcut Textures

Theoretical Analysis of Graphcut Textures Theoretical Analysis o Grahcut Textures Xuejie Qin Yee-Hong Yang {xu yang}@cs.ualberta.ca Deartment o omuting Science University o Alberta Abstract Since the aer was ublished in SIGGRAPH 2003 the grahcut

More information

OMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications

OMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications OMNI: An Efficient Overlay Multicast Infrastructure for Real-time Alications Suman Banerjee, Christoher Kommareddy, Koushik Kar, Bobby Bhattacharjee, Samir Khuller Abstract We consider an overlay architecture

More information

Building Better Nurse Scheduling Algorithms

Building Better Nurse Scheduling Algorithms Building Better Nurse Scheduling Algorithms Annals of Oerations Research, 128, 159-177, 2004. Dr Uwe Aickelin Dr Paul White School of Comuter Science University of the West of England University of Nottingham

More information

Stopping Criteria for a Constrained Single-Objective Particle Swarm Optimization Algorithm

Stopping Criteria for a Constrained Single-Objective Particle Swarm Optimization Algorithm Informatica 3 (27) 5 59 5 Stoing Criteria for a Constrained Single-Objective Particle Swarm Otimization Algorithm Karin Zielinski and Rainer Laur Institute for Electromagnetic Theory and Microelectronics,

More information

The Normal Distribution & z-scores

The Normal Distribution & z-scores & z-scores Distributions: Who needs them? Why are we interested in distributions? Important link between distributions and probabilities of events If we know the distribution of a set of events, then we

More information

GEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER

GEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER GEOMETRIC CONSTRAINT SOLVING IN < AND < 3 CHRISTOPH M. HOFFMANN Deartment of Comuter Sciences, Purdue University West Lafayette, Indiana 47907-1398, USA and PAMELA J. VERMEER Deartment of Comuter Sciences,

More information

Selecting Discriminative Binary Patterns for a Local Feature

Selecting Discriminative Binary Patterns for a Local Feature BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 3 Sofia 015 rint ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-015-0044 Selecting Discriminative Binary atterns

More information

Function Point Estimation and Demonstration on Website Projects

Function Point Estimation and Demonstration on Website Projects www.ccsenet.org/cis Comuter and Information Science Vol. 5, No. 3; May 1 Function Point Estimation and Demonstration on Website Projects Feng Jingchun 1, Zhang Fujie 1, Zhu Dandan 1 & Zhang Fei 1 1 Institute

More information

Earthenware Reconstruction Based on the Shape Similarity among Potsherds

Earthenware Reconstruction Based on the Shape Similarity among Potsherds Original Paer Forma, 16, 77 90, 2001 Earthenware Reconstruction Based on the Shae Similarity among Potsherds Masayoshi KANOH 1, Shohei KATO 2 and Hidenori ITOH 1 1 Nagoya Institute of Technology, Gokiso-cho,

More information

Sage Document Management Version 17.1

Sage Document Management Version 17.1 Sage Document Management Version 17.1 User's Guide This is a ublication of Sage Software, Inc. 2017 The Sage Grou lc or its licensors. All rights reserved. Sage, Sage logos, and Sage roduct and service

More information

CLUSTER ANALYSIS AND NEURAL NETWORK

CLUSTER ANALYSIS AND NEURAL NETWORK LUSTER ANALYSIS AND NEURAL NETWORK P.Dostál,P.Pokorný Deartment of Informatics, Faculty of Business and Management, Brno University of Technology Institute of Mathematics, Faculty of Mechanical Engineering,

More information

Figure 8.1: Home age taken from the examle health education site (htt:// Setember 14, 2001). 201

Figure 8.1: Home age taken from the examle health education site (htt://  Setember 14, 2001). 201 200 Chater 8 Alying the Web Interface Profiles: Examle Web Site Assessment 8.1 Introduction This chater describes the use of the rofiles develoed in Chater 6 to assess and imrove the quality of an examle

More information

Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties

Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties Imroved heuristics for the single machine scheduling roblem with linear early and quadratic tardy enalties Jorge M. S. Valente* LIAAD INESC Porto LA, Faculdade de Economia, Universidade do Porto Postal

More information

Sage 300 Construction and Real Estate (formerly Sage Timberline Office)

Sage 300 Construction and Real Estate (formerly Sage Timberline Office) Sage 300 Construction and Real Estate (formerly Sage Timberline Office) 2017 Year-End Procedures and Government Forms Guide (Canada) This is a ublication of Sage Software, Inc. 2018 The Sage Grou lc or

More information

A 2D Random Walk Mobility Model for Location Management Studies in Wireless Networks Abstract: I. Introduction

A 2D Random Walk Mobility Model for Location Management Studies in Wireless Networks Abstract: I. Introduction A D Random Walk Mobility Model for Location Management Studies in Wireless Networks Kuo Hsing Chiang, RMIT University, Melbourne, Australia Nirmala Shenoy, Information Technology Deartment, RIT, Rochester,

More information

Trigonometric Functions

Trigonometric Functions Similar Right-Angled Triangles Trigonometric Functions We lan to introduce trigonometric functions as certain ratios determined by similar right-angled triangles. By de nition, two given geometric gures

More information

Process and Measurement System Capability Analysis

Process and Measurement System Capability Analysis Process and Measurement System aability Analysis Process caability is the uniformity of the rocess. Variability is a measure of the uniformity of outut. Assume that a rocess involves a quality characteristic

More information

A Brief Introduction to Truth-Table Logic. Kent Slinker Pima Community College

A Brief Introduction to Truth-Table Logic. Kent Slinker Pima Community College ` A Brief Introduction to ruth-able Logic Kent Slinker Pima Community College Earlier in this class, we learned that all arguments are either valid or invalid. Additionally, we learned that certain valid

More information

split split (a) (b) split split (c) (d)

split split (a) (b) split split (c) (d) International Journal of Foundations of Comuter Science c World Scientic Publishing Comany ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES JIE WU Deartment of Comuter Science and Engineering

More information

Chapter 6 Normal Probability Distributions

Chapter 6 Normal Probability Distributions Chapter 6 Normal Probability Distributions 6-1 Review and Preview 6-2 The Standard Normal Distribution 6-3 Applications of Normal Distributions 6-4 Sampling Distributions and Estimators 6-5 The Central

More information

Sage Estimating. (formerly Sage Timberline Estimating) Options Guide

Sage Estimating. (formerly Sage Timberline Estimating) Options Guide Sage Estimating (formerly Sage Timberline Estimating) Otions Guide This is a ublication of Sage Software, Inc. Document Number 1112ER 09/2012 2012 Sage Software, Inc. All rights reserved. Sage, the Sage

More information

Space-efficient Region Filling in Raster Graphics

Space-efficient Region Filling in Raster Graphics "The Visual Comuter: An International Journal of Comuter Grahics" (submitted July 13, 1992; revised December 7, 1992; acceted in Aril 16, 1993) Sace-efficient Region Filling in Raster Grahics Dominik Henrich

More information

Deformable Free Space Tilings for Kinetic Collision Detection

Deformable Free Space Tilings for Kinetic Collision Detection Deformable Free Sace Tilings for Kinetic Collision Detection Pankaj K. Agarwal Julien Basch Leonidas J. Guibas John Hershberger Li Zhang Abstract We resent kinetic data structures for detecting collisions

More information

Computing the Convex Hull of. W. Hochstattler, S. Kromberg, C. Moll

Computing the Convex Hull of. W. Hochstattler, S. Kromberg, C. Moll Reort No. 94.60 A new Linear Time Algorithm for Comuting the Convex Hull of a Simle Polygon in the Plane by W. Hochstattler, S. Kromberg, C. Moll 994 W. Hochstattler, S. Kromberg, C. Moll Universitat zu

More information

SIMULATION SYSTEM MODELING FOR MASS CUSTOMIZATION MANUFACTURING

SIMULATION SYSTEM MODELING FOR MASS CUSTOMIZATION MANUFACTURING Proceedings of the 2002 Winter Simulation Conference E. Yücesan, C.-H. Chen, J. L. Snowdon, and J. M. Charnes, eds.. SIMULATION SYSTEM MODELING FOR MASS CUSTOMIATION MANUFACTURING Guixiu Qiao Charles McLean

More information

Lecture 7: Objects (Chapter 15) CS 1110 Introduction to Computing Using Python

Lecture 7: Objects (Chapter 15) CS 1110 Introduction to Computing Using Python htt://www.cs.cornell.edu/courses/cs1110/2018s Lecture 7: Objects (Chater 15) CS 1110 Introduction to Comuting Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner, C. Van Loan, W. White]

More information

Generating Social Network Features for Link-based Classification

Generating Social Network Features for Link-based Classification Generating Social Network Features for Link-based Classification Jun Karamon 1, Yutaka Matsuo 2, Hikaru Yamamoto 3, and Mitsuru Ishizuka 1 1 The University of Tokyo, 7-3-1 Hongo Bunkyo-ku Tokyo, Jaan,

More information

Sage 300 Construction and Real Estate (formerly Sage Timberline Office)

Sage 300 Construction and Real Estate (formerly Sage Timberline Office) Sage 300 Construction and Real Estate (formerly Sage Timberline Office) 2017 Year-End Procedures and Government Forms Guide (United States) This is a ublication of Sage Software, Inc. 2018 The Sage Grou

More information

COMP30172: Advanced Algorithms Notes and Exercises on Automata-based Verification

COMP30172: Advanced Algorithms Notes and Exercises on Automata-based Verification COMP30172: Advanced Algorithms Notes and Exercises on Automata-based Verification Howard Barringer Rm2.20: Kilburn Building Email: Howard.Barringer@manchester.ac.uk March 2010 ii Contents Preface v 1 Model

More information

ON THE DISRUPTION-LEVEL OF POLYNOMIAL MUTATION FOR EVOLUTIONARY MULTI-OBJECTIVE OPTIMISATION ALGORITHMS

ON THE DISRUPTION-LEVEL OF POLYNOMIAL MUTATION FOR EVOLUTIONARY MULTI-OBJECTIVE OPTIMISATION ALGORITHMS Comuting and Informatics, Vol. 29, 2010, 783 800 ON THE DISRUPTION-LEVEL OF POLYNOMIAL MUTATION FOR EVOLUTIONARY MULTI-OBJECTIVE OPTIMISATION ALGORITHMS Mohammad Hamdan Deartment of Comuter Science Faculty

More information

Constrained Empty-Rectangle Delaunay Graphs

Constrained Empty-Rectangle Delaunay Graphs CCCG 2015, Kingston, Ontario, August 10 12, 2015 Constrained Emty-Rectangle Delaunay Grahs Prosenjit Bose Jean-Lou De Carufel André van Renssen Abstract Given an arbitrary convex shae C, a set P of oints

More information

Real Numbers and Algebraic Expressions

Real Numbers and Algebraic Expressions College Algebra - MAT 161 Page: 1 Coyright 2009 Killoran Real Numbers and Algebraic Exressions Idea #1 Infinity- a never ending rogression Is there an infinity of sand grains on the Outer Banks of North

More information

CHAPTER 2: Describing Location in a Distribution

CHAPTER 2: Describing Location in a Distribution CHAPTER 2: Describing Location in a Distribution 2.1 Goals: 1. Compute and use z-scores given the mean and sd 2. Compute and use the p th percentile of an observation 3. Intro to density curves 4. More

More information

Lecture 8: Orthogonal Range Searching

Lecture 8: Orthogonal Range Searching CPS234 Comutational Geometry Setember 22nd, 2005 Lecture 8: Orthogonal Range Searching Lecturer: Pankaj K. Agarwal Scribe: Mason F. Matthews 8.1 Range Searching The general roblem of range searching is

More information