Trust based secure routing algorithm for wireless sensor networks by WANG Chao, JIA Xiang-yu, LIN Qiang

“…In order to deal with the safety hidden trouble caused by that the nodes in wireless sensor networks were lack of fixed infrastructure and it was hard to check the malicious behavior of the nodes, so the conception of nodes’ trust was proposed combined with swarm intelligence optimization algorithm. It introduced nodes’ trust as a allocation strategy of pheromone, which was similar to a reliable and secure label of MPLS, so as to set up the reliable and secure route, re- move the malicious nodes from the network, and provide reliable and secure wireless sensor network environment. …”
Get full text

Unstructured Big Data Threat Intelligence Parallel Mining Algorithm by Zhihua Li, Xinye Yu, Tao Wei, Junhao Qian

Subjects: “…multi-label classification algorithm…”
Get full text

Spectrum sensing algorithm based on symmetry of cyclic spectral correlation by Yu-long GAO, Yan-ping CHEN, Xiu-zhi GUAN, Zhong-zhao ZHANG, Xue-jun SHA

Subjects: “…strip spectral correlation algorithm…”
Get full text

Improved Newton Iterative Algorithm for Fractal Art Graphic Design by Huijuan Chen, Xintao Zheng

Get full text

Design of automatic routing algorithm based on overlapping hierarchical induction by Jianhong ZHENG, Heyun CHEN, Pengguang ZHOU, Hao XU

“…Aiming at the problem of impulse noise with large amplitude fluctuation and strong time-varying characteristics,which seriously affected the communication performance of power carrier network,the power line network topology and the classical routing algorithm of power line carrier communication were analyzed,and on this basis,an algorithm of overlapping hierarchical induction algorithm (OHIA) was proposed,which proved the feasibility of the algorithm and gave the inductive factor transfer algorithm,route addressing process and forecast based route maintenance strategy.Through the NS-3 simulation platform to establish the PLC model,respectively,ant colony algorithm and overlapping layer induced PLC automatic routing algorithm were simulated.The simulation results show that compared with the ant colony algorithm,the proposed algorithm improves the success rate of the first communication in the strong time-varying channel environment,and makes great progress in the large-scale networking of PLC.…”
Get full text

Virtual network embedding algorithm based on consultant guided search by Wentan LIU, Lei ZHUANG, Mengyang HE, Shuaikui TIAN, Yu SONG, Guoqing WANG

Subjects: Get full text

Resource Assignment Algorithms for Autonomous Mobile Robots with Task Offloading by Giuseppe Baruffa, Luca Rugini

“…The original problem is reformulated and simplified, so that it can be solved by also selfish and greedy algorithms. For comparison purposes, a genetic algorithm (GA) is used as the baseline for the proposed optimization techniques. …”
Get full text

An Iterative Algorithm for the Reflexive Solution of the General Coupled Matrix Equations by Zhongli Zhou, Guangxin Huang

“…In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations over reflexive matrix solution. …”
Get full text

Particle Swarm Optimization Algorithm and Its Application in Image Segmentation by Yu Liyang

“…The paper concludes that heuristic optimization algorithms such as the PSO have gained considerable focus. …”
Get full text

Robust resource allocation algorithm for heterogeneous wireless networkwith SWIPT by Yongjun XU, Yuan HU, Guoquan LI, Jinzhao LIN, Qianbin CHEN

“…To improve energy efficiency and robustness of heterogeneous wireless networks with wireless information and power transfer,the robust joint transmit power and power splitting resource allocation problem was studied.Based on mini-max probability machine and Dinkelbach method,the original NP-hard problem was transformed into a solvable convex optimization form,meanwhile a distributed dual resource allocation algorithm was proposed.Additionally,both computational complexity and robust sensitivity were analyzed.Simulation results show that the proposed algorithm can guarantee the quality of service requirements of macro cellular users and femtocell users under channel uncertainties.…”
Get full text

Adaptive fuzzy filter algorithm for LEO communication channel estimation by ZHUO Yong-ning, ZHU Li-dong, WU Shi-qi

“…A novel adaptive LMS filter algorithm based on fuzzy rules was proposed.Through building many fuzzy sets over the space of channel gained value and the increment value of channel gain,in addition to the setting of fuzzy rules,an adaptive algorithm incorporated with human experience was set up,which was adaptive to the time_varing character-istics of LEO satellite channel.The results of the simulation validate the algorithm.…”
Get full text

Human Resource Allocation Based on Fuzzy Data Mining Algorithm by You Wu, Zheng Wang, Shengqi Wang

“…In this article, we have studied the basic concepts, processes, and algorithms of association rule mining technology. Aiming at large-scale database applications, in order to improve the efficiency of data mining, we proposed an incremental association rule mining algorithm based on clustering, that is, using fast clustering. …”
Get full text

Ebbinghaus forgetting curve and attention mechanism based recommendation algorithm by Nan JIN, Ruiqin WANG, Yuecong LU

“…Traditional attention-based recommendation algorithms only use position embeddings to model user behavior sequences, however, ignore specific timestamp information, resulting in poor recommendation performance and overfitting of model training.The multi-task matrix factorization recommendation model based on time attention was proposed, which used the attention mechanism to extract the neighborhood information for the user and item embedding, and used the Ebbinghaus forgetting curve to describe the changing characteristics of user interests over time.The model training process introduced a reinforcement learning strategy of experience replay to simulate the human memory review process.Experimental results on real datasets show that the proposed model has better recommendation performance than existing recommendation models.…”
Get full text

Cooperative spectrum sensing algorithm based on limiting eigenvalue distribution by Yin MI, Guang-yue LU

“…A novel maximum-minimum eigenvalue (NMME) cooperative spectrum sensing algorithm and threshold decision rule are proposed via analyzing minimum eigenvalue limiting distribution of the covariance matrix of the received signals from multiple cognitive users (CU) by means of latest random matrix theory (RMT).The proposed scheme could not need the prior knowledge of the signal transmitted from primary user (PU) and could effectively overcome the noise uncertainty.At a given probability of false alarm (P<sub>fa</sub>),simulation results show that the proposed scheme can get lower decision threshold and higher probability of detection (P<sub>d</sub>) compared with the original algorithm,and it can also get better detection performance with fewer CU and smaller sample numbers.…”
Get full text

Activity-based routing algorithm in opportunistic mobile social networks by Sheng Zhang, Houzhong Liu, Caisen Chen, Zhaojun Shi, William Wei Song

“…The simulation results show that the proposed routing algorithm can not only improve the successful delivery ratio of messages but also reduce the network delay and the network overhead obviously, in comparison with the classical opportunistic routing algorithms, such as community-aware message opportunistic transmission algorithm, community-based message transmission scheme algorithm, PRoPHET, Epidemic algorithm, and interest characteristic probability prediction algorithm.…”
Get full text

Adversarial example defense algorithm for MNIST based on image reconstruction by Zhongyuan QIN, Zhaoxiang HE, Tao LI, Liquan CHEN

“…With the popularization of deep learning, more and more attention has been paid to its security issues.The adversarial sample is to add a small disturbance to the original image, which can cause the deep learning model to misclassify the image, which seriously affects the performance of deep learning technology.To address this challenge, the attack form and harm of the existing adversarial samples were analyzed.An adversarial examples defense method based on image reconstruction was proposed to effectively detect adversarial examples.The defense method used MNIST as the test data set.The core idea was image reconstruction, including central variance minimization and image quilting optimization.The central variance minimization was only processed for the central area of the image.The image quilting optimization incorporated the overlapping area into the patch block selection.Considered and took half the size of the patch as the overlap area.Using FGSM, BIM, DeepFool and C＆amp;W attack methods to generate adversarial samples to test the defense performance of the two methods, and compare with the existing three image reconstruction defense methods (cropping and scaling, bit depth compression and JPEG compression).The experimental results show that the central variance minimization and image quilting optimization algorithms proposed have a satisfied defense effect against the attacks of existing common adversarial samples.Image quilting optimization achieves over 75% classification accuracy for samples generated by the four attack algorithms, and the defense effect of minimizing central variance is around 70%.The three image reconstruction algorithms used for comparison have unstable defense effects on different attack algorithms, and the overall classification accuracy rate is less than 60%.The central variance minimization and image quilting optimization proposed achieve the purpose of effectively defending against adversarial samples.The experiments illustrate the defense effect of the proposed defense algorithm in different adversarial sample attack algorithms.The comparison between the reconstruction algorithm and the algorithm shows that the proposed scheme has good defense performance.…”
Get full text

Spatio-temporal periodic behavior mining algorithm for social networks by Yu-peng HU, Hao LUO, Ya-ping LIN, Zheng QIN, Bo YIN

“…A hierarchical bipartite graph based model and a mining algorithm were presented to obtain the potential spatio-temporal periodic behavior,meanwhile avoided the subset omitting problem in previous schemes.Then the location analysis algorithm was designed to achieve the nearly inimum location dominating subset,it could monitor the small portion of the locations as early as possible.Finally experiments results show that the algorithms can find out the periodic location set as well as obtain nearly minimum location dominating subset,so as to cover the major portion of objectives using those popular locations.…”
Get full text

Clustering algorithm and analysis based on objective trust modeling in MANET by ZHANG Qiang, HU Guang-ming, CHEN Hai-tao, GONG Zheng-hu

“…In mobile-adhoc networks（MANET）,an objective trust estimation model was presented,and then a maxi-mum-objective-trust-based clustering solution（MOTBCS） was raised,which aimed at the opinion of maximum stable links and energy viewpoints and gave nodes their objective trust estimation.This solution only extended the original HELLO message for the benefit of small costs and it could be better suitable for the realistic working environments in MANETs.Simulation results show that MOTBCS generate more stable clustering groups.It also has less communication costs and better efficiency than other clustering algorithms.…”
Get full text

Tennis Assistance Technology Based on Dynamic Time Warping Algorithm by Penggang Wang, Pengpeng Zhang, Guanxi Fan

“…In view of this research, a tennis sports assistance technology based on dynamic time warping algorithm is developed. By collecting athletes’ motion data and using dynamic time warping algorithm for motion similarity analysis, personalized technical improvement suggestions are provided for athletes. …”
Get full text

Algorithm for k-anonymity based on projection area density partition by Chao WANG, Jing YANG, Jian-pei ZHANG, Gang LV

“…In data publishing privacy preserving,while classifying temporary anonymous groups,the existing algorithms didn’t consider the distance between adjacent data points,and could easily produce a lot of unnecessary information loss,thus affecting the availability of released anonymous data sets.To solve the above problem,the concept of rectangular projection area,the projection area density and partition coefficient characterization were presented,aim to increase the recording points’s projection area density to divide temporary anonymous group reasonably,and to make the information loss of divided anonymous groups as small as possible.And presents the algorithm for k-anonymity based on projection area density partition,by optimizing the rounded partition function and properties dimension selection strategy,to reduce unnecessary information loss and to further improve the availability of released data sets,without reducing the number of anonymous groups.The rationality and validity of the algorithm are verified by theoretical analysis and multiple experiments.…”
Get full text