National Repository of Grey Literature 159 records found  1 - 10nextend  jump to record: Search took 0.01 seconds. 
Performance and Usability Improvements for Data Lineage Analysis of C# Programs
Kleprlík, Jan ; Parízek, Pavel (advisor) ; Bednárek, David (referee)
The Manta Flow is a highly automated static analysis platform producing data lineage over its input and representing it in a graph. The platform performs analysis on various technologies and programming languages via specialised scanners. One of the scanners performs analysis of C# code, or rather its compiled alternative Common Intermediate Language. While the scanner was already capable of analysing non-trivial scenarios, it lacked in some aspects that held it up from its broader adoption by customers. The main issues are low support for analysis of real-life scenarios such as web applications or embedded code in other technologies, sub-optimal performance and imprecise lineage output. As a part of this thesis, we improved the precision, scalability and performance of the scanner on multiple levels of abstractions, from analysis of the CIL to modifications of core high-level analysis algorithms. We added support for analysis of the ASP.NET web endpoints and enabled the C# scanner to be used as a service for analysis of embedded code in other technologies. We improved the precision of the resulting lineage for existing scenarios by modifying the core algorithms used throughout the analysis and optimized the analysis process to lift its performance. 1
High-performance exploration and querying of selected multi-dimensional spaces in life sciences
Kratochvíl, Miroslav ; Bednárek, David (advisor) ; Glaab, Enrico (referee) ; Svozil, Daniel (referee)
This thesis studies, implements and experiments with specific application-oriented approaches for exploring and querying multi-dimensional datasets. The first part of the thesis scrutinizes indexing of the complex space of chemical compounds, and details a design of high-performance retrieval system for small molecules. The resulting system is then utilized within a wider context of federated search in heterogeneous data and metadata related to the chemical datasets. In the second part, the thesis focuses on fast visualization and exploration of many-dimensional data that originate from single- cell cytometry. Self-organizing maps are used to derive fast methods for analysis of the datasets, and used as a base for a novel data visualization algorithm. Finally, a similar approach is utilized for highly interactive exploration of multimedia datasets. The main contributions of the thesis comprise the advancement in optimization and methods for querying the chemical data implemented in the Sachem database cartridge, the federated, SPARQL-based interface to Sachem that provides the heterogeneous search support, dimensionality reduction algorithm EmbedSOM, design and implementation of the specific EmbedSOM-backed analysis tool for flow and mass cytometry, and design and implementation of the multimedia...
Shape grammars for level generation in an action RPG game
Kalva, Tomáš ; Černý, Vojtěch (advisor) ; Bednárek, David (referee)
Third-person 3D action role-playing games inspired by Dark Souls (souls-likes) have recently gained a lot of popularity, but are difficult to develop due to the amount of gameplay and content required. In this thesis, we describe a level-generation framework that aids with prototyping souls-likes. We use shape grammars combined with a grid- based procedural modeler to create the environment. Additional script execution can be intertwined with the grammar, to allow for additional mechanics, such as adding enemies, items and locking parts of the levels. The framework is best fit for generating level sequences and allows designers to create a large amount of varied content and game mechanics with ease. We demonstrate usage of the framework by creating a playable game with it. The code of the game is available inside of the framework that's a part of electronic attachments. 1
Peer-to-peer network for newspaper publication
Medvecký, Michal ; Bednárek, David (advisor) ; Zavoral, Filip (referee)
Easy, simple and free as in freedom. These are the requirements for ev- eryday access to information in newspapers. In this thesis we will create such environment based on network. We are designing a protocol for com- munication between peers, with messages being encrypted and with article verification upon download. Protocol ensures operation of newspaper as an institution with support for journalists and article publication. After an ar- ticle is downloaded by the reader, it becomes available for further sharing inside the network. With readers and newspaper being the only sources of articles, we ensure protection of information inside the network.
Data Lineage Analysis Service for Embedded Code
Jurčo, Michal ; Parízek, Pavel (advisor) ; Bednárek, David (referee)
Data integration tools often use embedded code for data manipulation tasks. Popular examples of such tools include AWS Glue data integration service, Databricks platform, Snowflake data cloud or SQL Server Integration Services (SSIS). Embedded code is typi- cally written in programming languages such as Python, Java, C# or JavaScript. Manta Flow is an automated platform that can analyze data lineage in database models, data pipelines of data integration tools, and in application source code, but it lacks the ability to analyze embedded code. In this work, we discussed potential ways to extend the capabilities of Manta Flow with the ability to analyze data lineage in embedded code. We created a general design of a reusable Embedded Code Service that leverages the existing potential of data flow analysis of source code, and uses it to analyze embedded code. We implemented a specialization of this service for the Python programming language, and to demonstrate its usefulness, we designed and implemented a prototype of data lineage scanner for AWS Glue data integration service. This scanner extensively uses the service to analyze data lineage in embedded Python scripts, which we demonstrated on a realistic example. 1
Peer-to-peer network for newspaper publication
Medvecký, Michal ; Bednárek, David (advisor) ; Zavoral, Filip (referee)
Easy, simple and free as in freedom. These are the requirements for ev- eryday access to information in newspapers. In this thesis we will create such environment based on network. We are designing a protocol for com- munication between peers, with messages being encrypted and with article verification upon download. Protocol ensures operation of newspaper as an institution with support for journalists and article publication. After an ar- ticle is downloaded by the reader, it becomes available for further sharing inside the network. With readers and newspaper being the only sources of articles, we ensure protection of information inside the network.
Inference-driven resource managemenent and polymorphism in systems programming
Klepl, Jiří ; Kratochvíl, Miroslav (advisor) ; Bednárek, David (referee)
Systems programming languages facilitate the implementation of software that runs in restricted environments close to the hardware, such as operating systems, drivers, and real-time and embedded systems. Implementation of desirable features of such languages, such as generic programming and type system capabilities that prevent programmer errors, are complicated by strict constraints on the run-time properties of the program. This thesis explores a novel combination of C-- language with advanced type system features that allow type checking of highly polymorphic generic code and demonstrates type-driven resource management in this language. As the main result, the thesis provides a proof-of-concept in a prototype compiler of an extended ver- sion of C-- to LLVM and describes a type system based on deferred constraint solving that is capable of type inference in the presence of multi-parameter typeclasses and C-- subtypes. We demonstrate the functionality of the type system and the compiler on selected program examples and report several identified design challenges that may be addressed to make the system more practical. 1
Home automation
Kytka, Jan ; Obdržálek, David (advisor) ; Bednárek, David (referee)
Title: Home automation Author: Jan Kytka Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: RNDr. David Obdržálek, Ph.D., Department of Theoretical Computer Science and Mathematical Logic Abstract: In the area of home automation and control based on data from input units, there are many commercial and hobby solutions. They offer different paradigms for repre- senting control rules, such as description of trigger conditions and events, gate networks, etc. We analyzed the shortcomings of event-driven systems and, based on them, we de- signed and implemented an application which represents the rules as explicit transition function expressions. We showed how to formulate more complex control tasks in this different paradigm and had it pre-tested with a small sample of users. They agreed that it is very usable, even if perhaps more difficult to understand. Keywords: automation expressions control application MQTT IoT ASP.NET 1
A type system for tracking of unsafe side effects
Beneš, Jiří ; Bednárek, David (advisor) ; Šefl, Vít (referee)
The current mainstream programming languages do not explicitly track side effects of the programs, such as the possibility of allocating memory, throwing an exception, and performing I/O actions. We create a fully speci- fied, novel type system based on graded comonads which can express opt-in, granular safety by annotating expressions which are safe with respect to a set of side effects. The advantages of granular safety are demonstrated using a proof-of-concept practical implementation which allows user-specified side effects tracked by our system. 1
Kind ParserConstructor for Java
Kuziel, Peter ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
The work introduces an implementation of parser constructor, based on kind grammars. Kind grammars allow using simple left recursion in syntactic rules, which makes it easier to work with certain constructions such as arithmetic expressions, that are formulated less comprehensibly when using traditional approach with LL(k) grammars.

National Repository of Grey Literature : 159 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.