National Repository of Grey Literature 171 records found  1 - 10nextend  jump to record: Search took 0.01 seconds. 
Nearly All Reals Can Be Sorted with Linear Time Complexity
Jiřina, Marcel
We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed that the sorting key and pointers to the items being sorted are moved and individual items remain at the same place in the memory (in place sorting). In this case, the space complexity of the new variant of the algorithm is the same as the complexity of the quicksort. We also quantify the practical limits for possible sorting reals in a linear time. This possibility is assured under additional assumptions on the distribution of the sorting key, mainly the independence and identity of the distribution. Here we give a more general criteria easily applicable in practice. We also show that the algorithm is applicable for data that do not fulfill criteria for linear time complexity but even that the computation is faster than the system quicksort. A new, faster version of the algorithm is attached.
Decompositions of directed and undirected graphs
Pelikánová, Petra ; Loebl, Martin (advisor) ; Klimošová, Tereza (referee)
Eulerian graphs have a closed walk traversing each edge exactly once. Finding such a walk is a basic arc routing problem based on a road network. Most of the problems with applications in operational research are NP-hard. We describe a formal model of a road network and vehicle routes and formulate several arc routing problems motivated by winter road maintenance in the Czech Republic. The main part is focused on single vehicle routing problems on trees. We propose a new unfairness minimization problem for finding a vehicle route with properties that lead to a minimal number of resident complaints against unfair maintenance. Residents feel like they are skipped when the vehicle route has multiple trips and passes nearby without providing maintenance to their street. By reduction of the necklace splitting problem to the unfairness minimization problem we prove it is PPA-complete. Further, we define a restricted arc routing problem on trees which formalize condi- tions given by Czech legislation. We proved the existence of a polynomial algorithm for deciding whether a single vehicle route exists when there is a single priority for roads. If multiple priorities are used, we express conditions and conjectures when the problem has polynomial complexity. Finally, a utilization of the model is illustrated by an...
Algorithmization of social networking sites and its perception by adolescents
Hegedüš, Tomáš ; Švelch, Jaroslav (advisor) ; Reifová, Irena (referee)
The diploma thesis Algorithmization of social networks and its perception by adolescents deals with the issue of algorithms which lead to personalization of social networks. Their perception by children and adolescents is currently not sufficiently explored. In the theoretical part, I demonstrate how the current studies examine the perception of algorithms on a sample of the entire population, in the context of adolescents how they focus on social networks as a whole. Therefore, the ambition of this thesis is to research the intersection of these three spheres and its impact on adolescent's perception of algorithmisation of social networks. Through qualitative research using the method of semi-structured interviews, this thesis outlines trends that may prevail in this area. An analytical synthesis of knowledge also answers the questions of how adolescents are informed about the possibilities of influencing the selection and sorting of the content and whether they show interest in these possibilities. In the theoretical part, I introduce readers of this work to the issue of new media, how social media developed, including their convergence. Among the researched social networks are Facebook, Instagram and YouTube. To understand the comparison of reality and the statements of the respondents, in the...
Flat and formalistic approach in law
Pavlíček, Libor ; Maršálek, Pavel (referee)
Flat and formalistic approach in law Many processes in law take place automatically and through inertial force, without admitting one's free will and without encompassing values important to man (freedom, dignity, justice). The bearers of the process of automation in law are Machines (or Automats), i.e. tools ensuring primary legal certainty. However, in addition to the subpage of legal certainty, law also consists of the subpage of justice and effectiveness, which is not controlled by Automats, because their algorithms do not often reflect this subjective dimension in law. The trend of automation in law undoubtedly contributes to a number of improvements, however, there appear risks as well. Since the human soul cannot be programmed by Automats, it cannot be assumed that their decision-making, i.e. their output, will be fair and effective in all circumstances. However, in traditional approach in law this output is considered equal to a binding legal norm. As an example of Automat in the field of mobility the traffic lights may serve, in the field of state administration there are automatic forms or formulas, in the judiciary Automat is represented by a judge acting as a robot (subsumption automat), and artificial intelligence may be seen as the most sophisticated Automat of all. Automats are tools...
Grover's algorithm in Quantum computing and its applications
Katabira, Joseph ; Návrat, Aleš (referee) ; Hrdina, Jaroslav (advisor)
Kvantová výpočetní technika je rychle rostoucí obor informatiky, který přenáší principy kvantových jevu do našeho každodenního života. Díky své kvantové podstatě získávají kvantové počítače převahu nad klasickými počítači. V této práci jsme se zaměřili na vysvětlení základů kvantového počítání a jeho implementaci na kvantovém počítači. Zejména se zaměřujeme na popis fungování, konstrukci a implementaci Groverova algoritmu jako jednoho ze základních kvantových algoritmů. Demonstrovali jsme sílu tohoto kvantového algoritmu při prohledávání databáze a porovnávali ho s klasickými nekvantovými algoritmy pomocí implementace prostřednictvím simulačního prostředí QISKit. Pro simulaci jsme použili QASM Simulator a State vector Simulator Aer backends a ukázali, že získané výsledky korelují s dříve diskutovanými teoretickými poznatky. Toto ukazuje, že Groverův algoritmus umožňuje kvadratické zrychlení oproti klasickému nekvantovému vyhledávacímu algoritmu, Použitelnost algoritmu stejně jako ostatních kvantových algoritmů je ale stále omezena několika faktory, mezi které patří vysoké úrovně dekoherence a chyby hradla.
Use of Sequential Pattern Mining in Google Analytics
Viskievič, Gergő ; Šabatka, Pavel (referee) ; Luhan, Jan (advisor)
The bachelor thesis focuses on the design and development of an algorithm for sequential pattern mining in Google Analytics 4 data. Presents and analyzes available algorithms for sequential pattern mining. Analyzes the data model and the use of Google Analytics 4. Based on the requirements of business processes, the algorithm is proposed suitable for the expected input data.
Mobile Application Identification Based on TLS Data
Borbély, Richard ; Matoušek, Petr (referee) ; Burgetová, Ivana (advisor)
This thesis deals with identification of mobile applications based on data from network protocol TLS. It conducts a research of values from the TLS handshake, specifically of JA3, JA3S and SNI values. The work represents an application that includes an algorithm performing a classification over TLS data. The results of the classification represent information based on which we can decide, if the identification of the apps was successful. This method allowed to identify 17 of the 18 given applications. The benefit of this work is the ability to identify mobile apps based on JA3, JA3S and SNI values and for example, it can be used in network administration.
Glitch Sculpture (Time)
Blažek, Tomáš ; Vítek, Jiří (referee) ; Gabriel, Michal (advisor)
The bachelor's thesis encounters the phenomenon of error in digital technologies through a three-dimensional defective object. The geometric abstraction of the error is formed from the remains of a realistically modeled figure. The defect is entered into the production code for 3D printing via algorithms. Emphasis is placed on the applicability of such an algorithm for three-dimensional glitch art. The resulting sculpture thus looks exactly and yet relaxed in the spirit of contemporary tendencies working with error.
A Design of a Portion of Web Application for Overhead Cost Calculation
Florians, Patrik ; Luhan, Jan (referee) ; Neuwirth, Bernard (advisor)
Subject of this thesis is to design a web application for overhead calculation, whose purpose is to be a substitution for presently used solution, which is considered to be deprecated. This is being done as a part of strategy of SAP SE corporation for which the solution is designed. This ambition to develop and improve cloud portfolio of already existing applications of the company should lead to betterment of already existing applications of this type and in a long run an improvement of the company’s market position as well as it’s products. The thesis is divided into 3 parts. It begins with a description of theoretical concepts, tools and principles, which are then utilized in further chapters. The following chapter analyzes current state of the affairs, where it is illustrated, what the current solution looks like along with key parts of it. The final, 3rd chapter is dedicated to a description of implemented solution and it also closely describes key differences mentioned in chapter 2.
Algorithms for Parallel Searching in XML Datasets
Kruliš, Martin
This thesis will address the problems of indexing XML datasets and finding effective searching methods for indexed data. Defining data structures and algorithms that take highly parallel approach to the searching problem is considered to be main objective, therefore the implementation may benefit from the power of multicore CPUs. Prototype of such implementation will be presented with the thesis. Internal query model will be developed as a common layer. Multiple front-ends representing different query languages will be able to operate on the top of this model, thus the engine will not be dependent on any particular language. Sample front-end for a subset of XPath will be implemented along with the prototype.

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