Search

This study aims to develop an AI-enhanced methodology for the expedited and accurate diagnosis of Multiple Sclerosis (MS), a chronic disease affecting the central nervous system leading to progressive impairment. Traditional diagnostic methods are slow and require substantial expertise, underscoring the need for innovative solutions. Our approach involves two phases: initially, extracting features from brain MRI images using first-order histograms, the gray level co-occurrence matrix, and local binary patterns. A unique feature selection technique combining the Sine Cosine Algorithm with the Sea-horse Optimizer is then employed to identify the most significant features. Utilizing the eHealth lab dataset, which includes images from 38 MS patients (mean age 34.1 ± 10.5 years; 17 males, 21 females) and matched healthy controls, our model achieved a remarkable 97.97% detection accuracy using the k-nearest neighbors classifier. Further validation on a larger dataset containing 262 MS cases (199 females, 63 males; mean age 31.26 ± 10.34 years) and 163 healthy individuals (109 females, 54 males; mean age 32.35 ± 10.30 years) demonstrated a 92.94% accuracy for FLAIR images and 91.25% for T2-weighted images with the Random Forest classifier, outperforming existing MS detection methods. These results highlight the potential of the proposed technique as a clinical decision-making tool for the early identification and management of MS., (© 2024. The Author(s).)

The optimization of open pit mine production scheduling is not only a multistage decision-making problem but also involves space-time dynamic action among multiple factors, which makes it difficult to optimize production capacity, mining sequence, mining life, and other factors simultaneously in optimizing design. In addition, the production capacity is disorderly expanded, the calculation scale is large, and the optimization time is long. Therefore, this article designs a mobile capacity search domain method to improve computing efficiency without omitting the optimal production capacity. At the same time, taking the maximum net present value as the objective function, an enumeration method is used to optimize the possible paths in different capacity domains and calculate the infrastructure investment and facility idle cost required to meet the maximum production capacity on each possible path to control the disorderly expansion and violent fluctuation of production capacity. The research shows that the open pit mine production scheduling optimization algorithm proposed in this article can not only realize the simultaneous optimization of the three elements of production capacity, mining sequence, and mining life but also improve the computing efficiency by 200 times. Furthermore, the production capacity fluctuation is less than 1.4%. The mining life of the mine is extended by 13 years, and the overall economic benefit is increased by 18%., (© 2023. The Author(s).)

To date, a large number of active learning algorithms have been proposed, but active learning methods for ordinal classification are under-researched. For ordinal classification, there is a total ordering among the data classes, and it is natural that the cost of misclassifying an instance as an adjacent class should be lower than that of misclassifying it as a more disparate class. However, existing active learning algorithms typically do not consider the above ordering information in query selection. Thus, most of them do not perform satisfactorily in ordinal classification. This study proposes an active learning method for ordinal classification by considering the ordering information among classes. We design an expected cost minimization criterion that imbues the ordering information. Meanwhile, we incorporate it with an uncertainty sampling criterion to impose the query instance more informative. Furthermore, we introduce a candidate subset selection method based on the k-means algorithm to reduce the computational overhead led by the calculation of expected cost. Extensive experiments on nine public ordinal classification datasets demonstrate that the proposed method outperforms several baseline methods., (© 2022. The Author(s).)

Interstate pipelines are the most efficient and feasible mean of transport for crude oil and gas within boarders. Assessing the risks of these pipelines is challenging despite the evolution of computational fuzzy inference systems (FIS). The computational intricacy increases with the dimensions of the system variables especially in the typical Takagi-Sugeno (T-S) fuzzy-model. Typically, the number of rules rises exponentially as the number of system variables increases and hence, it is unfeasible to specify the rules entirely for pipeline risk assessments. This work proposes the significance of indexing pipeline risk assessment approach that is integrated with subtractive clustering fuzzy logic to address the uncertainty of the real-world circumstances. Hypothetical data is used to setup the subtractive clustering fuzzy-model using the fundamental rules and scores of the pipeline risk assessment indexing method. An interstate crude-oil pipeline in Egypt is used as a case study to demonstrate the proposed approach., (© 2022. The Author(s).)

The development of visual tools for the timely identification of spatio-temporal clusters will assist in implementing control measures to prevent further damage. From January 2015 to June 2020, a total number of 1463 avian influenza outbreak farms were detected in Taiwan and further confirmed to be affected by highly pathogenic avian influenza subtype H5Nx. In this study, we adopted two common concepts of spatio-temporal clustering methods, the Knox test and scan statistics, with visual tools to explore the dynamic changes of clustering patterns. Since most (68.6%) of the outbreak farms were detected in 2015, only the data from 2015 was used in this study. The first two-stage algorithm performs the Knox test, which established a threshold of 7 days and identified 11 major clusters in the six counties of southwestern Taiwan, followed by the standard deviational ellipse (SDE) method implemented on each cluster to reveal the transmission direction. The second algorithm applies scan likelihood ratio statistics followed by AGC index to visualize the dynamic changes of the local aggregation pattern of disease clusters at the regional level. Compared to the one-stage aggregation approach, Knox-based and AGC mapping were more sensitive in small-scale spatio-temporal clustering., (© 2021. The Author(s).)

Multilevel thresholding image segmentation will subdivide an image into several meaningful regions or objects, which makes the image more informative and easier to analyze. Optimal multilevel thresholding approaches are extensively used for segmentation because they are easy to implement and offer low computational cost. Multilevel thresholding image segmentation is frequently performed using popular methods such as Otsu's between-class variance and Kapur's entropy. Numerous researchers have used evolutionary algorithms to identify the best multilevel thresholds based on the above approaches using histogram. This paper uses the Energy Curve (EC) based thresholding method instead of the histogram. Chaotic Bidirectional Smell Agent Optimization with Adaptive Control Strategy (ChBSAOACS), a powerful evolutionary algorithm, is developed and employed in this paper to create and execute an effective method for multilevel thresholding segmentation of breast thermogram images based on energy curves. The proposed algorithm was tested for viability on standard breast thermogram images. All experimental data are examined quantitatively and qualitatively to verify the suggested method's efficacy., (© 2024. The Author(s).)

The world has a higher count of death rates as a result of Alcohol consumption. Identification is possible because Alcoholic EEG waves have a certain behavior that is totally different compared to the non-alcoholic individual. The available approaches take longer to provide the feedback because they analyze the data manually. For this reason, in the present paper we propose a novel approach applied to detect alcoholic EEG signals automatically by using deep learning methods. Our strategy has advantages as far as fast detection is concerned; hence people can help immediately when there is a need. The potential for a significant decrease in deaths from alcohol poisoning and improvement to public health is presented by this advancement. In order to create clusters and classify the alcoholic EEG signals, this research uses a cascaded process. To begin with, an initial clustering and feature extraction is done by LASSO regression. After that, a variety of meta-heuristics algorithms like Particle Swarm Optimization (PSO), Binary Coding Harmony Search (BCHS) as well as Binary Dragonfly Algorithm (BDA) are employed for feature minimization. When this method is used, normal and alcoholic EEG signals may be differentiated using non-linear features. PSO, BCHS, and BDA features allow for estimation of statistical parameters through t-test, Friedman statistic test, Mann-Whitney U test, and Z-Score with corresponding p-values for alcoholic EEG signals. Lastly, classification is done by the use of support vector machines (SVM) (including linear, polynomial, and Gaussian kernels), random forests, artificial neural networks (ANN), enhanced artificial neural networks (EANN), and LSTM models. Results showed that LASSO regression with BDA-based EANN proposed classifier have a classification accuracy of 99.59%, indicating that our method is highly accurate at classifying alcoholic EEG signals., (© 2024. The Author(s).)

RNA modifications play an important role in actively controlling recently created formation in cellular regulation mechanisms, which link them to gene expression and protein. The RNA modifications have numerous alterations, presenting broad glimpses of RNA's operations and character. The modification process by the TET enzyme oxidation is the crucial change associated with cytosine hydroxymethylation. The effect of CR is an alteration in specific biochemical ways of the organism, such as gene expression and epigenetic alterations. Traditional laboratory systems that identify 5-hydroxymethylcytosine (5hmC) samples are expensive and time-consuming compared to other methods. To address this challenge, the paper proposed XGB5hmC, a machine learning algorithm based on a robust gradient boosting algorithm (XGBoost), with different residue based formulation methods to identify 5hmC samples. Their results were amalgamated, and six different frequency residue based encoding features were fused to form a hybrid vector in order to enhance model discrimination capabilities. In addition, the proposed model incorporates SHAP (Shapley Additive Explanations) based feature selection to demonstrate model interpretability by highlighting the high contributory features. Among the applied machine learning algorithms, the XGBoost ensemble model using the tenfold cross-validation test achieved improved results than existing state-of-the-art models. Our model reported an accuracy of 89.97%, sensitivity of 87.78%, specificity of 94.45%, F1-score of 0.8934%, and MCC of 0.8764%. This study highlights the potential to provide valuable insights for enhancing medical assessment and treatment protocols, representing a significant advancement in RNA modification analysis., (© 2024. The Author(s).)

This study improves the Logistic chaotic system and combines it with the hyperchaotic Chen system to create a dual chaotic system. The algorithm encrypts images in three stages. In the first stage, a plaintext-related key generation scheme is designed to generate the parameters and initial values of the dual chaotic system. In the second stage, the chaotic sequences generated by the dual chaotic system are used for dynamic DNA encoding and computation. In the third stage, the chaotic sequences generated by the improved Logistic chaotic system are used to perform row-column permutations, completing the scrambling. The security analysis of the encrypted images shows that the algorithm described in this paper is robust and secure, capable of resisting most known attacks. The algorithm is fast in encryption, provides high-quality image reconstruction, and is suitable for scenarios with high comprehensive performance and image quality requirements., (© 2024. The Author(s).)

Injection molding is a common plastic processing technique that allows melted plastic to be injected into a mold through pressure to form differently shaped plastic parts. In injection molding, in-mold electronics (IME) can include various circuit components, such as sensors, amplifiers, and filters. These components can be injected into the mold to form a whole within the melted plastic and can therefore be very easily integrated into the molded part. The brain-computer interface (BCI) is a direct connection pathway between a human or animal brain and an external device. Through BCIs, individuals can use their own brain signals to control these components, enabling more natural and intuitive interactions. In addition, brain-computer interfaces can also be used to assist in medical treatments, such as controlling prosthetic limbs or helping paralyzed patients regain mobility. Brain-computer interfaces can be realized in two ways: invasively and noninvasively, and in this paper, we adopt a noninvasive approach. First, a helmet model is designed according to head shape, and second, a printed circuit film is made to receive EEG signals and an IME injection mold for the helmet plastic parts. In the electronic film, conductive ink is printed to connect each component. However, improper parameterization during the injection molding process can lead to node displacements and residual stress changes in the molded part, which can damage the circuits in the electronic film and affect its performance. Therefore, in this paper, the use of the BCI molding process to ensure that the node displacement reaches the optimal value is studied. Second, the multistrategy differential evolutionary algorithm is used to optimize the injection molding parameters in the process of brain-computer interface formation. The relationship between the injection molding parameters and the actual target value is investigated through Latin hypercubic sampling, and the optimized parameters are compared with the target parameters to obtain the optimal parameter combination. Under the optimal parameters, the node displacement can be optimized from 0.585 to 0.027 mm, and the optimization rate can reach 95.38%. Ultimately, by detecting whether the voltage difference between the output inputs is within the permissible range, the reliability of the brain-computer interface after node displacement optimization can be evaluated., (© 2024. The Author(s).)

An automated speaker verification system uses the process of speech recognition to verify the identity of a user and block illicit access. Logical access attacks are efforts to obtain access to a system by tampering with its algorithms or data, or by circumventing security mechanisms. DeepFake attacks are a form of logical access threats that employs artificial intelligence to produce highly realistic audio clips of human voice, that may be used to circumvent vocal authentication systems. This paper presents a framework for the detection of Logical Access and DeepFake audio spoofings by integrating audio file components and time-frequency representation spectrograms into a lower-dimensional space using sequential prediction models. Bidirectional-LSTM trained on the bonafide class generates significant one-dimensional features for both classes. The feature set is then standardized to a fixed set using a novel Bags of Auditory Bites (BoAB) feature standardizing algorithm. The Extreme Learning Machine maps the feature space to predictions that differentiate between genuine and spoofed speeches. The framework is evaluated using the ASVspoof 2021 dataset, a comprehensive collection of audio recordings designed for evaluating the strength of speaker verification systems against spoofing attacks. It achieves favorable results on synthesized DeepFake attacks with an Equal Error Rate (EER) of 1.18% in the most optimal setting. Logical Access attacks were more challenging to detect at an EER of 12.22%. Compared to the state-of-the-arts in the ASVspoof2021 dataset, the proposed method notably improves EER for DeepFake attacks by an improvement rate of 95.16%., (© 2024. The Author(s).)

Independent component analysis (ICA) and dictionary learning (DL) are the most successful blind source separation (BSS) methods for functional magnetic resonance imaging (fMRI) data analysis. However, ICA to higher and DL to lower extent may suffer from performance degradation by the presence of anomalous observations in the recovered time courses (TCs) and high overlaps among spatial maps (SMs). This paper addressed both problems using a novel three-layered sparse DL (TLSDL) algorithm that incorporated prior information in the dictionary update process and recovered full-rank outlier-free TCs from highly corrupted measurements. The associated sequential DL model involved factorizing each subject's data into a multi-subject (MS) dictionary and MS sparse code while imposing a low-rank and a sparse matrix decomposition restriction on the dictionary matrix. It is derived by solving three layers of feature extraction and component estimation. The first and second layers captured brain regions with low and moderate spatial overlaps, respectively. The third layer that segregated regions with significant spatial overlaps solved a sequence of vector decomposition problems using the proximal alternating linearized minimization (PALM) method and solved a decomposition restriction using the alternating directions method (ALM). It learned outlier-free dynamics that integrate spatiotemporal diversities across brains and external information. It differs from existing DL methods owing to its unique optimization model, which incorporates prior knowledge, subject-wise/multi-subject representation matrices, and outlier handling. The TLSDL algorithm was compared with existing dictionary learning algorithms using experimental and synthetic fMRI datasets to verify its performance. Overall, the mean correlation value was found to be 26 % higher for the TLSDL than for the state-of-the-art subject-wise sequential DL (swsDL) technique., (© 2024. The Author(s).)

Due to the excessive growth of PM 2.5 in aerosol, the cases of lung cancer are increasing rapidly and are most severe among other types as the highest mortality rate. In most of the cases, lung cancer is detected with least symptoms at its later stage. Hence, clinical records may play a vital role to diagnose this disease at the correct stage for suitable medication to cure it. To detect lung cancer an accurate prediction method is needed which is significantly reliable. In the digital clinical record era with advancement in computing algorithms including machine learning techniques opens an opportunity to ease the process. Various machine learning algorithms may be applied over realistic clinical data but the predictive power is yet to be comprehended for accurate results. This paper envisages to compare twelve potential machine learning algorithms over clinical data with eleven symptoms of lung cancer along with two major habits of patients to predict a positive case accurately. The result has been found based on classification and heat map correlation. K-Nearest Neighbor Model and Bernoulli Naive Bayes Model are found most significant methods for early lung cancer prediction., (© 2024. The Author(s).)

The study of drug-target interaction plays an important role in the process of drug development. The subject of DTI forecasting has advanced significantly in the last several years, yielding numerous significant research findings and methodologies. Heterogeneous data sources provide richer information and comprehensive perspectives for drug-target interaction prediction, so many existing methods rely on heterogeneous networks, and graph embedding technology becomes an important technology to extract information from heterogeneous networks. These approaches, however, are less concerned with potential noisy information in heterogeneous networks and more focused on the extent of information extraction in those networks. Based on this, a potential DTI predictive network model called FBRWPC is proposed in this paper. It uses a fine-grained similarity selection program to first integrate similarity on similar networks and then a bidirectional random walk graph embedding learning method with restart to obtain an updated drug target interaction matrix. Through the use of similarity selection and fine-grained selection similarity integration, the framework can effectively filter out the noise present in heterogeneous networks and enhance the model's prediction performance. The experimental findings demonstrate that, even after being split up into four distinct types of data sets, FBRWPC can still retain great prediction performance, a sign of the model's resilience and good generalization., (© 2024. The Author(s).)

Lung images often have the characteristics of strong noise, uneven grayscale distribution, and complex pathological structures, which makes lung image segmentation a challenging task. To solve this problems, this paper proposes an initial lung mask extraction algorithm that combines threshold and gradient. The gradient used in the algorithm is obtained by the time series feature extraction method based on differential memory (TFDM), which is obtained by the grayscale threshold and image grayscale features. At the same time, we also proposed a lung contour repair algorithm based on the improved convex hull method to solve the contour loss caused by solid nodules and other lesions. Experimental results show that on the COVID-19 CT segmentation dataset, the advanced lung segmentation algorithm proposed in this article achieves better segmentation results and greatly improves the consistency and accuracy of lung segmentation. Our method can obtain more lung information, resulting in ideal segmentation effects with improved accuracy and robustness., (© 2024. The Author(s).)

Speech emotion recognition (SER) technology involves feature extraction and prediction models. However, recognition efficiency tends to decrease because of gender differences and the large number of extracted features. Consequently, this paper introduces a SER system based on gender. First, gender and emotion features are extracted from speech signals to develop gender recognition and emotion classification models. Second, according to gender differences, distinct emotion recognition models are established for male and female speakers. The gender of speakers is determined before executing the corresponding emotion model. Third, the accuracy of these emotion models is enhanced by utilizing an advanced differential evolution algorithm (ADE) to select optimal features. ADE incorporates new difference vectors, mutation operators, and position learning, which effectively balance global and local searches. A new position repairing method is proposed to address gender differences. Finally, experiments on four English datasets demonstrate that ADE is superior to comparison algorithms in recognition accuracy, recall, precision, F1-score, the number of used features and execution time. The findings highlight the significance of gender in refining emotion models, while mel-frequency cepstral coefficients are important factors in gender differences., (© 2024. The Author(s).)

Cardiac monitoring systems in Internet of Things (IoT) healthcare, reliant on limited battery and computational capacity, need efficient local processing and wireless transmission for comprehensive analysis. Due to the power-intensive wireless transmission in IoT devices, ECG signal compression is essential to minimize data transfer. This paper presents a real-time, low-complexity algorithm for compressing electrocardiogram (ECG) signals. The algorithm uses just nine arithmetic operations per ECG sample point, generating a hybrid Pulse Width Modulation (PWM) signal storable in a compact 4-bit resolution format. Despite its simplicity, it performs comparably to existing methods in terms of Percentage Root-Mean-Square Difference (PRD) and space-saving while significantly reducing complexity and maintaining robustness against signal noise. It achieves an average Bit Compression Ratio (BCR) of 4 and space savings of 90.4% for ECG signals in the MIT-BIH database, with a PRD of 0.33% and a Quality Score (QS) of 12. The reconstructed signal shows no adverse effects on QRS complex detection and heart rate variability, preserving both the signal amplitude and periodicity. This efficient method for transferring ECG data from wearable devices enables real-time cardiac activity monitoring with reduced data storage requirements. Its versatility suggests potential broader applications, extending to compression of various signal types beyond ECG., (© 2024. The Author(s).)

The heat distribution information of human lesions is of great value for disease analysis, diagnosis, and treatment. It is a typical inverse problem of heat conduction that deriving the distribution of internal heat sources from the temperature distribution on the body surface. This paper transforms such an inverse problem of bio-heat transfer into a direct one, thereby avoiding complex boundary conditions and regularization processes. To noninvasively reconstruct the internal heat source and its corresponding 3D temperature field in biological tissue, the adaptive simulated annealing (ASA) algorithm is used in the simulation module, where the position P(x, y, z) of point heat source in biological tissue and its corresponding temperature T are set as the optimization variables. Under a certain optimized sample, one can obtain the simulated temperature distributing on the surface of the module, then subtract the simulated temperature from the measured temperature of the same surface which was measured using a thermal infrared imager. If the sum of absolute values of the difference is smaller, it indicates that the current sample is closer to the true location and temperature of the heat source. When the values of optimization variables are determined, the corresponding 3D temperature field is also confirmed. The simulation results show the simulated position and temperature of the heat source are very approximate with those of the real experimental module. The method presented in this paper has enormous potential and promising prospects in clinical research and application, such as tumor hyperthermia, disease thermal diagnosis technology, etc., (© 2024. The Author(s).)

The timely identification of autism spectrum disorder (ASD) in children is imperative to prevent potential challenges as they grow. When sharing data related to autism for an accurate diagnosis, safeguarding its security and privacy is a paramount concern to fend off unauthorized access, modification, or theft during transmission. Researchers have devised diverse security and privacy models or frameworks, most of which often leverage proprietary algorithms or adapt existing ones to address data leakage. However, conventional anonymization methods, although effective in the sanitization process, proved inadequate for the restoration process. Furthermore, despite numerous scholarly contributions aimed at refining the restoration process, the accuracy of restoration remains notably deficient. Based on the problems identified above, this paper presents a novel approach to data restoration for sanitized sensitive autism datasets with improved performance. In the prior study, we constructed an optimal key for the sanitization process utilizing the proposed Enhanced Combined PSO-GWO framework. This key was implemented to conceal sensitive autism data in the database, thus avoiding information leakage. In this research, the same key was employed during the data restoration process to enhance the accuracy of the original data recovery. Therefore, the study enhanced the restoration process for ASD data's security and privacy by utilizing an optimal key produced via the Enhanced Combined PSO-GWO framework. When compared to existing meta-heuristic algorithms, the simulation results from the autism data restoration experiments demonstrated highly competitive accuracies with 99.90%, 99.60%, 99.50%, 99.25%, and 99.70%, respectively. Among the four types of datasets used, this method outperforms other existing methods on the 30-month autism children dataset, mostly., (© 2024. The Author(s).)

Brain tumors, often referred to as intracranial tumors, are abnormal tissue masses that arise from rapidly multiplying cells. During medical imaging, it is essential to separate brain tumors from healthy tissue. The goal of this paper is to improve the accuracy of separating tumorous regions from healthy tissues in medical imaging, specifically for brain tumors in MRI images which is difficult in the field of medical image analysis. In our research work, we propose IC-Net (Inverted-C), a novel semantic segmentation architecture that combines elements from various models to provide effective and precise results. The architecture includes Multi-Attention (MA) blocks, Feature Concatenation Networks (FCN), Attention-blocks which performs crucial tasks in improving brain tumor segmentation. MA-block aggregates multi-attention features to adapt to different tumor sizes and shapes. Attention-block is focusing on key regions, resulting in more effective segmentation in complex images. FCN-block captures diverse features, making the model more robust to various characteristics of brain tumor images. Our proposed architecture is used to accelerate the training process and also to address the challenges posed by the diverse nature of brain tumor images, ultimately leads to potentially improved segmentation performance. IC-Net significantly outperforms the typical U-Net architecture and other contemporary effective segmentation techniques. On the BraTS 2020 dataset, our IC-Net design obtained notable outcomes in Accuracy, Loss, Specificity, Sensitivity as 99.65, 0.0159, 99.44, 99.86 and DSC (core, whole, and enhancing tumors as 0.998717, 0.888930, 0.866183) respectively., (© 2024. The Author(s).)

This paper introduces a novel meta-heuristic algorithm named Rhinopithecus Swarm Optimization (RSO) to address optimization problems, particularly those involving high dimensions. The proposed algorithm is inspired by the social behaviors of different groups within the rhinopithecus swarm. RSO categorizes the swarm into mature, adolescent, and infancy individuals. Due to this division of labor, each category of individuals employs unique search methods, including vertical migration, concerted search, and mimicry. To evaluate the effectiveness of RSO, we conducted experiments using the CEC2017 test set and three constrained engineering problems. Each function in the test set was independently executed 36 times. Additionally, we used the Wilcoxon signed-rank test and the Friedman test to analyze the performance of RSO compared to eight well-known optimization algorithms: Dung Beetle Optimizer (DBO), Beluga Whale Optimization (BWO), Salp Swarm Algorithm (SSA), African Vultures Optimization Algorithm (AVOA), Whale Optimization Algorithm (WOA), Atomic Retrospective Learning Bare Bone Particle Swarm Optimization (ARBBPSO), Artificial Gorilla Troops Optimizer (GTO), and Harris Hawks Optimization (HHO). The results indicate that RSO exhibited outstanding performance on the CEC2017 test set for both 30 and 100 dimension. Moreover, RSO ranked first in both dimensions, surpassing the mean rank of the second-ranked algorithms by 7.69% and 42.85%, respectively. Across the three classical engineering design problems, RSO consistently achieves the best results. Overall, it can be concluded that RSO is particularly effective for solving high-dimensional optimization problems., (© 2024. The Author(s).)

Colorectal cancer (CRC) is a common digestive system tumor with high morbidity and mortality worldwide. At present, the use of computer-assisted colonoscopy technology to detect polyps is relatively mature, but it still faces some challenges, such as missed or false detection of polyps. Therefore, how to improve the detection rate of polyps more accurately is the key to colonoscopy. To solve this problem, this paper proposes an improved YOLOv5-based cancer polyp detection method for colorectal cancer. The method is designed with a new structure called P-C3 incorporated into the backbone and neck network of the model to enhance the expression of features. In addition, a contextual feature augmentation module was introduced to the bottom of the backbone network to increase the receptive field for multi-scale feature information and to focus on polyp features by coordinate attention mechanism. The experimental results show that compared with some traditional target detection algorithms, the model proposed in this paper has significant advantages for the detection accuracy of polyp, especially in the recall rate, which largely solves the problem of missed detection of polyps. This study will contribute to improve the polyp/adenoma detection rate of endoscopists in the process of colonoscopy, and also has important significance for the development of clinical work., (© 2024. The Author(s).)

Sarcasm is a perplexing form of human expression that presents distinct challenges in understanding. The problem of sarcasm detection has centered around analyzing individual utterances in isolation which may not provide a comprehensive understanding of the speaker's sarcastic intent. Our work addresses this problem by exploring and understanding the specific contextual cues that contribute to sarcasm. In this paper, we propose an enhanced approach for sarcasm detection using contextual features. Our methodology involves employing pre-trained transformer models, RoBERTa and DistilBERT, and fine-tuning them on two datasets: the News Headlines and the Mustard datasets. Incorporating contextual information, the proposed approach yielded the best performance, achieving an impressive F1 score of 99% on News Headlines dataset and 90% on Mustard dataset. Moreover, we experimented summarizing the context into a concise short sentence. This enhancement reduced training time by 35.5% of the original time. We further validated the model trained on the News headlines dataset against the Reddit dataset, which resulted in 49% F1 score without context data. However, with the inclusion of context data, the F1 score surged to 75%. Proposed approach enhances the understanding of sarcasm in different contextual settings, enabling more accurate sentiment analysis and better decision-making in various applications., (© 2024. The Author(s).)

The hippocampus is a critical component of the brain and is associated with many neurological disorders. It can be further subdivided into several subfields, and accurate segmentation of these subfields is of great significance for diagnosis and research. However, the structures of hippocampal subfields are irregular and have complex boundaries, and their voxel values are close to surrounding brain tissues, making the segmentation task highly challenging. Currently, many automatic segmentation tools exist for hippocampal subfield segmentation, but they suffer from high time costs and low segmentation accuracy. In this paper, we propose a new dual-branch segmentation network structure (DSnet) based on deep learning for hippocampal subfield segmentation. While traditional convolutional neural network-based methods are effective in capturing hierarchical structures, they struggle to establish long-term dependencies. The DSnet integrates the Transformer architecture and a hybrid attention mechanism, enhancing the network's global perceptual capabilities. Moreover, the dual-branch structure of DSnet leverages the segmentation results of the hippocampal region to facilitate the segmentation of its subfields. We validate the efficacy of our algorithm on the public Kulaga-Yoskovitz dataset. Experimental results indicate that our method is more effective in segmenting hippocampal subfields than conventional single-branch network structures. Compared to the classic 3D U-Net, our proposed DSnet improves the average Dice accuracy of hippocampal subfield segmentation by 0.57%., (© 2024. The Author(s).)

The modern development of healthcare is characterized by a set of large volumes of tabular data for monitoring and diagnosing the patient's condition. In addition, modern methods of data engineering allow the synthesizing of a large number of features from an image or signals, which are presented in tabular form. The possibility of high-precision and high-speed processing of such large volumes of medical data requires the use of artificial intelligence tools. A linear machine learning model cannot accurately analyze such data, and traditional bagging, boosting, or stacking ensembles typically require significant computing power and time to implement. In this paper, the authors proposed a method for the analysis of large sets of medical data, based on a designed linear ensemble method with a non-iterative learning algorithm. The basic node of the new ensemble is an extended-input SGTM neural-like structure, which provides high-speed data processing at each level of the ensemble. Increasing prediction accuracy is ensured by dividing the large dataset into parts, the analysis of which is carried out in each node of the ensemble structure and taking into account the output signal from the previous level of the ensemble as an additional attribute on the next one. Such a design of a new ensemble structure provides both a significant increase in the prediction accuracy for large sets of medical data analysis and a significant reduction in the duration of the training procedure. Experimental studies on a large medical dataset, as well as a comparison with existing machine learning methods, confirmed the high efficiency of using the developed ensemble structure when solving the prediction task., (© 2024. The Author(s).)

In recent years, the growth spurt of medical imaging data has led to the development of various machine learning algorithms for various healthcare applications. The MedMNISTv2 dataset, a comprehensive benchmark for 2D biomedical image classification, encompasses diverse medical imaging modalities such as Fundus Camera, Breast Ultrasound, Colon Pathology, Blood Cell Microscope etc. Highly accurate classifications performed on these datasets is crucial for identification of various diseases and determining the course of treatment. This research paper presents a comprehensive analysis of four subsets within the MedMNISTv2 dataset: BloodMNIST, BreastMNIST, PathMNIST and RetinaMNIST. Each of these selected datasets is of diverse data modalities and comes with various sample sizes, and have been selected to analyze the efficiency of the model against diverse data modalities. The study explores the idea of assessing the Vision Transformer Model's ability to capture intricate patterns and features crucial for these medical image classification and thereby transcend the benchmark metrics substantially. The methodology includes pre-processing the input images which is followed by training the ViT-base-patch16-224 model on the mentioned datasets. The performance of the model is assessed using key metrices and by comparing the classification accuracies achieved with the benchmark accuracies. With the assistance of ViT, the new benchmarks achieved for BloodMNIST, BreastMNIST, PathMNIST and RetinaMNIST are 97.90%, 90.38%, 94.62% and 57%, respectively. The study highlights the promise of Vision transformer models in medical image analysis, preparing the way for their adoption and further exploration in healthcare applications, aiming to enhance diagnostic accuracy and assist medical professionals in clinical decision-making., (© 2024. The Author(s).)

Effective management of dementia requires the timely detection of mild cognitive impairment (MCI). This paper introduces a multi-objective optimization approach for selecting EEG channels (and features) for the purpose of detecting MCI. Firstly, each EEG signal from each channel is decomposed into subbands using either variational mode decomposition (VMD) or discrete wavelet transform (DWT). A feature is then extracted from each subband using one of the following measures: standard deviation, interquartile range, band power, Teager energy, Katz's and Higuchi's fractal dimensions, Shannon entropy, sure entropy, or threshold entropy. Different machine learning techniques are used to classify the features of MCI cases from those of healthy controls. The classifier's performance is validated using leave-one-subject-out (LOSO) cross-validation (CV). The non-dominated sorting genetic algorithm (NSGA)-II is designed with the aim of minimizing the number of EEG channels (or features) and maximizing classification accuracy. The performance is evaluated using a publicly available online dataset containing EEGs from 19 channels recorded from 24 participants. The results demonstrate a significant improvement in performance when utilizing the NSGA-II algorithm. By selecting only a few appropriate EEG channels, the LOSO CV-based results show a significant improvement compared to using all 19 channels. Additionally, the outcomes indicate that accuracy can be further improved by selecting suitable features from different channels. For instance, by combining VMD and Teager energy, the SVM accuracy obtained using all channels is 74.24%. Interestingly, when only five channels are selected using NSGA-II, the accuracy increases to 91.56%. The accuracy is further improved to 95.28% when using only 8 features selected from 7 channels. This demonstrates that by choosing informative features or channels while excluding noisy or irrelevant information, the impact of noise is reduced, resulting in improved accuracy. These promising findings indicate that, with a limited number of channels and features, accurate diagnosis of MCI is achievable, which opens the door for its application in clinical practice., (© 2024. The Author(s).)

Neural networks are frequently employed to model species distribution through backpropagation methods, known as backpropagation neural networks (BPNN). However, the complex structure of BPNN introduces parameter settings challenges, such as the determination of connection weights, which can affect the accuracy of model simulation. In this paper, we integrated the Grey Wolf Optimizer (GWO) algorithm, renowned for its excellent global search capacity and rapid convergence, to enhance the performance of BPNN. Then we obtained a novel hybrid algorithm, the Grey Wolf Optimizer algorithm optimized backpropagation neural networks algorithm (GNNA), designed for predicting species' potential distribution. We also compared the GNNA with four prevalent species distribution models (SDMs), namely the generalized boosting model (GBM), generalized linear model (GLM), maximum entropy (MaxEnt), and random forest (RF). These models were evaluated using three evaluation metrics: the area under the receiver operating characteristic curve, Cohen's kappa, and the true skill statistic, across 23 varied species. Additionally, we examined the predictive accuracy concerning spatial distribution. The results showed that the predictive performance of GNNA was significantly improved compared to BPNN, was significantly better than that of GLM and GBM, and was even comparable to that of MaxEnt and RF in predicting species distributions with small sample sizes. Furthermore, the GNNA demonstrates exceptional powers in forecasting the potential non-native distribution of invasive plant species., (© 2024. The Author(s).)

In order to solve the difficult portability problem of traditional non-invasive sleeping posture recognition algorithms arising from the production cost and computational cost, this paper proposes a sleeping posture recognition model focusing on human body structural feature extraction and integration of feature space and algorithms based on a specific air-spring mattress structure, called SPR-DE (SPR-DE is the Sleep Posture Recognition-Data Ensemble acronym form). The model combines SMR (SMR stands for Principle of Spearman Maximal Relevance) with horizontal and vertical division based on the barometric pressure signals in the human body's backbone region to reconstruct the raw pressure data into strongly correlated non-image features of the sleep postures in different parts and directions and construct the feature set. Finally, the recognit-ion of the two sleep postures is accomplished using the AdaBoost-SVM integrated classifier. SPR-DE is compared with the base and integrated classifiers to verify its performance. The experimental results show that the amount of significant features helps the algorithm to classify different sleeping patterns more accurately, and the f1 score of the SPR-DE model determined by the comparison experiments is 0.998, and the accuracy can reach 99.9%. Compared with other models, the accuracy is improved by 2.9% ~ 7.7%, and the f1-score is improved by 0.029 ~ 0.076. Therefore, it is concluded that the SMR feature extraction strategy in the SPR-DE model and the AdaBoost-SVM can achieve high accuracy and strong robustness in the task of sleep posture recognition in a small area, low-density air-pressure mattress, taking into account the comfort of the mattress structural design and the sleep posture recognition, integrated with the mattress adaptive adjustment system., (© 2024. The Author(s).)

Recently, skin cancer is one of the spread and dangerous cancers around the world. Early detection of skin cancer can reduce mortality. Traditional methods for skin cancer detection are painful, time-consuming, expensive, and may cause the disease to spread out. Dermoscopy is used for noninvasive diagnosis of skin cancer. Artificial Intelligence (AI) plays a vital role in diseases' diagnosis especially in biomedical engineering field. The automated detection systems based on AI reduce the complications in the traditional methods and can improve skin cancer's diagnosis rate. In this paper, automated early detection system for skin cancer dermoscopic images using artificial intelligent is presented. Adaptive snake (AS) and region growing (RG) algorithms are used for automated segmentation and compared with each other. The results show that AS is accurate and efficient (accuracy = 96%) more than RG algorithm (accuracy = 90%). Artificial Neural networks (ANN) and support vector machine (SVM) algorithms are used for automated classification compared with each other. The proposed system with ANN algorithm shows high accuracy (94%), precision (96%), specificity (95.83%), sensitivity (recall) (92.30%), and F1-score (0.94). The proposed system is easy to use, time consuming, enables patients to make early detection for skin cancer and has high efficiency., (© 2024. The Author(s).)

In the field of population health research, understanding the similarities between geographical areas and quantifying their shared effects on health outcomes is crucial. In this paper, we synthesise a number of existing methods to create a new approach that specifically addresses this goal. The approach is called a Bayesian spatial Dirichlet process clustered heterogeneous regression model. This non-parametric framework allows for inference on the number of clusters and the clustering configurations, while simultaneously estimating the parameters for each cluster. We demonstrate the efficacy of the proposed algorithm using simulated data and further apply it to analyse influential factors affecting children's health development domains in Queensland. The study provides valuable insights into the contributions of regional similarities in education and demographics to health outcomes, aiding targeted interventions and policy design., (© 2024. The Author(s).)

Stitching of microscopic images is a technique used to combine multiple overlapping images (tiles) from biological samples with a limited field of view and high resolution to create a whole slide image. Image stitching involves two main steps: pairwise registration and global alignment. Most of the computational load and the accuracy of the stitching algorithm depend on the pairwise registration method. Therefore, choosing an efficient, accurate, robust, and fast pairwise registration method is crucial in the whole slide imaging technique. This paper presents a detailed comparative analysis of different pairwise registration techniques in terms of execution time and quality. These techniques included feature-based methods such as Harris, Shi-Thomasi, FAST, ORB, BRISK, SURF, SIFT, KAZE, MSER, and deep learning-based SuperPoint features. Additionally, region-based methods were analyzed, which were based on the normalized cross-correlation (NCC) and the combination of phase correlation and NCC. Investigations have been conducted on microscopy images from different modalities such as bright-field, phase-contrast, and fluorescence. The feature-based methods were highly robust to uneven illumination in tiles. Moreover, some features were found to be more accurate and faster than region-based methods, with the SURF features identified as the most effective technique. This study provides valuable insights into the selection of the most efficient and accurate pairwise registration method for creating whole slide images, which is essential for the advancement of computational pathology and biology., (© 2024. The Author(s).)

In this research paper, the intelligent learning abilities of the gray wolf optimization (GWO), multi-verse optimization (MVO), moth fly optimization, particle swarm optimization (PSO), and whale optimization algorithm (WOA) metaheuristic techniques and the response surface methodology (RSM) has been studied in the prediction of the mechanical properties of self-healing concrete. Bio-concrete technology stimulated by the concentration of bacteria has been utilized as a sustainable structural concrete for the future of the built environment. This is due to the recovery tendency of the concrete structures after noticeable structural failures. However, it requires a somewhat expensive exercise and technology to create the medium for the growth of the bacteria needed for this self-healing ability. The method of data gathering, analysis and intelligent prediction has been adopted to propose parametric relationships between the bacteria usage and the concrete performance in terms of strength and durability. This makes is cheaper to design self-healing concrete structures based on the optimized mathematical relationships and models proposed from this exercise. The performance of the models was tested by using the coefficient of determination (R 2 ), root mean squared errors, mean absolute errors, mean squared errors, variance accounted for and the coefficient of error. At the end of the prediction protocol and model performance evaluation, it was found that the classified metaheuristic techniques outclassed the RSM due their ability to mimic human and animal genetics of mutation. Furthermore, it can be finally remarked that the GWO outclassed the other methods in predicting the concrete slump (Sl) with R 2 of 0.998 and 0.989 for the train and test, respectively, the PSO outclassed the rest in predicting the flexural strength with R 2 of 0.989 and 0.937 for train and test, respectively and the MVO outclassed the others in predicting the compressive strength with R 2 of 0.998 and 0.958 for train and test, respectively., (© 2024. The Author(s).)

Data quality is of crucial importance in the field of automated or digitally assisted assembly. This paper presents a comprehensive data set of triangle meshes representing electrical and electronic components obtained by scraping Computer Aided Design (CAD) models from the Internet. Consisting of a total of 234 triangle meshes with labelled vertices, this data set was specifically created for segmentation tasks. Its versatility for multimodal tasks is underscored by the presence of various labels, including vertex labels, categories, and subcategories. This paper presents the data set and provides a thorough statistical analysis, including measures of shape, size, distribution, and inter-rater reliability. In addition, the paper suggests several approaches for using the data set, considering its multimodal characteristics. The data set and related findings presented in this paper are intended to encourage further research and advancement in the field of manufacturing automation, specifically spatial assembly., (© 2024. The Author(s).)

Aiming at the problems of identifying storage pest tobacco pest beetles from images that have few object pixels and considerable image noise, and therefore suffer from lack of information and identifiable features, this paper proposes an automatic monitoring method of tobacco beetle based on Multi-scale Global residual Feature Pyramid Network and Dual-path Deformable Attention (MGrFPN-DDrGAM). Firstly, a Multi-scale Global residual Feature Pyramid Network (MGrFPN) is constructed to obtain rich high-level semantic features and more complete information on low-level features to reduce missed detection; Then, a Dual-path Deformable receptive field Guided Attention Module (DDrGAM) is designed to establish long-range channel dependence, guide the effective fusion of features and improve the localization accuracy of tobacco beetles by fitting the spatial geometric deformation features of and capturing the spatial information of feature maps with different scales to enrich the feature information in the channel and spatial. Finally, to simulate a real scene, a multi-scene tobacco beetle dataset is created. The dataset includes 28,080 images and manually labeled tobacco beetle objects. The experimental results show that under the framework of the Faster R-CNN algorithm, the detection precision and recall rate of this method can reach 91.4% and 98.4% when the intersection ratio (IoU) is 0.5. Compared with Faster R-CNN and FPN, when the intersection ratio (IoU) is 0.7, the detection precision is improved by 32.9% and 6.9%, respectively. The proposed method is superior to the current mainstream methods., (© 2024. The Author(s).)

Canine personality and behavioural characteristics have a significant influence on relationships between domestic dogs and humans as well as determining the suitability of dogs for specific working roles. As a result, many researchers have attempted to develop reliable personality assessment tools for dogs. Most previous work has analysed dogs' behavioural patterns collected via questionnaires using traditional statistical analytic approaches. Artificial Intelligence has been widely and successfully used for predicting human personality types. However, similar approaches have not been applied to data on canine personality. In this research, machine learning techniques were applied to the classification of canine personality types using behavioural data derived from the C-BARQ project. As the dataset was not labelled, in the first step, an unsupervised learning approach was adopted and K-Means algorithm was used to perform clustering and labelling of the data. Five distinct categories of dogs emerged from the K-Means clustering analysis of behavioural data, corresponding to five different personality types. Feature importance analysis was then conducted to identify the relative importance of each behavioural variable's contribution to each cluster and descriptive labels were generated for each of the personality traits based on these associations. The five personality types identified in this paper were labelled: "Excitable/Hyperattached", "Anxious/Fearful", "Aloof/Predatory", "Reactive/Assertive", and "Calm/Agreeable". Four machine learning models including Support Vector Machine (SVM), K-Nearest Neighbour (KNN), Naïve Bayes, and Decision Tree were implemented to predict the personality traits of dogs based on the labelled data. The performance of the models was evaluated using fivefold cross validation method and the results demonstrated that the Decision Tree model provided the best performance with a substantial accuracy of 99%. The novel AI-based methodology in this research may be useful in the future to enhance the selection and training of dogs for specific working and non-working roles., (© 2024. The Author(s).)

The paper focuses on the correction of Illumina WGS sequencing reads. We provide an extensive evaluation of the existing correctors. To this end, we measure an impact of the correction on variant calling (VC) as well as de novo assembly. It shows, that in selected cases read correction improves the VC results quality. We also examine the algorithms behaviour in a processing of Illumina NovaSeq reads, with different reads quality characteristics than in older sequencers. We show that most of the algorithms are ready to cope with such reads. Finally, we introduce a new version of RECKONER, our read corrector, by optimizing it and equipping with a new correction strategy. Currently, RECKONER allows to correct high-coverage human reads in less than 2.5 h, is able to cope with two types of reads errors: indels and substitutions, and utilizes a new, based on a two lengths of oligomers, correction verification technique., (© 2024. The Author(s).)

This paper presents a novel semi-automatic method for lung segmentation in thoracic CT datasets. The fully three-dimensional algorithm is based on a level set representation of an active surface and integrates texture features to improve its robustness. The method's performance is enhanced by the graphics processing unit (GPU) acceleration. The segmentation process starts with a manual initialisation of 2D contours on a few representative slices of the analysed volume. Next, the starting regions for the active surface are generated according to the probability maps of texture features. The active surface is then evolved to give the final segmentation result. The recent implementation employs features based on grey-level co-occurrence matrices and Gabor filters. The algorithm was evaluated on real medical imaging data from the LCTCS 2017 challenge. The results were also compared with the outcomes of other segmentation methods. The proposed approach provided high segmentation accuracy while offering very competitive performance., (© 2024. The Author(s).)

In the field of data analysis, it is often faced with a large number of missing values, especially in metabolomics data, this problem is more prominent. Data imputation is a common method to deal with missing metabolomics data, while traditional data imputation methods usually ignore the differences in missing types, and thus the results of data imputation are not satisfactory. In order to discriminate the missing types of metabolomics data, a missing data classification model (PX-MDC) based on particle swarm algorithm and XGBoost is proposed in this paper. First, the missing values in a given missing data set are obtained by panning the missing values to obtain the largest subset of complete data, and then the particle swarm algorithm is used to search for the concentration threshold of missing data and the proportion of low concentration deletions as a percentage of overall deletions. Next, the missing data are simulated based on the search results. Finally, the training data are trained using the XGBoost model using the feature set proposed in this paper in order to build a classifier for the missing data. The experimental results show that the particle swarm algorithm is able to match the traditional enumeration method in terms of accuracy and significantly reduce the search time in concentration threshold search. Compared with the current mainstream methods, the PX-MDC model designed in this paper exhibits higher accuracy and is able to distinguish different deletion types for the same metabolite. This study is expected to make an important breakthrough in metabolomics data imputation and provide strong support for research in related fields., (© 2024. The Author(s).)

This paper proposes a multi-task deep learning model for determining drug combination synergistic by simultaneously output synergy scores and synergy class labels. Initially, the two drugs are represented using a Simplified Molecular-Input Line-Entry (SMILE) system. Chemical structural features of the drugs are extracted from the SMILE using the RedKit package. Additionally, an improved Multi-view representation is proposed to extract graph-based drug features. Furthermore, the cancer cell line is represented by gene expression. Then, a three fully connected layers are learned to extract cancer cell line features. To investigate the impact of drug interactions on cell lines, the drug interaction features are extracted from a pretrained drugs interaction network and fed into an attention mechanism along with the cancer cell line features, resulting in the output of affected cancer cell line features. Subsequently, the drug and cell line features are concatenated and fed into an attention mechanism, which produces a two-feature representation for the two predicted tasks. The relationship between the two tasks is learned using the cross-stitch algorithm. Finally, each task feature is inputted into a fully connected subnetwork to predict the synergy score and synergy label. The proposed model 'MutliSyn' is evaluated using the O'Neil cancer dataset, comprising 38 unique drugs combined to form 22,737 drug combination pairs, tested on 39 cancer cell lines. For the synergy score, the model achieves a mean square error (MSE) of 219.14, a root mean square error (RMSE) of 14.75, and a Pearson score of 0.76. Regarding the synergy class label, the model achieves an area under the ROC curve (ROC-AUC) of 0.95, an area under the precision-recall curve (PR-AUC) of 0.85, precision of 0.93, kappa of 0.61, and accuracy of 0.90., (© 2023. The Author(s).)

A method of determining the optimal kernel size for filtering noise in vortex dominated flow-fields, as found in the cardiac chambers is presented in this paper. Using synthetic flow fields generated using harmonic functions and perturbed using Gaussian noises of different amplitudes and spreads, the effect of kernel size on noise removal using the Median filter is tested systematically. It is shown that there exists an optimal kernel size at which the Median filter works best. The size of the optimal kernel is shown to be related to the vortex size. When applied to MRI generated cardiac flow-fields, the approach is seen to reveal underlying vortex patterns thereby aiding as an effective tool in the diagnosis and prognosis of cardiac diseases based on vortices as clinical biomarkers. The behavior of the restored cardiac flow fields which are filtered with the optimal kernel size and also with some values preceding and succeeding it are similar to that observed in studies with synthetic flow fields. This confirms that the optimal size of the kernel is related to the cardiac vortex size as is observed in the case of synthetic flow fields., (© 2023. The Author(s).)

In this paper, with motivation from the No Free Lunch theorem, a new human-based metaheuristic algorithm named Preschool Education Optimization Algorithm (PEOA) is introduced for solving optimization problems. Human activities in the preschool education process are the fundamental inspiration in the design of PEOA. Hence, PEOA is mathematically modeled in three phases: (i) the gradual growth of the preschool teacher's educational influence, (ii) individual knowledge development guided by the teacher, and (iii) individual increase of knowledge and self-awareness. The PEOA's performance in optimization is evaluated using fifty-two standard benchmark functions encompassing unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, as well as the CEC 2017 test suite. The optimization results show that PEOA has a high ability in exploration-exploitation and can balance them during the search process. To provide a comprehensive analysis, the performance of PEOA is compared against ten well-known metaheuristic algorithms. The simulation results show that the proposed PEOA approach performs better than competing algorithms by providing effective solutions for the benchmark functions and overall ranking as the first-best optimizer. Presenting a statistical analysis of the Wilcoxon signed-rank test shows that PEOA has significant statistical superiority in competition with compared algorithms. Furthermore, the implementation of PEOA in solving twenty-two optimization problems from the CEC 2011 test suite and four engineering design problems illustrates its efficacy in real-world optimization applications., (© 2023. The Author(s).)

For the existing control center layout methods do not have targeted measures to implement human factors requirements, this paper puts forward a specific human factors design method for metro control center layout. This method covers the overall process of ergonomic standards and actual engineering requirements in personal space determination, overall location design, and personnel post layout. It introduces discrete personnel simulation to assist in physical control center layout design for the controllers' safety. To make the posts between the unified lines and the connections between the lines more reasonable, an improved genetic algorithm is used to solve the Systematic Layout Planning. This design flow and algorithm can be quickly adapted according to the project's actual needs and the application of human factors guidelines. This method is also suitable for the layout planning and design of similar large spaces, large numbers of people, and complex associated control centers., (© 2023. The Author(s).)

In recent times, there is an increasing interest in employing technology to process natural language with the aim of providing information that can benefit society. Language identification refers to the process of detecting which speech a speaker appears to be using. This paper presents an audio-based Ethio-semitic language identification system using Recurrent Neural Network. Identifying the features that can accurately differentiate between various languages is a difficult task because of the very high similarity between characters of each language. Recurrent Neural Network (RNN) was used in this paper in relation to the Mel-frequency cepstral coefficients (MFCCs) features to bring out the key features which helps provide good results. The primary goal of this research is to find the best model for the identification of Ethio-semitic languages such as Amharic, Geez, Guragigna, and Tigrigna. The models were tested using an 8-h collection of audio recording. Experiments were carried out using our unique dataset with an extended version of RNN, Long Short Term Memory (LSTM) and Bidirectional Long Short Term Memory (BLSTM), for 5 and 10 s, respectively. According to the results, Bidirectional Long Short Term Memory (BLSTM) with a 5 s delay outperformed Long Short Term Memory (LSTM). The BLSTM model achieved average results of 98.1, 92.9, and 89.9% for training, validation, and testing accuracy, respectively. As a result, we can infer that the best performing method for the selected Ethio-Semitic language dataset was the BLSTM algorithm with MFCCs feature running for 5 s., (© 2023. The Author(s).)

Crop disease detection and management is critical to improving productivity, reducing costs, and promoting environmentally friendly crop treatment methods. Modern technologies, such as data mining and machine learning algorithms, have been used to develop automated crop disease detection systems. However, centralized approach to data collection and model training induces challenges in terms of data privacy, availability, and transfer costs. To address these challenges, federated learning appears to be a promising solution. In this paper, we explored the application of federated learning for crop disease classification using image analysis. We developed and studied convolutional neural network (CNN) models and those based on attention mechanisms, in this case vision transformers (ViT), using federated learning, leveraging an open access image dataset from the "PlantVillage" platform. Experiments conducted concluded that the performance of models trained by federated learning is influenced by the number of learners involved, the number of communication rounds, the number of local iterations and the quality of the data. With the objective of highlighting the potential of federated learning in crop disease classification, among the CNN models tested, ResNet50 performed better in several experiments than the other models, and proved to be an optimal choice, but also the most suitable for a federated learning scenario. The ViT_B16 and ViT_B32 Vision Transformers require more computational time, making them less suitable in a federated learning scenario, where computational time and communication costs are key parameters. The paper provides a state-of-the-art analysis, presents our methodology and experimental results, and concludes with ideas and future directions for our research on using federated learning in the context of crop disease classification., (© 2023. The Author(s).)

Database peptide search is the primary computational technique for identifying peptides from the mass spectrometry (MS) data. Graphical Processing Units (GPU) computing is now ubiquitous in the current-generation of high-performance computing (HPC) systems, yet its application in the database peptide search domain remains limited. Part of the reason is the use of sub-optimal algorithms in the existing GPU-accelerated methods resulting in significantly inefficient hardware utilization. In this paper, we design and implement a new-age CPU-GPU HPC framework, called GiCOPS, for efficient and complete GPU-acceleration of the modern database peptide search algorithms on supercomputers. Our experimentation shows that the GiCOPS exhibits between 1.2 to 5[Formula: see text] speed improvement over its CPU-only predecessor, HiCOPS, and over 10[Formula: see text] improvement over several existing GPU-based database search algorithms for sufficiently large experiment sizes. We further assess and optimize the performance of our framework using the Roofline Model and report near-optimal results for several metrics including computations per second, occupancy rate, memory workload, branch efficiency and shared memory performance. Finally, the CPU-GPU methods and optimizations proposed in our work for complex integer- and memory-bounded algorithmic pipelines can also be extended to accelerate the existing and future peptide identification algorithms. GiCOPS is now integrated with our umbrella HPC framework HiCOPS and is available at: https://github.com/pcdslab/gicops ., (© 2023. The Author(s).)

Security threats posed by Ponzi schemes present a considerably higher risk compared to many other online crimes. These fraudulent online businesses, including Ponzi schemes, have witnessed rapid growth and emerged as major threats in societies like Nigeria, particularly due to the high poverty rate. Many individuals have fallen victim to these scams, resulting in significant financial losses. Despite efforts to detect Ponzi schemes using various methods, including machine learning (ML), current techniques still face challenges, such as deficient datasets, reliance on transaction records, and limited accuracy. To address the negative impact of Ponzi schemes, this paper proposes a novel approach focusing on detecting Ponzi schemes on Ethereum using ML algorithms like random forest (RF), neural network (NN), and K-nearest neighbor (KNN). Over 20,000 datasets related to Ethereum transaction networks were gathered from Kaggle and preprocessed for training the ML models. After evaluating and comparing the three models, RF demonstrated the best performance with an accuracy of 0.94, a class-score of 0.8833, and an overall-score of 0.96667. Comparative evaluations with previous models indicate that our model achieves high accuracy. Moreover, this innovative work successfully detects key fraud features within the Ponzi scheme dataset, reducing the number of features from 70 to only 10 while maintaining a high level of accuracy. The main strength of this proposed method lies in its ability to detect clever Ponzi schemes from their inception, offering valuable insights to combat these financial threats effectively., (© 2023. The Author(s).)

Artificial neural networks show promising performance in detecting correlations within data that are associated with specific outcomes. However, the black-box nature of such models can hinder the knowledge advancement in research fields by obscuring the decision process and preventing scientist to fully conceptualize predicted outcomes. Furthermore, domain experts like healthcare providers need explainable predictions to assess whether a predicted outcome can be trusted in high stakes scenarios and to help them integrating a model into their own routine. Therefore, interpretable models play a crucial role for the incorporation of machine learning into high stakes scenarios like healthcare. In this paper we introduce Convolutional Motif Kernel Networks, a neural network architecture that involves learning a feature representation within a subspace of the reproducing kernel Hilbert space of the position-aware motif kernel function. The resulting model enables to directly interpret and evaluate prediction outcomes by providing a biologically and medically meaningful explanation without the need for additional post-hoc analysis. We show that our model is able to robustly learn on small datasets and reaches state-of-the-art performance on relevant healthcare prediction tasks. Our proposed method can be utilized on DNA and protein sequences. Furthermore, we show that the proposed method learns biologically meaningful concepts directly from data using an end-to-end learning scheme., (© 2023. Springer Nature Limited.)

Single-cell RNA sequencing data is among the most interesting and impactful data of today and the sizes of the available datasets are increasing drastically. There is a substantial need for learning from large datasets, causing nontrivial challenges, especially in hardware. Loading even a single dataset into the memory of an ordinary, off-the-shelf computer can be infeasible, and using computing servers might not always be an option. This paper presents continual learning as a solution to such hardware bottlenecks. The findings of cell-type classification demonstrate that XGBoost and Catboost algorithms, when implemented in a continual learning framework, exhibit superior performance compared to the best-performing static classifier. We achieved up to 10% higher median F1 scores than the state-of-the-art on the most challenging datasets. On the other hand, these algorithms can suffer from variations in data characteristics across diverse datasets, pointing out indications of the catastrophic forgetting problem., (© 2023. Springer Nature Limited.)

In machine learning, an informative dataset is crucial for accurate predictions. However, high dimensional data often contains irrelevant features, outliers, and noise, which can negatively impact model performance and consume computational resources. To tackle this challenge, the Bird's Eye View (BEV) feature selection technique is introduced. This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. The proposed strategy in this paper leads to improved classification performance and a reduced number of features compared to conventional methods, as demonstrated by outperforming state-of-the-art feature selection techniques across multiple benchmark datasets., (© 2023. Springer Nature Limited.)