发布求助
文献互助 智能选刊 最新文献

Acta Cybern.最新文献

筛选
英文 中文
Reconstruction of Rooted Directed Trees 有根有向树的重建
Acta Cybern. Pub Date : 2019-11-03 DOI: 10.14232/actacyb.24.2.2019.5
D. Bartha
{"title":"Reconstruction of Rooted Directed Trees","authors":"D. Bartha","doi":"10.14232/actacyb.24.2.2019.5","DOIUrl":"https://doi.org/10.14232/actacyb.24.2.2019.5","url":null,"abstract":"Let T be a rooted directed tree on n vertices, rooted at v. The rooted subtree frequency vector (RSTF-vector) of T with root v, denoted by rstf(T, v) is a vector of length n whose entry at position k is the number of subtrees of T that contain v and have exactly k vertices. In this paper we present an algorithm for reconstructing rooted directed trees from their rooted subtree frequencies (up to isomorphism). We show that there are examples of nonisomorphic pairs of rooted directed trees that are RSTF-equivalent, s.t. they share the same rooted subtree frequency vectors. We have found all such pairs (groups) for small sizes by using exhaustive computer search. We show that infinitely many nonisomorphic RSTF-equivalent pairs of trees exist by constructing infinite families of examples.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133672110","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}
引用次数: 0
The Logic of Aggregated Data 聚合数据的逻辑
Acta Cybern. Pub Date : 2019-11-03 DOI: 10.14232/actacyb.24.2.2019.4
T. Gelsema
{"title":"The Logic of Aggregated Data","authors":"T. Gelsema","doi":"10.14232/actacyb.24.2.2019.4","DOIUrl":"https://doi.org/10.14232/actacyb.24.2.2019.4","url":null,"abstract":"A notion of generalization-specialization is introduced that is more expressive than the usual notion from, e.g., the UML or RDF-based languages. This notion is incorporated in a typed formal language for modeling aggregated data. Soundness with respect to a sets-and-functions semantics is shown subsequently. Finally, a notion of congruence is introduced. With it terms in the language that have identical semantics, i.e., synonyms, can be discovered. The resulting formal language is well-suited for capturing faithfully aggregated data in such a way that it can serve as the foundation for corporate metadata management in a statistical office.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128038430","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}
引用次数: 1
Linear Time Ordering of Bins using a Conveyor System 使用输送系统的箱的线性时间排序
Acta Cybern. Pub Date : 2019-11-03 DOI: 10.14232/actacyb.24.2.2019.2
G. Makay, András Pluhár
{"title":"Linear Time Ordering of Bins using a Conveyor System","authors":"G. Makay, András Pluhár","doi":"10.14232/actacyb.24.2.2019.2","DOIUrl":"https://doi.org/10.14232/actacyb.24.2.2019.2","url":null,"abstract":"A local food wholesaler company is using an automated commissioning system, which brings the bins containing the appropriate product to the commissioning counter, where the worker picks the needed amounts to 12 bins corresponding to the same number of orders. To minimize the number of bins to pick from, they pick for several different spreading tours, so the order of bins containing the picked products coming from the commissioning counter can be considered random in this sense. Recently, the number of bins containing the picked orders increased over the available storage space, and it was necessary to find a new way of storing and ordering the bins to spreading tours. We developed a conveyor system which (after a preprocessing step) can order the bins in linear space and time.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126988058","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}
引用次数: 0
An Elementary Proof of the General Poincaré Formula for λ-additive Measures λ加性测度的一般poincar<s:1>公式的初等证明
Acta Cybern. Pub Date : 2019-11-03 DOI: 10.14232/actacyb.24.2.2019.1
J. Dombi, T. Jónás
{"title":"An Elementary Proof of the General Poincaré Formula for λ-additive Measures","authors":"J. Dombi, T. Jónás","doi":"10.14232/actacyb.24.2.2019.1","DOIUrl":"https://doi.org/10.14232/actacyb.24.2.2019.1","url":null,"abstract":"In a previous paper of ours [4], we presented the general formula for lambda-additive measure of union of n sets and gave a proof of it. That proof is based on the fact that the lambda-additive measure is representable. In this study, a novel and elementary proof of the formula for lambda-additive measure of the union of n sets is presented. Here, it is also demonstrated that, using elementary techniques, the well-known Poincare formula of probability theory is just a limit case of our general formula.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122534336","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}
引用次数: 2
Automating, Analyzing and Improving Pupillometry with Machine Learning Algorithms 用机器学习算法自动化、分析和改进瞳孔测量
Acta Cybern. Pub Date : 2019-11-03 DOI: 10.14232/actacyb.24.2.2019.3
György Kalmár, A. Büki, G. Kékesi, G. Horváth, L. G. Nyúl
{"title":"Automating, Analyzing and Improving Pupillometry with Machine Learning Algorithms","authors":"György Kalmár, A. Büki, G. Kékesi, G. Horváth, L. G. Nyúl","doi":"10.14232/actacyb.24.2.2019.3","DOIUrl":"https://doi.org/10.14232/actacyb.24.2.2019.3","url":null,"abstract":"The investigation of the pupillary light reflex (PLR) is a well-known method to provide information about the functionality of the autonomic nervous system. Pupillometry, a non-invasive technique, was applied to study the PLR alterations in a new, schizophrenia-like rat substrain, named WISKET. The pupil responses to light impulses were recorded with an infrared camera; the videos were automatically processed and features were extracted. Besides the classical statistical analysis (ANOVA), feature selection and classification were applied to reveal the significant differences in the PLR parameters between the control and WISKET animals. Based on these results, the disadvantages of this method were analyzed and the measurement process was redesigned and improved. The automated pupil detection method has also been adapted to the new videos. 2564 images were annotated manually and used to train a fully-convolutional neural network to produce pupil mask images. The method was evaluated on 329 test images and achieved 4% median relative error. With the new setup, the pupil detection became reliable and the new data acquisition offers robustness to the experiments.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115750666","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}
引用次数: 2
Confidence-based Contractor, Propagation and Potential Clouds for Differential Equations 基于置信度的承包者、传播和微分方程的潜在云
Acta Cybern. Pub Date : 2019-07-23 DOI: 10.14232/ACTACYB.285177
Julien Alexandre Dit Sandretto
{"title":"Confidence-based Contractor, Propagation and Potential Clouds for Differential Equations","authors":"Julien Alexandre Dit Sandretto","doi":"10.14232/ACTACYB.285177","DOIUrl":"https://doi.org/10.14232/ACTACYB.285177","url":null,"abstract":"A novel interval contractor based on the confidence assigned to a random variable is proposed in this paper. It makes it possible to consider at the same time an interval in which the quantity is guaranteed to be, and a confidence level to reduce the pessimism induced by interval approach. This contractor consists in computing a confidence region. Using different confidence levels, a particular case of potential cloud can be computed. As application, we propose to compute the reachable set of an ordinary differential equation under the form of a set of confidence regions, with respect to confidence levels on initial value.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129923196","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}
引用次数: 2
Benchmarking Graph Database Backends - What Works Well with Wikidata? 对图数据库后端进行基准测试-什么能很好地与维基数据一起工作?
Acta Cybern. Pub Date : 2019-05-21 DOI: 10.14232/ACTACYB.24.1.2019.5
T. Kovács, Gábor Simon, G. Mezei
{"title":"Benchmarking Graph Database Backends - What Works Well with Wikidata?","authors":"T. Kovács, Gábor Simon, G. Mezei","doi":"10.14232/ACTACYB.24.1.2019.5","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.5","url":null,"abstract":"Knowledge bases often utilize graphs as logical model. RDF-based knowledge bases (KB) are prime examples, as RDF (Resource Description Framework) does use graph as logical model. Graph databases are an emerging breed of NoSQL-type databases, offering graph as the logical model. Although there are specialized databases, the so-called triple stores, for storing RDF data, graph databases can also be promising candidates for storing knowledge. In this paper, we benchmark different graph database implementations loaded with Wikidata, a real-life, large-scale knowledge base. Graph databases come in all shapes and sizes, offer different APIs and graph models. Hence we used a measurement system, that can abstract away the API differences. For the modeling aspect, we made measurements with different graph encodings previously suggested in the literature, in order to observe the impact of the encoding aspect on the overall performance. \u0000 ","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"GE-25 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":"126566163","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}
引用次数: 8
Operations on Signed Distance Functions 符号距离函数的操作
Acta Cybern. Pub Date : 2019-05-21 DOI: 10.14232/ACTACYB.24.1.2019.3
Csaba Bálint, Gábor Valasek, L. Gergó
{"title":"Operations on Signed Distance Functions","authors":"Csaba Bálint, Gábor Valasek, L. Gergó","doi":"10.14232/ACTACYB.24.1.2019.3","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.3","url":null,"abstract":"We present a theoretical overview of signed distance functions and analyze how this representation changes when applying an offset transformation. First, we analyze the properties of signed distance and the sets they describe. \u0000Second, we introduce our main theorem regarding the distance to an offset set in (X,||.||) strictly normed Banach spaces. An offset set of D in X is the set of points equidistant to D. We show when such a set can be represented by f(x)-c=0, where c denotes the radius of the offset. Finally, we explain these results for applications that offset signed distance functions.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"54 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":"115894810","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}
引用次数: 5
LZ based Compression Benchmark on PE Files 基于LZ的PE文件压缩基准测试
Acta Cybern. Pub Date : 2019-05-21 DOI: 10.14232/ACTACYB.24.1.2019.9
Zsombor Paroczi
{"title":"LZ based Compression Benchmark on PE Files","authors":"Zsombor Paroczi","doi":"10.14232/ACTACYB.24.1.2019.9","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.9","url":null,"abstract":"The key element in runtime compression is the compression algorithm itself, that is used during processing. It has to be small in enough in decompression bytecode size to fit in the final executable, yet have to provide the best possible compression ratio. In our work we benchmark the top LZ based compression methods on Windows PE (both exe and dll) files, and present the results including the decompression overhead and the compression rates.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"10 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":"123759938","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}
引用次数: 0
Multi-Cloud Management Strategies for Simulating IoT Applications 模拟物联网应用的多云管理策略
Acta Cybern. Pub Date : 2019-05-21 DOI: 10.14232/ACTACYB.24.1.2019.7
András Márkus, J. Dombi
{"title":"Multi-Cloud Management Strategies for Simulating IoT Applications","authors":"András Márkus, J. Dombi","doi":"10.14232/ACTACYB.24.1.2019.7","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.1.2019.7","url":null,"abstract":"The Internet of Things (IoT) paradigm is closely coupled with cloud technologies, and the support for managing sensor data is one of the primary concerns of Cloud Computing. IoT-Cloud systems are widely used to manage sensors and different smart devices connected to the cloud, hence a large amount of data is generated by these things that need to be efficiently stored and processed. Simulation platforms have the advantage of enabling the investigation of complex systems without the need of purchasing and installing physical resources. In our previous work, we chose the DISSECT-CF simulator to model IoT-Cloud systems, and we also introduced provider policies to enable cost-aware policies resource management. The aim of this paper is to further extend the simulation capabilities of this tool by enabling multi-cloud management. In this paper we introduce four cloud selection strategies aimed to reduce application execution time and utilization costs. We detail our proposed method towards multi-cloud extension, and evaluate defined strategies through a meteorological application.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"193 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":"131534281","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}
引用次数: 7
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信