- EECS 638 Fundamentals of Expert Systems
- Basic information about expert systems: architecture of an expert system, building expert systems, uncertainty in expert systems, taxonomy of expert systems. Knowledge representation: first order logic, production systems, semantic nets, frames. Uncertainty in expert systems, one-valued approaches: probability theory, systems using Bayes' rule, and systems using certainty theory; two-valued approaches: systems using Dempster-Shafer theory and system INFERNO; set-valued approaches: systems using fuzzy set theory and systems using rough set theory. Prerequisite: EECS 560 or consent of instructor. LEC.
The class is not offered for the Spring 2019 semester.
|
- EECS 649 Introduction to Artificial Intelligence
- General concepts, search procedures, two-person games, predicate calculus and automated theorem proving, nonmonotonic logic, probabilistic reasoning, rule based systems, semantic networks, frames, dynamic memory, planning, machine learning, natural language understanding, neural networks. Prerequisite: Corequisite: EECS 368. LEC.
|
- EECS 662 Programming Languages
- Formal definition of programming languages including specification of syntax and semantics. Simple statements including precedence, infix, prefix, and postfix notation. Global properties of algorithmic languages including scope of declaration, storage allocation, grouping of statements, binding time of constituents, subroutines, coroutines, and tasks. Run-time representation of program and data structures. Prerequisite: EECS 368 and EECS 388 and EECS 560. LEC.
|
- EECS 672 Introduction to Computer Graphics
- Foundations of 2D and 3D computer graphics. Structured graphics application programming. Basic 2D and 3D graphics algorithms (modeling and viewing transformations, clipping, projects, visible line/surface determination, basic empirical lighting, and shading models), and aliasing. Prerequisite: EECS 448. LEC.
The class is not offered for the Spring 2019 semester.
|
- EECS 718 Graph Algorithms
- This course introduces students to computational graph theory and various graph algorithms and their complexities. Algorithms and applications covered will include those related to graph searching, connectivity and distance in graphs, graph isomorphism, spanning trees, shortest paths, matching, flows in network, independent and dominating sets, coloring and covering, and Traveling Salesman and Postman problems. Prerequisite: EECS 560 or graduate standing with consent of instructor. LEC.
The class is not offered for the Spring 2019 semester.
|
- EECS 739 Parallel Scientific Computing
- This course is concerned with the application of parallel processing to real-world problems in engineering and the sciences. State-of-the-art serial and parallel numerical computing algorithms are studied along with contemporary applications. The course takes an algorithmic design, analysis, and implementation approach and covers an introduction to scientific and parallel computing, parallel computing platforms, design principles of parallel algorithms, analytical modeling of parallel algorithms, MPI programming, direct and iterative linear solvers, numerical PDEs and meshes, numerical optimization, GPU computing, and applications of parallel scientific computing. Prerequisite: MATH 122 or MATH 126; MATH 290; experience programming in C, C++, or Fortran; EECS 639 (or equivalent.) Highly recommended: MATH 127 or MATH 223. LEC.
|
- EECS 755 Software Modeling and Analysis
- Modern techniques for modeling and analyzing software systems. Course coverage concentrates on pragmatic, formal modeling techniques that support predictive analysis. Topics include formal modeling, static analysis, and formal analysis using model checking and theorem proving systems. Prerequisite: EECS 368 or equivalent. LEC.
The class is not offered for the Spring 2019 semester.
|
- EECS 764 Analysis of Algorithms
- Models of computations and performance measures; asymptotic analysis of algorithms; basic design paradigms including divide-and-conquer, dynamic programming, backtracking, branch-and-bound, greedy method and heuristics; design and analysis of approximation algorithms; lower bound theory; polynomial transformation and the theory of NP-Completeness; additional topics may be selected from arithmetic complexity, graph algorithms, string matching, and other combinatorial problems. Prerequisite: EECS 660 or equivalent. LEC.
|
- EECS 773 Advanced Graphics
- Advanced topics in graphics and graphics systems. Topics at the state of the art are typically selected from: photorealistic rendering; physically-based lighting models; ray tracing; radiosity; physically-based modeling and rendering; animation; general texture mapping techniques; point-based graphics; collaborative techniques; and others. Prerequisite: EECS 672 or permission of instructor. LEC.
|
- EECS 774 Geometric Modeling
- Introduction to the representation, manipulation, and analysis of geometric models of objects. Implicit and parametric representations of curves and surfaces with an emphasis on parametric freeform curves and surfaces such as Bezier and Nonuniform Rational B-Splines (NURBS). Curve and surface design and rendering techniques. Introduction to solid modeling: representations and base algorithms. Projects in C/C++ using OpenGL. Prerequisite: EECS 672 or permission of instructor. LEC.
The class is not offered for the Spring 2019 semester.
|
- EECS 775 Visualization
- Data representations, algorithms, and rendering techniques typically used in Visualization applications. The emphasis is on Scientific Visualization and generally includes topics such as contouring and volumetric rendering for scalar fields, glyph and stream (integral methods) for vector fields, and time animations. Multidimensional, multivariate (MDMV) visualization techniques; scattered data interpolation; perceptual issues. Prerequisite: General knowledge of 3D graphics programming or instructor's permission. LEC.
The class is not offered for the Spring 2019 semester.
|
- EECS 830 Advanced Artificial Intelligence
- A detailed examination of computer programs and techniques that manifest intelligent behavior, with examples drawn from current literature. The nature of intelligence and intelligent behavior. Development of, improvement to, extension of, and generalization from artificially intelligent systems, such as theorem-provers, pattern recognizers, language analyzers, problem-solvers, question answerers, decision-makers, planners, and learners. Prerequisite: Graduate standing in the EECS department or Cognitive Science or permission of the instructor. LEC.
The class is not offered for the Spring 2019 semester.
|
- EECS 839 Mining Special Data
- Problems associated with mining incomplete and numerical data. The MLEM2 algorithm for rule induction directly from incomplete and numerical data. Association analysis and the Apriori algorithm. KNN and other statistical methods. Mining financial data sets. Problems associated with imbalanced data sets and temporal data. Mining medical and biological data sets. Induction of rule generations. Validation of data mining: sensitivity, specificity, and ROC analysis. Prerequisite: Graduate standing in CS or CoE or consent of instructor. LEC.
|
- EECS 940 Theoretic Foundation of Data Science
- A review of statistical and mathematical principles that are utilized in data mining and machine learning research. Covered topics include asymptotic analysis of parameter estimation, sufficient statistics, model selection, information geometry, function approximation and Hilbert spaces. Prerequisite: EECS 738, EECS 837, EECS 844 or equivalent. LEC.
|
- MATH 727 Probability Theory
- A mathematical introduction to premeasure-theoretic probability. Topics include probability spaces, conditional probabilities and independent events, random variables and probability distributions, special discrete and continuous distributions with emphasis on parametric families used in applications, the distribution problem for functions of random variables, sequences of independent random variables, laws of large numbers, and the central limit theorem. Prerequisite: MATH 223 and MATH 290, or equivalent. LEC.
The class is not offered for the Spring 2019 semester.
|
- MATH 728 Statistical Theory
- Theory of point estimation and hypothesis testing with applications. Confidence region methodologies and relations to estimation and testing. Prerequisite: MATH 727 or equivalent. LEC.
|
