Path Planning Algorithm for Manipulators in Complex Scenes Based on Improved RRT* by Xiqing Zhang, Pengyu Wang, Yongrui Guo, Qianqian Han, Kuoran Zhang

“…The effectiveness and superiority of the improved algorithm are determined by comparing it with the existing algorithms.…”
Get full text

Joint admission control algorithm based on load transfer in heterogeneous networks by Weiwei XIA, Zhaoming DING, Lianfeng SHEN

“…A load-transfer-based joint admission control (LJAC) algorithm in heterogeneous networks was proposed.The access requirements of users were admitted based on load balancing,the dynamic load transfer of traffics in the overlapping coverage areas of heterogeneous networks were introduced,and the influence of such factors as the layout of heterogeneous networks and the vertical handoff was considered in the algorithm.The integrated system of heterogeneous networks was modeled as a multidimensional Markov chain,the steady-state probabilities were obtained and the quality of service (QoS) performance metrics were derived.Based on the Poisson point process theory,the upper bound of capacity of the heterogeneous networks satisfying QoS limitations was obtained.The admission control parameters of the integrated system of heterogeneous networks were optimized in order to maximize the resource utilization rate as well as guaranteeing the QoS of users.The simulation results demonstrate lower traffic blocking probability,lower failure probability of vertical handoff requirements,and larger system capacity gain can be achieved by using the proposed LJAC algorithm.…”
Get full text

Multi-query based key node mining algorithm for social networks by Guodong XIN, Tengwei ZHU, Junheng HUANG, Jiayang Wei, Runxuan Liu, Wei WANG

“…Mining key nodes in complex networks has been a hotly debated topic as it played an important role in solving real-world problems.However, the existing key node mining algorithms focused on finding key nodes from a global perspective.This approach became problematic for large-scale social networks due to the unacceptable storage and computing resource overhead and the inability to utilize known query node information.A key node mining algorithm based on multiple query nodes was proposed to address the issue of key suspect mining.In this method, the known suspects were treated as query nodes, and the local topology was extracted.By calculating the critical degree of non-query nodes in the local topology, nodes with higher critical degrees were selected for recommendation.Aiming to overcome the high computational complexity of key node mining and the difficulty of effectively utilizing known query node information in existing methods, a two-stage key node mining algorithm based on multi-query was proposed to integrate the local topology information and the global node aggregation feature information of multiple query nodes.It reduced the calculation range from global to local and quantified the criticality of related nodes.Specifically, the local topology of multiple query nodes was obtained using the random walk algorithm with restart strategy.An unsupervised graph neural network model was constructed based on the graphsage model to obtain the embedding vector of nodes.The model combined the unique characteristics of nodes with the aggregation characteristics of neighbors to generate the embedding vector, providing input for similarity calculations in the algorithm framework.Finally, the criticality of nodes in the local topology was measured based on their similarity to the features of the query nodes.Experimental results demonstrated that the proposed algorithm outperformed traditional key node mining algorithms in terms of time efficiency and result effectiveness.…”
Get full text

Optimization of Cultural and Creative Product Design Based on Simulated Annealing Algorithm by Xianzhe Meng

“…This paper introduces the basic principle and application process of simulated annealing algorithm and improves the simulated annealing algorithm so that it can converge faster to get the new parameters of cultural and creative product design and make it more in line with the reality of engineering optimization. …”
Get full text

Meta-path convolution based heterogeneous graph neural network algorithm by QIN Zhilong, DENG Kun, LIU Xingyan

“…To solve this problem, a heterogeneous graph neural network algorithm based on meta-path convolution was proposed. …”
Get full text

Beamforming algorithm for cognitive satellite and terrestrial network based on UAV relay by Yanli LI, Zhi LIN, Zining WANG, Ba XU, Ming CHENG, Jian OUYANG

“…Two beamforming (BF) schemes to achieve spectrum sharing by suppressing inter-system interferences in cognitive satellite and terrestrial networks were proposed, where the satellite and UAV cooperative network was used as the secondary network, while the terrestrial network was used as the primary network.Specifically, considering that only the statistical channel state information was available, a constrained optimization problem was formulated to maximize the signal-to- interference-plus-noise ratio of the secondary user under the constraints of the maximum transmit power at the UAV and the interference power of the primary user.Then, an iteration-based BF scheme was proposed to solve the constrained optimization problem.To reduce the computational complexity of the iterative algorithm, a zero-forcing based BF scheme was further proposed.Finally, computer simulations verify the correctness and effectiveness of the proposed BF schemes.…”
Get full text

Adaptive Strategies Based on Differential Evolutionary Algorithm for Many-Objective Optimization by Yifei Sun, Kun Bian, Zhuo Liu, Xin Sun, Ruoxia Yao

“…The decomposition-based algorithm, for example, multiobjective evolutionary algorithm based on decomposition (MOEA/D), has been proved effective and useful in a variety of multiobjective optimization problems (MOPs). …”
Get full text

A Numerical Algorithm for a Kirchhoff-Type Nonlinear Static Beam by Jemal Peradze

“…An approximate solution is found using the Galerkin method and the Jacobi nonlinear iteration process. A theorem on the algorithm error is proved.…”
Get full text

Multiobjective Optimization Method Based on Adaptive Parameter Harmony Search Algorithm by P. Sabarinath, M. R. Thansekhar, R. Saravanan

“…The results reveal that the proposed approach is performing better than other algorithms.…”
Get full text

Improved Genetic Algorithm to Solve the Scheduling Problem of College English Courses by Jing Xu

“…Research shows that the improved genetic algorithm has improved average fitness value and time compared with traditional genetic algorithm. …”
Get full text

Traffic measurement algorithm based on least recent used and Bloom filter by Zhen ZHANG, Bin-qiang WANG, Feng-yu ZHANG, Ning-ning LIANG

“…Aiming at the naïve algorithm’s deficiency of high false negative probability,a novel scheme called LRU-BF(least recent used ＆amp;Bloom filter) was presented.In order to achieve high accuracy,the algorithm adopted mechanisms of LRU eliminating and Bloom filter representation to separate the process of heavy-hitter fliteration from the heavy-hitter recognition.Based on statistical theory,analytical expressions about upper-bound error probability were deduced.Simulated results indicate that LRU-BF can achieve space saving and lower error probabilit compared with Naïve-LRU algorithm.Meanwhile,it can also support the 10Gbit/s line-speed processing.…”
Get full text

Multipurpose zero watermarking algorithm for medical image based on SVD and SAE by Jieli SUN, Yanxia ZHAO, Zenghui ZHOU, Sheng XING

“…A multipurpose zero watermarking algorithm was proposed according to the copyright protection and tamper location of medical image.The two information matrices were executed the XOR operation with the original robust watermarking image and the original semi-fragile watermarking image separately to generate zero robust watermarking image and zero semi-fragile watermarking image.The experimental results show that effects of extracted zero watermarking image are terrific,and the algorithm can resist the common attacks,particularly its resistance is effect ive for strong attacks.…”
Get full text

Self-embedding robust digital watermarking algorithm with perfectly blind detection by Tian-yu YE

“…Those existing robust watermarking algorithms couldn’t achieve perfectly blind detection.A robust watermarking algorithm with perfectly blind detection was proposed by introducing the self-embedding idea into robust watermarking literature.At first,the original image was split into non-overlapping blocks,and each block was transformed by DCT.The feature watermark was derived from judging the numerical relationship between each block’s DC coefficient and average of DC coefficients form all blocks.After encrypted by Logistic chaos sequence,the feature watermark was self-embedded into each block by adjusting two middle or low frequency DCT coefficients.Finally,the watermarked image was obtained after IDCT.The proposed algorithm achieved perfectly blind detection by combining self-embedding the encrypted feature watermark and blindly extracting authentication watermark.Experimental results show that the proposed algorithm has strong robustness to resist various attacks such as smoothing,adding noise,JPEG compression,resampling,cropping and geometric attacks like random row removal,downward shifting and right shifting.…”
Get full text

A hybrid swarm intelligent optimization algorithm for antenna design problems by Supreet Singh, Harbinder Singh, Nitin Mittal, Gurpreet Kaur Punj, Lalit Kumar, Kinde Anlay Fante

“…However, no single algorithm can effectively solve all optimization challenges. …”
Get full text

Integrated algorithm based on vectors in node localization for wireless sensor networks by WANG Yu-feng, WANG Yan

“…An integrated algorithm based on DV-hop was designed and applied to mobile nodes. …”
Get full text

Optimal planning of optical transmission network using improved genetic algorithm by Yue SHI, song QIUXue, yong GUOShao, Feng QI

Subjects: Get full text

Key Technology of Internet of Things Middleware and Computer Event Matching Algorithm by Laicun Li, Rulin Bai

“…In order to solve the problem of complex event pattern in big data and strengthen research on key technologies of the Internet of Things and computer time matching algorithms, this paper studies the problem based on Hadoop clustering algorithm. …”
Get full text

Absolute finite differences based variable forgetting factor RLS algorithm by Slobodan Drašković, Željko Đurović, Vera Petrović

“…Most of the known non‐stationarity detection algorithms are based on residual statistics. The study proposes a novel non‐stationarity detection algorithm based on finite differences analysis of the processed signal. …”
Get full text

An Improved DR Algorithm Based on Target Extrapolating in ROIA Cloud Platform by Dong Liu

“…This paper proposes an improved DR algorithm based on target-extrapolating in a cloud platform for ROIA, elaborates the basic idea of the improved algorithm and the computational model formula, and then carries out a simulation experiment. …”
Get full text

Algorithm of video object segmentation based on region Gibbs potential function by BAO Hong-qiang, ZHANG Zhao-yang

“…A novel video motion object segmentation algorithm was proposed under spatial-temporal framework. …”
Get full text