Reviewerly/exHarmony huggingface dataset:
The rise of chatbots – new personal assistants in foreign language learning

The creation and training of a smart conversational agent has long been a dream of the human race and a huge challenge for scientists and programmers. Until recently, it was still just a dream. However, state-of-the-art technologies, like deep learning and neural networks, give language teachers a new hope, providing them with smart chatbots able to learn through communication just like humans. Today, the availability of chatbots helps to create a new educational scenario for foreign language learners. It suits well their fast-paced lives, allowing multitasking and making the work of ESL educators a lot easier and a way more effective. In that way chatbots could represent one of the basic components of microlearning.
High-Quality R-CNN Object Detection Using Multi-Path Detection Calibration Network

Object proposals are used in two-stage detectors, such as R-CNN, to generate detection results, including category predictions and refined bounding-boxes. As a result, classification scores are assigned to refined bounding-boxes rather than object proposals. However, this procedure ignores the discrepancy of data distribution between object proposals and refined bounding-boxes. We consider this discrepancy could limit the detection accuracy. Specifically, the foreground/background imbalance on object proposals and inaccurate information from low-IoU proposals could hinder the category prediction. In this paper, we propose a detector called the Multi-Path Detection Calibration Network (PDC-Net) to address this problem. The key idea behind PDC-Net is calibrating detection results from R-CNN by considering the statistical discrepancy between object proposals and refined bounding-boxes. PDC-Net is built on Faster R-CNN. The core component in PDC-Net is the multi-path detection head, in which the base detector (from Faster R-CNN) generates detection results from object proposals and multiple calibration detectors fix incorrect outputs from the base detector using refined bounding-boxes. Experiments reveal that PDC-Net can boost detection results. Our method could reach 83.1% and 43.3% mAP respectively on PASCAL VOC and MSCOCO benchmarks, which is comparable to several state-of-the-art methods.
Guidance for Remote Reporting of Digital Pathology Slides During Periods of Exceptional Service Pressure: An Emergency Response from the UK Royal College of Pathologists

Pathology departments must rise to new staffing challenges caused by the coronavirus disease-19 pandemic and may need to work more flexibly for the foreseeable future. In light of this, many pathologists and departments are considering the merits of remote or home reporting of digital cases. While some individuals have experience of this, little work has been done to determine optimum conditions for home reporting, including technical and training considerations. In this publication produced in response to the pandemic, we provide information regarding risk assessment of home reporting of digital slides, summarize available information on specifications for home reporting computing equipment, and share access to a novel point-of-use quality assurance tool for assessing the suitability of home reporting screens for digital slide diagnosis. We hope this study provides a useful starting point and some practical guidance in a difficult time. This study forms the basis of the guidance issued by the Royal College of Pathologists, available at: https://www.rcpath.org/uploads/assets/626ead77-d7dd-42e1-949988e43dc84c97/RCPath-guidance-for-remote-digital-pathology.pdf.
A novel machine learning technique for computer-aided diagnosis

The primary motivation of this paper is twofold: first, to employ a heuristic optimization algorithm to optimize the dendritic neuron model (DNM) and second, to design a tidy visual classifier for computer-aided diagnosis that can be easily implemented on a hardware system. Considering that the backpropagation (BP) algorithm is sensitive to the initial conditions and can easily fall into local minima, we propose an evolutionary dendritic neuron model (EDNM), which is optimized by the gbest-guided artificial bee colony (GABC) algorithm. The experiments are performed on the Liver Disorders Data Set, the Wisconsin Breast Cancer Data Set, the Haberman’s Survival Data Set, the Diabetic Retinopathy Debrecen Data Set and Hepatitis Data Set, and the effectiveness of our model was rigorously validated in terms of the classification accuracy, the sensitivity, the specificity, the F_measure, Cohen’s Kappa, the area under the receiver operating characteristic curve (AUC), convergence speed and the statistical analysis of the Wilcoxon signed-rank test. Moreover, after training, the EDNM can simplify its neural structure by removing redundant synapses and superfluous dendrites by the neuronal pruning mechanism. Finally, the simplified structural morphology of the EDNM can be replaced by a logic circuit (LC) without sacrificing accuracy. It is worth emphasizing that once implemented by an LC, the model has a significant advantage over other classifiers in terms of speed when handling big data. Consequently, our proposed model can serve as an efficient medical classifier with excellent performance.
Improved SRGAN for Remote Sensing Image Super-Resolution Across Locations and Sensors

Detailed and accurate information on the spatial variation of land cover and land use is a critical component of local ecology and environmental research. For these tasks, high spatial resolution images are required. Considering the trade-off between high spatial and high temporal resolution in remote sensing images, many learning-based models (e.g., Convolutional neural network, sparse coding, Bayesian network) have been established to improve the spatial resolution of coarse images in both the computer vision and remote sensing fields. However, data for training and testing in these learning-based methods are usually limited to a certain location and specific sensor, resulting in the limited ability to generalize the model across locations and sensors. Recently, generative adversarial nets (GANs), a new learning model from the deep learning field, show many advantages for capturing high-dimensional nonlinear features over large samples. In this study, we test whether the GAN method can improve the generalization ability across locations and sensors with some modification to accomplish the idea “training once, apply to everywhere and different sensors” for remote sensing images. This work is based on super-resolution generative adversarial nets (SRGANs), where we modify the loss function and the structure of the network of SRGANs and propose the improved SRGAN (ISRGAN), which makes model training more stable and enhances the generalization ability across locations and sensors. In the experiment, the training and testing data were collected from two sensors (Landsat 8 OLI and Chinese GF 1) from different locations (Guangdong and Xinjiang in China). For the cross-location test, the model was trained in Guangdong with the Chinese GF 1 (8 m) data to be tested with the GF 1 data in Xinjiang. For the cross-sensor test, the same model training in Guangdong with GF 1 was tested in Landsat 8 OLI images in Xinjiang. The proposed method was compared with the neighbor-embedding (NE) method, the sparse representation method (SCSR), and the SRGAN. The peak signal-to-noise ratio (PSNR) and structural similarity (SSIM) were chosen for the quantitive assessment. The results showed that the ISRGAN is superior to the NE (PSNR: 30.999, SSIM: 0.944) and SCSR (PSNR: 29.423, SSIM: 0.876) methods, and the SRGAN (PSNR: 31.378, SSIM: 0.952), with the PSNR = 35.816 and SSIM = 0.988 in the cross-location test. A similar result was seen in the cross-sensor test. The ISRGAN had the best result (PSNR: 38.092, SSIM: 0.988) compared to the NE (PSNR: 35.000, SSIM: 0.982) and SCSR (PSNR: 33.639, SSIM: 0.965) methods, and the SRGAN (PSNR: 32.820, SSIM: 0.949). Meanwhile, we also tested the accuracy improvement for land cover classification before and after super-resolution by the ISRGAN. The results show that the accuracy of land cover classification after super-resolution was significantly improved, in particular, the impervious surface class (the road and buildings with high-resolution texture) improved by 15%.
Is China the world’s blockchain leader? Evidence, evolution and outlook of China’s blockchain research

China wants to embrace blockchain, the technology has triggered a new round of technological innovation and industrial change and has huge potential to enhance sustainable development capabilities in many areas. The purpose of this paper is to explore the global status of China’s blockchain research. This study applies bibliometric analysis to perform statistical and correlation analysis on the blockchain literature from 2013 to 2019 included in the Web of Science (WOS) database and draws the social network with visual analysis technology. The statistical results show that China is the country that publishes the most blockchain papers in the world, leading the global blockchain research. Research institutions and authors from China also dominate global blockchain research. Further, this paper investigates the development process of China’s blockchain research and determines the development stage through a comparative analysis with the United States. More specifically, the paper comprehensively analyzes the current status of China’s blockchain research from three perspectives: the subject area, high-yield institutions and high-yield authors. The results indicate that China’s blockchain research is experiencing rapid growth, and the research scope is constantly expanding, with the research focus gradually shifting to applied research. Finally, this paper summarizes the challenges faced by China’s blockchain research and puts forward corresponding policy recommendations for reference by policy makers.
Online Hybrid CTC/Attention End-to-End Automatic Speech Recognition Architecture

Recently, there has been increasing progress in end-to-end automatic speech recognition (ASR) architecture, which transcribes speech to text without any pre-trained alignments. One popular end-to-end approach is the hybrid Connectionist Temporal Classification (CTC) and attention (CTC/attention) based ASR architecture, which utilizes the advantages of both CTC and attention. The hybrid CTC/attention ASR systems exhibit performance comparable to that of the conventional deep neural network (DNN)/ hidden Markov model (HMM) ASR systems. However, how to deploy hybrid CTC/attention systems for online speech recognition is still a non-trivial problem. This article describes our proposed online hybrid CTC/attention end-to-end ASR architecture, which replaces all the offline components of conventional CTC/attention ASR architecture with their corresponding streaming components. Firstly, we propose stable monotonic chunk-wise attention (sMoChA) to stream the conventional global attention, and further propose monotonic truncated attention (MTA) to simplify sMoChA and solve the training-and-decoding mismatch problem of sMoChA. Secondly, we propose truncated CTC (T-CTC) prefix score to stream CTC prefix score calculation. Thirdly, we design dynamic waiting joint decoding (DWJD) algorithm to dynamically collect the predictions of CTC and attention in an online manner. Finally, we use latency-controlled bidirectional long short-term memory (LC-BLSTM) to stream the widely-used offline bidirectional encoder network. Experiments with LibriSpeech English and HKUST Mandarin tasks demonstrate that, compared with the offline CTC/attention model, our proposed online CTC/attention model improves the real time factor in human-computer interaction services and maintains its performance with moderate degradation. To the best of our knowledge, this is the first work to provide the full-stack online solution for CTC/attention end-to-end ASR architecture.
A Note on Implementation Methodologies of Deep Learning-Based Signal Detection for Conventional MIMO Transmitters

Baek et al. proposed a deep learning-based signal detector for conventional MIMO systems, which is a pioneering work of applying artificial intelligence into wireless communications. Although this work works well under static fading channels, it is worth notable that it fails to work under block-fading channels. In particular, the detection BER under block-fading channels is around 0.5 even in the high regime of SNR. To explain this unexpected result, we provide some simple yet efficient theoretical analysis, which clearly verifies that the proposed detector cannot decouple the phases between the channel parameters and transmitted signals and hence it fails to detect the transmitted signals under block-fading channels. The results in this paper can help understand and improve the detector. In particular, the detector structure should incorporate the channel state information for the application under block-fading channels.
Cooperative Task Assignment of a Heterogeneous Multi-UAV System Using an Adaptive Genetic Algorithm

The cooperative multiple task assignment problem (CMTAP) is an NP-hard combinatorial optimization problem. In this paper, CMTAP is to allocate multiple heterogeneous fixed-wing UAVs to perform a suppression of enemy air defense (SEAD) mission on multiple stationary ground targets. To solve this problem, we study the adaptive genetic algorithm (AGA) under the assumptions of the heterogeneity of UAVs and task coupling constraints. Firstly, the multi-type gene chromosome encoding scheme is designed to generate feasible chromosomes that satisfy the heterogeneity of UAVs and task coupling constraints. Then, AGA introduces the Dubins car model to simulate the UAV path formation and derives the fitness value of each chromosome. In order to comply with the chromosome coding strategy of multi-type genes, we designed the corresponding crossover and mutation operators to generate feasible offspring populations. Especially, the proposed mutation operators with the state-transition scheme enhance the stochastic searching ability of the proposed algorithm. Last but not least, the proposed AGA dynamically adjusts the number of crossover and mutation populations to avoid the subjective selection of simulation parameters. The numerical simulations verify that the proposed AGA has a better optimization ability and convergence effect compared with the random search method, genetic algorithm, ant colony optimization method, and particle search optimization method. Therefore, the effectiveness of the proposed algorithm is proven.
Subway

In many graph-based applications, the graphs tend to grow, imposing a great challenge for GPU-based graph processing. When the graph size exceeds the device memory capacity (i.e., GPU memory oversubscription), the performance of graph processing often degrades dramatically, due to the sheer amount of data transfer between CPU and GPU.
A neural model for text localization, transcription and named entity recognition in full pages

In the last years, the consolidation of deep neural network architectures for information extraction in document images has brought big improvements in the performance of each of the tasks involved in this process, consisting of text localization, transcription, and named entity recognition. However, this process is traditionally performed with separate methods for each task. In this work we propose an end-to-end model that combines a one stage object detection network with branches for the recognition of text and named entities respectively in a way that shared features can be learned simultaneously from the training error of each of the tasks. By doing so the model jointly performs handwritten text detection, transcription, and named entity recognition at page level with a single feed forward step. We exhaustively evaluate our approach on different datasets, discussing its advantages and limitations compared to sequential approaches. The results show that the model is capable of benefiting from shared features by simultaneously solving interdependent tasks.
Deep spatio-spectral Bayesian posterior for hyperspectral image non-i.i.d. noise removal

The noise pollution issue seriously obstructs subsequent interpretation and application of the hyperspectral image (HSI). In this work, differing from most existing HSI denoising methods ideally assumed that noise in different bands denotes independent & identically distributed (i.i.d.), we propose a novel HSI denoising approach focusing on non-i.i.d. noise removal. The presented framework collaboratively models the non-i.i.d. noise embedding within HSI and removals them under a deep spatio-spectral Bayesian posterior (DSSBP) structure. Specifically, the non-i.i.d. noise estimation, distribution and removal procedure are both executed with the model-driven based strategy and data-driven based strategy. Through blending the Bayesian variational posterior and deep convolutional neural network, the proposed method both inherits the reliability of traditional model-driven based methods for HSI noise modeling and the high efficiency of data-driven based methods for parameters learning. Simulated and real experiments in different HSIs and non-i.i.d. noise scenarios testify that the proposed DSSBP approach outperforms other existing methods for non-i.i.d. noise removal, in terms of evaluation indexes and executive efficiency.
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms

We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor's algorithm to compute discrete logarithms in elliptic curve groups. We optimize low-level components such as reversible integer and modular arithmetic through windowing techniques and more adaptive placement of uncomputing steps, and improve over previous quantum circuits for modular inversion by reformulating the binary Euclidean algorithm. Overall, we obtain an affine Weierstrass point addition circuit that has lower depth and uses fewer T gates than previous circuits. While previous work mostly focuses on minimizing the total number of qubits, we present various trade-offs between different cost metrics including the number of qubits, circuit depth and T-gate count. Finally, we provide a full implementation of point addition in the Q# quantum programming language that allows unit tests and automatic quantum resource estimation for all components.
SSR-VFD: Spatial Super-Resolution for Vector Field Data Analysis and Visualization

We present SSR-VFD, a novel deep learning framework that produces coherent spatial super-resolution (SSR) of three-dimensional vector field data (VFD). SSR-VFD is the first work that advocates a machine learning approach to generate high-resolution vector fields from low-resolution ones. The core of SSR-VFD lies in the use of three separate neural nets that take the three components of a low-resolution vector field as input and jointly output a synthesized high-resolution vector field. To capture spatial coherence, we take into account magnitude and angle losses in network optimization. Our method can work in the in situ scenario where VFD are down-sampled at simulation time for storage saving and these reduced VFD are upsampled back to their original resolution during postprocessing. To demonstrate the effectiveness of SSR-VFD, we show quantitative and qualitative results with several vector field data sets of different characteristics and compare our method against volume upscaling using bicubic interpolation, and two solutions based on CNN and GAN, respectively.
A co-optimal coverage path planning method for aerial scanning of complex structures

The utilization of unmanned aerial vehicles (UAVs) in survey and inspection of civil infrastructure has been growing rapidly. However, computationally efficient solvers that find optimal flight paths while ensuring high-quality data acquisition of the complete 3D structure remains a difficult problem. Existing solvers typically prioritize efficient flight paths, or coverage, or reducing computational complexity of the algorithm – but these objectives are not co-optimized holistically. In this work we introduce a co-optimal coverage path planning (CCPP) method that simultaneously co-optimizes the UAV path, the quality of the captured images, and reducing computational complexity of the solver all while adhering to safety and inspection requirements. The result is a highly parallelizable algorithm that produces more efficient paths where quality of the useful image data is improved. The path optimization algorithm utilizes a particle swarm optimization (PSO) framework which iteratively optimizes the coverage paths without needing to discretize the motion space or simplify the sensing models as is done in similar methods. The core of the method consists of a cost function that measures both the quality and efficiency of a coverage inspection path, and a greedy heuristic for the optimization enhancement by aggressively exploring the viewpoints search spaces. To assess the proposed method, a coverage path quality evaluation method is also presented in this research, which can be utilized as the benchmark for assessing other CPP methods for structural inspection purpose. The effectiveness of the proposed method is demonstrated by comparing the quality and efficiency of the proposed approach with the state-of-art through both synthetic and real-world scenes. The experiments show that our method enables significant performance improvement in coverage inspection quality while preserving the path efficiency on different test geometries.
Attribute-Guided Feature Learning for Few-Shot Image Recognition

Few-shot image recognition has become an essential problem in the field of machine learning and image recognition, and has attracted more and more research attention. Typically, most few-shot image recognition methods are trained across tasks. However, these methods are apt to learn an embedding network for discriminative representations of training categories, and thus could not distinguish well for novel categories. To establish connections between training and novel categories, we use attribute-related representations for few-shot image recognition and propose an attribute-guided two-layer learning framework, which is capable of learning general feature representations. Specifically, few-shot image recognition trained over tasks and attribute learning trained over images share the same network in a multi-task learning framework. In this way, few-shot image recognition learns feature representations guided by attributes, and is thus less sensitive to novel categories compared with feature representations only using category supervision. Meanwhile, the multi-layer features associated with attributes are aligned with category learning on multiple levels respectively. Therefore we establish a two-layer learning mechanism guided by attributes to capture more discriminative representations, which are complementary compared with a single-layer learning mechanism. Experimental results on CUB-200, AWA and MiniImageNet datasets demonstrate our method effectively improves the performance.