Computational Challenges Research Articles

Applying the Expectation-Maximization Algorithm to Multivariate Signal Extraction

Understanding time series signal extraction is vital for federal agencies, especially as data collection accelerates. One natural extension is moving from univariate to multivariate signal extraction, which offers the promise of reducing extraction error by exploiting cross-sectional relationships. However, such an extension ushers in new computational challenges, viz. larger parameter spaces and more complicated objective functions. The Expectation-Maximization (EM) algorithm provides a methodology to implicitly compute (or approximate) maximum likelihood estimates (MLEs). This paper provides methodology for applying the EM algorithm to a class of latent component multivariate time series models that allow for a nuanced specification of the unobserved signal. We derive an explicit formula for the maximization step, which facilitates computation speed while also improving the stability of the algorithm. Numerical studies demonstrate EM’s ability to efficiently compute MLEs in low-dimensional systems, while also providing feasible estimates in moderate-dimensional systems where MLEs are infeasible to compute. Applications to monthly housing starts and daily immigration are provided.

Enhancing Digital Twins with Human Movement Data: A Comparative Study of Lidar-Based Tracking Methods

Digitals twins, used to represent dynamic environments, require accurate tracking of human movement to enhance their real-world application. This paper contributes to the field by systematically evaluating and comparing pre-existing tracking methods to identify strengths, weaknesses and practical applications within digital twin frameworks. The purpose of this study is to assess the efficacy of existing human movement tracking techniques for digital twins in real world environments, with the goal of improving spatial analysis and interaction within these virtual modes. We compare three approaches using indoor-mounted lidar sensors: (1) a frame-by-frame method deep learning model with convolutional neural networks (CNNs), (2) custom algorithms developed using OpenCV, and (3) the off-the-shelf lidar perception software package Percept version 1.6.3. Of these, the deep learning method performed best (F1 = 0.88), followed by Percept (F1 = 0.61), and finally the custom algorithms using OpenCV (F1 = 0.58). Each method had particular strengths and weaknesses, with OpenCV-based approaches that use frame comparison vulnerable to signal instability that is manifested as “flickering” in the dataset. Subsequent analysis of the spatial distribution of error revealed that both the custom algorithms and Percept took longer to acquire an identification, resulting in increased error near doorways. Percept software excelled in scenarios involving stationary individuals. These findings highlight the importance of selecting appropriate tracking methods for specific use. Future work will focus on model optimization, alternative data logging techniques, and innovative approaches to mitigate computational challenges, paving the way for more sophisticated and accessible spatial analysis tools. Integrating complementary sensor types and strategies, such as radar, audio levels, indoor positioning systems (IPSs), and wi-fi data, could further improve detection accuracy and validation while maintaining privacy.

Resource Allocation and Security Threat in Cloud Computing: A Survey

Cloud computing is a cutting-edge technology with enormous commercial and enterprise potential. Apps and related data can be accessed from any location thanks to clouds. Companies can drastically lower the cost of their infrastructure by renting resources from the cloud for storage and other processing needs. They can also use pay-as-you-go application access available to the entire firm. Therefore, obtaining licenses for specific products is not necessary. However, allocating resources as efficiently as possible is one of the main challenges in cloud computing. Because the model is unique, resource allocation is done to lower its expenses. Meeting application and customer requirements and consumer needs presents additional issues in resource allocation. This study provides a detailed discussion of several resource allocation systems, security threats, and the difficulties they face. This work is anticipated to help researchers and cloud users overcome obstacles.

DONGLE 2.0: Direct FPGA-Orchestrated NVMe Storage for HLS

Rapid growth in data size poses significant computational and memory challenges to data processing. FPGA accelerators and near-storage processing have emerged as compelling solutions for tackling the growing computational and memory requirements. Many FPGA-based accelerators have shown to be effective in processing large data sets by leveraging the storage capability of either host-attached or FPGA-attached storage devices. However, the current HLS development environment does not allow direct access to host-or FPGA-attached NVMe storage from the HLS code. As such, users must frequently hand off between HLS and host code to access data in storage, and such a process requires tedious programming to ensure functional correctness. Moreover, since the HLS code uses radically different methods to access storage compared to DRAM, the HLS codebase targeting DRAM-based platforms cannot be easily ported to NVMe-based platforms, resulting in limited code portability and reusability. Furthermore, frequent suspension of HLS kernel and synchronization between CPU and FPGA introduce significant latency overhead and require sophisticated scheduling mechanisms to hide latency. To address these challenges, we propose a new HLS storage interface named DONGLE 2.0 that enables direct FPGA-orchestrated NVMe storage access. By providing a unified interface for storage and memory access, DONGLE 2.0 allows a single-source HLS program to target multiple memory/storage devices, thus making the codebase cleaner, portable, and more efficient. DONGLE 2.0 is an extension to DONGLE 1.0 [ 1 ] but adds support for host-attached storage. While its primary focus is still on FPGA NVMe access in near-storage configurations, the added host storage support ensures its compatibility with platforms that lack native support for FPGA-attached NVMe storage. We implemented a prototype of DONGLE 2.0 using an AMD/Xilinx Alveo U200 FPGA and Solidigm DC-P4610 SSD. Our evaluation on various workloads showed a geometric mean speed-up of 2.3× and a reduction in lines of code (LoC) by 2.4× compared to the state-of-the-art commercial platform when using FPGA-attached NVMe storage. Moreover, DONGLE 2.0 demonstrated a geometric mean speed-up of 1.5× and a reduction in LoC by 2.4× compared to the state-of-the-art commercial platform when using host-attached NVMe storage.

Efficient spectrum allocation by heterogeneous automated frequency coordination network within 6 GHz band

This work proposes a heterogeneous automated frequency coordination network (HAFCN) to enhance reliability and enable dynamic spectrum allocation for unlicensed Wi-Fi devices (UWDs) within the 6 GHz band. This process relies heavily on spectrum sensing within the HAFCN. However, the widespread implementation of spectrum sensing by multiple UWDs in an automated frequency coordination (AFC) network using conventional fusion schemes poses computational challenges at the AFC provider. In response to this challenge, we present a selective soft-information (SSI) fusion scheme for the proposed HAFCN. First, we present generic mathematical expressions of false-alarm and missed detection probabilities for the HAFCN using an SSI fusion scheme. Second, a generalized AFC SSI fusion problem (GASFP) is formulated to minimize the system’s total error probability. Further, to mitigate the AFC provider’s overhead in solving the GASFP, this work presents the swift-sensing problem, determining the minimum antennas at UWD required to achieve a desired total error probability. Finally, comparative numerical results demonstrate that the HAFCN with the SSI fusion scheme shows a significant performance improvement over conventional fusion schemes in terms of the total error probability.

MEDANet: More Efficient Dual Attention Network for Scene Segmentation

The dual attention module is a potent semantic segmentation technique renowned for its capabilities, yet it often faces significant computational demands and GPU memory usage. To tackle these challenges, we introduce an advanced dual perception network comprising two modules: A streamlined Multi-scale Efficient Position Attention Module (MEPAM) and an optimized Efficient Channel Attention Module (MECAM). MEPAM incorporates multi-scale global average pooling into the Position Attention Module (PAM), substantially cutting computational overhead and memory consumption without compromising performance. Meanwhile, MECAM integrates compressed convolutions into the Channel Attention Module (CAM), improving segmentation accuracy and inference speed compared to conventional methods like DANet. Our approach underwent comprehensive evaluation on a semantic segmentation benchmark dataset, showcasing superior performance. For instance, on the Cityscapes dataset, our method achieves an IoU of 82.2%. In terms of efficiency gains, MEPAM operates nearly 1.97 times faster than the standard PAM module on GPU, while requiring 7.55 times less memory with a [Formula: see text] input. Similarly, MECAM achieves approximately 2.2 times faster processing than CAM, while cutting GPU memory usage by 7.53 times. This innovative dual perception network not only enhances segmentation accuracy and speed but also addresses the computational challenges associated with traditional dual attention modules.

Active Inference and Reinforcement Learning: A Unified Inference on Continuous State and Action Spaces Under Partial Observability.

Reinforcement learning (RL) has garnered significant attention for developing decision-making agents that aim to maximize rewards, specified by an external supervisor, within fully observable environments. However, many real-world problems involve partial or noisy observations, where agents cannot access complete and accurate information about the environment. These problems are commonly formulated as partially observable Markov decision processes (POMDPs). Previous studies have tackled RL in POMDPs by either incorporating the memory of past actions and observations or by inferring the true state of the environment from observed data. Nevertheless, aggregating observations and actions over time becomes impractical in problems with large decision-making time horizons and high-dimensional spaces. Furthermore, inference-based RL approaches often require many environmental samples to perform well, as they focus solely on reward maximization and neglect uncertainty in the inferred state. Active inference (AIF) is a framework naturally formulated in POMDPs and directs agents to select actions by minimizing a function called expected free energy (EFE). This supplies reward-maximizing (or exploitative) behavior, as in RL, with information-seeking (or exploratory) behavior. Despite this exploratory behavior of AIF, its use is limited to problems with small time horizons and discrete spaces due to the computational challenges associated with EFE. In this article, we propose a unified principle that establishes a theoretical connection between AIF and RL, enabling seamless integration of these two approaches and overcoming their limitations in continuous space POMDP settings. We substantiate our findings with rigorous theoretical analysis, providing novel perspectives for using AIF in designing and implementing artificial agents. Experimental results demonstrate the superior learning capabilities of our method compared to other alternative RL approaches in solving partially observable tasks with continuous spaces. Notably, our approach harnesses information-seeking exploration, enabling it to effectively solve reward-free problems and rendering explicit task reward design by an external supervisor optional.

A stochastic approach for elliptic problems in perforated domains

A wide range of applications in science and engineering involve a PDE model in a domain with perforations, such as perforated metals or air filters. Solving such perforated domain problems suffers from computational challenges related to resolving the scale imposed by the geometries of perforations. We propose a neural network-based mesh-free approach for perforated domain problems. The method is robust and efficient in capturing various configuration scales, including the averaged macroscopic behavior of the solution that involves a multiscale nature induced by small perforations. The new approach incorporates the derivative-free loss method that uses a stochastic representation or the Feynman-Kac formulation. In particular, we implement the Neumann boundary condition for the derivative-free loss method to handle the interface between the domain and perforations. A suite of stringent numerical tests is provided to support the proposed method's efficacy in handling various perforation scales.

Spin Dynamics of Radical Pairs Using the Stochastic Schrödinger Equation in MolSpin.

The chemical reactivity of radical pairs is strongly influenced by the interactions of electronic and nuclear spins. A detailed understanding of these effects requires a quantum description of the spin dynamics that considers spin-dependent reaction rates, interactions with external magnetic fields, spin-spin interactions, and the loss of spin coherence caused by coupling to a fluctuating environment. Modeling real chemical and biochemical systems, which frequently involve radicals with multinuclear spin systems, poses a severe computational challenge. Here, we implement a method based on the stochastic Schrödinger equation in the software package MolSpin. Large electron-nuclear spin systems can be simulated efficiently, with asymmetric spin-selective recombination reactions, anisotropic hyperfine interactions, and nonzero exchange and dipolar couplings. Spin-relaxation can be modeled using the stochastic time-dependence of spin interactions determined by molecular dynamics and quantum chemical calculations or by allowing rate coefficients to be explicitly time-dependent. The flexibility afforded by this approach opens new avenues for exploring the effects of complex molecular motions on the spin dynamics of chemical transformations.

Verification, validation, and uncertainty quantification (VVUQ) in structural analysis of concrete dams

Over the past three decades, advancements in computational power and numerical methods have significantly enhanced the role of structural analyses in the design and safety assessment of dams. Simulating concrete dam behavior, particularly in interactions with reservoir water and rock foundations, poses formidable computational challenges. Additionally, the need to define uncertainties related to material parameters, loading conditions, and modeling strategy adds complexity to the modeling process, therefore, quantifying sources of uncertainty is crucial for maintaining credibility and confidence in analysis results. This paper provides a synthesis and an overview of existing research and presents a generic framework for evaluating the credibility of advanced structural analysis methods for concrete dams, with a focus on their limitations and associated uncertainties. The methodology includes a comprehensive process for structural analysis, verification, validation, and uncertainty quantification, aiming to facilitate condition assessments of concrete dams.

Efficient Visual-Aware Fashion Recommendation Using Compressed Node Features and Graph-Based Learning

In fashion e-commerce, predicting item compatibility using visual features remains a significant challenge. Current recommendation systems often struggle to incorporate high-dimensional visual data into graph-based learning models effectively. This limitation presents a substantial opportunity to enhance the precision and effectiveness of fashion recommendations. In this paper, we present the Visual-aware Graph Convolutional Network (VAGCN). This novel framework helps improve how visual features can be incorporated into graph-based learning systems for fashion item compatibility predictions. The VAGCN framework employs a deep-stacked autoencoder to convert the input image’s high-dimensional raw CNN visual features into more manageable low-dimensional representations. In addition to improving feature representation, the GCN can also reason more intelligently about predictions, which would not be possible without this compression. The GCN encoder processes nodes in the graph to capture structural and feature correlation. Following the GCN encoder, the refined embeddings are input to a multi-layer perceptron (MLP) to calculate compatibility scores. The approach extends to using neighborhood information only during the testing phase to help with training efficiency and generalizability in practical scenarios, a key characteristic of our model. By leveraging its ability to capture latent visual features and neighborhood-based learning, VAGCN thoroughly investigates item compatibility across various categories. This method significantly improves predictive accuracy, consistently outperforming existing benchmarks. These contributions tackle significant scalability and computational efficiency challenges, showcasing the potential transformation of recommendation systems through enhanced feature representation, paving the way for further innovations in the fashion domain.

Sensitivity Analysis of Fatigue Life for Cracked Carbon-Fiber Structures Based on Surrogate Sampling and Kriging Model under Distribution Parameter Uncertainty

The quality and reliability of wind turbine blades, as core components of wind turbines, are crucial for the operational safety of the entire system. Carbon fiber is the primary material for wind turbine blades. However, during the manufacturing process, manual intervention inevitably introduces minor defects, which can lead to crack propagation under complex working conditions. Due to limited understanding and measurement capabilities of the input variables of structural systems, the distribution parameters of these variables often exhibit uncertainty. Therefore, it is essential to assess the impact of distribution parameter uncertainty on the fatigue performance of carbon-fiber structures with initial cracks and quickly identify the key distribution parameters affecting their reliability through global sensitivity analysis. This paper proposes a sensitivity analysis method based on surrogate sampling and the Kriging model to address the computational challenges and engineering application difficulties in distribution parameter sensitivity analysis. First, fatigue tests were conducted on carbon-fiber structures with initial cracks to study the dispersion of their fatigue life under different initial crack lengths. Next, based on the Hashin fatigue failure criterion, a simulation analysis method for the fatigue cumulative damage life of cracked carbon-fiber structures was proposed. By introducing uncertainty parameters into the simulation model, a training sample set was obtained, and a Kriging model describing the relationship between distribution parameters and fatigue life was established. Finally, an efficient input variable sampling method using the surrogate sampling probability density function was introduced, and a Sobol sensitivity analysis method based on surrogate sampling and the Kriging model was proposed. The results show that this method significantly reduces the computational burden of distribution parameter sensitivity analysis while ensuring computational accuracy.

Structural transitions in liquid semiconductor alloys: A molecular dynamics study with a neural network potential.

Liquid-liquid phase transitions hold a unique and profound significance within condensed matter physics. These transitions, while conceptually intriguing, often pose formidable computational challenges. However, recent advances in neural network (NN) potentials offer a promising avenue to effectively address these challenges. In this paper, we delve into the structural transitions of liquid CdTe, CdS, and their alloy systems using molecular dynamics simulations, harnessing the power of an NN potential named LaspNN. Our investigations encompass both pressure and temperature effects. Through our simulations, we uncover three primary liquid structures around melting points that emerge as pressure increases: tetrahedral, rock salt, and close-packed structures, which greatly resemble those of solid states. In the high-temperature regime, we observe the formation of Te chains and S dimers, providing a deeper understanding of the liquid's atomic arrangements. When examining CdSxTe1-x alloys, our findings indicate that a small substitution of S by Te atoms for S-rich alloys (x > 0.5) exhibits a structural transition much different from CdS, while a large substitution of Te by S atoms for Te-rich alloys (x < 0.5) barely exhibits a structural transition similar to CdTe. We construct a schematic diagram for liquid alloys that considers both temperature and pressure, providing a comprehensive overview of the alloy system's behavior. The local aggregation of Te atoms demonstrates a linear relationship with alloy composition x, whereas that of S atoms exhibits a nonlinear one, shedding light on the composition-dependent structural changes.

MetaExpertPro: A Computational Workflow for Metaproteomics Spectral Library Construction and Data-Independent Acquisition Mass Spectrometry Data Analysis

Analysis of large-scale data-independent acquisition mass spectrometry metaproteomics data remains a computational challenge. Here, we present a computational pipeline called metaExpertPro for metaproteomics data analysis. This pipeline encompasses spectral library generation using data-dependent acquisition MS, protein identification and quantification using data-independent acquisition mass spectrometry, functional and taxonomic annotation, as well as quantitative matrix generation for both microbiota and hosts. By integrating FragPipe and DIA-NN, metaExpertPro offers compatibility with both Orbitrap and timsTOF MS instruments. To evaluate the depth and accuracy of identification and quantification, we conducted extensive assessments using human fecal samples and benchmark tests. Performance tests conducted on human fecal samples indicated that metaExpertPro quantified an average of 45,000 peptides in a 60-min diaPASEF injection. Notably, metaExpertPro outperformed three existing software tools by characterizing a higher number of peptides and proteins. Importantly, metaExpertPro maintained a low factual false discovery rate of approximately 5% for protein groups across four benchmark tests. Applying a filter of five peptides per genus, metaExpertPro achieved relatively high accuracy (F-score=0.67-0.90) in genus diversity and showed a high correlation (rSpearman=0.73-0.82) between the measured and true genus relative abundance in benchmark tests. Additionally, the quantitative results at the protein, taxonomy, and function levels exhibited high reproducibility and consistency across the commonly adopted public human gut microbial protein databases IGC and UHGP. In a metaproteomic analysis of dyslipidemia patients, metaExpertPro revealed characteristic alterations in microbial functions and potential interactions between the microbiota and the host.

An efficient physics-dimension-based reduction method for computing frequency response functions of viscoelastically damped systems

The frequency response functions (FRFs) are of critical interest to dynamic problems, however, they suffer from computational challenges for viscoelastically damped systems. In this paper, a physics-space-based reduction method is proposed for predicting the FRFs of large-scale viscoelastically damped systems involving the standard linear solid model. A physics-dimension subspace is constructed based on original system matrices and viscoelastic parameters, which can be easily generated by using a recursive manner. A projection basis generation algorithm is then developed to generate a standard orthonormal basis within the physics-dimension subspace. With the help of the standard orthonormal basis and the moment-matching-based reduction method, a physics-space-based reduction method is proposed for efficiently predicting the FRFs of large-scale viscoelastically damped systems. Unlike the widely used state-space reduction method, the reduced system of the proposed method can preserve system’s physical structure so that the physical meaning can be captured. Using both theoretical and numerical analyses, the proposed physics-space-based method is more accurate and efficient than the state-space-based reduction method.

Neural networks based surrogate modeling for efficient uncertainty quantification and calibration of MEMS accelerometers

This paper addresses the computational challenges inherent in the stochastic characterization and uncertainty quantification of Micro-Electro-Mechanical Systems (MEMS) capacitive accelerometers. Traditional methods, such as Markov Chain Monte Carlo (MCMC) algorithms, are often constrained by the computational intensity required for high-fidelity (e.g., finite element) simulations. To overcome these limitations, we propose to use supervised learning-based surrogate models, specifically artificial neural networks, to effectively approximate the response of MEMS capacitive accelerometers. Our approach involves training the surrogate models with data derived from initial high-fidelity finite element analyses (FEA), providing rich datasets to be generated in an offline phase. The surrogate models replicate the FEA accuracy in predicting the behavior of the accelerometer under a wide range of fabrication parameters, thereby reducing the online computational cost without compromising accuracy. This enables extensive and efficient stochastic analyses of complex MEMS devices, offering a flexible framework for their characterization. A key application of our framework is demonstrated in estimating the sensitivity of an accelerometer, accounting for unknown mechanical offsets, over-etching, and thickness variations. We employ an MCMC approach to estimate the posterior distribution of the device’s unknown fabrication parameters, informed by its response to transient voltage signals. The integration of surrogate models for mapping fabrication parameters to device responses, and subsequently to sensitivity measures, greatly enhances both backward and forward uncertainty quantification, yielding accurate results while significantly improving the efficiency and effectiveness of the characterization process. This process allows for the reconstruction of device sensitivity using only voltage signals, without the need for direct mechanical acceleration stimuli.

Efficient finite element reliability analysis employing sequentially-updated surrogate model for fragility curve derivation

As the threat of natural disasters to structures intensifies, risk assessment of infrastructure has gained much importance. Fragility curves are essential tools in predicting disaster-related losses and making disaster mitigation decisions. In this paper, we propose a new method to efficiently derive accurate fragility curves for structures with high levels of nonlinearity or complexity, addressing the computational challenges of conventional finite element reliability analysis (FERA). To reduce the computational cost for calculating probability of failure in FERA, the proposed method utilizes the first-order reliability method (FORM). However, even with this approach, the computational cost of deriving the fragility curve may remain high; therefore, a surrogate model is used to further reduce costs. By training the surrogate model using the initial structural damage probabilities for a few hazard intensities, an optimal starting point can be calculated for the subsequent FORM analysis. During the fragility analysis, the surrogate model can be updated sequentially to increase the efficiency of FORM analysis continuously. In particular, the training process of the surrogate model requires no separate or additional finite element analysis because it is constructed using previous FERA results. The accuracy and efficiency of the proposed method are tested using conventional FERA and Monte Carlo simulations through a hypothetical short-column example. In addition, fragility curves are derived through a bridge flood fragility assessment considering the scour and seismic vulnerability assessment of a buried gas pipeline considering soil-structure interactions. The derived fragility curves closely match those derived using the conventional FERA, and the computational costs are reduced by 36.54 % and 52.38 %, respectively, compared with the conventional FERA, confirming its cost-effectiveness.

Interstellar computation their challenges and approaches in interplanetary cloud systems and data transmission

With the advancement of human civilisation beyond the confines of Earth's atmosphere, there has been an increasing need for efficient data processing and transmission in extraterrestrial environments. The article explores innovative strategies for resolving intricate computational challenges encountered in the context of interplanetary distances. The purpose of this study is to investigate the impact of issues such as latency, data corruption, and power consumption on classical computing paradigms in space. We examine the concept of "interplanetary cloud systems", which use distributed computation and data storage to tackle these issues. The article also covers advanced techniques for sending data, including communication systems using quantum entanglement and deep space networks. The article integrates the disciplines of astronomy, computer science, and space exploration to provide a holistic perspective on the issue. It is crucial to emphasise that the implementation of fault-tolerant systems, adaptive algorithms, and robust networking protocols is essential for the success of extrasolar computing programs. The article thoroughly explores the potential and risks that arise when space travel, astronomy, and computer science intersect. We explore the potential future of interplanetary data processing and communication technologies via the examination of fault tolerance, adaptive algorithms, and resilient networking. The importance of resolving computational issues in space increases as humanity extends its presence in the cosmos. The study results have significant ramifications for the development of forthcoming technology enabling interplanetary data transfer, hence facilitating human colonisation and scientific exploration beyond Earth.

Bio-Plausible Multimodal Learning with Emerging Neuromorphic Devices.

Multimodal machine learning, as a prospective advancement in artificial intelligence, endeavors to emulate the brain's multimodal learning abilities with the objective to enhance interactions with humans. However, this approach requires simultaneous processing of diverse types of data, leading to increased model complexity, longer training times, and higher energy consumption. Multimodal neuromorphic devices have the capability to preprocess spatio-temporal information from various physical signals into unified electrical signals with high information density, thereby enabling more biologically plausible multimodal learning with low complexity and high energy-efficiency. Here, this work conducts a comparison between the expression of multimodal machine learning and multimodal neuromorphic computing, followed by an overview of the key characteristics associated with multimodal neuromorphic devices. The bio-plausible operational principles and the multimodal learning abilities of emerging devices are examined, which are classified into heterogeneous and homogeneous multimodal neuromorphic devices. Subsequently, this work provides a detailed description of the multimodal learning capabilities demonstrated by neuromorphic circuits and their respective applications. Finally, this work highlights the limitations and challenges of multimodal neuromorphic computing in order to hopefully provide insight into potential future research directions.

Localization–delocalization transition for light particles in turbulence

Small bubbles in fluids rise to the surface due to Archimede's force. Remarkably, in turbulent flows this process is severely hindered by the presence of vortex filaments, which act as moving potential wells, dynamically trapping light particles and bubbles. Quantifying the statistical weights and roles of vortex filaments in turbulence is, however, still an outstanding experimental and computational challenge due to their small scale, fast chaotic motion, and transient nature. Here we show that, under the influence of a modulated oscillatory forcing, the collective bubble behavior switches from a dynamically localized to a delocalized state. Additionally, we find that by varying the forcing frequency and amplitude, a remarkable resonant phenomenon between light particles and small-scale vortex filaments emerges, likening particle behavior to a forced damped oscillator. We discuss how these externally actuated bubbles can be used as a type of microscopic probe to investigate the space-time statistical properties of the smallest turbulence scales, allowing to quantitatively measure physical characteristics of vortex filaments. We develop a superposition model that is in excellent agreement with the simulation data of the particle dynamics which reveals the fraction of localized/delocalized particles as well as characteristics of the potential landscape induced by vortices in turbulence. Our approach paves the way for innovative ways to accurately measure turbulent properties and to the possibility to control light particles and bubble motions in turbulence with potential applications to oceanography, medical imaging, drug/gene delivery, chemical reactions, wastewater treatment, and industrial mixing.