|
|
Algorithms for integration of single-cell transcriptomic data
Ševčovičová, Zuzana ; Kolář, Michal (advisor) ; Abaffy, Pavel (referee)
Single-cell transcriptomics represents an innovative technique that allows for the examination of gene expression of individual cells in tissues or other complex biological samples. The data gen- erated through this approach offer crucial insights into various biological domains, such as em- bryology, oncology, and immunology. Understanding the functioning and mutual interactions of individual cells within tissues indeed requires knowledge of their individual expression profiles. Given the novelty of this method and technical challenges faced during data generation, com- parison of different samples may be difficult and affected by various batch effects. Effectively reconciling the information obtained regarding gene expression in distinct biological replicates or technical replicates generated by different methodologies may be onerous. The development of bioinformatics approaches to address this challenge is an ongoing process. The objective of this thesis is to: 1. survey the existing solutions for integration of single-cell transcriptomic data, 2. benchmark these solutions using publicly available datasets, specifically peripheral blood mononuclear cells, and 3. select the most suitable integration method to apply to a tumour microenvironment dataset generated by our laboratory. This bachelor...
|
|
|
Heart Rate Estimation from the PPG Signals
Šimčák, Petr ; Králík, Martin (referee) ; Kozumplík, Jiří (advisor)
This bachelor thesis focuses on heart rate estimation from photoplethysmographic (PPG) signals. The work utilizes two databases: CapnoBase and BUT PPG. The aim is not only to provide an overview of heart rate estimation methods from PPG signals but also to design, implement, and test algorithms for reliable detection of systolic peaks and heart rate determination. The advantages and limitations of each method are also discussed.
|
|
|
Delaunay Triangulation and Its Applications
Kojdová, Monika ; Lacko, Branislav (referee) ; Šeda, Miloš (advisor)
Delaunay triangulation is a significant geometric concept with applications in computer graphics, geographic information systems, medicine, and engineering. This thesis focuses on the theoretical principles of Delaunay triangulation, various algorithms, and their practical applications. The importance and potential of Delaunay triangulation in the digital world are explored, and future research directions are proposed.
|
|
|
Program for testing speed of cryptographic algorithms
Volf, Lukáš ; Sajdl, Ondřej (referee) ; Kadlec, Jaroslav (advisor)
Program for testing of speed of encryption algorithms is project aimed to build a program, which will be able to test specific properties of each single encryption algorithm protocol and results of testing will be saved for later statistical analysis. Program is going to be build in C# program language. In statistical analysis part all data and results from testing of each single algorithm will be processed and reviewed in transparent reports.
|
|
|
Person Identification
Svědiroh, Stanislav ; Honec, Peter (referee) ; Richter, Miloslav (advisor)
This thesis focuses on the person identification based on faces. The aim is to create a working solution of person identification for the authentication purposes utilizing the Microsoft Kinect v2 sensor. It contains a summary of the most used algorithms for facial data description and their comparison. Thesis also proposes a PC program that controls the sensor and collects the facial data, saves them, manages keypoint detection and their comparison.
|
|
|
Graphical Educational System
Hotař, Roman ; Seeman, Michal (referee) ; Štancl, Vít (advisor)
The purpose of this thesis is the proposal of the issue of education software for learning algorithms. Work approach to the problem, both from a theoretical point of view, of education and learning to new things, so and more important from a practical point of view for introduction to the process algorithmization. It also discusses the problem of learning algorithms in Czech schools and describes the resulting program, which was created along with this thesis. Contribution of this thesis is the summary of the requirements for the software and implementing software of this type, where is possible to demonstrate the problems and requirements of the draft programs of this kind. This thesis also describes the reactions of teachers to created application.
|
|
|
Library for Profiling of Data Structures of C/C++ Programs
Pavela, Jiří ; Rogalewicz, Adam (referee) ; Fiedor, Tomáš (advisor)
Performance bugs may greatly affect the quality of the system being developed and even cause irreversible damage in some critical sectors. Hence profiling - one of the currently most widespread technique of performance analysis - is usually applied to find the bugs. However, most of the current solutions commonly lack comprehensible graphical outputs and detailed analysis of algorithms in regard to their complexity. This thesis introduces a novel profiling tool which focuses on automatic estimation of complexity of dynamic data structures. The proposed approach collects statistical data out of program runs and uses regression analysis to find the most accurate model serving as an estimate of algorithmic complexity. The resulting prototype was subjected to a series of experiments that evaluate the accuracy of the results, demonstrate practical uses and illustrate the graphical output of the tool.
|
|
| |
|
|
.NET's LINQ Optimization
Šerý, Daniel ; Ryšavý, Ondřej (referee) ; Pluskal, Jan (advisor)
This thesis deals with LINQ (Language integrated query) and investigates possibilities of its implementation and optimization in C# language. Method of rewriting of query to procedural code is chosen and implemented. The goal is to provide a LINQ that can be used in code with the need for high speed. Regarding the program created for rewriting LINQ queries, the performance of most operators has been increased by 1.2x to 20x of System.Linq speed depending of rewritten algorithm, data source and provided information to rewriting program.
|
|
|
AI Algorithms
Petrželka, Jan ; Hrubý, Martin (referee) ; Janoušek, Vladimír (advisor)
This master's thesis describes artificial intelligence algorithms based on the book Artificial Inteligence: A Modern Approach by S. Russel and P. Norvig and implementation of the algorithms in the Squeak Smalltalk programming language with object oriented approach. Algorithms are based on pseudocode in the book and existing implementations in Lisp, Python and Java language. Main concepts are intelligent agents, agent simulation environments, state space search, game playing, planning, uncertainty and learning.
|
guest ::
