A Visualization Model Based on Adjacency Data
|
|
- Megan Goodman
- 5 years ago
- Views:
Transcription
1 A Visualization Model Based on Adjacency Data by Edward Condon Bruce Golden S. Lele S. aghavan Edward Wasil Presented at Miami Beach INFOMS Conference Nov.
2 Focus of Paper The focus of this paper will be on a visualization project based on adjacency data (Fiske data) The paper illustrates the power of visualization Visualization generates insights and impact
3 Motivation Typically, data are provided in multidimensional format A large table where the rows represent countries and the columns represent socio-economic variables Alternatively, data may be provided in adjacency format Consumers who buy item a are likely to buy or consider buying items b, c, and d also Students who apply to college a are likely to apply to colleges b, c, and d also
4 Motivation -- continued More on adjacency If the purchase of item i results in the recommendation of item j, then item j is adjacent to item i Adjacency data for n alternatives can be summarized in an n x n adjacency matrix, A = (a ij ), where a ij = if item j is adjacent to item i, and otherwise Adjacency is not necessarily symmetric
5 Motivation -- continued Adjacency indicates a notion of similarity Given adjacency data w.r.t. n items or alternatives, can we display the items in a two-dimensional map? Traditional tools such as multidimensional scaling and Sammon maps work well with data in multidimensional format Can these tools work well with adjacency data? 4
6 Sammon Map of World Poverty Data Set (World Bank, 99) 5
7 Obtaining Distances from Adjacency Data How can we use linkage information to determine distances? c a b items adjacent to a items adjacent to b d items adjacent to c e items adjacent to d 6
8 Obtaining Distances from Adjacency Data -- continued. Start with the n x n - asymmetric adjacency matrix. Convert the adjacency matrix to a directed graph Create a node for each item (n nodes) Create a directed arc from node i to node j if a ij =. Compute distance measures Each arc has a length of Compute the all-pairs shortest path distance matrix D The distance from node i to node j is d ij 7
9 4. Modify the distance matrix D, to obtain a final distance matrix X Symmetry Disconnected components Example Obtaining Distances from Adjacency Data -- continued A = 5 6 4
10 Find shortest paths between all pairs of nodes to obtain D Average d ij and d ji to arrive at a symmetric distance matrix X Example -- continued = D = X
11 Example A and B are strongly connected components The graph below is weakly connected There are paths from A to B, but none from B to A MDS and Sammon maps require that distances be finite A B
12 Ensuring Finite and Symmetric Basic idea: simply replace all infinite distances with a large finite value, say If is too large The points within each strongly connected component will be pushed together in the map Within-component relationships will be difficult to see If is too small Distances Distinct components (e.g., A and B) may blend together in the map
13 Ensuring Finite and Symmetric Distances -- continued must be chosen carefully (see Technical eport) This leads to a finite distance matrix D Next, we obtain the final distance matrix X where x = x = + ij ji ( d d )/ X becomes input to a Sammon map or MDS procedure ij ji
14 Application: College Selection Data source: The Fiske Guide to Colleges, edition Contains information on colleges Approx. 75 pages Loaded with statistics and ratings For each school, its biggest overlaps are listed Overlaps: the colleges and universities to which its applicants are also applying in greatest numbers and which thus represent its major competitors
15 Overlaps and the Adjacency Matrix Penn s overlaps are Harvard, Princeton, Yale, Cornell, and Brown Harvard s overlaps are Princeton, Yale, Stanford, M.I.T., and Brown Note the lack of symmetry Harvard is adjacent to Penn, but not vice versa 4
16 Proof of Concept Start with colleges and the associated adjacency matrix From the directed graph, several strongly connected components emerge We focus on the four largest to test the concept ( schools) Component A has 74 schools Component B has southern colleges Component C has 8 mainly Ivy League colleges Component D has 7 California universities 5
17 B B B B B 4 B 8 B B 7 B 6 B 5 B 9 A 8 A A A 4 4 A 4 A A 5 A 5 A 6 7 A 5 7 A 5 8 A 6 A 9 A 6 4 A 9 A A 5 5 A 6 A 5 A 9 A 6 A 4 A 4 A 7 A 7 A A 4 5 A 9 A 7 A 6 8 A 4 7 A A 6 5 A 6 6 A 7 A 7 4 A A A 5 A 4 A 4 8 A 6 A A 4 9 A 6 A 4 6 A 5 A 4 A A 6 A 6 A 5 A 5 C 5 C A 6 9 C 4 C 6 C C 8 C C 7 A 4 A 6 A A 7 A 5 9 A A 4 D D 6 A 8 D 4 D 5 A 5 6 D 7 D D A 4 A A 7 A 8 A A 5 A 5 4 A A 7 A 7 A 8 Sammon Map with Each School Labeled by its Component Identifier 6
18 S C A L T N S C S C G A A L G A F L F L F L P A V A P A P A N C N J V A P A N C N J T N M D V A V A N C G A D E V A V A V A D C M A P A N Y M A N J C T M A C A I N Y M A M A M A P A M E M E M E P A P A P A N Y IN M I IN M I M O IL IL W I IN M A M A M A M A C T N H V T N Y N Y M N M N C A IA O H O C A C A C A V T W I M N IA IA A Z C O O C A C A C A W A C O A Z O O W A O W A C O Sammon Map with Each School Labeled by its Geographical Location 7
19 Sammon Map with Each School Labeled by its Designation ( Public () or Private () ) 8
20 Sammon Map with Each School Labeled by its Cost 9
21 Sammon Map with Each School Labeled by its Academic Quality
22 A45 A65 A66 A7 C5 C C8 C C7 C NC VA VA VA PA NY CT MA CA I A9 GA A A6 DC MA A68 A5 A4 A MO MA NY NY (a) Identifier (b) State (c) Public or private (d) Cost NC VPI VAW&M Penn Cornell Yale Harvard Stanford Brown Emory Georgetown Tufts Wash BC NY Barnard (e) Academics (f) School name Six Panels Showing Zoomed Views of Schools that are Neighbors of Tufts niversity
23 Benefits of Visualization Adjacency (overlap) data provides local information only E.g., which schools are Maryland s overlaps? With visualization, global information is more easily conveyed E.g., which schools are similar to Maryland?
24 Benefits of Visualization -- continued Within group (strongly connected component) and between group relationships are displayed at same time A variety of what-if questions can be asked and answered using maps Based on this concept, a web-based DSS for college selection is easy to envision
25 Conclusions The approach represents a nice application of shortest paths to data visualization The resulting maps convey more information than is immediately available in The Fiske Guide Visualization encourages what-if analysis of the data Can be applied in other settings (e.g., web-based recommender systems) 4
An Example of Visualization in Data Mining
An Example of Visualization in Data Mining by Bruce L. Golden. H. Smith School of Business niversity of Maryland College Park, MD 74 Presented at Netcentricity Symposium // Data Mining Overview Data mining
More informationLecture 26 Section 8.4. Mon, Oct 13, 2008
Lecture 26 Section 8.4 Hampden-Sydney College Mon, Oct 13, 2008 Outline 1 2 3 4 Exercise 8.12, page 528. Suppose that 60% of all students at a large university access course information using the Internet.
More informationCALCULUS SEVENTH EDITION. Indiana Academic Standards for Calculus. correlated to the CC2
CALCULUS SEVENTH EDITION correlated to the Indiana Academic Standards for Calculus CC2 6/2003 2002 Introduction to Calculus, 7 th Edition 2002 by Roland E. Larson, Robert P. Hostetler, Bruce H. Edwards
More informationNetworks as vectors of their motif frequencies and 2-norm distance as a measure of similarity
Networks as vectors of their motif frequencies and 2-norm distance as a measure of similarity CS322 Project Writeup Semih Salihoglu Stanford University 353 Serra Street Stanford, CA semih@stanford.edu
More informationCouncil on East Asian Libraries Statistics For North American Institutions (Revised)
Journal of East Asian Libraries Volume 2019 Number 168 Article 5 2-2019 Council on East Asian Libraries Statistics 2017-2018 For North American Institutions (Revised) Vickie Fu Doll Wen-ling Liu Indiana
More informationBounds on parameters of minimally non-linear patterns
Bounds on parameters of minimally non-linear patterns P.A. CrowdMath Department of Mathematics Massachusetts Institute of Technology Massachusetts, U.S.A. crowdmath@artofproblemsolving.com Submitted: Jan
More informationMs. York s AP Calculus AB Class Room #: Phone #: Conferences: 11:30 1:35 (A day) 8:00 9:45 (B day)
Ms. York s AP Calculus AB Class Room #: 303 E-mail: hyork3@houstonisd.org Phone #: 937-239-3836 Conferences: 11:30 1:35 (A day) 8:00 9:45 (B day) Course Outline By successfully completing this course,
More informationAnalyzing Severe Weather Data
Chapter Weather Patterns and Severe Storms Investigation A Analyzing Severe Weather Data Introduction Tornadoes are violent windstorms associated with severe thunderstorms. Meteorologists carefully monitor
More information2 Notation and Preliminaries
On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound Ratnesh Kumar Haomin Li epartment of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Abstract We show that
More informationCSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68
CSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68 References 1 L. Freeman, Centrality in Social Networks: Conceptual Clarification, Social Networks, Vol. 1, 1978/1979, pp. 215 239. 2 S. Wasserman
More informationWeek 4. (1) 0 f ij u ij.
Week 4 1 Network Flow Chapter 7 of the book is about optimisation problems on networks. Section 7.1 gives a quick introduction to the definitions of graph theory. In fact I hope these are already known
More informationAP Calculus AB Course Outline
AP Calculus AB Course Outline Prerequisite: Satisfactory completion of: Geometry, Algebra II, and Pre-calculus Advanced Placement Calculus AB is designed as college-level Calculus I. Students are required
More informationYour Galactic Address
How Big is the Universe? Usually you think of your address as only three or four lines long: your name, street, city, and state. But to address a letter to a friend in a distant galaxy, you have to specify
More information2/25/2019. Taking the northern and southern hemispheres together, on average the world s population lives 24 degrees from the equator.
Where is the world s population? Roughly 88 percent of the world s population lives in the Northern Hemisphere, with about half north of 27 degrees north Taking the northern and southern hemispheres together,
More informationA Generalization of Wigner s Law
A Generalization of Wigner s Law Inna Zakharevich June 2, 2005 Abstract We present a generalization of Wigner s semicircle law: we consider a sequence of probability distributions (p, p 2,... ), with mean
More information2003 National Name Exchange Annual Report
2003 National Name Exchange Annual Report Executive Summary 28 th annual meeting Hilton, University of Florida Conference Center April 16, 2004 Hosted by the University of Florida http://www.grad.washington.edu/nameexch/national/
More informationWEAKLY AND STRONGLY POLYNOMIAL ALGORITHMS FOR COMPUTING THE MAXIMUM DECREASE IN UNIFORM ARC CAPACITIES
Yugoslav Journal of Operations Research 6 (016), Number, 159 171 DOI: 10.98/YJOR14117015G WEAKLY AND STRONGLY POLYNOMIAL ALGORITHMS FOR COMPUTING THE MAXIMUM DECREASE IN UNIFORM ARC CAPACITIES Mehdi GHIYASVAND
More informationUniversity of Maryland Wave Diagnostic Test
University of Maryland Wave Diagnostic Test Department of Physics University of Maryland, College Park MD 20742-4111 http://www.physics.umd.edu/rgroups/ripe/perg/ Administering the UMd Wave Diagnostic
More informationForecasting the 2012 Presidential Election from History and the Polls
Forecasting the 2012 Presidential Election from History and the Polls Drew Linzer Assistant Professor Emory University Department of Political Science Visiting Assistant Professor, 2012-13 Stanford University
More informationRelations, Functions, and Sequences
MCS-236: Graph Theory Handout #A3 San Skulrattanakulchai Gustavus Adolphus College Sep 13, 2010 Relations, Functions, and Sequences Relations An ordered pair can be constructed from any two mathematical
More informationCouncil on East Asian Libraries Statistics:
Journal of East Asian Libraries Volume 2012 Number 154 Article 6 2-1-2012 Council on East Asian Libraries Statistics: 2010-2011 Vickie Fu Doll Calvin Hsu Wen-ling Liu Follow this and additional works at:
More informationMatrices and Vectors
Matrices and Vectors James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 11, 2013 Outline 1 Matrices and Vectors 2 Vector Details 3 Matrix
More informationIN Indiana Indiana Academic Standards
IN Indiana Indiana Academic Standards Indiana Academic Standards for Grade 3 History Students describe how significant people, events and developments have shaped their own community and region; compare
More informationCouncil on East Asian Libraries Statistics For North American Institutions
Council on East Asian Libraries Statistics 2008-2009 For North American Institutions Collected and Compiled by the CEAL Statistics Committee, 2008-2009 Vickie Fu Doll, Chair
More informationCluster Analysis. Part of the Michigan Prosperity Initiative
Cluster Analysis Part of the Michigan Prosperity Initiative 6/17/2010 Land Policy Institute Contributors Dr. Soji Adelaja, Director Jason Ball, Visiting Academic Specialist Jonathon Baird, Research Assistant
More informationAn Introduction to Algebraic Graph Theory
An Introduction to Algebraic Graph Theory Rob Beezer beezer@ups.edu Department of Mathematics and Computer Science University of Puget Sound Mathematics Department Seminar Pacific University October 9,
More informationMath 5490 Network Flows
Math 90 Network Flows Lecture 8: Flow Decomposition Algorithm Stephen Billups University of Colorado at Denver Math 90Network Flows p./6 Flow Decomposition Algorithms Two approaches to modeling network
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA 2 Department of Computer
More information7.5 Bipartite Matching
7. Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E is a matching if each node appears in at most edge in M. Max matching: find a max cardinality matching. Bipartite Matching
More informationISSN: (Online) Volume 3, Issue 5, May 2015 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 3, Issue 5, May 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at:
More informationCouncil on East Asian Libraries Statistics For North American Institutions
Journal of East Asian Libraries Volume 2017 Number 164 Article 3 2-2017 Council on East Asian Libraries Statistics 2015-2016 For North American Institutions Follow this and additional works at: https://scholarsarchive.byu.edu/jeal
More informationmax bisection max cut becomes max bisection if we require that It has many applications, especially in VLSI layout.
max bisection max cut becomes max bisection if we require that S = V S. It has many applications, especially in VLSI layout. c 2011 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 330 max bisection
More informationACE Transfer Credit Packet Your Guide to Earning ACE Credit for StraighterLine Courses
ACE Transfer Credit Packet Your Guide to Earning ACE Credit for StraighterLine Courses What You Need To Know Before You Start Finding out if your college or university will award credit for a course at
More informationMarkov Chains Handout for Stat 110
Markov Chains Handout for Stat 0 Prof. Joe Blitzstein (Harvard Statistics Department) Introduction Markov chains were first introduced in 906 by Andrey Markov, with the goal of showing that the Law of
More informationChapter 7. Network Flow. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 7 Network Flow Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 7.5 Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E is a matching
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,, Bi Li a,b, Nicolas Nisse a, Hervé Rivano c, Min-Li Yu d a Coati Project, INRIA I3S(CNRS/UNSA), Sophia
More information7. Shortest Path Problems and Deterministic Finite State Systems
7. Shortest Path Problems and Deterministic Finite State Systems In the next two lectures we will look at shortest path problems, where the objective is to find the shortest path from a start node to an
More information22 cities with at least 10 million people See map for cities with red dots
22 cities with at least 10 million people See map for cities with red dots Seven of these are in LDC s, more in future Fastest growing, high natural increase rates, loss of farming jobs and resulting migration
More informationQuadratic and Other Inequalities in One Variable
Quadratic and Other Inequalities in One Variable If a quadratic equation is not in the standard form equaling zero, but rather uses an inequality sign ( , ), the equation is said to be a quadratic
More informationSummary of Calendar Possibilities
Summary of Calendar Possibilities March 1, 2017 What we have: Two possible fall calendar frameworks and four possible spring calendar frameworks. What we need: Indications from the community as to which
More informationEvolution Strategies for Optimizing Rectangular Cartograms
Evolution Strategies for Optimizing Rectangular Cartograms Kevin Buchin 1, Bettina Speckmann 1, and Sander Verdonschot 2 1 TU Eindhoven, 2 Carleton University September 20, 2012 Sander Verdonschot (Carleton
More informationThe Hydrogen Atom Student Guide
Name: The Hydrogen Atom Student Guide Background Material Carefully read the background pages entitled Energy Levels, Light, and Transitions and answer the following questions to check your understanding.
More informationChapter 7 Network Flow Problems, I
Chapter 7 Network Flow Problems, I Network flow problems are the most frequently solved linear programming problems. They include as special cases, the assignment, transportation, maximum flow, and shortest
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More informationPre-lab Quiz/PHYS 224 Electric Field and Electric Potential (A) Your name Lab section
Pre-lab Quiz/PHYS 224 Electric Field and Electric Potential (A) Your name Lab section 1. What do you investigate in this lab? 2. In a uniform electric field between two parallel plates, a potential probe
More informationCouncil on East Asian Libraries Statistics For North American Institutions
Council on East Asian Libraries Statistics 2006-2007 For North American Institutions Collected and Compiled by the CEAL Statistics Committee, 2006-2007 Vickie Fu Doll, Chair
More informationNesting and Mixed Effects: Part I. Lukas Meier, Seminar für Statistik
Nesting and Mixed Effects: Part I Lukas Meier, Seminar für Statistik Where do we stand? So far: Fixed effects Random effects Both in the factorial context Now: Nested factor structure Mixed models: a combination
More informationUse your text to define the following term. Use the terms to label the figure below. Define the following term.
Mapping Our World Section. and Longitude Skim Section of your text. Write three questions that come to mind from reading the headings and the illustration captions.. Responses may include questions about
More informationLink to related Solstice article: Sum-graph article, Arlinghaus, Arlinghaus, and Harary.
Link to related Solstice article: http://www-personal.umich.edu/~sarhaus/image/sols193.html, Sum-graph article, Arlinghaus, Arlinghaus, and Harary. A GRAPH THEORETIC VIEW OF THE JOIN-COUNT STATISTIC Sandra
More informationCOURSE OUTLINE. d) summarize the economic impacts of air pollution on society, and
CALIFORNIA STATE POLYTECHNIC UNIVERSITY, POMONA Course Title: Seminar in Air Resource Economics EC 436 Date of Preparation: May 2009 Prepared by: Anne Bresnock COURSE OUTLINE I. Catalog Description EC
More information1 Undirected Graphical Models. 2 Markov Random Fields (MRFs)
Machine Learning (ML, F16) Lecture#07 (Thursday Nov. 3rd) Lecturer: Byron Boots Undirected Graphical Models 1 Undirected Graphical Models In the previous lecture, we discussed directed graphical models.
More informationScience Olympiad Circuit Lab
Science Olympiad Circuit Lab Key Concepts Circuit Lab Overview Circuit Elements & Tools Basic Relationships (I, V, R, P) Resistor Network Configurations (Series & Parallel) Kirchhoff s Laws Examples Glossary
More informationStatistical Mechanics of Money, Income, and Wealth
Statistical Mechanics of Money, Income, and Wealth Victor M. Yakovenko Adrian A. Dragulescu and A. Christian Silva Department of Physics, University of Maryland, College Park, USA http://www2.physics.umd.edu/~yakovenk/econophysics.html
More informationMath 239: Discrete Mathematics for the Life Sciences Spring Lecture 14 March 11. Scribe/ Editor: Maria Angelica Cueto/ C.E.
Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 14 March 11 Lecturer: Lior Pachter Scribe/ Editor: Maria Angelica Cueto/ C.E. Csar 14.1 Introduction The goal of today s lecture
More informationLevel 1 Geography PROGRAMME OVERVIEW 2014
Ruawai College Social Sciences Department Level 1 Geography PROGRAMME OVERVIEW 2014 Topic/Theme EXTREME NATURAL EVENTS: TSUNAMIS Case Study: 2004 Indian Ocean Tsunami/Boxin g Day Tsunami, Indian Ocean
More informationParametric Test. Multiple Linear Regression Spatial Application I: State Homicide Rates Equations taken from Zar, 1984.
Multiple Linear Regression Spatial Application I: State Homicide Rates Equations taken from Zar, 984. y ˆ = a + b x + b 2 x 2K + b n x n where n is the number of variables Example: In an earlier bivariate
More informationComputational Aspects of Aggregation in Biological Systems
Computational Aspects of Aggregation in Biological Systems Vladik Kreinovich and Max Shpak University of Texas at El Paso, El Paso, TX 79968, USA vladik@utep.edu, mshpak@utep.edu Summary. Many biologically
More informationTransition Guide TRANSITION GUIDE FOR CALCULUS NINTH EDITION BY LARSON, EDWARDS (PART I) General Changes to Calculus Ninth Edition
TRANSITION GUIDE FOR CALCULUS NINTH EDITION BY LARSON, EDWARDS (PART I) General Changes to Calculus Ninth Edition The Chapter Openers have been revised. The graphing overview of the chapter is picked up
More informationAustralian National University WORKSHOP ON SYSTEMS AND CONTROL
Australian National University WORKSHOP ON SYSTEMS AND CONTROL Canberra, AU December 7, 2017 Australian National University WORKSHOP ON SYSTEMS AND CONTROL A Distributed Algorithm for Finding a Common
More informationEigenvectors Via Graph Theory
Eigenvectors Via Graph Theory Jennifer Harris Advisor: Dr. David Garth October 3, 2009 Introduction There is no problem in all mathematics that cannot be solved by direct counting. -Ernst Mach The goal
More informationMultiway Analysis of Bridge Structural Types in the National Bridge Inventory (NBI) A Tensor Decomposition Approach
Multiway Analysis of Bridge Structural Types in the National Bridge Inventory (NBI) A Tensor Decomposition Approach By Offei A. Adarkwa Nii Attoh-Okine (Ph.D) (IEEE Big Data Conference -10/27/2014) 1 Presentation
More informationDefinition (The carefully thought-out calculus version based on limits).
4.1. Continuity and Graphs Definition 4.1.1 (Intuitive idea used in algebra based on graphing). A function, f, is continuous on the interval (a, b) if the graph of y = f(x) can be drawn over the interval
More informationPrentice Hall: Algebra 2 with Trigonometry 2006 Correlated to: California Mathematics Content Standards for Trigonometry (Grades 9-12)
California Mathematics Content Standards for Trigonometry (Grades 9-12) Trigonometry uses the techniques that students have previously learned from the study of algebra and geometry. The trigonometric
More informationCS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Recap Network Flow Problems Max-Flow Min Cut Theorem Ford Fulkerson Augmenting Paths Residual Flow Graph Integral Solutions
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationFairfield Public Schools
Mathematics Fairfield Public Schools AP Calculus BC AP Calculus BC BOE Approved 04/08/2014 1 AP CALCULUS BC Critical Areas of Focus Advanced Placement Calculus BC consists of a full year of college calculus.
More informationLecture 4: An FPTAS for Knapsack, and K-Center
Comp 260: Advanced Algorithms Tufts University, Spring 2016 Prof. Lenore Cowen Scribe: Eric Bailey Lecture 4: An FPTAS for Knapsack, and K-Center 1 Introduction Definition 1.0.1. The Knapsack problem (restated)
More informationA GIS helps you answer questions and solve problems by looking at your data in a way that is quickly understood and easily shared.
WHAT IS GIS? A geographic information system (GIS) integrates hardware, software, and data for capturing, managing, analyzing, and displaying all forms of geographically referenced information. GIS allows
More informationChapter 29 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M.
29 Markov Chains Definition of a Markov Chain Markov chains are one of the most fun tools of probability; they give a lot of power for very little effort. We will restrict ourselves to finite Markov chains.
More informationGrade 2 Social Studies
Grade 2 Social Studies Social Studies Grade(s) 2nd Course Overview This course provides an opportunity for students to explore their community and how communities operate. Scope And Sequence Timeframe
More information1 Random Walks and Electrical Networks
CME 305: Discrete Mathematics and Algorithms Random Walks and Electrical Networks Random walks are widely used tools in algorithm design and probabilistic analysis and they have numerous applications.
More informationThe core of solving constraint problems using Constraint Programming (CP), with emphasis on:
What is it about? l Theory The core of solving constraint problems using Constraint Programming (CP), with emphasis on: l Modeling l Solving: Local consistency and propagation; Backtracking search + heuristics.
More informationSOCIAL STUDIES GRADE 6. I Can Checklist REGIONS AND PEOPLE OF THE EASTERN HEMISPHERE. Office of Teaching and Learning Curriculum Division
SOCIAL STUDIES REGIONS AND PEOPLE OF THE EASTERN HEMISPHERE GRADE 6 I Can Checklist 2018-2019 Aligned with Ohio s Learning Standards for Social Studies Office of Teaching and Learning Curriculum Division
More informationWhat Have We Learned from Reverse-Engineering the Internet s Inter-domain Routing Protocol?
What Have We Learned from Reverse-Engineering the Internet s Inter-domain Routing Protocol? Timothy G. Griffin Computer Laboratory University of Cambridge, UK timothy.griffin@cl.cam.ac.uk Advanced Networks
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationIn matrix algebra notation, a linear model is written as
DM3 Calculation of health disparity Indices Using Data Mining and the SAS Bridge to ESRI Mussie Tesfamicael, University of Louisville, Louisville, KY Abstract Socioeconomic indices are strongly believed
More informationInvestigating Weather and Climate with Google Earth Teacher Guide
Google Earth Weather and Climate Teacher Guide In this activity, students will use Google Earth to explore global temperature changes. They will: 1. Use Google Earth to determine how the temperature of
More informationCS 598RM: Algorithmic Game Theory, Spring Practice Exam Solutions
CS 598RM: Algorithmic Game Theory, Spring 2017 1. Answer the following. Practice Exam Solutions Agents 1 and 2 are bargaining over how to split a dollar. Each agent simultaneously demands share he would
More informationSmart Magnets for Smart Product Design: Advanced Topics
Smart Magnets for Smart Product Design: Advanced Topics Today s Presenter Jason Morgan Vice President Engineering Correlated Magnetics Research 6 Agenda Brief overview of Correlated Magnetics Research
More information2.1 Identifying Patterns
I. Foundations for Functions 2.1 Identifying Patterns: Leaders' Notes 2.1 Identifying Patterns Overview: Objective: s: Materials: Participants represent linear relationships among quantities using concrete
More informationProbability Distributions
Probability Distributions Probability This is not a math class, or an applied math class, or a statistics class; but it is a computer science course! Still, probability, which is a math-y concept underlies
More informationChanging the geospatial landscape in libraries. Karen Majewicz University of Minnesota Libraries Tom Cramer Stanford Libraries
Changing the geospatial landscape in libraries Jack Reed Stanford Libraries Karen Majewicz University of Minnesota Libraries Tom Cramer Stanford Libraries Finding geospatial data can be the most difficult
More informationDelft Applied Mechanics Course: Statics AE1-914-I. 18 August 2004, 9:00 12:00
Delft pplied Mechanics Course: Statics E1-914-I 18 ugust 2004, 9:00 12:00 This is the English exam. Only the answer forms will be collected ny other sheets will be rejected. Write down your name and student
More informationProximity data visualization with h-plots
The fifth international conference user! 2009 Proximity data visualization with h-plots Irene Epifanio Dpt. Matemàtiques, Univ. Jaume I (SPAIN) epifanio@uji.es; http://www3.uji.es/~epifanio Outline Motivating
More information18.06 Spring 2012 Problem Set 3
8.6 Spring 22 Problem Set 3 This problem set is due Thursday, March, 22 at 4pm (hand in to Room 2-6). The textbook problems are out of the 4th edition. For computational problems, please include a printout
More informationREASONING ABILITY. Directions (1-2): Study the following information carefully and answer the given questions.
REASONING ABILITY Directions (1-2): Study the following information carefully and answer the given questions. R is married to U. U is mother of L. L is sister of D. U has only one daughter. D is married
More informationStudents will be able, using GIS, to locate the largest and most destructive earthquakes;
Exploring Earthquake Hazards with GIS Laboratory for Introduction to Geophysics, Spring 2007 Prof. Constantin Cranganu Brooklyn College of the City University of New York Learning Objectives: Students
More informationFairfield Public Schools
Mathematics Fairfield Public Schools AP Calculus AB AP Calculus AB BOE Approved 04/08/2014 1 AP CALCULUS AB Critical Areas of Focus Advanced Placement Calculus AB consists of a full year of college calculus.
More informationCheck off these skills when you feel that you have mastered them. Write in your own words the definition of a Hamiltonian circuit.
Chapter Objectives Check off these skills when you feel that you have mastered them. Write in your own words the definition of a Hamiltonian circuit. Explain the difference between an Euler circuit and
More informationTHE SURE-THING PRINCIPLE AND P2
Economics Letters, 159: 221 223, 2017. Doi: 10.1016/j.econlet.2017.07.027 THE SURE-THING PRINCIPLE AND P2 YANG LIU Abstract. This paper offers a fine analysis of different versions of the well known sure-thing
More informationNo-envy in Queueing Problems
No-envy in Queueing Problems Youngsub Chun School of Economics Seoul National University Seoul 151-742, Korea and Department of Economics University of Rochester Rochester, NY 14627, USA E-mail: ychun@plaza.snu.ac.kr
More informationA Simplified Test for Preference Rationality of Two-Commodity Choice
A Simplified Test for Preference Rationality of Two-Commodity Choice Samiran Banerjee and James H. Murphy December 9, 2004 Abstract We provide a simplified test to determine if choice data from a two-commodity
More informationRe-Mapping the World s Population
Re-Mapping the World s Population Benjamin D Hennig 1, John Pritchard 1, Mark Ramsden 1, Danny Dorling 1, 1 Department of Geography The University of Sheffield SHEFFIELD S10 2TN United Kingdom Tel. +44
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationIEOR 6711: Professor Whitt. Introduction to Markov Chains
IEOR 6711: Professor Whitt Introduction to Markov Chains 1. Markov Mouse: The Closed Maze We start by considering how to model a mouse moving around in a maze. The maze is a closed space containing nine
More informationDS504/CS586: Big Data Analytics Graph Mining II
Welcome to DS504/CS586: Big Data Analytics Graph Mining II Prof. Yanhua Li Time: 6-8:50PM Thursday Location: AK233 Spring 2018 v Course Project I has been graded. Grading was based on v 1. Project report
More informationMVE165/MMG630, Applied Optimization Lecture 6 Integer linear programming: models and applications; complexity. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming: models and applications; complexity Ann-Brith Strömberg 2011 04 01 Modelling with integer variables (Ch. 13.1) Variables Linear programming (LP) uses continuous
More informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
More informationELA
CONSTRUCTING COPOSITIVE MATRICES FROM INTERIOR MATRICES CHARLES R. JOHNSON AND ROBERT REAMS Abstract. Let A be an n by n symmetric matrix with real entries. Using the l -norm for vectors and letting S
More informationData Analysis for the New Millennium: Data Mining, Genetic Algorithms, and Visualization
Data Analysis for the New Millennium: Data Mining, Genetic Algorithms, and Visualization by Bruce L. Golden RH Smith School of Business University of Maryland IMC Knowledge Management Seminar April 15,
More information