Chapter 7, Part B Sampling and Sampling Distributions

Size: px
Start display at page:

Download "Chapter 7, Part B Sampling and Sampling Distributions"

Transcription

1 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 Distribution of Making Inferences about a Poulation Proortion Poulation with roortion =? A simle random samle of n elements is selected from the oulation. The value of is used to make inferences about the value of. The samle data rovide a value for the samle roortion. Slide 3 1

2 Samling Distribution of The samling distribution of is the robability distribution of all ossible values of the samle roortion. Exected Value of E ( ) = where: = the oulation roortion Slide 4 Samling Distribution of Standard Deviation of Finite Poulation Infinite Poulation ( 1 ) σ = n N n N 1 ( 1 ) σ = n σ σ is referred to as the standard error of the roortion. Slide 5 Form of the Samling Distribution of The samling distribution of can be aroximated by a normal distribution whenever the samle size is large. The samle size is considered large whenever these conditions are satisfied: n > 5 and n(1 ) > 5 Slide 6 2

3 Form of the Samling Distribution of For values of near.50, samle sizes as small as 10 ermit a normal aroximation. With very small (aroaching 0) or very large (aroaching 1) values of, much larger samles are needed. Slide 7 Samling Distribution of Examle: St. Andrew s College Recall that 72% of the rosective students alying to St. Andrew s College desire on-camus housing. What is the robability that a simle random samle of 30 alicants will rovide an estimate of the oulation roortion of alicant desiring on-camus housing that is within lus or minus.05 of the actual oulation roortion? Slide 8 Samling Distribution of For our examle, with n = 30 and =.72, the normal distribution is an accetable aroximation because: n = 30(.72) = 21.6 > 5 and n(1 - ) = 30(.28) = 8.4 > 5 Slide 9 3

4 Samling Distribution of Samling Distribution of.72(1.72) σ = = E ( ) =.72 Slide 10 Samling Distribution of Ste 1: Calculate the z-value at the uer endoint of the interval. z = ( )/.082 =.61 Ste 2: Find the area under the curve to the left of the uer endoint. P(z <.61) =.7291 Slide 11 Samling Distribution of Cumulative Probabilities for the Standard Normal Distribution z Slide 12 4

5 Samling Distribution of Samling Distribution of σ =.082 Area = Slide 13 Samling Distribution of Ste 3: Calculate the z-value at the lower endoint of the interval. z = ( )/.082 = -.61 Ste 4: Find the area under the curve to the left of the lower endoint. P(z < -.61) = P(z >.61) = 1 - P(z <.61) = =.2709 Slide 14 Samling Distribution of Samling Distribution of σ =.082 Area = Slide 15 5

6 Samling Distribution of Ste 5: Calculate the area under the curve between the lower and uer endoints of the interval. P(-.61 < z <.61) = P(z <.61) - P(z < -.61) = =.4582 The robability that the samle roortion of alicants wanting on-camus housing will be within +/-.05 of the actual oulation roortion : P(.67 < <.77) =.4582 Slide 16 Samling Distribution of Samling Distribution of σ =.082 Area = Slide 17 Proerties of Point Estimators Before using a samle statistic as a oint estimator, statisticians check to see whether the samle statistic has the following roerties associated with good oint estimators. Unbiased Efficiency Consistency Slide 18 6

7 Proerties of Point Estimators Unbiased If the exected value of the samle statistic is equal to the oulation arameter being estimated, the samle statistic is said to be an unbiased estimator of the oulation arameter. Slide 19 Proerties of Point Estimators Efficiency Given the choice of two unbiased estimators of the same oulation arameter, we would refer to use the oint estimator with the smaller standard deviation, since it tends to rovide estimates closer to the oulation arameter. The oint estimator with the smaller standard deviation is said to have greater relative efficiency than the other. Slide 20 Proerties of Point Estimators Consistency A oint estimator is consistent if the values of the oint estimator tend to become closer to the oulation arameter as the samle size becomes larger. Slide 21 7

8 Other Samling Methods Stratified Random Samling Cluster Samling Systematic Samling Convenience Samling Judgment Samling Slide 22 Stratified Random 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). Slide 23 Stratified Random Samling A simle random samle is taken from each stratum. Formulas are available for combining the stratum samle results into one oulation arameter estimate. Advantage: If strata are homogeneous, this method is as recise as simle random samling but with a smaller total samle size. Examle: The basis for forming the strata might be deartment, location, age, industry tye, and so on. Slide 24 8

9 Cluster Samling The oulation is first divided into searate grous of elements called clusters. Ideally, each cluster is a reresentative small-scale version of the oulation (i.e. heterogeneous grou). A simle random samle of the clusters is then taken. All elements within each samled (chosen) cluster form the samle. Slide 25 Cluster Samling Examle: A rimary alication is area samling, where clusters are city blocks or other well-defined areas. Advantage: The close roximity of elements can be cost effective (i.e. many samle observations can be obtained in a short time). Disadvantage: This method generally requires a larger total samle size than simle or stratified random samling. Slide 26 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. 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. Slide 27 9

10 Systematic Samling This method has the roerties of a simle random samle, esecially if the list of the oulation elements is a random ordering. Advantage: The samle usually will be easier to identify than it would be if simle random samling were used. Examle: Selecting every 100 th listing in a telehone book after the first randomly selected listing Slide 28 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. Examle: A rofessor conducting research might use student volunteers to constitute a samle. Slide 29 Convenience Samling Advantage: Samle selection and data collection are relatively easy. Disadvantage: It is imossible to determine how reresentative of the oulation the samle is. Slide 30 10

11 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. Examle: A reorter might samle three or four senators, judging them as reflecting the general oinion of the senate. Slide 31 Judgment Samling 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. Slide 32 End of Chater 7, Part B Slide 33 11

Chapter 7b - Point Estimation and Sampling Distributions

Chapter 7b - Point Estimation and Sampling Distributions 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

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

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

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 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 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

22. Swaping: Policies

22. Swaping: Policies 22. Swaing: Policies Oerating System: Three Easy Pieces 1 Beyond Physical Memory: Policies Memory ressure forces the OS to start aging out ages to make room for actively-used ages. Deciding which age to

More information

APPLICATION OF PARTICLE FILTERS TO MAP-MATCHING ALGORITHM

APPLICATION OF PARTICLE FILTERS TO MAP-MATCHING ALGORITHM APPLICATION OF PARTICLE FILTERS TO MAP-MATCHING ALGORITHM Pavel Davidson 1, Jussi Collin 2, and Jarmo Taala 3 Deartment of Comuter Systems, Tamere University of Technology, Finland e-mail: avel.davidson@tut.fi

More information

Distributed Systems. 7. Coordination and Agreement

Distributed Systems. 7. Coordination and Agreement Distributed Systems 7. Coordination and Agreement Werner Nutt 1 Co-ordination Algorithms are fundamental in distributed systems: to dynamically re-assign the role of master choose rimary server after crash

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

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

AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH

AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH A. Prokos 1, G. Karras 1, E. Petsa 2 1 Deartment of Surveying, National Technical University of Athens (NTUA),

More information

Introduction to Visualization and Computer Graphics

Introduction to Visualization and Computer Graphics Introduction to Visualization and Comuter Grahics DH2320, Fall 2015 Prof. Dr. Tino Weinkauf Introduction to Visualization and Comuter Grahics Grids and Interolation Next Tuesday No lecture next Tuesday!

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

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

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

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

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

Measuring and modeling per-element angular visibility in multiview displays

Measuring and modeling per-element angular visibility in multiview displays Measuring and modeling er-element angular visibility in multiview dislays Atanas Boev, Robert Bregovic, Atanas Gotchev Deartment of Signal Processing, Tamere University of Technology, Tamere, Finland firstname.lastname@tut.fi

More information

Improve Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes Λ

Improve Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes Λ Imrove Precategorized Collection Retrieval by Using Suervised Term Weighting Schemes Λ Ying Zhao and George Karyis University of Minnesota, Deartment of Comuter Science Minneaolis, MN 55455 Abstract The

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

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

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

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

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

A network performance-based device driven communication scheme for 5G networks

A network performance-based device driven communication scheme for 5G networks Received: 29 October 217 Revised: 26 December 217 Acceted: 27 December 217 DOI: 1.12/itl2.27 LETTER A network erformance-based device driven communication scheme for 5G networks Sanjay K. Biswash Dushantha

More information

Empty Region Graphs. Computer Science Department, Université Libre de Bruxelles, CP212, Boulevard du Triomphe, 1050 Bruxelles, Belgium

Empty Region Graphs. Computer Science Department, Université Libre de Bruxelles, CP212, Boulevard du Triomphe, 1050 Bruxelles, Belgium Emty Region Grahs Jean Cardinal 1 Sébastien Collette 2 Stefan Langerman 3 Comuter Science Deartment, Université Libre de Bruxelles, CP212, Boulevard du Triomhe, 1050 Bruxelles, Belgium Abstract A family

More information

To appear in IEEE TKDE Title: Efficient Skyline and Top-k Retrieval in Subspaces Keywords: Skyline, Top-k, Subspace, B-tree

To appear in IEEE TKDE Title: Efficient Skyline and Top-k Retrieval in Subspaces Keywords: Skyline, Top-k, Subspace, B-tree To aear in IEEE TKDE Title: Efficient Skyline and To-k Retrieval in Subsaces Keywords: Skyline, To-k, Subsace, B-tree Contact Author: Yufei Tao (taoyf@cse.cuhk.edu.hk) Deartment of Comuter Science and

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

Syntax of the Finite Model Property

Syntax of the Finite Model Property Syntax of the Finite Model Proerty Zachary Ernst University of Missouri-Columbia July 3, 008 Preliminaries A logic L has the finite model roerty if, for every formula α, if L α, then there is a model M

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

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

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

Extracting Optimal Paths from Roadmaps for Motion Planning

Extracting Optimal Paths from Roadmaps for Motion Planning Extracting Otimal Paths from Roadmas for Motion Planning Jinsuck Kim Roger A. Pearce Nancy M. Amato Deartment of Comuter Science Texas A&M University College Station, TX 843 jinsuckk,ra231,amato @cs.tamu.edu

More information

Patterned Wafer Segmentation

Patterned Wafer Segmentation atterned Wafer Segmentation ierrick Bourgeat ab, Fabrice Meriaudeau b, Kenneth W. Tobin a, atrick Gorria b a Oak Ridge National Laboratory,.O.Box 2008, Oak Ridge, TN 37831-6011, USA b Le2i Laboratory Univ.of

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

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

A Novel Iris Segmentation Method for Hand-Held Capture Device

A Novel Iris Segmentation Method for Hand-Held Capture Device A Novel Iris Segmentation Method for Hand-Held Cature Device XiaoFu He and PengFei Shi Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200030, China {xfhe,

More information

CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE

CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE Petra Surynková Charles University in Prague, Faculty of Mathematics and Physics, Sokolovská 83,

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

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

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

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

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

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

A Fast Image Restoration Method Based on an Improved Criminisi Algorithm

A Fast Image Restoration Method Based on an Improved Criminisi Algorithm A Fast Image Restoration Method Based on an Imroved Algorithm Yue Chi1, Ning He2*, Qi Zhang1 Beijing Key Laboratory of Information Services Engineering, Beijing Union University, Beijing 100101, China.

More information

Identity-sensitive Points-to Analysis for the Dynamic Behavior of JavaScript Objects

Identity-sensitive Points-to Analysis for the Dynamic Behavior of JavaScript Objects Identity-sensitive Points-to Analysis for the Dynamic Behavior of JavaScrit Objects Shiyi Wei and Barbara G. Ryder Deartment of Comuter Science, Virginia Tech, Blacksburg, VA, USA. {wei,ryder}@cs.vt.edu

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

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

Realistic Modeling and Synthesis of Resources for Computational Grids

Realistic Modeling and Synthesis of Resources for Computational Grids Manuscrit for Suercomuting 24 Realistic Modeling and Synthesis of Resources for Comutational Grids Yang-Suk Kee Comuter Science & Engineering University of California at San Diego yskee@csag.ucsd.edu Henri

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

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

Event Analysis in Intelligent Aerial Surveillance Systems for Vehicle Detection and Tracking

Event Analysis in Intelligent Aerial Surveillance Systems for Vehicle Detection and Tracking Event Analysis in Intelligent Aerial Surveillance Systems for Vehicle Detection and Tracking B.T.R.Naresh Reddy, Prasad Nagelli, K.Srinivasulu Reddy Abstract Vehicle detection lays an imortant role in

More information

Using Standard AADL for COMPASS

Using Standard AADL for COMPASS Using Standard AADL for COMPASS (noll@cs.rwth-aachen.de) AADL Standards Meeting Aachen, Germany; July 5 8, 06 Overview Introduction SLIM Language Udates COMPASS Develoment Roadma Fault Injections Parametric

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

Vector sigma filters for noise detection and removal in color images

Vector sigma filters for noise detection and removal in color images J. Vis. Commun. Image R. 7 (26) 26 www.elsevier.com/locate/jvci Vector sigma filters for noise detection and removal in color images Rastislav Lukac a, *,, Bogdan Smolka b, Konstantinos N. Plataniotis

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

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

AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY

AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY Yandong Wang EagleView Technology Cor. 5 Methodist Hill Dr., Rochester, NY 1463, the United States yandong.wang@ictometry.com

More information

High Quality Offset Printing An Evolutionary Approach

High Quality Offset Printing An Evolutionary Approach High Quality Offset Printing An Evolutionary Aroach Ralf Joost Institute of Alied Microelectronics and omuter Engineering University of Rostock Rostock, 18051, Germany +49 381 498 7272 ralf.joost@uni-rostock.de

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

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

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

Realistic Modeling and Synthesis of Resources for Computational Grids

Realistic Modeling and Synthesis of Resources for Computational Grids Realistic Modeling and Synthesis of Resources for Comutational Grids Yang-Suk Kee Comuter Science & Engineering University of California at San Diego yskee@csag.ucsd.edu Henri Casanova San Diego Suercomuter

More information

Autonomic Physical Database Design - From Indexing to Multidimensional Clustering

Autonomic Physical Database Design - From Indexing to Multidimensional Clustering Autonomic Physical Database Design - From Indexing to Multidimensional Clustering Stehan Baumann, Kai-Uwe Sattler Databases and Information Systems Grou Technische Universität Ilmenau, Ilmenau, Germany

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

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

Submission. Verifying Properties Using Sequential ATPG

Submission. Verifying Properties Using Sequential ATPG Verifying Proerties Using Sequential ATPG Jacob A. Abraham and Vivekananda M. Vedula Comuter Engineering Research Center The University of Texas at Austin Austin, TX 78712 jaa, vivek @cerc.utexas.edu Daniel

More information

Interactive Image Segmentation

Interactive Image Segmentation Interactive Image Segmentation Fahim Mannan (260 266 294) Abstract This reort resents the roject work done based on Boykov and Jolly s interactive grah cuts based N-D image segmentation algorithm([1]).

More information

Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries

Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Qi Tian, Baback Moghaddam 2 and Thomas S. Huang Beckman Institute, University of Illinois, Urbana-Chamaign, IL 680,

More information

Characterizing User Activity in WiFi Networks: University Campus and Urban Area Case Studies

Characterizing User Activity in WiFi Networks: University Campus and Urban Area Case Studies Characterizing User Activity in WiFi Networks: University Camus and Urban Area Case Studies Larissa Oliveira Deartment of Comuter Engineering lmarinho@ucsc.edu Katia Obraczka Deartment of Comuter Engineering

More information

An Eulerian Finite Element Model of the Metal Cutting Process

An Eulerian Finite Element Model of the Metal Cutting Process 8 th International LS-DYNA Users Conference Metal Forming (1) An Eulerian Finite Element Model of the Metal Cutting Process A. Raczy, W. J. Altenhof, and A. T. Alas Deartment of Mechanical, Automotive,

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

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

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

Brief Contributions. A Geometric Theorem for Network Design 1 INTRODUCTION

Brief Contributions. A Geometric Theorem for Network Design 1 INTRODUCTION IEEE TRANSACTIONS ON COMPUTERS, VOL. 53, NO., APRIL 00 83 Brief Contributions A Geometric Theorem for Network Design Massimo Franceschetti, Member, IEEE, Matthew Cook, and Jehoshua Bruck, Fellow, IEEE

More information

Semi-Markov Process based Model for Performance Analysis of Wireless LANs

Semi-Markov Process based Model for Performance Analysis of Wireless LANs Semi-Markov Process based Model for Performance Analysis of Wireless LANs Murali Krishna Kadiyala, Diti Shikha, Ravi Pendse, and Neeraj Jaggi Deartment of Electrical Engineering and Comuter Science Wichita

More information

Continuous Visible k Nearest Neighbor Query on Moving Objects

Continuous Visible k Nearest Neighbor Query on Moving Objects Continuous Visible k Nearest Neighbor Query on Moving Objects Yaniu Wang a, Rui Zhang b, Chuanfei Xu a, Jianzhong Qi b, Yu Gu a, Ge Yu a, a Deartment of Comuter Software and Theory, Northeastern University,

More information

Image Segmentation Using Topological Persistence

Image Segmentation Using Topological Persistence Image Segmentation Using Toological Persistence David Letscher and Jason Fritts Saint Louis University Deartment of Mathematics and Comuter Science {letscher, jfritts}@slu.edu Abstract. This aer resents

More information

Avoiding the dangers of averaging across subjects when using multidimensional scaling

Avoiding the dangers of averaging across subjects when using multidimensional scaling Journal of Mathematical Psychology 7 () 6 Avoiding the dangers of averaging across subjects when using multidimensional scaling Michael D. Lee a, * and Kenneth J. Poe b a Deartment of Psychology, University

More information

Detecting Multiple Copies of Copy-Move Forgery Based on SURF

Detecting Multiple Copies of Copy-Move Forgery Based on SURF ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Secial Issue 3, March 2014 2014 International Conference

More information

Optimizing Dynamic Memory Management!

Optimizing Dynamic Memory Management! Otimizing Dynamic Memory Management! 1 Goals of this Lecture! Hel you learn about:" Details of K&R hea mgr" Hea mgr otimizations related to Assignment #6" Faster free() via doubly-linked list, redundant

More information