Reviewerly/exHarmony huggingface dataset:
Graph neural networks for multivariate time series regression with application to seismic data

Abstract Machine learning, with its advances in deep learning has shown great potential in analyzing time series. In many scenarios, however, additional information that can potentially improve the predictions is available. This is crucial for data that arise from e. g., sensor networks that contain information about sensor locations. Then, such spatial information can be exploited by modeling it via graph structures, along with the sequential (time series) information. Recent advances in adapting deep learning to graphs have shown potential in various tasks. However, these methods have not been adapted for time series tasks to a great extent. Most attempts have essentially consolidated around time series forecasting with small sequence lengths. Generally, these architectures are not well suited for regression or classification tasks where the value to be predicted is not strictly depending on the most recent values, but rather on the whole length of the time series. We propose TISER-GCN, a novel graph neural network architecture for processing, in particular, these long time series in a multivariate regression task. Our proposed model is tested on two seismic datasets containing earthquake waveforms, where the goal is to predict maximum intensity measurements of ground shaking at each seismic station. Our findings demonstrate promising results of our approach—with an average MSE reduction of 16.3%—compared to the best performing baselines. In addition, our approach matches the baseline scores by needing only half the input size. The results are discussed in depth with an additional ablation study.
Calomplification — the power of generative calorimeter models

Abstract Motivated by the high computational costs of classical simulations, machine-learned generative models can be extremely useful in particle physics and elsewhere. They become especially attractive when surrogate models can efficiently learn the underlying distribution, such that a generated sample outperforms a training sample of limited size. This kind of GANplification has been observed for simple Gaussian models. We show the same effect for a physics simulation, specifically photon showers in an electromagnetic calorimeter.
Multicore Quantum Computing

Any architecture for practical quantum computing must be scalable. An attractive approach is to create multiple cores, computing regions of fixed size that are well-spaced but interlinked with communication channels. This exploded architecture can relax the demands associated with a single monolithic device: the complexity of control, cooling and power infrastructure as well as the difficulties of cross-talk suppression and near-perfect component yield. Here we explore interlinked multicore architectures through analytic and numerical modelling. While elements of our analysis are relevant to diverse platforms, our focus is on semiconductor electron spin systems in which numerous cores may exist on a single chip. We model shuttling and microwave-based interlinks and estimate the achievable fidelities, finding values that are encouraging but markedly inferior to intra-core operations. We therefore introduce optimsed entanglement purification to enable high-fidelity communication, finding that $99.5\%$ is a very realistic goal. We then assess the prospects for quantum advantage using such devices in the NISQ-era and beyond: we simulate recently proposed exponentially-powerful error mitigation schemes in the multicore environment and conclude that these techniques impressively suppress imperfections in both the inter- and intra-core operations.
<i>Colloquium</i> : Cavity-enhanced quantum network nodes

Quantum computing has seen much progress recently, but networks of quantum processors still face substantial challenges. At the same time they have extraordinary promise for both applied and fundamental purposes. This Colloquium explains how optical resonators can be used to achieve the necessary specifications in a variety of systems, bringing global quantum computing networks within reach.
Potential assessment of the TVF-EMD algorithm in forecasting hourly global solar radiation: Review and case studies

Accurate and effective forecasting of short-term global solar radiation is critical for the development of photovoltaic systems, particularly for integration into existing grid systems. However, its non-stationary characteristics caused by climatic factors make its estimation extremely challenging. In this regard, a newly designed learning technique for multi-hour global solar radiation forecasting is proposed based on a time-varying filter-empirical mode decomposition (TVF-EMD), feature selection, and extreme learning machine (ELM) as an essence regression. The proposed hybridization strategy consists of three main steps for understanding the fundamental behavioral aspects of hourly global solar radiation data. The first phase employs the TVF-EMD algorithm to deal with the variability of global solar radiation data by separating it into a series of more stable and constant subseries. Then, the feature selection step is employed to evaluate and identify distinctive features set from the whole decomposed subseries by means of the RReliefF algorithm. The selected feature sets are used to train and optimize our forecasting extreme learning machine model, then the tuned ELM model is used to assess the forecasting accuracy. The proposed TVF-EMD-RF-ELM model is evaluated and validated in different regions in Algeria with various climate conditions. The forecasting findings of the TVF-EMD algorithm demonstrate high accuracy compared to the recent version of empirical mode decomposition CEEMDAN. Overall forecasting periods, the TVF-EMD-RF-ELM model produces an error less than 8.3% in terms of normalized root mean square error nRMSE in all studied regions.
DigiFace-1M: 1 Million Digital Face Images for Face Recognition

State-of-the-art face recognition models show impressive accuracy, achieving over 99.8% on Labeled Faces in the Wild (LFW) dataset. Such models are trained on large-scale datasets that contain millions of real human face images collected from the internet. Web-crawled face images are severely biased (in terms of race, lighting, makeup, etc) and often contain label noise. More importantly, the face images are collected without explicit consent, raising ethical concerns. To avoid such problems, we introduce a large-scale synthetic dataset for face recognition, obtained by rendering digital faces using a computer graphics pipeline <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> . We first demonstrate that aggressive data augmentation can significantly reduce the synthetic-to-real domain gap. Having full control over the rendering pipeline, we also study how each attribute (e.g., variation in facial pose, accessories and textures) affects the accuracy. Compared to Syn-Face, a recent method trained on GAN-generated synthetic faces, we reduce the error rate on LFW by 52.5% (accuracy from 91.93% to 96.17%). By fine-tuning the network on a smaller number of real face images that could reason-ably be obtained with consent, we achieve accuracy that is comparable to the methods trained on millions of real face images.
Quantum advantage in microwave quantum radar

While quantum entanglement can enhance the performance of several technologies such as computing, sensing and cryptography, its widespread use is hindered by its sensitivity to noise and losses. Interestingly, even when entanglement has been destroyed, some tasks still exhibit a quantum advantage $Q$, defined by a $Q$-time speedup, over any classical strategies. A prominent example is the quantum radar, which enhances the detection of the presence of a target in noisy surroundings. To beat all classical strategies, Lloyd proposed to use a probe initially entangled with an idler that can be recombined and measured with the reflected probe. Observing any quantum advantage requires exploiting the quantum correlations between the probe and the idler. It involves their joint measurement or at least adapting the idler detection to the outcome of the probe measurement. In addition to successful demonstrations of such quantum illumination protocols at optical frequencies, the proposal of a microwave radar, closer to conventional radars, gathered a lot of interest. However, previous microwave implementations have not demonstrated any quantum advantage as probe and idler were always measured independently. In this work, we implement a joint measurement using a superconducting circuit and demonstrate a quantum advantage $Q>1$ for microwave radar. Storing the idler mitigates the detrimental impact of microwave loss on the quantum advantage, and the purity of the initial entangled state emerges as the next limit. While the experiment is a proof-of-principle performed inside a dilution refrigerator, it exhibits some of the inherent difficulties in implementing quantum radars such as the limited range of parameters where a quantum advantage can be observed or the requirement for very low probe and idler temperatures.
MaskCLIP: Masked Self-Distillation Advances Contrastive Language-Image Pretraining

This paper presents a simple yet effective framework MaskCLIP, which incorporates a newly proposed masked self-distillation into contrastive language-image pretraining. The core idea of masked self-distillation is to distill representation from a full image to the representation predicted from a masked image. Such incorporation enjoys two vital benefits. First, masked self-distillation targets local patch representation learning, which is complementary to vision-language contrastive focusing on text-related representation. Second, masked self-distillation is also consistent with vision-language contrastive from the perspective of training objective as both utilize the visual encoder for feature aligning, and thus is able to learn local semantics getting indirect supervision from the language. We provide specially designed experiments with a comprehensive analysis to validate the two benefits. Symmetrically, we also introduce the local semantic supervision into the text branch, which further improves the pretraining performance. With extensive experiments, we show that MaskCLIP, when applied to various challenging downstream tasks, achieves superior results in linear probing, finetuning, and zeroshot performance with the guidance of the language encoder. Code will be release at https://github.com/LightDXY/MaskCLIP.
People Are Strange When You're a Stranger: Impact and Influence of Bots on Social Networks

Bots are, for many Web and social media users, the source of many dangerous attacks or the carrier of unwanted messages, such as spam. Nevertheless, crawlers and software agents are a precious tool for analysts, and they are continuously executed to collect data or to test distributed applications. However, no one knows which is the real potential of a bot whose purpose is to control a community, to manipulate consensus, or to influence user behavior. It is commonly believed that the better an agent simulates human behavior in a social network, the more it can succeed to generate an impact in that community. We contribute to shed light on this issue through an online social experiment aimed to study to what extent a bot with no trust, no profile, and no aims to reproduce human behavior, can become popular and influential in a social media. Results show that a basic social probing activity can be used to acquire social relevance on the network and that the so-acquired popularity can be effectively leveraged to drive users in their social connectivity choices. We also register that our bot activity unveiled hidden social polarization patterns in the community and triggered an emotional response of individuals that brings to light subtle privacy hazards perceived by the user base.
Scalable Solutions for Interactive Virtual Humans That Can Manipulate Objects

This paper presents scalable solutions for achieving virtual humans able to manipulate objects in interactive virtual environments. The scalability trades computational time with the ability of addressing increasingly difficult constraints. In time-critical environments, arm motions are computed in few milliseconds using fast analytical Inverse Kinematics. For other types of applications where collision-free motions are required, a randomized motion planner capable of generating motions of average complexity in about a second of computation time is employed. The steps required for defining and computing different types of manipulations are described in this paper.
Automatic Learning of Combat Models for RTS Games

Game tree search algorithms, such as Monte Carlo Tree Search (MCTS), require access to a forward model (or "simulator") of the game at hand. However, in some games such forward model is not readily available. In this paper we address the problem of automatically learning forward models (more specifically, combats models) for two-player attrition games. We report experiments comparing several approaches to learn such combat model from replay data to models generated by hand. We use StarCraft, a Real-Time Strategy (RTS) game, as our application domain. Specifically, we use a large collection of already collected replays, and focus on learning a combat model for tactical combats.
Procedural Generation of Levels for Angry Birds Style Physics Games

This paper presents a procedural generation algorithm for levels in physics-based puzzle games similar to Angry Birds. The proposed algorithm creates levels consisting of various self-contained structures placed throughout a 2D area. Each structure can be placed either on the ground or atop floating platforms within the available level space. These structures are created using a variety of different block types and do not require predefined substructures or composite elements. Target object locations are determined based on a combination of factors, including structural protection, occupancy estimation and overall dispersion. Experiments were performed in order to determine the ideal input parameters for generating desirable levels. The expressivity of the generator was also evaluated and the results show that the proposed method can generate a wide variety of interesting levels.
Mystical Tutor: A Magic: The Gathering Design Assistant via Denoising Sequence-to-Sequence Learning

Procedural Content Generation (PCG) has seen heavy focus on the generation of levels for video games, aesthetic content, and on rule creation, but has seen little use in other domains. Recently, the ready availability of Long Short Term Memory Recurrent Neural Networks (LSTM RNNs) has seen a rise in text based procedural generation, including card designs for Collectible Card Games (CCGs) like Hearthstone or Magic: The Gathering. In this work we present a mixed-initiative design tool, Mystical Tutor, that allows a user to type in a partial specification for a card and receive a full card design. This is achieved by using sequence-to-sequence learning as a denoising sequence autoencoder, allowing Mystical Tutor to learn how to translate from partial specifications to full.
TIMER-Cloud: Time-Sensitive VM Provisioning in Resource-Constrained Clouds

Resource management is a vital factor for better performance in cloud systems and many resource allocation algorithms have been studied. In this work, focusing on applications with timing constraints (i.e., deadlines) running on resource-constrained clouds that have multiple heterogeneous nodes of computing resources (e.g., CPU cores and memory), we propose TIMER-Cloud, a time-sensitive resource allocation and virtual machine (VM) provisioning framework. As a key component of the framework, user requests (of running certain applications) are prioritized according to their deadlines and resource demands (in the form of VM and its operation time). Specifically, in addition to the intuitive Earliest Deadline First (EDF) ordering of requests, we propose three prioritization heuristics: a) one based on the Time-Sensitive Resource Factor (TSRF) that incorporates a request's deadline and usage efficiency of all its resources; b) the Dominant Share (DS) extension of TSRF that emphasizes the most demanded resource of a request aiming at obtaining balanced resource usage among the nodes; and c) a unified k-EDFscheme that integrates the ideas of EDF and TSRF/DS to balance the needs of meeting imminent deadlines of requests and improving resource usage efficiency. Then, for the mapping of the prioritized user requests to the heterogeneous nodes, we propose a novel request-to-node mapping algorithm based on the idea of euclidean Distance that finds the node with the best match of its resource requirements for each request. TIMER-Cloud has been implemented and validated on a cloud testbed powered by OpenStack with a few heterogeneous nodes. The proposed VM provisioning schemes are further evaluated through extensive simulations using the execution data of benchmark applications. The results show that the proposed schemes can outperform the state-of-the-art deadline oblivious scheme by serving up to 12 percent more user requests and achieving up to 8 percent more system rewards for the over-loaded scenario with 140 percent system load.
Inference Attack-Resistant E-Healthcare Cloud System with Fine-Grained Access Control

The e-healthcare cloud system has shown its potential to improve the quality of healthcare and individuals' quality of life. Unfortunately, security and privacy impede its widespread deployment and application. There are several research works focusing on preserving the privacy of the electronic healthcare record (EHR) data. However, these works have two main limitations. First, they only support the `black or white' access control policy. Second, they suffer from the inference attack. In this paper, for the first time, we design an inference attack-resistant e-healthcare cloud system with fine-grained access control. We first propose a two-layer encryption scheme. To ensure an efficient and fine-grained access control over the EHR data, we design the first-layer encryption, where we devise a specialized access policy for each data attribute in the EHR, and encrypt them individually with high efficiency. To preserve the privacy of role attributes and access policies used in the first-layer encryption, we systematically construct the second-layer encryption. To take full advantage of the cloud server, we propose to let the cloud execute computationally intensive works on behalf of the data user without knowing any sensitive information. To preserve the access pattern of data attributes in the EHR, we further construct a blind data retrieving protocol. We also demonstrate that our scheme can be easily extended to support search functionality. Finally, we conduct extensive security analyses and performance evaluations, which confirm the efficacy and efficiency of our schemes.
MemepiC: Towards a Unified In-Memory Big Data Management System

In-memory data management systems have recently gained a lot of attraction due to cheaper and faster DRAM and other hardware advancement. However, these systems are either pure storage systems with online data query service, or just offline batch processing systems with data analytics functionality. Heavy data movement (e.g., data loading) occurs in order to analyze the data. In this paper, we propose an innovative in-memory data management system-MemepiC, which unifies both online data query and data analytics functionality, allowing low-latency storage service and efficient in-situ data analytics. We also explore the emerging RDMA technique in the context of in-memory data management systems, by designing an RDMA-based communication protocol for message delivery inside MemepiC, and proposing to overlap execution and RDMA communication. Extensive experiments are conducted to show the superior performance of MemepiC in terms of both the storage and the data analytics services, compared against other in-memory systems.
αPOMDP: POMDP-based user-adaptive decision-making for social robots

In this work we present αPOMDP: a User-Adaptive Decision-Making technique for social robots. This technique is based on the classical POMDP formulation which we extend with novel aspects inspired by Reward Shaping and Model-Based Reinforcement Learning. Our technique innovates in two main ways: by applying a novel set of rewarding schemes based on the state of the user and by employing a novel execution loop that enables the system to learn the impact of its actions on the user on-the-fly. Our technique has been tested with multiple POMDP solvers and reward formulations in simulations and with real users through the GrowMu social robot. Results show that our technique is able to correctly decide which actions to take, maintaining the user in positive states which interacting with the robot and methodically exploring and learning their characteristics, activities and behaviors.
Phase self-aligned continuous-variable measurement-device-independent quantum key distribution

Continuous-variable measurement-independent-device quantum key distribution (CV-MDI-QKD) can offer high secure key rate at metropolitan distance and remove all side channel loopholes of detection as well. However, there is no in-field experimental demonstration of CV-MDI-QKD due to the remote distance phase-locking techniques challenge. Here, we present a new optical scheme to overcome this difficulty and also removes the requirement of two identical independent lasers. Furthermore, we give an alternate but detailed proof of the minimized key rate condition to extract the secure key rate. We anticipate that our new scheme can be used to demonstrate the in-field CV-MDI-QKD experiment and build the CV-MDI-QKD network with untrusted source.
Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints

Linear functions have gained great attention in the run time analysis of evolutionary computation methods. The corresponding investigations have provided many effective tools for analyzing more complex problems. So far, the runtime analysis of evolutionary algorithms has mainly focused on unconstrained problems, but problems occurring in applications frequently involve constraints. Therefore, there is a strong need to extend the current analyses and used methods for analyzing unconstrained problems to a setting involving constraints. In this paper, we consider the behavior of the classical (1+1) Evolutionary Algorithm on linear functions under linear constraint. We show tight bounds in the case where the constraint is given by the OneMax function and the objective function is given by either the OneMax or the BinVal function. For the general case we present upper and lower bounds.
CBCT image based segmentation method for tooth pulp cavity region extraction

Objectives:A method was proposed to segment the tooth pulp cavity region in cone beam CT) images, which aimed to make the extraction process more efficient and generate more reliable results for further research.