TD C. Space filling designs in R

Size: px
Start display at page:

Download "TD C. Space filling designs in R"

Transcription

1 TD C Sace filling designs in R 8/05/0

2 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? Discontinuity? Interaction? Summer school CEA-EDF-IRIA 0 - TD C 04/07/

3 Illustration of the curse of dimensionality log(ratio(k oints in a 3D sace Bad sace covering = =3 vol. shere( r 0.5 / log(ratio Surf. circle / Surf. square ~ 3/4 Vol. shere / Vol. cube ~ / =0 Ratio ~ k hyercube volume >> (included and tangent hyershere volume For large dimensions, all the oints will be in the corner of the hyercube Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 3

4 Model eloration goal GOAL : elore as best as ossible the behaviour of the code Put some oints in the whole inut sace in order to «maimize» the amount of information on the model outut Contrary to an uncertainty roagation ste, it deends on Regular mesh with n levels =n simulations To minimize, needs to have some techniques ensuring good «coverage» of the inut sace Simle random samling (Monte Carlo does not ensure this E: =, n =3 =9 = 0, n=3 = E: = = 0 Monte Carlo Otimized design Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 4

5 Eloration in hysical eerimentation Design of eeriments develos strategies to define eeriments in order to obtain the required information as efficiently as ossible Designs for real eeriments Estimate arameters of linear regression with a minimal number of oints Eamles : Full factorial design 3 Fractional factorial design 3- Designs for numerical eeriments Characteristics Deterministic eeriments (no error, Large number of inut variables, Large range of inut variation domain, Multile outut variables, arameter Strong interactions between inuts, High non linearity in the model arameter arameter 3 sace filling designs (uniform coverage in the inut sace Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 5

6 Objectives When the objectives is to discover what haens inside the model and when no model comutations have been realized, we want to resect the two following constraints: To sread the oints over the inut sace in order to cature non linearities of the model outut, To ensure that this inut sace coverage is robust with resect to dimension reduction. Therefore, we look some design whech insures the «best coverage» of the inut sace How to define this «best»? How to choose the right number of oints? How to measure the reresentativity? Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 6

7 The design of numerical eeriments: Sace filling Sarsity of the sace of the inut variables in high dimension The learning design choice is made in order to have an otimal coverage of the inut domain The sace filling designs are good candidates. Simle Random Samle (SRS Sace Filling Design (SFD Eamle: Sobol sequence Two ossible criteria:. Distance criteria between the oints: minima, maimin,. Uniformity criteria of the design (discreancy measures Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 7

8 Distance criteria between the oints [ Johnson et al., 990 ] Minima design D MI : Minimize the maimal distance between the oints min ma d(, D D where d(, D All oints in [0,] are not too far from a design oint => One of the best design but too eensive to find D MI ma d(, D min d(, ( 0 D MI (0 Maimin design D MA : Maimize the minimal distance between the oints ma D ( ( ( min d(, min d(, ( ( ( (, D, D MA ( [ From: Owen, 996 ] Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 8

9 Eercise a Build a design based on the maimin criterion Characteristics : = variables U[0,] ; = 9 oints The idea is to generate a high number od random designs, then to select the best, by using the mindist( function of the DiceDesign ackage b Visualize this random maimin design with resect to a ure random design c Build a full factorial design, by using the factdesign( function of the DiceDesign ackage : variables with 3 levels => 9 oints Visualize this design with resect the two others Comare the maimin criteria of these 3 designs (random/maimin/factorial d Identify the roblems related to the full factorial designs Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 9

10 Sace filling measure of a design: the discreancy Measure of the maimal deviation between the distribution of the samle s oints to an uniform distribution Measure of deviation from the uniformity Geometrical interretation: Comarison between the volume of intervals and the number oints within these intervals Q( t [0,[, Q( t [0, t [ [0, t [ [0, t disc( D su Q( t [0,[ Q( t i t i [ Lower the discreancy is, the more the oints of the design D fill the all sace Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 0

11 Summer school CEA-EDF-IRIA 0 - TD C 04/07/ Discreancy comutation in ractice Modified L -discreancy (intervals with minimal boundary 0 Centered L -discreancy (intervals with boundary one verte of the unit cube Symetric L -discreancy (intervals with boundary one «even» verte of the unit cube Different definitions, deending on the chosen norm & considered intervals Classical choice (easy comutations: L discreancy j i k j k i k j k i k i k i k i k D, ( ( ( ( ( ( 3 ( disc

12 Relation with the integration roblem I [0,[ f ( d M ontecarlo : I with MC ( i i... i f ( ( i a sequence of random ointsin [0,[ MC MC Var( I I ; Var I O General roerty: V( f disc( D With a low discreancy sequence D (quasi Monte Carlo sequence : Well-known choice: Sobol sequence O ln Summer school CEA-EDF-IRIA 0 - TD C 04/07/

13 Sobol sequence vs. Random samle vs. regular grid [ From: Kucherenko, 00 ] Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 3

14 Eercise a Build a sequence of Sobol by using the sobol( function of the randtoolbo ackage Characteristics : = variables U[0,] ; = 9 oints Visualize this design and comare its maimin criterion with those of eercise b Comute a discreancy criterion of Sobol sequence and designs of eercise by using the discreancycriteria( function of the DiceDesign ackage c Build a sequence of Sobol with = 8 variables U[0,] ; = 00 oints Visualize all the scatterlots with the airs( function What kind of anomalies do you detect? PS: this roblem is much more regnant with Faure and Halton sequences Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 4

15 The design of numerical eeriments: LHS A lot of models are additive. If not, first order effects often dominate Proerty of uniform rojections on the margins It can be obtained via a Latin Hyercube Samle Divide each dimension in intervals Take one oint in each stratum Eamle : =, =0, X ~ U[0,], X ~ (0, Eamle : =, =4 Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 5

16 Algorithm of LHS Stein method Samle with oints of inuts ran = matri(runif(*,nrow=,ncol= # tirage de valeurs selon loi U[0,] for (i in : { id = samle(: # vecteur de ermutations des entiers {,,,} P = (id-ran[,i] / # vecteur de robabilites [,i] <- quantile_selon_la_loi (P } Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 6

17 [,] Otimization of LHS Joining the two roerties (sace filling and LHS One ossibility: generate a large number (for e: 000 of different LHS Then, choose the LHS which otimizes the criterion Eamle: = = 6 Maimin LHS Low wra-around For comarison: discreancy LHS [,] Sobol sequence Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 7

18 Eercise 3 a Build a random LHS and a maimin LHS by using the ackage lhs Characteristics : = variables U[0,] ; = 0 oints Visualize these two designs and comare them with a ure random design b BOUS : sensitivity analysis Look at the ackage sensitivity which allows to erform some global sensitivity analysis, and esecially to obtain variance-based sensitivity indices Run the eamle at the end of hel age of sobol00( (on Sobol g-function Relace the two initial indeendent Monte Carlo samles needed by sobol00( by some indeendent Sobol sequences ; then look at the results in terms of sensitivity estimates and errors Eact st order indices : S=0.76; S=0.79; S3=0.04 ; S4=0.007 ; S5=0 ; S6=0 ; S7=0 ; S8=0 Eact total indices : ST=0.786; ST=0.4; ST3=0.034; ST4=0.00; ST5=0; ST6=0; ST7=0 ; ST8=0 Summer school CEA-EDF-IRIA 0 - TD C 04/07/ 8

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

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

Variability-Aware Parametric Yield Estimation for Analog/Mixed-Signal Circuits: Concepts, Algorithms and Challenges

Variability-Aware Parametric Yield Estimation for Analog/Mixed-Signal Circuits: Concepts, Algorithms and Challenges Variability-Aware Parametric Yield Estimation for Analog/Mixed-Signal Circuits: Concets, Algorithms and Challenges Fang Gong Cadence Design Systems, Inc. 2655 Seely Ave., San Jose, CA fgong@cadence.com

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

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

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

Equality-Based Translation Validator for LLVM

Equality-Based Translation Validator for LLVM Equality-Based Translation Validator for LLVM Michael Ste, Ross Tate, and Sorin Lerner University of California, San Diego {mste,rtate,lerner@cs.ucsd.edu Abstract. We udated our Peggy tool, reviously resented

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

EE678 Application Presentation Content Based Image Retrieval Using Wavelets

EE678 Application Presentation Content Based Image Retrieval Using Wavelets EE678 Alication Presentation Content Based Image Retrieval Using Wavelets Grou Members: Megha Pandey megha@ee. iitb.ac.in 02d07006 Gaurav Boob gb@ee.iitb.ac.in 02d07008 Abstract: We focus here on an effective

More information

Shuigeng Zhou. May 18, 2016 School of Computer Science Fudan University

Shuigeng Zhou. May 18, 2016 School of Computer Science Fudan University Query Processing Shuigeng Zhou May 18, 2016 School of Comuter Science Fudan University Overview Outline Measures of Query Cost Selection Oeration Sorting Join Oeration Other Oerations Evaluation of Exressions

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

TOPP Probing of Network Links with Large Independent Latencies

TOPP Probing of Network Links with Large Independent Latencies TOPP Probing of Network Links with Large Indeendent Latencies M. Hosseinour, M. J. Tunnicliffe Faculty of Comuting, Information ystems and Mathematics, Kingston University, Kingston-on-Thames, urrey, KT1

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

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

The Spatial Skyline Queries

The Spatial Skyline Queries Coffee sho The Satial Skyline Queries Mehdi Sharifzadeh and Cyrus Shahabi VLDB 006 Presented by Ali Khodaei Coffee sho Three friends Coffee sho Three friends Don t choose this lace is closer to each three

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

Computer Experiments. Designs

Computer Experiments. Designs Computer Experiments Designs Differences between physical and computer Recall experiments 1. The code is deterministic. There is no random error (measurement error). As a result, no replication is needed.

More information

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China

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

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

Approximate Star-Shaped Decomposition of Point Set Data

Approximate Star-Shaped Decomposition of Point Set Data Eurograhics Symosium on Point-Based Grahics (2007) M. Botsch, R. Pajarola (Editors) Aroimate Star-Shaed Decomosition of Point Set Data Jyh-Ming Lien George Mason University, Fairfa, Virginia, USA Abstract

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

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

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

Tracking Multiple Targets Using a Particle Filter Representation of the Joint Multitarget Probability Density

Tracking Multiple Targets Using a Particle Filter Representation of the Joint Multitarget Probability Density Tracing Multile Targets Using a Particle Filter Reresentation of the Joint Multitarget Probability Density Chris Kreucher, Keith Kastella, Alfred Hero This wor was suorted by United States Air Force contract

More information

CS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE

CS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE CS 45: COMUTER GRAHICS 2D TRANSFORMATIONS SRING 26 DR. MICHAEL J. REALE INTRODUCTION Now that we hae some linear algebra under our resectie belts, we can start ug it in grahics! So far, for each rimitie,

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

Global Illumination with Photon Map Compensation

Global Illumination with Photon Map Compensation Institut für Comutergrahik und Algorithmen Technische Universität Wien Karlslatz 13/186/2 A-1040 Wien AUSTRIA Tel: +43 (1) 58801-18688 Fax: +43 (1) 58801-18698 Institute of Comuter Grahics and Algorithms

More information

Cross products Line segments The convex combination of two distinct points p

Cross products Line segments The convex combination of two distinct points p CHAPTER Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter

More information

Stereo Disparity Estimation in Moment Space

Stereo Disparity Estimation in Moment Space Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. angeline.ang@mmu.edu.my R. ukundan Deartment of Comuter Science, University

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

Implementations of Partial Document Ranking Using. Inverted Files. Wai Yee Peter Wong. Dik Lun Lee

Implementations of Partial Document Ranking Using. Inverted Files. Wai Yee Peter Wong. Dik Lun Lee Imlementations of Partial Document Ranking Using Inverted Files Wai Yee Peter Wong Dik Lun Lee Deartment of Comuter and Information Science, Ohio State University, 36 Neil Ave, Columbus, Ohio 4321, U.S.A.

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

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

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

Efficient Parallel Hierarchical Clustering

Efficient Parallel Hierarchical Clustering Efficient Parallel Hierarchical Clustering Manoranjan Dash 1,SimonaPetrutiu, and Peter Scheuermann 1 Deartment of Information Systems, School of Comuter Engineering, Nanyang Technological University, Singaore

More information

Learning Robust Locality Preserving Projection via p-order Minimization

Learning Robust Locality Preserving Projection via p-order Minimization Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Learning Robust Locality Preserving Projection via -Order Minimization Hua Wang, Feiing Nie, Heng Huang Deartment of Electrical

More information

Semi-Supervised Learning Based Object Detection in Aerial Imagery

Semi-Supervised Learning Based Object Detection in Aerial Imagery Semi-Suervised Learning Based Obect Detection in Aerial Imagery Jian Yao Zhongfei (Mark) Zhang Deartment of Comuter Science, State University of ew York at Binghamton, Y 13905, USA yao@binghamton.edu Zhongfei@cs.binghamton.edu

More information

Lecture 18. Today, we will discuss developing algorithms for a basic model for parallel computing the Parallel Random Access Machine (PRAM) model.

Lecture 18. Today, we will discuss developing algorithms for a basic model for parallel computing the Parallel Random Access Machine (PRAM) model. U.C. Berkeley CS273: Parallel and Distributed Theory Lecture 18 Professor Satish Rao Lecturer: Satish Rao Last revised Scribe so far: Satish Rao (following revious lecture notes quite closely. Lecture

More information

Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation

Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Loy Hui Chien and Takafumi Aoki Graduate School of Information Sciences Tohoku University Aoba-yama 5, Sendai, 98-8579, Jaan

More information

11/2/2010. In the last lecture. Monte-Carlo Ray Tracing : Path Tracing. Today. Shadow ray towards the light at each vertex. Path Tracing : algorithm

11/2/2010. In the last lecture. Monte-Carlo Ray Tracing : Path Tracing. Today. Shadow ray towards the light at each vertex. Path Tracing : algorithm Comuter Grahics Global Illumination: Monte-Carlo Ray Tracing and Photon Maing Lecture 11 In the last lecture We did ray tracing and radiosity Ray tracing is good to render secular objects but cannot handle

More information

The Transportation Primitive

The Transportation Primitive Syracuse University SURFACE College of Engineering and Comuter Science - Former Deartments, Centers, Institutes and Projects College of Engineering and Comuter Science 1994 The Transortation Primitive

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

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

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

Graph Cut Matching In Computer Vision

Graph Cut Matching In Computer Vision Grah Cut Matching In Comuter Vision Toby Collins (s0455374@sms.ed.ac.uk) February 2004 Introduction Many of the roblems that arise in early vision can be naturally exressed in terms of energy minimization.

More information

Introduction to Parallel Algorithms

Introduction to Parallel Algorithms CS 1762 Fall, 2011 1 Introduction to Parallel Algorithms Introduction to Parallel Algorithms ECE 1762 Algorithms and Data Structures Fall Semester, 2011 1 Preliminaries Since the early 1990s, there has

More information

Auto-Tuning Distributed-Memory 3-Dimensional Fast Fourier Transforms on the Cray XT4

Auto-Tuning Distributed-Memory 3-Dimensional Fast Fourier Transforms on the Cray XT4 Auto-Tuning Distributed-Memory 3-Dimensional Fast Fourier Transforms on the Cray XT4 M. Gajbe a A. Canning, b L-W. Wang, b J. Shalf, b H. Wasserman, b and R. Vuduc, a a Georgia Institute of Technology,

More information

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

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

Building Polygonal Maps from Laser Range Data

Building Polygonal Maps from Laser Range Data ECAI Int. Cognitive Robotics Worksho, Valencia, Sain, August 2004 Building Polygonal Mas from Laser Range Data Longin Jan Latecki and Rolf Lakaemer and Xinyu Sun and Diedrich Wolter Abstract. This aer

More information

COMP Parallel Computing. BSP (1) Bulk-Synchronous Processing Model

COMP Parallel Computing. BSP (1) Bulk-Synchronous Processing Model COMP 6 - Parallel Comuting Lecture 6 November, 8 Bulk-Synchronous essing Model Models of arallel comutation Shared-memory model Imlicit communication algorithm design and analysis relatively simle but

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

Multicast in Wormhole-Switched Torus Networks using Edge-Disjoint Spanning Trees 1

Multicast in Wormhole-Switched Torus Networks using Edge-Disjoint Spanning Trees 1 Multicast in Wormhole-Switched Torus Networks using Edge-Disjoint Sanning Trees 1 Honge Wang y and Douglas M. Blough z y Myricom Inc., 325 N. Santa Anita Ave., Arcadia, CA 916, z School of Electrical and

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

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

Optimization of Collective Communication Operations in MPICH

Optimization of Collective Communication Operations in MPICH To be ublished in the International Journal of High Performance Comuting Alications, 5. c Sage Publications. Otimization of Collective Communication Oerations in MPICH Rajeev Thakur Rolf Rabenseifner William

More information

Reducing Structural Bias in Technology Mapping

Reducing Structural Bias in Technology Mapping Reducing Structural Bias in Technology Maing S. Chatterjee A. Mishchenko R. Brayton Deartment of EECS U. C. Berkeley {satrajit, alanmi, brayton}@eecs.berkeley.edu X. Wang T. Kam Strategic CAD Labs Intel

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

Pivot Selection for Dimension Reduction Using Annealing by Increasing Resampling *

Pivot Selection for Dimension Reduction Using Annealing by Increasing Resampling * ivot Selection for Dimension Reduction Using Annealing by Increasing Resamling * Yasunobu Imamura 1, Naoya Higuchi 1, Tetsuji Kuboyama 2, Kouichi Hirata 1 and Takeshi Shinohara 1 1 Kyushu Institute of

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

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

Hardware-Accelerated Formal Verification

Hardware-Accelerated Formal Verification Hardare-Accelerated Formal Verification Hiroaki Yoshida, Satoshi Morishita 3 Masahiro Fujita,. VLSI Design and Education Center (VDEC), University of Tokyo. CREST, Jaan Science and Technology Agency 3.

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

SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1

SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1 SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin, Mohammad Ali Masnadi-Shirazi 1 1. Shiraz University, Shiraz, Iran,. Sabanci University, Istanbul, Turkey ssamadi@shirazu.ac.ir,

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

Construction of Irregular QC-LDPC Codes in Near-Earth Communications

Construction of Irregular QC-LDPC Codes in Near-Earth Communications Journal of Communications Vol. 9, No. 7, July 24 Construction of Irregular QC-LDPC Codes in Near-Earth Communications Hui Zhao, Xiaoxiao Bao, Liang Qin, Ruyan Wang, and Hong Zhang Chongqing University

More information

Cross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1,

Cross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1, CHAPTER 33 Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter

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

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

Clustered Regression Control of a Biped Robot Model

Clustered Regression Control of a Biped Robot Model 15 Clustered Regression Control of a Bied Robot Model Olli Haavisto and Heikki Hyötyniemi Helsinki University of Technology, Control Engineering Laboratory Finland Oen Access Database www.i-techonline.com

More information

EFFICIENT STOCHASTIC GRADIENT SEARCH FOR AUTOMATIC IMAGE REGISTRATION

EFFICIENT STOCHASTIC GRADIENT SEARCH FOR AUTOMATIC IMAGE REGISTRATION ISSN 76-459 Int j simul model 6 (7), 4-3 Original scientific aer EFFICIENT STOCHASTIC GRADIENT SEARCH FOR AUTOMATIC IMAGE REGISTRATION Li, Q.; Sato, I. & Murakami, Y. GSJ/AIST - National Institute of Advanced

More information

Sensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s

Sensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s Sensitivity two stage EOQ model 1 Sensitivity of multi-roduct two-stage economic lotsizing models and their deendency on change-over and roduct cost ratio s Frank Van den broecke, El-Houssaine Aghezzaf,

More information

Improved Image Super-Resolution by Support Vector Regression

Improved Image Super-Resolution by Support Vector Regression Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 3 August 5, 0 Imroved Image Suer-Resolution by Suort Vector Regression Le An and Bir Bhanu Abstract Suort

More information

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K. inuts er clock cycle Streaming ermutation oututs er clock cycle AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS Ren Chen and Viktor K.

More information

A Model-Adaptable MOSFET Parameter Extraction System

A Model-Adaptable MOSFET Parameter Extraction System A Model-Adatable MOSFET Parameter Extraction System Masaki Kondo Hidetoshi Onodera Keikichi Tamaru Deartment of Electronics Faculty of Engineering, Kyoto University Kyoto 66-1, JAPAN Tel: +81-7-73-313

More information

Effective Heuristic and Metaheuristic Approaches to Optimize Component Placement in Printed Circuit Board Assembly

Effective Heuristic and Metaheuristic Approaches to Optimize Component Placement in Printed Circuit Board Assembly Effective Heuristic and Metaheuristic Aroaches to Otimize Comonent Placement in Printed Circuit Board Assembly Edmund K. Burke University of Nottingham School of Comuter Science & IT Jubilee Camus Nottingham

More information

P Z. parametric surface Q Z. 2nd Image T Z

P Z. parametric surface Q Z. 2nd Image T Z Direct recovery of shae from multile views: a arallax based aroach Rakesh Kumar. Anandan Keith Hanna Abstract Given two arbitrary views of a scene under central rojection, if the motion of oints on a arametric

More information

Efficient Sequence Generator Mining and its Application in Classification

Efficient Sequence Generator Mining and its Application in Classification Efficient Sequence Generator Mining and its Alication in Classification Chuancong Gao, Jianyong Wang 2, Yukai He 3 and Lizhu Zhou 4 Tsinghua University, Beijing 0084, China {gaocc07, heyk05 3 }@mails.tsinghua.edu.cn,

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

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

Applying the fuzzy preference relation to the software selection

Applying the fuzzy preference relation to the software selection Proceedings of the 007 WSEAS International Conference on Comuter Engineering and Alications, Gold Coast, Australia, January 17-19, 007 83 Alying the fuzzy reference relation to the software selection TIEN-CHIN

More information

Cooperative Diversity Combined with Beamforming

Cooperative Diversity Combined with Beamforming Cooerative Diversity Combined with Beamforming Hyunwoo Choi and Jae Hong Lee School of Electrical Engineering and INMC Seoul National University Seoul, Korea Email: {novo28, jhlee}@snu.ac.kr Abstract In

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

Implementation of Evolvable Fuzzy Hardware for Packet Scheduling Through Online Context Switching

Implementation of Evolvable Fuzzy Hardware for Packet Scheduling Through Online Context Switching Imlementation of Evolvable Fuzzy Hardware for Packet Scheduling Through Online Context Switching Ju Hui Li, eng Hiot Lim and Qi Cao School of EEE, Block S Nanyang Technological University Singaore 639798

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

2-D Fir Filter Design And Its Applications In Removing Impulse Noise In Digital Image

2-D Fir Filter Design And Its Applications In Removing Impulse Noise In Digital Image -D Fir Filter Design And Its Alications In Removing Imulse Noise In Digital Image Nguyen Thi Huyen Linh 1, Luong Ngoc Minh, Tran Dinh Dung 3 1 Faculty of Electronic and Electrical Engineering, Hung Yen

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

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

10. Parallel Methods for Data Sorting

10. Parallel Methods for Data Sorting 10. Parallel Methods for Data Sorting 10. Parallel Methods for Data Sorting... 1 10.1. Parallelizing Princiles... 10.. Scaling Parallel Comutations... 10.3. Bubble Sort...3 10.3.1. Sequential Algorithm...3

More information

An accurate and fast point-to-plane registration technique

An accurate and fast point-to-plane registration technique Pattern Recognition Letters 24 (23) 2967 2976 www.elsevier.com/locate/atrec An accurate and fast oint-to-lane registration technique Soon-Yong Park *, Murali Subbarao Deartment of Electrical and Comuter

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

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

Information Flow Based Event Distribution Middleware

Information Flow Based Event Distribution Middleware Information Flow Based Event Distribution Middleware Guruduth Banavar 1, Marc Kalan 1, Kelly Shaw 2, Robert E. Strom 1, Daniel C. Sturman 1, and Wei Tao 3 1 IBM T. J. Watson Research Center Hawthorne,

More information

Collective Communication: Theory, Practice, and Experience. FLAME Working Note #22

Collective Communication: Theory, Practice, and Experience. FLAME Working Note #22 Collective Communication: Theory, Practice, and Exerience FLAME Working Note # Ernie Chan Marcel Heimlich Avi Purkayastha Robert van de Geijn Setember, 6 Abstract We discuss the design and high-erformance

More information

MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT. Jian Zhao and Sen-ching S. Cheung

MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT. Jian Zhao and Sen-ching S. Cheung MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT Jian Zhao and Sen-ching S. Cheung University of Kentucky Center for Visualization and Virtual Environment 1 Quality Street, Suite

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

A simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect

A simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect A simulated Linear Mixture Model to Imrove Classification Accuracy of Satellite Data Utilizing Degradation of Atmosheric Effect W.M Elmahboub Mathematics Deartment, School of Science, Hamton University

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