Communication community detection algorithm based on ranking of strength by Hong-quan WEI, Hong-chang CHEN, Li-xiong LIU, Ju-long LAN

“…According to the characteristics of how to effectively describe real weighted network of the current telecom network problems,improvement and development of related models of complex networks,especially for communication community detection results hierarchy was not clear and the problem of high complexity,from the analysis of the characteristics of complex network,a new algorithm for community detection design communication.The algorithm to achieve effective communication strength ranking method based on community detection in communication,communication density distribution of generating high resolution based on hierarchical nesting tree,the distance vector pruning nested tree,the level of analysis and structure of community stability and reduce the computational complexity.The algorithm is verified using real network data.…”
Get full text

Lightweight security architecture design for wireless sensor network by Chao WANG, Guang-yue HU, Huan-guo ZHANG

“…Most previous security proposal did not consider key management or their authentication efficiency was very low.Lightweight security architecture and lightweight security algorithm were proposed for wireless sensor network,The problem of network encounters malicious nodes maybe occur in the procedure of backbone networks networking could be solved by threshold secret sharing mechanism.The lightweight ECC was proposed to optimize the CPK architecture based on normal ECC,authentication was efficient without the third-party CA,and could reduce the computational complexity,the key management could meet the resource limit in wireless sensor network,and the key security depended on the exponential computation complexity of the elliptic discrete logarithm decomposition.The scheme used the improved two-way authentication to ensure the communication security between common node and sink node,which could prevent man-in-the-middle attack.…”
Get full text

Multi-label feature selection algorithm based on joint mutual information of max-relevance and min-redundancy by Li ZHANG, Cong WANG

“…Feature selection has played an important role in machine learning and artificial intelligence in the past decades.Many existing feature selection algorithm have chosen some redundant and irrelevant features,which is leading to overestimation of some features.Moreover,more features will significantly slow down the speed of machine learning and lead to classification over-fitting.Therefore,a new nonlinear feature selection algorithm based on forward search was proposed.The algorithm used the theory of mutual information and mutual information to find the optimal subset associated with multi-task labels and reduced the computational complexity.Compared with the experimental results of nine datasets and four different classifiers in UCI,the proposed algorithm is superior to the feature set selected by the original feature set and other feature selection algorithms.…”
Get full text

Declarative Programming with Temporal Constraints, in the Language CG by Lorina Negreanu

“…Hence, we explore the computational complexity of our query satisfaction problem. …”
Get full text

Low-complexity massive MIMO channel estimation for mmWave systems via matrix completion by Jiafeng QIU

“…Due to the high computational complexity of mmWave massive MIMO systems realizing reliable channel estimation,a low-complexity mmWave beamspace channel estimation algorithm was proposed utilizing the inherent low-rank of the mmWave channel.The proposed algorithm jointly exploited the channel sparsity in the beamspace domain and its low-rank property in the antenna domain to provide more accurate recovery,especially for shorter training intervals.By regarding the channel estimation as matrix completion problem,the proposed algorithm was based on the alternating direction method of multipliers with fast convergence properties and exploited fast randomized singular value thresholding to significantly reduce the corresponding complexity.The simulation result shows that the proposed algorithm can achieve satisfactory channel estimation performance while maintaining low complexity.…”
Get full text

New EM parameter estimation algorithm for a type of micro-motion SFM signal by Yong-yan JIANG, Shi-yuan ZHANG

“…Aiming at the problem that the existing method has high computational complexity and high SNR,a novel method of multi-component SFM signals parameter estimation based on EM algorithm was proposed as to spinning tar-get's narrow band micro-motion echoes.The echo model of spinning target and its micro-doppler measurements based on time-frequency analysis were given.The iterative parameter estimation steps based on Gaussian mixture model and EM algorithm to measurements were established.The simulation results demonstrate that when SNR is greater than -3 dB and the SFM components are equal or greater than 2，the method can estimate the target’s micro-motion parameters e.g.projection size accurately in narrow band condition.…”
Get full text

UAV Intelligent Control Based on Machine Vision and Multiagent Decision-Making by Zishan Huang

“…Moreover, this paper adds scale information on the basis of the LSD algorithm, uses the multiline segment standard to merge these candidate line segments for intelligent recognition, and uses the LSD detection algorithm to improve the operating efficiency of the UAV control system and reduce the computational complexity. In addition, this paper combines machine vision technology and multiagent decision-making technology for UAV intelligent control and builds an intelligent control system, which uses intelligent machine vision technology for recognition and multiagent decision-making technology for motion control. …”
Get full text

Adaptive Prediction of Channels with Sparse Features in OFDM Systems by Changwei Lv, Shujuan Hou, Wenbo Mei

“…We also compare the proposed prediction method with the classical frequency domain method realized at each OFDM subcarrier and demonstrate that our method increases the prediction accuracy and reduces the computational complexity. Simulations on the physical channel model verify the performance of the proposed method.…”
Get full text

Related-key impossible boomerang cryptanalysis on TWINE by Min XIE, Feng TIAN, Jiaqi LI

“…In order to evaluate the security of the lightweight block cipher TWINE,the method of related-key impossible boomerang cryptanalysis was applied and a related-key impossible boomerang distinguisher consisting of 16-round and 17-round paths was constructed.Based on this new distinguisher,an attack on 23-round TWINE was mounted successfully by concatenating 4-round to the beginning and 2-round for the 17-round path and 3-round for the 16-round path to the end respectively.The attack on 23-round TWINE required data complexity of only 2 <sup>62.05</sup>plaintexts and computational complexity of about 2 <sup>70.49</sup>23-round encryptions.Compared with published cryptanalysis results,the proposed attack has obvious advantages.…”
Get full text

Spammer detection technology of social network based on graph convolution network by Qiang QU, Hongtao YU, Ruiyang HUANG

“…In social networks,Spammer send advertisements that are useless to recipients without the recipient's permission,seriously threatening the information security of normal users and the credit system of social networking sites.In order to solve problems of extracting the shallow features and high computational complexity for the existing Spammer detection methods of social networks,a Spammer detection technology based on graph convolutional network(GCN) was proposed.Based on the network structure information,the method introduces the network representation learning algorithm to extract the network local structure feature,and combines the GCN algorithm under the re-regularization technology condition to obtain the network global structure feature to achieve the goal of detecting Spammer.Experiments are done on social network data of Tagged.com.The results show that this method has high accuracy and efficiency.…”
Get full text

Neuroevolutionary reinforcing learning of neural networks by Y. A. Bury, D. I. Samal

“…The last two are used as the primary method for reducing the dimension of the input signal of the system and simplifying the process of its training in terms of computational complexity.In the presented work, the neural network structure of the control device of the modeled system is formed in the course of the evolutionary process, taking into account the currently known structural and developmental features of self-learning systems that take place in living nature. …”
Get full text

Low-complexity and frequency-offset-robust synchronization algorithm based on CAZAC sequence by Fengkui GONG, Ni WEN, Guo LI, Yang GAO

“…A low-complexity and frequency-offset-robust synchronization algorithm based on CAZAC sequence was proposed, which was suitable for burst OFDM systems.A new preamble sequence was constructed based on the CAZAC sequence, and its simplified timing metric function was derived by using the combination characteristics of the sequence, and then the delay correlation and symmetric correlation characteristics were used to achieve accurate and stable timing synchronization.Furthermore, based on the new constructed preamble sequence, a weighted frequency synchronization scheme combining cyclic prefix was proposed to obtain more accurate frequency offset estimation.Simulation results show that the proposed algorithm has good synchronization performance in both Gaussian channels and multipath fading channels regardless of frequency offset, and its computational complexity is lower than the most existing representative algorithms.…”
Get full text

Computing Coherence Vectors and Correlation Matrices with Application to Quantum Discord Quantification by Jonas Maziero

“…Notwithstanding, as we demonstrate in this paper, some algebraic manipulations before programming can reduce considerably their computational complexity. Besides, we provide Fortran code to generate generalized Gell-Mann matrices and to compute the optimized and unoptimized versions of associated Bloch’s vectors and correlation matrix in the case of bipartite quantum systems. …”
Get full text

Complexity control method of random forest based HEVC by Peng WEN, Zongju PENG, Fen CHEN, Gangyi JIANG, Mei YU

“…High efficiency video coding (HEVC) has high computational complexity,and fast algorithm cannot perform video coding under restricted coding time.Therefore,a complexity control method of HEVC based on random forest was proposed.Firstly,three random forest classifiers with different prediction accuracy were trained to provide various coding configurations for coding tree unit (CTU).Then,an average depth-complexity model was built to allocate CTU complexity.Finally,the CTU coding configuration,determined by the smoothness,average depth,bit,and CTU-level accumulated coding error,was used to complete complexity control.The experimental results show that the proposed method has better complexity control precision,and outperforms the state-of-the-art method in terms of video quality.…”
Get full text

Application oriented cross-layer multi-channel MAC protocol for VANET by Cai-xia SONG, Guo-zhen TAN, Nan DING, Jun-ling BU, Fu-xin ZHANG, Ming-jian LIU

“…An application oriented cross-layer multi-channel(AOCM)MAC protocol was proposed for VANET.The AOCM protocol could derive the optimal control channel(CCH)interval to ensure the timely and reliable transmission of safety messages on the CCH,based on real-time statistics and prediction for different types of sages coming from upper application layer.In the service channels(SCH),the proposed protocol relies on a reservation mechanism for con-tention-free transmission,so as to improve the throughput of SCH.The proposed protocol was suitable for both saturation and unsaturation conditions,and has low computational complexity and high scalability.Extensive simulation results demonstrate the superiority of the AOCM protocol compared with other existing protocols.…”
Get full text

Radar marine maneuvering target detection via high resolution sparse fractional ambiguity function by Xiaohan YU, Xiaolong CHEN, Jian GUAN, Yong HUANG

“…To solve the problem of fast detection of high maneuvering targets in complex ocean background,a radar target detection algorithm via sparse fractional ambiguity function (SFRAF) was proposed.The sparse Fourier transform (SFT) was introduced after instantaneous autocorrelation function calculation,which combines the advantages of SFT and fractional ambiguity function (FRAF).Therefore,SFRAF has good processing performance on high maneuvering signals and can achieve lower computational complexity.The simulation experiments and the measured data processing results show that compared with classical detection method,the detection performance of maneuvering target can be significantly improved,and compared with FRAF,the proposed method can achieve higher detection efficiency.…”
Get full text

Link quality prediction model based on Gaussian process regression by Jian SHU, Manlan LIU, Yaqing SHANG, Yubin CHEN, Linlan LIU

“…Link quality is an important factor of reliable communication and the foundation of upper protocol design for wireless sensor network.Based on this,a link quality prediction model based on Gaussian process regression was proposed.It employed grey correlation algorithm to analyze correlation between link quality parameters and packet receive rate.The mean of the link quality indication and the mean of the signal-to-noise were selected as input parameters so as to reduce the computational complexity.The above parameters and packet receive rate were taken to build Gaussian process regression model with combination of covariance function,so that link quality could be predicted.In the stable and unstable scenarios,the experimental results show that the proposed model has better prediction accuracy than the one of dynamic Bayesian network prediction model.…”
Get full text

Intercarrier interference cancellation based on iterative detection algorithm for OFDM systems over time-varying channels by WANG Xia, ZHU Shi-hua

“…In order to effectically cancel the intercarrier interference（ICI） in the OFDM（orthogonal frequency-division multiplexing） systems,a novel iterative detection algorithm was proposed based on parallel interference cancellation.With the principle of maximize the minimum signal-to-interference and noise power ratio,the received signal was proc-essed by decision,reconstruction and ICI cancellation,iterative algorithm based on ICI cancellation was set up,the flow chart on signal detection was given.On the basis of analysis on time-varying channel,the influence of the normalized Doppler frequency offset on the system performance was investigated.Computer simulation results were presented.Simulation results show that the proposed scheme can improve the system performance significantly by using of the time diversity of time varying channel.The computational complexity can be reduced form O（N 3） toO（N）.…”
Get full text

Power allocation under per-antenna power constraints in multiuser MIMO systems by Sheng-qian HAN, Chen-yang YANG

“…A low-complexity power allocation algorithm was investigated under per-antenna power constraints(PAPC)in multiuser multiple-input multiple-output (MIMO) systems.It was shown that the optimal power allocation subject to PAPC,aimed at maximizing the sum rate of multiple users with zero forcing (ZF) precoders,had the structure of water-filling with multiple water-levels.Based on this result,the equivalence between PAPC and weighted sum power constraints was proved and a low-complexity suboptimal power allocation method was then proposed.Simulation results show that the proposed method outperforms the existing equal power allocation method and the heuristic method,and it can efficiently reduce the computational complexity with a negligible performance loss compared with the optimal power allocation method.…”
Get full text

Channel impulse response insensitive feature for non-coherent signal detection in molecular communication by Limin XIAO, Xiangrong XU, Zhuangkun WEI, Shenghan LIU, Yiwen LIU

“…To solve the inter-symbol interference (ISI) and background noise challenges of molecular communication via diffusion (MCvD),four ISI-resistant signal-features were deployed,and a reliable non-coherent signal detection algorithm,which was insensitive to different types of molecular channel impulse response (CIR),was proposed.Also,an adaptive decision threshold and theoretical bound of bit error rate (BER) were deduced.Simulation results demonstrate a lower BER of the proposed non-coherent scheme compared to the state-of-the-art schemes in the same order of computational complexity,therefore suggesting its potential applications for future nano-scale MC.…”
Get full text