A. Rouigueb, M. Maiza, Abderahmane Tkourt, Imed Cherchour
{"title":"Integration of Polynomials over n-Dimensional Simplices","authors":"A. Rouigueb, M. Maiza, Abderahmane Tkourt, Imed Cherchour","doi":"10.15439/2019F16","DOIUrl":"https://doi.org/10.15439/2019F16","url":null,"abstract":"Integrating an arbitrary polynomial function f of degree D over a general simplex in dimension n is well-known in the state of the art to be NP-hard when D and n are allowed to vary, but it is time-polynomial when D or n are fixed. This paper presents an efficient algorithm to compute the exact value of this integral. The proposed algorithm has a time-polynomial complexity when D or n are fixed, and it requires a reasonable time when the values of D and n are less than 10 using widely available standard calculators such as desktops.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123945954","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":"Search for the Memory Duplicities in the Java Applications Using Shallow and Deep Object Comparison","authors":"Richard Lipka, T. Potuzak","doi":"10.15439/2019F286","DOIUrl":"https://doi.org/10.15439/2019F286","url":null,"abstract":"In high-level object languages, such as Java, a problem of unnecessary duplicates of instances can easily appear. Although there can be a valid reason for maintaining several clones of the same data in the memory, often it indicates that the application can be refactored into a more efficient one. Unnecessary instances consume memory, but in case of Java applications can also have a significant impact on the application performance, as they might prolong the time needed for the garbage collection. In this paper, we are presenting a method and a tool that allows detecting duplicity in the heap dump of a Java application, based on the shallow and deep object comparison. The tool allows to identify the problematic instances in the memory and thus helps programmers to create a better application. On several case studies, we also demonstrate that the duplicates appear not only in the student projects and similar programs that often suffer from poor maintenance but also in commonly available Java tools and frameworks.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117152447","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":"On the Use of Predictive Models for Improving the Quality of Industrial Maintenance: an Analytical Literature Review of Maintenance Strategies","authors":"Oana Merkt","doi":"10.15439/2019F101","DOIUrl":"https://doi.org/10.15439/2019F101","url":null,"abstract":"Due to advances in machine learning techniques and sensor technology, the data driven perspective is nowadays the preferred approach for improving the quality of maintenance for machines and processes in industrial environments. Our study reviews existing maintenance works by highlighting the main challenges and benefits and consequently, it shares recommendations and good practices for the appropriate usage of data analysis tools and techniques. Moreover, we argue that in any industrial setup, the quality of maintenance improves when the applied data driven techniques and technologies: (i) have economical justifications; and (ii) take into consideration the conformity with the industry standards. In order to classify the existing maintenance strategies, we explore the entire data driven model development life cycle: data acquisition and analysis, model development and model evaluation. Based on the surveyed literature we introduce taxonomies that cover relevant predictive models and their corresponding data driven maintenance techniques.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129062858","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":"Proposal of Mechatronic Devices Control using Mixed Reality","authors":"Erich Stark, Erik Kučera, P. Drahoš, Oto Haffner","doi":"10.15439/2019F119","DOIUrl":"https://doi.org/10.15439/2019F119","url":null,"abstract":"The Internet of Things and mixed reality are now among the most important areas in research or in practice. The aim of this paper is to propose an appropriate way of connection of these two areas, where is possible to control and monitor mechatronic devices using a mobile device with augmented/mixed reality support. The main task will be to explore these options in the area and implement this solution as prototype. The proposed methodology for control and diagnostics of mechatronic devices is modern as it combines hardware management, a Unity3D engine for mixed reality development, and communication within the Internet of Things network.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117093380","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":"The Low-Area FPGA Design for the Post-Quantum Cryptography Proposal Round5","authors":"Michal Andrzejczak","doi":"10.15439/2019F230","DOIUrl":"https://doi.org/10.15439/2019F230","url":null,"abstract":"Post-Quantum Cryptography (PQC) is getting attention recently. The main reason of this situation is the announcement by the U.S. National Institute for Standard and Technology (NIST) about an opening of the standardization process for PQC. Recently NIST published a list of submissions qualified to the second round of this process. One of the selected algorithms is Round5, offering a key encapsulation mechamsm (KEM) and public key encryption (PKE). Due to high complexity of post quantum cryptosystems, only a few FPGA implementations have been reported to date. In this paper, we report results for low area purely-hardware implementation of Round5 targeting low cost FPGAs.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"464 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116186364","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":"Parallel cache-efficient code for computing the McCaskill partition functions","authors":"M. Pałkowski, W. Bielecki","doi":"10.15439/2019F8","DOIUrl":"https://doi.org/10.15439/2019F8","url":null,"abstract":"We present parallel tiled optimized McCaskill’s partition functions computation code. That CPU and memory intensive dynamic programming task is within computational biology. To optimize code, we use the authorial source-to-source TRACO compiler and compare obtained code performance to that generated with the state-of-the-art PluTo compiler based on the affine transformations framework (ATF). Although PLuTo generates tiled code with outstanding locality, it fails to parallelize tiled code. A TRACO tiling strategy uses the transitive closure of a dependence graph to avoid affine function calculation. The ISL scheduler is used to parallelize tiled loop nests. An experimental study carried out on a multi-core computer demonstrates considerable speed-up of generated code for the larger number of threads.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122036065","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":"Parameter Setting Problem in the Case of Practical Vehicle Routing Problems with Realistic Constraints","authors":"E. Žunić, D. Donko","doi":"10.15439/2019F194","DOIUrl":"https://doi.org/10.15439/2019F194","url":null,"abstract":"Vehicle Routing Problem (VRP) is the process of selection of the most favorable roads in a road network vehicle should move during the customer service, so as such, it is a generalization of problems of a commercial traveler. Most of the algorithms for successful solution of VRP problems are consisted of several controll parameters and constants, so this paper presents the data-driven prediction model for adjustment of the parameters based on historical data, especially for practical VRP problems with realistic constraints. The approach is consisted of four prediction models and decision making systems for comparing acquired results each of the used models.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133760309","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":"Playing the Sprint Retrospective","authors":"Maciej Wawryk, Yen Ying Ng","doi":"10.15439/2019F284","DOIUrl":"https://doi.org/10.15439/2019F284","url":null,"abstract":"In this paper, we report on a replication of the study by Przybylek & Kotecka [2017]. The aim of our study was to revise the work practices related to Sprint Retrospectives in Bluebay Polska Sp. z.o.o. by adopting collaborative games. The feedback received from two Scrum teams confirms the findings from the original study and indicates that collaborative games improve participants’ creativity, involvement, and communication as well as produce better results than the standard retrospective.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130946213","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}
Martin Max Röhling, Martin Grimmer, Dennis Kreußel, Jörn Hoffmann, Bogdan Franczyk
{"title":"Standardized container virtualization approach for collecting host intrusion detection data","authors":"Martin Max Röhling, Martin Grimmer, Dennis Kreußel, Jörn Hoffmann, Bogdan Franczyk","doi":"10.15439/2019F212","DOIUrl":"https://doi.org/10.15439/2019F212","url":null,"abstract":"Anomaly-based Intrusion Detection Systems (IDS) can be instrumental in detecting attacks on IT systems. For evaluation and training of IDS, data sets containing samples of common security-scenarios are essential. Existing data sets are not sufficient for training modern IDS. This work introduces a new methodology for recording data that is useful in the context of intrusion detection. The approach presented is comprised of a system architecture as well as a novel framework for simulating security-related scenarios.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"301 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132418000","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":"Supporting personalized care of older adults with vision and cognitive impairments by user modeling","authors":"Miroslav Macík, P. Bílek, Z. Míkovec","doi":"10.15439/2019F154","DOIUrl":"https://doi.org/10.15439/2019F154","url":null,"abstract":"We present a user modeling approach tailored to the user group of older adults with vision impairments. Our previous work with this user group has been followed by qualitative user research with the staff of a residential care facility for visually impaired older adults. We defined the structure of a user model that represents aspects related to personal psychological development and attributes that affect interaction with technologies. Furthermore, we present two generations of prototypes of administration UI for the user model. Results of the qualitative evaluation are discussed in the paper. This effort aims to help the personnel of specialized care institution in providing personalized care and make the interaction with technologies accessible for the group of visually impaired older adults with vision impairments.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124249239","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}