GARCON Genetic Algorithm for Rectangular Cuts OptimizatioN
|
|
- Dennis Phillips
- 5 years ago
- Views:
Transcription
1 GARCON Genetic Algorithm for Rectangular Cuts OptimizatioN Salavat Abdullin FNAL Alexey Drozdetskiy April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 1
2 How to optimize cuts April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 2
3 GARCON Introduction program description and user s manual available in hep-ph/ web-page: A few recent examples of usage High Energy Physics analyses of Compact Muon Solenoid (CMS) collaboration (published in CMS Physics TDR v.2 (J. Phys. G: Nucl. Part. Phys. 34 (2007) ) and Public CMS Notes) HZZ4μ Standard Model Higgs boson search (CMS Note 2006/122) SUSY discovery potential (e.g. CMS Note 2006/134) Single-top events selection (CMS Note 2006/084) In short: Genetic algorithm (GA) is a set of algorithms inspired by concepts of natural selection with evolving individuals, which allowed to be created randomly, to mutate, inherit their qualities, etc. useful in extremum finding tasks with a large number of discrete solutions Typically High Energy Physics (HEP) analysis has quite a few selection criteria (cuts) to optimize for example a significance of an excess of the signal over background events. In such cases simple scan over multi-dimensional cuts space (especially when done on top of a scan over theoretical predictions parameters space like for SUSY e.g.) leads to CPU time demand varying from days to many years April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 3
4 fast and efficient GARCON features automatically performs an optimization and results stability verification effectively trying ~10 50 cut set parameters/values permutations for millions of input events in hours time optimization output is transparent efficient cut variables optimal cut values more features many significance function available to user (S signal, B - background) starting from S1 = S / B, including e.g. Scl = 2( S + B)ln(1 + S / B) 2S and with possibility of a user defined optimization function user defined optimization precision additional user defined requirements minimum number of signal/background events to survive after final cuts variables/processes to be used for a particular optimization run number of optimizations inside one run to ensure that optimization converges/finds not just a local maximum(s), but a global one as well (in case of a complicated phase space) automatic verification of results stability April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 4
5 GARCON - genetic algorithm Definitions/algorithm individual a set of qualities to be optimized min/max cut values on kinematical variables in HEP analysis environment a set of requirement on evolutionary process quality function (significance) which shows how good cuts (individuals) are in separating signal from background community a number of individuals involved in evolution breeding of new individuals (combining best qualities, cuts, for new individuals from two parent ones) breeding with possible mutation (one of the algorithms that allows new individuals to try new parts of phase space, thus not restricting community evolution inside one local maximum of quality function) death of individuals (the better quality of an individual the longer it lives, produces new individuals, thus improving community as a whole) cataclysmic update starting community from scratch (another possibility for GA to look outside of a particular local maximum of quality function) the very best individual after a number of years of evolution is an output of GARCON optimized cut values for HEP analysis April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 5
6 Toy analysis msugra (constrained MSSM Supersymmetry model) generator level analysis one particular point in msugra parameter space chosen as a signal details in the hep-ph/ characteristic qualities of SUSY events, following from a consideration of signal Feynman diagrams are: large MET (mainly due to massive stable invisible SUSY particles, LSP) and large jet ETs (due to heavy SUSY particles cascade decays) considered backgrounds QCD, W/Z+jets, double weak-boson production, tt statistics divided into two parts one for cuts optimization, another to verify stability of results optimization: 10 cut parameters (20 values) used for optimization 2.5% precision for each variable (40 possible values for each variable) ~0.5*10 6 events used in optimization with goal to separate signal events from background ones with best possible significance April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 6
7 Performance after ~50 years (~3.5 hours) close to the best result is already achieved thus effectively tried permutations of possible cut values (20 variables to optimize, 40 possible values for each) on 0.5 millions of events April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 7
8 Optimized cut values example an example of a cut value chosen independently by eye and optimized by GARCON (for missing transverse energy variable) really discriminating variable an example of a cut value chosen independently by eye and optimized by GARCON (transverse energy of the leading jet) not really discriminating variable (compare distribution before and after other cuts) GARCON (optimized) before cuts after cuts by eye (not optimized) April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 8
9 Optimized vs. constant cuts An example of results with GARCON and classical approach in full simulation analysis done by two different universities Standard Model Higgs boson search in HZZ4μ channel CMS H4µ 2006 Gain in significance in probabilistic terms, e.g. m H =130 (at the edge of 5σ discovery for 30fb -1 integrated luminosity): significance: 5.1 vs. 6 σ 55% vs. 80% chances to observe greater than 5σ excess CMS Physics TDR, v2 (J. Phys. G: Nucl. Part. Phys. 34 (2007) ) April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 9
10 Stability of results An example of results with GARCON and classical approach in full simulation analysis done by two different universities Standard Model Higgs boson search in HZZ4μ channel stable results even with small statistics available for the analysis CMS Public Note 2006/122 Good example of complicated analysis, where not only many variables and values for cuts analyzed, but also many points for possible signal studied April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 10
11 Summary We presented GARCON program, illustrated its functionality with a simple HEP analysis example much more complicated examples described for example in CMS Physics Technical Design Report, v2, 2006 CMS Public Notes The program automatically performs rectangular cuts optimization and verification for stability in a multidimensional phase space All-in-all it is simple yet powerful ready-to-use publicly available tool with flexible and transparent optimization and verification parameters setup April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 11
VISPA: Visual Physics Analysis Environment
VISPA: Visual Physics Analysis Environment Tatsiana Klimkovich for the VISPA group (O.Actis, M.Erdmann, R.Fischer, A.Hinzmann, M.Kirsch, G.Müller, M.Plum, J.Steggemann) DESY Computing Seminar, 27 October
More informationb-jet identification at High Level Trigger in CMS
Journal of Physics: Conference Series PAPER OPEN ACCESS b-jet identification at High Level Trigger in CMS To cite this article: Eric Chabert 2015 J. Phys.: Conf. Ser. 608 012041 View the article online
More informationSpark and HPC for High Energy Physics Data Analyses
Spark and HPC for High Energy Physics Data Analyses Marc Paterno, Jim Kowalkowski, and Saba Sehrish 2017 IEEE International Workshop on High-Performance Big Data Computing Introduction High energy physics
More informationLCG MCDB Knowledge Base of Monte Carlo Simulated Events
LCG MCDB Knowledge Base of Monte Carlo Simulated Events ACAT 2007, Amsterdam Sergey Belov, JINR, Dubna belov@jinr.ru http://mcdb.cern.ch LCG MCDB group: S. Belov, JINR L. Dudko, SINP MSU W. Pokorski, CERN
More informationMIP Reconstruction Techniques and Minimum Spanning Tree Clustering
SLAC-PUB-11359 July 25 MIP Reconstruction Techniques and Minimum Spanning Tree Clustering Wolfgang F. Mader The University of Iowa, 23 Van Allen Hall, 52242 Iowa City, IA The development of a tracking
More informationStudy of the Higgs boson coupling to the top quark and of the b jet identification with the ATLAS experiment at the Large Hadron Collider.
Study of the Higgs boson coupling to the top quark and of the b jet identification with the ATLAS experiment at the Large Hadron Collider. Calvet Thomas CPPM, ATLAS group PhD day 25 novembre 2015 2 The
More informationEvolutionary Computation. Chao Lan
Evolutionary Computation Chao Lan Outline Introduction Genetic Algorithm Evolutionary Strategy Genetic Programming Introduction Evolutionary strategy can jointly optimize multiple variables. - e.g., max
More informationNeural Network Weight Selection Using Genetic Algorithms
Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks
More informationRecasting LHC analyses with MADANALYSIS 5
Recasting LHC analyses with MADANALYSIS 5 Fuks Benjamin IPHC - U. Strasbourg With E. Conte & the PAD team (S. Kraml et al., K. Mawatari & K. de Causmaecker, etc.) MC4BSM 2015 @ Fermilab, USA 18-21 May
More informationPoS(ACAT08)101. An Overview of the b-tagging Algorithms in the CMS Offline Software. Christophe Saout
An Overview of the b-tagging Algorithms in the CMS Offline Software Christophe Saout CERN, Geneva, Switzerland E-mail: christophe.saout@cern.ch The CMS Offline software contains a widespread set of algorithms
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationEvolutionary Computation Part 2
Evolutionary Computation Part 2 CS454, Autumn 2017 Shin Yoo (with some slides borrowed from Seongmin Lee @ COINSE) Crossover Operators Offsprings inherit genes from their parents, but not in identical
More informationPoS(EPS-HEP2017)523. The CMS trigger in Run 2. Mia Tosi CERN
CERN E-mail: mia.tosi@cern.ch During its second period of operation (Run 2) which started in 2015, the LHC will reach a peak instantaneous luminosity of approximately 2 10 34 cm 2 s 1 with an average pile-up
More informationAn SQL-based approach to physics analysis
Journal of Physics: Conference Series OPEN ACCESS An SQL-based approach to physics analysis To cite this article: Dr Maaike Limper 2014 J. Phys.: Conf. Ser. 513 022022 View the article online for updates
More informationGENETIC ALGORITHM with Hands-On exercise
GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic
More informationGenetic Algorithms Variations and Implementation Issues
Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary
More informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationMuon Reconstruction and Identification in CMS
Muon Reconstruction and Identification in CMS Marcin Konecki Institute of Experimental Physics, University of Warsaw, Poland E-mail: marcin.konecki@gmail.com An event reconstruction at LHC is a challenging
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationarxiv:hep-ph/ v1 11 Mar 2002
High Level Tracker Triggers for CMS Danek Kotliński a Andrey Starodumov b,1 a Paul Scherrer Institut, CH-5232 Villigen, Switzerland arxiv:hep-ph/0203101v1 11 Mar 2002 b INFN Sezione di Pisa, Via Livornese
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More informationAlignment of the CMS Silicon Tracker
Alignment of the CMS Silicon Tracker Tapio Lampén 1 on behalf of the CMS collaboration 1 Helsinki Institute of Physics, Helsinki, Finland Tapio.Lampen @ cern.ch 16.5.2013 ACAT2013 Beijing, China page 1
More informationGenetic Algorithms. PHY 604: Computational Methods in Physics and Astrophysics II
Genetic Algorithms Genetic Algorithms Iterative method for doing optimization Inspiration from biology General idea (see Pang or Wikipedia for more details): Create a collection of organisms/individuals
More informationBatch Services at CERN: Status and Future Evolution
Batch Services at CERN: Status and Future Evolution Helge Meinhard, CERN-IT Platform and Engineering Services Group Leader HTCondor Week 20 May 2015 20-May-2015 CERN batch status and evolution - Helge
More informationH γγ. Sean Simon UC San Diego (on behalf of the H γγ WG) Photon Workshop July 23 rd 2008
H γγ Sean Simon UC San Diego (on behalf of the H γγ WG) Photon Workshop July 23 rd 2008 Contributing and interested groups Caltech, Lyon, Notre Dame, Rome, Saclay, UC Riverside, UCSD Signal and Background
More informationPerformance of Tracking, b-tagging and Jet/MET reconstruction at the CMS High Level Trigger
Journal of Physics: Conference Series PAPER OPEN ACCESS Performance of Tracking, b-tagging and Jet/MET reconstruction at the CMS High Level Trigger To cite this article: Mia Tosi 205 J. Phys.: Conf. Ser.
More informationMutations for Permutations
Mutations for Permutations Insert mutation: Pick two allele values at random Move the second to follow the first, shifting the rest along to accommodate Note: this preserves most of the order and adjacency
More informationEvolutionary Algorithms. CS Evolutionary Algorithms 1
Evolutionary Algorithms CS 478 - Evolutionary Algorithms 1 Evolutionary Computation/Algorithms Genetic Algorithms l Simulate natural evolution of structures via selection and reproduction, based on performance
More informationA New Segment Building Algorithm for the Cathode Strip Chambers in the CMS Experiment
EPJ Web of Conferences 108, 02023 (2016) DOI: 10.1051/ epjconf/ 201610802023 C Owned by the authors, published by EDP Sciences, 2016 A New Segment Building Algorithm for the Cathode Strip Chambers in the
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationPoS(High-pT physics09)036
Triggering on Jets and D 0 in HLT at ALICE 1 University of Bergen Allegaten 55, 5007 Bergen, Norway E-mail: st05886@alf.uib.no The High Level Trigger (HLT) of the ALICE experiment is designed to perform
More informationFrom raw data to new fundamental particles: The data management lifecycle at the Large Hadron Collider
From raw data to new fundamental particles: The data management lifecycle at the Large Hadron Collider Andrew Washbrook School of Physics and Astronomy University of Edinburgh Dealing with Data Conference
More informationMachine Learning for (fast) simulation
Machine Learning for (fast) simulation Sofia Vallecorsa for the GeantV team CERN, April 2017 1 Monte Carlo Simulation: Why Detailed simulation of subatomic particles is essential for data analysis, detector
More informationThe full detector simulation for the ATLAS experiment: status and outlook
The full detector simulation for the ATLAS experiment: status and outlook A. Rimoldi University of Pavia & INFN, Italy A.Dell Acqua CERN, Geneva, CH The simulation of the ATLAS detector is a major challenge,
More informationGenetic Algorithms. Kang Zheng Karl Schober
Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization
More informationATLAS, CMS and LHCb Trigger systems for flavour physics
ATLAS, CMS and LHCb Trigger systems for flavour physics Università degli Studi di Bologna and INFN E-mail: guiducci@bo.infn.it The trigger systems of the LHC detectors play a crucial role in determining
More informationDesign of the new ATLAS Inner Tracker (ITk) for the High Luminosity LHC
Design of the new ATLAS Inner Tracker (ITk) for the High Luminosity LHC Jike Wang (DESY) for the ATLAS Collaboration May/2017, TIPP 2017 LHC Machine Schedule In year 2015, ATLAS and CMS went into Run2
More informationPhysics CMS Muon High Level Trigger: Level 3 reconstruction algorithm development and optimization
Scientifica Acta 2, No. 2, 74 79 (28) Physics CMS Muon High Level Trigger: Level 3 reconstruction algorithm development and optimization Alessandro Grelli Dipartimento di Fisica Nucleare e Teorica, Università
More informationMarch 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationFOREST PLANNING USING PSO WITH A PRIORITY REPRESENTATION
FOREST PLANNING USING PSO WITH A PRIORITY REPRESENTATION P.W. Brooks and W.D. Potter Institute for Artificial Intelligence, University of Georgia, USA Overview Background: (NIO Project 1 ) PSO -- GA --
More informationThe Compact Muon Solenoid Experiment. Conference Report. Mailing address: CMS CERN, CH-1211 GENEVA 23, Switzerland
Available on CMS information server CMS CR -2009/098 The Compact Muon Solenoid Experiment Conference Report Mailing address: CMS CERN, CH-1211 GENEVA 23, Switzerland 15 April 2009 FROG: The Fast And Realistic
More informationDeep Learning Photon Identification in a SuperGranular Calorimeter
Deep Learning Photon Identification in a SuperGranular Calorimeter Nikolaus Howe Maurizio Pierini Jean-Roch Vlimant @ Williams College @ CERN @ Caltech 1 Outline Introduction to the problem What is Machine
More informationOptimization of Association Rule Mining through Genetic Algorithm
Optimization of Association Rule Mining through Genetic Algorithm RUPALI HALDULAKAR School of Information Technology, Rajiv Gandhi Proudyogiki Vishwavidyalaya Bhopal, Madhya Pradesh India Prof. JITENDRA
More informationATLAS ITk Layout Design and Optimisation
ATLAS ITk Layout Design and Optimisation Noemi Calace noemi.calace@cern.ch On behalf of the ATLAS Collaboration 3rd ECFA High Luminosity LHC Experiments Workshop 3-6 October 2016 Aix-Les-Bains Overview
More informationGeneration of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms
Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms D. Prabhakar Associate Professor, Dept of ECE DVR & Dr. HS MIC College of Technology Kanchikacherla, AP, India.
More informationApplication of Neural Networks to b-quark jet detection in Z b b
Application of Neural Networks to b-quark jet detection in Z b b Stephen Poprocki REU 25 Department of Physics, The College of Wooster, Wooster, Ohio 44691 Advisors: Gustaaf Brooijmans, Andy Haas Nevis
More informationGenerators at the LHC
High Performance Computing for Event Generators at the LHC A Multi-Threaded Version of MCFM, J.M. Campbell, R.K. Ellis, W. Giele, 2015. Higgs boson production in association with a jet at NNLO using jettiness
More informationRobustness Studies of the CMS Tracker for the LHC Upgrade Phase I
Robustness Studies of the CMS Tracker for the LHC Upgrade Phase I Juan Carlos Cuevas Advisor: Héctor Méndez, Ph.D University of Puerto Rico Mayagϋez May 2, 2013 1 OUTLINE Objectives Motivation CMS pixel
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationPath Planning Optimization Using Genetic Algorithm A Literature Review
International Journal of Computational Engineering Research Vol, 03 Issue, 4 Path Planning Optimization Using Genetic Algorithm A Literature Review 1, Er. Waghoo Parvez, 2, Er. Sonal Dhar 1, (Department
More informationNOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION
NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION * Prof. Dr. Ban Ahmed Mitras ** Ammar Saad Abdul-Jabbar * Dept. of Operation Research & Intelligent Techniques ** Dept. of Mathematics. College
More informationIntroduction to Genetic Algorithms
Advanced Topics in Image Analysis and Machine Learning Introduction to Genetic Algorithms Week 3 Faculty of Information Science and Engineering Ritsumeikan University Today s class outline Genetic Algorithms
More informationTracking and flavour tagging selection in the ATLAS High Level Trigger
Tracking and flavour tagging selection in the ATLAS High Level Trigger University of Pisa and INFN E-mail: milene.calvetti@cern.ch In high-energy physics experiments, track based selection in the online
More informationA Method Based Genetic Algorithm for Pipe Routing Design
5th International Conference on Advanced Engineering Materials and Technology (AEMT 2015) A Method Based Genetic Algorithm for Pipe Routing Design Changtao Wang 1, a, Xiaotong Sun 2,b,Tiancheng Yuan 3,c
More informationMINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 2006 MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS Richard
More informationProbability Control Functions Settings in Continual Evolution Algorithm
Probability Control Functions Settings in Continual Evolution Algorithm Zdeněk Buk, Miroslav Šnorek Dept. of Computer Science and Engineering, Karlovo nám. 3, 2 35 Praha 2, Czech Republic bukz@fel.cvut.cz,
More informationThe k-means Algorithm and Genetic Algorithm
The k-means Algorithm and Genetic Algorithm k-means algorithm Genetic algorithm Rough set approach Fuzzy set approaches Chapter 8 2 The K-Means Algorithm The K-Means algorithm is a simple yet effective
More informationXianyou Wang,Guoming Chen, Zheng Wang, Xianwei Meng, Jan Wang. Institute of High Energy Physics, CAS, Beijing
Xianyou Wang,Guoming Chen, Zheng Wang, Xianwei Meng, Jan Wang Institute of High Energy Physics, CAS, Beijing Outline Outline Motivation Argumentation The sample of InclusivePPmux The number of events will
More informationJHPCSN: Volume 4, Number 1, 2012, pp. 1-7
JHPCSN: Volume 4, Number 1, 2012, pp. 1-7 QUERY OPTIMIZATION BY GENETIC ALGORITHM P. K. Butey 1, Shweta Meshram 2 & R. L. Sonolikar 3 1 Kamala Nehru Mahavidhyalay, Nagpur. 2 Prof. Priyadarshini Institute
More informationGenetic improvement of software: a case study
Genetic improvement of software: a case study Justyna Petke Centre for Research on Evolution, Search and Testing Department of Computer Science, UCL, London Genetic Improvement Programming Automatically
More informationA Modified Genetic Algorithm for Process Scheduling in Distributed System
A Modified Genetic Algorithm for Process Scheduling in Distributed System Vinay Harsora B.V.M. Engineering College Charatar Vidya Mandal Vallabh Vidyanagar, India Dr.Apurva Shah G.H.Patel College of Engineering
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationPoS(ACAT08)100. FROG: The Fast & Realistic OPENGL Event Displayer
FROG: The Fast & Realistic OPENGL Event Displayer Center for Particle Physics and Phenomenology (CP3) Université catholique de Louvain Chemin du cyclotron 2, B-1348-Louvain-la-Neuve - Belgium E-mail: loic.quertenmont@cern.ch
More informationA More Stable Approach To LISP Tree GP
A More Stable Approach To LISP Tree GP Joseph Doliner August 15, 2008 Abstract In this paper we begin by familiarising ourselves with the basic concepts of Evolutionary Computing and how it can be used
More informationRole of Genetic Algorithm in Routing for Large Network
Role of Genetic Algorithm in Routing for Large Network *Mr. Kuldeep Kumar, Computer Programmer, Krishi Vigyan Kendra, CCS Haryana Agriculture University, Hisar. Haryana, India verma1.kuldeep@gmail.com
More informationFAMOS: A Dynamically Configurable System for Fast Simulation and Reconstruction for CMS
FAMOS: A Dynamically Configurable System for Fast Simulation and Reconstruction for CMS St. Wynhoff Princeton University, Princeton, NJ 08544, USA Detailed detector simulation and reconstruction of physics
More informationA genetic algorithms approach to optimization parameter space of Geant-V prototype
A genetic algorithms approach to optimization parameter space of Geant-V prototype Oksana Shadura CERN, PH-SFT & National Technical Univ. of Ukraine Kyiv Polytechnic Institute Geant-V parameter space [1/2]
More informationCMS Alignement and Calibration workflows: lesson learned and future plans
Available online at www.sciencedirect.com Nuclear and Particle Physics Proceedings 273 275 (2016) 923 928 www.elsevier.com/locate/nppp CMS Alignement and Calibration workflows: lesson learned and future
More informationThe Compact Muon Solenoid Experiment. Conference Report. Mailing address: CMS CERN, CH-1211 GENEVA 23, Switzerland
Available on CMS information server CMS CR -2008/100 The Compact Muon Solenoid Experiment Conference Report Mailing address: CMS CERN, CH-1211 GENEVA 23, Switzerland 02 December 2008 (v2, 03 December 2008)
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More informationGenetic programming. Lecture Genetic Programming. LISP as a GP language. LISP structure. S-expressions
Genetic programming Lecture Genetic Programming CIS 412 Artificial Intelligence Umass, Dartmouth One of the central problems in computer science is how to make computers solve problems without being explicitly
More informationKyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming
Kyrre Glette kyrrehg@ifi INF3490 Evolvable Hardware Cartesian Genetic Programming Overview Introduction to Evolvable Hardware (EHW) Cartesian Genetic Programming Applications of EHW 3 Evolvable Hardware
More informationIMPROVING A GREEDY DNA MOTIF SEARCH USING A MULTIPLE GENOMIC SELF-ADAPTATING GENETIC ALGORITHM
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 4th, 2007 IMPROVING A GREEDY DNA MOTIF SEARCH USING A MULTIPLE GENOMIC SELF-ADAPTATING GENETIC ALGORITHM Michael L. Gargano, mgargano@pace.edu
More informationAutomatic Generation of Test Case based on GATS Algorithm *
Automatic Generation of Test Case based on GATS Algorithm * Xiajiong Shen and Qian Wang Institute of Data and Knowledge Engineering Henan University Kaifeng, Henan Province 475001, China shenxj@henu.edu.cn
More informationPrecision Timing in High Pile-Up and Time-Based Vertex Reconstruction
Precision Timing in High Pile-Up and Time-Based Vertex Reconstruction Cedric Flamant (CERN Summer Student) - Supervisor: Adi Bornheim Division of High Energy Physics, California Institute of Technology,
More informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationCollider analysis recasting with Rivet & Contur. Andy Buckley, University of Glasgow Jon Butterworth, University College London MC4BSM, 20 April 2018
Collider analysis recasting with Rivet & Contur Andy Buckley, University of Glasgow Jon Butterworth, University College London MC4BSM, 20 April 2018 Rivet Rivet is an analysis system for MC events, and
More informationImproving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms.
Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms. Gómez-Skarmeta, A.F. University of Murcia skarmeta@dif.um.es Jiménez, F. University of Murcia fernan@dif.um.es
More informationComparative Analysis of Genetic Algorithm Implementations
Comparative Analysis of Genetic Algorithm Implementations Robert Soricone Dr. Melvin Neville Department of Computer Science Northern Arizona University Flagstaff, Arizona SIGAda 24 Outline Introduction
More informationSoftware and computing evolution: the HL-LHC challenge. Simone Campana, CERN
Software and computing evolution: the HL-LHC challenge Simone Campana, CERN Higgs discovery in Run-1 The Large Hadron Collider at CERN We are here: Run-2 (Fernando s talk) High Luminosity: the HL-LHC challenge
More informationIdentification of the correct hard-scatter vertex at the Large Hadron Collider
Identification of the correct hard-scatter vertex at the Large Hadron Collider Pratik Kumar, Neel Mani Singh pratikk@stanford.edu, neelmani@stanford.edu Under the guidance of Prof. Ariel Schwartzman( sch@slac.stanford.edu
More informationFirst LHCb measurement with data from the LHC Run 2
IL NUOVO CIMENTO 40 C (2017) 35 DOI 10.1393/ncc/i2017-17035-4 Colloquia: IFAE 2016 First LHCb measurement with data from the LHC Run 2 L. Anderlini( 1 )ands. Amerio( 2 ) ( 1 ) INFN, Sezione di Firenze
More informationHeuristic Optimisation
Heuristic Optimisation Part 10: Genetic Algorithm Basics Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic
More informationAlignment of the CMS silicon tracker using Millepede II
Journal of Physics: Conference Series Alignment of the CMS silicon tracker using Millepede II To cite this article: Peter Schleper et al 2008 J. Phys.: Conf. Ser. 119 032040 Related content - CMS silicon
More informationHow to discover the Higgs Boson in an Oracle database. Maaike Limper
How to discover the Higgs Boson in an Oracle database Maaike Limper 2 Introduction CERN openlab is a unique public-private partnership between CERN and leading ICT companies. Its mission is to accelerate
More informationEvolutionary form design: the application of genetic algorithmic techniques to computer-aided product design
Loughborough University Institutional Repository Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design This item was submitted to Loughborough University's
More informationDijet A LL Dijet cross section 2006 Dijet A LL Preparation for Tai Sakuma MIT
Dijet A LL 2005 Dijet cross section 2006 Dijet A LL Preparation for 2008 Tai Sakuma MIT Motivation for dijet A LL is to constrain ΔG G with initial event kinematics The initial state variables can be written
More informationLecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman
Lecture 4 3B1B Optimization Michaelmas 2017 A. Zisserman Convexity Robust cost functions Optimizing non-convex functions grid search branch and bound simulated annealing evolutionary optimization The Optimization
More informationEvolving Efficient Security Systems Under Budget Constraints Using Genetic Algorithms
Proceedings of Student Research Day, CSIS, Pace University, May 9th, 2003 Evolving Efficient Security Systems Under Budget Constraints Using Genetic Algorithms Michael L. Gargano, William Edelson, Paul
More informationA new inclusive secondary vertex algorithm for b-jet tagging in ATLAS
A new inclusive secondary vertex algorithm for b-jet tagging in ATLAS Giacinto Piacquadio, Christian Weiser Albert-Ludwig University of Freiburg, Hermann-Herder-Str. 3, D-79104 Freiburg E-mail: giacinto.piacquadio@physik.uni-freiburg.de
More informationMonte Carlo programs
Monte Carlo programs Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University November 15, 2017 Simulation steps: event generator Input = data cards (program options) this is the
More informationReview: Final Exam CPSC Artificial Intelligence Michael M. Richter
Review: Final Exam Model for a Learning Step Learner initially Environm ent Teacher Compare s pe c ia l Information Control Correct Learning criteria Feedback changed Learner after Learning Learning by
More informationMetaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini
Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution
More informationStriped Data Server for Scalable Parallel Data Analysis
Journal of Physics: Conference Series PAPER OPEN ACCESS Striped Data Server for Scalable Parallel Data Analysis To cite this article: Jin Chang et al 2018 J. Phys.: Conf. Ser. 1085 042035 View the article
More informationChallenges and Evolution of the LHC Production Grid. April 13, 2011 Ian Fisk
Challenges and Evolution of the LHC Production Grid April 13, 2011 Ian Fisk 1 Evolution Uni x ALICE Remote Access PD2P/ Popularity Tier-2 Tier-2 Uni u Open Lab m Tier-2 Science Uni x Grid Uni z USA Tier-2
More informationOutline. CS 6776 Evolutionary Computation. Numerical Optimization. Fitness Function. ,x 2. ) = x 2 1. , x , 5.0 x 1.
Outline CS 6776 Evolutionary Computation January 21, 2014 Problem modeling includes representation design and Fitness Function definition. Fitness function: Unconstrained optimization/modeling Constrained
More informationIntroduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell
Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas
More information