Artificial Intelligence Project

Slides:

Advertisements

Similar presentations

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Connectivity Lecture _13.

Advertisements

Graphs: basic definitions and notation Definition A (undirected, unweighted) graph is a pair G = (V, E), where V = {v 1, v 2,..., v n } is a set of vertices,

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,

1 Section 8.1 Introduction to Graphs. 2 Graph A discrete structure consisting of a set of vertices and a set of edges connecting these vertices –used.

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:

What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.

1 Representing Relations Part 2: directed graphs.

ECE 201 Circuit Theory I1 Node-Voltage Method Special Case Voltage source between essential nodes.

W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Graph theory and routing (initial background) E E Lecture 4.

Graphs. Graph A “graph” is a collection of “nodes” that are connected to each other Graph Theory: This novel way of solving problems was invented by a.

Chapter 9: Graphs Basic Concepts

Chapter 4 Graphs.

1 MASTERING (VIRTUAL) NETWORKS A Case Study of Virtualizing Internet Lab Avin Chen Borokhovich Michael Goldfeld Arik.

GRAPH Learning Outcomes Students should be able to:

Teaching Deliberative Navigation Using the LEGO RCX and Standard LEGO Components Gary R. Mayer, Dr. Jerry Weinberg, Dr. Xudong Yu

Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.

Data Structures Week 9 Introduction to Graphs Consider the following problem. A river with an island and bridges. The problem is to see if there is a way.

Computer Science: A Structured Programming Approach Using C Graphs A graph is a collection of nodes, called vertices, and a collection of segments,

Introduction to Graph Theory

Introduction to Graph Theory

Data Structures CSCI 132, Spring 2014 Lecture 38 Graphs

Beyond planarity of graphs Eyal Ackerman University of Haifa and Oranim College.

Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.

CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Turing Machines.

Lecture 11: 9.4 Connectivity Paths in Undirected & Directed Graphs Graph Isomorphisms Counting Paths between Vertices 9.5 Euler and Hamilton Paths Euler.

 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.

Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.

Discrete Structures CISC 2315 FALL 2010 Graphs & Trees.

Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.

Graphs Basic properties.

Static Timing Analysis

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Design and Analysis of Algorithms Introduction to graphs, representations of a graph Haidong Xue Summer 2012, at GSU.

1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.

MAT 2720 Discrete Mathematics Section 8.1 Introduction

Data Structures and Algorithms

Electrical Engineering

Graphs: Definitions and Basic Properties

Next Level Tic-Tac-Toe

Graphs and Graph Models

Minimum Pk-total weight of simple connected graphs

Identifying functions and using function notation

Graph Operations And Representation

Spanning Trees Discrete Mathematics.

Introduction to Graph Theory Euler and Hamilton Paths and Circuits

AVOIDANCE OF SYSTEM DEADLOCKS IN REAL TIME CONTROL OF FLEXIBLE MANUFACTURING SYSTEMS By Richard A. Wysk.

ECE 1270: Introduction to Electric Circuits

Chapter 9: Graphs Basic Concepts

Graph Operations And Representation

Nodes, Branches, and Loops

Walks, Paths, and Circuits

Graph Theory By Amy C. and John M..

Trees L Al-zaid Math1101.

10.1 Graphs and Graph Models

Representing Relations

Matt Baker The Dollar Game on a Graph (with 9 surprises!)

Trees 11.1 Introduction to Trees Dr. Halimah Alshehri.

Redefining the High-Technology Classroom

Lecture 10: Graphs Graph Terminology Special Types of Graphs

Graphs G = (V, E) V are the vertices; E are the edges.

Algorithms Lecture # 27 Dr. Sohail Aslam.

Graph Operations And Representation

Hamilton Paths and Circuits

Algorithms CSCI 235, Spring 2019 Lecture 32 Graphs I

HW 3 (Due Wednesday Feb 6) Create slide(s) for your 1 minute presentation on a graph theory application. Make sure your slide(s) include (1) Define the.

Chapter 9: Graphs Basic Concepts

DAGs Longin Jan Latecki

Presentation transcript:

Artificial Intelligence Project Zicong Wang, Fan Yang

Outline Traditional lab Virtual lab Theory background Result and feedback

Traditional lab TA has to be present Student have to be present Limited time Limited space Accident Error happens

Architecture and advantages Virtual Lab Architecture and advantages Flexibility of repeating lab experiment 7/24 accessibility Effective utilization of space and equipment

Interface and functionality Virtual Lab Interface and functionality

Theory Background Circuit simulation Introduction (Multisim)

Theory Background Graph Theory a graph(G): G = (V, E) A graph in this context is made up of vertices (V) and edges(E) A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or its edges may be directed from one vertex to another

Theory Background Graph Theory Application in electrical circuit Circuit element  edge Node  vertice

Theory background Topologically equivalent circuit

Theory background Examples Equivalent situation Inequivalent situation

Theory background Independent Loop in State-space Loop1: V1-L1-R1 Loop2: V1-L1-R2-C1 Loop1: V2-L2-R3 Loop2: V2-L2-C2-R4

Result and feedback

Result and feedback Traditional teaching lab Experiment Virtual teaching lab

Thank You