Search

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The key target of Distributed Denial-of-Service (DDoS) attacks is to interrupt and suspend any available online services either executed for professional or personal gains. These attacks originate from the fast advancement in the number of insecure technologies. The attacks are caused due to the easy access to internet and advent of technology resulting to exponential growth of traffic volumes. DDoS attack remains most leading security risks to provisioning services. Also, the current embraced security mechanism for defense lacks flexibility and adequate resources to combat these attacks. Hence, there is need to embrace various other critical resources, where they can share the problem of mitigation. In addition, emerging technologies for instance smart contracts and blockchain offers for the sharing of these potential attacks information in an entirely automated and distributed manner. This paper recommends for a blockchain design which combines smart contracts and Machine Learning (ML) technologies, by presenting new ideal opportunities towards efficient DDoS mitigation solutions in variety of cooperative domains. Furthermore, the key advantage and benefits of this structure is deployment of still existing distributed and public infrastructure to blacklisted IP address or even advertise white, and the application of such an infrastructure with further defense mechanisms to current attacks of DDoS, deprived of considering distribution mechanisms or specialized registries, which facilitates the implementation of procedures across diverse domains. This paper further presents the demonstration and implementation features of this blockchain structure, discussion and study findings over these smart contracts and ML technologies. The study further concludes by recommending use of smart contract in collaborative block-chain design with ML for mitigating future attack of DDoS. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

For learning environments like schools and colleges, predicting the performance of students is one of the most crucial topics since it aids in the creation of practical systems that, among other things, promote academic performance and prevent dropout. The decision-makers and stakeholders in educational institutions always seek tools that help in predicting the number of failed courses for the students. These tools can help in finding and investigating the factors that led to this failure. In this paper, many supervised machine learning algorithms will investigate finding and exploring the optimal algorithm for predicting the number of failed courses of students. An imbalanced dataset will be handled with Synthetic Minority Oversampling TEchinque (SMOTE) to get an equal representation of the final class. Two feature selection approaches will be implemented to find the best approach that produces a highly accurate prediction. Wrapper with Particle Swarm Optimization (SPO) will be applied to find the optimal subset of features, and Info Gain with ranker to get the most correlated individual features to the final class. Many supervised algorithms will be implemented such as (Naïve Bayes, Random Forest, Random Tree, C4.5, LMT, Logistic, and Sequential Minimal Optimization algorithm (SMO)). The findings show that the wrapper filter with SPO-based SMOTE outperforms the Info-Gain filter with SMOTE and improves the performance of the algorithms. Random Forest outperforms the other supervised machine learning algorithms with (85.6%) in TP average rate and Recall, and (96.7%) in ROC curve. [ABSTRACT FROM AUTHOR]

This paper proposes a Machine Learning or ML-based strategy to accurately identify a possible heart disease patient. Unlike traditional diagnostic systems which are time-consuming and have human error involved to take care of the patient and diagnose the patients. The proposed system identifies whether the patient will face these kinds of diseases in near future or not. The system is developed based on machine learning techniques such as Naive Bayes, XGBoost gradient classifier, support vector machine, and decision tree. Some external factors were also considered which may lead to heart disease in the future. Furthermore, an integrated web application has been developed that alert and gives a user-friendly interface for recognition and prediction. Thirteen diagnostic factors and five environmental factors are analyzed. The proposed diagnosis system attained good precision as compared to previous methods recommended earlier. In addition, the system can easily be implemented in the public domain to spread awareness regarding heart disease, and it also talks about the possibility of heart disease in near future. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The rapid development of railway transportation towards high speed, high density and heavy load has led to even higher requirements for the safety of railway signal equipment. The safety of railway signal equipment is an important part of ensuring railway traffic safety, thus, it is very necessary to study a system that can diagnose the fault of railway signal equipment according to the actual situation. This article utilizes the deep learning algorithm of artificial intelligence for investigating the interlocking faults in the railway transportation. This paper uses ADASYN data synthesis method to synthesize few category samples, uses TF-IDF to extract features and transform vectors, and proposes a deep learning integration method based on combined weight. The results show that BiGRU has better overall classification performance when evaluated on the index of primary and secondary fault classification accuracy. The classification accuracy improvement of 5% is achieved for primary fault classification and the comprehensive evaluation index of secondary fault classification is improved by about 9%. It was revealed that when compared with ADASYN + BiLSTM neural network, the comprehensive evaluation index of primary fault classification accuracy is improved by about 6%, and the comprehensive evaluation index of secondary fault classification is improved by about 10%. It is demonstrated that deep learning integration is an effective method to improve the classification performance of turnout fault diagnosis model. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Today's fast paced industrial production requires automation at multiple steps during its process. Involving humans during the quality control inspection provides high degree of confidence that the end products are with the best quality. Workers involved in the control process may have an impact on production capacity by lowering the throughput, depending on the complexity of the control process at the time the control is carried out, during the process which is a time-critical operation, or after the process is completed. Companies are striving to fully automate their quality control stages of production and it comes naturally to focus on using various machine learning methods to help build a quality control pipeline which will offer high throughput and high degree of quality. In this paper we give an overview of applying several machine learning approaches in order to achieve an autonomous quality control pipeline. The applications for these approaches were used to help improve the quality control pipeline of two of the biggest manufacturing companies in Slovenia. One of the most challenging part of the study was that the tests had to be performed only on a small number of defective products, as is in reality. The motivation was to test several methods to find the most promising one for later actual application. [ABSTRACT FROM AUTHOR]

Stress represents our subconscious emotions. The majority of the unconscious content is unacceptable or unpleasant such as pain, anxiety, or conflict. Most individuals do not realize that they are experiencing stress. Prolonged stressful experiences are likely to lead to health problems and affect one's facial appearance, specifically wrinkles shown in the face. This paper discussed the introduction of facial stress with histogram information. There are three stages in recognizing the stress pattern on the face of the registered image, feature extraction and classification. The registered image process takes three important parts of the face, i.e. the eyes, nose, and mouth. The feature extraction process was performed using the histogram method, i.e. Gabor filter and HOG feature. Each extracted feature was used as the model input to determine whether or not an individual is suffering from stress. Two classification methods were applied to learn stress patterns from the extracted feature. The classification process was performed using SVM with six kernel functions and a Tree algorithm with three numbers of split. Each model is trained using ten cross-fold validation strategies. The test results showed that the Gabor filter and HOG feature accuracy were 55% and 65%, respectively. The effectiveness of the proposed method is evaluated by comparing it with the existing methods in term of accuracy. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The task of finding the best job candidates among a set of applicants is both time and resource-consuming, especially when there are lots of applications. In this concern, the development of a decision support system represents a promising solution to support recruiters and facilitate their job. In this paper, we present an intelligent decision support system named I-Recruiter, that ranks applicants according to the semantic similarity between their resumes and job descriptions; the ranking process is based on machine learning and natural language processing techniques. I-Recruiter is composed of three sequentially connected blocks namely 1) Training block: which is responsible for training the model from a set of resumes, 2) Matching block: that is responsible for matching the resumes to the corresponding job description, and 3) Extracting block: that is responsible for extracting the top n ranked candidates. Experimental results for accuracy and performance showed that I-recruiter is capable of doing the job with high confidence and excellent performance. [ABSTRACT FROM AUTHOR]

The estimation of the Barthel Index scale (BI) is a significant method for measuring the performance of Activities Daily Living (ADL), where the prediction of ADL is crucial for providing rehabilitation care management and recovery for patients after stroke, therefore in this paper, nine various Machine Learning (ML) algorithms were implemented in a medical dataset contains 776 records from 313 patients 208 of them are men: 208 and 150 are women with multiple features collected from them for predicting and classifying the BI status as clinical decision support for determining the ADL of post-stroke patients. Meanwhile, we have applied feature selection using the chi-squared test to reduce the number of features in the dataset. The results showed that the Decision Tree (DT), XGBoost (XGB), and AdaBoost (ADB) classifiers performed the highest performance achieved with 100% correctness in terms of accuracy, sensitivity, specificity, error, and Area Under Curve (AUC) on both the full and reduced features datasets. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In the library, the prediction and estimation of book borrowing plays an important role in library work. Based on the data mining method, this paper analyzed the prediction and estimation of book borrowing. Firstly, the radial basis function neural network (RBFNN) was analyzed. Then, the improved ant colony algorithm (IACO) was used to obtain the optimal parameters of RBFNN, and then the IACO-RBFNN model was established to realize the prediction and estimation of book borrowing. The results showed that the improved model had advantages in training time, iteration times, and error compared with BPNN and RBFNN. The results of book prediction and estimation showed that the results obtained by the IACORBFNN model were closer to the actual book borrowing situation, with smaller error and higher precision (97.09%), and its precision was 11.18% and 4.74% higher than BPNN and RBFNN respectively. The training time and testing time of the IACO-RBFNN model were 5.12 s and 1.03 s, respectively, which were significantly shorter than the other two methods. The results show that the IACO-RBFNN model has a good performance in the prediction and estimation of book borrowing and can be further promoted and applied in practice. [ABSTRACT FROM AUTHOR]

Many projects fail each year simply because a risk has been misjudged, ignored or unidentified. An essential motivation for analyzing the risk of a project is to inform managers in order to reduce the risk, and therefore the loss of the project. Risk analysis can help identify the best actions that would reduce the risk and assess by how much. In the last decades, the Fuzzy Cognitive Map emerged as a powerful tool for modeling and supervising dynamic interactions in complex systems. There is two ways to construct them, the first way by experts of domain and the second way by learning method based on the historical of data. In this paper, we develop a new learning fuzzy cognitive maps based on a reinforcement learning algorithm so called Q-learning and we propose here a new formulation of kosko causality principle. This connection between fuzzy cognitive maps and reinforcement learning allows us to choose based on the historical of data learning process the best and the most important connections between concepts. In this work, we illustrate the effectiveness of the proposed approach by modeling and studying the analysis of project risk management as an economic decision support system. [ABSTRACT FROM AUTHOR]

In recent years, machine learning algorithms have been applied widely in various fields such as health, transportation, and the autonomous car. With the rapid developments of deep learning techniques, it is critical to take the security concern into account for the application of the algorithms. While machine learning offers significant advantages in terms of the application of algorithms, the issue of security is ignored. Since it has many applications in the real world, security is a vital part of the algorithms. In this paper, we have proposed a mitigation method for adversarial attacks against machine learning models with an autoencoder model that is one of the generative ones. The main idea behind adversarial attacks against machine learning models is to produce erroneous results by manipulating trained models. We have also presented the performance of autoencoder models to various attack methods from deep neural networks to traditional algorithms by using different methods such as non-targeted and targeted attacks to multi-class logistic regression, a fast gradient sign method, a targeted fast gradient sign method and a basic iterative method attack to neural networks for the MNIST dataset. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Automatic human facial recognition has been an active reasearch topic with various potential applications. In this paper, we propose effective multi-task deep learning frameworks which can jointly learn representations for three tasks: smile detection, emotion recognition and gender classification. In addition, our frameworks can be learned from multiple sources of data with different kinds of task-specific class labels. The extensive experiments show that our frameworks achieve superior accuracy over recent state-of-the-art methods in all of three tasks on popular benchmarks. We also show that the joint learning helps the tasks with less data considerably benefit from other tasks with richer data. Razvita je izvirna metoda globokih nevronskih mrež za tri hkratne naloge: prepoznavanje smeha, custev in spola. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)