A General Approach for Solving Assignment Problems Involving with Fuzzy Cost Coefficients

Size: px
Start display at page:

Download "A General Approach for Solving Assignment Problems Involving with Fuzzy Cost Coefficients"

Transcription

1 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, Idia pusde@rediffmail.om Bharti Yadav Departmet of Mathematis, Krisha Istitute of Egieerig ad Tehology, Idia bharti406@rediffmail.om Reeived: Deember 6, 20 Aepted: Jauary 7, 202 Published: Marh, 202 doi:0.5539/mas.v63p2 URL: Abstrat Assigmet problem is oe of the most-studied, well kow ad importat problems i mathematial programmig. I this paper two differet type of assigmet problems are disussed: ovetioal ad fuzzy assigmet problem. I ovetioal assigmet problem, ost is always ertai. This paper develops a approah to solve the fuzzy assigmet problem where ost is ot determiisti umbers but impreise oes. Here, the elemets of the ost matri of the assigmet problem are triagular fuzzy umbers. Its triagular shaped membership futio is defied. The optimal solutio of fuzzy assigmet problem is obtaied suessfully by usig this approah. ompared with the result of ovetioal assigmet problem, the result obtaied by our approah is more advataged for deisio-makers. Fially, to show the effiiey of the proposed approah, the problem is demostrated by oe umerial eample. Keywords: Fuzzy sets, Fuzzy mathematial programmig, Assigmet problem, Triagular fuzzy umber. Itrodutio The assigmet problem (AP) is a speial type of liear programmig problem i whih our objetive is to assig a umber of jobs to a equal umber of persos, so as to miimize the total assigmet ost or to miimize the total osumed time for eeutio of all the jobs. However, muh of deisio-makig i the real world takes plae i a eviromet where the objetives, ostraits or parameters are ot preise. Therefore, a deisio is ofte made o the basis of vague iformatio or uertai data. I 970, Bellma ad Zadeh itrodued the oepts of fuzzy set theory ito the deisio-makig problems ivolvig uertaity ad impreisio. Fuzzy assigmet problems have reeived great attetio i reet years. Li ad We (2004) proposed a labelig algorithm for solvig fuzzy assigmet problems. Yaakob ad Watada (2009) proposed the fuzzy approah for solvig assigmet problem, i whih they preseted a worker s plaemet model apable of evaluatig worker s suitability for a speified task aordig their performae, soial ad metal fator. Yag ad Liu (2005) desiged a tabu searh algorithm based o fuzzy simulatio to ahieve a appropriate best solutio of fuzzy assigmet problem. he (985) proved some theorems ad proposed a fuzzy assigmet model whih did ot osider the differees of idividuals. Wag (987) solved a similar model by graph theory. Sakawa (200) dealt with atual problems o produtio ad work fore assigmet i a housig material maufaturer ad a subotrat firm ad formulated two kids of two level programmig problems. Applyig the iterative fuzzy programmig for two-level liear ad liear fratioal programmig problems, they desired satisfatory solutios to the problems ad therefore ompared the results. Liu ad Gao (2009) proposed a equilibrium optimizatio problem ad eteded the assigmet problem to the equilibrium multi-job assigmet problem, equilibrium multi-job quadrati assigmet problem ad used geeti algorithm to solve the proposed models. Majumdar ad Bhuia (2007) proposed a elitist geeti algorithm to solve the geeralized assigmet problem with impreise ost/time. Ye ad Xu (2008) proposed a effetive method o priority-based geeti algorithm to solve fuzzy vehile routig assigmet whe there is o geeti algorithm whih a give lear proedure of solvig it. The liear iterative ad disrete optimizatio [LINDO] 2 ISSN E-ISSN

2 Moder Applied Siee Vol. 6, No. 3; Marh 202 (984) geeral iterative optimizer [GINO] (986) ad TORA pakages (992) as well as may other ommerial ad aademi pakages are useful i fidig the solutio of the assigmet problems. I this paper, we are proposig a ew approah to fid the optimal solutio of fuzzy assigmet problems by represetig ost parameters as triagular fuzzy umbers. To illustrate the proposed approah a fuzzy assigmet problem is solved ad the obtaied results are disussed. This paper is orgaized as follows: I setio 2, some basi defiitios ad arithmeti operatios are reviewed. I setio 3, formulatio of fuzzy assigmet problem is desribed. I setio 4, a ew approah is proposed to fid the optimal solutio of fuzzy assigmet problem. Setio 5, presets a umerial eample to illustrate the proposed approah. The results are disussed i setio 6 ad setio 7 gives few oludig remarks o the proposed approah. 2. Fuzzy Prelimiaries The terms of epressio suh as very good, really good, ot bad ad rather lear are used very ofte i daily life, ommo that they are more or less taited with fuzziess. With differet daily deisio-makig problems of diverse itesity, the results a be misleadig if the fuzziess of huma deisio-makig is ot take ito aout. The theory of fuzzy set is based upo the ivestigatio reported by Bellma ad Zadeh (970), ivolves a mathematial desriptio of vague (ieat, fuzzy) elemets, with the vagueess of iformatio resultig ot from the stohasti harater of the system, but from the lak of uiqueess or seletivity that of. Aordigly, the aswer to the questio whether a elemet is assoiated with a fuzzy set will ot be i the form of a YES-OR-NO deisio but it will require arefully graded judgmet of its assoiatio. The degree of assoiatio of defied elemets is determied by a assoiatio futio that must ome withi the sope of partiular mathematial defiitios, aioms ad operatioal rules. Fuzzy set is a theory of graded oept, has a vague boudary set, as ompared to with risp set. This is also a powerful modelig laguage that a ope with a large fratio of uertaities of real life situatios. I this setio, some basi defiitios ad arithmeti operatios are reviewed. 2. Basi Defiitios Defiitio. A fuzzy set is a set whose boudary is ot lear, whose elemets are haraterized by a membership futio. Let X be a uiversal set. A fuzzy set A defie o X. A set of order pair of elemet whose first elemet X, seod elemet Α is the membership value of elemet i the set A. It is deoted by A or A, ad it defied by A, A X Where A K ad K [0, ] Defiitio 2. A fuzzy set A, defied o uiversal set of real umbers X, is said to be a fuzzy umber if (i) A is ove set i.e., 2 mi, 2,, 2 X, 0, ; A A A (ii) A is ormalized fuzzy set if there eists at least oe 0 X with ( 0) ; A (iii) it s membership futio ( ) is pieewise otiuous. A Defiitio 3. A fuzzy umber A, X is o-egative if ad oly if ( ) 0 for all 0. A A Defiitio 4. A fuzzy umber A ( a,b,) is said to be a triagular fuzzy umber, if its membership futio is give by A 0, a a l A, a b ba r A, b b 0, ad Where l A r A = left membership futio ad right membership futio of the fuzzy set A. Defiitio 5. A triagular fuzzy umber A ( a,b,) is said to be o-egative if ad oly if a 0. Defiitio 6. A triagular fuzzy umber A ( a,b,) is said to be zero triagular fuzzy umber if ad oly if a 0, b 0, 0. Published by aadia eter of Siee ad Eduatio 3

3 Moder Applied Siee Vol. 6, No. 3; Marh 202 Defiitio 7. Two triagular fuzzy umbers A ( a,a2,a3) ad B ( b, b2, b3 ) are said to be equal if ad oly if a b a b, a., b3 2.2 Arithmeti Operatios Let a, a2, a3 B as: A ad b, b, b 2 3 be two triagular fuzzy umbers, the arithmeti o them is defied Additio: A B a b, a2 b2, a3 b3 Subtratio: A ( ) B a b, a b a b 3 2 2, 3 ( a, a2, a3), if Salar multipliatio: A 0 Symmetri image: A - a3, a2,-a 3. Fuzzy Assigmet Problem We kow for every physial struture there is some mathematial pheomea ad for every mathematial pheomeo there may be or may ot be some physial struture. I this setio we will be desribig mathematial model of assigmet problems i the fuzzy eviromet. Assume that there are jobs ad persos. Jobs must be performed by persos, where the osts deped o the speifi assigmets. Eah job must be assiged to oe ad oly oe perso ad eah perso has to perform oe ad oly oe job. Let be the ost if the i th perso is assiged the j th job, the problem is to fid a assigmet (whih job should be assiged to whih perso) so that the total ost for performig all jobs is miimum. Here make a assumptio that j th job will be ompleted by i th perso, ad let 0 if if ith perso is assiged jth job ith perso is ot assiged jth job Where deotes that j th job is to be assiged to the i th perso. The, the mathematial model of assigmet problem i risp eviromet is: S: Mi i Z i j, j,2,..., j, i,2,..., () 0, for i, j,2,..., I above ovetioal assigmet problem, the variables, assigmet ost oeffiiets, are usually preise values. However, i real life situatios, the parameters of assigmet problem are impreise umbers beause time/ost for doig a job by a perso/mahie might vary due to differet reasos, suh as assigig me to offies, truks to delivery routes et. Espeially the assigmet ost, that whih is osidered as a ertai value is ot suitable, will be iflueed diretly by the above reasos. Therefore assigmet ost oeffiiets are usually uertai values ad will hage respetively i a frame. This paper osiders assigmet ost as a fuzzy umber deoted by ( / / ), i that represets the most possible assigmet ost, the most optimisti assigmet ost ad the most pessimisti assigmet ost. If ost oeffiiets are fuzzy umbers, the the total assigmet ost beomes fuzzy as well. Now the problem is how to ahieve a miimum total ost uder fuzzy ost. The, the ovetioal assigmet problem i () turs ito followig fuzzy assigmet problem. S2: Mi i j Z 4 ISSN E-ISSN

4 Moder Applied Siee Vol. 6, No. 3; Marh 202 i, j,2,..., j, i,2,..., (2) 0, for i, j,2,..., 4. Proposed Approah I this setio, a ew approah is proposed to fid the optimal solutio of fuzzy assigmet problems, ourrig i real life situatios, by represetig ost oeffiiets as triagular fuzzy umbers. The steps of proposed approah are as follows: 4. Mathematial Struture The fuzzy assigmet problem a be stated i the form of ost matri of real umbers as follows: 2 3 j N 2 3 j j 2 i i i 2 i 3 i is a o-egative triagular fuzzy umber. Where For the fuzzy assigmet problem, a triagular shaped membership futio for fuzzy ost oeffiiet is deoted by ad is defied as: 0, l l l, l m m l r (3) r, m r r m 0, r represet the left ad right had side of the triagular membership futio, Where l ad r N 2 3 j respetively. For fuzzy assigmet problem (S2), formulate the followig multi objetive liear programmig problem with fuzzy ost oeffiiets as: S3: Mi z ( ), z2( ),..., zk ( ) i, j,2,..., j, i,2,..., (4) 0, for i, j,2,..., Published by aadia eter of Siee ad Eduatio 5

5 Moder Applied Siee Vol. 6, No. 3; Marh 202 By osiderig the weightig fator, the multi objetive liear programmig problem is defied as: S4: w z ( ) w z ( )... w z ( ) Mi 2 2 k k k i.e. w z ( ) i m m m, j,2,..., j, i,2,..., (5) 0, for i, j,2,..., 4.2 Algorithm The algorithm for the solutio proedure of the proposed approah a be summarized i the followig steps: Step : Develop the fuzzy assigmet problem as desribed i (S2). Step 2: Write the elemets of the ost matri of the assigmet problem i the form of triagular fuzzy umbers. Step 3: Defie the triagular shaped membership futio of eah fuzzy ost oeffiiet as metioed i Eq. (3). Step 4: Formulate the multi objetive liear programmig problem with fuzzy ost oeffiiets for fuzzy assigmet problem (S3). Step 5: For differet weights develop problem (S4) to get a optimal solutio. Step 6: Fid the miimum total fuzzy ost by puttig the values of i i j. 5. Numerial Eample To illustrate the approah let us osider the followig 3 3 fuzzy assigmet problem. The osts are represeted by triagular fuzzy umbers ad are show i followig Table : where = (4.5,5,5.5), 2 =(8.,9,9.9), 3 =(2.7,3,3.3), 2 =(7.2,8,8.8), 22 =(6.3,7,7.7), 23 =(7.2,8,8.8) 3 =(5.4,6,6.6), 32 =(9,0,), 33 =(0.8,2,3.2) Fid the assigmet of persos to jobs that will miimize the total fuzzy ost. Solutio: The fuzzy optimal solutio of fuzzy assigmet problem by usig the proposed approah a be obtaied as follows: Step : The give fuzzy assigmet problem may be formulated i to the followig fuzzy liear programmig problem: Mi Z ((4.5,5, 5.5) (8., 9, 9.9) (2.7, 3, 3.3) (7.2,8,8.8) (6.3, 7, 7.7) (7.2,8,8.8) (5.4,6,6.6) (9,0,) (0.8,2,3.2) ) ,, i,2,3, j,2,3. Step 2: Usig step 3 to 5 of proposed approah, we trasform the fuzzy assigmet problem ito the followig multi-objetive liear programmig problem: (i dollars) 6 ISSN E-ISSN

6 Moder Applied Siee Vol. 6, No. 3; Marh 202 Miimize ( w w w ) , , 2 3, , , 0,, i,2,3, j,2,3. Solve the above problem for differet weights. For eample, w 0, w2, w3 Now above problem redues to Miimize , , , 2 3, , , 0,, i,2,3, j,2,3. The above problem is solved by usig the TORA pakage. The solutio is preseted as follows: 2 3, 22, 3, 2 2 Step 3: The fuzzy optimal total ost is alulated as: = (2.7, 3, 3.3) + (6.3, 7, 7.7) + (5.4, 6, 6.6) = (4.4, 6, 7.6) I other words the optimal assigmet is, 2 B, 3 A 6. Aalysis of the Results ad Disussios The obtaied result a be eplaied as follows: ) The total ost is greater tha 4.4 ad less tha 7.6 dollars. 2) Let T represets the total ost, the the peretage of the favouress for T is give by T T 00, where 0, T 4.4 T 4.4 TlT, 4.4 T 6.6 T T 7.6 T T rt, 6 T , T 7.6 Table 2 lists the solutio for above multi-objetive liear programmig problem for various weights ad it also shows that the solutios are idepedet of weights ( w m, m,2, 3 ) , 33 Published by aadia eter of Siee ad Eduatio 7

7 Moder Applied Siee Vol. 6, No. 3; Marh 202 Table 3 shows the total assigmet ost of the most possible, optimism ad pessimism value. So the fial result of fuzzy assigmet problem is show i Table 4. From Table 4 it a be see that total assigmet ost of ovetioal assigmet problem is just the most possible ost of fuzzy assigmet problem. The a olusio may be that the solutio of assigmet problem is oly a speial ase of fuzzy assigmet problem, ad that the paper osiders the assigmet ost as a fuzzy umber is more sigifiat ad atual. So the solutio obtaied by this approah is optimum. This shows the effiiey of our approah. 7. olusios I the proposed approah a assigmet problem with fuzzy ost oeffiiets has bee solved i order to defeat uertai eviromet i the real world situatio ad relevae to solve it. By the proposed approah fuzzy assigmet problem has bee trasformed ito multi-objetive liear programmig problem where the ost oeffiiets are fuzzy umbers ad also proved that the solutios are idepedet of weights. To illustrate the proposed approah a umerial eample is solved ad obtaied results are disussed. We have foud that i our omputatioal eperiee the results are as per epetatios ad satisfyig. The proposed approah has the followig features: ) This approah is easy to uderstad ad to apply for fidig the optimal solutio of fuzzy assigmet problem ourrig i real life situatio. 2) It is easy ad simple to use for the deisio maker ad a be easily implemeted to solve other type of problems like, trasportatio problems, projet shedules ad etwork flow problems. 3) This approah solves all types of assigmet problems, the miimum assigmet problem ad the maimum assigmet problem. 4) This approah proposes a effetive ad effiiet way for hadlig the fuzzy assigmet problem. 5) This approah solves the fuzzy assigmet problem without usig ay rakig futio. Referees Belma, R., & Zadeh, L. A. (970). Deisio makig i a fuzzy eviromet. Maagemet Siee, 7, he, M. S. (985). O a fuzzy assigmet problem. Tamkag J, 22, Liebma, J., Lasdo, L., Shrage, L., & Ware, A. (986). Modelig ad Optimizatio with GINO. The Sietifi Press, Palo Alto, A. Li,. J., & We, U. P. (2004). A labelig algorithm for the fuzzy assigmet problem. Fuzzy Sets ad Systems, 42, Liu, L., & Gao, X. (2009). Fuzzy weighted equilibrium multi-job assigmet problem ad geeti algorithm. Applied Mathematial Modellig, 33, Majumdar, J., & Bhuia, A. K. (2007). Elitist geeti algorithm for assigmet problem with impreise goal. Europea Joural of operatioal Researh, 77, Sakawa, M., Nishizaki, I., & Uemura, Y. (200). Iterative fuzzy programmig for two- level liear ad liear fratioal produtio ad assigmet problems: a ase study. Europea Joural of operatioal Researh, 35, Shrage, L. (984). Liear, iteger ad quadrati programmig with LINDO. The Sietifi Press. Palo Alto, A. Taha, H. A. (992). Operatios Researh, A Itrodutio, 5th ed. (Mamilla, New York). Wag, X. (987). Fuzzy optimal assigmet problem. Fuzzy math, 3, Yaakob, S. B., & Watada, J. (2009). Fuzzy approah for assigmet problem. IEEE, Yag, L., & Liu, B. (2005). A multi-objetive fuzzy assigmet problem: New model ad algorithm. IEEE Iteratioal oferee o Fuzzy Systems, Ye, X., & Xu, J. (2008). A fuzzy vehile routig assigmet model with oetio etwork based o priority-based geeti algorithm. World Joural of Modelig ad Simulatio, 4, Zimmerma, H. J. (99). Fuzzy Set Theory ad Its Appliatios, 2 d ed., Kluwer Aademi Publishers, Bosto/Dorgreht/Lodo. 8 ISSN E-ISSN

8 Moder Applied Siee Vol. 6, No. 3; Marh 202 Table. Fuzzy osts (I Dollars) Jobs A B Persos Table 2. The solutio for above multi-objetive liear programmig problem for various weights Sr o. w w 2 w 3 (, 2, 3, 2, 22, 23, 3, 32, 33) 0 (0,0,,0,,0,,0,0) (0,0,,0,,0,,0,0) 3 0 (0,0,,0,,0,,0,0) (0,0,,0,,0,,0,0) (0,0,,0,,0,,0,0) 6 0 (0,0,,0,,0,,0,0) (0,0,,0,,0,,0,0) (0,0,,0,,0,,0,0) (0,0,,0,,0,,0,0) 0..3 (0,0,,0,,0,,0,0) (0,0,,0,,0,,0,0) Table 3. The fial result of fuzzy assigmet problem Jobs A B (4.5,5,5.5) (8.,9,9.9) (2.7,3,3.3) Persos 2 (7.2,8,8.8) (6.3,7,7.7) (7.2,8,8.8) 3 (5.4,6,6.6) (9,0,) (0.8,2,3.2) Published by aadia eter of Siee ad Eduatio 9

9 Moder Applied Siee Vol. 6, No. 3; Marh 202 Table 4. Result of ovetioal assigmet problem A Jobs B Persos ISSN E-ISSN

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach

An 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 information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

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 information

Ones Assignment Method for Solving Traveling Salesman Problem

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 information

A Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem

A 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 information

Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters

Assignment 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 information

Algorithm Efficiency

Algorithm Efficiency Algorithm Effiiey Exeutig ime Compariso of algorithms to determie whih oe is better approah implemet algorithms & reord exeutio time Problems with this approah there are may tasks ruig ourretly o a omputer

More information

Fuzzy Hopfield neural network with fixed weight for medical image segmentation

Fuzzy Hopfield neural network with fixed weight for medical image segmentation Fuzzy Hopfield eural etwork with fixed weight for medial image segmetatio Chwe-Liag Chag Yu-Tai Chig, MEMBER SPIE Natioal Chiao Tug Uiversity Departmet of Computer ad Iformatio Siee Taiwa Abstrat. Image

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy 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 information

The isoperimetric problem on the hypercube

The 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 information

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

Optimum 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 information

Balanced Greedy Colorings of Sparse Random Graphs

Balanced Greedy Colorings of Sparse Random Graphs Balaed Greedy Colorigs of Sparse Radom Graphs Fredrik Mae Erik Boma Abstrat We ivestigate the omputatio of a olorig of the verties of a graph so that eah olor lass is lose to equal i size. For sparse radom

More information

A New Credibilistic Clustering Method with Mahalanobis Distance

A New Credibilistic Clustering Method with Mahalanobis Distance I.J. Mathematial Siees ad Computig, 2018, 4, 1-18 Published Olie November 2018 i MECS (http://www.mes-press.et) DOI: 10.5815/ijms.2018.04.01 Available olie at http://www.mes-press.et/ijms A New Credibilisti

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An 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 information

Image Segmentation EEE 508

Image 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 information

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment 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 information

A Study of New Fractals Complex Dynamics for Inverse and Logarithmic Functions

A Study of New Fractals Complex Dynamics for Inverse and Logarithmic Functions A Study of New Fratals Complex Dyamis for Iverse ad Logarithmi Futios Shashak Ligwal Dept. of Computer siee ad Egieerig G.B.Pat Egieerig College Ghurdauri, Pauri Ashish Negi Assoiate Professor Dept. of

More information

LU Decomposition Method

LU 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 information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A 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 information

condition w i B i S maximum u i

condition 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 information

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)

More information

RESEARCH ON MULTI-LEVEL LOG-BASED RELEVANCE FEEDBACK SCHEME FOR IMAGE RETRIEVAL

RESEARCH ON MULTI-LEVEL LOG-BASED RELEVANCE FEEDBACK SCHEME FOR IMAGE RETRIEVAL RESEARCH ON MULTI-LEVEL LOG-BASED RELEVANCE FEEDBACK SCHEME FOR IMAGE RETRIEVAL WEIFENG SUN, 2 JING LUO, 3 KAIXIAN HU, 4 CHUANG LIN Shool of Software of Dalia Uiversity of Tehology 6620 Dalia Liaoig, Chia

More information

Modified Decoding Algorithm of LLR-SPA

Modified Decoding Algorithm of LLR-SPA Sesors & Trasduers, Vol. 79, Issue 9, September 204, pp. 223-228 Sesors & Trasduers 204 by IFSA Publishig, S. L. http://www.sesorsportal.om Modified Deodig Algorithm of LLR-SPA Zhogxu Wag, Ya Wag, Tiatia

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy 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 information

Segmentation of Multi-Textured Images using Optimized Local Ternary Patterns

Segmentation of Multi-Textured Images using Optimized Local Ternary Patterns Iteratioal Joural of Computer Appliatios (0975 8887) Volume 95 No.16, Jue 2014 Segmetatio of Multi-Textured Images usig Optimized Loal Terary Patters G. Madasamy Raja Assoiate Professor, Departmet of Iformatio

More information

Fuzzy Clustering Using Hybrid Fuzzy c-means and Fuzzy Particle Swarm Optimization

Fuzzy Clustering Using Hybrid Fuzzy c-means and Fuzzy Particle Swarm Optimization Fuzzy Clusterig Usig Hybrid Fuzzy -eas ad Fuzzy Partile Swar Optiizatio Hesa Izakia Islai Azad Uiversity Rasar Brah Rasar, Ira hesa.izakia@gail.o Ajith Abraha Mahie Itelligee Researh Labs MIR Labs USA

More information

Python Programming: An Introduction to Computer Science

Python 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 information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL 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 information

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem

An 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 information

New Results on Energy of Graphs of Small Order

New 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 information

Effective Web personalization system using Modified Fuzzy Possibilistic C Means

Effective Web personalization system using Modified Fuzzy Possibilistic C Means Bofrig Iteratioal Joural of Software Egieerig ad Soft Computig, Vol., Speial Issue, Deember 0 Effetive Web persoalizatio system usig Modified Fuzzy Possibilisti C Meas A. Vaishavi Abstrat--- Due to the

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting 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 information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What 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 information

Designing a learning system

Designing a learning system CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please

More information

Computational Geometry

Computational 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 information

Ambiguity Resolution in GPS-based, Low-cost Attitude Determination

Ambiguity Resolution in GPS-based, Low-cost Attitude Determination Joural of Global Positioig Systems (5) Vol. 4, o. -: 7-4 Ambiguity Resolutio i GPS-based, Low-ost Attitude Determiatio Shegli Fa, Shool of Mathematial ad Geospatial Siees, RMI Uiversity, Vitoria, Australia

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms 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 information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory 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 information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 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 information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 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 information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A 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 information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On 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 information

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree

Sum-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 information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical 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 information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 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 information

A novel approach in ECG beat recognition using adaptive neural fuzzy filter

A novel approach in ECG beat recognition using adaptive neural fuzzy filter J. Biomedial Siee ad Egieerig, 009,, 80-85 A ovel approah i ECG beat reogitio usig adaptive eural fuzzy filter Glayol Nazari Golpayegai, Amir Homayou Jafari Biomedial Egieerig Departmet, Islami Azad Uiversity,

More information

Neutrosophic Linear Programming Problems

Neutrosophic 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 information

1.2 Binomial Coefficients and Subsets

1.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 information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The 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 information

International Journal of Mathematics Trends and Technology (IJMTT) Volume 52 Number 9 December 2017

International 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 information

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 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 information

A study on Interior Domination in Graphs

A 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 information

Similarity, Cardinality and Entropy for Bipolar Fuzzy Set in the Framework of Penta-valued Representation

Similarity, Cardinality and Entropy for Bipolar Fuzzy Set in the Framework of Penta-valued Representation Similarit Cariality a Etropy for Bipolar Fuzzy Set i the Framework of Peta-value Represetatio Vasile Patrasu Departmet of Iformatis Teholog Tarom Compay Buhares Romaia Email: patrasuv@gmailom bstrat I

More information

Optimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm

Optimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm Optimizatio of Multiple Iput Sigle Output Fuzzy Membership Fuctios Usig Cloal Selectio Algorithm AYŞE MERVE ACILAR, AHMET ARSLAN Computer Egieerig Departmet Selcuk Uiversity Selcuk Uiversity, Eg.-Arch.

More information

A Note on Least-norm Solution of Global WireWarping

A 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 information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 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 information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN 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 information

A Trip-Chain Based Combined Mode and Route Choice Network Equilibrium Model Considering Common Lines Problem in Transit Assignment Model

A Trip-Chain Based Combined Mode and Route Choice Network Equilibrium Model Considering Common Lines Problem in Transit Assignment Model Available olie at www.sieediret.om Proedia Soial ad Behavioral Siees 2 (2) 354 363 4 th EWGT & 26 th MEC & st RH A Tri-Chai Based Combied Mode ad Route Choie Networ Euilibrium Model Cosiderig Commo Lies

More information

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences

Mining 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 information

Automatic Detection of the Layout of Color Yarns for Yarn-dyed Fabric via a FCM Algorithm

Automatic Detection of the Layout of Color Yarns for Yarn-dyed Fabric via a FCM Algorithm Textile Researh Joural Artile Automati Detetio of the Layout of Color Yars for Yar-dyed Fabri via a FCM Algorithm Abstrat I the proess of aalyzig the yardyed fabri, two kids of olor iformatio about olor

More information

Perhaps 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

Perhaps 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 information

Fuzzy Transportation Problem Using Triangular Membership Function-A New approach

Fuzzy 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 information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A 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 information

Designing a learning system

Designing 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 information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha 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 information

COLOR AND SHAPE BASED INDEXING USING SCALE-SPACE REPRESENTATIONS

COLOR AND SHAPE BASED INDEXING USING SCALE-SPACE REPRESENTATIONS COLOR AND SHAPE BASED INDEXING USING SCALE-SPACE REPRESENTATIONS Biur Kurt, Muhitti Gökme Istabul Tehial Uiversity Computer Egieerig Departmet Maslak 80626, İstabul {kurt,gokme}@e.itu.edu.tr Abstrat Performae

More information

Octahedral Graph Scaling

Octahedral 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 information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive 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 information

Fuzzy Linear Regression Analysis

Fuzzy 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 information

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis Overview Chapter 6 Writig a Program Bjare Stroustrup Some thoughts o software developmet The idea of a calculator Usig a grammar Expressio evaluatio Program orgaizatio www.stroustrup.com/programmig 3 Buildig

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact 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 information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information

Transform into 3D world coordinate system. Illuminate according to lighting and reflectance. Transform into 3D camera coordinate system

Transform into 3D world coordinate system. Illuminate according to lighting and reflectance. Transform into 3D camera coordinate system Projetios Trasformatios! 3D Geometri Primities Modelig Trasformatio Trasform ito 3D world oordiate sstem Lightig Illumiate aordig to lightig ad refletae Viewig Trasformatio Trasform ito 3D amera oordiate

More information

Image Enhancement for Non-uniform Illumination Images using PDE

Image Enhancement for Non-uniform Illumination Images using PDE RESEARCH ARTICLE OPEN ACCESS Image Ehaemet for No-uiform Illumiatio Images usig PDE Jeish Sheri.B.T, Jemimah Simo JeishSheri.B.T, studyigm.teh i Vis Christia College of Egieerig, jeish33@gmail.om. Jemimah

More information

Big-O Analysis. Asymptotics

Big-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 information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running 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 information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN 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 information

Mean cordiality of some snake graphs

Mean 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 information

Optimal Mapped Mesh on the Circle

Optimal 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 information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running 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 information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture 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 information

Analysis of Algorithms

Analysis 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 information

Xiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation

Xiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation Flexible Colorig Xiaozhou (Steve) Li, Atri Rudra, Ram Swamiatha HP Laboratories HPL-2010-177 Keyword(s): graph colorig; hardess of approximatio Abstract: Motivated b y reliability cosideratios i data deduplicatio

More information

6.854J / J Advanced Algorithms Fall 2008

6.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 information

Campus Network Multi-ISP Load Balancing Optimization Model Based on BP Neural Networks

Campus Network Multi-ISP Load Balancing Optimization Model Based on BP Neural Networks Campus Networ Multi-ISP Load Balaig Optimizatio Model Based o BP Neural Networs XIE Haiya 1,2, WANG Jia 1, ZHAO Depeg 2, SUN Hui 1 1. Departmet of Mathematis, Dalia Maritime Uiversity, Dalia, Chia 2. Shool

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash 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 information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

WM2011 Conference, February 27-March 3, 2011, Phoenix, AZ. Assessing Geospatial Aleatory Uncertainty for Performance Assessment Modeling 11075

WM2011 Conference, February 27-March 3, 2011, Phoenix, AZ. Assessing Geospatial Aleatory Uncertainty for Performance Assessment Modeling 11075 W2 Coferee February 27-arh 3 2 Phoei A Assessig Geospatial Aleatory Uertaity for Performae Assessmet odelig 75 ABSTRACT Geoff Taylor* Rihard Dimea** Gle Taylor** *Uiversity of South Carolia Columbia South

More information

A Threshlod Selection Method Based on Multiscale and Graylevel Co-occurrence Matrix Analysis

A Threshlod Selection Method Based on Multiscale and Graylevel Co-occurrence Matrix Analysis A Threshlod Seletio Method Based o Multisale ad Graylevel Co-ourree Matrix Aalysis Yu Li 1, Mohamed Cheriet, Chig Y, Sue 1 1. Ceter for Patter Reogitio ad Mahie Itelligee Coordia Uiversity, GM606, 1455

More information

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE Wiwik Aggraei 1, Agyl Ardi Rahmadi 1, Radityo Prasetyo Wibowo 1 1 Iformatio System Departmet, Faculty of Iformatio Techology, Istitut Tekologi Sepuluh

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.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 information

Active Contours With New Signed Pressure Force Function For Echocardiographic Image Segmentation

Active Contours With New Signed Pressure Force Function For Echocardiographic Image Segmentation Volume No.4, Issue No.5, August September 16, 3674 3678. Ative Cotours With New Siged Pressure Fore Futio For Ehoardiographi Image Segmetatio V.LOHITHA REDDY M.Teh Studet Dept. of Eletrois ad Commuiatio

More information

MULTIPLE CRITERIA FUZZY COST TRANSPORTATION MODEL OF BOTTLENECK TYPE

MULTIPLE CRITERIA FUZZY COST TRANSPORTATION MODEL OF BOTTLENECK TYPE Assoiate Professor Alexadra TKACENKO PhD Departet of Applied Matheatis Moldova State Uiversity Moldova E-ail: alexadrataeo@gail.o. MULTIPLE CRITERIA FUZZY COST TRANSPORTATION MODEL OF BOTTLENECK TYPE Abstrat.

More information

Data Structures and Algorithms. Analysis of Algorithms

Data 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 information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship 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 information

An Efficient Algorithm for Graph Bisection of Triangularizations

An 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 information

Accuracy Improvement in Camera Calibration

Accuracy 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 information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic 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 information