Computer Science
Loading...
ISSN 1508-2806
e-ISSN: 2300-7036
Issue Date
2018
Volume
Vol. 19
Number
No. 4
Description
Reviewed by: Cengiz Acarturk, Mateusz Piech, Maciej Wozniak, Marek Karkula, Quangling Deng, Vladimir Korkhov, Juan Carlos Burguillo Rial, Elias Fernandez, Piotr Szuster
Journal Volume
Computer Science
Vol. 19 (2018)
Projects
Pages
Articles
Case study of project management in district court
(Wydawnictwa AGH, 2018) Kuźmicz, Monika; Orłowski, Cezary; Bober, Bartosz
The aim of this article is to present the project environment for the implementation of an IT system in a district court as well as an analysis of the entities and processes on the basis of which this model was built. It includes all of the identified processes that have been assigned responsible entities and the artifacts arising as a result of these processes. The analysis and identification of the processes, entities, and artifacts was carried out on the basis of the realized project of customizing and implementing an IT system. The customization involves the parameterization and adjustment of a standard solution to the needs of a specific recipient 18, in this case, to the needs of a district court. This case study is part of the research in the area of project management in the common courts for the needs of doctoral dissertations. The methodology of this research is presented in the third chapter.
A parallel algorithm of icsym forcomplexsymmetric linear systems in quantum chemistry
(Wydawnictwa AGH, 2018) Zhang, Yingchun; Lv, Quanyi; Xiao, Manyu; Xie, Gongnan; Breitkopf, Piotr
Computational effort is a common issue for solving large-scale complex symmetric linear systems, particularly in quantum chemistry applications. In order to alleviate this problem, we propose a parallel algorithm of improved conjugate gradient-type iterative (ICSYM). Using three-term recurrence relation and or- thogonal properties of residual vectors to replace the tridiagonalization process of classical CSYM, which allows to decrease the degree of the reduce-operator from two to one communication at each iteration and to reduce the amount of vector updates and vector multiplications. Several numerical examples are implemented to show that high performance of proposed improved version is obtained both in convergent rate and in parallel efficiency.
Policy-based sla storagemanagement model fordistributeddata storage services
(Wydawnictwa AGH, 2018) Nikolow, Darin; Słota, Renata; Polak, Stanisław; Pogoda, Marek; Kitowski, Jacek
There is high demand for storage related services supporting scientists in their research activities. Those services are expected to provide not only capacity but also features allowing for more exible and cost ecient usage. Such features include easy multiplatform data access, long term data retention, support for performance and cost dierentiating of SLA restricted data access. The paper presents a policy-based SLA storage management model for distributed data storage services. The model allows for automated management of distributed data aimed at QoS provisioning with no strict resource reservation. The problem of providing users with the required QoS requirements is complex, and therefore the model implements heuristic approach for solving it. The corresponding system architecture, metrics and methods for SLA focused storage management are developed and tested in a real, nationwide environment. Keywords distributed storage systems, quality of service, service level agreement, management model, heuristics.
An efficient approach for view selection for data warehouse using tree mining and evolutionary computation
(Wydawnictwa AGH, 2018) Thakare, Atul; Deshpande, Parag
The selection of a proper set of views to materialize plays an important role in database performance. There are many methods of view selection that use different techniques and frameworks to select an efficient set of views for materialization. In this paper, we present a new efficient scalable method for view selection under the given storage constraints using a tree mining approach and evolutionary optimization. The tree mining algorithm is designed to determine the exact frequency of (sub)queries in the historical SQL dataset. The Query Cost model achieves the objective of maximizing the performance benefits from the final view set that is derived from the frequent view set given by the tree mining algorithm. The performance benefit of a query is defined as a function of query frequency, query creation cost, and query maintenance cost. The experimental results show that the proposed method is successful in recommending a solution that is fairly close to an optimal solution.
Multi-agent blackboard architecture for supporting legal decision making
(Wydawnictwa AGH, 2018) Szymański, Łukasz; Śnieżyński, Bartłomiej; Indurkhya, Bipin
Our research objective is to design a system to support legal decision making using the multi-agent blackboard architecture. Agents represent experts that may apply various knowledge-processing algorithms and knowledge sources. Experts cooperate with each other using the blackboard to store facts about a current case. Knowledge is represented as a set of rules. The inference process is based on bottom-up control (forward chaining). The goal of our system is to find rationales for arguments that support different decisions for a given case by using precedents and statutory knowledge. Our system also uses top-down knowledge from statutes and precedents to interactively query the user for additional facts when such facts could affect the judgment. The rationales for various judgments are presented to the user, who may choose the most appropriate one. We present two example scenarios in Polish traffic law to illustrate the features of our system. Based on these results, we argue that the blackboard architecture provides an effective approach to modeling situations where a multitude of possibly conflicting factors must be taken into account in the decision making.