A Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem
|
|
- Edith Cook
- 6 years ago
- Views:
Transcription
1 P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : , Vol. 4, ssue 3( Versio 1), March 2014, pp RESEARCH ARTCLE OPEN ACCESS A Method for Solvig Balaced tuitioistic Fuzzy Assigmet Problem P. Sethil Kumar *, R. Jahir Hussai # * Research Scholar, # Associate Professor, PG ad Research Departmet of Mathematics, Jamal Mohamed College, Tiruchirappalli dia. Abstract this paper, we ivestigate a assigmet problem i which cost coefficiets are triagular ituitioistic fuzzy umbers. covetioal assigmet problem, cost is always certai. This paper develops a approach to solve a ituitioistic fuzzy assigmet problem where cost is ot determiistic umbers but imprecise oes. Here, the elemets of the costs (profits) matrix of the assigmet problem are triagular ituitioistic fuzzy umbers. The its triagular shaped membership ad o-membership fuctios are defied. A ew rakig procedure which ca be foud i [4] ad is used to compare the ituitioistic fuzzy umbers so that a tuitioistic Fuzzy Hugaria method may be applied to solve the ituitioistic fuzzy assigmet problem. Numerical examples show that a ituitioistic fuzzy rakig method offers a effective tool for hadlig a ituitioistic fuzzy assigmet problem. Keywords: tuitioistic Fuzzy Set, Triagular Fuzzy Number, Triagular tuitioistic Fuzzy Number, tuitioistic Fuzzy Assigmet Problem, Optimal Solutio.. troductio Assigmet Problem(AP) is used worldwide i solvig real world problems. A assigmet problem plays a importat role i a assigig of persos to jobs, or classes to rooms, operators to machies, drivers to trucks, trucks to routes, or problems to research teams, etc. The assigmet problem is a special type of liear programmig problem (LPP) i which our objective is to assig umber of jobs to umber of machies (persos) at a miimum cost. To fid solutio to assigmet problems, various algorithm such as liear programmig [8,9,13,17], Hugaria algorithm [15], eural etwork [12], geetic algorithm [6] have bee developed. However, i real life situatios, the parameters of assigmet problem are imprecise umbers istead of fixed real umbers because time/cost for doig a job by a facility (machie/persio) might vary due to differet reasos. The theory of fuzzy set itroduced by Zadeh[21] i 1965 has achieved successful applicatios i various fields. 1970, Belma ad Zadeh itroduce the cocepts of fuzzy set theory ito the decisiomakig problems ivolvig ucertaity ad imprecisio. Amit Kumar et al ivestigated Assigmet ad Travellig Salesma Problems with cost coefficiets as LR fuzzy parameters[1], Fuzzy liear programmig approach for solvig fuzzy trasportatio problems with trasshipmet[2], Method for solvig fully fuzzy assigmet problems usig triagular fuzzy umbers[3]. [18], Sathi Mukherjee et al preseted a Applicatio of fuzzy rakig method for solvig assigmet problems with fuzzy costs. Li ad We [16] proposed a efficiet algorithm based a labelig method for solvig the liear fractioal programmig case. Y.L.P.Thorai ad N.Ravi Sakar did Fuzzy assigmet problem with geeralized fuzzy umbers [19].Differet kids of fuzzy assigmet problems are solved i the papers [1, 3, 10, 11, 12, 20]. The cocept of tuitioistic Fuzzy Sets (FSs) proposed by Ataassov[5] i 1986 is foud to be highly useful to deal with vagueess. [14], Jahir Hussia et all preseted A Optimal More-for-Less Solutio of Mixed Costrais tuitioistic Fuzzy Trasportatio Problems. Here we ivestigate a more realistic problem, amely ituitioistic fuzzy assigmet problem. Let cij be the ituitioistic fuzzy cost of assigig the j th job to the i th machie. We assume that oe machie ca be assiged exactly oe job; also each machie ca do at most oe job. The problem is to fid a optimal assigmet so that the total ituitioistic fuzzy cost of performig all jobs is miimum or the total ituitioistic fuzzy profit is maximum. this paper, rakig procedure of Aie Varghese ad Suy Kuriakose [4] is used to compare the ituitioistic fuzzy umbers. Fially a tuitioistic Fuzzy Hugaria method may be applied to solve a FAP. This paper is orgaized as follows: Sectio 2 deals with some basic termiology ad rakig of triagular ituitioistic fuzzy umbers, sectio 3, provides ot oly the defiitio of ituitioistic fuzzy assigmet problem but also its mathematical formulatio ad Fudametal Theorems of a tuitioistic Fuzzy 897 P a g e
2 P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : , Vol. 4, ssue 3( Versio 1), March 2014, pp Assigmet Problem. Sectio 4 describes the solutio procedure of a ituitioistic fuzzy assigmet problem, sectio 5, to illustrate the proposed method a umerical example with results ad discussio is discussed ad followed by the coclusios are give i Sectio 6.. Prelimiaries Defiitio 2.1 Let A be a classical set, μ A (x) be a fuctio from A to [0,1]. A fuzzy set A with the membership fuctio μ A (x) is defied by A = x, μ A x ; x A ad μ A x 0,1. Defiitio 2.2 Let X be deote a uiverse of discourse, the a ituitioistic fuzzy set A i X is give by a set of ordered triples, A = {< x, μ A x, θ A x >; x X} Whereμ A, θ A : X [0,1], are fuctios such that 0 μ A x + θ A x 1, x X. For each x the membership μ A x ad θ A x represet the degree of membership ad the degree of o membership of the elemet x X to A X respectively. Defiitio 2.3 A fuzzy umber A is defied to be a triagular fuzzy umber if its membership fuctios μ A :R [0, 1] is equal to x a 1 if x [a a 2 a 1, a 2 ] 1 μ A x = a 3 x if x a a 3 a 2, a oterwise where a 1 a 2 a 3. This fuzzy umber is deoted by (a 1, a 2, a 3 ). Defiitio 2.4 A Triagular tuitioistic Fuzzy Number (A is a ituitioistic fuzzy set i R with the followig membership fuctio μ A x ad o membership fuctio θ A x : ) μ A x = 0 for x < a 1 x a 1 a 2 a 1 for a 1 x a 2 1 for x = a 2 a 3 x a 3 a 2 for a 2 x a 3 0 for x > a 3 θ A x = 1 for x < a 1 a 2 x a 2 a 1 for a 1 x a 2 0 for x = a 2 x a 2 a 3 a 2 for a 2 x a 3 1 for x > a 3 Where a 1 a 1 a 2 a 3 a 3 ad μ A x, θ A x 0.5 for μ A x = θ A x x R. This TrFN is deoted by A = a 1, a 2, a 3 ( a 1, a 2, a 3 ) Particular Cases Let A = a 1, a 2, a 3 ( a 1, a 2, a 3 ) be a TrFN. The the followig cases arise Case 1: f a 1 = a 1, a 3 = a 3, the A represet Trigular Fuzzy Number(TFN). t is deoted by A = a 1, a 2, a 3. Case 2: f a 1 = a 1 = a 2 = a 3 = a 3 = m, the A represet a real umber m. Defiitio 2.5 Let A ad B be two TrFNs. The rakig of A ad B by the (.) o E, the set of TrFNs is defied as follows: i. (A )> (B ) iff A B ii. (A )< (B ) iff A B iii. (A )= (B ) iff A B iv. (A + B )= (A )+ (B ) v. (A B ) = A (B ) Arithmetic Operatios 898 P a g e
3 P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : , Vol. 4, ssue 3( Versio 1), March 2014, pp Let A = (a 1, a 2, a 3 )( a 1, a 2, a 3 ) ad B = (b 1, b 2, b 3 )( b 1, b 2, b 3 )be ay two operatios as follows: Additio: A B = a 1 + b 1, a 2 + b 2, a 3 + b 3 (a 1 + b 1, a 2 + b 2, a 3 +b 3 ) Subtractio: A B = a 1 b 3, a 2 b 2, a 3 b 1 (a 1 b 3, a 2 b 2, a 3 b 1 ) TrFNs the the arithmetic Rakig of triagular ituitioistic fuzzy umbers The Rakig of a triagular ituitioistic fuzzy umber A = (a 1, a 2, a 3 )( a 1, a 2, a 3 ) is defied by [4] R A = 1 (a 3 a 1 ) a 2 2a 3 2a 1 + a 3 a 1 a 1 + a 2 + a 3 + 3(a 2 3 a 2 1 ) 3 a 3 a 1 + a 3 a 1 The rakig techique [4] is: f (A ) (B ), the A B i.e., mi {A, B } = A Example: Let A = 8,10,12 (6,10,14) ad B = 3,5,8 (1,5,10) be ay two TrFN, the its rak is defied by A = 10, (B ) = 5.33 this implies A B. tuitioistic Fuzzy Assigmet Problem Cosider the situatio of assigig machies to jobs ad each machie is capable of doig ay job at differet costs. Let cij be a ituitioistic fuzzy cost of assigig the j th job to the i th machie. Let x ij be the decisio variable deotig the assigmet of the machie i to the job j. The objective is to miimize the total ituitioistic fuzzy cost of assigig all the jobs to the available machies (oe machie per job) at the least total cost. This situatio is kow as balaced ituitioistic fuzzy assigmet problem. (FAP)Miimize Z = i=i j =1 cij x ij Subject to, x ij = 1, for i = 1,2,, j =1 m i=1 x ij = 1, for j = 1,2,, (1) x ij 0,1 cij = (c 1 ij, c 2 ij, c 3 1 ij )(c ij, c 2 3 ij, c ij ) Were x ij = 1, if the ith machie is assiged to j th job 0, if i th machie is ot assiged to j th job 3.1 Fudametal Theorems of a tuitioistic Fuzzy Assigmet Problem The solutio of a ituitioistic fuzzy assigmet problem is fudametally based o the followig two theorems. Theorem 1: a ituitioistic fuzzy assigmet problem, if we add or subtract a ituitioistic fuzzy umber to every elemet of ay row(or colum) of the ituitioistic fuzzy cost matrix [cij ], the a assigmet that miimizes the total ituitioistic fuzzy cost o oe matrix also miimizes the total ituitioistic fuzzy cost o the other matrix. other words if x ij = x ij miimizes, Z = cij i=i j =1 x ij with i=1 x ij = 1, j =1 x ij = 1, x ij = 0 or 1 the x ij also miimizes Z = i=i j =1 cij x ij, where cij = cij u i v j for all i,j=1,2, ad u i, v j are some real triagular ituitioistic ituitioistic fuzzy umbers. i=i j =1 cij x ij = i=i j =1(cij = j =1 cij Proof: Now, Z = u i v j )x ij i=i x ij i=i u i j =1 x ij i=i x ij j =1 v j = Z i=i u i j =1 v j Sice i=1 x ij = j =1 x ij = 1 This shows that the miimizatio of the ew objective fuctio Z yields the same solutio as the miimizatio of origial objective fuctio Z because i=i u i ad j =1 v j are idepedet of x ij 899 P a g e
4 P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : , Vol. 4, ssue 3( Versio 1), March 2014, pp Theorem 2: a ituitioistic fuzzy assigmet problem with cost [cij ], if all [cij ] 0 the a feasible solutio x ij which satisfies cij x ij = 0, is optimal for the problem. i=i j =1 Proof: Sice all [cij ] 0 ad all [x ij ] 0, The objective fuctio Z = i=i Z ca attai 0. Thus, ay feasible solutio [x ij ] that satisfies j =1 cij i=i x ij ca ot be egative. The miimum possible value that j =1 cij x ij = 0, will be a optimal. V. The Computatioal Procedure for tuitioistic Fuzzy Assigmet Problem. Step 1. the give ituitioistic fuzzy cost matrix, subtract the smallest elemet i each row from every elemet of that row by usig rakig procedure as metioed i sectio. Step 2. the reduced ituitioistic fuzzy cost matrix, subtract the smallest elemet i each colum from every elemet of that colum by usig rakig procedure as metioed i sectio. Step 3. Make the assigmet for the reduced ituitioistic fuzzy cost matrix obtaied from Step 2 i the followig way: i. Examie the rows successively util a row with exactly oe umarked ituitioistic fuzzy zero is foud. Eclose this ituitioistic fuzzy zero i a box ( ) as a assigmet will be made there ad cross ( ) all other ituitioistic fuzzy zeros appearig i the correspodig colum as they will ot be cosidered for further assigmet. Proceed i this way util all the rows have bee examied. ii. After examiig all the rows completely, examie the colums successively util a colum with exactly oe umarked ituitioistic fuzzy zero is foud. Make a assigmet to this sigle ituitioistic fuzzy zero by puttig a box ( ) ad cross out ( ) all other ituitioistic fuzzy zeros i the correspodig row. Proceed i this way util all colums have bee examied. iii. Repeat the operatio (i) ad (ii) util all the ituitioistic fuzzy zeros are either marked ( ) or crossed ( ). Step 4. f there is exactly oe assigmet i each row ad i each colum the the optimum assigmet policy for the give problem is obtaied. Otherwise go to Step-5. Step 5. Draw miimum umber of vertical ad horizotal lies ecessary to cover all the ituitioistic fuzzy zeros i the reduced ituitioistic fuzzy cost matrix obtaied from Step-3 by ispectio or by adoptig the followig procedure i. Mark ( ) all rows that do ot have assigmet ii. Mark ( ) all colums (ot already marked) which have ituitioistic fuzzy zeros i the marked rows iii. Mark ( ) all rows (ot already marked) that have assigmets i marked colums, iv. Repeat steps 5(ii) ad 5(iii) util o more rows or colums ca be marked. v. Draw straight lies through all umarked rows ad marked colums. Step 6. Select the smallest elemet amog all the ucovered elemets. Subtract this least elemet from all the ucovered elemets ad add it to the elemet which lies at the itersectio of ay two lies. Thus, we obtai the modified matrix. Go to Step 3 ad repeat the procedure. V. Numerical Examples: Example: Let us cosider a ituitioistic fuzzy assigmet problem with rows represetig 3 machies M 1, M 2, M 3 ad colums represetig the 3 jobs J 1, J 2, J 3. The cost matrix [c ] is give whose elemets are TrFN. The problem is to fid the optimal assigmet so that the total cost of job assigmet becomes miimum M 1 (7,21,29)(2,21,34) (7,20,57)(3,20,61) ( 12,25,56)(8,25,60) M 2 ( 8,9,16)(2,9,22) (4,12,35)(1,12,38) (6,14,28)(3,14,31) M 3 (5,9,22)(2,9,25) (10,15,20)(5,15,25) (4,16,19)(1,16,22) Solutio: The above ituitioistic fuzzy assigmet problem ca be formulated i the followig mathematical programmig form 900 P a g e
5 P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : , Vol. 4, ssue 3( Versio 1), March 2014, pp Mi[(7,21,29)(2,21,34)x 11 +(7,20,57)(3,20,61) x 12 +(12,25,56)(8,25,60) x 13 +(8,9,16)(2,9,22) x 21 +(4,12,35)(1,12,38) x 22 +(6,14,28)(3,14,31) x 23 +(5,9,22)(2,9,25) x 31 +(10,15,20)(5,15,25 ) x 32 +(4,16,19)(1,16,22) x 33 Subject to x 11 + x 12 + x 13 = 1, x 11 + x 21 + x 31 = 1, x 21 + x 22 + x 23 = 1, x 12 + x 22 + x 32 = 1, x 31 + x 32 + x 33 = 1, x 13 + x 23 + x 33 = 1, x ij 0,1. Now, usig the Step 1 of the ituitioistic fuzzy Hugaria assigmet method, we have the followig reduced ituitioistic fuzzy assigmet table. M 1 (-22,0,22)(-32,0,32) (-22,-1,50)(-31,-1,59) (-17,4,49)(-26,4,58) M 2 (-8,0,8)(-20,0,20) (-12,3,27)(-21,3,36) (-10,5,20)(-19,5,29) M 3 (-17,0,17)(-23,0,23) (-12,6, 15)(-20,6,23) (-18,7,14)(-24,7,20) Now, usig the Step 2 of the ituitioistic fuzzy Hugaria assigmet method, we have the followig reduced ituitioistic fuzzy assigmet table. M 1 (-22,0,22)(-32,0,32) (-37,-7,62)(-54,-7,79) (-31,-3,67)(-46,-3,82) M 2 (-8,0,8)(-20,0,20) (-27,-3,39)(-44,-3,56) (-24,-2,38)(-39,-2,53) M 3 (-17,0,17)(-23,0,23) (-27,0,27)(-43,0,43) (-32,0,32)(-44,0,44) Now, usig the Step 3 to the Step 6 of the ituitioistic fuzzy Hugaria assigmet method, we have the followig reduced ituitioistic fuzzy assigmet table. M 1 (-22,0,22)(-32,0,32) (-76,-4,89)(-110,-4,123) (-70,0,94)(-102,0,126) M 2 (-8,0,8)(-20,0,20) (-66,0,66)(-100,0,100) (-63,1,65)(-95,1,97) M 3 (-27,-3,39)(-44,-3,56) (-27,0,27)(-43,0,43) (-32,0,32)(-44,0,44) The optimal solutio is x 11 = x 22 = x 33 = 1, x 12 = x 13 = x 21 = x 23 = x 31 = x 32 = 0, With the optimal objective value Z = 49 which represets the optimal total cost. other words the optimal assigmet is M 1 J 1, M 2 J 2, M 3 J 3 The ituitioistic fuzzy miimum total cost is calculated as c11 + c22 + c33 = (7,21,29)(2,21,34) + 4,12,35 1,12,38 + (4,16,19)(1,16,22)= 15,49,83 4,49,94 Also we fid that Z = 15,49,83 4,49,94 = Rs. 49 the above example it has bee show that the total optimal cost obtaied by our method remais same as that obtaied by covertig the total ituitioistic fuzzy cost by applyig the rakig method [4]. 901 P a g e
6 P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : , Vol. 4, ssue 3( Versio 1), March 2014, pp Results ad discussio: The miimum total ituitioistic fuzzy assigmet cost is Z = (15, 49, 83) (4, 49, 94) (1) Figure1 Graphical Represetatio of FAC The result i (1) ca be explaied (Refer to figure1) as follows: (a) Assigmet cost lies i [15, 83]. (b) 100% expect are i favour that a assigmet cost is 49 as μ Z x = 1,x = 49. (c) Assumig that m is a membership value ad is a o-membership value at c. The 100m% experts are i favour ad 100% experts are opposig but m % are i cofusio that a assigmet cost is c. Values of μ Z c ad θ Z c at differet values of c ca be determied usig equatios give below. μ Z x = 0 for x < 15 x 15 for 15 x for x = x for 49 x for x > 83 θ Z x = 1 for x < 4 49 x 45 for 4 x 49 0 for x = 49 x for 49 x 94 1 for x > 94 V.Coclusio this paper, we discussed fidig a solutio of a assigmet problem i which cost coefficiets are triagular ituitioistic fuzzy umbers. The total optimal cost obtaied by our method remais same as that obtaied by covertig the total ituitioistic fuzzy cost by applyig the rakig method [4].Also the membership ad o-membership values of the ituitioistic fuzzy costs are derived. This techique ca also be used i solvig other types of problems like, project schedules, trasportatio problems ad etwork flow problems. Refereces [1] Amit Kumar ad Aila Gupta, Assigmet ad Travellig Salesma Problems with Coefficiets as LR Fuzzy Parameters, teratioal Joural of Applied Sciece ad Egieerig ,3: [2] Amit Kumar, Amarpreet Kaur, Aila Gupta, Fuzzy Liear Programmig Approach for Solvig Fuzzy Trasportatio probles with Trasshipmet, J Math Model Algor (2011) 10: [3] Amit Kumar, Aila Gupta ad Amarpreet Kumar,Method for Solvig Fully Fuzzy Assigmet Problems Usig Triagular Fuzzy Numbers, teratioal Joural of Computer ad formatio Egieerig 3: [4] Aie Varghese ad Suy Kuriakose, Notes o tuitioistic Fuzzy Sets Vol.18, 2012, No.1, [5] K.T.Ataassov, tuitioistic fuzzy sets, fuzzy sets ad systems, Vol.20, o.1.pp.87-96, [6] D.Avis, L.Devroye, A aalysis of a decompositio heuristic for the assigmet problem, Oper.Res.Lett., 3(6) (1985), P a g e
7 P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : , Vol. 4, ssue 3( Versio 1), March 2014, pp [7] R.Bellma, L.A.Zadeh, Decisio makig i a fuzzy eviromet, maagemet sci.17 (B)(1970) [8] M.L.Baliski, A Competitive (dual) simplex method for the assigmet problem, Math.Program,34(2) (1986), [9] R.S.Barr, F.Glover, D.Kligma, The alteratig basis algorithm for assigmet problems, Math.Program, 13(1) (1977), [10] M.S.Che, O a Fuzzy Assigmet Problem, Tamkag Joural 22(1985), [11] P.K.De ad Bharti Yadav, A Geeral Approach for Solvig Assigmet Problems volvig with Fuzzy Costs Coefficiets, Moder Applied Sciece Vol.6,No.3; March [12] S.P.Eberhardt, T.Duad, A.Kers, T.X.Brow, A.S.Thakoor, Competitive eural architecture for hardware solutio to the assigmet problem, Neural Networks, 4(4) (1991), [13] M.S.Hug, W.O.Rom, Solvig the assigmet problem by relaxatio, Oper.Res., 24(4) (1980), [14] R.Jahir Hussai, P.Sethil Kumar, A Optimal More-for-Less Solutio of Mixed Costrais tuitioistic Fuzzy Trasportatio Problems, t.j. Cotemp.Math.Scieces, Vol.8, 2013.o.12, doi /ijcms. [15] H.W.Kuh, The Hugaria method for the assigmet problem, Novel Research Logistic Quarterly, 2(1955) [16] Li Chi-Je, We Ue-Pyg, A Labelig Algorithm for the fuzzy assigmet problem, Fuzzy Sets ad Systems 142(2004), [17] L.F.McGiis, mplemetatio ad testig of a primal-dual algorithm for the assigmet problem, Oper.Res.,31(2) (1983), [18] Sathi Mukherjee ad Kajla Basu, Applicatio of Fuzzy Rakig Method for Solvig Assigmet Problems with Fuzzy Costs, t.jour.comp ad Appl. Mathematics, Vol 5 Number 3(2010), pp [19] Y.L.P.Thorai ad N.Ravi Sakar, Fuzzy Assigmet Problem with Geeralized Fuzzy Numbers, App. Math.Sci,Vol.7,2013,o.71, [20] X.Wag, Fuzzy Optimal Assigmet Problem. Fuzzy Math., 3(1987) [21] L.A. Zadeh, Fuzzy sets, formatio ad computatio, vol.8, pp , P a g e
Ones 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 informationSolving 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 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 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 informationFUZZY DIAGONAL OPTIMAL ALGORITHM TO SOLVE INTUITIONISTIC FUZZY ASSIGNMENT PROBLEMS
International Journal of Civil Engineering and Technology IJCIET Volume 9, Issue 11, November 2018, pp. 378 383, Article ID: IJCIET_09_11_037 Available online at http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=9&itype=10
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 informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
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-711103,
More informationAn Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem
Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem
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 informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
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 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 informationFuzzy Transportation Problem Using Triangular Membership Function-A New approach
Vol3 No.. PP 8- March 03 ISSN: 3 006X Trasportatio Proble Usig Triagular Mebership Fuctio-A New approach a S. Solaiappaa* K. Jeyaraab Departet of Matheatics Aa UiversityUiversity College of Egieerig Raaathapura
More informationMethod for Solving Unbalanced Transportation Problems Using Trapezoidal Fuzzy Numbers
Kadhirvel. K, Balauruga. K / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.ijera.co Vol., Issue 4, Jul-Aug 0, pp.59-596 Method for Solvig Ubalaced Trasportatio Probles Usig
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 informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
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 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 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 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 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 informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
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 information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
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 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 informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
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 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 informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
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 informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
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 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 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 informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
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 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 Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
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 informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationA General Approach for Solving Assignment Problems Involving with Fuzzy Cost Coefficients
www.seet.org/mas Moder Applied Siee Vol. 6, No. 3; Marh 202 A Geeral Approah for Solvig Assigmet Problems Ivolvig with Fuzzy ost oeffiiets P. K. De Departmet of Mathematis, Natioal Istitute of Tehology,
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 informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
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 informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
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 informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
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 informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationT. Leelavathy and K. Ganesan
Iteratioal Joural of Scietific & Egieerig Research, Volue 6, Issue 3, March-2015 252 A Optial Solutio of Fuzzy Trasportatio Proble T. Leelavathy ad K. Gaesa Abstract - I this paper, we preset a ethodology
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
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 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 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 informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationInternational Journal of Mathematics Trends and Technology (IJMTT) Volume 52 Number 9 December 2017
Iteratioal Joural of Mathematics Treds ad Techology (IJMTT) Volume 5 Number 9 December 7 Optimal Solutio of a Degeerate Trasportatio Problem Reea.G.patel, Dr.P.H.Bhathawala Assistat professor, Departmet
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 informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
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 informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
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 informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationHeuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)
Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
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 informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
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 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 informationIJESMR International Journal OF Engineering Sciences & Management Research
[Geetha, (10): October, 015] ISSN 39-6193 Impact Factor (PIF):.3 Iteratioal Joural OF Egieerig Scieces & Maagemet Research CONSTRUCTION OF DIOPHANTINE QUADRUPLES WITH PROPERTY D(A PERFECT SQUARE) V.Geetha
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
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 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 informationEigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1
Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
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 information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
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 informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
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 informationFuzzy Linear Regression Analysis
12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical
More informationEigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1
Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces
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 informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationCluster Analysis. Andrew Kusiak Intelligent Systems Laboratory
Cluster Aalysis Adrew Kusiak Itelliget Systems Laboratory 2139 Seamas Ceter The Uiversity of Iowa Iowa City, Iowa 52242-1527 adrew-kusiak@uiowa.edu http://www.icae.uiowa.edu/~akusiak Two geeric modes of
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
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 informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
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 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 informationSpeeding-up dynamic programming in sequence alignment
Departmet of Computer Sciece Aarhus Uiversity Demark Speedig-up dyamic programmig i sequece aligmet Master s Thesis Dug My Hoa - 443 December, Supervisor: Christia Nørgaard Storm Pederse Implemetatio code
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More information