Reviewerly/exHarmony huggingface dataset:
Utilization of Homomorphic Cryptosystems for Information Exchange in Value Chains

Information plays a significant role in modern process industries due to the demand for flexibility and mobility in production. Therefore, it is important to preserve the privacy and security of the information exchanged and shared between partners in value chains, for instance asset chains or supply chains. Since many companies have their own technological solutions and methods for operation and control, this information is regarded as their intellectual property. For the protection of recipes, material flows, or operational and control variables during the manufacturing of products, various methods are available. These techniques include anonymization and encryption solutions. To deal with mathematical models and the computation of formulas, homomorphic encryption schemes can be applied to the data which have to be shared within a value chain. Based on the experience of previous implementations of homomorphic crypto system in different domains, the opportunities for adaptation of encryption methods in process industries are considered. This paper proposes the application of homomorphic encryption in a value chain and defines a specific protocol that enables the Paillier cryptosystem on a time series. A use case is designed for confidential information exchange between a secret owner and a value provider in a value chain. The architecture of confidentiality-preserving information sharing satisfies the zero-knowledge proof requirement and shows low similarity between original and recovered messages.
Language Modeling with Reduced Densities

This work originates from the observation that today's state-of-the-art statistical language models are impressive not only for their performance, but also---and quite crucially---because they are built entirely from correlations in unstructured text data. The latter observation prompts a fundamental question that lies at the heart of this paper: What mathematical structure exists in unstructured text data? We put forth enriched category theory as a natural answer. We show that sequences of symbols from a finite alphabet, such as those found in a corpus of text, form a category enriched over probabilities. We then address a second fundamental question: How can this information be stored and modeled in a way that preserves the categorical structure? We answer this by constructing a functor from our enriched category of text to a particular enriched category of reduced density operators. The latter leverages the Loewner order on positive semidefinite operators, which can further be interpreted as a toy example of entailment.
Efficient Characterization of Quantum Evolutions via a Recommender System

We demonstrate characterizing quantum evolutions via matrix factorization algorithm, a particular type of the recommender system (RS). A system undergoing a quantum evolution can be characterized in several ways. Here we choose (i) quantum correlations quantified by measures such as entropy, negativity, or discord, and (ii) state-fidelity. Using quantum registers with up to 10 qubits, we demonstrate that an RS can efficiently characterize both unitary and nonunitary evolutions. After carrying out a detailed performance analysis of the RS in two qubits, we show that it can be used to distinguish a clean database of quantum correlations from a noisy or a fake one. Moreover, we find that the RS brings about a significant computational advantage for building a large database of quantum discord, for which no simple closed-form expression exists. Also, RS can efficiently characterize systems undergoing nonunitary evolutions in terms of quantum discord reduction as well as state-fidelity. Finally, we utilize RS for the construction of discord phase space in a nonlinear quantum system.
Empirical Evaluation of Shallow and Deep Learning Classifiers for Arabic Sentiment Analysis

This work presents a detailed comparison of the performance of deep learning models such as convolutional neural networks, long short-term memory, gated recurrent units, their hybrids, and a selection of shallow learning classifiers for sentiment analysis of Arabic reviews. Additionally, the comparison includes state-of-the-art models such as the transformer architecture and the araBERT pre-trained model. The datasets used in this study are multi-dialect Arabic hotel and book review datasets, which are some of the largest publicly available datasets for Arabic reviews. Results showed deep learning outperforming shallow learning for binary and multi-label classification, in contrast with the results of similar work reported in the literature. This discrepancy in outcome was caused by dataset size as we found it to be proportional to the performance of deep learning models. The performance of deep and shallow learning techniques was analyzed in terms of accuracy and F1 score. The best performing shallow learning technique was Random Forest followed by Decision Tree, and AdaBoost. The deep learning models performed similarly using a default embedding layer, while the transformer model performed best when augmented with araBERT.
Locally suppressed transverse-field protocol for diabatic quantum annealing

Diabatic quantum annealing (DQA) is an alternative algorithm to adiabatic quantum annealing that can be used to circumvent the exponential slowdown caused by small minima in the annealing energy spectrum. We present the locally suppressed transverse-field (LSTF) protocol, a heuristic method for making stoquastic optimization problems compatible with DQA. We show that, provided an optimization problem intrinsically has magnetic frustration due to inhomogeneous local fields, a target qubit in the problem can always be manipulated to create a double minimum in the energy gap between the ground and first excited states during the evolution of the algorithm. Such a double energy minimum can be exploited to induce diabatic transitions to the first excited state and back to the ground state. In addition to its relevance to classical and quantum algorithmic speedups, the LSTF protocol enables DQA proof-of-principle and physics experiments to be performed on existing hardware, provided independent controls exist for the transverse qubit magnetization fields. We discuss the implications on the coherence requirements of the quantum annealing hardware when using the LSTF protocol, considering specifically the cases of relaxation and dephasing. We show that the relaxation rate of a large system can be made to depend only on the target qubit, presenting opportunities for the characterization of the decohering environment in a quantum annealing processor.
Improved Semantic Image Inpainting Method with Deep Convolution Generative Adversarial Networks

With the development of generative adversarial networks (GANs), more and more researchers apply them to image inpainting technologies. However, many existing approaches caused some inpainting images to be unclear or even restore failures due to a failure to keep the consistency of the inpainted content and structures in line with the surroundings. In this article, we propose the Improved Semantic Image Inpainting Method with Deep Convolution GANs, which can resolve this inconsistency. In the proposed method, we design a patch discriminator and contextual loss to jointly perform the accuracy and effectiveness for image inpainting. In addition, we also designed a consistency loss based on deep convolutional neural networks to constrain the difference between the generated image and the original image in the feature space. Our proposed method improves the details and authenticity effectively for the inpainting images. We evaluate our proposed method on two different datasets, and the result shows that our proposed method achieves state-of-the-art results.
Learning Cellular Phenotypes through Supervision

Image-based cell phenotyping is an important and open problem in computational pathology. The two principal challenges are: 1) making the cell cluster properties insensitive to experimental settings (like seed point and feature selection) and 2) ensuring that the phenotypes emerging are biologically relevant and support clinical reporting. To gauge robustness, we first compare the consistency of the phenotypes using self-supervised and supervised features. Through case classification, we analyse the relevance of the self-supervised and supervised feature sets with respect to the clinical diagnosis. In addition, we demonstrate how we can add model explainability through Shapley values to identify more disease relevant cellular phenotypes and measure their importance in context of the disease. Here, myeloproliferative neoplasms, a haematopoietic stem cell disorder, where one particular cell type is of diagnostic relevance is used as an exemplar. The experiments conducted on a set of bone marrow trephines demonstrate an improvement of 7.4 % in accuracy for case classification using cellular phenotypes derived from the supervised scenario.
Incorporating the Breast Imaging Reporting and Data System Lexicon with a Fully Convolutional Network for Malignancy Detection on Breast Ultrasound

In this study, we applied semantic segmentation using a fully convolutional deep learning network to identify characteristics of the Breast Imaging Reporting and Data System (BI-RADS) lexicon from breast ultrasound images to facilitate clinical malignancy tumor classification. Among 378 images (204 benign and 174 malignant images) from 189 patients (102 benign breast tumor patients and 87 malignant patients), we identified seven malignant characteristics related to the BI-RADS lexicon in breast ultrasound. The mean accuracy and mean IU of the semantic segmentation were 32.82% and 28.88, respectively. The weighted intersection over union was 85.35%, and the area under the curve was 89.47%, showing better performance than similar semantic segmentation networks, SegNet and U-Net, in the same dataset. Our results suggest that the utilization of a deep learning network in combination with the BI-RADS lexicon can be an important supplemental tool when using ultrasound to diagnose breast malignancy.
Sum of Certainties with the Product of Reasons: Neural Network with Fuzzy Aggregators

The paper attempts to bridge the gap between widely accepted models of biological systems based on the Tsetlin automata acting in random environment and traditional artificial neural networks that consist of the McCalloch and Pitts neurons. Using recently developed algebra with uninorm and absorbing norm aggregators, we consider the neurons as extended Tsetlin automata that implement multi-valued not - xor operator applied to the aggregated inputs and internal states, and then construct the network using these neurons. The inputs of the neurons are specified by the synapses that implement multi-valued joined and and or operations. We demonstrate that for favorable (in the sense of learning) states the suggested neurons act similarly to the traditional neurons, while for unfavorable states they immediately change their activity to the reverse one. Such properties of the neurons both results in the correct activity of the network and demonstrates better correspondence with the logics of natural neural networks.
Study on Structural Characteristics of Composite Smart Grille Based on Principal Component Analysis

In recent years, many scholars have conducted in-depth and extensive research on the mechanical properties, preparation methods, and structural optimization of grid structural materials. In this paper, the structural characteristics of composite intelligent grid are studied by combining theoretical analysis with experiments. According to the existing conditions in the laboratory, the equilateral triangular grid structure experimental pieces were prepared. In this paper, principal component analysis combined with nearest neighbor method was used to detect the damage of composite plates. On this basis, the multiobjective robustness optimization of the structure is carried out based on artificial intelligence algorithm, which makes the structure quality and its sensitivity to uncertain parameters lower. Particle swarm optimization (PSO) is used in neural network training. The damage characteristics of different grid structures, different impact positions, and different impact energies were studied. The results show that the structural damage types, areas, and propagation characteristics are very different when the structure is impacted at different positions, which verifies that the grid structure has a good ability to limit the damage diffusion and shows that the grid structure has a good ability to resist damage.
Short-term memory neural network-based cognitive computing in sports training complexity pattern recognition

With the development of Chinese sports, many sports training researchers try to use artificial intelligence technology to study the training methods and training elements of athletes. However, in reality, these methods are often based on different basic training principles, resulting in the reduction in the generalization ability of artificial intelligence networks. This paper studies the complexity of sports training principles by using an artificial intelligence network model. Based on the improved model of dropout optimization algorithm, this paper proposes an artificial intelligence sports training node prediction method based on the combination of dropout optimization algorithm and short-term memory neural network (LSTM), which avoids the establishment of complex sports training models. Based on artificial intelligence operation and maintenance records and sports training core capacity experimental data, the maximum node static estimation of artificial intelligence sports training is realized. The research shows that the node prediction model is established by using the method described in this paper. Through experimental comparison and analysis, the model has high prediction accuracy. Due to the state memory function of LSTM, it has advantages in the prediction of 2000 data on a long time scale. The mean absolute error percentage of the prediction results is less than 3.4%, and the maximum absolute error percentage is less than 5.2%. The artificial intelligence network model in this paper has good generalization ability. Compared with other models, the model proposed in this paper can get more accurate prediction results in sports training of different groups and effectively alleviate the problem of overfitting. Therefore, traditional stadiums and gymnasiums should actively introduce artificial intelligence technology with a more positive attitude, to realize the development and innovation in technology application, service innovation, management efficiency, and function integration.
MSA-CNN: Face Morphing Detection via a Multiple Scales Attention Convolutional Neural Network

Face morphing attack is becoming a serious threat to the existing face recognition systems. Some different approaches for morphing attack detection have been put forward. However, there are few methods concentrated on detecting the morphing artifacts, which often appear in morphed facial images. In this work, we propose a multiple scales attention convolutional neural network (MSA-CNN), a novel approach that can effectively detect the morphing artifacts in face morphing attacks. It utilizes the attention mechanism to continuously pay attention to the morphing artifacts in multiple scales and finally realizes face morphing detection. Experimental results and analysis show that it can effectively locate the region of morphing artifacts, and outperforms the existing deep learning-based blind face morphing detection frameworks.
Application and Feasibility Study of Integrated Nursing Information Construction in Nephrology Nursing

With the continuous deepening of medical reforms and the continuous attempts and explorations of various management models, the traditional health care model is undergoing tremendous changes, and patients’ needs for medical institutions are becoming more and more comprehensive. Medical institutions are meeting the needs of providing medical services to patients at the same time. It is even more necessary to change our thinking and enhance the service concept. This article is based on case-based deep learning hospital nursing business process reengineering and the application and feasibility study of integrated nursing information construction in nephrology nursing. This article uses the literature analysis method, the social survey method, and other methods to discuss the construction of integrated nursing information. On the one hand, the content of this article uses the concept of process reengineering to analyze the current development status and existing problems of the hospital care industry and find countermeasures to solve problems. On the other hand, the main research content of this article is the construction of integrated nursing information and its analysis of the application and feasibility of nursing in the nephrology department. At the same time, under the background of the rapid development of the mobile Internet, we will carry out extended thinking on the continuous transformation of the construction of nursing information. According to the survey results, 87.5% of patients in the nephrology department are dissatisfied with the current hospital’s work efficiency, and 85.7% of the nursing staff in the nephrology department are generally satisfied with the information management of the current department. After the implementation of the hospital information integration system, patient satisfaction is as high as 98.2%, and the satisfaction of medical staff reached 94.2%. The construction of integrated nursing information has played a great role in the application of nephrology nursing.
The Sparse Parity Matrix

Previous chapter Next chapter Full AccessProceedings Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)The Sparse Parity MatrixAmin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, and Jean Bernoulli RavelomananaAmin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, and Jean Bernoulli Ravelomananapp.822 - 833Chapter DOI:https://doi.org/10.1137/1.9781611977073.35PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract The last decade witnessed several pivotal results on random inference problems where the aim is to learn a hidden ground truth from indirect randomised observations; much of this research has been guided by statistical physics intuition. Prominent examples include the stochastic block model, low-density parity check codes or compressed sensing. In all random inference problems studied so far the posterior distribution of the ground truth given the observations appears to enjoy a key property called “strong replica symmetry”. This means that the overlap of the posterior distribution with the ground truth (basically the number of bits that can be learned correctly) concentrates on a deterministic value. Whether this is generally true has been an open question. In this paper we discover an example of an inference problem based on a very simple random matrix over that fails to exhibit strong replica symmetry. Beyond its impact on random inference problems, the random matrix model, reminiscent of the binomial Erdős-Rényi random graph, gives rise to a natural random constraint satisfaction problem related to the intensely studied random k-XORSAT problem. Previous chapter Next chapter RelatedDetails Published:2022eISBN:978-1-61197-707-3 https://doi.org/10.1137/1.9781611977073Book Series Name:ProceedingsBook Code:PRDA22Book Pages:xvii + 3771
Background Preserved and Feature-Oriented Contrast Improvement Using Weighted Cumulative Distribution Function for Digital Mammograms

Digital mammography is an inevitable source for the early detection of breast cancer. The limitations of this imaging modality tend to impede the contrast and brightness of digital mammograms, which may adversely affect the accuracy of breast cancer diagnosis. Many of the existing contrast enhancement methods pose the challenges of over-transformation of background, noise amplification, and lack of details preservation. The proposed technique named Background Preserved and Feature-Oriented Contrast Improvement (BPFO-CI) using Weighted Cumulative Distribution Function (WCF) for digital mammograms aims to solve these limitations of contrast enhancement techniques. The BPFO-CI uses a threshold to control the background-over-transformation, and further, it divides the remaining dynamic gray levels of the foreground into two symmetric regions. The first region is partitioned by its mean gray level, and the second region is partitioned by its median, generating four distinct ranges of gray levels. The algorithm further computes the weighted cumulative distribution function using a local intensity adjustment factor which is the weight of each range that controls over-transformation of each partitioned range of intensities. Finally, the original intensities of the input mammogram are mapped with the computed gray levels. The performance measures of BPFO-CI were recorded as Mean Brightness Error (MBE), Structural SIMilarity index (SSIM), and Peak Signal Noise Ratio (PSNR) by experimenting on 322 mini-MIAS mammograms. The quantitative measures of this proposed technique are confirmed to be better than the existing methods. The qualitative measure, namely human visual perception also endorses its merit.
Textual Data Augmentation for Patient Outcomes Prediction

Deep learning models have demonstrated superior performance in various healthcare applications. However, the major limitation of these deep models is usually the lack of high-quality training data due to the private and sensitive nature of this field. In this study, we propose a novel textual data augmentation method to generate artificial clinical notes in patients' Electronic Health Records (EHRs) that can be used as additional training data for patient outcomes prediction. Essentially, we fine-tune the generative language model GPT-2 to synthesize labeled text with the original training data. More specifically, We propose a teacher-student framework where we first pre-train a teacher model on the original data, and then train a student model on the GPT-augmented data under the guidance of the teacher. We evaluate our method on the most common patient outcome, i.e., the 30-day readmission rate. The experimental results show that deep models can improve their predictive performance with the augmented data, indicating the effectiveness of the proposed architecture.
Few-Shot Decoding of Brain Activation Maps

Few-shot learning addresses problems for which a limited number of training examples are available. So far, the field has been mostly driven by applications in computer vision. Here, we are interested in adapting recently introduced few-shot methods to solve problems dealing with neuroimaging data, a promising application field. To this end, we create a neuroimaging benchmark dataset for few-shot learning and compare multiple learning paradigms, including meta-learning, as well as various backbone networks. Our experiments show that few-shot methods are able to efficiently decode brain signals using few examples, which paves the way for a number of applications in clinical and cognitive neuroscience, such as identifying biomarkers from brain scans or understanding the generalization of brain representations across a wide range of cognitive tasks.