|
G9700: Report
0 cr.; Satisfies non-course requirement
I0000: Seminars in Computer Science
Recent developments in computer science. Students report on assigned
subjects.
Topics to be announced.
Variable cr.
I0102: Database Security and Integrity
The course will cover topics such as: database concepts, architecture,
and
models, plus database security and integrity in general. Specific
areas include:
privacy, models of database security, authorization languages and
classes,
data integrity, auditing and controls, and enforcement design (IMS,
DB2, INGRES;
distributed database systems, and object-oriented database
systems).
3 hr./wk.; 3 cr.
I0400: Operating Systems
Underlying theoretical structure of operating systems; input-output
and storage
systems, data management and processing; assembly and executive
systems, monitors;
multiprogramming. Prereq: CSc 33200 or an equivalent undergraduate
course.
3 hr./wk.; 3 cr.
I0500: Computer Graphics
An intensive introduction to computer graphics hardware, design of
graphics
packages, geometric transformations, 3D viewing and projections,
raster scan
conversion, visible surface determination, lighting and shading, 3D
shape
representation, and splines. Emphasis is on implementation of
important graphics
algorithms. Prereqs: CSc 32200 and Math 34600 or equivalent.
3 hr./wk.; 3 cr.
I0600: Fundamental Algorithms
An intensive study of advanced non-numerical programming techniques.
Data
representation; list, tree and string manipulation algorithms.
Recursive programming.
Introduction to searching and sorting. Storage management algorithms.
Comparative
efficiency of algorithms. Prereq: CSc 22000 or equivalent.
3 hr./wk.; 3 cr.
I0700: Compiler Construction
Techniques involved in analysis of source languages and generation of
efficient
object code. Parsing methods, storage allocation, programming language
semantics,
optimization techniques, interpreters, study of existing compilers and
their
special features. Prereqs: CSc 22000 and CSc 30400 or equivalent.
3 hr./wk.; 3 cr.
I0801 Computer Games
Different types of computer games, their history and implementation.
Strategy games, chess, game tree search, puzzles, random adversaries,
adventure games, text adventures, interactive fiction, simulations,
elementary game theory, war games, role-playing games, multiplayer games,
online games.
3 hr./wk.; 3 cr
I0804 Concurrent & Distributed Programming
Topics vary but may include
synchronization algorithms, semiformal specification and verification
methods, and languages for distributed programming.
3 hr./wk.; 3 cr.
I0807 Image Processing
An intensive introduction to imaging intended for graduate students
and advanced
undergraduates. Topics include digital filtering theory, image
enhancement,
image reconstruction, anti-aliasing, warping, and state-of-the-art
special
effects. These topics form the basis of high quality rendering in
computer
graphics, as well as low-level processing for computer vision, remote
sensing,
and medical imaging. Emphasizes computational techniques for
implementing
useful image processing functions. Programming assignments will
reinforce
material covered in class. Prereq: CSc 32200 or equivalent.
3 hr./wk; 3 cr.
I0900: Graph Theory and Algorithms
Extremal graph theory. Drawing planar graphs. Elementary graph
algorithms
(breadth-first search, depth-first search, topological sort). Minimum
spanning
trees. Single-source shortest paths. Maximum bipartite matching.
Connectivity
of graphs. Random graphs. Prereqs: CSc 20400 and 22000 or
equivalent.
3 hr./wk.; 3 cr.
I1000: Database Systems I
An introduction to database architecture. Levels of abstraction in a
database
system, physical data organization, abstract data models, relational
database
systems, and their query language. Prereqs: CSc 22000 and CSc 33200 or
equivalent.
3 hr./wk.; 3 cr.
I1100: Database Systems II
Logical models for database management systems, especially relational,
hierarchical
and network. Case studies illustrating their implications for
applications
system development. Physical implementation of advanced data and
storage structures.
Prereq: CSc I1000 or equivalent.
3 hr./wk.; 3 cr.
I1200: Topics in Algorithms
Recent developments in the design, analysis and implementation of
concrete
algorithms and their applications. Topics chosen from sequential,
parallel,
probabilistic, combinatorial and approximate algorithms. Prereqs: CSc
22000
and 30400 or equivalent.
3 hr./wk.; 3 cr.
I1210: Randomized Algorithms
Probability theory background, Las Vegas and Monte Carlo
algorithms , expected running time , error probability , one-sided errors;
randomized divide-and-conquer ; randomized incremental algorithms,
backwards analysis ; randomized LP solvers ; randomized testing
and verification ; randomized data structures ; random walks ,
rapidly mixing markov chains , and uniform generation of objects ;
probabilistic constructions ; random sampling , epsilon-nets ,
VC-dimension , range spaces and cuttings .
3 hr./wk.; 3 cr.
I1300: Searching and Sorting
Analysis of algorithms for manipulating advanced internal and external
data
and storage structures. Analysis of internal and external sorting
procedures.
Particular emphasis on application system development. Prereqs: CSc
20400
and CSc 22000 or equivalent.
3 hr./wk.; 3 cr.
I1400: Parallel Algorithms
Techniques of efficient program design. Analysis of parallel
algorithms
chosen from information storage and retrieval, graph theory,
pattern
matching, matric operations, etc. as to their time, space, and
other
resource requirements. Lower bounds for the intrinsic
computational
difficulty of some of these programs. Prereqs: CSc 22000, CSc
30400,
and CSc 44800 or equivalent.
3 hr./wk.; 3 cr.
I1500: Artificial Intelligence
The study of how to make the computer behave
“intelligently.” State-space
methods of problem solving, heuristic search techniques,
representation and
use of knowledge, mechanical theorem proving, psychological
implications.
Examples of game playing, problem solving, or other systems. Prereqs:
CSc
22000, 30400 and 44800 or equivalent.
3 hr./wk.; 3 cr.
I1600: Natural Language Processing
Methods for processing English texts and dialogues on the computer.
Parsing,
transformational analysis, semantic analysis, interfacing;
examples of
natural language sysems for carrying on dialogues and performing
tests.
Prereqs: CSc 44800, or CSc I1500 or equivalent
3 hr./wk.; 3 cr.
I1800: Topics in Artificial Intelligence
Selected topics from expert systems, automated systems and robotics;
automated
reasoning; computer vision. Prereq: CSc 44800 or CSc I1500 or
equivalent.
3 hr./wk.; 3 cr.
I1896: Computer Vision
A survey of the techniques used in computer vision, which recovers
information from images. There will be theoretical and
programming
homework, exams, and an individually chosen final project. The
course
will cover the geometry of image formation; multiple 2D techniques
for
feature detection, image segmentation, object recognition, and
texture;
and 3D shape from shading, stereo and motion. Some mathmatical
maturity
is assumed, including familiarity with linear algebra,
multidimensional
calculus and simple statistics. Prereqs: CSc 22000, 22100 and
Math 34600 or equivalent.
3 hr./wk.; 3 cr.
I1900: Pattern Recognition and Machine Learning
Generalization and classification; pattern recognition and perception;
concept
formation; remembering and forgetting; learning and hypothesis
formation.
Prereq: CSc 44800 or CSc I1500 or equivalent, and knowledge of Linear
Algebra.
3 hr./wk.; 3 cr.
I2000: Introduction to Theoretical Computer Science
Fundamental concepts from logic, models of computation, and complexity
theory. Scope and limitations of various formalisms. The Chomsky
hierarchy of languages and machines. Basic ideas for recursive
functions.
Impact on programming systems. Prereqs: CSc 30400 or
equivalent.
3 hr./wk.; 3 cr.
I2200: Theory of Computability
Formulations of effective computability: Sheperdson-Sturgis machines.
Turing
type models, recursive functions, and semi-Thue systems. The
equivalence of
the various formulations. Church’s Thesis. Fundamental theorems
of computability:
universal machines, S-M-N, and recursion theorem. Unsolvable problems.
Recursive
and r.e. sets. Prereq: CSc 30400 or CSc I2000 or equivalent.
3 hr./wk.; 3 cr.
I2400: Formal Language Theory
Classification of languages by grammars and automata. The Chomsky
hierarchy:
regular, context free, context sensitive and recursively enumerable
languages
and their associated grammars and automata. Closure properties for
families
of languages. Decision problems for grammars and automata. Prereq: CSc
30400
or CSc I2000 or equivalent.
3 hr./wk.; 3 cr.
I2600: Computational Complexity
Complexity measures for algorithmic systems, determinism vs.
non-determinism,
time vs. space, complexity hierarchies, aspects of the P-NP question,
inherent
complexity of specific algorithmic problems, recent applications to
cryptography.
Prereqs: CSc 30400 and CSc 22000 or CSc I0600.
3 hr./wk.; 3 cr.
I4300: Computer Communications
Introduction to the structure of teleprocessing systems with real time
capability.
Properties of terminals, data sets, communication control units, and
concentrators.
Existing common carriers, communication facilities, standard data
transmission
codes, and line control procedures. Supervisory programs to control
flow of
data and allocation of resources in the central processing unit.
Message flow
tracing and bottleneck identification. Prereqs: CSc 34200 and 32200 or
equivalent.
3 hr./wk.; 3 cr.
I4330: Advanced Topics in Internet Programming
The first part of the course will deal with platform independent
software
and data for Internet programming. The second part will address
Web
Services -- messaging over standard web protocols. Students will
be
exposed to current technologies and standards. Topics discussed
may
include: distributed objects and remote invocation, messaging,
name
services, security. Prereqs: CSc 34002 or CSc I4200.
3 hr./wk.; 3 cr.
I4722: High Performance Networks
High speed data transport network architectures and protocols; network
traffic engineering: data burstiness, traffic shaping, admission control;
network control: bandwidth management, rate adaptation, congestion
feedback; economic theory based network management: pricing of resources,
utility functions; Internet architectures: Diffserv and Intserv;
scalability and network overlays.
3 hr./wk.; 3 cr.
I4800: Codes, Cryptography, and Secure Communications
Concepts from probability and ifnormation theory entropy, codes for
compression, error-correcting codes, secrecy codes, block ciphers
and
public key cryptosystems, cryptographic protocols for secure
communication,
introduction to quantum cryptography.
3 hr./wk.; 3 cr.
I4900: Computer Security
An introduction to the principles and practices of computer security
in various
computing environments. Conventional encryption systems and classical
cryptography.
Confidentiality using conventional encryption. Public key encryption
and protocols
for authentication and digital signatures. Recent cryptanalytic
attacks on
conventional and public key systems. Intruders, viruses, and trusted
systems.
Firewalls and internetwork security. A survey of applications and
problems
arising in contemporary computer security. Prereqs: CSc 30400 and
22000 or
equivalent.
3 hr./wk.; 3 cr.
I6300: Decision Analysis
An introduction to decision-making under uncertainty. Bayes and
minimax criteria.
Utility theory, treatment of risk, and the value of information.
Two-person
and n-person games, stochastic linear programming models, policy
improvement
algorithm. Markovian decision processes. Application to system design,
management,
and production. Prereqs: CSc 22000 or CSc I0600, and an undergraduate
course
in probability.
3 hr./wk.; 3 cr.
I6400: Topics in System Simulation
Simulation methodology, design, and analysis of simulation
experiments. Generation
and testing of random variates. Variance reduction techniques.
Simulation
languages. Analysis of queuing models on computer systems simulation.
Prereqs:
CSc 22000 and 21700 or equivalent.
3 hr./wk.; 3 cr.
I6600: Probabilistic Models in Computer Science
Introduction to queuing theory. Birth and death processes. Single
server
and muliple server queuing systems. Priority disciplines. Time
sharing and
multiprogramming models. Selected topics in system reliability
theory.
Prereq: CSc 22000 or CSc I0600.
3hr./wk.; 3 cr.
I6722: Cluster Programming
The programming of parallel computing systems using an appropriate
distributed computing architecture: currently Message Passing
Interface (MPI). Emphasis on practical implementation of
physical science and engineering applications. Simulation of
distributed systems. Prereq: Csc 6730 or Permission of the
instructor.
3 hr./wk.; 3 cr.
I6724: Statistical Software and Pattern Understanding
A projects course studying and applying the main
techniques of Pattern Recognition to practical problems, as computer
recognition of hand written character. Students will develop software
using probabilistic appraches ( Bayesian Analysis ) to problems of
current interest in Computer Science. Grading is based on the projects
reports.
3 hr./wk.; 3 cr.
I6730: Data Reduction in the Physical Sciences
Computer modeling of problems in the Physical
Sciences and engineering.
Topics from current scientific activities of government agencies. Guest
speakers from government agencies. Fourier analysis and differential
equation modeling of large data sets. Implementation on serial computing
systems. A capstone course for students in the
`Data Reduction and Assimilation' program.
Prereq: MATLAB programming, background in science,
Permission of the instructor.
3 hr./wk.; 3 cr.
I6731: Methods of Computational Science
Applications of scientific computing to data reduction and analysis of
issues of current national concern (e.g. weather research, remote
sensing, ocean waves and currents). Survey of numerical analysis for PDEs
(exemplified in Fortran),
features of image processing, data visualization, neural nets.
3 hr./wk.; 3 cr.
I9600: Special Topics in Contemporary Computer Science
A research seminar course, focusing on a specialized and contemporary
topical
area of computer science. The course will present research articles
and technology
papers to students in the chosen topic, actively engaging them in the
presented
materials through their interactive discussions, writing of short
summary
reports, team projects, literature search and/or exams. Prereq:
advanced graduate
standing and permission of the instructor; coreq: CSc G9700
(zero-credit report).
3 hr./wk.; 3 cr.
I9800: Project
Experimental or theoretical project, under the direction of a faculty
advisor.
Student submits proposal, performs the required studies, and submits a
written
final report. Prereq: departmental approval.
3 cr.; satisfies non-course requirement
I9900: Research for Masters Thesis
Departmental approval required.
Variable cr.; satisfies non-course requirement.
| 
