Reviewerly/exHarmony huggingface dataset:
Digital simulation of convex mixtures of Markovian and non-Markovian single qubit Pauli channels on NISQ devices

Abstract Quantum algorithms for simulating quantum systems provide a clear and provable advantage over classical algorithms in fault-tolerant settings. There is also interest in quantum algorithms and their implementation in Noisy Intermediate Scale Quantum (NISQ) settings. In these settings, various noise sources and errors must be accounted for when executing any experiments. Recently, NISQ devices have been verified as versatile testbeds for simulating open quantum systems and have been used to simulate simple quantum channels. Our goal is to solve the more complicated problem of simulating convex mixtures of single qubit Pauli channels on NISQ devices. We consider two specific cases: mixtures of Markovian channels that result in a non-Markovian channel (M + M = nM) and mixtures of non-Markovian channels that result in a Markovian channel (nM + nM = M). For the first case, we consider mixtures of Markovian single qubit Pauli channels; for the second case, we consider mixtures of Non-Markovian single qubit depolarising channels, which is a special case of the single qubit Pauli channel. We show that efficient circuits, which account for the topology of currently available devices and current levels of decoherence, can be constructed by heuristic approaches that reduce the number of CNOT gates used in our circuit. We also present a strategy for regularising the process matrix so that the process tomography yields a completely positive and trace-preserving (CPTP) channel. Key points This work simulates the convex mixtures of single qubit Markovian and non-Markovian quantum channels on NISQ devices provided by the IMBQE. The circuits used to implement the channels take into account the topolgy of the quantum device used as well as the number of CNOT gates used. We present a strategy for regularising the process matrix to ensure the quantum process tomography yields a CPTP channel. Something that is not correctly implemented in Qiskit. A method is outlined for finding mixtures of non-Markovian depolarising channels that yield a Markovian depolarising channel. It is also shown that, one cannot convexly mix two Markovian depolarising channels that leads to a non-Markovian depolarising channel.
Construction of a network intelligence platform for privacy protection and integrated big data mining

Motivation: With the enhancement of people’s awareness of the protection of personal privacy information, how to provide better services on the premise of protecting users’ privacy has become an urgent problem to be solved. Therefore, it is a necessary motivation to build a network intelligent platform for privacy protection and integrated big data mining. Objective: In view of the existing network platform of data privacy leakage, low efficiency of data mining and user satisfaction is not high, this paper will adopt advanced privacy technology, to ensure the confidentiality of users’ personal information and security, to enhance the user trust and use experience, to better meet the needs of users. Methods: In order to better protect the privacy of users, the network intelligent platform should adopt more advanced privacy protection technology. This paper uses the differential privacy algorithm to reduce the risk of data leakage and abuse, and ensure the accuracy and efficiency of data analysis and mining. In the design of the platform, the performance of the platform is fully taken into account to realize the secure storage and efficient processing of data, with good scalability and flexibility to meet the growing user needs and business needs. The performance of the network intelligent platform is also analyzed by experimental simulation. Result: The experimental results of this article indicated that in a network intelligent platform based on privacy protection and integrated big data mining, its data transmission encryption score was 9.5; the data storage encryption score was 9.8; the score of access control mechanism was 9.3; the privacy protection score was 9.6; the response time was 80 ms; the processing speed was 121GB/h; the user satisfaction rating was 6.6. Conclusion: This indicated that the network intelligent platform had good platform performance and user friendliness while ensuring data security and privacy protection. It could efficiently conduct data mining and ensure data security and privacy.
A hybrid stacking classifier with feature selection for handling imbalanced data

Nowadays, cancer has become more alarming. This paper discusses the most significant Ovarian Cancer, Epithelial Ovarian Cancer (EOC), due to the low survival rate. The proposed algorithm for this work is a ‘Multi classifier ShapRFECV based EOC’ (MSRFECV-EOC) subtype analysis technique that utilized the EOC data from the National Centre for Biotechnology Information and Cancer Cell Line Encyclopedia websites for early identification of EOC using Machine Learning Techniques. This approach increases the data size, balances different classes of the data, and cuts down the enormous number of features unrelated to the disease of interest to prevent overfitting. To incorporate these functionalities, in the data preprocessing stage, OC-related gene names were taken from the Cancermine database and other OC-related works. Moreover, OC datasets were merged based on OC genes, and missing values of EOC subtypes were identified and imputed using Iterative Logistic Imputation. Synthetic Minority Oversampling Technique with an Edited Nearest Neighbors approach is applied to the imputed dataset. Next, in the Feature Selection phase, the most significant features for subtypes of EOC were identified by applying the Shapley Additive Explanations based on the Recursive Feature Elimination Cross-Validation (ShapRFECV) algorithm, preserving predefined features while selecting new EOC features. Eventually, an accuracy of 97% was achieved with Optuna-optimized Random Forest, which outperformed the existing models. SHAP plotted the most prominent features behind the classification. The Pickle tool saves much training time by preserving hidden parameter values of the model. In the final phase, by using the Stratified K Fold Stacking Classifier, the accuracy was improved to 98.9%.
MTC-Net: Multi-scale feature fusion network for medical image segmentation

Image segmentation is critical in medical image processing for lesion detection, localisation, and subsequent diagnosis. Currently, computer-aided diagnosis (CAD) has played a significant role in improving diagnostic efficiency and accuracy. The segmentation task is made more difficult by the hazy lesion boundaries and uneven forms. Because standard convolutional neural networks (CNNs) are incapable of capturing global contextual information, adequate segmentation results are impossible to achieve. We propose a multiscale feature fusion network (MTC-Net) in this paper that integrates deep separable convolution and self-attentive modules in the encoder to achieve better local continuity of images and feature maps. In the decoder, a multi-branch multi-scale feature fusion module (MSFB) is utilized to improve the network’s feature extraction capability, and it is integrated with a global cooperative aggregation module (GCAM) to learn more contextual information and adaptively fuse multi-scale features. To develop rich hierarchical representations of irregular forms, the suggested detail enhancement module (DEM) adaptively integrates local characteristics with their global dependencies. To validate the effectiveness of the proposed network, we conducted extensive experiments, evaluated on the public datasets of skin, breast, thyroid and gastrointestinal tract with ISIC2018, BUSI, TN3K and Kvasir-SEG. The comparison with the latest methods also verifies the superiority of our proposed MTC-Net in terms of accuracy. Our code on https://github.com/gih23/MTC-Net.
A negative selection algorithm with human-in-the-loop for anomaly detection

The existing negative selection algorithms can not improve their detection performance by human intervention during the testing process. This paper proposes a negative selection algorithm with human-in-the-loop for anomaly detection. It uses self-sample clusters to train detectors with a nonrandom strategy. Its detectors and self-sample clusters fully cover state space without overlapping each other. It locally adjusts detectors and self-sample clusters with human intervention to improve its detection performance during the testing process. Experiments were performed on two synthetic datasets and the Iris dataset from the UCI repository to assess its performance. The results show that it outperforms the other anomaly detection methods in most cases.
Query reformulation system based on WordNet and word vectors clusters

With tremendous evolution in the internet world, the internet has become a household thing. Internet users use search engines or personal assistants to request information from the internet. Search results are greatly dependent on the entered keywords. Casual users may enter a vague query due to lack of knowledge of the domain-specific words. We propose a query reformulation system that determines the context of the query, decides on keywords to be replaced and outputs a better-modified query. We propose strategies for keyword replacements and metrics for query betterment checks. We have found that if we project keywords into the vector space of word projection using word embedding techniques and if the keyword replacement is correct, clusters of a new set of keywords become more cohesive. This assumption forms the basis of our proposed work. To prove the effectiveness of the proposed system, we applied it to the ad-hoc retrieval tasks over two benchmark corpora viz TREC-CDS 2014 and OHSUMED corpus. We indexed Whoosh search engine on these corpora and evaluated based on the given queries provided along with the corpus. Experimental results show that the proposed techniques achieved 9 to 11% improvement in precision and recall scores. Using Google’s popularity index, we also prove that the reformulated queries are not only more accurate but also more popular. The proposed system also applies to Conversational AI chatbots like ChatGPT, where users must rephrase their queries to obtain better results.
Hybrid image encryption using advanced least significant bit algorithm, chaotic maps and DNA encoding for digital healthcare

Security and privacy are major concerns in this modern world. Medical documentation of patient data needs to be transmitted between hospitals for medical experts opinions on critical cases which may cause threats to the data. Nowadays most of the hospitals use electronic methods to store and transmit data with basic security measures, but these methods are still vulnerable. There is no perfect solution that solves the security problems in any industry, especially healthcare. So, to cope with the arising need to increase the security of the data from being manipulated the proposed method uses a hybrid image encryption technique to hide the data in an image so it becomes difficult to sense the presence of data in the image while transmission. It combines Least Significant Bit (LSB) Algorithm using Arithmetic Division Operation along with Canny edge detection to embed the patient data in medical images. The image is subsequently encrypted using keys of six different chaotic maps sequentially to increase the integrity and robustness of the system. Finally, an encrypted image is converted into DNA sequence using DNA encoding rule to improve reliability. The experimentation is done on the Chest XRay image, Knee Magnetic Resonance Imaging (MRI) image, Neck MRI image, Lungs Computed Tomography (CT) Scan image datasets and patient medical data with 500 characters, 1000 characters and 1500 characters. And, it is evaluated based on time coefficient of encryption and decryption, histogram, entropy, similarity score (Mean Square Error), quality score (peak signal-to-noise ratio), motion activity index (number of changing pixel rate), unified average changing intensity, image similarity score (structure similarity index measurement) between original and encrypted images. Also, the proposed technique is compared with other recent state of arts methods for 500 characters embedding and performed better than those techniques. The proposed method is more stable and embeds comparatively more data than other recent works with lower Mean Square Error value of 4748.12 which is the main factor used to determine how well the data is hidden and cannot be interpreted easily. Also, it achieved a Peak Signal-Noise Ratio (PSNR) value of 71.34 dB, which is superior than other recent works, verifying that the image quality remains uncompromising even after being encrypted.
Explainer on GNN-based segmentation networks

Abstract Graph Neural Networks (GNN) are powerful tools for deep learning. Similar to other neural networks, GNNs are complex models, in which humans can’t understand the decision-making procedures of the models. Therefore, it brings the need to explainability of GNNs. Explainability is critical for deep learning to support its predictions. In this paper, we will investigate the Grad-Cam and Integrated-Gradients explaining methods. The Grad-Cam applies a global average pooling over the feature activation mapping, and then which was followed by a ReLU activation to obtain an attribution. The Integrated-Gradients explains models by taking a line integral between the baseline image (a black image) and the source image. We demonstrate how Grad-Cam and the Integrated-Gradients methods explain the graph-deep model in semantic segmentation tasks over the Cityscapes dataset. FCN and LRASSP-MobileNet are used as a comparison to the DualGCN in the experiment to show the explaining effect.
Using nonclassical states to explore the superradiant phase transition in the quantum Rabi model

The ground state of the quantum Rabi model (QRM) exhibits rich nonclassical states including the squeezed state, cat state, and entangled state in different parameter regimes. In this paper, we first use the polaron picture with high precision and fidelity to figure out the process of the superradiant phase transition (SPT) in view of the nonclassical states. The squeezing effect is considered to be a result of the higher-order excitations and important in order to understand the fundamental quantum physics of the SPT in the QRM. According to the polaron wave functions, the squeezed state extends across the entire range of parameters. Based on the squeezing and superradiance, a classification of the coupling strength for the nonclassical states containing the ground state is presented; the system sequentially goes through the vacuum states, the squeezed vacuum states, the squeezed cat states, and the cat states as the coupling strength increases. The process of the SPT is also demonstrated by the photon number distribution in Fock space, and then the novel behavior of parity chains for the SPT is revealed. Additionally, the nonclassical states can be intuitively characterized by the Wigner functions with analytical expressions in the polaron picture, and the Wigner negativity is evaluated to measure the nonclassicality. We find that a small but nonzero weighted antipolaron is necessary to form novel semicat states. Our paper provides guidance for preparing nonclassical states in experiments based on the light-matter interaction.
Risk management in the beverage production industry using FMEA and fuzzy cognitive map in an uncertain environment

Proper and systematic management of food industry failures can improve the quality of products and save a lot on the costs of organizations and people’s health. One of the conventional methods for risk assessment is the Failure Modes and Effects Analysis (FMEA) which is often performed in a phase or stage. Compared to the combined methods, this method is less accurate due to similar priorities of failure in the evaluation and the lack of consideration of the interaction between risks. The current research has applied an integrated approach based on two techniques, FMEA and Fuzzy Cognitive Map (FCM), in a multi-stage manner to increase assessment accuracy and ranking of failures. By considering the risks of an industry in an uncertain environment and the causal relationships between failures, this approach can evaluate the industry’s risks better than conventional methods. In the research method, the initial prioritization of failures by the FMEA method is used as the input of the multi-stage FCM. The cause-and-effect relationship between the failures is determined by experts and the functional records of the processes, and the FCM is prepared. Since no research evaluates the risks of the malting industry step by step and considers the causal relationships between the risks, the present study has improved risk evaluation in the malting industry by using a multi-stage FCM. The ranking results with the proposed hybrid approach and its comparison with the conventional methods showed that the rating became more accurate, and the multiple priorities were improved. Managers of the malt beverage industry can make effective investment decisions to reduce or better control the risks of this industry by using the results of applying the proposed approach.
An improved DDPG algorithm based on evolution-guided transfer in reinforcement learning

Abstract Deep Reinforcement Learning (DRL) algorithms help agents take actions automatically in sophisticated control tasks. However, it is challenged by sparse reward and long training time for exploration in the application of Deep Neural Network (DNN). Evolutionary Algorithms (EAs), a set of black box optimization techniques, are well applied to single agent real-world problems, not troubled by temporal credit assignment. However, both suffer from large sets of sampled data. To facilitate the research on DRL for a pursuit-evasion game, this paper contributes an innovative policy optimization algorithm, which is named as Evolutionary Algorithm Transfer - Deep Deterministic Policy Gradient (EAT-DDPG). The proposed EAT-DDPG takes parameters transfer into consideration, initializing the DNN of DDPG with the parameters driven by EA. Meanwhile, a diverse set of experiences produced by EA are stored into the replay buffer of DDPG before the EA process is ceased. EAT-DDPG is an improved version of DDPG, aiming at maximizing the reward value of the agent trained by DDPG as much as possible within finite episodes. The experimental environment includes a pursuit-evasion scenario where the evader moves with the fixed policy, and the results show that the agent can explore policy more efficiently with the proposed EAT-DDPG during the learning process.
Sketching of interactive VoIP traffic with multivariate statistical learning-based classification

Classifying VoIP (Voice over Internet Protocol) traffic is vital for optimizing network performance and Quality of Service (QoS). This study introduces the Multivariate Statistical-Based Classification (MVSC) system, designed to classify network traffic with high accuracy and efficiency. As traditional methods struggle in the diverse and complex landscape of today’s network traffic, which includes voice, video, gaming, and data, the MVSC algorithm rises to the challenge. It employs Statistical Dissemination and leverages various statistical features such as Packet Size, Inter-Arrival Statistics, Packet and Data rates, Flow Length, and Five-tuple information to create nuanced profiles of network traffic packets. These packets are then grouped into distinct clusters based on their statistical attributes through Application Flow Cluster Grouping. A unique aspect of the MVSC system is its approach to representing each application flow as points in a two-dimensional space, where distances to predefined application profiles are calculated. The nearest profile then determines the type of VoIP traffic. Experimental results using university traffic data (KU-IDS) underscore the system’s high accuracy, consistently around 98-99% . These findings affirm the system’s suitability for real-time deployment. In summary, the MVSC system offers a robust and efficient solution for VoIP traffic classification, significantly boosting network performance and QoS, and proving to be an invaluable asset in contemporary network management.
Multi-CNN based logical reasoning system for facial expression recognition on small-sample datasets

Facial expression recognition has long been an area of great interest across a wide range of fields. Deep learning is commonly employed in facial expression recognition and demonstrates excellent performance in large-sample classification tasks. However, deep learning models often encounter challenges when confronted with small-sample expression classification problems, as they struggle to extract sufficient relevant features from limited data, resulting in subpar performance. This paper presents a novel approach called the Multi-CNN Logical Reasoning System, which is based on local area recognition and logical reasoning. It initiates the process by partitioning facial expression images into two distinct components: eye action and mouth action. Subsequently, it utilizes logical reasoning based on the inherent relationship between local actions and global expressions to facilitate facial expression recognition. Throughout the reasoning process, it not only incorporates manually curated knowledge but also acquires hidden knowledge from the raw data. Experimental results conducted on two small-sample datasets derived from the KDEF and RaFD datasets demonstrate that the proposed approach exhibits faster convergence and higher prediction accuracy when compared to classical deep learning-based algorithms.
Improving polygon image segmentation by enhancing U-Net architecture

Abstract The crucial task of polyp recognition in medical imaging plays a pivotal role in the early detection and prevention of colorectal cancer. Semantic segmentation, particularly utilizing sophisticated deep learning models such as U-Net, has demonstrated promising results in the realm of polyp segmentation. However, the traditional U-Net structure sometimes grapples with accurately delineating the edges of polyps, which subsequently impacts the overall performance of segmentation. To address this issue, the current study introduces a novel approach by proposing a modified framework of U-Net, equipped with an enhanced edge loss function. This function is designed to ameliorate the accuracy of segmentation within polyp images. The aim is to elevate the model’s capacity to capture intricate details, specifically the edges, which is an area where standard U-Net structures often falter. Experimental outcomes of this study serve to underscore the effectiveness of the proposed approach in accomplishing superior segmentation of edges and improved overall performance in polyp recognition. By successfully tackling the challenges inherent to polyp edge segmentation, the modified U-Net model contributes significantly towards more precise diagnostic systems in the field of medical imaging. Consequently, this research is poised to make a valuable contribution to advancements in the prevention and early detection of colorectal cancer.