CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing



Similar documents
MEng, BSc Applied Computer Science

Graduate Co-op Students Information Manual. Department of Computer Science. Faculty of Science. University of Regina

MEng, BSc Computer Science with Artificial Intelligence

Page 1 of 5. (Modules, Subjects) SENG DSYS PSYS KMS ADB INS IAT

Learning outcomes. Knowledge and understanding. Competence and skills

Learning is a very general term denoting the way in which agents:

Master of Science in Computer Science

BIOINF 585 Fall 2015 Machine Learning for Systems Biology & Clinical Informatics

The University of Jordan

Doctor of Philosophy in Computer Science

How To Get A Computer Science Degree At Appalachian State

School of Computer Science

Course Outline Department of Computing Science Faculty of Science. COMP Applied Artificial Intelligence (3,1,0) Fall 2015

Course Syllabus For Operations Management. Management Information Systems

Division of Mathematical Sciences

Master of Science (M.S.), Major in Software Engineering

Master of Science in Computer Science (Thesis option)

Software Development Training Camp 1 (0-3) Prerequisite : Program development skill enhancement camp, at least 48 person-hours.

Computer Science. Master of Science

COMPUTER SCIENCE. FACULTY: Jennifer Bowen, Chair Denise Byrnes, Associate Chair Sofia Visa

Master s Program in Information Systems

Masters in Human Computer Interaction

A Systemic Artificial Intelligence (AI) Approach to Difficult Text Analytics Tasks

Computer Science Information Sheet for entry in What is Computer Science?

MS1b Statistical Data Mining

Masters in Computing and Information Technology

Masters in Networks and Distributed Systems

Masters in Information Technology

Core Courses Seminar (0-2) Non-credit Ph.D. Thesis (0-1) Non-credit Special Studies (8-0) Non-credit. Elective Courses

Master of Science in Health Information Technology Degree Curriculum

Datavetenskapligt Program (kandidat) Computer Science Programme (master)

DEGREE PLAN INSTRUCTIONS FOR COMPUTER ENGINEERING

Masters in Advanced Computer Science

Masters in Artificial Intelligence

Professional Organization Checklist for the Computer Science Curriculum Updates. Association of Computing Machinery Computing Curricula 2008

School of Computer Science

Position Classification Flysheet for Computer Science Series, GS Table of Contents

Practical Applications of DATA MINING. Sang C Suh Texas A&M University Commerce JONES & BARTLETT LEARNING

Master's projects at ITMO University. Daniil Chivilikhin PhD ITMO University

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce

Swiss Joint Master in Computer Science of the universities of Bern, Neuchâtel and Fribourg

School of Computer Science

UK PhD Centre for Financial Computing

LIST OF REGISTRABLE COURSES FOR BSC COMMUNICATION TECHNOLOGY JUNE 2014

III. Modules in the Masters Degree Course

Core Curriculum to the Course:

APPM4720/5720: Fast algorithms for big data. Gunnar Martinsson The University of Colorado at Boulder

Computer Science 1010 Introduction to Computers and the Internet (3) 1015 Web Structures I (1) 1016 Web Structures II (1)

Graduate Certificate in Systems Engineering

Master of Arts in Mathematics

M.S. Computer Science Program

Assessment for Master s Degree Program Fall Spring 2011 Computer Science Dept. Texas A&M University - Commerce

Computer Science GRADUATE HANDBOOK

Government of Russian Federation. Faculty of Computer Science School of Data Analysis and Artificial Intelligence

Mathematics in Computer Science Curricula

Computer Science MS Course Descriptions

KATE GLEASON COLLEGE OF ENGINEERING. John D. Hromi Center for Quality and Applied Statistics

Sanjeev Kumar. contribute

Module Catalogue for the Bachelor Program in Computational Linguistics at the University of Heidelberg

Information and Decision Sciences (IDS)

Index Contents Page No. Introduction . Data Mining & Knowledge Discovery

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])

Imam Mohammad Ibn Saud Islamic University College of Computer and Information Sciences Department of Computer Sciences

Model 2.4 Faculty member + student

Is a Data Scientist the New Quant? Stuart Kozola MathWorks

Bachelor Degree in Informatics Engineering Master courses

Please consult the Department of Engineering about the Computer Engineering Emphasis.

Computer Science. Requirements for the Major (updated 11/13/03)

An Overview of Knowledge Discovery Database and Data mining Techniques

The Master s Degree with Thesis Course Descriptions in Industrial Engineering

PSG College of Technology, Coimbatore Department of Computer & Information Sciences BSc (CT) G1 & G2 Sixth Semester PROJECT DETAILS.

Department of Computer Science

Department of Computer Science

Industrial and Systems Engineering (ISE)

Study Plan for the Master Degree In Industrial Engineering / Management. (Thesis Track)

Syllabus for MATH 191 MATH 191 Topics in Data Science: Algorithms and Mathematical Foundations Department of Mathematics, UCLA Fall Quarter 2015

The Data Mining Process

Erik Jonsson School of Engineering and Computer Science Interdisciplinary Programs

DATA MINING TECHNIQUES AND APPLICATIONS

Mathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours

Statistics Graduate Courses

Diablo Valley College Catalog

Non-negative Matrix Factorization (NMF) in Semi-supervised Learning Reducing Dimension and Maintaining Meaning

Introduction to Data Mining and Machine Learning Techniques. Iza Moise, Evangelos Pournaras, Dirk Helbing

Master Degree Program in Computer Science (CS)

Predictive Analytics Techniques: What to Use For Your Big Data. March 26, 2014 Fern Halper, PhD

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

These degree requirements are in effect starting from Admission.

Department Overview. Preparation for Graduate School. Dual Degree BS and MSCIS Track. COMPUTER SCIENCE Computer Science

Introduction to Machine Learning Lecture 1. Mehryar Mohri Courant Institute and Google Research

USTC Course for students entering Clemson F2013 Equivalent Clemson Course Counts for Clemson MS Core Area. CPSC 822 Case Study in Operating Systems

FACULTY OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY AUTUMN 2016 BACHELOR COURSES

Transcription:

CS Master Level Courses and Areas The graduate courses offered may change over time, in response to new developments in computer science and the interests of faculty and students; the list of graduate courses includes (but not limited to): Area Systems Theory Applications Thesis Course CSCI 521 Real-Time Systems CSCI 522 High Performance Computing CSCI 526 Embedded Systems CSCI 541 Theory of Computing CSCI 542 Representation and Reasoning CSCI 543 Specification and Verification CSCI 544 Computational Logic CSCI 545 Artificial Intelligence CSCI 554 Matrix Computation CSCI 5xx Data Mining and Machine Learning CSCI 561 Computer and Network Security CSCI 562 Computer Graphics CSCI 563 Advanced Database Systems CSCI 564 Constraint Processing and Heuristic Search CSCI 598 Research CSCI 599 Thesis COURSE DESCRIPTIONS CSCI 521 Real-Time Systems Course Description: This course covers analysis techniques and development methodology for real-time systems. Topics include: real-time process and control, soft and hard real time systems, real-time scheduling algorithms, schedulability analysis theory, resource access control, real-time operating systems, real-time communications, performance analysis, requirement specification and system specification, verification of real-time systems, and formal development process of time critical real-time systems. CSCI 522 High Performance Computing Course Description: This course is designed for graduate level parallel computing courses. This is not only a course which is linked to real parallel programming software, but also a course which covers many theoretical aspects on architectures, algorithms and applications. This course concentrates on parallel program to be executed not only on special multiprocessor systems or supercomputers, but also on networked workstations (Linux) or PCs using freely available parallel software tools such as Message Passing Interface (MPI) and Parallel Virtual Machine (PVM). Some emerging topics such as cluster computing, grid computing, cloud computing, peer-to-peer computing, as well as multicore systems will be introduced.

CSCI 526 Embedded Systems Course Description: This course will study embedded programming with a focus on wireless sensor networks, and the state of the art in mobile communication research. Students are expected to present research papers from the recent literature, and to learn TinyOS programming with NesC and application development in MICA2 platform. CSCI 541 Theory of Computing Course Description: This course focuses on three areas central to the theory of computation: automata, computability and complexity, to investigate the question: What are the fundamental capabilities and limitations of computers? We study automata (models of computation) e.g., finite state machines, pushdown automata and Turing machines and the languages recognized by them. We investigate complexity theory, to classify problems as easy or hard and computability theory to classify problems as solvable or not. CSCI 542 Representations and Reasoning Course Description: This course provides a survey of general methods for analyzing knowledge about the real world and mapping it to a computable form. Principles of knowledge representation and their role in adapting logic and ontology to the task of constructing computable models of an application domain are introduced. Methods for representing dynamically changing processes and events are presented. Ways of dealing with vague, uncertain, imprecise or inconsistent facts are discussed. CSCI 543 Specification and Verification Course Description: Topics covered include: introduction to formal methods; propositional and predicate logic; verification and model checking; Hoare-style program verification; modeling systems; specification using temporal (e.g., CTL, LTL), and other modal logics; various model checkers; partial order reduction; compositional reasoning and abstraction; automated theorem proving using tableau; problems/challenges to effective verification of large scale systems.

CSCI 544 Computational Logic Course Description: This course focuses on automated theorem proving. We start with a rigorous treatment of propositional and first order calculus (with equality) and the method of natural deduction, giving a thorough investigation of the soundness and completeness proofs and decidability. Then we compare and contrast several automated theorem proving methods such as tableau, resolution, sequent style calculus and rewrite systems. Extensions to other logics will be discussed. Students will implement one of the automated theorem proving methods. CSCI 545 Artificial Intelligence Course Description: A broad overview of the core concepts and major subfields of artificial intelligence (AI). Topics covered include intelligent agents, uninformed and informed (heuristic) search, logical and probabilistic knowledge representation, logical and probabilistic inference, essentials of machine learning, neural networks, reinforcement learning, and evolutionary computation. Graduate students taking this course for graduate credit in the M.Sc. CS program will: (a) complete assignments which will include additional and/or more challenging problems; (b) complete additional assignments; (c) write exams that will include additional and/or more challenging questions; and (d) complete an individual Project which will require and in-depth study of a topic related to AI. CSCI 554 Matrix Computation Course Description: Through the use of lectures, discussions, the text, assignments, and labs, this course will familiarize students with the advanced knowledge of triangular systems, positive definite systems, banded systems, sparse positive definite systems, general systems; Sensitivity of linear systems; orthogonal matrices and least squares; singular value decomposition; eigenvalues and eigenvectors; and QR algorithm with their applications. CSCI 561 Computer and Network Security Course Description: The objective of the course is to provide a broad overview of issues and approaches, while exposing students to recent advance of computer and network security. This course will cover the theory and practice of computer and network security. While covering the theory of computer communications security, the course will focus on using and in some cases implementing various algorithms as well.

CSCI 562 Computer Graphics Course Description: Fundamental mathematical, algorithmic and representational issues in computer graphics. Graphics programming. Geometrical objects and transformations. 2-D and 3-D data description and manipulation. Viewing, Projections, Clipping, Shading, Animation. 2-hours laboratory. CSCI 563 Advanced Database Systems Course Description: Explores advanced and evolving issues in database management systems. Topics include advanced database design and normalization, database implementations and optimizations, advanced and embedded SQL, ODBC and JDBC, XML, data warehousing, and emerging database trends. A major project is a key component of the course. CSCI 564 Constraint Processing and Heuristic Search Course Description: The course will examine combinatorial problem solving and optimization with constraint processing and heuristic search methods for a variety of real world applications. It contains two main parts. The first part covers basic and advanced search techniques and the second part studies constraint processing techniques and constraint programming CSCI 5xx Data Mining and Machine Learning Course Description: The course covers the most current techniques used in data mining and machine learning and their background theoretical results. Two basic groups of methods are covered in this course: supervised learning (classification or regression) and unsupervised learning (clustering). The supervised learning method includes Recursive Partitioning Tree, Random Forest, Linear Discriminant and Quadratic Discriminant Analysis, Neural Network, Support Vector Machine. The unsupervised learning method includes Hierarchical Clustering, K-means, K-nearest-neighbour, model-based clustering methods. Furthermore, the course also covers the dimensional reduction techniques such as LASSO and Ridge Regression, and model checking criteria.

CSCI 598 Research Course Description: Research necessary for the development of a Thesis Proposal will be accomplished in this course. The student will conduct background research in their area of interest, and with consultation and close interaction with his/her thesis supervisor, s/he will develop a thesis proposal which will review the background literature, pose a specific research question and discuss a methodology to address the problem. The written proposal will be handed in to the supervisory committee and an oral thesis proposal presentation will be made to the department. The supervisory committee will determine the suitability of the thesis project and make suggestions and modifications to the proposal as necessary.