National Repository of Grey Literature 87 records found  1 - 10nextend  jump to record: Search took 0.01 seconds. 
Taxi service back-end
Březina, Lukáš ; Bureš, Tomáš (advisor) ; Bednárek, David (referee)
Nowadays services like Uber start to surpass taxi companies in comfort of transport. In this thesis, we create a back-end part of an application for taxi companies in smaller towns. This application provides an interface for creating and managing orders, employees, customers, and vehicles. As part of the system, we constructed order scheduler which calculates the order duration, estimated time of arrival and distributes the order between available drivers automatically. Overall the application increases the taxi company's efficiency and offers users a more comfortable experience.
Accelerating structure search in small-molecule databases
Kratochvíl, Miroslav ; Bednárek, David (advisor) ; Hoksza, David (referee)
Structure search is one of the valuable capabilities of small-molecule databases. Available chemical cartridges typically provide acceptable search performance for processing user queries, but do not scale satisfactorily with dataset size. This thesis presents Sachem, a new open-source chemical car- tridge that implements a novel method of substructure search, which em- ploys newly designed fingerprints stored in inverted indexes. The perfor- mance of the method was assessed on datasets that contain tens of mil- lions of molecules. Comparison of the performance to that of other available cartridges revealed improvements in overall search speed, scaling potential and screen-out efficiency. Additionally, the thesis presents an application of Sachem; a SPARQL service that augments existing semantic services by including results of substructure and similarity searches in small-molecule databases. The result offers new possibilities for simpler querying of the interoperable heterogeneous data sources. 1
Procedural code integration in streaming environments
Brabec, Michal ; Bednárek, David (advisor) ; Krall, Andreas (referee) ; Šimeček, Ivan (referee)
Title: Procedural code integration in streaming environments Author: Mgr. Michal Brabec Department: Department of Software Engineering Supervisor: David Bednárek, Ph.D. Abstract: Streaming environments and similar parallel platforms are widely used in image, signal, or general data processing as means of achieving high perfor- mance. Unfortunately, they are often associated with domain specific program- ming languages, and thus hardly accessible for non-experts. In this work, we present a framework for transformation of a procedural code to a streaming ap- plication. We selected a restricted version of the C# language as the interface for our system, because it is widely taught and many programmers are familiar with it. This approach will allow creating streaming applications or their parts using a widely known imperative language instead of the intricate languages specific to streaming. The transformation process is based on the Hybrid Flow Graph - a novel inter- mediate code which employs the streaming paradigm and can be further convert- ed into streaming applications. The intermediate code shares the features and limitations of the streaming environments, while representing the applications without platform specific technical details, which allows us to use well known graph algorithms to work with the...
Analýza paralelizovatelnosti programů na základě jejich bytecode
Brabec, Michal ; Bednárek, David (advisor)
Analysis of automatic program parallelization based on bytecode There are many algorithms for automatic parallelization and this work explores the possible application of these algorithms to programs based on their bytecode or similar intermediate code. All these algorithms require the identification of independent code segments, because if two parts of code do not interfere with one another then they can be run in parallel without any danger of data corruption. Dependence testing is an extremely complicated problem and in general application, it is not algorithmically solvable. However, independences can be discovered in special cases and then they can be used as a basis for application of automatic parallelization, like the use of vector instructions. The first step is function inlining that allows the compiler to analyze the code more precisely, without unnecessary dependences caused by unknown functions. Next, it is necessary to identify all control flow constructs, like loops, and after that the compiler can attempt to locate dependences between the statements or instructions. Parallelization can be achieved only if the analysis discovered some independent parts in the code. This work is accompanied by an implementation of function inlining and code analysis for the .NET framework.
FPVS: integrace FreePascalu do Visual Studia
Čamra, Václav ; Ježek, Pavel (advisor) ; Bednárek, David (referee)
The Pascal programming language was designed and is still used to this day to teach procedural imperative programming. However, there are no modern high quality integrated development environments (IDEs) that could be used by students to write in the Pascal programming language. In this thesis we attempt to fix this problem by creating a Visual Studio 2015 extension which would integrate Free Pascal programming language into Visual Studio. This extension adds a Free Pascal project into Visual Studio, allows for Free Pascal source code to be compiled, ran and debugged. Additionally, the extension adds syntax highlighting and code completion for subset of the Free Pascal language into Visual Studio. 1
Pascal with Truffle
Flimmel, Július ; Horký, Vojtěch (advisor) ; Bednárek, David (referee)
Trupple is an unconventional Pascal interpreter built on top of Oracle's Truffle frame- work. By using this framework, it is virtually platform independent because it runs in Java Virtual Machine and can also easily communicate with other Truffle-based languages and Java itself. The interpreter builds an abstract syntax tree from any Pascal source code and consequently executes the tree from its root node. It supports Pascal according to ISO 7185 standard and implements some commonly used exten- sions introduced by Borland's Turbo Pascal compiler. In this work, we describe the architecture of the interpreter, important design decisions, used technologies and we also provide a brief performance evaluation of Trupple. 1
SIMD code generator
Tuček, Karel ; Bednárek, David (advisor) ; Arcaini, Paolo (referee)
Title: SIMD code generator Author: Karel Tuček Department: Department of Software Engineering Supervisor: RNDr. David Bednárek, Ph.D., Department of Software Engineering Abstract: The center of our interest is a problem of pipelined realisation of a special case of data processing networks. These realisations are supposed to realise some computations on series of independent data sets while utilizing SIMD instructions. The aim of this paper is to theoretically investigate the possibilities and the problems of employment of control flow in these networks and also to implement a general framework suitable for generation of these realisations. The main idea is utilisation of an algorithm crawling over partitions of a network factorised with respect to its control flow. Our idea is that SIMD parallelism should take place on the same instruction realised across multiple data sets. We illustrate the problems relevant to employment of branching and loops in these networks. We especially discuss a problem of data ordering and also provide relevant proofs. In the analytical part, we show implementation of a general framework which we believe to be suitable for processing of these networks. We also provide examples utilising Intel's SIMD Streaming Extensions. Keywords: Processing networks SIMD Parallelism iii
A decompiler for Objective-C
Mráček, Jakub ; Yaghob, Jakub (advisor) ; Bednárek, David (referee)
Objective-C is a popular programming language primarily used on the OS X and iOS platforms. We present a practical approach to decompilation of programs written in Objective-C and compiled for the x86 and AArch64 architectures using LLVM. Based on already-known generic reverse engineering techniques and compiler theory, this thesis analyzes new challenges and opportunities that occur in Objective-C binaries. We then offer solutions and algorithms that allow a decompiler to better recognize the high-level structures commonly used in Objective-C source codes. The thesis introduces an implementation of a new decompiler called "Cricket", an interactive GUI application for OS X, which uses the described algorithms and pattern matching methods to reconstruct source code in Objective-C. The decompiler tries to maximize readability of the output and allows user interaction to further modify the generated source code. The implemented software is then evaluated on a popular open-source framework and the results are compared to a competing product. Powered by TCPDF (www.tcpdf.org)
Kind parser generator
Dzurenko, Tomáš ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
Title: Kind parser generator Author: Bc. Tomáš Dzurenko Department: Network and Labs Management Center Supervisor: RNDr. Michal Žemlička, Ph.D., Department of Software and Com- puter Science Education Abstract: This thesis introduces a generator which takes as its input a definition k-kind grammar and creates source code of analyzer or translator for the language generated by this kind grammar. Opposed to traditional LL(k) grammars, k-kind grammars allow usage of direct left recursion in its rules. This allows for more comfortable and clearer formulation of input grammar rules. Keywords: parser, translator, generator, C++, kind grammar
Compiler from Scheme to C/C++
Novák, Jan ; Yaghob, Jakub (advisor) ; Bednárek, David (referee)
Scheme is a simple language which is well suited for analyzing various constructs of programming languages and experiments with code optimization. To implement this language we use an intermediate code called continuation-passing-style, which is widely used in implementations of functional languages. We present its relation to conventional implementations which use stack to control the program. Then we describe simple methods of global static analysis of the language. Analyses are based on abstract interpretation which uses abstract garbage collector. It allows many optimizations such as variable globalization, variable renaming and elimination of unused assignments. Powered by TCPDF (www.tcpdf.org)

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