OpenRaiser/Intern-Atlas huggingface dataset:
Neverland: Lightweight Hardware Extensions for Enforcing Operating System Integrity
Venue: arXiv cs.CR 2019
Year: 2019

The security of applications hinges on the trustworthiness of the operating system, as applications rely on the OS to protect code and data. As a result, multiple protections for safeguarding the integrity of kernel code and data are being continuously proposed and deployed. These existing protections, however, are far from ideal as they either provide partial protection, or require complex and high overhead hardware and software stacks. In this work, we present Neverland: a low-overhead, hardware-assisted, memory protection scheme that safeguards the operating system from rootkits and kernel-mode malware. Once the system is done booting, Neverland's hardware takes away the operating system's ability to overwrite certain configuration registers, as well as portions of its own physical address space that contain kernel code and security-critical data. Furthermore, it prohibits the CPU from fetching privileged code from any memory region lying outside the physical addresses assigned to the OS kernel and drivers (regardless of virtual page permissions). This combination of protections makes it extremely hard for an attacker to tamper with the kernel or introduce new privileged code into the system -- even in the presence of kernel vulnerabilities. Our evaluations show that the extra hardware required to support these protections incurs minimal silicon and energy overheads. Neverland enables operating systems to reduce their attack surface without having to rely on complex integrity monitoring software or hardware.
Improving Distributed Similarity Join in Metric Space with Error-bounded Sampling
Venue: arXiv cs.DB 2019
Year: 2019

Given two sets of objects, metric similarity join finds all similar pairs of objects according to a particular distance function in metric space. There is an increasing demand to provide a scalable similarity join framework which can support efficient query and analytical services in the era of Big Data. The existing distributed metric similarity join algorithms adopt random sampling techniques to produce pivots and utilize holistic partitioning methods based on the generated pivots to partition data, which results in data skew problem since both the generated pivots and the partition strategies have no quality guarantees. To address the limitation, we propose SP-Join, an end-to-end framework to support distributed similarity join in metric space based on the MapReduce paradigm, which (i) employs an estimation-based stratified sampling method to produce pivots with quality guarantees for any sample size, and (ii) devises an effective cost model as the guideline to split the whole datasets into partition in map and reduce phases according to the sampled pivots. Although obtaining an optimal set of partitions is proven to be NP-Hard, SP-Join adopts efficient partitioning strategies based on such a cost model to achieve an even partition with explainable quality. We implement our framework upon Apache Spark platform and conduct extensive experiments on four real-world datasets. The results show that our method significantly outperforms state-of-the-art methods.
MmWave UAV Networks with Multi-cell Association: Performance Limit and Optimization
Venue: arXiv cs.IT 2019
Year: 2019

This paper aims to exploit the fundamental limits on the downlink coverage and spatial throughput performances of a cellular network comprised of a tier of unmanned aerial vehicle (UAV) base stations (BSs) using the millimeter wave (mmWave) band and a tier of ground BSs using the ultra high frequency (UHF) band. To reduce handover signaling overhead, the ground BSs take charge of control signaling delivery whereas the UAVs are in charge of payload data transmission so that users need to be simultaneously associated with a ground BS and a UAV in this network with a control-data plane-split architecture. We first propose a three-dimensional (3D) location distribution model of the UAVs using stochastic geometry which is able to generally characterize the positions of the UAVs in the sky. Using this 3D distribution model of UAVs, two performance metrics, i.e., multi-cell coverage probability and volume spectral efficiency, are proposed. Their explicit low-complexity expressions are derived and their upper limits are found when each of the UAVs and ground BSs is equipped with a massive antenna array. We further show that the multi-cell coverage probability and the volume spectral efficiency can be maximized by optimally deploying and positioning the UAVs in the sky and thereby their fundamental maximal limits are found. These important analytical findings are validated by numerical simulations.
Frontal Screens on Head-Mounted Displays to Increase Awareness of the HMD Users' State in Mixed Presence Collaboration
Venue: arXiv cs.HC 2019
Year: 2019

In the everyday context, e.g., a household, HMD users remain a part of the social life for Non-HMD users being co-located with them. Due to the social context situations arise that demand interaction between the HMD and the Non-HMD user. We focus on the challenge that the Non-HMD user is not able to interpret the HMD user's state -- e.g., attentiveness; the need for assistance --, as the HMD covers the wearer's face. We propose a front facing display attached to the HMD that supports collaboration by showing the state. We explore the impact of abstract and realistic visualizations for such displays on collaborative performance and social presence in a within-subject user study (N=25). We present to the Non-HMD user (1) a blank screen (baseline), (2) textual representation of the user's state and (3) a representation that looks like the HMD is see-through. The results show positive effects for textual representation on collaborative performance and a positive effect of realistic representation on social presence. We conclude that when developing HMDs we need to take into account the social needs of everyday life to reduce the risk of social separation in a household context.
Closed Loop Load Model Identification Using Small Disturbance Data
Venue: arXiv cs.SY 2019
Year: 2019

Load model identification using small disturbance data is studied. It is proved that the individual load to be identified and the rest of the system forms a closed-loop system. Then, the impacts of disturbances entering the feedforward channel (internal disturbance) and feedback channel (external disturbance) on relationship between load inputs and outputs are examined analytically. It is found out that relationship between load inputs and outputs is not determined by load itself (feedforward transfer function) only, but also related with equivalent network matrix (feedback transfer function). Thus, load identification is closed loop identification essentially and the impact of closed loop identification cannot be neglected when using small disturbance data to identify load parameters. Closed loop load model identification can be solved by prediction error method (PEM). Implementation of PEM based on a Kalman filtering formulation is detailed. Identification results using simulated data demonstrates the correctness and significance of theoretical analysis.
Recommending Dream Jobs in a Biased Real World
Venue: arXiv cs.IR 2019
Year: 2019

Machine learning models learn what we teach them to learn. Machine learning is at the heart of recommender systems. If a machine learning model is trained on biased data, the resulting recommender system may reflect the biases in its recommendations. Biases arise at different stages in a recommender system, from existing societal biases in the data such as the professional gender gap, to biases introduced by the data collection or modeling processes. These biases impact the performance of various components of recommender systems, from offline training, to evaluation and online serving of recommendations in production systems. Specific techniques can help reduce bias at each stage of a recommender system. Reducing bias in our recommender systems is crucial to successfully recommending dream jobs to hundreds of millions members worldwide, while being true to LinkedIn's vision: "To create economic opportunity for every member of the global workforce".
Extensions to Justification Theory
Venue: arXiv cs.LO 2019
Year: 2019

Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge representation languages covered by justification theory include logic programs, argumentation frameworks, inductive definitions, and nested inductive and coinductive definitions. In addition, justifications are also used for implementation purposes. They are used to compute unfounded sets in modern ASP solvers, can be used to check for relevance of atoms in complete search algorithms, and recent lazy grounding algorithms are built on top of them. In this extended abstract, we lay out possible extensions to justification theory.
TAPESTRY: A Blockchain based Service for Trusted Interaction Online
Venue: arXiv cs.CR 2019
Year: 2019

We present a novel blockchain based service for proving the provenance of online digital identity, exposed as an assistive tool to help non-expert users make better decisions about whom to trust online. Our service harnesses the digital personhood (DP); the longitudinal and multi-modal signals created through users' lifelong digital interactions, as a basis for evidencing the provenance of identity. We describe how users may exchange trust evidence derived from their DP, in a granular and privacy-preserving manner, with other users in order to demonstrate coherence and longevity in their behaviour online. This is enabled through a novel secure infrastructure combining hybrid on- and off-chain storage combined with deep learning for DP analytics and visualization. We show how our tools enable users to make more effective decisions on whether to trust unknown third parties online, and also to spot behavioural deviations in their own social media footprints indicative of account hijacking.
Neural Query Language: A Knowledge Base Query Language for Tensorflow
Venue: arXiv cs.LG 2019
Year: 2019

Large knowledge bases (KBs) are useful for many AI tasks, but are difficult to integrate into modern gradient-based learning systems. Here we describe a framework for accessing soft symbolic database using only differentiable operators. For example, this framework makes it easy to conveniently write neural models that adjust confidences associated with facts in a soft KB; incorporate prior knowledge in the form of hand-coded KB access rules; or learn to instantiate query templates using information extracted from text. NQL can work well with KBs with millions of tuples and hundreds of thousands of entities on a single GPU.
3D Semantic Scene Completion from a Single Depth Image using Adversarial Training
Venue: arXiv cs.CV 2019
Year: 2019

We address the task of 3D semantic scene completion, i.e. , given a single depth image, we predict the semantic labels and occupancy of voxels in a 3D grid representing the scene. In light of the recently introduced generative adversarial networks (GAN), our goal is to explore the potential of this model and the efficiency of various important design choices. Our results show that using conditional GANs outperforms the vanilla GAN setup. We evaluate these architecture designs on several datasets. Based on our experiments, we demonstrate that GANs are able to outperform the performance of a baseline 3D CNN in case of clean annotations, but they suffer from poorly aligned annotations.
Optimizing the Linear Fascicle Evaluation Algorithm for Multi-Core and Many-Core Systems
Venue: arXiv cs.DC 2019
Year: 2019

Sparse matrix-vector multiplication (SpMV) operations are commonly used in various scientific applications. The performance of the SpMV operation often depends on exploiting regularity patterns in the matrix. Various representations have been proposed to minimize the memory bandwidth bottleneck arising from the irregular memory access pattern involved. Among recent representation techniques, tensor decomposition is a popular one used for very large but sparse matrices. Post sparse-tensor decomposition, the new representation involves indirect accesses, making it challenging to optimize for multi-cores and GPUs. Computational neuroscience algorithms often involve sparse datasets while still performing long-running computations on them. The LiFE application is a popular neuroscience algorithm used for pruning brain connectivity graphs. The datasets employed herein involve the Sparse Tucker Decomposition (STD), a widely used tensor decomposition method. Using this decomposition leads to irregular array references, making it very difficult to optimize for both CPUs and GPUs. Recent codes of the LiFE algorithm show that its SpMV operations are the key bottleneck for performance and scaling. In this work, we first propose target-independent optimizations to optimize these SpMV operations, followed by target-dependent optimizations for CPU and GPU systems. The target-independent techniques include: (1) standard compiler optimizations, (2) data restructuring methods, and (3) methods to partition computations among threads. Then we present the optimizations for CPUs and GPUs to exploit platform-specific speed. Our highly optimized CPU code obtain a speedup of 27.12x over the original sequential CPU code running on 16-core Intel Xeon (Skylake-based) system, and our optimized GPU code achieves a speedup of 5.2x over a reference optimized GPU code version on NVIDIA's GeForce RTX 2080 Ti GPU.
Regularized Evolutionary Algorithm for Dynamic Neural Topology Search
Venue: arXiv cs.NE 2019
Year: 2019

Designing neural networks for object recognition requires considerable architecture engineering. As a remedy, neuro-evolutionary network architecture search, which automatically searches for optimal network architectures using evolutionary algorithms, has recently become very popular. Although very effective, evolutionary algorithms rely heavily on having a large population of individuals (i.e., network architectures) and is therefore memory expensive. In this work, we propose a Regularized Evolutionary Algorithm with low memory footprint to evolve a dynamic image classifier. In details, we introduce novel custom operators that regularize the evolutionary process of a micro-population of 10 individuals. We conduct experiments on three different digits datasets (MNIST, USPS, SVHN) and show that our evolutionary method obtains competitive results with the current state-of-the-art.
Food Recommendation: Framework, Existing Solutions and Challenges
Venue: arXiv cs.CY 2019
Year: 2019

A growing proportion of the global population is becoming overweight or obese, leading to various diseases (e.g., diabetes, ischemic heart disease and even cancer) due to unhealthy eating patterns, such as increased intake of food with high energy and high fat. Food recommendation is of paramount importance to alleviate this problem. Unfortunately, modern multimedia research has enhanced the performance and experience of multimedia recommendation in many fields such as movies and POI, yet largely lags in the food domain. This article proposes a unified framework for food recommendation, and identifies main issues affecting food recommendation including building the personal model, analyzing unique food characteristics, incorporating various context and domain knowledge. We then review existing solutions for these issues, and finally elaborate research challenges and future directions in this field. To our knowledge, this is the first survey that targets the study of food recommendation in the multimedia field and offers a collection of research studies and technologies to benefit researchers in this field.
Transfer and Online Reinforcement Learning in STT-MRAM Based Embedded Systems for Autonomous Drones
Venue: arXiv cs.OH 2019
Year: 2019

In this paper we present an algorithm-hardware codesign for camera-based autonomous flight in small drones. We show that the large write-latency and write-energy for nonvolatile memory (NVM) based embedded systems makes them unsuitable for real-time reinforcement learning (RL). We address this by performing transfer learning (TL) on metaenvironments and RL on the last few layers of a deep convolutional network. While the NVM stores the meta-model from TL, an on-die SRAM stores the weights of the last few layers. Thus all the real-time updates via RL are carried out on the SRAM arrays. This provides us with a practical platform with comparable performance as end-to-end RL and 83.4% lower energy per image frame
MAVBench: Micro Aerial Vehicle Benchmarking
Venue: arXiv cs.RO 2019
Year: 2019

Unmanned Aerial Vehicles (UAVs) are getting closer to becoming ubiquitous in everyday life. Among them, Micro Aerial Vehicles (MAVs) have seen an outburst of attention recently, specifically in the area with a demand for autonomy. A key challenge standing in the way of making MAVs autonomous is that researchers lack the comprehensive understanding of how performance, power, and computational bottlenecks affect MAV applications. MAVs must operate under a stringent power budget, which severely limits their flight endurance time. As such, there is a need for new tools, benchmarks, and methodologies to foster the systematic development of autonomous MAVs. In this paper, we introduce the `MAVBench' framework which consists of a closed-loop simulator and an end-to-end application benchmark suite. A closed-loop simulation platform is needed to probe and understand the intra-system (application data flow) and inter-system (system and environment) interactions in MAV applications to pinpoint bottlenecks and identify opportunities for hardware and software co-design and optimization. In addition to the simulator, MAVBench provides a benchmark suite, the first of its kind, consisting of a variety of MAV applications designed to enable computer architects to perform characterization and develop future aerial computing systems. Using our open source, end-to-end experimental platform, we uncover a hidden, and thus far unexpected compute to total system energy relationship in MAVs. Furthermore, we explore the role of compute by presenting three case studies targeting performance, energy and reliability. These studies confirm that an efficient system design can improve MAV's battery consumption by up to 1.8X.
IPC: A Benchmark Data Set for Learning with Graph-Structured Data
Venue: arXiv cs.LG 2019
Year: 2019

Benchmark data sets are an indispensable ingredient of the evaluation of graph-based machine learning methods. We release a new data set, compiled from International Planning Competitions (IPC), for benchmarking graph classification, regression, and related tasks. Apart from the graph construction (based on AI planning problems) that is interesting in its own right, the data set possesses distinctly different characteristics from popularly used benchmarks. The data set, named IPC, consists of two self-contained versions, grounded and lifted, both including graphs of large and skewedly distributed sizes, posing substantial challenges for the computation of graph models such as graph kernels and graph neural networks. The graphs in this data set are directed and the lifted version is acyclic, offering the opportunity of benchmarking specialized models for directed (acyclic) structures. Moreover, the graph generator and the labeling are computer programmed; thus, the data set may be extended easily if a larger scale is desired. The data set is accessible from \url{https://github.com/IBM/IPC-graph-data}.
Controlled CNN-based Sequence Labeling for Aspect Extraction
Venue: arXiv cs.CL 2019
Year: 2019

One key task of fine-grained sentiment analysis on reviews is to extract aspects or features that users have expressed opinions on. This paper focuses on supervised aspect extraction using a modified CNN called controlled CNN (Ctrl). The modified CNN has two types of control modules. Through asynchronous parameter updating, it prevents over-fitting and boosts CNN's performance significantly. This model achieves state-of-the-art results on standard aspect extraction datasets. To the best of our knowledge, this is the first paper to apply control modules to aspect extraction.
Specifying and Reasoning about Contextual Preferences in the Goal-oriented Requirements Modelling
Venue: arXiv cs.SE 2019
Year: 2019

Goal-oriented requirements variability modelling has established the understanding for adaptability in the early stage of software development-the Requirements Engineering phase. Goal-oriented requirements variability modelling considers both the intentions, which are captured as goals in goal models, and the preferences of different stakeholders as the main sources of system behaviour variability. Most often, however, intentions and preferences vary according to contexts. In this paper, we propose an approach for a contextual preference-based requirements variability analysis in the goal-oriented Requirements Engineering. We introduce a quantitative contextual preference specification to express the varying preferences imposed over requirements that are represented in the goal model. Such contextual preferences are used as criteria to evaluate alternative solutions that satisfy the requirements variability problem. We utilise a state-of-the-art reasoning implementation from the Answer Set Programming domain to automate the derivation and evaluation of solutions that fulfill the goals and satisfy the contextual preferences. Our approach will support systems analysts in their decisions upon alternative design solutions that define subsequent system implementations.
Investigating Channel Pruning through Structural Redundancy Reduction -- A Statistical Study
Venue: arXiv cs.CV 2019
Year: 2019

Most existing channel pruning methods formulate the pruning task from a perspective of inefficiency reduction which iteratively rank and remove the least important filters, or find the set of filters that minimizes some reconstruction errors after pruning. In this work, we investigate the channel pruning from a new perspective with statistical modeling. We hypothesize that the number of filters at a certain layer reflects the level of 'redundancy' in that layer and thus formulate the pruning problem from the aspect of redundancy reduction. Based on both theoretic analysis and empirical studies, we make an important discovery: randomly pruning filters from layers of high redundancy outperforms pruning the least important filters across all layers based on the state-of-the-art ranking criterion. These results advance our understanding of pruning and further testify to the recent findings that the structure of the pruned model plays a key role in the network efficiency as compared to inherited weights.
Principles of lossless adjustable one-ports
Venue: arXiv cs.SY 2019
Year: 2019

This paper explores the possibility to construct two-terminal mechanical devices (one-ports) which are lossless and adjustable. To be lossless, the device must be passive (i.e. not requiring a power supply) and non-dissipative. To be adjustable, a parameter of the device should be freely variable in real time as a control input. For the simplest lossless one ports, the spring and inerter, the question is whether the stiffness and inertance may be varied freely in a lossless manner. We will show that the typical laws which have been proposed for adjustable springs and inerters are necessarily active and that it is not straightforward to modify them to achieve losslessness, or indeed passivity. By means of a physical construction using a lever with moveable fulcrum we will derive device laws for adjustable springs and inerters which satisfy a formal definition of losslessness. We further provide a construction method which does not require a power supply for physically realisable translational and rotary springs and inerters. The analogous questions for lossless adjustable electrical devices are examined.