Acta Cybern.Pub Date : 2021-03-18DOI: 10.14232/ACTACYB.284211
Á. Révész, Norbert Pataki
{"title":"Visualisation of Jenkins Pipelines","authors":"Á. Révész, Norbert Pataki","doi":"10.14232/ACTACYB.284211","DOIUrl":"https://doi.org/10.14232/ACTACYB.284211","url":null,"abstract":"Continuous Integration (CI) is an essential approach in modern software engineering. CI tools help merging the recent commits from the developers, thus the bugs can be realized in an early phase of development and integration hell can be avoided. Jenkins is the most well-known and most widely-used CI tool. \u0000Pipelines become first-class citizen in Jenkins 2. Pipelines consist of stages, such as compiling, building Docker image, integration testing, etc. However, comprehensive Jenkins pipelines are hard to see through and understand. In this paper, we argue for a modern visualisation of Jenkins pipelines. We present our solution for making Jenkins pipelines comprehensible on the dashboard.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128302780","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}
Acta Cybern.Pub Date : 2021-03-18DOI: 10.14232/ACTACYB.284349
Dániel Horpácsi, Judit Köszegi, D. J. Németh
{"title":"Towards a Generic Framework for Trustworthy Program Refactoring","authors":"Dániel Horpácsi, Judit Köszegi, D. J. Németh","doi":"10.14232/ACTACYB.284349","DOIUrl":"https://doi.org/10.14232/ACTACYB.284349","url":null,"abstract":"Refactoring has to preserve the dynamics of the transformed program with respect to a particular definition of semantics and behavioral equivalence. Apparently, it is always challenging to relate executable refactoring implementations with the formal semantics of the transformed language. There are a number of approaches to specifying program transformations on various kinds of program models, but trustworthiness of refactoring is still to be improved by means of formal verification. We propose a specification formalism and a generic framework for its processing, which claims to allow semi-automatic execution and formal verification, as well as to be adaptable to multiple paradigms.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128139948","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}
Acta Cybern.Pub Date : 2021-02-03DOI: 10.14232/ACTACYB.282969
Péter Podlovics, Csaba Hruska, Andor Pénzes
{"title":"A Modern Look at GRIN, an Optimizing Functional Language Back End","authors":"Péter Podlovics, Csaba Hruska, Andor Pénzes","doi":"10.14232/ACTACYB.282969","DOIUrl":"https://doi.org/10.14232/ACTACYB.282969","url":null,"abstract":"GRIN is short for Graph Reduction Intermediate Notation, a modern back end for lazy functional languages. Most of the currently available compilers for such languages share a common flaw: they can only optimize programs on a per-module basis. The GRIN framework allows for interprocedural whole program analysis, enabling optimizing code transformations across functions and modules as well. \u0000Some implementations of GRIN already exist, but most of them were developed only for experimentation purposes. Thus, they either compromise on low-level efficiency or contain ad hoc modifications compared to the original specification. \u0000Our goal is to provide a full-fledged implementation of GRIN by combining the currently available best technologies like LLVM, and evaluate the framework's effectiveness by measuring how the optimizer improves the performance of certain programs. We also present some improvements to the already existing components of the framework. Some of these improvements include a typed representation for the intermediate language and an interprocedural program optimization, the dead data elimination.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116548420","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}
Acta Cybern.Pub Date : 2021-02-03DOI: 10.14232/ACTACYB.285798
Etienne Bertin, E. Brendel, B. Hérissé, Julien Alexandre Dit Sandretto, Alexandre Chapoutot
{"title":"Prospects on Solving an Optimal Control Problem with Bounded Uncertainties on Parameters using Interval Arithmetics","authors":"Etienne Bertin, E. Brendel, B. Hérissé, Julien Alexandre Dit Sandretto, Alexandre Chapoutot","doi":"10.14232/ACTACYB.285798","DOIUrl":"https://doi.org/10.14232/ACTACYB.285798","url":null,"abstract":"An interval method based on the Pontryagin Minimum Principle is proposed to enclose the solutions of an optimal control problem with embedded bounded uncertainties. This method is used to compute an enclosure of all optimal trajectories of the problem, as well as open loop and closed loop enclosures meant to enclose a concrete system using an optimal control regulator with inaccurate knowledge of the parameters. The differences in geometry of these enclosures are exposed, as well as some applications. For instance guaranteeing that the given optimal control problem will yield a satisfactory trajectory for any realization of the uncertainties or on the contrary that the problem is unsuitable and needs to be adjusted.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116938111","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}
Acta Cybern.Pub Date : 2021-02-03DOI: 10.14232/ACTACYB.285729
Olivier Mullier, Julien Alexandre Dit Sandretto
{"title":"Validated Trajectory Tracking using Flatness","authors":"Olivier Mullier, Julien Alexandre Dit Sandretto","doi":"10.14232/ACTACYB.285729","DOIUrl":"https://doi.org/10.14232/ACTACYB.285729","url":null,"abstract":"The problem of a safe trajectory tracking is addressed in this paper. The method consists in using the results of a validated path planner: a set of safe trajectories. It produces the set of controls to apply to remain inside this set of planned trajectories while avoiding static obstacles. The computation is performed using the differential flatness property of many dynamical systems. The method is illustrated in the case of the Dubins car model.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132581556","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}
Acta Cybern.Pub Date : 2021-02-03DOI: 10.14232/ACTACYB.285315
Shuchen Liu, Jan-Jöran Gehrt, D. Abel, R. Zweigel
{"title":"Identification of Multi-Faults in GNSS Signals using RSIVIA under Dual Constellation","authors":"Shuchen Liu, Jan-Jöran Gehrt, D. Abel, R. Zweigel","doi":"10.14232/ACTACYB.285315","DOIUrl":"https://doi.org/10.14232/ACTACYB.285315","url":null,"abstract":"As described in the Market Report from European Global Navigation Satellite Systems Agency (GSA), satellite-based navigation will substantially contribute to the future innovation of self-driving vehicles (see [1]). In autonomous applications, especially in safetycritical scenarios, a false estimation of vehicle state can result in catastrophic accidents, which requires the high accuracy and integrity of the navigation solution. To maintain the integrity of a global navigation satellite system (GNSS)-based navigation system, the faulty GNSS observations caused by signal interferences and other possible reasons shall be detected, identi ed and excluded. Since the open service of the newly developed EU satellite navigation system Galileo is in operation, the combination of GPS and Galileo provides the modern navigation systems more available satellites in view. However, a higher number of satellites also increases the possibility that satellite observations contain a fault or even multi-faults. Therefore, identi cation of multi-faults becomes a crucial and challenging task to maintain the integrity of GNSS-based navigation systems. The previous work [2] presents the development of a fault detection and exclusion (FDE) algorithm of GNSS measurements. The approach is an extension of an existing tightlycoupled navigation lter, which integrates the measurements from GNSS and an inertial","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129265895","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}
Acta Cybern.Pub Date : 2020-11-19DOI: 10.14232/actacyb.282900
Kristóf Umann, Z. Porkoláb
{"title":"Detecting Uninitialized Variables in C++ with the Clang Static Analyzer","authors":"Kristóf Umann, Z. Porkoláb","doi":"10.14232/actacyb.282900","DOIUrl":"https://doi.org/10.14232/actacyb.282900","url":null,"abstract":"Uninitialized variables have been a source of errors since the beginning of software engineering. Some programming languages (e.g. Java and Python) will automatically zero-initialize such variables, but others, like C and C++, leave their state undefined. While laying aside initialization in C and C++ might be a performance advantage if an initial value can't be supplied, working with such variables is an undefined behavior, and is a common source of instabilities and crashes. To avoid such errors, whenever meaningful initialization is possible, it should be used. Tools for detecting these errors run time have existed for decades, but those require the problematic code to be executed. Since in many cases the number of possible execution paths are combinatoric, static analysis techniques emerged as an alternative. In this paper, we overview the technique for detecting uninitialized C++ variables using the Clang Static Analyzer, and describe various heuristics to guess whether a specific variable was left in an undefined state intentionally. We implemented a prototype tool based on our idea and successfully tested it on large open source projects.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117269095","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}
Acta Cybern.Pub Date : 2020-11-19DOI: 10.14232/actacyb.280899
Electa Alice Appadurai, M. R. Bhatt, G. D. Devanagavi
{"title":"Semi Fragile Audio Crypto-Watermarking based on Sparse Sampling with Partially Decomposed Haar Matrix Structure","authors":"Electa Alice Appadurai, M. R. Bhatt, G. D. Devanagavi","doi":"10.14232/actacyb.280899","DOIUrl":"https://doi.org/10.14232/actacyb.280899","url":null,"abstract":"In the recent era the growth of technology is tremendous and at the same time, the misuse of the technology is also increasing with an equal scale. Thus, the owners have to protect the multimedia data from the malicious and piracy. This has led the researchers to the new era of cryptography and watermarking. In the traditional security algorithm for the audio, the algorithm is implemented on the digital data after the traditional analog to digital conversion. But in this article, we propose the crypto–watermarking algorithm based on sparse sampling to be implemented during the analog to digital conversion process only. The watermark is generated by exploiting the structure of Haar transform. The performance of the algorithm is tested on various audio signals and the obtained SNR is greater than 30dB and the algorithm results in good robustness against various signal attacks such as echo addition, noise addition, reverberation etc.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115813414","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}
Acta Cybern.Pub Date : 2020-11-19DOI: 10.14232/actacyb.277104
S. A. Hasib, H. Nyeem
{"title":"Pixel Grouping of Digital Images for Reversible Data Hiding","authors":"S. A. Hasib, H. Nyeem","doi":"10.14232/actacyb.277104","DOIUrl":"https://doi.org/10.14232/actacyb.277104","url":null,"abstract":"Pixel Grouping (PG) of digital images has been a critical consideration in the recent development of the Reversible Data Hiding (RDH) schemes. While a PG kernel can define pixel-groups with the different neighborhoods for better embedding rate-distortion performance, only the group of horizontal neighborhood pixels of size 1× 3 has so far been considered. In this paper, we, therefore, construct the PG kernels of sizes 3×1, 2×3 and 3×2, and investigate their potentials to improve both the embedding capacity and the embedded image quality for a PG-based RDH scheme. A kernel of size 3×2 (or 2×3) that creates a pair of pixel-triplets (i.e., two L-shaped blocks) and offers a higher possible correlation among the pixels. These kernels thus can be better utilized for improving a PG-based RDH scheme. Considering this, we develop and present an improved PG-based RDH scheme and the computational model of its key processes. Experimental results demonstrated that our proposed RDH scheme offers reasonably better embedding rate-distortion performance than the original scheme.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131379619","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}
Acta Cybern.Pub Date : 2020-10-22DOI: 10.14232/actacyb.282762
G. Nagy, G. Oláh, Z. Porkoláb
{"title":"Type Inference of Simple Recursive Functions in Scala","authors":"G. Nagy, G. Oláh, Z. Porkoláb","doi":"10.14232/actacyb.282762","DOIUrl":"https://doi.org/10.14232/actacyb.282762","url":null,"abstract":"Scala is a well-established multi-paradigm programming language known for itsterseness that includes advanced type inference features. Unfortunately thistype inferring algorithm does not support typing of recursive functions.This is both against the original design philosophies of Scala and puts anunnecessary burden on the programmer. In this paper we propose a method tocompute the return types for simple recursive functions in Scala. We makea heuristic assumption on the return type based on the non-recursive executionbranches and provide a proof of this method's correctness. The algorithm does not havea significant effect on the compilation speed. We implemented our method asan extension prototype in the Scala compiler and used itto successfully test our method on various examples. The compiler extensionprototype is available for further tests.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124928753","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}