CHAPTER 3 FUZZY RELATION and COMPOSITION
|
|
- Kelley Perkins
- 5 years ago
- Views:
Transcription
1 CHAPTER 3 FUZZY RELATION and COMPOSITION
2 Crisp relation! Definition (Product set) Let A and B be two non-empty sets, the prod uct set or Cartesian product A B is defined as follows, A B = {(a, b) a A, b B } Example A = {a 1, a 2, a 3 }, B = {b 1, b 2 } A B = {(a 1, b 1 ), (a 1, b 2 ), (a 2, b 1 ), (a 2, b 2 ), (a 3, b 1 ), (a 3, b 2 )} b 2 (a 1, b 2 ) (a 2, b 2 ) (a 3, b 2 ) b 1 (a 1, b 1 ) (a 2, b 1 ) (a 3, b 1 ) a 1 a 2 a 3
3 Crisp relation n n Binary Relation If A and B are two sets and there is a specific property between elements x of A and y of B, this property can be described using the ordered pair (x, y). A set of such (x, y) pairs, x A and y B, is called a relation R. R = { (x,y) x A, y B } n-ary relation For sets A 1, A 2, A 3,..., A n, the relation among elements x 1 A 1, x 2 A 2, x 3 A 3,..., x n A n can be described by n-tuple (x 1, x 2,..., x n ). A collection o f such n-tuples (x 1, x 2, x 3,..., x n ) is a relation R among A 1, A 2, A 3,..., A n. (x 1, x 2, x 3,, x n ) R, R A 1 A 2 A 3 A n
4 Crisp relation! Domain and Range dom(r) = { x x A, (x, y) R for some y B } ran(r) = { y y B, (x, y) R for some x A } A B R dom ( R ) ran( R ) dom(r), ran(r)
5 Crisp relation! Characteristics of relation (1) Surjection (many-to-one) n f(a) = B or ran(r) = B. y B, x A, y = f(x) n Thus, even if x1 x2, f(x1) = f(x2) can hold. A B x 1 x 2 f y Surjection
6 Crisp relation (3) Injection (into, one-to-one) n for all x1, x2 A, x1 x2, f(x1) f(x2). n if R is an injection, (x1, y) R and (x2, y) R then x1 = x2. (4) Bijection (one-to-one correspondence) n both a surjection and an injection. A B x 1 f y 1 x 2 y 2 x 3 y 3 y 4 Injection A B x 1 x 2 f y 1 y 2 x 3 y 3 x 4 y 4 Bijection
7 Crisp relation! Representation methods of relations (1)Bipartigraph(Fig 3.7) representing the relation by drawing arcs or edges (2)Coordinate diagram(fig 3.8) plotting members of A on x axis and that of B on y axis A B y a 1 b 1 4 a 2 b 2 a 3 a 4 b x Fig 3.7 Binary relation from A to B Fig 3.8 Relation of x 2 + y 2 = 4
8 Crisp relation (3) Matrix manipulating relation matrix (4) Digraph the directed graph or digraph method M R = (m ij ) m ij 1, = 0, ( a, b i ( a, b i j ) R i = 1, 2, 3,, m j = 1, 2, 3,, n j ) R Matrix R b 1 b 2 b 3 a a a a Directed graph
9 Crisp relation! Operations on relations R, S A B (1) Union of relation T = R S If (x, y) R or (x, y) S, then (x, y) T (2) Intersection of relation T = R S If (x, y) R and (x, y) S, then (x, y) T. (3) Complement of relation If (x, y) R, then (x, y) (4) Inverse relation R -1 = {(y, x) B A (x, y) R, x A, y B} (5) Composition T R R A B, S B C, T = S R A C T = {(x, z) x A, y B, z C, (x, y) R, (y, z) S}
10 Crisp relation! Path and connectivity in graph Path of length n in the graph defined by a relation R A A is a finite series of p = a, x 1, x 2,..., x n-1, b where each element should be a R x 1, x 1 R x 2,..., x n-1 R b. Besides, when n refers to a positive integer (1) Relation R n on A is defined, x R n y means there exists a path from x to y w hose length is n. (2) Relation R on A is defined, x R y means there exists a path from x to y. That is, there exists x R y or x R 2 y or x R 3 y... and. This relation R is the reachability relation, and denoted as xr y (3) The reachability relation R can be interpreted as connectivity relation of A.
11 Properties of relation on a single set! Fundamental properties 1) Reflexive relation x A (x, x) R or µ R (x, x) = 1, x A n irreflexive if it is not satisfied for some x A n antireflexive if it is not satisfied for all x A 2) Symmetric relation (x, y) R (y, x) R or µ R (x, y) = µ R (y, x), x, y A n asymmetric or nonsymmetric when for some x, y A, (x, y) R and (y, x) R. n antisymmetric if for all x, y A, (x, y) R and (y, x) R
12 Properties of relation on a single set 3) Transitive relation For all x, y, z A (x, y) R, (y, z) R (x, z) R 4) Closure n Closure of R with the respect to a specific property is the smallest rela tion R' containing R and satisfying the specific property
13 Properties of relation on a single set! Example The transitive closure (or reachability relation) R of R for A = {1, 2, 3, 4} and R = {(1, 2), (2, 3), (3, 4), (2, 1)} is R = R R 2 R 3 ={(1, 1), (1, 2), (1, 3), (1,4), (2,1), (2,2), (2, 3), (2, 4), (3, 4)} (a) R 4 (b) R Fig 3.10 Transitive closure
14 Properties of relation on a single set! Equivalence relation (1) Reflexive relation x A (x, x) R (2) Symmetric relation (x, y) R (y, x) R (3) Transitive relation (x, y) R, (y, z) R (x, z) R
15 Properties of relation on a single set! Equivalence classes a partition of A into n disjoint subsets A 1, A 2,..., A n A A 1 A 2 b b a d e a d e c c (a) Expression by set (b) Expression by undirected graph Fig 3.11 Partition by equivalence relation π(a/r) = {A 1, A 2 } = {{a, b, c}, {d, e}}
16 Properties of relation on a single set! Compatibility relation (tolerance relation) (1) Reflexive relation (2) Symmetric relation x A (x, x) R A (x, y) R (y, x) R A 1 A 2 b b a d e a d e c c (a) Expression by set (b) Expression by undirected graph Fig 3.12 Partition by compatibility relation
17 Properties of relation on a single set! Pre-order relation (1) Reflexive relation x A (x, x) R (2) Transitive relation (x, y) R, (y, z) R (x, z) R A a c b d e h f g a c b, d e f, h g (a) Pre-order relation (b) Pre-order Fig 3.13 Pre-order relation
18 Properties of relation on a single set! Order relation (1) Reflexive relation x A (x, x) R (2) Antisymmetric relation (x, y) R (y, x) R (3) Transitive relation (x, y) R, (y, z) R (x, z) R n strict order relation (1 ) Antireflexive relation x A (x, x) R n total order or linear order relation (4) x, y A, (x, y) R or (y, x) R
19 Properties of relation on a single set! Comparison of relations Property Relation Reflexive Antireflexive Symmetric Antisymmetric Transitive Equivalence ü ü ü Compatibility ü ü Pre-order ü ü Order ü ü ü Strict order ü ü ü
20 Fuzzy relation n Crisp relation n membership function µ R (x, y) 1 iff (x, y) R µ R (x, y) = n µ R : A B {0, 1} 0 iff (x, y) R n Fuzzy relation n µ R : A B [0, 1] n R = {((x, y), µ R (x, y)) µ R (x, y) 0, x A, y B}
21 Fuzzy relation Example Crisp relation R µ R (a, c) = 1, µ R (b, a) = 1, µ R (c, b) = 1 and µ R (c, d) = 1. Fuzzy relation R µ R (a, c) = 0.8, µ R (b, a) = 1.0, µ R (c, b) = 0.9, µ R (c, d) = 1.0 a a 0.8 c 1.0 c b b d d (a) Crisp relation (b) Fuzzy relation Fig 3.16 crisp and fuzzy relations A A a b c d a b c d corresponding fuzzy matrix
22 Fuzzy relation! Fuzzy matrix 1) Sum A + B = Max [a ij, b ij ] 2) Max product A B = AB = Max [ Min (a ik, b kj ) ] 3) Scalar product λa where 0 λ 1 k
23 Fuzzy relation! Example
24 Fuzzy relation! Operation of fuzzy relation 1) Union relation (x, y) A B µ R S (x, y) = Max [µ R (x, y), µ S (x, y)] = µ R (x, y) µ S (x, y) 2) Intersection relation µ R S (x) = Min [µ R (x, y), µ S (x, y)] = µ R (x, y) µ S (x, y) 3) Complement relation (x, y) A B µ R (x, y) = 1 - µ R (x, y) 4) Inverse relation For all (x, y) A B, µ -1 R (y, x) = µ R (x, y)
25 ! Fuzzy relation matrix Fuzzy relation
26 Fuzzy relation! Composition of fuzzy relation For (x, y) A B, (y, z) B C, µ S R (x, z) = Max [Min (µ R (x, y), µ S (y, z))] y = [µ R (x, y) µ S (y, z)] y M S R = M R M S
27 Fuzzy relation! Example => => Composition of fuzzy relation
28 Fuzzy relation! α-cut of fuzzy relation R α = {(x, y) µ R (x, y) α, x A, y B} : a crisp relation. Example
29 Fuzzy relation! Projection For all x A, y B, µ x = Max µ x ( ) R( y) y ( y) Maxµ ( x y) R A, µ = R B R, x : projection to A : projection to B n Example
30 Fuzzy relation n Projection in n dimension µ x x,, x = R n Cylindrical extension µ C(R) (a, b, c) = µ R (a, b) a A, b B, c C ( ) ( x, x,, x ) Max i1, i2 ik R 1 2 X, X,, X µ Xi1 Xi 2 Xik j1 j 2 jm n n Example
31 Extension of fuzzy set! Extension by relation n Extension of fuzzy set x A, y B y = f(x) or x = f -1 (y) for y B ( y) µ B Max µ ʹ = 1 x f ( y) [ ( x) ] A if f -1 (y) Example A = {(a 1, 0.4), (a 2, 0.5), (a 3, 0.9), (a 4, 0.6)}, B = {b 1, b 2, b 3 } f -1 (b 1 ) = {(a 1, 0.4), (a 3, 0.9)}, Max [0.4, 0.9] = 0.9 µ B' (b 1 ) = 0.9 f -1 (b 2 ) = {(a 2, 0.5), (a 4, 0.6)}, Max [0.5, 0.6] = 0.6 µ B' (b 2 ) = 0.6 f -1 (b 3 ) = {(a 4, 0.6)} µ B' (b 3 ) = 0.6 B' = {(b 1, 0.9), (b 2, 0.6), (b 3, 0.6)}
32 Extension of fuzzy set! Extension by fuzzy relation For x A, y B, and Bʹ B µ B' (y) = Max [Min (µ A (x), µ R (x, y))] x f -1(y) n Example For b 1 Min [µ A (a 1 ), µ R (a 1, b 1 )] = Min [0.4, 0.8] = 0.4 Min [µ A (a 3 ), µ R (a 3, b 1 )] = Min [0.9, 0.3] = 0.3 Max [0.4, 0.3] = 0.4 è µ B' (b 1 ) = 0.4 For b 2, Min [µ A (a 2 ), µ R (a 2, b 2 )] = Min [0.5, 0.2] = 0.2 Min [µ A (a 4 ), µ R (a 4, b 2 )] = Min [0.6, 0.7] = 0.6 Max [0.2, 0.6] = 0.6 èµ B' (b 2 ) = 0.6 For b 3, Max Min [µ A (a 4 ), µ R (a 4, b 3 )] = Max Min [0.6, 0.4] = 0.4 è µ B' (b 3 ) = 0.4 B' = {(b 1, 0.4), (b 2, 0.6), (b 3, 0.4)}
33 Extension of fuzzy set n Example A = {(a 1, 0.8), (a 2, 0.3)} B = {b 1, b 2, b 3 } C = {c 1, c 2, c 3 } B' = {(b 1, 0.3), (b 2, 0.8), (b 3, 0)} C' = {(c 1, 0.3), (c 2, 0.3), (c 3, 0.8)}
34 Extension of fuzzy set! Fuzzy distance between fuzzy sets n Pseudo-metric distance (1) d(x, x) = 0, x X (2) d(x 1, x 2 ) = d(x 2, x 1 ), x 1, x 2 X (3) d(x 1, x 3 ) d(x 1, x 2 ) + d(x 2, x 3 ), x 1, x 2, x 3 X + (4) if d(x 1, x 2 )=0, then x 1 = x 2 è metric distance n Distance between fuzzy sets n δ R +, µ d(a, B) (δ) =Max [Min (µ A (a), µ B (b))] δ = d(a, b)
35 Extension of fuzzy set! Example A = {(1, 0.5), (2, 1), (3, 0.3)} B = {(2, 0.4), (3, 0.4), (4, 1)}.
CHAPTER 3 FUZZY RELATION and COMPOSITION
CHAPTER 3 FUZZY RELATION and COMPOSITION The concept of fuzzy set as a generalization of crisp set has been introduced in the previous chapter. Relations between elements of crisp sets can be extended
More information1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).
Exercises Exercises 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). a) {(1, 1), (1, 2), (1, 3)} b) {(1, 2), (2, 1), (2, 2), (3,
More informationWhat Is A Relation? Example. is a relation from A to B.
3.3 Relations What Is A Relation? Let A and B be nonempty sets. A relation R from A to B is a subset of the Cartesian product A B. If R A B and if (a, b) R, we say that a is related to b by R and we write
More informationPower Set of a set and Relations
Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}
More informationTOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.
TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. 301. Definition. Let m be a positive integer, and let X be a set. An m-tuple of elements of X is a function x : {1,..., m} X. We sometimes use x i instead
More informationA set with only one member is called a SINGLETON. A set with no members is called the EMPTY SET or 2 N
Mathematical Preliminaries Read pages 529-540 1. Set Theory 1.1 What is a set? A set is a collection of entities of any kind. It can be finite or infinite. A = {a, b, c} N = {1, 2, 3, } An entity is an
More informationBinary Relations McGraw-Hill Education
Binary Relations A binary relation R from a set A to a set B is a subset of A X B Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can also represent
More informationLogic and Discrete Mathematics. Section 2.5 Equivalence relations and partitions
Logic and Discrete Mathematics Section 2.5 Equivalence relations and partitions Slides version: January 2015 Equivalence relations Let X be a set and R X X a binary relation on X. We call R an equivalence
More informationTHREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.
THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of
More informationSlides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
More informationNotes on metric spaces and topology. Math 309: Topics in geometry. Dale Rolfsen. University of British Columbia
Notes on metric spaces and topology Math 309: Topics in geometry Dale Rolfsen University of British Columbia Let X be a set; we ll generally refer to its elements as points. A distance function, or metric
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationPoint-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS
Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following
More informationT. Background material: Topology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 T. Background material: Topology For convenience this is an overview of basic topological ideas which will be used in the course. This material
More informationCS 341 Homework 1 Basic Techniques
CS 341 Homework 1 Basic Techniques 1. What are these sets? Write them using braces, commas, numerals, (for infinite sets), and only. (a) ({1, 3, 5} {3, 1}) {3, 5, 7} (b) {{3}, {3, 5}, {{5, 7}, {7, 9}}}
More informationNotes on Fuzzy Set Ordination
Notes on Fuzzy Set Ordination Umer Zeeshan Ijaz School of Engineering, University of Glasgow, UK Umer.Ijaz@glasgow.ac.uk http://userweb.eng.gla.ac.uk/umer.ijaz May 3, 014 1 Introduction The membership
More informationSets. De Morgan s laws. Mappings. Definition. Definition
Sets Let X and Y be two sets. Then the set A set is a collection of elements. Two sets are equal if they contain exactly the same elements. A is a subset of B (A B) if all the elements of A also belong
More informationFunctions. How is this definition written in symbolic logic notation?
functions 1 Functions Def. Let A and B be sets. A function f from A to B is an assignment of exactly one element of B to each element of A. We write f(a) = b if b is the unique element of B assigned by
More informationSets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31
Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall 2014 1 / 31 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference
More informationComputer Science and Mathematics. Part I: Fundamental Mathematical Concepts Winfried Kurth
Computer Science and Mathematics Part I: Fundamental Mathematical Concepts Winfried Kurth http://www.uni-forst.gwdg.de/~wkurth/csm17_home.htm 1. Mathematical Logic Propositions - can be either true or
More informationECS 20 Lecture 9 Fall Oct 2013 Phil Rogaway
ECS 20 Lecture 9 Fall 2013 24 Oct 2013 Phil Rogaway Today: o Sets of strings (languages) o Regular expressions Distinguished Lecture after class : Some Hash-Based Data Structures and Algorithms Everyone
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
More informationEDAA40 At home exercises 1
EDAA40 At home exercises 1 1. Given, with as always the natural numbers starting at 1, let us define the following sets (with iff ): Give the number of elements in these sets as follows: 1. 23 2. 6 3.
More informationIn class 75min: 2:55-4:10 Thu 9/30.
MATH 4530 Topology. In class 75min: 2:55-4:10 Thu 9/30. Prelim I Solutions Problem 1: Consider the following topological spaces: (1) Z as a subspace of R with the finite complement topology (2) [0, π]
More informationFunctions 2/1/2017. Exercises. Exercises. Exercises. and the following mathematical appetizer is about. Functions. Functions
Exercises Question 1: Given a set A = {x, y, z} and a set B = {1, 2, 3, 4}, what is the value of 2 A 2 B? Answer: 2 A 2 B = 2 A 2 B = 2 A 2 B = 8 16 = 128 Exercises Question 2: Is it true for all sets
More informationFuzzy Sets and Systems. Lecture 2 (Fuzzy Sets) Bu- Ali Sina University Computer Engineering Dep. Spring 2010
Fuzzy Sets and Systems Lecture 2 (Fuzzy Sets) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Fuzzy Sets Formal definition: A fuzzy set A in X (universal set) is expressed as a set of ordered
More informationComplexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np
Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be
More informationTopology problem set Integration workshop 2010
Topology problem set Integration workshop 2010 July 28, 2010 1 Topological spaces and Continuous functions 1.1 If T 1 and T 2 are two topologies on X, show that (X, T 1 T 2 ) is also a topological space.
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
More information2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members
More informationFunctions. Def. Let A and B be sets. A function f from A to B is an assignment of exactly one element of B to each element of A.
Functions functions 1 Def. Let A and B be sets. A function f from A to B is an assignment of exactly one element of B to each element of A. a A! b B b is assigned to a a A! b B f ( a) = b Notation: If
More informationLecture 17: Continuous Functions
Lecture 17: Continuous Functions 1 Continuous Functions Let (X, T X ) and (Y, T Y ) be topological spaces. Definition 1.1 (Continuous Function). A function f : X Y is said to be continuous if the inverse
More informationElementary Topology. Note: This problem list was written primarily by Phil Bowers and John Bryant. It has been edited by a few others along the way.
Elementary Topology Note: This problem list was written primarily by Phil Bowers and John Bryant. It has been edited by a few others along the way. Definition. properties: (i) T and X T, A topology on
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationCS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation
CS 441 Discrete Mathematics for CS Lecture 24 Relations IV Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Equivalence relation Definition: A relation R on a set A is called an equivalence relation
More informationDigraphs and Relations
Digraphs and Relations RAKESH PRUDHVI KASTHURI 07CS1035 Professor: Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur November 6, 2008 November 6, 2008 Section 1 1 Digraphs A graph
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationCS388C: Combinatorics and Graph Theory
CS388C: Combinatorics and Graph Theory David Zuckerman Review Sheet 2003 TA: Ned Dimitrov updated: September 19, 2007 These are some of the concepts we assume in the class. If you have never learned them
More informationCS100: DISCRETE STRUCTURES
CS: DISCRETE STRUCTURES Computer Science Department Lecture : Set and Sets Operations (Ch2) Lecture Contents 2 Sets Definition. Some Important Sets. Notation used to describe membership in sets. How to
More information2. Functions, sets, countability and uncountability. Let A, B be sets (often, in this module, subsets of R).
2. Functions, sets, countability and uncountability I. Functions Let A, B be sets (often, in this module, subsets of R). A function f : A B is some rule that assigns to each element of A a unique element
More informationConvex Optimization. 2. Convex Sets. Prof. Ying Cui. Department of Electrical Engineering Shanghai Jiao Tong University. SJTU Ying Cui 1 / 33
Convex Optimization 2. Convex Sets Prof. Ying Cui Department of Electrical Engineering Shanghai Jiao Tong University 2018 SJTU Ying Cui 1 / 33 Outline Affine and convex sets Some important examples Operations
More informationFundamentals of Discrete Mathematical Structures
Fundamentals of Discrete Mathematical Structures THIRD EDITION K.R. Chowdhary Campus Director JIET School of Engineering and Technology for Girls Jodhpur Delhi-110092 2015 FUNDAMENTALS OF DISCRETE MATHEMATICAL
More informationChapter 4 Graphs and Matrices. PAD637 Week 3 Presentation Prepared by Weijia Ran & Alessandro Del Ponte
Chapter 4 Graphs and Matrices PAD637 Week 3 Presentation Prepared by Weijia Ran & Alessandro Del Ponte 1 Outline Graphs: Basic Graph Theory Concepts Directed Graphs Signed Graphs & Signed Directed Graphs
More informationPoint-Set Topology II
Point-Set Topology II Charles Staats September 14, 2010 1 More on Quotients Universal Property of Quotients. Let X be a topological space with equivalence relation. Suppose that f : X Y is continuous and
More informationChapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:
Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have
More informationFunctions and Sequences Rosen, Secs. 2.3, 2.4
UC Davis, ECS20, Winter 2017 Discrete Mathematics for Computer Science Prof. Raissa D Souza (slides adopted from Michael Frank and Haluk Bingöl) Lecture 8 Functions and Sequences Rosen, Secs. 2.3, 2.4
More informationFinal Exam, F11PE Solutions, Topology, Autumn 2011
Final Exam, F11PE Solutions, Topology, Autumn 2011 Question 1 (i) Given a metric space (X, d), define what it means for a set to be open in the associated metric topology. Solution: A set U X is open if,
More informationTopology - I. Michael Shulman WOMP 2004
Topology - I Michael Shulman WOMP 2004 1 Topological Spaces There are many different ways to define a topological space; the most common one is as follows: Definition 1.1 A topological space (often just
More informationRelational Database: The Relational Data Model; Operations on Database Relations
Relational Database: The Relational Data Model; Operations on Database Relations Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Overview
More informationLecture 1: Examples, connectedness, paths and cycles
Lecture 1: Examples, connectedness, paths and cycles Anders Johansson 2011-10-22 lör Outline The course plan Examples and applications of graphs Relations The definition of graphs as relations Connectedness,
More informationA metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions
1 Distance Reading [SB], Ch. 29.4, p. 811-816 A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions (a) Positive definiteness d(x, y) 0, d(x, y) =
More informationThe Language of Sets and Functions
MAT067 University of California, Davis Winter 2007 The Language of Sets and Functions Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (January 7, 2007) 1 The Language of Sets 1.1 Definition and Notation
More informationAntisymmetric Relations. Definition A relation R on A is said to be antisymmetric
Antisymmetric Relations Definition A relation R on A is said to be antisymmetric if ( a, b A)(a R b b R a a = b). The picture for this is: Except For Example The relation on R: if a b and b a then a =
More informationDISCRETE DOMAIN REPRESENTATION FOR SHAPE CONCEPTUALIZATION
DISCRETE DOMAIN REPRESENTATION FOR SHAPE CONCEPTUALIZATION Zoltán Rusák, Imre Horváth, György Kuczogi, Joris S.M. Vergeest, Johan Jansson Department of Design Engineering Delft University of Technology
More informationCS 173 Lecture 18: Relations on a Set
CS 173 Lecture 18: Relations on a Set José Meseguer University of Illinois at Urbana-Champaign 1 Relations on a Set 1.1 The Data Type RelpAq Many algorithms, in particular the so-called graph algorithms,
More informationMath 734 Aug 22, Differential Geometry Fall 2002, USC
Math 734 Aug 22, 2002 1 Differential Geometry Fall 2002, USC Lecture Notes 1 1 Topological Manifolds The basic objects of study in this class are manifolds. Roughly speaking, these are objects which locally
More informationMATH 22 MORE ABOUT FUNCTIONS. Lecture M: 10/14/2003. Form follows function. Louis Henri Sullivan
MATH 22 Lecture M: 10/14/2003 MORE ABOUT FUNCTIONS Form follows function. Louis Henri Sullivan This frightful word, function, was born under other skies than those I have loved. Le Corbusier D ora innanzi
More information2.3: FUNCTIONS. abs( x)
2.3: FUNCTIONS Definition: Let A and B be sets. A function f is a rule that assigns to each element x A exactly one element y B, written y = f (x). A is called the domain of f and f is said to be defined
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationRelations and Graphs
s and are Pictures of (Binary) s E. Wenderholm Department of Computer Science SUNY Oswego c 2016 Elaine Wenderholm All rights Reserved Outline 1 A Function that returns a boolean Special Properties of
More information10/11/2018. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings
Sometimes, relations define an order on the elements in a set. Definition: A relation R on a set S is called a partial ordering or partial order if it is reflexive, antisymmetric, and transitive. A set
More informationCSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
More informationCS243, Logic and Computation Sets, functions, and languages
CS243, Prof. Alvarez 1 NAIVE SET THEORY Prof. Sergio A. Alvarez http://www.cs.bc.edu/ alvarez/ Maloney Hall, room 569 alvarez@cs.bc.edu Computer Science Department voice: (617) 552-4333 Boston College
More informationGraph Theory: Introduction
Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab
More informationFuzzy Mathematics. Fuzzy -Sets, -Relations, -Logic, -Graphs, -Mappings and The Extension Principle. Olaf Wolkenhauer. Control Systems Centre UMIST
Fuzzy Mathematics Fuzzy -Sets, -Relations, -Logic, -Graphs, -Mappings and The Extension Principle Olaf Wolkenhauer Control Systems Centre UMIST o.wolkenhauer@umist.ac.uk www.csc.umist.ac.uk/people/wolkenhauer.htm
More informationINTRODUCTION TO TOPOLOGY
INTRODUCTION TO TOPOLOGY MARTINA ROVELLI These notes are an outline of the topics covered in class, and are not substitutive of the lectures, where (most) proofs are provided and examples are discussed
More informationM3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements.
M3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements. Chapter 1: Metric spaces and convergence. (1.1) Recall the standard distance function
More informationChapter 2: FUZZY SETS
Ch.2: Fuzzy sets 1 Chapter 2: FUZZY SETS Introduction (2.1) Basic Definitions &Terminology (2.2) Set-theoretic Operations (2.3) Membership Function (MF) Formulation & Parameterization (2.4) Complement
More informationConvex Optimization - Chapter 1-2. Xiangru Lian August 28, 2015
Convex Optimization - Chapter 1-2 Xiangru Lian August 28, 2015 1 Mathematical optimization minimize f 0 (x) s.t. f j (x) 0, j=1,,m, (1) x S x. (x 1,,x n ). optimization variable. f 0. R n R. objective
More information2.1 Sets 2.2 Set Operations
CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more
More informationLecture notes for Topology MMA100
Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine
More information2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to
2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to be connected if it is not disconnected. A subset of
More informationPARTIALLY ORDERED SETS. James T. Smith San Francisco State University
PARTIALLY ORDERED SETS James T. Smith San Francisco State University A reflexive transitive relation on a nonempty set X is called a quasi-ordering of X. An ordered pair consisting of a nonempty
More informationCardinality Lectures
Cardinality Lectures Enrique Treviño March 8, 014 1 Definition of cardinality The cardinality of a set is a measure of the size of a set. When a set A is finite, its cardinality is the number of elements
More informationInformation Granulation and Approximation in a Decision-theoretic Model of Rough Sets
Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan Canada S4S 0A2 E-mail: yyao@cs.uregina.ca
More informationMath 205B - Topology. Dr. Baez. February 23, Christopher Walker
Math 205B - Topology Dr. Baez February 23, 2007 Christopher Walker Exercise 60.2. Let X be the quotient space obtained from B 2 by identifying each point x of S 1 with its antipode x. Show that X is homeomorphic
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationCS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1. Define Graph. A graph G = (V, E) consists
More informationNotes on point set topology, Fall 2010
Notes on point set topology, Fall 2010 Stephan Stolz September 3, 2010 Contents 1 Pointset Topology 1 1.1 Metric spaces and topological spaces...................... 1 1.2 Constructions with topological
More informationTHEORY OF COMPUTATION
THEORY OF COMPUTATION UNIT-1 INTRODUCTION Overview This chapter begins with an overview of those areas in the theory of computation that are basic foundation of learning TOC. This unit covers the introduction
More informationLet A(x) be x is an element of A, and B(x) be x is an element of B.
Homework 6. CSE 240, Fall, 2014 Due, Tuesday October 28. Can turn in at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Given two arbitrary
More informationAMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.
AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a
More informationROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY
ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE BANACH CENTER PUBLICATIONS, VOLUME 28 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1993 ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More information4. Definition: topological space, open set, topology, trivial topology, discrete topology.
Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 3, 2008 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationRelations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
More informationGraph Matrices and Applications: Motivational Overview The Problem with Pictorial Graphs Graphs were introduced as an abstraction of software structure. There are many other kinds of graphs that are useful
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
More information1. Fuzzy sets, fuzzy relational calculus, linguistic approximation
1. Fuzzy sets, fuzzy relational calculus, linguistic approximation 1.1. Fuzzy sets Let us consider a classical set U (Universum) and a real function : U --- L. As a fuzzy set A we understand a set of pairs
More informationComputational Intelligence Lecture 10:Fuzzy Sets
Computational Intelligence Lecture 10:Fuzzy Sets Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2011 arzaneh Abdollahi Computational Intelligence Lecture
More informationCombinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
More informationReducing Clocks in Timed Automata while Preserving Bisimulation
Reducing Clocks in Timed Automata while Preserving Bisimulation Shibashis Guha Chinmay Narayan S. Arun-Kumar Indian Institute of Technology Delhi {shibashis, chinmay, sak}@cse.iitd.ac.in arxiv:1404.6613v2
More informationLecture 9 - Matrix Multiplication Equivalences and Spectral Graph Theory 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanfordedu) February 6, 2018 Lecture 9 - Matrix Multiplication Equivalences and Spectral Graph Theory 1 In the
More informationREVIEW OF FUZZY SETS
REVIEW OF FUZZY SETS CONNER HANSEN 1. Introduction L. A. Zadeh s paper Fuzzy Sets* [1] introduces the concept of a fuzzy set, provides definitions for various fuzzy set operations, and proves several properties
More informationL. A. Zadeh: Fuzzy Sets. (1965) A review
POSSIBILISTIC INFORMATION: A Tutorial L. A. Zadeh: Fuzzy Sets. (1965) A review George J. Klir Petr Osička State University of New York (SUNY) Binghamton, New York 13902, USA gklir@binghamton.edu Palacky
More informationI BSc(Computer Science)[ ] Semester - II Allied:DISCRETE MATHEMATICS - 207D Multiple Choice Questions.
1 of 23 1/20/2018, 2:35 PM Dr.G.R.Damodaran College of Science (Autonomous, affiliated to the Bharathiar University, recognized by the UGC)Reaccredited at the 'A' Grade Level by the NAAC and ISO 9001:2008
More information1 Sets, Fields, and Events
CHAPTER 1 Sets, Fields, and Events B 1.1 SET DEFINITIONS The concept of sets play an important role in probability. We will define a set in the following paragraph. Definition of Set A set is a collection
More information