-
1101
Research on Sparse Code Multiple Access Detection Technology in Satellite Communication Systems
Published 2020-09-01“…SCMA detection algorithms in the satellite communication system was studied,and optimal allocation of codebook and the incomplete iterative MPA detection algorithm were combined to improve system performance while reducing system complexity.The convergence of the SCMA detection algorithm was studied,and an improved serial-parallel MPA algorithm was proposed.This algorithm could accelerate the system convergence speed while reducing the processing delay,and the system complexity was also reduced.…”
Get full text
Article -
1102
Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search
Published 2025-01-01“…Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions, while others like Depth-First Search (DFS) and Greedy Best-First Search prioritize speed over optimality. …”
Get full text
Article -
1103
Energy-Aware Service Composition Algorithms for Service-Oriented Heterogeneous Wireless Sensor Networks
Published 2014-03-01“…With both the energy-aware metrics: energy-aware load-balancing factor and overall energy consumption, we formulate the process of energy-aware sensor service composition into a combinatorial optimization problem; furthermore, an improved discrete particle swarm optimization (IDPSO) algorithm with inertia weights adjustment and extreme perturbation scheme is proposed to solve the combinatorial optimization problem. …”
Get full text
Article -
1104
Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios
Published 2024-02-01“…A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.…”
Get full text
Article -
1105
Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios
Published 2024-02-01“…A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.…”
Get full text
Article -
1106
Hybrid AE and Bi-LSTM-Aided Sparse Multipath Channel Estimation in OFDM Systems
Published 2024-01-01“…Further, an efficient Grasshopper Electric Fish Optimization Algorithm (G-EFOA) is developed to optimize the parameters of AE and Bi-LSTM, resulting in superior solutions. …”
Get full text
Article -
1107
Codesign of Transmit Waveform and Receive Filter with Similarity Constraints for FDA-MIMO Radar
Published 2025-05-01“…The problem is projected into it and transformed into an unconstrained optimization problem. Finally, the Riemannian limited-memory Broyden–Fletcher–Goldfarb–Shanno (RL-BFGS) algorithm is employed to optimize the variables in parallel. …”
Get full text
Article -
1108
Nonlinear waveform optimization for wireless power transfer systems
Published 2025-06-01“…We develop single-user and multi-user algorithms that maximize the output DC voltage of the weighted and/or minimum moment antennas by optimizing waveform design. …”
Get full text
Article -
1109
Cable Force Optimization of Circular Ring Pylon Cable-Stayed Bridges Based on Response Surface Methodology and Multi-Objective Particle Swarm Optimization
Published 2025-07-01“…By synergizing explicit modeling with intelligent algorithms, this methodology effectively resolves the longstanding efficiency–accuracy trade-off in cable force optimization for cable-stayed bridges. …”
Get full text
Article -
1110
Hybrid Estimation of Distribution Algorithm for Solving Three-Stage Multiobjective Integrated Scheduling Problem
Published 2021-01-01“…A variable neighborhood hybrid operation based on the speed scheduling set is designed in Local Search II to further improve the quality of the solution while balancing the optimization goals. …”
Get full text
Article -
1111
Multi-Strategy Fusion Path Planning Algorithm for Autonomous Surface Vessels with Dynamic Obstacles
Published 2025-07-01“…Through a comprehensive analysis of its control output, the proposed integrated algorithm accomplishes efficient obstacle avoidance via agile control of angular velocity while preserving navigational stability and achieves path optimization through consistent acceleration adjustments, thereby asserting its superiority and practical worth in challenging maritime environments.…”
Get full text
Article -
1112
Green logistics optimization for coal supply in a power plant connecting maritime port
Published 2024-12-01“…This paper introduces an integrated optimization model grounded in green logistics and employs an Improved Particle Swarm Optimization (IPSO) algorithm to efficiently manage the coal supply chain from unloading at ports to loading into generators. …”
Get full text
Article -
1113
Risk of AI Algorithmic Discrimination Embedded in Government Data Governance and Its Prevention and Control
Published 2024-05-01“…To address this issue, this study proposed a series of targeted prevention and control measures, including clarifying the principle of algorithmic fairness, formulating industry norms and standards, improving the accountability mechanism and regulatory system, and optimizing the data collection and processing environment, so as to effectively curb the phenomenon of algorithmic discrimination while making full use of the advantages of AI technology, so that AI technology in government data governance can truly benefit the people, and promote social fairness and justice.…”
Get full text
Article -
1114
Cellular-free RAN slicing resource allocation algorithm based on multi-timescale collaboration
Published 2025-07-01“…Simulation results demonstrate that the proposed algorithm can accurately predict slice resource, improve the system transmission rates while reducing the average user latency and service blocking probability.…”
Get full text
Article -
1115
Comparative Study of Algorithms for the Conversion From Surface Mesh Models to Volume Mesh Models
Published 2024-01-01“…In addition, the randomness of the HXT algorithm in mesh generation led to variations in results, which requires further optimization to improve the consistency and robustness of the algorithm. …”
Get full text
Article -
1116
Comparing Geodesic Filtering to State-of-the-Art Algorithms: A Comprehensive Study and CUDA Implementation
Published 2025-05-01“…Additionally, we present a highly optimized GPU implementation featuring innovative wave-propagation algorithms and memory access optimization techniques that achieve a 200× speedup, making geodesic filtering practical for real-time applications. …”
Get full text
Article -
1117
A Learning-Enhanced Metaheuristic Algorithm for Multi-Zone Orienteering Problem with Time Windows
Published 2025-07-01“…To address these challenges, this paper proposes a learning-enhanced metaheuristic algorithm called the Hybrid Ant Colony Optimization (HACO) algorithm, which incorporates Pointer Network learning. …”
Get full text
Article -
1118
The data analysis of sports training by ID3 decision tree algorithm and deep learning
Published 2025-04-01“…Abstract In order to improve the accuracy and efficiency of sports training data analysis, this paper proposes an optimized analysis model by combining Iterative Dichotomiser 3 (ID3) decision tree algorithm and deep learning model. …”
Get full text
Article -
1119
Metrics and Algorithms for Identifying and Mitigating Bias in AI Design: A Counterfactual Fairness Approach
Published 2025-01-01Get full text
Article -
1120
A clustering algorithm based on grids for core data and adjacency relationships for edge data
Published 2025-05-01“…To address these issues, existing research primarily focuses on three directions: (1) optimizing the adaptive selection of grid parameters, which struggles to handle variations in cluster density; (2) improving grid division methods (e.g., multi-granularity or dynamic grids), which have limited effectiveness on complex-shaped data; and (3) integrating other clustering techniques, which enhances accuracy but increases algorithmic complexity. …”
Get full text
Article