Reviewerly/exHarmony huggingface dataset:
Combinatorial resources auction in decentralized edge-thing systems using blockchain and differential privacy

With the continuous expansion of Internet of Things (IoT) devices, edge computing mode has emerged in recent years to overcome the shortcomings of traditional cloud computing mode, such as high delay, network congestion, and large resource consumption. Thus, edge-thing systems will replace the classic cloud-thing/cloud-edge-thing systems and become mainstream gradually, where IoT devices can offload their tasks to neighboring edge nodes. A common problem is how to utilize edge computing resources. For the sake of fairness, double auction can be used in the edge-thing system to achieve an effective resource allocation and pricing mechanism. Due to the lack of third-party management agencies and mutual distrust between nodes, in our edge-thing systems, we introduce blockchains to prevent malicious nodes from tampering with transaction records and smart contracts to act as an auctioneer to realize resources auction. Since the auction results stored in this blockchain-based system are transparent, they are threatened with inference attacks. Thus in this paper, we design a differentially private combinatorial double auction mechanism by exploring the exponential mechanism such that maximizing the revenue of edge computing platform, in which each IoT device requests a resource bundle and edge nodes compete with each other to provide resources. It can not only guarantee approximate truthfulness and high revenue, but also ensure privacy security. Through necessary theoretical analysis and numerical simulations, the effectiveness of our proposed mechanisms can be validated.
Rethinking Evaluation in ASR: Are Our Models Robust Enough?

Is pushing numbers on a single benchmark valuable in automatic speech recognition? Research results in acoustic modeling are typically evaluated based on performance on a single dataset. While the research community has coalesced around various benchmarks, we set out to understand generalization performance in acoustic modeling across datasets -- in particular, if models trained on a single dataset transfer to other (possibly out-of-domain) datasets. Further, we demonstrate that when a large enough set of benchmarks is used, average word error rate (WER) performance over them provides a good proxy for performance on real-world data. Finally, we show that training a single acoustic model on the most widely-used datasets -- combined -- reaches competitive performance on both research and real-world benchmarks.
Selecting the Suitable Resampling Strategy for Imbalanced Data Classification Regarding Dataset Properties. An Approach Based on Association Models

In many application domains such as medicine, information retrieval, cybersecurity, social media, etc., datasets used for inducing classification models often have an unequal distribution of the instances of each class. This situation, known as imbalanced data classification, causes low predictive performance for the minority class examples. Thus, the prediction model is unreliable although the overall model accuracy can be acceptable. Oversampling and undersampling techniques are well-known strategies to deal with this problem by balancing the number of examples of each class. However, their effectiveness depends on several factors mainly related to data intrinsic characteristics, such as imbalance ratio, dataset size and dimensionality, overlapping between classes or borderline examples. In this work, the impact of these factors is analyzed through a comprehensive comparative study involving 40 datasets from different application areas. The objective is to obtain models for automatic selection of the best resampling strategy for any dataset based on its characteristics. These models allow us to check several factors simultaneously considering a wide range of values since they are induced from very varied datasets that cover a broad spectrum of conditions. This differs from most studies that focus on the individual analysis of the characteristics or cover a small range of values. In addition, the study encompasses both basic and advanced resampling strategies that are evaluated by means of eight different performance metrics, including new measures specifically designed for imbalanced data classification. The general nature of the proposal allows the choice of the most appropriate method regardless of the domain, avoiding the search for special purpose techniques that could be valid for the target data.
A polynomial time and space heuristic algorithm for T-count

This work focuses on reducing the physical cost of implementing quantum algorithms when using the state-of-the-art fault-tolerant quantum error correcting codes, in particular, those for which implementing the T gate consumes vastly more resources than the other gates in the gate set. More specifically, we consider the group of unitaries that can be exactly implemented by a quantum circuit consisting of the Clifford+T gate set, a universal gate set. Our primary interest is to compute a circuit for a given $n$-qubit unitary $U$, using the minimum possible number of T gates (called the T-count of unitary $U$). We consider the problem COUNT-T, the optimization version of which aims to find the T-count of $U$. In its decision version the goal is to decide if the T-count is at most some positive integer $m$. Given an oracle for COUNT-T, we can compute a T-count-optimal circuit in time polynomial in the T-count and dimension of $U$. We give a provable classical algorithm that solves COUNT-T (decision) in time $O\left(N^{2(c-1)\lceil\frac{m}{c}\rceil}\text{poly}(m,N)\right)$ and space $O\left(N^{2\lceil\frac{m}{c}\rceil}\text{poly}(m,N)\right)$, where $N=2^n$ and $c\geq 2$. This gives a space-time trade-off for solving this problem with variants of meet-in-the-middle techniques. We also introduce an asymptotically faster multiplication method that shaves a factor of $N^{0.7457}$ off of the overall complexity. Lastly, beyond our improvements to the rigorous algorithm, we give a heuristic algorithm that outputs a T-count-optimal circuit and has space and time complexity $\text{poly}(m,N)$, under some assumptions. While our heuristic method still scales exponentially with the number of qubits (though with a lower exponent, there is a large improvement by going from exponential to polynomial scaling with $m$.
Quantum semi-supervised generative adversarial network for enhanced data classification

Abstract In this paper, we propose the quantum semi-supervised generative adversarial network (qSGAN). The system is composed of a quantum generator and a classical discriminator/classifier (D/C). The goal is to train both the generator and the D/C, so that the latter may get a high classification accuracy for a given dataset. Hence the qSGAN needs neither any data loading nor to generate a pure quantum state, implying that qSGAN is much easier to implement than many existing quantum algorithms. Also the generator can serve as a stronger adversary than a classical one thanks to its rich expressibility, and it is expected to be robust against noise. These advantages are demonstrated in a numerical simulation.
Retrieving zinc concentrations in topsoil with reflectance spectroscopy at Opencast Coal Mine sites

Abstract Heavy metals contaminations in mining areas aroused wide concerns globally. Efficient evaluation of its pollution status is a basis for further soil reclamation. Visible and near–infrared reflectance (Vis–NIR) spectroscopy has been diffusely used for retrieving heavy metals concentrations. However, the reliability and feasibility of calibrated models were still doubtful. The present study estimated zinc (Zn) concentrations via the random forest (RF) and partial least squares regression (PLSR) using ground in-situ Zn concentrations as well as soil spectral reflectance at an Opencast Coal Mine of Ordos, China in February 2020. The coefficient of determination (R 2 ), root mean square error (RMSE), mean absolute error (MAE), and the ratio of performance to deviation (RPD) were selected to assess the robustness of the methods in estimating Zn contents. Moreover, the characteristic bands were chosen by Pearson correlation analysis and Boruta Algorithm. Finally, the comparison between RF and PLSR combined with eight spectral reflectance transformation methods was conducted for four concentration groups to determine the optimal model. The results indicated that: (1) Zn contents represented a skewed distribution (coefficient of variation (CV) = 33%); (2) the spectral reflectance tended to decrease with the increase of Zn contents during 580–1850 nm based on Savitzky–Golay smoothing (SG); (3) the continuous wavelet transform (CWT) demonstrated higher effectiveness than other spectral reflectance transformation methods in enhancing spectral responses, the R 2 between Zn contents and the soil spectral reflectance achieved the highest (R 2 = 0.71) by using CWT; (4) the RF combined with CWT exhibited the best performance than other methods in the current study (R 2 = 0.97, RPD = 3.39, RMSE = 1.05 mg kg −1 , MAE = 0.79 mg kg −1 ). The current study supplied a scientific scheme and theoretical support for predicting heavy metals concentrations via the Vis–NIR spectral method in possible contaminated areas such as coal mines and metallic mineral deposit areas.
Computationally efficient zero-noise extrapolation for quantum-gate-error mitigation

Zero noise extrapolation (ZNE) is a widely used technique for gate error mitigation on near term quantum computers because it can be implemented in software and does not require knowledge of the quantum computer noise parameters. Traditional ZNE requires a significant resource overhead in terms of quantum operations. A recent proposal using a targeted (or random) instead of fixed identity insertion method (RIIM versus FIIM) requires significantly fewer quantum gates for the same formal precision. We start by showing that RIIM can allow for ZNE to be deployed on deeper circuits than FIIM, but requires many more measurements to maintain the same statistical uncertainty. We develop two extensions to FIIM and RIIM. The List Identity Insertion Method (LIIM) allows to mitigate the error from certain CNOT gates, typically those with the largest error. Set Identity Insertion Method (SIIM) naturally interpolates between the measurement-efficient FIIM and the gate-efficient RIIM, allowing to trade off fewer CNOT gates for more measurements. Finally, we investigate a way to boost the number of measurements, namely to run ZNE in parallel, utilizing as many quantum devices as are available. We explore the performance of RIIM in a parallel setting where there is a non-trivial spread in noise across sets of qubits within or across quantum computers.
The Pedagogical Model of Hybrid Teaching: Difficulties of University Students in the Context of COVID-19

The global pandemic caused by COVID-19 has led to changes in many areas, with educational scenarios being affected. In this sense, university education has undergone significant changes owing to the impossibility of following the fully face-to-face mode of teaching. Given this situation, the general objective of this study is to analyze the university educational scenario in the context of COVID-19 and, more specifically, to identify the difficulties perceived by students. Using a mixed quantitative-qualitative methodological approach, an ad hoc questionnaire was designed, and data were collected from a sample of 238 students of the Bachelor's Degree in Teaching during the 2020/2021 academic year. The results obtained have shown that students have experienced numerous difficulties in adapting to the hybrid teaching model. In this sense, it is worth highlighting the decrease in motivation, the feeling of loneliness, technical connection problems, and less interaction with the teaching staff and other students. The degree of satisfaction with the teaching received is also moderate. As a conclusion, it can be stated that the difficulties identified recommend the introduction of actions to improve the application of the teaching model implemented in favor of university excellence.
Family and School Relationship during COVID-19 Pandemic: A Systematic Review

Education systems worldwide have been affected by a sudden interruption in classroom learning because the coronavirus pandemic forced both the closure of all schools in March 2020 and the beginning of distance learning from home, thus compelling families, schools, and students to work together in a more coordinated fashion. The present systematic review was carried out following PRISMA guidelines. The main objective was to present critical information on the relationship between the family and the school in the face of the imposed distance learning scenario caused by COVID-19. A total of 25 articles dealing with the relationships established during the pandemic of any of the three agents involved (family, students, and school) were analysed. The results showed that the relationships between the three groups involved must be improved to some extent to meet the needs that have arisen as a result of distance learning. In conclusion, the educational scenario during the pandemic has been one of the most significant challenges experienced in the recent history of education.
Domain Adaptation Meets Zero-Shot Learning: An Annotation-Efficient Approach to Multi-Modality Medical Image Segmentation

Due to the lack of properly annotated medical data, exploring the generalization capability of the deep model is becoming a public concern. Zero-shot learning (ZSL) has emerged in recent years to equip the deep model with the ability to recognize unseen classes. However, existing studies mainly focus on natural images, which utilize linguistic models to extract auxiliary information for ZSL. It is impractical to apply the natural image ZSL solutions directly to medical images, since the medical terminology is very domain-specific, and it is not easy to acquire linguistic models for the medical terminology. In this work, we propose a new paradigm of ZSL specifically for medical images utilizing cross-modality information. We make three main contributions with the proposed paradigm. First, we extract the prior knowledge about the segmentation targets, called relation prototypes, from the prior model and then propose a cross-modality adaptation module to inherit the prototypes to the zero-shot model. Second, we propose a relation prototype awareness module to make the zero-shot model aware of information contained in the prototypes. Last but not least, we develop an inheritance attention module to recalibrate the relation prototypes to enhance the inheritance process. The proposed framework is evaluated on two public cross-modality datasets including a cardiac dataset and an abdominal dataset. Extensive experiments show that the proposed framework significantly outperforms the state of the arts.
UAV Obstacle Avoidance Algorithm to Navigate in Dynamic Building Environments

In this work, a real-time collision avoidance algorithm was presented for autonomous navigation in the presence of fixed and moving obstacles in building environments. The current implementation is designed for autonomous navigation between waypoints of a predefined flight trajectory that would be performed by an UAV during tasks such as inspections or construction progress monitoring. It uses a simplified geometry generated from a point cloud of the scenario. In addition, it also employs information from 3D sensors to detect and position obstacles such as people or other UAVs, which are not registered in the original cloud. If an obstacle is detected, the algorithm estimates its motion and computes an evasion path considering the geometry of the environment. The method has been successfully tested in different scenarios, offering robust results in all avoidance maneuvers. Execution times were measured, demonstrating that the algorithm is computationally feasible to be implemented onboard an UAV.
BCNet: A Novel Network for Blood Cell Classification

Aims: Most blood diseases, such as chronic anemia, leukemia (commonly known as blood cancer), and hematopoietic dysfunction, are caused by environmental pollution, substandard decoration materials, radiation exposure, and long-term use certain drugs. Thus, it is imperative to classify the blood cell images. Most cell classification is based on the manual feature, machine learning classifier or the deep convolution network neural model. However, manual feature extraction is a very tedious process, and the results are usually unsatisfactory. On the other hand, the deep convolution neural network is usually composed of massive layers, and each layer has many parameters. Therefore, each deep convolution neural network needs a lot of time to get the results. Another problem is that medical data sets are relatively small, which may lead to overfitting problems. Methods: To address these problems, we propose seven models for the automatic classification of blood cells: BCARENet, BCR5RENet, BCMV2RENet, BCRRNet, BCRENet, BCRSNet, and BCNet. The BCNet model is the best model among the seven proposed models. The backbone model in our method is selected as the ResNet-18, which is pre-trained on the ImageNet set. To improve the performance of the proposed model, we replace the last four layers of the trained transferred ResNet-18 model with the three randomized neural networks (RNNs), which are RVFL, ELM, and SNN. The final outputs of our BCNet are generated by the ensemble of the predictions from the three randomized neural networks by the majority voting. We use four multi-classification indexes for the evaluation of our model. Results: The accuracy, average precision, average F1-score, and average recall are 96.78, 97.07, 96.78, and 96.77%, respectively. Conclusion: We offer the comparison of our model with state-of-the-art methods. The results of the proposed BCNet model are much better than other state-of-the-art methods.
Automatic Morphological Classification of Galaxies: Convolutional Autoencoder and Bagging-based Multiclustering Model

Abstract In order to obtain morphological information of unlabeled galaxies, we present an unsupervised machine-learning (UML) method for morphological classification of galaxies, which can be summarized as two aspects: (1) the methodology of convolutional autoencoder (CAE) is used to reduce the dimensions and extract features from the imaging data; (2) the bagging-based multiclustering model is proposed to obtain the classifications with high confidence at the cost of rejecting the disputed sources that are inconsistently voted. We apply this method on the sample of galaxies with H &lt; 24.5 in CANDELS. Galaxies are clustered into 100 groups, each contains galaxies with analogous characteristics. To explore the robustness of the morphological classifications, we merge 100 groups into five categories by visual verification, including spheroid, early-type disk, late-type disk, irregular, and unclassifiable. After eliminating the unclassifiable category and the sources with inconsistent voting, the purity of the remaining four subclasses are significantly improved. Massive galaxies ( M * &gt; 10 10 M ⊙ ) are selected to investigate the connection with other physical properties. The classification scheme separates galaxies well in the U − V and V − J color space and Gini– M 20 space. The gradual tendency of Sérsic indexes and effective radii is shown from the spheroid subclass to the irregular subclass. It suggests that the combination of CAE and multiclustering strategy is an effective method to cluster galaxies with similar features and can yield high-quality morphological classifications. Our study demonstrates the feasibility of UML in morphological analysis that would develop and serve the future observations made with China Space Station telescope.
Recognition of Handwritten Chinese Text by Segmentation: A Segment-Annotation-Free Approach

Online and offline handwritten Chinese text recognition (HTCR) has been studied for decades. Early methods adopted oversegmentation-based strategies but suffered from low speed, insufficient accuracy, and high cost of character segmentation annotations. Recently, segmentation-free methods based on connectionist temporal classification (CTC) and attention mechanism, have dominated the field of HCTR. However, people actually read text character by character, especially for ideograms such as Chinese. This raises the question: are segmentation-free strategies really the best solution to HCTR? To explore this issue, we propose a new segmentation-based method for recognizing handwritten Chinese text that is implemented using a simple yet efficient fully convolutional network. A novel weakly supervised learning method is proposed to enable the network to be trained using only transcript annotations; thus, the expensive character segmentation annotations required by previous segmentation-based methods can be avoided. Owing to the lack of context modeling in fully convolutional networks, we propose a contextual regularization method to integrate contextual information into the network during the training stage, which can further improve the recognition performance. Extensive experiments conducted on four widely used benchmarks, namely CASIA-HWDB, CASIA-OLHWDB, ICDAR2013, and SCUT-HCCDoc, show that our method significantly surpasses existing methods on both online and offline HCTR, and exhibits a considerably higher inference speed than CTC/attention-based approaches.
A quantum circuit design of AES requiring fewer quantum qubits and gate operations

Advanced Encryption Standard (AES) is one of the most widely used block ciphers nowadays, and has been established as an encryption standard in 2001. Here we design AES-128 and the sample-AES (S-AES) quantum circuits for deciphering. In the quantum circuit of AES-128, we perform an affine transformation for the SubBytes part to solve the problem that the initial state of the output qubits in SubBytes is not the ∣0⟩⊗8 state. After that, we are able to encode the new round sub-key on the qubits encoding the previous round sub-key, and this improvement reduces the number of qubits used by 224 compared with Langenberg et al.’s implementation. For S-AES, a complete quantum circuit is presented with only 48 qubits, which is already within the reach of existing noisy intermediate-scale quantum computers.
An ensemble-based approach for automated medical diagnosis of malaria using EfficientNet

Each year, more than 400,000 people die of malaria. Malaria is a mosquito-borne transmissible infection that affects humans and other animals. According to World Health Organization (WHO), 1.5 billion malaria cases and 7.6 million related deaths have been prevented from 2000 to 2019. Malaria is a disease that can be treated if early detected. We propose a support decision system for detecting malaria from microscopic peripheral blood cells images through convolutional neural networks (CNN). The proposed model is based on EfficientNetB0 architecture. The results are validated with 10-fold stratified cross-validation. This paper presents the classification findings using images from malaria patients and normal patients. The proposed approach is compared and outperforms the related work. Furthermore, the proposed ensemble method shows a recall value of 98.82%, a precision value of 97.74%, an F1-score of 98.28% and a ROC value of 99.76%. This work suggests that EfficientNet is a reliable architecture for automatic medical diagnostics of malaria.The online version contains supplementary material available at 10.1007/s11042-022-12624-6.