Showing 441 - 460 results of 18,268 for search '"Algorithm"', query time: 0.09s Refine Results
  1. 441

    Frequency-Dependent FDTD Algorithm Using Newmark’s Method by Bing Wei, Le Cao, Fei Wang, Qian Yang

    Published 2014-01-01
    “…Theoretical analyses and numerical results demonstrate that this method is a general algorithm and it has advantages of higher accuracy and stability over the algorithms based on central difference method.…”
    Get full text
    Article
  2. 442

    5G network slicing algorithm based on prediction by Jiageng ZHANG, Min ZHU, Feng DU, Qi WANG, Jun LIU, Zhihai SUO, Li WANG

    Published 2021-09-01
    “…5G on line scenario needs short build time of network slice, it can use prediction algorithm to isolate network resource in advance to reduce the construction time of network slice.A 5G network slicing algorithm based on prediction was proposed, which used fourth square as cost function to predict the network resource requests with accepted accurate and lower complexity of algorithm.And then based on the prediction result, virtual nodes and links resource were allocated, and container was pulled up when network slice request arrives to network, the dynamic creation of network slices was completed.The simulation results show that the proposed algorithm can get 90% accurate of prediction, and reduce 50% construction time of network slice, and improve the network utilization ration,when new network slice reusing the original network slice.…”
    Get full text
    Article
  3. 443

    Research on IQ imbalance estimation algorithm based on GSOP by Xian ZHOU, Tianyu GAO, Jiahao HUO, Xiaojie SHEN, Dongxu LU, Wei HUANGFU, Jiajing TU, Keping LONG

    Published 2018-09-01
    “…In order to satisfy the demand of the efficiency and low cost measurement for high rate optical communication system,the IQ-ImEstimation algorithm was proposed for IQ imbalance estimation in the PDM-MQAM cohernt optical communication system based on GSOP.Two estimation schemes include amplitude impairment and phase impairment were designed by utilizing the power and correlation.Finally,a 34 GBaud PDM-MQAM system was simulated and experimentalized.The results indicate that the IQ-ImEstimation algorithm is accuracy and effective.…”
    Get full text
    Article
  4. 444

    A Synchronous-Asynchronous Particle Swarm Optimisation Algorithm by Nor Azlina Ab Aziz, Marizan Mubin, Mohd Saberi Mohamad, Kamarulzaman Ab Aziz

    Published 2014-01-01
    “…This algorithm is also known as synchronous PSO (S-PSO). …”
    Get full text
    Article
  5. 445
  6. 446
  7. 447

    Novel multi-rate multicast congestion control algorithm by ZHANG Deng-yin, WANG Qian-qian, LI Jun, WANG Ru-chuan

    Published 2007-01-01
    “…A novel congestion control mechanism based on packet-bunch probe and TCP throughput formula(PTMCC) was proposed.This receiver-driven multi-rate multicast congestion control mechanism probes available bandwidth by packet-bunch and gets TCP-friendly rate by TCP throughput formula.A new rate adjustment algorithm was also designed.Simulation results show that the PTMCC make good performance on convergence,TCP-friendliness and response to congestion.…”
    Get full text
    Article
  8. 448

    Secure Multicast Routing Algorithm for Wireless Mesh Networks by Rakesh Matam, Somanath Tripathy

    Published 2016-01-01
    “…In this paper, we propose SEMRAW (SEcure Multicast Routing Algorithm for Wireless mesh network) that is resistant against all known active threats including wormhole attack. …”
    Get full text
    Article
  9. 449

    Provident garbage collection algorithm for SSD storage system by Xuezhen TU, Zhenjiang Huang, Zhengguang CHEN

    Published 2019-05-01
    “…A predictive based proactive garbage collection algorithm was proposed.Firstly,the data was separated according to different heat factors,then the upper and lower predictions were performed on the number of different types of page allocation requests (PAR) that would be reached in the future.While satisfying the page allocation request lower prediction,the PAR upper prediction requirement was maximally satisfied,the WA problem was optimized,and invalid effective data migration was reduced,thereby maximizing the garbage collection utility.A mathematical model was defined for this problem,and an algorithm for obtaining the approximate optimal solution was given.The applicable scenario of the model was analyzed.The practical results show that the algorithm can obtain the maximum benefit and can significantly improve the performance of SSD and reduce the cost.…”
    Get full text
    Article
  10. 450

    An Improved Animal Migration Optimization Algorithm for Clustering Analysis by Mingzhi Ma, Qifang Luo, Yongquan Zhou, Xin Chen, Liangliang Li

    Published 2015-01-01
    “…Animal migration optimization (AMO) is one of the most recently introduced algorithms based on the behavior of animal swarm migration. …”
    Get full text
    Article
  11. 451

    The Treatment Algorithm in Diabetic Foot: An Alternative Against Amputation? by Tacettin Güçer

    Published 2022-12-01
    “…With this combination, this technique was found extremely effective by application, according to the algorithm explained below, and should be an alternative to the current therapy applications in diabetic ulcers.…”
    Get full text
    Article
  12. 452

    Stereo robust watermark algorithm based on parameter optimization by Yiming XUE, Jinyu ZHANG, Botao CHEN, Zhenghong YANG

    Published 2023-07-01
    “…Aiming at issues such as illegal dissemination of network audio data and privacy leakage, a stereo robust watermark algorithm based on parameter optimization was proposed.Firstly, the watermark was embedded by modifying the singular value ratio of odd segment based on the insensitivity of stereo channels to attack, and aiming at minimizing the relative distortion of the two channels.The embedding process was optimized and the perceived quality of the audio was improved.Then, a parameter optimization method was proposed to find optimal parameters on each audio file, and the imperceptibility and robustness were well balanced.The simulation results show that the proposed algorithm has good imperceptibility and robustness against conventional signal processing.…”
    Get full text
    Article
  13. 453
  14. 454

    Variable Weighted Ordered Subset Image Reconstruction Algorithm by Jinxiao Pan, Tie Zhou, Yan Han, Ming Jiang

    Published 2006-01-01
    “…In the two algorithms, the weighting varies with the geometrical direction of the ray. …”
    Get full text
    Article
  15. 455

    RWA algorithm based on cost of photoelectric conversion device by Daoyun HU, Zhentai YANG, Qianchun LU, Jin QI

    Published 2020-04-01
    “…Over the past decade,carrier operator implement fine-grained traffic scheduling in optical transport network(OTN) by deploying optical-electric conversion(OEO) devices on ROADM,which can improve the spectrum utilization.However,OEO device is very expensive,which will increase the CAPEX and OPEX of carrier operator.A problem about traffic scheduling and the deployment of OEO devices in OTN was proposed.Then,the ILP model of this problem was built and it was proved NP-hard.Additionally,two novel algorithms named OEO-RWA and SA-RWA were proposed.At last,these algorithms were demonstrated can not only ensure flexibility of traffic scheduling,but also can reduce the number of OEO device through simulation.…”
    Get full text
    Article
  16. 456

    An Island Grouping Genetic Algorithm for Fuzzy Partitioning Problems by S. Salcedo-Sanz, J. Del Ser, Z. W. Geem

    Published 2014-01-01
    “…This paper presents a novel fuzzy clustering technique based on grouping genetic algorithms (GGAs), which are a class of evolutionary algorithms especially modified to tackle grouping problems. …”
    Get full text
    Article
  17. 457

    Font Design in Visual Communication Design of Genetic Algorithm by Yue Wang, Won-jun Chung

    Published 2022-01-01
    “…Therefore, this paper studies the font design in the design of the visual algorithm based on the genetic algorithm, and the font design is analyzed by the particle swarming algorithm, the decision MIMO-SCMA system of the genetic algorithm. …”
    Get full text
    Article
  18. 458

    Minimum energy broadcasting algorithm in wireless sensor networks by TANG Yong, ZHOU Ming-tian

    Published 2007-01-01
    “…In order to adjust the transmission power of nodes for minimizing total energy consumption in wireless sensor networks,a new distributed algorithm called ERBOP(enhanced relative neighborhood graph broadcast oriented protocol) was proposed which was an improvement upon RBOP(relative neighborhood graph broadcast oriented protocol) pre-sented by Cartigny et al.In ERBOP,a sub-graph of relative neighborhood graph,which was a sparse connected graph and contains minimum spanning tree,was locally constructed by eliminating long edges.Moreover,1-dominating connected dominating set was constructed basing on the sub-graph,and only the dominating nodes participated in the broadcasting.The simulation results show that ERBOP conserves energy efficiently.…”
    Get full text
    Article
  19. 459

    Virtural Realtime Services:Infrastructure,Algorithms and Evolution Path by Wei Chen

    Published 2015-05-01
    “…Meanwhile,a number of key algorithms for virtual rea1-time service were proposed and analyzed,an evolution path toward virtual rea1-time service along with its major problems was also presented. …”
    Get full text
    Article
  20. 460

    Efficient heuristic algorithm for the mobile sink routing problem by YUAN yuan1, PENG Yu-xing1, LI Shan-shan2, TANG Wen-sheng3

    Published 2011-01-01
    “…In large-scale monitoring region,randomly deployed wireless sensor networks may not be fully connected with high probability.Using mobile sink for data collection is one of the feasible solutions.Mobile sink shortest routing prob-lem can be regarded as a special case of TSP with neighborhoods(TSPN) problem,since the neighborhoods are the radio ranges of the sensor nodes,which can be modeled as possibly overlapped disks with diverse sizes.This kind of TSPN problem has no polynomial algorithms so far.To handle it,a novel approximation algorithm was proposed,which first forms a "racetrack" by utilizing the non-intersecting loop property of TSP routes,and then through the inner lane heuris-tic,the bend heuristic and the shortcut searching,the algorithm can find an approximation solution within O(n2) computa-tion time.The formal proofs and the large-scale simulations all verify that our algorithm can achieve a good approxima-tion ratio and can be more efficient than the related algorithms.…”
    Get full text
    Article