Fostering Sustainable, Balanced, Equitable, Place-based and Inclusive Development of Rural-Urban Communities' Using Specific Spatial Enhanced Attractiveness Mapping ToolBox
Program
Horizon Europe
Provider
European Commission
Departments
Investigators
Period
2024 - 2026
Description
PoliRuralPlus
Open Science Plan-Track-Assess Pathways
Program
Horizon Europe
Provider
European Commission
Investigators
Period
2024 - 2027
Description
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.
Threat Detection Using Open Source (THOR)
Program
Open Calls for Security Research 2023-2029 (OPSEC)
Provider
Ministry of Interior
Investigators
Period
2026 - 2028
Description
The THOR project brings an innovative solution for detecting, analyzing and interpreting cyber threats based on domain names in encrypted traffic. It uses advanced machine learning, neurosymbolic AI and federated learning to strengthen the protection of critical infrastructure and increase the efficiency of security teams, especially in Security Operations Center (SOC) workplaces. The solution will enable the early detection of previously unknown threats and the automated creation of Threat Intelligence, thereby contributing to the protection of cyberspace. It will also be directly deployed in the network of the Czech domain administrator, CZ.NIC.
Algorithms and Game Comonads
Program
Horizon Europe
Provider
European Commission
Investigators
Period
2024 - 2026
Description
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.