Showing 681 - 700 results of 19,511 for search '"algorithms"', query time: 0.06s Refine Results
  1. 681

    An Innovative Thinking-Based Intelligent Information Fusion Algorithm by Huimin Lu, Liang Hu, Gang Liu, Jin Zhou

    Published 2013-01-01
    “…Furthermore, the influences of each parameter of this algorithm on algorithm performance are analyzed and compared with those of classical intelligent algorithms trough test. …”
    Get full text
    Article
  2. 682

    Frequent-pattern discovering algorithm for large-scale corpus by GONG Cai-chun1, HE Min1, CHEN Hai-qiang1, XU Hong-bo1, CHENG Xue-qi1

    Published 2007-01-01
    “…A memory-based frequent-pattern discovering algorithm for large-scale corpus was presented.First,the origi-nal corpus was partitioned into several parts using appropriate dividing policy.Then each partition was processed inde-pendently to produce a temporary result,and the union of all temporary results is the final frequent-pattern set.The algo-rithm prunes a subtree once it is sure that none of the corresponding pattern will be frequent.Experiment shows that it takes no more than 1.6 gigabytes of memory to discover all patterns appearing more than 100 times for a 3.6 gigabytes news corpus,the average speed is 3.28 magabytes per second.…”
    Get full text
    Article
  3. 683

    Algorithm of selecting the tear replacement therapy in ambulatory practice by V.V. Brzheskiy

    Published 2018-07-01
    “…Petersburg State Pediatric Medical University<br> <br> <b>Aim</b>: to determine the algorithm for selecting artificial tears for tear-replacement therapy for patients with different etiopathogenesis and clinical course of the dry eye syndrome.…”
    Get full text
    Article
  4. 684

    Communication community detection algorithm based on ranking of strength by Hong-quan WEI, Hong-chang CHEN, Li-xiong LIU, Ju-long LAN

    Published 2014-10-01
    “…According to the characteristics of how to effectively describe real weighted network of the current telecom network problems,improvement and development of related models of complex networks,especially for communication community detection results hierarchy was not clear and the problem of high complexity,from the analysis of the characteristics of complex network,a new algorithm for community detection design communication.The algorithm to achieve effective communication strength ranking method based on community detection in communication,communication density distribution of generating high resolution based on hierarchical nesting tree,the distance vector pruning nested tree,the level of analysis and structure of community stability and reduce the computational complexity.The algorithm is verified using real network data.…”
    Get full text
    Article
  5. 685

    DBSCAN inspired task scheduling algorithm for cloud infrastructure by S.M.F D Syed Mustapha, Punit Gupta

    Published 2024-01-01
    “…The experimental results are compared with existing ACO and PSO algorithms for task scheduling.…”
    Get full text
    Article
  6. 686

    AdaBoost algorithm based on fitted weak classifier by Pengfeng SONG, Qingwei YE, Zhihua LU, Yu ZHOU

    Published 2019-11-01
    “…AdaBoost algorithm was proposed to minimize the accuracy caused by weak classifiers by minimizing the training error rate,and the single threshold was weaker and difficult to converge.The AdaBoost algorithm based on the fitted weak classifier was proposed.Firstly,the mapping relationship between eigenvalues and marker values was established.The least squares method was introduced to solve the fitting polynomial function,and the continuous fitting values were converted into discrete categorical values,thereby obtaining a weak classifier.From the many classifiers obtained,the classifier with smaller fitting error was selected as the weak classifier to form a new AdaBoost strong classifier.The UCI dataset and the MIT face image database were selected for experimental verification.Compared with the traditional Discrete-AdaBoost algorithm,the training speed of the improved algorithm was increased by an order of magnitude.And the face detection rate can reach 96.59%.…”
    Get full text
    Article
  7. 687

    Alternating Projections Filtering Algorithm to Track Moving Objects by Youssef Qranfal

    Published 2019-01-01
    “…The new optimization algorithm proves to be slightly more accurate than KF, but, more to the point, it is much faster in terms of CPU time.…”
    Get full text
    Article
  8. 688

    Game-theoretical frequency reuse algorithm in Femtocell network by Xiong ZHOU, Sui-li FENG, Yue-hua DING, Yong-zhong ZHANG

    Published 2015-02-01
    “…A game-theoretical frequency reuse algorithm has been proposed for Femtocell network.Firstly,each Femtocell tries to get an available sub-band by sensing its radio circumstance.Then,inner-cluster frequency collisions are avoided by implementing a negotiation mechanism.Lastly,each cluster is regarded as a game player to get the largest utility by using its optimal strategy.Despite Femtocell base stations are randomly installed by users,the proposed method performs well in Femtocell network.Simulation results show that frequency collisions are dramatically reduced and the average capacity of Femtocells is considerably enhanced.…”
    Get full text
    Article
  9. 689

    Information entropy based match field cutting algorithm by Peng-hao SUN, Ju-long LAN, Shao-jun ZHANG, Jun-fei LI

    Published 2017-05-01
    “…With the increasing diversity of network functions,packet classification had a higher demand on the number of match fields and depth of match table,which placed a severe burden on the storage capacity of hardware.To ensure the efficiency of matching process while at the same time improve the usage of storage devices,an information entropy based cutting algorithm on match fields was proposed.By the analysis on the redundancy of match fields and distribution pattern in a rule set,a match field cutting model was proposed.With the mapping of matching process to the process of entropy reduction,the complexity of optimal match field cutting was reduced from NP-hard to linear complexity.Experiment results show that compared to existing schemes,this scheme can need 40% less TCAM storage space,and on the other side,with the growing of table size,the time complexity of this algorithm is also far less than other algorithms.…”
    Get full text
    Article
  10. 690

    Heuristic Sarsa algorithm based on value function transfer by Jianping CHEN, Zhengxia YANG, Quan LIU, Hongjie WU, Yang XU, Qiming FU

    Published 2018-08-01
    “…With the problem of slow convergence for traditional Sarsa algorithm,an improved heuristic Sarsa algorithm based on value function transfer was proposed.The algorithm combined traditional Sarsa algorithm and value function transfer method,and the algorithm introduced bisimulation metric and used it to measure the similarity between new tasks and historical tasks in which those two tasks had the same state space and action space and speed up the algorithm convergence.In addition,combined with heuristic exploration method,the algorithm introduced Bayesian inference and used variational inference to measure information gain.Finally,using the obtained information gain to build intrinsic reward function model as exploring factors,to speed up the convergence of the algorithm.Applying the proposed algorithm to the traditional Grid World problem,and compared with the traditional Sarsa algorithm,the Q-Learning algorithm,and the VFT-Sarsa algorithm,the IGP-Sarsa algorithm with better convergence performance,the experiment results show that the proposed algorithm has faster convergence speed and better convergence stability.…”
    Get full text
    Article
  11. 691

    A Novel Complex Valued Cuckoo Search Algorithm by Yongquan Zhou, Hongqing Zheng

    Published 2013-01-01
    “…The results are compared with cuckoo search based on real-valued encoding; the usefulness of the proposed algorithm is verified.…”
    Get full text
    Article
  12. 692

    CUDT: A CUDA Based Decision Tree Algorithm by Win-Tsung Lo, Yue-Shan Chang, Ruey-Kai Sheu, Chun-Chieh Chiu, Shyan-Ming Yuan

    Published 2014-01-01
    “…Many researches have been proposed, which were focusing on improving the performance of decision tree. However, those algorithms are developed and run on traditional distributed systems. …”
    Get full text
    Article
  13. 693
  14. 694

    Anti-interference algorithm of wireless channel for IoT communication by Ling TAN, Yong ZHUANG

    Published 2017-10-01
    “…In IoT communication,the anti-interference of wireless channel is influenced by various factors.Multi-antenna system has significant effect for promoting anti-interference of channel,whose complexity and performance in signal detection need further improvement.The QR decomposition detection algorithm in signal detection of multi-antenna system has low computational complexity,but the algorithm performance is poor.In order to improve the performance of QR decomposition detection algorithm,a QR decomposition algorithm based on ML criterion and decision candidate mechanism was proposed,and the performance of the algorithm was analyzed.The ML criterion was used to estimate the initial level of the detection,and a reliable decision was adopted in the other detection layer.Candidate points were introduced in unreliable case and the optimal candidate were selected from the feedback.The algorithm could significantly improve the system interference,and propagation error were greatly reduced in the decision feedback.The experimental results show that the proposed algorithm can improve the performance of the IoT system effectively with certain complexity.…”
    Get full text
    Article
  15. 695
  16. 696

    Co-decode algorithm of network coding with hardware logic by Hui LI, Ming-long ZHANG, Fu-xing CHEN, Han-xu HOU, Kai PAN, Wei WANG, Hu-sheng YUAN, Tao SUN

    Published 2012-07-01
    “…Practical general coder and decoder of network coding(NC)with HDL(hardware description language)logic for wire-speed nodes was presented.The NC coders applied random linear network coding (RLNC) and the decoders recovered the original packets by Cramer’s rule.The structures and algorithms of NC coder and decoder were designed in detail and implemented in HDL with NetFPGA boards.Comparing with traditional stored-and-forward mechanism,network emulations showed that networks with wire-speed NC coder and decoder nodes could achieve the capacity bound of max-flow min-cut theorem,and the end-to-end delay was guaranteed on a small constant.…”
    Get full text
    Article
  17. 697

    Adversarial sample generation algorithm for vertical federated learning by Xiaolin CHEN, Daoguang ZAN, Bingchao WU, Bei GUAN, Yongji WANG

    Published 2023-08-01
    “…To adapt to the scenario characteristics of vertical federated learning (VFL) applications regarding high communication cost, fast model iteration, and decentralized data storage, a generalized adversarial sample generation algorithm named VFL-GASG was proposed.Specifically, an adversarial sample generation framework was constructed for the VFL architecture.A white-box adversarial attack in the VFL was implemented by extending the centralized machine learning adversarial sample generation algorithm with different policies such as L-BFGS, FGSM, and C&amp;W.By introducing deep convolutional generative adversarial network (DCGAN), an adversarial sample generation algorithm named VFL-GASG was designed to address the problem of universality in the generation of adversarial perturbations.Hidden layer vectors were utilized as local prior knowledge to train the adversarial perturbation generation model, and through a series of convolution-deconvolution network layers, finely crafted adversarial perturbations were produced.Experiments show that VFL-GASG can maintain a high attack success while achieving a higher generation efficiency, robustness, and generalization ability than the baseline algorithm, and further verify the impact of relevant settings for adversarial attacks.…”
    Get full text
    Article
  18. 698

    Multipath traffic splitting algorithm based on adaptive granularity by Peng WANG, Ju-long LAN, Shu-qiao CHEN

    Published 2015-01-01
    “…Aiming at the dilemma between load balancing and packet reordering in multipath routing,an adaptive dynamic multipath traffic splitting(ADTS) algorithm was proposed.The algorithm classified Internet flows into two categories:the aggressive and the normal through analyzing the characters of the traffic,and applies different splitting granularities to the two classes of flows based on the idea of differentiated service.The theoretical analysis and simulation results show that ADTS algorithm reduces the number of reordering packets while has better performance of load balancing.…”
    Get full text
    Article
  19. 699

    Flight Delay Classification Prediction Based on Stacking Algorithm by Jia Yi, Honghai Zhang, Hao Liu, Gang Zhong, Guiyi Li

    Published 2021-01-01
    “…In this research, the principle of the Stacking classification algorithm is introduced, the SMOTE algorithm is selected to process imbalanced datasets, and the Boruta algorithm is utilized for feature selection. …”
    Get full text
    Article
  20. 700