Reviewerly/exHarmony huggingface dataset:
Characterising the correlations of prepare-and-measure quantum networks

Prepare-and-measure (P&M) quantum networks are the basic building blocks of quantum communication and cryptography. These networks crucially rely on non-orthogonal quantum encodings to distribute quantum correlations, thus enabling superior communication rates and information-theoretic security. Here, we present a computational toolbox that is able to efficiently characterise the set of input-output probability distributions for any discrete-variable P&M quantum network, assuming only the inner-product information of the quantum encodings. Our toolbox is thus highly versatile and can be used to analyse a wide range of quantum network protocols, including those that employ infinite-dimensional quantum code states. To demonstrate the feasibility and efficacy of our toolbox, we use it to reveal new results in multipartite quantum distributed computing and quantum cryptography. Taken together, these findings suggest that our method may have implications for quantum network information theory and the development of new quantum technologies.
Saliency detection based on self-adaptive multiple feature fusion for remote sensing images

Saliency detection has been revealed an effective and reliable approach to extract the region of interest (ROI) in remote sensing images. However, most existing saliency detection methods employing multiple saliency cues ignore the intrinsic relationship between different cues and do not distinguish the diverse contributions of different cues to the final saliency map. In this paper, we propose a novel self-adaptively multiple feature fusion model for saliency detection in remote sensing images to take advantage of this relationship to improve the accuracy of ROI extraction. First, we take multiple feature channels, namely colour, intensity, texture and global contrast into consideration to produce primary feature maps. Particularly, we design a novel method based on dual-tree complex wavelet transform for remote sensing images to generate texture feature pyramids. Then, we introduce a novel self-adaptive multiple feature fusion method based on low-rank matrix recovery, in which the significances of feature maps are ranked by the low rank constraint recovery, and subsequently multiple features’ contributions are allocated adaptively to produce the final saliency map. Experimental results demonstrate that our proposal outperforms the state-of-the-art methods.
Open Relation Extraction: Relational Knowledge Transfer from Supervised Data to Unsupervised Data

Open relation extraction (OpenRE) aims to extract relational facts from the open-domain corpus.To this end, it discovers relation patterns between named entities and then clusters those semantically equivalent patterns into a united relation cluster.Most OpenRE methods typically confine themselves to unsupervised paradigms, without taking advantage of existing relational facts in knowledge bases (KBs) and their high-quality labeled instances.To address this issue, we propose Relational Siamese Networks (RSNs) to learn similarity metrics of relations from labeled data of pre-defined relations, and then transfer the relational knowledge to identify novel relations in unlabeled data.Experiment results on two real-world datasets show that our framework can achieve significant improvements as compared with other state-of-the-art methods.Our code is available at https://github.com/thunlp/RSN.
Simultaneous Semantic Segmentation and Outlier Detection in Presence of Domain Shift

Recent success on realistic road driving datasets has increased interest in exploring robust performance in real-world applications. One of the major unsolved problems is to identify image content which can not be reliably recognized with a given inference engine. We therefore study approaches to recover a dense outlier map alongside the primary task with a single forward pass, by relying on shared convolutional features. We consider semantic segmentation as the primary task and perform extensive validation on WildDash val (inliers), LSUN val (outliers), and pasted objects from Pascal VOC 2007 (outliers). We achieve the best validation performance by training to discriminate inliers from pasted ImageNet-1k content, even though ImageNet-1k contains many road-driving pixels, and, at least nominally, fails to account for the full diversity of the visual world. The proposed two-head model performs comparably to the C-way multi-class model trained to predict uniform distribution in outliers, while outperforming several other validated approaches. We evaluate our best two models on the WildDash test dataset and set a new state of the art on the WildDash benchmark.
Neural Execution of Graph Algorithms

Graph Neural Networks (GNNs) are a powerful representational tool for solving problems on graph-structured inputs. In almost all cases so far, however, they have been applied to directly recovering a final solution from raw inputs, without explicit guidance on how to structure their problem-solving. Here, instead, we focus on learning in the space of algorithms: we train several state-of-the-art GNN architectures to imitate individual steps of classical graph algorithms, parallel (breadth-first search, Bellman-Ford) as well as sequential (Prim's algorithm). As graph algorithms usually rely on making discrete decisions within neighbourhoods, we hypothesise that maximisation-based message passing neural networks are best-suited for such objectives, and validate this claim empirically. We also demonstrate how learning in the space of algorithms can yield new opportunities for positive transfer between tasks---showing how learning a shortest-path algorithm can be substantially improved when simultaneously learning a reachability algorithm.
Seeing with the Customer’s Eye: Exploring the Challenges and Opportunities of AR Advertising

This position article on augmented reality (AR) advertising offers a conceptual framework of recent scholarship on the intersection between AR technologies, advertising, and marketing metrics.The framework identifies theory-based building blocks for this domain alongside relevant recent examples.It proposes a conceptual case for contextualization of advertising content through AR technology.Finally, an agenda for future research in AR advertising is specified, incorporating multiple conceptual perspectives and empirical directions.
Analysis of COVID-19 Tracking Tool in India

COVID-19 tracking tools or contact-tracing apps are getting developed at a rapid pace by different governments in their respective countries. This study explores one such tool called Aarogya Setu , developed by the Government of India. It is a mobile application developed under the Health Ministry, as a part of the E-Governance initiative, to track and sensitize the citizens of India in a joint battle against COVID-19 spread. The study aims to understand various useful features of this tool and to present different concepts of data science applied within the application along with its importance in managing the ongoing pandemic. The App uses Bluetooth and GPS technologies to alert a user when they are nearby a COVID-19 infected person. The application uses various Data Science concepts such as Classification, Association Rule Mining, and Clustering to analyze COVID-19 spread in India. The study also shows potential upgradations in the application, which includes usage of Artificial Intelligence and Computer Vision to detect COVID-19 patients. The study would be useful for mobile technology professionals, data science professionals, medical practitioners, health-related frontline workers, public administrators, and government officials.
Blockchain technologies to mitigate COVID-19 challenges: A scoping review

Background: As public health strategists and policymakers explore different approaches to lessen the devastating effects of novel coronavirus disease (COVID-19), blockchain technology has emerged as a resource that can be utilized in numerous ways. Many blockchain technologies have been proposed or implemented during the COVID-19 pandemic; however, to the best of our knowledge, no comprehensive reviews have been conducted to uncover and summarise the main feature of these technologies. Objective: This study aims to explore proposed or implemented blockchain technologies used to mitigate the COVID-19 challenges as reported in the literature. Methods: We conducted a scoping review in line with guidelines of PRISMA Extension for Scoping Reviews (PRISMA-ScR). To identify relevant studies, we searched 11 bibliographic databases (e.g., EMBASE and MEDLINE) and conducted backward and forward reference list checking of the included studies and relevant reviews. The study selection and data extraction were conducted by 2 reviewers independently. Data extracted from the included studies was narratively summarised and described. Results: 19 of 225 retrieved studies met eligibility criteria in this review. The included studies reported 10 used cases of blockchain to mitigate COVID-19 challenges; the most prominent use cases were contact tracing and immunity passports. While the blockchain technology was developed in 10 studies, its use was proposed in the remaining 9 studies. The public blockchain technology was the most commonly utilized type in the included studies. All together, 8 different consensus mechanisms were used in the included studies. Out of 10 studies that identified the used platform, 9 studies used Ethereum to run the blockchain. Solidity was the most prominent programming language used in developing blockchain technology in the included studies. The transaction cost was reported in only 4 of the included studies and varied between USD 10-10 and USD 5. The expected latency and expected scalability were not identified in the included studies. Conclusion: Blockchain technologies are expected to play an integral role in the fight against the COVID-19 pandemic. Many possible applications of blockchain were found in this review; however, most of them are not mature enough to reveal their expected impact in the fight against COVID-19. We encourage governments, health authorities, and policymakers to consider all blockchain applications suggested in the current review to combat COVID-19 challenges. There is a pressing need to empirically examine how effective blockchain technologies are in mitigating COVID-19 challenges. Further studies are required to assess the performance of blockchain technologies' fight against COVID-19 in terms of transaction cost, scalability, and/or latency when using different consensus algorithms, platforms, and access types.
Noninvasive Self-attention for Side Information Fusion in Sequential Recommendation

Sequential recommender systems aim to model users’ evolving interests from their historical behaviors, and hence make customized time-relevant recommendations. Compared with traditional models, deep learning approaches such as CNN and RNN have achieved remarkable advancements in recommendation tasks. Recently, the BERT framework also emerges as a promising method, benefited from its self-attention mechanism in processing sequential data. However, one limitation of the original BERT framework is that it only considers one input source of the natural language tokens. It is still an open question to leverage various types of information under the BERT framework. Nonetheless, it is intuitively appealing to utilize other side information, such as item category or tag, for more comprehensive depictions and better recommendations. In our pilot experiments, we found naive approaches, which directly fuse types of side information into the item embeddings, usually bring very little or even negative effects. Therefore, in this paper, we propose the NOn-inVasive self-Attention mechanism (NOVA) to leverage side information effectively under the BERT framework. NOVA makes use of side information to generate better attention distribution, rather than directly altering the item embeddings, which may cause information overwhelming. We validate the NOVA-BERT model on both public and commercial datasets, and our method can stably outperform the state-of-the-art models with negligible computational overheads.
TIPCB: A simple but effective part-based convolutional baseline for text-based person search

Text-based person search is a sub-task in the field of image retrieval, which aims to retrieve target person images according to a given textual description. The significant feature gap between two modalities makes this task very challenging. Many existing methods attempt to utilize local alignment to address this problem in the fine-grained level. However, most relevant methods introduce additional models or complicated training and evaluation strategies, which are hard to use in realistic scenarios. In order to facilitate the practical application, we propose a simple but effective baseline for text-based person search named TIPCB (i.e., Text-Image Part-based Convolutional Baseline). Firstly, a novel dual-path local alignment network structure is proposed to extract visual and textual local representations, in which images are segmented horizontally and texts are aligned adaptively. Then, we propose a multi-stage cross-modal matching strategy, which eliminates the modality gap from three feature levels, including low level, local level and global level. Extensive experiments are conducted on the widely-used benchmark datasets (CUHK-PEDES and ICFG-PEDES) and verify that our method outperforms all the existing methods. Our code has been released in https://github.com/OrangeYHChen/TIPCB.
A Comparison of AutoML Tools for Machine Learning, Deep Learning and XGBoost

This paper presents a benchmark of supervised Automated Machine Learning (AutoML) tools. Firstly, we analyze the characteristics of eight recent open-source AutoML tools (Auto-Keras, Auto-PyTorch, Auto-Sklearn, AutoGluon, H2O AutoML, rminer, TPOT and TransmogrifAI) and describe twelve popular OpenML datasets that were used in the benchmark (divided into regression, binary and multi-class classification tasks). Then, we perform a comparison study with hundreds of computational experiments based on three scenarios: General Machine Learning (GML), Deep Learning (DL) and XGBoost (XGB). To select the best tool, we used a lexicographic approach, considering first the average prediction score for each task and then the computational effort. The best predictive results were achieved for GML, which were further compared with the best OpenML public results. Overall, the best GML AutoML tools obtained competitive results, outperforming the best OpenML models in five datasets. These results confirm the potential of the general-purpose AutoML tools to fully automate the Machine Learning (ML) algorithm selection and tuning.
Maneuvering Target Tracking With Event-Based Mixture Kalman Filter in Mobile Sensor Networks

In this paper, the distributed remote state estimation problem for conditional dynamic linear systems in mobile sensor networks with an event-triggered mechanism is investigated. The distributed mixture Kalman filtering method is proposed to track the state of the maneuvering target, which uses particle filtering to estimate the nonlinear variables and apply Kalman filtering to estimate the linear variables. An event-based distributed filtering scheme is designed, which is an energy-efficient way to transmit data between sensors and estimators. In addition, by using the mutual information theory, an optimal control problem is formed to control the position of sensors so that the target tracking process can be achieved quickly. Finally, a simulation example about the maneuvering target tracking is provided to corroborate the effectiveness of the filtering method and the control performance for sensors.
Multi-layer intrusion detection system with ExtraTrees feature selection, extreme learning machine ensemble, and softmax aggregation

Abstract Recent advances in intrusion detection systems based on machine learning have indeed outperformed other techniques, but struggle with detecting multiple classes of attacks with high accuracy. We propose a method that works in three stages. First, the ExtraTrees classifier is used to select relevant features for each type of attack individually for each (ELM). Then, an ensemble of ELMs is used to detect each type of attack separately. Finally, the results of all ELMs are combined using a softmax layer to refine the results and increase the accuracy further. The intuition behind our system is that multi-class classification is quite difficult compared to binary classification. So, we divide the multi-class problem into multiple binary classifications. We test our method on the UNSW and KDDcup99 datasets. The results clearly show that our proposed method is able to outperform all the other methods, with a high margin. Our system is able to achieve 98.24% and 99.76% accuracy for multi-class classification on the UNSW and KDDcup99 datasets, respectively. Additionally, we use the weighted extreme learning machine to alleviate the problem of imbalance in classification of attacks, which further boosts performance. Lastly, we implement the ensemble of ELMs in parallel using GPUs to perform intrusion detection in real time.
A critical analysis of self-supervision, or what we can learn from a single image

We look critically at popular self-supervision techniques for learning deep convolutional neural networks without manual labels. We show that three different and representative methods, BiGAN, RotNet and DeepCluster, can learn the first few layers of a convolutional network from a single image as well as using millions of images and manual labels, provided that strong data augmentation is used. However, for deeper layers the gap with manual supervision cannot be closed even if millions of unlabelled images are used for training. We conclude that: (1) the weights of the early layers of deep networks contain limited information about the statistics of natural images, that (2) such low-level statistics can be learned through self-supervision just as well as through strong supervision, and that (3) the low-level statistics can be captured via synthetic transformations instead of using a large image dataset.
Adversarial Attribute-Text Embedding for Person Search With Natural Language Query

The newly emerging task of person search with natural language query aims at retrieving the target pedestrian by a text description of the pedestrian. It is more applicable compared to person search with image/video query, i.e., person re-identification. In this paper, we propose a novel Adversarial Attribute-Text Embedding (AATE) network for person search with text query. In particular, a cross-modal adversarial learning module is proposed to learn discriminative and modality-invariant visual-textual features. It consists of a cross-modal learner and a modality discriminator, playing a min-max game in an adversarial learning way. The former is to improve intra-modality discrimination and inter-modality invariance towards confusing the modality discriminator. The latter is to distinguish the features from different modalities and boost the learning of modality-invariant features. Moreover, a visual attribute graph convolutional network is proposed to learn visual attributes of pedestrians, which possess better descriptiveness, interpretability and robustness compared to pedestrian appearance features. A hierarchical text embedding network, consisting of multi-stacked bidirectional LSTMs and a textual attention block, is developed to extract effective textual features from text descriptions of pedestrians. Extensive experimental results on two challenging benchmarks, have demonstrated the effectiveness of the proposed approach.
A Sampling Theory Perspective of Graph-Based Semi-Supervised Learning

Graph-based methods have been quite successful in solving unsupervised and semi-supervised learning problems, as they provide a means to capture the underlying geometry of the dataset. It is often desirable for the constructed graph to satisfy two properties: first, data points that are similar in the feature space should be strongly connected on the graph, and second, the class label information should vary smoothly with respect to the graph, where smoothness is measured using the spectral properties of the graph Laplacian matrix. Recent works have justified some of these smoothness conditions by showing that they are strongly linked to the semi-supervised smoothness assumption and its variants. In this work, we reinforce this connection by viewing the problem from a graph sampling theoretic perspective, where class indicator functions are treated as bandlimited graph signals (in the eigenvector basis of the graph Laplacian) and label prediction as a bandlimited reconstruction problem. Our approach involves analyzing the bandwidth of class indicator signals generated from statistical data models with separable and nonseparable classes. These models are quite general and mimic the nature of most real-world datasets. Our results show that in the asymptotic limit, the bandwidth of any class indicator is also closely related to the geometry of the dataset. This allows one to theoretically justify the assumption of bandlimitedness of class indicator signals, thereby providing a sampling theoretic interpretation of graph-based semi-supervised classification.
DSAL: Deeply Supervised Active Learning From Strong and Weak Labelers for Biomedical Image Segmentation

Image segmentation is one of the most essential biomedical image processing problems for different imaging modalities, including microscopy and X-ray in the Internet-of-Medical-Things (IoMT) domain. However, annotating biomedical images is knowledge-driven, time-consuming, and labor-intensive, making it difficult to obtain abundant labels with limited costs. Active learning strategies come into ease the burden of human annotation, which queries only a subset of training data for annotation. Despite receiving attention, most of active learning methods still require huge computational costs and utilize unlabeled data inefficiently. They also tend to ignore the intermediate knowledge within networks. In this work, we propose a deep active semi-supervised learning framework, DSAL, combining active learning and semi-supervised learning strategies. In DSAL, a new criterion based on deep supervision mechanism is proposed to select informative samples with high uncertainties and low uncertainties for strong labelers and weak labelers respectively. The internal criterion leverages the disagreement of intermediate features within the deep learning network for active sample selection, which subsequently reduces the computational costs. We use the proposed criteria to select samples for strong and weak labelers to produce oracle labels and pseudo labels simultaneously at each active learning iteration in an ensemble learning manner, which can be examined with IoMT Platform. Extensive experiments on multiple medical image datasets demonstrate the superiority of the proposed method over state-of-the-art active learning methods.
Superpixels extraction by an Intuitionistic fuzzy clustering algorithm

A scheme to develop the image over-segmentation task is introduced in this paper, it considers the pixels of an image as intuitive fuzzy sets and develops an intuitionistic clustering process of them. In this regard, the main contribution is to provide a method for extracting superpixels with greater adherence to the edges of the regions. Experimental tests were developed considering biomedical grayscale and natural color images. The robustness and effectiveness of this proposal was verified by quantitative and qualitative results.