Reviewerly/exHarmony huggingface dataset:
A New Modified Recurrent Extreme Learning with PSO Machine Based on Feature Fusion with CNN Deep Features for Breast Cancer Detection

Breast cancer is a prevalent cause of death, and is the only form of cancer that is common among women worldwide and mammograms-based computer-aided diagnosis (CAD) program that allows early detection, diagnosis and treatment of breast cancer. But the performance of the current CAD systems is still unsatisfactory. Early recognition of lumps will reduce overall breast cancer mortality. This study investigates a method of breast CAD, focused on feature fusion with deep features of the Convolutional Neural Network (CNN). First, present a scheme of mass detection based on CNN deep features and modified clustering of the Extreme Learning Machine (MRELM). It forecasts load through Recurrent Extreme Learning Machine (RELM) and utilizes Artificial Bee Colony (ABC) to optimize weights and biases. Second, a collection of features is constructed that relays deep features, morphological features, texture features, and density features. Third, MRELM classifier is developed to distinguish benign and malignant breast masses using the fused feature set. Extensive studies show the precision and efficacy of the proposed method of mass diagnosis and classification of breast cancer.
MTFH: A Matrix Tri-Factorization Hashing Framework for Efficient Cross-Modal Retrieval

Hashing has recently sparked a great revolution in cross-modal retrieval because of its low storage cost and high query speed. Recent cross-modal hashing methods often learn unified or equal-length hash codes to represent the multi-modal data and make them intuitively comparable. However, such unified or equal-length hash representations could inherently sacrifice their representation scalability because the data from different modalities may not have one-to-one correspondence and could be encoded more efficiently by different hash codes of unequal lengths. To mitigate these problems, this paper exploits a related and relatively unexplored problem: encode the heterogeneous data with varying hash lengths and generalize the cross-modal retrieval in various challenging scenarios. To this end, a generalized and flexible cross-modal hashing framework, termed Matrix Tri-Factorization Hashing (MTFH), is proposed to work seamlessly in various settings including paired or unpaired multi-modal data, and equal or varying hash length encoding scenarios. More specifically, MTFH exploits an efficient objective function to flexibly learn the modality-specific hash codes with different length settings, while synchronously learning two semantic correlation matrices to semantically correlate the different hash representations for heterogeneous data comparable. As a result, the derived hash codes are more semantically meaningful for various challenging cross-modal retrieval tasks. Extensive experiments evaluated on public benchmark datasets highlight the superiority of MTFH under various retrieval scenarios and show its competitive performance with the state-of-the-arts.
Entanglement Swapping with Photons Generated on Demand by a Quantum Dot

Photonic entanglement swapping, the procedure of entangling photons without any direct interaction, is a fundamental test of quantum mechanics and an essential resource to the realization of quantum networks. Probabilistic sources of nonclassical light were used for seminal demonstration of entanglement swapping, but applications in quantum technologies demand push-button operation requiring single quantum emitters. This, however, turned out to be an extraordinary challenge due to the stringent prerequisites on the efficiency and purity of the generation of entangled states. Here we show a proof-of-concept demonstration of all-photonic entanglement swapping with pairs of polarization-entangled photons generated on demand by a GaAs quantum dot without spectral and temporal filtering. Moreover, we develop a theoretical model that quantitatively reproduces the experimental data and provides insights on the critical figures of merit for the performance of the swapping operation. Our theoretical analysis also indicates how to improve state-of-the-art entangled-photon sources to meet the requirements needed for implementation of quantum dots in long-distance quantum communication protocols.
Deep imitation learning for autonomous vehicles based on convolutional neural networks

Providing autonomous systems with an effective quantity and quality of information from a desired task is challenging. In particular, autonomous vehicles, must have a reliable vision of their workspace to robustly accomplish driving functions. Speaking of machine vision, deep learning techniques, and specifically convolutional neural networks, have been proven to be the state of the art technology in the field. As these networks typically involve millions of parameters and elements, designing an optimal architecture for deep learning structures is a difficult task which is globally under investigation by researchers. This study experimentally evaluates the impact of three major architectural properties of convolutional networks, including the number of layers, filters, and filter size on their performance. In this study, several models with different properties are developed, equally trained, and then applied to an autonomous car in a realistic simulation environment. A new ensemble approach is also proposed to calculate and update weights for the models regarding their mean squared error values. Based on design properties, performance results are reported and compared for further investigations. Surprisingly, the number of filters itself does not largely affect the performance efficiency. As a result, proper allocation of filters with different kernel sizes through the layers introduces a considerable improvement in the performance. Achievements of this study will provide the researchers with a clear clue and direction in designing optimal network architectures for deep learning purposes.
Gate-Efficient Simulation of Molecular Eigenstates on a Quantum Computer

A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of coherence is to reduce the number of gates by implementing a gate set that matches the requirements of the specific algorithm of interest directly in hardware. Here, we show that exchange-type gates are a promising choice for simulating molecular eigenstates on near-term quantum devices since these gates preserve the number of excitations in the system. Complementing the theoretical work by Barkoutsos et al. [PRA 98, 022322 (2018)], we report on the experimental implementation of a variational algorithm on a superconducting qubit platform to compute the eigenstate energies of molecular hydrogen. We utilize a parametrically driven tunable coupler to realize exchange-type gates that are configurable in amplitude and phase on two fixed-frequency superconducting qubits. With gate fidelities around 95% we are able to compute the eigenstates within an accuracy of 50 mHartree on average, a limit set by the coherence time of the tunable coupler.
The Long Road to Computational Location Privacy: A Survey

The widespread adoption of continuously connected smartphones and tablets developed the usage of mobile applications, among which many use location to provide geolocated services. These services provide new prospects for users: getting directions to work in the morning, leaving a check-in at a restaurant at noon and checking next day's weather in the evening are possible right from any mobile device embedding a GPS chip. In these location-based applications, the user's location is sent to a server, which uses them to provide contextual and personalized answers. However, nothing prevents the latter from gathering, analyzing and possibly sharing the collected information, which opens the door to many privacy threats. Indeed, mobility data can reveal sensitive information about users, among which one's home, work place or even religious and political preferences. For this reason, many privacy-preserving mechanisms have been proposed these last years to enhance location privacy while using geolocated services. This paper surveys and organizes contributions in this area from classical building blocks to the most recent developments of privacy threats and location privacy-preserving mechanisms. We divide the protection mechanisms between online and offline use cases, and organize them into six categories depending on the nature of their algorithm. Moreover, this paper surveys the evaluation metrics used to assess protection mechanisms in terms of privacy, utility and performance. Finally, open challenges and new directions to address the problem of computational location privacy are pointed out and discussed.
Skeleton-Based Action Recognition With Gated Convolutional Neural Networks

For skeleton-based action recognition, most of the existing works used recurrent neural networks. Using convolutional neural networks (CNNs) is another attractive solution considering their advantages in parallelization, effectiveness in feature learning, and model base sufficiency. Besides these, skeleton data are low-dimensional features. It is natural to arrange a sequence of skeleton features chronologically into an image, which retains the original information. Therefore, we solve the sequence learning problem as an image classification task using CNNs. For better learning ability, we build a classification network with stacked residual blocks and having a special design called linear skip gated connection which can benefit information propagation across multiple residual blocks. When arranging the coordinates of body joints in one frame into a skeleton feature, we systematically investigate the performance of part-based, chain-based, and traversal-based orders. Furthermore, a fully convolutional permutation network is designed to learn an optimized order for data rearrangement. Without any bells and whistles, our proposed model achieves state-of-the-art performance on two challenging benchmark datasets, outperforming existing methods significantly.
Precision-Recall versus Accuracy and the Role of Large Data Sets

Practitioners of data mining and machine learning have long observed that the imbalance of classes in a data set negatively impacts the quality of classifiers trained on that data. Numerous techniques for coping with such imbalances have been proposed, but nearly all lack any theoretical grounding. By contrast, the standard theoretical analysis of machine learning admits no dependence on the imbalance of classes at all. The basic theorems of statistical learning establish the number of examples needed to estimate the accuracy of a classifier as a function of its complexity (VC-dimension) and the confidence desired; the class imbalance does not enter these formulas anywhere. In this work, we consider the measures of classifier performance in terms of precision and recall, a measure that is widely suggested as more appropriate to the classification of imbalanced data. We observe that whenever the precision is moderately large, the worse of the precision and recall is within a small constant factor of the accuracy weighted by the class imbalance. A corollary of this observation is that a larger number of examples is necessary and sufficient to address class imbalance, a finding we also illustrate empirically.
High-Speed Measurement-Device-Independent Quantum Key Distribution with Integrated Silicon Photonics

Measurement-device-independent quantum key distribution (MDI-QKD) removes all detector side channels and enables secure QKD with an untrusted relay. It is suitable for building a star-type quantum access network, where the complicated and expensive measurement devices are placed in the central untrusted relay and each user requires only a low-cost transmitter, such as an integrated photonic chip. Here, we experimentally demonstrate a 1.25 GHz silicon photonic chip-based MDI-QKD system using polarization encoding. The photonic chip transmitters integrate the necessary encoding components for a standard QKD source. We implement random modulations of polarization states and decoy intensities, and demonstrate a finite-key secret rate of 31 bps over 36 dB channel loss (or 180 km standard fiber). This key rate is higher than state-of-the-art MDI-QKD experiments. The results show that silicon photonic chip-based MDI-QKD, benefiting from miniaturization, low-cost manufacture and compatibility with CMOS microelectronics, is a promising solution for future quantum secure networks.
Regional soil organic carbon prediction model based on a discrete wavelet analysis of hyperspectral satellite data

Most studies have the achieved rapid and accurate determination of soil organic carbon (SOC) using laboratory spectroscopy; however, it remains difficult to map the spatial distribution of SOC. To predict and map SOC at a regional scale, we obtained fourteen hyperspectral images from the Gaofen-5 (GF-5) satellite and decomposed and reconstructed the original reflectance (OR) and the first derivative reflectance (FDR) using discrete wavelet transform (DWT) at different scales. At these different scales, as inputs, we selected the 3 optimal bands with the highest weight coefficient using principal component analysis and chose the normalized difference index (NDI), ratio index (RI) and difference index (DI) with the strongest correlation with the SOC content using a contour map method. These inputs were then used to build regional-scale SOC prediction models using random forest (RF), support vector machine (SVM) and back-propagation neural network (BPNN) algorithms. The results indicated that: 1) at a low decomposition scale, DWT can effectively eliminate the noise in satellite hyperspectral data, and the FDR combined with DWT can improve the SOC prediction accuracy significantly; 2) the method of selecting inputs using principal component analysis and a contour map can eliminate the redundancy of hyperspectral data while retaining the physical meaning of the inputs. For the model with the highest prediction accuracy, the inputs were all derived from the wavelength range of SOC variations; 3) the differences in prediction accuracy among the different prediction models are small; and 4) the SOC prediction accuracy using hyperspectral satellite data is greatly improved compared with that of previous SOC prediction studies using multispectral satellite data. This study provides a highly robust and accurate method for predicting and mapping regional SOC contents.
Advancing High Fidelity Identity Swapping for Forgery Detection

In this work, we study various existing benchmarks for deepfake detection researches. In particular, we examine a novel two-stage face swapping algorithm, called FaceShifter, for high fidelity and occlusion aware face swapping. Unlike many existing face swapping works that leverage only limited information from the target image when synthesizing the swapped face, FaceShifter generates the swapped face with high-fidelity by exploiting and integrating the target attributes thoroughly and adaptively. FaceShifter can handle facial occlusions with a second synthesis stage consisting of a Heuristic Error Acknowledging Refinement Network (HEAR-Net), which is trained to recover anomaly regions in a self-supervised way without any manual annotations. Experiments show that existing deepfake detection algorithm performs poorly with FaceShifter, since it achieves advantageous quality over all existing benchmarks. However, our newly developed Face X-Ray method can reliably detect forged images created by FaceShifter.
Span-based Localizing Network for Natural Language Video Localization

Given an untrimmed video and a text query, natural language video localization (NLVL) is to locate a matching span from the video that semantically corresponds to the query.Existing solutions formulate NLVL either as a ranking task and apply multimodal matching architecture, or as a regression task to directly regress the target video span.In this work, we address NLVL task with a span-based QA approach by treating the input video as text passage.We propose a video span localizing network (VSLNet), on top of the standard span-based QA framework, to address NLVL.The proposed VSLNet tackles the differences between NLVL and span-based QA through a simple and yet effective query-guided highlighting (QGH) strategy.The QGH guides VSLNet to search for matching video span within a highlighted region.Through extensive experiments on three benchmark datasets, we show that the proposed VSLNet outperforms the state-of-the-art methods; and adopting span-based QA framework is a promising direction to solve NLVL.
Relation-Aware Collaborative Learning for Unified Aspect-Based Sentiment Analysis

Aspect-based sentiment analysis (ABSA) involves three subtasks, i.e., aspect term extraction, opinion term extraction, and aspect-level sentiment classification.Most existing studies focused on one of these subtasks only.Several recent researches made successful attempts to solve the complete ABSA problem with a unified framework.However, the interactive relations among three subtasks are still underexploited.We argue that such relations encode collaborative signals between different subtasks.For example, when the opinion term is "delicious", the aspect term must be "food" rather than "place".In order to fully exploit these relations, we propose a Relation-Aware Collaborative Learning (RACL) framework which allows the subtasks to work coordinately via the multi-task learning and relation propagation mechanisms in a stacked multi-layer network.Extensive experiments on three real-world datasets demonstrate that RACL significantly outperforms the state-ofthe-art methods for the complete ABSA task.
WildDeepfake

In recent years, the abuse of a face swap technique called deepfake has raised enormous public concerns. So far, a large number of deepfake videos (known as "deepfakes") have been crafted and uploaded to the internet, calling for effective countermeasures. One promising countermeasure against deepfakes is deepfake detection. Several deepfake datasets have been released to support the training and testing of deepfake detectors, such as DeepfakeDetection [1] and FaceForensics++ [23]. While this has greatly advanced deepfake detection, most of the real videos in these datasets are filmed with a few volunteer actors in limited scenes, and the fake videos are crafted by researchers using a few popular deepfake softwares. Detectors developed on these datasets may become less effective against real-world deepfakes on the internet. To better support detection against real-world deepfakes, in this paper, we introduce a new dataset WildDeepfake, which consists of 7,314 face sequences extracted from 707 deepfake videos collected completely from the internet. WildDeepfake is a small dataset that can be used, in addition to existing datasets, to develop and test the effectiveness of deepfake detectors against real-world deepfakes. We conduct a systematic evaluation of a set of baseline detection networks on both existing and our WildDeepfake datasets, and show that WildDeepfake is indeed a more challenging dataset, where the detection performance can decrease drastically. We also propose two (eg. 2D and 3D) Attention-based Deepfake Detection Networks (ADDNets) to leverage the attention masks on real/fake faces for improved detection. We empirically verify the effectiveness of ADDNets on both existing datasets and WildDeepfake. The dataset is available at: https://github.com/deepfakeinthewild/deepfake-in-the-wild.
Anchor-Free Oriented Proposal Generator for Object Detection

Oriented object detection is a practical and challenging task in remote sensing image interpretation. Nowadays, oriented detectors mostly use horizontal boxes as intermedium to derive oriented boxes from them. However, the horizontal boxes are inclined to get small Intersection-over-Unions (IoUs) with ground truths, which may have some undesirable effects, such as introducing redundant noise, mismatching with ground truths, detracting from the robustness of detectors, etc. In this paper, we propose a novel Anchor-free Oriented Proposal Generator (AOPG) that abandons horizontal box-related operations from the network architecture. AOPG first produces coarse oriented boxes by a Coarse Location Module (CLM) in an anchor-free manner and then refines them into high-quality oriented proposals. After AOPG, we apply a Fast R-CNN head to produce the final detection results. Furthermore, the shortage of large-scale datasets is also a hindrance to the development of oriented object detection. To alleviate the data insufficiency, we release a new dataset on the basis of our DIOR dataset and name it DIOR-R. Massive experiments demonstrate the effectiveness of AOPG. Particularly, without bells and whistles, we achieve the accuracy of 64.41%, 75.24% and 96.22% mAP on the DIOR-R, DOTA and HRSC2016 datasets respectively. Code and models are available at https://github.com/jbwang1997/AOPG.
Enhanced CNN for image denoising

Owing to the flexible architectures of deep convolutional neural networks (CNNs) are successfully used for image denoising. However, they suffer from the following drawbacks: (i) deep network architecture is very difficult to train. (ii) Deeper networks face the challenge of performance saturation. In this study, the authors propose a novel method called enhanced convolutional neural denoising network (ECNDNet). Specifically, they use residual learning and batch normalisation techniques to address the problem of training difficulties and accelerate the convergence of the network. In addition, dilated convolutions are used in the proposed network to enlarge the context information and reduce the computational cost. Extensive experiments demonstrate that the ECNDNet outperforms the state-of-the-art methods for image denoising.
Privacy-Preserving Attribute-Based Keyword Search in Shared Multi-owner Setting

Ciphertext-Policy Attribute-Based Keyword Search (CP-ABKS) facilitates search queries and supports fine-grained access control over encrypted data in the cloud. However, prior CP-ABKS schemes were designed to support unshared multi-owner setting, and cannot be directly applied in the shared multi-owner setting (where each record is accredited by a fixed number of data owners), without incurring high computational and storage costs. In addition, due to privacy concerns on access policies, most existing schemes are vulnerable to off-line keyword-guessing attacks if the keyword space is of polynomial size. Furthermore, it is difficult to identify malicious users who leak the secret keys when more than one data user has the same subset of attributes. In this paper, we present a privacy-preserving CP-ABKS system with hidden access policy in Shared Multi-owner setting (basic ABKS-SM system), and demonstrate how it is improved to support malicious user tracing (modified ABKS-SM system). We then prove that the proposed ABKS-SM systems achieve selective security and resist off-line keyword-guessing attack in the generic bilinear group model. We also evaluate their performance using real-world datasets.