Reviewerly/exHarmony huggingface dataset:
Randomized benchmarking for qudit Clifford gates

Abstract We introduce unitary-gate randomized benchmarking (URB) for qudit gates by extending single- and multi-qubit URB to single- and multi-qudit gates. Specifically, we develop a qudit URB procedure that exploits unitary 2-designs. Furthermore, we show that our URB procedure is not simply extracted from the multi-qubit case by equating qudit URB to URB of the symmetric multi-qubit subspace. Our qudit URB is elucidated by using pseudocode, which facilitates incorporating into benchmarking applications.
High production rate of single-photon and two-photon Fock states for quantum state engineering

We report the implementation of a high-rate source of single- and two-photon states. By combining the advantages of short pulses and cavities, heralding rates as high as 200 kHz have been obtained for the single photons, as well as 250 Hz for the two-photon states. In this setup, homodyne measurements are conditioned by the heralding of the quantum states thanks to the introduction of a low-loss optical delay line in the heralded states path. This enables the detection of most of the heralded events, and fidelities reaching 68.5% (91% with correction for detection efficiency) and 50.4% (85% with correction) were obtained for the single- and two-photon states, respectively. Such high rates and fidelities in the generation of elementary Fock states may open the path for the production of complex quantum states.
Training Normalizing Flows with the Information Bottleneck for Competitive Generative Classification

The Information Bottleneck (IB) objective uses information theory to formulate a task-performance versus robustness trade-off. It has been successfully applied in the standard discriminative classification setting. We pose the question whether the IB can also be used to train generative likelihood models such as normalizing flows. Since normalizing flows use invertible network architectures (INNs), they are information-preserving by construction. This seems contradictory to the idea of a bottleneck. In this work, firstly, we develop the theory and methodology of IB-INNs, a class of conditional normalizing flows where INNs are trained using the IB objective: Introducing a small amount of {\em controlled} information loss allows for an asymptotically exact formulation of the IB, while keeping the INN's generative capabilities intact. Secondly, we investigate the properties of these models experimentally, specifically used as generative classifiers. This model class offers advantages such as improved uncertainty quantification and out-of-distribution detection, but traditional generative classifier solutions suffer considerably in classification accuracy. We find the trade-off parameter in the IB controls a mix of generative capabilities and accuracy close to standard classifiers. Empirically, our uncertainty estimates in this mixed regime compare favourably to conventional generative and discriminative classifiers.
Deep Directed Information-Based Learning for Privacy-Preserving Smart Meter Data Release

The explosion of data collection has raised serious privacy concerns in users due to the possibility that sharing data may also reveal sensitive information. The main goal of a privacy-preserving mechanism is to prevent a malicious third party from inferring sensitive information while keeping the shared data useful. In this paper, we study this problem in the context of time series data and smart meters (SMs) power consumption measurements in particular. Although Mutual Information (MI) between private and released variables has been used as a common information-theoretic privacy measure, it fails to capture the causal time dependencies present in the power consumption time series data. To overcome this limitation, we introduce the Directed Information (DI) as a more meaningful measure of privacy in the considered setting and propose a novel loss function. The optimization is then performed using an adversarial framework where two Recurrent Neural Networks (RNNs), referred to as the releaser and the adversary, are trained with opposite goals. Our empirical studies on real-world data sets from SMs measurements in the worst-case scenario where an attacker has access to all the training data set used by the releaser, validate the proposed method and show the existing trade-offs between privacy and utility.
X‐person asymmetric interaction in virtual and augmented realities

Abstract This study proposes simple, highly immersive x‐person asymmetric interactions that account for the experience type characteristics of asymmetric virtual environments, jointly experienced by virtual reality (VR) users and augmented reality (AR) users. The first person interactions for VR users are performed through the use of hand gestures, and they define a manipulation process that maps the gestures and object control scheme to provide intuitive interactions with the virtual environment and objects. The third person interaction for AR users is designed to view the overall virtual scene and recognize and judge situations to allow for intuitive communication and interactions among the virtual environment, objects, and users based on a touch interface. The core goal of this process is to provide all users who participate in asymmetric virtual environments with satisfying experiences and presence through individualized experience modes and roles. To this end, an application that uses the x‐person asymmetric interactions was created. Furthermore, a survey experiment is performed to statistically analyze the interactions and verify that they provided users with a satisfactory experience, that is, a satisfactory sense of presence and social presence in each user's situation.
Programming with a read-eval-synth loop

A frequent programming pattern for small tasks, especially expressions, is to repeatedly evaluate the program on an input as its editing progresses. The Read-Eval-Print Loop (REPL) interaction model has been a successful model for this programming pattern. We present the new notion of Read-Eval-Synth Loop (RESL) that extends REPL by providing in-place synthesis on parts of the expression marked by the user. RESL eases programming by synthesizing parts of a required solution. The underlying synthesizer relies on a partial solution from the programmer and a few examples. RESL hinges on bottom-up synthesis with general predicates and sketching, generalizing programming by example. To make RESL practical, we present a formal framework that extends observational equivalence to non-example specifications. We evaluate RESL by conducting a controlled within-subjects user-study on 19 programmers from 8 companies, where programmers are asked to solve a small but challenging set of competitive programming problems. We find that programmers using RESL solve these problems with far less need to edit the code themselves and by browsing documentation far less. In addition, they are less likely to leave a task unfinished and more likely to be correct.
Digging for fold: synthesis-aided API discovery for Haskell

We present Hoogle+, a web-based API discovery tool for Haskell. A Hoogle+ user can specify a programming task using either a type, a set of input-output tests, or both. Given a specification, the tool returns a list of matching programs composed from functions in popular Haskell libraries, and annotated with automatically-generated examples of their behavior. These features of Hoogle+ are powered by three novel techniques. First, to enable efficient type-directed synthesis from tests only, we develop an algorithm that infers likely type specifications from tests . Second, to return high-quality programs even with ambiguous specifications, we develop a technique that automatically eliminates meaningless and repetitive synthesis results . Finally, we show how to extend this elimination technique to automatically generate informative inputs that can be used to demonstrate program behavior to the user. To evaluate the effectiveness of Hoogle+ compared with traditional API search techniques, we perform a user study with 30 participants of varying Haskell proficiency. The study shows that programmers equipped with Hoogle+ generally solve tasks faster and were able to solve 50% more tasks overall.
FiC-RNN: A Multi-FPGA Acceleration Framework for Deep Recurrent Neural Networks

Recurrent neural networks (RNNs) have been proven effective for sequence-based tasks thanks to their capability to process temporal information. In real-world systems, deep RNNs are more widely used to solve complicated tasks such as large-scale speech recognition and machine translation. However, the implementation of deep RNNs on traditional hardware platforms is inefficient due to long-range temporal dependence and irregular computation patterns within RNNs. This inefficiency manifests itself in the proportional increase in the latency of RNN inference with respect to the number of layers of deep RNNs on CPUs and GPUs. Previous work has focused mostly on optimizing and accelerating individual RNN cells. To make deep RNN inference fast and efficient, we propose an accelerator based on a multi-FPGA platform called Flow-in-Cloud (FiC). In this work, we show that the parallelism provided by the multi-FPGA system can be taken advantage of to scale up the inference of deep RNNs, by partitioning a large model onto several FPGAs, so that the latency stays close to constant with respect to increasing number of RNN layers. For single-layer and four-layer RNNs, our implementation achieves 31x and 61x speedup compared with an Intel CPU.
ConvTransformer: A Convolutional Transformer Network for Video Frame Synthesis

Deep Convolutional Neural Networks (CNNs) are powerful models that have achieved excellent performance on difficult computer vision tasks. Although CNNs perform well whenever large labeled training samples are available, they work badly on video frame synthesis due to objects deforming and moving, scene lighting changes, and cameras moving in video sequence. In this paper, we present a novel and general end-to-end architecture, called convolutional Transformer or ConvTransformer, for video frame sequence learning and video frame synthesis. The core ingredient of ConvTransformer is the proposed attention layer, i.e., multi-head convolutional self-attention layer, that learns the sequential dependence of video sequence. ConvTransformer uses an encoder, built upon multi-head convolutional self-attention layer, to encode the sequential dependence between the input frames, and then a decoder decodes the long-term dependence between the target synthesized frames and the input frames. Experiments on video future frame extrapolation task show ConvTransformer to be superior in quality while being more parallelizable to recent approaches built upon convolutional LSTM (ConvLSTM). To the best of our knowledge, this is the first time that ConvTransformer architecture is proposed and applied to video frame synthesis.
No-Reference Screen Content Image Quality Assessment With Unsupervised Domain Adaptation

In this paper, we quest the capability of transferring the quality of natural scene images to the images that are not acquired by optical cameras (e.g., screen content images, SCIs), rooted in the widely accepted view that the human visual system has adapted and evolved through the perception of natural environment. Here, we develop the first unsupervised domain adaptation based no reference quality assessment method for SCIs, leveraging rich subjective ratings of the natural images (NIs). In general, it is a non-trivial task to directly transfer the quality prediction model from NIs to a new type of content (i.e., SCIs) that holds dramatically different statistical characteristics. Inspired by the transferability of pair-wise relationship, the proposed quality measure operates based on the philosophy of improving the transferability and discriminability simultaneously. In particular, we introduce three types of losses which complementarily and explicitly regularize the feature space of ranking in a progressive manner. Regarding feature discriminatory capability enhancement, we propose a center based loss to rectify the classifier and improve its prediction capability not only for source domain (NI) but also the target domain (SCI). For feature discrepancy minimization, the maximum mean discrepancy (MMD) is imposed on the extracted ranking features of NIs and SCIs. Furthermore, to further enhance the feature diversity, we introduce the correlation penalization between different feature dimensions, leading to the features with lower rank and higher diversity. Experiments show that our method can achieve higher performance on different source-target settings based on a light-weight convolution neural network. The proposed method also sheds light on learning quality assessment measures for unseen application-specific content without the cumbersome and costing subjective evaluations.
Technologies of tutorial assistance in the visual activity distance education for the bachelors-designers

The article discusses the innovative approaches in the distance form of training the bachelors-designers, the direction of the tutorial assistance vector and the ways of realizing the creative potential of students in visual activity. Emphasis is placed on the innovative approaches and technologies in distant training the bachelors-designers, on the extracurricular activities of the students using telecommunications and information technologies, the tutoring technology as the most acceptable technology and a humane form of pedagogical interaction, creating the conditions for self-development and self-realization of students. The assessment criteria are defined as the products of visual activity in the process of distant training, and the products of art as a result of this activity. The conditions for successful self-realization and harmonization of the students in the visual activity distant training process.
Expectation values from the single-layer quantum approximate optimization algorithm on Ising problems

We report on the energy-expectation-value landscapes produced by the single-layer ($p=1$) Quantum Approximate Optimization Algorithm (QAOA) when being used to solve Ising problems. The landscapes are obtained using an analytical formula that we derive. The formula allows us to predict the landscape for any given Ising problem instance and consequently predict the optimal QAOA parameters for heuristically solving that instance using the single-layer QAOA. We have validated our analytical formula by showing that it accurately reproduces the landscapes published in recent experimental reports. We then applied our methods to address the question: how well is the single-layer QAOA able to solve large benchmark problem instances? We used our analytical formula to calculate the optimal energy-expectation values for benchmark MAX-CUT problems containing up to $7\,000$ vertices and $41\,459$ edges. We also calculated the optimal energy expectations for general Ising problems with up to $100\,000$ vertices and $150\,000$ edges. Our results provide an estimate for how well the single-layer QAOA may work when run on a quantum computer with thousands of qubits. In addition to providing performance estimates when optimal angles are used, we are able to use our analytical results to investigate the difficulties one may encounter when running the QAOA in practice for different classes of Ising instances. We find that depending on the parameters of the Ising Hamiltonian, the expectation-value landscapes can be rather complex, with sharp features that necessitate highly accurate rotation gates in order for the QAOA to be run optimally on quantum hardware. We also present analytical results that explain some of the qualitative landscape features that are observed numerically.
TCM: Temporal Consistency Model for Head Detection in Complex Videos

Head detection in real-world videos is a classical research problem in computer vision. Head detection in videos is challenging than in a single image due to many nuisances that are commonly observed in natural videos, including arbitrary poses, appearances, and scales. Generally, head detection is treated as a particular case of object detection in a single image. However, the performance of object detectors deteriorates in unconstrained videos. In this paper, we propose a temporal consistency model (TCM) to enhance the performance of a generic object detector by integrating spatial-temporal information that exists among subsequent frames of a particular video. Generally, our model takes detection from a generic detector as input and improves mean average precision (mAP) by recovering missed detection and suppressing false positives. We compare and evaluate the proposed framework on four challenging datasets, i.e., HollywoodHeads, Casablanca, BOSS, and PAMELA. Experimental evaluation shows that the performance is improved by employing the proposed TCM model. We demonstrate both qualitatively and quantitatively that our proposed framework obtains significant improvements over other methods.
Combining Machine Learning and Logical Reasoning to Improve Requirements Traceability Recovery

Maintaining traceability links of software systems is a crucial task for software management and development. Unfortunately, dealing with traceability links are typically taken as afterthought due to time pressure. Some studies attempt to use information retrieval-based methods to automate this task, but they only concentrate on calculating the textual similarity between various software artifacts and do not take into account the properties of such artifacts. In this paper, we propose a novel traceability link recovery approach, which comprehensively measures the similarity between use cases and source code by exploring their particular properties. To this end, we leverage and combine machine learning and logical reasoning techniques. On the one hand, our method extracts features by considering the semantics of the use cases and source code, and uses a classification algorithm to train the classifier. On the other hand, we utilize the relationships between artifacts and define a series of rules to recover traceability links. In particular, we not only leverage source code’s structural information, but also take into account the interrelationships between use cases. We have conducted a series of experiments on multiple datasets to evaluate our approach against existing approaches, the results of which show that our approach is substantially better than other methods.
Correlation Graph Convolutional Network for Pedestrian Attribute Recognition

The pedestrian attribute recognition aims at generating the structured description of pedestrian, which plays an important role in surveillance. However, it is difficult to achieve accurate recognition results due to diverse illumination, partial body occlusion and limited resolutions. Therefore, this paper proposes a comprehensive relationship framework for comprehensively describing and utilizing relations among attributes, describing different type of relations in the same dimension, and implementing complex transfers of relations in a GCN manner. This framework is named Correlation Graph Convolutional Network (CGCN). Based on the proposed framework, the feature vectors are built to associate attributes with image features and generate different relation matrices through self-attention among different feature vectors, describing different attribute relations. Then, we conduct multi-layer transfer of attribute relations by means of graph convolution, realizing complex utilization of attribute relations. In addition, the relations among attributes are fully exploited and two types of relations, namely the explicit and implicit relations, are proposed to be integrate into the proposed comprehensive relationship framework. The experimental results on RAP and PETA demonstrate that the recognition performance of the proposed CGCN can obviously outperform the state-of-the-arts, and moreover, the CGCN can achieve a better synergy with different relations.
Knowledge Graph Enhanced Neural Machine Translation via Multi-task Learning on Sub-entity Granularity

Previous studies combining knowledge graph (KG) with neural machine translation (NMT) have two problems: i) Knowledge under-utilization: they only focus on the entities that appear in both KG and training sentence pairs, making much knowledge in KG unable to be fully utilized.ii) Granularity mismatch: the current KG methods utilize the entity as the basic granularity, while NMT utilizes the sub-word as the granularity, making the KG different to be utilized in NMT.To alleviate above problems, we propose a multi-task learning method on sub-entity granularity.Specifically, we first split the entities in KG and sentence pairs into sub-entity granularity by using joint BPE.Then we utilize the multi-task learning to combine the machine translation task and knowledge reasoning task.The extensive experiments on various translation tasks have demonstrated that our method significantly outperforms the baseline models in both translation quality and handling the entities.
The Potential of Artificial Intelligence in Higher Education

Artificial Intelligence (AI) is seeping into many aspects of our everyday lives, with common internet applications, smartphones and even household appliances. Within education, AI is a rapidly emerging field and there is a strong potential for AI to greatly extend and enhance teaching and learning in higher education (Crompton et al., 2020). AI is defined as “computing systems that are able to engage in human-like processes such as learning, adapting, synthesizing, self-correction and use of data for complex processing tasks” (Popenici &amp; Kerr, 2017). In the Horizon Report 2020 report (Brown et al., 2020), AI is listed as one of six technologies with the potential for high impact in higher education. The Horizon Report (2020), is an annual publication that examines the major trends in educational technology that are shaping global higher education. This paper will highlight some of the ways AI is supporting both students and faculty members including bespoke learning, intelligent tutoring systems, facilitating collaboration, and automated grading. This is followed by a section on ethical implications.
The Mediating Effects of Self-Efficacy and Classroom Stress on Professional Development and Student-Centered Instruction

Professional development (PD) has been widely implemented to shift mathematics instruction practices from teacher-centered (traditional practice) to studentcentered.As such, a study examining mediating factors on the relationship between PD and student-centered instruction is of great importance in enhancing the effectiveness of PD and shifting teacher practice.Although studies examining the mediating effects of contextual factors (e.g., administrative support) on the relationship between PD and instruction abound, studies exploring the effects of teachers' psychological factors on this relationship are relatively scarce.In this study, we examined the mediating effects of mathematics teachers' self-efficacy beliefs and classroom stress on the relationship between PD and student-centered instruction.We used a secondary data set collected for the 2015 Trends in International Mathematics and Science Study (TIMSS).For this data set, 317 teachers of eighth-grade mathematics, selected from 150 schools in Korea, were surveyed, and an analysis was conducted using structural equation modeling.Our findings revealed significant mediating effects of self-efficacy beliefs on the relationship between PD and student-centered instruction.However, the mediating effects of classroom stress were not significant.Moreover, we found significantly positive direct effects of PD and self-efficacy on student-centered instruction.