Students simulate disease transmission by collecting data based on their proximity to other students. One option for measuring proximity is by having Bluetooth devices "discover" each other. After data is collected, students apply graph theory to analyze it, and summarize their data and findings in lab report format. Students learn real-world engineering applications of graph theory and see how numerous instances of real-world relationships can be more thoroughly understood by applying graph theory. Also, by applying graph theory the students are able to come up with possible solutions to limit the spread of disease. The activity is intended to be part of a computer science curriculum and knowledge of the Java programming language is required. To complete the activity, a computer with Java installed and appropriate editing software is needed.

This course surveys the core perceptual and cognitive abilities of the human mind and asks how they are implemented in the brain. Key themes include the representations, development, and degree of functional specificity of these components of mind and brain. The course will take students straight to the cutting edge of the field, empowering them to understand and critically evaluate empirical articles in the current literature.

This is a unit of study whose competency is to locate necessary resources that help to acquire additional subject matter and pedagogical knowledge for professional development. The objectives are: identify relevant resources for professional development and collaborative teacher networks. Discuss the advantages of collaborative networks and participate in collaborative teacher networks.

This material enable the user to understand clearly the computer networks in detail.

Texts:

Bonaventure, O., Computer Networking: Principles, Protocols and Practice, Release 0.25, Saylor Foundation, 2011. http://www.saylor.org/site/wp-content/uploads/2012/02/Computer-Networking-Principles-Bonaventure-1-30-31-OTC1.pdf

Dordal, P., An Introduction to Computer Networks, Release 1.9.16, 2019. http://intronetworks.cs.luc.edu/current/ComputerNetworks.pdf

Course description: A comprehensive examination of how computers can be linked together to share resources and information. Emphasis will be given to understanding packet switched networks and how they enable contemporary enterprises. Topics include network hardware, software and protocols. Prerequisites: CS13X or CS161 (or concurrent).

Learning Outcomes:
After completing this course:
Students will have practical experience using protocols to enable communication between computing devices connected to each other,
Students will have configured an IT infrastructure solution for a small organization, including a network based on standard technology components, servers, security devices, and several different types of computing clients,
Students will apply core concepts underlying IP networks to solve simple network design problems, including IP subnetting.

This class offers a broad coverage of technology concepts and trends underlying current and future developments in information technology, and fundamental principles for the effective use of computer-based information systems. There will be a special emphasis on networks and distributed computing, including the World Wide Web. Other topics include: hardware and operating systems, software development tools and processes, relational databases, security and cryptography, enterprise applications, and electronic commerce. Hands-on exposure to Web, database, and graphical user interface (GUI) tools.
This course is intended for students with little or no background in computer technology. Students with extensive education or work experience in computer technology should consider taking a more advanced course.

Information Technology I helps students understand technical concepts underlying current and future developments in information technology. There will be a special emphasis on networks and distributed computing. Students will also gain some hands-on exposure to powerful, high-level tools for making computers do amazing things, without the need for conventional programming languages. Since 15.564 is an introductory course, no knowledge of how computers work or are programmed is assumed.

In virtually every industry and every firm, information technology is driving change, creating opportunities and challenges. Leaders who don’t understand at least the fundamentals of information systems will be at a strategic disadvantage. This course provides broad coverage of technology concepts and trends underlying current and future developments in information technology, and fundamental principles for the effective use of computer-based information systems. There will be a special emphasis on manufacturing. Information Systems topics that will be covered include networks and distributed computing, including the World Wide Web, hardware and operating systems, software development tools and processes, relational databases, security and cryptography, enterprise applications, B2B, the semantic web and electronic commerce. Sloan LFM students with an interest in Information Systems are encouraged to register for this course.

This course examines cyber dynamics and processes in international relations from different theoretical perspectives. It considers alternative theoretical and empirical frameworks consistent with characteristic features of cyberspace and emergent transformations at all levels of international interaction. Theories examined include realism and neorealism, institutionalism and liberalism, constructivism, and systems theory and lateral pressure. The course also highlights relevant features and proposes customized international relations theory for the cyber age.
Students taking the graduate version are expected to pursue the subject in greater depth through reading and individual research.

Welcome to the website for An Introduction to Computer Networks, a free and open general-purpose computer-networking textbook, complete with diagrams and exercises. It covers the LAN, internetworking and transport layers, focusing primarily on TCP/IP. Particular attention is paid to congestion; other special topics include queuing, real-time traffic, network management, security and the ns simulator.

The book is suitable as the primary text for an undergraduate or introductory graduate course in computer networking, as a supplemental text for a wide variety of network-related courses, and as a reference work.

An introduction to several fundamental ideas in electrical engineering and computer science, using digital communication systems as the vehicle. The three parts of the course—bits, signals, and packets—cover three corresponding layers of abstraction that form the basis of communication systems like the Internet.
The course teaches ideas that are useful in other parts of EECS: abstraction, probabilistic analysis, superposition, time and frequency-domain representations, system design principles and trade-offs, and centralized and distributed algorithms. The course emphasizes connections between theoretical concepts and practice using programming tasks and some experiments with real-world communication channels.

Students in ESD.00 work on projects to address large, complex and seemingly intractable real-world problems, such as energy supply, environmental issues, health care delivery, and critical infrastructure (e.g., telecommunications, water supply, and transportation). The course introduces interdisciplinary approaches - rooted in engineering, management, and the social sciences - to considering these critical contemporary issues. Small, faculty-led teams select an engineering systems term project to illustrate one or more of these approaches.

This course provides an introduction to complex networks and their structure and function, with examples from engineering, applied mathematics, and social sciences. Topics include spectral graph theory, notions of centrality, random graph models, contagion phenomena, cascades and diffusion, and opinion dynamics.

The development of systems and network concepts for students can begin with this highly interactive inquiry into cell phone networks. Cell phones serve as a handy knowledge base on which to develop understanding. Each cell phone represents a node, and each phone’s address book represents an edge, or the calling relationships between cell phones. Students conceptualize the entire cell phone network by drawing a graphic that depicts each cell phone in the class as a circle (node) connected by directional lines (edges) to their classmate’s cell phones in their address book. Students are queried on the shortest pathway for calling and calling pathways when selected phones are knocked out using school and classroom scenarios.

Students then use a simulation followed by Cytoscape, visually graphing software, to model and interrogate the structure and properties of the class’s cell phone network. They investigate more advanced calling relationships and perturb the network (knock out cell towers) to reexamine the adjusted network’s properties. Advanced questions about roaming, cell towers and email focus on a deeper understanding of network behavior. Both the paper and software network exercises highlight numerous properties of networks and the activities of scientists with biological networks.

Target Audience:
This is an introductory module that we recommend teaching before each of our other modules to give students a background in systems. This module can be applied easily to any content area and works best as written for students between 6th and 12th grades but can be adapted for other ages. The lessons work best when in-person with students. If you are looking for an Introduction to Systems for remote learning, please use our Systems are Everywhere module.

The aim of this video lesson is to teach students about the different topologies of computer networks and how they function. The approach that is used is highly correlated with common knowledge about weddings and the local Malay culture associated with weddings. Students should be able to relate the act of delivering food to a large crowd of people to the basic principles of network topologies and the method of data transfer within each type of topology. The lesson will begin in a classroom with students working in small groups, answering assigned questions. Teaching aids such as color cards will be used. One student from each group will be appointed as the wedding event manager, and she/he will have to discuss and act out with group members in order to answer more challenging questions. At the end of the lesson, students will be asked to come up with their own version of a hybrid computer network topology. The lesson concept taught here not only educates students on computer topologies, but also introduces students to an important cultural perspective of Malaysia. Above all, this video is designed to assist students with their study of Computer Literacy in schools. The lesson will take up to 60 minutes to complete. Materials needed include: 10 red cards representing waitresses; 10 green cards representing waiters; 10 blue cards representing tables in the hall; a sketch book; and classroom tables and chairs.

Students learn about complex networks and how to use graphs to represent them. They also learn that graph theory is a useful part of mathematics for studying complex networks in diverse applications of science and engineering, including neural networks in the brain, biochemical reaction networks in cells, communication networks, such as the internet, and social networks. Students are also introduced to random processes on networks. An illustrative example shows how a random process can be used to represent the spread of an infectious disease, such as the flu, on a social network of students, and demonstrates how scientists and engineers use mathematics and computers to model and simulate random processes on complex networks for the purposes of learning more about our world and creating solutions to improve our health, happiness and safety.

Lecture for the course "CSCI 380 - Mobile Application and Product Development" delivered at John Jay College in Spring 2019 by Bhargava Chinthirla and Eric Spector as part of the Tech-in-Residence Corps program.

This is a basic subject on matrix theory and linear algebra. Emphasis is given to topics that will be useful in other disciplines, including systems of equations, vector spaces, determinants, eigenvalues, similarity, and positive definite matrices.

This course covers matrix theory and linear algebra, emphasizing topics useful in other disciplines such as physics, economics and social sciences, natural sciences, and engineering. It parallels the combination of theory and applications in Professor Strang’s textbook Introduction to Linear Algebra.
Course Format
This course has been designed for independent study. It provides everything you will need to understand the concepts covered in the course. The materials include:

A complete set of Lecture Videos by Professor Gilbert Strang.
Summary Notes for all videos along with suggested readings in Prof. Strang’s textbook Linear Algebra.
Problem Solving Videos on every topic taught by an experienced MIT Recitation Instructor.
Problem Sets to do on your own with Solutions to check your answers against when you’re done.
A selection of Java® Demonstrations to illustrate key concepts.
A full set of Exams with Solutions, including review material to help you prepare.

Graph theory is a visual way to represent relationships between objects. One of the simplest uses of graph theory is a family tree that shows how different people are related. Another application is social networks like Facebook, where a network of "friends" and their "friends" can be represented using graphs. Students learn and apply concepts and methods of graph theory to analyze data for different relationships such as friendships and physical proximity. They are asked about relationships between people and how those relationships can be illustrated. As part of the lesson, students are challenged to find the social graph of their friends. This prepares students for the associated activity during which they simulate and analyze the spread of disease using graph theory by assuming close proximity to an infected individual causes the disease to spread.