OpenRaiser/Intern-Atlas huggingface dataset:
A CNN-based Feature Space for Semi-supervised Incremental Learning in Assisted Living Applications
Venue: arXiv cs.CV 2020
Year: 2020

A Convolutional Neural Network (CNN) is sometimes confronted with objects of changing appearance ( new instances) that exceed its generalization capability. This requires the CNN to incorporate new knowledge, i.e., to learn incrementally. In this paper, we are concerned with this problem in the context of assisted living. We propose using the feature space that results from the training dataset to automatically label problematic images that could not be properly recognized by the CNN. The idea is to exploit the extra information in the feature space for a semi-supervised labeling and to employ problematic images to improve the CNN's classification model. Among other benefits, the resulting semi-supervised incremental learning process allows improving the classification accuracy of new instances by 40% as illustrated by extensive experiments.
Forget-me-block: Exploring digital preservation strategies using Distributed Ledger Technology in the context of personal information management
Venue: arXiv cs.CY 2020
Year: 2020

Received wisdom portrays digital records as guaranteeing perpetuity; as the New York Times wrote a decade ago: "the web means the end of forgetting". The reality however is that digital records suffer similar risks of access loss as the analogue versions they replace. Often this risk is outsourced to specialised third parties. Common use cases include Personal Information Management (PIM): e.g. calendars, diaries, tasks, etc. Frequently these are outsourced at two removes - firstly by the individual to their employer (e.g. using a company system) and then by their employer to an external provider. So enters a new risk: organisational change; by the time the information is required the organisational chain that links user to data may be broken: the employer transitions to a different provider, the employee leaves the company, the IS provider pivots to new offerings. The advent of Distributed Ledger Technology (DLT) could help mitigate these risks; and has led to a re-evaluation of the relationship between data creation and ownership. Although DLT is an imprecise term, it typically involves data storage across organisationally separate entities in a cryptographically secure form; and therefore could present a partial solution to the risk. This project presents the first research that applies DLT to the field of PIM, furthering design science state of the art by a novel implementation of a calendar application on the Ethereum blockchain. It also extends current research in utilising DLT in digital preservation, namely by enacting a continuum approach within a DL that allows for transfer of ownership of digital objects as they transition from individual to collective relevance. Finally it provides guidelines for future use of DLT within digital preservation.
Assessment of text coherence based on the cohesion estimation
Venue: arXiv cs.CL 2020
Year: 2020

In this paper, a graph-based coherence estimation method based on the cohesion estimation is suggested. Our method uses a graph-based approach to provide a user with an understanding of the evaluation process. Moreover, it can be applied to different languages, therefore, the effectiveness of this method is examined on the set of English, Chinese, and Arabic texts.
Regularization of Persistent Homology Gradient Computation
Venue: arXiv cs.LG 2020
Year: 2020

Persistent homology is a method for computing the topological features present in a given data. Recently, there has been much interest in the integration of persistent homology as a computational step in neural networks or deep learning. In order for a given computation to be integrated in such a way, the computation in question must be differentiable. Computing the gradients of persistent homology is an ill-posed inverse problem with infinitely many solutions. Consequently, it is important to perform regularization so that the solution obtained agrees with known priors. In this work we propose a novel method for regularizing persistent homology gradient computation through the addition of a grouping term. This has the effect of helping to ensure gradients are defined with respect to larger entities and not individual points.
The Potential of Machine Learning and NLP for Handling Students' Feedback (A Short Survey)
Venue: arXiv cs.CY 2020
Year: 2020

This article provides a review of the literature of students' feedback papers published in recent years employing data mining techniques. In particular, the focus is to highlight those papers which are using either machine learning or deep learning approaches. Student feedback assessment is a hot topic which has attracted a lot of attention in recent times. The importance has increased manyfold due to the recent pandemic outbreak which pushed many colleges and universities to shift teaching from on-campus physical classes to online via eLearning platforms and tools including massive open online courses (MOOCs). Assessing student feedback is even more important now. This short survey paper, therefore, highlights recent trends in the natural language processing domain on the topic of automatic student feedback assessment. It presents techniques commonly utilized in this domain and discusses some future research directions.
Detecting Synthetic Phenomenology in a Contained Artificial General Intelligence
Venue: arXiv cs.CY 2020
Year: 2020

Human-like intelligence in a machine is a contentious subject. Whether mankind should or should not pursue the creation of artificial general intelligence is hotly debated. As well, researchers have aligned in opposing factions according to whether mankind can create it. For our purposes, we assume mankind can and will do so. Thus, it becomes necessary to contemplate how to do so in a safe and trusted manner -- enter the idea of boxing or containment. As part of such thinking, we wonder how a phenomenology might be detected given the operational constraints imposed by any potential containment system. Accordingly, this work provides an analysis of existing measures of phenomenology through qualia and extends those ideas into the context of a contained artificial general intelligence.
Wearable Sensors for Individual Grip Force Profiling
Venue: arXiv cs.HC 2020
Year: 2020

Biosensors and wearable sensor systems with transmitting capabilities are currently developed and used for the monitoring of health data, exercise activities, and other performance data. Unlike conventional approaches, these devices enable convenient, continuous, and/or unobtrusive monitoring of user behavioral signals in real time. Examples include signals relative to body motion, body temperature, blood flow parameters and a variety of biological or biochemical markers and, as will be shown in this chapter here, individual grip force data that directly translate into spatiotemporal grip force profiles for different locations on the fingers and palm of the hand. Wearable sensor systems combine innovation in sensor design, electronics, data transmission, power management, and signal processing for statistical analysis, as will be further shown herein. The first section of this chapter will provide an overview of the current state of the art in grip force profiling to highlight important functional aspects to be considered. In the next section, the contribution of wearable sensor technology in the form of sensor glove systems for the real-time monitoring of surgical task skill evolution in novices training in a simulator task will be described on the basis of recent examples. In the discussion, advantages and limitations will be weighed against each other.
Age Gap Reducer-GAN for Recognizing Age-Separated Faces
Venue: arXiv cs.CV 2020
Year: 2020

In this paper, we propose a novel algorithm for matching faces with temporal variations caused due to age progression. The proposed generative adversarial network algorithm is a unified framework that combines facial age estimation and age-separated face verification. The key idea of this approach is to learn the age variations across time by conditioning the input image on the subject's gender and the target age group to which the face needs to be progressed. The loss function accounts for reducing the age gap between the original image and generated face image as well as preserving the identity. Both visual fidelity and quantitative evaluations demonstrate the efficacy of the proposed architecture on different facial age databases for age-separated face recognition.
Joint Management of Compute and Radio Resources in Mobile Edge Computing: a Market Equilibrium Approach
Venue: arXiv cs.NI 2020
Year: 2020

Edge computing has been recently introduced as a way to bring computational capabilities closer to end users of modern network-based services, in order to support existent and future delay-sensitive applications by effectively addressing the high propagation delay issue that affects cloud computing. However, the problem of efficiently and fairly manage the system resources presents particular challenges due to the limited capacity of both edge nodes and wireless access networks, as well as the heterogeneity of resources and services' requirements. To this end, we propose a techno-economic market where service providers act as buyers, securing both radio and computing resources for the execution of their associated end users' jobs, while being constrained by a budget limit. We design an allocation mechanism that employs convex programming in order to find the unique market equilibrium point that maximizes fairness, while making sure that all buyers receive their preferred resource bundle. Additionally, we derive theoretical properties that confirm how the market equilibrium approach strikes a balance between fairness and efficiency. We also propose alternative allocation mechanisms and give a comparison with the market-based mechanism. Finally, we conduct simulations in order to numerically analyze and compare the performance of the mechanisms and confirm the theoretical properties of the market model.
Physics-constrained Deep Learning of Multi-zone Building Thermal Dynamics
Venue: arXiv cs.LG 2020
Year: 2020

We present a physics-constrained control-oriented deep learning method for modeling building thermal dynamics. The proposed method is based on the systematic encoding of physics-based prior knowledge into a structured recurrent neural architecture. Specifically, our method incorporates structural priors from traditional physics-based building modeling into the neural network thermal dynamics model structure. Further, we leverage penalty methods to provide inequality constraints, thereby bounding predictions within physically realistic and safe operating ranges. Observing that stable eigenvalues accurately characterize the dissipativeness of the system, we additionally use a constrained matrix parameterization based on the Perron-Frobenius theorem to bound the dominant eigenvalues of the building thermal model parameter matrices. We demonstrate the proposed data-driven modeling approach's effectiveness and physical interpretability on a dataset obtained from a real-world office building with 20 thermal zones. Using only 10 days' measurements for training, we demonstrate generalization over 20 consecutive days, significantly improving the accuracy compared to prior state-of-the-art results reported in the literature.
Football tracking networks: Beyond event-based connectivity
Venue: arXiv cs.SI 2020
Year: 2020

We propose using Network Science as a complementary tool to analyze player and team behavior during a football match. Specifically, we introduce four kinds of networks based on different ways of interaction between players. Our approach's main novelty is to use tracking datasets to create football tracking networks, instead of constructing and analyzing the traditional networks based on events. In this way, we are able to capture player interactions that go beyond passes and introduce the concepts of (a) Ball Flow Networks, (b) Marking Networks, (c) Signed Proximity Networks and (d) Functional Coordination Networks. After defining the methodology for creating each kind of network, we show some examples using tracking datasets from four different matches of LaLiga Santander. Finally, we discuss some of the applications, limitations, and further improvements of football tracking networks.
Machine Learning Based Path Planning for Improved Rover Navigation (Pre-Print Version)
Venue: arXiv cs.RO 2020
Year: 2020

Enhanced AutoNav (ENav), the baseline surface navigation software for NASA's Perseverance rover, sorts a list of candidate paths for the rover to traverse, then uses the Approximate Clearance Evaluation (ACE) algorithm to evaluate whether the most highly ranked paths are safe. ACE is crucial for maintaining the safety of the rover, but is computationally expensive. If the most promising candidates in the list of paths are all found to be infeasible, ENav must continue to search the list and run time-consuming ACE evaluations until a feasible path is found. In this paper, we present two heuristics that, given a terrain heightmap around the rover, produce cost estimates that more effectively rank the candidate paths before ACE evaluation. The first heuristic uses Sobel operators and convolution to incorporate the cost of traversing high-gradient terrain. The second heuristic uses a machine learning (ML) model to predict areas that will be deemed untraversable by ACE. We used physics simulations to collect training data for the ML model and to run Monte Carlo trials to quantify navigation performance across a variety of terrains with various slopes and rock distributions. Compared to ENav's baseline performance, integrating the heuristics can lead to a significant reduction in ACE evaluations and average computation time per planning cycle, increase path efficiency, and maintain or improve the rate of successful traverses. This strategy of targeting specific bottlenecks with ML while maintaining the original ACE safety checks provides an example of how ML can be infused into planetary science missions and other safety-critical software.
Fast or Slow: An Autonomous Speed Control Approach for UAV-assisted IoT Data Collection Networks
Venue: arXiv cs.NI 2020
Year: 2020

Unmanned Aerial Vehicles (UAVs) have been emerging as an effective solution for IoT data collection networks thanks to their outstanding flexibility, mobility, and low operation costs. However, due to the limited energy and uncertainty from the data collection process, speed control is one of the most important factors to optimize the energy usage efficiency and performance for UAV collectors. This work aims to develop a novel autonomous speed control approach to address this issue. To that end, we first formulate the dynamic speed control task of a UAV as a Markov decision process taking into account its energy status and location. In this way, the Q-learning algorithm can be adopted to obtain the optimal speed control policy for the UAV. To further improve the system performance, we develop an highly-effective deep dueling double Q-learning algorithm utilizing outstanding features of the deep neural networks as well as advanced dueling architecture to quickly stabilize the learning process and obtain the optimal policy. Through simulation results, we show that our proposed solution can achieve up to 40% greater performance compared with other conventional methods. Importantly, the simulation results also reveal significant impacts of UAV's energy and charging time on the system performance.
Gaussian RAM: Lightweight Image Classification via Stochastic Retina-Inspired Glimpse and Reinforcement Learning
Venue: arXiv cs.CV 2020
Year: 2020

Previous studies on image classification have mainly focused on the performance of the networks, not on real-time operation or model compression. We propose a Gaussian Deep Recurrent visual Attention Model (GDRAM)- a reinforcement learning based lightweight deep neural network for large scale image classification that outperforms the conventional CNN (Convolutional Neural Network) which uses the entire image as input. Highly inspired by the biological visual recognition process, our model mimics the stochastic location of the retina with Gaussian distribution. We evaluate the model on Large cluttered MNIST, Large CIFAR-10 and Large CIFAR-100 datasets which are resized to 128 in both width and height.
Revisiting Secure Computation Using Functional Encryption: Opportunities and Research Directions
Venue: arXiv cs.CR 2020
Year: 2020

Increasing incidents of security compromises and privacy leakage have raised serious privacy concerns related to cyberspace. Such privacy concerns have been instrumental in the creation of several regulations and acts to restrict the availability and use of privacy-sensitive data. The secure computation problem, initially and formally introduced as secure two-party computation by Andrew Yao in 1986, has been the focus of intense research in academia because of its fundamental role in building many of the existing privacy-preserving approaches. Most of the existing secure computation solutions rely on garbled-circuits and homomorphic encryption techniques to tackle secure computation issues, including efficiency and security guarantees. However, it is still challenging to adopt these secure computation approaches in emerging compute-intensive and data-intensive applications such as emerging machine learning solutions. Recently proposed functional encryption scheme has shown its promise as an underlying secure computation foundation in recent privacy-preserving machine learning approaches proposed. This paper revisits the secure computation problem using emerging and promising functional encryption techniques and presents a comprehensive study. We first briefly summarize existing conventional secure computation approaches built on garbled-circuits, oblivious transfer, and homomorphic encryption techniques. Then, we elaborate on the unique characteristics and challenges of emerging functional encryption based secure computation approaches and outline several research directions.
Autonomous Obstacle Legipulation with a Hexapod Robot
Venue: arXiv cs.RO 2020
Year: 2020

Legged robots traversing in confined environments could find their only path is blocked by obstacles. In circumstances where the obstacles are movable, a multilegged robot can manipulate the obstacles using its legs to allow it to continue on its path. We present a method for a hexapod robot to autonomously generate manipulation trajectories for detected obstacles. Using a RGB-D sensor as input, the obstacle is extracted from the environment and filtered to provide key contact points for the manipulation algorithm to calculate a trajectory to move the obstacle out of the path. Experiments on a 30 degree of freedom hexapod robot show the effectiveness of the algorithm in manipulating a range of obstacles in a 3D environment using its front legs.
VCE: Variational Convertor-Encoder for One-Shot Generalization
Venue: arXiv cs.CV 2020
Year: 2020

Variational Convertor-Encoder (VCE) converts an image to various styles; we present this novel architecture for the problem of one-shot generalization and its transfer to new tasks not seen before without additional training. We also improve the performance of variational auto-encoder (VAE) to filter those blurred points using a novel algorithm proposed by us, namely large margin VAE (LMVAE). Two samples with the same property are input to the encoder, and then a convertor is required to processes one of them from the noisy outputs of the encoder; finally, the noise represents a variety of transformation rules and is used to convert new images. The algorithm that combines and improves the condition variational auto-encoder (CVAE) and introspective VAE, we propose this new framework aim to transform graphics instead of generating them; it is used for the one-shot generative process. No sequential inference algorithmic is needed in training. Compared to recent Omniglot datasets, the results show that our model produces more realistic and diverse images.
On Designing Computing Systems for Autonomous Vehicles: a PerceptIn Case Study
Venue: arXiv cs.RO 2020
Year: 2020

PerceptIn develops and commercializes autonomous vehicles for micromobility around the globe. This paper makes a holistic summary of PerceptIn's development and operating experiences. This paper provides the business tale behind our product, and presents the development of the computing system for our vehicles. We illustrate the design decision made for the computing system, and show the advantage of offloading localization workloads onto an FPGA platform.
Analyzing Neural Discourse Coherence Models
Venue: arXiv cs.CL 2020
Year: 2020

In this work, we systematically investigate how well current models of coherence can capture aspects of text implicated in discourse organisation. We devise two datasets of various linguistic alterations that undermine coherence and test model sensitivity to changes in syntax and semantics. We furthermore probe discourse embedding space and examine the knowledge that is encoded in representations of coherence. We hope this study shall provide further insight into how to frame the task and improve models of coherence assessment further. Finally, we make our datasets publicly available as a resource for researchers to use to test discourse coherence models.
Integration of 5G with TSN as Prerequisite for a Highly Flexible Future Industrial Automation: Time Synchronization based on IEEE 802.1AS
Venue: arXiv cs.NI 2020
Year: 2020

Industry 4.0 brings up new types of use cases, whereby mobile use cases play a significant role. These use cases have stringent requirements on both automation and communication systems that cannot be achieved with recent shop floor technologies. Therefore, novel technologies such as IEEE time-sensitive networking (TSN) and Open Platform Communications Unified Architecture (OPC UA) are being introduced. In addition, for the realization of mobile use cases, wireline technologies cannot be used and have to be replaced by wireless connections, which have to meet the high demands of the industrial landscape. Here, 5th generation wireless communication system (5G) is seen as a promising candidate. Especially encouraging and similarly challenging is the cooperative work of mobile robots, where particularly high demands on time synchronization arise. Therefore, this paper introduces a concept for the integration of TSN time synchronization (IEEE 802.1AS) conform with 5G to fulfill the requirements of these use cases. Furthermore, the paper describes a testbed for discrete manufacturing, consisting pre-dominantly of industrial equipment, in order to evaluate the presented approach.