{"title":"Ant Colony Optimization with environment changes: An application to GPS surveying","authors":"A. Mucherino, S. Fidanova, M. Ganzha","doi":"10.15439/2015F33","DOIUrl":"https://doi.org/10.15439/2015F33","url":null,"abstract":"We propose a variant on the well-known Ant Colony Optimization (ACO) general framework where we introduce the environment to play an important role during the optimization process. Together with diversification and intensification, the environment is introduced with the aim of avoiding the search to get stuck at local optima. In this work, the environment is simulated by means of the Logistic map, that is used in ACO for perturbing the update of the pheromone trails. Our preliminary experiments show that our environmental ACO (eACO), with variable environment, outperforms the standard ACO on a set of instances of the GPS Surveying Problem (GSP).","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121348634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DiverGene: Experiments on controlling population diversity in genetic algorithm with a dispersion operator","authors":"A. Strzezek, Ludwik Trammer, M. Sydow","doi":"10.15439/2015F411","DOIUrl":"https://doi.org/10.15439/2015F411","url":null,"abstract":"We present diverGene - a novel, diversity-aware population selection operator for genetic algorithm - to be used especially for particularly complex and multi-criteria optimisation problems. Genetic algorithm is one of the most known evolutionary algorithms for solving hard optimisation problems. Many attempts have been made to improve its convergence rate and quality of the result. In this paper we propose a novel extension of the selection operator that makes it possible to control the level of diversity in the population. We discuss its theoretical background, including its computational hardness and propose an efficient way of computing it. The approach is implemented and tested on three hard optimisation problems: Knapsack Problem, Travelling Salesman Problem and a relatively new Travelling Thief Problem that might be viewed as the composition of the latter two. We report experimental results that seem to indicate that the novel approach has a potential to improve the quality of the results for some hard optimisation problems.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123267159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast artificial landmark detection for indoor mobile robots","authors":"D. Kartashov, Arthur Huletski, K. Krinkin","doi":"10.15439/2015F232","DOIUrl":"https://doi.org/10.15439/2015F232","url":null,"abstract":"Nowadays the big challenge in simultaneous localization and mapping (SLAM) of mobile robots is the creation of efficient and robust algorithms. Significant Number of SLAM algorithms rely on unique features or or use artificial landmarks received from camera images. Feature points and landmarks extraction from images have two significant drawbacks: CPU consumption and weak robustness depending on environment conditions. In this paper we consider performance issues for landmark detection, introduce a new artificial landmark design and fast algorithm for detecting and tracking them in arbitrary images. Also we provide results of performance optimization for different hardware platforms.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124056329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Agent System Simulation of Indoor Scenarios","authors":"R. Pax, J. Pavón","doi":"10.15439/2015F213","DOIUrl":"https://doi.org/10.15439/2015F213","url":null,"abstract":"This paper presents a flexible agent decision model for the simulation of indoor scenarios. There are different kind of applications with varying requirements, from the typical emergency evacuation where the physical interaction of crowds of agents are more relevant, to those that demand more sophisticated agent decision models as when testing smart environment applications. Existing tools usually focus on one of these issues, looking for efficiency in the solutions. The agent decision model in this paper tries to get a balance between efficiency and flexibility in the specification of the agent behavior in simple and complex situations. This is applied in a simulation framework for indoor scenarios, although it could be extended to other settings.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122330757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sentiment analysis of Twitter data within big data distributed environment for stock prediction","authors":"Michal Skuza, A. Romanowski","doi":"10.15439/2015F230","DOIUrl":"https://doi.org/10.15439/2015F230","url":null,"abstract":"This paper covers design, implementation and evaluation of a system that may be used to predict future stock prices basing on analysis of data from social media services. The authors took advantage of large datasets available from Twitter micro blogging platform and widely available stock market records. Data was collected during three months and processed for further analysis. Machine learning was employed to conduct sentiment classification of data coming from social networks in order to estimate future stock prices. Calculations were performed in distributed environment according to Map Reduce programming model. Evaluation and discussion of results of predictions for different time intervals and input datasets proved efficiency of chosen approach is discussed here.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132761991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A random traffic padding to limit packet size covert channels","authors":"A. Epishkina, K. Kogos","doi":"10.15439/2015F88","DOIUrl":"https://doi.org/10.15439/2015F88","url":null,"abstract":"This paper observes different methods for network covert channels constructing and describes the scheme of the packet length covert channel. The countermeasure based on random traffic padding generating is proposed. The capacity of the investigated covert channel is estimated and the relation between parameter of covert channel and counteraction tool is examined. Practical recommendation for using the obtained results are given.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122546525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Richard Ludvigh, Tomás Rebok, Vaclav Tunka, Filip Nguyen
{"title":"Ruby benchmark tool using docker","authors":"Richard Ludvigh, Tomás Rebok, Vaclav Tunka, Filip Nguyen","doi":"10.15439/2015F99","DOIUrl":"https://doi.org/10.15439/2015F99","url":null,"abstract":"The purpose of this paper is to introduce and describe a new Ruby benchmarking tool. We will describe the background of Ruby benchmarking and the advantages of the new tool. The paper documents the benchmarking process as well as methods used to obtain results and run tests. To illustrate the provided tool, results that were obtained by running a developed benchmarking tool on existing and available official ruby benchmarks are provided. These results document advantages in using various Ruby compilers or Ruby implementations.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114198211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Smart technologies for improved software maintenance","authors":"Zane Bicevska, J. Bičevskis, Ivo Oditis","doi":"10.15439/2015F170","DOIUrl":"https://doi.org/10.15439/2015F170","url":null,"abstract":"Steadily increasing complexity of software systems makes them difficult to configure and use without special IT knowledge. One of the solutions is to improve software systems making them “smarter”, i.e. to supplement software systems with features of self-management, at least partially. This paper describes several software components known as smart technologies, which facilitate software use and maintenance. As to date smart technologies incorporate version updating, execution environment testing, self-testing, runtime verification and business process execution. The proposed approach has been successfully applied in several software projects.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114243734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid metaheuristic for Portfolio Selection: Comparison with an exact solver and search space analysis","authors":"G. D. Tollo","doi":"10.15439/2015F7","DOIUrl":"https://doi.org/10.15439/2015F7","url":null,"abstract":"In this paper we use a metaheuristic approach to solve the Portfolio Selection problem, in a constrained formulation which is NP-hard and difficult to be solved by standard optimization methods. We are comparing the algorithm's performances with an exact solver and we are showing that different mathematical formulations lead to different algorithm's behaviour. Results show that our approach can be efficiently used to solve the problem at hand, and that a sound basin of attraction analysis may help developers and practitioners to design the experimental analysis.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124834931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Knowledge transfer from agri-food scientific papers to a knowledge base","authors":"Rafal Trójczak, R. Trypuz, A. Mazurek, P. Kulicki","doi":"10.15439/2015F209","DOIUrl":"https://doi.org/10.15439/2015F209","url":null,"abstract":"We address the problem of the access to the results of scientific publications in the agri-food domain. We focus on the description of main contributions of the papers treating them as accepted or rejected beliefs of their authors expressed in the form of scientific laws. We define the structure of different kinds of scientific laws present in the domain in the form of an ontology. The main concern of the paper is a process in which we proceed from the abstracts of papers to the ontological representation of laws. Moreover, we present examples of SPARQL queries which show how the resulting knowledge base can be used. Among the uses we point out discovering new scientific hypotheses and incoherencies among scientific laws.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122091047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}