UAV Path Planning Based on Improved A∗ and DWA Algorithms by Xiong Bai, Haikun Jiang, Junjie Cui, Kuan Lu, Pengyun Chen, Ming Zhang

“…This work proposes a path planning algorithm based on A∗ and DWA to achieve global path optimization while satisfying security and speed requirements for unmanned aerial vehicles (UAV). …”
Get full text

A Sparsity Adaptive Algorithm for Wideband Compressive Spectrum Sensing by Zhijin Zhao, Junwei Hu

“…To solve the problem, a sparsity adaptive algorithm for wideband spectrum sensing was proposed. …”
Get full text

A Global Optimization Algorithm for Signomial Geometric Programming Problem by Xue-Ping Hou, Pei-Ping Shen, Yong-Qiang Chen

“…This paper presents a global optimization algorithm for solving the signomial geometric programming (SGP) problem. …”
Get full text

An Adaptive Parallel Arithmetic Optimization Algorithm for Robot Path Planning by Ruo-Bin Wang, Wei-Feng Wang, Lin Xu, Jeng-Shyang Pan, Shu-Chuan Chu

“…Comparisons with other popular algorithms on 18 benchmark functions are committed. …”
Get full text

An Entropy-Based Multiobjective Evolutionary Algorithm with an Enhanced Elite Mechanism by Yufang Qin, Junzhong Ji, Chunnian Liu

“…Multi-objective evolutionary algorithm (MOEA) has proved to be one of the most efficient algorithms solving the multi-objective optimization. …”
Get full text

Noisy voice detection algorithm based on feature stream fusion by Hua LONG, Mingliang YANG, Yubin SHAO

“…Aiming at the problem that the initial detection performance of voice segment was poor,and the voice continuity structure was damaged in voice communication,a noisy voice detection algorithm based on feature stream fusion was proposed.Firstly,the time domain feature stream,the spectral pattern feature stream and the statistical feature stream were extracted according to the voice characteristics.Secondly,the voice segment in the noisy audio was estimated by different voice feature streams.Finally,the voice prediction probability obtained by each feature stream was weighted and fused,and the voice estimation probability was processed in short time by the hidden Markov model.The performance test of composite voice database under the condition of multi-type noise and different signal-to-noise ratio shows that compared with the baseline model based on Bayesian and DNN classifier,the voice detection accuracy of the proposed algorithm is improved by 21.26% and 11.01% respectively,and the quality of target voice is significantly improved.…”
Get full text

SSCANL decoder based joint iterative detection and decoding algorithm by Chongyang LIU, Rui GUO

“…In order to improve the receiver performance of the sparse code multiple access (SCMA) system based on polar codes, the cyclic redundancy check (CRC) aided joint iterative detection and decoding receiver scheme based on simplify soft cancellation list (SSCANL) decoder (C-JIDD-SSCANL) was proposed.A polar code decoder in the C-JIDD-SSCANL receiver used the SSCANL algorithm.In this algorithm, decoding node deletion technology was used to simplify L times of soft cancellation (SCAN) decoding required by soft cancellation list (SCANL) algorithm by deleting frozen bit nodes, then the computational process of soft information update between nodes was simplified, and the computational complexity of decoding algorithm was reduced.The simulation results show that the SSCANL algorithm can obtain the same performance as the SCANL algorithm, and its computational complexity is reduced compared with the SCANL algorithm.Compared with the joint iterative detection and decoding scheme based on SCAN decoder (JIDD-SCAN) and the CRC aided joint iterative detection and decoding scheme based on SCAN decoder (C-JIDD-SCAN), the performance of C-JIDD-SSCANL receiver scheme based on SSCANL decoder is improved by about 0.65 dB and 0.59 dB respectively when the bit error rate is 10^-4.…”
Get full text

Model and Algorithm for Dependent Activity Schedule Optimization Combining with BIM by Guofeng Ma, Xiaoye Liu

“…Then, the overlap and communication strategies are decided by calculating the maximum revenue using Monte Carlo simulation and MATLAB based on overlap cost, communication cost, rework cost, and reward amount. Finally, the algorithm and BIM are combined to provide a visual overlap plan and dynamic control platform framework. …”
Get full text

Multimodal Adaptive Identity-Recognition Algorithm Fused with Gait Perception by Changjie Wang, Zhihua Li, Benjamin Sarpong

“…Experimental results show that the proposed algorithms perform well in recognition accuracy, the confusion matrix, and the kappa statistic, and they have better recognition scores and robustness than the compared algorithms; thus, the proposed algorithm has prominent promise in practice.…”
Get full text

Distance-based target tracking algorithm in binary sensor network by SUN Xiao-yan1, LI Jian-dong1, HUANG Peng-yu1, ZHANG Wen-zhu1

“…A distance-based target tracking algorithm for binary sensor network was proposed.This algorithm can decide the output bit information and compute the weighting simultaneously.The simulation is used to validate the effectiveness of distance-based weighting scheme.This algorithm has good performance,when the target moves linearly,curvilinear,or randomly through the sensing field,and the error distribution of single target position is in .…”
Get full text

Routing framework and creation algorithm in Ad Hoc based SDN by Fang DONG, Yuxiang HU, Ou LI

“…Node energy-limited and mobility,indeed,requirement of customized service,made Ad Hoc press for customization Routing.Based on the core principle of software defined networking (SDN),the control framework and the design of routing creation bran-new approach about Ad Hoc based SDN was analyzed firstly.Secondly,the hierarchical routing model was established,and the problem of routing key nodes and key link centralized selection based on service path was proposed and its algorithm was designed,which could embed customize service into physical networks via nodes mapping based network performance maximization.Finally,it corroborate the advantage of routing implement via SDN in function,performance and the whole networks utilization.Experiments show that the energy consumption of network nodes is more balanced and the overall utilization of the network is nearly 14% higher than the traditional method.…”
Get full text

Adaptive algorithms for change point detection in financial time series by Alexander Musaev, Dmitry Grigoriev, Maxim Kolosov

“…Our study presents comparative analyses of existing early detection techniques and introduces advanced algorithms tailored to non-stationary environments, including online and offline segmentation strategies. …”
Get full text

M-elite coevolutionary kinetic-molecular theory optimization algorithm by Chao-dong FAN, Jing ZHANG, Ling-zhi YI

Subjects: “…optimization algorithm…”
Get full text

Sensitivity analysis of the channel estimation deviation to the MAP decoding algorithm by WAN Ke, FAN Ping-zhi

“…As a necessary input parameter for MAP decoding algorithm,SNR was normally obtained from the channel estimation unit.Corresponding research indicated that SNR estimation deviation degraded significantly the performance of Turbo decoding.MAP decoding algorithm with SNR estimation deviation was investigated in details,and the degradation mechanism of Turbo decoding was explained analytically.The theoretical analysis and computer simulation have disclosed the specific reasons for the performance degradation when SNR estimation is less than the actual value,and for the higher sensitivity of SNR estimation to long frame Turbo codes.…”
Get full text

Neural network recognition algorithm of breath sounds based on SVM by Gou-dong LIU, Jing XU

“…A SVM neural network (support vector machines) for breath sounds recognition algorithm was advanced,breath sounds feature obtained through wavelet analysis were input into neural networks and carried on the training to the training samples as a feature of SVM method input in order to classify the test samples.Three States (normal,mild and severe lesions) of breath sounds were recognized,and K nearest neighbor (KNN) methods are compared .The results show that SVM method has a higher recognition accuracy and can be used to recognize different breath sounds,which settled the local extremum problem that cannot be avoided in the neural network method and provide an effective algorithm for information processing in body area network technology.…”
Get full text

Trust chain generating and updating algorithm for dual redundancy system by Lei WANG, Ming-hua YANG, Zeng-liang LIU, Jian-qun ZHENG

“…In trusted computing field,the traditional construction mode of trust chain is only applicable to a single system.For the dual redundancy system,it causes break of transitive trust.A trust model suitable for dual redundancy system was proposed.Through double trust chain design and IMC/IMV interaction mechanism,the trust chain extension of trust from a computing unit to another unit was realized.On this basis,a trust chain generating and update algorithm for dual redundancy system was proposed.Finally,the validity of the proposed model was proved based on the trusting theory.…”
Get full text

High resolution ISAR imaging algorithm based on compressive sensing by Shao-dong LI, Jun YANG, Xiao-yan MA

“…According to the problem that conventional imaging algorithms have some unavoidable shortcomings such as low resolution of image and being fragile to the noise with short coherent processing interval (CPI),an improved ISAR imaging algorithm via CS method,namely,PH-SL0 algorithm,was proposed.In the proposed algorithm,as a kind of measure matrix,partial randomizer Hadamard matrix (PH) has many advantages such as high reconstruction precision and low dimension of measure matrix.Meanwhile,as a reconstruction algorithm,SL0 has many advantages such as demanding fewer measurements than existing methods,having higher reconstructed accuracy and better robust.Therefore,making use of the advantages of PH and SL0,and extending them to the field of radar,the azimuth imaging with short imaging data could be implemented.Finally,simulation results and experimental results of real data show that the algorithm has higher imaging resolution and better robust to noise.…”
Get full text

An Entropy Optimizing RAS-Equivalent Algorithm for Iterative Matrix Balancing by Chlebus, Edward, Kasapu, Viswatej

“…We have developed a new simple iterative algorithm to determine entries of a normalized matrix given its marginal probabilities. …”
Get full text

CMDC:an iterative algorithm for complementary multi-view document clustering by Ruizhang HUANG, Ruina BAI, Yanping CHEN, Yongbin QIN, Xinyu CHENG, Youliang TIAN

“…In response to the problems traditional multi-view document clustering methods separate the multi-view document representation from the clustering process and ignore the complementary characteristics of multi-view document clustering,an iterative algorithm for complementary multi-view document clustering——CMDC was proposed,in which the multi-view document clustering process and the multi-view feature adjustment were conducted in a mutually unified manner.In CMDC algorithm,complementary text documents were selected from the clustering results to aid adjusting the contribution of view features via learning a local measurement metric of each document view.The complementary text document of the results among the dimensionality clusters was selected by CMDC,and used to promote the feature tuning of the clusters.The partition consistency of the multi-dimensional document clustering was solved by the measure consistency of the dimensions.Experimental results show that CMDC effectively improves multi-dimensional clustering performance.…”
Get full text

Actor-critic algorithm with incremental dual natural policy gradient by Peng ZHANG, Quan LIU, Shan ZHONG, Jian-wei ZHAI, Wei-sheng QIAN

“…The existed algorithms for continuous action space failed to consider the way of selecting optimal action and utilizing the knowledge of the action space,so an efficient actor-critic algorithm was proposed by improving the natural gradient.The objective of the proposed algorithm was to maximize the expected return.Upper and the lower bounds of the action range were weighted to obtain the optimal action.The two bounds were approximated by linear function.Afterward,the problem of obtaining the optimal action was transferred to the learning of double policy parameter vectors.To speed the learning,the incremental Fisher information matrix and the eligibilities of both bounds were designed.At three reinforcement learning problems,compared with other representative methods with continuous action space,the simulation results show that the proposed algorithm has the advantages of rapid convergence rate and high convergence stability.…”
Get full text