2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

1 - 4 of 4 results for: CME106

BIOE 244: Advanced Frameworks and Approaches for Engineering Integrated Genetic Systems

Concepts and techniques for the design and implementation of engineered genetic systems. Topics covered include the quantitative exploration of tools that support (a) molecular component engineering, (b) abstraction and composition of functional genetic devices, (c) use of control and dynamical systems theory in device and systems design, (d) treatment of molecular "noise", (e) integration of DNA-encoded programs within cellular chassis, (f) designing for evolution, and (g) the use of standards in measurement, genetic layout architecture, and data exchange. Prerequisites: CME104, CME106, CHEM 33, BIO41, BIO42, BIOE41, BIOE42, and BIOE44 (or equivalents), or permission of the instructors.
Terms: Spr | Units: 4 | Grading: Letter or Credit/No Credit

CME 106: Introduction to Probability and Statistics for Engineers (ENGR 155C)

Probability: random variables, independence, and conditional probability; discrete and continuous distributions, moments, distributions of several random variables. Topics in mathematical statistics: random sampling, point estimation, confidence intervals, hypothesis testing, non-parametric tests, regression and correlation analyses; applications in engineering, industrial manufacturing, medicine, biology, and other fields. Prerequisite: CME 100/ENGR154 or MATH 51 or 52.
Terms: Win, Sum | Units: 4 | UG Reqs: GER:DB-Math, WAY-AQR, WAY-FR | Grading: Letter or Credit/No Credit

CS 250: Algebraic Error Correcting Codes (EE 387)

Introduction to the theory of error correcting codes, emphasizing algebraic constructions, and diverse applications throughout computer science and engineering. Topics include basic bounds on error correcting codes; Reed-Solomon and Reed-Muller codes; list-decoding, list-recovery and locality. Applications may include communication, storage, complexity theory, pseudorandomness, cryptography, streaming algorithms, group testing, and compressed sensing. Prerequisites: Linear algebra, basic probability (at the level of, say, CS109, CME106 or EE178) and "mathematical maturity" (students will be asked to write proofs). Familiarity with finite fields will be helpful but not required.
Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit

EE 387: Algebraic Error Correcting Codes (CS 250)

Introduction to the theory of error correcting codes, emphasizing algebraic constructions, and diverse applications throughout computer science and engineering. Topics include basic bounds on error correcting codes; Reed-Solomon and Reed-Muller codes; list-decoding, list-recovery and locality. Applications may include communication, storage, complexity theory, pseudorandomness, cryptography, streaming algorithms, group testing, and compressed sensing. Prerequisites: Linear algebra, basic probability (at the level of, say, CS109, CME106 or EE178) and "mathematical maturity" (students will be asked to write proofs). Familiarity with finite fields will be helpful but not required.
Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints