Reviewerly/exHarmony huggingface dataset:
Mobile Technology Solution for COVID-19: Surveillance and Prevention

The twenty-first century, a century would be known for profound technological advancements and unfortunately also for a global economic and health crisis due to SARS-CoV2, the causal organism of respiratory syndrome COVID-19. Due to the huge crisis in every sector, 'Technological or Digital way' is the brightest hope to fight this pandemic. Analysis of the data obtained from the past few infectious months, the spread is more likely to become a seasonal threat to mankind. As an effort to level up the technology and other associated aspects, various researchers and developers are developing mobile applications and mobile controllable devices to provide quality information which can help in flattening the curve of this pandemic. Practically, it becomes a great method to prevent close contacts with diseased individuals by providing virtual visits and through robotic technologies. In the current chapter, the technological background of computational intelligence-controlled smartphone applications for monitoring an individual's health and tracking the geographical spread of the virus, along with the research scope and data security concerned with these applications have been discussed. This could help the government to understand the potential risk circumstances towards early exposure and timely medical intervention to prevent it from further spread to other regions.
Hard Pixel Mining for Depth Privileged Semantic Segmentation

Semantic segmentation has achieved remarkable progress but remains challenging due to the complex scene, object occlusion, and so on. Some research works have attempted to use extra information such as a depth map to help RGB based semantic segmentation because the depth map could provide complementary geometric cues. However, due to the inaccessibility of depth sensors, depth information is usually unavailable for the test images. In this paper, we leverage only the depth of training images as the privileged information to mine the hard pixels in semantic segmentation, in which depth information is only available for training images but not available for test images. Specifically, we propose a novel Loss Weight Module, which outputs a loss weight map by employing two depth-related measurements of hard pixels: Depth Prediction Error and Depth-aware Segmentation Error. The loss weight map is then applied to segmentation loss, with the goal of learning a more robust model by paying more attention to the hard pixels. Besides, we also explore a curriculum learning strategy based on the loss weight map. Meanwhile, to fully mine the hard pixels on different scales, we apply our loss weight module to multi-scale side outputs. Our hard pixels mining method achieves the state-of-the-art results on three benchmark datasets, and even outperforms the methods which need depth input during testing.
Toward Ergonomic Risk Prediction via Segmentation of Indoor Object Manipulation Actions Using Spatiotemporal Convolutional Networks

Automated real-time prediction of the ergonomic risks of manipulating objects is a key unsolved challenge in developing effective human-robot collaboration systems for logistics and manufacturing applications. We present a foundational paradigm to address this challenge by formulating the problem as one of action segmentation from RGB-D camera videos. Spatial features are first learned using a deep convolutional model from the video frames, which are then fed sequentially to temporal convolutional networks to semantically segment the frames into a hierarchy of actions, which are either ergonomically safe, require monitoring, or need immediate attention. For performance evaluation, in addition to an open-source kitchen dataset, we collected a new dataset comprising twenty individuals picking up and placing objects of varying weights to and from cabinet and table locations at various heights. Results show very high (87-94)\% F1 overlap scores among the ground truth and predicted frame labels for videos lasting over two minutes and consisting of a large number of actions.
Embeddings in Natural Language Processing: Theory and Advances in Vector Representations of Meaning

Embeddings have undoubtedly been one of the most influential research areas in Natural Language Processing (NLP). Encoding information into a low-dimensional vector representation, which is easily int
An End-to-End Network for Image De-Hazing and Beyond

Degradation in the qualityof images that are captured in the hazy environment is mainlydue to 1) different weather conditions and 2) the attenuation in reflected light. These factors introduce a severe color distortion and low visibility in the captured images. To tackle these problems, we propose an end-to-end trainable image de-hazing network named as LIGHT-Net. The proposed LIGHT-Net comprises of color constancy module and haze reduction module. Among these, the color constancy module removes the color cast added in hazy image due to the weather condition. Whereas, the proposed haze reduction module, which is build using an inception-residual block, is aimed to reduce the effect of haze as well as to improve the visibility in the hazy image. Unlike traditional feature concatenation, in the haze reduction module, we propose a dense feature sharing to effectively share the features learned at initial layers across the network. In general, a major hurdle to train a convolution neural network for haze removal task is the unavailability of large-scale real-world hazy, and corresponding haze-free image (i.e. paired data). Thus, we make use of an unpaired training approach to train the proposed LIGHT-Net for image de-hazing. Extensive analysis has been carried out to validate the necessity and impact of each sub-block of the proposed LIGHT-Net. A large set of real-world hazy images captured in different weather conditions are considered to validate the proposed approach for image de-hazing. Also, the benchmark synthetic hazy image database is considered for a quantitative analysis of the proposed LIGHTNet for image de-hazing. Further, we have shown the usefulness of the proposed LIGHT-Net for underwater image enhancement. Experiments show that the proposed LIGHT-Net outperforms the other existing approaches for both image de-hazing as well as underwater image enhancement.
Simultaneous Subspace Clustering and Cluster Number Estimating Based on Triplet Relationship

In this paper we propose a unified framework to simultaneously discover the number of clusters and group the data points into them using subspace clustering. Real data distributed in a high-dimensional space can be disentangled into a union of low-dimensional subspaces, which can benefit various applications. To explore such intrinsic structure, state-of-the-art subspace clustering approaches often optimize a self-representation problem among all samples, to construct a pairwise affinity graph for spectral clustering. However, a graph with pairwise similarities lacks robustness for segmentation, especially for samples which lie on the intersection of two subspaces. To address this problem, we design a hyper-correlation based data structure termed as the \textit{triplet relationship}, which reveals high relevance and local compactness among three samples. The triplet relationship can be derived from the self-representation matrix, and be utilized to iteratively assign the data points to clusters. Three samples in each triplet are encouraged to be highly correlated and are considered as a meta-element during clustering, which show more robustness than pairwise relationships when segmenting two densely distributed subspaces. Based on the triplet relationship, we propose a unified optimizing scheme to automatically calculate clustering assignments. Specifically, we optimize a model selection reward and a fusion reward by simultaneously maximizing the similarity of triplets from different clusters while minimizing the correlation of triplets from same cluster. The proposed algorithm also automatically reveals the number of clusters and fuses groups to avoid over-segmentation. Extensive experimental results on both synthetic and real-world datasets validate the effectiveness and robustness of the proposed method.
Dreaming neural networks: rigorous results

Recently a daily routine for associative neural networks has been proposed: the network Hebbian-learns during the awake state (thus behaving as a standard Hopfield model), then, during its sleep state, optimizing information storage, it consolidates pure patterns and removes spurious ones: this forces the synaptic matrix to collapse to the projector one (ultimately approaching the Kanter-Sompolinksy model). This procedure keeps the learning Hebbian-based (a biological must) but, by taking advantage of a (properly stylized) sleep phase, still reaches the maximal critical capacity (for symmetric interactions). So far this emerging picture (as well as the bulk of papers on unlearning techniques) was supported solely by mathematically-challenging routes, e.g. mainly replica-trick analysis and numerical simulations: here we rely extensively on Guerra's interpolation techniques developed for neural networks and, in particular, we extend the generalized stochastic stability approach to the case. Confining our description within the replica symmetric approximation (where the previous ones lie), the picture painted regarding this generalization (and the previously existing variations on theme) is here entirely confirmed. Further, still relying on Guerra's schemes, we develop a systematic fluctuation analysis to check where ergodicity is broken (an analysis entirely absent in previous investigations). We find that, as long as the network is awake, ergodicity is bounded by the Amit-Gutfreund-Sompolinsky critical line (as it should), but, as the network sleeps, sleeping destroys spin glass states by extending both the retrieval as well as the ergodic region: after an entire sleeping session the solely surviving regions are retrieval and ergodic ones and this allows the network to achieve the perfect retrieval regime (the number of storable patterns equals the number of neurons in the network).
Object Detection from the Video Taken by Drone via Convolutional Neural Networks

The aim of this research is to show the implementation of object detection on drone videos using TensorFlow object detection API. The function of the research is the recognition effect and performance of the popular target detection algorithm and feature extractor for recognizing people, trees, cars, and buildings from real-world video frames taken by drones. The study found that using different target detection algorithms on the “normal” image (an ordinary camera) has different performance effects on the number of instances, detection accuracy, and performance consumption of the target and the application of the algorithm to the image data acquired by the drone is different. Object detection is a key part of the realization of any robot’s complete autonomy, while unmanned aerial vehicles (UAVs) are a very active area of this field. In order to explore the performance of the most advanced target detection algorithm in the image data captured by UAV, we have done a lot of experiments to solve our functional problems and compared two different types of representative of the most advanced convolution target detection systems, such as SSD and Faster R-CNN, with MobileNet, GoogleNet/Inception, and ResNet50 base feature extractors.
A combinatorial view on string attractors

The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w=w1w2⋯wn is a subset Γ of the positions {1,…,n}, such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. In this paper we explore the notion of string attractor by focusing on its combinatorial properties. In particular, we show how the size of the smallest string attractor of a word varies when combinatorial operations are applied and we deduce that such a measure is not monotone. Moreover, we introduce a circular variant of the notion of string attractor to provide a characterization of the conjugacy classes of standard Sturmian words.
Recurrence extraction for functional programs through call-by-push-value

The main way of analysing the complexity of a program is that of extracting and solving a recurrence that expresses its running time in terms of the size of its input. We develop a method that automatically extracts such recurrences from the syntax of higher-order recursive functional programs. The resulting recurrences, which are programs in a call-by-name language with recursion, explicitly compute the running time in terms of the size of the input. In order to achieve this in a uniform way that covers both call-by-name and call-by-value evaluation strategies, we use Call-by-Push-Value (CBPV) as an intermediate language. Finally, we use domain theory to develop a denotational cost semantics for the resulting recurrences.
Scaling Hidden Markov Language Models

The hidden Markov model (HMM) is a fundamental tool for sequence modeling that cleanly separates the hidden state from the emission structure.However, this separation makes it difficult to fit HMMs to large datasets in modern NLP, and they have fallen out of use due to very poor performance compared to fully observed models.This work revisits the challenge of scaling HMMs to language modeling datasets, taking ideas from recent approaches to neural modeling.We propose methods for scaling HMMs to massive state spaces while maintaining efficient exact inference, a compact parameterization, and effective regularization.Experiments show that this approach leads to models that are more accurate than previous HMM and n-gram-based methods, making progress towards the performance of state-of-the-art neural models.
PointAR: Efficient Lighting Estimation for Mobile Augmented Reality

We propose an efficient lighting estimation pipeline that is suitable to run on modern mobile devices, with comparable resource complexities to state-of-the-art mobile deep learning models. Our pipeline, PointAR, takes a single RGB-D image captured from the mobile camera and a 2D location in that image, and estimates 2nd degree spherical harmonics coefficients. This estimated spherical harmonics coefficients can be directly utilized by rendering engines for supporting spatially variant indoor lighting, in the context of augmented reality. Our key insight is to formulate the lighting estimation as a point cloud-based learning problem directly from point clouds, which is in part inspired by the Monte Carlo integration leveraged by real-time spherical harmonics lighting. While existing approaches estimate lighting information with complex deep learning pipelines, our method focuses on reducing the computational complexity. Through both quantitative and qualitative experiments, we demonstrate that PointAR achieves lower lighting estimation errors compared to state-of-the-art methods. Further, our method requires an order of magnitude lower resource, comparable to that of mobile-specific DNNs.
Finite-time stabilization control of quantum systems

The finite-time control problem of quantum systems is investigated in this paper. We first define finite-time stability and present a finite-time Lyapunov stability criterion for finite-dimensional quantum systems in coherence vector representation. Then, for two-level quantum systems, we design a continuous non-smooth control law with a state-dependent fractional power and prove the uniqueness of solutions of the system dynamics with the controller via the concept of transversality. By combining the finite-time Lyapunov stability criterion with the homogeneity theory, the finite-time convergence of the system to an eigenstate of its internal Hamiltonian is proved. Numerical results on a spin-1/2 system demonstrate the effectiveness of the proposed finite-time stabilization control scheme.
MEMe: An Accurate Maximum Entropy Method for Efficient Approximations in Large-Scale Machine Learning

Efficient approximation lies at the heart of large-scale machine learning problems. In this paper, we propose a novel, robust maximum entropy algorithm, which is capable of dealing with hundreds of moments and allows for computationally efficient approximations. We showcase the usefulness of the proposed method, its equivalence to constrained Bayesian variational inference and demonstrate its superiority over existing approaches in two applications, namely, fast log determinant estimation and information-theoretic Bayesian optimisation.
Machine translation testing via pathological invariance

Machine translation software has become heavily integrated into our daily lives due to the recent improvement in the performance of deep neural networks. However, machine translation software has been shown to regularly return erroneous translations, which can lead to harmful consequences such as economic loss and political conflicts. Additionally, due to the complexity of the underlying neural models, testing machine translation systems presents new challenges. To address this problem, we introduce a novel methodology called PatInv. The main intuition behind PatInv is that sentences with different meanings should not have the same translation. Under this general idea, we provide two realizations of PatInv that given an arbitrary sentence, generate syntactically similar but semantically different sentences by: (1) replacing one word in the sentence using a masked language model or (2) removing one word or phrase from the sentence based on its constituency structure. We then test whether the returned translations are the same for the original and modified sentences. We have applied PatInv to test Google Translate and Bing Microsoft Translator using 200 English sentences. Two language settings are considered: English-Hindi (En-Hi) and English-Chinese (En-Zh). The results show that PatInv can accurately find 308 erroneous translations in Google Translate and 223 erroneous translations in Bing Microsoft Translator, most of which cannot be found by the state-of-the-art approaches.
Are Pretrained Language Models Symbolic Reasoners over Knowledge?

How can pretrained language models (PLMs) learn factual knowledge from the training set?We investigate the two most important mechanisms: reasoning and memorization.Prior work has attempted to quantify the number of facts PLMs learn, but we present, using synthetic data, the first study that investigates the causal relation between facts present in training and facts learned by the PLM.For reasoning, we show that PLMs seem to learn to apply some symbolic reasoning rules correctly but struggle with others, including two-hop reasoning.Further analysis suggests that even the application of learned reasoning rules is flawed.For memorization, we identify schema conformity (facts systematically supported by other facts) and frequency as key factors for its success.
SHA2 and SHA-3 accelerator design in a 7 nm technology within the European Processor Initiative

This paper proposes the architecture of the hash accelerator, developed in the framework of the European Processor Initiative. The proposed circuit supports all the SHA2 and SHA-3 operative modes and is to be one of the hardware cryptographic accelerators within the crypto-tile of the European Processor Initiative. The accelerator has been verified on a Stratix IV FPGA and then synthesised on the Artisan 7 nanometres TSMC silicon technology, obtaining throughputs higher than 50 Gbps for the SHA2 and 230 Gbps for the SHA-3, with complexity ranging from 15 to about 30 kGE and estimated power dissipation of about 13 (SHA2) to 26 (SHA-3) mW (supply voltage 0.75 V). The proposed design demonstrates absolute performances beyond the state-of-the-art and efficiency aligned with it. One of the main contributions is that this is the first SHA-2 SHA-3 accelerator synthesised on such advanced technology.
Ptolemy: Architecture Support for Robust Deep Learning

Deep learning is vulnerable to adversarial attacks, where carefully-crafted input perturbations could mislead a well-trained Deep Neural Network (DNN) to produce incorrect results. Adversarial attacks jeopardize the safety, security, and privacy of DNN-enabled systems. Today's countermeasures to adversarial attacks either do not have the capability to detect adversarial samples at inference-time, or introduce prohibitively high overhead to be practical at inference-time.We propose Ptolemy, an algorithm-architecture co-designed system that detects adversarial attacks at inference time with low overhead and high accuracy. We exploit the synergies between DNN inference and imperative program execution: an input to a DNN uniquely activates a set of neurons that contribute significantly to the inference output, analogous to the sequence of basic blocks exercised by an input in a conventional program. Critically, we observe that adversarial samples tend to activate distinctive paths from those of benign inputs. Leveraging this insight, we propose an adversarial sample detection framework, which uses canary paths generated from offline profiling to detect adversarial samples at runtime. The Ptolemy compiler along with the co-designed hardware enable efficient execution by exploiting the unique algorithmic characteristics. Extensive evaluations show that Ptolemy achieves higher or similar adversarial sample detection accuracy than today's mechanisms with a much lower (as low as 2%) runtime overhead.
SpheroidJ: An Open-Source Set of Tools for Spheroid Segmentation

Spheroids are the most widely used 3D models for studying the effects of different micro-environmental characteristics on tumour behaviour, and for testing different preclinical and clinical treatments. In order to speed up the study of spheroids, imaging methods that automatically segment and measure spheroids are instrumental; and, several approaches for automatic segmentation of spheroid images exist in the literature. However, those methods fail to generalise to a diversity of experimental conditions. The aim of this work is the development of a set of tools for spheroid segmentation that works in a diversity of settings. In this work, we have tackled the spheroid segmentation task by first developing a generic segmentation algorithm that can be easily adapted to different scenarios. This generic algorithm has been employed to reduce the burden of annotating a dataset of images that, in turn, has been employed to train several deep learning architectures for semantic segmentation. Both our generic algorithm and the constructed deep learning models have been tested with several datasets of spheroid images where the spheroids were grown under several experimental conditions, and the images acquired using different equipment. The developed generic algorithm can be particularised to different scenarios; however, those particular algorithms fail to generalise to different conditions. By contrast, the best deep learning model, constructed using the HRNet-Seg architecture, generalises properly to a diversity of scenarios. In order to facilitate the dissemination and use of our algorithms and models, we present SpheroidJ, a set of open-source tools for spheroid segmentation. In this work, we have developed an algorithm and trained several models for spheroid segmentation that can be employed with images acquired under different conditions. Thanks to this work, the analysis of spheroids acquired under different conditions will be more reliable and comparable; and, the developed tools will help to advance our understanding of tumour behaviour.