Information and Computation最新文献_第3页

SENDAI: A framework for joint reasoning about sensor data acquisition and sensor data analytics 仙台：传感器数据采集和传感器数据分析联合推理框架

IF 1 4区计算机科学

Information and Computation Pub Date : 2025-08-11 DOI: 10.1016/j.ic.2025.105335

Søren Kejser Jensen , Josefine Kejser , Federico Chiariotti , Christian Thomsen , Anders Ellersgaard Kalør , Petar Popovski , Beatriz Soret , Torben Bach Pedersen

{"title":"SENDAI: A framework for joint reasoning about sensor data acquisition and sensor data analytics","authors":"Søren Kejser Jensen , Josefine Kejser , Federico Chiariotti , Christian Thomsen , Anders Ellersgaard Kalør , Petar Popovski , Beatriz Soret , Torben Bach Pedersen","doi":"10.1016/j.ic.2025.105335","DOIUrl":"10.1016/j.ic.2025.105335","url":null,"abstract":"<div><div>Sensors are increasingly being deployed to monitor critical infrastructure. However, as the number of sensors being deployed increases, so does the amount of sensor data that must be transmitted, stored, and analyzed. Thus, a significant number of methods have been proposed to improve sensor data acquisition and analytics. However, the proposed strategies and methods generally focus exclusively on <em>either</em> sensor data acquisition or analytics, thus ignoring the possible optimization that can be performed by taking a holistic view. To explore this opportunity, this paper provides an overview of sensor data acquisition and analytics and an analysis of two very different use cases, specifically monitoring wind turbines and measuring utility consumption using smart meters. Based on this analysis, the Framework for joint Sensory Data Acquisition and Analytics (SENDAI) is proposed, an integrated framework that models sensor data acquisition and analytics together, thus enabling holistic reasoning about sensor data acquisition and analytics. To demonstrate how the information in SENDAI can be used to reason about sensor data acquisition and analytics together, we show how sensor data acquisition can be optimized to respond efficiently to query workloads.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"306 ","pages":"Article 105335"},"PeriodicalIF":1.0,"publicationDate":"2025-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144864272","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

Linear-time safe-alternating DFS and SCCs 线性-时间-安全交替DFS和SCCs

IF 1 4区计算机科学

Information and Computation Pub Date : 2025-08-11 DOI: 10.1016/j.ic.2025.105334

Carlo Comin, Romeo Rizzi

{"title":"Linear-time safe-alternating DFS and SCCs","authors":"Carlo Comin, Romeo Rizzi","doi":"10.1016/j.ic.2025.105334","DOIUrl":"10.1016/j.ic.2025.105334","url":null,"abstract":"<div><div>An alternating graph is a directed graph whose vertex set is partitioned into two colour classes, existential and universal.</div><div>This forms the basic arena for well-known models in formal verification, discrete optimal control, and infinite duration two-player games where Player □ and Player ○ alternate in a turn-based sliding of a pebble along the arcs they control.</div><div>We study alternating strongly-connectedness on alternating graphs as a generalization of strongly-connectedness in directed graphs, aiming at providing a linear-time decomposition and a sound structural graph characterization. For this a novel notion of alternating reachability is introduced: Player □ attempts to reach vertices without leaving a prescribed subset of the vertices while Player ○ works against. This is named <em>safe-alternating reachability</em>. It is shown that every alternating graph uniquely decomposes into <em>safe-alternating strongly-connected components</em>, where Player □ can visit each vertex within a given component infinitely often without having to ever leave out the component itself.</div><div>Our main result is a linear-time algorithm for computing this alternating graph decomposition. Both the underlying graph structures and the algorithm generalize the classical decomposition of a directed graph into strongly-connected components, building on the algorithms devised by Tarjan in 1972.</div><div>Our theory has direct applications e.g. solving well-known infinite duration pebble games faster. Dinneen and Khoussainov showed in 1999 that deciding a given Update Game costs <span><math><mi>O</mi><mo>(</mo><mi>m</mi><mi>n</mi><mo>)</mo></math></span> time, where <em>n</em> is the number of vertices and <em>m</em> is that of arcs. We solve that task in <span><math><mi>Θ</mi><mo>(</mo><mi>m</mi><mo>+</mo><mi>n</mi><mo>)</mo></math></span> linear time. In turn the complexity of Explicit McNaughton-Müller Games improves from cubic to quadratic.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"306 ","pages":"Article 105334"},"PeriodicalIF":1.0,"publicationDate":"2025-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144864273","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

Computable one-way functions on the reals 实数上可计算的单向函数

IF 1 4区计算机科学

Information and Computation Pub Date : 2025-07-22 DOI: 10.1016/j.ic.2025.105327

George Barmpalias, Xiaoyan Zhang

引用次数: 0

Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020) 第十届加权自动机：理论与应用国际研讨会特刊（WATA 2020）

IF 1 4区计算机科学

Information and Computation Pub Date : 2025-07-16 DOI: 10.1016/j.ic.2025.105331

Manfred Droste , Paul Gastin , Benjamin Monmege

引用次数: 0

Rauzy complexity and block entropy 混沌复杂性和块熵

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-07-15 DOI: 10.1016/j.ic.2025.105330

Verónica Becher , Olivier Carton , Santiago Figueira

{"title":"Rauzy complexity and block entropy","authors":"Verónica Becher , Olivier Carton , Santiago Figueira","doi":"10.1016/j.ic.2025.105330","DOIUrl":"10.1016/j.ic.2025.105330","url":null,"abstract":"<div><div>In 1976, Rauzy studied two complexity functions, <span><math><munder><mrow><mi>β</mi></mrow><mo>_</mo></munder></math></span> and <span><math><mover><mrow><mi>β</mi></mrow><mo>‾</mo></mover></math></span>, for infinite sequences over a finite alphabet. The function <span><math><munder><mrow><mi>β</mi></mrow><mo>_</mo></munder></math></span> achieves its maximum precisely for Borel normal sequences, while <span><math><mover><mrow><mi>β</mi></mrow><mo>‾</mo></mover></math></span> reaches its minimum for sequences that, when added to any Borel normal sequence, result in another Borel normal sequence. We establish a connection between Rauzy's complexity functions, <span><math><munder><mrow><mi>β</mi></mrow><mo>_</mo></munder></math></span> and <span><math><mover><mrow><mi>β</mi></mrow><mo>‾</mo></mover></math></span>, and the notions of non-aligned block entropy, <span><math><munder><mrow><mi>h</mi></mrow><mo>_</mo></munder></math></span> and <span><math><mover><mrow><mi>h</mi></mrow><mo>‾</mo></mover></math></span>, by providing sharp upper and lower bounds for <span><math><munder><mrow><mi>h</mi></mrow><mo>_</mo></munder></math></span> in terms of <span><math><munder><mrow><mi>β</mi></mrow><mo>_</mo></munder></math></span>, and sharp upper and lower bounds for <span><math><mover><mrow><mi>h</mi></mrow><mo>‾</mo></mover></math></span> in terms of <span><math><mover><mrow><mi>β</mi></mrow><mo>‾</mo></mover></math></span>. We adopt a probabilistic approach by considering an infinite sequence of random variables over a finite alphabet. The proof relies on a new characterization of non-aligned block entropies, <span><math><mover><mrow><mi>h</mi></mrow><mo>‾</mo></mover></math></span> and <span><math><munder><mrow><mi>h</mi></mrow><mo>_</mo></munder></math></span>, in terms of Shannon's conditional entropy. The bounds imply that sequences with <span><math><mover><mrow><mi>h</mi></mrow><mo>‾</mo></mover><mo>=</mo><mn>0</mn></math></span> coincide with those for which <span><math><mover><mrow><mi>β</mi></mrow><mo>‾</mo></mover><mo>=</mo><mn>0</mn></math></span>. We also show that the non-aligned block entropies, <span><math><munder><mrow><mi>h</mi></mrow><mo>_</mo></munder></math></span> and <span><math><mover><mrow><mi>h</mi></mrow><mo>‾</mo></mover></math></span>, are essentially subadditive.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"306 ","pages":"Article 105330"},"PeriodicalIF":0.8,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144685871","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

Randomness and imprecision: From supermartingales to randomness tests 随机性和不精确性：从上鞅到随机性检验

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-07-09 DOI: 10.1016/j.ic.2025.105328

Gert de Cooman, Floris Persiau, Jasper De Bock

引用次数: 0

Pushdown and one-counter automata: Constant and non-constant memory usage 下推式和单计数器自动机：恒定和非恒定内存使用

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-07-09 DOI: 10.1016/j.ic.2025.105329

Giovanni Pighizzini , Luca Prigioniero

{"title":"Pushdown and one-counter automata: Constant and non-constant memory usage","authors":"Giovanni Pighizzini , Luca Prigioniero","doi":"10.1016/j.ic.2025.105329","DOIUrl":"10.1016/j.ic.2025.105329","url":null,"abstract":"<div><div>It cannot be decided whether a one-counter automaton accepts each string in its language using a counter whose value is bounded, with respect to the length of the input, by a constant. Furthermore, when the counter is bounded by a constant, its value cannot be limited by any recursive function in the size of the machine.</div><div>By taking into account the costs of all computations (<span>strong</span> measure) or of all accepting computations (<span>accept</span> measure) instead of those of the least expensive accepting computations (<span>weak</span> measure), the above-mentioned problem becomes decidable for both pushdown automata and one-counter automata, while the bounds for the pushdown height or the value of the counter, when non constant, are recursive in the size of the machine.</div><div>We also prove that, under the <span>weak</span> measure, if a one-counter automaton accepts with a counter that, with respect to the input length, is not bounded by any constants, then the counter grows at least as a logarithmic function. This is in contrast with the case of pushdown automata in which the bound is a double-logarithmic function. For the <span>strong</span> and <span>accept</span> measures these bounds are shown to be linear, for both pushdown and one-counter automata.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"306 ","pages":"Article 105329"},"PeriodicalIF":0.8,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144631879","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

On algorithms based on finitely many homomorphism counts 基于有限多同态计数的算法

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-06-30 DOI: 10.1016/j.ic.2025.105326

Yijia Chen , Jörg Flum , Mingjun Liu , Zhiyang Xun

引用次数: 0

Exploiting pseudo-locality of interchange distance 利用交换距离的伪局部性

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-06-17 DOI: 10.1016/j.ic.2025.105324

Avivit Levy

引用次数: 0

Linear programming of monitoring the links of a fractional weighted network using distance 利用距离监测分数加权网络链路的线性规划

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-06-16 DOI: 10.1016/j.ic.2025.105323

Wen Li , Yaping Mao , Ralf Klasing

{"title":"Linear programming of monitoring the links of a fractional weighted network using distance","authors":"Wen Li , Yaping Mao , Ralf Klasing","doi":"10.1016/j.ic.2025.105323","DOIUrl":"10.1016/j.ic.2025.105323","url":null,"abstract":"<div><div>In 2022, Foucaud et al. initiated the study of a new graph-theoretic concept called distance-edge-monitoring number (DEM number for short), in the area of network monitoring. In this paper, we study linear programming for the distance-edge-monitoring problem. For a connected graph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>,</mo><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>)</mo></math></span>, let <em>h</em> be a function that assigns to each vertex <span><math><mi>v</mi><mo>∈</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> a number in <span><math><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span>. For a vertex subset <span><math><mi>X</mi><mo>⊆</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>, denote <span><math><mi>h</mi><mo>(</mo><mi>X</mi><mo>)</mo><mo>=</mo><msub><mrow><mi>Σ</mi></mrow><mrow><mi>v</mi><mo>∈</mo><mi>X</mi></mrow></msub><mi>h</mi><mo>(</mo><mi>v</mi><mo>)</mo></math></span>. Then, the function <em>h</em> is called a monitoring function of <em>G</em>, if for any edge <em>e</em> in <em>G</em>, the weights of these vertices which monitoring the edge <em>e</em> are at least 1. The <em>fractional distance-edge-monitoring number</em> (FDEM number for short) of <em>G</em>, denoted by <span><math><msub><mrow><mi>dem</mi></mrow><mrow><mi>f</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math></span>, is given by <span><math><msub><mrow><mi>dem</mi></mrow><mrow><mi>f</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>min</mi><mo>⁡</mo><mo>{</mo><mi>H</mi><mspace></mspace><mo>|</mo><mspace></mspace><mi>h</mi><mspace></mspace><mtext>is a monitoring function of</mtext><mspace></mspace><mi>G</mi><mo>}</mo></math></span>, where <span><math><mi>H</mi><mo>=</mo><mi>h</mi><mo>(</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>)</mo></math></span>. In this paper, we obtain some bounds or exact values for the FDEM number of some specific graphs or networks. Moreover, we study the graphs where the FDEM number equals to the DEM number. Finally, we investigate the FDEM number of some convex polytopes.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"306 ","pages":"Article 105323"},"PeriodicalIF":0.8,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144322510","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