Courses tagged with "Information environments" (59)
This graduate-level course is an advanced introduction to applications and theory of numerical methods for solution of differential equations. In particular, the course focuses on physically-arising partial differential equations, with emphasis on the fundamental ideas underlying various methods.
This course provides an introduction to the theory and practice of quantum computation. Topics covered include: physics of information processing, quantum logic, quantum algorithms including Shor's factoring algorithm and Grover's search algorithm, quantum error correction, quantum communication, and cryptography.
This is an advanced topics course in model theory whose main theme is simple theories. We treat simple theories in the framework of compact abstract theories, which is more general than that of first order theories. We cover the basic properties of independence (i.e., non-dividing) in simple theories, the characterization of simple theories by the existence of a notion of independence, and hyperimaginary canonical bases.
This course forms an introduction to a selection of mathematical topics that are not covered in traditional mechanical engineering curricula, such as differential geometry, integral geometry, discrete computational geometry, graph theory, optimization techniques, calculus of variations and linear algebra. The topics covered in any particular year depend on the interest of the students and instructor. Emphasis is on basic ideas and on applications in mechanical engineering. This year, the subject focuses on selected topics from linear algebra and the calculus of variations. It is aimed mainly (but not exclusively) at students aiming to study mechanics (solid mechanics, fluid mechanics, energy methods etc.), and the course introduces some of the mathematical tools used in these subjects. Applications are related primarily (but not exclusively) to the microstructures of crystalline solids.
This course is divided into two sections, Part I and Part II. Part I, found here, provides an introduction to statistical theory. A brief review of probability will be given mainly as background material, however, it is assumed to be known. Topics include normal distribution, limit theorems, Bayesian concepts, and testing, among others.
Part II prepares students for the remainder of the econometrics sequence and and can be found by visiting 14.381 Fall 2006.
This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.
The course consists of a sampling of topics from algebraic combinatorics. The topics include the matrix-tree theorem and other applications of linear algebra, applications of commutative and exterior algebra to counting faces of simplicial complexes, and applications of algebra to tilings.
This course provides an introduction to algebraic number theory. Topics covered include dedekind domains, unique factorization of prime ideals, number fields, splitting of primes, class group, lattice methods, finiteness of the class number, Dirichlet's units theorem, local fields, ramification, discriminants.
In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms.
This course will focus on various aspects of mirror symmetry. It is aimed at students who already have some basic knowledge in symplectic and complex geometry (18.966, or equivalent). The geometric concepts needed to formulate various mathematical versions of mirror symmetry will be introduced along the way, in variable levels of detail and rigor.
This course will give a detailed introduction to the theory of tensor categories and review some of its connections to other subjects (with a focus on representation-theoretic applications). In particular, we will discuss categorifications of such notions from ring theory as: module, morphism of modules, Morita equivalence of rings, commutative ring, the center of a ring, the centralizer of a subring, the double centralizer property, graded ring, etc.
The main goal of this course is to study the generalization ability of a number of popular machine learning algorithms such as boosting, support vector machines and neural networks. Topics include Vapnik-Chervonenkis theory, concentration inequalities in product spaces, and other elements of empirical process theory.
Wavelets are localized basis functions, good for representing short-time events. The coefficients at each scale are filtered and subsampled to give coefficients at the next scale. This is Mallat's pyramid algorithm for multiresolution, connecting wavelets to filter banks. Wavelets and multiscale algorithms for compression and signal/image processing are developed. Subject is project-based for engineering and scientific applications.
Trusted paper writing service WriteMyPaper.Today will write the papers of any difficulty.