15–16 May 2023
Wigner Datacenter - Wigner Research Centre for Physics
Europe/Budapest timezone

Session

Session VI

16 May 2023, 11:00
Wigner Datacenter - Wigner Research Centre for Physics

Wigner Datacenter - Wigner Research Centre for Physics

Wigner RCP 1121 Budapest, Konkoly-Thege Miklós rd 29-33, Hungary

Presentation materials

There are no materials yet.

  1. Erno David (MTA Wigner FK)
    16/05/2023, 11:00

    The GigaBit Transceiver (GBT) and the low power GBT (lpGBT) link architecture and protocol have been developed by CERN for physical experiments in the Large Hadron Collider as a radiation-hard optical link between the detectors and the data processing FPGAs (https://gitlab.cern.ch/gbt-fpga/). This presentation shows the details of how to implement a large array of GBT/lpGBT links (up to 48 x...

    Go to contribution page
  2. Margóczi Márk
    16/05/2023, 11:25

    GUARDYAN (GpU Assisted Reactor Dynamic ANalysis) is a GPU-based dynamic Monte Carlo code developed at Budapest University of Technology and Economics. As an emerging calculation technology, dynamic Monte Carlo computes the neutron population evolution by calculating the direct time dependence of the neutron histories in multiplying systems. GUARDYAN targets to solve time-dependent problems...

    Go to contribution page
  3. Antal Jakovac (Wigner RCP, Department of Computational Sciences)
    16/05/2023, 11:50

    The recent rapid development in the generative methods of artificial intelligence makes it more and more urgent to understand, what is the intelligence they manifest, what are the limits and where are the breakthrough points for a next generation AI. In the talk we examine, what is the relation of the present-day leading AI applications to human thinking, in particular the "fast" and "slow"...

    Go to contribution page
  4. István Borsos (Centre for Energy Research)
    16/05/2023, 12:10
    Lecture

    Some applications of Monte Carlo simulation require the generation of a
    large number of small grids of bits (e.g. tiles or boards of 32 by 32 bits) with a
    given number of bits set to one, the rest is set to zero. Conventional sequential
    algorithms generate them by randomly selecting empty sites until the given
    number of set sites is reached, which is not an efficient solution. In this...

    Go to contribution page
Building timetable...