Research Away Day Algorithms and Complexity Themes.

Slides:



Advertisements
Similar presentations
IEOR 4004: Introduction to Operations Research Deterministic Models January 22, 2014.
Advertisements

Computational Facility Layout
Signals and Systems March 25, Summary thus far: software engineering Focused on abstraction and modularity in software engineering. Topics: procedures,
Yaron Doweck Yael Einziger Supervisor: Mike Sumszyk Spring 2011 Semester Project.
Program Analysis and Tuning The German High Performance Computing Centre for Climate and Earth System Research Panagiotis Adamidis.
CSCI 311 – Algortihms and Data Structures Steve Guattery Dana 335a (department office) x7-3828
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Object-Oriented Software Development CS 3331 Fall 2009.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
A Batch-Language, Vector-Based Neural Network Simulator Motivation: - general computer languages (e.g. C) lead to complex code - neural network simulators.
Research methods Basic concepts. Theoretical and technical research  Describe and formalise phenomenons mathematically  Make (non-trivial) proofs in.
L13: Review for Midterm. Administrative Project proposals due Friday at 5PM (hard deadline) No makeup class Friday! March 23, Guest Lecture Austin Robison,
©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display. COMPSCI 125 Introduction to Computer Science I.
Define Embedded Systems Small (?) Application Specific Computer Systems.
Abstract Data Types (ADT)
Designing Predictable and Robust Systems Tom Henzinger UC Berkeley and EPFL.
OPL: Our Pattern Language. Background Design Patterns: Elements of Reusable Object-Oriented Software o Introduced patterns o Very influential book Pattern.
Carl Bro a|s - Route 2000 Solving real life vehicle routing problems Carl Bro a|s International consulting engineering company 2100 employees worldwide.
Coursenotes CS3114: Data Structures and Algorithms Clifford A. Shaffer Yang Cao Department of Computer Science Virginia Tech Copyright ©
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
The Geographer’s Basic Tools. A map is a representation of the earth features drawn on a flat service. Maps use symbols and colours to represent the features.
Overview and Mathematics Bjoern Griesbach
1 A Introduction to Data Structures and Algorithm Analysis Data Structures Asst. Professor Kiran Soni.
Data Structures Lecture-1:Introduction
Teaching Fellow Admissions Tutor for Computer Science Director of Undergraduate Studies.
Historian Geographer Hpweurhywef goyugfgSDF YUGUYGF uygweg wgeufygwgf owyefpui ye pr98ywepttryqpieurgyayugfipuwyegfpuuyaergiupyaeurgfyuauhgrtoiagpyuhergieriuyhg.
Signals and Systems March 25, Summary thus far: software engineering Focused on abstraction and modularity in software engineering. Topics: procedures,
Parallel implementation of RAndom SAmple Consensus (RANSAC) Adarsh Kowdle.
Algorithmic Problem Solving CMSC 201 Adapted from slides by Marie desJardins (Spring 2015 Prof Chang version)
Breaking the Memory Wall in MonetDB
Research in Computing สมชาย ประสิทธิ์จูตระกูล. Success Factors in Computing Research Research Computing Knowledge Scientific MethodAnalytical Skill Funding.
1.3 The Intersection Point of Lines System of Equation A system of two equations in two variables looks like: – Notice, these are both lines. Linear Systems.
EEL Software development for real-time engineering systems.
Digital Design and Computer Architecture Dr. Robert D. Kent LT Ext Lecture 1 Introduction.
© David Kirk/NVIDIA and Wen-mei W. Hwu ECE408/CS483/ECE498al, University of Illinois, ECE408 Applied Parallel Programming Lecture 12 Parallel.
Computational Thinking in K-12 and Scalable Game Design Michael Shuffett.
Discrete Structures for Computing
Advanced Scientific Visualization
Imaginary Numbers ???. In real life, complex numbers are used by engineers and physicists to measure electrical currents, to analyze stresses in structures.
V Material obtained from summer workshop in Guildford County, July-2014.
Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.
WHAT IS COMPUTER SCIENCE? Phil Sands K-12 Outreach Coordinator for Computer Science.
Computer Science in Context Evangelos E. Milios Professor and Graduate Coordinator Faculty of Computer Science Dalhousie University.
A BRIEF INTRODUCTION TO CACHE LOCALITY YIN WEI DONG 14 SS.
1 Data Structures CSCI 132, Spring 2014 Lecture 1 Big Ideas in Data Structures Course website:
Overview of the Operations Research Modeling Approach Chapter 2: Hillier and Lieberman Chapter 2: Decision Tools for Agribusiness Dr. Hurley’s AGB 328.
Part II General Integer Programming II.1 The Theory of Valid Inequalities 1.
Background Computer System Architectures Computer System Software.
PROGRAMMING FUNDAMENTALS INTRODUCTION TO PROGRAMMING. Computer Programming Concepts. Flowchart. Structured Programming Design. Implementation Documentation.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Computer Systems Architecture Edited by Original lecture by Ian Sunley Areas: Computer users Basic topics What is a computer?
Introduction to Math Methods Math Standards. Why can math be fun? Math can be fun because… it can have so much variety in topics. many different ways.
Christoph F. Eick: Final Words COSC Topics Covered in COSC 3480  Data models (ER, Relational, XML)  Using data models; learning how to store real.
Sub-fields of computer science. Sub-fields of computer science.
CSCI 311 – Algorithms and Data Structures
Lesson Objectives Aims From the spec:
Introduction to Analysis of Algorithms
Advanced Scientific Visualization
Big Ideas in Computer Science
What is Operations Research?
Topics Covered in COSC 6340 Data models (ER, Relational, XML)
Algorithms.
EE 4xx: Computer Architecture and Performance Programming
Computer Science The 6 Programming Steps.
Computational Thinking
Chapter 2. Problem Solving and Software Engineering
Rocky K. C. Chang September 11, 2018
Query Processing.
Quiz: Computational Thinking
Discrete Mathematics and Its Applications
Presentation transcript:

Research Away Day Algorithms and Complexity Themes

Three Themes Algorithm Design, Analysis and Engineering Computational Complexity of Algebraic Structures. Optimization and Heuristics Common thread: study (mathematically or empirically) the amount of resources (CPU time or memory) needed to solve a particular problem. Find algorithms to minimize resources.

Algorithms Research Design and Analysis Mathematical analysis of: --solution quality -- resource usage or, proofs of impossibility. RIGOUR/ : RAE √ Algorithm Engg Implement algorithms as computer code. Empirical analyses of: --solution quality --resource usage RAE? Applications “Interesting” abstractions of real computational problems.

Algorithm Design + Geography Relevant sub-interests: – storage and processing of large data sets. Specific topics: – space-efficient storage and processing of XML files – data mining expertise mainly in “pattern mining” e.g. given observations of vehicles at various points (ANPR), find interesting patterns of behaviour – parallel computing (GPUs)

Geometric Geographical Data No current expertise, but related to current strengths: – Digital Elevation Maps -> Flow data