Information and Computation最新文献

{"title":"Spiking neural P systems with mute rules","authors":"Tingfang Wu ,&nbsp;Luis Valencia-Cabrera ,&nbsp;Mario J. Pérez-Jiménez ,&nbsp;Linqiang Pan","doi":"10.1016/j.ic.2024.105179","DOIUrl":"10.1016/j.ic.2024.105179","url":null,"abstract":"<div><p>Spiking neural P (SNP) systems are a class of neural network models that draw inspiration from the functioning of biological neurons. It was experimentally found that there exist autapses from neurons onto themselves in the brain, i.e., a neuron can transmit a signal back to itself through an autapse. In this work, inspired by the characteristics of autapses, a new variant of the SNP system, termed SNP systems with mute rules (SNPMR systems), is considered. Specifically, mute rules have no communication functioning, namely the execution of a mute rule only applies the change on the number of spikes within its residing neuron, rather than affecting other postsynaptic neurons. The computational power of SNPMR systems is examined by demonstrating that SNPMR systems achieve Turing universality with four or ten neurons. In addition, a simulator for SNPMR systems is developed to provide an experimental validation of the systems designed theoretically.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105179"},"PeriodicalIF":1.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141196976","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":"Special issue: Selected papers of the 9th International Conference on Algebraic Informatics, CAI 2022","authors":"Dimitrios Poulakis,&nbsp;George Rahonis","doi":"10.1016/j.ic.2024.105180","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105180","url":null,"abstract":"","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105180"},"PeriodicalIF":1.0,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141091060","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":"Relative approximate bisimulations for fuzzy picture automata","authors":"Chao Yang ,&nbsp;Ruiling Wu ,&nbsp;Xiaobing Sun ,&nbsp;Qichao Wang ,&nbsp;Yongming Li","doi":"10.1016/j.ic.2024.105172","DOIUrl":"10.1016/j.ic.2024.105172","url":null,"abstract":"<div><p>In this paper, we firstly give the notion of relative <em>ϵ</em>-approximate bisimulations between two fuzzy two-dimensional on-line tessellation automata (F2OTAs) and elaborate that the relative error between two F2OTAs, accompanying with a relative <em>ϵ</em>-approximate bisimulation between them, is less than or equal to <em>ϵ</em> where <span><math><mi>ϵ</mi><mo>∈</mo><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span>. Moreover, if relative <em>ϵ</em>-approximate bisimulations between two F2OTAs are restricted to be surjective functional, then some properties are drawn and by which relative <em>ϵ</em>-approximate bisimulations on a F2OTA are defined. We construct the factor F2OTA of a F2OTA with respect to a relative <em>ϵ</em>-approximate bisimulation on it and describe the relationship between this factor automaton and the original F2OTA. Whereafter, we novelly design two algorithms to compute all maximal relative <em>ϵ</em>-approximate bisimulations on a given F2OTA. Finally, we discuss some interesting properties of bisimulations on F2OTAs.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105172"},"PeriodicalIF":1.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141041905","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":"Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source","authors":"Argyrios Deligkas ,&nbsp;Michelle Döring ,&nbsp;Eduard Eiben ,&nbsp;Tiger-Lily Goldsmith ,&nbsp;George Skretas","doi":"10.1016/j.ic.2024.105171","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105171","url":null,"abstract":"<div><p>We consider the influence maximization problem over a temporal graph. We deviate from the standard model of influence maximization, where the goal is to choose the most influential vertices. In our model, we are given a fixed vertex and the goal is to find the best time steps to transmit so that the influence of this vertex is maximized. We frame this problem as a spreading process that follows a variant of the susceptible-infected-susceptible (SIS) model and focus on four objective functions. In the <span>MaxSpread</span> objective, the goal is to maximize the number of vertices that get infected at least once. In <span>MaxViral</span> and <span>MaxViralTstep</span>, the goal is to maximize the number of vertices that are infected at the same time step and at a given time step, respectively. Finally, in <span>MinNonViralTime</span>, the goal is to maximize the number of vertices that are infected in every <em>d</em> time-step window.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105171"},"PeriodicalIF":1.0,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141077859","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":"The complexity of subcube partition relates to the additive structure of the support","authors":"Norbert Hegyvári","doi":"10.1016/j.ic.2024.105170","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105170","url":null,"abstract":"<div><p>The subcube partition of a Boolean function is a partition of <span><math><msup><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow><mrow><mi>n</mi></mrow></msup></math></span> into the union of subcubes <span><math><msub><mrow><mo>∪</mo></mrow><mrow><mi>i</mi></mrow></msub><msub><mrow><mi>C</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>, such that the value of the function <em>f</em> is the same on each vector of <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>, i.e. for every <em>i</em> and <span><math><mi>x</mi><mo>,</mo><mi>y</mi><mo>∈</mo><msub><mrow><mi>C</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>, <span><math><mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>=</mo><mi>f</mi><mo>(</mo><mi>y</mi><mo>)</mo></math></span>. The complexity of it denotes by <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>S</mi><mi>C</mi><mi>P</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> is the minimum number of subcubes in a subcube partition which computes the Boolean function <em>f</em>. We give a lower bound of the complexity of subcube partitions of Boolean function which relates the additive behaviour of the support and the influence of the function.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105170"},"PeriodicalIF":1.0,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140878547","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":"Solving modular cubic equations with Coppersmith's method","authors":"Virgile Dossou-Yovo ,&nbsp;Abderrahmane Nitaj ,&nbsp;Alain Togbé","doi":"10.1016/j.ic.2024.105169","DOIUrl":"10.1016/j.ic.2024.105169","url":null,"abstract":"<div><p>Several cryptosystems based on Elliptic Curve Cryptography such as KMOV and Demytko process the message as a point <span><math><mi>M</mi><mo>=</mo><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>)</mo></math></span> of an elliptic curve with an equation of the form <span><math><msup><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>≡</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>+</mo><mi>a</mi><mi>x</mi><mo>+</mo><mi>b</mi><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mi>n</mi><mo>)</mo></math></span> over a finite field when <em>n</em> is a prime number, or over a finite ring when <span><math><mi>n</mi><mo>=</mo><mi>p</mi><mi>q</mi></math></span> is an RSA modulus. Other systems use singular cubic curves such as <span><math><msup><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>≡</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>+</mo><mi>a</mi><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mi>n</mi><mo>)</mo></math></span> and <span><math><msup><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mi>a</mi><mi>x</mi><mi>y</mi><mo>≡</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msup><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mi>n</mi><mo>)</mo></math></span>. In this paper, we present a method to find the small solutions of the former modular cubic equations. Our method is based on Coppersmith's technique and enables one to find the solutions <span><math><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>)</mo></math></span> when <span><math><mo>|</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>0</mn></mrow></msub><msup><mrow><mo>|</mo></mrow><mrow><mn>3</mn></mrow></msup><mo>|</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>0</mn></mrow></msub><msup><mrow><mo>|</mo></mrow><mrow><mn>2</mn></mrow></msup></math></span> is smaller than the modulus.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105169"},"PeriodicalIF":1.0,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140609867","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":"Model checking timed recursive CTL","authors":"Florian Bruse,&nbsp;Martin Lange","doi":"10.1016/j.ic.2024.105168","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105168","url":null,"abstract":"<div><p>We introduce Timed Recursive CTL, a merger of two extensions of the well-known branching-time logic CTL: Timed CTL is interpreted over real-time systems like timed automata; Recursive CTL introduces a powerful recursion operator which takes the expressiveness of this logic CTL well beyond that of regular properties. The result is an expressive logic for real-time properties. We show that its model checking problem is decidable over timed automata, namely 2-EXPTIME-complete.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105168"},"PeriodicalIF":1.0,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000336/pdfft?md5=e0944002710ef9bea65dbc962149ddfc&pid=1-s2.0-S0890540124000336-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140558984","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":"A truthful near-optimal mechanism for online linear packing-covering problem in the random order model","authors":"Jinshan Zhang ,&nbsp;Xiaoye Miao ,&nbsp;Meng Xi ,&nbsp;Tianyu Du ,&nbsp;Jianwei Yin","doi":"10.1016/j.ic.2024.105167","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105167","url":null,"abstract":"<div><p>Our focus is on the online linear packing-covering problem (OLPCP). Within this domain, we present an algorithm that attains near-optimal performance based on generalized Chernoff bounds for general random variables, assuming inputs are received in a uniformly random order and under almost stringent conditions. Through VCG protocols, we are able to unveil the inaugural truthful near-optimal mechanism for OLPCP, all within the confines of nearly tight conditions.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105167"},"PeriodicalIF":1.0,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140540667","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":"Characterization of exact two-query quantum algorithms","authors":"Shaoliang Ye ,&nbsp;Wei Yang ,&nbsp;Liusheng Huang","doi":"10.1016/j.ic.2024.105166","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105166","url":null,"abstract":"<div><p>Quantum query model is a crucial model for quantum computing, where one query to some input variable of a Boolean function <em>f</em> defined on <span><math><msup><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow><mrow><mi>n</mi></mrow></msup></math></span> returns the variable value. The exact query complexity, denoted as <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>E</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>, is defined to be the minimum number of queries required to determine the function value. An important problem in this area is to give a succinct characterization of a <em>k</em>-query exact quantum algorithm for an arbitrary <em>k</em>. To date, the cases <span><math><mi>k</mi><mo>=</mo><mn>1</mn></math></span> and <span><math><mi>k</mi><mo>=</mo><mi>n</mi></math></span> are already solved and the case <span><math><mi>k</mi><mo>=</mo><mn>2</mn></math></span> remains unknown. Our result is that there are 27 nondegenerate Boolean functions up to isomorphism with <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>E</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> being two, among which only two functions can be solved by a 2-query classical algorithm. The input bit number <em>n</em> of the above 27 functions ranges from 2 to 6, where the case <span><math><mi>n</mi><mo>≤</mo><mn>3</mn></math></span> is already proved and the case <span><math><mi>n</mi><mo>=</mo><mn>4</mn></math></span> is already found by numerically solving semidefinite programming, which is a complete characterization of quantum query algorithm. Assuming the correctness of the numerical result for <span><math><mi>n</mi><mo>=</mo><mn>4</mn></math></span>, we prove that there are four functions in the case <span><math><mi>n</mi><mo>=</mo><mn>5</mn></math></span>, one in the case <span><math><mi>n</mi><mo>=</mo><mn>6</mn></math></span> and none in the case <span><math><mi>n</mi><mo>≥</mo><mn>7</mn></math></span>. We further show that the 25 functions for which quantum algorithm has advantage over classical algorithm contain essentially only four different structures.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105166"},"PeriodicalIF":1.0,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140540666","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":"Mixed choice in session types","authors":"Kirstin Peters ,&nbsp;Nobuko Yoshida","doi":"10.1016/j.ic.2024.105164","DOIUrl":"10.1016/j.ic.2024.105164","url":null,"abstract":"<div><p>Session types provide a flexible programming style for structuring interaction, and are used to guarantee a safe and consistent composition of distributed processes. Traditional session types include only one-directional input (external) and output (internal) guarded choices. This prevents the session-processes to explore the full expressive power of the <em>π</em>-calculus where mixed choice was proved more expressive. Recently Casal, Mordido, and Vasconcelos proposed binary session types with mixed choices (<span><math><msup><mrow><mi>CMV</mi></mrow><mrow><mo>+</mo></mrow></msup></math></span>). Surprisingly, in spite of an inclusion of unrestricted channels with mixed choice, <span><math><msup><mrow><mi>CMV</mi></mrow><mrow><mo>+</mo></mrow></msup></math></span>'s mixed choice is rather separate and not mixed. We prove this negative result using two methodologies (using either the leader election problem or a synchronisation pattern as distinguishing feature), showing that there exists no good encoding from the <em>π</em>-calculus into <span><math><msup><mrow><mi>CMV</mi></mrow><mrow><mo>+</mo></mrow></msup></math></span>, preserving distribution. We then close their open problem on the encoding from <span><math><msup><mrow><mi>CMV</mi></mrow><mrow><mo>+</mo></mrow></msup></math></span> into <span><math><mi>CMV</mi></math></span> (without mixed choice), proving its soundness.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105164"},"PeriodicalIF":1.0,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000294/pdfft?md5=9b67e36d131b28461aba20580ca397f6&pid=1-s2.0-S0890540124000294-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140323484","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}