Search

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]

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]

To address the problem of low accuracy and efficiency in trajectory planning algorithms for interceptors facing multiple constraints during the midcourse guidance phase, an improved trajectory convex programming method based on the lateral distance domain is proposed. This algorithm can achieve fast trajectory planning, reduce the approximation error of the planned trajectory, and improve the accuracy of trajectory guidance. First, the concept of lateral distance domain is proposed, and the motion model of the midcourse guidance segment in the interceptor is converted from the time domain to the lateral distance domain. Second, the motion model and multiple constraints are convexly and discretely transformed, and the discrete trajectory convex model is established in the lateral distance domain. Third, the deep reinforcement learning algorithm is used to learn and train the initial solution of trajectory convex programming, and a high-quality initial solution trajectory is obtained. Finally, a dynamic adjustment method based on the distribution of approximate solution errors is designed to achieve efficient dynamic adjustment of grid points in iterative solving. The simulation experiments show that the improved trajectory convex programming algorithm proposed in this paper not only improves the accuracy and efficiency of the algorithm but also has good optimization performance. [ABSTRACT FROM AUTHOR]

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]

Migration flocks have different forms, including single individuals, formations, and irregular clusters. The shape of a flock can change swiftly over time. The real-time clustering of multiple groups with different characteristics is crucial for the monitoring of dynamically changing migratory flocks. Traditional clustering algorithms need to set various prior parameters, including the number of groups, the number of nearest neighbors, or the minimum number of individuals. However, flocks may display complex group behaviors (splitting, combination, etc.), which complicate the choice and adjustment of the parameters. This paper uses a real-time clustering-based method that utilizes concepts from the algebraic graph theory. The connected graph is used to describe the spatial relationship between the targets. The similarity matrix is calculated, and the problem of group clustering is equivalent to the extraction of the partitioned matrices within. This method needs only one prior parameter (the similarity distance) and is adaptive to the group's splitting and combination. Two modifications are proposed to reduce the computation burden. First, the similarity distance can be broadened to reduce the exponent of the similarity matrix. Second, the omni-directional measurements are divided into multiple sectors to reduce the dimension of the similarity matrix. Finally, the effectiveness of the proposed method is verified using the experimental results using real radar data. [ABSTRACT FROM AUTHOR]

Transformer technologies, like generative pre-trained transformers (GPTs) and bidirectional encoder representations from transformers (BERT) are increasingly utilized for understanding diverse social media content. Despite their popularity, there is a notable absence of a systematic literature review on their application in disaster analytics. This study investigates the utilization of transformer-based technology in analyzing social media data for disaster and emergency crisis events. Leveraging a systematic review methodology, 114 related works were collated from popular databases like Web of Science and Scopus. After deduplication and following the exclusion criteria, 53 scholarly articles were analyzed, revealing insights into the geographical distribution of research efforts, trends in publication output over time, publication venues, primary research domains, and prevalently used technology. The results show a significant increase in publications since 2020, with a predominant focus on computer science, followed by engineering and decision sciences. The results emphasize that within the realm of social-media-based disaster analytics, BERT was utilized in 29 papers, BERT-based methods were employed in 28 papers, and GPT-based approaches were featured in 4 papers, indicating their predominant usage in the field. Additionally, this study presents a novel classification scheme consisting of 10 distinct categories that thoroughly categorize all existing scholarly works on disaster monitoring. However, the study acknowledges limitations related to sycophantic behavior and hallucinations in GPT-based systems and raises ethical considerations and privacy concerns associated with the use of social media data. To address these issues, it proposes strategies for enhancing model robustness, refining data validation techniques, and integrating human oversight mechanisms. [ABSTRACT FROM AUTHOR]

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]

The traditional rearview mirror method cannot fully guarantee safety when driving trucks. RGB and infrared images collected by cameras are used for registration and recognition, so as to achieve the perception of surroundings and ensure safe driving. The traditional scale-invariant feature transform (SIFT) algorithm has a mismatching rate, and the YOLO algorithm has an optimization space in feature extraction. To address these issues, this paper proposes a truck surround sensing technique based on multi-features and an improved YOLOv5 algorithm. Firstly, the edge corner points and infrared features of the preset target region are extracted, and then a feature point set containing the improved SIFT algorithm is generated for registration. Finally, the YOLOv5 algorithm is improved by fusing infrared features and introducing a composite prediction mechanism at the prediction end. The simulation results show that, on average, the image stitching accuracy is improved by 17%, the time is reduced by 89%, and the target recognition accuracy is improved by 2.86%. The experimental results show that this method can effectively perceive the surroundings of trucks, accurately identify targets, and reduce the missed alarm rate and false alarm rate. [ABSTRACT FROM AUTHOR]

Fabric defect detection is an important part of the textile industry, aiming at the problems of many types of fabric defects, small size defects and unbalanced samples, an improved YOLOv5 fabric defect detection algorithm, FD-YOLOv5, was proposed. First, the coordinate attention module is embedded in the YOLOv5 backbone network structure to replace the bottleneck structure in the original network model. While reducing the amount of parameters and calculation, it enhances the ability of the network to extract features and improves the model's ability to detect small target defects. Secondly, a smoother Mish activation function is used in the original model convolution structure for model training, which improves the nonlinear expression ability of the model; the SIoU loss function considering the direction of the anchor box is used to improve the convergence speed and detection accuracy of the model. Finally, combining the focal loss and GHM loss functions as the target confidence loss function to solve the problem of sample imbalance in the fabric defect dataset. The experimental results based on the public fabric defect dataset of Aliyun TianChi shows that the mAP@.5 and mAP@.5:.95 of the improved algorithm are 65.1% and 30.4%, respectively, which are 8.3% and 3.2% higher than the original model, respectively, and the parameter amount, calculation amount and weight of the model are reduced by 8.4%, 11.2% and 14.3%, respectively, compared with the original model. Even compared with the state-of-the-art YOLOv7 model, the mAP@.5 value of the proposed model is improved by 6.5%. Although the FPS value is lower than YOLOv7 model, it also achieves a detection speed of 79 frames per second, which can meet the real-time demand. The experimental results demonstrate the effectiveness of the method in this paper, which can provide a reference for the automatic detection method of fabric defects. [ABSTRACT FROM AUTHOR]

The classical moving target segmentation (MTS) algorithm in a video can segment the moving targets out by calculating frame by frame, but the algorithm encounters a real-time problem as the data increases. Recently, the benefits of quantum computing in video processing have been demonstrated, but it is still scarce for MTS. In this paper, a quantum moving target segmentation algorithm for grayscale video based on background difference method is proposed, which can simultaneously model the background of all frames and perform background difference to segment the moving targets. In addition, a feasible quantum subtractor is designed to perform the background difference operation. Then, several quantum units, including quantum cyclic shift transformation, quantum background modeling, quantum background difference, and quantum binarization, are designed in detail to establish the complete quantum circuit. For a video containing 2 m frames (every frame is a 2 n × 2 n image with q grayscale levels), the complexity of our algorithm is O (n + q) . This is an exponential speedup over the classical algorithm and also outperforms the existing quantum algorithms. Finally, the experiment on IBM Q demonstrates the feasibility of our algorithm in this noisy intermediate-scale quantum (NISQ) era. [ABSTRACT FROM AUTHOR]

The growing uses of algorithm-based decision-making in human resources management have drawn considerable attention from different stakeholders. While prior literature mainly focused on stakeholders directly related to HR decisions (e.g., employees), this paper pertained to a third-party observer perspective and investigated how consumers would respond to companies' adoption of algorithm-based HR decision-making. Through five experimental studies, we showed that the adoption of algorithm-based (vs. human-based) HR decision-making could induce consumers' unfavorable ethicality inferences of the company (study 1); because implementing a calculative and data-driven approach (i.e. algorithm-based) to make employee-related decisions violates the deontological principles of respectful employee treatment (study 2). However, this effect was attenuated when consumers had high (vs. low) power distance beliefs (study 3); the algorithm served as assistance (vs. replacement) for human decisions (study 4); or the adoption was framed as employee-oriented (vs. company-oriented) motivated (study 5). Our findings suggested that consumers are aversive to algorithm-based HR decision-making because it is deontologically problematic regardless of its decision quality (i.e. accuracy). This paper contributes to the extant understanding of stakeholders' responses to algorithm-based HR decision-making and consumers' attitudes toward algorithm users. [ABSTRACT FROM AUTHOR]

The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the data stream model, the state-of-the-art single-pass semi-streaming algorithm for it is still a simple greedy algorithm that computes a maximal matching, and this way obtains 1 / 2 -approximation. Some previous works described two/three-pass algorithms that improve over this approximation ratio by using their second and third passes to improve the above mentioned maximal matching. One contribution of this paper continues this line of work by presenting new three-pass semi-streaming algorithms that work along these lines and obtain improved approximation ratios of 0.6111 and 0.5694 for triangle-free and general graphs, respectively. Unfortunately, a recent work Konrad and Naidu (Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX/RANDOM 2021, August 16–18, 2021. LIPIcs, vol 207, pp 19:1–19:18, 2021. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.19) shows that the strategy of constructing a maximal matching in the first pass and then improving it in further passes has limitations. Additionally, this technique is unlikely to get us closer to single-pass semi-streaming algorithms obtaining a better than 1 / 2 -approximation. Therefore, it is interesting to come up with algorithms that do something else with their first pass (we term such algorithms non-maximal-matching-first algorithms). No such algorithms were previously known, and the main contribution of this paper is describing such algorithms that obtain approximation ratios of 0.5384 and 0.5555 in two and three passes, respectively, for general graphs. The main significance of our results is not in the numerical improvements, but in demonstrating the potential of non-maximal-matching-first algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes an improved attitude estimation algorithm based on the extended Kalman filter (EKF), and it is applied to suppress the accuracy reduction in attitude estimation caused by fusing magnetometer data under large angular motion. In the proposed attitude estimation structure, the approximate variance of the estimated horizontal northbound magnetic vector is used to dynamically adjust the participation of magnetometer data in attitude estimation, as the approximate variance increases significantly under large angular motion and fusing magnetometer data will reduce estimation accuracy. A three-axis position-velocity controlled turntable is used to conduct rocking experiments for validating the proposed attitude estimation algorithm. The results show a significant improvement in yaw angle estimation accuracy with the proposed attitude estimation algorithm and correspondingly enhance the distribution of pitch and roll angle errors. [ABSTRACT FROM AUTHOR]

In this paper, a new adaptive method is proposed for online frequency estimation of a periodic disturbance by the output measurement based on the fast Fourier transform algorithm. The performance of the proposed algorithm is evaluated in the face of time varying frequency, time varying amplitude, non-sinusoidal periodic disturbance, and different plants. Also, the convergence rate of the method is compared by other estimation methods. Then, the online estimation is used in the repetitive controller structure for eliminating periodic disturbances with unknown frequencies. A new analysis is performed on RC and the stability conditions are determined in a theorem. These are illustrated in simulation results. The effectiveness of this method is shown on the application of ϕ -shaped PZT active suspension and it is compared by existing results. [ABSTRACT FROM AUTHOR]

The introduction of a multi-population structure in differential evolution (DE) algorithm has been proven to be an effective way to achieve algorithm adaptation and multi-strategy integration. However, in existing studies, the mutation strategy selection of each subpopulation during execution is fixed, resulting in poor self-adaptation of subpopulations. To solve this problem, a dynamic multi-strategy integrated differential evolution algorithm based on reinforcement learning (RLDMDE) is proposed in this paper. By employing reinforcement learning, each subpopulation can adaptively select the mutation strategy according to the current environmental state (population diversity). Based on the population state, this paper proposes an individual dynamic migration strategy to "reward" or "punish" the population to avoid wasting individual computing resources. Furthermore, this paper applies two methods of good point set and random opposition-based learning (ROBL) in the population initialization stage to improve the quality of the initial solutions. Finally, to evaluate the performance of the RLDMDE algorithm, this paper selects two benchmark function sets, CEC2013 and CEC2017, and six engineering design problems for testing. The results demonstrate that the RLDMDE algorithm has good performance and strong competitiveness in solving optimization problems. [ABSTRACT FROM AUTHOR]

As an indispensable part of the power transmission system, insulators are of great importance to the safe and stable operation of power grids in terms of their healthy and reliable operation. To realize real-time monitoring of insulator defects under a complex environment, this paper proposes an insulator defect detection method based on the You Only Look Once version 7-tiny (YOLOv7- tiny) algorithm. Then an edge device-unmanned aerial vehicle (UAV) inspection system is developed to verify the real-time performance of the algorithm. By introducing the structure intersection over union (SIoU) loss function to the YOLOv7-tiny model, the regression speed of the anchor frame can be effectively accelerated on the basis of the miniature model, to accelerate the model operation. Thereafter, a smooth sigmoid linear unit (SiLU) activation function is used in the network neck to improve the nonlinear representation ability; After that, an edge computing device based on NVIDIA Jetson Xavier NX is established to verify the real-time performance of the method. Experimental results reveal mean average precision (mAP) of insulators and their missing series defects is as high as 98.31%. Besides, the detection speed of the designed model deployed to mobile edge devices can reach 35 frames per second (FPS), with real-time and accurate detection performance of insulators and their missing series defects. [ABSTRACT FROM AUTHOR]

The YOLO series of algorithms have made substantial contributions to the detection of insulator defects in power transmission line operations. However, existing target detection algorithms for the small target detection and low‐quality insulator images encounter difficulties in effectively capturing relevant features, resulting in a higher probability of target loss. To identify and classify defects in the operational state of insulators, an improved YOLOv8 target identification algorithm called DGW‐YOLOv8 is proposed in this paper. The deformable attention backbone of the DGW‐YOLOv8 target identification algorithm is designed by adding the deformable ConvNets v2 module and the global attention mechanism. This addition reduces the feature loss caused by the network feature processing, enhances the sensitivity of the algorithm to small‐scale targets, and reduces the impact caused by the different global positions of the targets. Additionally, to address the problem of low quality of captured images, WIoU v3 is used to replace CIoU in the original YOLOv8 target identification algorithm to optimize the loss function, reduce the degrees of freedom, and improve the network robustness. Experimental results demonstrate that the enhanced YOLOv8 algorithm can achieve an improvement of 2.4% and 5.5% in mAP and mAP50‐95, respectively, compared with the original algorithm. [ABSTRACT FROM AUTHOR]

To address the issues of poor detection accuracy and the large number of target detection model parameters in existing AGV monocular vision location detection algorithms, this paper presents an AGV vision location method based on Gaussian saliency heuristic. The proposed method introduces a fast and accurate AGV visual detection network called GAGV-net. In the GAGV-net network, a Gaussian saliency feature extraction module is designed to enhance the network's feature extraction capability, thereby reducing the required output for model fitting. To improve the accuracy of target detection, a joint multi-scale classification and detection task header are designed at the stage of target frame regression to classification. This header utilizes target features of different scales, thereby enhancing the accuracy of target detection. Experimental results demonstrate a 12% improvement in detection accuracy and a 27.38 FPS increase in detection speed compared to existing detection methods. Moreover, the proposed detection network significantly reduces the model's size, enhances the network model's deployability on AGVs, and greatly improves detection accuracy. [ABSTRACT FROM AUTHOR]

In this paper, the reentry phase of the Aerospaceplane is taken as the research object, and the performance parameters of the reusable rocket of a private company are analyzed. Aiming at the guidance and control scheme of the spacecraft returning to the reentry trajectory in the real environment, the original natural algorithm is optimized by considering various reentry flight constraints, and the improved original natural algorithm is used to optimize the reentry trajectory of the Aerospaceplane. We obtained two types of reentry trajectories in the presence of large flight-restricted areas, the "S-type" trajectory and the "spiral-type" trajectory, and obtained data on various influencing factors. The results showed that the basic state parameters of the spiral trajectory optimized using the improved original natural algorithm after adding constraints met the constraint conditions. The aerodynamic heating rate and overload of the spiral reentry trajectory were to some extent greater than those of the S-type trajectory. Under the increasingly stringent requirements of the aerospace environment, new requirements were put forward for the thermal protection system to meet the wider environmental situation. This paper uses the improved original natural algorithm for the first time and applies it to the field of aerospace reentry and entry and adds more constraints to this algorithm for computation. Besides, for the first time, the macroscopic nature of trajectory types is used as a comparative element for parameter comparison, providing a reference basis for selecting trajectory optimization directions from the macroscopic perspective of trajectory types. [ABSTRACT FROM AUTHOR]

Multiple Sequence Alignment (MSA) plays a pivotal role in bioinformatics, facilitating various critical biological analyses, including the prediction of unknown protein structures and functions. While numerous methods are available for MSA, bioinspired algorithms stand out for their efficiency. Despite the growing research interest in addressing the MSA challenge, only a handful of comprehensive reviews have been undertaken in this domain. To bridge this gap, this study conducts a thorough analysis of bioinspired-based methods for MSA through a systematic literature review (SLR). By focusing on publications from 2010 to 2024, we aim to offer the most current insights into this field. Through rigorous eligibility criteria and quality standards, we identified 45 relevant papers for review. Our analysis predominantly concentrates on bioinspired-based techniques within the context of MSA. Notably, our findings highlight Genetic Algorithm and Memetic Optimization as the most commonly utilized algorithms for MSA. Furthermore, benchmark datasets such as BAliBASE and SABmark are frequently employed in evaluating MSA solutions. Structural-based methods emerge as the preferred approach for assessing MSA solutions, as revealed by our systematic literature review. Additionally, this study explores current trends, challenges, and unresolved issues in the realm of bioinspired algorithms for MSA, offering practitioners and researchers valuable insights and comprehensive understanding of the field. [ABSTRACT FROM AUTHOR]

To address the issue of low accuracy in detecting malicious program behaviors in new power system edge-side applications, we present a detection model based on API call sequences that combines rule matching and deep learning techniques in this paper. We first use the PrefixSpan algorithm to mine frequent API call sequences in different threads of the same program within a malicious program dataset to create a rule base for malicious behavior sequences. The API call sequences to be examined are then matched using the malicious behavior sequence matching model, and those that do not match are fed into the TextCNN deep learning detection model for additional detection. The two models collaborate to accomplish program behavior detection. Experimental results demonstrate that the proposed detection model can effectively identify malicious samples and discern malicious program behaviors. [ABSTRACT FROM AUTHOR]

This paper proposes an all-digital calibration algorithm that utilizes a reference channel to suppress the timing mismatch in the Time-Interleaved Analog-to-Digital Converter (TIADC). The output of the reference channel is aligned with each sub-channel in turn, therefore enabling the simultaneous sampling and conversion of the same input signal. First, the statistical characteristics across the channels are employed for estimating the timing mismatch; then, by comparing the output difference between the reference channel and the sub-channels that are sampled simultaneously, the deviation of the derivator can be calibrated. Finally, combining both calibration results yields an accurate final output. This proposed algorithm provides an effective solution to improve TIADC performance in high-speed data acquisition systems. The proposed architecture is applied to a 12-bit 2.4 GS/s four-channel TIADC model, and then its effectiveness is verified. The simulation results exhibit that the Effective Number Of Bits (ENOB) at an input signal frequency of 984 MHz shows a remarkable improvement from 6.88 bits to 11.92 bits. The effectiveness of this technique is also demonstrated through the off-chip calibration of a commercial 12-bit four-channel 2 GS/s TIADC using a 680 MHz input signal that is based on the actual chip results. [ABSTRACT FROM AUTHOR]

Detecting deep-sea megabenthic organisms is of foremost importance for seabed resource surveys, typical habitat protection, and biodiversity surveys. However, the complexity of the deep-sea environment, uneven illumination, and small biological targets that are easily obscured all increase target detection difficulty significantly. To address these, this paper proposes a deep-sea megabenthic detection algorithm, DS-YOLO, based on YOLOv5s. To improve the detection ability of the model for deep-sea megabenthic organisms, the space-to-depth module and the spatial pyramid pooling cross stage partial channel module are introduced in the Backbone layer to enlarge the receptive field and enhance the retention of small-scale features. Then, the space-todepth and normalization-based attention modules and the Add and Concat functions of the bidirectional feature pyramid network are introduced in the Neck layer to increase the multiscale fusion ability of the model and highlight the insignificant features. Finally, the two branches of the decoupling header output the category and location of the target, which causes the model to utilize the feature information to the maximum extent. Experiments showed that DS-YOLO improved mAP0.5 from 89.6% to 92.4% and mAP0.5:0.95 from 65.7% to 72.3% compared to the original YOLOv5s on the homemade dataset and outperformed other algorithms in the YOLO series. DS-YOLO reaches 84.7 FPS for deployment on mobile platforms. In addition, the combined DS-YOLO and DeepSORT algorithm can be used to calculate the abundance and community structure of deep-sea megabenthos. The model outperforms general target detection models for deep-sea megabenthos detection and is suitable for use in complex deep-sea environments. [ABSTRACT FROM AUTHOR]

The generalized sidelobe cancellation (GSC) is a commonly used adaptive beamforming technology, which can be used in antenna arrays. Due to the error of the direction of arrival of the received signal and the spacing error of the received array elements, the signal received by the array antenna has a mismatch of steering vectors, which leads to that the GSC method cannot accurately aim at the expected signal and suppress the interference signal. In order to improve the robustness of GSC algorithm, a new adaptive beamforming algorithm named SGSC (Sequential Quadratic Programming-Generalized Side Lobe Cancellation) is proposed in this paper. In this method, firstly, the mismatching expected signal steering vector is corrected by the stepwise quadratic programming, so that the auxiliary antenna can effectively block the expected signal. Then, the optimal weight vector is obtained by combining the corrected steering vector with the GSC, so that the expected signal components of the auxiliary antenna and of the main antenna can be avoided from being cancelled due to mismatch errors. Finally, the simulation results based on MATLAB show that the new algorithm can point the desired signal more accurately and suppress the interference signal more obviously in the presence of mismatch error, which shows the effectiveness of the method. [ABSTRACT FROM AUTHOR]

Compared with aeromagnetic total-field data, aeromagnetic vertical gradient field data contain less low-frequency information. In this paper, a continuation conversion filtering algorithm is proposed to filter out part of the low-frequency information of the aeromagnetic total-field data so that these data can be better compared with the total-field data obtained from aeromagnetic gradient data conversion. We discuss the feasibility of single aeromagnetic vertical gradient measurement in areas where it is inconvenient to erect base stations. We design a simple model and a complex model with a background field and random noise to analyze the conversion effect. The model analysis shows that the effect of applying the algorithm depends heavily on the selection of upward continuation height. The magnetization intensity of the background field also affects the selection of continuation height. When the magnetization intensity of the background field is weak, the continuation height chosen is the same as the buried depth of the background field. If the magnetization intensity of the background field is strong, then the higher the continuation height, the better the effect will be. The conclusion of the model analysis is applied to the analysis of the measured aeromagnetic data. In addition, we can conclude that the effect on total-field data of conversion by the continuation conversion filtering algorithm is better than that of conversion from the aeromagnetic vertical gradient data. [ABSTRACT FROM AUTHOR]

Aiming at defects such as low contrast in infrared ship images, uneven distribution of ship size, and lack of texture details, which will lead to unmanned ship leakage misdetection and slow detection, this paper proposes an infrared ship detection model based on the improved YOLOv8 algorithm (R_YOLO). The algorithm incorporates the Efficient Multi-Scale Attention mechanism (EMA), the efficient Reparameterized Generalized-feature extraction module (CSPStage), the small target detection header, the Repulsion Loss function, and the context aggregation block (CABlock), which are designed to improve the model's ability to detect targets at multiple scales and the speed of model inference. The algorithm is validated in detail on two vessel datasets. The comprehensive experimental results demonstrate that, in the infrared dataset, the YOLOv8s algorithm exhibits improvements in various performance metrics. Specifically, compared to the baseline algorithm, there is a 3.1% increase in mean average precision at a threshold of 0.5 (mAP (0.5)), a 5.4% increase in recall rate, and a 2.2% increase in mAP (0.5:0.95). Simultaneously, while less than 5 times parameters, the mAP (0.5) and frames per second (FPS) exhibit an increase of 1.7% and more than 3 times, respectively, compared to the CAA_YOLO algorithm. Finally, the evaluation indexes on the visible light data set have shown an average improvement of 4.5%. [ABSTRACT FROM AUTHOR]

To improve the current manual and iterative nature of clash resolution on construction projects, current research efforts continue to explore and test the utilization of machine-learning algorithms to automate the process. Though current research shows significant accuracy in automating clash resolution, many have failed to provide clear explanation and justification for the selection of their feature and label space. Since this is critical in developing an effective and explainable solution in machine learning, it is crucial to address this research gap. In this paper, the authors utilize an in-depth literature review and industry interviews to capture domain knowledge on how design clashes are resolved by industry experts. From analysis of the knowledge captured, we identified 23 factors considered by experts when resolving clashes and five alternative solutions/options to resolve a clash. Using a pool of industry experts, a modified Delphi approach was conducted to validate the factors and options and to determine a priority ranking. The authors identified 94 industry experts based on a predetermined qualification matrix to take part in the modified Delphi. Twelve participants responded and took part in the first round, and 11 completed the second round. A consensus was reached on all clash factors and resolution options. Factors including "clashing elements type," "constrained slope," "critical element in the clash," "location of the clash," "code compliance," and "project stage clashing element is in" were ranked as the most important factors, while "clashing element material" and "insulation type" were considered the least important. Participants also showed more preference to the "moving the clashing element with low priority in/along x-y-z directions" option to resolve clashes. These identified factors and options will be utilized to collect specific clash data to train and test effective and explainable machine-learning algorithms toward automating clash resolution. [ABSTRACT FROM AUTHOR]

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]

Combined SINS/GPS navigation systems have been widely used. However, when the traditional combined SINS/GPS navigation system travels between tall buildings, in the shade of trees, or through tunnels, the GPS encounters frequent signal blocking, which leads to the interruption of GPS signals, and as a result, the combined SINS/GPS-based navigation method degenerates into a pure inertial guidance system, which will lead to the accumulation of navigation errors. In this paper, an adaptive Kalman filtering algorithm based on polynomial fitting and a Taylor expansion is proposed. Through the navigation information output from the inertial guidance system, the polynomial interpolation method is used to construct the velocity equation and position equation of the carrier, and then the Taylor expansion is used to construct the virtual measurement at the moment of the GPS signal interruption, which can make up for the impact of the lack of measurement information on the combined SINS/GPS navigation system when the GPS signal is interrupted. The results of computer simulation experiments and road measurement tests based on the loosely combined SINS/GPS navigation system show that when the carrier faces a GPS signal interruption situation, compared with a combined SINS/GPS navigation algorithm that does not take any rescue measures, our proposed combined SINS/GPS navigation algorithm possesses a higher accuracy in the attitude angle estimation, a higher accuracy in the velocity estimation, and a higher accuracy in the positional localization, and the system possesses higher stability. [ABSTRACT FROM AUTHOR]

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]

With the continuous development of virtual reality, digital image applications, the required complex scene video proliferates. For this reason, portrait matting has become a popular topic. In this paper, a new matting algorithm with improved portrait details for images with complex backgrounds (MORLIPO) is proposed. This work combines the background restoration module (BRM) and the fine-grained matting module (FGMatting) to achieve high-detail matting for images with complex backgrounds. We recover the background by inputting a single image or video, which serves as a priori and aids in generating a more accurate alpha matte. The main framework uses the image matting model MODNet, the MobileNetV2 lightweight network, and the background restoration module, which can both preserve the background information of the current image and provide a more accurate prediction of the alpha matte of the current frame for the video image. It also provides the background prior of the previous frame to predict the alpha matte of the current frame more accurately. The fine-grained matting module is designed to extract fine-grained details of the foreground and retain the features, while combining with the semantic module to achieve more accurate matting. Our design allows training on a single NVIDIA 3090 GPU in an end-to-end manner and experiments on publicly available data sets. Experimental validation shows that our method performs well on both visual effects and objective evaluation metrics. [ABSTRACT FROM AUTHOR]

To improve the current manual and iterative nature of clash resolution on construction projects, current research efforts continue to explore and test the utilization of machine-learning algorithms to automate the process. Though current research shows significant accuracy in automating clash resolution, many have failed to provide clear explanation and justification for the selection of their feature and label space. Since this is critical in developing an effective and explainable solution in machine learning, it is crucial to address this research gap. In this paper, the authors utilize an in-depth literature review and industry interviews to capture domain knowledge on how design clashes are resolved by industry experts. From analysis of the knowledge captured, we identified 23 factors considered by experts when resolving clashes and five alternative solutions/options to resolve a clash. Using a pool of industry experts, a modified Delphi approach was conducted to validate the factors and options and to determine a priority ranking. The authors identified 94 industry experts based on a predetermined qualification matrix to take part in the modified Delphi. Twelve participants responded and took part in the first round, and 11 completed the second round. A consensus was reached on all clash factors and resolution options. Factors including "clashing elements type," "constrained slope," "critical element in the clash," "location of the clash," "code compliance," and "project stage clashing element is in" were ranked as the most important factors, while "clashing element material" and "insulation type" were considered the least important. Participants also showed more preference to the "moving the clashing element with low priority in/along x-y-z directions" option to resolve clashes. These identified factors and options will be utilized to collect specific clash data to train and test effective and explainable machine-learning algorithms toward automating clash resolution. [ABSTRACT FROM AUTHOR]

Deep learning shows great potential in low-light image enhancement, which can improve image brightness and contrast while keeping image natural. However, due to the lack of prior knowledge extracted manually or excessive amplification of noise, these methods result in poor quality of enhanced images. To solve these challenging problems, this paper proposes a dual-branch grayscale image enhancement network based on dense residual and attention mechanism. Low-light grayscale image is used as input. Firstly, features that fuse deep and shallow information are extracted through dense residual convolution branch network; secondly, texture features are extracted through U-Net branch network combined with attention mechanism; then the extracted features are integrated, and finally luminance is adjusted by a brightness adjustment module to output an enhanced grayscale image. In addition, a joint loss function is designed to measure the network training loss from brightness, texture, contrast and noise. A large number of quantitative and qualitative experiments on LOL and VE-LOL datasets show that the proposed method improves Peak Signal to Noise Ratio Index and Structural Similarity Index by 19.65 - 59.76% and 5.61 - 85.53%, respectively, compared with EnlightenGAN, KinD++, RUAS, LLFlow, etc. The proposed method is superior to the most famous methods, thanks to the deep feature extraction and fusion capability of dense residual convolutional network and texture extraction capability of U-Net network combined with attention mechanism. [ABSTRACT FROM AUTHOR]

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]

Copyright of Przeglad Elektrotechniczny is the property of Przeglad Elektrotechniczny and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Underwater object detection is crucial in marine exploration, presenting a challenging problem in computer vision due to factors like light attenuation, scattering, and background interference. Existing underwater object detection models face challenges such as low robustness, extensive computation of model parameters, and a high false detection rate. To address these challenges, this paper proposes a lightweight underwater object detection method integrating deep learning and image enhancement. Firstly, FUnIE-GAN is employed to perform data enhancement to restore the authentic colors of underwater images, and subsequently, the restored images are fed into an enhanced object detection network named YOLOv7-GN proposed in this paper. Secondly, a lightweight higher-order attention layer aggregation network (ACC3-ELAN) is designed to improve the fusion perception of higher-order features in the backbone network. Moreover, the head network is enhanced by leveraging the interaction of multi-scale higher-order information, additionally fusing higher-order semantic information from features at different scales. To further streamline the entire network, we also introduce the AC-ELAN-t module, which is derived from pruning based on ACC3-ELAN. Finally, the algorithm undergoes practical testing on a biomimetic sea flatworm underwater robot. The experimental results on the DUO dataset show that our proposed method improves the performance of object detection in underwater environments. It provides a valuable reference for realizing object detection in underwater embedded devices with great practical potential. [ABSTRACT FROM AUTHOR]

Autonomous Underwater Vehicles (AUVs) are widely used for the inspection of seabed pipelines. To address the issues of low trajectory tracking accuracy in AUV inspection processes due to uncertain ocean current disturbances, this paper designs a new dual-loop controller based on Model Predictive Control (MPC) and Variable Universe S-plane algorithms (S-VUD FLC, where VUD represents Variable Universe Discourse and FLC represents Fuzzy Logic Control) to achieve three-dimensional (3-D) trajectory tracking of an over-actuated AUV under uncertain ocean current disturbances. This paper uses MPC as the outer-loop position controller and S-VUD FLC as the inner-loop speed controller. The outer-loop controller generates desired speed instructions that are passed to the inner-loop speed controller, while the inner-loop speed controller generates control input and uses a direct logic thrust distribution method that approaches optimal energy consumption to distribute the thrust generated by the propellers to the over-actuated AUV, achieving closed-loop tracking of the entire trajectory. When designing the outer-loop MPC controller, the actual control input constraints of the system are considered, and control increments are introduced to reduce control model errors and the impact of uncertain external disturbances on the actual AUV model parameters. When designing the inner-loop S-VUD FLC, the strong robustness of the variable universe fuzzy controller and the easy construction characteristics of the S-plane algorithm are combined, and integral action is introduced to improve the system's tracking accuracy. The stability of the outer loop controller is proven by the Lyapunov method, and the stability of the inner loop controller is verified by simulation. Finally, simulations show that the over-actuated AUV has fast tracking processes and high tracking result accuracy under uncertain ocean current disturbances, demonstrating the effectiveness of the designed dual-loop controller. [ABSTRACT FROM AUTHOR]

This review paper provides a structured analysis of obstacle avoidance and route planning algorithms for unmanned surface vehicles (USVs) spanning both numerical simulations and real-world applications. Our investigation encompasses the development of USV route planning from the year 2000 to date, classifying it into two main categories: global and local route planning. We emphasize the necessity for future research to embrace a dual approach incorporating both simulation-based assessments and real-world field tests to comprehensively evaluate algorithmic performance across diverse scenarios. Such evaluation systems offer valuable insights into the reliability, endurance, and adaptability of these methodologies, ultimately guiding the development of algorithms tailored to specific applications and evolving demands. Furthermore, we identify the challenges to determining optimal collision avoidance methods and recognize the effectiveness of hybrid techniques in various contexts. Remarkably, artificial potential field, reinforcement learning, and fuzzy logic algorithms emerge as standout contenders for real-world applications as consistently evaluated in simulated environments. The innovation of this paper lies in its comprehensive analysis and critical evaluation of USV route planning algorithms validated in real-world scenarios. By examining algorithms across different time periods, the paper provides valuable insights into the evolution, trends, strengths, and weaknesses of USV route planning technologies. Readers will benefit from a deep understanding of the advancements made in USV route planning. This analysis serves as a road map for researchers and practitioners by furnishing insights to advance USV route planning and collision avoidance techniques. [ABSTRACT FROM AUTHOR]

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]

Many intrusion detection algorithms that use optimization have been developed and are commonly used to detect intrusions. The process of selecting features and the parameters of the classifier are essential parts of how well an intrusion detection system works. This paper provides a detailed explanation and discussion of an improved intrusion detection method for multiclass classification. The proposed solution uses a combination of the modified teaching–learning-based optimization (MTLBO) algorithm, the modified JAYA (MJAYA) algorithm, and a support vector machine (SVM). MTLBO is used with supervised machine learning (ML) to select subsets of features. Selection of the fewest features possible without impairing the accuracy of the results in feature subset selection (FSS) is a multiobjective optimization issue. This paper presents MTLBO as a mechanism and investigates its algorithm-specific, parameter-free idea. This study used the modified JAYA (MJAYA) algorithm to optimize the C and gamma parameters of the support vector machine (SVM) classifier. When the proposed MTLBO-MJAYA-SVM algorithm was compared with the original TLBO and JAYA algorithms on a well-known intrusion detection dataset, it was found to outperform them significantly. [ABSTRACT FROM AUTHOR]

The advent of the Internet of Things (IoT) has revolutionised our interaction with the environment, facilitating seamless connections among sensors, actuators, and humans. Efficient task scheduling stands as a cornerstone in maximising resource utilisation and ensuring timely task execution in IoT systems. The implementation of efficient task scheduling methodologies can yield substantial enhancements in productivity and cost-effectiveness for IoT infrastructures. To that end, this paper presents the IoT-mist bat-inspired algorithm (IMBA), designed specifically to optimise resource allocation in IoT environments. IMBA's efficacy lies in its ability to elevate user service quality through enhancements in task completion rates, load distribution, network utilisation, processing time, and power efficiency. Through comparative analysis, IMBA demonstrates superiority over traditional methods, such as fuzzy logic and round-robin algorithms, across all performance metrics. [ABSTRACT FROM AUTHOR]

In substation lightning rod meter reading data taking, the classical object detection model is not suitable for deployment in substation monitoring hardware devices due to its large size, large number of parameters, and slow detection speed, while is difficult to balance detection accuracy and real-time requirements with the existing lightweight object detection model. To address this problem, this paper constructs a lightweight object detection algorithm, YOLOv5-Meter Reading Lighting (YOLOv5-MRL), based on the improved YOLOv5 model's speed while maintaining accuracy. Then, the YOLOv5s are pruned based on the convolutional kernel channel soft pruning algorithm, which greatly reduces the number of parameters in the YOLOv5-MRL model while maintaining a certain accuracy loss. Finally, in order to facilitate the dial reading, the dial external circle fitting method is proposed to calculate the dial reading using the circular angle algorithm. The experimental results on the self-built dataset show that the YOLOv5-MRL object detection model achieves a mean average precision of 96.9%, a detection speed of 5 ms/frame, and a model weight size of 5.5 MB, making it better than other advanced dial reading models. [ABSTRACT FROM AUTHOR]

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]

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]

It is well known that the recursive least squares (RLS) algorithm is renowned for its rapid convergence and excellent tracking capability. However, its performance is significantly compromised when the system is sparse or when the input signals are contaminated by impulse noise. Therefore, in this paper, the minimum error entropy (MEE) criterion is introduced into the cost function of the RLS algorithm in this paper, with the aim of counteracting the interference from impulse noise. To address the sparse characteristics of the system, we employ a universally applicable convex function to regularize the cost function. The resulting new algorithm is named the convex regularization recursive minimum error entropy (CR-RMEE) algorithm. Simulation results indicate that the performance of the CR-RMEE algorithm surpasses that of other similar algorithms, and the new algorithm excels not only in scenarios with sparse systems but also demonstrates strong robustness against pulse noise. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT), ensuring secure communication between devices has become a crucial challenge. This paper proposes a novel secure communication solution by extracting wireless channel state information (CSI) features from IoT devices to generate a device identity. Due to the instability of the wireless channel, the CSI features are fuzzy and time-varying; thus, we a employ locally sensitive hashing (LSH) algorithm to ensure the stability of the generated identity in a dynamically changing wireless channel environment. Furthermore, zero-knowledge proofs are utilized to guarantee the authenticity and effectiveness of the generated identity. Finally, the identity generated using the aforementioned approach is integrated into an IBE communication scheme, which involves the fuzzy extraction of channel state information from IoT devices, stable identity extraction for fuzzy IoT devices using LSH, and the use of zero-knowledge proofs to ensure the authenticity of the generated identity. This identity is then employed as the identity information in identity-based encryption (IBE), constructing the device's public key for achieving confidential communication between devices. [ABSTRACT FROM AUTHOR]

High-altitude work poses significant safety risks, and wearing safety belts is crucial to prevent falls and ensure worker safety. However, manual monitoring of safety belt usage is time consuming and prone to errors. In this paper, we propose an improved high-altitude safety belt detection algorithm based on the YOLOv8 model to address these challenges. Our paper introduces several improvements to enhance its performance in detecting safety belts. First, to enhance the feature extraction capability, we introduce a BiFormer attention mechanism. Moreover, we used a lightweight upsampling operator instead of the original upsampling layer to better preserve and recover detailed information without adding an excessive computational burden. Meanwhile, Slim-neck was introduced into the neck layer. Additionally, extra auxiliary training heads were incorporated into the head layer to enhance the detection capability. Lastly, to optimize the prediction of bounding box position and size, we replaced the original loss function with MPDIOU. We evaluated our algorithm using a dataset collected from high-altitude work scenarios and demonstrated its effectiveness in detecting safety belts with high accuracy. Compared to the original YOLOv8 model, the improved model achieves P (precision), R (recall), and mAP (mean average precision) values of 98%, 91.4%, and 97.3%, respectively. These values represent an improvement of 5.1%, 0.5%, and 1.2%, respectively, compared to the original model. The proposed algorithm has the potential to improve workplace safety and reduce the risk of accidents in high-altitude work environments. [ABSTRACT FROM AUTHOR]

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]

This paper is about the opposite of judgement and calculation. This opposition has been a traditional anchor of critiques concerned with the rise of AI decision making over human judgement. Contrary to these approaches, it is argued that human judgement is not and cannot be replaced by calculation, but that it is human judgement that contextualises computational structures and gives them meaning and purpose. The article focuses on the epistemic structure of algorithms and artificial neural networks to find that they always depend on human judgement to be related to real life objects or purposes. By introducing the philosophical concept of judgement, it becomes clear that the property of judgement to provide meaning and purposiveness is based on the temporality of human life and the ambiguity of language, which quantitative processes lack. A juxtaposition shows that calculations and clustering can be used and referred to in more or less prejudiced and reflecting as well as opaque and transparent ways, but thereby always depend on human judgement. The paper clearly asserts that the transparency of AI is necessary for their autonomous use. This transparency requires the explicitness of the judgements that constitute these computational structures, thereby creating an awareness of the conditionality of such epistemic entities. [ABSTRACT FROM AUTHOR]

For a set E ⊂ Rn that contains the origin, we consider Im(E) - the set of all mth degree Taylor approximations (at the origin) of Cm functions on Rn that vanish on E. This set is a proper ideal in Pm(Rn) - the ring of all mth degree Taylor approximations of Cm functions on Rn. Which ideals in Pm(Rn) arise as Im(E) for some E? In this paper we introduce the notion of a closed ideal in Pm(Rn), and prove that any ideal of the form Im(E) is closed. We do not know whether in general any closed proper ideal is of the form Im(E) for some E, however we prove in a subsequent paper that all closed proper ideals in Pm(Rn) arise as Im(E) when m + n ≤ 5. [ABSTRACT FROM AUTHOR]