برنامه درسی

مدارهای الکتریکی 1

Evaluation

Grading is based on the individual exams and project demonstrations

Midterm: Written mid-term test, covering topics of the first half of the semester. (Second week(12th) of Azar) (5)

Final Exam: The final written-oral exam will be comprehensive of all the course materials, with an emphasis on the second part of the course and guest lectures. (10)

Homework & Quizzes: Homework must be turned in at the specified due date prior to the beginning of class. No late assignments will be accepted. Homework assignments are to be done individually. If you discuss or collaborate on a homework assignment, you must indicate that on your paper. Do not give your file to anyone, or use someone else’s file. Generated data and essay questions must be unique to each person. Finally, show your work! Quizzes will be administered randomly throughout the semester (expect at least a quiz every week). Quizzes will consist of questions about readings or assignments due on a given day. (4)

Note: One homework assignment and one quiz (lowest grade) can be dropped

Final Project: (1+…)

Class Activities: Active participation during the lectures (+2)

)This grading scheme is flexible. All changes will be announced in class

References

1. C. K. Alexander, M. N. O. Sadiku, Fundamentals of Electrical Circuits, 5th Edition, McGraw Hill, 2012.

Overview: One of the most popular introductory textbooks for electrical circuit analysis. It covers essential topics like Ohm's law, Kirchhoff's laws, transient analysis, and AC circuits with a balanced combination of theory and practical problem-solving.

Why it's good: It is student-friendly with plenty of worked examples, practice problems, and a clear explanation of core concepts.

2. W. H. Hayt, J. E. Kemmerly, and S. M. Durbin, Engineering Circuit Analysis, 8th Edition, McGraw Hill, 2011.

Overview: This book is great for students who already have a basic understanding of circuits and want a deeper dive into more advanced topics like operational amplifiers, network functions, and Laplace transforms.

Why it's good: It’s thorough and well-explained, especially for intermediate to advanced students looking for challenging problems and deeper insights.

3. Svoboda, James A., and Richard C. Dorf. Introduction to electric circuits. John Wiley & Sons, 2013.

Overview: A solid textbook for beginners that covers both theory and practice. It introduces circuit elements, laws, and the fundamental methods used in analysis.

Why it's good: It's accessible for beginners, with straightforward explanations and real-world applications that help students connect theory with practice.

4. Nilsson, J. W., & Riedel, S. A. (2020). Electric circuits. Pearson Education Limited.

Overview: Another highly regarded textbook, especially for its structured approach to circuit analysis. It introduces both DC and AC circuits, network theorems, and frequency response, among other important topics.

Why it's good: Well-organized with plenty of exercises and worked-out examples, which make it easier for students to grasp challenging concepts.

5. Thomas, R. E., Rosa, A. J., & Toussaint, G. J. (2016). The analysis and design of linear circuits. John Wiley & Sons.

Overview: Focuses more on the design aspect of circuits along with their analysis. It includes topics like resistive networks, network theorems, and operational amplifiers, with an emphasis on linear circuit design.

Why it's good: Good for students who want to connect theory with the design of practical circuits and systems.

6. Irwin, J. D., & Nelms, R. M. (2020). Basic engineering circuit analysis. John Wiley & Sons.

Overview: A highly recommended textbook for students taking electrical engineering courses. It’s well-structured for understanding both the basics and more advanced topics like transformers and filters.

Why it's good: Clear, concise, and focuses heavily on problem-solving with a strong emphasis on applying theory to real-world engineering problems.

7. A. Agarwal, J. H. Lang, Foundations of Analog and Digital Electronic Circuits, Morgan Kaufmann Publishers, Elsevier, 2005.

8. Desoer, C. A., & Kuh, E. S. (1969). Basic circuit theory. McGraw-hill.

9. Bird, J. (2017). Electrical circuit theory and technology. Routledge.

10. Nahvi, M., & Edminister, J. A. (2014). Schaum's outline of Electric Circuits. McGraw-Hill Education.

11. Floyd, T. L., & Pownell, E. (1997). Principles of electric circuits. Upper Saddle River, NJ, USA: Prentice Hall.

12. Attia, J. O. (2018). Electronics and circuit analysis using MATLAB. CRC press.

Electrical Circuits II is an advanced course designed to deepen students’ understanding of circuit theory, building on the foundational concepts introduced in Electrical Circuits I. The course focuses on the analysis of more complex AC and DC circuits, introducing students to advanced techniques such as state equations, frequency domain analysis, and the application of the Laplace transform. Students will explore both transient and steady-state responses of circuits and learn to analyze the behavior of systems under various conditions. A key aspect of this course is the introduction of network graph theory, which provides a powerful framework for visualizing and analyzing circuits. Students will learn how to apply Tellegen’s Theorem, a fundamental principle that governs energy conservation in electrical networks, to analyze complex circuit behavior. The course emphasizes the use of nodal and mesh analysis, crucial techniques for solving circuits systematically by applying Kirchhoff’s laws. These methods allow for the efficient analysis of large-scale circuits, providing a deeper understanding of how voltage and current are distributed throughout a system. Additionally, students will be introduced to loop and cut-set analysis, which further extends their ability to break down circuits into more manageable components and identify critical paths and elements within a network. The course also covers frequency response analysis, providing insight into the natural frequencies of networks and how these can affect system behavior. The introduction of two-port network theory offers students the ability to analyze multi-port systems commonly used in electrical engineering applications. By the end of the course, students will be able to apply advanced mathematical techniques to solve complex circuit problems, design circuits for specific frequency responses, and understand the behavior of circuits in both the time and frequency domains.

·  Analyze Complex Networks Using Graph Theory and Tellegen’s Theorem: Apply network graph principles and Tellegen’s Theorem to solve and optimize complex electrical networks, ensuring energy conservation and efficient circuit design.

· Conduct Loop and Cut-Set Analysis: Analyze electrical networks using loop and cut-set methods to identify critical components and paths, allowing for the simplification and solution of larger circuits.

· Solve Circuits Using Laplace Transforms: Apply the Laplace transform to solve circuits in the s-domain, handling transient and steady-state behavior, and translating between time and frequency domains.

·  Analyze Frequency Response and Resonance: Determine the natural frequencies of electrical networks and analyze frequency responses, allowing for the design of filters and resonance-based circuits.

· Apply Circuit Theorems for Simplification: Use advanced network theorems, including superposition, and Thevenin/Norton equivalents, to simplify and solve complex circuit problems efficiently.

·  Analyze and Design Two-Port Networks: Understand and analyze two-port network systems, and apply these concepts to real-world electrical systems such as amplifiers, filters, and transmission lines.

·  Model and Solve State Equations: Formulate and solve state equations for dynamic electrical systems, providing insight into the time-domain behavior of circuits.

·  Use Simulation Tools for Circuit Analysis: Apply modern simulation software (e.g., SPICE) to model and analyze complex circuits, ensuring a practical understanding of theoretical concepts.

-

Evaluation

Grading is based on the individual exams and project demonstrations

Final Exam: The final written-oral exam will be comprehensive of all the course materials, with an emphasis on the second part of the course and guest lectures. (10)

Homework & Quizzes: Homework must be turned in at the specified due date prior to the beginning of class. No late assignments will be accepted. Homework assignments are to be done individually. If you discuss or collaborate on a homework assignment, you must indicate that on your paper. Do not give your file to anyone, or use someone else’s file. Generated data and essay questions must be unique to each person. Finally, show your work! Quizzes will be administered randomly throughout the semester (expect at least a quiz every week). Quizzes will consist of questions about readings or assignments due on a given day (5).

Note: One homework assignment and one quiz (lowest grade) can be dropped.

Final Project: (5)

Class Activities: Active participation during the lectures (+)

This grading scheme is flexible. All changes will be announced in class.

References

1. "Introduction to Discrete Event Systems" by Christos G. Cassandras and Stéphane Lafortune
   • Description: This is one of the most widely used textbooks for discrete event systems, providing a comprehensive introduction to the theory and applications of DES. It covers topics such as modeling, supervisory control, Petri nets, and timed automata, with examples from manufacturing systems, computer networks, and transportation.
   • Why It’s Useful: It balances theoretical rigor with practical applications, making it suitable for both introductory and advanced students.
2. "Discrete Event Systems: Modeling and Performance Analysis" by Tamer Başar and P.R. Kumar
   • Description: This book focuses on the modeling and performance analysis of DES using a variety of methods, including automata theory, Petri nets, and queueing models. It also explores stochastic models and optimization techniques.
   • Why It’s Useful: This is an excellent resource for students interested in performance analysis and the application of discrete event systems in areas like telecommunications and manufacturing.
3. "Supervisory Control of Discrete Event Systems" by P.J. Ramadge and W.M. Wonham
   • Description: A seminal work in the field, this text focuses specifically on supervisory control theory, which is a key topic in the control of discrete event systems. The book offers a rigorous mathematical treatment of the subject.
   • Why It’s Useful: This reference is essential for students and researchers interested in the formal aspects of DES control, and it serves as the foundational work in supervisory control theory.
4. "Modeling and Analysis of Stochastic Systems" by V.G. Kulkarni
   • Description: This book covers stochastic processes and their applications in discrete event systems. It includes material on Markov chains, Poisson processes, and queuing theory.
   • Why It’s Useful: Stochastic models are crucial for dealing with uncertainty in DES, and this book provides both the theoretical background and practical tools for working with these models.
5. "Stochastic Modeling and the Theory of Queues" by Ronald W. Wolff
   • Description: This text delves into the mathematical foundations of queueing theory and its applications in discrete event systems. It covers both classical and modern queuing models.
   • Why It’s Useful: For students interested in applying queuing theory to discrete-event systems, especially in areas such as telecommunications and logistics, this book is highly relevant.
6. "Petri Nets: An Introduction" by Wolfgang Reisig
   • Description: This book provides a detailed introduction to Petri nets, a graphical and mathematical modeling tool used in the analysis and control of discrete-event systems. It explains the formalism of Petri nets and their applications in system modeling.
   • Why It’s Useful: Petri nets are widely used in discrete-event system modeling, especially for systems that involve concurrency, synchronization, and resource sharing.
7. "Simulation with Arena" by W. David Kelton, Randall P. Sadowski, and Nancy B. Zupick
   • Description: Focused on simulation, this book provides a detailed guide to using Arena, one of the most popular simulation software packages. It covers the use of Arena for discrete-event system simulation, with practical examples.
   • Why It’s Useful: Simulation is a key tool in DES, and this book provides both the theoretical background and practical skills needed to perform complex simulations.

Additional Reading:

1. "Discrete Stochastic Processes" by Robert G. Gallager
   • Description: This book is a solid resource for understanding stochastic processes, with a focus on applications in discrete event systems and telecommunications. It covers discrete-time Markov chains, renewal theory, and queueing theory.
   • Why It’s Useful: It provides a deeper dive into stochastic processes that are crucial for understanding the probabilistic aspects of DES.
2. "Principles of Discrete Event Simulation" by George S. Fishman
   • Description: This book focuses on simulation as a method for analyzing discrete event systems, particularly large and complex systems.
   • Why It’s Useful: It offers a strong foundation in simulation theory and methods, useful for students focusing on simulation in their study of DES.

Over the past few decades, the rapid evolution of computing, communication, and information technologies has brought about the proliferation of new dynamic systems. A significant part of activity in these systems is governed by operational rules designed by humans. The dynamics of these systems are characterized by asynchronous occurrences of discrete events, some controlled (e.g. hitting a keyboard key, sending a message), some not (e.g. spontaneous failure, packet loss). The mathematical arsenal centered around differential equations that has been employed in systems engineering to model and study processes governed by the laws of nature is often inadequate or inappropriate for discrete event systems. The challenge is to develop new modeling frameworks, analysis techniques, design tools, testing methods, and optimization processes for this new generation of systems.

This course provides an in-depth study of Discrete Event Systems (DES), focusing on modeling, analysis, and control techniques. DES are systems where state transitions are triggered by discrete events over time, making them critical for a wide range of applications in areas such as manufacturing, logistics, telecommunications, and robotics. Advanced topics such as discretized feedback systems, languages and automata theory, supervisory control, Petri nets, and state-based control mechanisms will be covered to provide a deep understanding of how DES are managed and optimized in practice. Key topics such as stochastic timed automata, Markov chains, queueing theory, and discrete-event simulation will be introduced to provide students with the ability to analyze time and probabilistic behavior in DES. Additionally, concepts like sensitivity analysis and concurrent estimation techniques will be explored for evaluating system performance under various conditions. Students will learn how to model real-world systems, analyze their behavior, and design controllers to meet specific performance and safety requirements. The course will also cover the use of modern computational tools for the analysis and simulation of DES. Through lectures, case studies, and hands-on projects, students will develop a solid understanding of both theoretical concepts and practical implementation, preparing them for advanced research or industry applications in systems engineering and automation.

Topics Covered

• Basic Description of Discrete-event Systems Modeling and Simulation
• Graphs in Modeling Discrete-Event Dynamic Systems (DEDS)
• Mathematical Descriptions and Models
• Discretized Feedback Systems
• Languages and Automata in DES
• Supervision of Discrete-Event Systems
• Supervisory Control
• Petri Nets and Their Applications
• State-Based Control of Discrete-Event Systems
• Timed and Hybrid Models
• Stochastic Timed Automata
• Markov Chains and Probabilistic Models
• Introduction to Queueing Theory
• Introduction to Discrete-Event Simulation
• Sensitivity Analysis and Concurrent Estimation

Midterm: Written mid-term test, covering topics of the first half of the semester (Forth week of Farvardin)

Final Exam: The final written-oral exam will be comprehensive of all the course materials, with an emphasis on the second part of the course and guest lectures. (10)

Homework & Quizzes: Homework must be turned in at the specified due date prior to the beginning of class. No late assignments will be accepted. Homework assignments are to be done individually. If you discuss or collaborate on a homework assignment, you must indicate that on your paper. Do not give your file to anyone, or use someone else’s file. Generated data and essay questions must be unique to each person. Finally, show your work! Quizzes will be administered randomly throughout the semester (expect at least a quiz every week). Quizzes will consist of questions about readings or assignments due on a given day. (3)

Note: One homework assignment and one quiz (lowest grade) can be dropped

Class Activities: Active participation during the lectures. (+2)

This grading scheme is flexible. All changes will be announced in class

معادلات دیفرانسیل، مولف: دکتر نیکوکار-معادلات دیفرانسیل، مولف: دکتر کرایه چیان

[1] William E. Boyce, Richard C. DiPrima, Douglas B. Meade “Elementary Differential Equations and Boundary Value Problems”

[2] George F. Simmons, “Differential Equations with Applications and Historical Notes”

آشنایی با معادلات دیفرانسیل عادی از مرتبه دلخواه، حل برخی معادلات دیفرانسیل غیرخطی، معادلات کامل، عامل انتگرال ساز، حل کامل معادلات دیفرانسیل خطی با ضریب ثابت از مرتبه دلخواه همگن و ناهمگن، آشنایی با نظریه معادلات دیفرانسیل خطی از مرتبه دلخواه، آشنایی با تبدیل لاپلاس و استفاده از آن برای حل معادلات دیفرانسیل، حل کامل دستگاه معادلات دیفرانسیل خطی با ضرایب ثابت همگن و ناهمگن، آشنایی با نظریه دستگاه معادلات دیفرانسیل خطی، آشنایی با برخی معادلات دیفرانسیل مرتبه دوم خاص که منجر به توابع خاص ریاضی فیزیک می شوند مانند تابع بسل.