Exercise 5.

Slides:



Advertisements
Similar presentations
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Advertisements

R Lecture 4 Naomi Altman Department of Statistics Department of Statistics (Based on notes by J. Lee)
Domain Restriction on Relation domain restriction operator,, restricts a relation to only those members whose domain is in a specified set. domain restriction.
Fuzzy Set and Opertion. Outline Fuzzy Set and Crisp Set Expanding concepts Standard operation of fuzzy set Fuzzy relations Operations on fuzzy relations.
1. What number does the following array represent?
Inverses of n x n Matrices. The Inverse Matrix If A is an n x n matrix, the inverse of A (call it A -1 ) is the matrix such that A * A -1 is equal to.
Maths for Computer Graphics
Binary Decision Diagrams1 BINARY DECISION DIAGRAMS.
Relations. Binary Relations a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). Note the di ff erence between.
Theory and Applications
Chapter 18 Testing Conventional Applications
Arrays (Part II). Two- and Multidimensional Arrays Two-dimensional array: collection of a fixed number of components (of the same type) arranged in two.

Dynamic Programming Introduction to Algorithms Dynamic Programming CSE 680 Prof. Roger Crawfis.
Finite Element: Theory, Applications & Implementation Presented By: Arthur Anconetani Barbara Gault Ryan Whitney.
3-2 Relations and Functions
Functions Teacher Twins©2014.
Array Processing Simple Program Design Third Edition A Step-by-Step Approach 7.
CSCE350 Algorithms and Data Structure Lecture 17 Jianjun Hu Department of Computer Science and Engineering University of South Carolina
How to reform a terrain into a pyramid Takeshi Tokuyama (Tohoku U) Joint work with Jinhee Chun (Tohoku U) Naoki Katoh (Kyoto U) Danny Chen (U. Notre Dame)
931102fuzzy set theory chap07.ppt1 Fuzzy relations Fuzzy sets defined on universal sets which are Cartesian products.
Array Processing.
Mathematical Preliminaries. Sets Functions Relations Graphs Proof Techniques.
Functions and Graphs Chapter 1.2. Functions 2 Example 1: The Circle-Area Function 3.
Matrices A matrix is a table or array of numbers arranged in rows and columns The order of a matrix is given by stating its dimensions. This is known as.
CSC401: Analysis of Algorithms CSC401 – Analysis of Algorithms Chapter Dynamic Programming Objectives: Present the Dynamic Programming paradigm.
Fall 2005Costas Busch - RPI1 Mathematical Preliminaries.
Prof. Busch - LSU1 Mathematical Preliminaries. Prof. Busch - LSU2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
Computer Science: A Structured Programming Approach Using C1 8-7 Two-Dimensional Arrays The arrays we have discussed so far are known as one- dimensional.
Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.
Introductions to Linear Transformations Function T that maps a vector space V into a vector space W: V: the domain of T W: the codomain of T Chapter.
Transition Diagrams Lecture 3 Wed, Jan 21, Building Transition Diagrams from Regular Expressions A regular expression consists of symbols a, b,
Working with Arrays in MATLAB
An Introduction to Programming with C++ Fifth Edition Chapter 11 Arrays.
Computer Programming TCP1224 Chapter 11 Arrays. Objectives Using Arrays Declare and initialize a one-dimensional array Manipulate a one-dimensional array.
Relations and their Properties
CHAPTER 3 FUZZY RELATION and COMPOSITION. 3.1 Crisp relation Product set Definition (Product set) Let A and B be two non-empty sets, the product.
Functions and Relations 2 Page 3 We are going to work on some of the exercises today:
Mathematical Preliminaries
PART 10 Pattern Recognition 1. Fuzzy clustering 2. Fuzzy pattern recognition 3. Fuzzy image processing FUZZY SETS AND FUZZY LOGIC Theory and Applications.
Computer Sciences Department1.  Property 1: each node can have up to two successor nodes (children)  The predecessor node of a node is called its.
Finite Automata Chapter 1. Automatic Door Example Top View.
Computer Science: A Structured Programming Approach Using C1 8-7 Two-Dimensional Arrays The arrays we have discussed so far are known as one- dimensional.
1 Mathematical Preliminaries. 2 Sets Functions Relations Graphs Proof Techniques.
CSCI 115 Course Review.
Finite Element: Theory, Applications & Implementation Presented By: Arthur Anconetani Barbara Gault Ryan Whitney.
Precalculus Section 14.1 Add and subtract matrices Often a set of data is arranged in a table form A matrix is a rectangular.
Chapter 1 Computing Tools Variables, Scalars, and Arrays Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Fuzzy Relations( 關係 ), Fuzzy Graphs( 圖 形 ), and Fuzzy Arithmetic( 運算 ) Chapter 4.
Efficient Huffman Decoding Aggarwal, M. and Narayan, A., International Conference on Image Processing, vol. 1, pp. 936 – 939, 2000 Presenter :Yu-Cheng.
Objectives: 1. Be able to find the Euler Number. 2.Be simplify expressions using the Natural base (with a calculator also) 3.Be able to graph a Natural.
Chapter 8.1 vocabulary Relation Is a pairing of numbers or a set of ordered pair {(2,1) (3,5) (6, 3)} Domain: first set of numbers Range: Second set of.
Algebra II 2007 Released Test. 1. Which is a simplified form of the following expression? A 2.B 3.C 4.D.
Chapter 1 INTRODUCTION TO THE THEORY OF COMPUTATION.
Chapter 3 FUZZY RELATION AND COMPOSITION
Piecewise-Defined Functions
X AND R CHART EXAMPLE IN-CLASS EXERCISE
Introduction to Fuzzy Logic
CS2210 Discrete Structures Relations
Transition Diagrams Lecture 3 Fri, Jan 21, 2005.
Animated Conversion of Regular Expressions to C Code
CSCI N207 Data Analysis Using Spreadsheet
Function Tables and Graphs
CSE 321 Discrete Structures
Notes Over 8.3 Simplifying Natural Base Expressions
Matrix A matrix is a rectangular arrangement of numbers in rows and columns Each number in a matrix is called an Element. The dimensions of a matrix are.
The Identity and Inverse Matrices
Ordered Pair – (11 - 2) CS-708.
Agenda Lecture Content: Relations (Relasi)
Presentation transcript:

Exercise 5

5.1 The fuzzy relation R is denned on sets X1 = {a, b, c}, X2 = {s, t}, X3 = {x, y}, X4 = {i, j } as follows: R(X1, X2, X3, X4) = .4/ b, t, y, i +.6/ a, s, x, I + .9/ b, s, y, j + .6/ a, t, y, j + .2/ c, s, y, i. (a) Compute the projections R1, 2, 4 , R1, 3 and R4. (b) Compute the cylindric extensions [R1, 2, 4↑{X3}], [R1, 3↑{X2, X4}], [R4↑{ X1, X2, X3}]. (c) Compute the cylindric closure from the three cylindric extensions in (b). (d) Is the cylindric closure from (c) equal to the original R?

5.4 Consider matrices M1, M2, M3 in Table 5.4 as pages in a three-dimensional array that represents a fuzzy ternary relation. Determine: (a) all two-dimensional projections; (b) cylindric extensions and cylindric closure of the two-dimensional projections; (c) all one-dimensional projections; (d) cylindric extensions and cylindric closure of the one-dimensional projections; (e) two three-dimensional arrays expressing the difference between each of the cylindric closures and the original ternary relation.

5.6 The fuzzy binary relation R is defined on sets X ={1, 2 , . . . , 100} and Y = {50, 5 1 , . . . , 100} and represents the relation "x is much smaller than y" It is defined by membership function (a) What is the domain of R ? (b) What is the range of R ? (c) What is the height of R ? (d) Calculate R-1.

5.11 Assuming X = Y, perform the max-min composition of some sequences of comparable relations given in Table 5.4. For example: (a) M1。M2。M4。M5。M8。M9。M12。M13; (b) M1。M2。M3。M4。M5。M6。M7,etc.

5.19 The transitive closure of the relation denned by matrix M12 in Table 5.4 (Exercise 5.16) is a equivalence relation. Determine its partition tree.

5.20 Relations defined by matrices M3 and M12 in Table 5.4 are compatibility relations (assume X = Y). Determine: (a) simple diagrams of the relations; (b) all complete α-covers of the relations.