Showing 1,641 - 1,660 results of 19,511 for search '"algorithm"', query time: 0.12s Refine Results
  1. 1641

    Optimization of Video Heart Rate Detection Based on Improved SSA Algorithm by Chengcheng Duan, Xiangyang Liang, Fei Dai

    Published 2025-01-01
    “…Secondly, the singular spectrum analysis algorithm (SSA) is enhanced to further improve the accuracy of heart rate detection. …”
    Get full text
    Article
  2. 1642

    Packet-based routing algorithm in DTN based on the intimacy between nodes by En WANG, Yong-jian YANG, Wei-dan ZHAO, Lin-lu LIU

    Published 2014-12-01
    “…Through analyzing the moving law of nodes,the topology is defined based on intimacy between nodes by using the thoughts of reducing redundant copies through clustering in MANET and mining social community in social network for reference.Take topological trim according to the weight of edges and dig out groups of nodes which have higher inti-macy degree.And also improve the spray and wait routing protocol according to the group of source and destination nodes.Then put forward a packet-based routing algorithm in DTN based on the intimacy between nodes.Simulation result shows that this routing algorithm could effectively increase the delivery ratio and reduce delay.…”
    Get full text
    Article
  3. 1643

    Fault Detection of Aircraft System with Random Forest Algorithm and Similarity Measure by Sanghyuk Lee, Wookje Park, Sikhang Jung

    Published 2014-01-01
    “…Research on fault detection algorithm was developed with the similarity measure and random forest algorithm. …”
    Get full text
    Article
  4. 1644
  5. 1645

    THE ALGORITHM OF DETERMINATION OF EYE FUNDUS VESSELS BLOOD FLOW CHARACTERISTICS ON VIDEOSEQUENCE by O. V. Nedzvedz, S. V. Ablameyko, A. M. Nedzved, A. V. Glinsky, G. M. Karapetyan, A. A. Anisimov, I. B. Gurevich, V. V. Yashina

    Published 2018-03-01
    “…Such characteristics allow to determine blood flow changes in the microvasculature affecting the blood flow in the brain, kidneys and coronary vessels. Developed algorithm includes four stages: the video sequence stabilization, the vessels segmentation with the help of a neural network, the determination of the instantaneous velocity in the vessels based on the optical flow and the analysis of the results.…”
    Get full text
    Article
  6. 1646

    Identification of Flight Area Identification Plate Based on an Improved MSER Algorithm by Hao Liu, Daiwu Zhu, Yuran Zhu, Xiaofan Xie, Haodi Zhao

    Published 2022-01-01
    “…Secondly, the threshold of repeated recognition content was eliminated using the NMS algorithm to handle the repeated recognition caused by the MSER algorithm. …”
    Get full text
    Article
  7. 1647

    A Local Stability Supported Parallel Distributed Constraint Optimization Algorithm by Duan Peibo, Zhang Changsheng, Zhang Bin

    Published 2014-01-01
    “…This paper presents a new distributed constraint optimization algorithm called LSPA, which can be used to solve large scale distributed constraint optimization problem (DCOP). …”
    Get full text
    Article
  8. 1648

    RESEARCH ON GEAR BOX FAULT DIAGNOSIS BASED ON DCNN AND XGBOOST ALGORITHM by ZHANG RongTao, CHEN ZhiGao, LI BinBin, JIAO Bin

    Published 2020-01-01
    “…Secondly,the feature matrix was used as input data,and the parameters of XGBoost algorithm were adjusted by lattice parameter method,then the XGBoost model was obtained. …”
    Get full text
    Article
  9. 1649

    PKI cross-domain authentication scheme based on advanced PBFT algorithm by Sijie QIAN, Liquan CHEN, Shihui WANG

    Published 2020-08-01
    Subjects: “…Byzantine fault tolerant algorithm…”
    Get full text
    Article
  10. 1650

    Adaptive bandwidth allocation algorithm based on the multi-threshold reservation mechanism by Geng CHEN, Wei-wei XIA, Lian-feng SHEN

    Published 2014-12-01
    “…An adaptive bandwidth allocation algorithm based on multi-threshold reservation mechanism is proposed to guarantee the quality of service (QoS) of multi-services in heterogeneous wireless networks.With the bandwidth reserva-tion mechanism by setting multi-threshold in each network for every traffic,the adaptive bandwidth allocation scheme according to the transmission rate levels requirements for traffic k and the network status can be formulated as an optimal problem with the constraints of the bandwidth allocation matrix for each traffic and all users based on the multi-homing technology.A procedure of the iterative method is presented to solve the optimal problem of the formulated adaptive bandwidth allocation scheme.The optimized bandwidth allocation matrixes for traffics and for all users are obtained for the real-time network throughput maximization under bandwidth reserving thresholds and network capacity constrains and the bandwidth resource utilization efficiency of heterogeneous wireless network can be increased.Numerical simula-tion results show that the proposed algorithm can support QoS requiring transmission rate grades,decrease the new call blocking probability,increase the average user access rate and improve the network throughput of the heterogeneous wireless network by 40% to the largest extent.…”
    Get full text
    Article
  11. 1651

    Backtracking Search Optimization Algorithm for Synthesis of Concentric Circular Antenna Arrays by K. Guney, A. Durmus, S. Basbug

    Published 2014-01-01
    “…A backtracking search optimization algorithm (BSA) is proposed for the synthesis of concentric circular antenna arrays (CCAAs) with the low sidelobe levels at a fixed beamwidth. …”
    Get full text
    Article
  12. 1652

    Adaptive selection method of desensitization algorithm based on privacy risk assessment by Lijun ZU, Yalin CAO, Xiaohua MEN, Zhihui LYU, Jiawei YE, Hongyi LI, Liang ZHANG

    Published 2023-06-01
    “…The financial industry deals with a vast amount of sensitive data in its business operations.However, the conventional approach of binding financial data for desensitization and using desensitization algorithms is becoming inefficient due to the fast-paced growth of financial businesses and the proliferation of data types.Additionally, manual verification and assessment of desensitized data by security experts are time-consuming and may carry potential privacy risks due to the improper selection of desensitization algorithms.While prior research has emphasized desensitization methods and privacy-preserving technologies, limited work has been conducted on desensitization algorithms from the perspective of automation.To address this issue, an adaptive recommendation framework was propose for selecting desensitization strategies that consider various factors, such as existing privacy protection technologies, data quality requirements of business scenarios, security risk requirements of financial institutions, and data attributes.Specifically, a dual-objective evaluation function was established for privacy risk and data quality to optimize the selection of desensitization algorithm parameters for different algorithms.Furthermore, the desensitization algorithm and parameters were adaptively selected by considering the data attributes through a multi-decision factor system and desensitization effect evaluation system.Compared to traditional approaches, the proposed framework effectively tackle issues of reduced data usability and inadequate personal data privacy protection that derive from manual intervention.Testing on a dataset with multiple financial institution types, the experiments show that the proposed method achieves a recommendation accuracy exceeding 95%, while the desensitized privacy risk level differed by less than 10% from the expected level.Additionally, the recommendation efficiency is 100 times faster than expert manual processing.…”
    Get full text
    Article
  13. 1653
  14. 1654

    Chain Routing Algorithm of Wireless Sensor Networks for Streetlight Monitoring System by Tiaojuan Ren, Yourong Chen, Zhangquan Wang

    Published 2013-01-01
    “…Under certain conditions, CRASMS algorithm outperforms LEACH and PEGASIS algorithms.…”
    Get full text
    Article
  15. 1655

    A Graph Convolutional Network-Based Sensitive Information Detection Algorithm by Ying Liu, Chao-Yu Yang, Jie Yang

    Published 2021-01-01
    “…For improvement purposes, this paper proposes a novel self-attention-based detection algorithm using the implementation of graph convolutional network (GCN). …”
    Get full text
    Article
  16. 1656

    Semi-supervised Gaussian process classification algorithm addressing the class imbalance by Zhan-guo XIA, Shi-xiong XIA, Shi-yu CAI, Ling WAN

    Published 2013-05-01
    “…The traditional supervised learning is difficult to deal with real-world datasets with less labeled information when the training sets class is imbalanced.Therefore,a new semi-supervised Gaussian process classification of address-ing was proposed.The semi-supervised Gaussian process was realized by calculating the posterior probability to obtain more accurate and credible labeled data,and embarking from self-training semi-supervised methods to add class label into the unlabeled data.The algorithm makes the distribution of training samples relatively balance,so the classifier can adaptively optimized to obtain better effect of classification.According to the experimental results,when the circum-stances of training set are class imbalance and much lack of label information,The algorithm improves the accuracy by obtaining effective labeled in comparison with other related works and provides a new idea for addressing the class im-balance is demonstrated.…”
    Get full text
    Article
  17. 1657
  18. 1658

    Research on packet convergence sublayer classification algorithm for WiMAX system by ZHANG Qing-bo1, HE Jia-ming1, ZHU Yan3

    Published 2010-01-01
    “…The mapping relation between the higher-layer protocol data and connection was analyzed in WiMAX system.And a packet convergence sublayer classification algorithm based on non-collision hashing and address-blocking XOR look-up was proposed,thus realized the quick look-up and classification of higher-layer protocol data.The complexity and the increase renewal function of algorithm was analyzed quantitatively.The simulation results show that the classifi-cation algorithm satisfies QoS(quality of service) requests with the performances of delay and memory,moreover time-liness is also enhanced greatly.…”
    Get full text
    Article
  19. 1659

    Fast copy-move forgery detection algorithm based on group SIFT by Bin XIAO, Ruxia JING, Xiuli BI, Jianfeng MA

    Published 2020-03-01
    “…Aiming at the high computational complexity of the existing copy-move image forgery detection algorithm,a copy-move forgery detection algorithm based on group scale-invariant feature transform (SIFT) was proposed.Firstly,the simple linear iterative clustering (SLIC) was utilized to divide the input image into non-overlapping and irregular blocks.Secondly,the structure tensor was introduced to classify each block as flat blocks,edge blocks and corner blocks,and then the SIFT feature points extracted from the block were taken as the block features.Finally,the forgery was located by the inter-class matching of the block features.By means of inter-class matching and feature point matching,the time complexity of the proposed copy-move forgery detection algorithm in feature matching and locating forgery region was effectively reduced while guaranteeing the detection effect.The experimental results show that the accuracy of the proposed algorithm is 97.79%,the recall rate is 90.34%,and the F score is 93.59%,the detecting time for the image with size of 1024×768 is 12.72 s,and the detecting time for the image with size of 3000×2000 was 639.93 s.Compared with the existing copy-move algorithm,the proposed algorithm can locate the forgery region quickly and accurately,and has high robustness.…”
    Get full text
    Article
  20. 1660

    Optimal scalable redeployment algorithm of relay nodes in wireless sensor networks by Bin ZENG, Jun WEI, Lu YAO

    Published 2012-04-01
    “…A relay node redeployment algorithm was proposed to find the optimal location of redeployment relay node when an existed relay node was overloaded considering the multi-dimensional localization and bandwidth constraint.The algorithm translated the redeployment problem into the optimal location planning in a multi-dimensional Euclidean space and then gave the suitable redeployment plan through searching the intersections of transmission areas heuristically.The correctness and completeness of the algorithm were proved.Furthermore,an optimization method was proposed to reduce the complexity of the algorithm to the linear function of the number of sensor nodes.The simulation results show that the algorithm can balance the loads of the overloaded relay nodes by joining in the candidate nodes and then prolong the network lifetime.…”
    Get full text
    Article