Search Results (4,710)

Accurate assessment of the State of Health (SOH) is critical for battery management systems in aviation. As a step towards this goal, this study presents a proof-of-concept for a novel SOH estimation method based on an Improved Particle Swarm Optimization-Extreme Learning Machine (IPSO-ELM) model, validated under controlled laboratory cycling conditions. Although traditional Extreme Learning Machines (ELM) are widely used due to their fast computation and good generalization, their random parameter initialization often leads to unstable convergence and limited accuracy. To address these limitations, this paper proposes a novel SOH estimation method based on an Improved Particle Swarm Optimization (IPSO) algorithm to optimize the key parameters of ELM. Three health indicators (HI)—constant-current charging time, equal-voltage-drop discharge time, and average discharge voltage—were extracted from charge–discharge curves as model inputs. The IPSO algorithm dynamically adjusts the inertia weight, introduces a constriction factor and a termination counter to enhance global search capability and avoid local optima. Experimental results on open-source datasets (B005, B007, B0018) and laboratory datasets (A001, A002) demonstrate that the proposed IPSO-ELM model achieves a Root-Mean-Square Error (RMSE) below 0.7% and a Mean Absolute Percentage Error (MAPE) below 0.5%. Compared with standard ELM and PSO-ELM models, it significantly outperforms them in accuracy (e.g., for B0018, RMSE is reduced to 0.21% and MAPE to 0.14%), convergence speed, and robustness, establishing a foundation for future development of aviation-ready SOH estimators. Full article

Millimeter-wave radar has gradually gained popularity as a sensor mode for Human Activity Recognition (HAR) in recent years because it preserves the privacy of individuals and is resistant to environmental conditions. Nevertheless, the fast inference of high-dimensional and sparse 4D radar data is still difficult to perform on low-resource edge devices. Current models, including 3D Convolutional Neural Networks and Transformer-based models, are frequently plagued by extensive parameter overhead or quadratic computational complexity, which restricts their applicability to edge applications. The present paper attempts to resolve these issues by introducing RadarSSM as a lightweight spatiotemporal hybrid network in the context of radar-based HAR. The explicit separation of spatial feature extraction and temporal dependency modeling helps RadarSSM decrease the overall complexity of computation significantly. Specifically, a spatial encoder based on depthwise separable 3D convolutions is designed to efficiently capture fine-grained geometric and motion features from voxelized radar data. For temporal modeling, a bidirectional State Space Model is introduced to capture long-range temporal dependencies with linear time complexity $O\left(T\right)$, thereby avoiding the quadratic cost associated with self-attention mechanisms. Extensive experiments conducted on public radar HAR datasets demonstrate that RadarSSM achieves accuracy competitive with state-of-the-art methods while substantially reducing parameter count and computational cost relative to representative convolutional baselines. These results validate the effectiveness of RadarSSM and highlight its suitability for efficient radar sensing on edge hardware. Full article

Microinjection is one of the most established and effective techniques for introducing foreign substances into cells. However, issues such as cumbersome procedures, low success rates, and poor repeatability in manual cell microinjection have seriously restricted its practical applications in biomedical research and engineering. Responding to such problems, this paper designs an automated microinjection system that combines deep learning visual positioning and adaptive neural network sliding-mode motion control. The machine vision solution based on the deep learning YOLOv8 target detection algorithm is utilized by the system to provide positional prerequisites for automated microinjection. Then, stable and fast puncture is completed by controlling the end effector (composed of a piezoelectric actuator and a displacement amplification mechanism). Since the piezoelectric actuator has strong nonlinearity, the motion control of the end effector adopts the control strategy combining sliding mode variable structure and adaptive neural networks to meet the requirements of precise displacement output of microinjection. At the same time, a host computer control system is developed to integrate hardware equipment, visual positioning algorithms and motion control algorithms to achieve corresponding automated microinjection tasks. Finally, the effectiveness of the designed automated microinjection system is successfully verified on zebrafish embryos. Full article

Unreinforced masonry walls exhibit limited resistance to lateral loads and, therefore, frequently require strengthening interventions. Carbon fiber reinforced polymer (CFRP) systems provide an efficient retrofit solution; however, current design procedures defined in structural guidelines require repetitive trial calculations to determine the necessary reinforcement amount. This study introduces a hybrid computational process that integrates metaheuristic optimization with symbolic regression to generate direct analytical equations for the estimation of the required CFRP area. First, a comprehensive database containing 1300 optimal strengthening scenarios was generated using the Jaya optimization algorithm under the constraints specified in ACI 440.7R and ACI 530. The resulting dataset was subsequently processed through symbolic regression using the PySR platform to identify explicit mathematical relationships between structural parameters and the optimum CFRP area. Most traditional machine learning approaches operate as black-box predictors. In contrast, the proposed approach generates interpretable closed-form expressions that can be used directly in engineering calculations. Two models were derived from the Pareto-optimal solution set. The first model is a simplified equation emphasizing algebraic simplicity. The second model prioritizes prediction accuracy. The simplified formulation achieved a coefficient of determination of approximately 0.992. The accuracy-focused model achieved a value above 0.997 with very low prediction errors. Validation studies with independent test samples showed that the obtained equations are reliable. The average error for the simplified model is below 4%, and for the high-accuracy model, it is approximately 2%. The results demonstrate that combining the optimization-generated datasets with symbolic regression makes it possible to obtain transparent design equations. These equations eliminate iterative design processes and provide a fast and reliable estimation tool for CFRP strengthening of masonry walls. Full article

Grid-forming (GFM) battery energy storage system (BESS) inverters are becoming a cornerstone of resilient microgrids, where severe voltage sags and abrupt operating shifts can challenge both voltage regulation and controller stability. Finite-set model predictive control (FS-MPC) offers fast transient response and multi-objective coordination, yet conventional designs rely on static cost-function weights that are typically tuned offline and may become suboptimal under disturbance-driven regime changes. This paper proposes a forecast-guided KAN-adaptive FS-MPC framework that (i) formulates the inner-loop predictive control in the stationary αβ frame, thereby avoiding PLL dependency and mitigating loss-of-lock risk under extreme sags, and (ii) introduces an Operating Stress Index (OSI) that fuses load forecasts with reserve-margin or percent-operating-reserve signals to quantify grid vulnerability and trigger resilience-oriented control adaptation. A lightweight Kolmogorov–Arnold Network (KAN), parameterized by learnable B-spline edge functions, is embedded as an online weight governor to update key FS-MPC weighting factors in real time, dynamically balancing voltage tracking and switching effort. Experimental validation under high-frequency microgrid scenarios shows that, under a 50% symmetrical voltage sag, the proposed controller reduces the worst-case voltage deviation from 0.45 p.u. to 0.16 p.u. (64.4%) and shortens the recovery time from 35 ms to 8 ms (77.1%) compared with static-weight FS-MPC. In the islanding-like transition case, the proposed method restores the PCC voltage within 18 ms, whereas the static baseline fails to recover within 100 ms. Moreover, the deployed KAN governor requires only 6.2 μs per inference on a 200 MHz DSP, supporting real-time embedded implementation. These results demonstrate that forecast-guided adaptive weighting improves transient resilience and power quality while maintaining DSP-feasible computational complexity. Full article

The exact perimeter of an ellipse involves the complete elliptic integral of the second kind, which lacks a closed-form expression in elementary functions. As a result, analytical approximations have been proposed for applications requiring fast and accurate evaluation of elliptical geometries. In this study, we present a new ultra-accurate and compact closed-form approximation for the ellipse perimeter based on an exponential correction applied to Ramanujan’s second formula. The proposed expression preserves simplicity—using only three exponential functions and six constants—while achieving a maximum relative error of approximately 0.57 ppm observed over the tested grids covering the full eccentricity range. This represents a significant accuracy improvement over classical and modern approximations while maintaining a single-line analytical form with low computational cost. Due to its robustness, quasi-exact behavior at both circular and highly eccentric limits, and its suitability for numerical algorithms and embedded implementations, the proposed approximation is particularly useful in engineering computations involving elliptical boundaries. Full article

Compared to DVB-S2, DVB-S2X features a more intricate signaling structure. These signaling fields are employed not only in standard frames but are also frequently utilized within superframe structures. While rapid synchronization and decoding of these fields are critical, utilizing brute-force search methods incurs prohibitive computational costs. Therefore, this paper proposes a Joint Maximum Likelihood (JML) detection model tailored for the Fast Walsh–Hadamard Transform (FWHT). This approach allows for simultaneous synchronization and decoding while reducing number of real addition operations per codeword by approximately 15 times compared to brute-force methods. Consequently, the proposed architecture provides a highly efficient solution applicable to DVB-S2X and backward compatible with DVB-S2. Full article

Tennis is an exceptionally fast-paced sport where the ability to return the ball precisely to an opponent’s weak zones often determines match outcomes. Although wall practice serves as a fundamental and effective training method, accurately capturing and analyzing the spatial distribution of ball impact points during high-speed rallies remains highly challenging. Leveraging computer vision, we propose a two-stage detection pipeline that integrates You Only Look Once Version 12 and MobileNetV2 to generate candidate bounding boxes, stabilized by a Kalman filter with a predict–update mechanism. This approach ensures robust and reliable object tracking, providing valuable insights into tennis training performance, placement accuracy, and actionable insights for sports analytics. Full article

Distributed beamforming in UAV swarms requires fast and accurate carrier-phase alignment under sparse connectivity and propagation-induced phase bias. This paper proposes a physics-aware decentralized synchronization framework for quasi-static UAV swarm beamforming by integrating momentum-accelerated Metropolis–Hastings consensus with position-aided phase pre-compensation. To preserve phase evolution on the circular manifold, a sinusoidal coupling law is adopted, while the momentum term improves convergence in sparse random geometric graphs. A propagation model is further established to characterize how geometric separation and ranging uncertainty translate into residual phase error and coherent power loss. Under small-signal conditions, local stability is analyzed, and Monte Carlo simulations are conducted to evaluate convergence, synchronization accuracy, robustness, and beam-focusing performance. Results show that, at 2.4 GHz with low-centimeter ranging uncertainty, the proposed method achieves sub-wavelength synchronization accuracy while providing an effective balance among convergence speed, accuracy, and complexity. Compared with standard Metropolis–Hastings, fixed-weight, and other accelerated consensus methods, the proposed scheme converges faster over most sparse topologies. Although its steady-state accuracy is slightly lower than that of filter-based predictive methods such as KF-DFPC in some cases, those schemes incur higher implementation and computational overhead. Therefore, from the perspectives of decentralized realization and practical deployment, the proposed method is more suitable for lightweight phase synchronization in distributed UAV swarms. Full article

Sectional warping requires selecting a final operating length when only a small sample of residual cone masses can be measured. This paper proposes a Bayesian chance-constrained planning rule that combines a conjugate log-space model with fast posterior predictive simulation of the population minimum to recommend a risk-limited band length. The method provides a transparent risk parameter, efficient computation, and direct comparison with heuristic, bootstrap, distribution-free, and tail-model baselines. In an industrial-like synthetic study, the Bayesian policy reduced the mean remainder relative to a tuned sample-minimum rule while maintaining controlled shortage risk, and the results clarify why fully distribution-free guarantees are impractical under typical sampling budgets. Full article

Real-time motion planning in cluttered and dynamically evolving environments remains challenging due to the need to ensure rapid convergence, collision avoidance, computational efficiency, and robustness against local minima under frequent changes. Although sampling-based planners such as RRTX* and ABIT* provide strong theoretical guarantees, their practical deployment in dense dynamic scenarios is often limited by high sampling overhead and computational latency. This paper proposes a Fast Converging Adaptive Algorithm (FCAA), a deterministic sampling-based framework integrating adaptive sampling density, temperature-controlled exploration, and dynamic step-size regulation within a unified heating and annealing mechanism. The temperature parameter governs both the spatial sampling band and incremental expansion radius, enabling controlled transitions between goal-directed expansion and stochastic exploration when stagnation occurs. The algorithm is evaluated using a two-stage protocol comprising intrinsic validation and benchmarking. Across 36 environments with obstacle densities ranging from 3% to 20% and velocities between −30 and +30 m/s, FCAA achieved a 100% success rate within the defined experimental design while maintaining path quality comparable to or better than RRTX* and ABIT*. Unlike the reference planners, which typically required tens of thousands of samples and seconds of computation, FCAA operated with substantially reduced sampling effort, typically tens of nodes, and planning times from 0.1 to 320 ms depending on scenario complexity. Within the simulation framework, the results indicate that the proposed temperature-regulated strategy enables fast and computationally efficient motion planning under dynamic constraints, making FCAA suitable for time-critical robotic navigation scenarios. Full article

We develop a fast numerical method for solving nonlinear diffusion equations with memory phenomena, a class of problems arising within viscoelastic materials, anomalous transport, and hereditary systems. The primary computational problem is the nonlocal temporal dependence captured by Volterra-type memory operators, which makes direct evaluation scale quadratically with the number of time steps ($O\left(N_t^2\right)$), rendering prolonged simulations prohibitively expensive. To address this bottleneck, we develop a novel synthesis that combines a high-order spectral method for spatial discretization with a fast memory algorithm based on a sum-of-exponentials approximation. The spectral method obtains exponential spatial convergence for smooth solutions. At the same time, the fast memory algorithm reduces memory usage and computational complexity to $O\left(N_t\right)$, yielding computational speedups exceeding 414x for prolonged simulations. We rigorously prove that the proposed scheme preserves the discrete energy dissipation law of the continuous system under mild assumptions on the memory kernel, thereby ensuring unconditional stability. Error analysis verifies spectral accuracy in space and first-order temporal convergence. Extensive numerical experiments using exponentially decaying and weakly singular kernels validate the theoretical results and illustrate the method’s effectiveness for modeling viscoelastic transport phenomena and irregular diffusion in complex systems. Full article

Marine electric-source time domain electromagnetic (TDEM) surveys typically involve the simultaneous movement of transmitters and receivers, which generates a large number of transmitter–receiver pairs. This acquisition geometry creates notable challenges for 3D inversion, mainly because of the large data volume and high computational cost. However, the electromagnetic “sensitive region” for each transmitter–receiver pair is much smaller than the full survey area. Based on this feature, we propose an efficient 3D inversion approach using the footprint technique. By clearly defining the sensitivity region, referred to as the footprint domain, for each pair, the method builds the sensitivity matrix only within localized subsurface regions that significantly affect the observed response. This approach greatly reduces both forward modeling cost and memory requirements. The forward modeling adopts an integral equation method combined with cosine transforms for fast 3D field computation, while the inversion framework uses a regularized conjugate-gradient algorithm, further accelerated by parallel computing under footprint domain constraints. Numerical simulations also examine the effects of offset, time channel, seawater thickness, and resistivity on the footprint domain, helping clarify the spatiotemporal diffusion behavior of TDEM fields in shallow marine environments. Tests on representative models show that the proposed method remains stable and accurate under complex geological conditions while significantly improving computational efficiency. In particular, the footprint domain technique improves inversion speed by about 55% compared with full domain inversion. These results indicate that the proposed approach provides a reliable and scalable option for large-scale 3D inversion of marine TDEM data. Full article

Cross-view geo-localization tries to find the matching place in large satellite or aerial pictures from photos taken at ground level, which is useful for applications like self-driving cars, flying drones, and adding virtual objects to real city scenes. However, the traditional deep learning hybrid CNN-Transformer architecture and complex geometric submodules result in a large computational overhead, making it difficult to apply in real-time on resource-constrained devices. To make it light, fast, and accurate, this paper suggests an effective way to make a state-space model for cross-view geo-localization tasks. The model replaces the traditional self-attention structure with a state-space vision backbone, lowering the sequence modeling complexity from quadratic to linear and greatly accelerating the inference process; it devises a channel-group aggregation strategy without any learnable parameters, producing a comprehensive yet lightweight representation, and introduces a dynamic difficulty-aware loss function that assigns varying weights to all negative samples within a batch according to their similarities, greatly improving the efficiency of hard-negative sample mining and the quality of convergence. The results on the authoritative public datasets CVUSA and CVACT indicate that our method has high accuracy and low computational complexity, providing a feasible approach for the lightweight design of more powerful cross-view geolocation models in the future. Full article

Lightweight day-ahead photovoltaic (PV) forecasting models encounter a significant technical challenge: under resource-constrained deployment conditions, it is difficult to simultaneously address weather-regime heterogeneity, maintain model interpretability, and preserve adaptability as operating conditions evolve. To address this issue, we propose a multimodal short-term photovoltaic (PV) forecasting method that integrates weather-mode partitioning using the Clustering Using Representatives (CURE) algorithm with a self-updating Batch-Lasso model. First, the meteorological-PV dataset is partitioned along two dimensions by combining seasonal grouping with CURE clustering within each season, producing representative weather modes and enhancing the fidelity of weather pattern classification. Second, to extract informative predictors from high-dimensional meteorological inputs while maintaining interpretability, we formulate per-mode Lasso regression and adopt the Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) to efficiently solve for the sparse regression coefficients. Third, we introduce a batch-based self-update and correction mechanism with rollback verification, enabling the mode-specific models to be refreshed as new historical data become available while preventing performance degradation. Compared with representative machine learning baselines, the proposed method maintains competitive accuracy with substantially lower computational and storage overhead, enabling high-frequency and energy-efficient inference on resource-constrained terminals, thereby reducing operational burdens and computational energy costs and better meeting the deployment needs of sustainable energy systems under heterogeneous weather conditions. Full article