Part of two-course sequence intended for PhD students in School of Public Health who need rigorous approach to probability/statistics/statistical inference with applications to research in public health. prereq: Background in calculus; intended for PhD students in public hlth and other hlth sci who need rigorous approach to probability/statistics and statistical inference with applications to research in public hlth

Second of two-course sequence. Rigorous approach to probability/statistics, statistical inference. Applications to research in public health. prereq: 7401; intended for PhD students in health sciences

Introduction to Bayesian methods. Comparison with traditional frequentist methods. Emphasizes data analysis via modern computing methods: Gibbs sampler, WinBUGS software package. prereq: [[7401 or STAT 5101 or equiv], [public health MPH or biostatistics or statistics] grad student] or instr consent

Sampling, sufficiency, estimation, test of hypotheses, size/power. Categorical data. Contingency tables. Linear models. Decision theory. prereq: [5101 or Math 5651 or instr consent]

Simple, multiple, and polynomial regression. Estimation, testing, prediction. Use of graphics in regression. Stepwise and other numerical methods. Weighted least squares, nonlinear models, response surfaces. Experimental research/applications. prereq: 3032 or 3022 or 4102 or 5021 or 5102 or instr consent Please note this course generally does not count in the Statistical Practice BA or Statistical Science BS degrees. Please consult with a department advisor with questions.

Bivariate and multivariate distributions. Multivariate normal distributions. Analysis of multivariate linear models. Repeated measures, growth curve, and profile analysis. Canonical correlation analysis. Principal components and factor analysis. Discrimination, classification, and clustering. pre-req: STAT 3032 or 3301 or 3022 or 4102 or 5021 or 5102 or instr consent Although not a formal prerequisite of this course, students are encouraged to have familiarity with linear algebra prior to enrolling. Please consult with a department advisor with questions.

Characteristics of time series. Stationarity. Second-order descriptions, time-domain representation, ARIMA/GARCH models. Frequency domain representation. Univariate/multivariate time series analysis. Periodograms, non parametric spectral estimation. State-space models. prereq: STAT 4102 or STAT 5102

Linear/generalized linear models, modern regression methods including nonparametric regression, generalized additive models, splines/basis function methods, regularization, bootstrap/other resampling-based inference. prereq: Statistics grad or instr consent

Logical development of probability, basic issues in statistics. Probability spaces, random variables, their distributions/expected values. Law of large numbers, central limit theorem, generating functions, sampling, sufficiency, estimation. prereq: [2263 or 2374 or 2573], [2243 or 2373]; [2283 or 2574 or 3283] recommended.

Logical development of probability, basic issues in statistics. Probability spaces. Random variables, their distributions and expected values. Law of large numbers, central limit theorem, generating functions, multivariate normal distribution. prereq: (MATH 2263 or MATH 2374 or MATH 2573H), (MATH 2142 or CSCI 2033 or MATH 2373 or MATH 2243)

Probability, random variables and random processes. System response to random inputs. Gaussian, Markov and other processes for modeling and engineering applications. Correlation and spectral analysis. Estimation principles. Examples from digital communications and computer networks. prereq: [3025, CSE grad student] or dept consent

Deterministic and random approaches to learning and inference from data, with applications to statistical models for estimation, detection, and classification. Algorithms and their performance include minimum-variance unbiased estimators, sufficient statistics, fundamental bounds, (non)linear least-squares, maximum-likelihood, expectation-maximization, nonparametric density estimators, mean-square error and Bayesian estimators, importance sampling, Kalman and particle filtering, sequential probability ratio test, bootstrap, Monte Carlo Markov Chains, and graphical models. prereq: courses in Stochastic Processes (EE 5531) and Digital Signal Processing (EE 4541)

T-tests, confidence intervals, power, type I/II errors. Exploratory data analysis. Simple linear regression, regression in matrix notation, multiple regression, diagnostics. Ordinary least squares, violations, generalized least squares, nonlinear least squares regression. Introduction to General linear Model. SAS and S-Plus used. prereq: [[Stat 5101 or concurrent registration is required (or allowed) in Stat 5101], biostatistics major] or instr consent

This course introduces students to a variety of concepts, tools, and techniques that are relevant to the rigorous design and analysis of complex biomedical studies. Topics include ANOVA, sample-size calculations, multiple testing, missing data, prediction, diagnostic testing, smoothing, variable selection, the bootstrap, and nonparametric tests. R software will be used. Biostatistics students are strongly encouraged to typeset their work using LaTeX or in R markdown. prereq: [7405, [STAT 5102 or concurrent registration is required (or allowed) in STAT 5102], biostatistics major] or instr consent

Contingency tables, odds ratio, relative risk, chi-square tests, log-linear models, logistic regression, conditional logistic regression, Poisson regression, matching, generalized linear models for independent data. SAS/S-Plus used throughout. prereq: 7405, [Stat 5102 or concurrent registration is required (or allowed) in Stat 5102 or Stat 8102 or concurrent registration is required (or allowed) in Stat 8102]

Correlated data arise in many situations, particularly when observations are made over time and space or on individuals who share certain underlying characteristics. This course covers techniques for exploring and describing correlated data, along with statistical methods for estimating population parameters (mostly means) from these data. The focus will be primarily on generalized linear models (both with and without random effects) for normally and non-normally distributed data. Wherever possible, techniques will be illustrated using real-world examples. Computing will be done using R and SAS. prereq: Regression at the level of PubH 6451 or PubH 7405 or Stat 5302. Familiarity with basic matrix notation and operations (multiplication, inverse, transpose). Working knowledge of SAS or R (PubH 6420).

Although most of statistical inference focuses on associational relationships among variables, in many biomedical and health sciences contexts the focus is on establishing the causal effect of an intervention or treatment. Drawing causal conclusions can be challenging, particularly in the context of observational data, as treatment assignment may be confounded. The first part of this course focuses on methods to establish the causal effect of a point exposure, i.e., situations in which treatment is given at a single point in time. Methods to estimate causal treatment effects will include outcome regression, propensity score methods (i.e., inverse weighting, matching), and doubly robust approaches. The second half of the course focuses on estimating the effect of a series of treatment decisions during the course of a chronic disease such as cancer, substance abuse, mental health disorders, etc. Methods to estimate these time-varying treatments include marginal structural models estimated by inverse probability weighting, structural nested models estimated by G-estimation, and the (parametric) G-computation algorithm. We will then turn our attention to estimating the optimal treatment sequence for a given subject, i.e., how to determine “the right treatment, for the right patient, at the right time,” using dynamic marginal structural models and methods derived from reinforcement learning (e.g., Q-learning, A-learning) and classification problems (outcome weighted learning, C-learning). PubH 8485 is appropriate for Ph.D students in Biostatistics and Statistics. The homework and projects will focus more on the theoretical aspects of the methods to prepare students for methodological research in this area. PubH 7485 is appropriate for Masters students in Biostatistics and PhD students in other fields who wish to learn causal methods to apply them to topics in the health sciences. This course uses the statistical software of R, a freely available statistical software package, to implement many of the methods we discuss. However, most of the methods discussed in this course can be implemented in any statistical software (e.g., SAS, Stata, SPSS, etc.) and students will be free to use any software for homework assignments. prereq: Background in regression (e.g. linear, logistic, models) at the level of PubH 7405-7406, PubH 6450-6451, PubH 7402, or equiv. Background in statistical theory (Stat 5101-5102 or PubH 7401) is helpful.

This course is concerned with the theory and application of linear models. The first part of the course will focus on general linear model theory from a coordinate-free geometric approach. The second half of the course covers theory, applications and computing for linear models, and concentrates on modeling, computation and data analysis. It is intended as a core course for biostatistics PhD students and statistics PhD students. prereq: [[7405, concurrent registration is required (or allowed) in STAT 8101] or instr consent], calculus, familiar wtih matrix/linear algebra

Three basic models used for stochastic processes in the biomedical sciences: point processes (emphasizes Poisson processes), Markov processes (emphasizes Markov chains), and Brownian motion. Probability structure and statistical inference studied for each process. prereq: [7450, 7407, Stat 5102, [advanced biostatstics or statistics] major] or instr consent

Theory/application of Bayesian methods. Bayesian methods compared with traditional, frequentist methods. prereq: [[7460 or experience with FORTRAN or with [C, S+]], Stat 5101, Stat 5102, Stat 8311, grad student in [biostatistics or statistics]] or instr consent

Simple random, systematic, stratified, unequal probability sampling. Ratio, model based estimation. Single stage, multistage, adaptive cluster sampling. Spatial sampling. prereq: 3022 or 3032 or 3301 or 4102 or 5021 or 5102 or instr consent

Analysis of variance. Multiple comparisons. Variance-stabilizing transformations. Contrasts. Construction/analysis of complete/incomplete block designs. Fractional factorial designs. Confounding split plots. Response surface design. prereq: 3022 or 3032 or 3301 or 4102 or 5021 or 5102 or instr consent

Varieties of categorical data, cross-classifications, contingency tables. Tests for independence. Combining 2x2 tables. Multidimensional tables/loglinear models. Maximum-likelihood estimation. Tests for goodness of fit. Logistic regression. Generalized linear/multinomial-response models. prereq: STAT 3022 or 3032 or 3301 or 5302 or 4051 or 8051 or 5102 or 4102

Order statistics. Classical rank-based procedures (e.g., Wilcoxon, Kruskal-Wallis). Goodness of fit. Topics may include smoothing, bootstrap, and generalized linear models. prereq: Stat classes 3032 or 3022 or 4102 or 5021 or 5102 or instr consent

Problems of pattern recognition, feature selection, measurement techniques. Statistical decision theory, nonstatistical techniques. Automatic feature selection/data clustering. Syntactic pattern recognition. Mathematical pattern recognition/artificial intelligence. Prereq: [2031 or 2033], STAT 3021, and knowledge of partial derivatives

Data pre-processing techniques, data types, similarity measures, data visualization/exploration. Predictive models (e.g., decision trees, SVM, Bayes, K-nearest neighbors, bagging, boosting). Model evaluation techniques, Clustering (hierarchical, partitional, density-based), association analysis, anomaly detection. Case studies from areas such as earth science, the Web, network intrusion, and genomics. Hands-on projects. prereq: 4041 or equiv or instr consent

Models of learning. Supervised algorithms such as perceptrons, logistic regression, and large margin methods (SVMs, boosting). Hypothesis evaluation. Learning theory. Online algorithms such as winnow and weighted majority. Unsupervised algorithms, dimensionality reduction, spectral methods. Graphical models. prereq: Grad student or instr consent

Methods for estimating dependencies from data have been traditionally explored in such diverse fields as: statistics (multivariate regression and classification), engineering (pattern recognition, system identification), computer science (artificial intelligence, machine learning, data mining) and bioinformatics. Recent interest in learning methods is triggered by the widespread use of digital technology and availability of data. Unfortunately, developments in each field are seldom related to other fields. This course is concerned with estimation of predictive data-analytic models that are estimated using past data, but are used for prediction or decision making with new data. This course will first present general conceptual framework for learning predictive models from data, using Vapnik-Chervonenkis (VC) theoretical framework, and then discuss various methods developed in statistics, pattern recognition and machine learning. Course descriptions will emphasize methodological aspects of machine learning, rather than development of ‘new’ algorithms. prereq: CSE grad student or instr consent

Statistical techniques for extracting useful information from data. Linear discriminant analysis, tree-structured classifiers, feed-forward neural networks, support vector machines, other nonparametric methods, classifier ensembles (such as bagging/boosting), unsupervised learning. prereq: [[[6450, 6451, 6452] or STAT 5303 or equiv], [biostatistics or statistics PhD student]] or instr consent

Additional topics in numerical analysis. Interpolation, approximation, extrapolation, numerical integration/differentiation, numerical solutions of ordinary differential equations. Introduction to optimization techniques. prereq: 2031 or 2033 or instr consent

Perturbation theory for linear systems and eigenvalue problems. Direct/iterative solution of large linear systems. Matrix factorizations. Computation of eigenvalues/eigenvectors. Singular value decomposition. LAPACK/other software packages. Introduction to sparse matrix methods. prereq: 2031 or 2033 or instr consent

Introduction to AI. Problem solving, search, inference techniques. Logic/theorem proving. Knowledge representation, rules, frames, semantic networks. Planning/scheduling. Lisp programming language. prereq: [2041 or instr consent], grad student

Uncertainty in artificial intelligence. Probability as a model of uncertainty, methods for reasoning/learning under uncertainty, utility theory, decision-theoretic methods. prereq: [STAT 3021, 4041] or instr consent

Fundamental theory/practice in data visualization. Programming applications. Perceptual issues in effective data representation, multivariate visualization, information visualization, vector field/volume visualization. prereq: [1913, 4041] or equiv or instr consent

Sparsity and sparse matrices. Data structures for sparse matrices. Direct methods for sparse linear systems. Reordering techniques to reduce fill-in such as minimal degree ordering and nested dissection ordering. Iterative methods. Preconditioning algorithms. Algorithms for sparse eigenvalue problems and sparse least-squares. prereq: 5304 or numerical linear algebra course or instr consent

Nonlinear optimization. Analytical/computational methods. Constrained optimization methods. Convex analysis, Lagrangian relaxation, non-differentiable optimization, applications in integer programming. Optimality conditions, Lagrange multiplier theory, duality theory. Control, communications, management science applications. prereq: [3025, Math 2373, Math 2374, CSE grad student] or dept consent

Basic probability theory, stochastic processes. Gauss-Markov model. Batch/recursive least squares estimation. Filtering of linear/nonlinear systems. Continuous-time Kalman-Bucy filter. Unscented Kalman filter, particle filters. Applications. prereq: [[[MATH 2243, STAT 3021] or equiv], CSE grad student] or dept consent; 3025, 4231 recommended

Algorithm techniques for enhancing the scalability of parallel software: scatter-to-gather, problem decomposition, binning, privatization, tiling, regularization, compaction, double-buffering, and data layout. These techniques address the most challenging problems in building scalable parallel software: limited parallelism, data contention, insufficient memory bandwidth, load balance, and communication latency. Programming assignments will be given to reinforce the understanding of the techniques. prereq: basic knowledge of CUDA, experience working in a Unix environment, and experience developing and running scientific codes written in C or C++. Completion of EE 5351 is not required but highly recommended.

Design, application, and implementation of optimum/adaptive discrete-time FIR/IIR filters. Wiener, Kalman, and Least-Squares. Linear prediction. Lattice structure. LMS, RLS, and Levinson-Durbin algorithms. Channel equalization, system identification, biomedical/sensor array processing, spectrum estimation. Noise cancellation applications. prereq: [4541, 5531, CSE grad student] or dept consent

Multirate discrete-time systems with applications in modern signal and data processing problems. Hilbert Spaces and Linear Operators; Reisz Bases and Frames; Vector Space Representation of Sampling, Interpolation, Time-frequency analysis and wavelets; Filterbanks and Polyphase Structures; Sparsity and redundancy with applications in linear and nonlinear approximation, super-resolution, blind-source separation. prereq: [CSE grad student] or dept consent

Image enhancement, denoising, segmentation, registration, and computational imaging. Sampling, quantization, morphological processing, 2D image transforms, linear filtering, sparsity and compression, statistical modeling, optimization methods, multiresolution techniques, artificial intelligence concepts, neural networks and their applications in classification and regression tasks in image processing. Emphasis is on the principles of image processing. Implementation of algorithms in Matlab/Python and using deep learning frameworks. prereq: [4541, 5581, CSE grad student] or instr consent

Source/channel models, codes for sources/channels. Entropy, mutual information, capacity, rate-distortion functions. Coding theorems. prereq: [5531, CSE grad student] or dept consent

Source coding in digital communications and recording. Codes for lossless compression. Universal lossless codes. Lossless image compression. Scalar and vector quantizer design. Loss source coding theory. Differential coding, trellis codes, transform/subband coding. Analysis/synthesis schemes. prereq: CSE grad student or dept consent

Introduction to optimization in engineering; approximation theory. Least squares estimation, optimal control theory, and computational approaches. prereq: instr consent

Linear programming, simplex method, duality theory, sensitivity analysis, interior point methods, integer programming, branch/bound/dynamic programming. Emphasizes applications in production/logistics, including resource allocation, transportation, facility location, networks/flows, scheduling, production planning. prereq: Upper div or grad student or CNR

Theory and applications of linear and nonlinear optimization. Linear optimization: simplex method, convex analysis, interior point method, duality theory. Nonlinear optimization: interior point methods and first-order methods, convergence and complexity analysis. Applications in engineering, economics, and business problems. prereq: Familiarity with linear algebra and calculus.

Topics in integer programming and combinatorial optimization. Formulation of models, branch-and-bound. Cutting plane and branch-and-cut algorithms. Polyhedral combinatorics. Heuristic approaches. Introduction to computational complexity.

Special topics determined by instructor. Examples include Markov decision processes, stochastic programming, integer/combinatorial optimization, and queueing networks.

Distributed system design and implementation. Distributed communication and synchronization, data replication and consistency, distributed file systems, fault tolerance, and distributed scheduling. prereq: [5103 or equiv] or instr consent

Parallel architectures design, embeddings, routing. Examples of parallel computers. Fundamental communication operations. Performance metrics. Parallel algorithms for sorting. Matrix problems, graph problems, dynamic load balancing, types of parallelisms. Parallel programming paradigms. Message passing programming in MPI. Shared-address space programming in openMP or threads. prereq: 4041 or instr consent

Concepts, database architecture, alternative conceptual data models, foundations of data manipulation/analysis, logical data models, database designs, models of database security/integrity, current trends. prereq: [4041 or instr consent], grad student

Lectures and informal discussions. prereq: instr consent

Parallel programming/architecture. Application development for many-core processors. Computational thinking, types of parallelism, programming models, mapping computations effectively to parallel hardware, efficient data structures, paradigms for efficient parallel algorithms, application case studies. prereq: [4363 or equivalent], programming experience (C/C++ preferred)

Design/implementation of multiprocessor systems. Parallel machine organization, system design. Differences between parallel, uniprocessor machines. Programming models. Synchronization/communication. Topologies, message routing strategies. Performance optimization techniques. Compiler, system software issues. prereq: 5364 or CSci 5204

Techniques in commercial/research-oriented database systems. Catalogs. Physical storage techniques. Query processing/optimization. Transaction management. Mechanisms for concurrency control, disaster recovery, distribution, security, integrity, extended data types, triggers, and rules. prereq: 4041 or 4707 or 5707 or instr. consent

Concepts, principles, protocols, and applications of computer networks. Layered network architectures, data link protocols, local area networks, network layer/routing protocols, transport, congestion/flow control, emerging high-speed networks, network programming interfaces, networked applications. Case studies using Ethernet, Token Ring, FDDI, TCP/IP, ATM, Email, HTTP, and WWW. prereq: [4061 or instr consent], basic knowledge of [computer architecture, operating systems, probability], grad student

Concepts of computer, network, and information security. Risk analysis, authentication, access control, security evaluation, audit trails, cryptography, network/database/application security, viruses, firewalls. prereq: 4061 or 5103 or equiv or instr consent

Spatial databases and querying, spatial big data mining, spatial data-structures and algorithms, positioning, earth observation, cartography, and geo-visulization. Trends such as spatio-temporal, and geospatial cloud analytics, etc. prereq: Familiarity with Java, C++, or Python

Advanced introduction to software engineering. Software life cycle, development models, software requirements analysis, software design, coding, maintenance. prereq: 2041 or instr consent

Introduction to software testing, software maturity models, cost specification models, bug estimation, software reliability models, software complexity, quality control, and experience report. Student groups specify, design, implement, and test partial software systems. Application of general software development methods and principles from 5801. prereq: 5801 or instr consent

Fundamental principles underlying design of distributed and multiprocessor operating systems. Foundations of distributed computing systems; shared multiprocessor systems. prereq: 8101 or instr consent

Research papers from journals and conferences on current topics in databases, such as database research methodologies, relational implementation techniques, active databases, storage systems, benchmarking, distributed and parallel databases, new data models, prototype systems, data mining, and future directions. prereq: 5708 or instr consent

Motivation, models of spatial information, querying spatial data, processing strategies for spatial queries, multi-dimensional storage/access methods, spatial graph datasets, spatial data mining, trends (e.g., spatio-temporal databases, mobile objects, raster databases), research literature, how to pursue research. prereq: 4707 or 5707 or 5715 or GIS 5571 or GIS 5573

Database systems for emerging applications, nontraditional query processors, multi-dimensional data indexing. Current research trends. prereq: 4707 or 5707 or 5708

Software reusability, internet/intranet programming, software reengineering, and software safety. prereq: 5801 or instr consent

Tools/techniques for analyzing computer hardware, software, system performance. Benchmark programs, measurement tools, performance metrics. Deterministic/probabilistic simulation techniques, random number generation/testing. Bottleneck analysis. prereq: [4363 or 5361 or CSci 4203 or 5201], [CSE grad student] or dept consent

Theory/techniques of modern digital communications. Communication limits. Modulation/detection. Data transmission over channels with intersymbol interference. Optimal/suboptimal sequence detection. Equalization. Error correction coding. Trellis-coded modulation. Multiple access. prereq: [3025, 4501, CSE grad student] or dept consent

Theory, design, programming, and evaluation of interactive application interfaces. Human capabilities and limitations, interface design and engineering, prototyping and interface construction, interface evaluation, and topics such as data visualization and World Wide Web. Course is built around a group project. prereq: 4041 or instr consent

Computational methods for analyzing, integrating, and deriving predictions from genomic/proteomic data. Analyzing gene expression, proteomic data, and protein-protein interaction networks. Protein/gene function prediction, Integrating diverse data, visualizing genomic datasets. prereq: 3003 or 4041 or instr consent

Techniques to analyze biological data generated by genome sequencing, proteomics, cell-wide measurements of gene expression changes. Algorithms for single/multiple sequence alignments/assembly. Search algorithms for sequence databases, phylogenetic tree construction algorithms. Algorithms for gene/promoter and protein structure prediction. Data mining for micro array expression analysis. Reverse engineering of regulatory networks. prereq: 4041 or instr consent

Issues in perspective transformations, edge detection, image filtering, image segmentation, and feature tracking. Complex problems in shape recovery, stereo, active vision, autonomous navigation, shadows, and physics-based vision. Applications. prereq: CSci 5511, 5521, or instructor consent.

Lectures and informal discussions on current topics in computer science. prereq: instr consent; may be repeated for cr

Current research issues in human-computer interaction, user interface toolkits and frameworks, and related areas. Research techniques, model-based development, gesture-based interfaces, constraint-based programming, event processing models, innovative systems, HCI in multimedia systems. prereq: 5115 or instr consent

Recent security/privacy issues in computer systems/networks. Threats, attacks, countermeasures. Security research, authentication, network security, wireless security, computer system security, anonymous system, pseudonym, access control, intrusion detection system, cryptographic protocols. How to pursue research in security and design secure systems. prereq: [5211, 5103] or instr consent; 5471 or EE 5248 or Math 5248 or equiv recommended

Computational methods in linear algebra, matrix decompositions for linear equations, least squares, eigenvalue problems, singular value decomposition, conditioning, stability in method for machine learning, large data collections. Principal directions, unsupervised clustering, latent semantic indexing, linear least squares fit. Markov chain models on hyperlink structure. prereq: 5304 or instr consent

Motivation, models of spatial information, querying spatial data, processing strategies for spatial queries, multi-dimensional storage/access methods, spatial graph datasets, spatial data mining, trends (e.g., spatio-temporal databases, mobile objects, raster databases), research literature, how to pursue research. prereq: 4707 or 5707 or 5715 or GIS 5571 or GIS 5573

DBMS support for biological databases, data models. Searching integrated public domain databases. Queries/analyses, DBMS extensions, emerging applications. prereq: 4707 or 5707 or instr consent

Background theory/experience in wavelets. Inner product spaces, operator theory, Fourier transforms applied to Gabor transforms, multi-scale analysis, discrete wavelets, self-similarity. Computing techniques. prereq: [2243 or 2373 or 2573], [2283 or 2574 or 3283 or instr consent]; [[2263 or 2374], 4567] recommended

Exploring big data infrastructure and ecosystem, ingesting and managing big data, analytics with big data; Hadoop, MapReduce, Hive, Spark, scalable machine Learning, scalable real-time streaming analytics, NoSQL, cloud computing, and other recent developments in big data.

Various statistical techniques for extracting useful information (i.e., learning) from data. Linear discriminant analysis, tree-structured classifiers, feed-forward neural networks, support vector machines, other nonparametric methods, classifier ensembles, unsupervised learning. prereq: [[[6450, 6452] or equiv], programming backgroud in [FORTRAN or C/C++ or JAVA or Splus/R]] or instr consent; 2nd yr MS recommended

Introduction to statistical problems arising in molecular biology. Problems in physical mapping (radiation hybrid mapping, DDP), genetic mapping (pedigree analysis, lod scores, TDT), biopolymer sequence analysis (alignment, motif recognition), and micro array analysis. prereq: [[[Stat 8101, Stat 8102] or equiv], PhD student] or instr consent; some background with molecular biology desirable

Genetic mapping of complex traits in humans, modern population genetics with an emphasis on inference based observed molecular genetics data, association studies; statistical methods for low/high level analysis of genomic/proteomic data. Multiple comparison and gene network modeling. prereq: [7445, statistical theory at level of STAT 5101-2; college-level molecular genetics course is recommended] or instr consent

Spatial data, spatial statistical models, and spatial inference on unknown parameters or unobserved spatial data. Nature of spatial data. Special analysis tools that help to analyze such data. Theory/applications. prereq: [[STAT 5101, STAT 5102] or [STAT 8101, STAT 8102]], some experience with S-plus; STAT 8311 recommended

Recent developments in computer science and related disciplines. Students must attend 13 of the 15 lectures.

Recent developments in Data Science and related disciplines. Students must attend 13 of the 15 lectures.

Project arranged between student and faculty.