Updating search results...

Search Resources

56 Results

View
Selected filters:
  • electrical-engineering
AC Circuits
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This eBook was written as the sequel to the eBook titled DC Circuits, which was written in 2016 by Chad Davis.
This eBook covers Alternating Current (AC) circuit theory as well us a brief introduction of electronics. It is
broken up into seven modules. Module 1 covers the basic theory of AC signals. Since only DC sources are used in
the first eBook, details of AC signals such as sinusoidal waveforms (or sine waves), square waves, and triangle
waves are provided. Module 2, titled AC Circuits Math Background, covers the mathematics background needed
for solving AC circuit problems. The background material in Modules 1 and 2 are combined in Module 3 to solve
circuits with AC sources that include resistors, inductors, and capacitors (RLC circuits).

Subject:
Applied Science
Engineering
Material Type:
Textbook
Provider:
SHAREOK
Date Added:
01/07/2017
Advanced Circuit Techniques, Spring 2002
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Following a brief classroom discussion of relevant principles, each student completes the paper design of several advanced circuits such as multiplexers, sample-and-holds, gain-controlled amplifiers, analog multipliers, digital-to-analog or analog-to-digital converters, and power amplifiers. One of each student's designs is presented to the class, and one may be built and evaluated. Associated laboratory emphasizing the use of modern analog building blocks. Alternate years.

Subject:
Applied Science
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Roberge, Jim
Date Added:
01/01/2002
Advanced Topics in Cryptography, Spring 2003
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Recent results in cryptography and interactive proofs. Lectures by instructor, invited speakers, and students. Alternate years. The topics covered in this course include interactive proofs, zero-knowledge proofs, zero-knowledge proofs of knowledge, non-interactive zero-knowledge proofs, secure protocols, two-party secure computation, multiparty secure computation, and chosen-ciphertext security.

Subject:
Applied Science
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Micali, Silvio
Date Added:
01/01/2003
Algorithms for Computer Animation, Fall 2002
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

In-depth study of an active research topic in computer graphics. Topics change each term. Readings from the literature, student presentations, short assignments, and a programming project. Animation is a compelling and effective form of expression; it engages viewers and makes difficult concepts easier to grasp. Today's animation industry creates films, special effects, and games with stunning visual detail and quality. This graduate class will investigate the algorithms that make these animations possible: keyframing, inverse kinematics, physical simulation, optimization, optimal control, motion capture, and data-driven methods. Our study will also reveal the shortcomings of these sophisticated tools. The students will propose improvements and explore new methods for computer animation in semester-long research projects. The course should appeal to both students with general interest in computer graphics and students interested in new applications of machine learning, robotics, biomechanics, physics, applied mathematics and scientific computing.

Subject:
Applied Science
Arts and Humanities
Computer Science
Literature
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Popovic, Jovan
Date Added:
01/01/2002
Artificial Intelligence, Fall 2010
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This course introduces students to the basic knowledge representation, problem solving, and learning methods of artificial intelligence. Upon completion of 6.034, students should be able to develop intelligent systems by assembling solutions to concrete computational problems, understand the role of knowledge representation, problem solving, and learning in intelligent-system engineering, and appreciate the role of problem solving, vision, and language in understanding human intelligence from a computational perspective.

Subject:
Applied Science
Computer Science
Information Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Winston, Patrick Henry
Date Added:
01/01/2010
Automata, Computability, and Complexity, Spring 2011
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This course provides a challenging introduction to some of the central ideas of theoretical computer science. Beginning in antiquity, the course will progress through finite automata, circuits and decision trees, Turing machines and computability, efficient algorithms and reducibility, the P versus NP problem, NP-completeness, the power of randomness, cryptography and one-way functions, computational learning theory, and quantum computing. It examines the classes of problems that can and cannot be solved by various kinds of machines. It tries to explain the key differences between computational models that affect their power.

Subject:
Applied Science
Computer Science
Information Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Aaronson, Scott
Date Added:
01/01/2011
Automatic Speech Recognition, Spring 2003
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Graduate-level introduction to automatic speech recognition. Provides relevant background in acoustic theory of speech production, properties of speech sounds, signal representation, acoustic modeling, pattern classification, search algorithms, stochastic modeling techniques (including hidden Markov modeling), and language modeling. Examines approaches of state-of-the-art speech recognition systems. Introduces students to the rapidly developing field of automatic speech recognition. Its content is divided into three parts. Part I deals with background material in the acoustic theory of speech production, acoustic-phonetics, and signal representation. Part II describes algorithmic aspects of speech recognition systems including pattern classification, search algorithms, stochastic modelling, and language modelling techniques. Part III compares and contrasts the various approaches to speech recognition, and describes advanced techniques used for acoustic-phonetic modelling, robust speech recognition, speaker adaptation, processing paralinguistic information, speech understanding, and multimodal processing.

Subject:
Applied Science
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Glass, James Robert
Date Added:
01/01/2003
Computational Cognitive Science, Fall 2004
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This course is an introduction to computational theories of human cognition. Drawing on formal models from classic and contemporary artificial intelligence, students will explore fundamental issues in human knowledge representation, inductive learning and reasoning. What are the forms that our knowledge of the world takes? What are the inductive principles that allow us to acquire new knowledge from the interaction of prior knowledge with observed data? What kinds of data must be available to human learners, and what kinds of innate knowledge (if any) must they have?

Subject:
Applied Science
Computer Science
Psychology
Social Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Tenenbaum, Joshua
Date Added:
01/01/2004
Computational Functional Genomics, Spring 2005
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Study and discussion of computational approaches and algorithms for contemporary problems in functional genomics. Topics include DNA chip design, experimental data normalization, expression data representation standards, proteomics, gene clustering, self-organizing maps, Boolean networks, statistical graph models, Bayesian network models, continuous dynamic models, statistical metrics for model validation, model elaboration, experiment planning, and the computational complexity of functional genomics problems.

Subject:
Applied Science
Biology
Computer Science
Natural Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Gifford, David
Jaakkola, Tommi Sakari
Date Added:
01/01/2005
Computer Graphics, Fall 2012
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Introduction to computer graphics hardware, algorithms, and software. Topics include: line generators, affine transformations, line and polygon clipping, splines, interactive techniques, perspective projection, solid modeling, hidden surface algorithms, lighting models, shading, and animation. Substantial programming experience required. 6.837 offers an introduction to computer graphics hardware, algorithms, and software. Topics include: line generators, affine transformations, line and polygon clipping, splines, interactive techniques, perspective projection, solid modeling, hidden surface algorithms, lighting models, shading, and animation. Substantial programming experience is required.

Subject:
Applied Science
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Durand, Fredo
Wojciech Matusik
Date Added:
01/01/2012
Computer Language Engineering, Spring 2010
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This course analyzes issues associated with the implementation of higher-level programming languages. Topics covered include: fundamental concepts, functions, and structures of compilers, the interaction of theory and practice, and using tools in building software. The course includes a multi-person project on compiler design and implementation.

Subject:
Applied Science
Computer Science
Information Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Amarasinghe, Saman
Rinard, Martin
Date Added:
01/01/2010
Computer Networks, Fall 2002
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Topics on the engineering and analysis of network protocols and architecture, including: architectural principles for designing heterogeneous networks; congestion control; unicast and multicast routing; wireless and mobile networking; network quality of service; router design; network security; streaming and multicast applications; naming; content distribution; and peer-to-peer networking. Readings from original research papers, industry white papers, and Internet RFCs. Semester-long project and paper.

Subject:
Applied Science
Architecture and Design
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Balakrishnan, Hari
Date Added:
01/01/2002
DC Circuits
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This book covers Direct Current (DC) circuit theory and is broken up into three modules. Module 1 covers the basics for circuits that include DC sources (voltage or current) and resistors. Even though Module 1 is not very difficult, it forms the foundation for more complicated topics in modules 2 and 3 so it is important to have a firm grasp of all Module 1 topics before moving on. Module 2 covers more difficult problem solving techniques for circuits that include only DC sources and resistors. Module 3 introduces capacitors and inductors. These non-linear reactive components are analyzed in the transient and steady state regions in circuits with DC sources in Module 3. Also annexed is a two-page cheat sheet that ENGR 2431 students at University of Oklahoma can use for exams.

Subject:
Applied Science
Engineering
Material Type:
Textbook
Provider:
SHAREOK
Author:
Chad Davis
Date Added:
04/24/2019
Dynamic Systems and Control, Spring 2011
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

The course addresses dynamic systems, i.e., systems that evolve with time. Typically these systems have inputs and outputs; it is of interest to understand how the input affects the output (or, vice-versa, what inputs should be given to generate a desired output). In particular, we will concentrate on systems that can be modeled by Ordinary Differential Equations (ODEs), and that satisfy certain linearity and time-invariance conditions. We will analyze the response of these systems to inputs and initial conditions. It is of particular interest to analyze systems obtained as interconnections (e.g., feedback) of two or more other systems. We will learn how to design (control) systems that ensure desirable properties (e.g., stability, performance) of the interconnection with a given dynamic system.

Subject:
Applied Science
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Dahleh, Munther
Frazzoli, Emilio
Date Added:
01/01/2011
Electric Machines, Fall 2013
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Treatment of electromechanical transducers, rotating and linear electric machines. Lumped-parameter electromechanics of interaction. Development of device characteristics: energy conversion density, efficiency; and of system interaction characteristics: regulation, stability, controllability, and response. Use of electric machines in drive systems. Problems taken from current research. This course explores concepts in electromechanics, using electric machinery as examples. It teaches an understanding of principles and analysis of electromechanical systems. By the end of the course, students are capable of doing electromechanical design of the major classes of rotating and linear electric machines and have an understanding of the principles of the energy conversion parts of Mechatronics. In addition to design, students learn how to estimate the dynamic parameters of electric machines and understand what the implications of those parameters are on the performance of systems incorporating those machines.

Subject:
Applied Science
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
James Kirtley
Date Added:
01/01/2013
Electromagnetic Field Theory: A Problem Solving Approach, Spring 2008
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This text is an introductory treatment on the junior level for a two-semester electrical engineering course starting from the Coulomb-Lorentz force law on a point charge. The theory is extended by the continuous superposition of solutions from previously developed simpler problems leading to the general integral and differential field laws. Often the same problem is solved by different methods so that the advantages and limitations of each approach becomes clear. Sample problems and their solutions are presented for each new concept with great emphasis placed on classical models of physical phenomena such as polarization, conduction, and magnetization. A large variety of related problems that reinforce the text material are included at the end of each chapter for exercise and homework.

Subject:
Applied Science
Engineering
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Zahn, Markus
Date Added:
01/01/2008
A First Course in Electrical and Computer Engineering
Unrestricted Use
CC BY
Rating
0.0 stars

This book was written for an experimental freshman course at the University of Colorado. The course is now an elective that the majority of our electrical and computer engineering students take in the second semester of their freshman year, just before their first circuits course. Our department decided to offer this course for several reasons:

we wanted to pique student' interest in engineering by acquainting them with engineering teachers early in their university careers and by providing with exposure to the types of problems that electrical and computer engineers are asked to solve;
we wanted students entering the electrical and computer engineering programs to be prepared in complex analysis, phasors, and linear algebra, topics that are of fundamental importance in our discipline;
we wanted students to have an introduction to a software application tool, such as MATLAB, to complete their preparation for practical and efficient computing in their subsequent courses and in their professional careers;
we wanted students to make early contact with advanced topics like vector graphics, filtering, and binary coding so that they would gain a more rounded picture of modern electrical and computer engineering.
In order to introduce this course, we had to sacrifice a second semester of Pascal programming. We concluded that the sacrifice was worth making because we found that most of our students were prepared for high-level language computing after just one semester of programming.

We believe engineering educators elsewhere are reaching similar conclusions about their own students and curriculums. We hope this book helps create a much needed dialogue about curriculum revision and that it leads to the development of similar introductory courses that encourage students to enter and practice our craft.Students electing to take this course have completed one semester of calculus, computer programming, chemistry, and humanities.

Concurrently with this course, students take physics and a second semester of calculus, as well as a second semester in the humanities. By omitting the advanced topics marked by asterisks, we are able to cover Complex Numbers through Linear Algebra, plus two of the three remaining chapters. The book is organized so that the instructor can select any two of the three. If every chapter of this book is covered, including the advanced topics, then enough material exists for a two-semester course.

The first three chapters of this book provide a fairly complete coverage of complex numbers, the functions e^x and e^jand phasors. Our department philosophy is that these topics must be understood if a student is to succeed in electrical and computer engineering. These three chapters may also be used as a supplement to a circuits course. A measured pace of presentation, taking between sixteen and eighteen lectures, is sufficient to cover all but the advanced sections in Complex Numbers through Phasors.

The chapter on "linear algebra" is prerequisite for all subsequent chapters. We use eight to ten lectures to cover it. We devote twelve to sixteen lectures to cover topics from Vector Graphics through Binary Codes. (We assume a semester consisting of 42 lectures and three exams.) The chapter on vector graphics applies the linear algebra learned in the previous chapter to the problem of translating, scaling, and rotating images. "Filtering" introduces the student to basic ideas in averaging and filtering. The chapter on "Binary Codes" covers the rudiments of binary coding, including Huffman codes and Hamming codes.

If the users of this book find "Vector Graphics" through "Binary Codes" too confining, we encourage them to supplement the essential material in "Complex Numbers" through "Linear Algebra" with their own course notes on additional topics. Within electrical and computer engineering there are endless possibilities. Practically any set of topics that can be taught with conviction and enthusiasm will whet the student's appetite. We encourage you to write to us or to our editor, Tom Robbins, about your ideas for additional topics. We would like to think that our book and its subsequent editions will have an open architecture that enables us to accommodate a wide range of student and faculty interests.

Throughout this book we have used MATLAB programs to illustrate key ideas. MATLAB is an interactive, matrix-oriented language that is ideally suited to circuit analysis, linear systems, control theory, communications, linear algebra, and numerical analysis. MATLAB is rapidly becoming a standard software tool in universities and engineering companies. (For more information about MATLAB, return the attached card in the back of this book to The MathWorks, Inc.) MATLAB programs are designed to develop the student's ability to solve meaningful problems, compute, and plot in a high-level applications language. Our students get started in MATLAB by working through “An Introduction to MATLAB,” while seated at an IBM PC (or look-alike) or an Apple Macintosh. We also have them run through the demonstration programs in "Complex Numbers". Each week we give three classroom lectures and conduct a one-hour computer lab session. Students use this lab session to hone MATLAB skills, to write programs, or to conduct the numerical experiments that are given at the end of each chapter. We require that these experiments be carried out and then reported in a short lab report that contains (i) introduction, (ii) analytical computations, (iii) computer code, (iv) experimental results, and (v) conclusions. The quality of the numerical results and the computer graphics astonishes students. Solutions to the chapter problems are available from the publisher for instructors who adopt this text for classroom use.

We wish to acknowledge our late colleague Richard Roberts, who encouraged us to publish this book, and Michael Lightner and Ruth Ravenel, who taught "Linear Algebra" and "Vector Graphics" and offered helpful suggestions on the manuscript. We thank C. T. Mullis for allowing us to use his notes on binary codes to guide our writing of "Binary Codes". We thank Cédric Demeure and Peter Massey for their contributions to the writing of "An Introduction to MATLAB" and "The Edix Editor". We thank Tom Robbins, our editor at Addison-Wesley, for his encouragement, patience, and many suggestions. We are especially grateful to Julie Fredlund, who composed this text through many drafts and improved it in many ways. We thank her for preparing an excellent manuscript for production.

Subject:
Applied Science
Computer Science
Engineering
Material Type:
Textbook
Provider:
Rice University
Provider Set:
OpenStax CNX
Author:
Louis Scharf
Date Added:
10/26/2023
A First Course in Electrical and Computer Engineering
Unrestricted Use
CC BY
Rating
0.0 stars

This book was written for an experimental freshman course at the University of Colorado. The course is now an elective that the majority of our electrical and computer engineering students take in the second semester of their freshman year, just before their first circuits course.

Table of Contents
1. Complex Numbers
2. The Functions e^x and e^j
3. Phasors
4. Linear Algebra
5. Vector Graphics
6. Filtering
7. Binary Codes
8. An Introduction to MATLAB
9. The Edix Editor
10. Useful Mathematical Identities

Subject:
Applied Science
Engineering
Material Type:
Textbook
Author:
Louis Scharf
Date Added:
06/11/2020
Fundamentals of Electrical Engineering 1
Unrestricted Use
CC BY
Rating
0.0 stars

The course focuses on the creation, manipulation, transmission, and reception of information by electronic means. Elementary signal theory; time- and frequency-domain analysis; Sampling Theorem. Digital information theory; digital transmission of analog signals; error-correcting codes.

Table of Contents
1. Introduction
2. Signals and Systems
3. Analog Signal Processing
4. Frequency Domain
5. Digital Signal Processing
6. Information Communication
7. Appendix

Subject:
Applied Science
Engineering
Material Type:
Textbook
Author:
Don Johnson
Date Added:
06/11/2020
Fundamentals of Electrical Engineering I
Unrestricted Use
CC BY
Rating
0.0 stars

The textbook focuses on the creation, manipulation, transmission, and reception of information by electronic means. Elementary signal theory; time- and frequency-domain analysis; Sampling Theorem. Digital information theory; digital transmission of analog signals; error-correcting codes.

Table of Contents:
1 Introduction
2 Signals and Systems
3 Analog Signal Processing
4 Frequency Domain
5 Digital Signal Processing
6 Information Communication

Subject:
Applied Science
Engineering
Material Type:
Textbook
Author:
Don Johnson
Rice University
Date Added:
11/30/2020