Predictive channel scheduling algorithm between macro base station and micro base station group by Yinghai XIE, Ruohe YAO, Bin WU

“…A novel predictive channel scheduling algorithm was proposed for non-real-time traffic transmission between macro-base stations and micro-base stations in 5G ultra-cellular networks.First,based on the stochastic stationary process characteristics of wireless channels between stationary communication agents,a discrete channel state probability space was established for the scheduling process from the perspective of classical probability theory,and the event domain was segmented.Then,the efficient scheduling of multi-user,multi-non-real-time services was realized by probability numerical calculation of each event domain.The theoretical analysis and simulation results show that the algorithm has low computational complexity.Compared with other classical scheduling algorithms,the new algorithm can optimize traffic transmission in a longer time dimension,approximate the maximum signal-to-noise ratio algorithm in throughput performance,and increase system throughput by about 14% under heavy load.At the same time,the new algorithm is accurate.Quantitative computation achieves a self-adaption match between the expected traffic rate and the actual scheduling rate.…”
Get full text

Energy efficient relay node fast selection algorithm for multi-hop wireless sensor networks by ZHENG Guo-qiang1, LI Jian-dong1, LI Hong-yan1, ZHOU Zhi-li4

“…Aiming at the inefficiency of the relay selection of data gathering protocol for multi-hop wireless sensor networks（WSN）,an energy efficient relay node fast selection（EERNFS） algorithm was proposed.In EERNFS,time-sharing channel was adopted to maintain time synchronization of WSN and periodically update the information of the neighbor network node.The network nodes could be activated synchronously in any network listening/sleeping cycle according to a certain probability,thus the real-time consistency and the stability of the nodes’ connectivity degree in WSN were guaranteed.Based on the geographic priority,the value of the nodes and the distribution estimation of the route-link quality,the relay node was selected through the competition method and the competing between the candidate relay nodes was reduced through gradually multiplying time window method.Theoretical analysis and simulation results show that EERNFS outperforms FFS（forwarder fast selection） and GeRaF in terms of energy efficiency,delay of data delivery,and data delivery rate so that the network lifetime is greatly prolonged.…”
Get full text

Metaheuristic algorithm for parametric optimization of liquid nitrogen pumping in hydrocarbon and allied fluids piping systems by S. Isaac, C. Kadurumba, H. Ugwu, F. Abam

“…Since the models are multiparametric, multi-objective genetic algorithms were utilized to provide global optimal solution sets for the models. …”
Get full text

Usefulness of a personalized algorithm‐based discharge checklist in patients hospitalized for acute heart failure by Florent Allain, Virginie Loizeau, Laure Chaufourier, Maya Hallouche, Laurence Herrou, Amir Hodzic, Katrien Blanchart, Annette Belin, Alain Manrique, Paul Milliez, Rémi Sabatier, Damien Legallois

“…Methods and results We designed an algorithm to generate PCL, based on 2016 HF European Society of Cardiology Guidelines and the screening of common comorbidities in elderly HF patients. …”
Get full text

A low complexity detection algorithm for large scale multiuser MIMO based on message passing by Qiong WANG, Wei YE, Mingming JI

“…According to the problem of high complexity of base station detection in large scale multiuser multiple input multiple output (MIMO) system,a low complexity multiuser variable node full information Gaussian message passing iterative detection algorithm based on forced convergence (VFI-GMPID-FC) was proposed.Firstly,the traditional Gaussian message passing iterative detection (GMPID) algorithm was improved to obtain VFI-GMPID algorithm,the detection performance of the VFI-GMPID algorithm approximates the minimum mean square error detection (MMSE) algorithm,but the complexity was considerably less than the MMSE algorithm.Then,the VFI-GMPID-FC algorithm was proposed to reduce the complexity of the algorithm and improve the detection efficiency.Finally,the simulation results show that the proposed algorithm can effectively reduce the algorithm complexity while ensuring the detection performance.…”
Get full text

Multi-agent reinforcement learning based dynamic optimization algorithm of CRE offset for heterogeneous networks by Cheng ZHANG, Jiaye ZHU, Zening LIU, Yongming HUANG

Subjects: “…value decomposition network algorithm…”
Get full text

Optimization of S-N curve fitting based on neighborhood rough set reduction with improved firefly algorithm by Yangjinyu Li, Li Zou, Zhengjie Zhu

Subjects: Get full text

A Finger Vein Recognition Algorithm Based on the Histogram of Variable Curvature Directional Binary Statistics by Min Li, Xue Jiang, Honghao Zhu, Fei Liu, Huabin Wang, Liang Tao, Shijun Liu

“…Extensive experiments were conducted on four widely utilized vein databases, and the results indicate that the proposed algorithm, compared with solely extraction of structural features, achieved higher recognition rates and lower equal error rates.…”
Get full text

Evaluation on the Quasi‐Realistic Ionospheric Prediction Using an Ensemble Kalman Filter Data Assimilation Algorithm by Jianhui He, Xinan Yue, Huijun Le, Zhipeng Ren, Weixing Wan

“…Abstract In this work, we evaluated the quasi‐realistic ionosphere forecasting capability by an ensemble Kalman filter (EnKF) ionosphere and thermosphere data assimilation algorithm. The National Center for Atmospheric Research Thermosphere Ionosphere Electrodynamics General Circulation Model is used as the background model in the system. …”
Get full text

The Promotion Effect of Computer-Aided Technology Combined with RBF Neural Network Algorithm on Art Design by Chunliang Pan, Yuning Pan

“…In order to improve the effect of fractal art pattern design, this study combines RBF neural network algorithm to design and evaluate CAD fractal art pattern to improve the effect of fractal art pattern design. …”
Get full text

A Fast Fully Parallel Ant Colony Optimization Algorithm Based on CUDA for Solving TSP by Zhi Zeng, Yuxing Cai, Kwok L. Chung, Hui Lin, Jinwei Wu

“…Furthermore, our algorithm outperforms the other two algorithms in the speed-up ratio and less runtime, proving that the proposed FP-ACO is more suitable for solving TSP.…”
Get full text

A Novel Scheduling Algorithm Based on Game Theory and Multicriteria Decision Making in LTE Network by Mohammad Nour Hindia, Ahmed Wasif Reza, Kamarul Ariffin Noordin

“…However, 3GPP is not a standardized scheduling algorithm to utilize LTE properties in smart grid applications. …”
Get full text

Optimized Flood Control Scheduling of Goupitan Reservoir Based on Dynamic Programming and Grey Wolf Algorithm by FENG Huan, SU Huaying, LIU Chenliang, LIU Haili, LUO Zhimin

Subjects: Get full text

Bayesian network structure learning by dynamic programming algorithm based on node block sequence constraints by Chuchao He, Ruohai Di, Bo Li, Evgeny Neretin

“…Therefore, this study proposes a DP algorithm based on node block sequence constraints. …”
Get full text

Classification of Myopathy and Amyotrophic Lateral Sclerosis Electromyograms Using Bat Algorithm and Deep Neural Networks by A. Bakiya, A. Anitha, T. Sridevi, K. Kamalanand

“…The selection of substantial characteristics from time and time-frequency features was performed using bat algorithm. Extensively, deep neural network classifier is modelled for selected feature subset using bat algorithm from extracted time and time-frequency features. …”
Get full text

Look-up table predistorter based on non-iterative algorithm and indirect learning architecture for TWTA by WANG Yong1, XIANG Xin1, 2

“…Non-iterative method for capturing parameters of the predistorter was realized by the means of linear increasing periodic training sequence and distortion estimation algorithm. Compared with the conven-tional predistorter based on LUT, the proposed predistorter could process distortion data offline without minimum cost function to update the LUT, which lowers the processing requirement of the predistortion system and avoids convergence problem of adaptive algorithm. …”
Get full text

Location privacy protection method based on lightweight K-anonymity incremental nearest neighbor algorithm by Saite CHEN, Weihai LI, Yuanzhi YAO, Nenghai YU

“…The use of location-based service brings convenience to people’s daily lives, but it also raises concerns about users’ location privacy.In the k-nearest neighbor query problem, constructing K-anonymizing spatial regions is a method used to protects users’ location privacy, but it results in a large waste of communication overhead.The SpaceTwist scheme is an alternative method that uses an anchor point instead of the real location to complete the k-nearest neighbor query,which is simple to implement and has less waste of communication overhead.However,it cannot guarantee K-anonymous security, and the specific selection method of the anchor point is not provided.To address these shortcomings in SpaceTwist, some schemes calculate the user’s K-anonymity group by introducing a trusted anonymous server or using the way of user collaboration, and then enhance the end condition of the query algorithm to achieve K-anonymity security.Other schemes propose the anchor point optimization method based on the approximate distribution of interest points, which can further reduce the average communication overhead.A lightweight K-anonymity incremental nearest neighbor (LKINN) location privacy protection algorithm was proposed to improve SpaceTwist.LKINN used convex hull mathematical tool to calculate the key points of K-anonymity group, and proposed an anchor selection method based on it, achieving K-anonymity security with low computational and communication costs.LKINN was based on a hybrid location privacy protection architecture, making only semi-trusted security assumptions for all members of the system, which had lax security assumptions compared to some existing research schemes.Simulation results show that LKINN can prevent semi-trusted users from stealing the location privacy of normal users and has smaller query response time and communication overhead compare to some existing schemes.…”
Get full text

PSiamRML: Target Recognition and Matching Integrated Localization Algorithm Based on Pseudo-Siamese Network by Jiwei Fan, Xiaogang Yang, Ruitao Lu, Xueli Xie, Siyu Wang

“…Thus, visual positioning algorithms based on computer vision have been proposed in recent years and these algorithms have produced good results. …”
Get full text

LGP-SA：Graph partition algorithm based on simulated annealing in large-scale graph processing by Jinfeng XU, Yihong DONG, Shiyi WANG, Xianmang HE, Huahui CHEN

“…PageRank algorithm was also used to verify the effectiveness and feasibility of this method.…”
Get full text

Optimization of Wind Turbine Airfoil Using Nondominated Sorting Genetic Algorithm and Pareto Optimal Front by Ziaul Huque, Ghizlane Zemmouri, Donald Harby, Raghava Kommalapati

“…Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) was used to determine the Pareto optimal set based on the response surfaces. …”
Get full text