Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
|
|
- Elinor Ray
- 6 years ago
- Views:
Transcription
1 Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah , W.B., Idia 1 Professor, Dept. of Mathematics, BESUS, Howrah , W.B. Idia 2 ABSTRACT : The purpose of this paper is to put forward the otio of fuzzy soft matrix theory ad some basic results. I this paper, we defie fuzzy soft matrices ad some ew defiitios based o t-orms with appropriate examples.lastly we have give a applicatio i decisio makig based o differet operators of t-orms. Key words: Soft sets, fuzzy soft matrices, operators of t-orms. I. INTRODUCTION Most of our traditioal tools for formal modelig, reasoig, ad computig are crisp, determiistic, ad precise i character. However, i real life, there are may complicated problems i egieerig, ecoomics, eviromet, social scieces medical scieces etc. that ivolve data which are ot all always crisp, precise ad determiistic i character because of various ucertaities typical problems. Such ucertaities are beig dealig with the help of the theories, like theory of probability, theory of fuzzy sets, theory of ituitioistic fuzzy sets, theory of iterval mathematics ad theory of rough sets etc. Molodtsov [1] also described the cocept of Soft Set Theory havig parameterizatio tools for dealig with ucertaities. Researchers o soft set theory have received much attetio i recet years. Maji ad Roy [3,4] first itroduced soft set ito decisio makig problems. Maji et al.[2] itroduced the cocept of fuzzy soft sets by combiig soft sets ad fuzzy sets. Cagma ad Egioglu [5] defied soft matrices which were a matrix represetatio of the soft sets ad costructed a soft max-mi decisio makig method. Cagma ad Egioglu [6] defied fuzzy soft matrices ad costructed a decisio makig problem. Borah et al.[7] exteded fuzzy soft matrix theory ad its applicatio. Maji ad Roy [8] preseted a ovel method of object from a imprecise multi-observer data to deal with decisio makig based o fuzzy soft sets. Majumdar ad Samata[9] geeralized the cocept of fuzzy soft sets. I this paper, we have itroduced some operators of fuzzy soft matrix o the basis of t-orms. We have also discussed their properties. Fially we have give a applicatio i decisio makig problem o the basis of t-orms operators. II. DEFINITION AND PRELIMINARIES 2.1 Soft set [1] Let U be a iitial uiverse, P(U) be the power set of U, E be the set of all parameters ad A E. A soft set (f A,E) o the uiverse U is defied by the set of order pairs (f A,E) = {(e, f A (e)) : e E, f A (e) P(U) } where f A : E P(U) such that f A (e) = φ if e A. Here f A is called a approximate fuctio of the soft set(f A, E). The set f A (e) is called e-approximate value set or e-approximate set which cosists of related objects of the parameter e E. Copyright to IJIRSET
2 Example 1 let U = { u 1, u 2, u 3, u 4 } be a set of four shirts ad E = { white( e 1 ), red (e 2 ),blue (e 3 ) } be a set of parameters. If A ={e 1, e 2 } E. Let f A (e 1 )= { u 1, u 2, u 3, u 4 } ad f A (e 2 )= { u 1, u 2, u 3 }, the we write the soft set (f A,E)= {(e 1,{ u 1, u 2, u 3, u 4 }), (e 2,{ u 1, u 2, u 3 })} over U which describe the colour of the shirts which Mr. X is goig to buy. 2.2 Fuzzy set [2 Let U be a iitial uiverse, E be the set of all parameters ad A E. A pair ( F, A ) is called a fuzzy set over U where F : A P(U) is a mappig from A ito P(U), where P(U) deotes the collectio of all subsets of U. Example 2. Cosider the example 1, here we ca ot express with oly two real umbers 0 ad 1, we ca characterized it by a membership fuctio istead of crisp umber 0 ad 1, which associate with each elemet a real umber i the iterval [0,1].The (f A,E) = { f A (e 1 ) = { ( u 1,.7),(u 2,.5),(u 3,.4),(u 4,.2) }, f A (e 2 ) = { (u 1,.5), (u 2,.1), (u 3,.5)} } is the fuzzy soft set represetig the colour of the shirts which Mr. X is goig to buy. 2.3 Fuzzy Soft Matrices (FSM) [5] Let (f A, E) be fuzzy soft set over U. The a subset of U x E is uiquely defied by R A = { ( u, e) : e A, u f A (e) }, which is called relatio form of (f A, E). The characteristic fuctio of R A is writte by µ RA : U x E [ 0, 1], where µ RA (u, e ) [ 0,1] is the membership value of u U for each e U. If µ 11 µ 12 µ 1 µ 21 µ 22 µ 2 µ ij = µ RA (u i,e j ), we ca defie a matrix [µ ij ] mx =, which is called a m x soft matrix µ m1 µ m2 µ m of the soft set (f A,E) over U. Therefore we ca say that a fuzzy soft set (f A,E) is uiquely characterized by the matrix [µ ij ] mx ad both cocepts are iterchageable. Example 3. Assume that U = { u 1, u 2, u 3, u 4, u 5, u 6 } is a uiversal set ad E = { e 1, e 2, e 3, e 4 } is a set of all parameters. If A E = { e 1, e 2, e 3 } ad f A (e 1 )= { (u 1,.3), (u 2,.4), (u 3,.6), (u 4,.1),( u 5,.6), (u 6,.5 }, f A (e 2 )= { (u 1,.2), (u 2,.5), (u 3,.7), (u 4,.3),( u 5,.7), (u 6,.1)}, f A (e 3 )= { (u 1,.5), (u 2,.2), (u 3,.5), (u 4,.6),( u 5,.7), (u 6,.3) } The the fuzzy soft set (f A,E) is a parameterized family { f A (e 1 ), f A (e 2 ), f A (e 3 )} of all fuzzy sets over U. Hece the fuzzy soft matrix [µ ij ] ca be writte as [µ ij ] = Zero Fuzzy Soft Matrix [6] Let [a ij ] FSM m X. The [a ij ] is called a Zero Fuzzy Soft Matrix deoted by [0], if a ij = 0 for all i ad j Uiversal Fuzzy Soft Matrix [6] Let [a ij ] FSM m X. The [a ij ] is called a Uiversal Fuzzy Soft Matrix deoted by [1], if a ij = 1 for all i ad j. Copyright to IJIRSET
3 2.6. Fuzzy Soft Sub Matrix [6] Let [a ij ], [b ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Sub Matrix of [b ij ] deoted by [a ij ] [b ij ] if a ij b ij for all i ad j Uio of Fuzzy Soft Matrices [6] Let [a ij ], [b ij ] FSM m X. The Uio of [a ij ] ad [b ij ], deoted by [a ij ] [b ij ] is defied as [a ij ] [b ij =max {a ij, b ij } for all i ad j Itersectio of Fuzzy Soft Matrices [6] Let [a ij ], [b ij ] FSM m X. The Itersectio of [a ij ] ad [b ij ], deoted by [a ij ] [b ij ] is defied as [a ij ] [b ij ] =mi {a ij, b ij } for all i ad j Complimet Fuzzy Soft Matrix [6] Let [a ij ] FSM m X. The Complemet of Fuzzy Soft Matrix [a ij ], deoted by [a ij ] 0 is defied as [a ij ] 0 = 1 a ij for all i ad j Fuzzy Soft Equal Matrices [6] Let [a ij ], [b ij ] FSM m X. The [a ij ] ad [b ij ] are said to be Fuzzy Soft Equal Matrices, deoted by [a ij ] =[b ij ] if a ij =b ij for all i ad j. Example 4. Let [a ij ], [b ij ] FSM 3 X4 where [a ij ] = [a ij ] [b ij ] = , [a ij ] [b ij ] = [a ij ] 0 = ad [b ij ] = The Propositio1. Let [a ij ] FSM m X. The i) [[a ij ] 0 ] 0 = [a ij ] iv) [a ij ] [a ij ] = [a ij ] ii) [a ij ] [a ij ] v) a ij ] [0] = [a ij ] iii) [a ij ] [a ij ] = [a ij ] vi) [a ij ] [0] = [0] Propositio2. Let [a ij ], [b ij ], [c ij ] FSM m X. The i) [a ij ] = [b ij ] ad [b ij ] = [c ij ] [a ij ] = [c ij ] ii) a ij ] [b ij ] ad [b ij ] [c ij ] [a ij ] = [c ij ] Propositio3. Let [a ij ], [b ij ] FSM m X. The De Morga s type results are true. i) ([a ij ] [b ij ]) 0 = [a ij ] 0 [b ij ] 0 ii) ([a ij ] [b ij ]) 0 = [a ij ] 0 [b ij ] 0 Proof: For all i ad j, i) ([a ij ] [b ij ]) 0 = [max { a ij, b ij }] 0 = [ 1 max { a ij, b ij } ] = [ mi { 1 a ij, 1 b ij } ] =[a ij ] 0 [b ij ] 0 Copyright to IJIRSET
4 ii) ([a ij ] [b ij ]) 0 = [mi { a ij, b ij }] 0 = [ 1 mi { a ij, b ij } ] = [ max { 1 a ij, 1 b ij } ] = [a ij ] 0 [b ij ] 0 Propositio4. Let [a ij ], [b ij ], [c ij ] FSM m X. The i) [a ij ] ( [b ij ] [c ij ] = ( [a ij ] [b ij ]) ( [a ij ] [c ij ]) ii) [a ij ] ( [b ij ] [c ij ] = ( [a ij ] [b ij ]) ( [a ij ] [c ij ]) Fuzzy Soft Rectagular Matrix [7] Let [a ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Rectagular Matrix if m Fuzzy Soft Square Matrix [7] Let [a ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Square Matrix if m = Fuzzy Soft Row Matrix [7] Let [a ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Row Matrix if m= Fuzzy Soft Colum Matrix [7] Let [a ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Colum Matrix if = Fuzzy Soft Diagoal Matrix [7] Let [a ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Diagoal Matrix if m = ad a ij = 0 for all i j Fuzzy Soft Upper Triagular Matrix [7] Let [a ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Upper Triagular Matrix if m = ad a ij = 0 for all i> j Fuzzy Soft Lower Triagular Matrix [7] Let [a ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Lower Triagular Matrix if m = ad a ij = 0 for all i< j Fuzzy Soft Triagular Matrix [7] Let [a ij ] FSM m X. The [a ij ] is said to be a Fuzzy Soft Triagular Matrix if it is either fuzzy soft lower or fuzzy soft upper triagular matrix for all i ad j t-norm [10]: Let T : [0,1] x [0,1] be a fuctio satisfyig the followig axioms: i) T( a, 1 ) = a, a [0,1] (Idetity) ii) T(a, b) = T(b,a), a,b [0,1] iii) if b 1 b 2, the T( a, b 1 ) T( a, b 2 ), a, b 1, b 2 [0,1] iv) T ( a, T( b, c) ) = T(T (a, b), c), a,b,c [0,1] (Commutativity) (Mootoicity) (Associativity) Copyright to IJIRSET
5 The T is called t-orm. A t-orm is said to be cotiuous if T is cotiuous fuctio i [0,1]. A example of cotiuous t- Norm is a b. N.B : The fuctios used for itersectio of fuzzy sets are called t-orms t- Coorm [10]: Let S : [0,1] x [0,1] be a fuctio satisfyig the followig axioms: i) S( a, 0 ) = a, a [0,1] ( Idetity ) ii) S(a, b) = S(b, a), a,b [0,1] ( Commutativity) iii) if b 1 b 2, the S( a, b 1 ) S( a, b 2 ), a, b 1, b 2 [0,1] ( Mootoicity ) iv) S ( a, S( b, c) ) = S(S (a,b), c) a,b, c [0,1] (Associativity) The S is called t- coorm. A t- coorm is said to be cotiuous if S is cotiuous fuctio i [0,1]. N.B. :The fuctios used for uio of fuzzy sets are called t-coorms. A example of cotiuous t- Coorm is a + b a.b Uio of Fuzzy Soft Matrices o t-orm: Let [a ij ], [b ij ] FSM m X.The Uio of Fuzzy Soft Matrices [a ij ] ad [b ij ] o t-orm is defied by [a ij ] [b ij ] = [a ij + b ij a ij. b ij ] for all i ad j Itersectio of Fuzzy Soft Matrices o t-orm: Let [a ij ], [b ij ] FSM m X.The Itersectio of Fuzzy Soft Matrices [a ij ] ad [b ij ] o t-orm is defied by [a ij ] [b ij ] = [a ij. b ij ] for all i ad j. Propositio5. Let [a ij ], [b ij ], [c ij ] FSM m X. The i) [a ij ] [0] = [a ij ] iii) [a ij ] [b ij ] = [b ij ] [a ij ] ii) [a ij ] [1] = [1] iv) ([a ij ] [b ij ] ) [c ij ] = [a ij ] ( [b ij ] [c ij ] ) Propositio6. Let [a ij ], [b ij ], [c ij ] FSM m X. The i) [a ij ] [0] = [a ij ] iii) [a ij ] [b ij ] = [b ij ] [a ij ] ii) [a ij ] [1] = [a ij ] iv) ([a ij ] [b ij ] ) [c ij ] = [a ij ] ( [b ij ] [c ij ] ) Propositio7. Let [a ij ], [b ij ] FSM m X. The De Morga s type results are true : i) ([a ij ] [b ij ]) 0 = [a ij ] 0 [b ij ] 0 ii) ([a ij ] [b ij ]) 0 = [a ij ] 0 [b ij ] 0 Copyright to IJIRSET
6 Proof: for all i ad j, i) ([a ij ] [b ij ]) 0 = [a ij + b ij a ij. b ij ] 0 = [ 1 (a ij + b ij a ij. b ij ) ] = [ 1 a ij b ij + a ij. b ij ) ] = [ (1 a ij ) (1 b ij ) = [ 1 a ij ] [1 b ij ] = [a ij ] 0 [b ij ] 0 ii) The proof of (ii) is exactly similar to (i) Scalar Multiplicatio of Fuzzy Soft Matrix : Let [a ij ] FSM m X. The Scalar Multiplicatio of Fuzzy Soft Matrix [a ij ] by a scalar k deoted by k [a ij ] is defied as k [a ij ] = [ ka ij ], 0 k 1. Propositio8. Let [a ij ] FSM m X ad s ad t are two scalars such that 0 s, t 1. The i) s(t[a ij ]) = (st)[a ij ] ii) s t s[a ij ] t[a ij ] iii) [a ij ] [b ij ] s[a ij ] s[b ij ] Three Importat Operators of t- Norm : i) Miimum Operator : T M ( µ 1 ) = mi ( µ 1 ) ii) Product Operator : T P ( µ 1 ) = i=1 µ i iii) Operator Lukasiewicz t-orm ( Bouded t-orm) : T L ( µ 1 ) = max ( i=1 µ i + 1, 0 ) Propositio9. Let [a ij ], [b ij ], [c ij ] FSM m X. The i) [a ij ] TM [0] = [a ij ] ii) [a ij ] TM [1] = [a ij ] iii)[a ij ] TM [b ij ] = [b ij ] TM [a ij ] iv) ([a ij ] TM [b ij ] ) TM [c ij ] = [a ij ] TM ( [b ij ] TM [c ij ] ) Propositio10. Let [a ij ], [b ij ], [c ij ] FSM m X. The i) [a ij ] TP [0] = [0] ii) [a ij ] TP [1] = [a ij ] iii) [a ij ] TP [b ij ] = [b ij ] TP [a ij ] iv) ([a ij ] TP [b ij ] ) TP [c ij ] = [a ij ] TP ( [b ij ] TP [c ij ] ) Propositio11. Let [a ij ], [b ij ], [c ij ] FSM m X. The i) [a ij ] TL [0] = [0] ii) [a ij ] TL [1] = [a ij ] iii) [a ij ] TL [b ij ] = [b ij ] TL [a ij ] iv) ([a ij ] TL [b ij ] ) TL [c ij ] = [a ij ] TL ( [b ij ] TL [c ij ] ) Three Importat Operators of t-coorm : i) S M {µ 1 } = max { µ 1 } Copyright to IJIRSET
7 ii) S P { µ 1 } = 1 i=1 ( 1 µ i ) iii) S L { µ 1 } = mi { µ i i=1, 1 } Propositio12. Let [a ij ], [b ij ] FSM m X. The i) [a ij ] SM [0] = [a ij ] ii) [a ij ] SM [1] = [1] iii) [a ij ] SM [b ij ] = [b ij ] SM [a ij ] iv) ([a ij ] SM [b ij ] ) SM [c ij ] = [a ij ] SM ( [b ij ] SM [c ij ] ) Propositio13. Let [a ij ], [b ij ] FSM m X. The i) [a ij ] SP [0] = [a ij ] ii) [a ij ] SP [1] = [1] iii) [a ij ] SP [b ij ] = [b ij ] SP [a ij ] iv) ([a ij ] SP [b ij ] ) SP [c ij ] = [a ij ] SP ( [b ij ] SP [c ij ] ) Propositio14. Let [a ij ], [b ij ] FSM m X. The i) [a ij ] SL [0] = [a ij ] ii) [a ij ] SL [1] = [1] iii) [a ij ] SL [b ij ] = [b ij ] SL [a ij ] iv) ([a ij ] SL [b ij ] ) SL [c ij ] = [a ij ] SL ( [b ij ] SL [c ij ] ) Example 5. From the above Example 4, [a ij ], [b ij ] FSM 3 X4 where [a ij ] = T P ( [a ij ], [b ij ] ) = ad [b ij ] = The T M ( [a ij ], [b ij ] ) = ad T L ( [a ij ], [b ij ] ) = , Arithmetic Mea (A.M.) of Fuzzy Soft Matrix : Let A = [a ij ] FSM m X. The Arithmetic Mea of Fuzzy Soft Matrix of membership value deoted by A AM is defied as A AM = A j =1 μ ij. III. FUZZY SOFT MATRICES IN DECISION MAKING BASED ON T NORM OPERATORS I this sectio, we put forward fuzzy soft matrices i decisio makig by usig differet operators of t- orm. Iput: Fuzzy soft set of m objects, each of which has parameters. Output: A optimum result. ALGORITHM Step- 1: Choose the set of parameters. Copyright to IJIRSET
8 Step -2: Costruct the fuzzy soft matrix for the set of parameters. Step -3: Compute T M. Step- 4: Compute the arithmetic mea of membership value of fuzzy soft matrix as A AM (T M ). Step-5: Fid the decisio with highest membership value. Example 6: Suppose a compay produces five types of water purifier p 1, p 2, p 3, p 4, p 5 such that U = { p 1, p 2, p 3, p 4, p 5 } ad E = { e 1 ( oly filter available ), e 2 (oly UV available), e 3 ( UV+ RO available ) } be the set of parameters. Suppose Mr. X is goig to buy a purifier. O the basis of the parameters, three experts Mr. A, Mr. B ad Mr. C give their valuable commets o the water purifier ad the followig fuzzy soft matrices are costructed as follows: A = The T M =, B = ad C = ad A AM (T M ) = From the above result (3.1),it is obvious that p 5 water purifier will be preferred (3.1) Note: If T P ad T L are used istead of T M,the we havet P = T L = ad A AM (T L ) = ad A AM (T P )= (3.3) (3.2) From the above results (3.2) ad (3.3), it is clear that p 1 water purifier ad p 3 water purifier will be selected respectively by Mr. X. IV. CONCLUSION I this paper, we proposed fuzzy soft matrices ad defied differet types of fuzzy soft matrices. We have also give some defiitios based o t-orm with examples ad some properties with proof. Some operators o t-orm are also Copyright to IJIRSET
9 give. Fially, we exted our approach o t-orms i applicatio of decisio makig problems. We have show that decisios are differet for differet methods o same applicatio. Our future work i this regard is to fid other methods whether the otios i this paper yield fruitful result. REFERENCES [1] D. Molodtsov, Soft set theory first result, Computers ad Mathematics with Applicatios 37(1999), pp [2] P. K. Maji, R. Biswas ad A. R. Roy, Fuzzy Soft Sets, Joural of Fuzzy Mathematics, 9(3), ( 2001), pp [3] P.K.Maji, R. Biswas ad A.R.Roy, A applicatio of soft sets i a decisio makig problems, Computer ad Mathematics with Applicatios, 44(2002), pp [4] P.K.Maji, R. Biswas ad A.R.Roy, Soft Set Theory, Computer ad Mathematics with Applicatios, 45(2003), pp [5] Naim Cagma, Serdar Egioglu, Soft matrix theory ad its decisio makig, Computers ad Mathematics with Applicatios 59(2010), pp [6] N. Cagma ad S. Egioglu, Fuzzy soft matrix theory ad its applicatio i decisio makig, Iraia Joural of Fuzzy Systems, 9(1), (2012), pp [7] Maas Jyoti Borah, Tridiv Jyoti Neog, Dusmata Kumar Sut, Fuzzy soft matrix theory ad its decisio makig, IJMER, 2(2) (2012), pp [8] P. K.Maji, A. R. Roy, A fuzzy soft set theoretic approach to decisio makig problems, Joural of Computatioal ad Applied Mathematics, 203(2007), pp [9] P. Majumdar, S.K.Samata, Geeralized fuzzy soft sets, Computers ad Mathematics with Applicatios, 59(2010), pp [10] James J. Buckley, Esfadiar Eslami, A Itroductio to Fuzzy Logic ad Fuzzy Sets, Physica-Verlag, Heidelberg,New York(2002). Copyright to IJIRSET
Solving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationCompactness of Fuzzy Sets
Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationEvaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps
Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More informationA Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem
P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : 2248-9622, Vol. 4, ssue 3( Versio 1), March 2014, pp.897-903 RESEARCH ARTCLE OPEN ACCESS A Method for Solvig Balaced tuitioistic
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationOn Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets
Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya
More informationNeutrosophic Linear Programming Problems
Neutrosophic Operatioal Research I Neutrosophic Liear Programmig Problems Abdel-Nasser Hussia Mai Mohamed Mohamed Abdel-Baset 3 Floreti Smaradache 4 Departmet of Iformatio System, Faculty of Computers
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationStrong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationA Note on Chromatic Transversal Weak Domination in Graphs
Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationPETRI NETS GENERATING KOLAM PATTERNS
. Lalitha et al / Idia Joural of omputer Sciece ad Egieerig (IJSE) PETRI NETS GENERATING KOLAM PATTERNS. Lalitha epartmet of Mathematics Sathyabama Uiversity, heai-119, Idia lalkrish_24@yahoo.co.i K. Ragaraja
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationFuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter
Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab
More informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationInterval-valued Fuzzy Soft Matrix Theory
Annals of Pure and Applied Mathematics Vol. 7, No. 2, 2014, 61-72 ISSN: 2279-087X (P, 2279-0888(online Published on 18 September 2014.researchmathsci.org Annals of Interval-valued Fuzzy Soft Matrix heory
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationTakashi Tsuboi Graduate School of Mathematical Sciences, the University of Tokyo, Japan
TOPOLOGY Takashi Tsuboi Graduate School of Mathematical Scieces, the Uiversity of Tokyo, Japa Keywords: eighborhood, ope sets, metric space, covergece, cotiuity, homeomorphism, homotopy type, compactess,
More informationAssignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters
Iteratioal Joural of Applied Sciece ad Egieerig., 3: 557 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Amit Kumar ad Aila Gupta * School of Mathematics ad Computer Applicatios,
More informationMatrix representation of a solution of a combinatorial problem of the group theory
Matrix represetatio of a solutio of a combiatorial problem of the group theory Krasimir Yordzhev, Lilyaa Totia Faculty of Mathematics ad Natural Scieces South-West Uiversity 66 Iva Mihailov Str, 2700 Blagoevgrad,
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationThe Adjacency Matrix and The nth Eigenvalue
Spectral Graph Theory Lecture 3 The Adjacecy Matrix ad The th Eigevalue Daiel A. Spielma September 5, 2012 3.1 About these otes These otes are ot ecessarily a accurate represetatio of what happeed i class.
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationApplication of Intuitionist Fuzzy Soft Matrices in Decision Making Problem by Using Medical Diagnosis
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn:2319-765x. Volume 10, Issue 3 Ver. VI (May-Jun. 2014), PP 37-43 Application of Intuitionist Fuzzy Soft Matrices in Decision Making Problem
More informationSome cycle and path related strongly -graphs
Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationMulti Attribute Decision Making Approach for Solving Intuitionistic Fuzzy Soft Matrix
Intern. J. Fuzzy Mathematical Archive Vol. 4 No. 2 2014 104-114 ISSN: 2320 3242 (P) 2320 3250 (online) Published on 22 July 2014 www.researchmathsci.org International Journal of Multi Attribute Decision
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationTHE COMPETITION NUMBERS OF JOHNSON GRAPHS
Discussioes Mathematicae Graph Theory 30 (2010 ) 449 459 THE COMPETITION NUMBERS OF JOHNSON GRAPHS Suh-Ryug Kim, Boram Park Departmet of Mathematics Educatio Seoul Natioal Uiversity, Seoul 151 742, Korea
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationDrug Addiction Effect in Medical Diagnosis by using Fuzzy Soft Matrices
International Journal of Current Engineering and Technology E-ISSN 77 4106, -ISSN 347 5161 015 INRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Drug Addiction
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationSOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION
Palestie Joural of Mathematics Vol. 607, 38 46 Palestie Polytechic Uiversity-PPU 07 SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION Chirag Garg ad R. K. Sharma Commuicated by Ayma Badawi MSC
More informationMatrix Partitions of Split Graphs
Matrix Partitios of Split Graphs Tomás Feder, Pavol Hell, Ore Shklarsky Abstract arxiv:1306.1967v2 [cs.dm] 20 Ju 2013 Matrix partitio problems geeralize a umber of atural graph partitio problems, ad have
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationA RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH
J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.
More informationSuper Vertex Magic and E-Super Vertex Magic. Total Labelling
Proceedigs of the Iteratioal Coferece o Applied Mathematics ad Theoretical Computer Sciece - 03 6 Super Vertex Magic ad E-Super Vertex Magic Total Labellig C.J. Deei ad D. Atoy Xavier Abstract--- For a
More informationThe golden search method: Question 1
1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationON SOLVING A MULTI-CRITERIA DECISION MAKING PROBLEM USING FUZZY SOFT SETS IN SPORTS
ISSN Print): 2320-5504 ISSN Online): 2347-4793 ON SOLVING A MULTI-CRITERIA DECISION MAKING PROBLEM USING FUZZY SOFT SETS IN SPORTS R. Sophia Porchelvi 1 and B. Snekaa 2* 1 Associate Professor, 2* Research
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More information5.3 Recursive definitions and structural induction
/8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca
More informationMining from Quantitative Data with Linguistic Minimum Supports and Confidences
Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.
More information4-Prime cordiality of some cycle related graphs
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 1, Issue 1 (Jue 017), pp. 30 40 Applicatios ad Applied Mathematics: A Iteratioal Joural (AAM) 4-Prime cordiality of some cycle related
More informationMapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System
Mappig Publishig ad Mappig Adaptatio i the Middleware of Railway Iformatio Grid ystem You Gamei, Liao Huamig, u Yuzhog Istitute of Computig Techology, Chiese Academy of cieces, Beijig 00080 gameiu@ict.ac.c
More informationName of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional
SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics
ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationRelational Interpretations of Neighborhood Operators and Rough Set Approximation Operators
Relatioal Iterpretatios of Neighborhood Operators ad Rough Set Approximatio Operators Y.Y. Yao Departmet of Computer Sciece, Lakehead Uiversity, Thuder Bay, Otario, Caada P7B 5E1, E-mail: yyao@flash.lakeheadu.ca
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationComputing Vertex PI, Omega and Sadhana Polynomials of F 12(2n+1) Fullerenes
Iraia Joural of Mathematical Chemistry, Vol. 1, No. 1, April 010, pp. 105 110 IJMC Computig Vertex PI, Omega ad Sadhaa Polyomials of F 1(+1) Fullerees MODJTABA GHORBANI Departmet of Mathematics, Faculty
More informationOn Characteristic Polynomial of Directed Divisor Graphs
Iter. J. Fuzzy Mathematical Archive Vol. 4, No., 04, 47-5 ISSN: 30 34 (P), 30 350 (olie) Published o April 04 www.researchmathsci.org Iteratioal Joural of V. Maimozhi a ad V. Kaladevi b a Departmet of
More informationInternational Journal of Pure and Applied Sciences and Technology
It J Pure App Sci Techo 6( (0 pp7-79 Iteratioa Joura of Pure ad Appied Scieces ad Techoogy ISS 9-607 Avaiabe oie at wwwijopaasati Research Paper Reatioship Amog the Compact Subspaces of Rea Lie ad their
More informationSome New Results on Prime Graphs
Ope Joural of Discrete Mathematics, 202, 2, 99-04 http://dxdoiorg/0426/ojdm202209 Published Olie July 202 (http://wwwscirporg/joural/ojdm) Some New Results o Prime Graphs Samir Vaidya, Udaya M Prajapati
More informationSolving a Decision Making Problem Using Weighted Fuzzy Soft Matrix
12 Solving a Decision Making Problem Using Weighted Fuzzy Soft Matrix S. Senthilkumar Department of Mathematics,.V.C. College (utonomous), Mayiladuthurai-609305 BSTRCT The purpose of this paper is to use
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationMAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS
Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete
More informationPrime Cordial Labeling on Graphs
World Academy of Sciece, Egieerig ad Techology Iteratioal Joural of Mathematical ad Computatioal Scieces Vol:7, No:5, 013 Prime Cordial Labelig o Graphs S. Babitha ad J. Baskar Babujee, Iteratioal Sciece
More information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationSome new results on recursive aggregation rules
Some ew results o recursive aggregatio rules Daiel Gómez Escuela de Estadística Uiversidad Complutese Madrid, 28040 Spai dagomez@estad.ucm.es Javier Motero Facultad de Matemáticas Uiversidad Complutese
More informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
More informationResearch Article Intuitionistic Fuzzy Time Series Forecasting Model Based on Intuitionistic Fuzzy Reasoning
Mathematical Problems i Egieerig Volume 2016, Article ID 5035160, 12 pages http://dx.doi.org/10.1155/2016/5035160 Research Article Ituitioistic Fuzzy Time Series Forecastig Model Based o Ituitioistic Fuzzy
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationSymmetric Class 0 subgraphs of complete graphs
DIMACS Techical Report 0-0 November 0 Symmetric Class 0 subgraphs of complete graphs Vi de Silva Departmet of Mathematics Pomoa College Claremot, CA, USA Chaig Verbec, Jr. Becer Friedma Istitute Booth
More informationNovel Encryption Schemes Based on Catalan Numbers
D. Sravaa Kumar, H. Sueetha, A. hadrasekhar / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Novel Ecryptio Schemes Based o atala Numbers 1 D. Sravaa Kumar H. Sueetha
More information