Reviewerly/exHarmony huggingface dataset:
Secure video retrieval using image query on an untrusted cloud

Video retrieval has been widely used in many applications such as video surveillance, object detection. Recently, the security of video retrieval systems has attracted much attention of researchers. However, the most of the previous works focus on secure image search, which usually utilize homomorphic encryption (HE) or order-preserving encryption (OPE) to achieve privacy-preserving. Specially, few works pay attention to secure video retrieval. In this paper, we propose a novel secure video retrieval (SVR, for simplicity) scheme by utilizing comparable encryption with a vector extending mechanism. The distance between images could be presented as range query. Security analysis demonstrate that the proposed scheme can preserve the privacy of data. The experimental results show that the ciphertext search results are consistent with the plaintext form.
Semantic-Aware Occlusion-Robust Network for Occluded Person Re-Identification

In recent years, deep learning-based person re-identification (Re-ID) methods have made significant progress. However, the performance of these methods substantially decreases when dealing with occlusion, which is ubiquitous in realistic scenarios. In this article, we propose a novel semantic-aware occlusion-robust network (SORN) that effectively exploits the intrinsic relationship between the tasks of person Re-ID and semantic segmentation for occluded person Re-ID. Specifically, the SORN is composed of three branches, including a local branch, a global branch, and a semantic branch. In particular, the local branch extracts part-based local features, and the global branch leverages a novel spatial-patch contrastive loss (SPC) to extract occlusion-robust global features. Meanwhile, the semantic branch generates a foreground-background mask for a pedestrian image, which indicates the non-occluded areas of the human body. The three branches are jointly trained in a unified multi-task learning network. Finally, pedestrian matching is performed based on the local features extracted from the non-occluded areas and the global features extracted from the whole pedestrian image. Extensive experimental results on a large-scale occluded person Re-ID dataset (i.e., Occluded-DukeMTMC) and two partial person Re-ID datasets (i.e., Partial-REID and Partial-iLIDS) show the superiority of the proposed method compared with several state-of-the-art methods for occluded and partial person Re-ID. We also demonstrate the effectiveness of the proposed method on two general person Re-ID datasets (i.e., Market-1501 and DukeMTMC-reID).
5G Security Challenges and Opportunities: A System Approach

The digital transformation brought by 5G is redefining current models of end-to-end connectivity and service reliability to include security-by-design principles necessary to enable 5G to achieve its promise. 5G trustworthiness highlights the importance of embedding security capabilities from the very beginning while the 5G architecture is being defined and standardized. Security requirements need to overlay and permeate through the different layers of the 5G systems (physical, network, and application) as well as different parts of an E2E5G architecture within a risk management framework that takes into account the evolving security threats landscape. 5G presents a typical use-case of wireless communication and computer networking convergence, where 5G fundamental building blocks include components such as Software Defined Networks (SDN), Network Functions Virtualization (NFV) and the edge cloud. This convergence extends many of the security challenges and opportunities applicable to SDN/NFV and cloud to 5G networks. Thus, 5G security needs to consider additional security requirements (compared to previous generations) such as SDN controller security, hypervisor security, orchestrator security, cloud security, edge security, etc. At the same time, 5G networks offer security improvement opportunities that should be considered. Here, 5G architectural flexibility, programmability and complexity can be harnessed to improve resilience and reliability.
On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality

In this work, we discuss our successful efforts for industry deployment of a cryptographic secure computation protocol. The problem we consider is privately computing aggregate conversion rate of advertising campaigns. This underlying functionality can be abstracted as Private Intersection-Sum (PI-Sum) with Cardinality. In this setting two parties hold datasets containing user identifiers, and one of the parties additionally has an integer value associated with each of its user identifiers. The parties want to learn the number of identifiers they have in common and the sum of the integer values associated with these users without revealing any more information about their private inputs. We identify the major properties and enabling factors which make the deployment of a cryptographic protocol possible, practical, and uniquely positioned as a solution for the task at hand. We describe our deployment setting and the most relevant efficiency measure, which in our setting is communication overhead rather than computation. We also present a monetary cost model that can be used as a unifying cost measure and the computation model which reflect out use-case: a low-priority batch computing. We present three PI-Sum with cardinality protocols: our currently deployed protocol, which relies on a Diffie-Hellman style double masking, and two new protocols which leverage more recent techniques for private set intersection (PSI) that use Random Oblivious Transfer and encrypted Bloom filters. We compare the later two protocol with our original solution when instantiated with different additively homomorphic encryption schemes. We implement our constructions and compare their costs. We also compare with recent generic approaches for computing on the intersection of two datasets and show that our best protocol has monetary cost that is 20× less than the best known generic approach.
Flexing Muscles in Virtual Reality: Effects of Avatars' Muscular Appearance on Physical Performance

Virtual reality (VR) allows users to embody any possible avatar. Previous work found that the appearance of avatars can change our perception and behavior. Such behavioral changes based on stereotypical assessments are known as the Proteus effect. Exergames involve physical activities of players, however, it is currently unknown if behavioral changes caused by an avatar's appearance can affect players' performance in physically engaging tasks. Therefore, we conducted a study with 30 participants to determine the effect of avatars' muscularity on physical performance and perception of effort. We found that participants in muscular avatars had a lower perceived exertion during an isometric force task. Furthermore, male participants embodying a muscular avatar had a higher grip strength. Results suggest that embodying avatars associated with power and strength can decrease the perception of effort and enhance physical performance. We discuss how body ownership, user identification, and gender moderate avatars' effects.
MLJ: A Julia package for composable machine learning

MLJ (Machine Learing in Julia) is an open source software package providing a common interface for interacting with machine learning models written in Julia and other languages. It provides tools and meta-algorithms for selecting, tuning, evaluating, composing and comparing those models, with a focus on flexible model composition. In this design overview we detail chief novelties of the framework, together with the clear benefits of Julia over the dominant multi-language alternatives.
Variance-Reduced Methods for Machine Learning

Stochastic optimization lies at the heart of machine learning, and its cornerstone is stochastic gradient descent (SGD), a method introduced over 60 years ago. The last eight years have seen an exciting new development: variance reduction for stochastic optimization methods. These variance-reduced (VR) methods excel in settings where more than one pass through the training data is allowed, achieving a faster convergence than SGD in theory and practice. These speedups underline the surge of interest in VR methods and the fast-growing body of work on this topic. This review covers the key principles and main developments behind VR methods for optimization with finite data sets and is aimed at nonexpert readers. We focus mainly on the convex setting and leave pointers to readers interested in extensions for minimizing nonconvex functions.
Worldwide annual optimum tilt angle model for solar collectors and photovoltaic systems in the absence of site meteorological data

This study provides several models for accurately computing the annual optimum tilt angle for fixed solar photovoltaic arrays or solar collectors, in any location of the world. The optimum tilt angle that maximizes the annual energy yield can therefore be easily calculated in the absence of meteorological data and simulation software tools. The proposed models are calculated using global horizontal radiation data collected from 2551 sites across the world. In the process, well-established submodels have been selected to estimate the hourly irradiance on any possible inclined surface, and its corresponding annual energy yield. After selecting the optimum angle for each location, through a regression analysis, a mathematical model that calculates annual optimum angles as a function of latitude has been developed. Furthermore, regression techniques such as neural networks and decision trees have been compared with the polynomial models. Finally, the results are compared to those obtained from high-quality 1-min measured irradiance data obtained at 52 research-class stations from the World Radiation Monitoring Center–Baseline Surface Radiation Network, providing a remarkably high number of validation data points. The results are analyzed, validated, and compared with previous research proposals proving the good performance of the proposed models.
Quantum codes from neural networks

We examine the usefulness of applying neural networks as a variational state ansatz for many-body quantum systems in the context of quantum information-processing tasks. In the neural network state ansatz, the complex amplitude function of a quantum state is computed by a neural network. The resulting multipartite entanglement structure captured by this ansatz has proven rich enough to describe the ground states and unitary dynamics of various physical systems of interest. In the present paper, we initiate the study of neural network states in quantum information-processing tasks. We demonstrate that neural network states are capable of efficiently representing quantum codes for quantum information transmission and quantum error correction, supplying further evidence for the usefulness of neural network states to describe multipartite entanglement. In particular, we show the following main results: a) Neural network states yield quantum codes with a high coherent information for two important quantum channels, the generalized amplitude damping channel and the dephrasure channel. These codes outperform all other known codes for these channels, and cannot be found using a direct parametrization of the quantum state. b) For the depolarizing channel, the neural network state ansatz reliably finds the best known codes given by repetition codes. c) Neural network states can be used to represent absolutely maximally entangled states, a special type of quantum error-correcting codes. In all three cases, the neural network state ansatz provides an efficient and versatile means as a variational parametrization of these highly entangled states.
Knowledge Graph Transfer Network for Few-Shot Recognition

Few-shot learning aims to learn novel categories from very few samples given some base categories with sufficient training samples. The main challenge of this task is the novel categories are prone to dominated by color, texture, shape of the object or background context (namely specificity), which are distinct for the given few training samples but not common for the corresponding categories (see Figure 1). Fortunately, we find that transferring information of the correlated based categories can help learn the novel concepts and thus avoid the novel concept being dominated by the specificity. Besides, incorporating semantic correlations among different categories can effectively regularize this information transfer. In this work, we represent the semantic correlations in the form of structured knowledge graph and integrate this graph into deep neural networks to promote few-shot learning by a novel Knowledge Graph Transfer Network (KGTN). Specifically, by initializing each node with the classifier weight of the corresponding category, a propagation mechanism is learned to adaptively propagate node message through the graph to explore node interaction and transfer classifier information of the base categories to those of the novel ones. Extensive experiments on the ImageNet dataset show significant performance improvement compared with current leading competitors. Furthermore, we construct an ImageNet-6K dataset that covers larger scale categories, i.e, 6,000 categories, and experiments on this dataset further demonstrate the effectiveness of our proposed model.
Calibration of a Cross-Resonance Two-Qubit Gate Between Directly Coupled Transmons

Quantum computation requires the precise control of the evolution of a quantum system, typically through application of discrete quantum logic gates on a set of qubits. Here, we use the cross-resonance interaction to implement a gate between two superconducting transmon qubits with a direct static dispersive coupling. We demonstrate a practical calibration procedure for the optimization of the gate, combining continuous and repeated-gate Hamiltonian tomography with step-wise reduction of dominant two-qubit coherent errors through mapping to microwave control parameters. We show experimentally that this procedure can enable a $\hat{ZX}_{-\pi/2}$ gate with a fidelity $F=97.0(7)\%$, measured with interleaved randomized benchmarking. We show this in a architecture with out-of-plane control and readout that is readily extensible to larger scale quantum circuits.
Stance Detection in Web and Social Media: A Comparative Study

Online forums and social media platforms are increasingly being used to discuss topics of varying polarities where different people take different stances. Several methodologies for automatic stance detection from text have been proposed in literature. To our knowledge, there has not been any systematic investigation towards their reproducibility, and their comparative performances. In this work, we explore the reproducibility of several existing stance detection models, including both neural models and classical classifier-based models. Through experiments on two datasets -- (i)~the popular SemEval microblog dataset, and (ii)~a set of health-related online news articles -- we also perform a detailed comparative analysis of various methods and explore their shortcomings. Implementations of all algorithms discussed in this paper are available at https://github.com/prajwal1210/Stance-Detection-in-Web-and-Social-Media.
Scalable Squeezed-Light Source for Continuous-Variable Quantum Sampling

We propose a novel squeezed light source capable of meeting the stringent requirements of continuous variable quantum sampling. Using the effective $\chi_2$ interaction induced by a strong driving beam in the presence of the $\chi_3$ response in an integrated microresonator, our device is compatible with established nanophotonic fabrication platforms. With typical realistic parameters, squeezed states with a mean photon number of 10 or higher can be generated in a single consistent temporal mode at repetition rates in excess of 100MHz. Over 15dB of squeezing is achievable in existing ultra-low loss platforms.
Reservoir computing with dipole-coupled nanomagnets

The feasibility of reservoir computing based on dipole-coupled nanomagnets is demonstrated using micro-magnetic simulations. The reservoir consists of an 2x10 array of nanomagnets. The static-magnetization directions of the nanomagnets are used as reservoir states. To update these states, we change the magnetization of one nanomagnet according to a single-bit-sequential signal. We also change the uniaxial anisotropy of the other nanomagnets using a voltage-induced magnetic-anisotropy change to enhance information flow, storage, and linear/nonlinear calculations. Binary tasks with AND, OR, and XOR operations were performed to evaluate the performance of the magnetic-array reservoir. The reservoir-computing output matrix was found to be trainable to perform AND, OR, and XOR operations with an input delay of up to three bits.
Action quantum speed limits

We introduce action quantum speed limits (QSLs) as a family of bounds on the minimal time to connect two states that, unlike the usual geometric approach, crucially depend on how the path is traversed, i.e. on the instantaneous speed. The two approaches provide consistent bounds when the instantaneous speed is optimized along a fixed path and we demonstrate this explicitly for the case of a thermalizing qubit employing techniques from optimal control theory. In addition, we critically analyze the interpretation of QSLs based on different choices of metric establishing that, in general, these open system QSL times provide an indication of optimality with respect to the geodesic path, rather than necessarily being indicative of an achievable minimal time.
Sparse Adversarial Attack via Perturbation Factorization

This work studies the sparse adversarial attack, which aims to generate adversarial perturbations onto partial positions of one benign image, such that the perturbed image is incorrectly predicted by one deep neural network (DNN) model. The sparse adversarial attack involves two challenges, i.e., where to perturb, and how to determine the perturbation magnitude. Many existing works determined the perturbed positions manually or heuristically, and then optimized the magnitude using a proper algorithm designed for the dense adversarial attack. In this work, we propose to factorize the perturbation at each pixel to the product of two variables, including the perturbation magnitude and one binary selection factor (i.e., 0 or 1). One pixel is perturbed if its selection factor is 1, otherwise not perturbed. Based on this factorization, we formulate the sparse attack problem as a mixed integer programming (MIP) to jointly optimize the binary selection factors and continuous perturbation magnitudes of all pixels, with a cardinality constraint on selection factors to explicitly control the degree of sparsity. Besides, the perturbation factorization provides the extra flexibility to incorporate other meaningful constraints on selection factors or magnitudes to achieve some desired performance, such as the group-wise sparsity or the enhanced visual imperceptibility. We develop an efficient algorithm by equivalently reformulating the MIP problem as a continuous optimization problem. Extensive experiments demonstrate the superiority of the proposed method over several state-of-the-art sparse attack methods. The implementation of the proposed method is available at https://github.com/wubaoyuan/Sparse-Adversarial-Attack .
Hierarchical Neural Architecture Search for Single Image Super-Resolution

Deep neural networks have exhibited promising performance in image super-resolution (SR). Most SR models follow a hierarchical architecture that contains both the cell-level design of computational blocks and the network-level design of the positions of upsampling blocks. However, designing SR models heavily relies on human expertise and is very labor-intensive. More critically, these SR models often contain a huge number of parameters and may not meet the requirements of computation resources in real-world applications. To address the above issues, we propose a Hierarchical Neural Architecture Search (HNAS) method to automatically design promising architectures with different requirements of computation cost. To this end, we design a hierarchical SR search space and propose a hierarchical controller for architecture search. Such a hierarchical controller is able to simultaneously find promising cell-level blocks and network-level positions of upsampling layers. Moreover, to design compact architectures with promising performance, we build a joint reward by considering both the performance and computation cost to guide the search process. Extensive experiments on five benchmark datasets demonstrate the superiority of our method over existing methods.
An integration-oriented ontology to govern evolution in Big Data ecosystems

Big Data architectures allow to flexibly store and process heterogeneous data, from multiple sources, in their original format. The structure of those data, commonly supplied by means of REST APIs, is continuously evolving. Thus data analysts need to adapt their analytical processes after each API release. This gets more challenging when performing an integrated or historical analysis. To cope with such complexity, in this paper, we present the Big Data Integration ontology, the core construct to govern the data integration process under schema evolution by systematically annotating it with information regarding the schema of the sources. We present a query rewriting algorithm that, using the annotated ontology, converts queries posed over the ontology to queries over the sources. To cope with syntactic evolution in the sources, we present an algorithm that semi-automatically adapts the ontology upon new releases. This guarantees ontology-mediated queries to correctly retrieve data from the most recent schema version as well as correctness in historical queries. A functional and performance evaluation on real-world APIs is performed to validate our approach.
RF Fingerprinting Unmanned Aerial Vehicles With Non-Standard Transmitter Waveforms

The universal availability of unmanned aerial vehicles (UAVs) has resulted in many applications where the same make/model can be deployed by multiple parties. Thus, identifying a specific UAV in a given swarm, in a manner that cannot be spoofed by software methods, becomes important. We propose RF fingerprinting for this purpose, where a neural network learns subtle imperfections present in the transmitted waveform. For UAVs, the constant hovering motion raises a key challenge, which remains a fundamental problem in previous works on RF fingerprinting: Since the wireless channel changes constantly, the network trained with a previously collected dataset performs poorly on the test data. The main contribution of this paper is to address this problem by: (i) proposing a multi-classifier scheme with a two-step score-based aggregation method, (ii) using RF data augmentation to increase neural network robustness to hovering-induced variations, and (iii) extending the multi-classifier scheme for detecting a new UAV, not seen earlier during training. Importantly, our approach permits RF fingerprinting on manufacturer-proprietary waveforms that cannot be decoded or altered by the end-user. Results reveal a near two-fold accuracy in UAV classification through our multi-classifier method over the single-classifier case, with an overall accuracy of 95% when tested with data under unseen channel. Our multi-classifier scheme also improves new UAV detection accuracy to a near perfect 99%, up from 68% for a single neural network approach.