Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
|
|
- Randall Collins
- 5 years ago
- Views:
Transcription
1 , pp Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College, North Chna Unversty of Water Resources and Electrc Power, Zhengzhou , Chna) @qq.com 2 (Henan Procuratoral Vocatonal College Zhengzhou , Chna) @qq.com Abstract In cloud computng envronments, the database s dynamc and real-tme features, and n data access t has been a Gordan not of cloud computng research; because n the ant colony algorthm that ants fndng food shares smlar correlaton wth cloud computng node fndng the access to the database. Therefore, the ntroducton of ant colony algorthm nto cloud computng database, the ntroducton of the chaos functon n the pheromone update, both wll mae the mproved pheromone avod the possblty of gettng nto local convergence, and hence mprove the effcency of database access n the cloud computng, reduce the load n the cloud computng. The smulaton results show that the algorthm n ths paper has been sgnfcantly mproved n terms of cloud computng networ queres and database consumpton, and greatly mproved the effcency of cloud computng. Keywords: cloud computng data; chaos; pheromone; ant colony algorthm 1. Introducton As the concept of cloud computng emerges, the networ model, combnng dstrbuted concept wth grd technology, has been wdely appled, and the emergence of cloud computng can help cloud users use varous resources under the cloud envronment accordng to the demands [1]. How to best mae users have access to data n the cloud database has always been a focus of the study. Owng to the dynamc and dstrbutve natures of cloud computng, the database under cloud computng envronment dffers sgnfcantly from the tradtonal database. Besdes, the emergence of cloud computng database has broen the tradtonal centralzed, statc and non-extendable storage method, and has won more and more attenton. Lterature [2] proposed a CCRP algorthm. Based on the characterstcs of data storage n the cloud computng database, ths algorthm frst appled contnuous readng feature to date n query schedulng, solved the dle system resources n the cloud computng compared to other algorthms, and the smulaton experments proved that CCRP algorthm was superor to other algorthms n system utlzaton rate and system performance. Lterature [3] proposed to combne ant colony algorthm wth the cloud database, rapdly and reasonably fnd the database requred to access from the cloud database through pheromone evaporaton, and mproved the effcency of cloud computng. Lterature [4] proposed a new cloud relatonal database platform, descrbed the vertcal mechansm and horzontal mechansm of data, and the expermental results showed that the cloud relatonal database platform had good relablty, extendblty and usablty. Lterature [4] proposed a tree-based cloud database. The database organzed and ISSN: IJDTA Copyrght c 2016 SERSC
2 retreved data n the form of tree, reorganzed the exstng data storage method n the form of tree, and satsfed the requrements over data storage and retreval. However, t had the weanesses of hgher data retreval costs, so that t was mpossble to mplement cloud computng database retreval under bg data. Lterature [6] proposed the best practce and the actual operatng techncal ndcators for database cloud platform n telecommuncatons companes. In foregn countes, Google uses the computer cluster composed of cheap PCs, and acheved the GFS dstrbuted, BgTable dstrbuted and MapReduce [7-9] envronments, n order to handle bg data n the cloud database as many as possble. Lterature [10] proposed a performance functon based on Sesson and content ratngs, too full account of the customer prorty, and mproved the database access effcency. The tradtonal ant colony algorthm s a dscrete optmzaton to solve NP problems, whch s a good soluton to the tradtonal statc combnaton optmzaton problems. Based on the tradtonal ant colony algorthm, ths paper mproves the ant colony algorthm, and the mproved ant colony algorthm has good advantages n solvng the access of cloud computng database. The smulaton results show that the presented algorthm can effectvely reduce the access tme of cloud computng database and enhance the access effcency of cloud computng networ. 2. Relevant Knowledge 2.1 Ant Colony Algorthm Ant colony algorthm s a swarm ntellgence and bonc optmzaton algorthm, whch s manly used to solve complex combnaton optmzaton problems. It s characterzed by ntellgent search, global optmzaton and dstrbuted computng. Ant colony algorthm means that ants leave a secreton called pheromone on the path of seeng food, and other ants wll choose a path accordng to the pheromone secreton. As a result, many ants travel down a certan path wthn a short tme, formng a postve feedbac mechansm and thus producng the shortest path from the colony to a food source. 2.2 Descrpton of Cloud Database Problems Cloud computng database conssts of mass databases dstrbuted n varous parts. However, the actual cloud database has the followng problems. On the one hand, a part of databases are stored n the fxed cloud server, whereas the other parts are stored n the moble ntermedate servce provders. These moble servce provders contnuously nteract wth cloud computng wth the oned or qut cloud nodes. On the other hand, could computng has cloud nodes or ln falures at any tme and new cloud nodes and lns on n, whch brng bg dffcultes to the access to resources n the cloud database. Therefore, how to acheve data access n ths dynamc envronment has become a ey to solvng problems. The user query operaton process of cloud database s as follows: (1) Cloud users send the contents to be quered to the database server through the networ; (2) Cloud server processes SQL commands sent by the users and dstrbute data sub-commands to each storage cloud nodes through pre-processng. (3) Each storage cloud node nteracts between the dfferent nodes after recevng SQL commands. (4) Upload the query results of each cloud node to the cloud server for summary. (5) Return to users and complete the query after server mang summary. In the process the user query, there are many factors nvolvng the query effcency, such as tme for users transmttng to server, server resolved tme, tme for server sendng to nodes, query tme between nodes and tme for nodes feedbac to server. In order to best 198 Copyrght c 2016 SERSC
3 guarantee the effcency of the user access to the database, the ey queston s how do nodes fnd the requred resources from the database. The process of resources seeng s to qucly and safely see an optmal path from the cloud startng pont to the end pont, whch s very smlar to the food seeng process of ant colony algorthm n realty. In ant colony algorthm, after ants seeng foods, the process from source node to the orgnal node s equvalent to cloud users sendng requests to the database, and the process of recordng returnng from the database s obtaned. In ths process, dfferent nodes obtaned from dfferent postons s equvalent to the database nodes n cloud computng. Snce the cloud computng adopts the column storage to manage data, t s very mportant to mae query schedulng for the database n cloud computng. The data query process n cloud computng s combned wth the flow dstrbuton, congeston control and route selecton processes n cloud computng. Compared wth tradtonal statc databases, the cloud computng database gves more consderaton to dynamc and real-tme storage. The routng table records the nformaton requred for the routng algorthm, whch can ensure that the scale of the cloud computng database can see the optmal soluton under certan condtons. However, f the cloud computng database has a relatvely large scale, t may be mpossble to see the optmal soluton. Obvously, t s an nevtable trend for the ncreased scale of cloud computng database, whch cannot reach the accuracy of routng algorthm to some extent. Therefore, the access to cloud computng database s the combnaton optmzaton problem n plannng. 3 Applcaton of the Algorthm n Cloud Computng Database 3.1 State Transton Combned wth the features of ant colony algorthm, assumng that m represents the database number n cloud computng, represents the dstance between the cloud database and the cloud database d s the amount of pheromone between request at t n the cloud database, 1/ d stands for the heurstc nformaton,, and p () t s the possblty of to query the cloud database, then [ ( t)] [ ( t)], allowed p [ s( t)] [ s( t)] (1) sallowed 0, otherwse In the equaton, the log sheet tabu ( 1,2,... m, 1,2... n) s used to represent the record havng access to the th database, beng used for the current travelng database set of database record, and allowed { C tabu } represents the record can have access to the next database. and respectvely represent the n computng. If =0, the database nearest to the access request weghts of and may be frst accessed. If =0, when the pheromone n ant colony algorthm wors, t becomes a heurstc search algorthm. When all access records have searched all databases, the pheromone smlar to the ant colony algorthm wll be updated. 3.2 Updatng Rules for Tradtonal Pheromone m 1 ( t 1) (1 ) ( t) ( t) (2) In Equaton (2), represents the factor of pheromone evaporaton, and () t th Copyrght c 2016 SERSC 199
4 represents the tral (pheromone) that the travelng through the path, at. Where, database Q L, where, t th record has access to the database and Q () t L (3) 0 represents the rato of length between node access database L and the represents the number of database accessed by the th record. In the prevous ant colony algorthm, an optmal soluton can be obtaned through the postve feedbac mechansm. However, as the path ( nodes n cloud computng) ncreases, t s easy to cause relatvely long searchng tme. If the recorded node access trals (pheromones) are centralzed to the optmal path, the stagnaton problem wll be emerged easly and the local optmal soluton s obtaned. The optmal query to the database access records n the cloud database may not be necessarly acheved, and thus lose the query to the optmal soluton. 3.3 Improved Pheromone Rules Snce the ant colony algorthm convergence s slow, the ants cannot be guded to the optmal soluton to a certan extent, whch s largely nfluenced by pheromones. The pheromone updatng cannot gude the generaton of optmal soluton from a global perspectve, cannot gude the cloud nodes correctly access the cloud database from the perspectve of cloud computng database, or t has the problems of low access neffcency. The pheromone updatng n the ant colony algorthm cannot accurately reflect the path, t cannot reflect the recorded accurate database access n the cloud computng database, and thus the optmal soluton s affected. On ths bass, ths paper changes the pheromone equaton, namely, ntroduces chaos algorthm to the pheromone updatng. The dea of chaos algorthm s to compare n the traversal process, save the relatvely good soluton n the comparson process and see the optmal soluton n the teraton search process. Ideas are as follows: 3.4 Algorthm Descrpton In the ant colony algorthm, the process of ants seeng food s the process of cloud nodes access to the data n server. Ths part combnes the database query wth the ant colony algorthm, and the algorthm steps are as follows: Step 1: Intalzaton: Place the ants of smulaton node access on a cloud node, lst the end pont server node nformaton to the log sheet tabu, set the maxmum frequency of ant food seeng nodes as Max; meanwhle, fnd whether the node belongs to the feasble node regon Feasble. If feasble, go to Step 2 Step 2: Tae the current node as the center, select the adacent selecton strategy and go to the next node y. The node y belongs to Feasble, then the node y consttutes a combnaton { y }, the nodes select accordng to the possblty value of adacent nodes, and select the node wth relatvely larger possblty value as the cloud node x and as the next node. Step 3: Accordng to the pheromone and other nformaton n the ant colony algorthm left by ant n the travelng process, as tme goes by, pheromone updatng wll follow the formula (2) for local updatng, and leave pheromone for subsequent ants, n order to provde reference to the database query of other nodes n the cloud computng and reduce x x x 200 Copyrght c 2016 SERSC
5 the access tme. Step 4: After the request sent by node x s repled, the global pheromone updatng rule, as mentoned n Secton 4.3, s used for the query pheromone n the shortest path, then update and save. Step 5: Accordng to the defnton of ant colony algorthm, chec whether the node access requrement n cloud computng s repled by server. If yes, go to Step 6. If not, go to Step 2. Step 6: Fnd the path, the server returned node nformaton returns to the startng poston of node x along the orgnal path. 4. Experment and Analyss In order to prove superorty of the algorthm, ths paper conducts the smulaton experment n the VC desgn envronment, and uses sx sets of computers confgured as CPU Core 32.2G, DDR4G memory and 500G hard ds. One set of PC s selected as a server to control the database system, whereas the rest fve sets are nstalled wth SQL Server2008 as the data storage nodes. Ths paper manly apples system analog data for expermental data collecton, sets the capacty of access data between [50M, 100M], maes comparson between two ndcators of the data access networ consumpton tme and data access tme, whch compares the Lterature [6] algorthm wth Lterature [10] algorthm. Fgure 1. Comparson of Networ Consumpton Tme Fgure 2. Data Access Tme Copyrght c 2016 SERSC 201
6 Fgure 3. Node Access Effcency Accordng to Fgure 1-3, compared wth the Lterature [6] algorthm wth Lterature [10] algorthm, the presented algorthm s sgnfcantly mproved n terms of networ consumpton tme, database access tme and node access effcency, whch s manly caused by the pheromone updatng mprovement n ant colony algorthm so as to avod the possblty of local optmal soluton, mae the tme for targetng database of node access reduce and effectvely decrease the networ consumpton. 5. Concluson Ths paper combnes the ant colony algorthm wth cloud computng database, and smulates the record query process of node access database n cloud computng as the process of food seeng. Frst of all, ths paper mproves the pheromone based on the ant colony algorthm, enables the mproved pheromone to effectvely prevent the possblty of local convergence, conducts the smulaton experment, and further proves that the presented algorthm s sgnfcant mproved n terms of query and networ consumpton n the cloud computng database as compared to the lterature algorthms, whch provdes a reference for the database query n the cloud computng envronment. References [1] L. Z. Yun, Research on cloud Database, Journal of software, vol. 23, no. 5, (2012), pp [2] Z. L. Yun, Database Query Schedulng Algorthm Based on the C loud Computng, Journal of Zhengzhou Unversty (Engneerng Scence), vol. 31, no. 7, (2010), pp [3] S. H. Lang, Cloud database dynamc route query based on self-adaptve ant colony optmzaton, Computer Engneerng and Applcatons, vol. 46, no. 9, (2010), pp [4] C. P. Png, Research on scalable cloud relatonal database, Computer Engneerng and Desgn, vol. 33, no. 7, (2012), pp [5] K. Y. Me, Adaptve Resource Provsonng for Cloud Computng, Telecommuncatons Scence, vol. 28, no. 1, (2012), pp [6] L. Yong, Constructon and Operaton Program of Enterprse-Class Database Cloud Platform, Telecommuncatons Scence, vol. 28, no. 2, (2012), pp [7] S. Ghemaw, H. Goboff and L. S. Ta, The Google Fles System, SIGOPS Operaton Systems Revew, vol. 37, no. 5, (2003). [8] F. Chang, J. Dean and S. Ghemaw, Bgtables: A Dstrbuted Storage System for Structured Data, 7th Symposum on Operatng Systems Desgn and Implementaton. Seattle, WA, USA, (2006), pp [9] J. Dean and S. Ghemaw, MapReduces: Smplfed data processng on large clusters, Communcatons of the ACM, vol. 51, no. 1, (2005), pp [10] Z. J. Juan, L. Tao and Q. Yan, Classfcaton Algorthm of Database Request Based on Sesson and Content Level n Cloud Computng, Computer Scence, vol. 40, no. 2, (2013), pp Authors Yongqang L, ( ) Lecturer, Master, Research Orentaton: Computng Networ. Jn Pan, ( ) Assocate Professor, Master, Research Orentaton: Computer Networ. 202 Copyrght c 2016 SERSC
THE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT
Journal of Theoretcal and Appled Informaton Technology 30 th Aprl 013. Vol. 50 No.3 005-013 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 THE PATH PLANNING ALGORITHM AND
More informationCluster 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 informationOverview. 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 informationParallelism 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 informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationApplication 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 informationA 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 informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationA KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE
A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JI-JUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs
More informationA 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 informationA Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI
216 Jont Internatonal Conference on Artfcal Intellgence and Computer Engneerng (AICE 216) and Internatonal Conference on etwork and Communcaton Securty (CS 216) ISB: 978-1-6595-362-5 A Model Based on Mult-agent
More informationVirtual 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 informationRemote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information
Remote Sensng Image Retreval Algorthm based on MapReduce and Characterstc Informaton Zhang Meng 1, 1 Computer School, Wuhan Unversty Hube, Wuhan430097 Informaton Center, Wuhan Unversty Hube, Wuhan430097
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationClassifier 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 informationA 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 informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationAn 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 informationEVALUATION 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 informationCourse 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 informationApplication of VCG in Replica Placement Strategy of Cloud Storage
Internatonal Journal of Grd and Dstrbuted Computng, pp.27-40 http://dx.do.org/10.14257/jgdc.2016.9.4.03 Applcaton of VCG n Replca Placement Strategy of Cloud Storage Wang Hongxa Computer Department, Bejng
More informationCloud testing scheduling based on improved ACO
Internatonal Symposum on Computers & Informatcs (ISCI 2015) Cloud testng schedulng based on mproved ACO Yang Zheng 1,2 a, Lzh Ca *2,3 b, Shdong Huang 4,c, Jawen Lu 1,d and Pan Lu 5,e 1 College of Informaton
More informationThe 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 informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationLoad 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 informationSubspace 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 informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationAnt Colony Optimization Applied to Minimum Weight Dominating Set Problem
Ant Colony Optmzaton Appled to Mnmum Weght Domnatng Set Problem Raa JOVANOVIC Mlan TUBA Dana SIMIAN Texas AM Unversty Faculty of Computer Scence Department of Computer Scence at Qatar Megatrend Unversty
More informationProblem 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 informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationSolving 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 informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationUsing Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol
2012 Thrd Internatonal Conference on Networkng and Computng Usng Partcle Swarm Optmzaton for Enhancng the Herarchcal Cell Relay Routng Protocol Hung-Y Ch Department of Electrcal Engneerng Natonal Sun Yat-Sen
More informationPerformance 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 informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationMeta-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 informationNUMERICAL 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 informationDetermining 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 informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationCHAPTER 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 informationAn IPv6-Oriented IDS Framework and Solutions of Two Problems
An IPv6-Orented IDS Framework and Solutons of Two Problems We LI, Zhy FANG, Peng XU and ayang SI,2 School of Computer Scence and Technology, Jln Unversty Changchun, 3002, P.R.Chna 2 Graduate Unversty of
More informationReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationA new segmentation algorithm for medical volume image based on K-means clustering
Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationA Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks
A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,
More informationTECHNIQUE 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 informationProfessional competences training path for an e-commerce major, based on the ISM method
World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng
More informationModel Research on the Optimized and Improved Design of Lucene Search Engine Based on Big Data
Model Research on the Optmzed and Improved Desgn of Lucene Search Engne Based on Bg Data Shaoyu Lang 1, Syn Lang 2 1 Guangzhou Huashang Vocatonal College, Guangdong 511300, Chna 2 Guangdong Huashang Techncal
More informationSecurity Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments
Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub
More informationApplication of Clustering Algorithm in Big Data Sample Set Optimization
Applcaton of Clusterng Algorthm n Bg Data Sample Set Optmzaton Yutang Lu 1, Qn Zhang 2 1 Department of Basc Subjects, Henan Insttute of Technology, Xnxang 453002, Chna 2 School of Mathematcs and Informaton
More informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationAn 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 informationGame Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers
Avaable onlne at www.scencedrect.com Proceda Engneerng 23 (20) 780 785 Power Electroncs and Engneerng Applcaton, 20 Game Based Vrtual Bandwdth Allocaton for Vrtual Networks n Data Centers Cu-rong Wang,
More informationRecommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm
Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton
More informationResearch on Kruskal Crossover Genetic Algorithm for Multi- Objective Logistics Distribution Path Optimization
, pp.367-378 http://dx.do.org/.14257/jmue.215..8.36 Research on Kruskal Crossover Genetc Algorthm for Mult- Objectve Logstcs Dstrbuton Path Optmzaton Yan Zhang 1,2, Xng-y Wu 1 and Oh-kyoung Kwon 2, a,
More informationA 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 informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationQuerying by sketch geographical databases. Yu Han 1, a *
4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,
More informationReliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 3, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 168 Relable and Effcent Routng Usng Adaptve Genetc Algorthm n Packet Swtched
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationA Clustering Algorithm Solution to the Collaborative Filtering
Internatonal Journal of Scence Vol.4 No.8 017 ISSN: 1813-4890 A Clusterng Algorthm Soluton to the Collaboratve Flterng Yongl Yang 1, a, Fe Xue, b, Yongquan Ca 1, c Zhenhu Nng 1, d,* Hafeng Lu 3, e 1 Faculty
More informationModule 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 informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationexpermental results on NRP nstances. Secton V dscusses some related wor and Secton VI concludes ths paper. II. PRELIMINARIES Ths secton gves the defnt
A Hybrd ACO Algorthm for the Next Release Problem He Jang School of Software Dalan Unversty of Technology Dalan 116621, Chna janghe@dlut.edu.cn Jngyuan Zhang School of Software Dalan Unversty of Technology
More informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More informationAir Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech.
Ar Transport Demand Ta-Hu Yang Assocate Professor Department of Logstcs Management Natonal Kaohsung Frst Unv. of Sc. & Tech. 1 Ar Transport Demand Demand for ar transport between two ctes or two regons
More informationFAHP 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 informationNeural Network Based Algorithm for Multi-Constrained Shortest Path Problem
Neural Network Based Algorthm for Mult-Constraned Shortest Path Problem Jyang Dong 1,2, Junyng Zhang 2, and Zhong Chen 1 1 Department of Physcs, Fujan Engneerng Research Center for Sold-State Lghtng, Xamen
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationAPPLICATION 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 informationAn Adaptive Virtual Machine Location Selection Mechanism in Distributed Cloud
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 9, NO. 12, Dec. 2015 4776 Copyrght c2015 KSII An Adaptve Vrtual Machne Locaton Selecton Mechansm n Dstrbuted Cloud Shukun Lu 1, Wea Ja 2 1 School
More informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationDecision Strategies for Rating Objects in Knowledge-Shared Research Networks
Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,
More informationStudy on Properties of Traffic Flow on Bus Transport Networks
Study on Propertes of Traffc Flow on Bus Transport Networks XU-HUA YANG, JIU-QIANG ZHAO, GUANG CHEN, AND YOU-YU DONG College of Computer Scence and Technology Zhejang Unversty of Technology Hangzhou, 310023,
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationJournal of Chemical and Pharmaceutical Research, 2014, 6(10): Research Article. Study on the original page oriented load balancing strategy
Avalable onlne www.jocpr.com Journal of hemcal and Pharmaceutcal Research, 2014, 6(10):274-280 Research Artcle IN : 0975-7384 ODEN(UA) : JPR5 tudy on the orgnal page orented load balancng strategy Kunpeng
More informationAnalysis of Particle Swarm Optimization and Genetic Algorithm based on Task Scheduling in Cloud Computing Environment
Analyss of Partcle Swarm Optmzaton and Genetc Algorthm based on Tas Schedulng n Cloud Computng Envronment Frederc Nzanywayngoma School of Computer and Communcaton Engneerng Unversty of Scence and Technology
More informationLoad-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 informationAN IMPROVED GENETIC ALGORITHM FOR RECTANGLES CUTTING & PACKING PROBLEM. Wang Shoukun, Wang Jingchun, Jin Yihui
Copyrght 2002 IFAC 5th Trennal World Congress, Barcelona, Span A IPROVED GEETIC ALGORITH FOR RECTAGLES CUTTIG & PACKIG PROBLE Wang Shouun, Wang Jngchun, Jn Yhu Tsnghua Unversty, Beng 00084, P. R. Chna
More informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationA GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING
A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods
More informationDetecting Maximum Inscribed Rectangle Based On Election Campaign Algorithm Qing-Hua XIE1,a,*, Xiang-Wei ZHANG1,b, Wen-Ge LV1,c and Si-Yuan CHENG1,d
6th Internatonal onference on Advanced Desgn and Manufacturng Engneerng (IADME 2016) Detectng Maxmum Inscrbed Rectangle Based On Electon ampagn Algorthm Qng-Hua XIE1,a,*, Xang-We ZHAG1,b, Wen-Ge LV1,c
More informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationMulti-objective Virtual Machine Placement for Load Balancing
Mult-obectve Vrtual Machne Placement for Load Balancng Feng FANG and Bn-Bn Qu,a School of Computer Scence & Technology, Huazhong Unversty Of Scence And Technology, Wuhan, Chna Abstract. The vrtual machne
More informationAn Ant-based approach to Power-Efficient Algorithm for Wireless Sensor Networks
An Ant-based approach to Power-Effcent Algorthm for Wreless Sensor Networs Yaofeng Wen, Yuquan Chen, and Dahong Qan, Senor Member, IEEE Abstract We present an adaptve approach for mprovng the performance
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationComparison 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 informationImproved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment
JOURNAL OF COMPUTERS, VOL. 4, NO. 9, SEPTEMBER 2009 873 Improved Resource Allocaton Algorthms for Practcal Image Encodng n a Ubqutous Computng Envronment Manxong Dong, Long Zheng, Kaoru Ota, Song Guo School
More informationX- 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