-
741
Multi-clustering algorithm based on improved tensor chain decomposition
Published 2025-06-01“…The tensor train (TT) method was studied and improved in depth, which had significantly improved its performance in multi-clustering tasks by introducing a new optimization strategy. The innovations were mainly reflected in two aspects: firstly, a new tensor decomposition framework was proposed, which effectively reduced the storage cost and improved the computational efficiency by optimizing the objective function; secondly, the improved tensor decomposition technique was applied to three main multi-clustering algorithms, including self-weighted multi-view clustering (SwMC), latent multi-view subspace clustering (LMSC), and multi-view subspace clustering with intactness-aware similarity (MSC IAS), which significantly improved the accuracy and efficiency of clustering. …”
Get full text
Article -
742
A Fast Map Merging Algorithm in the Field of Multirobot SLAM
Published 2013-01-01“…The simulated data is used as information sources in the other map to do partial map Monte Carlo localization; if localization succeeds, the relative pose hypotheses between the two maps can be computed easily. We verify these hypotheses using the rendezvous technique and use them as initial values to optimize the estimation by a heuristic random search algorithm.…”
Get full text
Article -
743
Variational autoencoder-based multipath clustering algorithm for terahertz channels
Published 2025-06-01“…To address the shortcomings of multipath clustering algorithms in terahertz channel modeling, particularly in terms of multidimensional parameter adaptability and unsupervised feature separation, a variational autoencoder-based latent space multipath clustering (VAE-LMC) model was proposed. …”
Get full text
Article -
744
Design and implementation of codec based on BCH error correction algorithm
Published 2022-05-01Get full text
Article -
745
Trajectory Similarity Algorithm Based on DTW and Trajectory Point Compression
Published 2024-12-01“…Understanding the behavior characteristics of these holders through processing massive trajectory data has become an important issue to be addressed using trajectory similarity algorithms. To optimize the computational efficiency of the algorithm while maintaining its accuracy, this paper presents an algorithm based on an improved dynamic time warping (DTW) algorithm, i.e. the compression DTW (CN-DTW) algorithm to overcome the deficiencies of long running time and ill-conditioned alignment in the DTW algorithm. …”
Get full text
Article -
746
YOLO-Dynamic: A Detection Algorithm for Spaceborne Dynamic Objects
Published 2024-11-01“…Meanwhile, LASF_Neck employs a lightweight multi-scale architecture for optimized feature fusion and faster detection. The YOLO-Dynamic algorithm’s performance was validated on real-world images captured at Antarctic observatory sites. …”
Get full text
Article -
747
Lightweight insulator target detection algorithm based on improved YOLOX
Published 2025-06-01“…Finally, the σWIoU loss function replaces the traditional IoU to accelerate convergence and optimize overall performance. Experiments show that compared to the original YOLOX, the proposed algorithm reduces parameters by 53.41% to 4.164 M and computational load to 12.975G, with mAP increased by 1.3%, detection accuracy reaching 98.81%, and recall achieving 100%. …”
Get full text
Article -
748
Speech emotion recognition based on a stacked autoencoders optimized by PSO based grass fibrous root optimization
Published 2025-07-01“…Specifically, a stacked autoencoder (SAE) serves as the primary model, and its performance is fine-tuned using a nature-inspired hybrid algorithm that combines particle swarm optimization (PSO) with Grass Fibrous Root Optimization (GFRO). …”
Get full text
Article -
749
Rehabilitation Technologies by Integrating Exoskeletons, Aquatic Therapy, and Quantum Computing for Enhanced Patient Outcomes
Published 2024-12-01“…This study also explored quantum computing techniques, such as the quantum approximate optimization algorithm (QAOA) and the quantum Fourier transform (QFT), to optimize controller tuning and improve real-time control, highlighting the potential of these advanced tools in refining rehabilitation devices.…”
Get full text
Article -
750
Biomimetic model for computing missing data imputation and inconsistency reduction in pairwise comparisons matrices.
Published 2025-01-01“…The proposed regeneration method emulates three primary phases of a biological process: identifying the most damaged areas (by identifying inconsistencies in the pairwise comparison matrix), cell proliferation (filling in missing data), and stabilization (optimization of global consistency). An iterative algorithm is employed to correct inconsistencies and compute missing data imputations within the pairwise comparison matrix. …”
Get full text
Article -
751
Enhancing remote patient monitoring with AI-driven IoMT and cloud computing technologies
Published 2025-07-01“…The proposed TL-SAM framework effectively extracts spatial and spectral features from patient health data, optimizing classification accuracy. Furthermore, the model employs an Improved Wild Horse Optimization with Levy Flight Algorithm (IWHOLFA) for hyperparameter tuning, enhancing its predictive performance. …”
Get full text
Article -
752
Adaptive Model Predictive Control for 4WD-4WS Mobile Robot: A Multivariate Gaussian Mixture Model-Ant Colony Optimization for Robust Trajectory Tracking and Obstacle Avoidance
Published 2025-06-01“…However, the MPC’s performance depends on the optimal tuning of its key parameters, a challenge addressed using the Multivariate Gaussian Mixture Model Continuous Ant Colony Optimization (MGMM-<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>ACO</mi><mi>R</mi></msub></semantics></math></inline-formula>) algorithm. …”
Get full text
Article -
753
From molecules to data: the emerging impact of chemoinformatics in chemistry
Published 2025-08-01“…Emerging technologies, including quantum computing, hold promise for further revolutionizing the field by offering new capabilities for simulating and optimizing chemical processes. …”
Get full text
Article -
754
Hybrid Filter-Wrapper Feature Selection using Modified Flower Pollination Algorithm
Published 2025-05-01Get full text
Article -
755
An approach based on genetic algorithms and neural networks for QoS-aware IoT services composition
Published 2022-09-01Get full text
Article -
756
Heterogeneous Differential Evolution for Numerical Optimization
Published 2014-01-01Get full text
Article -
757
Analysis of software methods for metal computed tomography artifact reduction: experimental research
Published 2024-12-01Get full text
Article -
758
Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search
Published 2025-01-01“…By restricting the search to this focused region and expanding only when necessary, ILS significantly reduces computational overhead while preserving optimality in cases where the underlying algorithm guarantees it, and delivering near-optimal paths in others. …”
Get full text
Article -
759
A Golden Jackal based optimal operation and optimization of a virtual power plant involving renewable resources
Published 2025-07-01“…Furthermore, the scheduling of the VPP system is carried out on a day-ahead basis and the outcome in terms of cost and emission is compared with the available work in the literature and the result reveals the effectiveness of the system in terms of quality solutions sets for the objectives, minimum computational time and better convergence behavior. In particular, there is a reduction in cost by 2.1% and 0.62% when compared with the salp swarm algorithm and beluga whale algorithm followed by 2.12% and 1.18% in emission. …”
Get full text
Article -
760
Development and investigation of parallel model of bee colony algorithms for cryptanalysis problem solving
Published 2017-03-01“…Theoretical estimates of time complexity of the bee colony algorithm are given as the key data. Besides, the problem solution is provided: to find the required smallest number of processors of the homogeneous parallel computing systems with distributed memory, and a uniform plan for the implementation of operators for them, for the cryptanalysis algorithm based on the constructed information-logical graph data-logical graph, and for the preset time. …”
Get full text
Article