OpenRaiser/Intern-Atlas huggingface dataset:
Intrinsic and Extrinsic Motivation Modeling Essential for Multi-Modal Health Recommender Systems
Venue: arXiv cs.CY 2018
Year: 2018

Managing health lays the core foundation to enabling quality life experiences. Modern computer science research, and especially the field of recommender systems, has enhanced the quality of experiences in fields such as entertainment, shopping, and advertising; yet lags in the health domain. We are developing an approach to leverage multimedia for human health based on motivation modeling and recommendation of actions. Health is primarily a product of our everyday lifestyle actions, yet we have minimal health guidance on making everyday choices. Recommendations are the key to modern content consumption and decisions. Furthermore, long-term engagement with recommender systems is key for true effectiveness. Distinguishing intrinsic and extrinsic motivations from multi-modal data is key to provide recommendations that primarily fuel the intrinsic intentions, while using extrinsic motivation to further support intrinsic motivation. This understanding builds the foundation of sustainable behavioral adaptation for optimal personalized lifestyle health benefits.
Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding with Side Information
Venue: arXiv cs.IT 2018
Year: 2018

This paper considers the problem of source coding with side information at the decoder, also called Slepian-Wolf source coding scheme. In practical applications of this coding scheme, the statistical relation between the source and the side information can vary from one data transmission to another, and there is a need to adapt the coding rate depending on the current statistical relation. In this paper, we propose a novel rate-adaptive code construction based on LDPC codes for the Slepian-Wolf source coding scheme. The proposed code design method allows to optimize the code degree distributions at all the considered rates, while minimizing the amount of short cycles in the parity check matrices at all rates. Simulation results show that the proposed method greatly reduces the source coding rate compared to the standard LDPCA solution.
The Effect of Security Education and Expertise on Security Assessments: the Case of Software Vulnerabilities
Venue: arXiv cs.CY 2018
Year: 2018

In spite of the growing importance of software security and the industry demand for more cyber security expertise in the workforce, the effect of security education and experience on the ability to assess complex software security problems has only been recently investigated. As proxy for the full range of software security skills, we considered the problem of assessing the severity of software vulnerabilities by means of a structured analysis methodology widely used in industry (i.e. the Common Vulnerability Scoring System (\CVSS) v3), and designed a study to compare how accurately individuals with background in information technology but different professional experience and education in cyber security are able to assess the severity of software vulnerabilities. Our results provide some structural insights into the complex relationship between education or experience of assessors and the quality of their assessments. In particular we find that individual characteristics matter more than professional experience or formal education; apparently it is the \emph{combination} of skills that one owns (including the actual knowledge of the system under study), rather than the specialization or the years of experience, to influence more the assessment quality. Similarly, we find that the overall advantage given by professional expertise significantly depends on the composition of the individual security skills as well as on the available information.
Triangle Lasso for Simultaneous Clustering and Optimization in Graph Datasets
Venue: arXiv cs.LG 2018
Year: 2018

Recently, network lasso has drawn many attentions due to its remarkable performance on simultaneous clustering and optimization. However, it usually suffers from the imperfect data (noise, missing values etc), and yields sub-optimal solutions. The reason is that it finds the similar instances according to their features directly, which is usually impacted by the imperfect data, and thus returns sub-optimal results. In this paper, we propose triangle lasso to avoid its disadvantage. Triangle lasso finds the similar instances according to their neighbours. If two instances have many common neighbours, they tend to become similar. Although some instances are profiled by the imperfect data, it is still able to find the similar counterparts. Furthermore, we develop an efficient algorithm based on Alternating Direction Method of Multipliers (ADMM) to obtain a moderately accurate solution. In addition, we present a dual method to obtain the accurate solution with the low additional time consumption. We demonstrate through extensive numerical experiments that triangle lasso is robust to the imperfect data. It usually yields a better performance than the state-of-the-art method when performing data analysis tasks in practical scenarios.
A Semi-Supervised and Inductive Embedding Model for Churn Prediction of Large-Scale Mobile Games
Venue: arXiv cs.LG 2018
Year: 2018

Mobile gaming has emerged as a promising market with billion-dollar revenues. A variety of mobile game platforms and services have been developed around the world. One critical challenge for these platforms and services is to understand user churn behavior in mobile games. Accurate churn prediction will benefit many stakeholders such as game developers, advertisers, and platform operators. In this paper, we present the first large-scale churn prediction solution for mobile games. In view of the common limitations of the state-of-the-art methods built upon traditional machine learning models, we devise a novel semi-supervised and inductive embedding model that jointly learns the prediction function and the embedding function for user-app relationships. We model these two functions by deep neural networks with a unique edge embedding technique that is able to capture both contextual information and relationship dynamics. We also design a novel attributed random walk technique that takes into consideration both topological adjacency and attribute similarities. To evaluate the performance of our solution, we collect real-world data from the Samsung Game Launcher platform that includes tens of thousands of games and hundreds of millions of user-app interactions. The experimental results with this data demonstrate the superiority of our proposed model against existing state-of-the-art methods.
Safe Intersection Management for Mixed Transportation Systems with Human-Driven and Autonomous Vehicles
Venue: arXiv cs.SY 2018
Year: 2018

Most recent studies on establishing intersection safety focus on the situation where all vehicles are fully autonomous. However, currently most vehicles are human-driven and so we will need to transition through regimes featuring a varying proportion of human-driven vehicles ranging from 100\% to 0\% before realizing such a fully autonomous future -- if ever. We will, therefore, need to address the safety of hybrid systems featuring an arbitrary mixture of human-driven and autonomous vehicles. In fact, recent incidents involving autonomous vehicles have already highlighted the need to study the safety of autonomous vehicles co-existing with human-driven vehicles. Motivated by this we address the design of provably safe intersection management for mixed traffic consisting of a mix of human-driven vehicles (HVs) as well as autonomous vehicles (AVs). To analyze such mixed traffic, we model HVs as nearsighted and with relatively loose constraints, permitting worst-case behavior while AVs are considered as capable of following much tighter constraints. HVs are allowed freedom to change their speed at any time while AVs are only allowed to change their speed beginning of a time slot through a Model Predictive Controller (MPC). AVs are assumed to possess a shorter response time and stronger braking capability than HVs in collision avoidance. Moreover, AVs obtain the permissions of passing through the intersection through vehicle-to-infrastructure (V2I) communication, while HVs achieve the same objective by following traffic lights. Taking the above differences into consideration, we propose a provably safe intersection management for mixed traffic comprised of an MPC-based protocol for AVs along with a coordination protocol for traffic lights...
On the Optimality of Ergodic Trajectories for Information Gathering Tasks
Venue: arXiv cs.SY 2018
Year: 2018

Recently, ergodic control has been suggested as a means to guide mobile sensors for information gathering tasks. In ergodic control, a mobile sensor follows a trajectory that is ergodic with respect to some information density distribution. A trajectory is ergodic if time spent in a state space region is proportional to the information density of the region. Although ergodic control has shown promising experimental results, there is little understanding of why it works or when it is optimal. In this paper, we study a problem class under which optimal information gathering trajectories are ergodic. This class relies on a submodularity assumption for repeated measurements from the same state. It is assumed that information available in a region decays linearly with time spent there. This assumption informs selection of the horizon used in ergodic trajectory generation. We support our claims with a set of experiments that demonstrate the link between ergodicity, optimal information gathering, and submodularity.
A Hybrid Differential Evolution Approach to Designing Deep Convolutional Neural Networks for Image Classification
Venue: arXiv cs.NE 2018
Year: 2018

Convolutional Neural Networks (CNNs) have demonstrated their superiority in image classification, and evolutionary computation (EC) methods have recently been surging to automatically design the architectures of CNNs to save the tedious work of manually designing CNNs. In this paper, a new hybrid differential evolution (DE) algorithm with a newly added crossover operator is proposed to evolve the architectures of CNNs of any lengths, which is named DECNN. There are three new ideas in the proposed DECNN method. Firstly, an existing effective encoding scheme is refined to cater for variable-length CNN architectures; Secondly, the new mutation and crossover operators are developed for variable-length DE to optimise the hyperparameters of CNNs; Finally, the new second crossover is introduced to evolve the depth of the CNN architectures. The proposed algorithm is tested on six widely-used benchmark datasets and the results are compared to 12 state-of-the-art methods, which shows the proposed method is vigorously competitive to the state-of-the-art algorithms. Furthermore, the proposed method is also compared with a method using particle swarm optimisation with a similar encoding strategy named IPPSO, and the proposed DECNN outperforms IPPSO in terms of the accuracy.
Channel Estimation for One-Bit Massive MIMO Systems Exploiting Spatio-Temporal Correlations
Venue: arXiv cs.IT 2018
Year: 2018

Massive multiple-input multiple-output (MIMO) can improve the overall system performance significantly. Massive MIMO systems, however, may require a large number of radio frequency (RF) chains that could cause high cost and power consumption issues. One of promising approaches to resolve these issues is using low-resolution analog-to-digital converters (ADCs) at base stations. Channel estimation becomes a difficult task by using low-resolution ADCs though. This paper addresses the channel estimation problem for massive MIMO systems using one-bit ADCs when the channels are spatially and temporally correlated. Based on the Bussgang decomposition, which reformulates a non-linear one-bit quantization to a statistically equivalent linear operator, the Kalman filter is used to estimate the spatially and temporally correlated channel by assuming the quantized noise follows a Gaussian distribution. Numerical results show that the proposed technique can improve the channel estimation quality significantly by properly exploiting the spatial and temporal correlations of channels.
Stochastic Modeling and Analysis of User-Centric Network MIMO Systems
Venue: arXiv cs.IT 2018
Year: 2018

This paper provides an analytical performance characterization of both uplink (UL) and downlink (DL) user-centric network multiple-input multiple-output (MIMO) systems, where a cooperating BS cluster is formed for each user individually and the clusters for different users may overlap. In this model, cooperating BSs (each equipped with multiple antennas) jointly perform zero-forcing beamforming to the set of single-antenna users associated with them. As compared to a baseline network MIMO systems with disjoint BS clusters, the effect of user-centric clustering is that it improves signal strength in both UL and DL, while reducing cluster-edge interference in DL. This paper quantifies these effects by assuming that BSs and users form Poisson point processes and by further approximating both the signal and interference powers using Gamma distributions of appropriate parameters. We show that BS cooperation provides significant gain as compared to single-cell processing for both UL and DL, but the advantage of user-centric clustering over the baseline disjoint clustering system is significant for the DL cluster-edge users only. Although the analytic results are derived with the assumption of perfect channel state information and infinite backhaul between the cooperating BSs, they nevertheless provide architectural insight into the design of future cooperative cellular networks.
Multi-task multiple kernel machines for personalized pain recognition from functional near-infrared spectroscopy brain signals
Venue: arXiv cs.LG 2018
Year: 2018

Currently there is no validated objective measure of pain. Recent neuroimaging studies have explored the feasibility of using functional near-infrared spectroscopy (fNIRS) to measure alterations in brain function in evoked and ongoing pain. In this study, we applied multi-task machine learning methods to derive a practical algorithm for pain detection derived from fNIRS signals in healthy volunteers exposed to a painful stimulus. Especially, we employed multi-task multiple kernel learning to account for the inter-subject variability in pain response. Our results support the use of fNIRS and machine learning techniques in developing objective pain detection, and also highlight the importance of adopting personalized analysis in the process.
Real-time Analog Pixel-to-pixel Dynamic Frame Differencing with Memristive Sensing Circuits
Venue: arXiv cs.ET 2018
Year: 2018

In this paper, we propose an analog pixel differencing circuit for differentiating pixels between frames directly from CMOS pixels. The analog information processing at sensor is a topic of growing appeal to develop edge AI devices. The proposed circuit is integrated into a pixel-parallel and pixel-column architectures. The proposed system is design using TSMC $180nm$ CMOS technology. The power dissipation of the proposed circuit is $96.64mW$, and on-chip ares is $531.66 μm^2$. The architectures are tested for moving object detection application.
FastReact: In-Network Control and Caching for Industrial Control Networks using Programmable Data Planes
Venue: arXiv cs.NI 2018
Year: 2018

Providing network reliability as well as low and predictable latency is important especially for Industrial Automation and Control Networks. However, diagnosing link status from the control plane has high latency and overhead. In addition, the communication with the industrial controller may impose additional network latency. We present FastReact - a system enabling In-Network monitoring, control and caching for Industrial Automation and Control Networks. FastReact outsources simple monitoring and control actions to evolving programmable data planes using the P4 language. As instructed by the Industrial Controller through a Northbound API, the SDN controller composes control actions using Boolean Logic which are then installed in the data plane. The data plane parses and caches sensor values and performs simple calculations on them which are connected to fast control actions that are executed locally. For resiliency, FastReact monitors liveness and response of sensors/actuators and performs a fast local link repair in the data plane if a link failure is detected. Our testbed measurement show that FastReact can reduce the sensor/actuator delay while being resilient against several failure events.
Optimum Transmission Rate in Fading Channels with Markovian Sources and QoS Constraints
Venue: arXiv cs.IT 2018
Year: 2018

This paper evaluates the performance of reliability and latency in machine type communication networks, which composed of single transmitter and receiver in the presence of Rayleigh fading channel. The source's traffic arrivals are modeled as Markovian processes namely Discrete-Time Markov process, Fluid Markov process, and Markov Modulated Poisson process, and delay/buffer overflow constraints are imposed. Our approach is based on the reliability and latency outage probability, where transmitter not knowing the channel condition, therefore the transmitter would be transmitting information over the fixed rate. The fixed rate transmission is modeled as a two state Discrete time Markov process, which identifies the reliability level of wireless transmission. Using effective bandwidth and effective capacity theories, we evaluate the trade-off between reliability-latency and identify QoS requirement. The impact of different source traffic originated from MTC devices under QoS constraints on the effective transmission rate are investigated.
Deep Learned Full-3D Object Completion from Single View
Venue: arXiv cs.CV 2018
Year: 2018

3D geometry is a very informative cue when interacting with and navigating an environment. This writing proposes a new approach to 3D reconstruction and scene understanding, which implicitly learns 3D geometry from depth maps pairing a deep convolutional neural network architecture with an auto-encoder. A data set of synthetic depth views and voxelized 3D representations is built based on ModelNet, a large-scale collection of CAD models, to train networks. The proposed method offers a significant advantage over current, explicit reconstruction methods in that it learns key geometric features offline and makes use of those to predict the most probable reconstruction of an unseen object. The relatively small network, consisting of roughly 4 million weights, achieves a 92.9% reconstruction accuracy at a 30x30x30 resolution through the use of a pre-trained decompression layer. This is roughly 1/4 the weights of the current leading network. The fast execution time of the model makes it suitable for real-time applications.
Monotone Drawings of $k$-Inner Planar Graphs
Venue: arXiv cs.CG 2018
Year: 2018

A $k$-inner planar graph is a planar graph that has a plane drawing with at most $k$ {internal vertices}, i.e., vertices that do not lie on the boundary of the outer face of its drawing. An outerplanar graph is a $0$-inner planar graph. In this paper, we show how to construct a monotone drawing of a $k$-inner planar graph on a $2(k+1)n \times 2(k+1)n$ grid. In the special case of an outerplanar graph, we can produce a planar monotone drawing on a $n \times n$ grid, improving previously known results.
Robust Chemical Circuits
Venue: arXiv cs.ET 2018
Year: 2018

We introduce a new motif for constructing robust digital logic circuits using input/output chemical reaction networks. These chemical circuits robustly handle perturbations in input signals, initial concentrations, rate constants, and measurements. In particular, we show that all combinatorial circuits and several sequential circuits enjoy this robustness. Our results complement existing literature in the following three ways: (1) our logic gates read their inputs catalytically which make `fanout' gates unnecessary; (2) formal requirements and rigorous proofs of satisfaction are provided for each circuit; and (3) robustness of every circuit is closed under modular composition.
MLPdf: An Effective Machine Learning Based Approach for PDF Malware Detection
Venue: arXiv cs.CR 2018
Year: 2018

Due to the popularity of portable document format (PDF) and increasing number of vulnerabilities in major PDF viewer applications, malware writers continue to use it to deliver malware via web downloads, email attachments and other methods in both targeted and non-targeted attacks. The topic on how to effectively block malicious PDF documents has received huge research interests in both cyber security industry and academia with no sign of slowing down. In this paper, we propose a novel approach based on a multilayer perceptron (MLP) neural network model, termed MLPdf, for the detection of PDF based malware. More specifically, the MLPdf model uses a backpropagation algorithm with stochastic gradient decent search for model update. A group of high quality features are extracted from two real-world datasets which comprise around 105000 benign and malicious PDF documents. Evaluation results indicate that the proposed MLPdf approach exhibits excellent performance which significantly outperforms all evaluated eight well known commercial anti-virus scanners with a much higher true positive rate of 95.12% achieved while maintaining a very low false positive rate of 0.08%.
Resource Allocation for Cooperative D2D-Enabled Wireless Caching Networks
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, we study the resource allocation problem for a cooperative device-to-device (D2D)-enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D links. To enhance the throughput of spectrum sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links (CDLs) and non-cooperative D2D links (NDLs), which is NP-hard. To solve the problem, we decompose it into two subproblems that maximize the sum rates of the CDLs and the NDLs, respectively. For CDL optimization, we propose a semi-orthogonal-based algorithm for joint user scheduling and power allocation. For NDL optimization, we propose a novel low-complexity algorithm to perform link scheduling and develop a Difference of Convex functions (D.C.) programming method to solve the non-convex power allocation problem. Simulation results show that the cooperative transmission can significantly increase both the number of served users and the overall system throughput.
Student Cluster Competition 2017, Team University ofTexas at Austin/Texas State University: Reproducing Vectorization of the Tersoff Multi-Body Potential on the Intel Skylake and NVIDIA V100 Architectures
Venue: arXiv cs.DC 2018
Year: 2018

This paper satisfies the reproducibility challenge of the Student Cluster Competition at Supercomputing 2017. We attempted to reproduce the results of Höhnerbach et al. (2016) for an implementation of a vectorized code for the Tersoff multi-body potential kernel of the molecular dynamics code Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS). We investigated accuracy, optimization performance, and scaling with our Intel CPU and NVIDIA GPU based cluster.