Data Directed Design
sort by: Relevancy | Title | Rating try advanced search for more options
-
Earn your MBA from UNC’s Kenan-Flagler Business School UNC Kenan-Flagler is one of the world's top-ranked business schools. At UNC Kenan-Flagler, you develop the skills that make you a highly effective leader and prepare you for long-term career success. The strength of the UNC Kenan-Flagler MBA degree comes from a school culture in which members live the business school’s core values of excellence, leadership, teamwork, integrity and...more
-
This course is the second of a two-term sequence. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of Principles of Digital Communication I and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and
Concentrates on recognizing and solving convex optimization problems that arise in engineering. Topics include: Convex sets, functions, and optimization problems. Basics of convex analysis. Least-squares, linear and quadratic programs, semidefinite programming, minimax, extremal volume, and other problems. Optimality conditions, duality theory, theorems of alternative, and applications. Interiorpoint methods. Applications to signal...more
-
How can we harness the emerging forms of interactive media to enhance the learning process? Professor Miyagawa and prominent guest speakers will explore a broad range of issues on new media and learning - technical, social, and business. Concrete examples of use of media will be presented as case studies. One major theme, though not the only one, is that today's youth, influenced by video games and other emerging interactive media forms,...more
-
Continuation of Convex Optimization I. Topics include: Subgradient, cutting-plane, and ellipsoid methods. Decentralized convex optimization via primal and dual decomposition. Alternating projections. Exploiting problem structure in implementation. Convex relaxations of hard problems, and global optimization via branch & bound. Robust optimization. Selected applications in areas such as control, circuit design, signal processing, and...more
-
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.
-
Programming Methodology is the largest of the introductory programming courses and is one of the largest courses at Stanford. Topics focus on the introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and testing. Programming Methodology teaches the widely-used Java programming language along with good software...more
-
This course is designed to serve as a first course in an undergraduate electrical engineering (EE), or electrical engineering and computer science (EECS) curriculum. The course introduces the fundamentals of the lumped circuit abstraction. Topics covered include: resistive elements and networks; independent and dependent sources; switches and MOS transistors; digital abstraction; amplifiers; energy storage elements; dynamics of first-...more
-
This course offers a holistic view of the aircraft as a system, covering: basic systems engineering; cost and weight estimation; basic aircraft performance; safety and reliability; lifecycle topics; aircraft subsystems; risk analysis and management; and system realization. Small student teams retrospectively analyze an existing aircraft covering: key design drivers and decisions; aircraft attributes and subsystems; and operational...more
-
Note: This course is offered by Stanford as an online course for credit. It can be taken individually, or as part of a master’s degree or graduate certificate earned online through the Stanford Center for Professional Development. This course provides a broad introduction to machine learning and statistical pattern recognition. Topics include: supervised learning (generative/discriminative learning, parametric/non-parametric...more
-
The purpose of this course is to introduce you to basics of modeling, design, planning, and control of robot systems. In essence, the material treated in this course is a brief survey of relevant results from geometry, kinematics, statics, dynamics, and control. The course is presented in a standard format of lectures, readings and problem sets. Lectures will be based mainly, but not exclusively, on material in the Lecture Notes....more
-
