CIS 467/602-01: Data Visualization
|
|
- Brent Gilmore
- 5 years ago
- Views:
Transcription
1 IS 467/602-01: Data Visualization etworks Dr. David Koop IS 467, Spring 2015
2 Assignment 2 ~dkoop/cis467/assignment2.html Scaling width Text elements and selectall Any other questions? Allow submissions until 11:59pm tonight IS 467, Spring
3 Exam (ext Wednesday) Topics - Everything in book and lectures through and including networks - TML, SS, SVG, JavaScript, and D3 oncepts Format - Multiple-choice - Free response questions - Graduate students will have extra questions IS 467, Spring
4 Recap (Arrange Tables) Arrange Tables Express Values Separate, Order, Align Regions Separate Order Align 1 Key 2 Keys 3 Keys Many Keys List Matrix Volume Recursive Subdivision Axis Orientation Rectilinear Parallel Radial Layout Density Dense Space-Filling [Munzner (ill. Maguire), 2014] IS 467, Spring
5 Recap (Loading Data) SV, TSV, XML, JSO D3 s asynchronous methods to load data ars Example IS 467, Spring
6 etworks Why not graphs? - Bar graph - Graphing functions in mathematics - odes and edges connecting the nodes etwork: nodes and edges connecting the nodes Formally, G = (V,E) is a set of nodes V and a set of edges E where each edge connects two nodes. odes == items, edges connect items Both nodes and edges may have attributes IS 467, Spring
7 Arrange etworks and Trees ode Link Diagrams onnection Marks ETWORKS TREES Adjacency Matrix Derived Table ETWORKS TREES Enclosure ontainment Marks ETWORKS IS 467, Spring 2015 TREES [Munzner (ill. Maguire), 2014] 7
8 Molecule Graph S IS 467, Spring
9 Molecule Graph S odes may have attributes (e.g. element) IS 467, Spring
10 Molecule Graph S odes may have attributes (e.g. element) Edges may have attributes (e.g. number of bonds) IS 467, Spring
11 Web Sites as Graphs (amazon.com) [M. Salathe, 2006] IS 467, Spring
12 Social etworks [P. Butler, 2010] IS 467, Spring
13 Graphs as Data odes ID Atom Electrons Protons S S Edges ID1 ID2 Bonds IS 467, Spring
14 ode-link Diagrams Data: nodes and edges Task: understand connectivity, paths, structure (topology) Encoding: nodes as point marks, connections as line marks Scalability: hundreds S but high density of links can be problematic! Problem with the above encoding? IS 467, Spring
15 Arc Diagram [D. Eppstein, 2013] IS 467, Spring
16 etwork Layout eed to use spatial position when designing network visualizations Otherwise, nodes can occlude each other, links hard to distinguish ow? - With bar charts, we could order using an attribute - With networks, we want to be able to see connectivity and topology (not in the data usually) Possible metrics: - Edge crossings - ode overlaps - Total area IS 467, Spring
17 Force-Directed Layout odes push away from each other but edges are springs that pull them together Weakness: nondeterminism, algorithm may produce difference results each time it runs [M. Bostock, 2012] IS 467, Spring
18 sfdp [u, 2005] IS 467, Spring
19 airball [u, 2014] IS 467, Spring
20 Adjacency Matrix hange network to tabular data and use a matrix representation Derived data: nodes are keys, edges are boolean values Task: lookup connections, find wellconnected clusters Scalability: millions of edges an encode edge weight, too [enry et al., 2007] IS 467, Spring
21 liques in Adjacency Matrices [Gehlenborg and Wong] IS 467, Spring
22 Structures from Adjacency Matrices [McGuffin] IS 467, Spring
23 ode-link or Adjacency Matrix? Empirical study: For most tasks, node-link is better for small graphs and adjacency better for large graphs Multi-link paths are hard with adjacency matrices Immediate connectivity or neighbors are ok, estimating size (nodes & edges also ok) People tend to be more familiar with node-link diagrams Link density is a problem with node-link but not with adjacency matrices IS 467, Spring
24 Trees A tree is a directed, acyclic graph - Directed: edges are oriented - Acyclic: once you follow an edge from a node, you ll never come back to that same node Trees have a root node and parent-child edges IS 467, Spring
Data Visualization (CIS 468)
Data Visualization (CIS 468) Tables & Maps Dr. David Koop Discriminability What is problematic here? File vtkdatasetreader PythonSource vtkimageclip vtkimagedatageometryfilter vtkimageresample vtkimagereslice
More informationData Visualization (DSC 530/CIS )
Data Visualization (DSC 530/CIS 602-01) Tables Dr. David Koop Visualization of Tables Items and attributes For now, attributes are not known to be positions Keys and values - key is an independent attribute
More informationDr. Lori Stepan Van Der Sluys 2 Chapter 8 Part 3
ovalent Bonding Describe covalent bonding and how it differs from ionic bonding Know how to tell if a substance is covalently bonded Know how to draw Lewis structures Know the two types of multiple bonds
More informationGeneral Chemistry 201 Section ABC Harry S. Truman College Spring Semester 2014
Instructor: Michael Davis Office: 3226 Phone: 773 907 4718 Office Hours: Tues 9:00 12:00 Wed 1:00 3:00 Thurs 9:00 12:00 Email: mdavis@ccc.edu Website: http://faradaysclub.com http://ccc.blackboard.com
More informationAnnouncements. CS 188: Artificial Intelligence Spring Probability recap. Outline. Bayes Nets: Big Picture. Graphical Model Notation
CS 188: Artificial Intelligence Spring 2010 Lecture 15: Bayes Nets II Independence 3/9/2010 Pieter Abbeel UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell, Andrew Moore Current
More informationCS246 Final Exam, Winter 2011
CS246 Final Exam, Winter 2011 1. Your name and student ID. Name:... Student ID:... 2. I agree to comply with Stanford Honor Code. Signature:... 3. There should be 17 numbered pages in this exam (including
More information1 : Introduction. 1 Course Overview. 2 Notation. 3 Representing Multivariate Distributions : Probabilistic Graphical Models , Spring 2014
10-708: Probabilistic Graphical Models 10-708, Spring 2014 1 : Introduction Lecturer: Eric P. Xing Scribes: Daniel Silva and Calvin McCarter 1 Course Overview In this lecture we introduce the concept of
More informationNR402 GIS Applications in Natural Resources
NR402 GIS Applications in Natural Resources Lesson 1 Introduction to GIS Eva Strand, University of Idaho Map of the Pacific Northwest from http://www.or.blm.gov/gis/ Welcome to NR402 GIS Applications in
More informationOverlapping Communities
Overlapping Communities Davide Mottin HassoPlattner Institute Graph Mining course Winter Semester 2017 Acknowledgements Most of this lecture is taken from: http://web.stanford.edu/class/cs224w/slides GRAPH
More informationReasoning Under Uncertainty: Belief Network Inference
Reasoning Under Uncertainty: Belief Network Inference CPSC 322 Uncertainty 5 Textbook 10.4 Reasoning Under Uncertainty: Belief Network Inference CPSC 322 Uncertainty 5, Slide 1 Lecture Overview 1 Recap
More informationCMPSCI 611 Advanced Algorithms Midterm Exam Fall 2015
NAME: CMPSCI 611 Advanced Algorithms Midterm Exam Fall 015 A. McGregor 1 October 015 DIRECTIONS: Do not turn over the page until you are told to do so. This is a closed book exam. No communicating with
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationAnalysis and visualization of protein-protein interactions. Olga Vitek Assistant Professor Statistics and Computer Science
1 Analysis and visualization of protein-protein interactions Olga Vitek Assistant Professor Statistics and Computer Science 2 Outline 1. Protein-protein interactions 2. Using graph structures to study
More informationBayesian belief networks. Inference.
Lecture 13 Bayesian belief networks. Inference. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Midterm exam Monday, March 17, 2003 In class Closed book Material covered by Wednesday, March 12 Last
More informationCMPSCI 311: Introduction to Algorithms Second Midterm Exam
CMPSCI 311: Introduction to Algorithms Second Midterm Exam April 11, 2018. Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Providing more
More informationCommunities Via Laplacian Matrices. Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices
Communities Via Laplacian Matrices Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices The Laplacian Approach As with betweenness approach, we want to divide a social graph into
More informationWelcome to Chemistry 376
CHM 376 Spring 2014 Welcome to Chemistry 376 This course will give you a chance to explore the experimental world of physical chemistry. In each of six experiments you will study how simple physical models,
More informationPhysics 008 Tutorial 7: Energy Bands
1 Physics 8 Tutorial 7: Bands In this tutorial we are going to investigate how electronic bands form when atoms are brought together. We saw in the last tutorial and in the lectures that atoms possess
More informationMIDTERM: CS 6375 INSTRUCTOR: VIBHAV GOGATE October,
MIDTERM: CS 6375 INSTRUCTOR: VIBHAV GOGATE October, 23 2013 The exam is closed book. You are allowed a one-page cheat sheet. Answer the questions in the spaces provided on the question sheets. If you run
More informationSTRUCTURAL BIOINFORMATICS I. Fall 2015
STRUCTURAL BIOINFORMATICS I Fall 2015 Info Course Number - Classification: Biology 5411 Class Schedule: Monday 5:30-7:50 PM, SERC Room 456 (4 th floor) Instructors: Vincenzo Carnevale - SERC, Room 704C;
More informationExtra Topic: DISTRIBUTIONS OF FUNCTIONS OF RANDOM VARIABLES
Extra Topic: DISTRIBUTIONS OF FUNCTIONS OF RANDOM VARIABLES A little in Montgomery and Runger text in Section 5-5. Previously in Section 5-4 Linear Functions of Random Variables, we saw that we could find
More informationEE595A Submodular functions, their optimization and applications Spring 2011
EE595A Submodular functions, their optimization and applications Spring 2011 Prof. Jeff Bilmes University of Washington, Seattle Department of Electrical Engineering Winter Quarter, 2011 http://ee.washington.edu/class/235/2011wtr/index.html
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2011 Lecture 14: Bayes Nets II Independence 3/9/2011 Pieter Abbeel UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell, Andrew Moore Announcements
More informationCS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2008 Lecture 14: Bayes Nets 10/14/2008 Dan Klein UC Berkeley 1 1 Announcements Midterm 10/21! One page note sheet Review sessions Friday and Sunday (similar) OHs on
More informationRecap from Last Time
NP-Completeness Recap from Last Time Analyzing NTMs When discussing deterministic TMs, the notion of time complexity is (reasonably) straightforward. Recall: One way of thinking about nondeterminism is
More informationCHEM-103 PRINCIPLES OF CHEMISTRY I
Coffeyville Community College CHEM-103 COURSE SYLLABUS FOR PRINCIPLES OF CHEMISTRY I Amy Lumley Instructor COURSE NUMBER: CHEM-103 COURSE TITLE: Principles of Chemistry I CREDIT HOURS: 5 INSTRUCTOR: OFFICE
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2010 Lecture 24: Perceptrons and More! 4/22/2010 Pieter Abbeel UC Berkeley Slides adapted from Dan Klein Announcements W7 due tonight [this is your last written for
More informationCS281A/Stat241A Lecture 19
CS281A/Stat241A Lecture 19 p. 1/4 CS281A/Stat241A Lecture 19 Junction Tree Algorithm Peter Bartlett CS281A/Stat241A Lecture 19 p. 2/4 Announcements My office hours: Tuesday Nov 3 (today), 1-2pm, in 723
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Undirected Graphical Models Mark Schmidt University of British Columbia Winter 2016 Admin Assignment 3: 2 late days to hand it in today, Thursday is final day. Assignment 4:
More informationChemistry 151. Matter And Measurement
Chemistry 151 Professor James H. Geiger Office: Chemistry Building, Room 9 Office Hours: 1:30-2:30 PM MWF, and other times by appointment (send me an email). You can also drop by, but I might be busy.
More informationLecture 23: More PSPACE-Complete, Randomized Complexity
6.045 Lecture 23: More PSPACE-Complete, Randomized Complexity 1 Final Exam Information Who: You On What: Everything through PSPACE (today) With What: One sheet (double-sided) of notes are allowed When:
More informationGIS Supports to Economic and Social Development
GIS Supports to Economic and Social Development Dang Van Duc and Le Quoc Hung Institute of Information Technology 18, Hoang Quoc Viet Rd., Cau Giay Dist., Hanoi, Vietnam Email: dvduc@ioit.ncst.ac.vn; lqhung@ioit.ncst.ac.vn
More informationDr. LeGrande M. Slaughter Chemistry Building Rm. 307E Office phone: ; Tues, Thurs 11:00 am-12:20 pm, CHEM 331D
Syllabus: CHEM 5620 Selected Topics in Inorganic Chemistry: Transition Metal Organometallic Chemistry and Catalysis Spring Semester 2017 (3 credit hours) Instructor: Lecture: Required Text: Office Hours:
More informationCHEMISTRY 101 DETAILED WEEKLY TEXTBOOK HOMEWORK & READING SCHEDULE*
CHEMISTRY 101 COURSE POLICIES 15 CHEMISTRY 101 DETAILED WEEKLY TEXTBOOK HOMEWORK & READING SCHEDULE* *Refer to textbook homework assignment and pre-lecture assignment for corresponding chapters to read.
More informationPhysics Fall Semester. Sections 1 5. Please find a seat. Keep all walkways free for safety reasons and to comply with the fire code.
Physics 222 2018 Fall Semester Sections 1 5 Please find a seat. Keep all walkways free for safety reasons and to comply with the fire code. Electronic Devices Please separate your professional from your
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2011 Lecture 16: Bayes Nets IV Inference 3/28/2011 Pieter Abbeel UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew Moore Announcements
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Brown University CSCI 295-P, Spring 213 Prof. Erik Sudderth Lecture 11: Inference & Learning Overview, Gaussian Graphical Models Some figures courtesy Michael Jordan s draft
More informationA New Space for Comparing Graphs
A New Space for Comparing Graphs Anshumali Shrivastava and Ping Li Cornell University and Rutgers University August 18th 2014 Anshumali Shrivastava and Ping Li ASONAM 2014 August 18th 2014 1 / 38 Main
More informationM.A.P. Matrix Algebra Procedures. by Mary Donovan, Adrienne Copeland, & Patrick Curry
M.A.P. Matrix Algebra Procedures by Mary Donovan, Adrienne Copeland, & Patrick Curry This document provides an easy to follow background and review of basic matrix definitions and algebra. Because population
More informationGeographers Perspectives on the World
What is Geography? Geography is not just about city and country names Geography is not just about population and growth Geography is not just about rivers and mountains Geography is a broad field that
More informationSul Ross State University Syllabus for General Chemistry I; CHEM 1311:02 (Spring 2017)
Sul Ross State University Syllabus for General Chemistry I; CHEM 1311:02 (Spring 2017) Class: General Chemistry I Instructor: Dr. David Leaver Room: WSB 301 Office: WSB 318 Time: TR 8:00-9:15am Office
More informationSul Ross State University Syllabus for General Chemistry I: CHEM 1311 (Fall 2017)
Sul Ross State University Syllabus for General Chemistry I: CHEM 1311 (Fall 2017) Class: General Chemistry I Instructor: Dr. David Leaver Room: WSB 301 Office: WSB 318 Time: TR 8:00-9:15am Office Hours:
More informationCMPT 310 Artificial Intelligence Survey. Simon Fraser University Summer Instructor: Oliver Schulte
CMPT 310 Artificial Intelligence Survey Simon Fraser University Summer 2017 Instructor: Oliver Schulte Assignment 3: Chapters 13, 14, 18, 20. Probabilistic Reasoning and Learning Instructions: The university
More informationSOL Study Book Fifth Grade Scientific Investigation, Reasoning, and Logic
SOL Study Book Fifth Grade Scientific Investigation, Reasoning, and Logic Table of Contents Page 1: Measurement Page 2: Measuring Instruments Page 3: Data Collection, Recording, and Reporting Page 4-5:
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec Stanford University Jure Leskovec, Stanford University http://cs224w.stanford.edu Task: Find coalitions in signed networks Incentives: European
More informationWelcome to CPSC 4850/ OR Algorithms
Welcome to CPSC 4850/5850 - OR Algorithms 1 Course Outline 2 Operations Research definition 3 Modeling Problems Product mix Transportation 4 Using mathematical programming Course Outline Instructor: Robert
More informationApplying Latent Dirichlet Allocation to Group Discovery in Large Graphs
Lawrence Livermore National Laboratory Applying Latent Dirichlet Allocation to Group Discovery in Large Graphs Keith Henderson and Tina Eliassi-Rad keith@llnl.gov and eliassi@llnl.gov This work was performed
More informationBayesian Networks. Motivation
Bayesian Networks Computer Sciences 760 Spring 2014 http://pages.cs.wisc.edu/~dpage/cs760/ Motivation Assume we have five Boolean variables,,,, The joint probability is,,,, How many state configurations
More informationChemoinformatics and information management. Peter Willett, University of Sheffield, UK
Chemoinformatics and information management Peter Willett, University of Sheffield, UK verview What is chemoinformatics and why is it necessary Managing structural information Typical facilities in chemoinformatics
More informationCS1210 Lecture 23 March 8, 2019
CS1210 Lecture 23 March 8, 2019 HW5 due today In-discussion exams next week Optional homework assignment next week can be used to replace a score from among HW 1 3. Will be posted some time before Monday
More informationThis format is the result of tinkering with a mixed lecture format for 3 terms. As such, it is still a work in progress and we will discuss
Version 1, August 2016 1 This format is the result of tinkering with a mixed lecture format for 3 terms. As such, it is still a work in progress and we will discuss adaptations both to the general format
More informationMITOCW Lec 11 MIT 6.042J Mathematics for Computer Science, Fall 2010
MITOCW Lec 11 MIT 6.042J Mathematics for Computer Science, Fall 2010 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high
More information2 : Directed GMs: Bayesian Networks
10-708: Probabilistic Graphical Models 10-708, Spring 2017 2 : Directed GMs: Bayesian Networks Lecturer: Eric P. Xing Scribes: Jayanth Koushik, Hiroaki Hayashi, Christian Perez Topic: Directed GMs 1 Types
More informationLinear equations The first case of a linear equation you learn is in one variable, for instance:
Math 52 0 - Linear algebra, Spring Semester 2012-2013 Dan Abramovich Linear equations The first case of a linear equation you learn is in one variable, for instance: 2x = 5. We learned in school that this
More informationMachine Learning, Midterm Exam: Spring 2009 SOLUTION
10-601 Machine Learning, Midterm Exam: Spring 2009 SOLUTION March 4, 2009 Please put your name at the top of the table below. If you need more room to work out your answer to a question, use the back of
More informationCS483 Design and Analysis of Algorithms
CS483 Design and Analysis of Algorithms Lectures 15-16 Dynamic Programming Instructor: Fei Li lifei@cs.gmu.edu with subject: CS483 Office hours: STII, Room 443, Friday 4:00pm - 6:00pm or by appointments
More informationFriday Four Square! Today at 4:15PM, Outside Gates
P and NP Friday Four Square! Today at 4:15PM, Outside Gates Recap from Last Time Regular Languages DCFLs CFLs Efficiently Decidable Languages R Undecidable Languages Time Complexity A step of a Turing
More informationCS Lecture 3. More Bayesian Networks
CS 6347 Lecture 3 More Bayesian Networks Recap Last time: Complexity challenges Representing distributions Computing probabilities/doing inference Introduction to Bayesian networks Today: D-separation,
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programming II Date: 10/12/17
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programming II Date: 10/12/17 12.1 Introduction Today we re going to do a couple more examples of dynamic programming. While
More informationLecture 9: Geocoding & Network Analysis
Massachusetts Institute of Technology - Department of Urban Studies and Planning 11.520: A Workshop on Geographic Information Systems 11.188: Urban Planning and Social Science Laboratory Lecture 9: Geocoding
More informationWelcome to Physics 161 Elements of Physics Fall 2018, Sept 4. Wim Kloet
Welcome to Physics 161 Elements of Physics Fall 2018, Sept 4 Wim Kloet 1 Lecture 1 TOPICS Administration - course web page - contact details Course materials - text book - iclicker - syllabus Course Components
More information1 Review of Vertex Cover
CS266: Parameterized Algorithms and Complexity Stanford University Lecture 3 Tuesday, April 9 Scribe: Huacheng Yu Spring 2013 1 Review of Vertex Cover In the last lecture, we discussed FPT algorithms for
More informationMATH 115 Administrative Overview Chapter 1 Review
MATH 115 Administrative Overview Chapter 1 Review Dr. Pete Goetz Lecture 0 Typeset by FoilTEX Outline Professor s Contact Information Syllabus and Course Expectations Course Website WebAssign - online
More informationData Mining Recitation Notes Week 3
Data Mining Recitation Notes Week 3 Jack Rae January 28, 2013 1 Information Retrieval Given a set of documents, pull the (k) most similar document(s) to a given query. 1.1 Setup Say we have D documents
More informationFirst Midterm Exam. Physics General Physics Lecture 11 Work and Energy 9/28/2016. Fall 2016 Semester Prof. Matthew Jones
Physics 22000 General Physics Lecture 11 Work and Energy Fall 2016 Semester Prof. Matthew Jones 1 First Midterm Exam Tuesday, October 4 th, 8:00-9:30 pm Location: PHYS 112 and WTHR 200. Covering material
More informationBioinformatics tools for phylogeny and visualization. Yanbin Yin
Bioinformatics tools for phylogeny and visualization Yanbin Yin 1 Homework assignment 5 1. Take the MAFFT alignment http://cys.bios.niu.edu/yyin/teach/pbb/purdue.cellwall.list.lignin.f a.aln as input and
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 informationTwo hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 17th May 2018 Time: 09:45-11:45. Please answer all Questions.
COMP 34120 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE AI and Games Date: Thursday 17th May 2018 Time: 09:45-11:45 Please answer all Questions. Use a SEPARATE answerbook for each SECTION
More information10/6/2014. The MACROSCOPIC world we are familiar with is governed by interactions at the atomic & molecular scale. Core Electrons & Valence Electrons:
Today: Summary of Quantum Mechanics: Core vs. Valence Electrons Ionic vs. Covalent Bonding: Electron transfer from one element to another Sharing Electrons Lewis Dot Structures: Following Octet Rule Drawing
More informationSocial Choice and Networks
Social Choice and Networks Elchanan Mossel UC Berkeley All rights reserved Logistics 1 Different numbers for the course: Compsci 294 Section 063 Econ 207A Math C223A Stat 206A Room: Cory 241 Time TuTh
More informationLecture 18 April 26, 2012
6.851: Advanced Data Structures Spring 2012 Prof. Erik Demaine Lecture 18 April 26, 2012 1 Overview In the last lecture we introduced the concept of implicit, succinct, and compact data structures, and
More informationMini course on Complex Networks
Mini course on Complex Networks Massimo Ostilli 1 1 UFSC, Florianopolis, Brazil September 2017 Dep. de Fisica Organization of The Mini Course Day 1: Basic Topology of Equilibrium Networks Day 2: Percolation
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP Recap: Logic, Sets, Relations, Functions
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2017 Formal proofs; Simple/strong induction; Mutual induction; Inductively defined sets; Recursively defined functions. Lecture 3 Ana Bove
More informationGIST 4302/5302: Spatial Analysis and Modeling
GIST 4302/5302: Spatial Analysis and Modeling Spring 2016 Lectures: Tuesdays & Thursdays 12:30pm-1:20pm, Science 234 Labs: GIST 4302: Monday 1:00-2:50pm or Tuesday 2:00-3:50pm GIST 5302: Wednesday 2:00-3:50pm
More informationAstro 32 - Galactic and Extragalactic Astrophysics/Spring 2016
Astro 32 - Galactic and Extragalactic Astrophysics/Spring 2016 The class meets Monday and Wednesday 10:30-11:45am (Block E+) in 574 Boston Ave, room 401 Instructor: Professor Anna Sajina email: Anna.Sajina@tufts.edu
More informationMatrix Assembly in FEA
Matrix Assembly in FEA 1 In Chapter 2, we spoke about how the global matrix equations are assembled in the finite element method. We now want to revisit that discussion and add some details. For example,
More informationIS 709/809: Computational Methods in IS Research Fall Exam Review
IS 709/809: Computational Methods in IS Research Fall 2017 Exam Review Nirmalya Roy Department of Information Systems University of Maryland Baltimore County www.umbc.edu Exam When: Tuesday (11/28) 7:10pm
More informationWritten homework due on Monday at the start of class Online homework due on Tuesday by 8 am
Homework #12 Written homework due on Monday at the start of class Online homework due on Tuesday by 8 am Exam 3 Wednesday May 6 from 7 to 9 pm Make-up exams need to be scheduled no later than Friday this
More informationCorrespondence between the KIDS Instrument and the Next Generation Science Standards
Kindergarten Individual Development Survey (KIDS) Correspondence to Illinois Learning Standards: Cognition: Science (COG: SCI) and the The KIDS 1 includes four key measures related to science: Cause and
More informationCS 68: BIOINFORMATICS. Prof. Sara Mathieson Swarthmore College Spring 2018
CS 68: BIOINFORMTICS Prof. Sara Mathieson Swarthmore College Spring 2018 Outline: pr 4 Lab 5 Examples HMM example in population genetics Recap Viterbi lgorithm Forward-Backward lgorithm Posterior Decoding
More informationPathline: " 1234B2# ="3;6<89>";>6"B A1"<6"A <?;>"=21 9>";52#A. Miriah Meyer 1,2
1234567" 2839958:9;8"8:?7
More informationUsing first-order logic, formalize the following knowledge:
Probabilistic Artificial Intelligence Final Exam Feb 2, 2016 Time limit: 120 minutes Number of pages: 19 Total points: 100 You can use the back of the pages if you run out of space. Collaboration on the
More informationDesigning Information Devices and Systems I Spring 2017 Babak Ayazifar, Vladimir Stojanovic Homework 4
EECS 16A Designing Information Devices and Systems I Spring 2017 Babak Ayazifar, Vladimir Stojanovic Homework This homework is due February 22, 2017, at 2:59. Self-grades are due February 27, 2017, at
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 8 Random Walks, Matrices and PageRank Graphs
More informationGTECH 380/722 Analytical and Computer Cartography Hunter College, CUNY Department of Geography
GTECH 380/722 Analytical and Computer Cartography Hunter College, CUNY Department of Geography Fall 2014 Mondays 5:35PM to 9:15PM Instructor: Doug Williamson, PhD Email: Douglas.Williamson@hunter.cuny.edu
More information5th Grade Science Syllabus and Classroom Expectations
5th Grade Science Syllabus and Classroom Expectations Class Description: The organization of this class will include topics from the physical sciences, Biology, and earth Science. This year you will be
More informationAMSC/MATH 673, CLASSICAL METHODS IN PDE, FALL Required text: Evans, Partial Differential Equations second edition
AMSC/MATH 673, CLASSICAL METHODS IN PDE, FALL 2018. MWF 2:00pm - 2:50pm MTH 0407 Instructor: M. Machedon Office: MTH 3311 e-mail: mxm@math.umd.edu Required text: Evans, Partial Differential Equations second
More informationTensor Visualisation and Information Visualisation
Tensor Visualisation and Information Visualisation Computer Animation and Visualisation Lecture 18 Taku Komura tkomura@ed.ac.uk Institute for Perception, Action & Behaviour School of Informatics 1 Reminder
More informationMath 200 A and B: Linear Algebra Spring Term 2007 Course Description
Math 200 A and B: Linear Algebra Spring Term 2007 Course Description February 25, 2007 Instructor: John Schmitt Warner 311, Ext. 5952 jschmitt@middlebury.edu Office Hours: Monday, Wednesday 11am-12pm,
More informationCS 350 Algorithms and Complexity
CS 350 Algorithms and Complexity Winter 2019 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationECE 5984: Introduction to Machine Learning
ECE 5984: Introduction to Machine Learning Topics: (Finish) Expectation Maximization Principal Component Analysis (PCA) Readings: Barber 15.1-15.4 Dhruv Batra Virginia Tech Administrativia Poster Presentation:
More informationMore Dynamic Programming
CS 374: Algorithms & Models of Computation, Spring 2017 More Dynamic Programming Lecture 14 March 9, 2017 Chandra Chekuri (UIUC) CS374 1 Spring 2017 1 / 42 What is the running time of the following? Consider
More informationCS 350 Algorithms and Complexity
1 CS 350 Algorithms and Complexity Fall 2015 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationCourse Staff. Textbook
Course Staff CS311H: Discrete Mathematics Intro and Propositional Logic Instructor: Işıl Dillig Instructor: Prof. Işıl Dillig TAs: Jacob Van Geffen, Varun Adiga, Akshay Gupta Class meets every Monday,
More informationFacebook Friends! and Matrix Functions
Facebook Friends! and Matrix Functions! Graduate Research Day Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Network Analysis Use linear algebra
More informationAPS Eighth Grade Math District Benchmark Assessment NM Math Standards Alignment
EIGHTH GRADE NM STANDARDS Strand: NUMBER AND OPERATIONS Standard: Students will understand numerical concepts and mathematical operations. 5-8 Benchmark N.: Understand numbers, ways of representing numbers,
More informationSt. Nathy s College. Physics and Chemistry Subject Plan
St. Nathy s College Physics and Chemistry Subject Plan 2010-2011 Aims: To simulate and sustain students interest in and enjoyment of, physics and chemistry. To provide a relevant course for those students
More informationAlgorithms, Probability, and Computing Fall 2010 Exam
Eidgenossische Technische Hochschule Zurich Ecole polytechnique federale de Zurich Politecnico federale di Zurigo Swiss Federal Institute of Technology Zurich Institute of Theoretical Computer Science
More informationIntroduction to Theoretical Computer Science
Introduction to Theoretical Computer Science Zdeněk Sawa Department of Computer Science, FEI, Technical University of Ostrava 17. listopadu 15, Ostrava-Poruba 708 33 Czech republic February 11, 2018 Z.
More informationTHE PRINCIPLES OF PHYSICAL SCIENCE Nadia Iskandarani
Course Title: Head of Department: Teacher(s) + e-mail: Cycle/Division: THE PRINCIPLES OF PHYSICAL SCIENCE Nadia Iskandarani Ms.Ibtessam: ibtissam.h@greenwood.sch.ae High School Grade Level: Grade 9 Credit
More information