Showing 5,121 - 5,140 results of 25,328 for search 'research algorithm', query time: 0.19s Refine Results
  1. 5121
  2. 5122
  3. 5123
  4. 5124
  5. 5125
  6. 5126
  7. 5127

    MECHATRONIC SYSTEM OF GRAIN COMBINE ADAPTIVE DRIVING CONTROL by Dmitry Yakovlevich Parshin, Denis Gennadyevich Shevchuk

    Published 2012-12-01
    “…The basic external actions on the grain combine mechatronic control system, and their effect on the motion pattern and the production process are considered. The research objective is the problem solution on the adaptive control of the motion path and tool load ratio of the grain combine based on fuzzy logic inference. …”
    Get full text
    Article
  8. 5128
  9. 5129

    A New Automatic Hydrological Station Relocation Algorithm (ASRA) for Moving Hydrological Stations Onto a Simulated Digital River Network by Kun Wang, Denghua Yan, Zuhao Zhou, Baisha Weng, Tianling Qin, Wuxia Bi, Siyu Liu

    Published 2024-05-01
    “…To solve this problem, we categorized and scrutinized deviations between the simulated and their actual station locations, and proposed a novel automatic hydrological station relocation algorithm (ASRA). The algorithm was first validated in the Amazon Basin using Global Runoff Data Centre (GRDC) hydrological stations and 90 m × 90 m Shuttle Radar Topography Mission (SRTM) data, successfully correcting the spatial position and corresponding catchment area (CCA) of each station. …”
    Get full text
    Article
  10. 5130
  11. 5131
  12. 5132
  13. 5133

    RETRACTED: Intelligent power grid energy supply forecasting and economic operation management using the snake optimizer algorithm with Bigur-attention model by Lingling Cui, Jiacheng Liao

    Published 2023-09-01
    “…The contribution of this research lies in proposing the Snake Optimizer (SO) algorithm-optimized Bigru-Attention model and constructing an efficient comprehensive prediction model. …”
    Get full text
    Article
  14. 5134

    Research on network attack analysis method based on attack graph of absorbing Markov chain by Haiyan KANG, Molan LONG

    Published 2023-02-01
    “…Existing intrusion path studies based on attack graph lack consideration of factors other than basic network environment information when calculating the state transition probability.In order to analyze the security of target network comprehensively and reasonably, a network attack analysis method based on attack graph of absorbing Markov chain was proposed.Firstly, a state transition probability normalization algorithm based on vulnerability life cycle was proposed based on attack graph.Secondly, the attack graph was mapped to the absorbing Markov chain and the state transition probability matrix was given.Finally, the state transition probability matrix was calculated to comprehensively analyze the node threat degree, attack path length and expected impact of the target network.The results show that the proposed method can effectively analyze the expected influence of node threat degree, attack path length and vulnerability life cycle on the whole network, which is helpful for security research personnel to better understand the security state of the network.…”
    Get full text
    Article
  15. 5135
  16. 5136
  17. 5137
  18. 5138

    Research on collision detection of robot outer surface based on six-dimensional force sensor by WANG Zhijun, WANG Yunyi, LI Zhanxian

    Published 2025-08-01
    “…The findings of this study provide a basis for the research on safety-related issues in the human-robot collaboration.…”
    Get full text
    Article
  19. 5139

    Research on Shortest Path Planning and Smoothing Without Obstacle Collision Based on Moving Carrier by Lingsong Di, Defeng Sun, Yahui Qi, Zhicai Xiao

    Published 2024-01-01
    “…In response to the challenges of path planning in complex scenarios, to overcome the influence of optimal path determination by the precision of grid map sizes, and to escape the uncertainty in solving by intelligent algorithms, this paper designs a method for obtaining an adjacency matrix based on node planning of shortest path diagrams with polygonal obstacles and then uses the Dijkstra algorithm to get the shortest path. …”
    Get full text
    Article
  20. 5140