Target-Aware Permanent Sampling (TAPS) is introduced, a graph-diffusion framework for selecting permanent locations observed repeatedly over time that can reduce unnecessary sensor installations, maintenance, and cost while preserving the information needed for future air-quality decisions, subject to validation with the estimator that will use the network.
Abstract
Permanent air-quality networks are expensive to install and maintain, yet many decisions depend on one future regional exposure rather than the complete pollution field. We introduce Target-Aware Permanent Sampling (TAPS), a graph-diffusion framework for selecting permanent locations observed repeatedly over time, that can reduce unnecessary sensor installations, maintenance, and cost while preserving the information needed for future air-quality decisions, subject to validation with the estimator that will use the network. We formulate the permanent space-time sampling problem and show that, in the noiseless model, recovery of one prescribed target can require less information than full-state identification, for which we give an explicit lower bound on the permanent-location count. We also derive a greedy rule whose marginal gain factors into raw target response and a finite-update correction. We evaluate TAPS on regulatory air-quality networks in California, Canada, and England. In each case the prescribed regional target becomes numerically recoverable at permanent-location budgets well below those required to identify the retained state, and TAPS attains lower regularized target risk than target-weight, geometric, and design-based placements. A blind prospective study further shows that the criterion can be applied before candidate sites have any ground-monitor history, using exogenous environmental covariates alone.
CTRL-FM, an observation-preserving flow-matching framework that treats structural guidance as an outage-conditioned inference-time decision, is introduced, demonstrating that validating, selecting, and locally adapting structural guidance for each realized outage is more effective than imposing a single global structur...
Findings support incorporating price geometry and volume into generative modeling, with field accuracy and predictive uncertainty evaluated together, in a full-field evaluation framework that combines a transport cost sensitive to price placement and total volume with proper scoring rules and calibration diagnostics.
This paper investigates distributed barycentric localization in sensor networks, where each unknown node can select from multiple feasible neighbor subsets at each iteration. The numerical quality of these subsets can vary significantly: well-conditioned subsets enable reliable local updates, whereas nearly degenerate...
Zhuang-Zhuang Ma, Shuai-Ming Yan, Pan-Pan Zhu et al.· IEEE Transactions on Signal...· 0 citations
Influence minimization by node blocking is a fundamental problem in graph data management that seeks a small set of vertices whose removal minimizes the expected spread from a fixed source set. It supports decisions about where to intervene in large interaction networks to control harmful propagation, such as the sprea...
Spatial gains can arise from detector identity, additional capacity, or denser learned graphs. This exploratory development study tests when cross-node modeling improves multi-horizon traffic forecasting under degree-and capacity-controlled comparisons. Horizon-Conditioned Sparse Graph Fusion (HCSGF) combines a causal...
Decentralized V2X resource control is challenging because each vehicle has only local observations, while reliability depends on network-wide interactions. We develop a physical-risk-aware spatio-temporal graph attention (PA-STGAT) framework for agentic V2X control. Each vehicle perceives its local interaction graph, r...
Hao-Ran Peng, W. W. Zheng, Hang Liu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.