Acta Informatica最新文献_第4页

Cycle encoding-based parameter synthesis for timed automata safety 基于循环编码的定时自动机安全参数合成

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-07-30 DOI: 10.1007/s00236-024-00460-0

Burkay Sucu, Ebru Aydin Gol

引用次数: 0

The longest letter-duplicated subsequence and related problems 最长字母重复子序列及相关问题

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-07-20 DOI: 10.1007/s00236-024-00459-7

Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou

{"title":"The longest letter-duplicated subsequence and related problems","authors":"Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou","doi":"10.1007/s00236-024-00459-7","DOIUrl":"10.1007/s00236-024-00459-7","url":null,"abstract":"<div>Motivated by computing duplication patterns in sequences, a new problem called the longest letter-duplicated subsequence (LLDS) is proposed. Given a sequence S of length n, a letter-duplicated subsequence is a subsequence of S in the form of (x_1^{d_1}x_2^{d_2}ldots x_k^{d_k}) with (x_iin Sigma ), (x_jne x_{j+1}) and (d_ige 2) for all i in [k] and j in ([k-1]). A linear time algorithm for computing a longest letter-duplicated subsequence (LLDS) of S can be easily obtained. In this paper, we focus on two variants of this problem: (1) ‘all-appearance’ version, i.e., all letters in (Sigma ) must appear in the solution, and (2) the weighted version. For the former, we obtain dichotomous results: We prove that, when each letter appears in S at least 4 times, the problem and a relaxed version on feasibility testing (FT) are both NP-hard. The reduction is from ((3^+,1,2^-))-SAT, where all 3-clauses (i.e., containing 3 lals) are monotone (i.e., containing only positive literals) and all 2-clauses contain only negative literals. We then show that when each letter appears in S at most 3 times, then the problem admits an O(n) time algorithm. Finally, we consider the weighted version, where the weight of a block (x_i^{d_i} (d_ige 2)) could be any positive function which might not grow with (d_i). We give a non-trivial (O(n^2)) time dynamic programming algorithm for this version, i.e., computing an LD-subsequence of S whose weight is maximized.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 3","pages":"315 - 329"},"PeriodicalIF":0.4,"publicationDate":"2024-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-024-00459-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141741186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Invariant relations for affine loops 仿射环的不变关系

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-05-13 DOI: 10.1007/s00236-024-00457-9

Wided Ghardallou, Hessamaldin Mohammadi, Richard C. Linger, Mark Pleszkoch, JiMeng Loh, Ali Mili

引用次数: 0

Reachability analysis of linear systems 线性系统的可达性分析

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-04-09 DOI: 10.1007/s00236-024-00458-8

Shiping Chen, Xinyu Ge

引用次数: 0

Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking 用一种教学合理而高效的删除算法重新审视 2-3 红黑树：奇偶性搜索

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-03-29 DOI: 10.1007/s00236-023-00452-6

Kamaledin Ghiasi-Shirazi, Taraneh Ghandi, Ali Taghizadeh, Ali Rahimi-Baigi

{"title":"Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking","authors":"Kamaledin Ghiasi-Shirazi, Taraneh Ghandi, Ali Taghizadeh, Ali Rahimi-Baigi","doi":"10.1007/s00236-023-00452-6","DOIUrl":"10.1007/s00236-023-00452-6","url":null,"abstract":"<div>Red–black (RB) trees are one of the most efficient variants of balanced binary search trees. However, they have often been criticized for being too complicated, hard to explain, and unsuitable for pedagogical purposes, particularly their delete operation. Sedgewick (in: Dagstuhl Workshop on Data Structures, 2008. https://sedgewick.io/wp-content/themes/sedgewick/papers/2008LLRB.pdf) identified the length of code as the root of the problems and introduced left-leaning red–black (LLRB) trees. The delete operation of LLRB trees has a compact recursive code. Unfortunately, it may perform many unnecessary operations. The crux of the deletion algorithm is dealing with a “deficient” subtree, that is one whose black-height has become one less than that of its sibling subtree. In this paper, we revisit 2–3 red–black trees and propose a parity-seeking delete algorithm with the basic idea of making a deficient subtree on a par with its sibling: either by fixing the deficient subtree or by turning the sibling deficient as well, ascending deficiency to the parent node. Interestingly, the proposed parity-seeking delete algorithm also works for 2–3–4 RB trees. Our experiments show that the proposed parity-seeking delete algorithm is as efficient as the best preceding RB trees. The proposed parity-seeking delete algorithm is easily understandable and suitable for pedagogical and practical purposes.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 3","pages":"199 - 229"},"PeriodicalIF":0.4,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140325649","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

Distance-edge-monitoring sets of networks 网络的距离边缘监测集

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-03-19 DOI: 10.1007/s00236-024-00453-z

Gang Yang, Jiannan Zhou, Changxiang He, Yaping Mao

{"title":"Distance-edge-monitoring sets of networks","authors":"Gang Yang, Jiannan Zhou, Changxiang He, Yaping Mao","doi":"10.1007/s00236-024-00453-z","DOIUrl":"10.1007/s00236-024-00453-z","url":null,"abstract":"<div>It is important to be able to monitor the network and detect this failure when a connection (an edge) fails. For a vertex set M and an edge e of the graph G, let P(M, e) be the set of pairs (x, y) with a vertex x of M and a vertex y of V(G) such that e belongs to all shortest paths between x and y. A vertex set M of the graph G is distance-edge-monitoring set if every edge e of G is monitored by some vertex of M, that is, the set P(M, e) is nonempty. The distance-edge-monitoring number of a graph G, recently introduced by Foucaud, Kao, Klasing, Miller, and Ryan, is defined as the smallest size of distance-edge-monitoring sets of G. In this paper, we determine the bounds of the distance-edge-monitoring number of grid-based pyramids and the exact value of distance-edge-monitoring number for M(t)-graph and Sierpiński-type graphs. We also compare the distance-edge-monitoring set with average degree, the size of edge set and the size of vertex set of G, where G is M(t)-graph or Sierpiński-type graphs.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 2","pages":"183 - 198"},"PeriodicalIF":0.4,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140197909","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

An encoding of the (lambda )-calculus in the String MultiSet Rewriting calculus 字符串多集重写微积分中 $$lambda $$ 微积分的编码

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-03-13 DOI: 10.1007/s00236-024-00456-w

Attila Bagossy, Péter Battyányi

引用次数: 0

Exact distributed quantum algorithm for generalized Simon’s problem 广义西蒙问题的精确分布式量子算法

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-03-10 DOI: 10.1007/s00236-024-00455-x

Hao Li, Daowen Qiu, Le Luo, Paulo Mateus

{"title":"Exact distributed quantum algorithm for generalized Simon’s problem","authors":"Hao Li, Daowen Qiu, Le Luo, Paulo Mateus","doi":"10.1007/s00236-024-00455-x","DOIUrl":"10.1007/s00236-024-00455-x","url":null,"abstract":"<div>Simon’s problem is one of the most important problems demonstrating the power of quantum algorithms, as it greatly inspired the proposal of Shor’s algorithm. The generalized Simon’s problem is a natural extension of Simon’s problem and also a special hidden subgroup problem: Given a function (f:{0,1}^n rightarrow {0,1}^m), it is promised that there exists a hidden subgroup (Sle mathbb {Z}_2^n) of rank k such that for any (x, yin {{0, 1}}^n), (f(x) = f(y)) iff (x oplus y in S). The goal of generalized Simon’s problem is to find the hidden subgroup S. In this paper, we present two key contributions. Firstly, we characterize the structure of the generalized Simon’s problem in distributed scenario and introduce a corresponding distributed quantum algorithm. Secondly, we refine the algorithm to ensure exactness due to the application of quantum amplitude amplification technique. Our algorithm offers exponential speedup compared to the distributed classical algorithm. When contrasted with the quantum algorithm for the generalized Simon’s problem, our algorithm’s oracle requires fewer qubits, thus making it easier to be physically implemented. Particularly, the exact distributed quantum algorithm we develop for the generalized Simon’s problem outperforms the best previously proposed distributed quantum algorithm for Simon’s problem in terms of generalizability and exactness.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 2","pages":"131 - 159"},"PeriodicalIF":0.4,"publicationDate":"2024-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140100125","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

New families of Laplacian borderenergetic graphs 拉普拉斯边能图新族

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-02-26 DOI: 10.1007/s00236-024-00454-y

Cahit Dede

{"title":"New families of Laplacian borderenergetic graphs","authors":"Cahit Dede","doi":"10.1007/s00236-024-00454-y","DOIUrl":"10.1007/s00236-024-00454-y","url":null,"abstract":"<div>Laplacian matrix and its spectrum are commonly used for giving a measure in networks in order to analyse its topological properties. In this paper, Laplacian matrix of graphs and their spectrum are studied. Laplacian energy of a graph G of order n is defined as ( mathrm{{LE}}(G) = sum _{i=1}^n|lambda _i(L)-{bar{d}}|), where (lambda _i(L)) is the i-th eigenvalue of Laplacian matrix of G, and ({bar{d}}) is their average. If (mathrm{{LE}}(G) = mathrm{{LE}}(K_n)) for the complete graph (K_n) of order n, then G is known as L-borderenergetic graph. In the first part of this paper, we construct three infinite families of non-complete disconnected L-borderenergetic graphs: (Lambda _1 = { G_{b,j,k} = [(((j-2)k-2j+2)b+1)K_{(j-1)k-(j-2)}] cup b(K_j times K_k)| b,j,k in {{mathbb {Z}}}^+}), ( Lambda _2 = {G_{2,b} = [K_6 nabla b(K_2 times K_3)] cup (4b-2)K_9 | bin {{mathbb {Z}}}^+ }), ( Lambda _3 = {G_{3,b} = [bK_8 nabla b(K_2 times K_4)] cup (14b-4)K_{8b+6} | bin {{mathbb {Z}}}^+ }), where (nabla ) is join operator and (times ) is direct product operator on graphs. Then, in the second part of this work, we construct new infinite families of non-complete connected L-borderenergetic graphs (Omega _1= {K_2 nabla overline{aK_2^r} vert ain {{mathbb {Z}}}^+}), (Omega _2 = {overline{aK_3 cup 2(K_2times K_3)}vert ain {{mathbb {Z}}}^+ }) and (Omega _3 = {overline{aK_5 cup (K_3times K_3)}vert ain {{mathbb {Z}}}^+ }), where ({overline{G}}) is the complement operator on G.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 2","pages":"115 - 129"},"PeriodicalIF":0.4,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140006220","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

Approximating subset sum ratio via partition computations 通过分区计算逼近子集和比率

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-01-12 DOI: 10.1007/s00236-023-00451-7

Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis

引用次数: 0