1. Tracking using Cellular Automaton Algorithm for CBM experiment Arkadiusz Bubak University of Silesia, Katowice, Poland

2. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 2/23 Cellular automata Proposed in forties of 20th century by Stanisław Ulam At the same time John von Neumann who tried to develop hypothetical self- reproduction machine realized that CA, which reflect, simplified physical model of the real world, is solution of his search Stanisław Ulam, 1909-1984 John von Neumann, 1903-1957 Proposed in forties of 20th century by Stanisław Ulam At the same time John von Neumann who tried to develop hypothetical self- reproduction machine realized that CA, which reflect, simplified physical model of the real world, is solution of his search In early 1950s CA was also studied as possible model for biological systems At present CA are numbered among wide and fashionable domains like artificial intelligence The best-known example and implementation if CA is “The Game of Life” - devised by British mathematician John Horton Conway in 1970

3. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 3/23 Cellular automata Proposed in forties of 20th century by Stanisław Ulam At the same time John von Neumann who tried to develop hypothetical self- reproduction machine realized that CA, which reflect, simplified physical model of the real world, is solution of his search In early 1950s CA was also studied as possible model for biological systems At present CA are numbered among wide and fashionable domains like artificial intelligence Stanisław Ulam, 1909-1984 John von Neumann, 1903-1957

4. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 4/23 Cellular automata Proposed in forties of 20th century by Stanisław Ulam At the same time John von Neumann who tried to develop hypothetical self- reproduction machine realized that CA, which reflect, simplified physical model of the real world, is solution of his search In early 1950s CA was also studied as possible model for biological systems At present CA are numbered among wide and fashionable domains like artificial intelligence The best-known example and implementation of CA is “The Game of Life” - devised by British mathematician John Horton Conway in 1970 Stanisław Ulam, 1909-1984 John von Neumann, 1903-1957 John Conway 1937

5. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 5/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior

6. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 6/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior The game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may on may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules: At each time step, life persists in any location where it is also present in 2 || 3 of the 8 neighboring locations Life in each cell with 4 or more neighbors dies from overcrowding Life in cells with 1 or none dies from isolation (or solitude :() IMPORTANT: All births and deaths occur simultaneously in given time step Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior In the game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may or may not be occupied by “life” Picture of the world changes in given time steps

7. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 7/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior In the game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may or may not be occupied by “life” Picture of the world changes in given time steps Salmonella Clostridium difficile is the leading cause of diarrhea in the Poland

8. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 8/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior In the game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may or may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules:

9. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 9/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior In the game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may or may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules: At each time step, life persists in any location where it is also present in 2 || 3 of the 8 neighboring locations

10. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 10/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior In the game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may or may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules: At each time step, life persists in any location where it is also present in 2 || 3 of the 8 neighboring locations Life in each cell with 4 or more neighbors dies from overcrowding

11. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 11/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior In the game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may or may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules: At each time step, life persists in any location where it is also present in 2 || 3 of the 8 neighboring locations Life in each cell with 4 or more neighbors dies from overcrowding Life in cells with 1 or none dies from isolation (or solitude :()

12. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 12/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior In the game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may or may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules: At each time step, life persists in any location where it is also present in 2 || 3 of the 8 neighboring locations Life in each cell with 4 or more neighbors dies from overcrowding Life in cells with 1 or none dies from isolation (or solitude :() Birth occurs when cell has 3 neighbors (partners?)

13. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 13/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior The game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may on may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules: At each time step, life persists in any location where it is also present in 2 || 3 of the 8 neighboring locations Life in each cell with 4 or more neighbors dies from overcrowding Life in cells with 1 or none dies from isolation (or solitude :() IMPORTANT: All births and deaths occur simultaneously in given time step Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior In the game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may or may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules: At each time step, life persists in any location where it is also present in 2 || 3 of the 8 neighboring locations Life in each cell with 4 or more neighbors dies from overcrowding Life in cells with 1 or none dies from isolation (or solitude :() Birth occurs when cell has 3 neighbors (partners?) IMPORTANT: All births and deaths occur simultaneously in given time step

14. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 14/23 The Game of Life Non-player game – needing no input from human players Further evolution of game is only determined by: Initial state Conditions – give particular forms of repetitive or other behavior The game of life one can imagine a world as a matrix of cells Each cells has 8 neighboring cells 4 adjacent orthogonally 4 adjacent diagonally Each cell may on may not be occupied by “life” Picture of the world changes in given time steps In the game are in force very simple set of rules: At each time step, life persists in any location where it is also present in 2 || 3 of the 8 neighboring locations Life in each cell with 4 or more neighbors dies from overcrowding Life in cells with 1 or none dies from isolation (or solitude :() IMPORTANT: All births and deaths occur simultaneously in given time step Such game based on the cellular automata could be viewed as kind of parallel computers

15. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 15/23 The Game of Life Such game based on the cellular automata could be viewed as kind of parallel computers

16. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 16/23 CBM detection system → e + e - TRD Transition Radiation Detector RICH Ring Imaging Cherenkov Detector STS Silicon Tracking System MVD Micro Vertex Detector Dipol Magnet ECAL Electromagnetic Calorimeter Projectile Spectator Detector (Calorimeter) RPC (TOF) Resistive Plate Chamber

17. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 17/23 CBM detection system → μ + μ - Tracking Detector Much Muon Detector System STS Silicon Tracking System MVD Micro Vertex Detector Dipol Magnet Projectile Spectator Detector (Calorimeter) RPC (TOF) Resistive Plate Chamber

18. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 18/23 Software Package FairRoot (CbmRoot): Root + Virtual Monte Carlo  Geant 3 & 4, Fluka  Particle generators: UrQMD, HSD, Pluto,... Serves both simulation & analysis Fully Root based → good support, easy maintenance, low newcomer threshold Object oriented Configurable via Root macros Prepared to run on the Grid Portable (compiles on many Linux platforms and with many compilers) http://fairroot.gsi.de

19. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 19/23 Transition Radiation Detector: TRD 4m7.25m9.5m Y X Z Y X

20. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 20/23 Transition Radiation Detector: TRD XYXY XYXY 1 st station 2 nd station 3 rd station

21. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 21/23 Steps (1) Creation Space Points (SP) (2) Creation Tracklets (3) Finding neighbours (4) Tagging (5) Creation tracks candidates (6) Tracks competition (7) Removing used points (8) 2 Nd & 3 rd loops Standalone TRD tracking: algorithm 1 st Loop: ~50% total time 2 nd Loop: ~ 30% of tt 3 rd Loop: ~ 20% of tt

22. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 22/23 CA → Results Efficiency CentralMbias Primary reference fast (p > 1 GeV/c) 91.492.5 Primary reference slow (p < 1GeV/c) 81.380.4 Ghost level8.36.2 Clones 00 Time* (s/event) 0.80.14 * at 2x3GHz, 1GB RAM Au+Au 25AGeV → ~700 tracks

23. Arek Bubak, XXXI MLCOP, Piaski 2009.08.02 23/23 Thank you for your attention Dziękuję za uwagę [Pronunciation: Jenkooyen (Dzhienkooien) zza oovahgen] The end. Eind. Extrémité. Ende. Τέλος. Estremità. Koniec. Extremidade. Конец. Extremo. Koeiec