Studia Informatica


Volume: 1-2(20)
Year: 2016
Publishing: Publishing House of University of Natural Science
Scientific Editor: Wojciech Penczek,
Review Board: PDF File
ISSN: 1731-2264

Contents

Barczak A., Zacharczuk D., Pluta D.,
Methods of optimization of distributed databases in oracle – part 1
pp. 5-15
Abstract: The paper presents actions required to tune a distributed database to obtain optimal the performance. Each method and its impact on the performance of a database depending on the environment or configuration is discussed. The last part of the paper describes the stages of the process and data to be collected to obtain positive results.
Download PDF file
Mikułowski D., Terlikowski G., Brzostek-Pawłowska J.,
Virtual cubarithms – innovative assistive technology for teaching the blind and visually impaired students traditional columnar layout operations
pp. 17-25
Abstract: Blind students face significant barriers in their mathematical education. Despite currently available computer technologies they are not able to perform some simple operations, for instance, traditional columnar layout calculations, using a sheet of paper like their sighted peers. They have to use a traditional tool, namely, a cubarithm slate. In this paper a solution has been proposed to help blind students to learn and perform basic mathematical calculations with the help of a mobile device with touch screen. It is a Virtual Cubarithm application developed as a part of a larger research project called PlatMat. PlatMat is a special mobile platform supporting sighted teachers and their visually impaired students mathematical and physical education. Virtual cubarithm is a tool for learning traditional columnar layout calculations by visually impaired students. It is meant to replace traditional cubarithm slates, which are still in use.
Download PDF file
Novikov S.,
Parallel constructing of the shortest coverings of large Boolean matrices
pp. 27-37
Abstract: The paper presents two options of the parallel algorithm for finding the shortest covering of a large Boolean matrix, where the decomposition of the initial matrix into matrices of smaller sizes is based on the partitioning of rows. The parallel algorithm COVMB contains sequential algorithms for partitioning of initial m × n Boolean matrix on submatrices, building special matrices, summering of the shortest coverings of special Boolean matrices with smaller sizes as well as the sequential algorithm SECNOP for finding the shortest coverings of smaller Boolean matrices.
Download PDF file
Wesołowski Z.,
The scalarization approach for multi-objective optimization of network resource allocation in distributed systems
pp. 39-52
Abstract: The paper presents a multi-objective optimization framework to the network resource allocation problem, where the aim is to maximize the bitrates of data generated by all agents executed in a distributed system environment. In the proposed approach, the utility functions of agents may have different forms, which allows a more realistic modeling of phenomena occurring in computer networks. A scalarizing approach has been applied to solve the optimization problem.
Download PDF file
Wiśniewski M., Niewiadomski A.,
Applying artificial intelligence algorithms in MOBA games
pp. 53-64
Abstract: Multiplayer Online Battle Arena games focus mainly on struggles between two teams of players. An increasing level of cyberbullying [1] discourages new players from the game and they often chose a different option, that is, a match against opponents controlled by the computer. The behavior of artificial foes can be dynamically fitted to user’s needs, in particular with regard to the difficulty of the game. In this paper we explore different approaches to provide an intelligent behavior of bots basing on more human-like combat predictions rather than instant, scripted behaviors.
Download PDF file