Prediction of Migration Path of a Colony. of Bounded-Rational Species Foraging. on Patchily Distributed Resources

Size: px
Start display at page:

Download "Prediction of Migration Path of a Colony. of Bounded-Rational Species Foraging. on Patchily Distributed Resources"

Transcription

1 Advanced Studes n Bology, Vol. 3, 20, no. 7, Predcton of Mgraton Path of a Colony of Bounded-Ratonal Speces Foragng on Patchly Dstrbuted Resources Rebysarah S. Tambaoan, Jomar F. Rabaante, Ramon Joseph P. Esteves and Mchael C. Vlladelrey Insttute of Mathematcal Scences and Physcs Unversty of the Phlppnes Los Baños Correspondence should be addressed to Jomar F. Rabaante, frabaante@up.edu.ph Abstract A theoretcal and conceptual model was formulated to determne, as well as to predct, possble mgratory route of a colony of bounded-ratonal speces. A network wth connected patches was set to represent the envronment, and the mgraton behavor of the colony was assumed to follow the Optmal Foragng Theory. Varous dynamc envronmental factors such as qualty and quantty of avalable food, dstance of the food sources, populaton growth rate of the colony, exstence of compettors, and cost of transferrng from one locaton to another can be consdered n choosng the next resdence of the speces. The preferences of speces were ntegrated usng fuzzy Analytc Herarchy Process. The predcted mgratory route was obtaned by successve Mxed-Integer Lnear Goal Programmng. The acqured result was treated only as a satsfcng soluton because of the speces cogntve lmtatons and possble conflctng preferences. Keywords: mgraton, optmal foragng theory, mult-crtera decson makng, lnear goal programmng

2 334 R. S. Tambaoan et al Introducton There are several reasons why speces mgrate [,4,9,]. In most cases, they mgrate to have the best possble lvng condtons. An ndvdual or a communty may move to a new locaton because of overpopulaton and competton n ther current habtat. Speces, such as nsects and humans, mgrate n response to the depletng resource quantty. In ths paper, we answered the queston What s the mgratory route that the members of the colony should collectvely choose to follow n order to obtan sustanng benefts wth mnmal cost? by formulatng a mathematcal model. In determnng the possble mgraton route, only a satsfcng soluton to our model was consdered because of the bounded ratonalty of the speces. A satsfcng soluton means that only the adequate crtera are satsfed, and ths soluton may not be optmal because of the exstence of conflctng preferences. Speces are bounded ratonal snce they have lmted knowledge about ther envronment. Makng decsons have always been a bg part of daly lfe, especally when makng choces among dfferent alternatves. The determnaton of alternatves and ther mportance s a crucal and essental step [2,3,7,2]. Ths study wll help n predctng the satsfcng mgraton path of speces by consderng ther preferences and needs for survval, gven that the behavor of the speces follows the model s assumptons. Moreover, t wll gve nsghts about the actual mgraton strategy of some speces by measurng the devaton of the actual mgraton route of the speces from the acqured results of the model. The degree of devaton depends on how ratonal the speces are. The necessary steps n the formulaton of our theoretcal and conceptual model are () determne and rank the preferences of speces, (2) determne a satsfcng mgraton route that would satsfy, or nearly satsfy, the colony s wants and needs consderng the carryng capacty of the envronment, (3) measure the underachevement of the colony s wants and needs, (4) determne how long the envronment can provde enough food for the colony s survval, and (5) perform necessary senstvty analyss after obtanng a soluton. The man assumptons of the model are the behavor of the colony follows the Optmal Foragng Theory and the speces forage on patchly dstrbuted food sources [8,3,4,5,6]. Optmal Foragng Theory mples that the speces consder the costs and benefts of foragng n a certan patch or nearby patches. Also, the tme perod between mgraton actvtes was assumed to be dscrete. The needed nput values are rankng of speces preferences, populaton growth rates, quantty of food n each food source, dstance of patches from one another, cost of competton, cost of mgraton, quantty of food needed by the colony, and natural producton and depleton rates of the food sources. Some, f not all, of these nput nformaton were assumed to be known to the colony. Obtanng these nput nformaton s feasble because some colones do have scouts tasked to explore ther surroundng envronment. However, only the known

3 Predcton of mgraton path 335 food sources, new resdence locatons and compettors can be consdered n the model. 2 Fuzzy Analytc Herarchy Process Analytc Herarchy Process (AHP) s a mult-crtera decson makng technque that s commonly used n rankng dfferent alternatves. Saaty s scale [5,0,7] for the par-wse comparson between alternatves s llustrated n Table. The comparson matrx showng the par-wse comparson among alternatves s of the followng form: where s the relatve mportance of alternatve over alternatve quantfed usng Saaty s scale. Table. Saaty s scale for par-wse comparson. Saaty s scale Relatve mportance between factors Equally mportant 3 Moderately mportant 5 Strongly mportant 7 Very strongly mportant 9 Extremely mportant 2,4,6,8 Intermedate values To address the ambguty n each preference made, the comparson matrx s transformed nto a fuzzy par-wse comparson matrx usng the followng relatonshp [6]: a r a. Table 2. Scale for fuzzy par-wse comparson. Fuzzy scale membershp values (r ) Relatve mportance between factors 0.5 Equally Important Slghtly Important Important Strongly Important Very Strongly Important Extremely Important

4 336 R. S. Tambaoan et al The weghts w, w2,..., wn are determned by the formula: b w where, b n. n b n r Some of the preferences may be nconsstent so t s suggested to measure these nconsstences to be able to mprove the udgments made. The consstency of the comparson matrx can be checked usng the consstency rato [0]. 3 Model Formulaton A network s consdered where the possble new resdence locaton wth connected food patches comprses the set of nodes. We wll call the locaton of the resdence as hve. There are four possble types of nodes: () old hve; (2) food source only; (3) possble new hve and a food source; and (4) possble new hve but not a food source, whch s llustrated n Fgure. Fgure. Network of the food sources and the possble new locaton Several dynamc envronmental factors can be consdered n choosng the next hve locaton, such as preferences of the speces. The preferences of the speces wth respect to the factors consdered are ncorporated n the model and are ranked usng fuzzy Analytc Herarchy Process (AHP). The populaton growth rate and food consumpton of the mgratng colony and the compettors can also be taken nto account. The actual dstance between two nodes s converted nto ts equvalent perceved (nverse) dstance value. In ths paper, we used the negatve exponental functon as the perceved dstance functon. The colony has ts lmtaton on the dstance t can travel. There s a maxmum foragng dstance on whch they can only travel. In addton, the values used n the computatons were non-dmensonalzed and normalzed usng nfnty-norm.

5 Predcton of mgraton path 337 The soluton to the mathematcal program generated can be solved usng Operatons Research software. Defnton Varables and Parameters for tme perod t number of nodes number of factors or alternatves except the dstance between nodes and the amount of food avalable at a node set of all possble new hve locaton set of nodes wthn foragng dstance ndcator of possble new hve locaton; ths s our decson varable where,f node s chosen X 0,otherwse normalzed perceved (nverse) dstance functon value from node node normalzed total quantty of food avalable n node normalzed value or amount of factor at node (excludng the dstance between nodes and the amount of food avalable at a node) weghts derved from fuzzy AHP assgned to factor aggregate contrbuton of factors to the qualty of node, where v m w F k k k number of survvors of the mgratng colony after a competton total number of survvors of all the competng colones after the competton utlty functon value assgned to node based from the cost of competton the least number of survvors n order for a colony to be consdered a wnner n a competton the most number of survvors n order for a colony to be consdered a loser n a competton cost n wnnng a competton (same dmenson as ) cost n losng a competton (same dmenson as ) cost n a ted competton (same dmenson as ) mnmum quantty of food needed by the colony (same dmenson as ) penalty weght for the underachevement of penalty weght for the cost of mgraton costs of mgratng to node (asde from the factors ncluded n the computaton of, ths may nclude the rsk of exstence of predators near the possble hve locaton and the energy needed to transfer from the old hve to the new hve) to

6 338 R. S. Tambaoan et al amount of remanng food at node from the prevous tme perod expected total amount of food that the speces can forage n node consderng competton devaton varable correspondng to the overachevement of devaton varable correspondng to the underachevement of The Mxed-Integer Lnear Goal Program The goal of the model s to maxmze the beneft subect to the costs assocated wth the mgraton of the speces. The am s to maxmze the Obectve Functon: n X ( Y ) The obectve s subect to the followng constrants. Constrant : n X where f node s not an element of Constrant 2: For node, If there s no competton at node, Y n c q v Else, f there s competton at node, Y n c U where Sq v U P( S s2)[ q v C] P( S s) C2 P( s S s2) C3 ST Constrant 3: For, v m w F k k k Constrant 4: ( X c R d d ) A H J where Sq P( S s2) q P( s S s2), f there s a compettor at node R S T q, otherwse The frst constrant restrcts the speces n choosng exactly one new hve locaton. The second constrant ncorporates the factors consdered n choosng d

7 Predcton of mgraton path 339 the new locaton. The dstance of a food source from the hve and the quantty of avalable food are assumed to be the most mportant factors n the speces decsons. In the thrd constrant, the preference of the speces s beng ncorporated accordng to ts mportance. The possble compromse between the avalablty of food and the dstance travelled by speces durng foragng s reflected on the fourth constrant. The non-negatve varables and are the devatonal varables that represent the devaton above and below (mnmum quantty of food needed by the colony), respectvely. When there s known competton n the food source, correspondng cost s ncorporated. If the colony wns the competton wth the probablty gven by, then colony can take the entre food source on the locaton but wll pay for the cost of competton. On the other hand, f the colony loses wth probablty gven by, the colony wll not get the food source and wll pay for the cost of competton. But there could also be a possblty that the competng colones wll coexst, ths means that they can share the food source on the locaton but both colony stll need to pay for the cost of competton. 4 Prototype Example Consder the network n Fgure 2. The dstances between nodes are gven. Assume that the equvalent perceved dstance functon ( ) of the actual dstance ( ) s equal to. The perceved dstance functon value can also be nterpreted as the energy needed durng travel. Old Hve Fgure 2. Network of possble locatons and food sources

8 340 R. S. Tambaoan et al The avalable quantty of food n every node s gven n Table 3. Let,, and the maxmum flght dstance equal to. The dmenson of should be the same as the dmenson of 's. Assume that one food s good to sustan an ndvdual member of the colony. The correspondng values for the cost of mgraton are gven n Table 4. Dfferent mgratng costs were consdered n every mgraton tme perod because the energy needed by the colony to transfer from the old hve to the new hve vares. The dmenson of s the same as the dmenson of. In ths example, we assumed the value of depends on the value of. Table 3. Avalable amount of food per node. Node Amount of food Table 4. The cost of mgraton at a gven tme. Tme % Y 30% Y 35% Y 40% Y 50% Y 50% Y There are three factors that were par-wse compared. The factors are sucrose concentraton, extent of smell and brghtness of color of the food. The gven par-wse comparson matrx s shown n Table 5. These qualtatve factors were quantfed accordngly. The values of each factor at every node are gven n Table 6. Table 5. The par-wse comparson matrx of the factors. Factor Factor 2 Factor 3 Factor 6 4 Factor 2 /6 /3 Factor 3 /4 3 Table 6. Value of Factor at node. Node Node 2 Node 3 Node 4 Node 5 Node 6 Node 7 Factor Factor Factor Assume that there s a compettor at node 5 and node 7. The correspondng utlty functon nput values are gven n Table 7. The dmensons of, and are always the same as the dmenson of s.

9 Predcton of mgraton path 34 Table 7. Utlty Functon Input Values. P(S 30) P(S 20) P(20<S<30) C C 2 C 3 S/S T Node qv 2.5 qv qv Node qv.5 qv 0.08 qv 0.6 Suppose that the natural producton and depleton of the food source at tme perod can be computed by consderng the perodc formula:, where s the natural producton/depleton of the food source n node at tme perod, s the maxmum producton of the food source, and s the remanng food n node at tme perod. Also, suppose that the populaton growth of the speces follows the formula: where s the colony s populaton at tme perod and s the colony s populaton at tme perod. After consderng the gven prototype example and conductng necessary calculatons, the mathematcal program for the model has been formulated. In the comparson made between the dfferent factors consdered usng fuzzy AHP, the resultng weghts are, and. For the tme perod, the resultng mathematcal program s as follows: Maxmze X X X X X7 d subect to: X X X X X X X X X X d d.36 X {0,}, 2, 4,5,6,7 d, d 0, For the tme perod, the resultng mathematcal program s as follows: Maxmze X X X X X7 d subect to: X X X X X X X X X X d d.64 X {0,}, 2, 4,5,6,7 d, d 0,

10 342 R. S. Tambaoan et al For the tme perod, the resultng mathematcal program s as follows: Maxmze X X X X X7 d subect to: X X X X X X X X X X d d.96 X {0,}, 2, 4,5,6,7 d, d 0, For the tme perod, the resultng mathematcal program s as follows: Maxmze X X X X X7 d subect to: X X X X X X X X X X d d 2.36 X {0,}, 2, 4,5,6,7 d, d 0, For the tme perod, the resultng mathematcal program s as follows: Maxmze X X X X X7 d subect to: X X X X X X X X X X d d 2.83 X {0,}, 2, 4,5,6,7 d, d 0, For the tme perod, the resultng mathematcal program s as follows: Maxmze X X X X X7 d subect to: X X X X X X X X X X d d 3.39 X {0,}, 2, 4,5,6,7 d, d 0,

11 Predcton of mgraton path 343 In the obectve functons, some values of s are negatve, whch s an mplcaton of the competton exstng n a node or of the hgh mgraton cost. The soluton to the gven prototype example s llustrated n Fgure 3 and tabulated n Table 8. Table 8. Soluton to the gven prototype example. t Preferred new hve (node) Underachevement of food requrement Obectve Functon Value Old Hve Fgure 3. Vsualzaton of the soluton to the gven prototype example The result depcts that the colony wll not transfer to a new hve locaton untl the end of tme perod because ther present locaton (old hve, node 4) stll gves the most satsfcng benefts. But after tme perod, the colony wll mgrate to node 7, however, eventually the colony wll mgrate back to node

12 344 R. S. Tambaoan et al 4 at and. At, the colony wll choose agan node 7. After tme perod, the speces could no longer fnd a patch where they can sustan the food requrement they needed. Though node 2 s a possble new hve and a food source, the colony cannot mgrate to that locaton because t does not provde enough beneft for the colony. Snce the colony s consderng the flght dstance t can only travel as well as the dstances of food sources, then t s possble that t cannot mgrate to a specfc new locaton. The negatve value of the obectve functon value can be translated as the shortage on the desred benefts of speces. The value of the devatonal varable sgnfes the shortage from the mnmum amount of food needed by a colony. These shortages could also be nterpreted as the amount that the envronment lacks n provdng the colony s need. Senstvty analyss can be done to observe varaton n the optmal soluton as nput values vary. 5 Summary and Recommendaton The study amed to determne a satsfcng mgraton path of a colony of speces foragng on patches. The study consdered varous factors such as the colony s collectve preferences, avalablty of food, qualty and quantty of food, dstance of the food sources, populaton growth rate, exstence of competton and cost of transferrng from one locaton to another. The behavor of the colony was assumed to follow the Optmal Foragng Theory, where the colony consders the costs and benefts assocated durng mgraton. The preferences of speces durng mgraton were ranked usng fuzzy Analytc Herarchy Process (AHP). Successve Mxed-Integer Lnear Goal Programmng was used n makng the necessary analyss and fndng the satsfcng soluton. To llustrate the method for determnng a specfc mgratory route for a certan colony of speces, a prototype example was demonstrated. In makng the model, several thngs should be examned and revewed. Frst and most mportantly are the assumptons that are taken nto account. Next thng s the lstng of the factors and rankng t accordngly usng the fuzzy AHP algorthm. In ratng the preferences of speces durng mgraton, t s a must to check the consstency of the udgments made. Moreover, before dong the calculatons, all values should have been non-dmensonalzed and normalzed. It s recommended to add more factors and an actual observaton or expermentaton be done n order to test the valdty of the model. The conceptual model formulated can be modfed to ft a specfc bologcal problem. References [] B. Hoare, Anmal Mgraton: remarkable ourneys n the wld, Unversty of Calforna Press, 2009.

13 Predcton of mgraton path 345 [2] D. J. T. Sumpter, Collectve Anmal Behavor, Prnceton Unversty Press, 200. [3] D. W. Stephens, J. S. Brown and R. C. Ydenderg, Foragng: Behavor and Ecology, The Unversty of Chcago Press, [4] E. J. Mlner-Gulland, J. M. Fryxell and A. R. E. Snclar, Anmal Mgraton: A Synthess, Oxford Unversty Press, 20. [5] E. Trantaphyllou, B. Shu, S. Neto Sanchez and T. Ray, Mult-Crtera Decson Makng: An Operatons Research Approach, Encyclopeda of Electrcal and Electroncs Engneerng 5(998), [6] F. Kong and H. Lu, Applyng Fuzzy Analytc Herarchy Process to Evaluate Success Factors of E-Commerce, Internatonal Journal of Informaton and Systems Scences :3-4(2005), [7] G. Ch and P. Voss, Mgraton Decson-makng: A Herarchcal Regresson Approach, The Journal of Regonal Analyss and Polcy 35:2(2005), -22. [8] G. H. Pyke, Optmal Foragng Theory: A Crtcal Revew, Annual Revew of Ecology and Systematcs 5(984), [9] G. H. Schueller and S. K. Schueller, Anmal Behavor: Anmal Mgraton, Infobase Publshng, [0] H. A. Taha, Operatons Research: An Introducton 8 th ed, Prentce Hall, [] H. Dngle and V. Alstare Drake, What Is Mgraton?, Boscence 57:2(2007), 3-2. [2] I. D. Couzn, J. Krause, N. R. Franks and S. A. Levn, Effectve leadershp and decson-makng n anmal groups on the move, Nature 433(2005), [3] J. F. Rabaante, A. J. Jacldo and R. B. Fgueroa Jr., Modelng the Area Restrct Searchng Strategy of Stngless Bees, Trgona bro Frese, as a Quas-Random Walk Process, Journal of Nature Studes 8:2(2009), 5-2. [4] R. H. MacArthur and E. R. Panka, On Optmal Use of a Patchy Envronment, The Amercan Naturalst 00:96(966), [5] R. J. P. Esteves, M. C. Vlladelrey and J. F. Rabaante, Determnng the Optmal Dstrbuton of Bee Colony Locatons to Avod Overpopulaton Usng Mxed Integer Programmng, Journal of Nature Studes 9:(200), [6] R. McDermott, J. H. Fowler and O. Smrnov, On the Evolutonary Orgn of Prospect Theory Preferences, Journal of Poltcs 70:2(2008), [7] T. L. Saaty, The Analytc Herarchy Process: Plannng, Prorty Settng, Resource Allocaton, McGraw-Hll, 980. Receved: September, 20

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

COMPLEX METHODOLOGY FOR STUDY OF INTERCITY RAIL TRANSPORT

COMPLEX METHODOLOGY FOR STUDY OF INTERCITY RAIL TRANSPORT ENGINEERING FOR RURA DEVEOPMENT Jelgava 5.-7.05.06. COMPEX METHODOOGY FOR STUDY OF INTERCITY RAI TRANSPORT Svetla Stolova Radna Nkolova Techncal Unversty-Sofa Bulgara stolova@tu-sofa.bg r.nkolova@tu-sofa.bg

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

International Journal of Mathematical Archive-3(11), 2012, Available online through ISSN

International Journal of Mathematical Archive-3(11), 2012, Available online through   ISSN Internatonal Journal of Mathematcal rchve-(), 0, 477-474 valable onlne through www.jma.nfo ISSN 9 5046 FUZZY CRITICL PTH METHOD (FCPM) BSED ON SNGUNST ND CHEN RNKING METHOD ND CENTROID METHOD Dr. S. Narayanamoorthy*

More information

OPTIMIZATION OF PROCESS PARAMETERS USING AHP AND TOPSIS WHEN TURNING AISI 1040 STEEL WITH COATED TOOLS

OPTIMIZATION OF PROCESS PARAMETERS USING AHP AND TOPSIS WHEN TURNING AISI 1040 STEEL WITH COATED TOOLS Internatonal Journal of Mechancal Engneerng and Technology (IJMET) Volume 7, Issue 6, November December 2016, pp.483 492, Artcle ID: IJMET_07_06_047 Avalable onlne at http://www.aeme.com/jmet/ssues.asp?jtype=ijmet&vtype=7&itype=6

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

More information

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

CONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal

CONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal CONCURRENT OPTIMIZATION OF MUTI RESPONCE QUAITY CHARACTERISTICS BASED ON TAGUCHI METHOD Ümt Terz*, Kasım Baynal *Department of Industral Engneerng, Unversty of Kocael, Vnsan Campus, Kocael, Turkey +90

More information

CHAPTER 3 AHP, FUZZY AHP AND GRA

CHAPTER 3 AHP, FUZZY AHP AND GRA 38 CHAPTER 3 AHP, FUZZY AHP AND GRA 3.1 INTRODUCTION The purpose of ths chapter s to dscuss the fundamental concepts of AHP, Fuzzy AHP and GRA. The steps nvolved n AHP, characterstcs and lmtatons of AHP

More information

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling , pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay

More information

A Fuzzy Goal Programming Approach for a Single Machine Scheduling Problem

A Fuzzy Goal Programming Approach for a Single Machine Scheduling Problem Proceedngs of e 9 WSEAS Internatonal Conference on Appled Maematcs, Istanbul, Turkey, May 7-9, 006 (pp40-45 A Fuzzy Goal Programmng Approach for a Sngle Machne Schedulng Problem REZA TAVAKKOLI-MOGHADDAM,

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Multicriteria Decision Making

Multicriteria Decision Making Multcrtera Decson Makng Andrés Ramos (Andres.Ramos@comllas.edu) Pedro Sánchez (Pedro.Sanchez@comllas.edu) Sonja Wogrn (Sonja.Wogrn@comllas.edu) Contents 1. Basc concepts 2. Contnuous methods 3. Dscrete

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Imperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments

Imperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments Fourth Internatonal Conference Modellng and Development of Intellgent Systems October 8 - November, 05 Lucan Blaga Unversty Sbu - Romana Imperalst Compettve Algorthm wth Varable Parameters to Determne

More information

3. CR parameters and Multi-Objective Fitness Function

3. CR parameters and Multi-Objective Fitness Function 3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

5 The Primal-Dual Method

5 The Primal-Dual Method 5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton

More information

The environment bills that passed by the legislators triggered a new dimension towards the manufacturers to consider producing eco friendly

The environment bills that passed by the legislators triggered a new dimension towards the manufacturers to consider producing eco friendly Ffth Internatonal Workshop on Computatonal Intellgence & Applcatons IEEE SMC Hroshma Chapter, Hroshma Unversty, Japan, November 10, 11 & 12, 2009 The Development of the Computer Aded Remanufacturng System

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers 62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers

More information

Decision Support for the Dynamic Reconfiguration of Machine Layout and Part Routing in Cellular Manufacturing

Decision Support for the Dynamic Reconfiguration of Machine Layout and Part Routing in Cellular Manufacturing Decson Support for the Dynamc Reconfguraton of Machne Layout and Part Routng n Cellular Manufacturng Hao W. Ln and Tomohro Murata Abstract A mathematcal based approach s presented to evaluate the dynamc

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables

More information

Evaluation of Parallel Processing Systems through Queuing Model

Evaluation of Parallel Processing Systems through Queuing Model ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends

More information

Modelling a Queuing System for a Virtual Agricultural Call Center

Modelling a Queuing System for a Virtual Agricultural Call Center 25-28 July 2005, Vla Real, Portugal Modellng a Queung System for a Vrtual Agrcultural Call Center İnc Şentarlı, a, Arf Orçun Sakarya b a, Çankaya Unversty, Department of Management,06550, Balgat, Ankara,

More information

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM

OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM Proceedng of the Frst Internatonal Conference on Modelng, Smulaton and Appled Optmzaton, Sharah, U.A.E. February -3, 005 OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM Had Nobahar

More information

Report on On-line Graph Coloring

Report on On-line Graph Coloring 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

A fault tree analysis strategy using binary decision diagrams

A fault tree analysis strategy using binary decision diagrams Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

More information

Solving Route Planning Using Euler Path Transform

Solving Route Planning Using Euler Path Transform Solvng Route Plannng Usng Euler Path ransform Y-Chong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network Purdue Unversty Purdue e-pubs ECE Techncal Reports Electrcal and Computer Engneerng 3--7 An Optmal Bandwdth Allocaton and Data Droppage Scheme for Dfferentated Servces n a Wreless Network Waseem Shekh

More information

Sensor Selection with Grey Correlation Analysis for Remaining Useful Life Evaluation

Sensor Selection with Grey Correlation Analysis for Remaining Useful Life Evaluation Sensor Selecton wth Grey Correlaton Analyss for Remanng Useful Lfe valuaton Peng Yu, Xu Yong, Lu Datong, Peng Xyuan Automatc est Control Insttute, Harbn Insttute of echnology, Harbn, 5, Chna pengyu@ht.edu.cn

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Mixed-Criticality Scheduling on Multiprocessors using Task Grouping

Mixed-Criticality Scheduling on Multiprocessors using Task Grouping Mxed-Crtcalty Schedulng on Multprocessors usng Task Groupng Jankang Ren Lnh Th Xuan Phan School of Software Technology, Dalan Unversty of Technology, Chna Computer and Informaton Scence Department, Unversty

More information

Design for Reliability: Case Studies in Manufacturing Process Synthesis

Design for Reliability: Case Studies in Manufacturing Process Synthesis Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Software Up-gradations and Optimal Release Planning

Software Up-gradations and Optimal Release Planning Internatonal Journal of Computer Applcatons (0975 8887) Internatonal Conference on Relablty, Infocom Technologes and Optmzaton, 203 Software Up-gradatons and Optmal Release Plannng P K Kapur Amty Internatonal

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Intelligent Information Acquisition for Improved Clustering

Intelligent Information Acquisition for Improved Clustering Intellgent Informaton Acquston for Improved Clusterng Duy Vu Unversty of Texas at Austn duyvu@cs.utexas.edu Mkhal Blenko Mcrosoft Research mblenko@mcrosoft.com Prem Melvlle IBM T.J. Watson Research Center

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

Maintaining temporal validity of real-time data on non-continuously executing resources

Maintaining temporal validity of real-time data on non-continuously executing resources Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan

More information

5.0 Quality Assurance

5.0 Quality Assurance 5.0 Dr. Fred Omega Garces Analytcal Chemstry 25 Natural Scence, Mramar College Bascs of s what we do to get the rght answer for our purpose QA s planned and refers to planned and systematc producton processes

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information