Showing 801 - 820 results of 2,509 for search '(shift OR soft) algorithm', query time: 0.13s Refine Results
  1. 801

    A novel anthropometric method to accurately evaluate tissue deformation by Chongyang Ye, Xiaolu Li, Haiyan Song, Yu Shi, Ruixin Liang, Jun Zhang, Ka Po Lee, Zhaolong Chen, Beibei Zhou, Raymond Kai-Yu Tong, Kit-Lun Yick, Sun-Pui Ng, Joanne Yip

    Published 2025-07-01
    “…IntroductionBiomechanical imaging through body scanning can provide a more comprehensive understanding of the soft tissue deformation exerted by compression sportswear, which is crucial in sports science research and functional sportswear design. …”
    Get full text
    Article
  2. 802
  3. 803

    Two Symbol Expansion Methods and Their Application to Reversible Data Hiding by Hyoung Joong Kim, Changhee Kang, Sang-Ug Kang

    Published 2025-01-01
    “…Second, a symbol domain created by concatenating two adjacent pixels was used. Both algorithms exploit the similarity between the neighboring pixels in an image, and the experimental results demonstrate an average PSNR of <inline-formula> <tex-math notation="LaTeX">$64.1dB$ </tex-math></inline-formula>, which is 11.6% higher compared to the original histogram shifting method. …”
    Get full text
    Article
  4. 804

    Artificial intelligence algorithms for the diagnosis of signs of diabetic retinopathy, diabetic macular edema, age-related macular degeneration, vitreomacular interface abnormaliti... by E.A. Katalevskaya, A.Yu. Sizov, M.I. Tyurikov, Yu.V. Vladimirova

    Published 2022-12-01
    “…For fundus images analysis algorithms accuracy, sensitivity, specificity, AUROC were calculated for the following structures: microaneurysms, intraretinal hemorrhages, hard exudates, soft exudates, retinal and optic disc neovascularization, preretinal hemorrhages, epiretinal fibrosis, laser coagulates. …”
    Get full text
    Article
  5. 805

    Discrete Multi-Objective Grey Wolf Algorithm Applied to Dynamic Distributed Flexible Job Shop Scheduling Problem with Variable Processing Times by Jiapeng Chen, Chun Wang, Binzi Xu, Sheng Liu

    Published 2025-02-01
    “…Based on the parameter sensitivity study and a comparison with four algorithms, the algorithm’s stability and effectiveness in both static and dynamic environments are demonstrated. …”
    Get full text
    Article
  6. 806
  7. 807
  8. 808
  9. 809

    Comparative Evaluation of Reinforcement Learning Algorithms for Multi-Agent Unmanned Aerial Vehicle Path Planning in 2D and 3D Environments by Mirza Aqib Ali, Adnan Maqsood, Usama Athar, Hasan Raza Khanzada

    Published 2025-06-01
    “…In the second phase, we transition this comparison to a physics-based 3D simulation, incorporating realistic UAV (fixed wing) dynamics and checkpoint-based navigation. We compared five algorithms, namely, Proximal Policy Optimization (PPO), Soft Actor–Critic (SAC), Deep Deterministic Policy Gradient (DDPG), Trust Region Policy Optimization (TRPO), and Multi–Agent DDPG (MADDPG), in various scenarios. …”
    Get full text
    Article
  10. 810

    Blind recognition of primitive BCH code based on average cosine conformity by Zhaojun WU, Limin ZHANG, Zhaogen ZHONG, Yufeng LONG

    Published 2020-01-01
    “…In order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code length and m-level primitive polynomial fields,the code length was identified by matching the initial code roots.Secondly,on the premise of recognizing the code length,the GF(2<sup>m</sup>) domain was traversed under the m-level primitive polynomial and the primitive polynomial with the strongest error-correcting ability was the generator polynomial for the domain.Finally,the minimum common multiple corresponding to the minimum polynomial of code roots was obtained,and the BCH code generator polynomial was recognized.In checking matching,the statistic of average cosine conformity was introduced.The optimal threshold was solved based on the minimum error decision criterion and distribution of the statistic to realize the fast identification of the BCH.The simulation results show that the deduced statistical characteristics are consistent with the actual situation,and the proposed algorithm can achieve reliable recognition under SNR of 5 dB and code length of 511.Comparing with existing algorithms,the performance of the proposed algorithm is better than that of the existing soft-decision algorithm and 1~3.5 dB better than that of the hard-decision algorithms.…”
    Get full text
    Article
  11. 811

    Blind recognition of primitive BCH code based on average cosine conformity by Zhaojun WU, Limin ZHANG, Zhaogen ZHONG, Yufeng LONG

    Published 2020-01-01
    “…In order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code length and m-level primitive polynomial fields,the code length was identified by matching the initial code roots.Secondly,on the premise of recognizing the code length,the GF(2<sup>m</sup>) domain was traversed under the m-level primitive polynomial and the primitive polynomial with the strongest error-correcting ability was the generator polynomial for the domain.Finally,the minimum common multiple corresponding to the minimum polynomial of code roots was obtained,and the BCH code generator polynomial was recognized.In checking matching,the statistic of average cosine conformity was introduced.The optimal threshold was solved based on the minimum error decision criterion and distribution of the statistic to realize the fast identification of the BCH.The simulation results show that the deduced statistical characteristics are consistent with the actual situation,and the proposed algorithm can achieve reliable recognition under SNR of 5 dB and code length of 511.Comparing with existing algorithms,the performance of the proposed algorithm is better than that of the existing soft-decision algorithm and 1~3.5 dB better than that of the hard-decision algorithms.…”
    Get full text
    Article
  12. 812
  13. 813

    European sovereign debt control through reinforcement learning by Tato Khundadze, Willi Semmler, Willi Semmler, Willi Semmler

    Published 2025-06-01
    “…We demonstrate that the Soft Actor-Critic algorithm provides comparable or, in some cases, better solutions to multi-objective macroeconomic optimization problems, in comparison to Nonlinear Model Predictive Control (NMPC) algorithm.…”
    Get full text
    Article
  14. 814
  15. 815

    TANS: A Tolerance-Aware Neighborhood Search Method for Workflow Scheduling with Uncertainties in Cloud Manufacturing by Haiyan Xu, Fanhao Ma, Long Chen

    Published 2025-05-01
    “…In this paper, we consider the workflow scheduling problem with soft deadlines and fuzzy time uncertainties in cloud manufacturing environments. …”
    Get full text
    Article
  16. 816
  17. 817

    Semiparametric Transformation Models with a Change Point for Interval-Censored Failure Time Data by Junyao Ren, Shishun Zhao, Dianliang Deng, Tianshu You, Hui Huang

    Published 2025-08-01
    “…Model parameters are estimated via the EM algorithm, with the change point identified through a profile likelihood approach using grid search. …”
    Get full text
    Article
  18. 818

    Improved model MASW YOLO for small target detection in UAV images based on YOLOv8 by Xianghe Meng, Fei Yuan, Dexiang Zhang

    Published 2025-07-01
    “…Abstract The present paper proposes an algorithmic model, MASW-YOLO, that improves YOLOv8n. …”
    Get full text
    Article
  19. 819

    FedDyH: A Multi-Policy with GA Optimization Framework for Dynamic Heterogeneous Federated Learning by Xuhua Zhao, Yongming Zheng, Jiaxiang Wan, Yehong Li, Donglin Zhu, Zhenyu Xu, Huijuan Lu

    Published 2025-03-01
    “…Prior to this work, few studies have explored the use of optimization algorithms for hyperparameter tuning in federated learning. …”
    Get full text
    Article
  20. 820