arXiv subjects

Patrick Finnerty

Publications and source records attributed to Patrick Finnerty.

4 recordsLinked to original sources

arXiv2026

TOFS: Feature Selection with Swap Supervision for Semantic Communication over Fading Channels

Task-oriented semantic communication transmits task-relevant features to support receiver inference under limited communication resources and adverse channel conditions. For image classification, the usefulness of a feature depends on the other transmitted features and the distortion introduced by the wireless channel. Effective feature prioritization should therefore account for classification performance after transmission of the selected features. This paper proposes a Task-Oriented Feature Selection (\textit{TOFS}) framework and method, which evaluates feature replacements using receiver classification loss. Loss differences confirmed under independent transmission samples provide pairwise ranking supervision for a selector network. The trained selector predicts priorities in a single forward pass. CIFAR-10 simulations demonstrate improved classification accuracy over an importance-based feature selection baseline at the same transmitted feature count and average transmit power. The proposed \textit{TOFS} framework shows 84\% accuracy performance under Rayleigh fading and Gaussian noise, compared with the 68\% performance of a SOTA method.

cs.LG↗

arXiv2026

Denoising Rather Than Gap Filling: Missing-Data Handling in Sparse Outdoor BLE Positioning

Received signal strength indicator (RSSI) positioning outdoors has one to two orders of magnitude fewer anchors than the indoor systems its methods come from. In the ten-day cattle-tracking deployment reported here, four gateways cover $4{,}302\,\mathrm{m}^2$, or $0.93$ anchors per $1000\,\mathrm{m}^2$. An animal is heard by $0.99$ gateways per second on average, so the observation vector for a given second is almost never complete. How the gaps are filled is therefore a first-order design choice, not a preprocessing detail. Filling at all is worth $8.1\,\mathrm{m}$, $96\%$ of the improvement the hold-length setting can deliver and a $29\%$ error reduction. How long a value is then held is worth the remaining $4\%$, from four seconds to unbounded. Once a value is available, the gain comes from removing noise rather than rebuilding the lost sample: a filtered channel estimate improves on a held raw sample, whereas filling backwards from future samples makes it worse. As that mechanism predicts, smoothing strength has a real interior optimum that is costly to miss in either direction. A smoother allowed to read the future gains only $0.55\,\mathrm{m}$, one fifteenth of what filling is worth, which bounds what any offline method can add. Three method families do not apply here for structural reasons rather than poor performance: two or more of the four channels are live in only $25\%$ of seconds, so the cross-channel structure generative imputation must learn is largely unobserved.

eess.SP↗

arXiv2025

A Study on E2E Performance Improvement of Platooning Using Outdoor LiFi

Platooning within autonomous vehicles has proven effective in addressing driver shortages and reducing fuel consumption. However, as platooning lengths increase, traditional C-V2X (cellular vehicle-to-everything) architectures are susceptible to end-to-end (E2E) latency increases. This is due to the necessity of relaying information through multiple hops from the leader vehicle to the last vehicle. To address this problem, this paper proposes a hybrid communication architecture based on a simulation that integrates light fidelity (LiFi) and C-V2X. The proposed architecture introduces multiple-leader vehicles equipped with outdoor LiFi communication nodes in platoons to achieve high-speed and low-delay communication between leader vehicles, which reduces E2E delay.

cs.NI↗

arXiv2022

Supercharging the APGAS Programming Model with Relocatable Distributed Collections

In this article we present our relocatable distributed collections library. Building on top of the AGPAS for Java library, we provide a number of useful intra-node parallel patterns as well as the features necessary to support the distributed nature of the computation through clearly identified methods. In particular, the transfer of distributed collections' entries between processes is supported via an integrated relocation system. This enables dynamic load-balancing capabilities, making it possible for programs to adapt to uneven or evolving cluster performance. The system we developed makes it possible to dynamically control the distribution and the data-flow of distributed programs through high-level abstractions. Programmers using our library can therefore write complex distributed programs combining computation and communication phases through a consistent API. We evaluate the performance of our library against two programs taken from well-known Java benchmark suites, demonstrating superior programmability, and obtaining better performance on one benchmark and reasonable overhead on the second. Finally, we demonstrate the ease and benefits of load-balancing and on a more complex application which uses the various features of our library extensively.

cs.DC↗