App-DDoS detection method using partial binary tree based SVM algorithm by Bin ZHANG, Zihao LIU, Shuqin DONG, Lixun LI

Get full text

Conformal Array Pattern Synthesis and Activated Elements Selection Strategy Based on PSOGSA Algorithm by Bin Sun, Chunheng Liu, Yang Liu, Xiaofang Wu, Yongzhen Li, Xuesong Wang

“…The pattern synthesis and activated element selection for conformal array is investigated based on hybrid particle swarm optimization-gravitational search algorithm (PSOGSA) in this paper. With the introduction of PSOGSA algorithm which is a novel hybrid optimization technique, the element excitations are optimized to obtain the desired pattern for conformal array in the case of considering uncoupled and coupled element pattern. …”
Get full text

Obtaining Thickness Maps of Corneal Layers Using the Optimal Algorithm for Intracorneal Layer Segmentation by Hossein Rabbani, Rahele Kafieh, Mahdi Kazemian Jahromi, Sahar Jorjandi, Alireza Mehri Dehnavi, Fedra Hajizadeh, Alireza Peyman

Get full text

Enhancing the Process of AES: A Lightweight Cryptography Algorithm AES for Ad-hoc Environments by Alharith A. Abdullah, Çağatay Aydin, Oğuz Ata, Mustafa Alhandhal

“…Therefore, an AES lightweight algorithm is proposed, which is one of the complicated encryption algorithms. …”
Get full text

Reference frame list optimization algorithm in video coding by quality enhancement of the nearest picture by Junyan HUO, Ruipeng QIU, Yanzhuo MA, Fuzheng YANG

“…Interframe prediction is a key module in video coding, which uses the samples in the reference frames to predict those in the current picture, thus helps to represent the complex video by transmitting a small amount of the prediction residual.In lossy video coding, the qualities of reference frames are affected by the quantization distortion, which lead to poor prediction accuracy and performance degradation.Targeted at the low latency video services, a reference frame list optimization algorithm was proposed, which enhanced the quality of the nearest reference frame by a deep learning-based convolutional neural network, and integrated the enhanced reference frame into the reference frame list to improve the accuracy of interframe prediction.Compared with H.265/HEVC reference software HM16.22, the proposed algorithm provides BD-rate savings of 9.06%, 14.92% and 13.19% for Y, Cb and Cr components, respectively.…”
Get full text

CAR:a P2P content addressable andauto-retrievable algorithm for MANET by WU Hua-feng1, SHI Chao-jian1, GAO Chuan-shan2

“…To be directed at the unique features of mobile ad-hoc network（MANET） environment,a kind of mobile P2P（MP2P） index structure.Geographic-information-based hierarchical hash index structure（GH2I）,was presented based on DHT（Distributed Hash Table）.On the basis of GH2I,a MP2P resource search and retrieval algorithm CAR（content ad-dressable and auto-retrievable） was further proposed,and a scalable efficient and mobility adaptive MP2P overlay net-work was finally constructed.…”
Get full text

A Dynamic and Energy-Efficient Clustering Algorithm in Large-Scale Mobile Sensor Networks by Changlin Ma, Nian Liu, Yuan Ruan

“…In this paper, a new clustering algorithm based on residual energy difference ratio is presented to improve system performance. …”
Get full text

A wireless sensor network for coal mine safety powered by modified localization algorithm by Hafiz Zameer ul Hassan, Anyi Wang, Ghulam Mohi-ud-din

Subjects: “…DV (Distance Vector)-Hop localization algorithm…”
Get full text

Robust transmission algorithm for IRS-assisted NOMA network with hardware impairments and imperfect CSI by Qilie LIU, Jiacheng FANG, Yanan XIN, Qianbin CHEN

“…To improve the robustness and reduce the energy consumption of non-orthogonal multiple access (NOMA) networks, based on hardware impairments (HWI) of transceiver and non-perfect channel state information (CSI), an intelligent reflecting surface (IRS) assisted transmission power minimization algorithm for NOMA networks was proposed.The joint optimization problem of active beam assignment at the base station and passive beam assignment at the IRS was modeled based on HWI and non-perfect CSI.The system considered the user quality of service (QoS) constraint, the serial interference cancellation constraint and the reflection phase shift constraint of the IRS.To solve this nonconvex optimization problem, the QoS constraints were firstly transformed using linear approximation and S-Procedure methods.Then the optimization problem was decomposed into two subproblems.The active beam assignment subproblem was solved using the successive convex approximation (SCA) method.The passive beam assignment subproblem was solved using the penalized convex-concave process algorithm.Finally, the final solution was obtained by iterating the subproblems alternately using alternating optimization.The simulation results show that the proposed algorithm reduces 17.05% compared to the or thogonal multiple access robust algorithm in terms of transmitted power.In terms of system robustness, the proposed algorithm improves by 20.69% and 31.14% compared to the HWI robust algorithm and the CSI robust algorithm, respectively.…”
Get full text

Effect on the linearity improvement of TWTA by combining RF predistortion linearizer and digital predistortion algorithm by Xin HU, Gang WNAG, Zi-cheng WANG, Ji-run LUO

“…In order to keep the adaptive digital predistortion algorithms valid,usually the output power level of the TWTA must be reduced,which corresponded a reduced efficiency of the TWTA.A predistortion technique was proposed by combining RF predistortion linearizer with adaptive digital predistortion algorithm.The gain and phase change of the TWTA with a RF predistortion linearizer circuit from small-signal input drive to saturated input drive were improved,respectively.Then the adaptive digital predistortion algorithm was used for the TWTA with the RF predistortion linearizer.The good linearity improvement can be reached with the less reduction for the output power level with this method.…”
Get full text

Entropy-Regularized Iterative Weighted Shrinkage-Thresholding Algorithm (ERIWSTA) for inverse problems in imaging. by Limin Ma, Bingxue Wu, Yudong Yao, Yueyang Teng

“…The iterative shrinkage-thresholding algorithm (ISTA) is a classic optimization algorithm for solving ill-posed linear inverse problems. …”
Get full text

Evaluation of Development Index of China’s VC Industry Based on Weight Optimization Algorithm and TOPSIS by Yi Sun, Long-Long Zhou, Shan Zhu, Jin-Tao Su, Jing Zhang

“…The calculation results are obtained by subjective and objective weighting target planning algorithm, and the final score evaluated by TOPSIS model is indexed. …”
Get full text

Improving the Performance of Whale Optimization Algorithm through OpenCL-Based FPGA Accelerator by Qiangqiang Jiang, Yuanjun Guo, Zhile Yang, Zheng Wang, Dongsheng Yang, Xianyu Zhou

“…Whale optimization algorithm (WOA), known as a novel nature-inspired swarm optimization algorithm, demonstrates superiority in handling global continuous optimization problems. …”
Get full text

Task scheduling algorithm for system-wide information management based on multiple QoS constraints by Gang LI, Zhijun WU

Subjects: “…ant colony optimization task scheduling algorithm…”
Get full text

Low complexity hybrid iterative algorithm based signal detection in massive MIMO system by Shufeng ZHAO, Bin SHEN, Furong YANG

“…Among the uplink signal detection algorithms for massive MIMO systems,the minimum mean square error (MMSE) algorithm can achieve the near-optimal linear detection performance.However,conventional MMSE usually involves high complexity due to the required matrix inversion of large-size matrix,which makes it hard to implement in realistic applications.Based on joint steepest descent (SD) algorithm and Gauss-Seidel iteration,a low complexity hybrid iterative detection algorithm was proposed.The SD algorithm was employed to obtain an efficient searching direction for the following Gauss-Seidel to speed up convergence.Meanwhile,an approximated method was also proposed to compute the bit log-likelihood ratio (LLR) for soft channel decoding.Simulation results verify that the proposed algorithm can converge rapidly and achieve its performance quite close to that of the MMSE algorithm with only a small number of iterations.Meanwhile,the complexity is reduced by an order of magnitude,which is kept consistently of O(K ²).…”
Get full text

A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case by Chun-Wei Tsai, Shih-Pang Tseng, Ming-Chao Chiang, Chu-Sing Yang, Tzung-Pei Hong

“…This paper presents a simple but efficient algorithm for reducing the computation time of genetic algorithm (GA) and its variants. …”
Get full text

Schedulability Analysis for Rate Monotonic Algorithm-Shortest Job First Using UML-RT by S. Ewins Pon Pushpa, Manamalli Devasikamani

“…This paper presents a unified modeling approach for a newly proposed rate monotonic scheduling algorithm-shortest job first (RMA-SJF) for partitioned, semipartitioned and global scheduling strategies in multiprocessor architecture using UML-RT for different system loads. …”
Get full text

The eagle eye and the algorithm: Automation in oral cancer histopathological diagnosis - A symbiotic future by Ajinkya M. Pawar, Rajiv Desai

Get full text

Study on Mechanical Response and Stability Algorithm of Soft and Hard Rock Interbedded Slope Excavation by Qingyang Ren, Xin Meng

“…The verification shows that the composite sliding surface algorithm objectively reflects the destruction of the slope by bedding sliding and can reasonably evaluate the safety of soft and hard rock interbedded slope.…”
Get full text

Soft value flipping decoding algorithm for LDPC codes based on adjoint vectors sum by LIU Jian-quan1, XU You-yun1, CAI Yue-ming1

“…By analyzing the soft value distribution while belief propagation defeated, a soft value flipping decoding algo-rithm based on adjoint vectors sum was presented.With translating the error times of check equation which obtained by adjoint vectors sum into error bits distribution parameter and flipping some bit nodes soft value only once at certain itera-tion by a selection regulation, the frame error rate of the proposed algorithm for LDPC codes which have much more correlative rows can be reduced to a larger extent without complexity increase nearly（only O（N））.…”
Get full text