Reviewerly/exHarmony huggingface dataset:
Hadamard-Free Circuits Expose the Structure of the Clifford Group

The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely written in the canonical form $F_1HSF_2$, where $H$ is a layer of Hadamard gates, $S$ is a permutation of qubits, and $F_i$ are parameterized Hadamard-free circuits chosen from suitable subgroups of the Clifford group. Our canonical form provides a one-to-one correspondence between Clifford operators and layered quantum circuits. We report a polynomial-time algorithm for computing the canonical form. We employ this canonical form to generate a random uniformly distributed $n$-qubit Clifford operator in runtime $O(n^2)$. The number of random bits consumed by the algorithm matches the information-theoretic lower bound. A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group. The variants of the canonical form, one with a short Hadamard-free part and one allowing a circuit depth $9n$ implementation of arbitrary Clifford unitaries in the Linear Nearest Neighbor architecture are also discussed. Finally, we study computational quantum advantage where a classical reversible linear circuit can be implemented more efficiently using Clifford gates, and show an explicit example where such an advantage takes place.
Please Turn Your Cameras on: Remote Onboarding of Software Developers During a Pandemic

The COVID-19 pandemic has impacted the way that software development teams onboard new hires. Previously, most software developers worked in physical offices and new hires onboarded to their teams in the physical office, following a standard onboarding process. However, when companies transitioned employees to work from home due to the pandemic, there was little to no time to develop new onboarding procedures. In this paper, we present a survey of 267 new hires at Microsoft that onboarded to software development teams during the pandemic. We explored their remote onboarding process, including the challenges that the new hires encountered and their social connectedness with their teams. We found that most developers onboarded remotely and never had an opportunity to meet their teammates in person. This leads to one of the biggest challenges faced by these new hires, building a strong social connection with their team. We use these results to provide recommendations for onboarding remote hires.
Tracing Conceptions of the Body in HCI: From User to More-Than-Human

This paper traces different conceptions of the body in HCI and identifies a narrative from user to body, body to bodies, and bodies to more-than-human bodies. Firstly, this paper aims to present a broader, updated, survey of work around the body in HCI. The overview shows how bodies are conceptualized as performative, sensing, datafied, intersectional and more-than-human. This paper then diverges from similar surveys of research addressing the body in HCI in that it is more disruptive and offers a critique of these approaches and pointers for where HCI might go next. We end our paper with recommendations drawn from across the different approaches to the body in HCI. In particular, that researchers working with the body have much to gain from the 4th wave HCI approach when designing with and for the body, where our relationships with technologies are understood as entangled and the body is always more-than-human.
Lightspeech: Lightweight and Fast Text to Speech with Neural Architecture Search

Text to speech (TTS) has been broadly used to synthesize natural and intelligible speech in different scenarios. Deploying TTS in various end devices such as mobile phones or embedded devices requires extremely small memory usage and inference latency. While non-autoregressive TTS models such as FastSpeech have achieved significantly faster inference speed than autoregressive models, their model size and inference latency are still large for the deployment in resource constrained devices. In this paper, we propose LightSpeech, which leverages neural architecture search (NAS) to automatically design more lightweight and efficient models based on FastSpeech. We first profile the components of current Fast-Speech model and carefully design a novel search space containing various lightweight and potentially effective architectures. Then NAS is utilized to automatically discover well performing architectures within the search space. Experiments show that the model discovered by our method achieves 15x model compression ratio and 6.5x inference speedup on CPU with on par voice quality. Audio demos are provided at https://speechresearch.github.io/lightspeech.
Class-Incremental Learning for Wireless Device Identification in IoT

Deep learning (DL) has been utilized pervasively in the Internet of Things (IoT). One typical application of DL in IoT is device identification from wireless signals, namely, noncryptographic device identification (NDI). However, learning components in NDI systems have to evolve to adapt to operational variations, such a paradigm is termed as incremental learning (IL). Various IL algorithms have been proposed and many of them require dedicated space to store the increasing amount of historical data, and therefore, they are not suitable for IoT or mobile applications. Besides, conventional IL schemes can not provide satisfying performance when historical data are not available. In this article, we address the IL problem in NDI from a new perspective, first, we provide a new metric to measure the degree of topological maturity of DNN models from the degree of conflict of class-specific fingerprints. We discover that an important cause for performance degradation in IL-enabled NDI is owing to the conflict of devices’ fingerprints. Second, we also show that the conventional IL schemes can lead to low topological maturity of DNN models in NDI systems. Thirdly, we propose a new channel separation-enabled IL (CSIL) scheme without using historical data, in which our strategy can automatically separate devices’ fingerprints in different learning stages and avoid potential conflict. Finally, We evaluated the effectiveness of the proposed framework using real data from automatic-dependent surveillance-broadcast (ADS-B), an application of IoT in aviation. The proposed framework has the potential to be applied to accurate identification of IoT devices in a variety of IoT applications and services. Data and code available at IEEE Dataport (DOI: 10.21227/1bxc-ke87) and <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/pcwhy/CSIL</uri> .
Parallel Tacotron: Non-Autoregressive and Controllable TTS

Although neural end-to-end text-to-speech models can synthesize highly natural speech, there is still room for improvements to its efficiency and naturalness. This paper proposes a non-autoregressive neural text-to-speech model augmented with a variational autoencoder-based residual encoder. This model, called Parallel Tacotron, is highly parallelizable during both training and inference, allowing efficient synthesis on modern parallel hardware. The use of the variational autoencoder relaxes the one-to-many mapping nature of the text-to-speech problem and improves naturalness. To further improve the naturalness, we use lightweight convolutions, which can efficiently capture local contexts, and introduce an iterative spectrogram loss inspired by iterative refinement. Experimental results show that Parallel Tacotron matches a strong autoregressive baseline in subjective evaluations with significantly decreased inference time.
GmFace: An explicit function for face image representation

Establishing mathematical models is a ubiquitous and effective method to understand the objective world. Due to the complex physiological structures and dynamic behaviors, the mathematical representation of the human face is an especially challenging task. In this paper, an explicit function called GmFace is proposed for face image representation in the form of a multi-Gaussian function. The model utilizes the advantages of two-dimensional Gaussian function which provides a symmetric bell surface with a controllable shape. The GmNet is then designed using Gaussian functions as neurons, with parameters that correspond to each of the parameters of GmFace in order to transform the problem of GmFace parameter solving into a network optimization problem of GmNet. Furthermore, using GmFace, several face image transformation operations can be realized mathematically through simple parameter computation. Experimental results demonstrate that GmFace has a superior representation ability for face images compared to convolutional autoencoder (CAE), principal component analysis (PCA) and discrete cosine transform (DCT) method.
Dynamic Aggregation for Heterogeneous Quantization in Federated Learning

Communication is widely known as the primary bottleneck of federated learning, and quantization of local model updates before uploading to the parameter server is an effective solution to reduce the communication overhead. However, prior literature always assumes homogeneous quantization for all clients, while in reality, devices are heterogeneous and support different levels of quantization precision. This heterogeneity of quantization poses a new challenge: fine-quantized model updates are more accurate than coarse-quantized ones, and how to optimally aggregate them at the server is an open problem. In this paper, we propose FedHQ &#x2013; Federated Learning with Heterogeneous Quantization &#x2013; that allocates different aggregation weights to different clients by minimizing the convergence rate upper bound as a function of the heterogeneous quantization errors of all clients, for both strongly convex and non-convex loss functions. To further accelerate the convergence, the instantaneous quantization error is computed and piggybacked when each client uploads the local model update, and the server dynamically calculates the weight accordingly for the current aggregation. Numerical experiment results demonstrate the performance advantages of FedHQ over both vanilla FedAvg with standard equal weights and a heuristic aggregation scheme, which assigns weights linearly proportional to the clients&#x2019; quantization precision.
Mining Frequent Patterns from Hypergraph Databases

Hypergraph is a complex data structure capable of expressing associations among any number of data entities. Overcoming the limitations of traditional graphs, hypergraphs are useful to model real-life problems. Frequent pattern mining is one of the most popular problems in data mining with a lot of applications. To the best of our knowledge, there exists no flexible frequent pattern mining framework for hypergraph databases decomposing associations among data entities. In this work, we propose a flexible and complete framework for mining frequent patterns from a collection of hypergraphs. We also develop an algorithm for mining frequent subhypergraphs by introducing a canonical labeling technique for isomorphic subhypergraphs. Experiments conducted on real-life hypergraph databases demonstrate both the efficiency of the algorithm and the effectiveness of the proposed framework.
Improved Mask-CTC for Non-Autoregressive End-to-End ASR

For real-world deployment of automatic speech recognition (ASR), the system is desired to be capable of fast inference while relieving the requirement of computational resources. The recently proposed end-to-end ASR system based on mask-predict with connectionist temporal classification (CTC), Mask-CTC, fulfills this demand by generating tokens in a non-autoregressive fashion. While Mask-CTC achieves remarkably fast inference speed, its recognition performance falls behind that of conventional autoregressive (AR) systems. To boost the performance of Mask-CTC, we first propose to enhance the encoder network architecture by employing a recently proposed architecture called Conformer. Next, we propose new training and decoding methods by introducing auxiliary objective to predict the length of a partial target sequence, which allows the model to delete or insert tokens during inference. Experimental results on different ASR tasks show that the proposed approaches improve Mask-CTC significantly, outperforming a standard CTC model (15.5% → 9.1% WER on WSJ). Moreover, Mask-CTC now achieves competitive results to AR models with no degradation of inference speed (< 0.1 RTF using CPU). We also show a potential application of Mask-CTC to end-to-end speech translation.
Blockchain-based trust management for agricultural green supply: A game theoretic approach

Information and communication technology provides e-agriculture with data storage and data analysis capabilities, among which data collection is mainly achieved through a large number of sensors with limited computing and storage capabilities. Since sensors with low security protection are vulnerable to various attacks in agriculture environment, it is challenging to ensure the correctness of the collected data and secure data processing. Most of the existing works mainly consider how to perform data analysis and secure storage, while ignoring the security of the collection task. In this paper, we propose a green supply chain framework based on non-cooperative game, in which we designed a more scientific game theory model based on the Bayesian formula that combines past experience with the current situation. This model ensures the reliability of the data provided by various sensors. In order to manage the equipment in the system more intelligently and flexibly, we propose a green data supply chain and develop trust management to record the trust values of sensors in the blockchain, which significantly improved the transparency and trust of the system. Finally, we conduct simulations to evaluate the performances.
FastEmit: Low-Latency Streaming ASR with Sequence-Level Emission Regularization

Streaming automatic speech recognition (ASR) aims to emit each hypothesized word as quickly and accurately as possible. However, emitting fast without degrading quality, as measured by word error rate (WER), is highly challenging. Existing approaches including Early and Late Penalties [1] and Constrained Alignments [2], [3] penalize emission delay by manipulating per-token or per-frame probability prediction in sequence transducer models [4]. While being successful in reducing delay, these approaches suffer from significant accuracy regression and also require additional word alignment information from an existing model. In this work, we propose a sequence-level emission regularization method, named FastEmit, that applies latency regularization directly on per-sequence probability in training transducer models, and does not require any alignment. We demonstrate that FastEmit is more suitable to the sequence-level optimization of transducer models [4] for streaming ASR by applying it on various end-to-end streaming ASR networks including RNN-Transducer [5], Transformer-Transducer [6], [7], ConvNet-Transducer [8] and Conformer-Transducer [9]. We achieve 150 ~ 300ms latency reduction with significantly better accuracy over previous techniques on a Voice Search test set. FastEmit also improves streaming ASR accuracy from 4.4%/8.9% to 3.1%/7.5% WER, meanwhile reduces 90th percentile latency from 210ms to only 30ms on LibriSpeech.
Shear-Related Gold Ores in the Wadi Hodein Shear Belt, South Eastern Desert of Egypt: Analysis of Remote Sensing, Field and Structural Data

Space-borne multispectral and radar data were used to comprehensively map geological contacts, lithologies and structural elements controlling gold-bearing quartz veins in the Wadi Hodein area in Egypt. In this study, enhancement algorithms, band combinations, band math (BM), Principal Component Analysis (PCA), decorrelation stretch and mineralogical indices were applied to Landsat-8 OLI, ASTER and ALOS PALSAR following a pre-designed flow chart. Together with the field observations, the results of the image processing techniques were exported to the GIS environment and subsequently fused to generate a potentiality map. The Wadi Hodein shear belt is a ductile shear corridor developed in response to non-coaxial convergence and northward escape tectonics that accompanied the final stages of terrane accretion and cratonization (~680–600 Ma) in the northern part of the Arabian–Nubian Shield. The evolution of this shear belt encompassed a protracted ~E–W shortening and recurrent sinistral transpression as manifested by east-dipping thrusts and high-angle reverse shear zones. Gold-mineralized shear zones cut heterogeneously deformed ophiolites and metavolcaniclastic rocks and attenuate in and around granodioritic intrusions. The gold mineralization event was evidently epigenetic in the metamorphic rocks and was likely attributed to rejuvenated tectonism and circulation of hot fluids during transpressional deformation. The superposition of the NW–SE folds by NNW-trending, kilometer scale tight and reclined folds shaped the overall framework of the Wadi Hodein belt. Shallow NNW- or SSE-plunging mineral and stretching lineations on steeply dipping shear planes depict a considerable simple shear component. The results of image processing complying with field observations and structural analysis suggest that the coincidence of shear zones, hydrothermal alteration and crosscutting dikes in the study area could be considered as a model criterion in exploration for new gold targets.
Augmenting Scientific Papers with Just-in-Time, Position-Sensitive Definitions of Terms and Symbols

Despite the central importance of research papers to scientific progress, they can be difficult to read. Comprehension is often stymied when the information needed to understand a passage resides somewhere else—in another section, or in another paper. In this work, we envision how interfaces can bring definitions of technical terms and symbols to readers when and where they need them most. We introduce ScholarPhi, an augmented reading interface with four novel features: (1) tooltips that surface position-sensitive definitions from elsewhere in a paper, (2) a filter over the paper that “declutters” it to reveal how the term or symbol is used across the paper, (3) automatic equation diagrams that expose multiple definitions in parallel, and (4) an automatically generated glossary of important terms and symbols. A usability study showed that the tool helps researchers of all experience levels read papers. Furthermore, researchers were eager to have ScholarPhi’s definitions available to support their everyday reading.
DBCFace: Towards Pure Convolutional Neural Network Face Detection

Face detection generally requires prior boxes and an extra non-maximum suppression(NMS) post-processing in modern deep learning methods. However, anchor design and anchor matching strategy significantly affect the performance of face detectors, so we have to spend a lot of time on anchor designing for different business scenarios. The other issue is that NMS cannot be easily parallelized and it may become a bottleneck of detection speed. In this paper, we propose a simple yet efficient pure convolutional neural network face detection method, named dual-branch center face detector(DBCFace for short), which solve face detection via a dual branch fully convolutional framework without extra anchor design and NMS. Extensive experiments are conducted on four popular face detection benchmarks, including AFW, PASCAL face, FDDB, and WIDER FACE, demonstrating that our method is comparable with state-of-the-art methods while the speed is faster.
SuperMix: Supervising the Mixing Data Augmentation

This paper presents a supervised mixing augmentation method termed SuperMix, which exploits the salient regions within input images to construct mixed training samples. SuperMix is designed to obtain mixed images rich in visual features and complying with realistic image priors. To enhance the efficiency of the algorithm, we develop a variant of the Newton iterative method, 65× faster than gradient descent on this problem. We validate the effectiveness of SuperMix through extensive evaluations and ablation studies on two tasks of object classification and knowledge distillation. On the classification task, SuperMix provides comparable performance to the advanced augmentation methods, such as AutoAugment and RandAugment. In particular, combining SuperMix with RandAugment achieves 78.2% top-1 accuracy on ImageNet with ResNet50. On the distillation task, solely classifying images mixed using the teacher’s knowledge achieves comparable performance to the state-of-the-art distillation methods. Furthermore, on average, incorporating mixed images into the distillation objective improves the performance by 3.4% and 3.1% on CIFAR-100 and ImageNet, respectively. The code is available at https://github.com/alldbi/SuperMix.
Deep Learning in Latent Space for Video Prediction and Compression

Learning-based video compression has achieved substantial progress during recent years. The most influential approaches adopt deep neural networks (DNNs) to remove spatial and temporal redundancies by finding the appropriate lower-dimensional representations of frames in the video. We propose a novel DNN based framework that predicts and compresses video sequences in the latent vector space. The proposed method first learns the efficient lower-dimensional latent space representation of each video frame and then performs inter-frame prediction in that latent domain. The proposed latent domain compression of individual frames is obtained by a deep autoencoder trained with a generative adversarial network (GAN). To exploit the temporal correlation within the video frame sequence, we employ a convolutional long short-term memory (ConvLSTM) network to predict the latent vector representation of the future frame. We demonstrate our method with two applications; video compression and abnormal event detection that share the identical latent frame prediction network. The proposed method exhibits superior or competitive performance compared to the state-of-the-art algorithms specifically designed for either video compression or anomaly detection. <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup>
Curriculum Meta-Learning for Next POI Recommendation

Next point-of-interest (POI) recommendation is a hot research field where a recent emerging scenario, next POI to search recommendation, has been deployed in many online map services such as Baidu Maps. One of the key issues in this scenario is providing satisfactory recommendation services for cold-start cities with a limited number of user-POI interactions, which requires transferring the knowledge hidden in rich data from many other cities to these cold-start cities. Existing literature either does not consider the city-transfer issue or cannot simultaneously tackle the data sparsity and pattern diversity issues among various users in multiple cities. To address these issues, we explore city-transfer next POI to search recommendation that transfers the knowledge from multiple cities with rich data to cold-start cities with scarce data. We propose a novel Curriculum Hardness Aware Meta-Learning (CHAML) framework, which incorporates hard sample mining and curriculum learning into a meta-learning paradigm. Concretely, the CHAML framework considers both city-level and user-level hardness to enhance the conditional sampling during meta training, and uses an easy-to-hard curriculum for the city-sampling pool to help the meta-learner converge to a better state. Extensive experiments on two real-world map search datasets from Baidu Maps demonstrate the superiority of CHAML framework.