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

Fundamenta Informaticae最新文献

筛选
英文 中文
Computing Square Roots in Quaternion Algebras 计算四元数代数中的平方根
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-10-27 DOI: 10.3233/fi-222163
Przemysław Koprowski
{"title":"Computing Square Roots in Quaternion Algebras","authors":"Przemysław Koprowski","doi":"10.3233/fi-222163","DOIUrl":"https://doi.org/10.3233/fi-222163","url":null,"abstract":"We present an explicit algorithmic method for computing square roots in quaternion algebras over global fields of characteristic different from 2.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"185 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136311651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
String Covering: A Survey 字符串覆盖:一个调查
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-10-27 DOI: 10.3233/fi-222164
Mhaskar, Neerja, Smyth, W. F.
{"title":"String Covering: A Survey","authors":"Mhaskar, Neerja, Smyth, W. F.","doi":"10.3233/fi-222164","DOIUrl":"https://doi.org/10.3233/fi-222164","url":null,"abstract":"The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact representations. Here we first survey various forms of one potential compaction methodology, the cover of a given string x, initially proposed in a simple form in 1990, but increasingly of interest as more sophisticated variants have been discovered. We then consider covering by a seed; that is, a cover of a superstring of x. We conclude with many proposals for research directions that could make significant contributions to string processing in future.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136234354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Diameter of General Knödel Graphs 一般Knödel图的直径
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-10-27 DOI: 10.3233/fi-222165
Seyed Reza Musawi, Esameil Nazari Kiashi
{"title":"Diameter of General Knödel Graphs","authors":"Seyed Reza Musawi, Esameil Nazari Kiashi","doi":"10.3233/fi-222165","DOIUrl":"https://doi.org/10.3233/fi-222165","url":null,"abstract":"The Knödel graph WΔ,n is a Δ-regular bipartite graph on n ≥ 2Δ vertices where n is an even integer. In this paper We obtain some results about the distances of two vertices in the Knödel graphs and by them, we prove that diam(WΔ,n)=1+⌈n−22Δ−2⌉, where Δ ≥ 2 and n ≥ (2Δ – 5)(2Δ – 2) + 4.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"49 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136233438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reachability in Simple Neural Networks 简单神经网络的可达性
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-10-26 DOI: 10.3233/fi-222160
Marco Sälzer, Martin Lange
{"title":"Reachability in Simple Neural Networks","authors":"Marco Sälzer, Martin Lange","doi":"10.3233/fi-222160","DOIUrl":"https://doi.org/10.3233/fi-222160","url":null,"abstract":"We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and specifications over the input/output dimension given by conjunctions of linear inequalities. We recapitulate the proof and repair some flaws in the original upper and lower bound proofs. Motivated by the general result, we show that NP-hardness already holds for restricted classes of simple specifications and neural networks. Allowing for a single hidden layer and an output dimension of one as well as neural networks with just one negative, zero and one positive weight or bias is sufficient to ensure NP-hardness. Additionally, we give a thorough discussion and outlook of possible extensions for this direction of research on neural network verification.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"7 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135012909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets 布尔网络实现转换系统技术的复杂性
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-10-26 DOI: 10.3233/fi-222161
Raymond Devillers, Ronny Tredup
{"title":"On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets","authors":"Raymond Devillers, Ronny Tredup","doi":"10.3233/fi-222161","DOIUrl":"https://doi.org/10.3233/fi-222161","url":null,"abstract":"Let us consider some class of (Petri) nets. The corresponding Synthesis problem consists in deciding whether a given labeled transition system (TS) A can be implemented by a net N of that class. In case of a negative decision, it may be possible to convert A into an implementable TS B by applying various modification techniques, like relabeling edges that previously had the same label, suppressing edges/states/events, etc. It may however be useful to limit the number of such modifications to stay close to the original problem, or optimize the technique. In this paper, we show that most of the corresponding problems are NP-complete if the considered class corresponds to so-called flip-flop nets or some flip-flop net derivatives.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135012904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Methods for Efficient Unfolding of Colored Petri Nets 彩色Petri网的有效展开方法
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-10-26 DOI: 10.3233/fi-222162
Alexander Bilgram, Peter G. Jensen, Thomas Pedersen, Jiří Srba, Peter H. Taankvist
{"title":"Methods for Efficient Unfolding of Colored Petri Nets","authors":"Alexander Bilgram, Peter G. Jensen, Thomas Pedersen, Jiří Srba, Peter H. Taankvist","doi":"10.3233/fi-222162","DOIUrl":"https://doi.org/10.3233/fi-222162","url":null,"abstract":"Colored Petri nets offer a compact and user friendly representation of the traditional Place/Transition (P/T) nets and colored nets with finite color ranges can be unfolded into the underlying P/T nets, however, at the expense of an exponential explosion in size. We present two novel techniques based on static analysis in order to reduce the size of unfolded colored nets. The first method identifies colors that behave equivalently and groups them into equivalence classes, potentially reducing the number of used colors. The second method overapproximates the sets of colors that can appear in places and excludes colors that can never be present in a given place. Both methods are complementary and the combined approach allows us to significantly reduce the size of multiple colored Petri nets from the Model Checking Contest benchmark. We compare the performance of our unfolder with state-of-the-art techniques implemented in the tools MCC, Spike and ITS-Tools, and while our approach is competitive w.r.t. unfolding time, it also outperforms the existing approaches both in the size of unfolded nets as well as in the number of answered model checking queries from the 2021 Model Checking Contest.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134906271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Absent Subsequences in Words 单词中的缺席子序列
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-10-26 DOI: 10.3233/fi-222159
Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer
{"title":"Absent Subsequences in Words","authors":"Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer","doi":"10.3233/fi-222159","DOIUrl":"https://doi.org/10.3233/fi-222159","url":null,"abstract":"An absent factor of a string w is a string u which does not occur as a contiguous substring (a.k.a. factor) inside w. We extend this well-studied notion and define absent subsequences: a string u is an absent subsequence of a string w if u does not occur as subsequence (a.k.a. scattered factor) inside w. Of particular interest to us are minimal absent subsequences, i.e., absent subsequences whose every subsequence is not absent, and shortest absent subsequences, i.e., absent subsequences of minimal length. We show a series of combinatorial and algorithmic results regarding these two notions. For instance: we give combinatorial characterisations of the sets of minimal and, respectively, shortest absent subsequences in a word, as well as compact representations of these sets; we show how we can test efficiently if a string is a shortest or minimal absent subsequence in a word, and we give efficient algorithms computing the lexicographically smallest absent subsequence of each kind; also, we show how a data structure for answering shortest absent subsequence-queries for the factors of a given string can be efficiently computed.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"54 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136377191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples 出租车距离均值函数及其几何应用:方法、实现和实例
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-08-01 DOI: 10.3233/fi-222156
Csaba Vincze, Ábris Nagy
{"title":"On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples","authors":"Csaba Vincze, Ábris Nagy","doi":"10.3233/fi-222156","DOIUrl":"https://doi.org/10.3233/fi-222156","url":null,"abstract":"A distance mean function measures the average distance of points from the elements of a given set of points (focal set) in the space. The level sets of a distance mean function are called generalized conics. In case of infinite focal points the average distance is typically given by integration over the focal set. The paper contains a survey on the applications of taxicab distance mean functions and generalized conics’ theory in geometric tomography: bisection of the focal set and reconstruction problems by coordinate X-rays. The theoretical results are illustrated by implementations in Maple, methods and examples as well.1","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135971472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees 将3-Ary - n-立方体嵌入某些圆柱体和树的精确波长
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-06-19 DOI: 10.3233/fi-222149
S. Rajeshwari, M. Rajesh
{"title":"Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees","authors":"S. Rajeshwari, M. Rajesh","doi":"10.3233/fi-222149","DOIUrl":"https://doi.org/10.3233/fi-222149","url":null,"abstract":"Graph embeddings play a significant role in the design and analysis of parallel algorithms. It is a mapping of the topological structure of a guest graph G into a host graph H, which is represented as a one-to-one mapping from the vertex set of the guest graph to the vertex set of the host graph. In multiprocessing systems, the interconnection networks enhance the efficient communication between the components in the system. Obtaining minimum wirelength in embedding problems is significant in the designing of networks and simulating one architecture by another. In this paper, we determine the wirelength of embedding 3-ary n-cubes into cylinders and certain trees.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135380690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adaptive Merging on Phase Change Memory 相变存储器的自适应归并
4区 计算机科学
Fundamenta Informaticae Pub Date : 2023-03-15 DOI: 10.3233/fi-222144
Wojciech Macyna, Michal Kukowski
{"title":"Adaptive Merging on Phase Change Memory","authors":"Wojciech Macyna, Michal Kukowski","doi":"10.3233/fi-222144","DOIUrl":"https://doi.org/10.3233/fi-222144","url":null,"abstract":"Indexing is a well-known database technique used to facilitate data access and speed up query processing. Nevertheless, the construction and modification of indexes are very expensive. In traditional approaches, all records in the database table are equally covered by the index. It is not effective, since some records may be queried very often and some never. To avoid this problem, adaptive merging has been introduced. The key idea is to create an index adaptively and incrementally as a side-product of query processing. As a result, the database table is indexed partially depending on the query workload. This paper faces the problem of adaptive merging for phase change memory (PCM). The most important features of this memory type are limited write endurance and high write latency. As a consequence, adaptive merging should be investigated from the scratch. We solve this problem in two steps. First, we apply several PCM optimization techniques to the traditional adaptive merging approach. We prove that the proposed method (eAM) outperforms a traditional approach by 60%. After that, we invent the framework for adaptive merging (PAM) and propose a new variant of the PCM-optimized index. It further improves the system performance by 20% for databases where search queries interleave with data modifications.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135598941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
下一页 尾页
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学术官方微信