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 DNAencoded 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, nonparametric 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:DBMath, WAYAQR, WAYFR

Grading: Letter or Credit/No Credit
Instructors:
Khayms, V. (PI)
;
An, J. (TA)
;
Ayoul, T. (TA)
;
FournierBidoz, E. (TA)
;
Gao, P. (TA)
;
Genin, M. (TA)
;
Krason, M. (TA)
;
Lakshman, V. (TA)
;
Slottje, A. (TA)
CS 250: Error Correcting Codes: Theory and Applications (EE 387)
Introduction to the theory of error correcting codes, emphasizing diverse applications throughout computer science and engineering. Topics include basic bounds on error correcting codes; constructions like ReedSolomon, ReedMuller, and expander codes; listdecoding, listrecovery and locality. Applications 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: Aut

Units: 3

Grading: Letter or Credit/No Credit
Instructors:
Wootters, M. (PI)
;
Deligiannis, P. (TA)
EE 387: Error Correcting Codes: Theory and Applications (CS 250)
Introduction to the theory of error correcting codes, emphasizing diverse applications throughout computer science and engineering. Topics include basic bounds on error correcting codes; constructions like ReedSolomon, ReedMuller, and expander codes; listdecoding, listrecovery and locality. Applications 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: Aut

Units: 3

Grading: Letter or Credit/No Credit
Instructors:
Wootters, M. (PI)
;
Deligiannis, P. (TA)
Filter Results: