applications
sort by: Relevancy | Title try advanced search for more options
-
April 25, 2008 lecture by Leah Buechley for the Stanford University Human Computer Interaction Seminar (CS547). Computational textile researchers weave, solder and sew electronics into cloth to build soft, flexible and wearable computers. Computational textiles or "e-textiles" is a young discipline, and developments in the field have so far been relegated almost exclusively to research labs in industry and academia. Lisa Buechley presents...more
-
Geography is very important in ecology. Two major systems have been designed to model this, island biogeography and metapopulations. The idea of metapopulations is more recent, and has emerged as the dominant theory. Metapopulations are populations in multiple neighboring areas. The population of a species in any individual area may go extinct, but the metapopulation still survives. The theory of metapopulations has gained momentum in rece...more
-
April 20, 2009 - Leonard Susskind explains how to calculate and define pressure, explores the formulas some of applications of Helm-Holtz free energy, and discusses the importance of the partition function.
-
-
Note: This course is being offered this summer 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. The goals for the course are to gain a facility with using the Fourier transform, both specific techniques and general principles, and learning to recognize when, why, and how it is used. To...more
-
This course provides a review of linear algebra, including applications to networks, structures, and estimation, Lagrange multipliers. Also covered are: differential equations of equilibrium; Laplace's equation and potential flow; boundary-value problems; minimum principles and calculus of variations; Fourier series; discrete Fourier transform; convolution; and applications.
-
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 engine...more
-
Kernels, Mercer's Theorem, Non-linear Decision Boundaries and Soft Margin SVM, Coordinate Ascent Algorithm, The Sequential Minimization Optimization (SMO) Algorithm, Applications of SVM
-
The Factor Analysis Model,0 EM for Factor Analysis, Principal Component Analysis (PCA), PCA as a Dimensionality Reduction Algorithm, Applications of PCA, Face Recognition by Using PCA
-
Applications of Reinforcement Learning, Markov Decision Process (MDP), Defining Value & Policy Functions, Value Function, Optimal Value Function, Value Iteration, Policy Iteration
-
Course Overview, History of Robotics Video, Robotics Applications, Related Stanford Robotics Courses, Lecture and Reading Schedule, Manipulator Kinematics, Manipulator Dynamics, Manipulator Control, Manipulator Force Control, Advanced Topics
-
Introduction to applied linear algebra and linear dynamical systems, with applications to circuits, signal processing, communications, and control systems. Topics include: Least-squares aproximations of over-determined equations and least-norm solutions of underdetermined equations. Symmetric matrices, matrix norm and singular value decomposition. Eigenvalues, left and right eigenvectors, and dynamical interpretation. Matrix exponential, ...more
