Information and Computation最新文献_第6页

Weighted automata and logics meet computational complexity 加权自动机和逻辑满足计算复杂性

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-12 DOI: 10.1016/j.ic.2024.105213

Peter Kostolányi

{"title":"Weighted automata and logics meet computational complexity","authors":"Peter Kostolányi","doi":"10.1016/j.ic.2024.105213","DOIUrl":"10.1016/j.ic.2024.105213","url":null,"abstract":"<div>Complexity classes such as <math><mi>#</mi><mi>P</mi></math>, <math><mo>⊕</mo><mi>P</mi></math>, GapP, OptP, NPMV, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in terms of a class <math><mrow><mi>NP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> for a suitable semiring S, defined via weighted Turing machines over S similarly as NP is defined in the unweighted setting. Other complexity classes can be lifted to the quantitative world as well, the resulting classes relating to the original ones in the same way as weighted automata or logics relate to their unweighted counterparts. The article surveys these too-little-known connexions implicit in the existing literature and suggests a systematic approach to the study of weighted complexity classes. An extension of <math><mi>SAT</mi></math> to weighted propositional logic is proved to be complete for <math><mrow><mi>NP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> when S is finitely generated. Moreover, a class <math><mrow><mi>FP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> is introduced for each semiring S as a counterpart to P, and the relations between <math><mrow><mi>FP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> and <math><mrow><mi>NP</mi></mrow><mo>[</mo><mi>S</mi><mo>]</mo></math> are considered.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105213"},"PeriodicalIF":0.8,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141993489","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

Modification problems toward proper (Helly) circular-arc graphs 面向适当（赫利）圆弧图的修改问题

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-05 DOI: 10.1016/j.ic.2024.105211

Yixin Cao , Hanchun Yuan , Jianxin Wang

引用次数: 0

Neural-symbolic temporal decision trees for multivariate time series classification 用于多元时间序列分类的神经符号时间决策树

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-02 DOI: 10.1016/j.ic.2024.105209

Giovanni Pagliarini , Simone Scaboro , Giuseppe Serra , Guido Sciavicco , Ionel Eduard Stan

{"title":"Neural-symbolic temporal decision trees for multivariate time series classification","authors":"Giovanni Pagliarini , Simone Scaboro , Giuseppe Serra , Guido Sciavicco , Ionel Eduard Stan","doi":"10.1016/j.ic.2024.105209","DOIUrl":"10.1016/j.ic.2024.105209","url":null,"abstract":"<div>Multivariate time series classification is an ubiquitous and widely studied problem. Due to their strong generalization capability, neural networks are suitable for this problem, but their intrinsic black-box nature often limits their applicability. Temporal decision trees are a relevant alternative to neural networks for the same task regarding classification performances while attaining higher levels of transparency and interpretability. In this work, we approach the problem of hybridizing these two techniques, and present three independent, natural hybridization solutions to study if, and in what measure, both the ability of neural networks to capture complex temporal patterns and the transparency and flexibility of temporal decision trees can be leveraged. To this end, we provide initial experimental results for several tasks in a binary classification setting, showing that our proposed neural-symbolic hybridization schemata may be a step towards accurate and interpretable models.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105209"},"PeriodicalIF":0.8,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000749/pdfft?md5=aee9f730063439e214c71730ad5c92be&pid=1-s2.0-S0890540124000749-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944895","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

State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages 交换正则表达式语言上的投影、洗牌、上下闭合和内部的状态复杂性边界

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-02 DOI: 10.1016/j.ic.2024.105204

Stefan Hoffmann

{"title":"State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages","authors":"Stefan Hoffmann","doi":"10.1016/j.ic.2024.105204","DOIUrl":"10.1016/j.ic.2024.105204","url":null,"abstract":"<div><div>We consider the state complexity of projection, shuffle, up- and downward closure and interior on commutative regular languages. We deduce the state complexity bound <math><msup><mrow><mi>n</mi></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math> for upward closure and downward interior, and <math><msup><mrow><mo>(</mo><mn>2</mn><mi>n</mi><mi>m</mi><mo>)</mo></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math>, <math><msup><mrow><mo>(</mo><mi>n</mi><mi>m</mi><mo>)</mo></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math>, <math><msup><mrow><mo>(</mo><mi>n</mi><mo>+</mo><mi>m</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math> and <math><msup><mrow><mo>(</mo><mi>n</mi><mo>+</mo><mi>m</mi><mo>−</mo><mn>2</mn><mo>)</mo></mrow><mrow><mo>|</mo><mi>Σ</mi><mo>|</mo></mrow></msup></math> for the shuffle on commutative regular, group, aperiodic and finite languages, respectively, with state complexities n and m over the alphabet Σ. We do not know whether these bounds are sharp. For projection, downward closure and upward interior, we give the sharp bound n. Our results are obtained by using the index and period vectors of a regular language, which we introduce in the present work and investigate w.r.t. the above operations and also union and intersection. Furthermore, we characterize the commutative aperiodic and commutative group languages in terms of these parameters and prove that a commutative regular language equals a finite union of shuffle products of commutative finite and commutative group languages.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105204"},"PeriodicalIF":0.8,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142416802","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

Symbolic computation in algebra, geometry, and differential equations 代数、几何和微分方程中的符号计算

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-02 DOI: 10.1016/j.ic.2024.105200

Franz Winkler

引用次数: 0

Total (restrained) domination in unit disk graphs 单位磁盘图中的完全（受约束）支配

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-08-02 DOI: 10.1016/j.ic.2024.105210

Yu Yang , Cai-Xia Wang , Shou-Jun Xu

引用次数: 0

On prime scenarios in qualitative spatial and temporal reasoning 论定性时空推理中的主要情景

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-07-31 DOI: 10.1016/j.ic.2024.105198

Yakoub Salhi , Michael Sioutis

引用次数: 0

On parallelisms of PG(3,4) with automorphisms of order 2 论 PG(3,4) 具有阶数为 2 的自动态的并行性

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-07-31 DOI: 10.1016/j.ic.2024.105201

Anton Betten , Svetlana Topalova , Stela Zhelezova

{"title":"On parallelisms of PG(3,4) with automorphisms of order 2","authors":"Anton Betten , Svetlana Topalova , Stela Zhelezova","doi":"10.1016/j.ic.2024.105201","DOIUrl":"10.1016/j.ic.2024.105201","url":null,"abstract":"<div>Let <math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>q</mi><mo>)</mo></math> be the n-dimensional projective space over the finite field <math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math>. A spread in <math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>q</mi><mo>)</mo></math> is a set of mutually skew lines which partition the point set. A parallelism is a partition of the set of lines by spreads. The classification of parallelisms in small finite projective spaces is of interest for problems from projective geometry, design theory, network coding, error-correcting codes, and cryptography. All parallelisms of <math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>)</mo></math> and <math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>3</mn><mo>)</mo></math> are known. Parallelisms of <math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math> which are invariant under automorphisms of odd prime orders have also been classified. The present paper contributes to the classification of parallelisms in <math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math> with automorphisms of even order. We focus on cyclic groups of order four and the group of order two generated by a Baer involution. We examine invariants of the parallelisms such as the full automorphism group, the type of spreads and questions of duality. The results given in this paper show that the number of parallelisms of <math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math> is at least 8675365. Some future directions of research are outlined.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105201"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944902","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

Detecting arrays for effects of multiple interacting factors 检测多个相互作用因素影响的阵列

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-07-31 DOI: 10.1016/j.ic.2024.105202

Charles J. Colbourn, Violet R. Syrotiuk

引用次数: 0

Attacking (EC)DSA with partially known multiples of nonces 利用部分已知的非ces倍数攻击 (EC)DSA

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2024-07-31 DOI: 10.1016/j.ic.2024.105203

Marios Adamoudis , Konstantinos A. Draziotis , Dimitrios Poulakis

引用次数: 0