2013-2014 Graduate Catalog Downloadable PDF (10.71MB)

Course Descriptions/Computer Science and Engineering 389663. Real-Time Systems. (3-0). Credit 3. Taxonomy of real-time computer systems; scheduling algorithmsfor static and dynamic real-time tasks; hard real-time communications protocols; programming languagesand environments for real-time systems; case studies of real-time operating systems. Prerequisites:CSCE 313, and CSCE 463 or CSCE 611, or approval of instructor.664. Wireless and Mobile Systems. (3-0). Credit 3. Wireless and mobile systems; wireless communicationfundamentals; wireless medium access control design; transmission scheduling; network and transportprotocols over wireless design, simulation and evaluation; wireless capacity; telecommunication systems;vehicular, adhoc, and sensor network systems; wireless security; mobile applications. Prerequisite:CSCE 463 or CSCE 464 or approval of instructor.665. Advanced Networking and Security. (3-0). Credit 3. Security aspects of various network protocolsincluding investigation and tool development using “live” machines and networks. Prerequisites:Graduate classification and approval of instructor.666. Pattern Analysis. (3-0). Credit 3. Introduction to methods for the analysis, classification and clusteringof high dimensional data in Computer Science applications. Course contents include density and parameterestimation, linear feature extraction, feature subset selection, clustering, Bayesian and geometricclassifiers, non-linear dimensionality reduction methods from statistical learning theory and spectralgraph theory, Hidden Markov models, and ensemble learning. Prerequisites: MATH 222, MATH 411(or equivalent) and graduate classification.667. Seminar in Human-Centered Computing. (3-0). Credit 3. Problems, methods and recent developmentsin human-centered computing and information. May be repeated for credit as content varies.Prerequisites: Graduate classification.668. Distributed Algorithms and Systems. (3-0). Credit 3. Introduction to fundamental algorithmic resultsin distributed computing systems; leader election, mutual exclusion, consensus, logical time andcausality, distributed snapshots, algorithmic fault tolerance, shared memory, clock synchronization.Prerequisites: CSCE 411 or equivalent or approval of instructor.669. Computational Optimization. (3-0). Credit 3. Combinatorial theory of polytopes as a tool for thesolution of combinatorial optimization problems; applications to max flow, matching and matroids;geometric interpretation of the results indicating the profound role that polyhedral combinatorics playin the design and complexity of approximation algorithms. Prerequisite: CSCE 629.670. Information Storage and Retrieval. (3-0). Credit 3. Representation, storage, and access to very largemultimedia document collections; fundamental data structures and algorithms of information storageand retrieval systems; techniques to design and evaluate complete retrieval systems, including cover ofalgorithms for indexing, compressing, and querying very large collections. Prerequisites: CSCE 310 orCSCE 603 or approval of instructor; graduate classification.671. Computer-Human Interaction. (3-0). Credit 3. Comprehensive coverage of Computer-human Interaction(CHI) including history, importance, design theories and future direction; modeling computerusers and interfaces, empirical techniques for task analysis and interface design, and styles of interaction.Prerequisite: Graduate classification.672. Computer Supported Collaborative Work. (3-0). Credit 3. Covers design, implementation and useof technical systems that support people working cooperatively; draws from the research area of ComputerSupported Cooperative Work (CSCW) and includes current theoretical, practical, technical andsocial issues in CSCW and future directions of the field. Prerequisite: CSCE 671 or CSCE 610 or approvalof instructor.673. Information, Secrecy and Authentication I. (3-0). Credit 3. Preliminaries; probability, information,entropy, signals, channels; group-theoretic view of messages; contemporary secrecy and digitalsignature systems; one-time pads, DES, RSA, DSS, wheels, LFSR-based systems; analog scramblers;key exchange, key management, secret sharing, access structures; measures of security. Prerequisites:Graduate classification and approval of instructor. Cross-listed with MATH 673.674. Information, Secrecy and Authentication II. (3-0). Credit 3. Classical and recent attacks; login,compression, error control and genetic codes; finite and infinite codes; matrices, graphs, duals, groups,morphisms, composites, products, rates and classification of codes; the confusion/diffusion/arithmetic/calculusextension of Shannon’s two design primitives. Prerequisites: MATH 673; graduate classificationor approval of instructor. Cross-listed with MATH 674.