Feature Frequency Extraction Algorithm based on PCA and MK-MOMEDA and Its Application by Jiawei Zheng, Qihong Liu, Weiguang Li, Xuezhi Zhao, Guochen Li

“…In the algorithm，PCA is used to perform noise reduction processing on the original signal to obtain a reconstructed signal. …”
Get full text

The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model by En Wang, Yongjian Yang, Bing Jia, Tingting Guo

“…Simulation results suggest that this algorithm efficiently improves the delivery rate and reduces the average delay.…”
Get full text

Wind Speed Forecast Based on the LSTM Neural Network Optimized by the Firework Algorithm by Bilin Shao, Dan Song, Genqing Bian, Yu Zhao

“…Aiming at hyperparameter optimization in a combined forecasting method, a wind speed prediction model based on the long short-term memory (LSTM) neural network optimized by the firework algorithm (FWA) is proposed. Focusing on the real-time sudden change and dependence of wind speed data, a wind speed prediction model based on LSTM is established, and FWA is used to optimize the hyperparameters of the model so that the model can set parameters adaptively. …”
Get full text

A Deadline-Constrained Scheduling Algorithm for Intensive-Instance Serviceflows in Cloud Environment by Wei Liu, Taoshen Li, Ruwei Huang

“…The experimental results in CloudSim show that the algorithm compared with others algorithm saves the execution cost with meeting the user-defined deadline, avoids the fierce competition of cheaper services and improves the success ratio of the scheduling.…”
Get full text

A distributed adaptive local searching algorithm for wireless sensor network localization by Oscar Osvaldo Saldaña Hernández, Juan Cota-Ruiz, Rafael Gonzalez-Landaeta, Ernesto Sifuentes

“…In this article, we propose a distributed range-based localization algorithm for wireless sensor network. The algorithm is mainly based on an adaptively local circular searching area where each unknown sensor must find inside a position that minimizes the error distance with neighboring sensors using a local function. …”
Get full text

The algorithm for foggy weather target detection based on YOLOv5 in complex scenes by Zhaohui Liu, Wenshuai Hou, Wenjing Chen, Jiaxiu Chang

Get full text

TOOL WEAR STATE MONITORING BASED ON WAVELET PACKET BP＿ADABOOST ALGORITHM by ZHU Xiang, XIE Feng

“…The experimental result shows that the BP _Ada Boost algorithm can effectively diagnose the wear state of the tool in CNC machine tools compared with the SVM algorithm.…”
Get full text

Fan Blade Crack Detection Algorithm Based on Multi-Scale Feature Fusion by Yongjun Qi, Hailin Tang, Altangerel Khuder

Get full text

Optimal algorithm based on weight balancing for designing the logical topology of the optical network by FU Ming-lei, LE Zi-chun, LU Min

Subjects: Get full text

An Incremental Interesting Maximal Frequent Itemset Mining Based on FP-Growth Algorithm by Hussein A. Alsaeedi, Ahmed S. Alhegami

“…The massive volume of data creates an imminent need to design incremental algorithms for the maximal frequent itemset mining in order to handle incremental data over time. …”
Get full text

Multifeature Contrast Enhancement Algorithm for Digital Media Images Based on the Diffusion Equation by Jijun Wang, Yi Yuan, Guoxiang Li

“…Finally, the significance means a value of super pixel blocks is calculated in superpixel units, and the image is segmented into objects and backgrounds by combining with the Otsu threshold segmentation algorithm to mention the image. In this paper, the proposed algorithm experiments with several sets of Kor Kor resolution remote sensing images, respectively, and the Markov random field model and fully convolutional network (FCN) algorithm are used as the comparison algorithm. …”
Get full text

A Robust k-Means Clustering Algorithm Based on Observation Point Mechanism by Xiaoliang Zhang, Yulin He, Yi Jin, Honglian Qin, Muhammad Azhar, Joshua Zhexue Huang

“…The k-means algorithm is sensitive to the outliers. In this paper, we propose a robust two-stage k-means clustering algorithm based on the observation point mechanism, which can accurately discover the cluster centers without the disturbance of outliers. …”
Get full text

Service function chain deployment algorithm based on optimal weighted graph matching by Dan LI, Julong LAN, Peng WANG, Yuxiang HU

“…Service function chain can support flexible network service requirement by linking virtual network functions.Aiming at the problem of service function chain deployment in a resource-constrained network,an algorithm for service function chain deployment based on optimal weighted graph matching was proposed.The service function chains was composed into graphs of functional topography,and the optimal matching results between graphs of functional topology and physical topology was obtained using eigendecomposition approach,and furtherly the matching results by hill-climbing method was optimized.Simulation results show that,the proposed algorithm can reduce the required bandwidth to deploy service function chains,balance the load of nodes and bandwidth of links,and support more service requests.What is more,the algorithm has a lower computation complexity and higher time efficience.…”
Get full text

Dynamic Beam Hopping Algorithm for LEO Satellite Systems Based on User Grouping by Qing SHU, Weibiao LI, Zuolin JIN, Zhong ZHENG, Yongbo ZHANG, Zesong FEI

“…., the number of concurrently serving users is increased.To address the above problems, it proposed a dynamic beam hopping (BH) scheme based on user grouping for communication service coverage.The proposed method utilized the sparsity of the angular domain channel distribution to adaptively divide user groups accorded to the beam direction where the user energy is maximum.The number of co-channel user groups was constrained by power and interference constraints, limiting the reduction of communication traffic delay, as power limitations on the satellite make the number of RF chains limited and increased the number of simultaneously served user groups increased the interference between user groups.So the BH scheme with beam cluster grouping was further proposed, when the beam clusters reduced the user delay by increased the number of users served at the same moment.Since the above problem was non-convex, it adopt a data-driven determinantal point process (DPP) learning method to simplify the beam scheduling in BH scheme.Simulation results showed that the dynamic BH algorithm based on user grouping could effectively reduce the average user delay by more than 52% compared with the single-beam scheme, also verifies the versatility of the DPP learning.…”
Get full text

An Improved Marriage in Honey Bees Optimization Algorithm for Single Objective Unconstrained Optimization by Yuksel Celik, Erkan Ulker

“…The IMBO algorithm’s performance and its success are tested on the well-known six unconstrained test functions and compared with other metaheuristic optimization algorithms.…”
Get full text

An Algorithm That Predicts CSI to Allocate Bandwidth for Healthcare Monitoring in Hospital's Waiting Rooms by Di Lin, Fabrice Labeau

“…We analyze the reliability of the proposed algorithm by deducing the standard error of estimated CSI with this algorithm. …”
Get full text

Retracted: Mathematical Modeling Method of the Improved Genetic Algorithm for Random Power Fluctuation by International Transactions on Electrical Energy Systems

Get full text

Requirements Analysis of Data Center Network Routing Algorithm Based on SDN Architecture by Zifu Fan, Chunling Wu, Jinhong Wang

Subjects: Get full text

Resource allocation optimization algorithm based on double populations differential evolution in WSN by Xiaochen HAO, Liyuan WANG, Jinshuo LIU, Lixia XIE, Wenhuan ZHANG

“…A resource allocation algorithm was proposed for improving the network performance through jointing channel allocation,power control and timeslot allocation in multi-radio multi-channel wireless sensor network.More specifically,the network was modeled as a multi-objective optimization problem where the energy efficient,resource allocation balanced,networks capacity maximized were considered under the link interference and link conflict constraints.Due to the problem was NP-Hardness,a simple centralized algorithm——differential evolution based on double populations was used to solve the constrained multi-objective optimization problem.The simulation results show that the proposed algorithm significantly improves the network capacity and energy efficiency and guarantees the resource allocation balancing while reducing link interference and avoiding link conflict.…”
Get full text

Pilot scheduling algorithm based on cell classification-cross entropy for massive MIMO by Yinhui YU, Heng ZHOU, Ying YANG, Hao PAN, Jiapeng REN

“…Pilot scheduling problem belongs to the arrangement optimization problem, and the algorithm computational complexity of greedy algorithm to search the optimal solution is greatly. …”
Get full text