Demonstrative Implications of a New Logical Aggregation Paradigm on a Classical Fuzzy Evaluation Model of «Green» Buildings

Size: px
Start display at page:

Download "Demonstrative Implications of a New Logical Aggregation Paradigm on a Classical Fuzzy Evaluation Model of «Green» Buildings"

Transcription

1 Demonstrative Implications of a New Logical Aggregation Paradigm on a Classical Fuzzy Evaluation Model of «Green» Buildings Milan Mrkalj Faculty of Organizational Sciences, Belgrade, Serbia mrki2000@mail.bg Abstract. This paper demonstrates the application possibilities of the generalised model for Logical Aggregation (LA) in performance and quality evaluation of Green buildings through establishing a linear order of them by a (scalar) general aggregated quality parameter and sorting them into categories. An existing classical fuzzy model is experimentally modified in order to demonstrate the advanced capabilities of adequate articulation of the partial demands for quality via the new generalised model for logical aggregation. Keywords: Logical Aggregation, Quality management, Green buildings. 1 Introduction The advanced abilities of generalised model for Logical Aggregation presented in [1,4,5,6,7] expand the boundaries of existing fuzzy model presented in [2]. The existing model is in essence an aggregation model since the inputs are multidimensional values and the output is a scalar quantity which provides base for simple linear sorting. In existing fuzzy model only trivial quality attributes are used, without interaction between them through logical functions which should improve the articulation of partial demands for quality. Also, the aggregation operator (explained in [3,6]) is only dot product. The model for Logical Aggregation (LA) introduces the use of logical functions between trivial attributes which emerge from the finite set of possible functions Boolean algebra generated over the set of attributes. The new complex aggregation operators are introduced with the use of different generalised products which belong to a subclass of T-norms with additional axiomatic term of nonnegativity, as shown in [1,4,6]. Implementation of the model for Logical Aggregation [1] is possible in both phases of aggregation in the existing model [2]. The LA paradigm emanates an algebraic structure which provides the basis for arithmetic calculation of the output results. A. Laurent et al. (Eds.): IPMU 2014, Part II, CCIS 443, pp , Springer International Publishing Switzerland 2014

2 Demonstrative Implications of a New Logical Aggregation Paradigm 21 2 Implementaton of Logical Aggregation in the First Phase of Aggregation of the Existing Fuzzy Model Implementation of LA on the first phase of aggregation of existing model is demonstrated, and the values of the output are compared. The aim is to show the ability to create complex attributes which have more power of expressing the partial demands for quality in quality management. The term attributes from [1,3,6] are named as factors in [2] and are organized as two factor sets. Vector of weights of secondary attributes of the primary attribute energy efficient and energy utilization from [2] is: A 2 = [ 0,35 0,35 0,2 0,1 ]. Weights of secondary attributes are respectively w a = 0,35 w b = 0,35 w c = 0,2 and w d = 0,1. In this case, generalised pseudo-boolean polynomial is trivial (contains only single basic attributes). Now we shall unify attributes architecture design (a) and envelope structure (b) into one single new complex attribute on the basis of the fact that these two single attributes are significantly positive correlated in qualitative sense (architecture design and envelope structure which assures the rational heat transfer coefficient of external surfaces) [2]. Single attributes a and b will be dismissed (their respective weights become zero instead of 0,35), and new complex attribute a b (1) will be introduced, with weight w a b = w a + w b = 0.7. ϕ(a,b) = (a b) (1) Generalised Boolean polynomial of this logical expression is given in (2). ϕ (a,b) = ((a b)) = a b (2) New Logical Aggregation operator based on [3] is given in (3). 7 Agg (a,b,c,d) = 10 ϕ (a,b) c d = 7 10 (a b) c d (3) Corresponding aggregation measure [3] is given in (4). μ = 7 10 (σ a σ b ) σ c σ d (4) Aggregation measures (4) are shown in Table 1: Table 1. S a b 0,2 c 0,1 d 0,7 a b μ(s) {0} {a} {b}

3 22 M. Mrkalj Table 1. (continued) {c} ,2 {d} ,1 {a,b} ,7 {a,c} ,2 {a,d} ,1 {b,c} ,2 {b,d} ,1 {c,d} ,3 {a,b,c} ,9 {a,b,d} ,8 {a,c,d} ,3 {b,c,d} ,3 {a,b,c,d} On value level input parameters from R 2 matrix from [2] are processed through operator given in (3). «Energy efficient and energy utilization» - values from R 2 Table 2. one star * CATEGORIES two stars three stars ** *** Architecture design a 0,1 0,2 0,7 Envelope structure b 0,1 0,2 0,7 HVAC c 0,15 0,25 0,6 Lighting system d 0,1 0,25 0,65 In qualitative sense, attributes given in Table 2 are highly positive correlated, so the most suitable generalised product [3,4,6] should be the min function ( := min). Aggregation operator (3) processes one by one column of R 2 matrix and outputs into vector B 2 '. Agg (a,b,c,d) : R 2 B 2 ' B 2 '=[0,11 0,215 0,675] This result of Logical Aggregation coincides with the result of first phase aggregation of the existing fuzzy model developed in [2], so B 2 ' = B 2. Now we shall use dot product as generalised product for LA ( : = *). B 2 '=[0,047 0,115 0,675] Different choice of generalised product obviously induces changes on the level of values, B 2 ' B 2. After first phase of aggregation, the resulting values of quality are different from the values given by existing model.

4 Demonstrative Implications of a New Logical Aggregation Paradigm 23 3 Simulation of the Use of Aggregation Operator of Existing Fuzzy Model through Logical Aggregation Operator New model of LA [1,4,6] will be applied again on the first phase of aggregation of the existing model [2], and the results will be compared. The aim is to show the possibilities of manipulation on the level of internal structure of the attributes which is fragmented via the new LA paradigm and to achieve the same results as with usage of the existing model. Vector of weights of the secondary attributes of the primary attribute operation management [2] is: A 6 = [0,3 0,3 0,4]. Weights of secondary attributes a (garbage classification and biologic treatment),b (intellectualized system) and c (all kinds of management system) are respectively w a = 0,3 w b = 0,3 and w c = 0,4. Generalised pseudo-boolean polynomial [1] of the single attributes is equal to the attributes themselves: ϕ (a) = a v ϕ (b) = b v ϕ (c) = c v From the aspect of immanent structure, single attributes are complex elements (contain more than one atomic attribute [1]). In this particular case, every attribute a, b, or c includes 4 atomic attributes. Some of the atomic attributes (which present internal algebraic structure) are shared among the attributes. Now aggregation measures μ(s) are assigned to the atomic attributes (S) according to weights given in vector A 6. Table 3. w σϕ = 0.3 w σϕ = 0.1 w σϕ = 0.6 Atoms (S) μ(s) {0} {a} {b} {c} {a,b} {a,c} ,7 {b,c} ,7 {a,b,c} In Table 3 one of the possible weights assignment and structures is presented, and it defines the immanent structure σϕ (as explained in [1,4,6,7]) of the new attributes which are used to simulate the aggregation operator of existing fuzzy model [2].

5 24 M. Mrkalj The corresponding generalised pseudo-boolean polynomial is generated by summation of atomic pseudo-boolean polynomials included into structure defined by structure vectors σϕ. This procedure gives the aggregation operator shown in equation (5): Agg (a,b,c) = 3 10 [ a - 2(a c) - 2(a b) + 4(a b c) + b - 2(b c) + c ] c + 3 [ a b - 2(a b c) + a c + b c ] (5) 5 On the level of values (arithmetic level), one by one column of matrix of input parameters R 6 from [2] is processed through the operator given in (5) and put into vector B 6 '. For generalised product, dot product is used. B 6 ' = [0,17 0,285 0,545], B 6 ' = B 6 If the min function is used as the generalised product, the yield is: B 6 ' = [0,17 0,285 0,545], B 6 ' = B 6 As shown above, using the Logical Aggregation operator (5) and generalised product ( := *) and ( := min) respectively, the yield is the same as the one in the first phase of the existing model presented in [2], and the aim of simulating the model from [2] is successfully achieved. 4 Implementation of Logical Aggregation in the Second Phase of Aggregation of the Existing Fuzzy Model The second phase of aggregation in [2] will be modified for the purpose of demonstration of two interesting abilities of the LA model. If there is a need to satisfy only one of the two or more quality demands and not all of them at the same time If there is a quality demand which should swap the relative importance of other quality demands Table 4. PRIMARY ATTRIBUTES (A) WEIGHT VECTOR OF PRIMARY ATTRIBUTES A=[w(a i )] Land-saving and outdoor environment (a) 0,1 Energy efficient and energy utilization (b) 0,5 Water-saving and water utilization (c) 0,2 Material-saving and material utilization (d) 0,1 Indoor environment quality (e) 0,05 Operation management (f) 0,05 wa ( ) i = 1

6 Demonstrative Implications of a New Logical Aggregation Paradigm 25 In Table 4 the primary attributes with their respective weights are shown. The weight vector is A = [0,1 0,5 0,2 0,1 0,05 0,05]. If we wish to have satisfied only one of the two quality demands material-saving and material utilization and indoor environment quality, and not both of them at the same time, this can be achieved by removing single attributes (their respective weights become zero), and introducing new complex attribute d e with weight w d e = w d + w e = 0,15. ϕ(d,e) = (d e) (6) Generalised Boolean polynomial [1] of this logical expression is given in (7). ϕ (d,e) = ((d e)) = d + e - d e (7) If we wish to have a quality demand which can swap the relative importance of other quality demands, it can be done through a logical function of these attributes. For example, if Energy efficient and energy utilization is not highly satisfied, then a complex attribute can be created in a way that it gives less importance to it (overall quality will be less affected by this unsatisfaction), and more importance to Watersaving and water utilization, Material-saving and material utilization and Landsaving and outdoor environment. But if Energy efficient and energy utilization is highly satisfied, then the importance will be brought back to itself (so the overall quality will be more affected by Energy efficient and energy utilization attribute), and importance of other attributes is reduced. Logical expression of such complex attribute is given in (8). ϕ (a,b,c,d) = b (Cb a c d) (8) Generalised pseudo-boolean polynomial [1] of this logical expression is given in (9). ϕ (a,b,c,d) = b + [(1 - b) a c d] ϕ (a,b,c,d) = b + a c d - a b c d (9) Weight of this complex attribute will be taken from the single attribute Energy efficient and energy utilization. w b ( b a c d) = 0,25 w b = 0, = 0.25 After both modifications of the model shown in chapter 4, instead of second phase operator from [2], the new operator of Logical Aggregation [3] is given in (10). Agg (a,b,c,d) = a b c f + 3 (d + e - d e) + (b + a c d - a 20 b c d) (10) On the arithmetic level, the input parameters matrix R from [2] will be processed through operator given in (10).

7 26 M. Mrkalj Agg (a,b,c,d) : R B * or B min R = L NM 0, ,285 0, ,11 0,215 0,675 0,2025 0,2925 0,505 0,22 0,285 0,495 0,265 0,265 0,47 0,17 0,285 0,545 If generalised product is dot product ( := *): O QP B * = [0, , ,641322] If generalised product is min function ( := min): B min = [0, ,269 0,594625] Final performance index T from [2] is calculated as a product of vector [1 2 3] with transposed vector B, and it is also valid for our modified model. It is shown in (11). T = [1 2 3] * B T (transposed) (11) 0, T = 1 2 T 3 * B = * 0, = 2,6796 M P * 0, T T = * B min = * 0,269 = 2,4971 0, L M NM L NM 0, Depending on performance index, the building belongs to one of the three categories (one, two or three stars) [2]. O P QP O QP T [1,0 1,7] T [1,7 2,4] T [2,4 3,0] - one star building - two stars building - three stars building. When modified model presented in chapter 4 of this paper is applied, the building from the example given in [2] stays in the interval T [2,4 3,0], which implies that it belongs to the category of three stars building.

8 Demonstrative Implications of a New Logical Aggregation Paradigm 27 5 Conclusion Models for performance evaluation of Green buildings enable good quality and objective evaluation, minimizing the subjectivity bias. Experts in the subject area contributed as the weight coefficients providers, while the final result (performance index) is achieved through processing on arithmetic level, through the fixed mathematic model. Conventional tools for aggregation are often inadequate due to limitations in the sense of disability of using logical interactions between quality attributes. Improvements of the model s articulation abilities by using advanced techniques of Logical Aggregation significantly expand the possibilities of customization of the model to more specific needs. This is especially noticeable in the ability to include complex logical functions in which nontrivial attributes emerge. New paradigm treats logical functions partial aggregation demands as a generalised Boolean polynomial, which processes values from the unitary real interval [0, 1]. Aggregation in general is a generalised pseudo-logical function. Comparative review of the results of modified improved model presented in this paper, and existing fuzzy model [2] is shown, and the advanced abilities of the new approach to aggregation of quality parameters and performance of Green buildings are demonstrated. References 1. Mirković, M., Hodolič, J., Radojević, D.: Aggregation for Quality Management. Yugoslav Journal of Operations Research 16(2), (2006) 2. Sun, J., Wu, Y., Hao, Y., Dai, Z.: Fuzzy Comprehensive Evaluation Model and Influence Factors Analysis on Comprehensive Performance of Green Buildings. In: ICEBO 2006, Shenzhen, vol. VIII-4-2. China Renewable Energy Resources and a Greener Future (2006) 3. Radojević, D.: Logical Aggregation Based on Interpolative Realization of Boolean Algebra. In: Eusflat Conf., vol. (1), pp (2007) 4. Radojevic, D.: Fuzzy Set Theory in Boolean Frame. Int. J. of Computers, Communications & Control III (2008) 5. Radojevic, D.: New [0,1]-valued logic: A natural generalization of Boolean logic. Yugoslav Journal of Operational Research - YUJOR 10(2) (2000) 6. Radojevic, D.: Logical Aggregation Based on Interpolative Boolean Algebra. Mathware & Soft Computing 15 (2008) 7. Radojević, D.: Interpolative relations and interpolative preference structures. Yugo-slav Journal of Operational Research YUJOR 15(2) (2005)

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011 Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the

More information

CHAPTER 3 BOOLEAN ALGEBRA

CHAPTER 3 BOOLEAN ALGEBRA CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus

More information

Karnaugh Maps Objectives

Karnaugh Maps Objectives Karnaugh Maps Objectives For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Obtain minimum Sum of Products and Product of Sums Understand the relationship between

More information

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York

More information

Compenzational Vagueness

Compenzational Vagueness Compenzational Vagueness Milan Mareš Institute of information Theory and Automation Academy of Sciences of the Czech Republic P. O. Box 18, 182 08 Praha 8, Czech Republic mares@utia.cas.cz Abstract Some

More information

Unit 3 Session - 9 Data-Processing Circuits

Unit 3 Session - 9 Data-Processing Circuits Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction

More information

Suppose we needed four batches of formaldehyde, and coulddoonly4runsperbatch. Thisisthena2 4 factorial in 2 2 blocks.

Suppose we needed four batches of formaldehyde, and coulddoonly4runsperbatch. Thisisthena2 4 factorial in 2 2 blocks. 58 2. 2 factorials in 2 blocks Suppose we needed four batches of formaldehyde, and coulddoonly4runsperbatch. Thisisthena2 4 factorial in 2 2 blocks. Some more algebra: If two effects are confounded with

More information

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits Computer Organization I Lecture 13: Design of Combinational Logic Circuits Overview The optimization of multiple-level circuits Mapping Technology Verification Objectives To know how to optimize the multiple-level

More information

Optimizations and Tradeoffs. Combinational Logic Optimization

Optimizations and Tradeoffs. Combinational Logic Optimization Optimizations and Tradeoffs Combinational Logic Optimization Optimization & Tradeoffs Up to this point, we haven t really considered how to optimize our designs. Optimization is the process of transforming

More information

CHAPTER 5 KARNAUGH MAPS

CHAPTER 5 KARNAUGH MAPS CHAPTER 5 1/36 KARNAUGH MAPS This chapter in the book includes: Objectives Study Guide 5.1 Minimum Forms of Switching Functions 5.2 Two- and Three-Variable Karnaugh Maps 5.3 Four-Variable Karnaugh Maps

More information

19. Blocking & confounding

19. Blocking & confounding 146 19. Blocking & confounding Importance of blocking to control nuisance factors - day of week, batch of raw material, etc. Complete Blocks. This is the easy case. Suppose we run a 2 2 factorial experiment,

More information

Design theory for relational databases

Design theory for relational databases Design theory for relational databases 1. Consider a relation with schema R(A,B,C,D) and FD s AB C, C D and D A. a. What are all the nontrivial FD s that follow from the given FD s? You should restrict

More information

UNIT 5 KARNAUGH MAPS Spring 2011

UNIT 5 KARNAUGH MAPS Spring 2011 UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable

More information

Introducing Interpolative Boolean algebra into Intuitionistic

Introducing Interpolative Boolean algebra into Intuitionistic 16th World Congress of the International Fuzzy Systems ssociation (IFS) 9th Conference of the European Society for Fuzzy Logic and Technology (EUSFLT) Introducing Interpolative oolean algebra into Intuitionistic

More information

UNIT 3 BOOLEAN ALGEBRA (CONT D)

UNIT 3 BOOLEAN ALGEBRA (CONT D) UNIT 3 BOOLEAN ALGEBRA (CONT D) Spring 2011 Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic

More information

Fractional Factorial Designs

Fractional Factorial Designs Fractional Factorial Designs ST 516 Each replicate of a 2 k design requires 2 k runs. E.g. 64 runs for k = 6, or 1024 runs for k = 10. When this is infeasible, we use a fraction of the runs. As a result,

More information

The hypergeometric distribution - theoretical basic for the deviation between replicates in one germination test?

The hypergeometric distribution - theoretical basic for the deviation between replicates in one germination test? Doubt is the beginning, not the end, of wisdom. ANONYMOUS The hypergeometric distribution - theoretical basic for the deviation between replicates in one germination test? Winfried Jackisch 7 th ISTA Seminar

More information

Reduction of Logic Equations using Karnaugh Maps

Reduction of Logic Equations using Karnaugh Maps Reduction of Logic Equations using Karnaugh Maps The design of the voting machine resulted in a final logic equation that was: z = (a*c) + (a*c) + (a*b) + (a*b*c) However, a simple examination of this

More information

2 k, 2 k r and 2 k-p Factorial Designs

2 k, 2 k r and 2 k-p Factorial Designs 2 k, 2 k r and 2 k-p Factorial Designs 1 Types of Experimental Designs! Full Factorial Design: " Uses all possible combinations of all levels of all factors. n=3*2*2=12 Too costly! 2 Types of Experimental

More information

Geometry Problem Solving Drill 08: Congruent Triangles

Geometry Problem Solving Drill 08: Congruent Triangles Geometry Problem Solving Drill 08: Congruent Triangles Question No. 1 of 10 Question 1. The following triangles are congruent. What is the value of x? Question #01 (A) 13.33 (B) 10 (C) 31 (D) 18 You set

More information

COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 1 of 12

COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 1 of 12 COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 1 of 12 Karnaugh Maps In this lecture, we will discuss Karnaugh maps (K-maps) more formally than last time and discuss a more

More information

Automated Geometry Theorem Proving: Readability vs. Efficiency

Automated Geometry Theorem Proving: Readability vs. Efficiency Automated Geometry Theorem Proving: Readability vs. Efficiency Predrag Janičić URL: www.matf.bg.ac.rs/ janicic Faculty of Mathematics, University of Belgrade, Serbia CADGME; Convergence on Mathematics

More information

An Absorbing Markov Chain Model for Problem-Solving

An Absorbing Markov Chain Model for Problem-Solving American Journal of Applied Mathematics and Statistics, 2016, Vol. 4, No. 6, 173-177 Available online at http://pubs.sciepub.com/ajams/4/6/2 Science and Education Publishing DOI:10.12691/ajams-4-6-2 An

More information

(Boolean Algebra, combinational circuits) (Binary Codes and -arithmetics)

(Boolean Algebra, combinational circuits) (Binary Codes and -arithmetics) Task 1. Exercises: Logical Design of Digital Systems Seite: 1 Self Study (Boolean Algebra, combinational circuits) 1.1 Minimize the function f 1 a ab ab by the help of Boolean algebra and give an implementation

More information

Karnaugh Map & Boolean Expression Simplification

Karnaugh Map & Boolean Expression Simplification Karnaugh Map & Boolean Expression Simplification Mapping a Standard POS Expression For a Standard POS expression, a 0 is placed in the cell corresponding to the product term (maxterm) present in the expression.

More information

Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MINI TERMS AND MAX TERMS

Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MINI TERMS AND MAX TERMS Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MINI TERMS AND MAX TERMS Lesson 4 BOOLEAN EXPRESSION, TRUTH TABLE and SUM OF THE PRODUCTS (SOPs) [MINITERMS] 2 Outline SOP two variables cases SOP for three variable

More information

CSE 140 Midterm I - Solution

CSE 140 Midterm I - Solution CSE 140 Midterm I - Solution 1. Answer the following questions given the logic circuit below. (15 points) a. (5 points) How many CMOS transistors does the given (unsimplified) circuit have. b. (6 points)

More information

CHAPTER III BOOLEAN ALGEBRA

CHAPTER III BOOLEAN ALGEBRA CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.

More information

MATH 300, Second Exam REVIEW SOLUTIONS. NOTE: You may use a calculator for this exam- You only need something that will perform basic arithmetic.

MATH 300, Second Exam REVIEW SOLUTIONS. NOTE: You may use a calculator for this exam- You only need something that will perform basic arithmetic. MATH 300, Second Exam REVIEW SOLUTIONS NOTE: You may use a calculator for this exam- You only need something that will perform basic arithmetic. [ ] [ ] 2 2. Let u = and v =, Let S be the parallelegram

More information

Intuitionistic Fuzzy Sets - An Alternative Look

Intuitionistic Fuzzy Sets - An Alternative Look Intuitionistic Fuzzy Sets - An Alternative Look Anna Pankowska and Maciej Wygralak Faculty of Mathematics and Computer Science Adam Mickiewicz University Umultowska 87, 61-614 Poznań, Poland e-mail: wygralak@math.amu.edu.pl

More information

Group Theory - QMII 2017

Group Theory - QMII 2017 Group Theory - QMII 017 Reminder Last time we said that a group element of a matrix lie group can be written as an exponent: U = e iαaxa, a = 1,..., N. We called X a the generators, we have N of them,

More information

ELC224C. Karnaugh Maps

ELC224C. Karnaugh Maps KARNAUGH MAPS Function Simplification Algebraic Simplification Half Adder Introduction to K-maps How to use K-maps Converting to Minterms Form Prime Implicants and Essential Prime Implicants Example on

More information

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The

More information

CHAPTER III BOOLEAN ALGEBRA

CHAPTER III BOOLEAN ALGEBRA CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.

More information

USE OF COMPUTER EXPERIMENTS TO STUDY THE QUALITATIVE BEHAVIOR OF SOLUTIONS OF SECOND ORDER NEUTRAL DIFFERENTIAL EQUATIONS

USE OF COMPUTER EXPERIMENTS TO STUDY THE QUALITATIVE BEHAVIOR OF SOLUTIONS OF SECOND ORDER NEUTRAL DIFFERENTIAL EQUATIONS USE OF COMPUTER EXPERIMENTS TO STUDY THE QUALITATIVE BEHAVIOR OF SOLUTIONS OF SECOND ORDER NEUTRAL DIFFERENTIAL EQUATIONS Seshadev Padhi, Manish Trivedi and Soubhik Chakraborty* Department of Applied Mathematics

More information

A Survey of Rational Diophantine Sextuples of Low Height

A Survey of Rational Diophantine Sextuples of Low Height A Survey of Rational Diophantine Sextuples of Low Height Philip E Gibbs philegibbs@gmail.com A rational Diophantine m-tuple is a set of m distinct positive rational numbers such that the product of any

More information

An Algebraic Identity of F.H. Jackson and its Implications for Partitions.

An Algebraic Identity of F.H. Jackson and its Implications for Partitions. An Algebraic Identity of F.H. Jackson and its Implications for Partitions. George E. Andrews ( and Richard Lewis (2 ( Department of Mathematics, 28 McAllister Building, Pennsylvania State University, Pennsylvania

More information

Systems I: Computer Organization and Architecture

Systems I: Computer Organization and Architecture Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept

More information

A Boolean Approach to Qualitative Comparison. A summary by Richard Warnes. Charles Ragin (1987) THE COMPARATIVE METHOD. Chapter 6

A Boolean Approach to Qualitative Comparison. A summary by Richard Warnes. Charles Ragin (1987) THE COMPARATIVE METHOD. Chapter 6 A Boolean Approach to Qualitative Comparison A summary by Richard Warnes Charles Ragin (1987) THE COMPARATIVE METHOD. Chapter 6 The key features of Boolean Algebra: 1. USE OF BINARY DATA "There are two

More information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 2 Boolean Algebra and Logic Gates Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan

More information

CSE 140: Components and Design Techniques for Digital Systems

CSE 140: Components and Design Techniques for Digital Systems Lecture 4: Four Input K-Maps CSE 4: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University of California, San Diego Outlines Boolean Algebra

More information

Lecture 7: Karnaugh Map, Don t Cares

Lecture 7: Karnaugh Map, Don t Cares EE210: Switching Systems Lecture 7: Karnaugh Map, Don t Cares Prof. YingLi Tian Feb. 28, 2019 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) 1

More information

Analysis of additive generators of fuzzy operations represented by rational functions

Analysis of additive generators of fuzzy operations represented by rational functions Journal of Physics: Conference Series PAPER OPEN ACCESS Analysis of additive generators of fuzzy operations represented by rational functions To cite this article: T M Ledeneva 018 J. Phys.: Conf. Ser.

More information

Lecture 4: Four Input K-Maps

Lecture 4: Four Input K-Maps Lecture 4: Four Input K-Maps CSE 4: Components and Design Techniques for Digital Systems Fall 24 CK Cheng Dept. of Computer Science and Engineering University of California, San Diego Outlines Boolean

More information

Fuzzy Function: Theoretical and Practical Point of View

Fuzzy Function: Theoretical and Practical Point of View EUSFLAT-LFA 2011 July 2011 Aix-les-Bains, France Fuzzy Function: Theoretical and Practical Point of View Irina Perfilieva, University of Ostrava, Inst. for Research and Applications of Fuzzy Modeling,

More information

Power Functions for. Process Behavior Charts

Power Functions for. Process Behavior Charts Power Functions for Process Behavior Charts Donald J. Wheeler and Rip Stauffer Every data set contains noise (random, meaningless variation). Some data sets contain signals (nonrandom, meaningful variation).

More information

Chapter 2. Digital Logic Basics

Chapter 2. Digital Logic Basics Chapter 2 Digital Logic Basics 1 2 Chapter 2 2 1 Implementation using NND gates: We can write the XOR logical expression B + B using double negation as B+ B = B+B = B B From this logical expression, we

More information

Created by T. Madas 2D VECTORS. Created by T. Madas

Created by T. Madas 2D VECTORS. Created by T. Madas 2D VECTORS Question 1 (**) Relative to a fixed origin O, the point A has coordinates ( 2, 3). The point B is such so that AB = 3i 7j, where i and j are mutually perpendicular unit vectors lying on the

More information

Lecture 3 Linear Algebra Background

Lecture 3 Linear Algebra Background Lecture 3 Linear Algebra Background Dan Sheldon September 17, 2012 Motivation Preview of next class: y (1) w 0 + w 1 x (1) 1 + w 2 x (1) 2 +... + w d x (1) d y (2) w 0 + w 1 x (2) 1 + w 2 x (2) 2 +...

More information

23. Fractional factorials - introduction

23. Fractional factorials - introduction 173 3. Fractional factorials - introduction Consider a 5 factorial. Even without replicates, there are 5 = 3 obs ns required to estimate the effects - 5 main effects, 10 two factor interactions, 10 three

More information

Simplification of Boolean Functions. Dept. of CSE, IEM, Kolkata

Simplification of Boolean Functions. Dept. of CSE, IEM, Kolkata Simplification of Boolean Functions Dept. of CSE, IEM, Kolkata 1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates,

More information

Chapter 3. Boolean Algebra. (continued)

Chapter 3. Boolean Algebra. (continued) Chapter 3. Boolean Algebra (continued) Algebraic structure consisting of: set of elements B binary operations {+, -} unary operation {'} Boolean Algebra such that the following axioms hold:. B contains

More information

MATH 251 MATH 251: Multivariate Calculus MATH 251 FALL 2005 EXAM-I FALL 2005 EXAM-I EXAMINATION COVER PAGE Professor Moseley

MATH 251 MATH 251: Multivariate Calculus MATH 251 FALL 2005 EXAM-I FALL 2005 EXAM-I EXAMINATION COVER PAGE Professor Moseley MATH 251 MATH 251: Multivariate Calculus MATH 251 FALL 2005 EXAM-I FALL 2005 EXAM-I EXAMINATION COVER PAGE Professor Moseley PRINT NAME ( ) Last Name, First Name MI (What you wish to be called) ID # EXAM

More information

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE Estd-1984 KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE 641 006 QUESTION BANK UNIT I PART A ISO 9001:2000 Certified 1. Convert (100001110.010) 2 to a decimal number. 2. Find the canonical SOP for the function

More information

Higher Unit 5b topic test

Higher Unit 5b topic test Name: Higher Unit 5b topic test Date: Time: 50 minutes Total marks available: 50 Total marks achieved: Questions Q1. Calculate the length of AB. Give your answer correct to 1 decimal place.... (Total for

More information

arxiv: v1 [math.ra] 22 Dec 2018

arxiv: v1 [math.ra] 22 Dec 2018 On generating of idempotent aggregation functions on finite lattices arxiv:1812.09529v1 [math.ra] 22 Dec 2018 Michal Botur a, Radomír Halaš a, Radko Mesiar a,b, Jozef Pócs a,c a Department of Algebra and

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part

More information

Common Cause Failures: Extended Alpha Factor method and its Implementation

Common Cause Failures: Extended Alpha Factor method and its Implementation Common Cause Failures: Extended Alpha Factor method and its Implementation Alexandra Sitdikova Reactor Engineering Division, Jožef Stefan Institute Jamova 39, SI-1000 Ljubljana, Slovenia Institute of Physics

More information

ECE 238L Boolean Algebra - Part I

ECE 238L Boolean Algebra - Part I ECE 238L Boolean Algebra - Part I August 29, 2008 Typeset by FoilTEX Understand basic Boolean Algebra Boolean Algebra Objectives Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand

More information

With Question/Answer Animations. Chapter 2

With Question/Answer Animations. Chapter 2 With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of

More information

Cell-based Model For GIS Generalization

Cell-based Model For GIS Generalization Cell-based Model For GIS Generalization Bo Li, Graeme G. Wilkinson & Souheil Khaddaj School of Computing & Information Systems Kingston University Penrhyn Road, Kingston upon Thames Surrey, KT1 2EE UK

More information

Chapter 11: Factorial Designs

Chapter 11: Factorial Designs Chapter : Factorial Designs. Two factor factorial designs ( levels factors ) This situation is similar to the randomized block design from the previous chapter. However, in addition to the effects within

More information

ALGORITHMS FOR COMPUTING QUARTIC GALOIS GROUPS OVER FIELDS OF CHARACTERISTIC 0

ALGORITHMS FOR COMPUTING QUARTIC GALOIS GROUPS OVER FIELDS OF CHARACTERISTIC 0 ALGORITHMS FOR COMPUTING QUARTIC GALOIS GROUPS OVER FIELDS OF CHARACTERISTIC 0 CHAD AWTREY, JAMES BEUERLE, AND MICHAEL KEENAN Abstract. Let f(x) beanirreducibledegreefourpolynomialdefinedover afieldf and

More information

Chapter. Algebra techniques. Syllabus Content A Basic Mathematics 10% Basic algebraic techniques and the solution of equations.

Chapter. Algebra techniques. Syllabus Content A Basic Mathematics 10% Basic algebraic techniques and the solution of equations. Chapter 2 Algebra techniques Syllabus Content A Basic Mathematics 10% Basic algebraic techniques and the solution of equations. Page 1 2.1 What is algebra? In order to extend the usefulness of mathematical

More information

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

UNIT 4 MINTERM AND MAXTERM EXPANSIONS UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and

More information

Multiplying Rational Numbers Examples

Multiplying Rational Numbers Examples Multiplying Rational Numbers Examples 1. To multiply rational numbers (fractions,) you multiply the numerators and multiply the denominators. 3 3 1 5 7 5 7 35 Multiplying Fractions This method can be generalized

More information

Introduction to Karnaugh Maps

Introduction to Karnaugh Maps Introduction to Karnaugh Maps Review So far, you (the students) have been introduced to truth tables, and how to derive a Boolean circuit from them. We will do an example. Consider the truth table for

More information

Official Solutions 2014 Sun Life Financial CMO Qualifying Rêpechage 1

Official Solutions 2014 Sun Life Financial CMO Qualifying Rêpechage 1 Official s 2014 Sun Life Financial CMO Qualifying Rêpechage 1 1. Let f : Z Z + be a function, and define h : Z Z Z + by h(x, y) = gcd(f(x), f(y)). If h(x, y) is a two-variable polynomial in x and y, prove

More information

PI = { a.b.c, ac d, b cd, ab d, bd} cd

PI = { a.b.c, ac d, b cd, ab d, bd} cd Digital Logic Design: Principles and Practices ELG5195 (EACJ5705 ), Carleton CRN: 18371 Assignment #1 Question 1: a) Using iterated consensus find all the prime implicants of the following function: F(

More information

DERIVATIONS An introduction to non associative algebra (or, Playing havoc with the product rule)

DERIVATIONS An introduction to non associative algebra (or, Playing havoc with the product rule) DERIVATIONS An introduction to non associative algebra (or, Playing havoc with the product rule) Series 2 Part 6 Universal enveloping associative triple systems Colloquium Fullerton College Bernard Russo

More information

Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE

Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE Today s Topics Boolean algebra applications in logic

More information

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science SOLUTIONS

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science SOLUTIONS EECS 150 Spring 27 University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science SOLUTIONS R. H. Katz Problem Set #2: Programmable Logic Assigned

More information

COMPLEXITY AND DECOMPOSABILITY OF RELATIONS ABSTRACT IS THERE A GENERAL DEFINITION OF STRUCTURE? WHAT DOES KNOWING STRUCTURAL COMPLEXITY GIVE YOU? OPEN QUESTIONS, CURRENT RESEARCH, WHERE LEADING Martin

More information

GOVERNMENT GIS BUILDING BASED ON THE THEORY OF INFORMATION ARCHITECTURE

GOVERNMENT GIS BUILDING BASED ON THE THEORY OF INFORMATION ARCHITECTURE GOVERNMENT GIS BUILDING BASED ON THE THEORY OF INFORMATION ARCHITECTURE Abstract SHI Lihong 1 LI Haiyong 1,2 LIU Jiping 1 LI Bin 1 1 Chinese Academy Surveying and Mapping, Beijing, China, 100039 2 Liaoning

More information

Midterm1 Review. Jan 24 Armita

Midterm1 Review. Jan 24 Armita Midterm1 Review Jan 24 Armita Outline Boolean Algebra Axioms closure, Identity elements, complements, commutativity, distributivity theorems Associativity, Duality, De Morgan, Consensus theorem Shannon

More information

A New Method About Using Polynomial Roots and Arithmetic-Geometric Mean Inequality to Solve Olympiad Problems

A New Method About Using Polynomial Roots and Arithmetic-Geometric Mean Inequality to Solve Olympiad Problems Polynomial Roots and Arithmetic-Geometric Mean Inequality 1 A New Method About Using Polynomial Roots and Arithmetic-Geometric Mean Inequality to Solve Olympiad Problems The purpose of this article is

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal

More information

Mathematical Reasoning & Proofs

Mathematical Reasoning & Proofs Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0

More information

4-2 Multiplying Matrices

4-2 Multiplying Matrices 4-2 Multiplying Matrices Warm Up Lesson Presentation Lesson Quiz 2 Warm Up State the dimensions of each matrix. 1. [3 1 4 6] 2. 3 2 1 4 Calculate. 3. 3( 4) + ( 2)(5) + 4(7) 4. ( 3)3 + 2(5) + ( 1)(12) 6

More information

Designing Oracles for Grover Algorithm

Designing Oracles for Grover Algorithm Designing Oracles for Grover Algorithm Homework 1. You have time until December 3 to return me this homework. 2. Please use PPT, Word or some word processor. You may send also PDF. The simulation should

More information

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18 University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total

More information

ST3232: Design and Analysis of Experiments

ST3232: Design and Analysis of Experiments Department of Statistics & Applied Probability 2:00-4:00 pm, Monday, April 8, 2013 Lecture 21: Fractional 2 p factorial designs The general principles A full 2 p factorial experiment might not be efficient

More information

T02 Tutorial Slides for Week 6

T02 Tutorial Slides for Week 6 T02 Tutorial Slides for Week 6 ENEL 353: Digital Circuits Fall 2017 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 17 October, 2017

More information

MULTIPLE PRODUCTS OBJECTIVES. If a i j,b j k,c i k, = + = + = + then a. ( b c) ) 8 ) 6 3) 4 5). If a = 3i j+ k and b 3i j k = = +, then a. ( a b) = ) 0 ) 3) 3 4) not defined { } 3. The scalar a. ( b c)

More information

Where are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples

Where are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples Operations on fuzzy sets (cont.) G. J. Klir, B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice-Hall, chapters -5 Where are we? Motivation Crisp and fuzzy sets alpha-cuts, support,

More information

Logic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1

Logic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1 Digital Logic COMP370 Introduction to Computer Architecture Logic Simplification It is frequently possible to simplify a logical expression. This makes it easier to understand and requires fewer gates

More information

PHIL 422 Advanced Logic Inductive Proof

PHIL 422 Advanced Logic Inductive Proof PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon

More information

Number System conversions

Number System conversions Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number

More information

DIGITAL ELECTRONICS & it0203 Semester 3

DIGITAL ELECTRONICS & it0203 Semester 3 DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides

More information

Mathematics Review. Sid Rudolph

Mathematics Review. Sid Rudolph Physics 2010 Sid Rudolph General Physics Mathematics Review These documents in mathematics are intended as a brief review of operations and methods. Early in this course, you should be totally familiar

More information

A Statistical Approach to the Study of Qualitative Behavior of Solutions of Second Order Neutral Differential Equations

A Statistical Approach to the Study of Qualitative Behavior of Solutions of Second Order Neutral Differential Equations Australian Journal of Basic and Applied Sciences, (4): 84-833, 007 ISSN 99-878 A Statistical Approach to the Study of Qualitative Behavior of Solutions of Second Order Neutral Differential Equations Seshadev

More information

Multilevel Logic Synthesis Algebraic Methods

Multilevel Logic Synthesis Algebraic Methods Multilevel Logic Synthesis Algebraic Methods Logic Circuits Design Seminars WS2010/2011, Lecture 6 Ing. Petr Fišer, Ph.D. Department of Digital Design Faculty of Information Technology Czech Technical

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active

More information

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html

More information

Gate-Level Minimization

Gate-Level Minimization Gate-Level Minimization Dr. Bassem A. Abdullah Computer and Systems Department Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah Outline 1. The Map Method 2. Four-variable

More information

Math 2030 Assignment 5 Solutions

Math 2030 Assignment 5 Solutions Math 030 Assignment 5 Solutions Question 1: Which of the following sets of vectors are linearly independent? If the set is linear dependent, find a linear dependence relation for the vectors (a) {(1, 0,

More information

Karnaugh Maps ف ر آ ا د : ا ا ب ا م آ ه ا ن ر ا

Karnaugh Maps ف ر آ ا د : ا ا ب ا م آ ه ا ن ر ا Karnaugh Maps مخطط آارنوف اعداد:محمد اسماعيل آلية علوم الحاسوب جامعة امدرمان الاهلية الاهداء الي آل من يسلك طريق العلم والمعرفة في هذا المجال Venn Diagrams Venn diagram to represent the space of minterms.

More information

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life... Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there

More information

Real-Orthogonal Projections as Quantum Pseudo-Logic

Real-Orthogonal Projections as Quantum Pseudo-Logic Real-Orthogonal Projections as Quantum Pseudo-Logic Marjan Matvejchuk 1 and Dominic Widdows 2 1 Kazan Technical University, ul Karl Marks 3, Kazan, 420008, Russia (e-mail Marjan.Matvejchuk@yandex.ru) 2

More information

Solving of logic functions systems using genetic algorithm

Solving of logic functions systems using genetic algorithm Solving of logic functions systems using genetic algorithm V G Kurbanov,2 and M V Burakov Chair of control system of Saint-Petersburg State University of Aerospace Instrumentation, Bolshaya Morskaya, 67,

More information