toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Gololo, M.G.D.; Carrio Argos, F.; Mellado, B. url  doi
openurl 
  Title Tile Computer-on-Module for the ATLAS Tile Calorimeter Phase-II upgrades Type Journal Article
  Year 2022 Publication Journal of Instrumentation Abbreviated Journal (down) J. Instrum.  
  Volume 17 Issue 6 Pages P06020 - 14pp  
  Keywords Control and monitor systems online; Detector control systems (detector and experiment monitoring and slow-control systems, architecture, hardware, algorithms, databases); Data acquisition circuits; Digital electronic circuits  
  Abstract The Tile PreProcessor (TilePPr) is the core element of the Tile Calorimeter (TileCal) off-detector electronics for High-luminosity Large Hadron Collider (HL-LHC). The TilePPr comprises FPGA-based boards to operate and read out the TileCal on-detector electronics. The Tile Computer on Module (TileCoM) mezzanine is embedded within TilePPr to carry out three main functionalities. These include remote configuration of on-detector electronics and TilePPr FPGAs, interface the TilePPr with the ATLAS Trigger and Data Acquisition (TDAQ) system, and interfacing the TilePPr with the ATLAS Detector Control System (DCS) by providing monitoring data. The TileCoM is a 10-layer board with a Zynq UltraScale+ ZU2CG for processing data, interface components to integrate with TilePPr and the power supply to be connected to the Advanced Telecommunication Computing Architecture carrier. A CentOS embedded Linux is deployed on the TileCoM to implement the required functionalities for the HL-LHC. In this paper we present the hardware and firmware developments of the TileCoM system in terms of remote programming, interface with ATLAS TDAQ system and DCS system.  
  Address [Gololo, M. G. D.; Argos, F. Carrio; Mellado, B.] Univ Witwatersrand, Inst Collider Particle Phys, 1 Jan Smuts Ave, ZA-2000 Johannesburg, South Africa, Email: mpho.gift.doctor.gololo@cern.ch  
  Corporate Author Thesis  
  Publisher IOP Publishing Ltd Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 1748-0221 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000836448900004 Approved no  
  Is ISI yes International Collaboration yes  
  Call Number IFIC @ pastor @ Serial 5335  
Permanent link to this record
 

 
Author ATLAS Collaboration (Aad, G. et al); Akiot, A.; Amos, K.R.; Aparisi Pozo, J.A.; Bailey, A.J.; Bouchhar, N.; Cabrera Urban, S.; Cantero, J.; Cardillo, F.; Castillo Gimenez, V.; Chitishvili, M.; Costa, M.J.; Didenko,, M.; Escobar, C.; Fiorini, L.; Fullana Torregrosa, E.; Fuster, J.; Garcia, C.; Garcia Navarro, J.E.; Gomez Delegido, A.J.; Gonzalez de la Hoz, S.; Gonzalvo Rodriguez, G.R.; Guerrero Rojas, J.G.R.; Lacasta, C.; Marti-Garcia, S.; Martinez Agullo, P.; Miralles Lopez, M.; Mitsou, V.A.; Monsonis Romero, L.; Moreno Llacer, M.; Munoz Perez, D.; Navarro-Gonzalez, J.; Poveda, J.; Prades Ibañez, A.; Rubio Jimenez, A.; Ruiz-Martinez, A.; Sabatini, P.; Salt, J.; Sanchez Sebastian, V.; Sayago Galvan, I.; Senthilkumar, V.; Soldevila, U.; Sanchez, J.; Torro Pastor, E.; Valero, A.; Valiente Moreno, E.; Valls Ferrer, J.A.; Varriale, L.; Villaplana Perez, M.; Vos, M. url  doi
openurl 
  Title Fast b-tagging at the high-level trigger of the ATLAS experiment in LHC Run 3 Type Journal Article
  Year 2023 Publication Journal of Instrumentation Abbreviated Journal (down) J. Instrum.  
  Volume 18 Issue 11 Pages P11006 - 38pp  
  Keywords Trigger algorithms; Trigger concepts and systems (hardware and software)  
  Abstract The ATLAS experiment relies on real-time hadronic jet reconstruction and b-tagging to record fully hadronic events containing b-jets. These algorithms require track reconstruction, which is computationally expensive and could overwhelm the high-level-trigger farm, even at the reduced event rate that passes the ATLAS first stage hardware-based trigger. In LHC Run 3, ATLAS has mitigated these computational demands by introducing a fast neural-network-based b-tagger, which acts as a low-precision filter using input from hadronic jets and tracks. It runs after a hardware trigger and before the remaining high-level-trigger reconstruction. This design relies on the negligible cost of neural-network inference as compared to track reconstruction, and the cost reduction from limiting tracking to specific regions of the detector. In the case of Standard Model HH -> b (b) over barb (b) over bar, a key signature relying on b-jet triggers, the filter lowers the input rate to the remaining high-level trigger by a factor of five at the small cost of reducing the overall signal efficiency by roughly 2%.  
  Address [Filmer, E. K.; Grant, C. M.; Jackson, P.; Kong, A. X. Y.; Pandya, H. D.; Potti, H.; Ruggeri, T. A.; Ting, E. X. L.; White, M. J.] Univ Adelaide, Dept Phys, Adelaide, SA, Australia  
  Corporate Author Thesis  
  Publisher IOP Publishing Ltd Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 1748-0221 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:001123791900004 Approved no  
  Is ISI yes International Collaboration yes  
  Call Number IFIC @ pastor @ Serial 5972  
Permanent link to this record
 

 
Author Bouhova-Thacker, E.; Kostyukhin, V.; Koffas, T.; Liebig, W.; Limper, M.; Piacquadio, G.N.; Prokofiev, K.; Weiser, C.; Wildauer, A. doi  openurl
  Title Expected Performance of Vertex Reconstruction in the ATLAS Experiment at the LHC Type Journal Article
  Year 2010 Publication IEEE Transactions on Nuclear Science Abbreviated Journal (down) IEEE Trans. Nucl. Sci.  
  Volume 57 Issue 2 Pages 760-767  
  Keywords Data analysis; data reconstruction; high energy physics; pattern recognition; reconstruction algorithms; tracking; vertex detectors  
  Abstract In the harsh environment of the Large Hadron Collider at CERN (design luminosity of 10(34) cm(-2) s(-1)) efficient reconstruction of vertices is crucial for many physics analyses. Described in this paper is the expected performance of the vertex reconstruction used in the ATLAS experiment. The algorithms for the reconstruction of primary and secondary vertices as well as for finding photon conversions and vertex reconstruction in jets are described. The implementation of vertex algorithms which follows a very modular design based on object-oriented C++ is presented. A user-friendly concept allows event reconstruction and physics analyses to compare and optimize their choice among different vertex reconstruction strategies. The performance of implemented algorithms has been studied on a variety of Monte Carlo samples and results are presented.  
  Address [Bouhova-Thacker, Eva] Univ Lancaster, Lancaster LA1 4YB, England, Email: bouhova@mail.cern.ch  
  Corporate Author Thesis  
  Publisher Ieee-Inst Electrical Electronics Engineers Inc Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0018-9499 ISBN Medium  
  Area Expedition Conference  
  Notes ISI:000276679200006 Approved no  
  Is ISI yes International Collaboration yes  
  Call Number IFIC @ pastor @ Serial 260  
Permanent link to this record
 

 
Author Aliaga, R.J. doi  openurl
  Title Real-Time Estimation of Zero Crossings of Sampled Signals for Timing Using Cubic Spline Interpolation Type Journal Article
  Year 2017 Publication IEEE Transactions on Nuclear Science Abbreviated Journal (down) IEEE Trans. Nucl. Sci.  
  Volume 64 Issue 8 Pages 2414-2422  
  Keywords Digital arithmetic; digital circuits; digital timing; field-programmable gate array (FPGA); interpolation; signal processing algorithms; splines time estimation; time resolution  
  Abstract A scheme is proposed for hardware estimation of the location of zero crossings of sampled signals with subsample resolution for timing applications, which consists of interpolating the signal with a cubic spline near the zero crossing and then finding the root of the resulting polynomial. An iterative algorithm based on the bisection method is presented that obtains one bit of the result per step and admits an efficient digital implementation using fixed-point representation. In particular, the root estimation iteration involves only two additions, and the initial values can be obtained from finite impulse response (FIR) filters with certain symmetry properties. It is shown that this allows online real-time estimation of timestamps in free-running sampling detector systems with improved accuracy with respect to the more common linear interpolation. The method is evaluated with simulations using ideal and real timing signals, and estimates are given for the resource usage and speed of its implementation.  
  Address [Aliaga, Ramon J.] Inst Fis Corpuscular, Paterna 46980, Spain, Email: raalva@upvnet.upv.es  
  Corporate Author Thesis  
  Publisher Ieee-Inst Electrical Electronics Engineers Inc Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0018-9499 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000411027700008 Approved no  
  Is ISI yes International Collaboration no  
  Call Number IFIC @ pastor @ Serial 3301  
Permanent link to this record
 

 
Author Mendez, V.; Amoros, G.; Garcia, F.; Salt, J. doi  openurl
  Title Emergent algorithms for replica location and selection in data grid Type Journal Article
  Year 2010 Publication Future Generation Computer Systems Abbreviated Journal (down) Futur. Gener. Comp. Syst.  
  Volume 26 Issue 7 Pages 934-946  
  Keywords Grid computing; Algorithms; Optimization methods; Artificial intelligence  
  Abstract Grid infrastructures for e-Science projects are growing in magnitude terms. Improvements in data Grid replication algorithms may be critical in many of these infrastructures. This paper shows a decentralized replica optimization service, providing a general Emergent Artificial Intelligence (EAI) algorithm for the problem definition. Our aim is to set up a theoretical framework for emergent heuristics in Grid environments. Further, we describe two EAI approaches, the Particle Swarm Optimization PSO-Grid Multiswarm Federation and the Ant Colony Optimization ACO-Grid Asynchronous Colonies Optimization replica optimization algorithms, with some examples. We also present extended results with best performance and scalability features for PSO-Grid Multiswarrn Federation.  
  Address [Mendez Munoz, Victor; Amoros Vicente, Gabriel; Salt Cairols, Jose] CSIC, Grid & E Sci Grp, Inst Fis Corpuscular IFIC, Mixed Inst, E-46071 Valencia, Spain, Email: vmendez@ific.uv.es  
  Corporate Author Thesis  
  Publisher Elsevier Science Bv Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0167-739x ISBN Medium  
  Area Expedition Conference  
  Notes ISI:000279804200004 Approved no  
  Is ISI yes International Collaboration no  
  Call Number IFIC @ elepoucu @ Serial 411  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records:
ific federMinisterio de Ciencia e InnovaciĆ³nAgencia Estatal de Investigaciongva