{"id":2896,"date":"2016-09-19T08:06:07","date_gmt":"2016-09-19T07:06:07","guid":{"rendered":"http:\/\/www.sitola.cz\/wordpress\/?page_id=2896"},"modified":"2026-04-11T18:16:36","modified_gmt":"2026-04-11T17:16:36","slug":"seminar","status":"publish","type":"page","link":"https:\/\/www.sitola.cz\/wordpress\/seminar\/","title":{"rendered":"Seminar"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/www.sitola.cz\/wordpress\/wp-content\/uploads\/2018\/04\/seminar-180418-long-s-3.png\" alt=\"Our seminar\" align=\"bottom\" \/><\/p>\n<p><!-- <b>The program for autumn 2022<\/b> is available <a href=\"http:\/\/www.sitola.cz\/wordpress\/seminar\/autumn-2022-program\">here<\/a>.\n--><br \/>\nLaboratory seminars (PV273 in the course catalog) on Wednesday, <b>10:30 &#8211; 11:30<\/b>, A505, FI MU, Botanick\u00e1 68, followed by an informal group lunch.<\/p>\n<p>The format of standard lectures: 30-40 minutes presentation + 15 minutes for questions. Slides are expected in English, and the presentation is in English or Czech, depending on the audience. For past seminars, go <a href=\"https:\/\/www.sitola.cz\/wordpress\/seminar\/sitola-seminars-history\/\">here.<\/a><\/p>\n<ul>\n<li><strong>18.2.2026<\/strong><br \/>\nRNDr. Luk\u00e1\u0161 Hejtm\u00e1nek, Ph.D.<br \/>\n<strong>The unbearable lightness of AI<\/strong><br \/>\nAbstract: The CERIT-SC Center launched its AI large language model (LLM) inference service one year ago now. What started with comparatively small models\u2014around 70B parameters and roughly 40GB of weights\u2014has since evolved into a large-scale production environment. Today, we operate several models approaching 700B parameters and one 1000B-parameter model, all running on enterprise-grade DGX B200 and B300 hardware. This presentation highlights recent advances in AI with a particular focus on operating LLM inference services at CERIT-SC. We share practical experience gained over the past months, including architectural decisions, operational challenges, and key lessons learned while scaling from early deployments to state-of-the-art infrastructure. Beyond inference itself, we present the broader ecosystem of AI-enabled services built around these models. This includes agentic systems such as n8n, integrations with developer tools like VS Code, terminal environments, and Jupyter Notebooks, as well as the MCP servers we operate. We explain how these components fit together, why they form a critical part of the overall system, and how they support user-facing services such as chat.ai.e-infra.cz. Finally, we demonstrate how this AI ecosystem translates into real productivity gains, accelerating everyday workflows and reshaping how we approach research, development, and operational tasks.<\/li>\n<li><strong>25.2.2026<\/strong><br \/>\ndoc. Mgr. Pavel Rychl\u00fd, Ph.D.<br \/>\n<strong>Understanding LLMs<\/strong><br \/>\nAbstract: Large Language Models (LLMs) have generated significant excitement and high expectations, including aspirations for Artificial General Intelligence, yet their inner workings are often misunderstood.<br \/>\nIn this presentation, we will demystify the magic behind LLMs\u2014from the challenges of language itself to the power of word embeddings and transformers. We will show how GPT models process words, capture context, and create meaningful responses. We will explore the role of attention mechanisms, the flow of information through neural networks, and why these technologies are reshaping the future of AI.<\/li>\n<li><strong>4.3.2026<\/strong><br \/>\nRNDr. V\u00e1clav Sobotka<br \/>\n<strong>Key principles in cross-domain hyper-heuristics<\/strong><br \/>\nAbstract: Cross-domain selection hyper-heuristics typically focus on adaptively selecting search operations, so-called low-level heuristics (LLHs), from a predefined set. In contrast, we concentrate on the composition of this set and its strategic transformations. We systematically analyze transformations based on three key principles: solution acceptance, LLH repetitions, and perturbation intensity, i.e., the proportion of a solution affected by a perturbative LLH. We demonstrate the raw effects of our transformations on a trivial, unbiased random selection mechanism. Additionally, we accompany several recent hyper-heuristics with such strategic transformations, often effectively simplifying their designs. Using this approach, we show the three aforementioned principles as simple yet powerful drivers of cross-domain search performance and outperform the current state-of-the-art hyper-heuristics on both the standard CHeSC cross-domain benchmark and three real-world domains.<\/li>\n<li><strong>11.3.2026<\/strong><br \/>\nMgr. Samuel Gorta<br \/>\n<strong>Extending molecular dynamics simulations via latent space projection<\/strong><br \/>\nAbstract: Molecular dynamics (MD) simulations provide critical insights into the microscopic behavior of systems comprising thousands to millions of atoms. However, the high computational cost associated with these simulations severely restricts the accessible trajectory lengths, effectively limiting the range of observable physical phenomena.<br \/>\nRecent methodological advancements (e.g., <a class=\"moz-txt-link-freetext\" href=\"https:\/\/doi.org\/10.1039\/D0SC03635H\">https:\/\/doi.org\/10.1039\/D0SC03635H<\/a>) demonstrate that the complex dynamics of such systems can be effectively approximated within a reduced-dimensional latent space. This approach is rooted in the theory of transfer operators, which model the temporal evolution of probability distributions across the system&#8217;s state space. The latent space is formally defined by the basis of the transfer operator\u2019s eigenfunctions. By ranking these basis functions according to their corresponding eigenvalues, less significant dynamical components can be truncated, achieving substantial dimensionality reduction while preserving the essential kinetics of the system. In this framework, the embedding of a specific molecular configuration into the latent space represents its probability values across the selected basis functions.<br \/>\nCritically, this mapping can be modeled using machine learning techniques without the need for an explicit analytical expression of the basis. By training on relatively short input trajectories, these models can learn the latent dynamics, offering a promising path toward extending the temporal reach of MD simulations far beyond current computational limits.<\/li>\n<li><strong>18.3.2026<\/strong><br \/>\nRNDr. Tom\u00e1\u0161 Rebok, Ph.D.<br \/>\n<strong>Building the eLTER cyberInfrastructure: From H2020 development to operational data services for a European research infrastructure<\/strong><br \/>\nAbstract: The eLTER CyberInfrastructure, which we have developed through our participation in the eLTER PPP and eLTER PLUS H2020 projects, illustrates how modern IT can support large-scale, distributed environmental research infrastructure across Europe. This talk presents the modular eLTER Cyberinfrastructure solution, which integrates data registration, metadata harmonization, quality-control workflows, analytical environments, and other user-facing services into a single coherent and interoperable solution. The talk highlights the design and architecture principles behind such a sustainable research infrastructure, including cloud-native, automated deployment and management, workflow-based data processing, and FAIR and interoperable data management. Additionally, we will discuss the challenges of transitioning from project-driven development to sustainable operational services within a European research infrastructure, and share lessons learned from our active participation in a diverse research community. The presentation will also introduce the emerging eLTER ERIC and the services of one of its core facilities\u2014the eLTER ERIC Topic Centre for Data Management\u2014which we recently successfully applied to host.<\/li>\n<li><strong>25.3.2026<\/strong><br \/>\ndoc. RNDr. Radka Svobodov\u00e1, Ph.D.<br \/>\n<strong><strong>Where are electrons in molecules? Mapping probabilities to real numbers<\/strong><\/strong><br \/>\nAbstract: While everyday objects &#8211; like a chair or a laptop &#8211; can be easily located in space, it is not that simple for microscopic particles like electrons and photons. In this micro-world, we only know the probability of finding them in a certain area.<br \/>\nYet, understanding the spatial distribution of electrons, commonly referred to as electron density, is the key to deciphering a molecule&#8217;s chemical behavior. To bridge this gap, we must map the probabilistic distribution of electrons onto real numbers that approximate the electron density assigned to individual atoms. These values are known as partial atomic charges. Whether derived from rigorous quantum mechanical calculations or through various approximations and heuristics, calculating these charges is a fundamental challenge. This lecture will delve deeper into the intricacies of this fascinating concept.<\/li>\n<li><strong>1.4.2026:\u00a0<\/strong>short student presentations organized by the doc. Ing. V\u00e1clav Oujezsk\u00fd, Ph.D.<br \/>\n\u0160tefan Morav\u00edk<br \/>\n<strong>Design and implementation of a drone mission planning module for airport lighting inspection<\/strong><br \/>\nAnnotation: This thesis develops a software module for automated drone mission planning to inspect airport Precision Approach Path Indicator lighting systems. The solution generates safe, collision-free flight paths within active airport environments and provides a web-based interface for trajectory visualization and mission export, aiming to replace costly manned flight inspections with objective, repeatable UAV-based measurements.<br \/>\nSamrawit Fentaye Abebe<br \/>\n<strong>Optimizing software development and deployment with multi-agent Large Language Models<\/strong><br \/>\nAnnotation: This talk presents a multi-agent approach to automate the software development lifecycle process using Large Language Models. I will discuss the system architecture, orchestration strategies, and safety constraints, with a focus on controllability, auditability, and applicability in the enterprise context.<br \/>\nBc. Tom\u00e1\u0161 Men\u0161\u00edk<br \/>\n<strong>Multi-agent systems for cybersecurity event detection in computer networks<\/strong><br \/>\nAnnotation: Current cybersecurity tools detect threats well but operate in isolation, leaving data fragmented. We test whether a multi-agent system using LLMs can bridge this gap by having autonomous agents collaborate to link scattered signals better than traditional rule-based methods. We compare three leading frameworks, implement a prototype on the vSafe backup platform with specialized agents, and evaluate the results on public and internal datasets. This talk outlines the architecture, interaction models, and validation metrics to determine if agent-based reasoning can effectively restore missing context and turn raw alerts into actionable decisions.<\/li>\n<li><strong>8.4.2026: <\/strong>short student presentations organized by RNDr. Luk\u00e1\u0161 Ru\u010dka<br \/>\nAndrej Tejbus<br \/>\n<strong>Merge conflict synthesis in an existing Git project<\/strong><br \/>\nAnnotation: This thesis focuses on the design and implementation of a new laboratory in the PB176 course. The primary goal is to create an environment for practicing the resolution of merge conflicts. Students are able to use their own existing git based projects as a baseline, which they reimplement. During this process, merge conflicts are generated based on the differences between the original and the newly developed code.<br \/>\nJakub Skopal<br \/>\n<strong>Automatic detection of common mistakes in bug reports<\/strong><br \/>\nAnnotation: This thesis introduces an automated Tier 1 feedback system designed to validate student bug reports in the PB176 course, which allows for a more effective resource allocation by eliminating manual iterations.<br \/>\nAdam Lukavec<br \/>\n<strong>Design and implementation of an automated environment for networking courses <\/strong><br \/>\nAnnotation: The talk presents the design and implementation of a service for managing virtualized resources and their access in a networking laboratory built on Stratus.FI infrastructure. The service supports user authentication via faculty xlogin, authorization based on course enrollment through the IS API, and integrates with Ansible for automated resource provisioning. I will discuss the overall architecture and the current state of the implementation.<\/li>\n<li><strong>15.4.2026<\/strong><br \/>\nCanceled due to the CESNET seminar<\/li>\n<li><strong>22.4.2026 <\/strong><br \/>\nMgr. Ter\u00e9zia Fialov\u00e1, Ing. David Tampier a Tom\u00e1\u0161 \u0160atura, MEng.<br \/>\n<strong>Short-term PV forecasting based on Total Sky Imager<\/strong><br \/>\nAbstract: Accurate forecasting of photo-voltaic (PV) generation has the potential to significantly improve the economy of PV installations and to contribute towards better grid stability. As PV generation is notorious for fluctuations due to the transition cloud conditions, it is of interest to introduce a tool for predicting irradiance that is observed precisely at the location of a PV site. This work leverages Total Sky Imager and uses ConvLSTM to forecast mean irradiance at the given location for the following ten 5-minute windows. The irradiance is then utilized to compute PV output, with indications that such an approach outperforms the accuracy of forecasts based on satellite imaging.<\/li>\n<li><strong>29.4.2026<\/strong><br \/>\nRNDr. Pavel Troubil, Ph.D.<br \/>\nTBA<\/li>\n<li><strong>6.5.2026<\/strong><br \/>\nRNDr. Ter\u00e9zia Slanin\u00e1kov\u00e1, Jakub \u010cill\u00edk<br \/>\n<strong>Lessons learned in building a search engine for 1 billion protein structures<\/strong><br \/>\nAbstract: TBA<\/li>\n<li><strong>13.5.2026<\/strong><br \/>\n<strong>Seminar about the organization of SitSem 2026 <\/strong>(10-12.9.2026)<\/li>\n<\/ul>\n<p>Contact: <a href=\"http:\/\/www.fi.muni.cz\/~hanka\">Hana Rudov\u00e1<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Laboratory seminars (PV273 in the course catalog) on Wednesday, 10:30 &#8211; 11:30, A505, FI MU, Botanick\u00e1 68, followed by an informal group lunch. The format of standard lectures: 30-40 minutes presentation + 15 minutes for questions. Slides are expected in English, and the presentation is in English or Czech, depending on the audience. For past [&hellip;]<\/p>\n","protected":false},"author":30,"featured_media":0,"parent":0,"menu_order":10,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages\/2896"}],"collection":[{"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/users\/30"}],"replies":[{"embeddable":true,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/comments?post=2896"}],"version-history":[{"count":679,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages\/2896\/revisions"}],"predecessor-version":[{"id":4266,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages\/2896\/revisions\/4266"}],"wp:attachment":[{"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/media?parent=2896"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}