College Algebra is an introductory text for a college algebra survey course. The material is presented at a level intended to prepare students for Calculus while also giving them relevant mathematical skills that can be used in other classes. The authors describe their approach as "Functions First," believing introducing functions first will help students understand new concepts more completely. Each section includes homework exercises, and the answers to most computational questions are included in the text (discussion questions are open-ended).
Lecture, discussion, lab. The architecture and machine-level operations of modern computers at the logic, component, and system levels. Topics include integer, scaled, and floating point binary arithmetic; Boolean algebra and logic gates; control, arithmetic-logic, and pipeline units; addressing modes; cache, primary, and virtual memory; system buses; input-output and interrupts. Simple assembly language for a modern embedded processor is used to explore how common computational tasks are accomplished by a computer. Two lectures, one discussion, and one lab session per week. Laboratory exercises, homework exercises, in-class quizzes, two midterm exams, and a final exam. Prerequisite: CMPSCI 187 or ECE 242 or equivalent. Comment on Lab 1: Students registering for CMPSCI H01 must register for Lab 1.4 credits.
Machine learning is the computational study of methods for making statistically reliable inferences combining observed data and prior knowledge (models). This is a mathematically rigorous introduction to two major strands of research in machine learning: parametric approaches based on probabilistic graphical models, and nonparametric approaches based on kernel methods. Graphical models are a compact way of representing probability distributions over a large set ofdiscrete and continuous variables. "Learning" in parametric models corresponds to maximum likelihood estimation, i.e. find the parameters that maximize the likelihood of the data. By contrast, "learning" in nonparametric kernel-based models corresponds to finding a weighted sum of kernel functions applied to the data. Detailed course topics: mathematical foundations, Bayesian classifiers, maximum likelihood and maximum a posteriori (MAP) estimation, missing data and expectation maximization (EM), mixture models and hidden-Markov models, logistic regression and generalized linear models, maximum entropy and undirected graphical models, nonparametric models for densityestimation, reproducing kernel Hilbert spaces and the Representer theorem, margin classifiers and support vector machines, dimensionality reduction methods (PCA and LDA), computational learning theory, VC-dimension theory. State-of-the-art applications including bioinformatics, information retrieval, robotics, sensor networks and vision, will be used to illustrate the theory. There will be extensive homework exercises including mini-projects, a midterm, a final exam, and a group project. Prerequisites: undergraduate level probability and statistics, linear algebra, calculus, AI; computer programming in some high level language. 3 credits. 2b1af7f3a8