73,257 results
Search Results
102. ITERATIVE ALGORITHM OF SPLIT MONOTONE VARIATIONAL INCLUSION PROBLEM FOR NEW MAPPINGS.
- Author
-
FARID, MOHAMMAD, IRFAN, SYED SHAKAIB, and AHMAD, IQBAL
- Subjects
NONEXPANSIVE mappings ,HILBERT space ,ALGORITHMS - Abstract
In this paper, we developed a new type iterative scheme to approximate a common solution of split monotone variational inclusion, variational inequality and fixed point problems for an infinite family of nonexpansive mappings in the framework of Hilbert spaces. Further, we proved that the sequence generated by the proposed iterative method converges strongly to a common solution of split monotone variational inclusion, variational inequality and fixed point problems. Furthermore, we give some consequences of the main result. Finally, we discuss a numerical example to demonstrate the applicability of the iterative algorithm. The result presented in this paper unifies and extends some known results in this area. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
103. Enhanced Air Quality Prediction Using a Coupled DVMD Informer-CNN-LSTM Model Optimized with Dung Beetle Algorithm.
- Author
-
Wu, Yang, Qian, Chonghui, and Huang, Hengjun
- Subjects
DUNG beetles ,AIR quality indexes ,AIR quality ,OPTIMIZATION algorithms ,ALGORITHMS - Abstract
Accurate prediction of air quality is crucial for assessing the state of the atmospheric environment, especially considering the nonlinearity, volatility, and abrupt changes in air quality data. This paper introduces an air quality index (AQI) prediction model based on the Dung Beetle Algorithm (DBO) aimed at overcoming limitations in traditional prediction models, such as inadequate access to data features, challenges in parameter setting, and accuracy constraints. The proposed model optimizes the parameters of Variational Mode Decomposition (VMD) and integrates the Informer adaptive sequential prediction model with the Convolutional Neural Network-Long Short Term Memory (CNN-LSTM). Initially, the correlation coefficient method is utilized to identify key impact features from multivariate weather and meteorological data. Subsequently, penalty factors and the number of variational modes in the VMD are optimized using DBO. The optimized parameters are utilized to develop a variationally constrained model to decompose the air quality sequence. The data are categorized based on approximate entropy, and high-frequency data are fed into the Informer model, while low-frequency data are fed into the CNN-LSTM model. The predicted values of the subsystems are then combined and reconstructed to obtain the AQI prediction results. Evaluation using actual monitoring data from Beijing demonstrates that the proposed coupling prediction model of the air quality index in this paper is superior to other parameter optimization models. The Mean Absolute Error (MAE) decreases by 13.59%, the Root-Mean-Square Error (RMSE) decreases by 7.04%, and the R-square (R
2 ) increases by 1.39%. This model surpasses 11 other models in terms of lower error rates and enhances prediction accuracy. Compared with the mainstream swarm intelligence optimization algorithm, DBO, as an optimization algorithm, demonstrates higher computational efficiency and is closer to the actual value. The proposed coupling model provides a new method for air quality index prediction. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF
104. Performance Impact of Nested Congestion Control on Transport-Layer Multipath Tunneling.
- Author
-
Pieska, Marcus, Kassler, Andreas, Brunstrom, Anna, Rakocevic, Veselin, and Amend, Markus
- Subjects
COMPUTER network protocols ,TUNNELS ,TUNNEL design & construction ,ALGORITHMS ,SCHEDULING - Abstract
Multipath wireless access aims to seamlessly aggregate multiple access networks to increase data rates and decrease latency. It is currently being standardized through the ATSSS architectural framework as part of the fifth-generation (5G) cellular networks. However, facilitating efficient multi-access communication in next-generation wireless networks poses several challenges due to the complex interplay between congestion control (CC) and packet scheduling. Given that enhanced ATSSS steering functions for traffic splitting advocate the utilization of multi-access tunnels using congestion-controlled multipath network protocols between user equipment and a proxy, addressing the issue of nested CC becomes imperative. In this paper, we evaluate the impact of such nested congestion control loops on throughput over multi-access tunnels using the recently introduced Multipath DCCP (MP-DCCP) tunneling framework. We evaluate different combinations of endpoint and tunnel CC algorithms, including BBR, BBRv2, CUBIC, and NewReno. Using the Cheapest Path First scheduler, we quantify and analyze the impact of the following on the performance of tunnel-based multipath: (1) the location of the multi-access proxy relative to the user; (2) the bottleneck buffer size, and (3) the choice of the congestion control algorithms. Furthermore, our findings demonstrate the superior performance of BBRv2 as a tunnel CC algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
105. FireYOLO-Lite: Lightweight Forest Fire Detection Network with Wide-Field Multi-Scale Attention Mechanism.
- Author
-
Sheng, Sha, Liang, Zhengyin, Xu, Wenxing, Wang, Yong, and Su, Jiangdan
- Subjects
FEATURE extraction ,FOREST fires ,DEEP learning ,ALGORITHMS ,DETECTORS - Abstract
A lightweight forest fire detection model based on YOLOv8 is proposed in this paper in response to the problems existing in traditional sensors for forest fire detection. The performance of traditional sensors is easily constrained by hardware computing power, and their adaptability in different environments needs improvement. To balance the accuracy and speed of fire detection, the GhostNetV2 lightweight network is adopted to replace the backbone network for feature extraction of YOLOv8. The Ghost module is utilized to replace traditional convolution operations, conducting feature extraction independently in different dimensional channels, significantly reducing the complexity of the model while maintaining excellent performance. Additionally, an improved CPDCA channel priority attention mechanism is proposed, which extracts spatial features through dilated convolution, thereby reducing computational overhead and enabling the model to focus more on fire targets, achieving more accurate detection. In response to the problem of small targets in fire detection, the Inner IoU loss function is introduced. By adjusting the size of the auxiliary bounding boxes, this function effectively enhances the convergence effect of small target detection, further reducing missed detections, and improving overall detection accuracy. Experimental results indicate that, compared with traditional methods, the algorithm proposed in this paper significantly improves the average precision and FPS of fire detection while maintaining a smaller model size. Through experimental analysis, compared with YOLOv3-tiny, the average precision increased by 5.9% and the frame rate reached 285.3 FPS when the model size was only 4.9 M; compared with Shufflenet, the average precision increased by 2.9%, and the inference speed tripled. Additionally, the algorithm effectively addresses false positives, such as cloud and reflective light, further enhancing the detection of small targets and reducing missed detections. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
106. A research study of lightweight state perception algorithm based on improved YOLOv5s‐Tiny for fully mechanized top‐coal caving mining.
- Author
-
Shan, PengFei, Yang, Tong, Wu, XiaoChen, and Sun, HaoQiang
- Subjects
CAVING ,COAL mining ,CAVES ,LONGWALL mining ,ALGORITHMS ,DEEP learning ,COAL - Abstract
Real‐time monitoring of the coal caving process in fully mechanized mining is crucial for achieving intelligent and efficient top‐coal caving. While the coal gangue identification method, employing vision and deep learning, has advanced in the realm of intelligent monitoring, it exhibits a dependency on high‐performance hardware. This reliance poses challenges for deploying identification equipment on mobile terminals, hindering the widespread application of this method. To address the issues above, the paper presents a lightweight algorithm, utilizing You Only Look Once version 5s (YOLOv5s), utilizing YOLOv5s for the real‐time perception of the top‐coal caving state in fully mechanized caving mining. We replace the backbone network of YOLOv5s with the ShuffleNetv2 structure that is more suitable for lightweight deployment, and add the Simple Attention Mechanism attention mechanism to the network structure to enhance the model's receptive field and feature expression ability, and reduce the impact of falling debris on the detection results. A dynamic experimental platform for top‐coal caving in fully mechanized caving mining for thick coal seams is set up, and preprocessing operations such as brightness, sharpening, and denoising are performed on the image data sets collected by high‐speed industrial cameras. Research results show that compared with the traditional YOLOv5s, the improved model's P, mAP, F1 score, and other indicators have increased by 3.4%, 2.1%, and 1.1%, respectively, the model size is 70% of the original, and the detection frames per second value has increased by 48.1%. The lightweight algorithm stabilizes the accuracy of coal gangue identification dramatically in real time. It dramatically reduces the computing pressure on the mobile terminal, providing basic theory and practice for real‐time monitoring of fully mechanized coal caving mining. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
107. An Improved Porosity Calculation Algorithm for Particle Flow Code.
- Author
-
Zhang, Siyu, Xin, Xiankang, Cui, Yongzheng, and Yu, Gaoming
- Subjects
GRANULAR flow ,FLUID flow ,POROSITY ,ALGORITHMS ,EQUATIONS - Abstract
The widely used discrete-element particle flow software PFC's (PFC 7.0 and previous versions) algorithm for calculating porosity is not sufficiently accurate. Because of this, when the particles are densely packed, the solution to the equation produces an algorithm exception for odd calculations of porosity, which results in the inability to calculate the results. This paper, based on a Darcy seepage model of fluid flow through a granular bed, analyzed the shortcomings of the two porosity calculation methods of PFC and the function analysis method. Combining this analysis with the theory of computer graphics, a new and efficient porosity calculation algorithm was proposed. The result showed that the new proposed porosity calculation algorithm calculated a more accurate and reasonable porosity field and made the iterative solution of the CFD equation more stable. This method makes porosity-related models of PFC more accurate. The algorithm can be not only used to calculate porosity, but also applied to other fields. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
108. An algorithm for generating efficient block designs via a novel particle swarm approach.
- Author
-
Pooladsaz, Saeid and Doosti-Irani, Mahboobeh
- Subjects
BLOCK designs ,PARTICLE swarm optimization ,COMBINATORIAL optimization ,ALGORITHMS - Abstract
The problem of finding optimal block designs can be formulated as a combinatorial optimization, but its resolution is still a formidable challenge. This paper presents a general and user-friendly algorithm, namely Modified Particle Swarm Optimization (MPSO), to construct optimal or near-optimal block designs. It can be used for several classes of block designs such as binary, non-binary and test-control block designs with correlated or uncorrelated observations. In order to evaluate the algorithm, we compare our results with the optimal designs presented in some published papers. An advantage of our algorithm is its independency to the sizes of blocks and the structure of correlations. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
109. An Improved Football Team Training Algorithm for Global Optimization.
- Author
-
Hou, Jun, Cui, Yuemei, Rong, Ming, and Jin, Bo
- Subjects
GLOBAL optimization ,ALGORITHMS - Abstract
The football team training algorithm (FTTA) is a new metaheuristic algorithm that was proposed in 2024. The FTTA has better performance but faces challenges such as poor convergence accuracy and ease of falling into local optimality due to limitations such as referring too much to the optimal individual for updating and insufficient perturbation of the optimal agent. To address these concerns, this paper presents an improved football team training algorithm called IFTTA. To enhance the exploration ability in the collective training phase, this paper proposes the fitness distance-balanced collective training strategy. This enables the players to train more rationally in the collective training phase and balances the exploration and exploitation capabilities of the algorithm. To further perturb the optimal agent in FTTA, a non-monopoly extra training strategy is designed to enhance the ability to get rid of the local optimum. In addition, a population restart strategy is then designed to boost the convergence accuracy and population diversity of the algorithm. In this paper, we validate the performance of IFTTA and FTTA as well as six comparison algorithms in CEC2017 test suites. The experimental results show that IFTTA has strong optimization performance. Moreover, several engineering-constrained optimization problems confirm the potential of IFTTA to solve real-world optimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
110. Transformer Discharge Carbon-Trace Detection Based on Improved MSRCR Image-Enhancement Algorithm and YOLOv8 Model.
- Author
-
Ji, Hongxin, Han, Peilin, Li, Jiaqi, Liu, Xinghua, and Liu, Liqing
- Subjects
ALGORITHMS ,ELECTRIC transformers ,REQUIREMENTS engineering ,IMAGE intensifiers ,POWER transformers ,FEATURE extraction ,PROBLEM solving - Abstract
It is difficult to visually detect internal defects in a large transformer with a metal closure. For convenient internal inspection, a micro-robot was adopted, and an inspection method based on an image-enhancement algorithm and an improved deep-learning network was proposed in this paper. Considering the dim environment inside the transformer and the problems of irregular imaging distance and fluctuating supplementary light conditions during image acquisition with the internal-inspection robot, an improved MSRCR algorithm for image enhancement was proposed. It could analyze the local contrast of the image and enhance the details on multiple scales. At the same time, a white-balance algorithm was introduced to enhance the contrast and brightness and solve the problems of overexposure and color distortion. To improve the target recognition performance of complex carbon-trace defects, the SimAM mechanism was incorporated into the Backbone network of the YOLOv8 model to enhance the extraction of carbon-trace features. Meanwhile, the DyHead dynamic detection Head framework was constructed at the output of the YOLOv8 model to improve the perception of local carbon traces with different sizes. To improve the defect target recognition speed of the transformer-inspection robot, a pruning operation was carried out on the YOLOv8 model to remove redundant parameters, realize model lightness, and improve detection efficiency. To verify the effectiveness of the improved algorithm, the detection model was trained and validated with the carbon-trace dataset. The results showed that the MSH-YOLOv8 algorithm achieved an accuracy of 91.80%, which was 3.4 percentage points higher compared to the original YOLOv8 algorithm, and had a significant advantage over other mainstream target-detection algorithms. Meanwhile, the FPS of the proposed algorithm was up to 99.2, indicating that the model computation and model complexity were successfully reduced, which meets the requirements for engineering applications of the transformer internal-inspection robot. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
111. Digital Visual Design Reengineering and Application Based on K-means Clustering Algorithm.
- Author
-
Lijie Ren and Hyunsuk Kim
- Subjects
K-means clustering ,BEES algorithm ,FEATURE selection ,OPTIMIZATION algorithms ,ALGORITHMS ,FEATURE extraction ,STANDARD deviations ,CURVES - Abstract
INTRODUCTION: The article discusses the key steps in digital visual design reengineering, with a special emphasis on the importance of information decoding and feature extraction for flat cultural heritage. These processes not only minimize damage to the aesthetic heritage itself but also feature high quality, efficiency, and recyclability. OBJECTIVES: The aim of the article is to explore the issues of gene extraction methods in digital visual design reengineering, proposing a visual gene extraction method through an improved K-means clustering algorithm. METHODS: A visual gene extraction method based on an improved K-means clustering algorithm is proposed. Initially analyzing the digital visual design reengineering process, combined with a color extraction method using the improved JSO algorithm-based K-means clustering algorithm, a gene extraction and clustering method for digital visual design reengineering is proposed and validated through experiments. .ASA-RESULT: The results show that the proposed method improves the accuracy, robustness, and real-time performance of clustering. Through comparative analysis with Dunhuang murals, the effectiveness of the color extraction method based on the K-means-JSO algorithm in the application of digital visual design reengineering is verified. The method based on the K-means-GWO algorithm performs best in terms of average clustering time and standard deviation. The optimization curve of color extraction based on the K-means-JSO algorithm converges faster and with better accuracy compared to the K-means-ABC, K-means-GWO, K-means-DE, K-means-CMAES, and K-means-WWCD algorithms. CONCLUSION: The color extraction method of the K-means clustering algorithm improved by the JSO algorithm proposed in this paper solves the problems of insufficient standardization in feature selection, lack of generalization ability, and inefficiency in visual gene extraction methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
112. Chaotic Orthogonal Composite Sequence for 5G NR Time Service Signal Capture Algorithm.
- Author
-
Mao, Zhiwei, Wu, Huabing, Zhao, Dangli, and Jiang, Xingbo
- Subjects
5G networks ,ALGORITHMS ,SEARCH algorithms ,FAST Fourier transforms ,SIGNAL-to-noise ratio ,SHIFT registers ,MATHEMATICAL sequences - Abstract
Establishing a national comprehensive PNT (Positioning, Navigation, and Timing) system has become a consensus among major countries worldwide. As a crucial component in completing the entire PNT system, the 5G NR (new radio) time service signal plays a vital role. This paper proposes a 5G NR time service signal that uses a spread spectrum system, shares the 5G signal frequency band, but does not occupy the bandwidth of the 5G communication signal. This timing service signal has relatively low power, making it appear "submerged" within the power of the 5G communication signal. The spread spectrum code for this timing signal employs the chaotic orthogonal composite sequence proposed in this paper. Compared to traditional spread spectrum sequences, this sequence offers better security than m-sequences, improved autocorrelation than Walsh sequences, and an effective suppression of the short-period characteristics exhibited when the Skew Tent-Map chaotic sequence takes special values. This paper simulates the capture of the 5G NR time service signal in an environment with a signal-to-noise ratio of 10 dB using an FFT-based parallel code phase search algorithm, successfully capturing the 5G NR time service signal and verifying the feasibility of the proposed chaotic orthogonal composite sequence as a spread spectrum code. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
113. Vertical Switching Algorithm for Unmanned Aerial Vehicle in Power Grid Heterogeneous Communication Networks.
- Author
-
Wang, Zhiyi, Lv, Zhiyao, Xu, Xiaolong, Cong, Li, and Huang, Chengbin
- Subjects
ELECTRIC power distribution grids ,TELECOMMUNICATION systems ,ANALYTIC hierarchy process ,ALGORITHMS - Abstract
The rapid development of wireless network technology has led to the coexistence of various heterogeneous wireless networks (HWNs). To ensure that users enjoy normal and diversified services, research on vertical switching technology has become an inevitable trend. However, most current vertical switching algorithms only consider static situations or single services, which are not suitable for power grid scenarios. This paper studies the vertical switching problem of wireless heterogeneous networks for unmanned aerial vehicles (UAVs) performing inspection tasks in power grid scenarios. In this model, a UAV for power grid inspection needs to plan its flight trajectory, avoid obstacles, and find the optimal trajectory to reach each inspection point. Throughout the UAV inspection process, we must ensure the quality of communication services for the UAV. The UAV dynamically selects different networks for access at different locations, presenting a dynamic network selection and vertical switching problem. This paper proposes a method that combines trajectory planning and network selection, which first utilizes the A-star algorithm to obtain suitable trajectories, and then evaluates and judges networks based on the Fuzzy Analytic Hierarchy Process (FAHP) to determine the most appropriate network. It is worth noting that this paper considers three service requirements and seven network attributes under three types of heterogeneous wireless networks. Numerical results show that this method can better meet the requirements of UAV inspection tasks and reduce the number of switches, thus addressing the issue of terminal vertical switches in power grid scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
114. Fast Screening Algorithm for Satellites Based on Multi-Constellation System.
- Author
-
Zhou, Weidong and Wu, Zhiqiang
- Subjects
CONSTELLATIONS ,GLOBAL Positioning System ,ALGORITHMS - Abstract
This paper proposes a fast satellite screening algorithm aimed at the problem of balancing between positioning accuracy and system computing efficiency in a multi-constellation system environment under the Global Navigation Satellite System (GNSS). The algorithm constructs an observation model based on a positioning error for the larger number of satellites under a multi-constellation. The space region is divided based on elevation and azimuth angles to implement the screening algorithm for the solution of the point to be determined. An analysis of the experimental data shows that the average GDOP value of this scheme is 1.835, and the position error of the point to be determined is controlled within 2.5 m when the cut-off altitude angle is 5° and the screening ratio is more than 70%. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
115. LiDAR Point Cloud Super-Resolution Reconstruction Based on Point Cloud Weighted Fusion Algorithm of Improved RANSAC and Reciprocal Distance.
- Author
-
Yang, Xiaoping, Ni, Ping, Li, Zhenhua, and Liu, Guanghui
- Subjects
POINT cloud ,OPTICAL radar ,LIDAR ,MULTICASTING (Computer networks) ,YIELD strength (Engineering) ,ALGORITHMS ,SPACE-based radar - Abstract
This paper proposes a point-by-point weighted fusion algorithm based on an improved random sample consensus (RANSAC) and inverse distance weighting to address the issue of low-resolution point cloud data obtained from light detection and ranging (LiDAR) sensors and single technologies. By fusing low-resolution point clouds with higher-resolution point clouds at the data level, the algorithm generates high-resolution point clouds, achieving the super-resolution reconstruction of lidar point clouds. This method effectively reduces noise in the higher-resolution point clouds while preserving the structure of the low-resolution point clouds, ensuring that the semantic information of the generated high-resolution point clouds remains consistent with that of the low-resolution point clouds. Specifically, the algorithm constructs a K-d tree using the low-resolution point cloud to perform a nearest neighbor search, establishing the correspondence between the low-resolution and higher-resolution point clouds. Next, the improved RANSAC algorithm is employed for point cloud alignment, and inverse distance weighting is used for point-by-point weighted fusion, ultimately yielding the high-resolution point cloud. The experimental results demonstrate that the proposed point cloud super-resolution reconstruction method outperforms other methods across various metrics. Notably, it reduces the Chamfer Distance (CD) metric by 0.49 and 0.29 and improves the Precision metric by 7.75% and 4.47%, respectively, compared to two other methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
116. Unmanned Ground Vehicle Path Planning Based on Improved DRL Algorithm.
- Author
-
Liu, Lisang, Chen, Jionghui, Zhang, Youyuan, Chen, Jiayu, Liang, Jingrun, and He, Dongwei
- Subjects
DEEP reinforcement learning ,MACHINE learning ,AUTONOMOUS vehicles ,REMOTELY piloted vehicles ,ALGORITHMS ,SUCCESSIVE approximation analog-to-digital converters ,REINFORCEMENT learning - Abstract
Path planning and obstacle avoidance are fundamental problems in unmanned ground vehicle path planning. Aiming at the limitations of Deep Reinforcement Learning (DRL) algorithms in unmanned ground vehicle path planning, such as low sampling rate, insufficient exploration, and unstable training, this paper proposes an improved algorithm called Dual Priority Experience and Ornstein–Uhlenbeck Soft Actor-Critic (DPEOU-SAC) based on Ornstein–Uhlenbeck (OU noise) and double-factor prioritized sampling experience replay (DPE) with the introduction of expert experience, which is used to help the agent achieve faster and better path planning and obstacle avoidance. Firstly, OU noise enhances the agent's action selection quality through temporal correlation, thereby improving the agent's detection performance in complex unknown environments. Meanwhile, the experience replay is based on double-factor preferential sampling, which has better sample continuity and sample utilization. Then, the introduced expert experience can help the agent to find the optimal path with faster training speed and avoid falling into a local optimum, thus achieving stable training. Finally, the proposed DPEOU-SAC algorithm is tested against other deep reinforcement learning algorithms in four different simulation environments. The experimental results show that the convergence speed of DPEOU-SAC is 88.99% higher than the traditional SAC algorithm, and the shortest path length of DPEOU-SAC is 27.24, which is shorter than that of SAC. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
117. Multi-Objective Region Encryption Algorithm Based on Adaptive Mechanism.
- Author
-
Wang, Juan, Gao, Boyong, Xiong, Xingchuang, Liu, Zilong, and Pei, Chenbo
- Subjects
INFORMATION technology ,IMAGE encryption ,IMAGE segmentation ,ALGORITHMS ,RESOURCE allocation ,POLYGONS - Abstract
The advancement of information technology has led to the widespread application of remote measurement systems, where information in the form of images or videos, serving as measurement results, is transmitted over networks. However, this transmission is highly susceptible to attacks, tampering, and disputes, posing significant risks to the trustworthy transmission of measurement results from instruments and devices. In recent years, many encryption algorithms proposed for images have focused on encrypting the entire image, resulting in resource waste. Additionally, most encryption algorithms are designed only for single-object-type images. Addressing these issues, this paper proposes a multi-object region encryption algorithm based on an adaptive mechanism. Firstly, an adaptive mechanism is employed to determine the strategy for adjusting the sampling rate of encryption objects, achieved through an encryption resource allocation algorithm. Secondly, an improved polygon segmentation algorithm is utilized to separate single-object regions from multi-object images, dynamically adjusting the sequence of encryption objects based on the adaptive mechanism. Finally, encryption is achieved using a chaos fusion XOR encryption algorithm. Experimental validation using instrument images demonstrates that the proposed algorithm offers high efficiency and security advantages compared to other mainstream image encryption algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
118. Query Lower Bounds for Log-concave Sampling.
- Author
-
Chewi, Sinho, de Dios Pont, Jaume, Li, Jerry, Lu, Chen, and Narayanan, Shyam
- Subjects
GEOMETRIC measure theory ,WISHART matrices ,LOGICAL prediction ,ALGORITHMS ,KRYLOV subspace - Abstract
Log-concave sampling has witnessed remarkable algorithmic advances in recent years, but the corresponding problem of proving lower bounds for this task has remained elusive, with lower bounds previously known only in dimension one. In this work, we establish the following query lower bounds: (1) sampling from strongly log-concave and log-smooth distributions in dimension \(d\ge 2\) requires \(\Omega (\log \kappa)\) queries, which is sharp in any constant dimension, and (2) sampling from Gaussians in dimension d (hence also from general log-concave and log-smooth distributions in dimension d) requires \(\widetilde{\Omega }(\min (\sqrt \kappa \log d, d))\) queries, which is nearly sharp for the class of Gaussians. Here, \(\kappa\) denotes the condition number of the target distribution. Our proofs rely upon (1) a multiscale construction inspired by work on the Kakeya conjecture in geometric measure theory, and (2) a novel reduction that demonstrates that block Krylov algorithms are optimal for this problem, as well as connections to lower bound techniques based on Wishart matrices developed in the matrix-vector query literature. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
119. Sparse Higher Order Čech Filtrations.
- Author
-
Buchet, Mickaël, B Dornelas, Bianca, and Kerber, Michael
- Subjects
SEQUENCE spaces ,DATA analysis ,TOPOLOGY ,ALGORITHMS - Abstract
For a finite set of balls of radius r, the k-fold cover is the space covered by at least k balls. Fixing the ball centers and varying the radius, we obtain a nested sequence of spaces that is called the k-fold filtration of the centers. For k=1, the construction is the union-of-balls filtration that is popular in topological data analysis. For larger k, it yields a cleaner shape reconstruction in the presence of outliers. We contribute a sparsification algorithm to approximate the topology of the k-fold filtration. Our method is a combination and adaptation of several techniques from the well-studied case k=1, resulting in a sparsification of linear size that can be computed in expected near-linear time with respect to the number of input points. Our method also extends to the multicover bifiltration, composed of the k-fold filtrations for several values of k, with the same size and complexity bounds. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
120. A Machine Learning Model to Predict Citation Counts of Scientific Papers in Otology Field.
- Author
-
Alohali, Yousef A., Fayed, Mahmoud S., Mesallam, Tamer, Abdelsamad, Yassin, Almuhawas, Fida, and Hagr, Abdulrahman
- Subjects
DECISION trees ,SERIAL publications ,NATURAL language processing ,BIBLIOMETRICS ,MACHINE learning ,REGRESSION analysis ,RANDOM forest algorithms ,CITATION analysis ,DESCRIPTIVE statistics ,PREDICTION models ,ARTIFICIAL neural networks ,MEDICAL research ,MEDICAL specialties & specialists ,ALGORITHMS - Abstract
One of the most widely used measures of scientific impact is the number of citations. However, due to its heavy-tailed distribution, citations are fundamentally difficult to predict but can be improved. This study was aimed at investigating the factors and parts influencing the citation number of a scientific paper in the otology field. Therefore, this work proposes a new solution that utilizes machine learning and natural language processing to process English text and provides a paper citation as the predicted results. Different algorithms are implemented in this solution, such as linear regression, boosted decision tree, decision forest, and neural networks. The application of neural network regression revealed that papers' abstracts have more influence on the citation numbers of otological articles. This new solution has been developed in visual programming using Microsoft Azure machine learning at the back end and Programming Without Coding Technology at the front end. We recommend using machine learning models to improve the abstracts of research articles to get more citations. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
121. Cost Optimal Production-Scheduling Model Based on VNS-NSGA-II Hybrid Algorithm—Study on Tissue Paper Mill.
- Author
-
Zhang, Huanhuan, Li, Jigeng, Hong, Mengna, Man, Yi, and He, Zhenglei
- Subjects
PAPER mills ,FLOW shop scheduling ,PRODUCTION scheduling ,INDUSTRIAL costs ,ALGORITHMS - Abstract
With the development of the customization concept, small-batch and multi-variety production will become one of the major production modes, especially for fast-moving consumer goods. However, this production mode has two issues: high production cost and the long manufacturing period. To address these issues, this study proposes a multi-objective optimization model for the flexible flow-shop to optimize the production scheduling, which would maximize the production efficiency by minimizing the production cost and makespan. The model is designed based on hybrid algorithms, which combine a fast non-dominated genetic algorithm (NSGA-II) and a variable neighborhood search algorithm (VNS). In this model, NSGA-II is the major algorithm to calculate the optimal solutions. VNS is to improve the quality of the solution obtained by NSGA-II. The model is verified by an example of a real-world typical FFS, a tissue papermaking mill. The results show that the scheduling model can reduce production costs by 4.2% and makespan by 6.8% compared with manual scheduling. The hybrid VNS-NSGA-II model also shows better performance than NSGA-II, both in production cost and makespan. Hybrid algorithms are a good solution for multi-objective optimization issues in flexible flow-shop production scheduling. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
122. Determining the Moho topography using an improved inversion algorithm: a case study from the South China Sea.
- Author
-
Zhang, Hui, Yu, Hangtao, Xu, Chuang, Li, Rui, Bie, Lu, He, Qingyin, Liu, Yiqi, Lu, Jinsong, Xiao, Yinan, Lyu, Yang, Eldosouky, Ahmed M., and Loureiro, Afonso
- Subjects
MOHOROVICIC discontinuity ,OPTIMIZATION algorithms ,TOPOGRAPHY ,ALGORITHMS - Abstract
The Parker-Oldenburg method, as a classical frequency-domain algorithm, has been widely used in Moho topographic inversion. The method has two indispensable hyperparameters, which are the Moho density contrast and the average Moho depth. Accurate hyperparameters are important prerequisites for inversion of fine Moho topography. However, limited by the nonlinear terms, the hyperparameters estimated by previous methods have obvious deviations. For this reason, this paper proposes a new method to improve the existing ParkerOldenburg method by taking advantage of the invasive weed optimization algorithm in estimating hyperparameters. The synthetic test results of the new method show that, compared with the trial and error method and the linear regression method, the new method estimates the hyperparameters more accurately, and the computational efficiency performs excellently, which lays the foundation for the inversion of more accurate Moho topography. In practice, the method is applied to the Moho topographic inversion in the South China Sea. With the constraints of available seismic data, the crust-mantle density contrast and the average Moho depth in the South China Sea are determined to be 0.535 g/cm
3 and 21.63 km, respectively, and the Moho topography of the South China Sea is inverted based on this. The results of the Moho topography show that the Moho depth in the study area ranges from 5.7 km to 32.3 km, with more obvious undulations. Among them, the shallowest part of the Moho topography is mainly located in the southern part of the Southwestern sub-basin and the southern part of the Manila Trench, with a depth of about 6 km. Compared with the CRUST 1.0 model and the model calculated by the improved Bott's method, the RMS between the Moho model and the seismic point difference in this paper is smaller, which proves that the method in this paper has some advantages in Moho topographic inversion. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF
123. Autonomous localized path planning algorithm for UAVs based on TD3 strategy.
- Author
-
Feiyu, Zhao, Dayan, Li, Zhengxu, Wang, Jianlin, Mao, and Niya, Wang
- Subjects
DRONE aircraft ,ALGORITHMS ,PROBLEM solving - Abstract
Unmanned Aerial Vehicles are useful tools for many applications. However, autonomous path planning for Unmanned Aerial Vehicles in unfamiliar environments is a challenging problem when facing a series of problems such as poor consistency, high influence by the native controller of the Unmanned Aerial Vehicles. In this paper, we investigate reinforcement learning-based autonomous local path planning methods for Unmanned Aerial Vehicles with high autonomous decision-making capability and locally high portability. We propose an autonomous local path planning algorithm based on the TD3 strategy to solve the problem of local obstacle avoidance and path planning in unfamiliar environments using autonomous decision-making of Unmanned Aerial Vehicles. The simulation results on Gazebo show that our method can effectively realize the autonomous local path planning task for Unmanned Aerial Vehicles, the success rate of path planning with our method can reach 93% under the interference of no obstacles, and 92% in the environment with obstacles. Finally, our method can be used for autonomous path planning of Unmanned Aerial Vehicles in unfamiliar environments. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
124. Application of improved and efficient image repair algorithm in rock damage experimental research.
- Author
-
Xu, Mingzhe, Qi, Xianyin, and Geng, Diandong
- Subjects
DEEP learning ,DIGITAL image correlation ,ACOUSTIC emission ,ALGORITHMS ,IMAGE reconstruction ,ACOUSTIC imaging ,ROCK analysis - Abstract
In the petroleum and coal industries, digital image technology and acoustic emission technology are employed to study rock properties, but both exhibit flaws during data processing. Digital image technology is vulnerable to interference from fractures and scaling, leading to potential loss of image data; while acoustic emission technology is not hindered by these issues, noise from rock destruction can interfere with the electrical signals, causing errors. The monitoring errors of these techniques can undermine the effectiveness of rock damage analysis. To address this issue, this paper focuses on the restoration of image data acquired through digital image technology, leveraging deep learning techniques, and using soft and hard rocks made of similar materials as research subjects, an improved Incremental Transformer image algorithm is employed to repair distorted or missing strain nephograms during uniaxial compression experiments. The concrete implementation entails using a comprehensive training set of strain nephograms derived from digital image technology, fabricating masks for absent image segments, and predicting strain nephograms with full strain detail. Additionally, we adopt deep separable convolutional networks to optimize the algorithm's operational efficiency. Based on this, the analysis of rock damage is conducted using the repaired strain nephograms, achieving a closer correlation with the actual physical processes of rock damage compared to conventional digital image technology and acoustic emission techniques. The improved incremental Transformer algorithm presented in this paper will contribute to enhancing the efficiency of digital image technology in the realm of rock damage, saving time and money, and offering an innovative approach to traditional rock damage analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
125. DEW-YOLO: An Efficient Algorithm for Steel Surface Defect Detection.
- Author
-
Li, Junjie and Chen, Mingxia
- Subjects
SURFACE defects ,STEEL strip ,STEEL ,FEATURE extraction ,ALGORITHMS - Abstract
To address the current steel surface defect detection algorithms in practical applications involving low detection accuracy, an efficient and highly accurate strip steel surface defect detection algorithm, DEW-YOLO, is proposed in this paper. Firstly, by combining the advantages of deformable convolutional networks (DCNs), this paper innovates the C2F module in YOLOv8 and proposes a C2f_DCN module that can flexibly sample features to enhance the abilities of learning and expressing defect features of different sizes and shapes. Secondly, the explicit visual center (EVC) is introduced into the backbone network, which enhances feature extraction capabilities and adaptability and enables the model to better adjust features at different levels and scales. Finally, the original loss function is replaced with the Wise-IoU (WIoU) loss function to accurately measure the similarity between the target frames and improve the defect detection performance of the model. The experimental results on the NEU-DET dataset demonstrate that the algorithms proposed in this paper achieved a mean average precision (mAP) of 80.3% in steel surface defect detection tasks, which was a 3.9% improvement over the original YOLOv8 model. The model's inference speed reached 91 frames per second (FPS). DEW-YOLO effectively enhances the accuracy of steel defect detection and better satisfies industrial inspection requirements. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
126. A Visible and Synthetic Aperture Radar Image Fusion Algorithm Based on a Transformer and a Convolutional Neural Network.
- Author
-
Hu, Liushun, Su, Shaojing, Zuo, Zhen, Wei, Junyu, Huang, Siyang, Zhao, Zongqing, Tong, Xiaozhong, and Yuan, Shudong
- Subjects
CONVOLUTIONAL neural networks ,SYNTHETIC aperture radar ,TRANSFORMER models ,IMAGE fusion ,SYNTHETIC apertures ,ALGORITHMS - Abstract
For visible and Synthetic Aperture Radar (SAR) image fusion, this paper proposes a visible and SAR image fusion algorithm based on a Transformer and a Convolutional Neural Network (CNN). Firstly, in this paper, the Restormer Block is used to extract cross-modal shallow features. Then, we introduce an improved Transformer–CNN Feature Extractor (TCFE) with a two-branch residual structure. This includes a Transformer branch that introduces the Lite Transformer (LT) and DropKey for extracting global features and a CNN branch that introduces the Convolutional Block Attention Module (CBAM) for extracting local features. Finally, the fused image is output based on global features extracted by the Transformer branch and local features extracted by the CNN branch. The experiments show that the algorithm proposed in this paper can effectively achieve the extraction and fusion of global and local features of visible and SAR images, so that high-quality visible and SAR fusion images can be obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
127. A Building Point Cloud Extraction Algorithm in Complex Scenes.
- Author
-
Su, Zhonghua, Peng, Jing, Feng, Dajian, Li, Shihua, Yuan, Yi, and Zhou, Guiyun
- Subjects
POINT cloud ,ALGORITHMS ,URBAN renewal ,CITIES & towns ,THREE-dimensional modeling - Abstract
Buildings are significant components of digital cities, and their precise extraction is essential for the three-dimensional modeling of cities. However, it is difficult to accurately extract building features effectively in complex scenes, especially where trees and buildings are tightly adhered. This paper proposes a highly accurate building point cloud extraction method based solely on the geometric information of points in two stages. The coarsely extracted building point cloud in the first stage is iteratively refined with the help of mask polygons and the region growing algorithm in the second stage. To enhance accuracy, this paper combines the Alpha Shape algorithm with the neighborhood expansion method to generate mask polygons, which help fill in missing boundary points caused by the region growing algorithm. In addition, this paper performs mask extraction on the original points rather than non-ground points to solve the problem of incorrect identification of facade points near the ground using the cloth simulation filtering algorithm. The proposed method has shown excellent extraction accuracy on the Urban-LiDAR and Vaihingen datasets. Specifically, the proposed method outperforms the PointNet network by 20.73% in precision for roof extraction of the Vaihingen dataset and achieves comparable performance with the state-of-the-art HDL-JME-GGO network. Additionally, the proposed method demonstrated high accuracy in extracting building points, even in scenes where buildings were closely adjacent to trees. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
128. Modeling and Analysis of Dekker-Based Mutual Exclusion Algorithms.
- Author
-
Nigro, Libero, Cicirelli, Franco, and Pupo, Francesco
- Subjects
DETERMINISTIC algorithms ,ALGORITHMS ,SCALABILITY ,TIME management - Abstract
Mutual exclusion is a fundamental problem in concurrent/parallel/distributed systems. The first pure-software solution to this problem for two processes, which is not based on hardware instructions like test-and-set, was proposed in 1965 by Th.J. Dekker and communicated by E.W. Dijkstra. The correctness of this algorithm has generally been studied under the strong memory model, where the read and write operations on a memory cell are atomic or indivisible. In recent years, some variants of the algorithm have been proposed to make it RW-safe when using the weak memory model, which makes it possible, e.g., for multiple read operations to occur simultaneously to a write operation on the same variable, with the read operations returning (flickering) a non-deterministic value. This paper proposes a novel approach to formal modeling and reasoning on a mutual exclusion algorithm using Timed Automata and the Uppaal tool, and it applies this approach through exhaustive model checking to conduct a thorough analysis of the Dekker's algorithm and some of its variants proposed in the literature. This paper aims to demonstrate that model checking, although necessarily limited in the scalability of the number N of the processes due to the state explosions problem, is effective yet powerful for reasoning on concurrency and process action interleaving, and it can provide significant results about the correctness and robustness of the basic version and variants of the Dekker's algorithm under both the strong and weak memory models. In addition, the properties of these algorithms are also carefully studied in the context of a tournament-based binary tree for N ≥ 2 processes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
129. Improved YOLOv8-Based Target Precision Detection Algorithm for Train Wheel Tread Defects.
- Author
-
Wen, Yu, Gao, Xiaorong, Luo, Lin, and Li, Jinlong
- Subjects
STAINS & staining ,WATER leakage ,ALGORITHMS ,WHEELS - Abstract
Train wheels are crucial components for ensuring the safety of trains. The accurate and fast identification of wheel tread defects is necessary for the timely maintenance of wheels, which is essential for achieving the premise of conditional repair. Image-based detection methods are commonly used for detecting tread defects, but they still have issues with the misdetection of water stains and the leaking of small defects. In this paper, we address the challenges posed by the detection of wheel tread defects by proposing improvements to the YOLOv8 model. Firstly, the impact of water stains on tread defect detection is avoided by optimising the structure of the detection layer. Secondly, an improved SPPCSPC module is introduced to enhance the detection of small targets. Finally, the SIoU loss function is used to accelerate the convergence speed of the network, which ensures defect recognition accuracy with high operational efficiency. Validation was performed on the constructed tread defect dataset. The results demonstrate that the enhanced YOLOv8 model in this paper outperforms the original network and significantly improves the tread defect detection indexes. The average precision, accuracy, and recall reached 96.95%, 96.30%, and 95.31%. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
130. Research on Fabric Defect Detection Algorithm Based on Improved YOLOv8n Algorithm.
- Author
-
Mei, Shunqi, Shi, Yishan, Gao, Heng, and Tang, Li
- Subjects
ALGORITHMS ,FEATURE extraction ,TEXTILES ,TEXTILE industry - Abstract
In the process of fabric production, various types of defects affect the quality of a fabric. However, due to the wide variety of fabric defects, the complexity of fabric textures, and the concealment of small target defects, current fabric defect detection algorithms suffer from issues such as having a slow detection speed, low detection accuracy, and a low recognition rate of small target defects. Therefore, developing an efficient and accurate fabric defect detection system has become an urgent problem that needs to be addressed in the textile industry. Addressing the aforementioned issues, this paper proposes an improved YOLOv8n-LAW algorithm based on the YOLOv8n algorithm. First, LSKNet attention mechanisms are added to both ends of the C2f module in the backbone network to provide a broader context area, enhancing the algorithm's feature extraction capability. Next, the PAN-FPN structure of the backbone network is replaced by the AFPN structure, so that the different levels of features of the defects are closer to the semantic information in the progressive fusion. Finally, the CIoU loss is replaced with the WIoU v3 loss, allowing the model to dynamically adjust gradient gains based on the features of fabric defects, effectively focusing on distinguishing between defective and non-defective regions. The experimental results show that the improved YOLOv8n-LAW algorithm achieved an accuracy of 97.4% and a detection speed of 46 frames per second, while effectively increasing the recognition rate of small target defects. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
131. An evaluation method for integrating EVs in distribution networks with clustering algorithms.
- Author
-
Chao, Lu, Yu, Lu, Yihua, Liu, Menghua, Deng, Yanjun, Chen, Ruochen, Duan, Yin, Wenqian, Qin, Zhijun, and Hou, Jiazuo
- Subjects
ELECTRIC vehicle charging stations ,EVALUATION methodology ,ELECTRIC vehicles ,ELECTRIC automobiles ,DATABASES ,ALGORITHMS - Abstract
Introduction: With the installation of advanced metering infrastructures, the operation data of EVs in the distribution networks can be obtained with time intervals of seconds and minutes. Based on these operation data, the impacts of integrating EVs into the distribution networks can be calculated and discussed. Methods: In this paper, an improved clustering algorithm with a new distance index for the daily curves of different types of EVs was proposed. The different types of EVs can be classified into several typical groups and the required number of operation scenarios can be reduced. After reducing the large-scale database to typical clusters, research can be conducted on the characteristics of EVs specific to certain scenarios. Results and discussion: In this way, the capability of integrating different types of EVs into the distribution network, such as fast EV charging stations, slow EV charging stations, and EV bus charging stations, is assessed from the perspective of load capacity size. The proposed clustering algorithm was verified with practical operation data. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
132. A Semantic Spatial Structure-Based Loop Detection Algorithm for Visual Environmental Sensing.
- Author
-
Cheng, Xina, Zhang, Yichi, Kang, Mengte, Wang, Jialiang, Jiao, Jianbin, Dong, Le, and Jiao, Licheng
- Subjects
ALGORITHMS ,SEMANTIC computing - Abstract
Loop closure detection is an important component of the Simultaneous Localization and Mapping (SLAM) algorithm, which is utilized in environmental sensing. It helps to reduce drift errors during long-term operation, improving the accuracy and robustness of localization. Such improvements are sorely needed, as conventional visual-based loop detection algorithms are greatly affected by significant changes in viewpoint and lighting conditions. In this paper, we present a semantic spatial structure-based loop detection algorithm. In place of feature points, robust semantic features are used to cope with the variation in the viewpoint. In consideration of the semantic features, which are region-based, we provide a corresponding matching algorithm. Constraints on semantic information and spatial structure are used to determine the existence of loop-back. A multi-stage pipeline framework is proposed to systematically leverage semantic information at different levels, enabling efficient filtering of potential loop closure candidates. To validate the effectiveness of our algorithm, we conducted experiments using the uHumans2 dataset. Our results demonstrate that, even when there are significant changes in viewpoint, the algorithm exhibits superior robustness compared to that of traditional loop detection methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
133. Bio-Inspired Intelligent Swarm Confrontation Algorithm for a Complex Urban Scenario.
- Author
-
Cai, He, Luo, Yaoguo, Gao, Huanli, and Wang, Guangbin
- Subjects
BIOLOGICALLY inspired computing ,MACHINE learning ,WILDLIFE films ,REINFORCEMENT learning ,ALGORITHMS - Abstract
This paper considers the confrontation problem for two tank swarms of equal size and capability in a complex urban scenario. Based on the Unity platform (2022.3.20f1c1), the confrontation scenario is constructed featuring multiple crossing roads. Through the analysis of a substantial amount of biological data and wildlife videos regarding animal behavioral strategies during confrontations for hunting or food competition, two strategies are been utilized to design a novel bio-inspired intelligent swarm confrontation algorithm. The first one is the "fire concentration" strategy, which assigns a target for each tank in a way that the isolated opponent will be preferentially attacked with concentrated firepower. The second one is the "back and forth maneuver" strategy, which makes the tank tactically retreat after firing in order to avoid being hit when the shell is reloading. Two state-of-the-art swarm confrontation algorithms, namely the reinforcement learning algorithm and the assign nearest algorithm, are chosen as the opponents for the bio-inspired swarm confrontation algorithm proposed in this paper. Data of comprehensive confrontation tests show that the bio-inspired swarm confrontation algorithm has significant advantages over its opponents from the aspects of both win rate and efficiency. Moreover, we discuss how vital algorithm parameters would influence the performance indices. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
134. Research on the Messenger UAV Mission Planning Based on Sampling Transformation Algorithm.
- Author
-
Wang, Benxiang, Xin, Bin, Ding, Yulong, and Li, Yang
- Subjects
AIR power (Military science) ,ALGORITHMS ,INTERNET of things ,AUTONOMOUS vehicles ,DRONE aircraft ,FACILITATED communication - Abstract
In recent years, there has been a significant development in unmanned platform technologies, specifically unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs). As a result, their application scenarios have expanded considerably. Unmanned platforms are considered integral components of the Internet of Things system. However, certain challenges arise when dealing with specialized tasks, such as navigating complex urban low-altitude terrain with multiple obstacles and limited communication capabilities. These challenges can greatly impact the efficiency of the system due to information isolation. To address this issue, a messenger drone mechanism is introduced in this paper, which utilizes air superiority to facilitate indirect communication between unmanned platforms. Additionally, a task sequence planning algorithm based on sampling transformation is designed. This algorithm efficiently assigns the drone to mobile UGVs by discretely sampling their paths and considering the UAV-UGV motion relationship. By transforming the problem into an asymmetric traveler problem, it allows for a fast solution. Finally, the effectiveness of the algorithm is verified through comparative analysis in different scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
135. Research on load frequency control of multi‐microgrids in an isolated system based on the multi‐agent soft actor‐critic algorithm.
- Author
-
Xie, Li Long, Li, Yonghui, Fan, Peixiao, Wan, Li, Zhang, Kanjun, and Yang, Jun
- Subjects
DEEP reinforcement learning ,REINFORCEMENT learning ,MULTIAGENT systems ,DISTRIBUTED algorithms ,ALGORITHMS ,FREQUENCY stability ,MICROGRIDS - Abstract
Load variation, distributed power output uncertainty and multi‐microgrids network complexity have brought great difficulties to the frequency stability of the whole microgrid. To address this problem, this paper uses a multi‐agent deep reinforcement learning(DRL) algorithm to design the controllers to control the frequency of the multi‐microgrids. Firstly, a load frequency control (LFC) model for multi‐microgrids was built. Secondly, based on the centralized training and decentralized execution (CTDE) multi‐agent reinforcement learning (RL) framework, the multi‐agent soft actor‐critic (MASAC) algorithm was designed and applied to the multi‐microgrids model. The state space and action space of multi‐agent were established according to the frequency deviation of every sub‐microgrid and the output of each distributed power source. The reward function was then established according to the frequency deviation. The appropriate neural network and training parameters were selected to generate the interconnected microgrid controllers through multiple training of pre‐learning. Finally, the simulation study shows that the MASAC controller proposed in this paper can quickly maintain frequency stability when the system is disturbed. Sensitivity analysis shows that the MASAC controller can effectively cope with the uncertainty of the system parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
136. Enhancing Small Object Detection in Aerial Images: A Novel Approach with PCSG Model.
- Author
-
An, Kang, Duanmu, Huiping, Wu, Zhiyang, Liu, Yuqiang, Qiao, Jingzhen, Shangguan, Qianqian, Song, Yaqing, and Xu, Xiaonong
- Subjects
FEATURE extraction ,URBAN transportation ,LIE detectors & detection ,SPINE ,ENVIRONMENTAL monitoring ,PIXELS ,ALGORITHMS - Abstract
Generalized target detection algorithms perform well for large- and medium-sized targets but struggle with small ones. However, with the growing importance of aerial images in urban transportation and environmental monitoring, detecting small targets in such imagery has been a promising research hotspot. The challenge in small object detection lies in the limited pixel proportion and the complexity of feature extraction. Moreover, current mainstream detection algorithms tend to be overly complex, leading to structural redundancy for small objects. To cope with these challenges, this paper recommends the PCSG model based on yolov5, which optimizes both the detection head and backbone networks. (1) An enhanced detection header is introduced, featuring a new structure that enhances the feature pyramid network and the path aggregation network. This enhancement bolsters the model's shallow feature reuse capability and introduces a dedicated detection layer for smaller objects. Additionally, redundant structures in the network are pruned, and the lightweight and versatile upsampling operator CARAFE is used to optimize the upsampling algorithm. (2) The paper proposes the module named SPD-Conv to replace the strided convolution operation and pooling structures in yolov5, thereby enhancing the backbone's feature extraction capability. Furthermore, Ghost convolution is utilized to optimize the parameter count, ensuring that the backbone meets the real-time needs of aerial image detection. The experimental results from the RSOD dataset show that the PCSG model exhibits superior detection performance. The value of mAP increases from 97.1% to 97.8%, while the number of model parameters decreases by 22.3%, from 1,761,871 to 1,368,823. These findings unequivocally highlight the effectiveness of this approach. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
137. A novel automatic annotation method for whole slide pathological images combined clustering and edge detection technique.
- Author
-
Ding, Wei‐long, Liao, Wan‐yin, Zhu, Xiao‐jie, and Zhu, Hong‐bo
- Subjects
SUPERVISED learning ,DEEP learning ,ANNOTATIONS ,IMAGE processing ,ALGORITHMS ,PIXELS - Abstract
Pixel‐level labeling of regions of interest in an image is a key step in building a labeled training dataset for supervised deep learning networks of images. However, traditional manual labeling of cancerous regions in digital pathological images by doctors is time‐consuming and inefficient. To address this issue, this paper proposes an automatic labeling method for whole slide images, which combines clustering and edge detection techniques. The proposed method utilizes the multi‐level feature fusion model and the Long‐Short Term Memory network to discriminate the cancerous nature of the whole slide images, thereby improving the classification accuracy of the whole slide images. Subsequently, the automatic labeling of cancerous regions is achieved by integrating a density‐based clustering algorithm and an edge point extraction algorithm, both based on the discriminated results of the cancerous properties of whole slide images. The experimental results demonstrate the effectiveness of the proposed method, which offers an efficient and accurate solution to the challenging task of cancerous region labeling in digital pathological images. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
138. Research on the Grounding Grid Electrical Impedance Imaging Algorithm Based on Improved Tikhonov and Lp Regularization.
- Author
-
Lele He, Lei Yang, Xiaoheng Yan, Weihua Chen, and Shangfei Huang
- Subjects
TIKHONOV regularization ,ELECTRICAL impedance tomography ,ELECTRIC power distribution grids ,INVERSE problems ,CONTRAST effect ,MATHEMATICAL regularization ,ALGORITHMS - Abstract
In this paper, an improved hybrid regularized grounded network imaging algorithm (ITR-Lp) combining Tikhonov regularization and Lp regularization is proposed; through the improvement of the filtering function, the correction of small magnitude for large singular values and increasing magnitude of correction with decreasing singular values for small singular values is implemented for the improvement of the convergence of the solution. The proposed algorithm constructs a regularization matrix to achieve selective correction of singular values and improve the convergence of the solution, while Lp regularization is used to enhance the sparsity of the solution and improve the boundary contrast. the effect of node distribution on convergence is investigated, and finally the ITR-Lp algorithm is validated by simulation and experiment. The results show that the ITR-Lp algorithm proposed in this paper achieves the lowest resistivity relative errors of 0.1695 and 0.1089 for resistive networks with 1 corrosion and 2 corrosions, respectively. The method has good convergence and boundary contrast, which effectively improves the pathology of the inverse problem of imaging the electrical impedance tomography of grounding grid. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
139. P2P Energy Trading of EVs Using Blockchain Technology in Centralized and Decentralized Networks: A Review.
- Author
-
Khan, Sara, Amin, Uzma, and Abu-Siada, Ahmed
- Subjects
BLOCKCHAINS ,SUSTAINABILITY ,ELECTRIC automobiles ,TRANSPORTATION industry ,ELECTRIC vehicles ,ALGORITHMS ,ELECTRICITY - Abstract
Peer-to-peer (P2P) energy trading has attracted a lot of attention and the number of electric vehicles (EVs) has increased in the past couple of years. Toward sustainable mobility, EVs meet the standard development goals (SDGs) for attaining a sustainable future in the transport sector. This development and increasing number of EVs creates an opportunity for prosumers to trade electricity. Considering this opportunity, this review article aims to provide an in-depth analysis of P2P energy trading of EVs using blockchain in centralized and decentralized networks, which enables prosumers to exchange energy directly with one another. The paper is aimed to provide the reader with a state-of-the-art review on the P2P energy trading for EVs, considering different blockchain algorithms that are practically implemented or still in the research phase. Moreover, the paper presents blockchain applications, current trends, and future challenges of EVs' energy trading. P2P energy trading for EVs using blockchain algorithms can be successfully implemented considering real-time scenarios and economically benefits smart sustainable societies. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
140. Design and Optimization of Power Shift Tractor Starting Control Strategy Based on PSO-ELM Algorithm.
- Author
-
Qian, Yu, Wang, Lin, and Lu, Zhixiong
- Subjects
CLUTCHES (Machinery) ,FARM tractors ,PARTICLE swarm optimization ,MACHINE learning ,FUZZY algorithms ,ALGORITHMS ,TRACTORS - Abstract
Power shift tractors have been widely used in agricultural tractors in recent years because of their advantages of uninterrupted power during shifting, high transmission efficiency and high stability. As one of the indispensable driving states of the power shift tractor, the starting process requires a small impact and a starting speed that meets the driver's requirements. In this paper, aiming at such contradictory requirements, the starting control strategy of a power shift tractor is formulated with the goal of starting quality and the driver's intention. Firstly, the identification characteristics of the driver under three starting intentions are obtained by a real vehicle test. An extreme learning machine with fast identification speed and short training time is used to establish the basic driver's intention identification model. For the instability of the identification results of the Extreme Learning Machine (ELM), the particle swarm optimization algorithm (PSO) is used to optimize the ELM. The optimized extreme learning machine model has an accuracy of 96.891% for driver's intention identification. The wet clutch is an important part of the power shift gearbox. In this paper, the starting control strategy knowledge base of the starting clutch is established by a combination of bench tests and simulation tests. Through the fuzzy algorithm, the driver's intention is combined with the starting control strategy. Different drivers' intentions will affect the comprehensive evaluation model of the clutch (the single evaluation index of the clutch is: the maximum sliding power, the sliding power, the speed stability time, the impact degree), thus affecting the final choice of the starting clutch control strategy considering the driver's intention. On this basis, this paper studies and establishes the MPC starting controller for the power shift gearbox. Compared with the linear control strategy, the PSO-ELM-fuzzy weight starting strategy proposed in this paper can reduce the maximum sliding friction power by 45%, the sliding friction power by 69.45%, and the speed stabilization time by 0.11 s. The effectiveness of the starting control strategy considering the driver's intention proposed in this paper to improve the starting quality of the power shift tractor is verified. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
141. DESIGN OF SMART HOME SYSTEM BASED ON WIRELESS SENSOR NETWORK LINK STATUS AWARENESS ALGORITHM.
- Author
-
RONG XU
- Subjects
INTELLIGENT sensors ,WIRELESS sensor networks ,SMART homes ,DOMESTIC architecture ,ROUTING algorithms ,ALGORITHMS - Abstract
When wireless sensor networks are used in smart homes, the connection state will be unstable due to signal masking attenuation. This will cause low packet rate, high time delay and high cost in the network. In this paper, a network routing algorithm for wireless sensing based on connection conditions is designed. Secondly, the expected number of sends is proposed to evaluate the stability of links. Based on this, the following network signal delivery situation is forecasted in real time and quickly. According to the estimated expected number of transmissions, the path is dynamically corrected to effectively avoid attenuation in the channel and achieve optimal system performance. Experimental results show that the method proposed in this paper can improve the efficiency of message sending and reduce the routing cost under the condition of masking effect. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
142. VIS-SLAM: A Real-Time Dynamic SLAM Algorithm Based on the Fusion of Visual, Inertial, and Semantic Information.
- Author
-
Wang, Yinglong, Liu, Xiaoxiong, Zhao, Minkun, and Xu, Xinlong
- Subjects
MOBILE robots ,MACHINE learning ,MOBILE learning ,DEEP learning ,ALGORITHMS ,INFORMATION measurement ,PROBABILITY theory ,GEOMETRY - Abstract
A deep learning-based Visual Inertial SLAM technique is proposed in this paper to ensure accurate autonomous localization of mobile robots in environments with dynamic objects. Addressing the limitations of real-time performance in deep learning algorithms and the poor robustness of pure visual geometry algorithms, this paper presents a deep learning-based Visual Inertial SLAM technique. Firstly, a non-blocking model is designed to extract semantic information from images. Then, a motion probability hierarchy model is proposed to obtain prior motion probabilities of feature points. For image frames without semantic information, a motion probability propagation model is designed to determine the prior motion probabilities of feature points. Furthermore, considering that the output of inertial measurements is unaffected by dynamic objects, this paper integrates inertial measurement information to improve the estimation accuracy of feature point motion probabilities. An adaptive threshold-based motion probability estimation method is proposed, and finally, the positioning accuracy is enhanced by eliminating feature points with excessively high motion probabilities. Experimental results demonstrate that the proposed algorithm achieves accurate localization in dynamic environments while maintaining real-time performance. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
143. Efficient load balancing Adaptive BNBKnapsack Algorithm for Edge computing to improve performance of network.
- Author
-
Nagle, Malti and Kumar, Prakash
- Subjects
NETWORK performance ,EDGE computing ,ALGORITHMS ,LOAD balancing (Computer networks) ,ENERGY consumption ,HOSPITALS ,ROUTING algorithms - Abstract
INTRODUCTION: In present days, Automation of everything has become essential. Internet of things (IoT) play an important role among all medical advances of IT. In this paper, feasible solutions are discussed to compare and design better healthcare systems. A thorough investigation and survey of suitable approaches were done to select IoT based systems in hospitals consisting of various high precision sensors. OBJECTIVES: The challenge healthcare system face is to manage the real time patient’s data with high accuracy. Second challenge is at fog devices level to manage the load distribution to all sensors with limited availability of bandwidth. METHODS: This paper summarizes the selection criterions of suitable load balancing algorithms to reduce energy consumption and computational cost of fog devices and increase the network usage that are supposed to be used in IoT based healthcare systems. According to the survey BNBKnapack algorithm has been selected as best suitable approach to analyze the overall performance of fog devices and results are also verify the same. RESULTS: Comparative analysis of Overall performance of fog devices has been proposed with using SJF algorithm and Adaptive BNBKnapsack algorithm. It has been observed by analysing system performance, which is found as best among other load balancing algorithm Adaptive BNBKnapsack is successfully reduce the energy consumption by (99.29%), computational cost by (98.34%) and increase the network usage by (99.95%) of system CONCLUSION: It has been observed by analysing system performance, Adaptive BNBKnapsack Load balancing is successfully able to reduce the computational cost and energy consumption also increase the network usage of the fog network. The performance of the system is found best among other load balancing algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
144. An Algorithm for Distracted Driving Recognition Based on Pose Features and an Improved KNN.
- Author
-
Gong, Yingjie and Shen, Xizhong
- Subjects
DISTRACTED driving ,MACHINE learning ,K-nearest neighbor classification ,ALGORITHMS ,DEEP learning ,TRAFFIC safety ,MOTOR vehicle driving - Abstract
To reduce safety accidents caused by distracted driving and address issues such as low recognition accuracy and deployment difficulties in current algorithms for distracted behavior detection, this paper proposes an algorithm that utilizes an improved KNN for classifying driver posture features to predict distracted driving behavior. Firstly, the number of channels in the Lightweight OpenPose network is pruned to predict and output the coordinates of key points in the upper body of the driver. Secondly, based on the principles of ergonomics, driving behavior features are modeled, and a set of five-dimensional feature values are obtained through geometric calculations. Finally, considering the relationship between the distance between samples and the number of samples, this paper proposes an adjustable distance-weighted KNN algorithm (ADW-KNN), which is used for classification and prediction. The experimental results show that the proposed algorithm achieved a recognition rate of 94.04% for distracted driving behavior on the public dataset SFD3, with a speed of up to 50FPS, superior to mainstream deep learning algorithms in terms of accuracy and speed. The superiority of ADW-KNN was further verified through experiments on other public datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
145. A novel differential evolution algorithm with multi-population and elites regeneration.
- Author
-
Cao, Yang and Luan, Jingzheng
- Subjects
DIFFERENTIAL evolution ,EVOLUTIONARY algorithms ,DISTRIBUTION (Probability theory) ,ALGORITHMS ,GLOBAL optimization - Abstract
Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. DE boasts several advantages, such as ease of implementation, reliability, speed, and adaptability. However, DE does have certain limitations, such as suboptimal solution exploitation and challenging parameter tuning. To address these challenges, this research paper introduces a novel algorithm called Enhanced Binary JADE (EBJADE), which combines differential evolution with multi-population and elites regeneration. The primary innovation of this paper lies in the introduction of strategy with enhanced exploitation capabilities. This strategy is based on utilizing the sorting of three vectors from the current generation to perturb the target vector. By introducing directional differences, guiding the search towards improved solutions. Additionally, this study adopts a multi-population method with a rewarding subpopulation to dynamically adjust the allocation of two different mutation strategies. Finally, the paper incorporates the sampling concept of elite individuals from the Estimation of Distribution Algorithm (EDA) to regenerate new solutions through the selection process in DE. Experimental results, using the CEC2014 benchmark tests, demonstrate the strong competitiveness and superior performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
146. Time–Frequency Signal Integrity Monitoring Algorithm Based on Temperature Compensation Frequency Bias Combination Model.
- Author
-
Guo, Yu, Li, Zongnan, Gong, Hang, Peng, Jing, and Ou, Gang
- Subjects
SIGNAL integrity (Electronics) ,TIME-frequency analysis ,ATOMIC clocks ,ARTIFICIAL satellites in navigation ,ALGORITHMS ,TIME measurements ,X chromosome - Abstract
To ensure the long-term stable and uninterrupted service of satellite navigation systems, the robustness and reliability of time–frequency systems are crucial. Integrity monitoring is an effective method to enhance the robustness and reliability of time–frequency systems. Time–frequency signals are fundamental for integrity monitoring, with their time differences and frequency biases serving as essential indicators. These indicators are influenced by the inherent characteristics of the time–frequency signals, as well as the links and equipment they traverse. Meanwhile, existing research primarily focuses on only monitoring the integrity of the time–frequency signals' output by the atomic clock group, neglecting the integrity monitoring of the time–frequency signals generated and distributed by the time–frequency signal generation and distribution subsystem. This paper introduces a time–frequency signal integrity monitoring algorithm based on the temperature compensation frequency bias combination model. By analyzing the characteristics of time difference measurements, constructing the temperature compensation frequency bias combination model, and extracting and monitoring noise and frequency bias features from the time difference measurements, the algorithm achieves comprehensive time–frequency signal integrity monitoring. Experimental results demonstrate that the algorithm can effectively detect, identify, and alert users to time–frequency signal faults. Additionally, the model and the integrity monitoring parameters developed in this paper exhibit high adaptability, making them directly applicable to the integrity monitoring of time–frequency signals across various links. Compared with traditional monitoring algorithms, the algorithm proposed in this paper greatly improves the effectiveness, adaptability, and real-time performance of time–frequency signal integrity monitoring. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
147. A novel improved total variation algorithm for the elimination of scratch-type defects in high-voltage cable cross-sections.
- Author
-
Yu, Aihua, Shan, Lina, Zhu, Wen, Jie, Jing, and Hou, Beiping
- Subjects
CABLES ,COMPUTER vision ,CROSS-sectional imaging ,IMAGE intensifiers ,ALGORITHMS ,PARTIAL discharges - Abstract
In the quality inspection process of high-voltage cables, several commonly used indicators include cable length, insulation thickness, and the number of conductors within the core. Among these factors, the count of conductors holds particular significance as a key determinant of cable quality. Machine vision technology has found extensive application in automatically detecting the number of conductors in cross-sectional images of high-voltage cables. However, the presence of scratch-type defects in cut high-voltage cable cross-sections can significantly compromise the precision of conductor count detection. To address this problem, this paper introduces a novel improved total variation (TV) algorithm, marking the first-ever application of the TV algorithm in this domain. Considering the staircase effect, the direct use of the TV algorithm is prone to cause serious loss of image edge information. The proposed algorithm firstly introduces multimodal features to effectively mitigate the staircase effect. While eliminating scratch-type defects, the algorithm endeavors to preserve the original image's edge information, consequently yielding a noteworthy enhancement in detection accuracy. Furthermore, a dataset was curated, comprising images of cross-sections of high-voltage cables of varying sizes, each displaying an assortment of scratch-type defects. Experimental findings conclusively demonstrate the algorithm's exceptional efficiency in eradicating diverse scratch-type defects within high-voltage cable cross-sections. The average scratch elimination rate surpasses 90%, with an impressive 96.15% achieved on cable sample 4. A series of conducted ablation experiments in this paper substantiate a significant enhancement in cable image quality. Notably, the Edge Preservation Index (EPI) exhibits an improvement of approximately 20%, resulting in a substantial boost to conductor count detection accuracy, thus effectively enhancing the quality of high-voltage cable production. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
148. FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP.
- Author
-
Leng, Fangling, Li, Fan, Bao, Yubin, Zhang, Tiancheng, and Yu, Ge
- Subjects
ALGORITHMS ,ISOMORPHISM (Mathematics) ,INFORMATION sharing ,PARALLEL algorithms ,DISTRIBUTED algorithms - Abstract
As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into the complexity of frequent subgraph mining and proposes a frequent subgraph mining (FSM) algorithm. This FSM algorithm is developed within a distributed graph iterative system, designed for the Big Cloud (BC) environment of the China Mobile Corp., and is based on the bulk synchronous parallel (BSP) model, named FSM-BC-BSP. Its aim is to address the challenge of mining frequent subgraphs within a single, large graph. This study advocates for the incorporation of a message sending and receiving mechanism to facilitate data sharing across various stages of the frequent subgraph mining algorithm. Additionally, it suggests employing a standard coded subgraph and sending it to the same node for global support calculation on the large graph. The adoption of the rightmost path expansion strategy in generating candidate subgraphs helps to mitigate the occurrence of redundant subgraphs. The use of standard coding ensures the unique identification of subgraphs, thus eliminating the need for isomorphism calculations. Support calculation is executed using the Minimum Image (MNI) measurement method, aligning with the downward closure attribute. The experimental results demonstrate the robust performance of the FSM-BC-BSP algorithm across diverse input datasets and parameter configurations. Notably, the algorithm exhibits exceptional efficacy, particularly in scenarios with low support requirements, showcasing its superior performance under such conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
149. A Hardware Implementation of the PID Algorithm Using Floating-Point Arithmetic.
- Author
-
Kulisz, Józef and Jokiel, Filip
- Subjects
FLOATING-point arithmetic ,DIGITAL signal processing ,GATE array circuits ,ALGORITHMS ,HARDWARE - Abstract
The purpose of the paper is to propose a new implementation of the PID (proportional–integral–derivative) algorithm in digital hardware. The proposed structure is optimized for cost. It follows a serialized, rather than parallel, scheme. It uses only one arithmetic block, performing the multiply-and-add operation. The calculations are carried out in a sequentially cyclic manner. The proposed circuit operates on standard single-precision (32-bit) floating-point numbers. It implements an extended PID formula, containing a non-ideal derivative component, and weighting coefficients, which enable reducing the influence of setpoint changes in the proportional and derivative components. The circuit was implemented in a Cyclone V FPGA (Field-Programmable Gate Array) device from Intel, Santa Clara, CA, USA. The proper operation of the circuit was verified in a simulation. For the specific implementation, which is reported in the paper, the sampling period of 516 ns was obtained, which means that the proposed solution is comparable in terms of speed with other hardware implementations of the PID algorithm operating on single-precision floating-point numbers. However, the presented solution is much more efficient in terms of cost. It uses 1173 LUT (Look-up Table) blocks, 1026 registers, and 1 DSP (Digital Signal Processing) block, i.e., about 30% of logic resources required by comparable solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
150. Differentiated Security Requirements: An Exploration of Microservice Placement Algorithms in Internet of Vehicles.
- Author
-
Zhang, Xing, Liang, Jun, Lu, Yuxi, Zhang, Peiying, and Bi, Yanxian
- Subjects
REINFORCEMENT learning ,TECHNOLOGICAL innovations ,ALGORITHMS ,INTERNET ,COMPUTER software development ,INTERNET of things - Abstract
In recent years, microservices, as an emerging technology in software development, have been favored by developers due to their lightweight and low-coupling features, and have been rapidly applied to the Internet of Things (IoT) and Internet of Vehicles (IoV), etc. Microservices deployed in each unit of the IoV use wireless links to transmit data, which exposes a larger attack surface, and it is precisely because of these features that the secure and efficient placement of microservices in the environment poses a serious challenge. Improving the security of all nodes in an IoV can significantly increase the service provider's operational costs and can create security resource redundancy issues. As the application of reinforcement learning matures, it is enabling faster convergence of algorithms by designing agents, and it performs well in large-scale data environments. Inspired by this, this paper firstly models the placement network and placement behavior abstractly and sets security constraints. The environment information is fully extracted, and an asynchronous reinforcement-learning-based algorithm is designed to improve the effect of microservice placement and reduce the security redundancy based on ensuring the security requirements of microservices. The experimental results show that the algorithm proposed in this paper has good results in terms of the fit of the security index with user requirements and request acceptance rate. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.