Theoretical Computer Science最新文献

{"title":"Sublinear message bounds of authenticated implicit Byzantine agreement","authors":"","doi":"10.1016/j.tcs.2024.114888","DOIUrl":"10.1016/j.tcs.2024.114888","url":null,"abstract":"<div><div>This paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the so-called <em>implicit</em> Byzantine agreement problem where each node starts with an input value and at the end a non-empty subset of the honest nodes should agree on a common input value by satisfying the BA properties (i.e., there can be undecided nodes)<span><span><sup>3</sup></span></span>. We show that a sublinear (in <em>n</em>, number of nodes) message complexity BA protocol under honest majority is possible in the standard PKI model when the nodes have access to an unbiased global coin and hash function. In particular, we present a randomized Byzantine agreement algorithm which, with high probability achieves implicit agreement, uses <span><math><mover><mrow><mi>O</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><msqrt><mrow><mi>n</mi></mrow></msqrt><mo>)</mo></math></span> messages, and runs in <span><math><mover><mrow><mi>O</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><mn>1</mn><mo>)</mo></math></span> rounds while tolerating <span><math><mo>(</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>−</mo><mi>ϵ</mi><mo>)</mo><mi>n</mi></math></span> Byzantine nodes for any fixed <span><math><mi>ϵ</mi><mo>></mo><mn>0</mn></math></span>, the notation <span><math><mover><mrow><mi>O</mi></mrow><mrow><mo>˜</mo></mrow></mover></math></span> hides a <span><math><mi>O</mi><mo>(</mo><mi>polylog</mi><mspace></mspace><mi>n</mi><mo>)</mo></math></span> factor<span><span><sup>4</sup></span></span>. The algorithm requires standard cryptographic setup PKI and hash function with a static Byzantine adversary. The algorithm works in the CONGEST model and each node does not need to know the identity of its neighbors, i.e., works in the <span><math><mi>K</mi><msub><mrow><mi>T</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> model. The message complexity (and also the time complexity) of our algorithm is optimal up to a polylog <em>n</em> factor, as we show a <span><math><mi>Ω</mi><mo>(</mo><msqrt><mrow><mi>n</mi></mrow></msqrt><mo>)</mo></math></span> lower bound on the message complexity. We further extend the result to Byzantine subset agreement, where a non-empty subset of nodes should agree on a common value. Lastly, we analyze several relevant results that follow from the construction of the main result.</div><div>To the best of our knowledge, this is the first sublinear message complexity result of Byzantine agreement. A quadratic message lower bound is known for any deterministic BA protocol (due to Dolev-Reischuk [JACM 1985]). The existing randomized BA protocols have at least quadratic message complexity in the honest majority setting. Our result shows the power of a global coin in achieving significant improvement over the existing results. It can be viewed as a step towards understanding the message complexity of randomized Byzantine agreement in distribute","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142318692","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}

{"title":"Non-inclusive g-extra diagnosability of interconnection networks under PMC model","authors":"","doi":"10.1016/j.tcs.2024.114887","DOIUrl":"10.1016/j.tcs.2024.114887","url":null,"abstract":"<div><div>System level fault diagnosis theory is of great weight in the design and maintenance of multiprocessor systems. In this paper, we propose a novel kind of diagnosability, called non-inclusive <em>g</em>-extra diagnosability, that requires all faulty sets to be non-inclusive and every connected fault-free subgraph has at least <span><math><mi>g</mi><mo>+</mo><mn>1</mn></math></span> vertices. Furthermore, we determine the non-inclusive <em>g</em>-extra diagnosability of a class of graphs under PMC model. As applications, the non-inclusive <em>g</em>-extra diagnosability of <span><math><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>)</mo></math></span>-star graph <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi></mrow></msub></math></span>, data center networks DCell (<span><math><msub><mrow><mi>D</mi></mrow><mrow><mi>k</mi><mo>,</mo><mi>n</mi></mrow></msub></math></span>), BCDC (<span><math><msub><mrow><mi>B</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>) and BCube (<span><math><mi>B</mi><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi></mrow></msub></math></span>) under PMC model are determined successively.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142322927","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}

{"title":"Lattice paths and the Prouhet-Thue-Morse sequence","authors":"","doi":"10.1016/j.tcs.2024.114885","DOIUrl":"10.1016/j.tcs.2024.114885","url":null,"abstract":"<div><div>Using Flajolet's combinatorial theory of continued fractions and axial symmetry of lattice paths, we show that the enumeration of certain lattice paths modulo two yields the ubiquitous Prouhet-Thue-Morse sequence. This answers an open problem of Berstel et al.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142318862","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}

{"title":"Self-stabilizing multivalued consensus in asynchronous crash-prone systems","authors":"","doi":"10.1016/j.tcs.2024.114886","DOIUrl":"10.1016/j.tcs.2024.114886","url":null,"abstract":"<div><div>The multivalued consensus problem is a fundamental issue in fault-tolerant distributed computing. It encompasses a wide range of agreement problems where processes must unanimously decide on a specific value <span><math><mi>v</mi><mo>∈</mo><mi>V</mi></math></span>, with <span><math><mo>|</mo><mi>V</mi><mo>|</mo><mo>≥</mo><mn>2</mn></math></span>. Existing solutions that handle process crash failures simplify the multivalued consensus problem by reducing it to the binary consensus problem. Examples of such solutions include Mostéfaoui-Raynal-Tronel [IPL 2000] and Zhang-Chen [IPL 2009].</div><div>In this work, we aim to design an even more reliable solution by leveraging the concept of <em>self-stabilization</em>, which provides a strong form of fault tolerance. Self-stabilizing algorithms can recover from transient faults, which represent any deviation from the system's intended behavior (as long as the algorithm code remains intact) in addition to process and communication failures.</div><div>To the best of our knowledge, this work presents the first self-stabilizing algorithm for multivalued consensus in asynchronous message-passing systems susceptible to process failures and transient faults. Our solution uses, at most, <em>n</em> concurrent invocations of binary consensus. This is another way we advance state-of-the-art solutions compared to previous non-self-stabilizing ones. For example, Mostéfaoui-Raynal-Tronel's solution requires an unbounded number of sequential invocations of binary consensus.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142323001","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}

{"title":"Edge open packing: Complexity, algorithmic aspects, and bounds","authors":"","doi":"10.1016/j.tcs.2024.114884","DOIUrl":"10.1016/j.tcs.2024.114884","url":null,"abstract":"<div><div>Given a graph <em>G</em>, two edges <span><math><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>e</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>∈</mo><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> are said to have a common edge <span><math><mi>e</mi><mo>≠</mo><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>e</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> if <em>e</em> joins an endvertex of <span><math><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> to an endvertex of <span><math><msub><mrow><mi>e</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>. A subset <span><math><mi>B</mi><mo>⊆</mo><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is an edge open packing set in <em>G</em> if no two edges of <em>B</em> have a common edge in <em>G</em>, and the maximum cardinality of such a set in <em>G</em> is called the edge open packing number, <span><math><msubsup><mrow><mi>ρ</mi></mrow><mrow><mi>e</mi></mrow><mrow><mi>o</mi></mrow></msubsup><mo>(</mo><mi>G</mi><mo>)</mo></math></span>, of <em>G</em>. In this paper, we prove that the decision version of the edge open packing number is NP-complete even when restricted to graphs with universal vertices, Eulerian bipartite graphs, and planar graphs with maximum degree 4, respectively. In contrast, we present a linear-time algorithm that computes the edge open packing number of a tree. We also resolve two problems posed in the seminal paper (Chelladurai et al. (2022) <span><span>[5]</span></span>). Notably, we characterize the graphs <em>G</em> that attain the upper bound <span><math><msubsup><mrow><mi>ρ</mi></mrow><mrow><mi>e</mi></mrow><mrow><mi>o</mi></mrow></msubsup><mo>(</mo><mi>G</mi><mo>)</mo><mo>≤</mo><mo>|</mo><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>|</mo><mo>/</mo><mi>δ</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>, and provide lower and upper bounds for the edge-deleted subgraph of a graph and establish the corresponding realization result.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142322926","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}

{"title":"Geometrical Penrose tilings are characterized by their 1-atlas","authors":"","doi":"10.1016/j.tcs.2024.114883","DOIUrl":"10.1016/j.tcs.2024.114883","url":null,"abstract":"<div><div>Penrose rhombus tilings are tilings of the plane by two decorated rhombi such that the decorations match at the junction between two tiles (like in a jigsaw puzzle). In dynamical terms, they form a tiling space of finite type. If we remove the decorations, we get, by definition, a sofic tiling space that we here call geometrical Penrose tilings. Here, we show how to compute the patterns of a given size which appear in these tilings by three different methods: two based on the substitutive structure of the Penrose tilings and the last on their definition by the cut and projection method. We use this to prove that the geometrical Penrose tilings are characterized by a small set of patterns called vertex-atlas, <em>i.e.</em>, they form a tiling space of finite type. Though considered as folklore, no complete proof of this result has been published, to our knowledge.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142318871","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}

{"title":"Arbitrary pattern formation on a continuous circle by oblivious robot swarm","authors":"","doi":"10.1016/j.tcs.2024.114882","DOIUrl":"10.1016/j.tcs.2024.114882","url":null,"abstract":"<div><div>In the field of distributed systems, the Arbitrary Pattern Formation (APF) problem is an extensively studied problem. The purpose of APF is to design an algorithm to move a swarm of robots to a particular position in an environment (discrete or continuous) such that the swarm can form a specific but arbitrary pattern given previously to every robot as an input. In this paper, the solvability of the APF problem on a continuous circle is discussed for a swarm of oblivious and silent robots without chirality under a semi-synchronous scheduler. Firstly a class of configurations (the initial placements of the robots on the circle) called <em>Formable Configuration</em> (<em>FC</em>) has been provided which is necessary to solve the APF problem on a continuous circle. Then considering the initial configuration to be an <em>FC</em>, a deterministic and distributed algorithm has been provided that solves the APF problem for <em>n</em> robots on a continuous circle of fixed radius within <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span> epochs without collision, where an epoch is considered to be a time interval in which all robots are activated at least once.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142315560","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}

{"title":"L(3,2,1)-labeling of certain planar graphs","authors":"","doi":"10.1016/j.tcs.2024.114881","DOIUrl":"10.1016/j.tcs.2024.114881","url":null,"abstract":"<div><div>Given a graph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></math></span> of maximum degree <em>Δ</em>, denoting by <span><math><mi>d</mi><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo></math></span> the distance in <em>G</em> between nodes <span><math><mi>x</mi><mo>,</mo><mi>y</mi><mo>∈</mo><mi>V</mi></math></span>, an <span><math><mi>L</mi><mo>(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-labeling of <em>G</em> is an assignment <em>l</em> from <em>V</em> to the set of non-negative integers such that <span><math><mo>|</mo><mi>l</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>−</mo><mi>l</mi><mo>(</mo><mi>y</mi><mo>)</mo><mo>|</mo><mo>≥</mo><mn>3</mn></math></span> if <em>x</em> and <em>y</em> are adjacent, <span><math><mo>|</mo><mi>l</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>−</mo><mi>l</mi><mo>(</mo><mi>y</mi><mo>)</mo><mo>|</mo><mo>≥</mo><mn>2</mn></math></span> if <span><math><mi>d</mi><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo><mo>=</mo><mn>2</mn></math></span>, and <span><math><mo>|</mo><mi>l</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>−</mo><mi>l</mi><mo>(</mo><mi>y</mi><mo>)</mo><mo>|</mo><mo>≥</mo><mn>1</mn></math></span> if <span><math><mi>d</mi><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo><mo>=</mo><mn>3</mn></math></span>, for all <em>x</em> and <em>y</em> in <em>V</em>. The <span><math><mi>L</mi><mo>(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-number <span><math><mi>λ</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is the smallest positive integer such that <em>G</em> admits an <span><math><mi>L</mi><mo>(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-labeling with labels from <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>λ</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>}</mo></math></span>.</div><div>In this paper, the <span><math><mi>L</mi><mo>(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-number of certain planar graphs is determined, proving that it is linear in <em>Δ</em>, although the general upper bound for the <span><math><mi>L</mi><mo>(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-number of planar graphs is quadratic in <em>Δ</em>.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142318691","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}

{"title":"Complexity and enumeration in models of genome rearrangement","authors":"","doi":"10.1016/j.tcs.2024.114880","DOIUrl":"10.1016/j.tcs.2024.114880","url":null,"abstract":"<div><div>In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the <span>Pairwise Rearrangement</span> problem in the Single Cut-and-Join model (Bergeron et al., 2010 <span><span>[8]</span></span>) is <span><math><mi>#</mi><mtext>P</mtext></math></span>-complete under polynomial-time Turing reductions. Next, we show that in the Single Cut or Join model (Feijão and Meidanis, 2011 <span><span>[21]</span></span>), the problem of enumerating all medians (<figure><img></figure>) is logspace-computable (<span><math><mtext>FL</mtext></math></span>), improving upon the previous polynomial-time (<span><math><mtext>FP</mtext></math></span>) bound of Miklós &amp; Smith <span><span>[41]</span></span>.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142318872","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}

{"title":"Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: Semantics and automated reasoning with theorem proving","authors":"","doi":"10.1016/j.tcs.2024.114876","DOIUrl":"10.1016/j.tcs.2024.114876","url":null,"abstract":"<div><div>Probabilistic programming combines general computer programming, statistical inference, and formal semantics to help systems make decisions when facing uncertainty. Probabilistic programs are ubiquitous, including having a significant impact on machine intelligence. While many probabilistic algorithms have been used in practice in different domains, their automated verification based on formal semantics is still a relatively new research area. In the last two decades, it has attracted much interest. Many challenges, however, remain. The work presented in this paper, probabilistic unifying relations (ProbURel), takes a step towards our vision to tackle these challenges.</div><div>Our work is based on Hehner's predicative probabilistic programming, but there are several obstacles to the broader adoption of his work. Our contributions here include (1) the formalisation of its syntax and semantics by introducing an Iverson bracket notation to separate relations from arithmetic; (2) the formalisation of relations using Unifying Theories of Programming (UTP) and probabilities outside the brackets using summation over the topological space of the real numbers; (3) the constructive semantics for probabilistic loops using Kleene's fixed-point theorem; (4) the enrichment of its semantics from distributions to subdistributions and superdistributions to deal with the constructive semantics; (5) the unique fixed-point theorem to simplify the reasoning about probabilistic loops; and (6) the mechanisation of our theory in Isabelle/UTP, an implementation of UTP in Isabelle/HOL, for automated reasoning using theorem proving.</div><div>We demonstrate our work with six examples, including problems in robot localisation, classification in machine learning, and the termination of probabilistic loops.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0304397524004936/pdfft?md5=ea0cab93ec8117c562627dfa268566b2&pid=1-s2.0-S0304397524004936-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142315561","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}