Showing 2,121 - 2,140 results of 19,511 for search '"algorithm"', query time: 0.12s Refine Results
  1. 2121

    Service function chain deployment algorithm based on optimal weighted graph matching by Dan LI, Julong LAN, Peng WANG, Yuxiang HU

    Published 2019-03-01
    “…Service function chain can support flexible network service requirement by linking virtual network functions.Aiming at the problem of service function chain deployment in a resource-constrained network,an algorithm for service function chain deployment based on optimal weighted graph matching was proposed.The service function chains was composed into graphs of functional topography,and the optimal matching results between graphs of functional topology and physical topology was obtained using eigendecomposition approach,and furtherly the matching results by hill-climbing method was optimized.Simulation results show that,the proposed algorithm can reduce the required bandwidth to deploy service function chains,balance the load of nodes and bandwidth of links,and support more service requests.What is more,the algorithm has a lower computation complexity and higher time efficience.…”
    Get full text
    Article
  2. 2122

    Dynamic Beam Hopping Algorithm for LEO Satellite Systems Based on User Grouping by Qing SHU, Weibiao LI, Zuolin JIN, Zhong ZHENG, Yongbo ZHANG, Zesong FEI

    Published 2023-12-01
    “…., the number of concurrently serving users is increased.To address the above problems, it proposed a dynamic beam hopping (BH) scheme based on user grouping for communication service coverage.The proposed method utilized the sparsity of the angular domain channel distribution to adaptively divide user groups accorded to the beam direction where the user energy is maximum.The number of co-channel user groups was constrained by power and interference constraints, limiting the reduction of communication traffic delay, as power limitations on the satellite make the number of RF chains limited and increased the number of simultaneously served user groups increased the interference between user groups.So the BH scheme with beam cluster grouping was further proposed, when the beam clusters reduced the user delay by increased the number of users served at the same moment.Since the above problem was non-convex, it adopt a data-driven determinantal point process (DPP) learning method to simplify the beam scheduling in BH scheme.Simulation results showed that the dynamic BH algorithm based on user grouping could effectively reduce the average user delay by more than 52% compared with the single-beam scheme, also verifies the versatility of the DPP learning.…”
    Get full text
    Article
  3. 2123

    An Improved Marriage in Honey Bees Optimization Algorithm for Single Objective Unconstrained Optimization by Yuksel Celik, Erkan Ulker

    Published 2013-01-01
    “…The IMBO algorithm’s performance and its success are tested on the well-known six unconstrained test functions and compared with other metaheuristic optimization algorithms.…”
    Get full text
    Article
  4. 2124

    An Algorithm That Predicts CSI to Allocate Bandwidth for Healthcare Monitoring in Hospital's Waiting Rooms by Di Lin, Fabrice Labeau

    Published 2012-01-01
    “…We analyze the reliability of the proposed algorithm by deducing the standard error of estimated CSI with this algorithm. …”
    Get full text
    Article
  5. 2125
  6. 2126
  7. 2127

    Resource allocation optimization algorithm based on double populations differential evolution in WSN by Xiaochen HAO, Liyuan WANG, Jinshuo LIU, Lixia XIE, Wenhuan ZHANG

    Published 2018-04-01
    “…A resource allocation algorithm was proposed for improving the network performance through jointing channel allocation,power control and timeslot allocation in multi-radio multi-channel wireless sensor network.More specifically,the network was modeled as a multi-objective optimization problem where the energy efficient,resource allocation balanced,networks capacity maximized were considered under the link interference and link conflict constraints.Due to the problem was NP-Hardness,a simple centralized algorithm——differential evolution based on double populations was used to solve the constrained multi-objective optimization problem.The simulation results show that the proposed algorithm significantly improves the network capacity and energy efficiency and guarantees the resource allocation balancing while reducing link interference and avoiding link conflict.…”
    Get full text
    Article
  8. 2128

    Pilot scheduling algorithm based on cell classification-cross entropy for massive MIMO by Yinhui YU, Heng ZHOU, Ying YANG, Hao PAN, Jiapeng REN

    Published 2018-12-01
    “…Pilot scheduling problem belongs to the arrangement optimization problem, and the algorithm computational complexity of greedy algorithm to search the optimal solution is greatly. …”
    Get full text
    Article
  9. 2129

    Fast mode selection of intra prediction algorithm based on spatial and frequency analysis by Shu-bo ZHAN, Jian-bin SONG, Li MA, Fang-chun YANG

    Published 2012-07-01
    “…By using of the features of DCT coefficients in frequency domain and the correlation of the predictive mode in spatial domain,the proposed algorithm evaluated the complexity of encoding block and selected encoding block size firstly,computed the texture direction and pre-selected most possibly prediction mode of 16×16 block secondly,and then got the neighbor block’s optimum mode and narrowed mode selection range of 4×4 block.The experiments show that,compared with existing algorithms,in the case of almost equal quality,the speed of the algorithm is significantly improved.…”
    Get full text
    Article
  10. 2130
  11. 2131

    Research on Energy Efficiency Management of Forklift Based on Improved YOLOv5 Algorithm by Zhenyu Li, Ke Lu, Yanhui Zhang, Zongwei Li, Jia-Bao Liu

    Published 2021-01-01
    “…In the data preprocessing section, through operations such as framing and clustering the collected video data and using the improved image hash algorithm to remove similar images, a new dataset of forklift goods was built. …”
    Get full text
    Article
  12. 2132
  13. 2133

    Attention Feature Network Extraction Combined with the Generation Algorithm of Multimedia Image Description by Beibei Sun

    Published 2021-01-01
    “…After the testing of the database, the results indicate that the calculation method of the algorithm put forward in this paper is more accurate than the top-down multimedia image algorithm generated by a single attention.…”
    Get full text
    Article
  14. 2134

    Joint beam hopping and coverage control optimization algorithm for multibeam satellite system by Guoliang XU, Feng TAN, Yongyi RAN, Feng CHEN

    Published 2023-04-01
    “…To improve the performance of multibeam satellite (MBS) systems, a deep reinforcement learning-based algorithm to jointly optimize the beam hopping and coverage control (BHCC) algorithm for MBS was proposed.Firstly, the resource allocation problem in MBS was transformed to a multi-objective optimization problem with the objective maximizing the system throughput and minimizing the packet loss rate of the MBS.Secondly, the MBS environment was characterized as a multi-dimensional matrix, and the objective problem was modelled as a Markov decision process considering stochastic communication requirements.Finally, the objective problem was solved by combining the powerful feature extraction and learning capabilities of deep reinforcement learning.In addition, a single-intelligence polling multiplexing mechanism was proposed to reduce the search space and convergence difficulty and accelerate the training of BHCC.Compared with the genetic algorithm, the simulation results show that BHCC improves the throughput of MBS and reduces the packet loss rate of the system, greedy algorithm, and random algorithm.Besides, BHCC performs better in different communication scenarios compared with a deep reinforcement learning algorithm, which do not consider the adaptive beam coverage.…”
    Get full text
    Article
  15. 2135

    Analysis of Internet Financial Risk Control Model Based on Machine Learning Algorithms by Mingjin Liu, Ruijie Gao, Wei Fu

    Published 2021-01-01
    “…The accuracy of classification and early warning results of the random forest algorithm is relatively high, and the detection rate of the decision tree model is relatively high, but the cost is also the highest. …”
    Get full text
    Article
  16. 2136

    Feature extraction algorithm based on quaternion common spatial pattern for banknote recognition by Shan GAI

    Published 2018-12-01
    “…New feature extraction algorithm was proposed based on quaternion common spatial pattern in order to solve the lack of effective description of phase information in the banknote feature extraction and analysis. …”
    Get full text
    Article
  17. 2137

    Combination of Artificial Neural Network and Particle Swarm Intelligence Algorithm for Diagnosing Diabetes by Cillian Thompson, Oscar Higgins

    Published 2024-03-01
    “…In this study, in order to discover hidden patterns and diagnose diabetes, a particle swarm intelligence algorithm has been used along with a neural network to increase the accuracy of diabetes diagnosis. …”
    Get full text
    Article
  18. 2138

    An adaptive unscented Kalman filter algorithm for electronic archives information data denoising by Ting ZHOU

    Published 2023-08-01
    “…The adaptive unscented Kalman filter noise reduction algorithm for electronic archives information data was studied to address the issue of data loss during the noise reduction process, as well as the noise covariance and initial value deviation of the data after gross errors.The architecture of electronic archives informatization consisted of the data, business, and user layers.In the data layer, the electronic archives informatization data underwent pretreatment, decision-making, monitoring, and analysis based on user data requests from the user layer.Assumptions were made on the electronic archives informatization data using the Laida criterion to determine the standard deviation probability and establish intervals.Gross errors were eliminated and the noise covariance of the data after gross error removal was estimated using the Sage-Husa filter.This helped to suppress the deviation of the initial value and preserve the original data as much as possible.The traceless Kalman algorithm was utilized to estimate the unknown noise characteristics of electronic archives informatization data in real-time, enabling the noise reduction of electronic archives informatization data.The virtual induction service connected the data, users, and business layer, facilitating the presentation of the required electronic archives information to users in the business layer.Experimental results demonstrate that the algorithm effectively removes various noises from electronic archives information data while retaining the valid data.…”
    Get full text
    Article
  19. 2139

    Research on Multistage Rotor Assembly Optimization Methods for Aeroengine Based on the Genetic Algorithm by Yue Chen, Jiwen Cui, Xun Sun, Shihai Cui

    Published 2021-01-01
    “…In this study, an assembly optimization method for the multistage rotor of an aeroengine is proposed based on the genetic algorithm. Firstly, a spatial location propagation model is developed to accurately predict the spatial position of each rotor after assembly. …”
    Get full text
    Article
  20. 2140

    Lightweight Small Target Detection Algorithm Based on YOLOv8 Network Improvement by Xiaoyi Hao, Ting Li

    Published 2025-01-01
    “…The primary objective of this paper is to address the shortcomings of existing algorithms in the context of UAV-based object detection. …”
    Get full text
    Article