Reviewerly/exHarmony huggingface dataset:
Hybrid IACO-A*-PSO optimization algorithm for solving multiobjective path planning problem of mobile robot in radioactive environment

Mobile robots are receiving significant interest in the nuclear energy industry because of their potential intelligence features and efficient operation. Mobile robot path planning (PP) in a radioactive environment can be considered as finding a collision-free path constrained by the path length, cumulative radiation dose rate and energy consumption. To solve this multiobjective path planning (MOPP) problem, we propose a hybrid algorithm based on an improved ant colony optimization (IACO), the A* algorithm and particle swarm optimization (IACO-A*-PSO). First, a modified A* algorithm is presented to find a suboptimal path, which is used to improve the initial ACO pheromone. Next, an improvement of the adaptive heuristic function and pheromone update rule based on an elitist system is proposed to balance the global search ability and convergence speed of the ant colony algorithm. Finally, PSO is used to obtain the optimal ACO control parameters and multiobjective weight coefficients. To evaluate the efficiency of the proposed algorithm, a comparative study has been performed between the proposed IACO-A*-PSO, the A*, ACO, and IACO algorithms and a genetic algorithm (GA) in four radioactive indoor environments with different sizes, radioactive sources and obstacles. The simulation results show that the proposed algorithm has the best comprehensive performance and stronger adaptability to different environments than the A*, ACO, IACO and GA algorithms in terms of the path length, cumulative radiation dose, energy consumption, runtime and success rate simultaneously. This demonstrates that the proposed algorithm is an effective method for solving the MOPP problem of mobile robot in radioactive environment, which is beneficial for improving the safety and reliability of robots in nuclear energy.
Has machine learning over-promised in healthcare?

Adoption of artificial intelligence (AI) by the medical community has long been anticipated, endorsed by a stream of machine learning literature showcasing AI systems that yield extraordinary performance. However, many of these systems are likely over-promising and will under-deliver in practice. One key reason is the community's failure to acknowledge and address the presence of inflationary effects in the data. These simultaneously inflate evaluation performance and prevent a model from learning the underlying task, thus severely misrepresenting how that model would perform in the real world. This paper investigated the impact of these inflationary effects on healthcare tasks, as well as how these effects can be addressed. Specifically, we defined three inflationary effects that occur in medical data sets and allow models to easily reach small training losses and prevent skillful learning. We investigated two data sets of sustained vowel phonation from participants with and without Parkinson's disease, and revealed that published models which have achieved high classification performances on these were artificially enhanced due to the inflationary effects. Our experiments showed that removing each inflationary effect corresponded with a decrease in classification accuracy, and that removing all inflationary effects reduced the evaluated performance by up to 30%. Additionally, the performance on a more realistic test set increased, suggesting that the removal of these inflationary effects enabled the model to better learn the underlying task and generalize. Source code is available at https://github.com/Wenbo-G/pd-phonation-analysis under the MIT license.
AMFSA: Adaptive fuzzy neighborhood-based multilabel feature selection with ant colony optimization

For multilabel classification, the correlations among labels of samples are always ignored by existing feature selection models, which results in inefficient predictions. In addition, the neighborhood radius of samples needs to be manually set, which requires much computation. To effectively conquer these limitations, this article proposes a novel adaptive fuzzy neighborhood-based multilabel feature subset selection approach with ant colony optimization (ACO) for multilabel classification. First, the feature cosine similarity and the label Jaccard similarity between samples are constructed from the feature space and label space. By combining the two abovementioned similarities, the entire similarity between samples is proposed to effectively reflect the similarity between samples in the overall space, and a dynamic adjustment coefficient is developed to control the importance of label similarity. The discriminant relation is proposed to judge the homogeneous or heterogeneous relationship between samples. Second, to address the problem that the fuzzy neighborhood radius is usually chosen artificially, we calculate the average distance between the target sample and all heterogeneous or homogeneous samples. The difference between these two average distances can be used as the adaptive fuzzy neighborhood radius of the target samples. Then, novel adaptive fuzzy neighborhood rough sets are presented, and the fuzzy neighborhood dependency degree is studied to evaluate this distinguishing ability between features and samples under a fuzzy background. Furthermore, neighborhood entropy measures and adaptive fuzzy neighborhood mutual information are investigated. Finally, by integrating fuzzy neighborhood mutual information and dependency degree into the state transition rules of the ACO, a novel ACO-based feature selection algorithm is constructed to achieve this optimal feature set for multilabel classification. Experiments applied to 15 multilabel datasets prove that our developed algorithm is effective in achieving an excellent feature subset with great classification efficiency.
Local and global knowledge distillation with direction-enhanced contrastive learning for single-image deraining

Single image deraining (SID) is a challenging problem since the rainy images contain a variety of backgrounds with rain streaks of different directions and densities. Though previous convolutional neural network based methods for SID have shown promising performance, their characterization ability is limited as they suffer from the local receptive fields and ignore long-range dependencies. Some methods try to solve it by designing complicated network architectures, which yields high computational costs. To address these problems, we consider both local and global features in the proposed recurrent attention-distilling network (RADN). Specifically, in the shallow layer, the local contextual information is extracted by a local extract module with channel and pixel attention blocks to focus on features of important channels and spatial locations. In the deep layer, the global intrinsic features are characterized by a refined transformer block with a self-attention (SA) mechanism to capture the long-range dependencies. Meanwhile, a teacher network is pre-trained by a rain-to-rain mapping to supervise the proposed RADN learning the rain intrinsic features quicker with lightweight. Moreover, we propose a direction-enhanced contrastive learning (DeCL) strategy which incorporates the potential rainy images into negative contrastive pairs to improve the model generalization ability. Extensive experiments show that the proposed method can achieve a competitive performance to state-of-the-art methods on both real and synthetic datasets. The source code is available at https://github.com/Meky-hqd/RADN.
GPU-Free Specific Emitter Identification Using Signal Feature Embedded Broad Learning

Emerging wireless networks may suffer severe security threats due to the ubiquitous access of massive wireless devices. Specific emitter identification (SEI) is considered as one of the important techniques to protect wireless networks, which aims to identifying legal or illegal devices through the radio frequency (RF) fingerprints contained in RF signals. Existing SEI methods are implemented with either traditional machine learning or deep learning. The former relies on manual feature extraction which is usually inefficient, while the latter relies on the powerful graphics processing unit (GPU) computing power but with limited applications and high cost. To solve these problems, in this article, we propose a GPU-free SEI method using a signal feature embedded broad learning network (SFEBLN), for efficient emitter identification based on a single-layer forward propagation network on the central processing unit (CPU) platform. With this method, the original RF data is first preprocessed through external signal processing nodes, and then processed to generate mapped feature nodes and enhancement nodes by nonlinear transformation. Next, we design the internal signal processing nodes to extract effective features from the processed RF signals. The final input layer consists of mapped feature nodes, enhancement nodes, and internal signal processing nodes. Then, the network weight parameters are obtained by solving the pseudo inverse problem. Experiments are conducted over the CPU platform and the results show that our proposed SEI method using SFEBLN achieves a superior identification performance and robustness under various scenarios.
Visconde: Multi-document QA with GPT-3 and Neural Reranking

This paper proposes a question-answering system that can answer questions whose supporting evidence is spread over multiple (potentially long) documents. The system, called Visconde, uses a three-step pipeline to perform the task: decompose, retrieve, and aggregate. The first step decomposes the question into simpler questions using a few-shot large language model (LLM). Then, a state-of-the-art search engine is used to retrieve candidate passages from a large collection for each decomposed question. In the final step, we use the LLM in a few-shot setting to aggregate the contents of the passages into the final answer. The system is evaluated on three datasets: IIRC, Qasper, and StrategyQA. Results suggest that current retrievers are the main bottleneck and that readers are already performing at the human level as long as relevant passages are provided. The system is also shown to be more effective when the model is induced to give explanations before answering a question. Code is available at https://github.com/neuralmind-ai/visconde .
MESTrans: Multi-scale embedding spatial transformer for medical image segmentation

Transformers profiting from global information modeling derived from the self-attention mechanism have recently achieved remarkable performance in computer vision. In this study, a novel transformer-based medical image segmentation network called the multi-scale embedding spatial transformer (MESTrans) was proposed for medical image segmentation.First, a dataset called COVID-DS36 was created from 4369 computed tomography (CT) images of 36 patients from a partner hospital, of which 18 had COVID-19 and 18 did not. Subsequently, a novel medical image segmentation network was proposed, which introduced a self-attention mechanism to improve the inherent limitation of convolutional neural networks (CNNs) and was capable of adaptively extracting discriminative information in both global and local content. Specifically, based on U-Net, a multi-scale embedding block (MEB) and multi-layer spatial attention transformer (SATrans) structure were designed, which can dynamically adjust the receptive field in accordance with the input content. The spatial relationship between multi-level and multi-scale image patches was modeled, and the global context information was captured effectively. To make the network concentrate on the salient feature region, a feature fusion module (FFM) was established, which performed global learning and soft selection between shallow and deep features, adaptively combining the encoder and decoder features. Four datasets comprising CT images, magnetic resonance (MR) images, and H&E-stained slide images were used to assess the performance of the proposed network.Experiments were performed using four different types of medical image datasets. For the COVID-DS36 dataset, our method achieved a Dice similarity coefficient (DSC) of 81.23%. For the GlaS dataset, 89.95% DSC and 82.39% intersection over union (IoU) were obtained. On the Synapse dataset, the average DSC was 77.48% and the average Hausdorff distance (HD) was 31.69 mm. For the I2CVB dataset, 92.3% DSC and 85.8% IoU were obtained.The experimental results demonstrate that the proposed model has an excellent generalization ability and outperforms other state-of-the-art methods. It is expected to be a potent tool to assist clinicians in auxiliary diagnosis and to promote the development of medical intelligence technology.
Deep learning-enabled fully automated pipeline system for segmentation and classification of single-mass breast lesions using contrast-enhanced mammography: a prospective, multicentre study

Breast cancer is the leading cause of cancer-related deaths in women. However, accurate diagnosis of breast cancer using medical images heavily relies on the experience of radiologists. This study aimed to develop an artificial intelligence model that diagnosed single-mass breast lesions on contrast-enhanced mammography (CEM) for assisting the diagnostic workflow.A total of 1912 women with single-mass breast lesions on CEM images before biopsy or surgery were included from June 2017 to October 2022 at three centres in China. Samples were divided into training and validation sets, internal testing set, pooled external testing set, and prospective testing set. A fully automated pipeline system (FAPS) using RefineNet and the Xception + Pyramid pooling module (PPM) was developed to perform the segmentation and classification of breast lesions. The performances of six radiologists and adjustments in Breast Imaging Reporting and Data System (BI-RADS) category 4 under the FAPS-assisted strategy were explored in pooled external and prospective testing sets. The segmentation performance was assessed using the Dice similarity coefficient (DSC), and the classification was assessed using heatmaps, area under the receiver operating characteristic curve (AUC), sensitivity, and specificity. The radiologists' reading time was recorded for comparison with the FAPS. This trial is registered with China Clinical Trial Registration Centre (ChiCTR2200063444).The FAPS-based segmentation task achieved DSCs of 0.888 ± 0.101, 0.820 ± 0.148 and 0.837 ± 0.132 in the internal, pooled external and prospective testing sets, respectively. For the classification task, the FAPS achieved AUCs of 0.947 (95% confidence interval [CI]: 0.916-0.978), 0.940 (95% [CI]: 0.894-0.987) and 0.891 (95% [CI]: 0.816-0.945). It outperformed radiologists in terms of classification efficiency based on single lesions (6 s vs 3 min). Moreover, the FAPS-assisted strategy improved the performance of radiologists. BI-RADS category 4 in 12.4% and 13.3% of patients was adjusted in two testing sets with the assistance of FAPS, which may play an important guiding role in the selection of clinical management strategies.The FAPS based on CEM demonstrated the potential for the segmentation and classification of breast lesions, and had good generalisation ability and clinical applicability.This study was supported by the Taishan Scholar Foundation of Shandong Province of China (tsqn202211378), National Natural Science Foundation of China (82001775), Natural Science Foundation of Shandong Province of China (ZR2021MH120), and Special Fund for Breast Disease Research of Shandong Medical Association (YXH2021ZX055).
Hybrid dingo and whale optimization algorithm‐based optimal load balancing for cloud computing environment

Abstract Cloud computing is the most rapidly growing technology that facilitates virtualized computer resources to the users through its service providers. Load balancing and task scheduling is the important concern in the cloud computing scenario from the service provider point of view. The process of load balancing is responsible for allocating the dynamic workload among the cloud systems, such that equal sharing of the resources without the virtual machines (VMs) being overloaded or underloaded. This load balancing process not only needs to allocate the tasks to suitable VMs but also need to maintain trade‐off among VMs. Thus, a potential dynamic and optimized load balancing strategy is essential for improving resource utilization, services, reliability, and throughput by maintaining equilibrium between VMs with minimized makespan. In this article, hybrid dingo and whale optimization algorithm‐based load balancing mechanism (HDWOA‐LBM) is proposed for effective load balancing those aids in maximized throughput, reliability, and resource utilization in the clouds. This HDWOA‐LBM is proposed by mimicking the hunting characteristics of dingo (equivalent to tasks) and VMs as their prey to be hunted. It inherited the process of exploration and exploitation through the chasing and approaching, encircling, and harassing inherent with dingo optimization algorithm (DOA) to determine the optimal allocation of incoming tasks to the suitable VM. In specific, it utilized the merits of whale optimization for improving the exploitation phase of DOA to balance the trade‐off between local and global search. The simulation experiments of the proposed HDWOA‐LBM conducted using CloudSim confirmed better throughput of 21.28%, maximized reliability of 25.42%, minimized makespan of 22.98%, and improved resource allocation of 20.86%, on par with the competitive intelligent load balancing schemes used for investigation.
Dual Uncertainty-Guided Mixing Consistency for Semi-Supervised 3D Medical Image Segmentation

3D semi-supervised medical image segmentation is extremely essential in computer-aided diagnosis, which can reduce the time-consuming task of performing annotation. The challenges with current 3D semi-supervised segmentation algorithms includes the methods, limited attention to volume-wise context information, their inability to generate accurate pseudo labels and a failure to capture important details during data augmentation. This article proposes a dual uncertainty-guided mixing consistency network for accurate 3D semi-supervised segmentation, which can solve the above challenges. The proposed network consists of a Contrastive Training Module which improves the quality of augmented images by retaining the invariance of data augmentation between original data and their augmentations. The Dual Uncertainty Strategy calculates dual uncertainty between two different models to select a more confident area for subsequent segmentation. The Mixing Volume Consistency Module that guides the consistency between mixing before and after segmentation for final segmentation, uses dual uncertainty and can fully learn volume-wise context information. Results from evaluative experiments on brain tumor and left atrial segmentation shows that the proposed method outperforms state-of-the-art 3D semi-supervised methods as confirmed by quantitative and qualitative analysis on datasets. This effectively demonstrates that this study has the potential to become a medical tool for accurate segmentation. Code is available at: <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/yang6277/DUMC</uri> .
BF-QC: Belief functions on quantum circuits

Dempster–Shafer Theory (DST) of belief function is a basic theory of artificial intelligence, which can represent the underlying knowledge more reasonably than Probability Theory (ProbT). Because of the computation complexity exploding exponentially with the increasing number of elements, the practical application scenarios of DST are limited. In this paper, we encode Basic Belief Assignments (BBA) into quantum superposition states and propose the implementation and operation methods of BBA on quantum circuits. We decrease the computation complexity of the Matrix Evolution on BBA (MEoB) on quantum circuits. Based on the MEoB, we realize the quantum belief functions' implementation, the similarity measurements of BBAs, evidence Combination Rules (CR), and probability transformation on quantum circuits.
Zero-shot learning for requirements classification: An exploratory study

Requirements engineering (RE) researchers have been experimenting with machine learning (ML) and deep learning (DL) approaches for a range of RE tasks, such as requirements classification, requirements tracing, ambiguity detection, and modelling. However, most of today's ML/DL approaches are based on supervised learning techniques, meaning that they need to be trained using a large amount of task-specific labelled training data. This constraint poses an enormous challenge to RE researchers, as the lack of labelled data makes it difficult for them to fully exploit the benefit of advanced ML/DL technologies. This paper addresses this problem by showing how a zero-shot learning (ZSL) approach can be used for requirements classification without using any labelled training data. We focus on the classification task because many RE tasks can be framed as classification problems. The ZSL approach used in our study employs contextual word-embeddings and transformer-based language models (LMs). We demonstrate this approach through a series of experiments to perform three classification tasks: (1) FR/NFR — classification functional requirements vs non-functional requirements; (2) NFR — identification of NFR classes; (3) Security — classification of security vs non-security requirements. The study shows that the ZSL approach achieves an F1 score of 0.66 for the FR/NFR task. For the NFR task, the approach yields F1∼0.72−0.80, considering the most frequent classes. For the Security task, F1 ∼0.66. All of the aforementioned F1 scores are achieved with zero-training efforts. This study demonstrates the potential of ZSL for requirements classification. An important implication is that it is possible to have very little or no training data to perform classification tasks. The proposed approach thus contributes to the solution of the long-standing problem of data shortage in RE.
A survey on GANs for computer vision: Recent research, analysis and taxonomy

In the last few years, there have been several revolutions in the field of deep learning, mainly headlined by the large impact of Generative Adversarial Networks (GANs). GANs not only provide an unique architecture when defining their models, but also generate incredible results which have had a direct impact on society. Due to the significant improvements and new areas of research that GANs have brought, the community is constantly coming up with new researches that make it almost impossible to keep up with the times. Our survey aims to provide a general overview of GANs, showing the latest architectures, optimizations of the loss functions, validation metrics and application areas of the most widely recognized variants. The efficiency of the different variants of the model architecture will be evaluated, as well as showing the best application area; as a vital part of the process, the different metrics for evaluating the performance of GANs and the frequently used loss functions will be analyzed. The final objective of this survey is to provide a summary of the evolution and performance of the GANs which are having better results to guide future researchers in the field.