GIS CUP 13 – Team Project. Introduction GIS-focused algorithm competition The 2013 contest is about geo-fencing location-based advertisements child location.

Slides:

Advertisements

Similar presentations

A Survey of Program Slicing Techniques A Survey of Program Slicing Techniques Sections 3.1,3.6 Swathy Shankar

Advertisements

Contest format 5 hours, around 8-12 problems One computer running (likely)Linux, plus printer 3 people on one machine No cell phones, calculators, USB.

NSF DUE ; Module 4.3. NSF DUE ; GeoTEd Partners Module name and number.

GIS CUP Geo - Fencing ● Virtual perimeter for a real world geographic area ● Widely used in location based services ● Location based advertisements.

Example 1 Define the Variables: Let l = length of package g = girth of package Two variables – two inequalities: Graph each inequality. Don’t forget to.

Local Programming Contest Overview John Paxton October 25, 2006.

1 Abstract This study presents an analysis of two modified fuzzy ARTMAP neural networks. The modifications are first introduced mathematically. Then, the.

MCell Usage Scenario Project #7 CSE 260 UCSD Nadya Williams

Chapter 1 pp 1-14 Properties of Algorithms Pseudocode.

Investigation of TDMA solution for the hidden terminal problem (With “ Wavion ” ) Final Report Presentation.

©2005 Austin Troy Lecture 9: Introduction to GIS 1.Vector Geoprocessing Lecture by Austin Troy, University of Vermont.

@ 2007 Austin Troy. Geoprocessing Introduction to GIS Geoprocessing is the processing of geographic information. Perform spatial analysis and modeling.

[GISCUP2013] Mailing List Q&A + Project Discussion Ashok Dahal.

Title 1 Software Linked Interactive Competitive Environment Acceptance Test April 26 th, 2012.

School of Geography FACULTY OF ENVIRONMENT Introduction to ArcToolbox and Geoprocessing.

LAS To WITSML Conversion Utility Presented at POSC Regional SIG meeting Stavanger, June 2006 by POSC & Satyam Computer Services Ltd.

1. The Role of the Algorithms in Computer Algorithms – 1/2 Algorithm: Any well-defined computation procedure that takes some value, or set of values,

Solving Problems Quickly UAkron Programming Team January 20, 2012.

An Introduction to Programming with C++ Sixth Edition Chapter 7 The Repetition Structure.

A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.

ACM reminders October HMC Mock contest 9: :30 November regional contest This is the next ACM meeting !! Contest-like problems dynamic.

Spatial Query Processing Spatial DBs do not have a set of operators that are considered to be basic elements in a query evaluation. Spatial DBs handle.

NR 143 Study Overview: part 1 By Austin Troy University of Vermont Using GIS-- Introduction to GIS.

IR Homework #1 By J. H. Wang Mar. 5, Programming Exercise #1: Indexing Goal: to build an index for a text collection using inverted files Input:

Introduction of Geoprocessing Lecture 9. Geoprocessing  Geoprocessing is any GIS operation used to manipulate data. A typical geoprocessing operation.

Reactive and Output-Only HKOI Training Team 2006 Liu Chi Man (cx) 11 Feb 2006.

Chapter 17 - Clients + Servers = Distributed Computing Introduction Large Computers Use Networks For Input and Output Small Computers Use Networks To Interact.

Chapter 15 I’m on the Inside; You’re on the Outside (Nested Loops) Clearly Visual Basic: Programming with Visual Basic nd Edition.

The Art of Programming. The process of breaking problems down into smaller, manageable parts By breaking the problem down, each part becomes more specific.

Introduction to IEEE ICDM Data Mining Contest (ICDM DMC 2007)

Introduction to Geographic Information Systems Fall 2013 (INF 385T-28620) Dr. David Arctur Research Fellow, Adjunct Faculty University of Texas at Austin.

Automatically creates landscape classes from yield data elevation points. This allows for comparison of yield, landscape class, and soil type.

Algorithm Design Techniques An Example The Problem Algorithm 1: Cubic Time Algorithm 2: Quadratic Time Algorithm 3: O(n log n) Time Algorithm 4: Linear.

Sound Monitor KS2: Design, write and debug programs which control physical systems.

Uniq The uniq command is useful when you need to find duplicate lines in a file. The basic format of the command is uniq in_file out_file In this format,

Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,

What Geofencing Is (Why You Should Be Using It) Presented By Mohammad Mirza & Saif Alharthi Team 3 CSCI 5715 Acknowledgement

NS-2 Training 12/12/2011. Introduction  NS-2: Network Simulator Generation 2  Latest Release: 2.35 / Nov. 4, 2011 

An Introduction to Programming with C++ Sixth Edition Chapter 8 More on the Repetition Structure.

Programming Competitions. USA Computing Olympiad ace.delos.com/usacogate You need to create an account (use KITE address) to gain access. Solution.

Graphing a System of Inequalities

Data Structures and Algorithms

Spatial Analysis and Functions

Improving Test Suites for Efficient Fault Localization

Algorithms Take a look at the worksheet. What do we already know, and what will we have to learn in this term?

VOCABULARY! EXAMPLES! Relation: Domain: Range: Function:

Global Challenge Flashing Wheels Lesson 3.

Global Challenge Love Heart Lesson 3.

Global Challenge Love Heart Lesson 3.

Global Challenge Flashing Wheels Lesson 3.

Global Challenge Love Heart Lesson 3.

Global Challenge Love Heart Lesson 3.

Global Challenge Flashing Wheels Lesson 3.

Vector Geoprocessing.

Identrics – Team Vistula

Project Presentation 8 minutes min, 10 minutes max

Global Challenge Flashing Wheels Lesson 3.

Global Challenge Love Heart Lesson 3.

Learning Intention I will learn about the different types of programming errors.

Global Challenge Love Heart Lesson 3.

Introduction to Python

Global Challenge Love Heart Lesson 3.

Genome 540: Discussion Section Week 3

Basics Prof. Hsin-Mu (Michael) Tsai (蔡欣穆)

Global Challenge Flashing Wheels Lesson 3.

Global Challenge Flashing Wheels Lesson 3.

Global Challenge Love Heart Lesson 3.

Global Challenge Love Heart Lesson 3.

Global Challenge Flashing Wheels Lesson 3.

Presentation transcript:

GIS CUP 13 – Team Project

Introduction GIS-focused algorithm competition The 2013 contest is about geo-fencing location-based advertisements child location services Each group needs to submit their source code and program outputs. Program can also be submitted in the GIS CUP competition.

Problem Definition Input: A set of possibly overlapping regions (polygons with and without interior rings) and a set of points. Output: Pair each input point with one or more of the input polygons such that a given spatial condition is satisfied between the polygon and the point. Points  max 1 million and Regions  max 500. spatial predicates: INSIDE WITHIN n

Problem Definition contd. The input points are associated with an ID and the same point might appear multiple times in the input (moving points). Each instance of the input point may appear zero or more times in the output. Different instances of the input point may be associated with different polygons in the output. The polygons are also associated with a unique ID (moving regions). The points should always look at the latest position of the polygon to find the right association.

Evaluation Criteria 1.The time to process all the input data will be the main criterion for the evaluation of the solution. 2.The accuracy of the result. Example: If you process all the input points in 5 minutes but only 1000 points are accurately associated with the right polygon, then the rate will be 1000 points per 5 minutes. For a test run, one of the predicates (INSIDE|WITHIN n) will be tested. There will be several test runs with different sets of input points and polygons. And the rate of processing of the points is averaged over all the test runs.

Example Geofence Point format: POINT:ID:Sequence: Polygon format: POLYGON:ID:Sequence: Output file format: ID:Sequence::ID:Sequence Command example: Geofence INSIDE points.txt polygons.txt out.txt

Example contd. Points in points.txt file: POINT:1:501: 1.0,1.0 POINT:2:502: 100.0,1.0 POINT:1:503: 2.0,1.0 POINT:1:504: 11.0,1.0

Example contd. Polygons in polygons.txt file POLYGON:1:1: 0.0, , , , ,0.0 POLYGON:2:2: 20.0, , , , , , , , ,21.0 POLYGON:1:503: 10.0, , , , ,0.0

Example contd. Correct output in output.txt file 1:501::1:1 1:503::1:1 1:504::1:503

Questions?