OpenRaiser/Intern-Atlas huggingface dataset:
DeepHPS: End-to-end Estimation of 3D Hand Pose and Shape by Learning from Synthetic Depth
Venue: arXiv cs.CV 2018
Year: 2018

Articulated hand pose and shape estimation is an important problem for vision-based applications such as augmented reality and animation. In contrast to the existing methods which optimize only for joint positions, we propose a fully supervised deep network which learns to jointly estimate a full 3D hand mesh representation and pose from a single depth image. To this end, a CNN architecture is employed to estimate parametric representations i.e. hand pose, bone scales and complex shape parameters. Then, a novel hand pose and shape layer, embedded inside our deep framework, produces 3D joint positions and hand mesh. Lack of sufficient training data with varying hand shapes limits the generalized performance of learning based methods. Also, manually annotating real data is suboptimal. Therefore, we present SynHand5M: a million-scale synthetic dataset with accurate joint annotations, segmentation masks and mesh files of depth maps. Among model based learning (hybrid) methods, we show improved results on our dataset and two of the public benchmarks i.e. NYU and ICVL. Also, by employing a joint training strategy with real and synthetic data, we recover 3D hand mesh and pose from real images in 3.7ms.
Resource Allocation for Co-Primary Spectrum Sharing in MIMO Networks
Venue: arXiv cs.NI 2018
Year: 2018

We study co-primary spectrum sharing concept in two small cell multiuser network. Downlink transmission is explored with Rayleigh fading in interfering broadcast channel. Both base stations and all the users are equipped with multiple antennas. Resource allocation with joint precoder and decoder design is proposed for weighted sum rate (WSR) maximization problem. The problem becomes mixed-integer and non-convex. We factor the main objective problem into two subproblems. First subproblem is multiuser with subcarrier allocation where we assume that each subcarrier can be allocated to multiple users. Gale-Shapley algorithm based on stable marriage problem and transportation method are implemented for subcarrier allocation part. For the second subproblem, a joint precoder and decoder design is proposed to obtain the optimal solution for WSR maximization. Monte Carlo simulation is employed to obtain the results.
A Joint Motion Model for Human-Like Robot-Human Handover
Venue: arXiv cs.RO 2018
Year: 2018

In future, robots will be present in everyday life. The development of these supporting robots is a challenge. A fundamental task for assistance robots is to pick up and hand over objects to humans. By interacting with users, soft factors such as predictability, safety and reliability become important factors for development. Previous works show that collaboration with robots is more acceptable when robots behave and move human-like. In this paper, we present a motion model based on the motion profiles of individual joints. These motion profiles are based on observations and measurements of joint movements in human-human handover. We implemented this joint motion model (JMM) on a humanoid and a non-humanoidal industrial robot to show the movements to subjects. Particular attention was paid to the recognizability and human similarity of the movements. The results show that people are able to recognize human-like movements and perceive the movements of the JMM as more human-like compared to a traditional model. Furthermore, it turns out that the differences between a linear joint space trajectory and JMM are more noticeable in an industrial robot than in a humanoid robot.
How Robust is 3D Human Pose Estimation to Occlusion?
Venue: arXiv cs.CV 2018
Year: 2018

Occlusion is commonplace in realistic human-robot shared environments, yet its effects are not considered in standard 3D human pose estimation benchmarks. This leaves the question open: how robust are state-of-the-art 3D pose estimation methods against partial occlusions? We study several types of synthetic occlusions over the Human3.6M dataset and find a method with state-of-the-art benchmark performance to be sensitive even to low amounts of occlusion. Addressing this issue is key to progress in applications such as collaborative and service robotics. We take a first step in this direction by improving occlusion-robustness through training data augmentation with synthetic occlusions. This also turns out to be an effective regularizer that is beneficial even for non-occluded test cases.
"Life never matters in the DEMOCRATS MIND": Examining Strategies of Retweeted Social Bots During a Mass Shooting Event
Venue: arXiv cs.CY 2018
Year: 2018

This exploratory study examines the strategies of social bots on Twitter that were retweeted following a mass shooting event. Using a case study method to frame our work, we collected over seven million tweets during a one-month period following a mass shooting in Parkland, Florida. From this dataset, we selected retweets of content generated by over 400 social bot accounts to determine what strategies these bots were using and the effectiveness of these strategies as indicated by the number of retweets. We employed qualitative and quantitative methods to capture both macro- and micro-level perspectives. Our findings suggest that bots engage in more diverse strategies than solely waging disinformation campaigns, including baiting and sharing information. Further, we found that while bots amplify conversation about mass shootings, humans were primarily responsible for disseminating bot-generated content. These findings add depth to the current understanding of bot strategies and their effectiveness. Understanding these strategies can inform efforts to combat dubious information as well as more insidious disinformation campaigns.
Proper circular arc graphs as intersection graphs of paths on a grid
Venue: arXiv cs.CG 2018
Year: 2018

In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
Polar Codes with Integrated Probabilistic Shaping for 5G New Radio
Venue: arXiv cs.IT 2018
Year: 2018

A modification to 5G New Radio (NR) polar code is proposed, which improves the error correction performance with higher order modulation through probabilistic shaping. The presented scheme mainly re-uses existing hardware at the transmitter, and modifications at the receiver are small. Simulation results show that the presented approach can improve the performance by up to 1dB for 256-QAM on AWGN channels
DLFuzz: Differential Fuzzing Testing of Deep Learning Systems
Venue: arXiv cs.SE 2018
Year: 2018

Deep learning (DL) systems are increasingly applied to safety-critical domains such as autonomous driving cars. It is of significant importance to ensure the reliability and robustness of DL systems. Existing testing methodologies always fail to include rare inputs in the testing dataset and exhibit low neuron coverage. In this paper, we propose DLFuzz, the frst differential fuzzing testing framework to guide DL systems exposing incorrect behaviors. DLFuzz keeps minutely mutating the input to maximize the neuron coverage and the prediction difference between the original input and the mutated input, without manual labeling effort or cross-referencing oracles from other DL systems with the same functionality. We present empirical evaluations on two well-known datasets to demonstrate its efficiency. Compared with DeepXplore, the state-of-the-art DL whitebox testing framework, DLFuzz does not require extra efforts to find similar functional DL systems for cross-referencing check, but could generate 338.59% more adversarial inputs with 89.82% smaller perturbations, averagely obtain 2.86% higher neuron coverage, and save 20.11% time consumption.
Reactive Synthesis: Branching Logics and Parameterized Systems
Venue: arXiv cs.LO 2018
Year: 2018

Reactive synthesis is an automatic way to translate a human intention expressed in some logic into a system of some kind. This thesis has two parts, devoted to logic and to systems. In Part I, we develop two new approaches to CTL* synthesis. The first approach consists of two extensions of the SMT-based bounded synthesis: one follows bottom-up CTL* model checking, another one follows the automata framework. The second approach reduces CTL* synthesis to LTL synthesis. The reduction turns any LTL synthesiser into a CTL* synthesiser. The two approaches were implemented and are available online. In Part II, we study parameterized synthesis for two system architectures. The first architecture is guarded systems and is inspired by cache coherence protocols. In guarded systems, processes transitions are enabled or disabled depending on the existence of other processes in certain local states. The existing cutoff results for guarded protocols are restricted to closed systems, and are of limited use for liveness properties. We close these gaps and prove tight cutoffs for open systems with liveness properties, and also cutoffs for detecting deadlocks. The second architecture is token-ring systems, where the single token circulates processes arranged in a ring. The experiments with the existing parameterized synthesis method showed that it does not scale to large specifications. First, we optimize the method by refining the cutoff reduction, using modularity and abstraction. The evaluation show several orders of magnitude speed-ups. Second, we perform parameterized synthesis case study on the industrial arbiter protocol AMBA. We describe new tricks ---a new cutoff extension and decompositional synthesis--- that, together with the previously described optimizations, allowed us to synthesize AMBA in a parameterized setting, for the first time.
Cluster-Wise Cooperative Eco-Approach and Departure Application for Connected and Automated Vehicles along Signalized Arterials
Venue: arXiv cs.SY 2018
Year: 2018

In recent years, various versions of the Eco-Approach and Departure (EAD) application have been developed and evaluated. This application utilizes Signal Phase and Timing (SPaT) information to allow connected and automated vehicles (CAVs) to approach and depart from a signalized intersection in an energy-efficient manner. To date, most existing work have studied the EAD application from an ego-vehicle perspective (Ego-EAD) using Vehicle-to-Infrastructure (V2I) communication, while relatively limited research takes into account cooperation among vehicles at intersections via Vehicle-to-Vehicle (V2V) communication. In this research, we developed a cluster-wise cooperative EAD (Coop-EAD) application for CAVs to further reduce energy consumption compared to existing Ego-EAD applications. Instead of considering CAVs traveling through signalized intersections one at a time, our approach strategically coordinates CAVs' maneuvers to form clusters using various operating modes: initial vehicle clustering, intra-cluster sequence optimization, and cluster formation control. The novel Coop-EAD algorithm is applied to the cluster leader, and CAVs in the cluster follow the cluster leader to conduct EAD maneuvers. A preliminary simulation study with a given scenario shows that, compared to an Ego-EAD application, the proposed Coop-EAD application achieves 11% reduction on energy consumption, up to 19.9% reduction on pollutant emissions, and 50% increase on traffic throughput, respectively.
Web-based Cryptojacking in the Wild
Venue: arXiv cs.CR 2018
Year: 2018

With the introduction of memory-bound cryptocurrencies, such as Monero, the implementation of mining code in browser-based JavaScript has become a worthwhile alternative to dedicated mining rigs. Based on this technology, a new form of parasitic computing, widely called cryptojacking or drive-by mining, has gained momentum in the web. A cryptojacking site abuses the computing resources of its visitors to covertly mine for cryptocurrencies. In this paper, we systematically explore this phenomenon. For this, we propose a 3-phase analysis approach, which enables us to identify mining scripts and conduct a large-scale study on the prevalence of cryptojacking in the Alexa 1 million websites. We find that cryptojacking is common, with currently 1 out of 500 sites hosting a mining script. Moreover, we perform several secondary analyses to gain insight into the cryptojacking landscape, including a measurement of code characteristics, an estimate of expected mining revenue, and an evaluation of current blacklist-based countermeasures.
Semantic Matching Against a Corpus: New Applications and Methods
Venue: arXiv cs.CL 2018
Year: 2018

We consider the case of a domain expert who wishes to explore the extent to which a particular idea is expressed in a text collection. We propose the task of semantically matching the idea, expressed as a natural language proposition, against a corpus. We create two preliminary tasks derived from existing datasets, and then introduce a more realistic one on disaster recovery designed for emergency managers, whom we engaged in a user study. On the latter, we find that a new model built from natural language entailment data produces higher-quality matches than simple word-vector averaging, both on expert-crafted queries and on ones produced by the subjects themselves. This work provides a proof-of-concept for such applications of semantic matching and illustrates key challenges.
Comparison of Two Theorem Provers: Isabelle/HOL and Coq
Venue: arXiv cs.LO 2018
Year: 2018

The need for formal definition of the very basis of mathematics arose in the last century. The scale and complexity of mathematics, along with discovered paradoxes, revealed the danger of accumulating errors across theories. Although, according to Gödel's incompleteness theorems, it is not possible to construct a single formal system which will describe all phenomena in the world, being complete and consistent at the same time, it gave rise to rather practical areas of logic, such as the theory of automated theorem proving. This is a set of techniques used to verify mathematical statements mechanically using logical reasoning. Moreover, it can be used to solve complex engineering problems as well, for instance, to prove the security properties of a software system or an algorithm. This paper compares two widespread tools for automated theorem proving, Isabelle/HOL and Coq, with respect to expressiveness, limitations and usability. For this reason, it firstly gives a brief introduction to the bases of formal systems and automated deduction theory, their main problems and challenges, and then provides detailed comparison of most notable features of the selected theorem provers with support of illustrative proof examples.
Short Plane Supports for Spatial Hypergraphs
Venue: arXiv cs.CG 2018
Year: 2018

A graph $G=(V,E)$ is a support of a hypergraph $H=(V,S)$ if every hyperedge induces a connected subgraph in $G$. Supports are used for certain types of hypergraph visualizations. In this paper we consider visualizing spatial hypergraphs, where each vertex has a fixed location in the plane. This is the case, e.g., when modeling set systems of geospatial locations as hypergraphs. By applying established aesthetic quality criteria we are interested in finding supports that yield plane straight-line drawings with minimum total edge length on the input point set $V$. We first show, from a theoretical point of view, that the problem is NP-hard already under rather mild conditions as well as a negative approximability results. Therefore, the main focus of the paper lies on practical heuristic algorithms as well as an exact, ILP-based approach for computing short plane supports. We report results from computational experiments that investigate the effect of requiring planarity and acyclicity on the resulting support length. Further, we evaluate the performance and trade-offs between solution quality and speed of several heuristics relative to each other and compared to optimal solutions.
Extended playing techniques: The next milestone in musical instrument recognition
Venue: arXiv cs.SD 2018
Year: 2018

The expressive variability in producing a musical note conveys information essential to the modeling of orchestration and style. As such, it plays a crucial role in computer-assisted browsing of massive digital music corpora. Yet, although the automatic recognition of a musical instrument from the recording of a single "ordinary" note is considered a solved problem, automatic identification of instrumental playing technique (IPT) remains largely underdeveloped. We benchmark machine listening systems for query-by-example browsing among 143 extended IPTs for 16 instruments, amounting to 469 triplets of instrument, mute, and technique. We identify and discuss three necessary conditions for significantly outperforming the traditional mel-frequency cepstral coefficient (MFCC) baseline: the addition of second-order scattering coefficients to account for amplitude modulation, the incorporation of long-range temporal dependencies, and metric learning using large-margin nearest neighbors (LMNN) to reduce intra-class variability. Evaluating on the Studio On Line (SOL) dataset, we obtain a precision at rank 5 of 99.7% for instrument recognition (baseline at 89.0%) and of 61.0% for IPT recognition (baseline at 44.5%). We interpret this gain through a qualitative assessment of practical usability and visualization using nonlinear dimensionality reduction.
Bringing personalized learning into computer-aided question generation
Venue: arXiv cs.HC 2018
Year: 2018

This paper proposes a novel and statistical method of ability estimation based on acquisition distribution for a personalized computer aided question generation. This method captures the learning outcomes over time and provides a flexible measurement based on the acquisition distributions instead of precalibration. Compared to the previous studies, the proposed method is robust, especially when an ability of a student is unknown. The results from the empirical data show that the estimated abilities match the actual abilities of learners, and the pretest and post-test of the experimental group show significant improvement. These results suggest that this method can serves as the ability estimation for a personalized computer-aided testing environment.
Enabling Visual Design Verification Analytics - From Prototype Visualizations to an Analytics Tool using the Unity Game Engine
Venue: arXiv cs.SE 2018
Year: 2018

The ever-increasing architectural complexity in contemporary ASIC projects turns Design Verification (DV) into a highly advanced endeavor. Pressing needs for short time-to-market has made automation a key solution in DV. However, recurring execution of large regression suites inevitably leads to challenging amounts of test results. Following the design science paradigm, we present an action research study to introduce visual analytics in a commercial ASIC project. We develop a cityscape visualization tool using the game engine Unity. Initial evaluations are promising, suggesting that the tool offers a novel approach to identify error-prone parts of the design, as well as coverage holes.
Superhighway: Bypass Data Sparsity in Cross-Domain CF
Venue: arXiv cs.IR 2018
Year: 2018

Cross-domain collaborative filtering (CF) aims to alleviate data sparsity in single-domain CF by leveraging knowledge transferred from related domains. Many traditional methods focus on enriching compared neighborhood relations in CF directly to address the sparsity problem. In this paper, we propose superhighway construction, an alternative explicit relation-enrichment procedure, to improve recommendations by enhancing cross-domain connectivity. Specifically, assuming partially overlapped items (users), superhighway bypasses multi-hop inter-domain paths between cross-domain users (items, respectively) with direct paths to enrich the cross-domain connectivity. The experiments conducted on a real-world cross-region music dataset and a cross-platform movie dataset show that the proposed superhighway construction significantly improves recommendation performance in both target and source domains.
Correlated Time Series Forecasting using Deep Neural Networks: A Summary of Results
Venue: arXiv cs.LG 2018
Year: 2018

Cyber-physical systems often consist of entities that interact with each other over time. Meanwhile, as part of the continued digitization of industrial processes, various sensor technologies are deployed that enable us to record time-varying attributes (a.k.a., time series) of such entities, thus producing correlated time series. To enable accurate forecasting on such correlated time series, this paper proposes two models that combine convolutional neural networks (CNNs) and recurrent neural networks (RNNs). The first model employs a CNN on each individual time series, combines the convoluted features, and then applies an RNN on top of the convoluted features in the end to enable forecasting. The second model adds additional auto-encoders into the individual CNNs, making the second model a multi-task learning model, which provides accurate and robust forecasting. Experiments on two real-world correlated time series data set suggest that the proposed two models are effective and outperform baselines in most settings. This report extends the paper "Correlated Time Series Forecasting using Multi-Task Deep Neural Networks," to appear in ACM CIKM 2018, by providing additional experimental results.
PS-Sim: A Framework for Scalable Simulation of Participatory Sensing Data
Venue: arXiv cs.NI 2018
Year: 2018

Emergence of smartphone and the participatory sensing (PS) paradigm have paved the way for a new variant of pervasive computing. In PS, human user performs sensing tasks and generates notifications, typically in lieu of incentives. These notifications are real-time, large-volume, and multi-modal, which are eventually fused by the PS platform to generate a summary. One major limitation with PS is the sparsity of notifications owing to lack of active participation, thus inhibiting large scale real-life experiments for the research community. On the flip side, research community always needs ground truth to validate the efficacy of the proposed models and algorithms. Most of the PS applications involve human mobility and report generation following sensing of any event of interest in the adjacent environment. This work is an attempt to study and empirically model human participation behavior and event occurrence distributions through development of a location-sensitive data simulation framework, called PS-Sim. From extensive experiments it has been observed that the synthetic data generated by PS-Sim replicates real participation and event occurrence behaviors in PS applications, which may be considered for validation purpose in absence of the groundtruth. As a proof-of-concept, we have used real-life dataset from a vehicular traffic management application to train the models in PS-Sim and cross-validated the simulated data with other parts of the same dataset.
Searching Toward Pareto-Optimal Device-Aware Neural Architectures
Venue: arXiv cs.LG 2018
Year: 2018

Recent breakthroughs in Neural Architectural Search (NAS) have achieved state-of-the-art performance in many tasks such as image classification and language understanding. However, most existing works only optimize for model accuracy and largely ignore other important factors imposed by the underlying hardware and devices, such as latency and energy, when making inference. In this paper, we first introduce the problem of NAS and provide a survey on recent works. Then we deep dive into two recent advancements on extending NAS into multiple-objective frameworks: MONAS and DPP-Net. Both MONAS and DPP-Net are capable of optimizing accuracy and other objectives imposed by devices, searching for neural architectures that can be best deployed on a wide spectrum of devices: from embedded systems and mobile devices to workstations. Experimental results are poised to show that architectures found by MONAS and DPP-Net achieves Pareto optimality w.r.t the given objectives for various devices.