Scaling Genetic Algorithms Using MapReduce
- 格式:pdf
- 大小:234.83 KB
- 文档页数:6
1.1 如果是Matlab安装光盘上的工具箱,重新执行安装程序,选中即可;1.2 如果是单独下载的工具箱,一般情况下仅需要把新的工具箱解压到某个目录。
2 在matlab的file下面的set path把它加上。
3 把路径加进去后在file→Preferences→General的Toolbox Path Caching里点击update Toolbox Path Cache更新一下。
4 用which newtoolbox_command.m来检验是否可以访问。
如果能够显示新设置的路径,则表明该工具箱可以使用了。
把你的工具箱文件夹放到安装目录中“toolbox”文件夹中,然后单击“file”菜单中的“setpath”命令,打开“setpath”对话框,单击左边的“ADDFolder”命令,然后选择你的那个文件夹,最后单击“SAVE”命令就OK了。
MATLAB Toolboxes============================================/zsmcode.htmlBinaural-modeling software for MATLAB/Windows/home/Michael_Akeroyd/download2.htmlStatistical Parametric Mapping (SPM)/spm/ext/BOOTSTRAP MATLAB TOOLBOX.au/downloads/bootstrap_toolbox.htmlThe DSS package for MATLABDSS Matlab package contains algorithms for performing linear, deflation and symmetric DSS. http://www.cis.hut.fi/projects/dss/package/Psychtoolbox/download.htmlMultisurface Method Tree with MATLAB/~olvi/uwmp/msmt.htmlA Matlab Toolbox for every single topic !/~baum/toolboxes.htmleg. BrainStorm - MEG and EEG data visualization and processingCLAWPACK is a software package designed to compute numerical solutions to hyperbolic partial differential equations using a wave propagation approach/~claw/DIPimage - Image Processing ToolboxPRTools - Pattern Recognition Toolbox (+ Neural Networks)NetLab - Neural Network ToolboxFSTB - Fuzzy Systems ToolboxFusetool - Image Fusion Toolboxhttp://www.metapix.de/toolbox.htmWAVEKIT - Wavelet ToolboxGat - Genetic Algorithm ToolboxTSTOOL is a MATLAB software package for nonlinear time series analysis.TSTOOL can be used for computing: Time-delay reconstruction, Lyapunov exponents, Fractal dimensions, Mutual information, Surrogate data tests, Nearest neighbor statistics, Return times, Poincare sections, Nonlinear predictionhttp://www.physik3.gwdg.de/tstool/MATLAB / Data description toolboxA Matlab toolbox for data description, outlier and novelty detectionMarch 26, 2004 - D.M.J. Taxhttp://www-ict.ewi.tudelft.nl/~davidt/dd_tools/dd_manual.htmlMBEhttp://www.pmarneffei.hku.hk/mbetoolbox/Betabolic network toolbox for Matlabhttp://www.molgen.mpg.de/~lieberme/pages/network_matlab.htmlPharmacokinetics toolbox for Matlabhttp://page.inf.fu-berlin.de/~lieber/seiten/pbpk_toolbox.htmlThe SpiderThe spider is intended to be a complete object orientated environment for machine learning in Matlab. Aside from easy use of base learning algorithms, algorithms can be plugged together and can be compared with, e.g model selection, statistical tests and visual plots. This gives all the power of objects (reusability, plug together, share code) but also all the power of Matlab for machine learning research.http://www.kyb.tuebingen.mpg.de/bs/people/spider/index.htmlSchwarz-Christoffel Toolbox/matlabcentral/fileexchange/loadFile.do?objectId=1316&objectT ype=file#XML Toolbox/matlabcentral/fileexchange/loadFile.do?objectId=4278&object Type=fileFIR/TDNN Toolbox for MATLABBeta version of a toolbox for FIR (Finite Impulse Response) and TD (Time Delay) NeuralNetworks./interval-comp/dagstuhl.03/oish.pdfMisc.http://www.dcsc.tudelft.nl/Research/Software/index.htmlAstronomySaturn and Titan trajectories ... MALTAB astronomy/~abrecht/Matlab-codes/AudioMA Toolbox for Matlab Implementing Similarity Measures for Audiohttp://www.oefai.at/~elias/ma/index.htmlMAD - Matlab Auditory Demonstrations/~martin/MAD/docs/mad.htmMusic Analysis - Toolbox for Matlab : Feature Extraction from Raw Audio Signals for Content-Based Music Retrihttp://www.ai.univie.ac.at/~elias/ma/WarpTB - Matlab Toolbox for Warped DSPBy Aki Härmä and Matti Karjalainenhttp://www.acoustics.hut.fi/software/warp/MATLAB-related Softwarehttp://www.dpmi.tu-graz.ac.at/~schloegl/matlab/Biomedical Signal data formats (EEG machine specific file formats with Matlab import routines)http://www.dpmi.tu-graz.ac.at/~schloegl/matlab/eeg/MPEG Encoding library for MATLAB Movies (Created by David Foti)It enables MATLAB users to read (MPGREAD) or write (MPGWRITE) MPEG movies. That should help Video Quality project.Filter Design packagehttp://www.ee.ryerson.ca:8080/~mzeytin/dfp/index.htmlOctave by Christophe COUVREUR (Generates normalized A-weigthing, C-weighting, octave and one-third-octave digital filters)/matlabcentral/fileexchange/loadFile.do?objectType=file&object Id=69Source Coding MATLAB Toolbox/users/kieffer/programs.htmlBio Medical Informatics (Top)CGH-Plotter: MATLAB Toolbox for CGH-data AnalysisCode: http://sigwww.cs.tut.fi/TICSP/CGH-Plotter/Poster: http://sigwww.cs.tut.fi/TICSP/CSB2003/Posteri_CGH_Plotter.pdfThe Brain Imaging Software Toolboxhttp://www.bic.mni.mcgill.ca/software/MRI Brain Segmentation/matlabcentral/fileexchange/loadFile.do?objectId=4879Chemometrics (providing PCA) (Top)Matlab Molecular Biology & Evolution Toolbox(Toolbox Enables Evolutionary Biologists to Analyze and View DNA and Protein Sequences) James J. Caihttp://www.pmarneffei.hku.hk/mbetoolbox/Toolbox provided by Prof. Massart research grouphttp://minf.vub.ac.be/~fabi/publiek/Useful collection of routines from Prof age smilde research grouphttp://www-its.chem.uva.nl/research/pacMultivariate Toolbox written by Rune Mathisen/~mvartools/index.htmlMatlab code and datasetshttp://www.acc.umu.se/~tnkjtg/chemometrics/dataset.htmlChaos (Top)Chaotic Systems Toolbox/matlabcentral/fileexchange/loadFile.do?objectId=1597&objectT ype=file#HOSA Toolboxhttp://www.mathworks.nl/matlabcentral/fileexchange/loadFile.do?objectId=3013&objectTy pe=fileChemistry (Top)MetMAP - (Metabolical Modeling, Analysis and oPtimization alias Met. M. A. P.)http://webpages.ull.es/users/sympbst/pag_ing/pag_metmap/index.htmDoseLab - A set of software programs for quantitative comparison of measured and computed radiation dose distributions/GenBank Overview/Genbank/GenbankOverview.htmlMatlab: /matlabcentral/fileexchange/loadFile.do?objectId=1139CodingCode for the estimation of Scaling Exponentshttp://www.cubinlab.ee.mu.oz.au/~darryl/secondorder_code.htmlControl (Top)Control Tutorial for Matlab/group/ctm/AnotherCommunications (Top)Channel Learning Architecture toolbox(This Matlab toolbox is a supplement to the article "HiperLearn: A High Performance Learning Architecture")http://www.isy.liu.se/cvl/Projects/hiperlearn/Source Coding MATLAB Toolbox/users/kieffer/programs.htmlTCP/UDP/IP Toolbox 2.0.4/matlabcentral/fileexchange/loadFile.do?objectId=345&objectT ype=fileHome Networking Basis: Transmission Environments and Wired/Wireless Protocols Walter Y. Chen/support/books/book5295.jsp?category=new&language=-1MATLAB M-files and Simulink models/matlabcentral/fileexchange/loadFile.do?objectId=3834&object Type=file•OPNML/MATLAB Facilities/OPNML_Matlab/Mesh Generation/home/vavasis/qmg-home.htmlOpenFEM : An Open-Source Finite Element Toolbox/CALFEM is an interactive computer program for teaching the finite element method (FEM)http://www.byggmek.lth.se/Calfem/frinfo.htmThe Engineering Vibration Toolbox/people/faculty/jslater/vtoolbox/vtoolbox.htmlSaGA - Spatial and Geometric Analysis Toolboxby Kirill K. Pankratov/~glenn/kirill/saga.htmlMexCDF and NetCDF Toolbox For Matlab-5&6/staffpages/cdenham/public_html/MexCDF/nc4ml5.htmlCUEDSID: Cambridge University System Identification Toolbox/jmm/cuedsid/Kriging Toolbox/software/Geostats_software/MATLAB_KRIGING_TOOLBOX.htmMonte Carlo (Dr Nando)http://www.cs.ubc.ca/~nando/software.htmlRIOTS - The Most Powerful Optimal Control Problem Solver/~adam/RIOTS/ExcelMATLAB xlsheets/matlabcentral/fileexchange/loadFile.do?objectId=4474&objectTy pe=filewrite2excel/matlabcentral/fileexchange/loadFile.do?objectId=4414&objectTy pe=fileFinite Element Modeling (FEM) (Top)OpenFEM - An Open-Source Finite Element Toolbox/NLFET - nonlinear finite element toolbox for MATLAB ( framework for setting up, solving, and interpreting results for nonlinear static and dynamic finite element analysis.)/GetFEM - C++ library for finite element methods elementary computations with a Matlabinterfacehttp://www.gmm.insa-tlse.fr/getfem/FELIPE - FEA package to view results ( contains neat interface to MATLA/~blstmbr/felipe/Finance (Top)A NEW MATLAB-BASED TOOLBOX FOR COMPUTER AIDED DYNAMIC TECHNICAL TRADINGStephanos Papadamou and George StephanidesDepartment of Applied Informatics, University Of Macedonia Economic & Social Sciences, Thessaloniki, Greece/fen31/one_time_articles/dynamic_tech_trade_matlab6.htm Paper: :8089/eps/prog/papers/0201/0201001.pdfCompEcon Toolbox for Matlab/~pfackler/compecon/toolbox.htmlGenetic Algorithms (Top)The Genetic Algorithm Optimization Toolbox (GAOT) for Matlab 5/mirage/GAToolBox/gaot/Genetic Algorithm ToolboxWritten & distributed by Andy Chipperfield (Sheffield University, UK)/uni/projects/gaipp/gatbx.htmlManual: /~gaipp/ga-toolbox/manual.pdfGenetic and Evolutionary Algorithm Toolbox (GEATbx)/Evolutionary Algorithms for MATLAB/links/ea_matlab.htmlGenetic/Evolutionary Algorithms for MATLABhttp://www.systemtechnik.tu-ilmenau.de/~pohlheim/EA_Matlab/ea_matlab.html GraphicsVideoToolbox (C routines for visual psychophysics on Macs by Denis Pelli)/VideoToolbox/Paper: /pelli/pubs/pelli1997videotoolbox.pdf4D toolbox/~daniel/links/matlab/4DToolbox.htmlImages (Top)Eyelink Toolbox/eyelinktoolbox/Paper: /eyelinktoolbox/EyelinkToolbox.pdfCellStats: Automated statistical analysis of color-stained cell images in Matlabhttp://sigwww.cs.tut.fi/TICSP/CellStats/SDC Morphology Toolbox for MATLAB (powerful collection of latest state-of-the-art gray-scale morphological tools that can be applied to image segmentation, non-linear filtering, pattern recognition and image analysis)/Image Acquisition Toolbox/products/imaq/Halftoning Toolbox for MATLAB/~bevans/projects/halftoning/toolbox/index.htmlDIPimage - A Scientific Image Processing Toolbox for MATLABhttp://www.ph.tn.tudelft.nl/DIPlib/dipimage_1.htmlPNM Toolboxhttp://home.online.no/~pjacklam/matlab/software/pnm/index.htmlAnotherICA / KICA and KPCA (Top)ICA TU Toolboxhttp://mole.imm.dtu.dk/toolbox/menu.htmlMISEP Linear and Nonlinear ICA Toolboxhttp://neural.inesc-id.pt/~lba/ica/mitoolbox.htmlKernel Independant Component Analysis/~fbach/kernel-ica/index.htmMatlab: kernel-ica version 1.2KPCA- Please check the software section of kernel machines.KernelStatistical Pattern Recognition Toolboxhttp://cmp.felk.cvut.cz/~xfrancv/stprtool/MATLABArsenal A MATLAB Wrapper for Classification/tmp/MATLABArsenal.htmMarkov (Top)MapHMMBOX 1.1 - Matlab toolbox for Hidden Markov Modelling using Max. Aposteriori EM Prerequisites: Matlab 5.0, Netlab. Last Updated: 18 March 2002./~parg/software/maphmmbox_1_1.tarHMMBOX 4.1 - Matlab toolbox for Hidden Markov Modelling using Variational Bayes Prerequisites: Matlab 5.0,Netlab. Last Updated: 15 February 2002../~parg/software/hmmbox_3_2.tar/~parg/software/hmmbox_4_1.tarMarkov Decision Process (MDP) Toolbox for MatlabKevin Murphy, 1999/~murphyk/Software/MDP/MDP.zipMarkov Decision Process (MDP) Toolbox v1.0 for MATLABhttp://www.inra.fr/bia/T/MDPtoolbox/Hidden Markov Model (HMM) Toolbox for Matlab/~murphyk/Software/HMM/hmm.htmlBayes Net Toolbox for Matlab/~murphyk/Software/BNT/bnt.htmlMedical (Top)EEGLAB Open Source Matlab Toolbox for Physiological Research (formerly ICA/EEG Matlabtoolbox)/~scott/ica.htmlMATLAB Biomedical Signal Processing Toolbox/Toolbox/Powerful package for neurophysiological data analysis ( Igor Kagan webpage)/Matlab/Unitret.htmlEEG / MRI Matlab Toolbox/Microarray data analysis toolbox (MDAT): for normalization, adjustment and analysis of gene expression_r data.Knowlton N, Dozmorov IM, Centola M. Department of Arthritis and Immunology, Oklahoma Medical Research Foundation, Oklahoma City, OK, USA 73104. We introduce a novel Matlab toolbox for microarray data analysis. This toolbox uses normalization based upon a normally distributed background and differential gene expression_r based on 5 statistical measures. The objects in this toolbox are open source and can be implemented to suit your application. AVAILABILITY: MDAT v1.0 is a Matlab toolbox and requires Matlab to run. MDAT is freely available at:/publications/2004/knowlton/MDAT.zipMIDI (Top)MIDI Toolbox version 1.0 (GNU General Public License)http://www.jyu.fi/musica/miditoolbox/Misc. (Top)MATLAB-The Graphing Tool/~abrecht/matlab.html3-D Circuits The Circuit Animation Toolbox for MATLAB/other/3Dcircuits/SendMailhttp://carol.wins.uva.nl/~portegie/matlab/sendmail/Coolplothttp://www.reimeika.ca/marco/matlab/coolplots.htmlMPI (Matlab Parallel Interface)Cornell Multitask Toolbox for MATLAB/Services/Software/CMTM/Beolab Toolbox for v6.5Thomas Abrahamsson (Professor, Chalmers University of Technology, Applied Mechanics,Göteborg, Sweden)http://www.mathworks.nl/matlabcentral/fileexchange/loadFile.do?objectId=1216&objectType =filePARMATLABNeural Networks (Top)SOM Toolboxhttp://www.cis.hut.fi/projects/somtoolbox/Bayes Net Toolbox for Matlab/~murphyk/Software/BNT/bnt.htmlNetLab/netlab/Random Neural Networks/~ahossam/rnnsimv2/ftp: ftp:///pub/contrib/v5/nnet/rnnsimv2/NNSYSID Toolbox (tools for neural network based identification of nonlinear dynamic systems) http://www.iau.dtu.dk/research/control/nnsysid.htmlOceanography (Top)WAFO. Wave Analysis for Fatigue and Oceanographyhttp://www.maths.lth.se/matstat/wafo/ADCP toolbox for MATLAB (USGS, USA)Presented at the Hydroacoustics Workshop in Tampa and at ADCP's in Action in San Diego /operations/stg/pubs/ADCPtoolsSEA-MAT - Matlab Tools for Oceanographic AnalysisA collaborative effort to organize and distribute Matlab tools for the Oceanographic Community /Ocean Toolboxhttp://www.mar.dfo-mpo.gc.ca/science/ocean/epsonde/programming.htmlEUGENE D. GALLAGHER(Associate Professor, Environmental, Coastal & Ocean Sciences)/edgwebp.htmOptimization (Top)MODCONS - a MATLAB Toolbox for Multi-Objective Control System Design/mecheng/jfw/modcons.htmlLazy Learning Packagehttp://iridia.ulb.ac.be/~lazy/SDPT3 version 3.02 -- a MATLAB software for semidefinite-quadratic-linear programming .sg/~mattohkc/sdpt3.htmlMinimum Enclosing Balls: Matlab Code/meb/SOSTOOLS Sum of Squares Optimi zation Toolbox for MATLAB User’s guide/sostools/sostools.pdfPSOt - a Particle Swarm Optimization Toolbox for use with MatlabBy Brian Birge ... A Particle Swarm Optimization Toolbox (PSOt) for use with the Matlab scientific programming environment has been developed. PSO isintroduced briefly and then the use of the toolbox is explained with some examples. A link to downloadable code is provided.Plot/software/plotting/gbplot/Signal Processing (Top)Filter Design with Motorola DSP56Khttp://www.ee.ryerson.ca:8080/~mzeytin/dfp/index.htmlChange Detection and Adaptive Filtering Toolboxhttp://www.sigmoid.se/Signal Processing Toolbox/products/signal/ICA TU Toolboxhttp://mole.imm.dtu.dk/toolbox/menu.htmlTime-Frequency Toolbox for Matlabhttp://crttsn.univ-nantes.fr/~auger/tftb.htmlVoiceBox - Speech Processing Toolbox/hp/staff/dmb/voicebox/voicebox.htmlLeast Squared - Support Vector Machines (LS-SVM)http://www.esat.kuleuven.ac.be/sista/lssvmlab/WaveLab802 : the Wavelet ToolboxBy David Donoho, Mark Reynold Duncan, Xiaoming Huo, Ofer Levi /~wavelab/Time-series Matlab scriptshttp://wise-obs.tau.ac.il/~eran/MATLAB/TimeseriesCon.htmlUvi_Wave Wavelet Toolbox Home Pagehttp://www.gts.tsc.uvigo.es/~wavelets/index.htmlAnotherSupport Vector Machine (Top)MATLAB Support Vector Machine ToolboxDr Gavin CawleySchool of Information Systems, University of East Anglia/~gcc/svm/toolbox/LS-SVM - SISTASVM toolboxes/dmi/svm/LSVM Lagrangian Support Vector Machine/dmi/lsvm/Statistics (Top)Logistic regression/SAGA/software/saga/Multi-Parametric Toolbox (MPT) A tool (not only) for multi-parametric optimization. http://control.ee.ethz.ch/~mpt/ARfit: A Matlab package for the estimation of parameters and eigenmodes of multivariate autoregressive modelshttp://www.mat.univie.ac.at/~neum/software/arfit/The Dimensional Analysis Toolbox for MATLABHome: http://www.sbrs.de/Paper: http://www.isd.uni-stuttgart.de/~brueckner/Papers/similarity2002.pdfFATHOM for Matlab/personal/djones/PLS-toolbox/Multivariate analysis toolbox (N-way Toolbox - paper)http://www.models.kvl.dk/source/nwaytoolbox/index.aspClassification Toolbox for Matlabhttp://tiger.technion.ac.il/~eladyt/classification/index.htmMatlab toolbox for Robust Calibrationhttp://www.wis.kuleuven.ac.be/stat/robust/toolbox.htmlStatistical Parametric Mapping/spm/spm2.htmlEVIM: A Software Package for Extreme Value Analysis in Matlabby Ramazan Gençay, Faruk Selcuk and Abdurrahman Ulugulyagci, 2001.Manual (pdf file) evim.pdf - Software (zip file) evim.zipTime Series Analysishttp://www.dpmi.tu-graz.ac.at/~schloegl/matlab/tsa/Bayes Net Toolbox for MatlabWritten by Kevin Murphy/~murphyk/Software/BNT/bnt.htmlOther: /information/toolboxes.htmlARfit: A Matlab package for the estimation of parameters and eigenmodes of multivariate autoregressive models/~tapio/arfit/M-Fithttp://www.ill.fr/tas/matlab/doc/mfit4/mfit.htmlDimensional Analysis Toolbox for Matlab/The NaN-toolbox: A statistic-toolbox for Octave and Matlab®... handles data with and without MISSING VALUES.http://www-dpmi.tu-graz.ac.at/~schloegl/matlab/NaN/Iterative Methods for Optimization: Matlab Codes/~ctk/matlab_darts.htmlMultiscale Shape Analysis (MSA) Matlab Toolbox 2000p.br/~cesar/projects/multiscale/Multivariate Ecological & Oceanographic Data Analysis (FATHOM)From David Jones/personal/djones/glmlab (Generalized Linear Models in MATLA.au/staff/dunn/glmlab/glmlab.htmlSpacial and Geometric Analysis (SaGA) toolboxInteresting audio links with FAQ, VC++, on the topic机器学习网站北京大学视觉与听觉信息处理实验室北京邮电大学模式识别与智能系统学科复旦大学智能信息处理开放实验室IEEE Computer Society北京映象站点计算机科学论坛机器人足球赛模式识别国家重点实验室南京航空航天大学模式识别与神经计算实验室- PARNEC南京大学机器学习与数据挖掘研究所- LAMDA南京大学人工智能实验室南京大学软件新技术国家重点实验室人工生命之园数据挖掘研究院微软亚洲研究院中国科技大学人工智能中心中科院计算所中科院计算所生物信息学实验室中科院软件所中科院自动化所中科院自动化所人工智能实验室ACL Special Interest Group on Natural Language Learning (SIGNLL)ACMACM Digital LibraryACM SIGARTACM SIGIRACM SIGKDDACM SIGMODAdaptive Computation Group at University of New MexicoAI at Johns HopkinsAI BibliographiesAI Topics: A dynamic online library of introductory information about artificial intelligence Ant Colony OptimizationARIES Laboratory: Advanced Research in Intelligent Educational SystemsArtificial Intelligence Research in Environmental Sciences (AIRIES)Austrian Research Institute for AI (OFAI)Back Issues of Neuron DigestBibFinder: a computer science bibliography search engine integrating many other engines BioAPI ConsortiumBiological and Computational Learning Center at MITBiometrics ConsortiumBoosting siteBrain-Style Information Systems Research Group at RIKEN Brain Science Institute, Japan British Computer Society Specialist Group on Expert SystemsCanadian Society for Computational Studies of Intelligence (CSCSI)CI Collection of BibTex DatabasesCITE, the first-stop source for computational intelligence information and services on the web Classification Society of North AmericaCMU Advanced Multimedia Processing GroupCMU Web->KB ProjectCognitive and Neural Systems Department of Boston UniversityCognitive Sciences Eprint Archive (CogPrints)COLT: Computational Learning TheoryComputational Neural Engineering Laboratory at the University of FloridaComputational Neurobiology Lab at California, USAComputer Science Department of National University of SingaporeData Mining Server Online held by Rudjer Boskovic InstituteDatabase Group at Simon Frazer University, CanadaDBLP: Computer Science BibliographyDigital Biology: about creating artificial lifeDistributed AI Unit at Queen Mary & Westfield College, University of LondonDistributed Artificial Intelligence at HUJIDSI Neural Networks group at the Université di Firenze, ItalyEA-related literature at the EvALife research group at DAIMI, University of Aarhus, Denmark Electronic Research Group at Aberdeen UniversityElsevierComputerScienceEuropean Coordinating Committee for Artificial Intelligence (ECCAI)European Network of Excellence in ML (MLnet)European Neural Network Society (ENNS)Evolutionary Computing Group at University of the West of EnglandEvolutionary Multi-Objective Optimization RepositoryExplanation-Based Learning at University of Illinoise at Urbana-ChampaignFace Detection HomepageFace Recognition Vendor TestFace Recognition HomepageFace Recognition Research CommunityFingerpassftp of Jude Shavlik's Machine Learning Group (University of Wisconsin-Madison)GA-List Searchable DatabaseGenetic Algorithms Digest ArchiveGenetic Programming BibliographyGesture Recognition HomepageHCI Bibliography Project contain extended bibliographic information (abstract, key words, table of contents, section headings) for most publications Human-Computer Interaction dating back to 1980 and selected publications before 1980IBM ResearchIEEEIEEE Computer SocietyIEEE Neural Networks SocietyIllinois Genetic Algorithms Laboratory (IlliGAL)ILP Network of ExcellenceInductive Learning at University of Illinoise at Urbana-ChampaignIntelligent Agents RepositoryIntellimedia Project at North Carolina State UniversityInteractive Artificial Intelligence ResourcesInternational Association of Pattern RecognitionInternational Biometric Industry AssociationInternational Joint Conference on Artificial Intelligence (IJCAI)International Machine Learning Society (IMLS)International Neural Network Society (INNS)Internet Softbot Research at University of WashingtonJapanese Neural Network Society (JNNS)Java Agents for Meta-Learning Group (JAM) at Computer Science Department, Columbia University, for Fraud and Intrusion Detection Using Meta-Learning AgentsKernel MachinesKnowledge Discovery MineLaboratory for Natural and Simulated Cognition at McGill University, CanadaLearning Laboratory at Carnegie Mellon UniversityLearning Robots Laboratory at Carnegie Mellon UniversityLaboratoire d'Informatique et d'Intelligence Artificielle (IIA-ENSAIS)Machine Learning Group of Sydney University, AustraliaMammographic Image Analysis SocietyMDL Research on the WebMirek's Cellebration: 1D and 2D Cellular Automata explorerMIT Artificial Intelligence LaboratoryMIT Media LaboratoryMIT Media Laboratory Vision and Modeling GroupMLNET: a European network of excellence in Machine Learning, Case-based Reasoning and Knowledge AcquisitionMLnet Machine Learning Archive at GMD includes papers, software, and data sets MIRALab at University of Geneva: leading research on virtual human simulationNeural Adaptive Control Technology (NACT)Neural Computing Research Group at Aston University, UKNeural Information Processing Group at Technical University of BerlinNIPSNIPS OnlineNeural Network Benchmarks, Technical Reports,and Source Code maintained by Scott Fahlman at CMU; source code includes Quickprop, Cascade-Correlation, Aspirin/Migraines Neural Networks FAQ by Lutz PrecheltNeural Networks FAQ by Warren S. SarleNeural Networks: Freeware and Shareware ToolsNeural Network Group at Department of Medical Physics and Biophysics, University ofNeural Network Group at Université Catholique de LouvainNeural Network Group at Eindhoven University of TechnologyNeural Network Hyperplane Animator program that allows easy visualization of training data and weights in a back-propagation neural networkNeural Networks Research at TUT/ELENeural Networks Research Centre at Helsinki University of Technology, FinlandNeural Network Speech Group at Carnegie Mellon UniversityNeural Text Classification with Neural NetworksNonlinearity and Complexity HomepageOFAI and IMKAI library information system, provided by the Department of Medical Cybernetics and Artificial Intelligence at the University of Vienna (IMKAI) and the Austrian Research Institute for Artificial Intelligence (OFAI). It contains over 36,000 items (books, research papers, conference papers, journal articles) from many subareas of AI OntoWeb: Ontology-based information exchange for knowledge management and electronic commercePortal on Neural Network ForecastingPRAG: Pattern Recognition and Application Group at University of CagliariQuest Project at IBM Almaden Research Center: an academic website focusing on classification and regression trees. Maintained by Tjen-Sien LimReinforcement Learning at Carnegie Mellon UniversityResearchIndex: NECI Scientific Literature Digital Library, indexing over 200,000 computer science articlesReVision: Reviewing Vision in the Web!RIKEN: The Institute of Physical and Chemical Research, JapanSalford SystemsSANS Studies of Artificial Neural Systems, at the Royal Institute of Technology, Sweden Santa-Fe InstituteScirus: a search engine locating scientific information on the InternetSecond Moment: The News and Business Resource for Applied AnalyticsSEL-HPC Article Archive has sections for neural networks, distributed AI, theorem proving, and a variety of other computer science topicsSOAR Project at University of Southern CaliforniaSociety for AI and StatisticsSVM of ANU CanberraSVM of Bell LabsSVM of GMD-First BerlinSVM of MITSVM of Royal Holloway CollegeSVM of University of SouthamptonSVM-workshop at NIPS97TechOnLine: TechOnLine University offers free online courses and lecturesUCI Machine Learning GroupUMASS Distributed Artificial Intelligence LaboratoryUTCS Neural Networks Research Group of Artificial Intelligence Lab, Computer Science Department, University of Texas at AustinVivisimo Document Clustering: a powerful search engine which returns clustered results Worcester Polytechnic Institute Artificial Intelligence Research Group (AIRG)Xerion neural network simulator developed and used by the connectionist group at the University of TorontoYale's CTAN Advanced Technology Center for Theoretical and Applied Neuroscience ZooLand: Artificial Life Resource。
of Baker [10]. In addition, non-linear ranking is also supported in the routine ranking.Selection functions:reins,rws,select,susThese functions select a given number of individuals from the current population, according to their fitness, and return a column vector to their indices. Currently available routines are roulette wheel selection [9],rws, and stochastic universal sampling [11],sus. A high-level entry function,select, is also provided as a convenient interface to the selection routines, particularly where multiple populations are used. In cases where a generation gap is required, i.e. where the entire population is not reproduced in each generation,reins can be used to effect uniform random or fitness-based re-insertion [9].Crossover operators:recdis,recint,reclin,recmut,recombin,xovdp,xovdprs,xovmp,xovsh, xovshrs,xovsp,xovsprsThe crossover routines recombine pairs of individuals with given probability to produce offspring. Single-point, double-point [12] and shuffle crossover [13] are implemented in the routines xovsp,xovdp and xovsh respectively. Reduced surrogate [13] crossover is supported with both single-,xovsprs, and double-point, xovdprs, crossover and with shuffle,xovshrs. A general multi-point crossover routine,xovmp, that supports uniform crossover [14] is also provided. To support real-valued chromosome representations, discrete, intermediate and line recombination are supplied in the routines,recdis,recint and reclin respectively [15]. The routine recmut performs line recombination with mutation features [15]. A high-level entry function to all the crossover operators supporting multiple subpopulations is provided by the function recombin.Mutation operators:mut,mutate,mutbgaBinary and integer mutation are performed by the routine mut. Real-value mutation is available using the breeder GA mutation function [15],mutbga. Again, a high-level entry function,mutate, to the mutation operators is provided. Multiple subpopulation support:migrateThe GA Toolbox provides support for multiple subpopulations through the use of high-level genetic operator functions and a function for exchanging individuals amongst subpopulations,migrate. A single population is divided into a number of subpopulations by modifying the data structures used by the Toolbox routines such that subpopulations are stored in contiguous blocks within each data element. The high-level routines, such as select and reins, operate independently on each subpopulation contained in a data structure allowing each subpopulation to evolve in isolation from the others. Based on the Island or Migration model [16],migrate allows individuals to be transferred between subpopulations. Uni- and bi-directional ring topologies as well as a fully interconnected network are selectable via option settings as well as fitness-based and uniform selection and re-insertion strategies.2.3 A Simple GA in M ATLABFig.1 shows the M ATLAB code for a Simple GA. The first few lines of the code set the parameters that the GA uses, such as the number and length of the chromosomes, the crossover and mutation rates, the number of generations and, in this case, the binary representation scheme. Next, an initial uniformly distributed random binary population, Chrom, is created using the GA Toolbox function crtbp. The objective function,objfun, is then evaluated to produce the vector of objective values,ObjV. Note that as we do not need the phenotypic representation inside the GA, the binary strings are converted to real values within the objective function call.The initialisation complete, the GA now enters the generational loop. First, a fitness vector,FitnV, is determined using the ranking scheme of Baker [11]. Visualisation and preference articulation can be incorporated into the generational loop by the addition of extra functions. In this example, the routine plotgraphics displays the performance of the current best controller allowing the user to asses the state of the search. Individuals are then selected from the population using the stochastic universal sampling algorithm,sus, with a generation gap,GGAP = 0.9. The 36 (GGAP× NIND) selected individuals are then recombined using single-point crossover,xovsp, applied with probability XOV = 0.7. Binary mutation,mut, is then applied to the offspring with probability MUTR = 0.0175, and the objective function values for the new individuals,ObjVSel, calculated. Finally, the new individuals are re-inserted in the population, using the Toolbox function reins, and the generation counter,gen, incremented.The GA terminates after MAXGEN iterations around the generational loop. The current population, its phenotypic representation and associated cost function values remain in the users workspace and may be analysed directly using M ATLAB commands.for very different genotypes to result in non-dominated individuals, a particular problem is the production of lethals when fit members of the population are mated. The search then becomes inefficient and the GA is likely to converge to some suboptimal solution.In general, a combination of mating restriction, niche formation and redundant coding may be appropriate.4. Concluding RemarksTogether with M ATLAB and S IMULINK, the GA Toolbox described in this paper presents a familiar and unified environment for the control engineer to experiment with and apply GAs to tasks in control systems engineering. Whilst the GA Toolbox was developed with the emphasis on control engineering applications, it should prove equally as useful in the general field of GAs, particularly given the range of domain-specific toolboxes available for the M ATLAB package.5. AcknowledgementsThe authors gratefully acknowledge the support of this research by a UK SERC grant on “Genetic Algorithms in Control Systems Engineering” (GR/J17920).6. References[1] J. Holland,Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, 1975.[2] K. Krishnakumar and D. E. Goldberg, “Control System Optimization Using Genetic Algorithms”,Journal of Guidance, Control and Dynamics, Vol. 15, No. 3, pp. 735-740, 1992.[3] M. F. Bramlette and R. Cusin , “A Comparative Evaluation of Search Methods Applied to Parametric Design of Aircraft”,Proc. ICGA 3, pp213-218, 1989.[4] B. Porter and S. S. Mohamed, “Genetic Design of Multivariable Flight-Control Systems Using Eigenstructure Assignment”,Proc. IEEE Conf. Aerospace Control Systems, 1993.[5] A. Varsek, T. Urbacic and B. Filipic, “Genetic Algorithms in Controller Design and Tuning”,IEEE Trans. Sys. Man and Cyber., Vol. 23, No. 5, pp1330-1339, 1993.[6] J. J. Grefenstette, “A User’s Guide to G ENESIS Version 5.0”, Technical Report, Navy Centre for Applied Research in Artificial Intelligence, Washington D.C., USA, 1990.[7] D. Whitley, “The G ENITOR algorithm and selection pressure: why rank-based allocations of reproductive trials is best,” in Proc. ICGA 3, pp. 116-121, 1989.[8] A. J. Chipperfield, P. J. Fleming and C. M. Fonseca, “Genetic Algorithm Tools for Control Systems Engineering”, Proc. Adaptive Computing in Engineering Design and Control, Plymouth Engineering Design Centre, 21-22 September, pp. 128-133, 1994.[9] D. E. Goldberg,Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley Publishing Company, January 1989.[10] J. E. Baker J, “Adaptive Selection Methods for Genetic Algorithms”,Proc. ICGA 1, pp. 101-111, 1985.[11] J. E. Baker, “Reducing bias and inefficiency in the selection algorithm”, Proc. ICGA 2, pp. 14-21, 1987.[12] L. Booker, “Improving search in genetic algorithms,” In Genetic Algorithms and Simulated Annealing, L. Davis (Ed.), pp 61-73, Morgan Kaufmann Publishers, 1987.[13] R. A. Caruana, L. A. Eshelman and J. D. Schaffer, “Representation and hidden bias II: Eliminating defining length bias in genetic search via shuffle crossover”, In Eleventh Int. Joint Conf. on AI, Sridharan N. S. (Ed.), Vol. 1, pp 750-755, Morgan Kaufmann, 1989.[14] G. Syswerda, “Uniform crossover in genetic algorithms”,Proc. ICGA 3, pp. 2-9, 1989.[15] H. Mühlenbein and D. Schlierkamp-Voosen, “Predictive Models for the Breeder Genetic Algorithm”, Evolutionary Computation, Vol. 1, No. 1, pp. 25-49, 1993.[16] C. B. Petty, M. R. Leuze. and J. J. Grefenstette, “A Parallel Genetic Algorithm”,Proc. ICGA 2, pp. 155-161, 1987.[17] C. M. Fonseca and P. J. Fleming, “Genetic Algorithms for Multiple Objective Optimization: Formulation, Discussion and Generalization”,Proc. ICGA 5, pp. 416-423, 1993.。
1.1 如果是Matlab安装光盘上的工具箱,重新执行安装程序,选中即可;1.2 如果是单独下载的工具箱,一般情况下仅需要把新的工具箱解压到某个目录。
2 在matlab的file下面的set path把它加上。
3 把路径加进去后在file→Preferences→General的Toolbox Path Caching里点击update Toolbox Path Cache更新一下。
4 用which newtoolbox_command.m来检验是否可以访问。
如果能够显示新设置的路径,则表明该工具箱可以使用了。
把你的工具箱文件夹放到安装目录中“toolbox”文件夹中,然后单击“file”菜单中的“setpath”命令,打开“setpath”对话框,单击左边的“ADDFolder”命令,然后选择你的那个文件夹,最后单击“SAVE”命令就OK了。
MATLAB Toolboxes============================================/zsmcode.htmlBinaural-modeling software for MATLAB/Windows/home/Michael_Akeroyd/download2.htmlStatistical Parametric Mapping (SPM)/spm/ext/BOOTSTRAP MATLAB TOOLBOX.au/downloads/bootstrap_toolbox.htmlThe DSS package for MATLABDSS Matlab package contains algorithms for performing linear, deflation and symmetric DSS. http://www.cis.hut.fi/projects/dss/package/Psychtoolbox/download.htmlMultisurface Method Tree with MATLAB/~olvi/uwmp/msmt.htmlA Matlab Toolbox for every single topic !/~baum/toolboxes.htmleg. BrainStorm - MEG and EEG data visualization and processingCLAWPACK is a software package designed to compute numerical solutions to hyperbolic partial differential equations using a wave propagation approach/~claw/DIPimage - Image Processing ToolboxPRTools - Pattern Recognition Toolbox (+ Neural Networks)NetLab - Neural Network ToolboxFSTB - Fuzzy Systems ToolboxFusetool - Image Fusion Toolboxhttp://www.metapix.de/toolbox.htmWAVEKIT - Wavelet ToolboxGat - Genetic Algorithm ToolboxTSTOOL is a MATLAB software package for nonlinear time series analysis.TSTOOL can be used for computing: Time-delay reconstruction, Lyapunov exponents, Fractal dimensions, Mutual information, Surrogate data tests, Nearest neighbor statistics, Return times, Poincare sections, Nonlinear predictionhttp://www.physik3.gwdg.de/tstool/MATLAB / Data description toolboxA Matlab toolbox for data description, outlier and novelty detectionMarch 26, 2004 - D.M.J. Taxhttp://www-ict.ewi.tudelft.nl/~davidt/dd_tools/dd_manual.htmlMBEhttp://www.pmarneffei.hku.hk/mbetoolbox/Betabolic network toolbox for Matlabhttp://www.molgen.mpg.de/~lieberme/pages/network_matlab.htmlPharmacokinetics toolbox for Matlabhttp://page.inf.fu-berlin.de/~lieber/seiten/pbpk_toolbox.htmlThe SpiderThe spider is intended to be a complete object orientated environment for machine learning in Matlab. Aside from easy use of base learning algorithms, algorithms can be plugged together and can be compared with, e.g model selection, statistical tests and visual plots. This gives all the power of objects (reusability, plug together, share code) but also all the power of Matlab for machine learning research.http://www.kyb.tuebingen.mpg.de/bs/people/spider/index.htmlSchwarz-Christoffel Toolbox/matlabcentral/fileexchange/loadFile.do?objectId=1316&objectT ype=file#XML Toolbox/matlabcentral/fileexchange/loadFile.do?objectId=4278&object Type=fileFIR/TDNN Toolbox for MATLABBeta version of a toolbox for FIR (Finite Impulse Response) and TD (Time Delay) NeuralNetworks./interval-comp/dagstuhl.03/oish.pdfMisc.http://www.dcsc.tudelft.nl/Research/Software/index.htmlAstronomySaturn and Titan trajectories ... MALTAB astronomy/~abrecht/Matlab-codes/AudioMA Toolbox for Matlab Implementing Similarity Measures for Audiohttp://www.oefai.at/~elias/ma/index.htmlMAD - Matlab Auditory Demonstrations/~martin/MAD/docs/mad.htmMusic Analysis - Toolbox for Matlab : Feature Extraction from Raw Audio Signals for Content-Based Music Retrihttp://www.ai.univie.ac.at/~elias/ma/WarpTB - Matlab Toolbox for Warped DSPBy Aki Härmä and Matti Karjalainenhttp://www.acoustics.hut.fi/software/warp/MATLAB-related Softwarehttp://www.dpmi.tu-graz.ac.at/~schloegl/matlab/Biomedical Signal data formats (EEG machine specific file formats with Matlab import routines)http://www.dpmi.tu-graz.ac.at/~schloegl/matlab/eeg/MPEG Encoding library for MATLAB Movies (Created by David Foti)It enables MATLAB users to read (MPGREAD) or write (MPGWRITE) MPEG movies. That should help Video Quality project.Filter Design packagehttp://www.ee.ryerson.ca:8080/~mzeytin/dfp/index.htmlOctave by Christophe COUVREUR (Generates normalized A-weigthing, C-weighting, octave and one-third-octave digital filters)/matlabcentral/fileexchange/loadFile.do?objectType=file&object Id=69Source Coding MATLAB Toolbox/users/kieffer/programs.htmlBio Medical Informatics (Top)CGH-Plotter: MATLAB Toolbox for CGH-data AnalysisCode: http://sigwww.cs.tut.fi/TICSP/CGH-Plotter/Poster: http://sigwww.cs.tut.fi/TICSP/CSB2003/Posteri_CGH_Plotter.pdfThe Brain Imaging Software Toolboxhttp://www.bic.mni.mcgill.ca/software/MRI Brain Segmentation/matlabcentral/fileexchange/loadFile.do?objectId=4879Chemometrics (providing PCA) (Top)Matlab Molecular Biology & Evolution Toolbox(Toolbox Enables Evolutionary Biologists to Analyze and View DNA and Protein Sequences) James J. Caihttp://www.pmarneffei.hku.hk/mbetoolbox/Toolbox provided by Prof. Massart research grouphttp://minf.vub.ac.be/~fabi/publiek/Useful collection of routines from Prof age smilde research grouphttp://www-its.chem.uva.nl/research/pacMultivariate Toolbox written by Rune Mathisen/~mvartools/index.htmlMatlab code and datasetshttp://www.acc.umu.se/~tnkjtg/chemometrics/dataset.htmlChaos (Top)Chaotic Systems Toolbox/matlabcentral/fileexchange/loadFile.do?objectId=1597&objectT ype=file#HOSA Toolboxhttp://www.mathworks.nl/matlabcentral/fileexchange/loadFile.do?objectId=3013&objectTy pe=fileChemistry (Top)MetMAP - (Metabolical Modeling, Analysis and oPtimization alias Met. M. A. P.)http://webpages.ull.es/users/sympbst/pag_ing/pag_metmap/index.htmDoseLab - A set of software programs for quantitative comparison of measured and computed radiation dose distributions/GenBank Overview/Genbank/GenbankOverview.htmlMatlab: /matlabcentral/fileexchange/loadFile.do?objectId=1139CodingCode for the estimation of Scaling Exponentshttp://www.cubinlab.ee.mu.oz.au/~darryl/secondorder_code.htmlControl (Top)Control Tutorial for Matlab/group/ctm/AnotherCommunications (Top)Channel Learning Architecture toolbox(This Matlab toolbox is a supplement to the article "HiperLearn: A High Performance Learning Architecture")http://www.isy.liu.se/cvl/Projects/hiperlearn/Source Coding MATLAB Toolbox/users/kieffer/programs.htmlTCP/UDP/IP Toolbox 2.0.4/matlabcentral/fileexchange/loadFile.do?objectId=345&objectT ype=fileHome Networking Basis: Transmission Environments and Wired/Wireless Protocols Walter Y. Chen/support/books/book5295.jsp?category=new&language=-1MATLAB M-files and Simulink models/matlabcentral/fileexchange/loadFile.do?objectId=3834&object Type=file•OPNML/MATLAB Facilities/OPNML_Matlab/Mesh Generation/home/vavasis/qmg-home.htmlOpenFEM : An Open-Source Finite Element Toolbox/CALFEM is an interactive computer program for teaching the finite element method (FEM)http://www.byggmek.lth.se/Calfem/frinfo.htmThe Engineering Vibration Toolbox/people/faculty/jslater/vtoolbox/vtoolbox.htmlSaGA - Spatial and Geometric Analysis Toolboxby Kirill K. Pankratov/~glenn/kirill/saga.htmlMexCDF and NetCDF Toolbox For Matlab-5&6/staffpages/cdenham/public_html/MexCDF/nc4ml5.htmlCUEDSID: Cambridge University System Identification Toolbox/jmm/cuedsid/Kriging Toolbox/software/Geostats_software/MATLAB_KRIGING_TOOLBOX.htmMonte Carlo (Dr Nando)http://www.cs.ubc.ca/~nando/software.htmlRIOTS - The Most Powerful Optimal Control Problem Solver/~adam/RIOTS/ExcelMATLAB xlsheets/matlabcentral/fileexchange/loadFile.do?objectId=4474&objectTy pe=filewrite2excel/matlabcentral/fileexchange/loadFile.do?objectId=4414&objectTy pe=fileFinite Element Modeling (FEM) (Top)OpenFEM - An Open-Source Finite Element Toolbox/NLFET - nonlinear finite element toolbox for MATLAB ( framework for setting up, solving, and interpreting results for nonlinear static and dynamic finite element analysis.)/GetFEM - C++ library for finite element methods elementary computations with a Matlabinterfacehttp://www.gmm.insa-tlse.fr/getfem/FELIPE - FEA package to view results ( contains neat interface to MATLA/~blstmbr/felipe/Finance (Top)A NEW MATLAB-BASED TOOLBOX FOR COMPUTER AIDED DYNAMIC TECHNICAL TRADINGStephanos Papadamou and George StephanidesDepartment of Applied Informatics, University Of Macedonia Economic & Social Sciences, Thessaloniki, Greece/fen31/one_time_articles/dynamic_tech_trade_matlab6.htm Paper: :8089/eps/prog/papers/0201/0201001.pdfCompEcon Toolbox for Matlab/~pfackler/compecon/toolbox.htmlGenetic Algorithms (Top)The Genetic Algorithm Optimization Toolbox (GAOT) for Matlab 5/mirage/GAToolBox/gaot/Genetic Algorithm ToolboxWritten & distributed by Andy Chipperfield (Sheffield University, UK)/uni/projects/gaipp/gatbx.htmlManual: /~gaipp/ga-toolbox/manual.pdfGenetic and Evolutionary Algorithm Toolbox (GEATbx)/Evolutionary Algorithms for MATLAB/links/ea_matlab.htmlGenetic/Evolutionary Algorithms for MATLABhttp://www.systemtechnik.tu-ilmenau.de/~pohlheim/EA_Matlab/ea_matlab.html GraphicsVideoToolbox (C routines for visual psychophysics on Macs by Denis Pelli)/VideoToolbox/Paper: /pelli/pubs/pelli1997videotoolbox.pdf4D toolbox/~daniel/links/matlab/4DToolbox.htmlImages (Top)Eyelink Toolbox/eyelinktoolbox/Paper: /eyelinktoolbox/EyelinkToolbox.pdfCellStats: Automated statistical analysis of color-stained cell images in Matlabhttp://sigwww.cs.tut.fi/TICSP/CellStats/SDC Morphology Toolbox for MATLAB (powerful collection of latest state-of-the-art gray-scale morphological tools that can be applied to image segmentation, non-linear filtering, pattern recognition and image analysis)/Image Acquisition Toolbox/products/imaq/Halftoning Toolbox for MATLAB/~bevans/projects/halftoning/toolbox/index.htmlDIPimage - A Scientific Image Processing Toolbox for MATLABhttp://www.ph.tn.tudelft.nl/DIPlib/dipimage_1.htmlPNM Toolboxhttp://home.online.no/~pjacklam/matlab/software/pnm/index.htmlAnotherICA / KICA and KPCA (Top)ICA TU Toolboxhttp://mole.imm.dtu.dk/toolbox/menu.htmlMISEP Linear and Nonlinear ICA Toolboxhttp://neural.inesc-id.pt/~lba/ica/mitoolbox.htmlKernel Independant Component Analysis/~fbach/kernel-ica/index.htmMatlab: kernel-ica version 1.2KPCA- Please check the software section of kernel machines.KernelStatistical Pattern Recognition Toolboxhttp://cmp.felk.cvut.cz/~xfrancv/stprtool/MATLABArsenal A MATLAB Wrapper for Classification/tmp/MATLABArsenal.htmMarkov (Top)MapHMMBOX 1.1 - Matlab toolbox for Hidden Markov Modelling using Max. Aposteriori EM Prerequisites: Matlab 5.0, Netlab. Last Updated: 18 March 2002./~parg/software/maphmmbox_1_1.tarHMMBOX 4.1 - Matlab toolbox for Hidden Markov Modelling using Variational Bayes Prerequisites: Matlab 5.0,Netlab. Last Updated: 15 February 2002../~parg/software/hmmbox_3_2.tar/~parg/software/hmmbox_4_1.tarMarkov Decision Process (MDP) Toolbox for MatlabKevin Murphy, 1999/~murphyk/Software/MDP/MDP.zipMarkov Decision Process (MDP) Toolbox v1.0 for MATLABhttp://www.inra.fr/bia/T/MDPtoolbox/Hidden Markov Model (HMM) Toolbox for Matlab/~murphyk/Software/HMM/hmm.htmlBayes Net Toolbox for Matlab/~murphyk/Software/BNT/bnt.htmlMedical (Top)EEGLAB Open Source Matlab Toolbox for Physiological Research (formerly ICA/EEG Matlabtoolbox)/~scott/ica.htmlMATLAB Biomedical Signal Processing Toolbox/Toolbox/Powerful package for neurophysiological data analysis ( Igor Kagan webpage)/Matlab/Unitret.htmlEEG / MRI Matlab Toolbox/Microarray data analysis toolbox (MDAT): for normalization, adjustment and analysis of gene expression_r data.Knowlton N, Dozmorov IM, Centola M. Department of Arthritis and Immunology, Oklahoma Medical Research Foundation, Oklahoma City, OK, USA 73104. We introduce a novel Matlab toolbox for microarray data analysis. This toolbox uses normalization based upon a normally distributed background and differential gene expression_r based on 5 statistical measures. The objects in this toolbox are open source and can be implemented to suit your application. AVAILABILITY: MDAT v1.0 is a Matlab toolbox and requires Matlab to run. MDAT is freely available at:/publications/2004/knowlton/MDAT.zipMIDI (Top)MIDI Toolbox version 1.0 (GNU General Public License)http://www.jyu.fi/musica/miditoolbox/Misc. (Top)MATLAB-The Graphing Tool/~abrecht/matlab.html3-D Circuits The Circuit Animation Toolbox for MATLAB/other/3Dcircuits/SendMailhttp://carol.wins.uva.nl/~portegie/matlab/sendmail/Coolplothttp://www.reimeika.ca/marco/matlab/coolplots.htmlMPI (Matlab Parallel Interface)Cornell Multitask Toolbox for MATLAB/Services/Software/CMTM/Beolab Toolbox for v6.5Thomas Abrahamsson (Professor, Chalmers University of Technology, Applied Mechanics,Göteborg, Sweden)http://www.mathworks.nl/matlabcentral/fileexchange/loadFile.do?objectId=1216&objectType =filePARMATLABNeural Networks (Top)SOM Toolboxhttp://www.cis.hut.fi/projects/somtoolbox/Bayes Net Toolbox for Matlab/~murphyk/Software/BNT/bnt.htmlNetLab/netlab/Random Neural Networks/~ahossam/rnnsimv2/ftp: ftp:///pub/contrib/v5/nnet/rnnsimv2/NNSYSID Toolbox (tools for neural network based identification of nonlinear dynamic systems) http://www.iau.dtu.dk/research/control/nnsysid.htmlOceanography (Top)WAFO. Wave Analysis for Fatigue and Oceanographyhttp://www.maths.lth.se/matstat/wafo/ADCP toolbox for MATLAB (USGS, USA)Presented at the Hydroacoustics Workshop in Tampa and at ADCP's in Action in San Diego /operations/stg/pubs/ADCPtoolsSEA-MAT - Matlab Tools for Oceanographic AnalysisA collaborative effort to organize and distribute Matlab tools for the Oceanographic Community /Ocean Toolboxhttp://www.mar.dfo-mpo.gc.ca/science/ocean/epsonde/programming.htmlEUGENE D. GALLAGHER(Associate Professor, Environmental, Coastal & Ocean Sciences)/edgwebp.htmOptimization (Top)MODCONS - a MATLAB Toolbox for Multi-Objective Control System Design/mecheng/jfw/modcons.htmlLazy Learning Packagehttp://iridia.ulb.ac.be/~lazy/SDPT3 version 3.02 -- a MATLAB software for semidefinite-quadratic-linear programming .sg/~mattohkc/sdpt3.htmlMinimum Enclosing Balls: Matlab Code/meb/SOSTOOLS Sum of Squares Optimi zation Toolbox for MATLAB User’s guide/sostools/sostools.pdfPSOt - a Particle Swarm Optimization Toolbox for use with MatlabBy Brian Birge ... A Particle Swarm Optimization Toolbox (PSOt) for use with the Matlab scientific programming environment has been developed. PSO isintroduced briefly and then the use of the toolbox is explained with some examples. A link to downloadable code is provided.Plot/software/plotting/gbplot/Signal Processing (Top)Filter Design with Motorola DSP56Khttp://www.ee.ryerson.ca:8080/~mzeytin/dfp/index.htmlChange Detection and Adaptive Filtering Toolboxhttp://www.sigmoid.se/Signal Processing Toolbox/products/signal/ICA TU Toolboxhttp://mole.imm.dtu.dk/toolbox/menu.htmlTime-Frequency Toolbox for Matlabhttp://crttsn.univ-nantes.fr/~auger/tftb.htmlVoiceBox - Speech Processing Toolbox/hp/staff/dmb/voicebox/voicebox.htmlLeast Squared - Support Vector Machines (LS-SVM)http://www.esat.kuleuven.ac.be/sista/lssvmlab/WaveLab802 : the Wavelet ToolboxBy David Donoho, Mark Reynold Duncan, Xiaoming Huo, Ofer Levi /~wavelab/Time-series Matlab scriptshttp://wise-obs.tau.ac.il/~eran/MATLAB/TimeseriesCon.htmlUvi_Wave Wavelet Toolbox Home Pagehttp://www.gts.tsc.uvigo.es/~wavelets/index.htmlAnotherSupport Vector Machine (Top)MATLAB Support Vector Machine ToolboxDr Gavin CawleySchool of Information Systems, University of East Anglia/~gcc/svm/toolbox/LS-SVM - SISTASVM toolboxes/dmi/svm/LSVM Lagrangian Support Vector Machine/dmi/lsvm/Statistics (Top)Logistic regression/SAGA/software/saga/Multi-Parametric Toolbox (MPT) A tool (not only) for multi-parametric optimization. http://control.ee.ethz.ch/~mpt/ARfit: A Matlab package for the estimation of parameters and eigenmodes of multivariate autoregressive modelshttp://www.mat.univie.ac.at/~neum/software/arfit/The Dimensional Analysis Toolbox for MATLABHome: http://www.sbrs.de/Paper: http://www.isd.uni-stuttgart.de/~brueckner/Papers/similarity2002.pdfFATHOM for Matlab/personal/djones/PLS-toolbox/Multivariate analysis toolbox (N-way Toolbox - paper)http://www.models.kvl.dk/source/nwaytoolbox/index.aspClassification Toolbox for Matlabhttp://tiger.technion.ac.il/~eladyt/classification/index.htmMatlab toolbox for Robust Calibrationhttp://www.wis.kuleuven.ac.be/stat/robust/toolbox.htmlStatistical Parametric Mapping/spm/spm2.htmlEVIM: A Software Package for Extreme Value Analysis in Matlabby Ramazan Gençay, Faruk Selcuk and Abdurrahman Ulugulyagci, 2001.Manual (pdf file) evim.pdf - Software (zip file) evim.zipTime Series Analysishttp://www.dpmi.tu-graz.ac.at/~schloegl/matlab/tsa/Bayes Net Toolbox for MatlabWritten by Kevin Murphy/~murphyk/Software/BNT/bnt.htmlOther: /information/toolboxes.htmlARfit: A Matlab package for the estimation of parameters and eigenmodes of multivariate autoregressive models/~tapio/arfit/M-Fithttp://www.ill.fr/tas/matlab/doc/mfit4/mfit.htmlDimensional Analysis Toolbox for Matlab/The NaN-toolbox: A statistic-toolbox for Octave and Matlab®... handles data with and without MISSING VALUES.http://www-dpmi.tu-graz.ac.at/~schloegl/matlab/NaN/Iterative Methods for Optimization: Matlab Codes/~ctk/matlab_darts.htmlMultiscale Shape Analysis (MSA) Matlab Toolbox 2000p.br/~cesar/projects/multiscale/Multivariate Ecological & Oceanographic Data Analysis (FATHOM)From David Jones/personal/djones/glmlab (Generalized Linear Models in MATLA.au/staff/dunn/glmlab/glmlab.htmlSpacial and Geometric Analysis (SaGA) toolboxInteresting audio links with FAQ, VC++, on the topic机器学习网站北京大学视觉与听觉信息处理实验室北京邮电大学模式识别与智能系统学科复旦大学智能信息处理开放实验室IEEE Computer Society北京映象站点计算机科学论坛机器人足球赛模式识别国家重点实验室南京航空航天大学模式识别与神经计算实验室- PARNEC南京大学机器学习与数据挖掘研究所- LAMDA南京大学人工智能实验室南京大学软件新技术国家重点实验室人工生命之园数据挖掘研究院微软亚洲研究院中国科技大学人工智能中心中科院计算所中科院计算所生物信息学实验室中科院软件所中科院自动化所中科院自动化所人工智能实验室ACL Special Interest Group on Natural Language Learning (SIGNLL)ACMACM Digital LibraryACM SIGARTACM SIGIRACM SIGKDDACM SIGMODAdaptive Computation Group at University of New MexicoAI at Johns HopkinsAI BibliographiesAI Topics: A dynamic online library of introductory information about artificial intelligence Ant Colony OptimizationARIES Laboratory: Advanced Research in Intelligent Educational SystemsArtificial Intelligence Research in Environmental Sciences (AIRIES)Austrian Research Institute for AI (OFAI)Back Issues of Neuron DigestBibFinder: a computer science bibliography search engine integrating many other engines BioAPI ConsortiumBiological and Computational Learning Center at MITBiometrics ConsortiumBoosting siteBrain-Style Information Systems Research Group at RIKEN Brain Science Institute, Japan British Computer Society Specialist Group on Expert SystemsCanadian Society for Computational Studies of Intelligence (CSCSI)CI Collection of BibTex DatabasesCITE, the first-stop source for computational intelligence information and services on the web Classification Society of North AmericaCMU Advanced Multimedia Processing GroupCMU Web->KB ProjectCognitive and Neural Systems Department of Boston UniversityCognitive Sciences Eprint Archive (CogPrints)COLT: Computational Learning TheoryComputational Neural Engineering Laboratory at the University of FloridaComputational Neurobiology Lab at California, USAComputer Science Department of National University of SingaporeData Mining Server Online held by Rudjer Boskovic InstituteDatabase Group at Simon Frazer University, CanadaDBLP: Computer Science BibliographyDigital Biology: about creating artificial lifeDistributed AI Unit at Queen Mary & Westfield College, University of LondonDistributed Artificial Intelligence at HUJIDSI Neural Networks group at the Université di Firenze, ItalyEA-related literature at the EvALife research group at DAIMI, University of Aarhus, Denmark Electronic Research Group at Aberdeen UniversityElsevierComputerScienceEuropean Coordinating Committee for Artificial Intelligence (ECCAI)European Network of Excellence in ML (MLnet)European Neural Network Society (ENNS)Evolutionary Computing Group at University of the West of EnglandEvolutionary Multi-Objective Optimization RepositoryExplanation-Based Learning at University of Illinoise at Urbana-ChampaignFace Detection HomepageFace Recognition Vendor TestFace Recognition HomepageFace Recognition Research CommunityFingerpassftp of Jude Shavlik's Machine Learning Group (University of Wisconsin-Madison)GA-List Searchable DatabaseGenetic Algorithms Digest ArchiveGenetic Programming BibliographyGesture Recognition HomepageHCI Bibliography Project contain extended bibliographic information (abstract, key words, table of contents, section headings) for most publications Human-Computer Interaction dating back to 1980 and selected publications before 1980IBM ResearchIEEEIEEE Computer SocietyIEEE Neural Networks SocietyIllinois Genetic Algorithms Laboratory (IlliGAL)ILP Network of ExcellenceInductive Learning at University of Illinoise at Urbana-ChampaignIntelligent Agents RepositoryIntellimedia Project at North Carolina State UniversityInteractive Artificial Intelligence ResourcesInternational Association of Pattern RecognitionInternational Biometric Industry AssociationInternational Joint Conference on Artificial Intelligence (IJCAI)International Machine Learning Society (IMLS)International Neural Network Society (INNS)Internet Softbot Research at University of WashingtonJapanese Neural Network Society (JNNS)Java Agents for Meta-Learning Group (JAM) at Computer Science Department, Columbia University, for Fraud and Intrusion Detection Using Meta-Learning AgentsKernel MachinesKnowledge Discovery MineLaboratory for Natural and Simulated Cognition at McGill University, CanadaLearning Laboratory at Carnegie Mellon UniversityLearning Robots Laboratory at Carnegie Mellon UniversityLaboratoire d'Informatique et d'Intelligence Artificielle (IIA-ENSAIS)Machine Learning Group of Sydney University, AustraliaMammographic Image Analysis SocietyMDL Research on the WebMirek's Cellebration: 1D and 2D Cellular Automata explorerMIT Artificial Intelligence LaboratoryMIT Media LaboratoryMIT Media Laboratory Vision and Modeling GroupMLNET: a European network of excellence in Machine Learning, Case-based Reasoning and Knowledge AcquisitionMLnet Machine Learning Archive at GMD includes papers, software, and data sets MIRALab at University of Geneva: leading research on virtual human simulationNeural Adaptive Control Technology (NACT)Neural Computing Research Group at Aston University, UKNeural Information Processing Group at Technical University of BerlinNIPSNIPS OnlineNeural Network Benchmarks, Technical Reports,and Source Code maintained by Scott Fahlman at CMU; source code includes Quickprop, Cascade-Correlation, Aspirin/Migraines Neural Networks FAQ by Lutz PrecheltNeural Networks FAQ by Warren S. SarleNeural Networks: Freeware and Shareware ToolsNeural Network Group at Department of Medical Physics and Biophysics, University ofNeural Network Group at Université Catholique de LouvainNeural Network Group at Eindhoven University of TechnologyNeural Network Hyperplane Animator program that allows easy visualization of training data and weights in a back-propagation neural networkNeural Networks Research at TUT/ELENeural Networks Research Centre at Helsinki University of Technology, FinlandNeural Network Speech Group at Carnegie Mellon UniversityNeural Text Classification with Neural NetworksNonlinearity and Complexity HomepageOFAI and IMKAI library information system, provided by the Department of Medical Cybernetics and Artificial Intelligence at the University of Vienna (IMKAI) and the Austrian Research Institute for Artificial Intelligence (OFAI). It contains over 36,000 items (books, research papers, conference papers, journal articles) from many subareas of AI OntoWeb: Ontology-based information exchange for knowledge management and electronic commercePortal on Neural Network ForecastingPRAG: Pattern Recognition and Application Group at University of CagliariQuest Project at IBM Almaden Research Center: an academic website focusing on classification and regression trees. Maintained by Tjen-Sien LimReinforcement Learning at Carnegie Mellon UniversityResearchIndex: NECI Scientific Literature Digital Library, indexing over 200,000 computer science articlesReVision: Reviewing Vision in the Web!RIKEN: The Institute of Physical and Chemical Research, JapanSalford SystemsSANS Studies of Artificial Neural Systems, at the Royal Institute of Technology, Sweden Santa-Fe InstituteScirus: a search engine locating scientific information on the InternetSecond Moment: The News and Business Resource for Applied AnalyticsSEL-HPC Article Archive has sections for neural networks, distributed AI, theorem proving, and a variety of other computer science topicsSOAR Project at University of Southern CaliforniaSociety for AI and StatisticsSVM of ANU CanberraSVM of Bell LabsSVM of GMD-First BerlinSVM of MITSVM of Royal Holloway CollegeSVM of University of SouthamptonSVM-workshop at NIPS97TechOnLine: TechOnLine University offers free online courses and lecturesUCI Machine Learning GroupUMASS Distributed Artificial Intelligence LaboratoryUTCS Neural Networks Research Group of Artificial Intelligence Lab, Computer Science Department, University of Texas at AustinVivisimo Document Clustering: a powerful search engine which returns clustered results Worcester Polytechnic Institute Artificial Intelligence Research Group (AIRG)Xerion neural network simulator developed and used by the connectionist group at the University of TorontoYale's CTAN Advanced Technology Center for Theoretical and Applied Neuroscience ZooLand: Artificial Life Resource。
Package‘GenAlgo’October12,2022Version2.2.0Date2020-10-13Title Classes and Methods to Use Genetic Algorithms for FeatureSelectionAuthor Kevin R.CoombesMaintainer Kevin R.Coombes<******************>Depends R(>=3.0)Imports methods,stats,MASS,oompaBase(>=3.0.1),ClassDiscoverySuggests Biobase,xtableDescription Defines classes and methods that can be usedto implement genetic algorithms for feature selection.The idea isthat we want to select afixed number of features to combine into alinear classifier that can predict a binary outcome,and can use agenetic algorithm heuristically to select an optimal set of features.License Apache License(==2.0)LazyLoad yesbiocViews Microarray,ClusteringURL /NeedsCompilation noRepository CRANDate/Publication2020-10-1517:40:03UTCR topics documented:gaTourResults (2)GenAlg (2)GenAlg-class (4)GenAlg-tools (6)maha (7)tourData09 (9)Index101gaTourResults Results of a Genetic AlgorithmDescriptionWe ran a genetic algorithm tofind the optimal’fantasy’team for the competition run by the Versus broadcasting network for the2009Tour de France.In order to make the vignette run in a timely fashion,we saved the results in this data object.Usagedata(gaTourResults)FormatThere are four objects in the datafile.Thefirst is recurse,which is an object of the GenAlg-class representing thefinal generation.The other three objects are all numeric vector of length1100: diversity contains the average population diversity at each generation,fitter contains the max-imumfitness,and meanfit contains the meanfitness.SourceKevin R.CoombesGenAlg A generic Genetic Algorithm for feature selectionDescriptionThese functions allow you to initialize(GenAlg)and iterate(newGeneration)a genetic algorithm to perform feature selection for binary class prediction in the context of gene expression microarrays or other high-throughput technologies.UsageGenAlg(data,fitfun,mutfun,context,pm=0.001,pc=0.5,gen=1)newGeneration(ga)popDiversity(ga)Argumentsdata The initial population of potential solutions,in the form of a data matrix with one individual per row.fitfun A function to compute thefitness of an individual solution.Must take two input arguments:a vector of indices into rows of the population matrix,and a contextlist within which any other items required by the function can be resolved.Mustreturn a real number;higher values indicate betterfitness,with the maximumfitness occurring at the optimal solution to the underlying numerical problem.mutfun A function to mutate individual alleles in the population.Must take two argu-ments:the starting allele and a context list as in thefitness function.context A list of additional data required to perform mutation or to computefitness.This list is passed along as the second argument when fitfun and mutfun are called.pm A real value between0and1,representing the probability that an individual allele will be mutated.pc A real value between0and1,representing the probability that crossover will occur during reproduction.gen An integer identifying the current generation.ga An object of class GenAlgValueBoth the GenAlg generator and the newGeneration functions return a GenAlg-class object.The popDiversity function returns a real number representing the average diversity of the population.Here diversity is defined by the number of alleles(selected features)that differ in two individuals. Author(s)Kevin R.Coombes<******************>,P.Roebuck<***********************>See AlsoGenAlg-class,GenAlg-tools,maha.Examples#generate some fake datanFeatures<-1000nSamples<-50fakeData<-matrix(rnorm(nFeatures*nSamples),nrow=nFeatures,ncol=nSamples)fakeGroups<-sample(c(0,1),nSamples,replace=TRUE)myContext<-list(dataset=fakeData,gps=fakeGroups)#initialize populationn.individuals<-200n.features<-9y<-matrix(0,n.individuals,n.features)for(i in1:n.individuals){y[i,]<-sample(1:nrow(fakeData),n.features)}#set up the genetic algorithmmy.ga<-GenAlg(y,selectionFitness,selectionMutate,myContext,0.001,0.75)#advance one generationmy.ga<-newGeneration(my.ga)GenAlg-class Class"GenAlg"DescriptionObjects of the GenAlg class represent one step(population)in the evolution of a genetic algorithm.This algorithm has been customized to perform feature selection for the class prediction problem.Usage##S4method for signature GenAlgas.data.frame(x,s=NULL,optional=FALSE,...)##S4method for signature GenAlgas.matrix(x,...)##S4method for signature GenAlgsummary(object,...)Argumentsobject object of class GenAlgx object of class GenAlgs character vector giving the row names for the data frame,or NULLoptional logical scalar.If TRUE,setting row names and converting column names to syn-tactic names is optional....extra arguments for generic routinesObjects from the ClassObjects should be created by calls to the GenAlg generator;they will also be created automatically as a result of applying the function newGeneration to an existing GenAlg object.Slotsdata:The initial population of potential solutions,in the form of a data matrix with one individual per row.fitfun:A function to compute thefitness of an individual solution.Must take two input argu-ments:a vector of indices into the rows of the population matrix,and a context list within which any other items required by the function can be resolved.Must return a real num-ber;higher values indicate betterfitness,with the maximumfitness occurring at the optimal solution to the underlying numerical problem.mutfun:A function to mutate individual alleles in the population.Must take two arguments:the starting allele and a context list as in thefitness function.p.mutation:numeric scalar between0and1,representing the probability that an individual allele will be mutated.p.crossover:numeric scalar between0and1,representing the probability that crossover will occur during reproduction.generation:integer scalar identifying the current generation.fitness:numeric vector containing thefitness of all individuals in the population.best.fit:A numeric value;the maximumfitness.best.individual:A matrix(often with one row)containing the individual(s)achieving the max-imumfitness.context:A list of additional data required to perform mutation or to computefitness.This list is passed along as the second argument when fitfun and mutfun are called.Methodsas.data.frame signature(x="GenAlg"):Converts the GenAlg object into a data frame.The first column contains thefitness;remaining columns contain three selected features,given as integer indices into the rows of the original data matrix.as.matrix signature(x="GenAlg"):Converts the GenAlg object into a matrix,following the conventions of as.data.frame.summary signature(object="GenAlg"):Print a summary of the GenAlg object.Author(s)Kevin R.Coombes<******************>,P.Roebuck<***********************>ReferencesDavid Goldberg."Genetic Algorithms in Search,Optimization and Machine Learning."Addison-Wesley,1989.See AlsoGenAlg,GenAlg-tools,maha.ExamplesshowClass("GenAlg")6GenAlg-tools GenAlg-tools Utility functions for selection and mutation in genetic algorithmsDescriptionThese functions implement specific forms of mutation andfitness that can be used in genetic algo-rithms for feature selection.UsagesimpleMutate(allele,context)selectionMutate(allele,context)selectionFitness(arow,context)Argumentsallele In the simpleMutate function,allele is a binary vectorfilled with0’s and 1’s.In the selectionMutate function,allele is an integer(which is silentlyignored;see Details).arow A vector of integer indices identifying the rows(features)to be selected from the context$dataset matrix.context A list or data frame containing auxiliary information that is needed to resolve references from the mutation orfitness code.In both selectionMutate andselectionFitness,context must contain a dataset component that is eithera matrix or a data frame.In selectionFitness,the context must also includea grouping factor(with two levels)called gps.DetailsThese functions represent’callbacks’.They can be used in the function GenAlg,which creates objects.They will then be called repeatedly(for each individual in the population)each time the genetic algorithm is updated to the next generation.The simpleMutate function assumes that chromosomes are binary vectors,so alleles simply take on the value0or1.A mutation of an allele,therefore,flips its state between those two possibilities.The selectionMutate and selectionFitness functions,by contrast,are specialized to perform feature selection assuming afixed number K of features,with a goal of learning how to distinguish between two different groups of samples.We assume that the underlying data consists of a data frame(or matrix),with the rows representing features(such as genes)and the columns representing samples.In addition,there must be a grouping vector(or factor)that assigns all of the sample columns to one of two possible groups.These data are collected into a list,context,containinga dataset matrix and a gps factor.An individual member of the population of potential solutionsis encoded as a length K vector of indices into the rows of the dataset.An individual allele, therefore,is a single index identifying a row of the dataset.When mutating it,we assume that it can be changed into any other possible allele;i.e.,any other row number.To compute thefitness, we use the Mahalanobis distance between the centers of the two groups defined by the gps factor.maha7 ValueBoth selectionMutate and simpleMutate return an integer value;in the simpler case,the value is guaranteed to be a0or1.The selectionFitness function returns a real number.Author(s)Kevin R.Coombes<******************>,P.Roebuck<***********************>See AlsoGenAlg,GenAlg-class,maha.Examples#generate some fake datanFeatures<-1000nSamples<-50fakeData<-matrix(rnorm(nFeatures*nSamples),nrow=nFeatures,ncol=nSamples)fakeGroups<-sample(c(0,1),nSamples,replace=TRUE)myContext<-list(dataset=fakeData,gps=fakeGroups)#initialize populationn.individuals<-200n.features<-9y<-matrix(0,n.individuals,n.features)for(i in1:n.individuals){y[i,]<-sample(1:nrow(fakeData),n.features)}#set up the genetic algorithmmy.ga<-GenAlg(y,selectionFitness,selectionMutate,myContext,0.001,0.75)#advance one generationmy.ga<-newGeneration(my.ga)maha Compute the(squared)Mahalanobis distance between two groups ofvectorsDescriptionThe Mahalanobis distance between two groups of vectorsUsagemaha(data,groups,method="mve")8maha Argumentsdata A matrix with columns representing features(or variables)and rows represent-ing independent samplesgroups A factor or logical vector with length equal to the number of rows(samples)in the data matrixmethod A character string determining the method that should be used to estimate the covariance matrix.The default value of"mve"uses the cov.mve function fromthe MASS package.The other valid option is"var",which uses the var functionfrom the standard stats package.DetailsThe Mahalanobis distance between two groups of vectors is the distance between their centers, computed in the equivalent of a principal component space that accounts for different variances.ValueReturns a numeric vector of length1.Author(s)Kevin R.Coombes<******************>,P.Roebuck<***********************>ReferencesMardia,K.V.and Kent,J.T.and Bibby,J.M.Multivariate Analysis.Academic Press,Reading,MA1979,pp.213–254.See Alsocov.mve,varExamplesnFeatures<-40nSamples<-2*10dataset<-matrix(rnorm(nSamples*nFeatures),ncol=nSamples)groups<-factor(rep(c("A","B"),each=10))maha(dataset,groups)tourData099 tourData09Tour de France2009DescriptionEach row represents the performance of a rider in the2009Tour de France;the name and team of the rider are used as the row names.The four columns are the Cost(to include on a team in the Versus fantasy challenge),Scores(based on dailyfinishing position),JerseyBonus(for any days spent in one of the three main leader jerseys),and Total(the sum of Scores and JerseyBonus). Usagedata(tourData09)FormatA data frame with102rows and4columns.SourceThe data were collected in2009from the web site /tdfgames,which appears to no longer exist.Index∗classesGenAlg-class,4∗classifGenAlg-class,4∗datasetsgaTourResults,2tourData09,9∗multivariatemaha,7∗optimizeGenAlg,2GenAlg-class,4GenAlg-tools,6as.data.frame,GenAlg-method(GenAlg-class),4as.matrix,GenAlg-method(GenAlg-class), 4cov.mve,8diversity(gaTourResults),2fitter(gaTourResults),2 gaTourResults,2GenAlg,2,4–7GenAlg-class,4GenAlg-tools,6maha,3,5,7,7meanfit(gaTourResults),2 newGeneration,4newGeneration(GenAlg),2 popDiversity(GenAlg),2recurse(gaTourResults),2 selectionFitness(GenAlg-tools),6selectionMutate(GenAlg-tools),6simpleMutate(GenAlg-tools),6summary,GenAlg-method(GenAlg-class),4tourData09,9var,810。
基因法+自定义复合分片算法基因法(Genetic Algorithm)是一种启发式搜索算法,受到了自然界进化理论的启发。
它模拟了生物进化的过程,通过逐代演化来搜索问题的最优解。
而自定义复合分片算法则是一种特定的分片算法,用于将问题分解为更小的子问题进行处理。
基因法的基本原理是通过对候选解(个体)进行基因编码,然后通过选择、交叉和变异等操作来产生新的候选解。
这些操作模拟了自然界的选择、交叉和变异过程,以期望找到更优的解。
基因法的优点在于可以处理复杂的问题,并且可以在搜索空间中进行全局搜索。
自定义复合分片算法是一种将问题分解为多个子问题的方法。
它可以根据问题的特点和需求,将问题分解为更小、更简单的子问题,然后通过求解这些子问题来得到原问题的解。
这种分解可以提高问题的求解效率,并且可以利用并行计算的优势。
结合基因法和自定义复合分片算法可以提供一种更强大的问题求解方法。
首先,可以使用基因法来优化自定义复合分片算法中的参数和策略,以获得更好的分片方案。
其次,可以将基因法应用于每个子问题的求解过程中,以进一步优化子问题的解。
这样,整个问题的求解过程可以得到全局最优解。
使用基因法+自定义复合分片算法的优势在于能够处理复杂的问题,并且能够通过自适应的方式进行搜索和优化。
同时,它还可以根据问题的特点进行灵活的分解和求解,以提高求解效率。
然而,这种方法也存在一些挑战,如参数调节、算法设计和计算资源的需求等方面。
总之,基因法+自定义复合分片算法是一种强大的问题求解方法,它结合了基因法的全局搜索和自定义复合分片算法的分解优化能力。
通过合理地设计和应用,可以在多个角度上全面完整地解决各种问题。
Scaling Genetic Algorithms using MapReduce Abhishek Verma†,Xavier Llor`a∗,David E.Goldberg#and Roy H.Campbell†{verma7,xllora,deg,rhc}@†Department of Computer Science∗National Center for Supercomputing Applications(NCSA)#Department of Industrial and Enterprise Systems EngineeringUniversity of Illinois at Urbana-Champaign,IL,US61801Abstract—Genetic algorithms(GAs)are increasingly beingapplied to large scale problems.The traditional MPI-basedparallel GAs require detailed knowledge about machine ar-chitecture.On the other hand,MapReduce is a powerfulabstraction proposed by Google for making scalable and faulttolerant applications.In this paper,we show how geneticalgorithms can be modeled into the MapReduce model.Wedescribe the algorithm design and implementation of GAs onHadoop,an open source implementation of MapReduce.Ourexperiments demonstrate the convergence and scalability up to 105variable problems.Adding more resources would enable us to solve even larger problems without any changes in thealgorithms and implementation since we do not introduce anyperformance bottlenecks.Keywords-Genetic Algorithms,MapReduce,ScalabilityI.I NTRODUCTIONThe growth of the internet has pushed researchers from all disciplines to deal with volumes of information where the only viable path is to utilize data-intensive frameworks[29], [1],[5],[22].Genetic algorithms are increasingly being used for large scale problems like non-linear optimization[7], clustering[6]and job scheduling[24].The inherent parallel nature of evolutionary algorithms makes them optimal can-didates for parallelization[2].Although large bodies of re-search on parallelizing evolutionary computation algorithms are available[2],there has been little work done in exploring the usage of data-intensive computing[19].The main contributions of the paper are as follows:•We demonstrate a transformation of genetic algorithms into the map and reduce primitives•We implement the MapReduce program and demon-strate its scalability to large problem sizes.The organization of the paper is as follows:We introduce the MapReduce model and its execution overview in Section II.Then,we discuss how genetic algorithms can be modeled using the MapReduce model in Section III and report our experiments in Section IV.In Section V,we discuss and compare with the related work andfinally conclude with Section VI.II.M AP R EDUCEInspired by the map and reduce primitives present in functional languages,Google proposed the MapReduce[3] abstraction that enables users to easily develop large-scale distributed applications.The associated implementation par-allelizes large computations easily as each map function in-vocation is independent and uses re-execution as the primary mechanism of fault tolerance.In this model,the computation inputs a set of key/value pairs,and produces a set of output key/value pairs.The user of the MapReduce library expresses the computation as two functions:Map and Reduce.Map,written by the user,takes an input pair and produces a set of intermediate key/value pairs.The MapReduce framework then groups together all intermediate values associated with the same intermediate key I and passes them to the Reduce function.The Reduce function,also written by the user,accepts an intermediate key I and a set of values for that key.It merges together these values to form a possibly smaller set of values.The intermediate values are supplied to the user’s reduce function via an iterator.This allows the model to handle lists of values that are too large tofit in main memory. Conceptually,the map and reduce functions supplied by the user have the following types:map(k1,v1)→list(k2,v2)reduce(k2,list(v2))→list(v3)i.e.,the input keys and values are drawn from a different domain than the output keys and values.Furthermore,the intermediate keys and values are from the same domain as the output keys and values.The Map invocations are distributed across multiple ma-chines by automatically partitioning the input data into a set of M splits.The input splits can be processed in parallel by different machines.Reduce invocations are distributed by partitioning the intermediate key space into R pieces using a partitioning function,which is hash(key)%R according to the default Hadoop configuration(which we later override for our needs).The number of partitions(R)and the2009 Ninth International Conference on Intelligent Systems Design and ApplicationsFigure1.MapReduce Dataflow overview partitioning function are specified by the user.Figure1 shows the high level dataflow of a MapReduce operation. Interested readers may refer to[3]and Hadoop1for other implementation details.An accompanying distributedfile system like GFS[8]makes the data management scalable and fault tolerant.III.M AP R EDUCING GA SIn this section,we start with a simple model of ge-netic algorithms and then transform and implement it using MapReduce along with a discussion of some of the elements that need to be taken into account.We encapsulate each iteration of the GA as a seperate MapReduce job.The client accepts the commandline parameters,creates the population and submits the MapReduce job.A.Genetic AlgorithmsSelecto-recombinative genetic algorithms[10],[11],one of the simplest forms of GAs,mainly rely on the use of selection and recombination.We chose to start with them because they present a minimal set of operators that help us illustrate the creation of a data-intensiveflow counterpart. The basic algorithm that we target to implement as a data-intensiveflow can be summarized as follows:1)Initialize the population with random individuals.2)Evaluate thefitness value of the individuals.3)Select good solutions by using s-wise tournamentselection without replacement[12].4)Create new individuals by recombining the selectedpopulation using uniform crossover2[28].5)Evaluate thefitness value of all offspring.6)Repeat steps3–5until some convergence criteria aremet.12We assume a crossover probability p c=1.0.B.MapEvaluation of thefitness function for the population(Steps 2and5)matches the M AP function,which has to be computed independent of other instances.As shown in the algorithm in Algorithm1,the M AP evaluates thefitness of the given individual.Also,it keeps track of the the best individual andfinally,writes it to a globalfile in the Distributed File System(HDFS).The client,which has initiated the job,reads these values from all the mappers at the end of the MapReduce and checks if the convergence criteria has been satisfied.Algorithm1Map phase of each iteration of the GAM AP(key,value):individual←I NDIVIDUAL R EPRESENTATION(key)fitness←C ALCULATE F ITNESS(individual)E MIT(individual,fitness){Keep track of the current best}iffitness>max thenmax←fitnessmaxInd←individualend ifif all individuals have been processed thenWrite best individual to globalfile in DFSend ifC.PartitionerIf the selection operation in a GA(Step3)is performed locally on each node,spatial constraints are artificially intro-duced and reduces the selection pressure[25]and can lead to increase in the convergence time.Hence,decentralized and distributed selection algorithms[16]are preferred.The only point in the MapReduce model at which there is a global communication is in the shuffle between the Map and Reduce.At the end of the Map phase,the MapReduce frame-work shuffles the key/value pairs to the reducers using the partitioner.The partitioner splits the intermediate key/value pairs among the reducers.The function GET P ARTITION() returns the reducer to which the given(key,value)should be sent to.In the default implementation,it uses H ASH(key) %numReducers so that all the values corresponding to a given key end up at the same reducer which can then apply the R EDUCE function.However,this does not suit the needs of genetic algorithms because of two reasons: Firstly,the H ASH function partitions the namespace of the individuals N into r distinct classes:N0,N1,...,N r−1 where N i={n:H ASH(n)=i}.The individuals within each partition are isolated from all other partitions. Thus,the H ASH P ARTITIONER introduces an artificial spatial constraint based on the lower order bits.Because of this,the convergence of the genetic algorithm may take moreiterations or it may never converge at all.Secondly,as the genetic algorithm progresses,the same(close to optimal)individual begins to dominate the popu-lation.All copies of this individual will be sent to a singlereducer which will get overloaded.Thus,the distributionprogressively becomes more skewed,deviating from theuniform distribution(that would have maximized the usageof parallel processing).Finally,when the GA converges,allthe individuals will be processed by that single reducer.Thus,the parallelism decreases as the GA converges andhence,it will take more iterations.For these reasons,we override the default partitioner byproviding our own partitioner,which shuffles individualsrandomly across the different reducers as shown in Algo-rithm2.Algorithm2Random partitioner for GAint GET P ARTITION(key,value,numReducers):ANDOM NTD.ReduceWe implement Tournament selection without replace-ment[9].A tournament is conducted among S randomlychosen individuals and the winner is selected.This processis repeated population number of times.Since randomlyselecting individuals is equivalent to randomly shufflingall individuals and then processing them sequentially,ourreduce function goes through the individuals sequentially.Initially the individuals are buffered for the last rounds,and when the tournament window is full,S ELECTION A ND-C ROSSOVER is carried out as shown in the Algorithm3.When the crossover window is full,we use the UniformCrossover operator.For our implementation,we set the Sto5and crossover is performed using two consecutivelyselected parents.E.OptimizationsAfter initial experimentation,we noticed that for largerproblem sizes,the serial initialization of the populationtakes a long time.According to Amdahl’s law,the speedupis bounded because of this serial component.Hence,wecreate the initial population in a separate MapReduce phase,in which the M AP generates random individuals and theR EDUCE is the Identity Reducer3.We seed the pseudo-random number generator for each mapper with mapper id·current time.The bits of the variables in the individual are compactly represented in an array of long long intsand we use efficient bit operations for crossover andfitnesscalculations.Due to the inability of expressing loops in3Setting the number of reducers to0in Hadoop removes the extra overhead of shuffling and identity reduction.Algorithm3Reduce phase of each iteration of the GA Initialize processed←0,tournArray[2·tSize],crossArray[cSize]R EDUCE(key,values):while values.hasNext()doindividual←I NDIVIDUAL R EPRESENTATION(key)fitness←values.getValue()if processed<tSize then{Wait for individuals to join in the tournament andput them for the last rounds}tournArray[tSize+processed%tSize]←individual else{Conduct tournament over past window}S ELECTION A ND C ROSSOVER()end ifprocessed←processed+1if all individuals have been processed then{Cleanup for the last tournament windows}for k=1to tSize doS ELECTION A ND C ROSSOVER()processed←processed+1end forend ifend whileS ELECTION A ND C ROSSOVER:crossArray[processed%cSize]←T OURN(tournArray)if(processed-tSize)%cSize=cSize-1thennewIndividuals←C ROSSOVER(crossArray)for individual in newIndividuals doE MIT(individual,dummyFitness)end forend ifthe MapReduce model,each iteration consisting of a Map and Reduce,has to executed till the convergence criteria is satisfied.IV.R ESULTSThe O NE M AX Problem[27](or BitCounting)is a simple problem consisting in maximizing the number of ones of a bitstring.Formally,this problem can be described asfinding an string x={x1,x2,...,x N},with x i∈{0,1},that maximizes the following equation:F( x)=Ni=1x i(1)We implemented this simple problem on Hadoop(0.19)4 and ran it on our416core(52nodes)Hadoop cluster.Each 40 2000400060008000 1000050100150200250300350N u m b e r o f s e t b i t sNumber of Iterations Figure 2.Convergence of GA for 104variable O NE MAX problemnode runs a two dual Intel Quad cores,16GB RAM and 2TB hard disks.The nodes are integrated into a Distributed File System (HDFS)yielding a potential single image storage space of 2·52/3=34.6T B (since the replication factor of HDFS is set to 3).A detailed description of the cluster setup can be found elsewhere 5.Each node can run 5mappers and 3reducers in parallel.Some of the nodes,despite being fully functional,may be slowed down due to disk contention,network traffic,or extreme computation loads.Speculative execution is used to run the jobs assigned to these slow nodes,on idle nodes in parallel.Whichever node finishes first,writes the output and the other speculated jobs are killed.For each experiment,the population for the GA is set to n log n where n is the number of variables.We perform the following experiments:1)Convergence Analysis:In this experiment,we moni-tor the progress in terms of the number of bits set to 1by the GA for a 104variable O NE MAX problem.As shown in Figure 2,the GA converges in 220iterations taking an average of 149seconds per iteration.2)Scalability with constant load per node:In this experiment,we keep the load set to 1,000variables per mapper.As shown in Figure 3,the time per iteration increases initially and then stabilizes around 75seconds.Thus,increasing the problem size as more resources are added does not change the iteration time.Since,each node can run a maximum of 5mappers,the overall map capacity is 5·52(nodes )=260.Hence,around 250mappers,the time per iteration increases due to the lack of resources to accommodate so many mappers.3)Scalability with constant overall load:In this experiment,we keep the problem size fixed to 50,000variables and increase the number of mappers.As shown in Figure 4,the time per iteration decreases52040 60 80 100 120 140 0 50 100 150 200 250 300T i m e p e r i t e r a t i o n (i n s e c o n d s )Number of MappersFigure 3.Scalability of GA with constant load per node for O NE MAXproblem50 100 150 200 250 300 350 400 0 50 100 150 200 250 300T i m e p e r i t e r a t i o n (i n s e c o n d s )Number of MappersFigure 4.Scalability of GA for 50,000variable O NE MAX problem with increasing number of mappers0 50 100 150 200 250 300 350100101102103104105106T i m e p e r i t e r a t i o n (i n s e c o n d s )Number of variablesFigure 5.Scalability of GA for O NE MAX problem with increasing number of variablesas more and more mappers are added.Thus,adding more resources keeping the problem sizefixed de-creases the time per iteration.Again,saturation of the map capacity causes a slight increase in the time per iteration after250mappers.However,the overall speedup gets bounded by Amdahl’s law introduced by Hadoop’s overhead(around10s of seconds to initiate and terminate a MapReduce job).However,as seen in the previous experiment,the MapReduce model is extremely useful to process large problems size,where extremely large populations are required.4)Scalability with increasing the problem size:Here,we utilize the maximum resources and increase the number of variables.As shown in Figure5,our im-plementation scales to n=105variables,keeping the population set to n log n.Adding more nodes would enable us to scale to larger problem sizes.The time per iteration increases sharply as the number of variables is increased to n=105as the population increases super-linearly(n log n),which is more than16million individuals.V.D ISCUSSION OF R ELATED W ORKSeveral different models likefine grained[21],coarse grained[18]and distributed models[17]have been proposed for implementing parallel GAs.Traditionally,Message Pass-ing Interface(MPI)has been used for implementing parallel GAs.However,MPIs do not scale well on commodity clus-ters where failure is the norm,not the exception.Generally, if a node in an MPI cluster fails,the whole program is restarted.In a large cluster,a machine is likely to fail during the execution of a long running program,and hence efficient fault tolerance is necessary.This forces the user to handle failures by using complex checkpointing techniques. MapReduce[3]is a programming model that enables the users to easily develop large-scale distributed applica-tions.Hadoop is an open source implementation of the MapReduce model.Several different implementations of MapReduce have been developed for other architectures like Phoenix[23]for multicores and CGL-MapReduce[4]for streaming applications.To the best of our knowledge,MRPGA[15]is the only attempt at combining MapReduce and GAs.However,they claim that GAs cannot be directly expressed by MapReduce, extend the model to MapReduceReduce and offer their own implementation.We point out several shortcomings: Firstly,the Map function performs thefitness evaluation and the“ReduceReduce”does the local and global selec-tion.However,the bulk of the work-mutation,crossover, evaluation of the convergence criteria and scheduling is carried out by a single co-ordinator.As shown by their results,this approach does not scale above32nodes due to the inherent serial component.Secondly,the“extension”that they propose can readily be implemented within the traditional MapReduce model.The local reduce is equivalent to and can be implemented within a Combiner[3].Finally, in their mapper,reducer andfinal reducer functions,they emit“default key”and1as their values.Thus,they do not use any characteristic of the MapReduce model-the grouping by keys or the shuffling.The Mappers and Reduc-ers might as well be independently executing processes only communicating with the co-ordinator.We take a different approach,trying to hammer the GAs tofit into the MapReduce model,rather than change the MapReduce model itself.We implement GAs in Hadoop, which is increasingly becoming the de-facto standard MapReduce implementation and used in several production environments in the industry.Meandre[20],[19]extends be-yond some limitations of the MapReduce model while main-taining a data-intensive nature.It shows linear scalability of simple GAs and EDAs on multicore architectures.For very large problems(>109variables),other models like compact genetic algorithms(cGA)and Extended cGA(eCGA)have been explored[26].VI.C ONCLUSIONS AND F UTURE W ORKIn this paper,we have mainly addressed the challenge of using the MapReduce model to scale genetic algorithms. We described the algorithm design and implementation of GAs on Hadoop.The convergence and scalability of the im-plementation has been investigated.Adding more resources would enable us to solve even larger problems without any changes in the algorithm implementation. MapReducing more scalable GA models like compact GAs[14]and extended compact GAs[13]will be inves-tigated in future.We also plan to compare the performance with existing MPI-based implementations.General Purpose GPUs are an exciting addition to the heterogenity of clusters. The compute intensive Map phase and the random number generation can be scheduled on the GPUs,which can be performed in parallel with the Reduce on the CPUs.We would also like to demonstrate the importance of scalable GAs in practical applications.A CKNOWLEDGMENTWe would like to thank the anonymous reviewers for their valuable feedback.This research was funded,in part,by NSF IIS Grant#0841765.The views expressed are those of the authors only.R EFERENCES[1]M.D.Beynon,T.Kurc,A.Sussman,and J.Saltz.Designof a framework for data-intensive wide-area applications.In HCW’00:Proceedings of the9th Heterogeneous Computing Workshop,page116,Washington,DC,USA,2000.IEEE Computer Society.[2] E.Cant´u-Paz.Efficient and Accurate Parallel Genetic Algo-rithms.Springer,2000.[3]J.Dean and S.Ghemawat.Mapreduce:Simplified dataprocessing on large mun.ACM,51(1):107–113, 2008.[4]J.Ekanayake,S.Pallickara,and G.Fox.Mapreduce for dataintensive scientific analyses.In ESCIENCE’08:Proceed-ings of the2008Fourth IEEE International Conference on eScience,pages277–284,Washington,DC,USA,2008.IEEE Computer Society.[5]I.Foster.The virtual data grid:A new model and architecturefor data-intensive collaboration.In in the15th International Conference on Scientific and Statistical Database Manage-ment,pages11–,2003.[6]P.Frnti,J.Kivijrvi,T.Kaukoranta,and O.Nevalainen.Ge-netic algorithms for large scale clustering put.J,40:547–554,1997.[7]K.Gallagher and M.Sambridge.Genetic algorithms:apowerful tool for large-scale nonlinear optimization problems.Comput.Geosci.,20(7-8):1229–1236,1994.[8]S.Ghemawat,H.Gobioff,and S.-T.Leung.The googlefilesystem.SIGOPS Oper.Syst.Rev.,37(5):29–43,2003. [9] D.Goldberg,K.Deb,and B.Korb.Messy genetic algorithms:motivation,analysis,andfirst plex Systems,(3):493–530,1989.[10] D.E.Goldberg.Genetic algorithms in search,optimization,and machine learning.Addison-Wesley,Reading,MA,1989.[11] D.E.Goldberg.The Design of Innovation:Lessons fromand for Competent Genetic Algorithms.Kluwer Academic Publishers,Norwell,MA,2002.[12] D. E.Goldberg, B.Korb,and K.Deb.Messy geneticalgorithms:Motivation,analysis,andfirst plex Systems,3(5):493–530,1989.[13]G.Harik.Linkage learning via probabilistic modeling inthe ecga.Technical report,University of Illinois at Urbana-Champaign),1999.[14]G.Harik,F.Lobo,and D.E.Goldberg.The compact geneticalgorithm.Proceedings of the IEEE International Conference on Evolutionary Computation,pages523–528,1998.(Also IlliGAL Report No.97006).[15] C.Jin,C.Vecchiola,and R.Buyya.Mrpga:An extensionof mapreduce for parallelizing genetic algorithms.eScience, 2008.eScience’08.IEEE Fourth International Conference on,pages214–221,2008.[16]K. D.Jong and J.Sarma.On decentralizing selectionalgorithms.In In Proceedings of the Sixth International Conference on Genetic Algorithms,pages17–23.Morgan Kaufmann,1995.[17] D.Lim,Y.-S.Ong,Y.Jin, B.Sendhoff,and B.-S.Lee.Efficient hierarchical parallel genetic algorithms using grid computing.Future put.Syst.,23(4):658–670, 2007.[18]S.-C.Lin,W.F.Punch,and E.D.Goodman.Coarse-grainparallel genetic algorithms:Categorization and new approach.In Proceeedings of the Sixth IEEE Symposium on Parallel and Distributed Processing,pages28–37,1994.[19]X.Llor`a.Data-intensive computing for competent geneticalgorithms:a pilot study using meandre.In GECCO’09: Proceedings of the11th Annual conference on Genetic and evolutionary computation,pages1387–1394,New York,NY, USA,2009.ACM.[20]X.Llor`a,B.´Acs,L.Auvil,B.Capitanu,M.Welge,and D.E.Goldberg.Meandre:Semantic-driven data-intensiveflows in the clouds.In Proceedings of the4th IEEE International Conference on e-Science,pages238–245.IEEE press,2008.[21]T.Maruyama,T.Hirose,and A.Konagaya.Afine-grainedparallel genetic algorithm for distributed parallel systems.In Proceedings of the5th International Conference on Genetic Algorithms,pages184–190,San Francisco,CA,USA,1993.Morgan Kaufmann Publishers Inc.[22] C. A.Mattmann, D.J.Crichton,N.Medvidovic,andS.Hughes.A software architecture-based framework for highly distributed and data intensive scientific applications.In ICSE’06:Proceedings of the28th international conference on Software engineering,pages721–730,New York,NY, USA,2006.ACM.[23]R.Raghuraman,A.Penmetsa,G.Bradski,and C.Kozyrakis.Evaluating mapreduce for multi-core and multiprocessor sys-tems.Proceedings of the2007IEEE13th International Symposium on High Performance Computer Architecture,Jan 2007.[24]N.Sannomiya,H.Iima,K.Ashizawa,and Y.Kobayashi.Application of genetic algorithm to a large-scale scheduling problem for a metal mold assembly process.Proceedings of the38th IEEE Conference on Decision and Control,3:2288–2293,1999.[25] A.J.Sarma,J.Sarma,and K.D.Jong.Selection pressureand performance in spatially distributed evolutionary.In In Proceedings of the World Congress on Computatinal Intelli-gence,pages553–557.IEEE Press,1998.[26]K.Sastry,D.E.Goldberg,and X.Llora.Towards billion-bit optimization via a parallel estimation of distribution algorithm.In GECCO’07:Proceedings of the9th annual conference on Genetic and evolutionary computation,pages 577–584,New York,NY,USA,2007.ACM.[27]J.Schaffer and L.Eshelman.On Crossover as an Evolu-tionary Viable Strategy.In R.Belew and L.Booker,editors, Proceedings of the4th International Conference on Genetic Algorithms,pages61–68.Morgan Kaufmann,1991. [28]G.Sywerda.Uniform crossover in genetic algorithms.InProceedings of the third international conference on Genetic algorithms,pages2–9,San Francisco,CA,USA,1989.Mor-gan Kaufmann Publishers Inc.[29]M.Uysal,T.M.Kurc,A.Sussman,and J.Saltz.A perfor-mance prediction framework for data intensive applications on large scale parallel machines.In In Proceedings of the Fourth Workshop on Languages,Compilers and Run-time Systems for Scalable Computers,number1511in Lecture Notes in Computer Science,pages243–258.Springer-Verlag,1998.。