Acta Cybern.Pub Date : 2019-05-21DOI: 10.14232/ACTACYB.24.1.2019.11
András Sárkány, M. Csákvári, Mike Olasz
{"title":"Combining Common Sense Rules and Machine Learning to Understand Object Manipulation","authors":"András Sárkány, M. Csákvári, Mike Olasz","doi":"10.14232/ACTACYB.24.1.2019.11","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.11","url":null,"abstract":"Automatic situation understanding in videos has improved remarkably in recent years. However, state-of-the-art methods still have considerable shortcomings: they usually require training data for each object class present and may have high false positive or false negative rates, making them impractical for general applications. We study a case that has a limited goal in a narrow context and argue about the complexity of the general problem. We suggest to solve this problem by including common sense rules and by exploiting various state-of-the art deep neural networks (DNNs) as the detectors of the conditions of those rules. \u0000We want to deal with the manipulation of unknown objects at a remote table. We have two action types to be detected: `picking up an object from the table' and `putting an object onto the table' and due to remote monitoring, we consider monocular observation. We quantitatively evaluate the performance of the system on manually annotated video segments, present precision and recall scores. We also discuss issues on machine reasoning. We conclude that the proposed neural-symbolic approach a) diminishes the required size of training data and b) enables new applications where labeled data are difficult or expensive to get.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129637272","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 : 2019-05-21DOI: 10.14232/ACTACYB.24.1.2019.10
Edit Pengo, Zoltán Ságodi
{"title":"A Preparation Guide for Java Call Graph Comparison","authors":"Edit Pengo, Zoltán Ságodi","doi":"10.14232/ACTACYB.24.1.2019.10","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.10","url":null,"abstract":"Call graphs provide basis for numerous interprocedural analysers and tools, therefore it is crucial how precisely they are constructed. Developers need to know the features of a call graph builder before applying it to subsequent algorithms. The characteristics of call graph builders are best understood by comparing the generated call graphs themselves. The comparison can be done by matching the corresponding nodes in each graph and then analysing the found methods and calls. In this paper, we developed a process for pairing the nodes of multiple call graphs produced for the same source code. As the six static analysers that we collected for call graph building handles Java language elements differently, it was necessary to refine the basic name-wise pairing mechanism in several steps. Two language elements, the anonymous and generic methods, needed extra consideration. We describe the steps of improvement and our final solution to achieve the best possible pairing through the analysis of the Apache Commons-Math project.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116334460","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 : 2019-05-21DOI: 10.14232/ACTACYB.24.1.2019.4
P. Hudoba, P. Burcsi
{"title":"Multi Party Computation Motivated by the Birthday Problem","authors":"P. Hudoba, P. Burcsi","doi":"10.14232/ACTACYB.24.1.2019.4","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.4","url":null,"abstract":"Suppose there are n people in a classroom and we want to decide if there are two of them who were born on the same day of the year. The well-known birthday paradox is concerned with the probability of this event and is discussed in many textbooks on probability. In this paper we focus on cryptographic aspects of the problem: how can we decide if there is a collision of birthdays without the participants disclosing their respective date of birth. We propose several procedures for solving this in a privacy-preserving way and compare them according to their computational and communication complexity.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125133722","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 : 2019-05-21DOI: 10.14232/ACTACYB.24.1.2019.6
D. Lukács, M. Tejfel, Gergely Pongrácz
{"title":"Keeping P4 Switches Fast and Fault-free through Automatic Verification","authors":"D. Lukács, M. Tejfel, Gergely Pongrácz","doi":"10.14232/ACTACYB.24.1.2019.6","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.6","url":null,"abstract":"The networking dataplane is going through a paradigm shift as softwarization of switches sees an increased pull from the market. Yet, software tooling to support development with these new technologies is still in its infancy.In this work, we introduce a framework for verifying performance requirement conformance of data plane protocols defined in the P4 language . We present a framework that transforms a P4 program in a versatile symbolic formula which can be utilized to answer various performance queries. We represented the system using denotational semantics and it can be easily extended with low-level target-dependent information. We demonstrate the operation of this system on a toy specification.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128378361","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 : 2019-05-21DOI: 10.14232/ACTACYB.24.1.2019.2
Sándor Bácsi, G. Mezei
{"title":"Towards a Classification to Facilitate the Design of Domain-Specific Visual Languages","authors":"Sándor Bácsi, G. Mezei","doi":"10.14232/ACTACYB.24.1.2019.2","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.2","url":null,"abstract":"Domain-specific visual languages (DSVLs) are specialized modeling languages that allow the effective management of the behavior and the structure of software programs and systems in a specific domain. Each DSVL has its specific structural and graphical characteristics depending on the problem domain. In the recent decade, a wide range of tools and methodologies have been introduced to support the design of DSVLs for various domains, therefore it can be a challenging task to choose the most appropriate technique for the design process. Our research aims to present a classification to guide the identification of the most relevant and appropriate methodologies in the given scenario. The classification is capable enough to provide a clear and precise understanding of the main aspects that can facilitate the design of DSVLs.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121564066","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 : 2019-05-21DOI: 10.14232/ACTACYB.24.1.2019.8
Dávid Nagy, Tamás Mihálydeák, László Aszalós
{"title":"Different Types of Search Algorithms for Rough Sets","authors":"Dávid Nagy, Tamás Mihálydeák, László Aszalós","doi":"10.14232/ACTACYB.24.1.2019.8","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.8","url":null,"abstract":"Based on the available information in many cases it can happen that two objects cannot be distinguished. If a set of data is given and in this settwo objects have the same attribute values, then these two objects are called indiscernible. This indiscernibility has an effect on the membership relation,because in some cases it makes our judgment uncertain about a given object. The uncertainty appears because if something about an object is needed to bestated, then all the objects that are indiscernible from the given object must be taken into consideration. The indiscernibility relation is an equivalencerelation which represents background knowledge embedded in an information system. In a Pawlakian system this relation is used in set approximation.Correlation clustering is a clustering technique which generates a partition. In the authors’ previous research the possible usage of the correlation clusteringin rough set theory was investigated. In this paper the authors show how different types of search algorithms affect the set approximation.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114390277","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 : 2018-12-14DOI: 10.14232/actacyb.23.4.2018.5
Ákos Tóth, Roland Kunkli
{"title":"An Approximative and Semi-automated Method to Create MPEG-4 Compliant Human Face Models","authors":"Ákos Tóth, Roland Kunkli","doi":"10.14232/actacyb.23.4.2018.5","DOIUrl":"https://doi.org/10.14232/actacyb.23.4.2018.5","url":null,"abstract":"In this paper, we introduce our method to facilitate the process of creating an MPEG-4 compliant face model based on a simple 3D mesh. The presented method is semi-automatic, and the user needs to choose only a few points on the model as a preprocessing step. We use a cage based deformation technique to approximate an input model with a generic one which already contains the required MPEG-4 parameters. In the paper, we also show how the cage can be constructed to surround the model completely and be close enough to the head to get better deformation results. After these steps, the resulting model can be used in any MPEG-4 based facial animation player.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122256616","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 : 2018-12-14DOI: 10.14232/actacyb.23.4.2018.2
V. Shynkarenko, O. Kuropiatnyk
{"title":"Constructive Model of the Natural Language","authors":"V. Shynkarenko, O. Kuropiatnyk","doi":"10.14232/actacyb.23.4.2018.2","DOIUrl":"https://doi.org/10.14232/actacyb.23.4.2018.2","url":null,"abstract":"The paper deals with the natural language model. Elements of the model (the language constructions) are images with such attributes as sounds, letters, morphemes, words and other lexical and syntactic components of the language. Based on the analysis of processes of the world perception, visual and associative thinking, the operations of formation and transformation of images are pointed out. The model can be applied in the semantic NLP.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122717830","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 : 2018-12-14DOI: 10.14232/actacyb.23.4.2018.3
G. Nagy
{"title":"Sector Based Linear Regression, a New Robust Method for the Multiple Linear Regression","authors":"G. Nagy","doi":"10.14232/actacyb.23.4.2018.3","DOIUrl":"https://doi.org/10.14232/actacyb.23.4.2018.3","url":null,"abstract":"This paper describes a new robust multiple linear regression method, which based on the segmentation of the N dimensional space to N+1 sector. An N dimensional regression plane is located so that the half (or other) part of the points are under this plane in each sector. This article also presents a simple algorithm to calculate the parameters of this regression plane. This algorithm is scalable well by the dimension and the count of the points, and capable to calculation with other (not 0.5) quantiles. This paper also contains some studies about the described method, which analyze the result with different datasets and compares to the linear least squares regression. Sector Based Linear Regression (SBLR) is the multidimensional generalization of the mathematical background of a point cloud processing algorithm called Fitting Disc method, which has been already used in practice to process LiDAR data. A robust regression method can be used also in many other fields.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130241778","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 : 2018-12-14DOI: 10.14232/actacyb.23.4.2018.4
J. Demetrovics, H. M. Quang, V. D. Thi, Viet Anh Nguyen
{"title":"An Efficient Method to Reduce the Size of Consistent Decision Tables","authors":"J. Demetrovics, H. M. Quang, V. D. Thi, Viet Anh Nguyen","doi":"10.14232/actacyb.23.4.2018.4","DOIUrl":"https://doi.org/10.14232/actacyb.23.4.2018.4","url":null,"abstract":"Finding reductions from decision tables is one of the main objectives in information processing. Many studies focus on attribute reduct that reduces the number of columns in the decision table. The problem of finding all attribute reducts of consistent decision table is exponential in the number of attributes. In this paper, we aim at finding solutions for the problem of decision table reduction in polynomial time. More specifically, we deal with both the object reduct problem and the attribute reduct problem in consistent decision tables. We proved theoretically that our proposed methods for the two problems run in polynomial time. The proposed methods can be combined to significantly reduce the size of a consistent decision table both horizontally and vertically.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127694838","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}