Multiple blind sound source localization is the key technology for a myriad of applications such as robotic navigation and indoor localization. However, existing solutions can only locate a few sound sources simultaneously due to the limitation imposed by the number of microphones in an array. To this end, this paper proposes a novel multiple blind sound source localization algorithms using Source seParation and BeamForming (SPBF). Our algorithm overcomes the limitations of existing solutions and can locate more blind sources than the number of microphones in an array. Specifically, we propose a novel microphone layout, enabling salient multiple source separation while still preserving their arrival time information. After then, we perform source localization via beamforming using each demixed source. Such a design allows minimizing mutual interference from different sound sources, thereby enabling finer AoA estimation. To further enhance localization performance, we design a new spectral weighting function that can enhance the signal-to-noise-ratio, allowing a relatively narrow beam and thus finer angle of arrival estimation. Simulation experiments under typical indoor situations demonstrate a maximum of only even under up to 14 sources.
Remote calibration is an advanced methodology that leverages electricity meters, intelligent detection, and computing technologies to enhance calibration efficiency and precision significantly. However, current research predominantly focuses on isolated calibration architectures tailored to single-laboratory environments. In contrast, distributed remote calibration systems that integrate multiple nodes remain in their early developmental stages, despite their considerable potential for improving scalability and operational efficiency. The purpose of this paper is to propose a multi-point collaborative distributed remote calibration model that improves scalability and operational efficiency for remote sensing devices. It addresses the challenge of resource allocation for synchronous calibration across distributed nodes by introducing a hybrid genetic algorithm that optimises scheduling and resource management. Experimental results reveal that the proposed algorithm surpasses other comparable methods in its category, highlighting its capability to improve resource efficiency in distributed remote calibration systems. Additionally, the hybrid genetic algorithm offers profound insights and effective solutions to the intricate challenges of task scheduling in dual-container synchronisation, enhancing both scheduling performance and system dependability.
11 January 2021 in IEEE Internet of Things Journal
Fitness games recently attract much attention these years due to its combination of playability and athleticism. However, most fitness games are entertainment for a single person, with only a few deliver distinctive experiences for multi-players. Enabling interaction between multiple players would be more enjoyable due to exciting cooperation among players. Considering a Big Stomach Challenge for two players, a certain amount of food can be only eaten when a mouth size, represented by the distance between players is reached collaboratively. Similarly, a certain type of food can only be picked up when the food grabbing speed, denoted by the approaching speed between players, is fast enough. Such games require accurate ranging and speed estimation in a relatively long distance (1 m-15 m) to deliver a good gaming experience. However existing ranging schemes cannot meet the above requirements. They either cannot work under Doppler channels or have to strike a balance between accuracy and operational range, prohibiting a heuristic implementation for the above games. To this end, we design MotionBeep, a novel acoustic ranging scheme that achieves centimeter-level ranging and dm/s-level speed estimation accuracy under representative indoor and outdoor scenes within 15 m. In MotionBeep, we design a new working paradigm and incorporates a state-space model to maintain accurate ranging in both static and dynamic channels. We have implemented a system prototype and evaluate its performance in representative environments. Evaluation results demonstrate that MotionBeep achieves a median of centimeter accuracy with up to 15 m even under Doppler effect.
The rapid advancement of unmanned aerial vehicle (UAV) technology has led to its widespread adoption in military reconnaissance, disaster monitoring, environmental inspection, and related fields. However, a single UAV often faces limitations when executing large-scale and complex missions. UAV swarm technology, which employs multi-agent collaboration, can significantly improve task execution efficiency and overall system performance, representing an area of considerable research importance. Current studies on task allocation and path planning for UAV swarms exhibit certain shortcomings, particularly the high computational complexity and insufficient real-time performance of existing path planning methods when applied to highly dynamic, multi-objective, and large-scale complex scenarios. To address the above challenge, this paper proposes a Gale-Shapley-based Genetic Algorithm (GSGA) for UAV swarm task allocation and path planning. First, a multi-UAV data inspection system model is formulated based on an energy consumption model, analyzing the influence of factors including geographical fairness, data utility, and energy consumption. The proposed GSGA integrates the Gale-Shapley stable matching algorithm for one-to-one task assignment between UAVs and sub-regions with a genetic algorithm optimized for intra-region path planning. Dynamic programming is further employed to refine the flight paths. The results show that the GSGA strategy can effectively improve the balance of task allocation, optimize path length and inspection quality. The proposed method demonstrated robust performance in complex scenarios characterized by numerous task targets and intricate regional partitions, consistently enabling UAVs to complete inspection tasks with high collaborative efficiency.
With the rapid growth of large-scale networks, traditional rule-based and supervised anomaly detection methods struggle with heavy reliance on labeled data, slow response to rapidly changing patterns, and difficulty in capturing complex temporal anomalies. At the same time, real-world traffic exhibits strong class imbalance, where normal samples overwhelmingly dominate, causing many existing models to miss subtle but critical abnormal behaviors. To address these challenges, this paper proposes an unsupervised temporal anomaly detection framework for network traffic based on a Transformer-autoencoder bidirectional prediction and reconstruction model. The framework combines the advantages of autoencoders and regression models, using multi-head self-attention and positional encoding to capture long-range temporal dependencies in traffic sequences. A masked decoding mechanism is further employed to prevent information leakage from future time steps. The model jointly generates forward and backward predictions as well as reconstructed sequences, and designs multiple anomaly scoring strategies that integrate prediction and reconstruction errors to enhance the sensitivity to point, contextual, and collective anomalies under highly imbalanced data. Experiments on three public benchmark datasets demonstrate that the proposed method significantly improves detection performance, achieving up to an F1 score of 0.960 and a precision of 0.949, with recall approaching 1.0, while reducing false alarms, thereby showing strong applicability to practical network security scenarios.
30 December 2025 in Future Generation Computer Systems