Information and Computation最新文献_第9页

A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces s-有限跃迁核和概率相干空间中的线性指数公数

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-13 DOI: 10.1016/j.ic.2023.105109

Masahiro Hamano

{"title":"A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces","authors":"Masahiro Hamano","doi":"10.1016/j.ic.2023.105109","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105109","url":null,"abstract":"<div>This paper concerns a stochastic construction of probabilistic coherent spaces by employing novel ingredients (i) linear exponential comonad arising properly in the measure-theory (ii) continuous orthogonality between measures and measurable functions.A linear exponential comonad is constructed over a symmetric monoidal category of transition kernels, relaxing Markov kernels of Panangaden's stochastic relations into s-finite kernels. The model supports an orthogonality in terms of an integral between measures and measurable functions, which can be seen as a continuous extension of Girard-Danos-Ehrhard's linear duality for probabilistic coherent spaces. The orthogonality is formulated by a Hyland-Schalk double glueing construction, into which our measure theoretic monoidal comonad structure is accommodated. As an application to countable measurable spaces, a dagger compact closed category is obtained, whose double glueing gives rise to the familiar category of probabilistic coherent spaces.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"295 ","pages":"Article 105109"},"PeriodicalIF":1.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540123001128/pdfft?md5=e5df7885cdba0fd27e3bf8ca2af68829&pid=1-s2.0-S0890540123001128-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91968654","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}

引用次数: 3

Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields 带外场的铁磁Ising模型的Swendsen-Wang动力学

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105066

Weiming Feng, Heng Guo, Jiaheng Wang

引用次数: 1

Combinatory categorial grammars as generators of weighted forests 作为加权森林生成器的组合范畴语法

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105075

Andreas Maletti, Lena Katharina Schiffer

{"title":"Combinatory categorial grammars as generators of weighted forests","authors":"Andreas Maletti, Lena Katharina Schiffer","doi":"10.1016/j.ic.2023.105075","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105075","url":null,"abstract":"<div>Combinatory Categorial Grammar (CCG) is an extension of categorial grammar that is well-established in computational linguistics. It is mildly context-sensitive, so it is efficiently parsable and reaches an expressiveness that is suitable for describing natural languages. Weighted CCG (wCCG) are introduced as a natural extension of CCG with weights taken from an arbitrary commutative semiring. Their expressive power is compared to other weighted formalisms with special emphasis on the weighted forests generated by wCCG since the ability to express the underlying syntactic structure of an input sentence is a vital feature of CCG in the area of natural language processing. Building on recent results for the expressivity in the unweighted setting, the corresponding results are derived for the weighted setting for any commutative semiring. More precisely, the weighted forests generatable by wCCG are also generatable by weighted simple monadic context-free tree grammar (wsCFTG). If the rule system is restricted to application rules and composition rules of first degree, then the generatable weighted forests are exactly the regular weighted forests. Finally, when only application rules are allowed, then a proper subset of the regular weighted forests is generatable.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"294 ","pages":"Article 105075"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49870999","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

Modelling mutual exclusion in a process algebra with time-outs 具有超时的过程代数中互斥的建模

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105079

Rob van Glabbeek

引用次数: 3

Efficient construction of the BWT for repetitive text using string compression 使用字符串压缩高效构建重复文本的BWT

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105088

Diego Díaz-Domínguez , Gonzalo Navarro

{"title":"Efficient construction of the BWT for repetitive text using string compression","authors":"Diego Díaz-Domínguez , Gonzalo Navarro","doi":"10.1016/j.ic.2023.105088","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105088","url":null,"abstract":"<div>We present a new semi-external algorithm that builds the Burrows–Wheeler transform variant of Bauer et al. (a.k.a., BCR BWT) in linear expected time. Our method uses compression techniques to reduce computational costs when the input is massive and repetitive. Concretely, we build on induced suffix sorting (ISS) and resort to run-length and grammar compression to maintain our intermediate results in compact form. Our compression format not only saves space but also speeds up the required computations. Our experiments show important space and computation time savings when the text is repetitive. In moderate-size collections of real human genome assemblies (14.2 GB - 75.05 GB), our memory peak is, on average, 1.7x smaller than the peak of the state-of-the-art BCR BWT construction algorithm (ropebwt2), while running 5x faster. Our current implementation was also able to compute the BCR BWT of 400 real human genome assemblies (1.2 TB) in 41.21 hours using 118.83 GB of working memory (around 10% of the input size). Interestingly, the results we report in the 1.2 TB file are dominated by the difficulties of scanning huge files under memory constraints (specifically, I/O operations). This fact indicates we can perform much better with a more careful implementation of our method, thus scaling to even bigger sizes efficiently.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"294 ","pages":"Article 105088"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49871265","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

Building a small and informative phylogenetic supertree 建立一个小而信息丰富的系统发育超树

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105082

Jesper Jansson , Konstantinos Mampentzidis , Sandhya T.P.

{"title":"Building a small and informative phylogenetic supertree","authors":"Jesper Jansson , Konstantinos Mampentzidis , Sandhya T.P.","doi":"10.1016/j.ic.2023.105082","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105082","url":null,"abstract":"<div>We combine two fundamental optimization problems related to the construction of phylogenetic trees called maximum rooted triplets consistency and minimally resolved supertree into a new problem, which we call q-maximum rooted triplets consistency (q-MAXRTC). It takes as input a set <math><mi>R</mi></math> of rooted, binary phylogenetic trees with three leaves each and asks for a phylogenetic tree with exactly q internal nodes that contains the largest possible number of trees from <math><mi>R</mi></math>. We prove that q-MAXRTC is NP-hard to approximate within a constant, develop polynomial-time approximation algorithms for different values of q, and show experimentally that representing a phylogenetic tree by one having much fewer nodes typically does not destroy too much branching information. To demonstrate the algorithmic advantage of using trees with few internal nodes, we also propose a new algorithm for computing the rooted triplet distance that is faster than the existing algorithms when restricted to such trees.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"294 ","pages":"Article 105082"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49871271","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

A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption 基于标准CDH假设的基于强化eCK安全身份的认证密钥协议

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105067

Renu Mary Daniel , Anitha Thomas , Elijah Blessing Rajsingh , Salaja Silas

{"title":"A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption","authors":"Renu Mary Daniel , Anitha Thomas , Elijah Blessing Rajsingh , Salaja Silas","doi":"10.1016/j.ic.2023.105067","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105067","url":null,"abstract":"<div>An Authenticated Key Agreement (AKA) protocol enables two communicating parties to compute a session key with equal partnership, such that each entity is assured of the authenticity of its peer. Identity-based AKA (ID-AKA) protocols facilitate implicit authentication of the participating entities, without certificate verification. However, most of the existing ID-AKA schemes are proven secure based on the strong Gap Diffie-Hellman (GDH) assumption. Currently, there are no known implementation methods to realize the GDH assumption without using bilinear pairings. Further, none of the existing ID-AKA protocols have provable security against practical attacks due to intermediate result leakages. To this end, we propose a purely pairing-free ID-AKA protocol based on the Computational Diffie-Hellman assumption. The protocol offers provable security under the strengthened eCK (seCK) model that captures attacks resulting from intermediate result leakages. Comparative analysis with other ID-AKA protocols suggests that the proposed protocol satisfies stronger security requirements, without the gap assumption.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"294 ","pages":"Article 105067"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49871261","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

Further improvements for SAT in terms of formula length SAT在公式长度方面的进一步改进

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105085

Junqiang Peng, Mingyu Xiao

{"title":"Further improvements for SAT in terms of formula length","authors":"Junqiang Peng, Mingyu Xiao","doi":"10.1016/j.ic.2023.105085","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105085","url":null,"abstract":"<div>In this paper, we prove that the general CNF satisfiability problem can be solved in <math><msup><mrow><mi>O</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>(</mo><msup><mrow><mn>1.0638</mn></mrow><mrow><mi>L</mi></mrow></msup><mo>)</mo></math> time, where L is the length of the input CNF-formula (i.e., the total number of literals in the formula), which improves the previous result of <math><msup><mrow><mi>O</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>(</mo><msup><mrow><mn>1.0652</mn></mrow><mrow><mi>L</mi></mrow></msup><mo>)</mo></math> obtained in 2009. Our algorithm was analyzed by using the measure-and-conquer method. Our improvements are mainly attributed to the following two points: we carefully design branching rules to deal with degree-5 and degree-4 variables to avoid previous bottlenecks; we show that some worst cases will not always happen, and then we can use an amortized technique to get further improvements. In our analyses, we provide some general frameworks for analysis and several lower bounds on the decreasing of the measure to simplify the arguments. These techniques may be used to analyze more algorithms based on the measure-and-conquer method.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"294 ","pages":"Article 105085"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49871266","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

Achieving sequenced SQL with log-segmented timestamps 使用日志分段时间戳实现有序的SQL

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105065

Curtis E. Dyreson , M.A. Manazir Ahsan

{"title":"Achieving sequenced SQL with log-segmented timestamps","authors":"Curtis E. Dyreson , M.A. Manazir Ahsan","doi":"10.1016/j.ic.2023.105065","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105065","url":null,"abstract":"<div>In a period-timestamped, relational temporal database, each tuple is timestamped with a period. The timestamp records when the tuple is “alive” in some temporal dimension. Sequenced semantics is a special semantics for evaluating a query in a temporal database. The semantics stipulates that the query must, in effect, be evaluated simultaneously in each time instant using the tuples alive at that instant. Previous research has proposed changes to a database management system's query evaluation engine to support sequenced semantics. We show how to achieve sequenced semantics without modifying a query evaluation engine. Our technique has two pillars. First we use log-segmented timestamps to record a tuple's lifetime. A log-segmented timestamp divides the time-line into segments of known length. Any temporal period can be represented by a small number of such segments. Second, by taking advantage of the properties of log-segmented timestamps, we translate a sequenced query to a non-temporal query, using the operations already present in an unmodified, non-temporal query evaluation engine. The paper provides translations for both relational algebra and SQL. We experimentally evaluate the SQL translation. The primary contribution of this paper is how to implement sequenced semantics using log-segmented timestamped tuples in a generic SQL DBMS.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"294 ","pages":"Article 105065"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49871268","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

Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs 量子程序的抽象解释、霍尔逻辑和错误逻辑

IF 1 4区计算机科学

Information and Computation Pub Date : 2023-10-01 DOI: 10.1016/j.ic.2023.105077

Yuan Feng, Sanjiang Li

引用次数: 0