Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava)
Not a member yet
1506 research outputs found
Sort by
Maturity Model for IoT Adoption in Hospitals
Get PDFHospitals are facing a wide variety of challenges in terms of quality and efficiency of healthcare. Internet of Things (IoT) is a technology used by organisations to increase efficiency and quality by recording measurements for historic analysis. The data thus produced can then go on to inform future decisions and predictions. Unfortunately, the benefits provided for by a successful IoT adoption are currently out of reach for many hospitals. The lack of a maturity model for IoT adoption in hospitals aggravates this situation. The goal of defining and applying such a model is to assist hospitals in reaching a higher level of IoT maturity and thereby improving the quality of services delivered. This paper develops an IoT maturity model that is tailored to the healthcare industry with an emphasis on Belgian hospitals. The developed maturity model is grounded in scientific literature and industry expert opinions. Experts found the maturity model to be relevant, clear, and helpful for the hospitals' road to IoT adoption
Verification of Localization via Blockchain Technology on Unmanned Aerial Vehicle Swarm
Get PDFVerification of the geographic location of a moving device is vital. This verification is important in terms of ensuring that the flying systems moving in the swarm are in orbit and that they are able to task completion and manage their energy efficiency. Cyber-attacks on unmanned aerial vehicles (UAV) in a swarm can affect their position and cause various damages. In order to avoid this challenge, it is necessary to share with each other the positions of UAV in the swarm and to increase their accuracy. In this study, it is aimed to increase position accuracy and data integrity of UAV by using blockchain technology in swarm. Experiments were conducted on a virtual UAV network (UAVNet). Successful results were obtained from this proposed study
Asynchronous Spiking Neural P Systems with Multiple Channels and Symbols
Get PDFSpiking neural P systems (SNP systems, in short) are a class of distributed parallel computation systems, inspired from the way that the neurons process and communicate information by means of spikes. A new variant of SNP systems, which works in asynchronous mode, asynchronous spiking neural P systems with multiple channels and symbols (ASNP-MCS systems, in short), is investigated in this paper. There are two interesting features in ASNP-MCS systems: multiple channels and multiple symbols. That is, every neuron has more than one synaptic channels to connect its subsequent neurons, and every neuron can deal with more than one type of spikes. The variant works in asynchronous mode: in every step, each neuron can be free to fire or not when its rules can be applied. The computational completeness of ASNP-MCS systems is investigated. It is proved that ASNP-MCS systems as number generating and accepting devices are Turing universal. Moreover, we obtain a small universal function computing device that is an ASNP-MCS system with 67 neurons. Specially, a new idea that can solve ``block'' problems is proposed in INPUT modules
Weakly Complete Event Logs in Process Mining
Get PDFMany information systems have a possibility to record their execution, and, in this way, to generate a trace about events describing the real system behaviour. From behaviour example records in traces of the event log, the α-algorithm automatically generates a process model that belongs to a subclass of Petri nets, known as workflow nets. One of the basic limiting assumptions of α-algorithm is that the event log needs to be complete. As a result of attempting to overcome the problem of completeness of the event log, we introduced the notion of weakly complete event logs, from which our modified technique and algorithm can produce the same result as the α-algorithm from complete logs on parallel processes. Thereby weakly complete logs can be significantly smaller than complete logs, considering the number of traces they consist of. Weakly complete logs were used for the realization of our idea of interactive parallel business process model generation
Mitigating Drawbacks of Logistic Map for Image Encryption Algorithms
Get PDFThis paper identifies and analyses some drawbacks of the logistic map which is still one of the most used chaotic maps in image encryption algorithms. As some of the disadvantages are caused by inappropriate implementations of the logistic map, this paper proposes a set of rules which should lead to enhancement of the desired chaotic behavior. Probably the most important rule introduces alternating value of parameter utilized by the logistic map. With careful choice of values and an adapted quantization technique, some of the issues should be fixed and theoretically also the values of numerical parameters should be improved. These assumptions are verified by applying the proposed set of rules on an algorithm from our prior work. Effects of the proposed rules on the used algorithm are investigated and all necessary modifications are thoroughly discussed. The paper also compares obtained values of commonly used numerical parameters and computational complexity with some other image encryption algorithms based on more complex chaotic systems
Non-Redundant Implicational Base of Many-Valued Context Using SAT
Get PDFSome attribute implications in an implicational base of a derived context of many-valued context can be inferred from some other attribute implications together with its scales. The scales are interpretation of some values in the many-valued context therefore they are a prior or an existing knowledge. In knowledge discovery, the such attribute implications are redundant and cannot be considered as new knowledge. Therefore the attribute implicational should be eliminated. This paper shows that the redundancy problem exists and formalizes a model to check the redundancy
Decoding Five Times Extended Reed Solomon Codes Using Syndromes
Get PDFRecently a new family of five times extended Reed Solomon codes constructed over certain finite fields GF(2 zeta), where zeta >= 3 is an odd integer, was discovered. Until now only an erasure decoding algorithm for these codes was published. In this paper a new decoding algorithm is presented, which allows correcting up to two errors in a codeword from the five times extended Reed Solomon codes. The proposed decoding algorithm is based on syndrome usage
Activity Diagram Generation Based on Use-Case Textual Specification
Get PDFThe requirements specification phase is one of the most important during software development. In many cases, its outcome takes a form of a use-case model, which consists of use-case diagrams and supplementary use-case specifications. The requirements specification document is used by various stakeholders, starting from customers or their representatives, through architects, developers to testers. Each role may have specific preferences for the form of requirements specification. To solve this problem, we propose a template for writing use-cases based on the existing guidelines and a transformation method that creates an activity diagram from the use-case textual specification consistent with the proposed template. There are several tools that can generate activity diagrams based on textual specification, but none of them fully meets the requirements for the form of template or resulting diagram, which should be correct (textual specification semantics preserved), UML 2.5 syntax compliant and contain necessary data. The proposed transformation method is supported by a tool that transforms models at the same level of abstraction. The transformation itself is defined at the meta-model level. The general idea of model-to-model transformation is not new, but the meta-models are original and fit for purpose. The application of the method is demonstrated by several examples. Due to the frequent potential changes in created specifications, the automation of the process will save time. Moreover, a graphical representation of a use-case is easier to analyze and find errors or inconsistencies compared to a textual specification
Optimal Feature Subset Selection Based on Combining Document Frequency and Term Frequency for Text Classification
Get PDFFeature selection plays a vital role to reduce the high dimension of the feature space in the text document classification problem. The dimension reduction of feature space reduces the computation cost and improves the text classification system accuracy. Hence, the identification of a proper subset of the significant features of the text corpus is needed to classify the data in less computational time with higher accuracy. In this proposed research, a novel feature selection method which combines the document frequency and the term frequency (FS-DFTF) is used to measure the significance of a term. The optimal feature subset which is selected by our proposed work is evaluated using Naive Bayes and Support Vector Machine classifier with various popular benchmark text corpus datasets. The experimental outcome confirms that the proposed method has a better classification accuracy when compared with other feature selection techniques
Error Analysis of the Cholesky QR-Based Block Orthogonalization Process for the One-Sided Block Jacobi SVD Algorithm
Get PDFThe one-sided block Jacobi method (OSBJ) has attracted attention as a fast and accurate algorithm for the singular value decomposition (SVD). The computational kernel of OSBJ is orthogonalization of a column block pair, which amounts to computing the SVD of this block pair. Hari proposes three methods for this partial SVD, and we found through numerical experiments that the variant named "V2", which is based on the Cholesky QR method, is the fastest variant and achieves satisfactory accuracy. While it is a good news from a practical viewpoint, it seems strange considering the well-known instability of the Cholesky QR method. In this paper, we perform a detailed error analysis of the V2 variant and explain why and when it can be used to compute the partial SVD accurately. Thus, our results provide a theoretical support for using the V2 variant safely in the OSBJ method