Skip Ribbon Commands
Skip to main content

CSRG

:

InnerPages: PH.D. LEVEL COURSES

Title

PH.D. LEVEL COURSES

Body

Required Course

 

Catalog Description

Types of computer networks: LANs, VLANs, and WANs. Routing algorithms and
routing protocols. The network development life cycle. Network analysis and design
methodology. Network design issues: Manageability; Node placement and sizing;
Link topology and sizing; Routing; Reliability. Data in support of network design.
Structured enterprise network design. Hierarchical tree network design: Terminal
assignment; Concentrator location. Mesh topology optimization. Traffic flow analysis.
Analysis of loss and delay in networks. Network reliability issues.

 

 

Elective Course

 

Catalog Description

Principles and practice of network and internetwork security. Mathematical principles
of cryptography and data security. Conventional and modern crypto systems. Secure
communication protocols. Authentication and Digital Signatures. Secure IP and SSL.
Modern applications like digital cash and secure distributed computing. Operational
aspects of computer and network security.

 

 

Elective Course

 

Catalog Description

Management Protocols. Remote Management. Configuration for Data Collection.
Monitoring and Reconfiguration. Operational Issues in Managing Heterogeneous
Networks under Different Operating Systems.

 

 

Elective Course

 

Catalog Description

Fundamental concepts in the theory of reliable computer systems design. Hardware and
software reliability techniques. Evaluation of fault-tolerant computer communication
systems. The practices of reliable system design. Case studies. Fault-tolerant topology
design. Computer networks reliability and fault-toler-ance. Fault tolerant high-speed
networks.

 

 

Elective Course

 

Catalog Description

Modeling. General concepts. Performance measures. Performance evaluation
techniques. Model Validation. Introduction to Queuing Networks and Stochastic Processes. Simulation. The modeling cycle. Queuing network modeling. Flow analysis.
Bottleneck analysis. Hierarchical modeling. Introduction to Analysis driven Design.
Case studies with applications to different aspects of computer network systems.

 

 

Required Course

 

Catalog Description

Information analysis. Information systems planning. Various approaches to Systems development: Participative, Prototyping, Phenomenological, Evolutionary,
etc. Systems development methodologies: Soft systems methodology, information engineering, SSADM, ISAC, etc. Systems development environments.
Deliverables. Project management and control.

 

 

Required Course

 

Catalog Description

Concepts of organizational planning. The Planning process. Computational sup-
port for planning. Understanding information systems planning: functions, proc-
esses, information groups, subject databases. Information systems planning meth-
odologies. Information needs analysis. Strategic planning of information sys-

tems. IS planning for competitive advantages. Students should complete an IS
plan real life situation of reasonable complexity as a term project.

 

 

Required Course

 

Catalog Description

Predicate calculus. Program semantics of guarded commands. Postconditions
and specifications. Weakest preconditions. Weakest liberal preconditions. Loop
invariants. Termination and non-termination. Partial and total functions. Non-
determinacy. Standard techniques in program derivation. Examples of program
derivation.

 

 

Required Course

 

Catalog Description

Formal methods for the description of programming languages. Operational,
axiomatic and denotational semantics, attribute grammar, two-level grammars.
Fixed-point theory of computation. Verification techniques.

 

 

Required Course

 

Catalog Description

Program optimization for speed and size. Reducing redundancy. Register alloca-
tion optimization. Data flow analysis and code optimization. Fast optimization
algorithms. Optimization methods in existing compilers. Optimization problems
for special languages.

 

 

Required Course

 

Catalog Description

Distributed system architectures and distributed processing. Communication
primitives: remote procedure call and message passing methods. Resource shar-
ing. Distributed deadlock management. Naming. Load balancing. Fault toler-
ance. File service. Protection issues. Design issues. Projects on important as-
pects of distributed and network operating systems. Case studies.

 

 

Required Course

 

Catalog Description

Various Parallel Computation Models, such as: PRAM Models, CRCW, CREW, ERCW,
EREW. Simulations of PRAM models. Alternation. Boolean Circuits. Parallel Com-
putation Thesis. Cellular Automata. Parallel Complexity Measures; NC Class.
Simulations of Different Parallel Computation Models.

 

 

Required Course

 

Catalog Description

Reliability and fault-tolerance of computer networks such as FDDI, double loop,
hypercube, multi-stage interconnection network, multiprocessor systems, etc.
Reliable and fault-tolerant routing, Reliability evaluation algorithms, Availabil-
ity and survivability of computer systems, Reliability models of JPL-STAR, FTMP,
ESS No. 1, PLURIBUS, etc. Software fault tolerance and reliability. Projects using
network reliability evaluation tools such as SYREL, SHARPE and SPNP.

 

 

Required Course

 

Catalog Description

Queuing theory. Stochastic Petrinets and Markov Chains. Separable queuing net-
works. Priority queuing systems. Evaluation studies: monitoring techniques,
modeling methods and model validation. Application of queuing theory to com-
puter time-sharing & multi-access systems, multiprocessor systems, intercon-
nection networks. Computer communication networks. Case studies of several
distributed and network system configurations.

 

 

Required Course

 

Catalog Description

Introduction to neural computation. Biological neurons. Fundamental concepts
behind various models of neural networks. Functional equivalence and conver-
gence properties of neural network models. Adaptation and learning in neural
networks: associative, competitive, inhibitory, and adaptive resonance models
of learning. Back-propagation, Hopfield Nets, Boltzmann machines, Cauchy ma-
chines, ART, and feature map (Kohonen model). Cognitron and neocognitron.
VLSI, optical, and software implementations. Potentials and limitations of neu-
ral networks. Applications to vision, speech, motor control and others. Projects.

 

  

Required Course

 

Catalog Description

Review of issues in robotics programming. In depth study of robotic program-
ming languages. Design and implementation of robotic programming languages
and environments. Single and multi-robot environments. Case studies. Project.

 

 

Required Course

 

Catalog Description

The physics of vision and its computational modeling. Applications to Robot
vision. Image formation and sensing. Basic image processing: edge finding, im-

age segmentation, and texture analysis. Reflectometry: brightness, color and
reflectance map. Shape from shading. Photogrammetry and stereo. Motion fields
and optic flow. Passive navigation and structure from motion. Active vision.
Representations, primer sketch, 2.5-D map, 3D map. Human visual system.

 

 

Required Course

 

Catalog Description

Mixed base number systems. Negative base arithmetic. Logarithmic based arith-
metic. Residue number systems. P-adic numbers. Signed digit arithmetic. Rep-
resentation of Complex numbers. Relational number arithmetic. Examples.

 

 

Required Course

 

Catalog Description

Parallel models of computation. Concept of pipelining at different levels of ar-
chitecture. Pipelined functional units. Pipelined vector processors. Vectorizing
compilers and software. Operating system support for vector scheduling and
load balancing. Parallel languages. Parallel algorithms. Concurrentization and
vectorization.

 

 

Required Course

 

Catalog Description

Impact of VLSI on computer architecture. Mapping algorithms onto array struc-
tures: dependency graphs, signal flow graphs. Design and analysis of systolic
arrays. Wave front array processors. Retiming and systolicization. Implementa-
tion and verification of array processors. Examples.

 

 

Required Course

 

Catalog Description

ASIC design methodologies. Programmable ASICS. Field Programmable Gate
Arrays: Architecture, Programming technologies, Design parameters and mod-
els. FPGA technology mapping techniques, Routing techniques, Placement tech-
niques and Testability.

 

 

Required Course

 

Catalog Description

Levels of abstraction: behavioral, structural, and physical levels. Design de-
scription. Module generation (functional cell generation, gate matrix layout,
PLAs, etc.) and Module optimization. High level synthesis: Intermediate forms
(data flow and control flow graphs), Scheduling algorithms, data flow and con-

trol flow synthesis, resource allocation, and module binding. Knowledge based
and expert system approach to Design Automation.

 

 

Required Course

 

Catalog Description

Fault Modeling. Test Generation. Built-in test and Self-test concepts for hierar-
chical circuit models. Complex microprocessors and semiconductor memories.

 

 

Required Course

 

Catalog Description

A specialized topic that may not be broad enough to be offered as a regular
course. To be arranged with the instructor.

 

 

Required Course

 

Catalog Description

Any state of the art topics or topics of recent interest in any areas in computer
science that may not fit well with the description of the previously mentioned
courses.



Required Course

 

Catalog Description

Any state of the art topics or topics of recent interest in any areas in computer
engineering that may not fit well with the description of the previously men-
tioned courses.

 

 

Required Course

 

Catalog Description

This involves attending the regular departmental seminars, presenting one work in one of the seminars, and producing a final report to the satisfaction of the seminar co-ordinator. This course carries not credit.

 

 

Required Course

 

Catalog Description

This is intended to document the effort that would have to be put into the
original work conducted by a potential Ph.D. aspirant.

 

 â€‹

Attachments

Created at 11/18/2015 2:40 PM by Webmaster of CCSE website CCSE
Last modified at 11/18/2015 2:40 PM by Webmaster of CCSE website CCSE