A Survey of Approximation Algorithms for the Power Cover Problem by Jiaming Zhang, Zhikang Zhang, Weidong Li

“…Consequently, minimizing the total power cost of the network while all clients are served has become a crucial research topic. …”
Get full text

Solution Algorithms for the Capacitated Location Tree Problem with Interconnections by Nidia Mendoza-Andrade, Efrain Ruiz-y-Ruiz, Suemi Rodriguez-Romo

Get full text

Robust machine-learned algorithms for efficient grid operation by Nicolas Christianson, Christopher Yeh, Tongxin Li, Mehdi Hosseini, Mahdi Torabi Rad, Azarang Golmohammadi, Adam Wierman

“…In this work, we propose a learning-augmented algorithm, RobustML, that exploits the good average-case performance of a machine-learned algorithm for minimizing dispatch and ramping costs of dispatchable generation resources while providing provable worst-case guarantees on cost. …”
Get full text

SSCM: An Unambiguous Acquisition Algorithm for CBOC Modulated Signal by Yongxin Feng, Shunchao Fei, Fang Liu, Bo Qian

Get full text

A Bat Algorithm with Mutation for UCAV Path Planning by Gaige Wang, Lihong Guo, Hong Duan, Luo Liu, Heqi Wang

“…This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. …”
Get full text

Methods and effective algorithms for solving multidimensional integral equations by A. B. Samokhin

“…Efficient solution algorithms using fast Fourier transforms are proposed for solving systems of equations obtained using a uniform grid.Conclusions. …”
Get full text

FM‐YOLOv8:Lightweight gesture recognition algorithm by Fanghai Li, Xitai Na, Jinshuo Shi, Qingbin Sun

Get full text

Comparative Analysis of Machine Learning Algorithms for Antenna Alignments by Mohammad Al Bataineh, Dana I. Abu Abdoun, Mahmoud Al Ahmad

Get full text

Research on the Raft improved algorithm for anti-Byzantine nodes by WANG Xiaowei, LI Jie

“…On the anti-Byzantine， error logs were not identified in Raft algorithm， while the error log recognition rate of AntiB-Raft algorithm can reach 100%， meanwhile the consensus delay was 28% lower than the existing algorithm RB-Raft.ConclusionsThe proposed algorithm AntiB-Raft had the capability of anti-Byzantine and reduced consensus delay compared with the existing algorithm RB-Raft and its efficiency was improved significantly.…”
Get full text

Efficient inter mode selection algorithm for H.264 by LU Lu, ZHOU Wei

“…The simulation results show that the algorithm can remarkably decrease the complexity at the encoder while keeping satisfying coding efficiency.…”
Get full text

Chaos-based scramble self-embedding watermarking algorithm by HE Hong-jie, ZHANG Jia-shu

“…A chaos-based scramble self-embedding watermarking algorithm was proposed to locate tamper block on the wa- termarked images and improve security of the existing self-embedding fragile watermarking algorithms that could not effec- tively locate tamper block. …”
Get full text

Boosting any learning algorithm with Statistically Enhanced Learning by Florian Felice, Christophe Ley, Stéphane P. A. Bordas, Andreas Groll

Get full text

Application of Genetic Algorithms in Nonlinear Heat Conduction Problems by Muhammad Bilal Kadri, Waqar A. Khan

“…Genetic algorithms are employed to optimize dimensionless temperature in nonlinear heat conduction problems. …”
Get full text

Power services scheduling algorithm based on quantum communication by Zhuozhi YU, Yefeng ZHANG, Bingyang HAN, Wenwei CHEN, Dong WANG

“…Quantum communication could effectively improve the transmission’s reliability and security of power system services.However,limited by the generating rate of quantum key,it was difficult to meet the encryption requirements of important services.Therefore,a queue scheduling algorithm was required to legitimately schedule the power system services which need to be encrypted in quantum communication.An improved weighted fair queuing (weighted fair queuing,WFQ) algorithm LD-WFQ was proposed.By estimating the expected delay of the data packets to be encrypted,sending the packets that would soon be timeout,the proposed algorithm effectively reduced the timeout ratio of the packets and improved the effective utilization of quantum keys,while maintaining the timeout ratio of the packets in high priority queue at a low level.Compared with the WFQ algorithm,the simulation result proves the superiority of LD-WFQ algorithm.…”
Get full text

Provident garbage collection algorithm for SSD storage system by Xuezhen TU, Zhenjiang Huang, Zhengguang CHEN

“…A predictive based proactive garbage collection algorithm was proposed.Firstly,the data was separated according to different heat factors,then the upper and lower predictions were performed on the number of different types of page allocation requests (PAR) that would be reached in the future.While satisfying the page allocation request lower prediction,the PAR upper prediction requirement was maximally satisfied,the WA problem was optimized,and invalid effective data migration was reduced,thereby maximizing the garbage collection utility.A mathematical model was defined for this problem,and an algorithm for obtaining the approximate optimal solution was given.The applicable scenario of the model was analyzed.The practical results show that the algorithm can obtain the maximum benefit and can significantly improve the performance of SSD and reduce the cost.…”
Get full text

Fast surface reconstruction algorithm with adaptive step size. by Jingguo Dai, Yeqing Yi, Chengzhi Liu

“…To further improve the computational efficiency, an adaptive step size adjustment strategy for surface reconstruction algorithm is investigated. During each iteration, the step size is adaptively chosen based on the current residual-larger residuals may necessitate larger steps, while smaller ones might permit smaller steps. …”
Get full text

Information entropy based match field cutting algorithm by Peng-hao SUN, Ju-long LAN, Shao-jun ZHANG, Jun-fei LI

“…With the increasing diversity of network functions,packet classification had a higher demand on the number of match fields and depth of match table,which placed a severe burden on the storage capacity of hardware.To ensure the efficiency of matching process while at the same time improve the usage of storage devices,an information entropy based cutting algorithm on match fields was proposed.By the analysis on the redundancy of match fields and distribution pattern in a rule set,a match field cutting model was proposed.With the mapping of matching process to the process of entropy reduction,the complexity of optimal match field cutting was reduced from NP-hard to linear complexity.Experiment results show that compared to existing schemes,this scheme can need 40% less TCAM storage space,and on the other side,with the growing of table size,the time complexity of this algorithm is also far less than other algorithms.…”
Get full text

Application of Kalman Filtering Algorithm in the Tramcar GPS Positioning by ZHANG Shan, LI Hui, TANG Yong

“…In subway system, a lot of transponder are paved on the track to assist the positioning. While the positioning of tramcars is different from the subway because of the positioning and the cost, the tramcars system usually adopt the method of combination of a few transponders or beacons, the speed sensors and GPS to position comprehensively. …”
Get full text

Distributed Voronoi coverage algorithm in wireless sensor networks by XU Peng-fei1, CHEN Zhi-gang1, DENG Xiao-heng1

“…On the hypothesis conditions that wireless sensor networks only covered partial target region and the commu-nication radius was no less than twice of the sensing radius,a coverage-preserved and connected distributed Voronoi cov-erage algorithm was presented.Firstly,a method of detecting coverage redundancy sensors based on the local Voronoi re-gions was proposed,whose computational complexity was unconcerned with the density of sensors.Then,an en-ergy-prior self-scheduling strategy based on local Voronoi neighbors was proposed,where those sensors that were com-munication neighbors but not local Voronoi neighbors could synchronously execute self-scheduling,which improved the astringency of distributed scheduling.The simulation results show that the average number and coverage-degree of active sensors produced by the proposed algorithm are close to the centralized algorithm and smaller than the general distributed algorithm,while the proposed algorithm has more advantages in terms of active sensors’ average energy,scheduling as-tringency and runtime.…”
Get full text

A Consensus Routing Algorithm for Mobile Distributed Systems by Magali Arellano-Vázquez, Héctor Benítez-Pérez, J. Ortega-Arjona

“…In this regard, the algorithm proposed here makes it possible to avoid flooding while reducing bandwidth use and keeping changes of the network only at a local scale.…”
Get full text