Courses tagged with "Nutrition" (219)

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.

This course is an elementary introduction to number theory with no algebraic prerequisites. Topics covered include primes, congruences, quadratic reciprocity, diophantine equations, irrational numbers, continued fractions, and partitions. 

This course covers topics such as sums of independent random variables, central limit phenomena, infinitely divisible laws, Levy processes, Brownian motion, conditioning, and martingales.

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.

The main aims of this seminar will be to go over the classification of surfaces (Enriques-Castelnuovo for characteristic zero, Bombieri-Mumford for characteristic p), while working out plenty of examples, and treating their geometry and arithmetic as far as possible.

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.

The goal of this course is to describe some of the tools which enter into the proof of Sullivan's conjecture.

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.

This course covers harmonic theory on complex manifolds, the Hodge decomposition theorem, the Hard Lefschetz theorem, and Vanishing theorems. Some results and tools on deformation and uniformization of complex manifolds are also discussed.

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.

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.

Learn the theory of linear algebra hand-in-hand with the practice of software library development.

Throughout this course, we will use algebra to quantify and describe the world around us. Have you ever wondered how many songs can fit onto your flash drive? By the end of the course, you’ll have stronger skills for modeling problems, analyzing patterns, and using algebra to arrive at conclusions.

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.

课程从问题开始揭示一些数学思想形成的过程，和听众一起从思想上重走一遍前辈们走过的路，体会数学抽象的魅力。 In this course I share the processes which formed the core concepts of mathematical philosophy, walking with students as they experience, learn and enjoy mathematical abstraction.

這是一個機率的入門課程，著重的是教授機率基本概念。另外我們的作業將搭配臺大電機系所開發的多人競技線上遊戲方式，讓同學在遊戲中快樂的學習，快速培養同學們對於機率的洞察力與應用能力。

本课程以通俗的语言介绍粒子物理的主要内容和最前沿的研究。课程涉及的主要内容包括： 物质和反物质， 夸克和强相互作用，中微子和弱相互作用，对称性和它的作用， 粒子物理的标准模型，粒子天文学， 暗物质。 This course gives an brief introduction of the main content and the frontier of particle physics in popular language. It includes: matter and antimatter, quark and strong interaction, neutrino and weak interaction, symmetry and its applications, standard model of particle physics, particle astronomy, dark matter etc.