Information and Computation最新文献

Asynchronous global protocols, precisely 准确地说，是异步全局协议

IF 1.4 4区计算机科学

Information and Computation Pub Date : 2026-09-01 Epub Date: 2026-08-01 DOI: 10.1016/j.ic.2026.105501

Kai Pischke, Jake Masters, Nobuko Yoshida

{"title":"Asynchronous global protocols, precisely","authors":"Kai Pischke, Jake Masters, Nobuko Yoshida","doi":"10.1016/j.ic.2026.105501","DOIUrl":"10.1016/j.ic.2026.105501","url":null,"abstract":"<div><div>Asynchronous multiparty session types are a type-based framework which ensure the compatibility of components in a distributed system by checking compliance against a specified global protocol. We propose a <em>top-down</em> approach, starting with the global protocol which is then projected into a set of local specifications. Next, we use an asynchronous refinement relation, <em>precise asynchronous multiparty subtyping</em>, to enable local specifications to be optimised by permuting actions within individual asynchronous components. This supports local reasoning, as each component can be independently developed and <em>refined</em> in isolation, before being integrated into a larger system. We show that this methodology guarantees both <em>type soundness</em> and <em>liveness</em> of the collection of optimised components.</div><div>In this article, we first propose new operational semantics of global protocols which capture sound optimisations in the context of asynchronous message-passing. Next we define an <em>asynchronous association</em> between global protocols and a set of optimised local types. Thirdly, we prove, for the first time, the correctness of the most expressive endpoint projection in the literature, <em>coinductive full merging projection</em>. We then show the main theorems of this article: <em>soundness</em> and <em>completeness</em>of the operational correspondence of the asynchronous association. As a consequence, the association acts as an <em>invariant</em>that can be used to transfer key theorems from the bottom-up system to the top-down system. In particular, we used this to prove type soundness, session-fidelity, deadlock-freedom and liveness of the collection of optimised endpoints.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"312 ","pages":"Article 105501"},"PeriodicalIF":1.4,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148934640","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

The arithmetic hierarchy of real functions 实函数的算术层次

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-06-01 Epub Date: 2026-05-15 DOI: 10.1016/j.ic.2026.105476

Cole Wyeth , Marcus Hutter

引用次数: 0

Numerical spiking neural P systems with thresholds 带阈值的数值脉冲神经系统

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-06-01 Epub Date: 2026-05-16 DOI: 10.1016/j.ic.2026.105471

Tingfang Wu , Luping Zhang , Francis George C. Cabarle , Linqiang Pan

{"title":"Numerical spiking neural P systems with thresholds","authors":"Tingfang Wu , Luping Zhang , Francis George C. Cabarle , Linqiang Pan","doi":"10.1016/j.ic.2026.105471","DOIUrl":"10.1016/j.ic.2026.105471","url":null,"abstract":"<div><div>Numerical spiking neural P (NSNP) systems serve as a Turing complete numerical paradigm within the realm of spiking neural P (SNP) systems, whereby continuous production functions act as activation functions to describe the firing behavior of a neuron, and a neuron can fire irrespective of the magnitude of the weighted sum of inputs fed into the production function. However, NSNP systems lack the firing threshold feature, a distinguishing one not only of SNP systems but also of artificial and biological neural networks. In this work, aiming to develop NSNP systems that incorporate the firing threshold feature without compromising their computational power, a new class-variant of NSNP systems, termed NSNP systems with thresholds (NSNPT systems), is considered; here, each neuron is associated with a threshold, and a neuron can fire only if its production value computed by the production function is not less than the threshold. We examine the computational power of NSNPT systems by demonstrating the Turing completeness of these systems both in the context of number generating or number accepting, and even the latter can be achieved when each neuron is restricted to contain only one linear function of a single variable. Finally, a matrix representation and matrix-based simulation algorithm are developed to experimentally validate NSNPT systems.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"311 ","pages":"Article 105471"},"PeriodicalIF":1.0,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148184735","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

Star and h-step-limited star connectivity of exchanged hypercubes 交换超立方体的星型和h阶限制星型连通性

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-06-01 Epub Date: 2026-05-22 DOI: 10.1016/j.ic.2026.105478

Kaige Pan

{"title":"Star and h-step-limited star connectivity of exchanged hypercubes","authors":"Kaige Pan","doi":"10.1016/j.ic.2026.105478","DOIUrl":"10.1016/j.ic.2026.105478","url":null,"abstract":"<div><div>The exchanged hypercube <em>EH</em>(<em>s, t</em>) is a cost-efficient variant of the hypercube. It preserves desirable properties such as strong connectivity, small diameter, and recursive decomposition while significantly reducing interconnection complexity. In this paper, we analyze star-based fault-tolerance parameters of <em>EH</em>(<em>s, t</em>). We first determine the exact values of the <em>star-structure connectivity</em>and <em>star-substructure connectivity</em> of <em>EH</em>(<em>s, t</em>). In particular, in the substructure case, the size of the star is allowed to reach its theoretical maximum value, thereby extending the results of Liu et al. [Comput. J. 67 (2024) 527–536]. Next, we investigate the <em>r-component structure connectivity</em>and <em>r-component substructure connectivity</em>, determining the 3-component star-structure and star-substructure connectivity of <em>EH</em>(<em>s, t</em>). We then study the recently proposed <em>h-step-limited star connectivity</em>, establishing the exact 0, 1, and 2-step-limited star connectivity of <em>EH</em>(<em>s, t</em>). We further generalize this notion to the <em>r-component h-step-limited star connectivity</em>. For this generalized parameter, we determine the 3-component 1-step-limited and 2-step-limited star connectivity of <em>EH</em>(<em>s, t</em>). These results provide a systematic understanding of star-type failures in exchanged hypercubes. They cover both classical star structures and step-limited star structures. All results also apply to the dual cube <span><math><mrow><mi>D</mi><msub><mi>C</mi><mi>n</mi></msub><mo>=</mo><mi>E</mi><mi>H</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span>.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"311 ","pages":"Article 105478"},"PeriodicalIF":1.0,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148184736","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

Classical-quantum state quantum Markov chains and finiteness 经典量子态量子马尔可夫链与有限性

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-06-01 Epub Date: 2026-05-18 DOI: 10.1016/j.ic.2026.105475

Jens Chr. Godskesen

引用次数: 0

Matroid and Knapsack House Allocation 矩阵和背负式房屋分配

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-05-01 Epub Date: 2026-04-30 DOI: 10.1016/j.ic.2026.105459

Jinshan Zhang , Piotr Krysta

{"title":"Matroid and Knapsack House Allocation","authors":"Jinshan Zhang , Piotr Krysta","doi":"10.1016/j.ic.2026.105459","DOIUrl":"10.1016/j.ic.2026.105459","url":null,"abstract":"<div><div>We explore two extensions of house allocation (HA) by enabling the allocation of each object (with limited or unlimited copies) to <em>multiple</em> agents. One extension is associated with matroid constraints, called the Matroid House Allocation Problem (MHA), while the other is associated with knapsack constraints, and is called the Knapsack House Allocation Problem (KHA). We investigate the highly general setting for both problems, where agents possess weights or priorities and can express indifference towards objects. Our focus is on designing (universally) truthful and Pareto optimal mechanisms to compute a maximum weighted matching.</div><div>We propose a tight 2-approximate deterministic mechanism that is both truthful and Pareto optimal for the Matroid House Allocation Problem (MHA). Additionally, we develop a randomized mechanism that is universally truthful and Pareto optimal, with an approximation ratio of <span><math><mfrac><mi>e</mi><mrow><mi>e</mi><mo>−</mo><mn>1</mn></mrow></mfrac></math></span> for the same problem. This ratio of <span><math><mfrac><mi>e</mi><mrow><mi>e</mi><mo>−</mo><mn>1</mn></mrow></mfrac></math></span> is the best achievable among universally truthful and Pareto optimal mechanisms, assuming the mechanism is also non-bossy. These results represent significant advancements over previous findings and are achieved through different techniques. Furthermore, we apply our MHA mechanisms to the Online Bipartite Matching Problem and Job Recruitment Problems by incorporating matroid constraints, resulting in optimal algorithms for both problems. For the Knapsack House Allocation Problem (KHA), we design a (4,2)-approximate mechanism that is universally truthful and Pareto optimal for cases with equal capacities. Additionally, we provide a universally truthful mechanism with a constant approximation for KHA. Moreover, we develop a 4-approximate mechanism for equal capacity KHA with strict preferences.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"310 ","pages":"Article 105459"},"PeriodicalIF":1.0,"publicationDate":"2026-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147858795","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

Computing conforming partitions with low stabbing number for rectilinear polygons 计算直线多边形的低刺数一致性分区

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-01-28 DOI: 10.1016/j.ic.2026.105415

Therese Biedl , Stephane Durocher , Debajyoti Mondal , Rahnuma Islam Nishat , Bastien Rivier

{"title":"Computing conforming partitions with low stabbing number for rectilinear polygons","authors":"Therese Biedl , Stephane Durocher , Debajyoti Mondal , Rahnuma Islam Nishat , Bastien Rivier","doi":"10.1016/j.ic.2026.105415","DOIUrl":"10.1016/j.ic.2026.105415","url":null,"abstract":"<div><div>A <em>conforming partition</em> of a rectilinear <em>n</em>-gon <em>P</em> (possibly with holes) is a partition of <em>P</em> into rectangles without using Steiner points (i.e., all corners of all rectangles must lie on the boundary of <em>P</em>). The stabbing number of such a partition is the maximum number of rectangles intersected by an axis-aligned segment lying in the interior of <em>P</em>. In this paper, we examine the problem of computing conforming partitions with low stabbing number. We show that computing a conforming partition with stabbing number at most 4 is <span><math><mi>NP</mi></math></span>-hard, which strengthens a previously known hardness result [Durocher & Mehrabi, Theor. Comput. Sci. 689: 157-168 (2017)] and eliminates the possibility for fixed-parameter-tractable algorithms parameterized by the stabbing number unless <span><math><mi>P</mi><mo>=</mo><mrow><mi>NP</mi></mrow></math></span>. In contrast, we give (i) an <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span>-time algorithm to decide whether a conforming partition with stabbing number 2 exists, (ii) a fixed-parameter-tractable algorithm parameterized by both the stabbing number and treewidth of the pixel graph of the polygon, and (iii) a fixed-parameter-tractable algorithm parameterized by the stabbing number for polygons without holes in general position.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105415"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174313","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

Seven kinds of equivalent models for generalized coalition logics 广义联合逻辑的七种等价模型

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-03 DOI: 10.1016/j.ic.2026.105419

Zixuan Chen, Fengkui Ju

{"title":"Seven kinds of equivalent models for generalized coalition logics","authors":"Zixuan Chen, Fengkui Ju","doi":"10.1016/j.ic.2026.105419","DOIUrl":"10.1016/j.ic.2026.105419","url":null,"abstract":"<div><div>Coalition Logic is an important logic in the logical study of strategic reasoning. It admits two kinds of semantics: one based on concurrent game models, and the other based on alpha neighborhood models, which capture the alpha powers of coalitions. In two recent papers, Li and Ju argued that, generally, concurrent game models have three assumptions that are too strong: seriality, independence of agents, and determinism. They presented eight coalition logics based on eight classes of general concurrent game models determined by which of the three assumptions are met. In this paper, we show that the set of valid formulas of each of these eight logics can equivalently be characterized by six alternative classes of models, each of which provides a natural and well-motivated representation of coalitional powers: (1) <em>single-coalition-first action models</em>, in which the outcome functions for single coalitions determine the outcome functions for all other coalitions; (2) <em>single-coalition-first actual neighborhood models</em>, in which the neighborhood functions for single coalitions determine the neighborhood functions for all other coalitions; (3) <em>clear grand-coalition-first action models</em>, in which the outcome function for the grand coalition determines the outcome functions for all other coalitions, and distinct joint actions of the grand coalition yield distinct outcomes; (4) <em>clear single-coalition-first actual neighborhood models</em>, in which the actual powers of single coalitions are pairwise disjoint; (5) <em>tree-like grand-coalition-first action models</em>, in which every state has a unique history; and (6) <em>tree-like single-coalition-first actual neighborhood models</em>, in which every state also has a unique history.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105419"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174310","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

Applications of littlestone dimension to query learning and to compression littlestone维在查询学习和压缩中的应用

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-02-24 DOI: 10.1016/j.ic.2026.105424

Hunter Chase, James Freitag, Lev Reyzin

引用次数: 0

A hierarchy of constant communication complexity 不断通信的复杂层次结构

IF 1 4区计算机科学

Information and Computation Pub Date : 2026-03-01 Epub Date: 2026-01-27 DOI: 10.1016/j.ic.2026.105416

Andris Ambainis , Hartmut Klauck , Debbie Lim

{"title":"A hierarchy of constant communication complexity","authors":"Andris Ambainis , Hartmut Klauck , Debbie Lim","doi":"10.1016/j.ic.2026.105416","DOIUrl":"10.1016/j.ic.2026.105416","url":null,"abstract":"<div><div>Similarly to the Chomsky hierarchy, we offer a classification of communication complexity measures such that these measures are organized into equivalence classes. Different from previous attempts of this endeavour, we consider two communication complexity measures as equivalent, if, when one is constant, then the other is constant as well, and vice versa. Most previous considerations of similar topics have been using polylogarithmic input length as a defining characteristic of equivalence. In this paper, two measures <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> are <em>constant-equivalent</em>, if and only if for all total Boolean (families of) functions <span><math><mi>f</mi><mo>:</mo><msup><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow><mrow><mi>n</mi></mrow></msup><mo>×</mo><msup><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow><mrow><mi>n</mi></mrow></msup><mo>→</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></math></span> we have <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo><mo>=</mo><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> if and only if <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo><mo>=</mo><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>. We identify five equivalence classes according to the above equivalence relation. Interestingly, the classification is counter-intuitive in that powerful models of communication are grouped with weak ones, and seemingly weaker models end up on the top of the hierarchy.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"309 ","pages":"Article 105416"},"PeriodicalIF":1.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174315","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