Projekty

2024 - 2026

PoliRuralPlus

2024 - 2027

The project deals with streamlining the work with FAIR data in research - their planning (plan), monitoring (track) and evaluation (assess). It is primarily about introducing interoperability between existing DMP creation tools, SKG-type services and evaluation tools. Likewise, other supporting tools related to research data management will be incorporated. The results of the project will be verified by a number of pilots across Europe.

2026 - 2028

Projekt THOR přináší inovativní řešení pro detekci, analýzu a interpretaci kybernetických hrozeb na základě doménových jmen v šifrovaném provozu. Využívá pokročilé strojové učení, neurosymbolickou AI a federativní učení s cílem posílit ochranu kritické infrastruktury a zvýšit efektivitu práce bezpečnostních týmů, zejména na pracovištích typu Security Operations Center (SOC). Řešení umožní včasné odhalení i dosud neznámých hrozeb a automatizovanou tvorbu Threat Intelligence, čímž přispěje k ochraně kyberprostoru. Bude také přímo nasazeno v síti správce české domény, CZ.NIC.

2024 - 2026

The emerging theory of game comonads establishes a fruitful interplay between category theory, mathematical logic, and algorithms. This theory has shown its power when obtaining new Lovasz-type theorems, preservation theorems and decomposition theorems in finite model theory. In our recent work we show that the theory of game comonads can be leveraged to obtain the two traditional Courcelle theorems, stating FPT decidability of monadic second order logic on classes of bounded tree-width and clique-width. This result is only a first step in concrete algorithmic applications of the theory. The abstract setting of game comonads is a good candidate for a systematic treatment of algorithmic problems. The first objective of the project is to formulate a general theory of FPT decidability in terms of game comonads. To start with, we describe some of the important model-theoretic algorithms.