FUZZY SETS. Precision vs. Relevancy LOOK OUT! A 1500 Kg mass is approaching your head OUT!! João M. C. Sousa 38
|
|
- Elvin Sutton
- 5 years ago
- Views:
Transcription
1 FUZZY SETS Precision vs. Relevancy A 5 Kg mass is approaching your head at at m/sec. m/s. OUT!! LOOK OUT! João M. C. Sousa 38
2 Introduction How to simplify very complex systems? Allow some degree of uncertainty in their description! How to deal mathematically with uncertainty? Using probabilistic theory (stochastic). Using the theory of fuzzy sets (non-stochastic). Proposed in 965 by Lotfi Zadeh (Fuzzy Sets, Information Control, 8, pp ). Imprecision or vagueness in natural language does not imply a loss of accuracy or meaningfulness! João M. C. Sousa 39 Examples Give travel directions in terms of city blocks OR in meters? The day is sunny OR the sky is covered by 5% of clouds? If the sky is covered by % of clouds is still sunny? And 25%? And 5%? Where to draw the line from sunny to not sunny? Member and not member or membership degree? João M. C. Sousa 4 2
3 Probability vs. Possibility Event u: Hans ate X eggs for breakfast. Probability distribution: P X (u) Possibility distribution: X (u) u P X (u)..8. X (u) João M. C. Sousa 4 Applications of fuzzy sets Fuzzy mathematics (measures, relations, topology, etc.) Fuzzy logic and AI (approximate reasoning, expert systems, etc.) Fuzzy systems Fuzzy modeling Fuzzy control, etc. Fuzzy decision making Multi-criteria optimization Optimization techniques João M. C. Sousa 42 3
4 Classical set theory Set: collection of objects with a common property. Examples: Set of basic colors: A = {red, green, blue} Set of positive integers: A{ x x} A line in 3 : A = {(x,y,z) ax + by + cz +d = } João M. C. Sousa 43 Representation of sets Enumeration of elements: A = {x, x 2,..., x n } Definition by property P: A = {x X P(x)} Characteristic function A(x) : X {,}, if x is member of A A( x), if x is not member of A Example: Set of odd numbers: ( x A ) x mod2 João M. C. Sousa 44 4
5 Set operations Intersection: C =AB Ccontains elements that belong to A and B Characteristic function: C = min( A, B ) = A B Union: C =AB Ccontains elements that belong to A or to B Characteristic function: C = max( A, B ) Complement: C = C contains elements that do not belong to A Characteristic function: C = A João M. C. Sousa 45 Fuzzy sets Represent uncertain (vague, ambiguous, etc.) knowledge in the form of propositions, rules, etc. Propositions: expensive cars, cloudy sky,... Rules (decisions): Want to buy a big and new house for a low price. If the temperature is low, then increase the heating. João M. C. Sousa 46 5
6 Classical set Example: set of old people A = {age age 7} A age [years] João M. C. Sousa 47 Logic propositions Nick is old... true or false Nick s age: age Nick = 7, A (7) = (true) age Nick = 69.9, A (69.9) = (false) A age [years] João M. C. Sousa 48 6
7 Fuzzy set Graded membership, element belongs to a set to a certain degree. A Membership membership grade age [years] João M. C. Sousa 49 Fuzzy proposition Nick is old... degree of truth age Nick = 7, A (7) =.5 age Nick = 69.9, A (69.9) =.49 age Nick = 9, A (9) = A membership grade age [years] João M. C. Sousa 5 7
8 Context dependent membership grade.5 A tall in China tall in USA tall in NBA h [cm] João M. C. Sousa 5 Typical linguistic values membership grade young middle age old age [years] João M. C. Sousa 52 8
9 Support of a fuzzy set supp(a) = {x X A (x) > } A supp( A) x João M. C. Sousa 53 Core (nucleus, kernel) core(a) = {x X A (x) = } A core( A) x João M. C. Sousa 54 9
10 -cut of a fuzzy set Crisp set: A = { x X A (x) } Strong -cut: A = { x X A (x) > } A A x João M. C. Sousa 55 Resolution principle Every fuzzy set A can be uniquely represented as a collection of -level sets according to ( x) sup [ ( x)] A [,] A Resolution principle implies that fuzzy set theory is a generalization of classical set theory, and that its results can be represented in terms of classical set theory. João M. C. Sousa 56
11 Resolution principle A x João M. C. Sousa 57 Other properties Height of a fuzzy set: hgt(a) = sup A (x), x X Fuzzy set is normal(ized) when hgt(a) =. A fuzzy set A is convex iff x,y X and [,]: A ( x + ( ) y) min( A (x), A (y)) A B x João M. C. Sousa 58
12 Other properties (2) Fuzzy singleton: single point x X where A (x) =. Fuzzy number: fuzzy set in that is normal and convex. Two fuzzy sets are equal (A = B) iff: xx, A (x) = B (x) A is a subset of B iff: xx, A (x) B (x) João M. C. Sousa 59 Non-convex fuzzy sets Example: car insurance risk age lifetime [years] João M. C. Sousa 6 2
13 Representation of fuzzy sets Discrete Universe of Discourse: Point-wise as a list of membership/element pairs: A = A (x )/x A (x n )/x n = i A (x i )/x i A = { A (x )/x,..., A (x n )/x n } = { A (x i )/x i x i X} As a list of -level/ -cut pairs: A = { /A,..., n /A n } = { i /A i i [,]} João M. C. Sousa 6 Representation of fuzzy sets Continuous Universe of Discourse: A = X A (x)/x Analytical formula: A( x), x 2 x Various possible notations: A (x), A(x), A, a, etc. João M. C. Sousa 62 3
14 Examples Discrete universe Fuzzy set A = sensible number of children. number of children: X = {,, 2, 3, 4, 5, 6} A =./ +.3/ +.7/2 + /3 +.6/4 +.2/5 +./6 Fuzzy set C = desirable city to live in X = {SF, Boston, LA} (discrete and non-ordered) C = {(SF,.9), (Boston,.8), (LA,.6)} João M. C. Sousa 63 Examples Continuous universe Fuzzy set B = about 5 years old X = + (set of positive real numbers) B = {(x, B (x)) x X} ( x B ) x 5 4 Membership Grades Age João M. C. Sousa 64 4
15 Complement of a fuzzy set c: [,] [,]; A (x c( A (x)) Fundamental axioms. Boundary conditions - c behaves as the ordinary complement c() = ; c() = 2. Monotonic non-increasing a,b [,], if a < b, then c(a) c(b) João M. C. Sousa 65 Complement of a fuzzy set Other axioms: c is a continuous function. c is involutive, which means that c(c(a)) = a, a [,] João M. C. Sousa 66 5
16 Complement of a fuzzy set Equilibrium point c(a) = a = e c, a [,] Each complement has at most one equilibrium. If c is a continuous fuzzy complement, it has one equilibrium point. João M. C. Sousa 67 Examples of fuzzy complements Satisfying only fundamental axioms: Fuzzy complement of threshold type: t=.3, c( a), if a t if a t João M. C. Sousa 68 6
17 Examples of fuzzy complements Satisfying fundamental axioms and continuity: Continuous fuzzy complement (non involutive) c( a) cosa João M. C. Sousa 69 Examples of fuzzy complements Sugeno complement: a c( a), ], ] a Sugeno fuzzy complement, lambda = -.9, -.5,, 2, João M. C. Sousa 7 7
18 Examples of fuzzy complement Yager complement: c w ( a) w w a, w], ] Yager fuzzy complement, w =.2,.5,, 2, João M. C. Sousa 7 Representation of complement (x) = A (x) A x João M. C. Sousa 72 8
19 Representation of complement x.5 =-.9 = x x A (x) - A (x) A (x) w=.2 w=5 A (x) João M. C. Sousa 73 Intersection of fuzzy sets i: [,] [,] [,]; AB (xi( A (x), B (x)) Fundamental axioms: triangular norm or t-norm. Boundary conditions - i behaves as the classical intersection i(,) = ; i(,) = i(,) = i(,) = 2. Commutativity i(a,b) = i(b,a) João M. C. Sousa 74 9
20 Intersection of fuzzy sets 3. Monotonicity If a a and b b, then i(a,b) i(a,b ) 4. Associativity i(i(a,b),c) = i(a,i(b,c)) Other axioms: i is a continuous function. i(a,a) =a(idempotent). João M. C. Sousa 75 Examples of fuzzy conjunctions Zadeh AB (x) = min( A (x), B (x)) Probabilistic AB (x) = A (x) B (x) Lukaziewicz AB (x) = max(, A (x) B (x) ) João M. C. Sousa 76 2
21 Intersection of fuzzy sets AB (x) = min( A (x), B (x)) A B x João M. C. Sousa 77 Intersection of fuzzy sets A B min(a,b) A*B max(,a+b-) x João M. C. Sousa 78 2
22 Yager t-norm Example of week and strong intersections: w w w iw a b a b w (, ) min,, ], ] Yager fuzzy intersection, w =.5, 2, João M. C. Sousa 79 Union of fuzzy sets u: [,] [,] [,]; AB (x u( A (x), B (x)) Fundamental axioms: triangular co-norm or s-norm. Boundary conditions - u behaves as the classical union u(,) = ; u(,) = u(,) = u(,) = 2. Commutativity u(a,b) = u(b,a) João M. C. Sousa 8 22
23 Union of fuzzy sets 3. Monotonicity If a a and b b, then u(a,b) u(a,b ) 4. Associativity u(u(a,b),c) = u(a,u(b,c)) Other axioms: u is a continuous function. u(a,a) =a(idempotent). João M. C. Sousa 8 Examples of fuzzy disjunctions Zadeh AB (x) = max( A (x), B (x)) Probabilistic AB (x) = A (x) B (x) A (x) B (x) Lukasiewicz AB (x) = min(, A (x) B (x)) João M. C. Sousa 82 23
24 Union of fuzzy sets AB (x) = max( A (x), B (x)) A B x João M. C. Sousa 83 Union of fuzzy sets.8.6 A B max(a,b) A+B-A*B min(,a+b) x João M. C. Sousa 84 24
25 Yager s-norm Example of week and strong disjunctions: w w w uw( a, b) min, a b, w], ] Yager fuzzy union, w = 2.5, 5, João M. C. Sousa 85 General aggregation operations Axioms h: [,] n [,]; A (x h( A (x),..., An (x)). Boundary conditions h(,...,) = h(,...,) = 2. Monotonic non-decreasing For any pair a i, b i [,], i If a i b i then h(a i ) h(b i ) João M. C. Sousa 86 25
26 General aggregation operations Other axioms: h is a continuous function. h is a symmetric function in all its arguments: h(a i ) = h(a p(i) ) for any permutation p on João M. C. Sousa 87 Averaging operations When all the four axioms hold: min( a,, a ) h( a,, a ) max( a,, a ) n n n Operator covering this range: Generalized mean h( a,, an) a a n n João M. C. Sousa 88 26
27 Generalized mean Typical cases: Lower bound: Geometric mean: h min( a,, a n ) h aa2a n ( ) n Harmonic mean: h n a a n Arithmetic mean: Upper bound: a a h n h n a a n max(,, ) João M. C. Sousa 89 Fuzzy aggregation operations Parametric t-norms Parametric s-norms Generalized mean i min min max u max Intersection operators Averaging operators Union operators João M. C. Sousa 9 27
28 Membership functions (MF) Triangular MF: xa cx Trxabc ( ;,, ) max min,, ba cb Trapezoidal MF: xa d x Tpxabcd ( ;,,, ) maxmin,,, ba d c Gaussian MF: Gs( x; a, b, c) e 2 xc 2 Generalized bell MF: Bell( xabc ;,, ) xc b 2a João M. C. Sousa 9 Membership functions (a) Triangular MF (b) Trapezoidal MF (c) Gaussian MF (d) Generalized Bell MF João M. C. Sousa 92 28
29 Left-right MF cx FL, xc LRxc ( ;,, ) xc FR, xc c= 65 = 6 = Membership Grades c = 25 = = 4 Membership Grades João M. C. Sousa 93 Two-dimensional fuzzy sets A ( xy, ) ( xy, )( xy, ) XY XY A A x y João Miguel da Costa Sousa 29
30 2-D membership functions (a) z = min(trap(x), trap(y)) (b) z = m ax(trap(x), trap(y)).5.5 Y - - X Y - - (c) z = min(bell(x), bell(y)) X (d) z = m ax(bell(x), bell(y)).5.5 Y - - X Y - - X João M. C. Sousa 95 Compound fuzzy propositions Small = Short and Light (conjunction) ( h, w) ( h) ( w) Small Short Light Weight(w) LIGHT HEAVY Compact Small Big Thin Height(h) LONG João Miguel da Costa Sousa 3
31 Cylindrical extension Cylindrical extension of fuzzy set A in X into Y results in a two-dimensional fuzzy set in X Y, given by cext ( A) ( x)/( xy, ) ( x) ( xy, )( xy, ) XY y A A XY.5 (a) Base Fuzzy Set A (b) Cylindrical Extension of A.5 X y X João M. C. Sousa 97 Projection (a) A Two-dimensional MF (b) Projection onto X (c) Projection onto Y Y X Y ( xy, ) A( x) max R( xy, ) B( y) max R( xy, ) R y X Y x X João M. C. Sousa 98 3
32 Cartesian product Cartesian product of fuzzy sets A and B is a fuzzy set in the product space X Y with membership ( x, y) min( ( x), ( y)) AB A B Cartesian co-product of fuzzy sets A and B is a fuzzy set in the product space X Y with membership ( x, y) max( ( x), ( y)) AB A B João M. C. Sousa 99 Cartesian product (a) trap(x) (b) trap(y) (X).5 (Y).5 - X (c) z = min(trap(x), trap(y)) - Y (d) z = max(trap(x), trap(y)) Y - X - Y - X João M. C. Sousa 32
33 Classical relations Classical relation R(X, X 2,..., X n ) is a subset of the Cartesian product: R Characteristic function: R X, X2,, Xn XX2Xn x, x,, x 2 n, iff x, x2,, x, otherwise n R João M. C. Sousa Example X = {English, French} Y = {dollar, pound, euro} Z = {USA, France, Canada, Britain, Germany} R(X, Y, Z) = {(English, dollar, USA), (French, euro, France), (English, dollar,canada), (French, dollar, Canada), (English, pound,britain)} João M. C. Sousa 2 33
34 Matrix representation USA Fra Can Brit Ger Dollar Pound Euro English USA Fra Can Brit Ger Dollar Pound Euro French João M. C. Sousa 3 Fuzzy relation Fuzzy relation: R: X X 2... X n [,] Each tuple (x, x 2,..., x n ) has a degree of membership. Fuzzy relation can be represented by an n-dimensional membership function (continuous space) or a matrix (discrete space). Examples: x is close to y x and y are similar x and y are related (dependent) João M. C. Sousa 4 34
35 Discrete examples Relation R very far between X = {New York, Lisbon} and Y = {New York, Beijing, London}: R(x,y) = /(NY,NY) + /(NY,Beijing) +.6/(NY,London) +.5/(Lisbon,NY) +.8/(Lisbon,Beijing) +./(Lisbon,London) Relation: is an important trade partner of Holland Germany USA Japan Holland,9,5,2 Germany,3,4,2 USA,3,4,7 Japan,6,8,9 João M. C. Sousa 5 Continuous example R: x y ( x is approximately equal to y ) ( x, y) e 2 ( xy) y x.5 João M. C. Sousa 6 35
36 Composition of relations R(X,Z) = P(X,Y) Q(Y,Z) Conditions: (x,z) R iff exists y Y such that (x,y) P and (y,z) Q. Max-min composition ( xz, ) max min ( xy, ), ( yz, ) PQ P Q yy João M. C. Sousa 7 Properties Associativity: R( ST) ( RS) T Distributivity over union: R( ST) ( RS) ( RT) Week distributivity over intersection: R( ST) ( RS) ( RT) Monotonicity: ST( RS) ( RT) João M. C. Sousa 8 36
37 Other compositions Max-prod composition ( xz, ) max ( xy, ) ( yz, ) PQ P Q yy Max-t composition ( xz, ) max t ( xy, ), ( yz, ) PQ P Q yy João M. C. Sousa 9 Example a b c d P Y Q Z 2 João M. C. Sousa 37
38 Example Composition R = P Q x z R (x,z) a.6 a 2.7 b.6 b 2.8 c 2 d 2.4 Composition R = P Q? João M. C. Sousa Matrix notation examples João M. C. Sousa 2 38
39 Relations on the same universe Let R be a relation defined on U U, then it is called: Reflexive, if u U, the pair (u,u) R Anti-reflexive, if u U, (u,u) R Symmetric, if u,v U, if (u,v) R, then (v,u) R too Anti-symmetric, if u,v U, if (u,v) and(v,u)r, then u = v Transitive, if u,v,w U, if (u,v) and(v,w)r, then (u,w)r too. João M. C. Sousa 3 Examples R is an equivalence relation if it is reflexive, symmetric and transitive. R is a partial order relation if it is reflexive, antisymmetric and transitive. R is a total order relation if R is a partial order relation, and u, v U, either (u,v) or (v,u) R. Examples: The subset relation on sets () is a partial order relation. The relation on is a total order relation. João M. C. Sousa 4 39
1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =
Math 115 Discrete Math Final Exam December 13, 2000 Your name It is important that you show your work. 1. Use the Euclidean algorithm to solve the decanting problem for decanters of sizes 199 and 98. In
More informationChapter-5 FUZZY LOGIC BASED VARIABLE GAIN PID CONTROLLERS
121 Chapter-5 FUZZY LOGIC BASED VARIABLE GAIN PID CONTROLLERS 122 5.1 INTRODUCTION The analysis presented in chapters 3 and 4 highlighted the applications of various types of conventional controllers and
More informationELEMENTS OF NUMBER THEORY & CONGRUENCES. Lagrange, Legendre and Gauss. Mth Mathematicst
ELEMENTS OF NUMBER THEORY & CONGRUENCES Lagrange, Legendre and Gauss ELEMENTS OF NUMBER THEORY & CONGRUENCES 1) If a 0, b 0 Z and a/b, b/a then 1) a=b 2) a=1 3) b=1 4) a=±b Ans : is 4 known result. If
More informationDefinitions and claims functions of several variables
Definitions and claims functions of several variables In the Euclidian space I n of all real n-dimensional vectors x = (x 1, x,..., x n ) the following are defined: x + y = (x 1 + y 1, x + y,..., x n +
More informationExam 2 Summary. 1. The domain of a function is the set of all possible inputes of the function and the range is the set of all outputs.
Exam 2 Summary Disclaimer: The exam 2 covers lectures 9-15, inclusive. This is mostly about limits, continuity and differentiation of functions of 2 and 3 variables, and some applications. The complete
More informationFuzzy Expert System for the Competitiveness Evaluation of Shipbuilding Companies
JOURNAL OF SOFTWARE, VOL. 9, NO. 3, MARCH 2014 663 Fuzzy Expert System for the Competitiveness Evaluation of Shipbuilding Companies Jianing Zheng School of Naval Architecture, Ocean and Civil Engineering,
More informationp 1 MAX(a,b) + MIN(a,b) = a+b n m means that m is a an integer multiple of n. Greatest Common Divisor: We say that n divides m.
Great Theoretical Ideas In Computer Science Steven Rudich CS - Spring Lecture Feb, Carnegie Mellon University Modular Arithmetic and the RSA Cryptosystem p- p MAX(a,b) + MIN(a,b) = a+b n m means that m
More informationHow to Enrich Description Logics with Fuzziness
How to Enrich Description Logics with Fuzziness Martin Unold Christophe Cruz SAI Computing Conference London 18.07.2017 Martin Unold Outline Description Logics (DL) in Artificial Intelligence (AI) Description
More informationIt is important that you show your work. The total value of this test is 220 points.
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
More informationApplication of Soft Computing Techniques in Water Resources Engineering
International Journal of Dynamics of Fluids. ISSN 0973-1784 Volume 13, Number 2 (2017), pp. 197-202 Research India Publications http://www.ripublication.com Application of Soft Computing Techniques in
More informationCS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch )
CS1802 Discrete Structures Recitation Fall 2017 October 9-12, 2017 CS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch 8.5-9.3) Sets i. Set Notation: Draw an arrow from the box on
More informationCS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch )
CS1802 Discrete Structures Recitation Fall 2017 October 9-12, 2017 CS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch 8.5-9.3) Sets i. Set Notation: Draw an arrow from the box on
More informationReview guide for midterm 2 in Math 233 March 30, 2009
Review guide for midterm 2 in Math 2 March, 29 Midterm 2 covers material that begins approximately with the definition of partial derivatives in Chapter 4. and ends approximately with methods for calculating
More informationSOLUTIONS 2. PRACTICE EXAM 2. HOURLY. Problem 1) TF questions (20 points) Circle the correct letter. No justifications are needed.
SOLUIONS 2. PRACICE EXAM 2. HOURLY Math 21a, S03 Problem 1) questions (20 points) Circle the correct letter. No justifications are needed. A function f(x, y) on the plane for which the absolute minimum
More informationSETS OBJECTIVES EXPECTED BACKGROUND KNOWLEDGE 1.1 SOME STANDARD NOTATIONS. Sets. MODULE - I Sets, Relations and Functions
1 SETS Let us consider the following situation : One day Mrs. and Mr. Mehta went to the market. Mr. Mehta purchased the following objects/items. "a toy, one kg sweets and a magazine". Where as Mrs. Mehta
More informationElementary Combinatorics
184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are
More informationLogical Agents (AIMA - Chapter 7)
Logical Agents (AIMA - Chapter 7) CIS 391 - Intro to AI 1 Outline 1. Wumpus world 2. Logic-based agents 3. Propositional logic Syntax, semantics, inference, validity, equivalence and satifiability Next
More information11/18/2015. Outline. Logical Agents. The Wumpus World. 1. Automating Hunt the Wumpus : A different kind of problem
Outline Logical Agents (AIMA - Chapter 7) 1. Wumpus world 2. Logic-based agents 3. Propositional logic Syntax, semantics, inference, validity, equivalence and satifiability Next Time: Automated Propositional
More informationSimulationusing Matlab Rules in Neuro-fuzzy Controller Based Washing Machine
RESEARCH ARTICLE OPEN ACCESS Simulationusing Matlab Rules in Neuro-fuzzy Controller Based Washing Machine Ms. NehaVirkhare*, Prof. R.W. Jasutkar ** *Department of Computer Science, G.H. Raisoni College
More information= X must be in a set of A or in a set of not A.
Traditional (crisp) logic Traditional (crisp) logic In 300 B.C. ristotle formulated the law of the ecluded middle, which is now the principle foundation of mathematics. = X X must be in a set of or in
More information17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
More informationDVA325 Formal Languages, Automata and Models of Computation (FABER)
DVA325 Formal Languages, Automata and Models of Computation (FABER) Lecture 1 - Introduction School of Innovation, Design and Engineering Mälardalen University 11 November 2014 Abu Naser Masud FABER November
More informationSolution: This is sampling without repetition and order matters. Therefore
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More information(d) If a particle moves at a constant speed, then its velocity and acceleration are perpendicular.
Math 142 -Review Problems II (Sec. 10.2-11.6) Work on concept check on pages 734 and 822. More review problems are on pages 734-735 and 823-825. 2nd In-Class Exam, Wednesday, April 20. 1. True - False
More informationStudy of fuzzy logic technique for power transistor problem
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727 PP 22-28 www.iosrjournals.org Study of fuzzy logic technique for power transistor problem K.Y. Rokde 1, S.M.Ghatole 2,
More information4. Let U = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, X = {2, 3, 4}, Y = {1, 4, 5}, Z = {2, 5, 7}. Find a) (X Y) b) X Y c) X (Y Z) d) (X Y) Z
Exercises 1. Write formal descriptions of the following sets. a) The set containing the numbers 1, 10, and 100 b) The set containing all integers that are greater than 5 c) The set containing all natural
More informationIntroduction to Combinatorial Mathematics
Introduction to Combinatorial Mathematics George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 300 George Voutsadakis (LSSU) Combinatorics April 2016 1 / 97
More informationFunctions of several variables
Chapter 6 Functions of several variables 6.1 Limits and continuity Definition 6.1 (Euclidean distance). Given two points P (x 1, y 1 ) and Q(x, y ) on the plane, we define their distance by the formula
More informationLecture 3 Presentations and more Great Groups
Lecture Presentations and more Great Groups From last time: A subset of elements S G with the property that every element of G can be written as a finite product of elements of S and their inverses is
More informationECE380 Digital Logic
ECE38 Digital Logic Introduction Dr. D. J. Jackson Lecture - Digital hardware Logic circuits are used to build computer hardware as well as other products (digital hardware) Late 96 s and early 97 s saw
More informationSolutions to the problems from Written assignment 2 Math 222 Winter 2015
Solutions to the problems from Written assignment 2 Math 222 Winter 2015 1. Determine if the following limits exist, and if a limit exists, find its value. x2 y (a) The limit of f(x, y) = x 4 as (x, y)
More information2.1 Partial Derivatives
.1 Partial Derivatives.1.1 Functions of several variables Up until now, we have only met functions of single variables. From now on we will meet functions such as z = f(x, y) and w = f(x, y, z), which
More informationFaculty of Mining, Geology and Petroleum Engineering, Zagreb, Croatia
Some Possibilities for Construction of Linguistic Variables for Sustainable Development Decision-Making D. Rajković Faculty of Mining, Geology and Petroleum Engineering, Zagreb, Croatia Email: drajkovi@rgn.hr
More informationJK XY LJ LJ ZX KL KL YZ LJ KL YX KJ. Final Exam Review Modules 10 16, 18 19
Geometry Final Exam Review Modules 10 16, 18 19 Use the following information for 1 3. The figure is symmetric about the x axis. Name: 6. In this figure ~. Which statement is not true? A JK XY LJ ZX C
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More informationHonors Algebra 2 Assignment Sheet - Chapter 1
Assignment Sheet - Chapter 1 #01: Read the text and the examples in your book for the following sections: 1.1, 1., and 1.4. Be sure you read and understand the handshake problem. Also make sure you copy
More information22c181: Formal Methods in Software Engineering. The University of Iowa Spring Propositional Logic
22c181: Formal Methods in Software Engineering The University of Iowa Spring 2010 Propositional Logic Copyright 2010 Cesare Tinelli. These notes are copyrighted materials and may not be used in other course
More informationTraffic Control Simulations in Boolean, Human and Fuzzy Logic
COMPUTING DEPARTMENT Traffic Control Simulations in Boolean, Human and Fuzzy Logic CO600 Group Project Adeel Ahmad, Craig Blackman, Nicholas McDowall Traffic Control Simulations in Boolean, Human, and
More informationReading 14 : Counting
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality
More informationCSE 21 Mathematics for Algorithm and System Analysis
CSE 21 Mathematics for Algorithm and System Analysis Unit 1: Basic Count and List Section 3: Set CSE21: Lecture 3 1 Reminder Piazza forum address: http://piazza.com/ucsd/summer2013/cse21/hom e Notes on
More informationThe City School. Comprehensive Worksheet (1st Term) November 2018 Mathematics Class 8
The City School Comprehensive Worksheet (1st Term) November 2018 Mathematics Class 8 Index No: S i INSTRUCTIONS Write your index number, section, school/campus and date clearly in the space provided Read
More informationFinal Exam, Math 6105
Final Exam, Math 6105 SWIM, June 29, 2006 Your name Throughout this test you must show your work. 1. Base 5 arithmetic (a) Construct the addition and multiplication table for the base five digits. (b)
More informationarxiv:math/ v2 [math.ho] 23 Aug 2008
arxiv:math/0507401v2 [math.ho] 23 Aug 2008 An easy method for finding many very large prime numbers Leonhard Euler 1. It suffices to explain this method with a single example of numbers contained in the
More information14.4. Tangent Planes. Tangent Planes. Tangent Planes. Tangent Planes. Partial Derivatives. Tangent Planes and Linear Approximations
14 Partial Derivatives 14.4 and Linear Approximations Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Suppose a surface S has equation z = f(x, y), where
More informationName Period Date. GEOMETRY AND MEASURESUREMENT Student Pages for Packet 6: Drawings and Constructions
Name Period Date GEOMETRY AND MEASURESUREMENT Student Pages for Packet 6: Drawings and Constructions GEO6.1 Geometric Drawings Review geometric notation and vocabulary. Use a compass and a ruler to make
More informationLecture 6: Metagaming
Lecture 6: Game Optimization Symmetry and Factoring Structure Identification Evaluation Functions Monte Carlo Tree Search 1 Rule Ordering Example: ancestor(x,z)
More informationThe Classification of Quadratic Rook Polynomials of a Generalized Three Dimensional Board
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (2017), pp. 1091-1101 Research India Publications http://www.ripublication.com The Classification of Quadratic Rook Polynomials
More informationContents 2.1 Basic Concepts of Probability Methods of Assigning Probabilities Principle of Counting - Permutation and Combination 39
CHAPTER 2 PROBABILITY Contents 2.1 Basic Concepts of Probability 38 2.2 Probability of an Event 39 2.3 Methods of Assigning Probabilities 39 2.4 Principle of Counting - Permutation and Combination 39 2.5
More informationMaxima and Minima. Terminology note: Do not confuse the maximum f(a, b) (a number) with the point (a, b) where the maximum occurs.
10-11-2010 HW: 14.7: 1,5,7,13,29,33,39,51,55 Maxima and Minima In this very important chapter, we describe how to use the tools of calculus to locate the maxima and minima of a function of two variables.
More informationStudy on Synchronous Generator Excitation Control Based on FLC
World Journal of Engineering and Technology, 205, 3, 232-239 Published Online November 205 in SciRes. http://www.scirp.org/journal/wjet http://dx.doi.org/0.4236/wjet.205.34024 Study on Synchronous Generator
More informationName: ID: Section: Math 233 Exam 2. Page 1. This exam has 17 questions:
Page Name: ID: Section: This exam has 7 questions: 5 multiple choice questions worth 5 points each. 2 hand graded questions worth 25 points total. Important: No graphing calculators! Any non scientific
More informationPractice problems from old exams for math 233
Practice problems from old exams for math 233 William H. Meeks III October 26, 2012 Disclaimer: Your instructor covers far more materials that we can possibly fit into a four/five questions exams. These
More informationMultiple Choice Questions for Review
Review Questions Multiple Choice Questions for Review 1. Suppose there are 12 students, among whom are three students, M, B, C (a Math Major, a Biology Major, a Computer Science Major. We want to send
More informationFUNCTIONS OF SEVERAL VARIABLES AND PARTIAL DIFFERENTIATION
FUNCTIONS OF SEVERAL VARIABLES AND PARTIAL DIFFERENTIATION 1. Functions of Several Variables A function of two variables is a rule that assigns a real number f(x, y) to each ordered pair of real numbers
More informationGLOSSARY. a * (b * c) = (a * b) * c. A property of operations. An operation * is called associative if:
Associativity A property of operations. An operation * is called associative if: a * (b * c) = (a * b) * c for every possible a, b, and c. Axiom For Greek geometry, an axiom was a 'self-evident truth'.
More informationSection 14.3 Partial Derivatives
Section 14.3 Partial Derivatives Ruipeng Shen March 20 1 Basic Conceptions If f(x, y) is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant.
More informationClass 8 - Sets (Lecture Notes)
Class 8 - Sets (Lecture Notes) What is a Set? A set is a well-defined collection of distinct objects. Example: A = {1, 2, 3, 4, 5} What is an element of a Set? The objects in a set are called its elements.
More informationAGS Math Algebra 2 Correlated to Kentucky Academic Expectations for Mathematics Grades 6 High School
AGS Math Algebra 2 Correlated to Kentucky Academic Expectations for Mathematics Grades 6 High School Copyright 2008 Pearson Education, Inc. or its affiliate(s). All rights reserved AGS Math Algebra 2 Grade
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationFuzzy auto-tuning for a PID controller
Fuzzy auto-tuning for a PID controller Alain Segundo Potts 1, Basilio Thomé de Freitas Jr 2. and José Carlos Amaro 2 1 Department of Telecommunication and Control. University of São Paulo. Brazil. e-mail:
More informationEVALUATING PRODUCTION TIME BUFFER FOR DEMAND VARIABILITY. Chien-Ho Ko
EVALUATING PRODUCTION TIME BUFFER FOR DEMAND VARIABILITY Chien-Ho Ko Department of Civil Engineering, National Pingtung University of Science and Technology, Pingtung, 91201, TAIWAN +886-8-770-3202, Email:
More informationCHAPTER 4 FUZZY LOGIC CONTROLLER
62 CHAPTER 4 FUZZY LOGIC CONTROLLER 4.1 INTRODUCTION Unlike digital logic, the Fuzzy Logic is a multivalued logic. It deals with approximate perceptive rather than precise. The effective and efficient
More informationTHE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n. Communicated by S. Alikhani
Algebraic Structures and Their Applications Vol 3 No 2 ( 2016 ) pp 71-79 THE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n MASOOMEH YAZDANI-MOGHADDAM AND REZA KAHKESHANI Communicated by S Alikhani
More information[f(t)] 2 + [g(t)] 2 + [h(t)] 2 dt. [f(u)] 2 + [g(u)] 2 + [h(u)] 2 du. The Fundamental Theorem of Calculus implies that s(t) is differentiable and
Midterm 2 review Math 265 Fall 2007 13.3. Arc Length and Curvature. Assume that the curve C is described by the vector-valued function r(r) = f(t), g(t), h(t), and that C is traversed exactly once as t
More informationSets. Definition A set is an unordered collection of objects called elements or members of the set.
Sets Definition A set is an unordered collection of objects called elements or members of the set. Sets Definition A set is an unordered collection of objects called elements or members of the set. Examples:
More information3. Given the similarity transformation shown below; identify the composition:
Midterm Multiple Choice Practice 1. Based on the construction below, which statement must be true? 1 1) m ABD m CBD 2 2) m ABD m CBD 3) m ABD m ABC 1 4) m CBD m ABD 2 2. Line segment AB is shown in the
More information4th Grade Emphasis Standards
PARCC Emphasis Standards References Module(s) Tested (Max. 2) Module(s) Taught NOT Tested (No Max.) NUMBER AND OPERATIONS IN BASE TEN OA 4.OA.1 4.OA.1 (A) 4.OA.1 (B) 4.OA.2 4.OA.2 (A) 4.OA.2 (B) Use the
More informationThe congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.
Congruences A congruence is a statement about divisibility. It is a notation that simplifies reasoning about divisibility. It suggests proofs by its analogy to equations. Congruences are familiar to us
More informationMock final exam Math fall 2007
Mock final exam Math - fall 7 Fernando Guevara Vasquez December 5 7. Consider the curve r(t) = ti + tj + 5 t t k, t. (a) Show that the curve lies on a sphere centered at the origin. (b) Where does the
More informationTest Yourself. 11. The angle in degrees between u and w. 12. A vector parallel to v, but of length 2.
Test Yourself These are problems you might see in a vector calculus course. They are general questions and are meant for practice. The key follows, but only with the answers. an you fill in the blanks
More informationMATH 261 EXAM II PRACTICE PROBLEMS
MATH 61 EXAM II PRACTICE PROBLEMS These practice problems are pulled from actual midterms in previous semesters. Exam typically has 6 problems on it, with no more than one problem of any given type (e.g.,
More informationGrade 4 Mathematics Indiana Academic Standards Crosswalk
Grade 4 Mathematics Indiana Academic Standards Crosswalk 2014 2015 The Process Standards demonstrate the ways in which students should develop conceptual understanding of mathematical content and the ways
More informationDiscrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions
CS 70 Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions PRINT Your Name: Oski Bear SIGN Your Name: OS K I PRINT Your Student ID: CIRCLE your exam room: Pimentel
More informationUnit 7 Partial Derivatives and Optimization
Unit 7 Partial Derivatives and Optimization We have learned some important applications of the ordinary derivative in finding maxima and minima. We now move on to a topic called partial derivatives which
More informationUSED OF FUZZY TOOL OR PID FOR SPEED CONTROL OF SEPRATELY EXCITED DC MOTOR
USED OF FUZZY TOOL OR PID FOR SPEED CONTROL OF SEPRATELY EXCITED DC MOTOR Amit Kumar Department of Electrical Engineering Nagaji Institute of Technology and Management Gwalior, India Prof. Rekha Kushwaha
More informationSENSTIVITY ANALYSIS OF PROJECT SCHEDULING USING FUZZY SET THEORY
SENSTIVITY ANALYSIS OF PROJECT SCHEDULING USING FUZZY SET THEORY Batan Sharma 1, Dr. Mukesh Pandey 2 1PG scholar s, Civil Engineering Department, ITM University, Gwalior 2HOD, Civil Engineering Department,
More informationSample Spaces, Events, Probability
Sample Spaces, Events, Probability CS 3130/ECE 3530: Probability and Statistics for Engineers August 28, 2014 Sets A set is a collection of unique objects. Sets A set is a collection of unique objects.
More informationExam 2 Review Sheet. r(t) = x(t), y(t), z(t)
Exam 2 Review Sheet Joseph Breen Particle Motion Recall that a parametric curve given by: r(t) = x(t), y(t), z(t) can be interpreted as the position of a particle. Then the derivative represents the particle
More informationGoldbach Conjecture (7 th june 1742)
Goldbach Conjecture (7 th june 1742) We note P the odd prime numbers set. P = {p 1 = 3, p 2 = 5, p 3 = 7, p 4 = 11,...} n 2N\{0, 2, 4}, p P, p n/2, q P, q n/2, n = p + q We call n s Goldbach decomposition
More informationRemember that represents the set of all permutations of {1, 2,... n}
20180918 Remember that represents the set of all permutations of {1, 2,... n} There are some basic facts about that we need to have in hand: 1. Closure: If and then 2. Associativity: If and and then 3.
More informationGREATER CLARK COUNTY SCHOOLS PACING GUIDE. Grade 4 Mathematics GREATER CLARK COUNTY SCHOOLS
GREATER CLARK COUNTY SCHOOLS PACING GUIDE Grade 4 Mathematics 2014-2015 GREATER CLARK COUNTY SCHOOLS ANNUAL PACING GUIDE Learning Old Format New Format Q1LC1 4.NBT.1, 4.NBT.2, 4.NBT.3, (4.1.1, 4.1.2,
More informationComputing and Communications 2. Information Theory -Channel Capacity
1896 1920 1987 2006 Computing and Communications 2. Information Theory -Channel Capacity Ying Cui Department of Electronic Engineering Shanghai Jiao Tong University, China 2017, Autumn 1 Outline Communication
More informationPermutations and codes:
Hamming distance Permutations and codes: Polynomials, bases, and covering radius Peter J. Cameron Queen Mary, University of London p.j.cameron@qmw.ac.uk International Conference on Graph Theory Bled, 22
More informationCS 202, section 2 Final Exam 13 December Pledge: Signature:
CS 22, section 2 Final Exam 3 December 24 Name: KEY E-mail ID: @virginia.edu Pledge: Signature: There are 8 minutes (3 hours) for this exam and 8 points on the test; don t spend too long on any one question!
More informationHigh Efficiency DC/DC Buck-Boost Converters for High Power DC System Using Adaptive Control
American-Eurasian Journal of Scientific Research 11 (5): 381-389, 2016 ISSN 1818-6785 IDOSI Publications, 2016 DOI: 10.5829/idosi.aejsr.2016.11.5.22957 High Efficiency DC/DC Buck-Boost Converters for High
More information4th Grade Mathematics Mathematics CC
Course Description In Grade 4, instructional time should focus on five critical areas: (1) attaining fluency with multi-digit multiplication, and developing understanding of dividing to find quotients
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 7 1 Congruence Definition 2 Congruence is an Equivalence Relation (CER) 3 Properties of Congruence (PC) 4 Example 5 Congruences
More informationANSWER KEY. (a) For each of the following partials derivatives, use the contour plot to decide whether they are positive, negative, or zero.
Math 2130-101 Test #2 for Section 101 October 14 th, 2009 ANSWE KEY 1. (10 points) Compute the curvature of r(t) = (t + 2, 3t + 4, 5t + 6). r (t) = (1, 3, 5) r (t) = 1 2 + 3 2 + 5 2 = 35 T(t) = 1 r (t)
More informationDiscrete Math Class 4 ( )
Discrete Math 37110 - Class 4 (2016-10-06) 41 Division vs congruences Instructor: László Babai Notes taken by Jacob Burroughs Revised by instructor DO 41 If m ab and gcd(a, m) = 1, then m b DO 42 If gcd(a,
More informationA Complete Approximation Theory for Weighted Transition Systems
A Complete Approximation Theory for Weighted Transition Systems December 1, 2015 Peter Christoffersen Mikkel Hansen Mathias R. Pedersen Radu Mardare Kim G. Larsen Department of Computer Science Aalborg
More informationMonotone Comparative Statics 1
John Nachbar Washington University March 27, 2016 1 Overview Monotone Comparative Statics 1 Given an optimization problem indexed by some parameter θ, comparative statics seeks a qualitative understanding
More informationGrade 6. Prentice Hall. Connected Mathematics 6th Grade Units Alaska Standards and Grade Level Expectations. Grade 6
Prentice Hall Connected Mathematics 6th Grade Units 2004 Grade 6 C O R R E L A T E D T O Expectations Grade 6 Content Standard A: Mathematical facts, concepts, principles, and theories Numeration: Understand
More informationIntroduction to Modular Arithmetic
1 Integers modulo n 1.1 Preliminaries Introduction to Modular Arithmetic Definition 1.1.1 (Equivalence relation). Let R be a relation on the set A. Recall that a relation R is a subset of the cartesian
More informationCHAPTER 11 PARTIAL DERIVATIVES
CHAPTER 11 PARTIAL DERIVATIVES 1. FUNCTIONS OF SEVERAL VARIABLES A) Definition: A function of two variables is a rule that assigns to each ordered pair of real numbers (x,y) in a set D a unique real number
More informationChapter 3: Elements of Chance: Probability Methods
Chapter 3: Elements of Chance: Methods Department of Mathematics Izmir University of Economics Week 3-4 2014-2015 Introduction In this chapter we will focus on the definitions of random experiment, outcome,
More informationMATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.
MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations
More informationSolutions to Exercises Chapter 6: Latin squares and SDRs
Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,
More informationMA 524 Midterm Solutions October 16, 2018
MA 524 Midterm Solutions October 16, 2018 1. (a) Let a n be the number of ordered tuples (a, b, c, d) of integers satisfying 0 a < b c < d n. Find a closed formula for a n, as well as its ordinary generating
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More information