This study investigates the magnetization of Cobalt (Co) nanoparticles with two different crystal structures: a centered cubic (fcc) and an hexagonal close packed (hcp), under the magnetic field of the Earth. For that reason, the hysteresis loops of the two material samples are exported and compared with the corresponding value by experimental procedure in the laboratory under the Earth’s magnetization. For both samples, the nanoparticle number variation and the nearest neighbor distance effect, in the Co hysteresis loop are investigated, structural information that is useful for the sample preparation. For the simulations the Finite Element Method (FEM) was used, while experiments are conducted using a measurement set-up based on fluxgate magnetometers. From the simulation, it is proven that, for both samples, the nanoparticle number effect does not change the hysteresis loop. In contrast, when the distance between the nanoparticles increases, the magnetization obtains smaller value. This study aims to build a novel, simple and economical measurement arrangement enabling in situ magnetic measurements for ferromagnetic nano-material characterization. As the need for continuous knowledge of the condition and the phase of ferromagnetic nanoparticles that is crucial in many applications, like catalytic processes, this work aims to introduce an alternative approach that will add another dimension to conventional chemical reaction engineering this of the magnetic state of the material resolved in time and space and to contribute in the field of the monitoring and the early fault diagnosis of nanoparticle materials.

Deadlock is a real problem that can cause expensive, time-dependent hang-ups or failures in distributed computing systems. Some studies have been conducted with deadlock detection and resolution in generalized request computing models, most of these studies are based on the diffusing computation scheme, where forward and backward propagated probe and reply messages respectively are diffused between dependent processes. The replies carry the dependency information between processes for the initiator. Using this dependency information initiator can detect and resolve the deadlock cycle. It has been proven in the literature that a deadlock cycle length distribution is skewed with a large majority of cycles (90%) having length two. Based on this fact an improved algorithm is proposed for handling deadlock detection in distributed computing systems under the distributed request model where each process has several requests at a time. The improved algorithm depends mainly on message propagation and timeout policy. Probe and reply messages are propagated between the initiator and its successors only to detect deadlock cycles between them. Global timeout policy is used to detect potential deadlock cycles with large length distribution. The proposed algorithm can handle concurrent executions. Simulation experiments are performed to see the effectiveness of the improved algorithm. It is found that the improved algorithm compares favorably with other existing algorithms and it shows better results for several performance metrics especially in reducing deadlock latency and execution time.

This study introduces a novel algorithm tailored for the precise detection of lower outliers in univariate datasets, particularly suited for scenarios with a single cluster. The approach leverages a combination of transformative techniques and advanced filtration methods to efficiently segregate anomalies from normal values. Notably, the algorithm emphasizes high precision, ensuring minimal false positives, and requires only a few parameters for configuration. Its unsupervised nature enables robust anomaly filtering without the need for extensive manual intervention. To validate its efficacy, the algorithm is rigorously tested using real-world data obtained from photovoltaic (PV) module strings with similar DC capacities, containing various anomalies. Results demonstrate the algorithm's capability to accurately identify lower outliers while maintaining computational efficiency and reliability in practical applications.

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

We present a Deep Learning generative model specialized to work with graphs with a regular geometry. It is build on a Variational Autoencoder framework and employs Graph convolutional layers in both encoding and decoding phases. We also introduce a pooling technique (ReNN-Pool), used in the encoder, that allows to downsample graph nodes in a spatially uniform and highly interpretable way. In the decoder, a symmetrical un-pooling technique is used to retrieve the original dimensionality of graphs. Performance of the model are tested on the standard Sprite benchmark dataset, a set of 2D images of video game characters, adequately transforming images data into graphs, and on the more realistic use-case of a dataset of cylindrical-shaped graph data that describe the distributions of the energy deposited by a particle beam in a medium.

City zones have become increasingly overcrowded as a result of the extensive population widening ratio and the swift relocation of people from villages. The traffic monitoring process is a major issue in these areas due to the massive traffic flow on the roads. This research proposed a cluster-based improved authentication and communication scheme for an Intelligent Transportation System in Vehicular AdHoc Networks (VANETs). Our primary objective is to optimize resource sharing in vehicular communication. We enhanced the reliability, scalability, and stability of fast-moving VANETs by introducing cluster-based routing schemes for Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communications. We used a third-party certification authority for vehicle authentication to address security and privacy concerns. Our proposed schemes support minimizing the end-to-end (E2E) delay and route request, in addition to reducing link failure. Our schemes’ leading yield includes throughput enhancement, TCP Socket Initialization time minimization, TCP handshake response speedup, and DNS lookup improvement. The schemes are centred on short-range peer-to-peer (P2P) wireless communication in a 400-meter radius cluster. This includes innovative P2P wireless communications on VANET using minimized resources. The proposed schemes deliver a secure authentication mechanism with a securely generated vehicle authentication key provided by a certification authority. Furthermore, we have developed RESTful APIs in vehicular communication for implementation purposes, and also offered and implemented algorithms for resource sharing regarding V2V and V2I communication. Ultimately, we evaluated the performance of our experiments.

Pedestrian multi-target tracking technology plays an important role in artificial intelligence, driverless, virtual reality and other fields. The pedestrian multi-target tracking algorithm DeepSORT based on detection is widely used in industry. It mainly tracks multiple pedestrian targets continuously and keeps their ID unchanged. In order to improve the applicability and tracking accuracy of DeepSORT algorithm, this paper improved the IOU distance measurement in the matching process. At the same time, ResNet50 is used as the feature extraction backbone network, and combined with FPN (Feature Pyramid Network), the appearance features of multi-layer pedestrians are fused to improve the tracking accuracy of DeepSORT algorithm. The proposed algorithm is verified on the public data set MOT-16 and it’s tracking accuracy is enhanced to 4.1%.

Abstract Background: Periodontitis is associated with systemic chronic inflammatory diseases. There is limited evidence on the influence of anti-cytokine therapies on the periodontal condition and microbiome in the tooth pocket of such patients, so the aim of this study was to elucidate this issue. Methods: In this observational trial, the periodontal status and the gingival crevicular fluid of 13 patients with different chronic inflammatory diseases were obtained before initiation of anti-cytokine treatment and 14 weeks after. Gingival crevicular fluid was collected for 16S rRNA gene sequencing from a clinically healthy tooth and the deepest measured pocket. Results: In participants with advanced attachment loss at baseline, the clinical attachment level significantly decreased from 2.9 (2.3-3.4) to 2.4 (1.3-3.0) mm (p = 0.04), and the bleeding- on-probing index dropped from 19.4 (10.0-21.0) to 7.3 (6.9-9.9) mm (p = 0.02) without any further periodontal treatment. Shannon’s diversity index significantly increased in the deepest pockets of patients (p = 0.039). Conclusion: The data showed alterations in diversity of the subgingival microbiome and improvement of periodontal parameters over the course of the study, implying a shift towards a healthier condition after starting anti-cytokine therapy. Additional investigations are needed to analyze whether the administration of selective biologicals can improve periodontal conditions in patients with or without chronic inflammatory diseases.

Aging causes various degenerative diseases in the older adult population. Senescence, a state of permanent cell-cycle arrest accompanied by the production of various pro-inflammatory factors known as senescence-associated secretory phenotype (SASP), is considered a significant contributor to the aging process and its chronic diseases. Ample evidence showed that various stressors could induce senescence, including DNA damage, telomere shortening and damage, activation of oncogenes, and mitochondrial dysfunction. Numerous credible findings indicate that environmental agents can induce senescence, including UV radiation, a high-fat diet, heavy metal exposure, and cigarette smoke. These findings posed the possibility that many more environmental agents may induce senescence and accelerate aging but remain unidentified. Senescence also becomes more intriguing due to its promising future as a pharmacological target to blunt the detrimental effects of aging and prevent aging-related diseases, either by eliminating the senescent cells or by controlling the SASP. On the other hand, investigating senescence has become more intricate due to the need for a multi-marker approach and translation in vivo analysis. This review will discuss senescence and its biomarkers, how to identify gerontogens in vivo, and also the development of senotherapy that targets senescent cells.

Wearing gloves while operating machinery in workshops is an essential precaution to prevent mechanical injuries and burns from high temperatures, among other potential hazards. Ensuring workers are properly equipped with gloves, which is a crucial measure in accident prevention. Glove images often occupy a minimal proportion of the frame and are easily obscured by cluttered backgrounds, especially with limited edge computing resources. Consequently, this study proposes a glove detection algorithm called YOLOv8-AFPN-M-C2f based on YOLOv8, offering swifter detection speeds, lower computational demands, and enhanced accuracy for workshop scenarios. This research innovates by substituting the head of YOLOv8 with the AFPN-M-C2f network, amplifying the pathways for feature vector propagation, and mitigating semantic discrepancies between non-adjacent feature layers. Additionally, the introduction of a superficial feature layer enriches surface feature information, augmenting the model's sensitivity to smaller objects. To assess the performance of the YOLOv8-AFPN-M-C2f model, we conducted multiple experiments using a factory glove detection dataset compiled for this study. The results indicate that the enhanced YOLOv8 model surpasses other network models. Compared to the baseline YOLOv8 model, the refined version shows a 2.6% increase in mAP@50%, a 90.1% rise in FPS, and a 13% reduction in the number of parameters. This research contributes an effective solution for the detection of glove adherence.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

Data integrity and security are among the most essential things in this digital era performance. Digital certificates can be one solution to this problem. This research will develop the architecture of digital certificate verification and validation using blockchain. The blockchain concept for digital certificates uses three stages: requirements planning, workshop design, and implementation. Digital certificate files will be tested based on a scenario in which there could be any changes to those files, such as compressing files, changing data of files, inserting images in the file, and rotating files. This system architecture will detect any changes that could occur to the digital certificate file by using a digital signature, Keccak256 hash algorithm, and blockchain. This research shows that change detection accuracy for digital certificate files is 100%. However, there is a digital signature nature that could reduce the accuracy of change detection, and several solutions can be resolved. The average time to generate a signature using blockchain technology is 2.11 seconds, faster than 3.23 seconds when it does not use blockchain. The average time to validate a signature is 2.11 seconds without using blockchain, which is reduced to 0.22 seconds using blockchain technology. This research concludes that the architecture for digital certificate verification and validation using blockchain technology has successfully improved the security of digital certificates. Testing showed that even minor changes to a digital certificate could affect the signature, ensuring the certificate's integrity. For further research, evaluating the performance of various hash algorithms within the blockchain network is recommended.

The EigenAnt algorithm has been proposed to find the shortest path between two nodes with a proof of convergence. Two novel features are noticeable in EigenAnt compared to the conventional ant colony optimization algorithms. Pheromone evaporation in the EigenAnt algorithm is done locally for the selected path and it does not use heuristic information in its selection phase. On the other hand, a simple version of ant colony optimization that also does not use heuristic information has been used for analyzing convergence, considering parameter impact analysis, in the problem of finding the shortest path for 1-node binary chain problems. In this paper, we propose to improve the EigenAnt algorithm by adding additional parameters in such a way as to be able to take advantage of the analysis developed for the simple ant colony optimization algorithm. We demonstrate through our analysis that since the Improved EigenAnt algorithm has one parameter more than ant colony optimization algorithms, tuning of convergence speed is decoupled from tuning of convergence features in the algorithm. Thus, IEigenAnt, which can be interpreted as having two uncorrelated intensification and diversification components, makes it possible to achieve a balance between intensification and diversification. In order to illustrate the advantages of this decoupling, we present experimental results for the routing network problem.

Forming a clustered network structure has been proposed as a solution to increase network performance, scalability, stability and manageability in an ad hoc network. A good clustering algorithm aims to select cluster heads among available nodes so that a number of specific constraints are satisfied; thus the cluster head selection problem is a multiobjective optimization problem. This paper proposes an algorithm on the basis of ant colony optimization (ACO) to be used to solve this problem. The proposed algorithm is a simple, one hop cluster formation algorithm, to form a clustered structure with the minimum number of clusters. The centralized ACO-based clustering algorithm is evaluated and compared with other clustering algorithms in ad hoc networks in terms of cluster density.

Forest fires are one of the world's deadliest natural disasters. Early detection of forest fires can help minimize the damage to ecosystems and forest life. In this paper, we propose an improved fire detection method YOLOv5-IFFDM for YOLOv5. Firstly, the fire and smoke detection accuracy and the network perception accuracy of small targets are improved by adding attention mechanism in the backbone network. Secondly, the loss function is improved and the SoftPool pyramid pooling structure is used to improve the regression accuracy and detection effect of the model and the robustness of the model. In addition, random Mosaic augmentation technique is used to enhance the data to increase the generalization ability of the model, and re-clustering of flame and smoke detection a priori frames are used to improve the accuracy and speed. Finally, the parameters of the convolutional and normalization layers of the trained model are homogeneously merged to further reduce the model responsibility to improve the detection speed. Experimental results on homemade forest fire and smoke datasets show that this algorithm has high detection accuracy and fast detection speed, with average accuracy of fire up to 90.5% and smoke up to 84.3%, and detection speed up to 75 FPS (frames per second transmission), which can meet the requirements of real-time and efficient fire detection.

Aiming at the problems that the parameters of YOLOv5s model are too large and the computing resources of development board memory are limited, a new target detection method based on deep learning YOLOv5 algorithm model is proposed. First, the light-weight module Gz-ShffleNetv2 is used to construct cotton top bud feature extraction unit, which reduces the number of parameters and improves the running speed. It can be better applied in image classification, speed up detection and meet the requirements of mobile end of development board. Secondly, in order to solve the problem of decreasing detection accuracy caused by lightweight, BotNet and C3SE attention mechanism are added to focus on specific areas of cotton terminal bud. Combined with YYG loss function XIOU boundary frame regression loss, more feature information and rich feature MAP were obtained to further improve the accuracy of target detection. Through analysis of research and experimental results, the average accuracy map reached 91.3% under the Windos system NVIDIA Geforce RTX 2060 SUPER detection. While maintaining high precision identification, the number of parameters of YOLOv6 and YOLOv7-tiny network model is reduced by 83% and 53%, respectively, and the detection accuracy is increased by 1.2% and 7.7%, respectively. Compared with YOLOv5 reasoning image, the speed of image is increased by 0.035s, and the detection accuracy of MAP_0.5:0.95 is increased by 1%. At the same time, PyQt5 and YOLOv5 target detection algorithms are used to design a cotton top bud identification system, which makes cotton top bud detection more intuitive and convenient for subsequent hardware development and use.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

Open-vocabulary learning has recently gained prominence as a means to enable image segmentation for arbitrary categories based on textual descriptions. This advancement has extended the applicability of segmentation systems to a broader range of generally purpose scenarios. However, current methods often revolve around specialized architectures and parameters tailored to specific segmentation tasks, resulting in a fragmented landscape of segmentation models. In response to these challenges, we introduce OVAMTSeg, a versatile framework designed for Open-Vocabulary and Multitask Image Segmentation. OVAMTSeg harnesses adaptive prompt learning to empower the model to capture category-sensitive concepts, enhancing its robustness across diverse multi-task and scenario contexts. Text prompts are employed to effectively capture semantic and contextual features of the text, while cross-attention and cross-modal interactions enable the fusion of image and text features. Furthermore, a transformer-based decoder is incorporated for dense prediction. Extensive experimental results underscore the effectiveness of OVAMTSeg, showcasing its state-of-the-art performance and superior generalization capabilities across three segmentation tasks. Notable achievements include a 47.5 mIoU in referring expression segmentation, 51.6 mIoU on Pascal-VOC with four unseen classes, 46.6 mIoU on Pascal-Context in zero-shot segmentation, 65.9 mIoU on Pascal-5i, and 35.7 mIoU on COCO-20i datasets for one-shot segmentation.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

Aiming at the problem that dynamic targets in indoor environments lead to low accuracy and large errors in the localization and position estimation of visual SLAM systems and the inability to build maps containing semantic information, a semantic visual SLAM algorithm based on the semantic segmentation network DeepLabV3+ and LK optical flow is proposed based on ORB-SLAM2 system. First, the dynamic target feature points are detected and rejected based on the lightweight semantic segmentation network DeepLabV3+ and LK optical flow method. second, the static environment occluded by the dynamic target is repaired using the time-weighted multi-frame fusion background repair technique. Lastly, the filtered static feature points are used for feature matching and position calculation. Meanwhile, the semantic labeling information of static objects obtained based on the lightweight semantic segmentation network DeepLabV3+ is fused with the static environment information after background repair to generate dense point cloud maps containing semantic information, and the semantic dense point cloud maps are transformed into semantic octree maps using the octree spatial segmentation data structure. The localization accuracy of the visual SLAM system and the construction of the semantic maps are verified using the TUM RGB-D widely used dataset and real scene data, respectively. The experimental results show that the proposed semantic visual SLAM algorithm can effectively reduce the influence of dynamic targets on the system, has a higher localization accuracy, and compared with other advanced algorithms, such as DynaSLAM, has the highest performance in indoor dynamic environments while considering both localization accuracy and real-time performance. In addition, semantic maps can be constructed so that the robot can better understand and adapt to the indoor dynamic environment.

Land cover segmentation, a fundamental task within the domain of remote sensing, boasts a broad spectrum of application potential. In this article, we focus on the land cover segmentation tasks and complete the following research work: Firstly, to address the issues of uneven distribution of foreground and background and significant differences in target scales in remote sensing images, we propose a decoder called MDCFD based on multi-dilation rate convolution fusion. The decoder utilizes dilated convolution to expand the receptive field, enhancing the model's ability to capture global features and thus improving the model's ability to distinguish between foreground and background. Meanwhile, we design a multi-dilation rate convolution fusion module (MDCFM), which fuses the outputs of different dilation rate convolution layers. Secondly, aiming at the problems of diverse scenes, significant differences between categories, and many background interferences in remote sensing images, we propose a hybrid attention module called LKSHAM based on large kernel convolution. This module combines spatial attention and channel attention mechanisms and combines the two attention modules in series. By introducing large kernel convolution, the model's ability to extract contextual information is improved. At the same time, we adopt a strategy of decomposing large kernel convolution into multiple depthwise convolutions to reduce computational complexity. The improved network models designed by this paper can achieve an improvement of over 1.1% in the mIoU metric on segmentation tasks on the Potsdam and Vaihingen datasets.

Biohydrogen is a versatile energy carrier for the generation of electric energy from renewable sources. Hydrogenases can be used in enzymatic fuel cells to oxidize dihydrogen. The rate of electron transfer (ET) at the anodic side between the [NiFe]-hydrogenase enzyme distal iron-sulfur cluster and the electrode surface can be described by the Marcus equation. All parameters for the Marcus equation are accessible from DFT calculations. The distal cubane FeS-cluster has a three cysteine and one histidine coordination [Fe₄S₄](His)(Cys)₃ first ligation sphere. The reorganization energy (inner- and outer-sphere) is almost unchanged upon a histidine-to-cysteine substitution. Differences in rates of electron transfer between the wild-type enzyme and the all-cysteine mutant can be rationalized by a diminished electronic coupling between the donor and acceptor molecules in the [Fe₄S₄](Cys)₄ case. The fast and efficient electron transfer from the distal iron-sulfur cluster is realized by a fine-tuned protein environment which facilitates the flow of electrons. This study enables the design and control of electron transfer rates and pathways by protein engineering.

Traditional path planning algorithms have drawbacks in unmanned vehicle path planning, such as low efficiency, unsuitability for dynamic environments, and high computational complexity. To address these issues, this paper proposes a dynamic path planning method for unmanned vehicles that combines the A* algorithm with an improved Dynamic Window Approach (DWA). Firstly, a collision risk function is incorporated into the DWA algorithm to evaluate scores based on the braking distance corresponding to the current vehicle speed and the distance to obstacles, determining whether timely braking or obstacle avoidance is feasible. The earlier the braking or obstacle avoidance, the higher the score, thereby enhancing the evaluation algorithm of the DWA. Secondly, the key points extracted by the A* algorithm are used as temporary target points for the DWA algorithm, reducing the eight search directions to five. Finally, the key points of the A* algorithm’s path are set as the temporary end points for the DWA algorithm, integrating the two algorithms to plan a smoother curved path that can avoid unknown and dynamic obstacles. Simulation data demonstrates that compared to traditional artificial potential field methods, RRT, and Dijkstra’s algorithm, the new fusion algorithm reduces time by 11.71 seconds, a decrease of 6.9%, and shortens path length by 3.093 meters, a reduction of 4.16%, while increasing average linear velocity by 2.9%. The proposed algorithm ensures smoother paths while also making paths more rational and efficient

Image compression is a top priority today due to the need for faster encoding and decoding. To achieve this, the present study has proposed the use of Canonical Huffman Coding (CHC) as an entropy coder, which has a lower decoding time complexity than binary Huffman codes. For image compression, combining of the Discrete Wavelet Transform (DWT) and CHC with Principal Component Analysis (PCA) has been recommended. The lossy method has been introduced by using PCA, followed by DWT and CHC to enhance compression efficiency. By using DWT and CHC instead of PCA alone, the reconstructed image has been found to have a better peak signal-to-noise ratio (PSNR) value. This study has developed a hybrid compression model combining the advantages of DWT, CHC and PCA. With the increasing use of image data, better image compression techniques are necessary for efficient use of storage space. The proposed technique has achieved up to 60% compression while maintaining high visual quality. This method has also outperformed the currently available techniques in terms of both PSNR (in dB) and bit-per-pixel (bpp) scores. This approach has been tested on various color images, including Peppers 512×512 and Couple 256×256, showing improvement by 17 dB and 22 dB, respectively, while reducing bpp by 0.56 and 0.10, respectively. For grayscale images, i.e., Lena 512×512 and Boat 256×256, the proposed method has shown an improvement by 5 dB and 8 dB, respectively, with a decrease of 0.02 bpp in both cases.

In order to solve the problem of many constraints and complex navigation environment in the path planning of unmanned surface vehicle(USV), an improved Sparrow search algorithm com-bining Cubic chaotic map and Gaussian random walk strategy was proposed to plan it. Firstly, in the population initialization stage, Cubic chaotic map was used to replace the random generation method of the traditional sparrow search algorithm to optimize the uneven initial distribution of the population and improve the global search ability of the population. Secondly, in the late it-eration of the algorithm, the standard deviation of fitness is introduced to determine whether the population is trapped in the local optimum. If true, the Gaussian random walk strategy is used to perturb the optimal individual and assist the algorithm to escape the local optimum. Thirdly, the chosen water environment is modeled, and the navigation information of the original inland electronic navigation chart(ENC) is preprocessed, gridized, and the obstacle swelling is processed. Finally, the path planning experiments of USV are carried out in inland ENC grid environment. The experimental results show that, compared with the traditional sparrow search algorithm, the average fitness value of the path planned by improved sparrow search algorithm is reduced by 14.8%, and the variance is reduced by 49.9%. The path planned by the algorithm is of good quality and high stability, and combined with ENC, it can provide a reliable path for USV.

Underwater target detection is widely used in various applications such as underwater search and rescue, underwater environment monitoring, and Marine resources survey. However, the visibility of the underwater environment and the accuracy of target detection can be affected by complex underwater light changes and unpredictable background noise. To address these issues, we propose an improved underwater target detection algorithm based on YOLOv8n. Our algorithm focuses on three aspects. Firstly, we replace the original C2f module with Deformable Convnets v2 to enhance the adaptive ability of the target region in the convolution check feature map and extract the target region's features more accurately. Secondly, we introduce SimAm, a non-parametric attention mechanism, which can deduce and assign three-dimensional attention weights without adding network parameters. Lastly, we optimize the loss function by replacing the CIOU loss function with the Wise-IOU loss function. To conduct our experiments, we create our own dataset of underwater target detection for experimentation. Meanwhile, we also utilized the Pascal VOC dataset to evaluate our approach. The [email protected] and [email protected]:0.95 of the original YOLOv8n algorithm on the underwater target detection were 88.6% and 51.8%, respectively, and the improved algorithm [email protected] and [email protected]:0.95 can reach 91.8% and 55.9%. The original YOLOV8n algorithm was 62.2% and 45.9% [email protected] and [email protected]:0.95 on the Pascal VOC dataset, respectively. The improved YOLOV8n algorithm [email protected] and [email protected]:0.95 were 65.7% and 48.3%, respectively. The floating-point computation volume of the model is reduced by about 6%. The above experimental results prove the effectiveness of our method.

This paper proposed a triangular inequality-based rewiring method for the Rapidly exploring Random Tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

In airborne sensor networks (ASNs), the media access control (MAC) protocol is facing with serious unfairness problem due to the traditional protection mechanism of air-to-air communications among aircrafts. Actually by using the binary exponential back-off algorithm at high traffic loads to minimize collisions among users, the latest successful node can always benefit from this kind of MAC to obtain channel resources. Moreover, when taking the existence of the hidden nodes in ASNs into account, the inaccurate traffic load information will further aggravate the system’s unfairness. In this paper, a neighbor-channel-aware (NCA) protocol is proposed to improve the fairness of MAC protocol in ASNs. In the proposal, the NCA frame is firstly added and exchanged between neighbor nodes periodically, which helps to resolve the inaccurate traffic load information, so as to avoid reducing the probability of successful message transmission. Then a traffic-loading based back-off algorithm is involved to make the neighbor nodes cooperatively adjust the inter-frame space (IFS) interval to further reduce the unfairness. The simulation results show that, the proposed MAC protocol can guarantee the satisfied fairness, simultaneously avoiding heavy network overloads to protect key messages’ successful transmissions in ASNs.

Some traditional robots are based on offline programming reciprocal motion, and with the continuous upgrading of vision technology, more and more tasks are replaced by machine vision. For the current problem of insufficient accuracy of robot target localization based on binocular vision, and an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance For the current problem of insufficient accuracy of robot target localization based on binocular vision, an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance of multi Firstly, the RANSAC algorithm is improved based on the SURF algorithm; then the parallax gradient method is applied to iterate the matched point pairs several times to further optimize the data; then the 3D reconstruction is completed by the program technique; finally the obtained data is finally the obtained data is input into the robot arm and the camera internal and external parameters are obtained by the calibration method so that the robot can accurately locate and The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi- The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi-vision system.

The paper aims at presenting the results obtained in the development of a system allowing the detection and monitoring of forest fires and the continuous comparison of their intensity when several events occur simultaneously, as usually happens in the European Mediterranean countries during the summer season. The system, called SFIDE (Satellite FIre DEtection), exploits a geostationary satellite sensor (SEVIRI on board of MSG satellite series). The algorithm was developed several years ago in the framework of a project (SIGRI) funded by the Italian Space Agency (ASI). This algorithm has been completely reviewed in order to enhance its efficiency by reducing false alarms rate preserving a high sensitivity. Due to the very low spatial resolution of SEVIRI images (4x4 km² at Mediterranean latitude) the sensitivity of the algorithm should be very high to detect even small fires. The improvement of the algorithm has been obtained by: introducing the sun elevation angle in the computation of the preliminary thresholds to identify potential thermal anomalies (hot spots), introducing a contextual analysis in the detection of clouds and in the detection of night-time fires. The results of the algorithm have been validated in the Sardinia region by using ground true data provided by the regional Corpo Forestale e di Vigilanza Ambientale (CFVA). A significant reduction of the commission error (less than 10%) has been obtained with respect to the previous version of the algorithm and also with respect to fire-detection algorithms based on low earth orbit satellites.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

This study introduces an advanced dual-mode composite attitude control framework for reusable launch vehicles (RLVs), underpinned by an enhanced particle swarm optimization (PSO) algorithm. This innovative strategy is tailored to meet the stringent demands for precision and robust anti-interference capabilities across the entire flight envelope of RLVs. The research commences with the formulation of a comprehensive attitude dynamics model and diverse heterogeneous actuator representations, meticulously crafted to reflect the distinct phases of RLV flight. Building upon this foundation, a synergistic control paradigm is engineered, integrating PID and fuzzy PID controllers, complemented by a refined fitness evaluation function. The crux of the study is the application of an upgraded PSO algorithm to fine-tune the controllers' weighting coefficients, culminating in an optimized dual-mode composite attitude control system. A series of comparative simulation analyses are meticulously executed to appraise the system's responsiveness, stability, precision, and resilience to interference. The findings unequivocally substantiate the superior performance of the proposed control system, affirming its substantial contribution to the advancement of RLV attitude control.

The COVID-19 pandemic has emphasized the crucial role of ventilation systems in mitigating cross-infections, especially in infectious disease hospitals. This study introduces a dual-design operation ventilation system that can operate under two sets of ventilation conditions for normal and epidemic times. A challenge is optimizing duct diameters for required airflow while maintaining hydraulic balance. We design a genetic algorithm with adaptive penalty factor, the velocity constraint and the improved crossover and mutation probability. The improved genetic algorithm is suitable for ventilation system networks, which can find a better air duct diameters combination to improve the hydraulic balance rate, and reduce the usage of air valves, resulting in efficient hydraulic balancing commissioning. Compared with the traditional genetic algorithm, it has a faster search speed and a better global search ability, which is effective for the optimal design of ventilation system networks.

The security of several fully homomorphic encryption (FHE) schemes depends on the intractability assumption of the approximate common divisor (ACD) problem over integers. Subsequent efforts on solving the ACD problem as well as its variants were also developed during the past decade. In this paper, an improved orthogonal lattice (OL) based algorithm, AIOL, is proposed to solve the general approximate common divisor (GACD) problem. The conditions for ensuring the feasibility of AIOL are also presented. Compared to the Ding-Tao’s OL algorithm, the well-know LLL reduction is used only once in AIOL, and when the error vector r is recovered in AIOL, the possible difference between the restored and the true value of p is given. The experimental comparisons towards the Ding-Tao’s algorithm and ours are also provided for validating our improvements.

The Complete Coverage Path Planning (CCPP) is a key technology in the field of agricultural robot, and has great significance for improving the efficiency and quality of tillage, fertilization, harvesting and other agricultural robot operations, as well as reducing the operation energy consumption. The traditional boustrophedon or heuristic search algorithm based CCPP methods, when coping with the field with irregular boundaries, obstacles and other complex environments, still face many problems and challenges, such as large repeated work areas, multiple turns or U-turns, low operation efficiency and prone to local optimum. In order to solve the above problems, an improved-genetic-algorithm-based CCPP method was proposed in this paper, which introduces the idea of chromosome pairs and multi-points mutation to improve its global optimization ability in complex environments, reduce the repeated work areas and the number of turns and U-turns, and thereby improve the operation efficiency. The simulation and experimental results on simple regular fields showed that the proposed improved genetic algorithm-based CCPP method achieved the comparable performance with the traditional boustrophedon-based CCPP method. However, on the complex irregular fields, although the proposed CCPP method increased the number of turns by 13.76%, the area of repeated operation and the number of U-turns were decreased by 38.54% and 35.00% respectively, and saves the battery voltage by 7.82% on average compared to the boustrophedon-based CCPP method. This proved that the proposed CCPP method has strong adaptive capacity to the environment, and has practical application value in improving the efficiency and quality of agricultural machinery operations, and reducing the energy consumption.

To address the problem that it is easy to form coverage blind areas when wireless sensor networks are randomly deployed, an improved coverage optimization algorithm based on improved Salpa swarm Intelligent algorithm (ATSSA) is proposed for wireless sensor networks. Firstly, the pop-ulation is initialized using tent chaotic sequence to enhance the optimization ability of the algo-rithm. Secondly, the T-distribution mutation is added to the update formula of the leaders for improving the ability to jump out of the local optimal value. Finally, an adaptive formula for updating the position of the follower is proposed, which not only guarantees the local searching ability of the algorithm in the late iteration period, but also improves the global searching ability of the algorithm in the early iteration period. The experimental results show that ATSSA algorithm can improve the coverage of the wireless sensor networks and reduce deployment costs com-pared with other algorithms, when it is used in the wireless sensor networks.

This paper proposes a parameter coordination optimization design of Power System Stabilizer (PSS) based on an improved Quasi-Affine Transformation Evolutionary (QUATRE) algorithm to suppress low-frequency oscillation and improve the dynamic stability of power system. To begin, the Simulated Annealing (SA) algorithm randomly updates the globally optimal solution of each QUATRE iteration and matches the inferior solution with a certain probability to escape the local extreme point. This new algorithm is first applied to power system. Second, Since damping ratio is one of the criteria to measure the dynamic stability of power system, this paper sets the objective function according to the principle of maximization of damping coefficient of electromechanical mode, and uses SA-QUATRE to search a group of global optimal PSS parameter combinations to improve the stability margin of the system as much as possible. Finally, the method's rationality and validity were validated by applying it to the simulation examples of IEEE 4-machine 2-area system with different operation states. The comparison with the traditional optimization algorithm shows that the proposed method has more advantages for multi-machine PSS parameter coordination optimization, and can restrain the low-frequency oscillation of power system more effectively and enhance the system stability.

Phyllanthus emblica (P. emblica) has been described in many studies to have multiple therapeutic activities and is considered an important part of Ayurvedic and Unani medicinal systems. This study successfully synthesized P. emblica loaded polyvinylalcohol/gelatin based cryogels (PVA/Gel/P.emblica) to examine their potential in wound dressing applications. Swelling tests, Brunauer-Emmett-Teller (BET) and morphology analysis were conducted within the scope of characterization studies. In vitro cell culture studies were performed using HaCaT cells to illustrate the suitability of the synthesized cryogels as wound dressing material. The swelling tests and BET analysis results showed that swelling and surface area properties of cryogels increased with increasing P. emblica amounts. Morphological results displayed that the cryogels had a dense, interconnected pore morphology and a macroporous structure. 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyltetrazolium bromide (MTT), trypan blue exclusion and live-dead assay results revealed that adding of P. emblica into cryogels led to enhanced cell proliferation, increased cell number, and improved cell viability. Based on the phase contrast microscope, scanning electron microscope (SEM), immunofluorescence and giemsa staining images, it was observed that P. emblica promoted cell attachment, proliferation and penetration. In conclusion, it has been shown that PVA/Gel/P.emblica cryogels are suitable for use as wound dressing materials and can be developed with further studies.

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

Abstract In order to solve the problem that it is difficult to obtain the accurate trigger signal moment when using the time difference of UAV flight acoustic signals collected by acoustic sensors arranged in advance to locate the position of UAVs when they cannot be tracked by radar and are difficult to be observed by the human eye, an acoustic source localisation method with improved empirical modal decomposition (REMD) under an adaptive frequency window is proposed. Firstly, the collected UAV flight signals are smoothed and filtered, then the robust empirical modal decomposition (REMD) is used for IMF modal decomposition and spectral analysis of the collected signals, and a panning frequency window with variable bandwidth is introduced for corresponding frequency locking and extracting the IMFs; the GWO optimisation is used and the sliding metrics are set to determine the position of the panning frequency window automatically; finally, the extracted Finally, the extracted IMF components are reconstructed according to the criterion, and the trigger signal moments in the reconstructed IMF components are resolved and recorded, and the algorithm is used to calculate the difference between the reception moments of different sensors; for the traditional sound source localisation algorithms with a small detection range, which are prone to fall into the no-solution or false-solution, i.e., unable to achieve the localisation, a weighted least-squares-based Chan-Taylor algorithm is proposed for the localisation computation, and a weighted least-squares algorithm is proposed for the localisation computation, through the Inputting the sensor delay parameter and solving the linear equation system to get the target position information; finally, this paper verifies the robustness and performance of the design method with simulated and actual signals. The results show that the maximum positioning error is no more than 5% in an area with a side length of 15m in the measurement area. With the improved accuracy of time delay estimation, the positioning simulation results meet the positioning requirements even though the positioning error is further expanded when the measurement area is further expanded.

The study of the concentrations and effects of fine particulate matter in urban areas have been of great interest to researchers in recent times. This is due to the acknowledgment of the far-reaching impacts of fine particulate matter on public health. Remote sensing data have been used to monitor the trend of concentrations of particulate matter by deriving aerosol optical depth (AOD) from satellite images. The Center for International Earth Science Information Network (CIESIN) has released the second version of its global PM_2.5 data with improvement in spatial resolution. This paper revisits the study of spatial and temporal variations in particulate matter in Saudi Arabia by exploring the cluster analysis of the new data. Cluster analysis of the PM_2.5 values of Saudi cities is performed by using Anselin local Moran’s I statistic. Also, the analysis is carried out at the regional level by using self-organizing map (SOM). The results show an increasing trend in the concentrations of particulate matter in Saudi Arabia, especially in some selected urban areas. The eastern and south-western parts of the Kingdom have significantly clustering high values. Some of the PM2.5 values have passed the threshold indicated by the World Health Organization (WHO) standard and targets posing health risks to Saudi urban population.

Stagnation at local optima represents a significant challenge in bio–inspired optimization algorithms, often leading to suboptimal solutions. This paper addresses this issue by proposing a hybrid model that combines the Orca Predator Algorithm with Deep Q–Learning. Orca Predator Algorithm is an optimization technique that mimics the hunting behavior of orcas. It solves complex optimization problems by exploring and exploiting search spaces efficiently. Deep Q–Learning is a reinforcement learning technique that combines Q–Learning with deep neural networks. This integration aims to turn the stagnation problem into an opportunity for more focused and effective exploitation, enhancing the optimization technique’s performance and accuracy. The proposed hybrid model leverages the biomimetic strengths of Orca Predator Algorithm to identify promising regions nearby in the search space, complemented by the fine–tuning capabilities of Deep Q–Learning to navigate these areas precisely. The practical application of this approach is evaluated using the high–dimensional Heartbeat Categorization Dataset, focusing on the feature selection problem. This dataset, comprising complex electrocardiogram signals, provided a robust platform for testing the feature selection capabilities of our hybrid model. Our experimental results are encouraging, showcasing the hybrid strategy capability to identify relevant features without significantly compromising the performance metrics of machine learning models. This analysis was performed by comparing the improved method of Orca Predator Algorithm against its native version and a set of state–of–the–art algorithms.

In this study, we introduce and advanced multi-feature selection technique for bacterial classifi-cation employing the Salp Swarm Algorithm (SSA). We enhance SSA’s effectiveness by incorpo-rating the Opposition-Based Learning (OBL) strategy and the Local Search (LSA) algorithm. The proposed technique encompasses three key stages, streamlining the automated categorization of bacteria based on their distinctive features. The research adopts a multi-feature selection approach bolstered by an enhanced iteration of the Salp Swarm Algorithm (SSA). Enhancements include the utilization of Opposition-Based-Learning (OBL) to increase population diversity during search and Local Search Algorithms (LSA) to tackle local optimization challenges. The ISSA algorithm is designed to optimize the multi-feature selection by increasing the number of selected feature and improving classification accuracy. This study compares its performance with several other algo-rithms across ten distinct test datasets. The comparison results show that ISSA has better perfor-mance in terms of classification accuracy on 3 datasets consisting of 19 features, with a value reaching 73.75%. Additionally, ISSA excels in determining the optimal feature count and producing a better-fit value with a classification error rate of 0,249. Thus, the ISSA technique is expected to make a significant contribution to solving feature selection problems in bacterial analysis

Enhancing underwater images in epicontinental sea is a challenging problem owing to the influence of ocean currents, the refraction, absorption and scattering of light by suspended particles, and the weak illumination intensity. Recently, different methods have relied on the underwater image formation model and deep learning techniques to restore the underwater image, but they tend to degrade underwater image, interference of background clutter and miss boundary details of blue regions. Improved image fusion and enhancement algorithm based on a priori dark channel is proposed in this paper. Image edge features sharpening and dark detail enhancement by homomorphism filtering in CIELab color space is realized. In RGB color space, the multi-scale retinal with color restoration (MSRCR) algorithm is used to improve color deviation and enhance color saturation, and the contrast-limited adaptive histogram equalization (CLAHE) algorithm is used to de fog and enhance image contrast. Finally, according to the dark channel images of the three processing results, the final enhanced image is obtained by linear fusion of multiple images and multiple channels. Experimental results demonstrate the effectiveness and practicality of the proposed method on various datasets.

Mental stress state recognition using electroencephalogram (EEG) signals for real-life applications needs a conventional wearable device. This requires an efficient number of EEG channels and an optimal feature set. The main objective of the study is to identify an optimal feature subset that can best discriminate mental stress states while enhancing the overall performance. Thus, multi-domain feature extraction methods were employed, namely, time domain, frequency domain, time-frequency domain, and network connectivity features, to form a large feature vector space. To avoid the computational complexity of high dimensional space, a hybrid feature selection (FS) method of minimum Redundancy Maximum Relevance with Particle Swarm Optimization and Support Vector Machine (mRMR-PSO-SVM) is proposed to remove noise, redundant, and irrelevant features and keep the optimal feature subset. The performance of the proposed method is evaluated and verified using four datasets, namely EDMSS, DEAP, SEED, and EDPMSC. To further consolidate, the effectiveness of the proposed method is compared with that of the state-of-the-art heuristic methods. The proposed model has significantly reduced the features vector space by an average of 70% in comparison to the state-of-the-art methods while significantly increasing overall detection performance.

Multidisciplinary Design Optimization (MDO) is the most active field in the design of current complex system engineering, which is possessed with such two difficulties as subsystem information exchange and analytical and computational complexity of systems. Therefore, an improved collaborative optimization algorithm based on ANN (artificial neural network) response surface was proposed dependent on the consistency constraint algorithm and concurrent subspace algorithm. As an optimization method with secondary structure, it satisfied only local constraints in discipline layer, but provided a coordinated mechanism for interdisciplinary conflict in system layer. Finally, it was applied in the multidisciplinary design optimization of autonomous underwater vehicle (AUV). As shown from the result, the MDO convergence stability and reliability of low resistance, low noise and high maneuvering performance of the AUV shape can be ensured by the improved collaborative optimization algorithm, thus verifying the effectiveness of the algorithm.

The healthcare situation in Africa is characterized by limited resources and a high burden of disease, presenting significant challenges to the healthcare systems in the region. The integration of Artificial Intelligence (AI) technologies in African healthcare holds immense potential for addressing these challenges and improving health outcomes. This paper aims to provide a comprehensive understanding of the current healthcare landscape in Africa and the urgent need for AI-driven solutions.In addition to discussing the potential applications of AI in African healthcare, such as disease diagnosis, treatment planning, and medical imaging analysis, this manuscript seeks to shed light on the specific challenges hindering the implementation of AI in the region. By providing detailed examples and case studies, we aim to offer insights into the obstacles that need to be overcome and potential solutions that can be pursued.By leveraging AI technologies, Africa has the opportunity to revolutionize its health systems, bridging the gap in access to quality healthcare across the continent. The objective of this review article is to not only highlight the potential benefits that AI can bring to African healthcare but also to emphasize the urgent need for action and collaboration in implementing and scaling up AI innovations in the region. By doing so, African countries can pave the way for improved health outcomes and ensure that their populations receive the healthcare services they deserve.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.

Formation in soccer is among the most important tactical choices for a successful match.Herein, the simulations of 420000 match-plays have been performed varying the formation, the number of opponents that are actively pressing the team, the speed of the opponents in attempting a pass interception. Dribbling has been neglected. The match-play ends either with a successful series of passes from a central back to the line of the strikers or with the opponents that steal the ball. In this work, I demonstrate that 3-4-3 formation, which is among the most employed formations, relates to the highest probability of success.

The review scrutinizes the currently performed research on the new methods for enhancing bituminous binder performance through radiation and radical grafting of polymer modifers of bitumen. It investigates innovative methods, including using waste polymers as modifiers, and applying radiation for polymer grafting, to overcome challenges like high costs, low aging resistance and storage stability issues, of which separation of phases polymer/bitumen is the most significant obstacle. These advanced modification techniques promise sustainability through the decrease of the carbon footprint of transportation systems by improving the properties and durability of binders. Additionally, the review discusses the parameters and mechanistic aspects from a scientific perspective, shedding light on the underlying processes that contribute to the improved performance of modified bituminous binders.

Multiagent technologies give a new way to study and control complex systems. Local interactions between agents often lead to group synchronization also known as clusterization, which usually is a more rapid process in comparison with relatively slow changes in external environment. Usually, the goal of system control is defined by the behaviour of a system on long time intervals. When these time intervals are much longer than the time of cluster formation, clusters may be considered as new variables in a ``slow'' time model. We call such variables ``mesoscopic'' to emphasize their scale laying between the level of the whole system (macroscopic scale) and the level of individual agents (microscopic scale). Thus, it allows us to reduce significantly the dimensionality of a system by omitting considerations of each separated agent, so that we may hope to reduce the required amount of control inputs. Thus, we are often able to consider a system as a collection of ``flowing'' (morphing) clusters emerged form behaviour of a huge amount of individual agents. In this paper, we contrast such approach to the one where a system is considered as a network of elementary agents. We develop a mathematical framework for analysis of cluster flows in multiagent networks and use it to analyze the Kuramoto model as an attracting example of a complex networked system. In this model, a clusterization leads to sparse representation of dynamic trajectories in the whole quantized state space. With that in mind, compressive sensing allows to restore the trajectories in a high-dimensional discrete state space based on significantly lower amount of randomized integral mesoscopic observations. We propose a corresponding algorithm of quantized dynamic trajectory compression. It could allow us to efficiently transmit the state space data to a data center for further control synthesis. The theoretical results are illustrated for a simulated multiagent network with multiple clusters.

Railway transportation is one of the main modes of long-distance coal transportation, and it is inevitable to cause environmental pollution during the transportation process. In order to improve the environment along the railway and increase the utilization rate of coal resources, this paper proposes a detection algorithm for scattered coal solidification layer during transportation based on the YOLO v8 model, and designs an intelligent recognition model suitable for coal solidification layer detection devices by combining fluorescence detection methods. Through experimental analysis, the model meets the requirements of practical detection and plays a crucial role in environmental protection, with strong practical application value.

To address the large hysteresis and susceptibility to instability in high-speed deposition fusion moulding (FDM) 3D printing’s temperature control, this paper proposes an improved ant-lion optimization algorithm (OCALO) to optimize the PID parameters.The improvement aims to solve the problem that the traditional ant-lion optimization algorithm (ALO) reduces the population diversity and tends to fall into the local optimal solution when it is close to the global optimal solution.The generation of the initial solution is enhanced by the introduction of a new Tent-Logistic-Cotangent composite chaotic mapping. This integration into Elite Opposition-Based Learning aids in optimizing population diversity. Concurrently, the incorporation of cosine factors of a specified parameter into the elitist formula of the traditional ALO algorithm is aimed at reducing the tendency of ants to randomly gravitate towards ant-lions with lower fitness values. This adjustment helps in balancing the exploration-exploitation trade-off in the algorithmic process. Compared with two existing classical algorithms and three improved ALO algorithms, the algorithm improves the convergence speed, global search ability and the ability to jump out of the local optimal solution. The improved algorithm was combined with PID control to design an OCALO-PID temperature controller and simulated on a high-speed 3D printing temperature model identified by modelling. The results show that the method improves the transient and steady-state performance of reactor temperature control with good control accuracy and robustness. Finally, the proposed algorithm is applied to a physical experimental platform to verify the feasibility of the algorithm.

Calligraphy works have high artistic value, but there is a rampant problem of forgery. Indeed, authentication of traditional calligraphy heavily relies on calligraphers' subjective judgment. Therefore, spurred by the recent development of neural networks, this paper proposes a method for authenticating calligraphy works based on an improved EfficientNet network. Specifically, the developed method utilizes the character box algorithm and the centroid algorithm to extract individual calligraphy characters, which are then augmented and used as the training set for the model. The training process employs CBAM and Self-Attention modules to enhance the attention mechanism of the EfficientNet network. The model is tested on authentic works, imitated works, and works from other calligraphers and is compared with other networks. The experimental results demonstrate that the proposed method effectively achieves the authentication of calligraphy works, and the improved CBAM-EfficientNet network and SA-EfficientNet network achieve better authentication performance.

Non-destructive testing of metallic objects that may contain embedded defects of different sizes is an important application in many industrial branches for quality control. Most of these techniques allow defect detection and its approximate localization, but very few give enough information for its 3D reconstruction. Here we present a hybrid laser – transducer system that combines remote laser-generated ultrasound excitation and non-contact ultrasonic transducer detection. This fully non-contact method gives access to separating scan areas on different object’s faces and defect details from different angles/perspectives can be analysed. This hybrid system can analyse the whole object’s volume data and allow a 3D reconstruction image of the embedded defects. As a novelty for the signal processing improvement, we use a 2D apodization window filtering technique, applied along with the synthetic aperture focusing algorithm in order to remove the undesired effects of side lobes and wide-angle reflections of propagating ultrasound waves, thus, enhancing the resulting 3D image of the defect. We provide both qualitative and quantitative volumetric results with high accuracy and resolution compared with conventional techniques.

The ability of S. aureus to infect humans and cause a wide range of infections so efficiently is a consequence of the many variant virulence factors that it can produce. Superantigens (SAgs) make up a group of them and include staphylococcal enterotoxins (SE). The main objective of this study was to detect enterotoxin gene cluster (EGC) in S. aureus isolates that caused infections in Paraguayan children in the year 2017, through an observational and cross-sectional study. The detection of the EGC including the seg, sei, sem, sen, seo, and seu genes, was carried out by end-point PCR. 181 S. aureus isolates were collected, most of them caused skin and soft tissue infections (SSTI, n=140, 77%) and came from children under 6 years 50% (n=90). At least one SE gene was detected in 96% (174/181) of isolates and 24% (44/181) carried the entire EGC. An association between methicillin resistance and seg, sei, seo, and seu gene carriage (p ≤0.05) was observed. A high prevalence of EGC was detected in S. aureus isolates collected from infected children attending the main health care centers in Paraguay, its importance is due to the potential of these toxins to aggravate staphylococcal infections.

The contamination on the insulators may increase its surface conductivity and, as a consequence, electrical discharges occur more frequently, which can lead to interruptions in the power supply. To maintain reliability in the electrical distribution power system, components that have lost their insulating properties must be replaced. Identifying the components that need maintenance, is a difficult task as there are several levels of contamination that are hardly noticed during inspections. To improve the quality of inspections, this paper proposes to use the k-nearest neighbours (k-NN) to classify the levels of insulator contamination, based on the image of insulators at various levels of contamination simulated in the laboratory. Using computer vision features such as mean, variance, asymmetry, kurtosis, energy, and entropy are used for training the k-NN. To assess the robustness of the proposed approach, statistical analysis and a comparative assessment with well-consolidated algorithms such as decision tree, ensemble subspace, and support vector machine models are presented. The k-NN showed results of up to 85.17 % accuracy using the k-fold cross-validation method, with an average accuracy higher than 82 % for multi-classification of the contamination of the insulators, being superior to the compared models.

Using multi-color flow cytometry analysis, we studied the immunophenotypical differences between leukemic blasts/LSCs from patients with AML/MDS and hematopoietic stem and progenitor cells (HSPCs) from patients in complete remission (CR) following their successful treatment. The panel of markers included CD34, CD38, CD45RA, CD123 as representatives for a hierarchical hematopoietic stem and progenitor cell (HSPC) classification as well as programmed death ligand 1 (PD-L1). Rather than restricting the evaluation on a 2- or 3-dimensional analysis, we applied a t-distributed stochastic neighbor embedding (t-SNE) approach to get a deeper insight and segregation between leukemic and normal HPSCs. For that purpose, we created a t-SNE map, which resulted in the visualization of 27 cell clusters based on their similarity concerning the composition and intensity of antigen expression. Two of these clusters were “leukemia-related” containing a great proportion of CD34⁺/CD38^- hematopoietic stem cells (HSCs) or CD34⁺ cells with a strong coexpression of CD45RA/CD123, respectively. CD34⁺ cells within the latter cluster were also highly positive for PD-L1 reflecting their immunosuppressive capacity. Beyond this proof of principle study, the inclusion of additional markers will be helpful to refine the differentiation between normal HSPCs and leukemic cells, particularly in the context of minimal disease detection and antigen-targeted therapeutic interventions. Furthermore, we suggest a protocol for the assignment of new cell ensembles in quantitative terms, via a numerical value, the Pearson coefficient, based on a similarity comparison of the t-SNE pattern with a reference.

With the continuous breakthrough of natural language processing, the application of intelligent question answering technology in electric power system has attracted wide attention. However, at present, the traditional question answering system has poor performance and is difficult to be applied in engineering practice. This paper proposes an improved BERTserini algorithm for intelligent answering of electric power regulations based on a BERT model. The proposed algorithm is implemented in two stages. The first stage is the text segmentation stage, where a multi-document long text preprocessing technique is utilized that accommodates the rules and regulations text, and then Anserini is used to extract paragraphs with high relevance to the given question. The second stage is answer generation and source retrieval stage, where a two-step fine-tuning based on the Chinese BERT model is applied to generate precise answers based on given questions, while the information regarding documents, chapters, and page numbers of these answers are also output simultaneously. The algorithm proposed in this paper eliminates the necessity for manual organization of professional question-answer pairs, thereby effectively reducing the manual labor cost compared to traditional question answering systems. Additionally, this algorithm exhibits a higher degree of exact match rate and a faster response time for providing answers.

In this paper, stochastic multi-objective intelligent framework (MOIF) is performed for distribution network reconfiguration to minimize power losses, the number of voltage sags, the system's average RMS fluctuation, the average system interruption frequency (ASIFI), the momentary average interruption frequency (MAIFI), and the system average interruption frequency (SAIFI) considering the network uncertainty. The unscented transformation (UT) approach is applied to model the demand uncertainty due to simplicity to implement and no presumptions to simplify. A human-inspired intelligent method named improved mountaineering team-based optimization (IMTBO) is applied to determine the decision variables defined as the network's optimal configuration. The conventional MTBO is improved using a quasi-opposition-based learning strategy to overcome premature convergence and achieve the optimal solution. The simulation results showed that in single- and double-objective optimization, some objectives are weakened compared to their base value, while the results of the MOIF indicated a fair compromise between different objectives, and all objectives are improved. The results of MOIF based on the IMTBO cleared that the losses are reduced by 30.94%, the voltage sag numbers and average RMS fluctuation are reduced by 33.68% and 33.65%, and also ASIFI, MAIFI, and SAIFI are improved by 6.80%, 44.61%, and 0.73%, respectively. Also, the superior capability of the MOIF based on the IMTBO is proved compared to the conventional MTBO, particle swarm optimization, and artificial electric field algorithm. Moreover, the results of the stochastic MOIF based on the UT showed the power loss increased by 7.62%, voltage sag, and SARFI increased by 5.39% and 5.31%, and ASIFI, MAIFI, and SAIFI weakened by 2.28%, 6.61%, and 1.48%, respectively compared to the deterministic MOIF model.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

Pavement crack detection is one of the key links in highway pavement maintenance management. In the current road crack detection, the network model easily ignores the shallow geometric features of cracks and cannot extract the key feature information of cracks. Aiming at the above problems, an EC-YOLOX network model is proposed. The CFPN is constructed to cross-fuse different scale features to solve the feature scale invariance. In the strengthen feature extraction layer, ECANet is fused to enhance the ability to pay attention to key information. The WEIoU loss function is proposed, which assigns different penalty terms to the target box in the vertical and horizontal directions. In terms of data, geometric distortion constraint correction is performed on the single-point perspective pavement image. The experimental data show that the accuracy of EC-YOLOX on the self-built data set reaches 76.34% [email protected], which is 4.45% higher than that of YOLOX. The loss curve of EC-YOLOX is smoother than that of YOLOX, and the minimum training loss value is 2.136, which is 0.648 lower than the minimum loss value 2.784 of YOLOX. Many experiments have verified the effectiveness of EC-YOLOX in improving the detection effect in pavement crack detection.

This paper introduces new improvements to the modified version of the BIRECT (BI secting RECTangles) algorithm referred to as BIRECTv. We explore various approaches, by first including a grouping strategy for hyper-rectangles having almost the same sizes by categorizing them into different classes. Therefore constraining them not to exceed a certain pre-defined threshold (a small positive value to define the tolerance level). This approach allows for more efficient computation and can be particularly useful when dealing with a large number of hyper-rectangles with varying sizes. To avoid over-sampling, and preventing redundant or excessive sampling, at some shared vertices in descendant subregions, a particular vertex database is used to limit the number of samples taken within each subregion to two. The experimental investigation shows that these improvements have a positive impact on the performance of the BIRECTv(imp.) algorithm and the proposal is a promising global optimization algorithm compared to the original BIRECTv algorithm and its variants. Additionally, the BIRECTv(imp.) algorithm showed particular efficacy in solving high-dimensional problems.

Because of the rapid advancement in the use of photovoltaic (PV) energy systems, it has become critical to look for ways to improve the energy generated by them. The extracted power from the PV modules is proportional to the output voltage. The relationship between output power and array voltage has only one peak under uniform irradiance, whereas it has multiple peaks under partial shade circumstances (PSC). There is only one global peak (GP) and many local peaks (LPs), where the typical maximum power point trackers (MPPT) may become locked in one of the LPs, significantly reducing the PV system's generated power and efficiency. The metaheuristic optimization algorithms (MOAs) solved this problem, albeit at the expense of the convergence time, which is one of these algorithms' key shortcomings. Most MOAs attempt to lower the convergence time at the cost of the failure rate and the accuracy of the findings because these two factors are interdependent. To address these issues, this work introduces the dandelion optimization algorithm (DOA), a novel optimization algorithm. The DOA's convergence time and failure rate are compared to other modern MOAs in critical scenarios of partial shade PV systems to demonstrate the DOA's superiority. The results obtained from this study showed substantial performance improvement compared to other MOAs, where the convergence time is reduced to 0.4 s with zero failure rate compared to 0.9 s, 1.25 s, and 0.43 s for other MOAs under study. The optimal number of search agents in the swarm, optimal initialization of search agents, and optimal design of the dc-dc converter is introduced for optimal MPPT performance.

Traveling salesman problems (TSPs) are well-known combinatorial optimization problems, and most existing algorithms are challenging for solving TSPs when its scale is large. To improve the efficiency of solving large-scale TSPs, this work presents a novel adaptive layered clustering framework with improved genetic algorithm (ALC\_IGA). The primary idea behind ALC\_IGA is to break down a large-scale problem into a series of small-scale problems. First, the $k$-means and improved genetic algorithm are used to segment the large-scale TSPs layer by layer and generate the initial solution. Then, the developed two phases simplified $2$-opt algorithm is applied to further improve the quality of the initial solution. The analysis reveals that the computational complexity of the ALC\_IGA is between $O(n\log n)$ and $O(n^2)$. The results of numerical experiments on various TSP instances indicate that, in most situations, the ALC\_IGA surpasses the state-of-the-art algorithms in convergence speed, stability, and solution quality. Specifically, the ALC\_IGA can solve instances with $2 \times 10^5$ nodes within 0.15h, $1.4 \times 10^6$ nodes within 1h, and $2 \times 10^6$ nodes in three dimensions within 1.5h.

An improved anti-noise morphology vision navigation algorithm is proposed for intelligent tractor tillage in a complex agricultural field environment. Firstly, the two key steps, Guided Filtering and improved anti-noise morphology navigation line extraction, were addressed in detail. Then the experiments were carried out in order to verify the effectiveness and advancement of the presented algorithm. Finally, the optimal template and its application condition were studied for improving the image processing speed. The comparison experiment results show that the YCbCr color space has minimum time consumption, 0.094 s, compared with HSV, HIS and 2R-G-B color spaces. The Guided Filtering method can enhance the new & old soil boundary effectively than any other methods such as Tarel, Multi-scale Retinex, Wavelet-based Retinex and Homomorphic Filtering, meanwhile, has the fastest processing speed of 0.113 s. The extracted soil boundary line of the improved anti-noise morphology algorithm has best precision and speed compared with other operators such as Sobel, Roberts, Prewitt and Log. After comparing different size of image template, the optimal template with the size of 140×260 pixels can meet high precision vision navigation while the course deviation angle is not more than 7.5°. The maximum tractor speed of the optimal template and global template are 51.41 km/h and 27.47 km/h respectively which can meet real-time vision navigation requirement of the smart tractor tillage operation in the field. The experimental vision navigation results demonstrated the feasibility of the autonomous vision navigation for tractor tillage operation in the field using the new & old soil boundary line extracted by the proposed improved anti-noise morphology algorithm which has broad application prospect.

Classifying network flow subsequences in an Industrial IoT gateway is an effective method for identifying Industrial IoT faults. This paper proposes a subsequence classification algorithm SSGBUL-IKNN based on unsupervised learning encoding to address the problem of low classification accuracy. Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the Industrial IoT gateway. In the encoding module, a subsequence calibration algorithm controls the increasing error during the coding process. Then, the specific fault type is obtained through an improved KNN classification algorithm based on the indication distance source from the integrated coding sequences converted by multi-dimensional network flow sequences. The test result on three Industrial IoT datasets of a sewage treatment plant shows that the accuracy of SSGBUL-IKNN in this paper exceeds 92%, significantly higher than the algorithm DTW and TSF. It reaches the classification requirements of Industrial IoT fault diagnosis.

In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms (Fuzzy C-means (FCM) and Possibilistic c-means (PCM)) are applied. Afterward, VAT is used to investigate the clustering tendency visually, and then in order of checking cluster validation, three types of indices (e.g., PC, DI, and DBI) were used. After observing the clustering algorithms, it was evident that each of them has its limitations; however, PCM is more robust to noise than FCM as in case of FCM a noise point has to be considered as a member of any of the cluster.

Polyaromatic hydrocarbons (PAHs) are widespread in the interstellar medium (ISM). The abundance and relevance of PAHs call for a clear understanding of their formation mechanisms, which, to date, have not been completely deciphered. Of particular interest is the formation of benzene, the basic building block of PAHs. It has been shown that ionization of neutral clusters can lead to an intra-cluster ionic polymerization process that results in molecular growth. Ab initio molecular dynamics (AIMD) studies in clusters consisting of 3–6 units of acetylene modeling ionization events under ISM conditions have shown maximum aggregation of three acetylene molecules forming bonded C6H6+ species: the larger the number of acetylene molecules, the higher the production of C6H6+. These results lead to the question of whether clusters bigger than those studied thus far promote aggregation beyond three acetylene units, and whether larger clusters can result in higher C6H6+ production. In this study, we report results from AIMD simulations modeling the ionization of 10 and 20 acetylene clusters. The simulations show aggregation of up to four acetylene units producing bonded C8H8+. Interestingly, C8H8+ bicyclic species were identified, setting precedent for their astrochemical identification. Comparable reactivity rates were shown with 10 and 20 acetylene clusters.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

Underwater visual detection technology plays a pivotal role in fields such as marine exploration. With the increasing demand for underwater monitoring, the quest for efficient and reliable methods for underwater target recognition has become particularly significant. To address this requirement, this study developed an innovative underwater object detection architecture based on YOLOv8, named YOLOv8-MU, aimed at significantly enhancing detection accuracy.By integrating the LarK module proposed in UniRepLKNet to optimize the backbone network, YOLOv8-MU aims to achieve a larger receptive field without increasing the model’s depth. Further, this research introduces C2fSTR, an innovative method that combines Swin Transformer with the C2f module. Additionally, we have incorporated the SPPFCSPC_EMA module, which combines Cross-Stage Partial Fast Spatial Pyramid Pooling (SPPFCSPC) with attention mechanisms, significantly improving the detection accuracy and robustness of various biological targets. Moreover, by introducing a fusion block based on DAMO-YOLO into the neck of the model, we further enhanced the model’s capability in multi-scale feature extraction. Finally, the adoption of the MPDIoU loss function, designed around vertex distance, effectively tackles the challenges of localization accuracy and boundary clarity in underwater organism detection. Experimental results on the URPC2019 dataset demonstrate that the YOLOv8-MU model achieved an [email protected] of 78.4%, marking improvements of 5.6%, 1.1%, and 4.0% over YOLOv5s, YOLOv7, and YOLOv8n respectively, indicating the leading performance (SOTA) of this method. On the other hand, further evaluation on the URPC2020 dataset confirmed the generalization capability of the YOLOv8-MU architecture, with its [email protected] reaching 80.4%, surpassing various models including YOLOv5x and YOLOv8n, showcasing the wide applicability of our proposed improved model architecture.

The paper presents an error model of a measurement chain containing link performing discrete wavelet transform algorithm which is most often the last stage of measurement signal processing. The goal is to determine the uncertainty budget of the input quantities of the wavelet transform algorithm. The error model takes into account parts of analog, analog-to-digital and digital processing, describing the properties of subsequent fragments of the chain using their transmittance and processing functions. The proposed model enables the description of both deterministic and non-deterministic properties of signal errors. The proposed model was validated using an example measurement chain created for this purpose.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

An improved anti-noise morphology vision navigation algorithm is proposed for intelligent tractor tillage in a complex agricultural field environment. At first the two key steps, Guided Filtering and improved anti-noise morphology navigation line extraction were addressed in detail. Then the experiments were carried out in order to verify the effectiveness and advancement of the presented algorithm. Finally, the optimal template and it’s application condition were studied for improving the image processing speed. The comparison experiment results show that the YCbCr color space has minimum time consumption of 0.094 s in comparison with HSV, HIS and 2R-G-B color spaces. The Guided Filtering method can effectively distinguish the boundary between the new and old soil than other competing vanilla methods such as Tarel, Multi-scale Retinex, Wavelet-based Retinex and Homomorphic Filtering inspite of having the fastest processing speed of 0.113 s. The extracted soil boundary line of the improved anti-noise morphology algorithm has best precision and speed compared with other operators such as Sobel, Roberts, Prewitt and Log. After comparing different size of image template, the optimal template with the size of 140×260 pixels can meet high precision vision navigation while the course deviation angle is not more than 7.5°. The maximum tractor speed of the optimal template and global template are 51.41 km/h and 27.47 km/h respectively which can meet real-time vision navigation requirement of the smart tractor tillage operation in the field. The experimental vision navigation results demonstrated the feasibility of the autonomous vision navigation for tractor tillage operation in the field using the new and old soil boundary line extracted by the proposed improved anti-noise morphology algorithm which has broad application prospect.

A real-time monitoring system for the operational status of fishing vessels is an essential element for the modernization of the fishing industry. The operational status of fishing vessels can be identified by using onboard cameras to detect the deck crew and the use of fishing nets. Due to the typically limited processing capacity of shipboard equipment and the significant memory consumption of detection models, however, general target detection models are unable to perform real-time image detection to identify the operational status of fishing vessels. In this paper, we propose a lightweight real-time deck crew and the use of fishing nets detection method, YOLOv5s-SGC. It is based on the YOLOv5s model, which uses surveillance cameras to obtain video of fishing vessels operating at sea and enhances the dataset. YOLOv5s-SGC replaces YOLOv5s’s backbone and the ordinary convolutional blocks in the feature fusion network with ShufflNetV2 and Ghost module.

Depth-sensing technology has led to broad applications of inexpensive depth cameras that can capture human motion and scenes in 3D space. Background subtraction algorithms can be improved by fusing color and depth cues, thereby allowing many issues encountered in classical color segmentation to be solved. In this paper, we propose a new fusion method that combines depth and color information for foreground segmentation based on an advanced color-based algorithm. First, a background model and a depth model are developed. Then, based on these models, we propose a new updating strategy that can eliminate ghosting and black shadows almost completely. Extensive experiments have been performed to compare the proposed algorithm with other, conventional RGB-D algorithms. The experimental results suggest that our method extracts foregrounds with higher effectiveness and efficiency.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

Insulated Gate Bipolar Transistor (IGBT) may convey high current and sustain high breakdown voltages; it may provide high power control. In a sense, how IGBT demonstrates the capability of power control was not specifically described, and the equivalent bipolar junction transistors (BJT) activated by an applied bias to the insulated gate is intriguing. As seen in Figure 1, IGBT shows an equivalent circuit structure containing two types of BJT, (NPN-type Bipolar transistor and PNP-type Bipolar transistor), which can be modeled as diode-associated transistor. Apparently, as a bias applies to the controlling gate, the channel beneath the gate oxide gets strongly inversed and turns out to be conductive just like what happens on metal-oxide-silicon field effect transistor (MOSFET), which provides necessary igniting currents to both BJTs and thus causes high current gain flowing through them-selves from the bottom. A proposed and renewed formula provides addressing the above scenario and successfully fitting the measured data that forms the characteristic curves. Some parameters in the proposed formula, which includes size and mobility associated constant, threshold voltage, and Early-Voltage-related lambda for MOSFET, explain and explore the underlying physics. IGBT thus enjoy high input impedance and high current gain due to MOSFET (Insulated Gate) and BJT, respectively. This formula combines both merits of MOSFET and BJT in order to fit the measured data. Indeed, the formula intimately fits IGBT electrical characteristic curves, and thus may be qualified and served as a model. The new model is then advisable for designing power integrated circuit to exactly achieve power saving, power control, and power efficiency.

This research introduces a pioneering solution to the challenges posed by gastrointestinal tract (GI) cancer in radiation therapy, focusing on the imperative task of precise organ segmentation for minimizing radiation-induced damage. GI imaging has historically used manual demarcation, which is laborious and uncomfortable for patients. We address this by introducing the ResECA-U-Net deep learning model, a novel combination of the UNet and ResNet34 architectures. Furthermore, we further augment its functionality by incorporating the Efficient Channel Attention (ECA-Net) methodology. By utilizing data from the UW-Madison Carbone Cancer Centre, we carefully investigate several image processing techniques designed to capture critical local characteristics. With its foundation in computer vision concepts, the ResECA-U-Net model is excellent at extracting fine details from GI images. Sophisticated metrics such as intersection over union (IoU) and the dice coefficient are used to evaluate performance. Our study's outcomes demonstrate the effectiveness of the suggested method, yielding an impressive 96.27% Dice coefficient and 91.48% IoU. These results highlight the significant contribution that our strategy has made to the advancement of cancer therapy. Beyond its scientific merits, this work has the potential to significantly enhance cancer patients' quality of life and provide better long-term outcomes. Our work is a significant step towards automating and optimizing the segmentation process, which can potentially change how GI cancer is treated completely.

Mapping or quantitative inversion through remote sensing technology is an active way for mineral monitoring in large or uncultivated forest areas. Different spectral features of minerals, induced by ionic composition, can be identified which are related to mineral type or abundance. Based on the distinctive spectral absorption around 2.33µm induced by the carbonate ion, we use it as an analytic target to propose an improved continuum removal (ICR) algorithm to couple with normalized abundance to evaluate the relationship between continuum removal band depth (CRBD) and carbonate ion abundance. Through experimentally testing with synthetic and real image data, ICR with ratio abundance normalization can enhance the linear relation of CRBD and abundance. We find this technique performs best for abundance retrieval. The lowest root mean square error is 0.0400 for synthetic data and the mean relative error is as low as 6.80% for real image data. Compared with five other algorithms, coupling normalized carbonate mineral abundance with ICR can improve the quantitative retrieval accuracy of carbonate ion. By using a hyperspectral library, we also present a way to retrieve abundance without ground samples. These results make the quantitative inversion of mineral abundance more reasonable by distinct or enhanced features and provide great potential for use to extend mineral information extraction in the absence of sample data, even for surveys of the Moon and Mars for mineral quantitative analysis.

Against the backdrop of the current carbon peaking and carbon neutrality policies, higher requirements have been put forward for the upgrading and construction of smart grids. Non-intrusive load monitoring (NILM) technology is a key technology for advanced measurement systems at the end of the power grid. It obtains detailed power information of the load, without the need for traditional hardware deployment. The key step to solve this problem is load decomposition and identification. This paper first utilized Long Short Term Memory-Denoising Autoencoder(LSTM-DAE) to decompose the mixed current signal on the household busbar and obtain the current signals of multiple independent loads that constituted the mixed current. Then, the obtained independent current signals were combined with voltage signals to generate multi-cycle colored Voltage-Current(VI) trajectories, which were color-coded according to the background. These colored VI trajectories with background colors formed a feature library. When the CNN network was used for load recognition, considering the influence of hyperparameters on recognition results, the BOA algorithm was used for optimization, and the optimized CNN network was employed for VI trajectory recognition. Finally, the proposed method was validated using the PLAID dataset. Experimental results showed that the proposed method exhibited better performance in load decomposition and identification.

The uncertainty in the secondary path of an Active Noise Control (ANC) headphone affects the waterbed effect and stability of the feedback system. This study focuses on the uncertainty of the secondary path when real users wear headphones, and proposes a new uncertainty constraint based on the measured results of the secondary path transfer function under different wearing conditions of dummy head and limited subjects. This constraint and a cascaded second-order infinite impulse response filter with fixed coefficients are used to formulate a control strategic function, which is optimized by the Improved Grey Wolf Optimizer (IGWO) algorithm to obtain the optimal controller with better noise reduction performance. The proposed method and simulation model are validated based on the experimental test results. The results demonstrate that the safety factor and waterbed suppressing factor contained in the proposed uncertainty constraint ensures more stable noise reduction and effective suppression of the waterbed effect for new subjects without a priori data.

Accurate and stable cost forecasting of substation projects is of great significance to ensure the economic construction and sustainable operation of power engineering projects. In this paper, a forecasting model based on the improved least squares support vector machine (ILSSVM) optimized by wolf pack algorithm(WPA) is proposed to improve the accuracy and stability of the cost forecasting of substation projects. Firstly, the optimal features are selected through the data inconsistency rate (DIR), which helps reduce redundant input vectors. Secondly, the wolf pack algorithm is used to optimize the parameters of the improved least square support vector machine. Lastly, the cost forecasting method of WPA-DIR-ILSSVM is established. In this paper, 88 substation projects in different regions from 2015 to 2017 are chosen to conduct the training tests to verify the validity of the model. The results indicate that the new hybrid WPA-DIR-ILSSVM model presents better accuracy, robustness and generality in cost forecasting of substation projects.

Alternative fertilizations are essential to minimize the deteriorating effects of chemical fertilizers on soil and water quality/health. Accordingly, the present work investigated the effects of combined organic-inorganic fertilization (COIF) on wheat and rice yields, soil nutrients, and soil Cd accumulation. Hence, seven different treatments were set up: control (CK); conventional fertilization (CF); optimized fertilization (OF); organic fertilizer replacing 25% (T1) and 50% (T2) of OF; and organic nitrogen (N) replacing 25% (M1) and 50% (M2) of OF-N. Overall, significant increases occurred in the yields of COIF crops. Compared with the CF, the highest wheat and rice yields happened in M1 treatment (approximately by18.5%) (P < 0.05). COIF slightly alleviated soil acidification, and improved the cation exchange capacity (CEC) of the study soils. Besides, COIF treatments significantly increased the contents of total phosphorus, total potassium, available phosphorus, and available potassium by 6.35 to 16.9 %, 3.17 to 10.9 %, 5.53 to 28.7 %, and 2.6 to 12 %, respectively (P <0.05). Nevertheless, negligible increases took place in Cd content of COIF soils compared with the CK. Altogether, our results concluded on 25% replacement of OF-N by organic N (M1) to effectively improve the fertility/ecological sustainability of the study soils.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

Detection of subsurface archaeological remains using a range of remote sensing methods, poses several challenges until today. Recent studies regarding the detection of archaeological proxies like those of cropmarks highlight the complexity of the phenomenon. In this work we present three different methods, and associated indices, for identifying stressed reflectance signatures indicating buried archaeological remains, based on a dataset of measured ground spectroradiometric reflectance. Several spectral profiles between the visible and near infrared part of the spectrum, were taken over a controlled environment in Cyprus during the 2011-2012 and are re-used in this study. The first two (spectral) methods are based on a suitable analysis of the spectral signatures in (1) the visible part of the spectrum, and in particular in the neighborhood of 570 nm, and (2) the red edge-near infrared part of the spectrum, in the neighborhood of 730 nm. Machine learning (decision trees) allows for the deduction of suitable wavelengths to focus on, in order to formulate the proposed indices and the associated classification criteria (decision boundaries) that can enhance the detection probability of stressed vegetation. Noise in the signal is taken into account by simulating reflectance signatures perturbed by white noise. Applying decision tree classification on the ensemble of simulations and basic statistical analysis we refine the formulation of the indices and criteria for the noisy signatures. The success rate of the proposed methods is over 90%. The third method rests on the estimation of vegetation/canopy reflectance parameters through inversion of the physical-based PROSAIL reflectance model and the associated classification through machine learning methods. The obtained results provide further insights into the formation of stress vegetation that occurred due to the presence of shallow buried archaeological remains, which are well aligned with physical-based models and existing empirical knowledge. To the best of the authors' knowledge, this is the first study demonstrating the usefulness of radiative transfer models such as PROSAIL for understanding the formation of cropmarks. Similar studies can support future research directions towards the development of regional remote sensing methods and algorithms if systematic observations are adequately dispersed in space and time.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

Gaze tracking of high-speed moving targets is a novel application mode for low Earth orbit microsatellites. In this mode, small satellites are equipped with high-resolution narrow-field-of-view video cameras for stable gaze-tracking imaging of high-speed moving targets. This paper proposes a high-precision attitude adaptive integral sliding mode control method with a feedforward compensation disturbance observer to enhance the capability of a microsatellite attitude control system for gaze tracking of high-speed moving targets. Specifically, first, we present the attitude control system model for microsatellites and the calculation method for the desired attitude of target tracking based on image feedback. Then, an adaptive integral sliding mode attitude control algorithm with a feedforward compensation disturbance observer, which meets the requirements of high-precision tracking control, is designed. The developed algorithm utilizes the disturbance observer to observe the friction torque of the flywheel and compensates for it through feedforward control. It also employs the adaptive integral sliding mode control algorithm to reduce the impact of uncertain disturbances, decrease the steady-state error of the system, and enhance the attitude control precision. Simulation experiments demonstrated that the designed disturbance observer can successfully observe the frictional disturbance torque of the flywheel. The attitude Euler angle control precision for high-speed moving target tracking reached 0.009°, and the angular velocity control precision reached 0.005°/s, validating the effectiveness of the proposed approach.

The knowledge of the precise anatomy and dimensions of the pulp chamber in the different teeth allows the odontologist to perform correct diagnosis, as well as treatment planning and moni-toring. The clinical practice has introduced cone-beam computed tomography (CB-CT) as a method to evaluate the morphology and dimensions of the pulp chamber. Nevertheless, micro-computed tomography (micro-CT) is regarded as the gold standard in approaching those topics. Here we have designed an algorithm that takes as input DICOM images from in vivo CB-CT of permanent molars to determine the accuracy CB-CT for evaluation of pulp chamber volume. The values were compared with those from in vivo CB-CT (rough and expert manipulated) and ex vivo micro-CT. The relative errors obtained with the volume calculated by the algorithm vs. the volume measured by micro-CT do not exceed 5.7%; also, no significant differences were found between algorithm volumes vs. manipulated CB-CT volumes while all volumes were different from those obtained with automatic CB-CT software. These data demonstrate that volume algorithm CB-CT based may be a reliable technique for evaluation of the pulp chamber volume in permanent molars and can be useful in the diagnosis of pulp diseases, as well as in the planning and monitoring of their treatments.

Count data analysis presents unique challenges due to its discrete nature, often exhibiting excessive zeros and overdispersion. To address these complexities, count models, such as Poisson regression and Negative Binomial regression, have been developed, enabling modeling and prediction of count-based phenomena. Additionally, it’s important to notice that zero inflation, a phenomenon commonly observed in count data, requires specialized techniques for robust analysis. This article provides an overview of count data and count models, explores zero inflation, introduces Likelihood Ratio Tests, and explains how the Vuong Test can be used as a model selection criteria. Furthermore, we created a Vuong Test implementation from scratch using the Python programming language. This implementation enhances the accessibility and applicability of the Vuong Test in real-world scenarios, providing a valuable contribution to the academic community, since Python didn’t have an implementation of this statistical test.

The extensive use of carrier-aided smoothing code (CSC) filter has led to reduce the noise level of raw code measurements in GNSS positioning and navigation applications. However, the existing CSC technique is sensitive to the changes of the integer ambiguity and then the smoothing proce-dure needs to be restarted in the presence of cycle-slips. As the Doppler shift is instantaneous ob-servation and immune to cycle-slips, Doppler-aided smoothing code (DSC) algorithm would be more promising in challenged environment. Based on the Hatch-filter, an optimal DSC approach is proposed with the principle of minimum variance. Meanwhile, to inhibit the effect of integral cumulative error of Doppler, a balance factor is adopted to adjust the contributions of raw code and DSC. The noise level of code observable is not only affected by thermal noise, but also limited by systematic bias. Satellite code bias (SCB) has been identified in the raw code observable on each frequency for each BDS-2 satellite. By minimizing the sum of absolute value of residuals, polyno-mial segment fitting algorithm as a function of elevation-angles is applied to establish the SCB cor-rection model based on epoch-differenced Multipath (MP) deviations. Finally, numerical experi-ments demonstrate the validity and efficiency of the refined DSC filter with SCB corrections on each available frequency for BDS-2 un-GEO satellites.

In the last decades, we have witnessed a spectacular information explosion over the Internet. Millions of users are consuming the Internet through various services, such as mobile applications, and online games. The service providers, at the back-end side, are supported by state-of-art infrastructures. Targeting on providing the services at scale, virtualization is one of the emerging technologies used in data centers and cloud environments to improve the quality of services. In this project, we aim to develop a dynamic resource management scheme based on virtual containers. It collects the runtime job progress from the running tasks and allocates the resources dynamically to improve the overall system performance.

There is a need for alternatives or complements to synthetic fertilizers to enhance agricultural sustainability. Applying organic amendments can play a significant role in this. Insect droppings show high potential, though studies evaluating their agronomic value have only recently begun to emerge. This study compared black soldier fly (Hermetia illucens) and mealworm (Tenebrio molitor) larvae frass with another organic amendment (Nutrimais) derived from composting forestry, agro-industrial, and domestic waste. The experiment also included ammonium nitrate at two rates [the same as the organic amendments, 50 kg ha–1 nitrogen (N) (FullR), and half that rate (HalfR)] and an unfertilized control. The study spanned two growth cycles of lettuce (Lactuca sativa L.) grown in pots, followed by unfertilized oats (Avena sativa L.) to assess the residual effects of the fertilizing treatments. Mealworm larvae frass mineralized rapidly, with an apparent N recovery of 37.4% over the two lettuce growth cycles, indicating its high availability to soil heterotrophic microorganisms. The average dry matter yield (DMY) of lettuce was the highest among all treatments (12.8 and 9.8 g plant–1 in the first and second lettuce cycles), even compared to the FullR treatment (12.2 and 7.8 g plant–1), though without significant differences. Although mealworm larvae frass exhibited a high mineralization rate, the DMY cannot be attributed solely to N supply, as plants in the FullR treatment showed better N nutritional status. Mealworm larvae frass provided strong evidence of a plant biostimulant effect, not explained by the variables measured in this study. Black soldier fly larvae frass exhibited typical behavior of a moderately reactive organic amendment, while Nutrimais showed low reactivity, with a near-neutral mineralization/immobilization balance. The results suggest mealworm larvae frass is recommended for early maturing vegetable crops, whereas Nutrimais appears more suitable for perennial crops with low short-term nutrient requirements.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

Low-cost particle sensors are now used worldwide to monitor outdoor air quality. However, they have only been in wide use for a few years. Are they reliable? Does their performance deteriorate over time? Are the algorithms for calculating PM2.5 provided by the Plantower company for PurpleAir monitors accurate? We investigate these questions using continuous measurements of four monitors (8 sensors) under normal conditions inside and outside a home for 1.5-3 years. A recently-developed algorithm (called ALT-CF3) is compared to the two existing Plantower algorithms. The Plantower CF1 algorithm was shown to lose 25-50% of all indoor data due to the questionable practice of assigning zero to all concentrations below a threshold. None of these data were lost using the ALT-CF3 algorithm. About 92% of all data showed precision better than 20% using the ALT-CF3 algorithm, but only about 45-75% of data achieved that level using the Plantower CF1 algorithm. The limits of detection (LODs) using the ALT-CF3 algorithm were mostly under 1 ug/m3, compared to about 3-10 ug/m3 using the Plantower CF1 algorithm. The percent of observations exceeding the LOD was 53-92% for the ALT-CF3 algorithm, but only 16-44% for the Plantower CF1 algorithm. For indoor air in homes, the Plantower algorithms are inappropriate.

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

Trichomonas vaginalis is an extracellular parasite protozoan that causes human trichomoniasis, a sexually transmitted infection (STI) that affects approximately 200 million people worldwide. The presence of T. vaginalis adhesion to inert substrates has been described in several reports. Still, very few studies on cluster formation and more detailed analyses of the contact regions between the membranes of the parasites in these aggregate formations have not been carried out. We analyzed the formation of parasite monolayers and clusters using high-resolution scanning electron microscopy, transmission electron microscopy, cytochemistry, TEM tomography, and dye injection. Here, we show the formation of a monolayer of tightly adherent cells, epithelium-like, when the parasites are in contact with an inert material. Based on this observation, we analyzed whether this monolayer behaves as an epithelium, analyzing cell junctions, cell communication, and ultrastructural aspects. We also analyzed the cluster formation and the morphological characteristics of parasite aggregation observed in the culture supernatant. We report that monolayer formation differs from cluster formation in many aspects. The monolayers form strong adhesion, whereas the clusters have fragile attachments. There is no fusion or passage of molecules between neighbor-attached cells; there is no need for different strains to form filopodia, cytonemes, and extracellular vesicles during cluster formation.