| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 58
First pagePrevious page123456Next pageLast page
1.
Visualization of alpha-beta game tree search
Emilija Taseva, 2019, undergraduate thesis

Abstract: Algorithms make up a crucial part of computer science studies. Learning and understanding new algorithms can be quite interesting, but also hard and complex, especially for students. Visualization can significantly help with the understanding of the dynamic behaviour of algorithms by visually displaying each step of the algorithm, its purpose and how it changes the data. Besides faster and more efficient learning, the better understanding can also lead to potential algorithm improvements in the future. The goal of this thesis is visualization of the alpha-beta tree search algorithm for determining the next optimal move in a two-player, zero-sum, complete information game. The algorithm is visualized using two games, Tic-Tac-Toe and Othello. The algorithm operation can also be demonstrated using a custom tree with parameters chosen by the user.
Keywords: algorithm visualization, minimax algorithm, alpha-beta pruning, adversarial search
Published: 08.11.2019; Views: 412; Downloads: 44
.pdf Full text (1,52 MB)

2.
Določanje sekvence DNK na osnovi Eulerjeve poti z uporabo izboljšanega Hierholzerjevega algoritma
Filip Mesarić, 2019, master's thesis

Abstract: In the master’s thesis we created the algorithm for DNA sequencing based on an Eulerian path and the improved Hierholzer’s algorithm. The theoretical part explains the graph theory, existing Eulerian path searching algorithms and Hierholzer's algorithmic implementations. Additionally, the theoretical part presents DNA sequencing and its most popular methods. The practical part focuses on the development of an application that shows DNA sequencing based on an Eulerian path and the improved Hierholzer's algorithm. The results represent an improvement of sequencing, taking into consideration time and distance measurements, for our implementation in comparison with the existing Hierholzer’s algorithm.
Keywords: DNA, Eulerian path, Hierholzer’s algorithm, DNA sequencing
Published: 15.07.2019; Views: 501; Downloads: 79
.pdf Full text (1,33 MB)

3.
4.
Design and implementation of a Fuzzy control algorithm on a programmable logic controller
Andrej Jozić, 2019, master's thesis

Abstract: V magistrskem delu je prikazano snovanje in uporaba mehkega (Fuzzy) regulacijskega sistema na primeru regulacije pretoka zraka skozi sistem dveh tlačnih posod in regulacije temperature grelca. Izvedba algoritma mehkega sklepanja je bila zasnovana na osnovi Siemens Fuzzy Control ++ orodja, ki pa ga v novejših krmilnikih ni bilo mogoče uporabiti. Razvit in implementiran je bil algoritem mehkega sklepanja v Siemens TIA portalu. V obeh primerih je bila izvedena primerjava mehkega regulatorja z linearnim PID regulatorjem. Za prikaz in analizo delovanja regulacijskega sistema je bil izdelan uporabniški vmesnik SCADA s programom Siemens WinCC.
Keywords: Fuzzy control system, Fuzzy inference algorithm, SIEMENS TIA portal, Temperature and flow control
Published: 26.04.2019; Views: 738; Downloads: 89
.pdf Full text (3,90 MB)

5.
Implementation aspects of a BDD package supporting general decision diagrams
Robert Meolic, 2016, invited lecture at foreign university

Abstract: General decision diagram is a loose term for a superset of different types of decision diagrams - we are interested in joining BDDs, FDDs, and different types of suppressed DDs, e.g. ZBDDs. I will present: The current state of our BDD package Biddy (functionalities and details about the original implementation aspects). Our ideas for efficient implementation of ZBDDs (which could be used for all types of suppressed DDs).New type od decision diagrams called ZFDD (somehow symmetric to ZBDD). A rough draft about the implementation of a package supporting general decision diagrams.
Keywords: Binary Decision Diagram, Zero-suppressed Binary Decision Diagram, Boolean function, Algorithm, BDD package, Biddy
Published: 26.10.2017; Views: 1649; Downloads: 62
.pdf Full text (1,07 MB)

6.
Intra-minute cloud passing forecasting based on a low cost iot sensor - a solution for smoothing the output power of PV power plants
Primož Sukič, Gorazd Štumberger, 2017, original scientific article

Abstract: Clouds moving at a high speed in front of the Sun can cause step changes in the output power of photovoltaic (PV) power plants, which can lead to voltage fluctuations and stability problems in the connected electricity networks. These effects can be reduced effectively by proper short-term cloud passing forecasting and suitable PV power plant output power control. This paper proposes a low-cost Internet of Things (IoT)-based solution for intra-minute cloud passing forecasting. The hardware consists of a Raspberry PI Model B 3 with a WiFi connection and an OmniVision OV5647 sensor with a mounted wide-angle lens, a circular polarizing (CPL) filter and a natural density (ND) filter. The completely new algorithm for cloud passing forecasting uses the green and blue colors in the photo to determine the position of the Sun, to recognize the clouds, and to predict their movement. The image processing is performed in several stages, considering selectively only a small part of the photo relevant to the movement of the clouds in the vicinity of the Sun in the next minute. The proposed algorithm is compact, fast and suitable for implementation on low cost processors with low computation power. The speed of the cloud parts closest to the Sun is used to predict when the clouds will cover the Sun. WiFi communication is used to transmit this data to the PV power plant control system in order to decrease the output power slowly and smoothly.
Keywords: photovoltaic power plant, cloud passing forecasting, algorithm, sensor, Raspberry Pi, camera, wide-angle lens, optical filters, internet of things
Published: 20.07.2017; Views: 1365; Downloads: 325
.pdf Full text (8,15 MB)
This document has many files! More...

7.
Linear recognition of generalized Fibonacci cubes $Q_h (111)$
Yoomi Rho, Aleksander Vesel, 2016, original scientific article

Abstract: The generalized Fibonacci cube $Q_h(f)$ is the graph obtained from the $h$-cube $Q_h$ by removing all vertices that contain a given binary string $f$ as a substring. In particular, the vertex set of the 3rd order generalized Fibonacci cube $Q_h(111)$ is the set of all binary strings $b_1b_2 ... b_h$ containing no three consecutive 1’s. We present a new characterization of the 3rd order generalized Fibonacci cubes based on their recursive structure. The characterization is the basis for an algorithm which recognizes these graphs in linear time.
Keywords: graph theory, Fibonacci cubes, recognition algorithm
Published: 10.07.2017; Views: 551; Downloads: 83
.pdf Full text (803,81 KB)
This document has many files! More...

8.
A new characterization and a recognition algorithm of Lucas cubes
Andrej Taranenko, 2013, original scientific article

Abstract: Fibonacci and Lucas cubes are induced subgraphs of hypercubes obtained by excluding certain binary strings from the vertex set. They appear as models for interconnection networks, as well as in chemistry. We derive a characterization of Lucas cubes that is based on a peripheral expansion of a unique convex subgraph of an appropriate Fibonacci cube.This serves as the foundation for a recognition algorithm of Lucas cubes that runs in linear time.
Keywords: graph theory, Lucas cubes, characterization, recognition algorithm
Published: 10.07.2017; Views: 618; Downloads: 68
.pdf Full text (563,10 KB)
This document has many files! More...

9.
A question-based design pattern advisement approach
Luka Pavlič, Vili Podgorelec, Marjan Heričko, 2014, original scientific article

Abstract: Design patterns are a proven way to build flexible software architectures. But the selection of an appropriate design pattern is a difficult task in practice, particularly for less experienced developers. In this paper, a question based design pattern advisement approach will be proposed. This approach primarily assists developers in identifying and selecting the most suitable design pattern for a given problem. We will also propose certain extensions to the existing Object-Oriented Design Ontology (ODOL). In addition to the advisement procedure, a new design pattern advisement ontology will be defined. We have also developed a tool that supports the proposed ontology and question-based advisement (OQBA) approach. The conducted controlled experiment and two surveys have shown that the proposed approach is beneficial to all software developers, especially to those who have less experience with design patterns.
Keywords: design patterns, pattern selection, ontology, semantic web, selection algorithm
Published: 06.07.2017; Views: 769; Downloads: 317
.pdf Full text (621,06 KB)
This document has many files! More...

10.
Computing the weighted Wiener and Szeged number on weighted cactus graphs in linear time
Blaž Zmazek, Janez Žerovnik, 2003, original scientific article

Abstract: Cactus is a graph in which every edge lies on at most one cycle. Linear algorithms for computing the weighted Wiener and Szeged numbers on weighted cactus graphs are given. Graphs with weighted vertices and edges correspond to molecular graphs with heteroatoms.
Keywords: mathematics, graph theory, Wiener number, Szeged number, weighted cactus, linear algorithm
Published: 05.07.2017; Views: 341; Downloads: 69
.pdf Full text (130,41 KB)
This document has many files! More...

Search done in 0.3 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica