Energy efficient routing and task scheduling for autonomous transfer vehicles in intra logistics by İnci Sarıçiçek, Sinem Bozkurt Keser, Azmi Cibi, Tahir Özdemir, Ahmet Yazıcı

“…The routes of vehicles are obtained by using the proposed Hybrid Simulated Annealing Algorithm. An algorithm for the initial solution is also proposed to determine the minimum number of vehicles for pickup and delivery requests. …”
Get full text

WSNs data acquisition by combining expected network coverage and clustered compressed sensing. by Zhouzhou Liu, Yangmei Zhang, Yang Bi, Jingxuan Wang, Yuanyuan Hou, Chao Liu, Guangyi Jiang, Shan Li

“…Combined with an optimized network coverage algorithm, a node scheduling strategy is introduced to focus on critical observation areas while minimizing overall energy consumption. …”
Get full text

Dual time scale network slice resource allocation method based on limited memory and probability learning by Shao Feng, Sun Jun

“…Simulation results show that the proposed algorithm achieves significant improvements in slice satisfaction for newly added slices and system spectral efficiency compared to the two benchmark algorithms, while demonstrating better stability.…”
Get full text

Reductions of GKZ systems and applications to cosmological correlators by Thomas W. Grimm, Arno Hoefnagels

“…While originating in the mathematical theory of D-modules analyzed via exact sequences of Euler-Koszul homologies, the algorithm can be used without knowledge of this framework. …”
Get full text

User alignment across social networks by Shen Jiaqi, Zhou Guomin

“…Among them, user interest is divided into static interest and dynamic interest, static interest is extracted from user background information by TextRank algorithm, while dynamic interest is mined from user published text content by using topic model to find out interest points that change over time. …”
Get full text

Method for extracting light stripes of wheel profiles from consecutive frames in complex background by LEI Yongwei, LEI Lei, SONG Dongli, LIN Hanxiao

“…By setting filter conditions for rectangular areas, light stripe zones were quickly segmented within complex backgrounds, eliminating the need to repeatedly input threshold parameters, thus enhancing the algorithm’s adaptability and reliability. Additionally, an algorithm of edge expansion in consecutive frames utilized the similarity between image frames to segment light stripes, contributing to the algorithm’s robustness against texture changes on object surface. …”
Get full text

Pareto Optimal Solutions for Stochastic Dynamic Programming Problems via Monte Carlo Simulation by R. T. N. Cardoso, R. H. C. Takahashi, F. R. B. Cruz

“…A heuristic algorithm is proposed for a class of stochastic discrete-time continuous-variable dynamic programming problems submitted to non-Gaussian disturbances. …”
Get full text

Adaptive clustering federated learning via similarity acceleration by Suxia ZHU, Binke GU, Guanglu SUN

“…In order to solve the problem of model performance degradation caused by data heterogeneity in the federated learning process, it is necessary to consider personalizing in the federated model.A new adaptively clustering federated learning (ACFL) algorithm via similarity acceleration was proposed, achieving adaptive acceleration clustering based on geometric properties of local updates and the positive feedback mechanism during clients federated training.By dividing clients into different task clusters, clients with similar data distribution in the same cluster was cooperated to improve the performance of federated model.It did not need to determine the number of clusters in advance and iteratively divide the clients, so as to avoid the problems of high computational cost and slow convergence speed in the existing clustering federation methods while ensuring the performance of models.The effectiveness of ACFL was verified by using deep convolutional neural networks on commonly used datasets.The results show that the performance of ACFL is comparable to the clustered federated learning (CFL) algorithm, it is better than the traditional iterative federated cluster algorithm (IFCA), and has faster convergence speed.…”
Get full text

Software and hardware co-design of lightweight authenticated ciphers ASCON for the internet of things by Jing WANG, Lesheng HE, Zhonghong LI, Luchi LI, Hang YANG

“…ASCON was the most promising algorithm to become an international standard in the 2021 NIST lightweight authenticated encryption call for proposals.The algorithm was designed to achieve the best performance in IoT resource-constrained environments, and there was no hardware IP core implementation based on this algorithm in the open literature.A software-hardware collaborative implementation method of ASCON was proposed, which improved the speed and reduced the memory footprint of ASCON in IoT security authentication applications through hardware means such as S-box optimization, prior calculation and advanced pipeline design.As a comparison, ASCON has been transplanted on the common IoT embedded processor platform.The results showed that the described method was more than 7.9 times faster, while the memory footprint was reduced by at least 90%.The schemes can be used for the design and implementation of IoT security application-specific integrated circuits or SoCs.…”
Get full text

Data Inconsistency Evaluation for Cyberphysical System by Hao Wang, Jianzhong Li, Hong Gao

“…At last, we test our algorithm on both synthetic and real-life datasets; the experiment results show the scalability of our algorithm and the quality of the evaluation result.…”
Get full text

Learned Shrinkage Approach for Low-Dose Reconstruction in Computed Tomography by Joseph Shtok, Michael Elad, Michael Zibulevsky

“…Our numerical simulations indicate that the proposed algorithm can manage well with noisy measurements, allowing a dose reduction by a factor of 4, while reducing noise and streak artifacts in the FBP reconstruction, comparable to the performance of a statistically based iterative algorithm.…”
Get full text

Energy-Efficient Task Migration and Path Planning in UAV-Enabled Mobile Edge Computing System by Can Gong, Li Wei, Deliang Gong, Tiantian Li, Fang Feng

“…To solve this challenge, we propose an energy-efficient dynamic task migration algorithm (EDTM) that minimizes the total energy consumption of the system while ensuring UAVs system load balance. …”
Get full text

Quartic Quantum Speedups for Planted Inference by Alexander Schmidhuber, Ryan O’Donnell, Robin Kothari, Ryan Babbush

“…We describe a quantum algorithm for the Planted Noisy kXOR Problem (also known as Sparse Learning Parity with Noise) that achieves a nearly quartic (fourth-power) speedup over the best known classical algorithm while using exponentially less space. …”
Get full text

Local Differential Privacy Graph Data Modeling Method for Link Prediction by HANQilong, WUXiaoming

“…The simulation experiments show that the PSRR-LDP algorithm has better link prediction performance while ensuring privacy.…”
Get full text

Reconfigurable intelligent surface assisted resource optimization method for heterogeneous network by Xianhao SHEN, Ziling ZENG, Shaohua NIU

“…For reconfigurable intelligent surface (RIS)-assisted heterogeneous network slicing, a resource optimization method with joint resource allocation and phase shift optimization was proposed.A joint optimization problem with different objectives was constructed for different services in heterogeneous networks.For enhanced mobile broadband (eMBB) services, the resource block allocation, power allocation and RIS phase shift matrix were jointly optimized based on the alternating optimization algorithm to maximize the total traversal capacity of eMBB users.For ultra-reliable low-latency communication (URLLC) services, a pre-configured RIS-based heuristic URLLC allocation algorithm was proposed with the objectives of maximizing the URLLC packet reception rate and minimizing the amount of eMBB rate loss.Simulation results demonstrate that the proposed algorithm achieves about 99.99% URLLC packet reception rate using only 80 RISs compared to 95.95% URLLC packet reception rate when no RISs are deployed, while the total eMBB rate is increased by 86.24%.…”
Get full text

Accelerated Tensor Robust Principal Component Analysis via Factorized Tensor Norm Minimization by Geunseop Lee

“…Experimental results demonstrate that our algorithm achieves significantly faster performance than existing reference methods known for efficient computation while maintaining high accuracy in recovering low-rank tensors for applications such as color image recovery and background subtraction.…”
Get full text

A Modified Nearest Level Control Scheme for Improved Submodule Current Sharing in a CHB Converter with Integrated EDLCs by Viktor Döhlen, Kent Bertilsson

“…A modification of the sort and select algorithm to determine which submodule is to be inserted and bypassed when using the Nearest Level Control algorithm is proposed to distribute the activation time and the experienced RMS current of the submodules. …”
Get full text

Dual-Layer Dynamic Optimization Model for Carbon-Conscious Transport Mode Allocation by Jing Gan, Dongmei Yan, Linheng Li

“…A sophisticated fusion algorithm, integrating the Dial_MSA algorithm with a genetic algorithm (GA), is developed to solve the model. …”
Get full text

Explorative Binary Gray Wolf Optimizer with Quadratic Interpolation for Feature Selection by Yijie Zhang, Yuhang Cai

“…Therefore, feature selection becomes an essential preprocessing stage, aimed at reducing the dimensionality of the dataset by selecting the most informative features while improving classification accuracy. This paper proposes a novel binary Gray Wolf Optimization algorithm to address the feature selection problem in classification tasks. …”
Get full text

Energy-Efficient and Fault-Tolerant Control of a Six-Axis Robot Based on AI Models by Patryk Nowak, Zoran Pandilov

“…Obstacles are present in the robot’s workspace. The goal of the algorithm is to control the robot in such a way that energy consumption is minimized while also avoiding obstacles and ensuring fault tolerance in the event of axis failures. …”
Get full text