180 results
Search Results
2. Research on Human Posture Estimation Algorithm Based on YOLO-Pose.
- Author
-
Ding, Jing, Niu, Shanwei, Nie, Zhigang, and Zhu, Wenyu
- Subjects
- *
HUMAN experimentation , *POSTURE , *DRONE aircraft , *ALGORITHMS , *ANGLES - Abstract
In response to the numerous challenges faced by traditional human pose recognition methods in practical applications, such as dense targets, severe edge occlusion, limited application scenarios, complex backgrounds, and poor recognition accuracy when targets are occluded, this paper proposes a YOLO-Pose algorithm for human pose estimation. The specific improvements are divided into four parts. Firstly, in the Backbone section of the YOLO-Pose model, lightweight GhostNet modules are introduced to reduce the model's parameter count and computational requirements, making it suitable for deployment on unmanned aerial vehicles (UAVs). Secondly, the ACmix attention mechanism is integrated into the Neck section to improve detection speed during object judgment and localization. Furthermore, in the Head section, key points are optimized using coordinate attention mechanisms, significantly enhancing key point localization accuracy. Lastly, the paper improves the loss function and confidence function to enhance the model's robustness. Experimental results demonstrate that the improved model achieves a 95.58% improvement in mAP50 and a 69.54% improvement in mAP50-95 compared to the original model, with a reduction of 14.6 M parameters. The model achieves a detection speed of 19.9 ms per image, optimized by 30% and 39.5% compared to the original model. Comparisons with other algorithms such as Faster R-CNN, SSD, YOLOv4, and YOLOv7 demonstrate varying degrees of performance improvement. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. A Hybrid Swarming Algorithm for Adaptive Enhancement of Low-Illumination Images.
- Author
-
Zhang, Yi, Liu, Xinyu, and Lv, Yang
- Subjects
- *
PARTICLE swarm optimization , *IMAGE intensifiers , *HEURISTIC algorithms , *ALGORITHMS , *VISUAL perception - Abstract
This paper presents an improved swarming algorithm that enhances low-illumination images. The algorithm combines a hybrid Harris Eagle algorithm with double gamma (IHHO-BIGA) and incomplete beta (IHHO-NBeta) functions. This paper integrates the concept of symmetry into the improvement steps of the image adaptive enhancement algorithm. The enhanced algorithm integrates chaotic mapping for population initialization, a nonlinear formula for prey energy calculation, spiral motion from the black widow algorithm for global search enhancement, a nonlinear inertia weight factor inspired by particle swarm optimization, and a modified Levy flight strategy to prevent premature convergence to local optima. This paper compares the algorithm's performance with other swarm intelligence algorithms using commonly used test functions. The algorithm's performance is compared against several emerging swarm intelligence algorithms using commonly used test functions, with results demonstrating its superior performance. The improved Harris Eagle algorithm is then applied for image adaptive enhancement, and its effectiveness is evaluated on five low-illumination images from the LOL dataset. The proposed method is compared to three common image enhancement techniques and the IHHO-BIGA and IHHO-NBeta methods. The experimental results reveal that the proposed approach achieves optimal visual perception and enhanced image evaluation metrics, outperforming the existing techniques. Notably, the standard deviation data of the first image show that the IHHO-NBeta method enhances the image by 8.26%, 120.91%, 126.85%, and 164.02% compared with IHHO-BIGA, the single-scale Retinex enhancement method, the homomorphic filtering method, and the limited contrast adaptive histogram equalization method, respectively. The processing time of the improved method is also better than the previous heuristic algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. Anomaly Detection in Blockchain Networks Using Unsupervised Learning: A Survey.
- Author
-
Cholevas, Christos, Angeli, Eftychia, Sereti, Zacharoula, Mavrikos, Emmanouil, and Tsekouras, George E.
- Subjects
- *
DATA structures , *MACHINE learning , *PRIVATE networks , *BLOCKCHAINS , *ALGORITHMS - Abstract
In decentralized systems, the quest for heightened security and integrity within blockchain networks becomes an issue. This survey investigates anomaly detection techniques in blockchain ecosystems through the lens of unsupervised learning, delving into the intricacies and going through the complex tapestry of abnormal behaviors by examining avant-garde algorithms to discern deviations from normal patterns. By seamlessly blending technological acumen with a discerning gaze, this survey offers a perspective on the symbiotic relationship between unsupervised learning and anomaly detection by reviewing this problem with a categorization of algorithms that are applied to a variety of problems in this field. We propose that the use of unsupervised algorithms in blockchain anomaly detection should be viewed not only as an implementation procedure but also as an integration procedure, where the merits of these algorithms can effectively be combined in ways determined by the problem at hand. In that sense, the main contribution of this paper is a thorough study of the interplay between various unsupervised learning algorithms and how this can be used in facing malicious activities and behaviors within public and private blockchain networks. The result is the definition of three categories, the characteristics of which are recognized in terms of the way the respective integration takes place. When implementing unsupervised learning, the structure of the data plays a pivotal role. Therefore, this paper also provides an in-depth presentation of the data structures commonly used in unsupervised learning-based blockchain anomaly detection. The above analysis is encircled by a presentation of the typical anomalies that have occurred so far along with a description of the general machine learning frameworks developed to deal with them. Finally, the paper spotlights challenges and directions that can serve as a comprehensive compendium for future research efforts. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. The Algorithm of Gu and Eisenstat and D-Optimal Design of Experiments.
- Author
-
Forbes, Alistair
- Subjects
- *
OPTIMAL designs (Statistics) , *EXPERIMENTAL design , *FACTORIZATION , *ALGORITHMS - Abstract
This paper addresses the following problem: given m potential observations to determine n parameters, m > n , what is the best choice of n observations. The problem can be formulated as finding the n × n submatrix of the complete m × n observation matrix that has maximum determinant. An algorithm by Gu and Eisenstat for a determining a strongly rank-revealing QR factorisation of a matrix can be adapted to address this latter formulation. The algorithm starts with an initial selection of n rows of the observation matrix and then performs a sequence of row interchanges, with the determinant of the current submatrix strictly increasing at each step until no further improvement can be made. The algorithm implements rank-one updating strategies, which leads to a compact and efficient algorithm. The algorithm does not necessarily determine the global optimum but provides a practical approach to designing an effective measurement strategy. In this paper, we describe how the Gu–Eisenstat algorithm can be adapted to address the problem of optimal experimental design and used with the QR algorithm with column pivoting to provide effective designs. We also describe implementations of sequential algorithms to add further measurements that optimise the information gain at each step. We illustrate performance on several metrology examples. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. 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
7. Channel Prediction for Underwater Acoustic Communication: A Review and Performance Evaluation of Algorithms.
- Author
-
Liu, Haotian, Ma, Lu, Wang, Zhaohui, and Qiao, Gang
- Subjects
- *
DEEP learning , *UNDERWATER acoustic communication , *MACHINE learning , *ALGORITHMS , *TELECOMMUNICATION systems , *FORECASTING - Abstract
Underwater acoustic (UWA) channel prediction technology, as an important topic in UWA communication, has played an important role in UWA adaptive communication network and underwater target perception. Although many significant advancements have been achieved in underwater acoustic channel prediction over the years, a comprehensive summary and introduction is still lacking. As the first comprehensive overview of UWA channel prediction, this paper introduces past works and algorithm implementation methods of channel prediction from the perspective of linear, kernel-based, and deep learning approaches. Importantly, based on available at-sea experiment datasets, this paper compares the performance of current primary UWA channel prediction algorithms under a unified system framework, providing researchers with a comprehensive and objective understanding of UWA channel prediction. Finally, it discusses the directions and challenges for future research. The survey finds that linear prediction algorithms are the most widely applied, and deep learning, as the most advanced type of algorithm, has moved this field into a new stage. The experimental results show that the linear algorithms have the lowest computational complexity, and when the training samples are sufficient, deep learning algorithms have the best prediction performance. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
8. A Lightweight Remote Sensing Small Target Image Detection Algorithm Based on Improved YOLOv8.
- Author
-
Nie, Haijiao, Pang, Huanli, Ma, Mingyang, and Zheng, Ruikai
- Subjects
- *
OBJECT recognition (Computer vision) , *ALGORITHMS , *REMOTE-sensing images , *REMOTE sensing - Abstract
In response to the challenges posed by small objects in remote sensing images, such as low resolution, complex backgrounds, and severe occlusions, this paper proposes a lightweight improved model based on YOLOv8n. During the detection of small objects, the feature fusion part of the YOLOv8n algorithm retrieves relatively fewer features of small objects from the backbone network compared to large objects, resulting in low detection accuracy for small objects. To address this issue, firstly, this paper adds a dedicated small object detection layer in the feature fusion network to better integrate the features of small objects into the feature fusion part of the model. Secondly, the SSFF module is introduced to facilitate multi-scale feature fusion, enabling the model to capture more gradient paths and further improve accuracy while reducing model parameters. Finally, the HPANet structure is proposed, replacing the Path Aggregation Network with HPANet. Compared to the original YOLOv8n algorithm, the recognition accuracy of mAP@0.5 on the VisDrone data set and the AI-TOD data set has increased by 14.3% and 17.9%, respectively, while the recognition accuracy of mAP@0.5:0.95 has increased by 17.1% and 19.8%, respectively. The proposed method reduces the parameter count by 33% and the model size by 31.7% compared to the original model. Experimental results demonstrate that the proposed method can quickly and accurately identify small objects in complex backgrounds. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
9. 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
10. Methane Retrieval Algorithms Based on Satellite: A Review.
- Author
-
Jiang, Yuhan, Zhang, Lu, Zhang, Xingying, and Cao, Xifeng
- Subjects
- *
REMOTE sensing , *METHANE , *THEMATIC mapper satellite , *GLOBAL warming , *CARBON dioxide , *ALGORITHMS , *SPATIAL resolution - Abstract
As the second most predominant greenhouse gas, methane-targeted emission mitigation holds the potential to decelerate the pace of global warming. Satellite remote sensing is an important monitoring tool, and we review developments in the satellite detection of methane. This paper provides an overview of the various types of satellites, including the various instrument parameters, and describes the different types of satellite retrieval algorithms. In addition, the currently popular methane point source quantification method is presented. Based on existing research, we delineate the classification of methane remote sensing satellites into two overarching categories: area flux mappers and point source imagers. Area flux mappers primarily concentrate on the assessment of global or large-scale methane concentrations, with a further subclassification into active remote sensing satellites (e.g., MERLIN) and passive remote sensing satellites (e.g., TROPOMI, GOSAT), contingent upon the remote sensing methodology employed. Such satellites are mainly based on physical models and the carbon dioxide proxy method for the retrieval of methane. Point source imagers, in contrast, can detect methane point source plumes using their ultra-high spatial resolution. Subcategories within this classification include multispectral imagers (e.g., Sentinel-2, Landsat-8) and hyperspectral imagers (e.g., PRISMA, GF-5), contingent upon their spectral resolution disparities. Area flux mappers are mostly distinguished by their use of physical algorithms, while point source imagers are dominated by data-driven methods. Furthermore, methane plume emissions can be accurately quantified through the utilization of an integrated mass enhancement model. Finally, a prediction of the future trajectory of methane remote sensing satellites is presented, in consideration of the current landscape. This paper aims to provide basic theoretical support for subsequent scientific research. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
11. Efficient Algorithm for Proportional Lumpability and Its Application to Selfish Mining in Public Blockchains.
- Author
-
Piazza, Carla, Rossi, Sabina, and Smuseva, Daria
- Subjects
- *
POLYNOMIAL time algorithms , *MARKOV processes , *BLOCKCHAINS , *ALGORITHMS , *STOCHASTIC models , *PETRI nets - Abstract
This paper explores the concept of proportional lumpability as an extension of the original definition of lumpability, addressing the challenges posed by the state space explosion problem in computing performance indices for large stochastic models. Lumpability traditionally relies on state aggregation techniques and is applicable to Markov chains demonstrating structural regularity. Proportional lumpability extends this idea, proposing that the transition rates of a Markov chain can be modified by certain factors, resulting in a lumpable new Markov chain. This concept facilitates the derivation of precise performance indices for the original process. This paper establishes the well-defined nature of the problem of computing the coarsest proportional lumpability that refines a given initial partition, ensuring a unique solution exists. Additionally, a polynomial time algorithm is introduced to solve this problem, offering valuable insights into both the concept of proportional lumpability and the broader realm of partition refinement techniques. The effectiveness of proportional lumpability is demonstrated through a case study that consists of designing a model to investigate selfish mining behaviors on public blockchains. This research contributes to a better understanding of efficient approaches for handling large stochastic models and highlights the practical applicability of proportional lumpability in deriving exact performance indices. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
12. Simplified V/f Control Algorithm for Reduction of Current Fluctuations in Variable-Speed Operation of Induction Motors.
- Author
-
Son, Dong-Hyeok and Kim, Sung-An
- Subjects
- *
CURRENT fluctuations , *INDUCTION motors , *HIGHPASS electric filters , *MOTOR drives (Electric motors) , *ALGORITHMS - Abstract
This paper introduces a straightforward control strategy aimed at the reduction of current fluctuations within the low-frequency domain of open-loop V/f control in induction motor drives. Traditional control techniques necessitate the addition of a current compensator based on motor parameters and the use of digital filters such as band-pass or high-pass filters. These methods, however, rely on precise motor parameters and involve complex filter design and implementation. The proposed control is capable of suppressing current fluctuations without controlling the slip of the induction motor. The proposed control strategy generates the forced rotation angle and command input voltage using the V/f block and outputs the d-axis voltage using a proportional integral controller to keep the d-axis current constant at zero. The difference between the command input voltage and the d-axis voltage is applied as the q-axis voltage and then applied through SVPWM. In order to verify the effectiveness of the proposed control, the proposed control is implemented and analyzed using power simulation based on the results of the analysis of the causes of current fluctuations in the induction motor. Finally, the effect of suppressing current fluctuations of the induction motor is verified through experimental results. In the 10~19 Hz range, where the conventional V/f control method resulted in current fluctuation rates exceeding 10% and peaking at 113.3% at 13 Hz, the proposed method suppressed the fluctuation rate to below 8.6% across all frequencies. This paper validates the effectiveness of the proposed control strategy through these results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
13. Evaluation of a Condition Monitoring Algorithm for Early Bearing Fault Detection.
- Author
-
Gruber, Hannes, Fuchs, Anna, and Bader, Michael
- Subjects
- *
ROLLER bearings , *BREAKDOWNS (Machinery) , *OUTLIER detection , *TRACKING algorithms , *FAILED states , *ALGORITHMS , *ABSOLUTE value , *FAST Fourier transforms - Abstract
Roller bearings are critical components in various mechanical systems, and the timely detection of potential failures is essential for preventing costly downtimes and avoiding substantial machinery breakdown. This research focuses on finding and verifying a robust method that can detect failures early, without creating false positive failure states. Therefore, this paper introduces a novel algorithm for the early detection of roller bearing failures, particularly tailored to high-precision bearings and automotive test bed systems. The featured method (AFI—Advanced Failure Indicator) utilizes the Fast Fourier Transform (FFT) of wideband accelerometers to calculate the spectral content of vibration signals emitted by roller bearings. By calculating the frequency bands and tracking the movement of these bands within the spectra, the method provides an indicator of the machinery's health, mainly focusing on the early stages of bearing failure. The calculated channel can be used as a trend indicator, enabling the method to identify subtle deviations associated with impending failures. The AFI algorithm incorporates a non-static limit through moving average calculations and volatility analysis methods to determine critical changes in the signal. This thresholding mechanism ensures the algorithm's responsiveness to variations in operating conditions and environmental factors, contributing to its robustness in diverse industrial settings. Further refinement was achieved through an outlier detection filter, which reduces false positives and enhances the algorithm's accuracy in identifying genuine deviations from the normal operational state. To benchmark the developed algorithm, it was compared with three industry-standard algorithms: VRMS calculations per ISO 10813-3, Mean Absolute Value of Extremums (MAVE), and Envelope Frequency Band (EFB). This comparative analysis aimed to evaluate the efficacy of the novel algorithm against the established methods in the field, providing valuable insights into its potential advantages and limitations. In summary, this paper presents an innovative algorithm for the early detection of roller bearing failures, leveraging FFT-based spectral analysis, trend monitoring, adaptive thresholding, and outlier detection. Its ability to confirm the first failure state underscores the algorithm's effectiveness. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
14. Recent Developments in Iterative Algorithms for Digital Metrics.
- Author
-
Shaheen, Aasma, Batool, Afshan, Ali, Amjad, Sulami, Hamed Al, and Hussain, Aftab
- Subjects
- *
DIGITAL technology , *DIGITAL mapping , *DIGITAL maps , *ALGORITHMS - Abstract
This paper aims to provide a comprehensive analysis of the advancements made in understanding Iterative Fixed-Point Schemes, which builds upon the concept of digital contraction mappings. Additionally, we introduce the notion of an Iterative Fixed-Point Schemes in digital metric spaces. In this study, we extend the idea of Iteration process Mann, Ishikawa, Agarwal, and Thakur based on the ϝ-Stable Iterative Scheme in digital metric space. We also design some fractal images, which frame the compression of Fixed-Point Iterative Schemes and contractive mappings. Furthermore, we present a concrete example that exemplifies the motivation behind our investigations. Moreover, we provide an application of the proposed Fractal image and Sierpinski triangle that compress the works by storing images as a collection of digital contractions, which addresses the issue of storing images with less storage memory in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
15. Multi-Objective Advantage Actor-Critic Algorithm for Hybrid Disassembly Line Balancing with Multi-Skilled Workers.
- Author
-
Wang, Jiacun, Xi, Guipeng, Guo, Xiwang, Qin, Shujin, and Han, Henry
- Subjects
- *
ALGORITHMS , *REINFORCEMENT learning , *DETERMINISTIC algorithms , *CARBON emissions , *GENETIC algorithms , *REINFORCEMENT (Psychology) - Abstract
The scheduling of disassembly lines is of great importance to achieve optimized productivity. In this paper, we address the Hybrid Disassembly Line Balancing Problem that combines linear disassembly lines and U-shaped disassembly lines, considering multi-skilled workers, and targeting profit and carbon emissions. In contrast to common approaches in reinforcement learning that typically employ weighting strategies to solve multi-objective problems, our approach innovatively incorporates non-dominated ranking directly into the reward function. The exploration of Pareto frontier solutions or better solutions is moderated by comparing performance between solutions and dynamically adjusting rewards based on the occurrence of repeated solutions. The experimental results show that the multi-objective Advantage Actor-Critic algorithm based on Pareto optimization exhibits superior performance in terms of metrics superiority in the comparison of six experimental cases of different scales, with an excellent metrics comparison rate of 70%. In some of the experimental cases in this paper, the solutions produced by the multi-objective Advantage Actor-Critic algorithm show some advantages over other popular algorithms such as the Deep Deterministic Policy Gradient Algorithm, the Soft Actor-Critic Algorithm, and the Non-Dominated Sorting Genetic Algorithm II. This further corroborates the effectiveness of our proposed solution. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
16. Optimum Fractional Tilt Based Cascaded Frequency Stabilization with MLC Algorithm for Multi-Microgrid Assimilating Electric Vehicles.
- Author
-
Noman, Abdullah M., Aly, Mokhtar, Alqahtani, Mohammed H., Almutairi, Sulaiman Z., Aljumah, Ali S., Ebeed, Mohamed, and Mohamed, Emad A.
- Subjects
- *
OPTIMIZATION algorithms , *SUPPLY & demand , *LIVER cancer , *ALGORITHMS , *MICROGRIDS , *ELECTRIC vehicles - Abstract
An important issue in interconnected microgrids (MGs) is the realization of balance between the generation side and the demand side. Imbalanced generation and load demands lead to security, power quality, and reliability issues. The load frequency control (LFC) is accountable for regulating MG frequency against generation/load disturbances. This paper proposed an optimized fractional order (FO) LFC scheme with cascaded outer and inner control loops. The proposed controller is based on a cascaded one plus tilt derivative (1+TD) in the outer loop and an FO tilt integrator-derivative with a filter (FOTIDF) in the inner loop, forming the cascaded (1+TD/FOTIDF) controller. The proposed 1+TD/FOTIDF achieves better disturbance rejection compared with traditional LFC methods. The proposed 1+TD/FOTIDF scheme is optimally designed using a modified version of the liver cancer optimization algorithm (MLCA). In this paper, a new modified liver cancer optimization algorithm (MLCA) is proposed to overcome the shortcomings of the standard Liver cancer optimization algorithm (LCA), which contains the early convergence to local optima and the debility of its exploration process. The proposed MLCA is based on three improvement mechanisms, including chaotic mutation (CM), quasi-oppositional based learning (QOBL), and the fitness distance balance (FDB). The proposed MLCA method simultaneously adjusts and selects the best 1+TD/FOTIDF parameters to achieve the best control performance of MGs. Obtained results are compared to other designed FOTID, TI/FOTID, and TD/FOTID controllers. Moreover, the contribution of electric vehicles and the high penetration of renewables are considered with power system parameter uncertainty to test the stability of the proposed 1+TD/FOTIDF LFC technique. The obtained results under different possible load/generation disturbance scenarios confirm a superior response and improved performance of the proposed 1+TD/FOTIDF and the proposed MLCA-based optimized LFC controller. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
17. Research on Microgrid Optimal Dispatching Based on a Multi-Strategy Optimization of Slime Mould Algorithm.
- Author
-
Zhang, Yi and Zhou, Yangkun
- Subjects
- *
MICROGRIDS , *ELECTRIC power distribution grids , *SWARM intelligence , *ENERGY consumption , *WIND power , *ALGORITHMS - Abstract
In order to cope with the problems of energy shortage and environmental pollution, carbon emissions need to be reduced and so the structure of the power grid is constantly being optimized. Traditional centralized power networks are not as capable of controlling and distributing non-renewable energy as distributed power grids. Therefore, the optimal dispatch of microgrids faces increasing challenges. This paper proposes a multi-strategy fusion slime mould algorithm (MFSMA) to tackle the microgrid optimal dispatching problem. Traditional swarm intelligence algorithms suffer from slow convergence, low efficiency, and the risk of falling into local optima. The MFSMA employs reverse learning to enlarge the search space and avoid local optima to overcome these challenges. Furthermore, adaptive parameters ensure a thorough search during the algorithm iterations. The focus is on exploring the solution space in the early stages of the algorithm, while convergence is accelerated during the later stages to ensure efficiency and accuracy. The salp swarm algorithm's search mode is also incorporated to expedite convergence. MFSMA and other algorithms are compared on the benchmark functions, and the test showed that the effect of MFSMA is better. Simulation results demonstrate the superior performance of the MFSMA for function optimization, particularly in solving the 24 h microgrid optimal scheduling problem. This problem considers multiple energy sources such as wind turbines, photovoltaics, and energy storage. A microgrid model based on the MFSMA is established in this paper. Simulation of the proposed algorithm reveals its ability to enhance energy utilization efficiency, reduce total network costs, and minimize environmental pollution. The contributions of this paper are as follows: (1) A comprehensive microgrid dispatch model is proposed. (2) Environmental costs, operation and maintenance costs are taken into consideration. (3) Two modes of grid-tied operation and island operation are considered. (4) This paper uses a multi-strategy optimized slime mould algorithm to optimize scheduling, and the algorithm has excellent results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
18. Convergence of High-Order Derivative-Free Algorithms for the Iterative Solution of Systems of Not Necessarily Differentiable Equations.
- Author
-
Regmi, Samundra, Argyros, Ioannis K., and George, Santhosh
- Subjects
- *
DIFFERENTIABLE dynamical systems , *EQUATIONS , *BANACH spaces , *ALGORITHMS - Abstract
In this study, we extended the applicability of a derivative-free algorithm to encompass the solution of operators that may be either differentiable or non-differentiable. Conditions weaker than the ones in earlier studies are employed for the convergence analysis. The earlier results considered assumptions up to the existence of the ninth order derivative of the main operator, even though there are no derivatives in the algorithm, and the Taylor series on the finite Euclidian space restricts the applicability of the algorithm. Moreover, the previous results could not be used for non-differentiable equations, although the algorithm could converge. The new local result used only conditions on the divided difference in the algorithm to show the convergence. Moreover, the more challenging semi-local convergence that had not previously been studied was considered using majorizing sequences. The paper included results on the upper bounds of the error estimates and domains where there was only one solution for the equation. The methodology of this paper is applicable to other algorithms using inverses and in the setting of a Banach space. Numerical examples further validate our approach. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
19. An Improved Discrete Bat Algorithm for Multi-Objective Partial Parallel Disassembly Line Balancing Problem.
- Author
-
Zhang, Qi, Xing, Yang, Yao, Man, Wang, Jiacun, Guo, Xiwang, Qin, Shujin, Qi, Liang, and Huang, Fuguang
- Subjects
- *
WASTE recycling , *CORPORATE profits , *ALGORITHMS - Abstract
Product disassembly is an effective means of waste recycling and reutilization that has received much attention recently. In terms of disassembly efficiency, the number of disassembly skills possessed by workers plays a crucial role in improving disassembly efficiency. Therefore, in order to effectively and reasonably disassemble discarded products, this paper proposes a partial parallel disassembly line balancing problem (PP-DLBP) that takes into account the number of worker skills. In this paper, the disassembly tasks and the disassembly relationships between components are described using AND–OR graphs. In this paper, a multi-objective optimization model is established aiming to maximize the net profit of disassembly and minimize the number of skills for the workers. Based on the bat algorithm (BA), we propose an improved discrete bat algorithm (IDBA), which involves designing adaptive composite optimization operators to replace the original continuous formula expressions and applying them to solve the PP-DLBP. To demonstrate the advantages of IDBA, we compares it with NSGA-II, NSGA-III, SPEA-II, ESPEA, and MOEA/D. Experimental results show that IDBA outperforms the other five algorithms in real disassembly cases and exhibits high efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
20. Towards a Simplified and Cost-Effective Diagnostic Algorithm for the Surveillance of Intraductal Papillary Mucinous Neoplasms (IPMNs): Can We Save Contrast for Later?
- Author
-
Brandi, Nicolò and Renzulli, Matteo
- Subjects
- *
PUBLIC health surveillance , *PANCREATIC cysts , *COST benefit analysis , *PANCREAS , *TUMORS , *ALGORITHMS , *CONTRAST media - Abstract
Simple Summary: The increased detection of pancreatic cysts in recent years has triggered extensive diagnostic investigations to clarify their potential risk of malignancy, resulting in a large number of patients undergoing numerous imaging follow-up studies for many years. Therefore, there is a growing need for optimization of the current surveillance protocol to provide a practical and reasonable solution in the face of an ever-growing demand. The aim of this paper is to discuss the current available evidence on whether the implementation of unenhanced abbreviated-MRI (A-MRI) protocols for cystic pancreatic lesion surveillance could improve healthcare economics and reduce waiting lists in clinical practice without significantly reducing diagnostic accuracy. The increased detection of pancreatic cysts in recent years has triggered extensive diagnostic investigations to clarify their potential risk of malignancy, resulting in a large number of patients undergoing numerous imaging follow-up studies for many years. Therefore, there is a growing need for optimization of the current surveillance protocol to reduce both healthcare costs and waiting lists, while still maintaining appropriate sensibility and specificity. Imaging is an essential tool for evaluating patients with intraductal papillary mucinous neoplasms (IPMNs) since it can assess several predictors for malignancy and thus guide further management recommendations. Although contrast-enhanced magnetic resonance imaging (MRI) with magnetic resonance cholangiopancreatography (MRCP) has been widely recommended by most international guidelines, recent results support the use of unenhanced abbreviated-MRI (A-MRI) protocols as a surveillance tool in patients with IPMN. In fact, A-MRI has shown high diagnostic performance in malignant detection, with high sensitivity and specificity as well as excellent interobserver agreement. The aim of this paper is, therefore, to discuss the current available evidence on whether the implementation of an abbreviated-MRI (A-MRI) protocol for cystic pancreatic lesion surveillance could improve healthcare economics and reduce waiting lists in clinical practice without significantly reducing diagnostic accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
21. An Extended Polar Format Algorithm for Joint Envelope and Phase Error Correction in Widefield Staring SAR with Maneuvering Trajectory.
- Author
-
Liang, Yujie, Liang, Yi, Wang, Xiaoge, Li, Junhui, and Xing, Mengdao
- Subjects
- *
SYNTHETIC aperture radar , *ERROR correction (Information theory) , *KALMAN filtering , *ALGORITHMS , *AZIMUTH - Abstract
Polar format algorithm (PFA) is a widely used high-resolution SAR imaging algorithm that can be implemented in advanced widefield staring synthetic aperture radar (WFS-SAR). However, existing algorithms have limited analysis in wavefront curvature error (WCE) and are challenging to apply to WFS-SAR with high-resolution and large-swath scenes. This paper proposes an extended polar format algorithm for joint envelope and phase error correction in WFS-SAR imaging with maneuvering trajectory. The impact of the WCE and residual acceleration error (RAE) are analyzed in detail by deriving the specific wavenumber domain signal based on the mapping relationship between the geometry space and wavenumber space. Subsequently, this paper improves the traditional WCE compensation function and introduces a new range cell migration (RCM) recalibration function for joint envelope and phase error correction. The 2D precisely focused SAR image is acquired based on the spatially variant inverse filtering in the final. Simulation experiments validate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
22. Variable Selection in Data Analysis: A Synthetic Data Toolkit.
- Author
-
Mitra, Rohan, Ali, Eyad, Varam, Dara, Sulieman, Hana, and Kamalov, Firuz
- Subjects
- *
DATA analysis , *MATHEMATICAL analysis , *MATHEMATICAL models , *ALGORITHMS - Abstract
Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). To evaluate FSAs effectively, controlled environments are required, and the use of synthetic datasets offers significant advantages. We introduce a set of ten synthetically generated datasets with known relevance, redundancy, and irrelevance of features, derived from various mathematical, logical, and geometric sources. Additionally, eight FSAs are evaluated on these datasets based on their relevance and novelty. The paper first introduces the datasets and then provides a comprehensive experimental analysis of the performance of the selected FSAs on these datasets including testing the FSAs' resilience on two types of induced data noise. The analysis has guided the grouping of the generated datasets into four groups of data complexity. Lastly, we provide public access to the generated datasets to facilitate bench-marking of new feature selection algorithms in the field via our Github repository. The contributions of this paper aim to foster the development of novel feature selection algorithms and advance their study. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
23. ST-HO: Symmetry-Enhanced Energy-Efficient DAG Task Offloading Algorithm in Intelligent Transport System.
- Author
-
Gao, Zhibin, Luo, Gaoyu, Zhan, Shanhao, Liu, Bang, Huang, Lianfen, and Chao, Han-Chieh
- Subjects
- *
INTELLIGENT transportation systems , *OPTIMIZATION algorithms , *DIRECTED acyclic graphs , *ENERGY consumption , *ALGORITHMS - Abstract
In Intelligent Transport Systems (ITSs), Internet of Vehicles (IoV) communications and computation offloading technology have been introduced to assist with the burdensome sensing task processing, thus prompting a new design paradigm called mobile sensing–communication–computation (MSCC) synergy. Most researchers have focused on offloading strategy design to reduce energy consumption or execution costs, but ignore the intrinsic characteristics of tasks, which may lead to poor performance. This paper studies the offloading strategy of vehicle MSCC tasks represented by a Directed Acyclic Graph (DAG) structure. According to the DAG dependency of the subtasks, this paper proposes a computation offloading strategy to optimize energy consumption under time constraints. An energy consumption model for task execution is established. Then, the Simulated Annealing and Tabu Search hybrid optimization algorithm (ST-HO) is designed to solve the problem of minimizing the energy consumption. Crucially, this research integrates the concept of symmetry into the typical DAG structure of MSCC tasks, ensuring the integrity and efficiency of task execution in ITS. The simulation results show that ST-HO reduces energy consumption by at least 5.58% compared to the conventional algorithm. Particularly, the convergence speed of ST-HO is improved by 52.63% when the replication strategy of symmetric task is considered. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. A Multichannel, Multipulse, Multiweight Block-Adaptive Quantization (3MBAQ) Algorithm Based on Space-Borne Multichannel SAR Doppler Domain A-BAQ.
- Author
-
Jiang, Tao, Zhang, Chengwei, Zhang, Fubo, Wan, Yangliang, and Chen, Longyong
- Subjects
- *
SIGNAL reconstruction , *ALGORITHMS , *AZIMUTH , *DATA compression - Abstract
Amid the conflict between the current huge data volumes and the requirement for large-compression-ratio compression in space-borne multichannel SAR, this paper proposes a data compression method that uses the adaptive bit allocation BAQ method in the Doppler domain of space-borne multichannel SAR. Specifically, 3MBAQ, which denotes multichannel, multipulse, multiweight block-adaptive quantization, performs signal reconstruction through a Krieger filter to obtain the Doppler spectrum under azimuthal multichannel and multipulse conditions and then achieves nonuniform bit allocation by using the multiple weight contributions between subband spectra. Furthermore, large-compression-ratio compression can be realized in homogeneous scenarios by using the adaptive bit allocation BAQ method together with the improved bit error control (BEC) algorithm. In this paper, the effectiveness of the 3MBAQ method is verified on GF3 measured data. Moreover, compared to the SQNR and NMSE of the BAQ, A-BAQ, A-BAQ-BEC, MCBAQ-ASQ, and MCBAQ-BEC methods under the same conditions, it is shown that there is an optimal 1.3434 dB improvement in SQNR and a 0.0241 improvement in NMSE using the 3MBAQ algorithm, and the complexity of the algorithm for 3MBAQ is O (N 2 l o g (N)) , which is within acceptable limits, clearly proving the superiority of the 3MBAQ method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
25. A Novel Zero-Velocity Interval Detection Algorithm for a Pedestrian Navigation System with Foot-Mounted Inertial Sensors.
- Author
-
Wang, Xiaotao, Li, Jiacheng, Xu, Guangfei, and Wang, Xingyu
- Subjects
- *
INERTIAL navigation systems , *PEDESTRIANS , *HUMAN mechanics , *MOTION , *ALGORITHMS , *RUNNING speed , *DETECTORS , *WALKING speed - Abstract
The zero-velocity update (ZUPT) algorithm is a pivotal advancement in pedestrian navigation accuracy, utilizing foot-mounted inertial sensors. Its key issue hinges on accurately identifying periods of zero-velocity during human movement. This paper introduces an innovative adaptive sliding window technique, leveraging the Fourier Transform to precisely isolate the pedestrian's gait frequency from spectral data. Building on this, the algorithm adaptively adjusts the zero-velocity detection threshold in accordance with the identified gait frequency. This adaptation significantly refines the accuracy in detecting zero-velocity intervals. Experimental evaluations reveal that this method outperforms traditional fixed-threshold approaches by enhancing precision and minimizing false positives. Experiments on single-step estimation show the adaptability of the algorithm to motion states such as slow, fast, and running. Additionally, the paper demonstrates pedestrian trajectory localization experiments under a variety of walking conditions. These tests confirm that the proposed method substantially improves the performance of the ZUPT algorithm, highlighting its potential for pedestrian navigation systems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
26. Mathematically Improved XGBoost Algorithm for Truck Hoisting Detection in Container Unloading.
- Author
-
Wu, Nian, Hu, Wenshan, Liu, Guo-Ping, and Lei, Zhongcheng
- Subjects
- *
LOADING & unloading , *TRUCKS , *ALGORITHMS , *WEATHER , *TRUCK loading & unloading , *MATHEMATICAL models , *SHIPPING containers - Abstract
Truck hoisting detection constitutes a key focus in port security, for which no optimal resolution has been identified. To address the issues of high costs, susceptibility to weather conditions, and low accuracy in conventional methods for truck hoisting detection, a non-intrusive detection approach is proposed in this paper. The proposed approach utilizes a mathematical model and an extreme gradient boosting (XGBoost) model. Electrical signals, including voltage and current, collected by Hall sensors are processed by the mathematical model, which augments their physical information. Subsequently, the dataset filtered by the mathematical model is used to train the XGBoost model, enabling the XGBoost model to effectively identify abnormal hoists. Improvements were observed in the performance of the XGBoost model as utilized in this paper. Finally, experiments were conducted at several stations. The overall false positive rate did not exceed 0.7% and no false negatives occurred in the experiments. The experimental results demonstrated the excellent performance of the proposed approach, which can reduce the costs and improve the accuracy of detection in container hoisting. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. Economic Dispatch Optimization Strategies and Problem Formulation: A Comprehensive Review.
- Author
-
Marzbani, Fatemeh and Abdelfatah, Akmal
- Subjects
- *
EVIDENCE gaps , *MATHEMATICAL optimization , *COMPUTER performance , *ENERGY management , *ALGORITHMS - Abstract
Economic Dispatch Problems (EDP) refer to the process of determining the power output of generation units such that the electricity demand of the system is satisfied at a minimum cost while technical and operational constraints of the system are satisfied. This procedure is vital in the efficient energy management of electricity networks since it can ensure the reliable and efficient operation of power systems. As power systems transition from conventional to modern ones, new components and constraints are introduced to power systems, making the EDP increasingly complex. This highlights the importance of developing advanced optimization techniques that can efficiently handle these new complexities to ensure optimal operation and cost-effectiveness of power systems. This review paper provides a comprehensive exploration of the EDP, encompassing its mathematical formulation and the examination of commonly used problem formulation techniques, including single and multi-objective optimization methods. It also explores the progression of paradigms in economic dispatch, tracing the journey from traditional methods to contemporary strategies in power system management. The paper categorizes the commonly utilized techniques for solving EDP into four groups: conventional mathematical approaches, uncertainty modelling methods, artificial intelligence-driven techniques, and hybrid algorithms. It identifies critical research gaps, a predominant focus on single-case studies that limit the generalizability of findings, and the challenge of comparing research due to arbitrary system choices and formulation variations. The present paper calls for the implementation of standardized evaluation criteria and the inclusion of a diverse range of case studies to enhance the practicality of optimization techniques in the field. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. Siamese Tracking Network with Spatial-Semantic-Aware Attention and Flexible Spatiotemporal Constraint.
- Author
-
Zhang, Huanlong, Wang, Panyun, Zhang, Jie, Wang, Fengxian, Song, Xiaohui, and Zhou, Hebin
- Subjects
- *
ARTIFICIAL satellite tracking , *ALGORITHMS - Abstract
Siamese trackers based on classification and regression have drawn extensive attention due to their appropriate balance between accuracy and efficiency. However, most of them are prone to failure in the face of abrupt motion or appearance changes. This paper proposes a Siamese-based tracker that incorporates spatial-semantic-aware attention and flexible spatiotemporal constraint. First, we develop a spatial-semantic-aware attention model, which identifies the importance of each feature region and channel to target representation through the single convolution attention network with a loss function and increases the corresponding weights in the spatial and channel dimensions to reinforce the target region and semantic information on the target feature map. Secondly, considering that the traditional method unreasonably weights the target response in abrupt motion, we design a flexible spatiotemporal constraint. This constraint adaptively adjusts the constraint weights on the response map by evaluating the tracking result. Finally, we propose a new template updating the strategy. This strategy adaptively adjusts the contribution weights of the tracking result to the new template using depth correlation assessment criteria, thereby enhancing the reliability of the template. The Siamese network used in this paper is a symmetric neural network with dual input branches sharing weights. The experimental results on five challenging datasets show that our method outperformed other advanced algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
29. A Fair Energy Allocation Algorithm for IRS-Assisted Cognitive MISO Wireless-Powered Networks.
- Author
-
Gao, Chuanzhe, Li, Shidang, Wei, Mingsheng, Duan, Siyi, and Xu, Jinsong
- Subjects
- *
OPTIMIZATION algorithms , *SPECTRUM allocation , *MISO , *WIRELESS communications , *ALGORITHMS , *COGNITIVE radio , *POWER transmission , *BANDWIDTH allocation , *INTERNET of things - Abstract
With the rapid development of wireless communication networks and Internet of Things technology (IoT), higher requirements have been put forward for spectrum resource utilization and system performance. In order to further improve the utilization of spectrum resources and system performance, this paper proposes an intelligent reflecting surface (IRS)-assisted fair energy allocation algorithm for cognitive multiple-input single-output (MISO) wireless-powered networks. The goal of this paper is to maximize the minimum energy receiving power in the energy receiver, which is constrained by the signal-to-interference-plus-noise ratio (SINR) threshold of the information receiver in the secondary network, the maximum transmission power at the cognitive base station (CBS), and the interference power threshold of the secondary network on the main network. Due to the coupling between variables, this paper uses iterative optimization algorithms to optimize and solve different variables. That is, when solving the active beamforming variables, the passive beamforming variables are fixed; then, the obtained active beamforming variables are fixed, and the passive beamforming variables are solved. Through continuous iterative optimization, the system converges. The simulation results have verified the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. Disparities in Breast Cancer Diagnostics: How Radiologists Can Level the Inequalities.
- Author
-
Pesapane, Filippo, Tantrige, Priyan, Rotili, Anna, Nicosia, Luca, Penco, Silvia, Bozzini, Anna Carla, Raimondi, Sara, Corso, Giovanni, Grasso, Roberto, Pravettoni, Gabriella, Gandini, Sara, and Cassano, Enrico
- Subjects
- *
BREAST tumor diagnosis , *OCCUPATIONAL roles , *HEALTH policy , *DIVERSITY & inclusion policies , *EQUALITY , *HEALTH services accessibility , *MINORITIES , *GENDER affirming care , *TELERADIOLOGY , *ARTIFICIAL intelligence , *RADIATION , *DIAGNOSTIC imaging , *LABOR supply , *CULTURAL competence , *HEALTH , *COMMUNICATION , *HEALTH equity , *PHYSICIANS , *ALGORITHMS - Abstract
Simple Summary: This paper delves into the persistent issue of unequal access to medical imaging, with a particular focus on breast cancer screening and its impact on marginalized communities and racial/ethnic minorities. Central to our discussion is the role of scientific mobility among radiologists in fostering healthcare policy changes that promote diversity and cultural competence. We propose various strategies to bridge this gap, including cultural education, sensitivity training, and diversifying the radiology workforce. These measures aim to improve communication with diverse patient groups and reduce healthcare disparities. Additionally, we explore the challenges and advantages of teleradiology as a means to extend medical imaging services to underserved areas. In the context of artificial intelligence, we emphasize the critical need to validate algorithms across diverse populations to ensure unbiased and equitable healthcare outcomes. Overall, this paper underscores the importance of international collaboration in addressing global access barriers, presenting it as a key to mitigating disparities in medical imaging access and contributing to the pursuit of equitable healthcare. Access to medical imaging is pivotal in healthcare, playing a crucial role in the prevention, diagnosis, and management of diseases. However, disparities persist in this scenario, disproportionately affecting marginalized communities, racial and ethnic minorities, and individuals facing linguistic or cultural barriers. This paper critically assesses methods to mitigate these disparities, with a focus on breast cancer screening. We underscore scientific mobility as a vital tool for radiologists to advocate for healthcare policy changes: it not only enhances diversity and cultural competence within the radiology community but also fosters international cooperation and knowledge exchange among healthcare institutions. Efforts to ensure cultural competency among radiologists are discussed, including ongoing cultural education, sensitivity training, and workforce diversification. These initiatives are key to improving patient communication and reducing healthcare disparities. This paper also highlights the crucial role of policy changes and legislation in promoting equal access to essential screening services like mammography. We explore the challenges and potential of teleradiology in improving access to medical imaging in remote and underserved areas. In the era of artificial intelligence, this paper emphasizes the necessity of validating its models across a spectrum of populations to prevent bias and achieve equitable healthcare outcomes. Finally, the importance of international collaboration is illustrated, showcasing its role in sharing insights and strategies to overcome global access barriers in medical imaging. Overall, this paper offers a comprehensive overview of the challenges related to disparities in medical imaging access and proposes actionable strategies to address these challenges, aiming for equitable healthcare delivery. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. Remote Sensing Image Retrieval Algorithm for Dense Data.
- Author
-
Li, Xin, Liu, Shibin, and Liu, Wei
- Subjects
- *
IMAGE retrieval , *GREEDY algorithms , *INFORMATION retrieval , *ALGORITHMS , *DATA quality - Abstract
With the rapid development of remote sensing technology, remote sensing products have found increasingly widespread applications across various fields. Nevertheless, as the volume of remote sensing image data continues to grow, traditional data retrieval techniques have encountered several challenges such as substantial query results, data overlap, and variations in data quality. Users need to manually browse and filter a large number of remote sensing datasets, which is a cumbersome and inefficient process. In order to cope with these problems of traditional remote sensing image retrieval methods, this paper proposes a remote sensing image retrieval algorithm for dense data (DD-RSIRA). The algorithm establishes evaluation metrics based on factors like imaging time, cloud coverage, and image coverage. The algorithm utilizes the global grids to create an ensemble coverage relation between images and grids. A locally optimal initial solution is obtained by a greedy algorithm, and then a local search is performed to search for the optimal solution by combining the strategies of weighted gain-loss scheme and novel mechanism. Ultimately, it achieves an optimal coverage of remote sensing images within the region of interest. In this paper, it is shown that the method obtains a smaller number of datasets with lower redundancy and higher data utilization and ensures the data quality to a certain extent in order to accurately meet the requirements of the regional coverage of remote sensing images. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Personalized Management of Malignant and Non-Malignant Ectopic Mediastinal Thyroid: A Proposed 10-Item Algorithm Approach.
- Author
-
Carsote, Mara, Ciobica, Mihai-Lucian, Sima, Oana-Claudia, Ciuche, Adrian, Popa-Velea, Ovidiu, Stanciu, Mihaela, Popa, Florina Ligia, and Nistor, Claudiu
- Subjects
- *
MEDIASTINUM , *TERATOMA , *THYROID gland tumors , *THYROID gland , *NEEDLE biopsy , *INDIVIDUALIZED medicine , *ALGORITHMS , *CONNECTIVE tissues , *THYROIDECTOMY - Abstract
Simple Summary: A large body of multidisciplinary evidence involves the topic of thyroid cancer (the most common endocrine malignancy). Nevertheless, exceptional findings such as thyroid cancer in ectopic thyroid tissue, representing 0.3–0.5% of the malignant neoplasia with any location, suggest even greater challenges. Awareness remains the key operative element since the index of suspicion is low, especially in non-cervical areas. Hence, currently, the ectopic thyroid remains a matter of individualized management. The ectopic mediastinal thyroid (EMT) is part of the less frequent sublingual ectopic sites. Here, we introduce the most complex analysis in published EMT data (N = 117 patients) that identified an unexpectedly high rate of malignancy (18.8%), papillary cancer being the most frequent histological type. A rate of 5.98% amid all EMTs represented individuals confirmed with unrelated (non-thyroid) malignancies. Thyroid anomalies (other than EMT presence) were reported in 38.33% of the benign EMT, while the overall malignancy rate in EMTs was higher than expected according to prior data when compared to other ectopic sites. We aimed to analyze the management of the ectopic mediastinal thyroid (EMT) with respect to EMT-related cancer and non-malignant findings related to the pathological report, clinical presentation, imaging traits, endocrine profile, connective tissue to the cervical (eutopic) thyroid gland, biopsy or fine needle aspiration (FNA) results, surgical techniques and post-operatory outcome. This was a comprehensive review based on revising any type of freely PubMed-accessible English, full-length original papers including the keywords "ectopic thyroid" and "mediastinum" from inception until March 2024. We included 89 original articles that specified EMTs data. We classified them into four main groups: (I) studies/case series (n = 10; N = 36 EMT patients); (II) malignant EMTs (N = 22 subjects; except for one newborn with immature teratoma in the EMT, only adults were reported; mean age of 62.94 years; ranges: 34 to 90 years; female to male ratio of 0.9). Histological analysis in adults showed the following: papillary (N = 11/21); follicular variant of the papillary type (N = 2/21); Hürthle cell thyroid follicular malignancy (N = 1/21); poorly differentiated (N = 1/21); anaplastic (N = 2/21); medullary (N = 1/21); lymphoma (N = 2/21); and MALT (mucosa-associated lymphoid tissue) (N = 1/21); (III) benign EMTs with no thyroid anomalies (N = 37 subjects; mean age of 56.32 years; ranges: 30 to 80 years; female to male ratio of 1.8); (IV) benign EMTs with thyroid anomalies (N = 23; female to male ratio of 5.6; average age of 52.1 years). This panel involved clinical/subclinical hypothyroidism (iatrogenic, congenital, thyroiditis-induced, and transitory type upon EMT removal); thyrotoxicosis (including autonomous activity in EMTs that suppressed eutopic gland); autoimmune thyroiditis/Graves's disease; nodules/multinodular goiter and cancer in eutopic thyroid or prior thyroidectomy (before EMT detection). We propose a 10-item algorithm that might help navigate through the EMT domain. To conclude, across this focused-sample analysis (to our knowledge, the largest of its kind) of EMTs, the EMT clinical index of suspicion remains low; a higher rate of cancer is reported than prior data (18.8%), incident imagery-based detection was found in 10–14% of the EMTs; surgery offered an overall good outcome. A wide range of imagery, biopsy/FNA and surgical procedures is part of an otherwise complex personalized management. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. Novel Imaging Approaches for Glioma Classification in the Era of the World Health Organization 2021 Update: A Scoping Review.
- Author
-
Richter, Vivien, Ernemann, Ulrike, and Bender, Benjamin
- Subjects
- *
GLIOMAS , *RADIOMICS , *MAGNETIC resonance imaging , *DESCRIPTIVE statistics , *SYSTEMATIC reviews , *LITERATURE reviews , *DEEP learning , *GENETIC mutation , *NEURORADIOLOGY , *MACHINE learning , *DATA analysis software , *ALGORITHMS - Abstract
Simple Summary: The 2021 WHO classification of central nervous system (CNS) tumors is challenging for neuroradiologists due to the central role of the molecular profile of tumors. We performed a scoping review of recent literature to assess the existing data on the power of novel data analysis tools to predict new tumor classes by imaging. We found room for performance improvement for subgroups with lower incidence (e.g., 1p/19q codeleted or IDH1/2 mutated gliomas) and patients with rare diagnoses (e.g., pediatric gliomas, midline gliomas). More data regarding functional MRI techniques need to be collected. Studies explicitly designed to assess the generalizability of AI-aided tools for predicting molecular tumor subgroups are lacking. The 2021 WHO classification of CNS tumors is a challenge for neuroradiologists due to the central role of the molecular profile of tumors. The potential of novel data analysis tools in neuroimaging must be harnessed to maintain its role in predicting tumor subgroups. We performed a scoping review to determine current evidence and research gaps. A comprehensive literature search was conducted regarding glioma subgroups according to the 2021 WHO classification and the use of MRI, radiomics, machine learning, and deep learning algorithms. Sixty-two original articles were included and analyzed by extracting data on the study design and results. Only 8% of the studies included pediatric patients. Low-grade gliomas and diffuse midline gliomas were represented in one-third of the research papers. Public datasets were utilized in 22% of the studies. Conventional imaging sequences prevailed; data on functional MRI (DWI, PWI, CEST, etc.) are underrepresented. Multiparametric MRI yielded the best prediction results. IDH mutation and 1p/19q codeletion status prediction remain in focus with limited data on other molecular subgroups. Reported AUC values range from 0.6 to 0.98. Studies designed to assess generalizability are scarce. Performance is worse for smaller subgroups (e.g., 1p/19q codeleted or IDH1/2 mutated gliomas). More high-quality study designs with diversity in the analyzed population and techniques are needed. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
34. MRD-YOLO: A Multispectral Object Detection Algorithm for Complex Road Scenes.
- Author
-
Sun, Chaoyue, Chen, Yajun, Qiu, Xiaoyang, Li, Rongzhen, and You, Longxiang
- Subjects
- *
OBJECT recognition (Computer vision) , *FEATURE extraction , *INFRARED imaging , *ALGORITHMS , *DETECTION alarms - Abstract
Object detection is one of the core technologies for autonomous driving. Current road object detection mainly relies on visible light, which is prone to missed detections and false alarms in rainy, night-time, and foggy scenes. Multispectral object detection based on the fusion of RGB and infrared images can effectively address the challenges of complex and changing road scenes, improving the detection performance of current algorithms in complex scenarios. However, previous multispectral detection algorithms suffer from issues such as poor fusion of dual-mode information, poor detection performance for multi-scale objects, and inadequate utilization of semantic information. To address these challenges and enhance the detection performance in complex road scenes, this paper proposes a novel multispectral object detection algorithm called MRD-YOLO. In MRD-YOLO, we utilize interaction-based feature extraction to effectively fuse information and introduce the BIC-Fusion module with attention guidance to fuse different modal information. We also incorporate the SAConv module to improve the model's detection performance for multi-scale objects and utilize the AIFI structure to enhance the utilization of semantic information. Finally, we conduct experiments on two major public datasets, FLIR_Aligned and M3FD. The experimental results demonstrate that compared to other algorithms, the proposed algorithm achieves superior detection performance in complex road scenes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
35. Intelligent Vehicle Path Planning Based on Optimized A* Algorithm.
- Author
-
Chu, Liang, Wang, Yilin, Li, Shibo, Guo, Zhiqi, Du, Weiming, Li, Jinwei, and Jiang, Zewei
- Subjects
- *
COST functions , *TRAJECTORY optimization , *ALGORITHMS , *AUTONOMOUS vehicles , *PROBLEM solving - Abstract
With the rapid development of the intelligent driving technology, achieving accurate path planning for unmanned vehicles has become increasingly crucial. However, path planning algorithms face challenges when dealing with complex and ever-changing road conditions. In this paper, aiming at improving the accuracy and robustness of the generated path, a global programming algorithm based on optimization is proposed, while maintaining the efficiency of the traditional A* algorithm. Firstly, turning penalty function and obstacle raster coefficient are integrated into the search cost function to increase the adaptability and directionality of the search path to the map. Secondly, an efficient search strategy is proposed to solve the problem that trajectories will pass through sparse obstacles while reducing spatial complexity. Thirdly, a redundant node elimination strategy based on discrete smoothing optimization effectively reduces the total length of control points and paths, and greatly reduces the difficulty of subsequent trajectory optimization. Finally, the simulation results, based on real map rasterization, highlight the advanced performance of the path planning and the comparison among the baselines and the proposed strategy showcases that the optimized A* algorithm significantly enhances the security and rationality of the planned path. Notably, it reduces the number of traversed nodes by 84%, the total turning angle by 39%, and shortens the overall path length to a certain extent. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. A Co-Localization Algorithm for Underwater Moving Targets with an Unknown Constant Signal Propagation Speed and Platform Errors.
- Author
-
Liu, Yang, He, Long, Fan, Gang, Wang, Xue, and Zhang, Ya
- Subjects
- *
ACOUSTIC localization , *SPEED , *ALGORITHMS , *SPEED of sound - Abstract
Underwater mobile acoustic source target localization encounters several challenges, including the unknown propagation speed of the source signal, uncertainty in the observation platform's position and velocity (i.e., platform systematic errors), and economic costs. This paper proposes a new two-step closed-form localization algorithm that jointly estimates the angle of arrival (AOA), time difference of arrival (TDOA), and frequency difference of arrival (FDOA) to address these challenges. The algorithm initially introduces auxiliary variables to construct pseudo-linear equations to obtain the initial solution. It then exploits the relationship between the unknown and auxiliary variables to derive the exact solution comprising solely the unknown variables. Both theoretical analyses and simulation experiments demonstrate that the proposed method accurately estimates the position, velocity, and speed of the sound source even with an unknown sound speed and platform systematic errors. It achieves asymptotic optimality within a reasonable error range to approach the Cramér–Rao lower bound (CRLB). Furthermore, the algorithm exhibits low complexity, reduces the number of required localization platforms, and decreases the economic costs. Additionally, the simulation experiments validate the effectiveness of the proposed localization method across various scenarios, outperforming other comparative algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
37. Real-Time Recognition Algorithm of Small Target for UAV Infrared Detection.
- Author
-
Zhang, Qianqian, Zhou, Li, and An, Junshe
- Subjects
- *
ALGORITHMS , *DRONE aircraft , *PROBLEM solving - Abstract
Unmanned Aerial Vehicle (UAV) infrared detection has problems such as weak and small targets, complex backgrounds, and poor real-time detection performance. It is difficult for general target detection algorithms to achieve the requirements of a high detection rate, low missed detection rate, and high real-time performance. In order to solve these problems, this paper proposes an improved small target detection method based on Picodet. First, to address the problem of poor real-time performance, an improved lightweight LCNet network was introduced as the backbone network for feature extraction. Secondly, in order to solve the problems of high false detection rate and missed detection rate due to weak targets, the Squeeze-and-Excitation module was added and the feature pyramid structure was improved. Experimental results obtained on the HIT-UAV public dataset show that the improved detection model's real-time frame rate increased by 31 fps and the average accuracy (MAP) increased by 7%, which proves the effectiveness of this method for UAV infrared small target detection. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. Implementation of a Long Short-Term Memory Neural Network-Based Algorithm for Dynamic Obstacle Avoidance.
- Author
-
Mulás-Tejeda, Esmeralda, Gómez-Espinosa, Alfonso, Escobedo Cabello, Jesús Arturo, Cantoral-Ceballos, Jose Antonio, and Molina-Leal, Alejandra
- Subjects
- *
MOBILE robots , *HUMAN-robot interaction , *AUTONOMOUS robots , *ANGULAR velocity , *LINEAR velocity , *MOTION capture (Human mechanics) , *ALGORITHMS - Abstract
Autonomous mobile robots are essential to the industry, and human–robot interactions are becoming more common nowadays. These interactions require that the robots navigate scenarios with static and dynamic obstacles in a safely manner, avoiding collisions. This paper presents a physical implementation of a method for dynamic obstacle avoidance using a long short-term memory (LSTM) neural network that obtains information from the mobile robot's LiDAR for it to be capable of navigating through scenarios with static and dynamic obstacles while avoiding collisions and reaching its goal. The model is implemented using a TurtleBot3 mobile robot within an OptiTrack motion capture (MoCap) system for obtaining its position at any given time. The user operates the robot through these scenarios, recording its LiDAR readings, target point, position inside the MoCap system, and its linear and angular velocities, all of which serve as the input for the LSTM network. The model is trained on data from multiple user-operated trajectories across five different scenarios, outputting the linear and angular velocities for the mobile robot. Physical experiments prove that the model is successful in allowing the mobile robot to reach the target point in each scenario while avoiding the dynamic obstacle, with a validation accuracy of 98.02%. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. Analysis of Ferroresonance Mitigation Effectiveness in Auxiliary Power Systems of High-Voltage Substations.
- Author
-
Tarko, Rafał, Nowak, Wiesław, Gajdzica, Jakub, and Czapp, Stanislaw
- Subjects
- *
OVERCURRENT protection , *OVERVOLTAGE , *ALGORITHMS - Abstract
Ferroresonance in power networks is a dangerous phenomenon, which may result in overcurrents and overvoltages, causing damage to power equipment and the faulty operation of protection systems. For this reason, the possibility of the occurrence of ferroresonance has to be identified, and adequate methods need to be incorporated to eliminate or reduce its effects. The aim of this paper is to evaluate the effectiveness of ferroresonance damping in auxiliary power systems of high-voltage substations by selected damping devices. Laboratory experiments, the results of which created bases for the development of models of selected damping devices, are presented. These models were used to simulate the effectiveness of ferroresonance damping in an auxiliary power system of a 220/110 kV substation in the EMTP-ATP program. The analyses showed that control systems with different algorithms of operation are used in damping devices. This knowledge is important when selecting parameters and settings of the applied damping devices for a given network and the disturbances in it. The presented research results have proved the effectiveness of commercially available damping devices, provided their parameters are correctly coordinated with the settings of the power system protection. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
40. UAV Complex-Scene Single-Target Tracking Based on Improved Re-Detection Staple Algorithm.
- Author
-
Huang, Yiqing, Huang, He, Niu, Mingbo, Miah, Md Sipon, Wang, Huifeng, and Gao, Tao
- Subjects
- *
TRACKING radar , *TRACKING algorithms , *ALGORITHMS , *REMOTE sensing - Abstract
With the advancement of remote sensing technology, the demand for the accurate monitoring and tracking of various targets utilizing unmanned aerial vehicles (UAVs) is increasing. However, challenges such as object deformation, motion blur, and object occlusion during the tracking process could significantly affect tracking performance and ultimately lead to tracking drift. To address this issue, this paper introduces a high-precision target-tracking method with anomaly tracking status detection and recovery. An adaptive feature fusion strategy is proposed to improve the adaptability of the traditional sum of template and pixel-wise learners (Staple) algorithm to changes in target appearance and environmental conditions. Additionally, the Moth Flame Optimization (MFO) algorithm, known for its strong global search capability, is introduced as a re-detection algorithm in case of tracking failure. Furthermore, a trajectory-guided Gaussian initialization technique and an iteration speed update strategy are proposed based on sexual pheromone density to enhance the tracking performance of the introduced re-detection algorithm. Comparative experiments conducted on UAV123 and UAVDT datasets demonstrate the excellent stability and robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. Evaluation of Ocean Color Algorithms to Retrieve Chlorophyll- a Concentration in the Mexican Pacific Ocean off the Baja California Peninsula, Mexico.
- Author
-
Alvarado-Graef, Patricia, Martín-Atienza, Beatriz, Sosa-Ávalos, Ramón, Durazo, Reginaldo, and Hernández-Walls, Rafael
- Subjects
- *
OCEAN color , *ALGORITHMS , *OCEAN , *PENINSULAS ,EL Nino ,LA Nina - Abstract
Mathematical algorithms relate satellite data of ocean color with the surface Chlorophyll-a concentration (Chl-a), a proxy of phytoplankton biomass. These mathematical tools work best when they are adapted to the unique bio-optical properties of a particular oceanic province. Ocean color algorithms should also consider that there are significant differences between datasets derived from different sensors. Common solutions are to provide different parameters for each sensor or use merged satellite data. In this paper, we use satellite data from the Copernicus merged product suite and in situ data from the southernmost part of the California Current System to test two widely used global algorithms, OCx and CI, and a regional algorithm, CalCOFI2. The OCx algorithm yielded the most favorable results. Consequently, we regionalized it and conducted further testing, leading to significant improvements, especially in eutrophic and oligotrophic waters. The database was then separated according to (a) dynamic boundaries in the area, (b) bio-optical properties, and (c) climatic conditions (El Niño/La Niña). Regional algorithms were obtained and tested for each partition. The Chl-a retrievals for each model were tested and compared. The best fit for the data was for the regional algorithms that considered the climatic conditions (El Niño/La Niña). These results will allow for the construction of consistent regionally adapted time series and, therefore, will demonstrate the importance of El Niño/La Niña events on the bio-optical properties of the area. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. Light Gradient Boosting Machine-Based Low–Slow–Small Target Detection Algorithm for Airborne Radar.
- Author
-
Liu, Jing, Huang, Pengcheng, Zeng, Cao, Liao, Guisheng, Xu, Jingwei, Tao, Haihong, and Juwono, Filbert H.
- Subjects
- *
RADAR in aeronautics , *FEATURE extraction , *ALGORITHMS , *DECISION trees , *RADAR targets - Abstract
For airborne radar, detecting a low–slow–small (LSS) target is a hot and challenging topic, which results from the rapidly increasing number of non-cooperative flying LSS targets becoming of widespread concern, and the low signal-to-clutter ratio (SCR) of LSS targets results in the targets being particularly easily overwhelmed by the clutter. In this paper, a novel light gradient boosting machine (LightGBM)-based LSS target detection algorithm for airborne radar is proposed. The proposed method, based on the current real-time clutter environment of the range cell to be detected, firstly designs a specific real-time space-time LSS target signal repository with special dimensions and structures. Then, the proposed method creatively designs a new fast-built real-time training feature dataset specifically for the LSS target and the current clutter, together with a series of unique data transformations, sample selection, data restructuring, feature extraction, and feature processing. Finally, the proposed method develops a unique machine learning-based LSS target detection classifier model for the designed training dataset, by fully excavating and utilizing the advantages of the ensemble decision trees-based LightGBM. Consequently, the pre-processed data in the range cell of interest are classified using the proposed algorithm, which achieves LSS target detection by evaluating the output results of the designed classifier. Compared with the traditional classical target detection methods, the proposed algorithm is capable of providing markedly superior performance for LSS target detection. With an appropriate computational time, the proposed algorithm attains the highest probability of detecting LSS targets under the low SCR. The simulation outcomes and detection results with the experimental data are employed to validate the effectiveness and merits of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. 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
44. A Comparative Analysis of the Bayesian Regularization and Levenberg–Marquardt Training Algorithms in Neural Networks for Small Datasets: A Metrics Prediction of Neolithic Laminar Artefacts.
- Author
-
Troiano, Maurizio, Nobile, Eugenio, Mangini, Fabio, Mastrogiuseppe, Marco, Conati Barbaro, Cecilia, and Frezza, Fabrizio
- Subjects
- *
BAYESIAN analysis , *COMPARATIVE studies , *NEOLITHIC Period , *ALGORITHMS , *FORECASTING - Abstract
This study aims to present a comparative analysis of the Bayesian regularization backpropagation and Levenberg–Marquardt training algorithms in neural networks for the metrics prediction of damaged archaeological artifacts, of which the state of conservation is often fragmented due to different reasons, such as ritual, use wear, or post-depositional processes. The archaeological artifacts, specifically laminar blanks (so-called blades), come from different sites located in the Southern Levant that belong to the Pre-Pottery B Neolithic (PPNB) (10,100/9500–400 cal B.P.). This paper shows the entire procedure of the analysis, from its normalization of the dataset to its comparative analysis and overfitting problem resolution. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
45. An Integer-Fractional Gradient Algorithm for Back Propagation Neural Networks.
- Author
-
Zhang, Yiqun, Xu, Honglei, Li, Yang, Lin, Gang, Zhang, Liyuan, Tao, Chaoyang, and Wu, Yonghong
- Subjects
- *
BACK propagation , *OPTIMIZATION algorithms , *ALGORITHMS , *LONG-term memory , *HUMAN fingerprints - Abstract
This paper proposes a new optimization algorithm for backpropagation (BP) neural networks by fusing integer-order differentiation and fractional-order differentiation, while fractional-order differentiation has significant advantages in describing complex phenomena with long-term memory effects and nonlocality, its application in neural networks is often limited by a lack of physical interpretability and inconsistencies with traditional models. To address these challenges, we propose a mixed integer-fractional (MIF) gradient descent algorithm for the training of neural networks. Furthermore, a detailed convergence analysis of the proposed algorithm is provided. Finally, numerical experiments illustrate that the new gradient descent algorithm not only speeds up the convergence of the BP neural networks but also increases their classification accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
46. The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions.
- Author
-
Punnen, Abraham P. and Dhahan, Jasdeep
- Subjects
- *
KNAPSACK problems , *BIPARTITE graphs , *INTEGER programming , *COMBINATORIAL optimization , *ALGORITHMS - Abstract
In this paper, we study the knapsack problem with conflict pair constraints. After a thorough literature survey on the topic, our study focuses on the special case of bipartite conflict graphs. For complete bipartite (multipartite) conflict graphs, the problem is shown to be NP-hard but solvable in pseudo-polynomial time, and it admits an FPTAS. Extensions of these results to more general classes of graphs are also presented. Further, a class of integer programming models for the general knapsack problem with conflict pair constraints is presented, which generalizes and unifies the existing formulations. The strength of the LP relaxations of these formulations is analyzed, and we discuss different ways to tighten them. Experimental comparisons of these models are also presented to assess their relative strengths. This analysis disclosed various strong and weak points of different formulations of the problem and their relationships to different types of problem data. This information can be used in designing special purpose algorithms for KPCC involving a learning component. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. An Enhanced Particle Swarm Optimization (PSO) Algorithm Employing Quasi-Random Numbers.
- Author
-
Kannan, Shiva Kumar and Diwekar, Urmila
- Subjects
- *
PARTICLE swarm optimization , *TRAVELING salesman problem , *STATISTICAL sampling , *ALGORITHMS , *BENCHMARK problems (Computer science) , *RANDOM numbers - Abstract
This paper introduces an innovative Particle Swarm Optimization (PSO) Algorithm incorporating Sobol and Halton random number samplings. It evaluates the enhanced PSO's performance against conventional PSO employing Monte Carlo random number samplings. The comparison involves assessing the algorithms across nine benchmark problems and the renowned Travelling Salesman Problem (TSP). The results reveal consistent enhancements achieved by the enhanced PSO utilizing Sobol/Halton samplings across the benchmark problems. Particularly noteworthy are the Sobol-based PSO improvements in iterations and the computational times for the benchmark problems. These findings underscore the efficacy of employing Sobol and Halton random number generation methods to enhance algorithm efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. Small-Scale Battery Energy Storage System for Testing Algorithms Aimed at Peak Power Reduction.
- Author
-
Sozański, Krzysztof, Wermiński, Szymon, and Kaniewski, Jacek
- Subjects
- *
BATTERY storage plants , *CASCADE converters , *TEST systems , *ENERGY storage , *DC-to-DC converters , *ENERGY transfer , *ALGORITHMS - Abstract
This study describes a laboratory model of a battery energy storage system (BESS) designed for testing algorithms aimed at reducing peak power consumption in railway traction substations. The system comprises a DC/DC converter and battery energy storage. This article details a laboratory model of a bidirectional buck-boost DC/DC converter, which is used to transfer energy between the battery energy storage and a DC line. It presents an analysis of DC/DC converter systems along with simulation studies. Furthermore, the results of laboratory tests on the DC/DC converter model are also provided. The control algorithm of the system in the traction substation is focused on reducing peak power, offering benefits such as lower charges for the railway operator due to the possibility of reducing contracted power requirements. From the perspective of the power grid, the reduction in power fluctuations and, consequently, voltage sags, is advantageous. This paper includes a description of a hardware simulator for verifying the system's control algorithms. The verification of the control algorithms was performed through experimental tests conducted on a laboratory model (a hardware simulator) of the system for dynamic load reduction in traction substations, on a power scale of 1:1000 (5.5 kW). The experimental tests on the laboratory model (hardware simulator) demonstrated the effectiveness of the algorithm in reducing the peak power drawn from the power source. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
49. A Modified Frequency Nonlinear Chirp Scaling Algorithm for High-Speed High-Squint Synthetic Aperture Radar with Curved Trajectory.
- Author
-
Deng, Kun, Huang, Yan, Chen, Zhanye, Fu, Dongning, Li, Weidong, Tian, Xinran, and Hong, Wei
- Subjects
- *
SYNTHETIC aperture radar , *SYNTHETIC apertures , *ANGLES , *ALGORITHMS , *FREQUENCY spectra , *AZIMUTH - Abstract
The imaging of high-speed high-squint synthetic aperture radar (HSHS-SAR), which is mounted on maneuvering platforms with curved trajectory, is a challenging task due to the existence of 3-D acceleration and the azimuth spatial variability of range migration and Doppler parameters. Although existing imaging algorithms based on linear range walk correction (LRWC) and nonlinear chirp scaling (NCS) can reduce the range–azimuth coupling of the frequency spectrum (FS) and the spatial variability of the Doppler parameter to some extent, they become invalid as the squint angle, speed, and resolution increase. Additionally, most of them ignore the effect of acceleration phase calibration (APC) on NCS, which should not be neglected as resolution increases. For these issues, a modified frequency nonlinear chirp scaling (MFNCS) algorithm is proposed in this paper. The proposed MFNCS algorithm mainly includes the following aspects. First, a more accurate approximation of range model (MAARM) is established to improve the accuracy of the instantaneous slant range history. Second, a preprocessing of the proposed algorithm based on the first range compression, LRWC, and a spatial-invariant APC (SIVAPC) is implemented to eliminate most of the effects of high-squint angle and 3-D acceleration on the FS. Third, a spatial-variant APC (SVAPC) is performed to remove azimuth spatial variability introduced by 3-D acceleration, and the range focusing is accomplished by the bulk range cell migration correction (BRCMC) and extended secondary range compression (ESRC). Fourth, the azimuth-dependent characteristics evaluation based on LRWC, SIVAPC, and SVAPC is completed to derive the MFNCS algorithm with fifth-order chirp scaling function for azimuth compression. Consequently, the final image is focused on the range time and azimuth frequency domain. The experimental simulation results verify the effectiveness of the proposed algorithm. With a curved trajectory, HSHS-SAR imaging is carried out at a 50° geometric squint angle and 500 m × 500 m imaging width. The integrated sidelobe ratio and peak sidelobe ratio of the point targets at the scenario edges approach the theoretical values, and the range-azimuth resolution is 1.5 m × 3.0 m. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
50. Adaptive Resource Scheduling Algorithm for Multi-Target ISAR Imaging in Radar Systems.
- Author
-
Yao, Huan, Lou, Hao, Wang, Dan, Chen, Yijun, and Luo, Ying
- Subjects
- *
IMAGING systems , *ANGULAR velocity , *SCHEDULING , *ALGORITHMS , *RADAR - Abstract
Inverse synthetic-aperture radar (ISAR) can achieve precise imaging of targets, which enables precise perception of battlefield information, and it has become one of the most important tasks for radar systems. In multi-target scenarios, a resource scheduling method is required to improve the sensing ability and the overall efficiency of a radar system due to the limited resources. Considering the motion state of the target will change as the observation distance increases and image defocusing can occur due to the prolonged coherence accumulation time and significant changes in the target's motion state, the optimal observation period should be an important consideration factor in the resource scheduling method to further improve the imaging efficiency of radar system, which has not yet been involved in existing research. In this paper, we first derive the expressions of the target's effective rotation angle and the equivalent rotation angular velocity and then define the target's optimal observation period. Then, for multi-target imaging scenarios, we allocate pulse resources within a given time period based on sparse-aperture ISAR imaging technology. An adaptive radar resource scheduling algorithm for multi-target ISAR imaging is proposed, which prioritizes allocating resources based on the optimal observation periods for the targets. In the algorithm, a radar resource scheduling model for multi-target ISAR imaging is established, and a feedback-based closed-loop search optimization method is proposed to solve the model. Finally, the best scheduling strategy can be obtained, which includes imaging task duration and the pulse allocation sequence for each target. Simulation results validate the effectiveness of the algorithm. [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.