Reviewerly/exHarmony huggingface dataset:
BBAM: Bounding Box Attribution Map for Weakly Supervised Semantic and Instance Segmentation

Weakly supervised segmentation methods using bounding box annotations focus on obtaining a pixel-level mask from each box containing an object. Existing methods typically depend on a class-agnostic mask generator, which operates on the low-level information intrinsic to an image. In this work, we utilize higher-level information from the behavior of a trained object detector, by seeking the smallest areas of the image from which the object detector produces almost the same result as it does from the whole image. These areas constitute a bounding-box attribution map (BBAM), which identifies the target object in its bounding box and thus serves as pseudo ground-truth for weakly supervised semantic and instance segmentation. This approach significantly outperforms recent comparable techniques on both the PASCAL VOC and MS COCO benchmarks in weakly supervised semantic and instance segmentation. In addition, we provide a detailed analysis of our method, offering deeper insight into the behavior of the BBAM.
Inferring Which Medical Treatments Work from Reports of Clinical Trials

Eric Lehman, Jay DeYoung, Regina Barzilay, Byron C. Wallace. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 2019.
Learning Open Set Network with Discriminative Reciprocal Points

Open set recognition is an emerging research area that aims to simultaneously classify samples from predefined classes and identify the rest as ‘unknown’. In this process, one of the key challenges is to reduce the risk of generalizing the inherent characteristics of numerous unknown samples learned from a small amount of known data. In this paper, we propose a new concept, Reciprocal Point, which is the potential representation of the extra-class space corresponding to each known category. The sample can be classified to known or unknown by the otherness with reciprocal points. To tackle the open set problem, we offer a novel open space risk regularization term. Based on the bounded space constructed by reciprocal points, the risk of unknown is reduced through multi-category interaction. The novel learning framework called Reciprocal Point Learning (RPL), which can indirectly introduce the unknown information into the learner with only known classes, so as to learn more compact and discriminative representations. Moreover, we further construct a new large-scale challenging aircraft dataset for open set recognition: Aircraft 300 (Air-300). Extensive experiments on multiple benchmark datasets indicate that our framework is significantly superior to other existing approaches and achieves state-of-the-art performance on standard open set benchmarks.
Learning Normal Dynamics in Videos with Meta Prototype Network

Frame reconstruction (current or future frame) based on Auto-Encoder (AE) is a popular method for video anomaly detection. With models trained on the normal data, the reconstruction errors of anomalous scenes are usually much larger than those of normal ones. Previous methods introduced the memory bank into AE, for encoding diverse normal patterns across the training videos. However, they are memory-consuming and cannot cope with unseen new scenarios in the testing data. In this work, we propose a dynamic prototype unit (DPU) to encode the normal dynamics as prototypes in real time, free from extra memory cost. In addition, we introduce meta-learning to our DPU to form a novel few-shot normalcy learner, namely Meta-Prototype Unit (MPU). It enables the fast adaption capability on new scenes by only consuming a few iterations of update. Extensive experiments are conducted on various benchmarks. The superior performance over the state-of-the-art demonstrates the effectiveness of our method. Our code is available at https://github.com/ktr-hubrt/MPN/.
Intraoperative clinical application of augmented reality in neurosurgery: A systematic review

The interest and potential use of augmented reality (AR) in several medical fields since the early 90's has increased consistently. It provides intraoperative guidance for surgical procedures by rendering visible what cannot be seen directly, possibly affecting surgical outcomes. Our objective was to conduct a systematic review of the intraoperative clinical application of augmented reality in neurosurgery, in studies published during the last five years. We carried out an electronic search in the PUBMED database using the terms "Augmented Reality" and "Neurosurgery." After exclusions, 12 published articles that evaluated the utility of intraoperative clinical applications in surgical settings were included in our review. The results evaluated involved AR technique and visualization, time, complications, projection error, and located structures. We can conclude that the neurovascular application is the most frequent type of use for AR in neurosurgery (47.3%), followed by applications in neuro-oncological pathologies (46.7%), and non-vascular and non-neoplasic lesions (5.9%). The use of AR also allows a surgeon to maintain their view on the operative site permanently, and is useful for locating structures, guiding resections, and planning the craniotomy with more precision, decreasing the risk of injury. The intraoperative application of an augmented reality system helps to improve the quality and characteristics of the surgical field image. The injection of 3D images with AR allows for the successful integration of images in vascular, oncological and other lesions without the need of look away from the surgical field, improving safety, surgical experience, or clinical outcome. However, comparative studies are still required to determine its effectiveness.
Low rank representations for quantum simulation of electronic structure

The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for N molecular orbitals, the $\mathcal{O}(N^4)$ gate complexity of performing Hamiltonian and unitary Coupled Cluster Trotter steps makes simulation based on such primitives challenging. We substantially reduce the gate complexity of such primitives through a two-step low-rank factorization of the Hamiltonian and cluster operator, accompanied by truncation of small terms. Using truncations that incur errors below chemical accuracy, we are able to perform Trotter steps of the arbitrary basis electronic structure Hamiltonian with $\mathcal{O}(N^3)$ gate complexity in small simulations, which reduces to $\mathcal{O}(N^2 \log N)$ gate complexity in the asymptotic regime, while our unitary Coupled Cluster Trotter step has $\mathcal{O}(N^3)$ gate complexity as a function of increasing basis size for a given molecule. In the case of the Hamiltonian Trotter step, these circuits have $\mathcal{O}(N^2)$ depth on a linearly connected array, an improvement over the $\mathcal{O}(N^3)$ scaling assuming no truncation. As a practical example, we show that a chemically accurate Hamiltonian Trotter step for a 50 qubit molecular simulation can be carried out in the molecular orbital basis with as few as 4,000 layers of parallel nearest-neighbor two-qubit gates, consisting of fewer than 100,000 non-Clifford rotations. We also apply our algorithm to iron-sulfur clusters relevant for elucidating the mode of action of metalloenzymes.
Blockchain-Based IoT Devices in Supply Chain Management: A Systematic Literature Review

Through recent progress, the forms of modern supply chains have evolved into complex networks. The supply chain management systems face a variety of challenges. These include lack of visibility of the upstream party (Provider) to the downstream party (Client); lack of flexibility in the face of sudden variations in demand and control of operating costs; lack of reliance on safety stakeholders; ineffective management of supply chain risks. Blockchain (BC) is used in the supply chain to overcome the growing demands for items. The Internet of Things (IoT) is a profoundly encouraging innovation that can help companies observe, track, and monitor products, activities, and processes within their respective value chain networks. Research establishments and logical gatherings are ceaselessly attempting to answer IoT gadgets in supply chain management. This paper presents orderly writing on and reviewing of Blockchain-based IoT advances and their current usage. We discuss the smart devices used in this system and which device is the most appropriate in the supply chain. This paper also looks at future examination themes in blockchain-based IoT, referred to as the executive’s framework production network. The essential deliberate writing audit has been consolidated by surveying research articles circulated in highly reputable publications between 2016 and 2021. Lastly, current issues and challenges are present to provide researchers with promising future directions in IoT supply chain management systems.
Self-Tuning Control of Manipulator Positioning Based on Fuzzy PID and PSO Algorithm

With the manipulator performs fixed-point tasks, it becomes adversely affected by external disturbances, parameter variations, and random noise. Therefore, it is essential to improve the robust and accuracy of the controller. In this article, a self-tuning particle swarm optimization (PSO) fuzzy PID positioning controller is designed based on fuzzy PID control. The quantization and scaling factors in the fuzzy PID algorithm are optimized by PSO in order to achieve high robustness and high accuracy of the manipulator. First of all, a mathematical model of the manipulator is developed, and the manipulator positioning controller is designed. A PD control strategy with compensation for gravity is used for the positioning control system. Then, the PID controller parameters dynamically are minute-tuned by the fuzzy controller 1. Through a closed-loop control loop to adjust the magnitude of the quantization factors–proportionality factors online. Correction values are outputted by the modified fuzzy controller 2. A quantization factor–proportion factor online self-tuning strategy is achieved to find the optimal parameters for the controller. Finally, the control performance of the improved controller is verified by the simulation environment. The results show that the transient response speed, tracking accuracy, and follower characteristics of the system are significantly improved.
Adversarial Examples for Hamming Space Search

Due to its strong representation learning ability and its facilitation of joint learning for representation and hash codes, deep learning-to-hash has achieved promising results and is becoming increasingly popular for the large-scale approximate nearest neighbor search. However, recent studies highlight the vulnerability of deep image classifiers to adversarial examples; this also introduces profound security concerns for deep retrieval systems. Accordingly, in order to study the robustness of modern deep hashing models to adversarial perturbations, we propose hash adversary generation (HAG), a novel method of crafting adversarial examples for Hamming space search. The main goal of HAG is to generate imperceptibly perturbed examples as queries, whose nearest neighbors from a targeted hashing model are semantically irrelevant to the original queries. Extensive experiments prove that HAG can successfully craft adversarial examples with small perturbations to mislead targeted hashing models. The transferability of these perturbations under a variety of settings is also verified. Moreover, by combining heterogeneous perturbations, we further provide a simple yet effective method of constructing adversarial examples for black-box attacks.
Cryptanalysis and improvement of medical image encryption using high-speed scrambling and pixel adaptive diffusion

A medical image encryption algorithm using high-speed scrambling and pixel adaptive diffusion was recently proposed by Hua et al. The algorithm mainly consists of random data insertion, high-speed scrambling, and pixel adaptive diffusion. Before performing the scrambling-diffusion process, external random pixels are inserted into the surrounding plain image. Then, high-speed scrambling and pixel adaptive diffusion are respectively used to randomly shuffle adjacent pixels and spread them throughout the cipher image. The authors claim that this scheme can achieve both high efficiency and strong robustness. However, under bad randomness, we have found that the cipher image can be completely recovered by using a chosen plain image attack. To increase resistance against such attacks, we propose an improved encryption scheme that performs nonlinear operations on permuted images using an enhanced version of the original algorithm. Experimental results and security analysis show that our improved encryption algorithm can not only resist chosen plain image attacks but also maintain the merits of the original algorithm.
Distributed Analytics on Sensitive Medical Data: The Personal Health Train

In recent years, as newer technologies have evolved around the healthcare ecosystem, more and more data have been generated. Advanced analytics could power the data collected from numerous sources, both from healthcare institutions, or generated by individuals themselves via apps and devices, and lead to innovations in treatment and diagnosis of diseases; improve the care given to the patient; and empower citizens to participate in the decision-making process regarding their own health and well-being. However, the sensitive nature of the health data prohibits healthcare organizations from sharing the data. The Personal Health Train (PHT) is a novel approach, aiming to establish a distributed data analytics infrastructure enabling the (re)use of distributed healthcare data, while data owners stay in control of their own data. The main principle of the PHT is that data remain in their original location, and analytical tasks visit data sources and execute the tasks. The PHT provides a distributed, flexible approach to use data in a network of participants, incorporating the FAIR principles. It facilitates the responsible use of sensitive and/or personal data by adopting international principles and regulations. This paper presents the concepts and main components of the PHT and demonstrates how it complies with FAIR principles.
Bayesian-Deep-Learning Estimation of Earthquake Location From Single-Station Observations

We present a deep learning method for single-station earthquake location, which we approach as a regression problem using two separate Bayesian neural networks. We use a multi-task temporal-convolutional neural network to learn epicentral distance and P travel time from 1-minute seismograms. The network estimates epicentral distance and P travel time with absolute mean errors of 0.23 km and 0.03 s respectively, along with their epistemic and aleatory uncertainties. We design a separate multi-input network using standard convolutional layers to estimate the back-azimuth angle, and its epistemic uncertainty. This network estimates the direction from which seismic waves arrive to the station with a mean error of 1 degree. Using this information, we estimate the epicenter, origin time, and depth along with their confidence intervals. We use a global dataset of earthquake signals recorded within 1 degree (~112 km) from the event to build the model and to demonstrate its performance. Our model can predict epicenter, origin time, and depth with mean errors of 7.3 km, 0.4 second, and 6.7 km respectively, at different locations around the world. Our approach can be used for fast earthquake source characterization with a limited number of observations, and also for estimating location of earthquakes that are sparsely recorded -- either because they are small or because stations are widely separated.
Machine Learning-Based Scaling Management for Kubernetes Edge Clusters

Kubernetes, the container orchestrator for cloud-deployed applications, offers automatic scaling for the application provider in order to meet the ever-changing intensity of processing demand. This auto-scaling feature can be customized with a parameter set, but those management parameters are static while incoming Web request dynamics often change, not to mention the fact that scaling decisions are inherently reactive, instead of being proactive. We set the ultimate goal of making cloud-based applications' management easier and more effective. We propose a Kubernetes scaling engine that makes the auto-scaling decisions apt for handling the actual variability of incoming requests. In this engine various machine learning forecast methods compete with each other via a short-term evaluation loop in order to always give the lead to the method that suits best the actual request dynamics. We also introduce a compact management parameter for the cloud-tenant application provider to easily set their sweet spot in the resource over-provisioning vs. SLA violation trade-off. We motivate our scaling solution with analytical modeling and evaluation of the current Kubernetes behavior. The multi-forecast scaling engine and the proposed management parameter are evaluated both in simulations and with measurements on our collected Web traces to show the improved quality of fitting provisioned resources to service demand. We find that with just a few, but fundamentally different, and competing forecast methods, our auto-scaler engine, implemented in Kubernetes, results in significantly fewer lost requests with just slightly more provisioned resources compared to the default baseline.
Deep Graph-neighbor Coherence Preserving Network for Unsupervised Cross-modal Hashing

Unsupervised cross-modal hashing (UCMH) has become a hot topic recently. Current UCMH focuses on exploring data similarities. However, current UCMH methods calculate the similarity between two data, mainly relying on the two data's cross-modal features. These methods suffer from inaccurate similarity problems that result in a suboptimal retrieval Hamming space, because the cross-modal features between the data are not sufficient to describe the complex data relationships, such as situations where two data have different feature representations but share the inherent concepts. In this paper, we devise a deep graph-neighbor coherence preserving network (DGCPN). Specifically, DGCPN stems from graph models and explores graph-neighbor coherence by consolidating the information between data and their neighbors. DGCPN regulates comprehensive similarity preserving losses by exploiting three types of data similarities (i.e., the graph-neighbor coherence, the coexistent similarity, and the intra- and inter-modality consistency) and designs a half-real and half-binary optimization strategy to reduce the quantization errors during hashing. Essentially, DGCPN addresses the inaccurate similarity problem by exploring and exploiting the data's intrinsic relationships in a graph. We conduct extensive experiments on three public UCMH datasets. The experimental results demonstrate the superiority of DGCPN, e.g., by improving the mean average precision from 0.722 to 0.751 on MIRFlickr-25K using 64-bit hashing codes to retrieval texts from images. We will release the source code package and the trained model on https://github.com/Atmegal/DGCPN.
Machine learning and earthquake forecasting—next steps

A new generation of earthquake catalogs developed through supervised machine-learning illuminates earthquake activity with unprecedented detail. Application of unsupervised machine learning to analyze the more complete expression of seismicity in these catalogs may be the fastest route to improving earthquake forecasting.
Artificial Intelligence of Things-assisted two-stream neural network for anomaly detection in surveillance Big Video Data

In the last few years, visual sensors are deployed almost everywhere, generating a massive amount of surveillance video data in smart cities that can be inspected intelligently to recognize anomalous events. In this work, we present an efficient and robust framework to recognize anomalies from surveillance Big Video Data (BVD) using Artificial Intelligence of Things (AIoT). Smart surveillance is an important application of AIoT and we propose a two-stream neural network in this direction. The first stream comprises instant anomaly detection that is functional over resource-constrained IoT devices, whereas second phase is a two-stream deep neural network allowing for detailed anomaly analysis, suited to be deployed as a cloud computing service. Firstly, a self-pruned fine-tuned lightweight convolutional neural network (CNN) classifies the ongoing events as normal or anomalous in an AIoT environment. Upon anomaly detection, the edge device alerts the concerned departments and transmits the anomalous frames to cloud analysis center for their detailed evaluation in the second phase. The cloud analysis center resorts to the proposed two-stream network, modeled from the integration of spatiotemporal and optical flow features through the sequential frames. Fused features flow through a bi-directional long short-term memory (BD-LSTM) layer, which classifies them into their respective anomaly classes, e.g., assault and abuse. We perform extensive experiments over benchmarks built on top of the UCF-Crime and RWF-2000 datasets to test the effectiveness of our framework. We report a 9.88% and 4.01% increase in accuracy when compared to state-of-the-art methods evaluated over the aforementioned datasets.
Hate Speech Detection in Hindi-English Code-Mixed Social Media Text

With the increase in user generated content, particularly on social media networks, the amount of hate speech is also steadily increasing. So, there is a need to automatically detect such hateful content and curb the wrongful activities. While relevant research has been done independently on code-mixed social media texts and hate speech detection, this paper deals with the task of identification of hate speech from code-mixed social media text. We perform experiments with available code-mixed dataset for hate speech detection using two architectures namely sub-word level LSTM model and Hierarchical LSTM model with attention based on phonemic sub-words.
A formal methods approach to interpretable reinforcement learning for robotic planning

A formal methods approach to reinforcement learning generates rewards from a formal language and guarantees safety.
Semi-Supervised Multi-View Deep Discriminant Representation Learning

Learning an expressive representation from multi-view data is a key step in various real-world applications. In this paper, we propose a semi-supervised multi-view deep discriminant representation learning (SMDDRL) approach. Unlike existing joint or alignment multi-view representation learning methods that cannot simultaneously utilize the consensus and complementary properties of multi-view data to learn inter-view shared and intra-view specific representations, SMDDRL comprehensively exploits the consensus and complementary properties as well as learns both shared and specific representations by employing the shared and specific representation learning network. Unlike existing shared and specific multi-view representation learning methods that ignore the redundancy problem in representation learning, SMDDRL incorporates the orthogonality and adversarial similarity constraints to reduce the redundancy of learned representations. Moreover, to exploit the information contained in unlabeled data, we design a semi-supervised learning framework by combining deep metric learning and density clustering. Experimental results on three typical multi-view learning tasks, i.e., webpage classification, image classification, and document classification demonstrate the effectiveness of the proposed approach.