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
Departments
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.
Flow-based Encrypted Traffic Analysis
Program
Strategická podpora rozvoje bezpečnostního výzkumu ČR 2019 - 2025 (IMPAKT 1)
Provider
Ministry of Interior
Investigators
Code
VJ02010024
Period
2022 - 2025
Description
The project researches new methods of effective protection against cyber threats that misuse secured communication for cyber attacks against servers and computers in the environment of high-speed networks. Based on available metadata, the project will investigate Machine learning methods suitable for determining the characteristics of the encrypted network flows and associated risks. The system will be implemented using a hardware-accelerated traffic monitor and a software prototype for high-speed detection of security incidents, which will be reported to the SIEM tool. Further, a plug-in to the QRadar system for the incident analysis will be developed. The project outcomes will also include reference data sets of network traffic and a system for their collection and annotation.
Algorithms and Game Comonads
Program
Horizon Europe
Provider
European Commission
Departments
Code
101111373
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.