Spectrum‐sensing algorithm based on graph feature fusion by Shanshan Wu, Guobing Hu, Bin Gu

“…Thus, compared to existing algorithms, except block range‐ and energy‐detection‐based methods, the proposed algorithm demonstrates the best spectrum‐sensing performance under low SNRs and channel‐fading conditions, while achieving the lowest computational complexity. …”
Get full text

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

“…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

An Effective Variable Transformation Strategy in Multitasking Evolutionary Algorithms by Qingzheng Xu, Lei Wang, Jungang Yang, Na Wang, Rong Fei, Qian Sun

“…Multitasking evolutionary algorithm (MTEA), which solves multiple optimization tasks simultaneously in a single run, has received considerable attention in the community of evolutionary computation, and several algorithms have been proposed in the literature. …”
Get full text

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

“…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

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

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

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

“…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

Investigation of The Effect of Feeding Period in Honey Bee Algorithm by Mustafa Kaya

Subjects: “…bee colony algorithm…”
Get full text

Novel blind audio watermarking algorithm in the hybrid domain by WANG Xiang-yang1, YANG Hong-ying1, NIU Pan-pan1

Get full text

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

“…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

Retracted: Research on the Application of Genetic Algorithm in Physical Education by Journal of Mathematics

Get full text

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

“…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

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

“…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

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

“…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

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

“…This paper aims to prove that Stacking algorithm has advantages in airport flight delay prediction, especially for the algorithm selection problem of machine learning technology. …”
Get full text

Research on the Algorithms for Registration in Sensor Network for Target Tracking by Ling Wu, Fa-Xing Lu

Get full text

Equity decentralized consensus algorithm based on incentive compatibility by Youliang TIAN, Yansen YUAN, Hongfeng GAO, Yang YANG, Jinbo XIONG

Subjects: “…consensus algorithm…”
Get full text

Two-Stage Heuristic Algorithm for Aircraft Recovery Problem by Cheng Zhang

“…Hence, a two-stage heuristic is proposed to reduce the problem scale. The algorithm integrates a heuristic scoring procedure with an aggregated aircraft recovery model (AARM) to preselect LOFs. …”
Get full text

Low complexity uplink multiuser MIMO detecting algorithm by HEI Yong-qiang1, LI Xiao-hui1, YI Ke-chu1, YANG Hong2

“…Aiming at the uplink multiuser MIMO system,a new space-time detecting algorithm was proposed,in which a linear recombination strategy was imposed on the received signal first,and then the matched filter vectors orthogonal to each users’ interference sets were used to eliminate the interference among users.Finally the signal of each user was line-arly space-time decoded by means of the orthogonal equivalent channel.The design of the algorithm under imperfect channel scenario was also provided.Theory analysis and simulation results reveal that the proposed algorithm has the advantages of low complexity and good robustness,and is superior to other detecting algorithms.…”
Get full text

Efficient AM Algorithms for Stochastic ML Estimation of DOA by Haihua Chen, Shibao Li, Jianhang Liu, Yiqing Zhou, Masakiyo Suzuki

“…To solve this problem, many algorithms have been proposed, among which the Stochastic Maximum Likelihood (SML) is one of the most concerned algorithms because of its high accuracy of DOA. …”
Get full text

Service chain mapping algorithm based on reinforcement learning by Liang WEI, Tao HUANG, Jiao ZHANG, Zenan WANG, Jiang LIU, Yunjie LIU

“…A service chain resource scheduling architecture of multi-agent based on artificial intelligence technology was proposed.Meanwhile,a service chain mapping algorithm based on reinforcement learning was designed.Through the Q-learning mechanism,the location of each virtual network element in the service chain was determined according to the system status and the reward and punishment feedback after the deployment.The experimental results show that compared with the classical algorithms,the algorithm effectively reduces the average transmission delay of the service and improves the load balance of the system.…”
Get full text