Digital Abstraction
sort by: Relevancy | Title | Rating try advanced search for more options
-
Abstract Data Types, Wall of Abstraction, Why ADTs?, Live Coding Example: Creating the Vector Class, Private Data Members, Growing Dynamically: Making Space at Runtime, Insert and Remove Functions, Templatizing the Class Created, Including the "template.cpp" - Why?
-
December 7, 2007 lecture by Brian Lee for the Human-Computer Interaction Seminar (CS 547). Today's designers generate content both on paper and online. Designers spread their work over physical and digital media, each of which has powerful, but distinct, sets of affordances. Recent work suggests that augmented paper interfaces can marry the ubiquity of paper interactions with the ease of search, annotation, and presentation afforded by...more
-
Architectural and circuit level design and analysis of integrated analog-to-digital and digital-to-analog interfaces in CMOS and BiCMOS VLSI technology. Analog-digital converters, digital-analog converters, sample/hold amplifiers, continuous and switched-capacitor filters. RF integrated electronics including synthesizers, LNA's, and baseband processing. Low power mixed signal design. Data communications functions including clock recovery....more
-
Autodesk's vision is to keep the design data in digital format. Wireless industry is essential in this area. A small team of engineers at Autodesk banded together and built a wireless product on the fly to address an immediate need.
-
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
-
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
-
Note: This course is being offered by Stanford this summer 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 is the natural successor to Programming Methodology and covers such advanced programming topics as recursion, algorithmic analysis, and data abstraction using the C++...more
-
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
-
-
Decomposition and abstraction through functions; introduction to recursion
-
April 11, 2008 lecture by Gwendolyn Floyd and Joshua Kauffman for the Stanford University Human Computer Interaction Seminar (CS547). This lecture shares REGIONAL's recent in-field Cuban research that spans the socio-technological, the political, and the top-secret. It reveals how their research led to the design of a simple and affordable digital device that would potentially accelerate Cuban social change. It also discusses how an...more
-
