Browsing by Subject "data storage"

Now showing 1 - 4 of 4

Access status: Open Access ,
A client-based encryption model for secure data storing in publicly available storage systems
(Wydawnictwa AGH, 2019) Retinger, Marek
This document presents a conceptual model of a system for protecting thedata stored in publicly available data storage systems. The main idea was toapply encryption on both the client and server sides that would consequentlyhave a significant impact on data security. The compatibility with existingsystems allows us to deploy the solution fast and at a low cost. The testsconducted on a simplified implementation have confirmed the solution’s validity,and they have shown some possible performance issues as compared to theclassical system (which can be easily bypassed).
Access status: Open Access ,
Data storage management using AI methods
(Wydawnictwa AGH, 2013) Funika, Włodzimierz; Szura, Filip
Data management and monitoring is an important issue in scientific computation. Scientists want to access their data as quickly as possible. Some experiments need to store a lot of data which have to be secure. By saying this we mean that this data can not disappear or be damaged also the data storage should be as cheap as possible. In this paper we present an approach to the automation of monitoring and management of data storage. We introduce a knowledge based system which is able to manage data, i.e., make decisions on migrating data, replicating or removing it. We discuss some of the existing solutions which are popular on the market. In this paper we aim to present our system which uses such AI techniques like fuzzy logic or a rule-based expert system to deal with data storage management. We exploit in this system a cost model to analyze the proposed solutions. The operations performed by our system are aimed to optimize the usage of the monitored infrastructure.
Access status: Open Access ,
Memoization method for storing of minimum-weight triangulation of a convex polygon
(Wydawnictwa AGH, 2019) Selimi, Aybeyan; Krrabaj, Samedin; Saračević, Muzafer; Pepić, Selver
This study presents a practical view of dynamic programming, specifically in the context of the application of finding the optimal solutions for the polygon triangulation problem. The problem of the optimal triangulation of polygon is considered to be as a recursive substructure. The basic idea of the constructed method lies in finding to an adequate way for a rapid generation of optimal triangulations and storing - them in as small as possible memory space. The upgraded method is based on a memoization technique, and its emphasis is in storing the results of the calculated values and returning the cached result when the same values again occur. The significance of the method is in the generation of the optimal triangulation for a large number of n. All the calculated weights in the triangulation process are stored and performed in the same table. Results processing and implementation of the method was carried out in the Java environment and the experimental results were compared with the square matrix and Hurtado-Noy method.
Access status: Open Access ,
SLA-oriented semi-automatic management of data storage and applications in distributed environments
(Wydawnictwa AGH, 2010) Król, Dariusz; Funika, Włodzimierz; Słota, Renata; Kitowski, Jacek
In this paper we describe a semi-automatic programming framework for supporting users with managing the deployment of distributed applications along with storing large amounts of data in order to maintain Quality of Service in highly dynamic and distributed environments, e.g., Grid. The Polish national PL-GRID project aims to provide Polish science with both hardware and software infrastructures which will allow scientists to perform complex simulations and in-silico experiments on a scale greater than ever before. We highlight the issues and challenges related to data storage strategies that arise at the analysis stage of user requirements coming from different areas of science. Next we present a solution to the discussed issues along with a description of sample usage scenarios. At the end we provide remarks on the current status of the implementation work and some results from the tests performed.