OpenRaiser/Intern-Atlas huggingface dataset:
Localizing Actions from Video Labels and Pseudo-Annotations
Venue: arXiv cs.CV 2017
Year: 2017

The goal of this paper is to determine the spatio-temporal location of actions in video. Where training from hard to obtain box annotations is the norm, we propose an intuitive and effective algorithm that localizes actions from their class label only. We are inspired by recent work showing that unsupervised action proposals selected with human point-supervision perform as well as using expensive box annotations. Rather than asking users to provide point supervision, we propose fully automatic visual cues that replace manual point annotations. We call the cues pseudo-annotations, introduce five of them, and propose a correlation metric for automatically selecting and combining them. Thorough evaluation on challenging action localization datasets shows that we reach results comparable to results with full box supervision. We also show that pseudo-annotations can be leveraged during testing to improve weakly- and strongly-supervised localizers.
Quantum Enhanced Classical Sensor Networks
Venue: arXiv cs.IT 2017
Year: 2017

The quantum enhanced classical sensor network consists of $K$ clusters of $N_e$ entangled quantum states that have been trialled $r$ times, each feeding into a classical estimation process. Previous literature has shown that each cluster can {ideally} achieve an estimation variance of $1/N_e^2r$ for sufficient $r$. We begin by deriving the optimal values for the minimum mean squared error of this quantum enhanced classical system. We then show that if noise is \emph{absent} in the classical estimation process, the mean estimation error will decay like $Ω(1/KN_e^2r)$. However, when noise is \emph{present} we find that the mean estimation error will decay like $Ω(1/K)$, so that \emph{all} the sensing gains obtained from the individual quantum clusters will be lost.
Improving coreference resolution with automatically predicted prosodic information
Venue: arXiv cs.CL 2017
Year: 2017

Adding manually annotated prosodic information, specifically pitch accents and phrasing, to the typical text-based feature set for coreference resolution has previously been shown to have a positive effect on German data. Practical applications on spoken language, however, would rely on automatically predicted prosodic information. In this paper we predict pitch accents (and phrase boundaries) using a convolutional neural network (CNN) model from acoustic features extracted from the speech signal. After an assessment of the quality of these automatic prosodic annotations, we show that they also significantly improve coreference resolution.
A weighting strategy for Active Shape Models
Venue: arXiv cs.CV 2017
Year: 2017

Active Shape Models (ASM) are an iterative segmentation technique to find a landmark-based contour of an object. In each iteration, a least-squares fit of a plausible shape to some detected target landmarks is determined. Finding these targets is a critical step: some landmarks are more reliably detected than others, and some landmarks may not be within the field of view of their detectors. To add robustness while preserving simplicity at the same time, a generalized least-squares approach can be used, where a weighting matrix incorporates reliability information about the landmarks. We propose a strategy to choose this matrix, based on the covariance of empirically determined residuals of the fit. We perform a further step to determine whether the target landmarks are within the range of their detectors. We evaluate our strategy on fluoroscopic X-ray images to segment the femur. We show that our technique outperforms the standard ASM as well as other more heuristic weighted least-squares strategies.
Consistency models with global operation sequencing and their composition (extended version)
Venue: arXiv cs.DC 2017
Year: 2017

Modern distributed systems often achieve availability and scalability by providing consistency guarantees about the data they manage weaker than linearizability. We consider a class of such consistency models that, despite this weakening, guarantee that clients eventually agree on a global sequence of operations, while seeing a subsequence of this final sequence at any given point of time. Examples of such models include the classical Total Store Order (TSO) and recently proposed dual TSO, Global Sequence Protocol (GSP) and Ordered Sequential Consistency. We define a unified model, called Global Sequence Consistency (GSC), that has the above models as its special cases, and investigate its key properties. First, we propose a condition under which multiple objects each satisfying GSC can be composed so that the whole set of objects satisfies GSC. Second, we prove an interesting relationship between special cases of GSC---GSP, TSO and dual TSO: we show that clients that do not communicate out-of-band cannot tell the difference between these models. To obtain these results, we propose a novel axiomatic specification of GSC and prove its equivalence to the operational definition of the model.
Patterns of Multistakeholder Recommendation
Venue: arXiv cs.IR 2017
Year: 2017

Recommender systems are personalized information systems. However, in many settings, the end-user of the recommendations is not the only party whose needs must be represented in recommendation generation. Incorporating this insight gives rise to the notion of multistakeholder recommendation, in which the interests of multiple parties are represented in recommendation algorithms and evaluation. In this paper, we identify patterns of stakeholder utility that characterize different multistakeholder recommendation applications, and provide a taxonomy of the different possible systems, only some of which have currently been implemented.
Improved Face Detection and Alignment using Cascade Deep Convolutional Network
Venue: arXiv cs.CV 2017
Year: 2017

Real-world face detection and alignment demand an advanced discriminative model to address challenges by pose, lighting and expression. Illuminated by the deep learning algorithm, some convolutional neural networks based face detection and alignment methods have been proposed. Recent studies have utilized the relation between face detection and alignment to make models computationally efficiency, however they ignore the connection between each cascade CNNs. In this paper, we propose an structure to propose higher quality training data for End-to-End cascade network training, which give computers more space to automatic adjust weight parameter and accelerate convergence. Experiments demonstrate considerable improvement over existing detection and alignment models.
Online Inverse Reinforcement Learning via Bellman Gradient Iteration
Venue: arXiv cs.RO 2017
Year: 2017

This paper develops an online inverse reinforcement learning algorithm aimed at efficiently recovering a reward function from ongoing observations of an agent's actions. To reduce the computation time and storage space in reward estimation, this work assumes that each observed action implies a change of the Q-value distribution, and relates the change to the reward function via the gradient of Q-value with respect to reward function parameter. The gradients are computed with a novel Bellman Gradient Iteration method that allows the reward function to be updated whenever a new observation is available. The method's convergence to a local optimum is proved. This work tests the proposed method in two simulated environments, and evaluates the algorithm's performance under a linear reward function and a non-linear reward function. The results show that the proposed algorithm only requires a limited computation time and storage space, but achieves an increasing accuracy as the number of observations grows. We also present a potential application to robot cleaners at home.
Optimized Broadcast for Deep Learning Workloads on Dense-GPU InfiniBand Clusters: MPI or NCCL?
Venue: arXiv cs.DC 2017
Year: 2017

Dense Multi-GPU systems have recently gained a lot of attention in the HPC arena. Traditionally, MPI runtimes have been primarily designed for clusters with a large number of nodes. However, with the advent of MPI+CUDA applications and CUDA-Aware MPI runtimes like MVAPICH2 and OpenMPI, it has become important to address efficient communication schemes for such dense Multi-GPU nodes. This coupled with new application workloads brought forward by Deep Learning frameworks like Caffe and Microsoft CNTK pose additional design constraints due to very large message communication of GPU buffers during the training phase. In this context, special-purpose libraries like NVIDIA NCCL have been proposed for GPU-based collective communication on dense GPU systems. In this paper, we propose a pipelined chain (ring) design for the MPI_Bcast collective operation along with an enhanced collective tuning framework in MVAPICH2-GDR that enables efficient intra-/inter-node multi-GPU communication. We present an in-depth performance landscape for the proposed MPI_Bcast schemes along with a comparative analysis of NVIDIA NCCL Broadcast and NCCL-based MPI_Bcast. The proposed designs for MVAPICH2-GDR enable up to 14X and 16.6X improvement, compared to NCCL-based solutions, for intra- and inter-node broadcast latency, respectively. In addition, the proposed designs provide up to 7% improvement over NCCL-based solutions for data parallel training of the VGG network on 128 GPUs using Microsoft CNTK.
Gap Acceptance During Lane Changes by Large-Truck Drivers-An Image-Based Analysis
Venue: arXiv cs.SY 2017
Year: 2017

This paper presents an analysis of rearward gap acceptance characteristics of drivers of large trucks in highway lane change scenarios. The range between the vehicles was inferred from camera images using the estimated lane width obtained from the lane tracking camera as the reference. Six-hundred lane change events were acquired from a large-scale naturalistic driving data set. The kinematic variables from the image-based gap analysis were filtered by the weighted linear least squares in order to extrapolate them at the lane change time. In addition, the time-to-collision and required deceleration were computed, and potential safety threshold values are provided. The resulting range and range rate distributions showed directional discrepancies, i.e., in left lane changes, large trucks are often slower than other vehicles in the target lane, whereas they are usually faster in right lane changes. Video observations have confirmed that major motivations for changing lanes are different depending on the direction of move, i.e., moving to the left (faster) lane occurs due to a slower vehicle ahead or a merging vehicle on the right-hand side, whereas right lane changes are frequently made to return to the original lane after passing.
A compressive channel estimation technique robust to synchronization impairments
Venue: arXiv cs.IT 2017
Year: 2017

Initial access at millimeter wave frequencies is a challenging problem due to hardware non-idealities and low SNR measurements prior to beamforming. Prior work has exploited the observation that mmWave MIMO channels are sparse in the spatial angle domain and has used compressed sensing based algorithms for channel estimation. Most of them, however, ignore hardware impairments like carrier frequency offset and phase noise, and fail to perform well when such impairments are considered. In this paper, we develop a compressive channel estimation algorithm for narrowband mmWave systems, which is robust to such non idealities. We address this problem by constructing a tensor that models both the mmWave channel and CFO, and estimate the tensor while still exploiting the sparsity of the mmWave channel. Simulation results show that under the same settings, our method performs better than comparable algorithms that are robust to phase errors.
Joint CFO and Channel Estimation in Millimeter Wave Systems with One-Bit ADCs
Venue: arXiv cs.IT 2017
Year: 2017

We develop a method to jointly estimate the carrier frequency offset (CFO) and the narrowband channel in millimeter wave (mmWave) MIMO systems operating with one-bit analog-to-digital converters (ADCs). We assume perfect timing synchronization and transform the underlying CFO-channel optimization problem to a higher dimensional space using lifting techniques. Exploiting the sparsity of mmWave MIMO channels in the angle domain, we perform joint estimation by solving a noisy quantized compressed sensing problem of the lifted version, using generalized approximate message passing. Simulation results show that our method is able to recover both the channel and the CFO using one-bit measurements.
Advances in Security in Computing and Communications
Venue: arXiv cs.CR 2017
Year: 2017

In the era of Internet of Things (IoT) and with the explosive worldwide growth of electronic data volume, and associated need of processing, analysis, and storage of such humongous volume of data, several new challenges are faced in protect-ing privacy of sensitive data and securing systems by designing novel schemes for secure authentication, integrity protection, encryption, and non-repudiation. Lightweight symmetric key cryptography and adaptive network security algo-rithms are in demand for mitigating these challenges. This book presents some of the state-of-the-art research work in the field of cryptography and security in computing and communications. It is a valuable source of knowledge for re-searchers, engineers, practitioners, graduates, and doctoral students who are working in the field of cryptography, network security, and security and privacy issues in the Internet of Things (IoT). It will also be useful for faculty members of graduate schools and universities.
MLBench: How Good Are Machine Learning Clouds for Binary Classification Tasks on Structured Data?
Venue: arXiv cs.DC 2017
Year: 2017

We conduct an empirical study of machine learning functionalities provided by major cloud service providers, which we call machine learning clouds. Machine learning clouds hold the promise of hiding all the sophistication of running large-scale machine learning: Instead of specifying how to run a machine learning task, users only specify what machine learning task to run and the cloud figures out the rest. Raising the level of abstraction, however, rarely comes free - a performance penalty is possible. How good, then, are current machine learning clouds on real-world machine learning workloads? We study this question with a focus on binary classication problems. We present mlbench, a novel benchmark constructed by harvesting datasets from Kaggle competitions. We then compare the performance of the top winning code available from Kaggle with that of running machine learning clouds from both Azure and Amazon on mlbench. Our comparative study reveals the strength and weakness of existing machine learning clouds and points out potential future directions for improvement.
A collaborative citizen science platform for real-time volunteer computing and games
Venue: arXiv cs.CY 2017
Year: 2017

Volunteer computing (VC) or distributed computing projects are common in the citizen cyberscience (CCS) community and present extensive opportunities for scientists to make use of computing power donated by volunteers to undertake large-scale scientific computing tasks. Volunteer computing is generally a non-interactive process for those contributing computing resources to a project whereas volunteer thinking (VT) or distributed thinking, which allows volunteers to participate interactively in citizen cyberscience projects to solve human computation tasks. In this paper we describe the integration of three tools, the Virtual Atom Smasher (VAS) game developed by CERN, LiveQ, a job distribution middleware, and CitizenGrid, an online platform for hosting and providing computation to CCS projects. This integration demonstrates the combining of volunteer computing and volunteer thinking to help address the scientific and educational goals of games like VAS. The paper introduces the three tools and provides details of the integration process along with further potential usage scenarios for the resulting platform.
Sparse Vector Recovery: Bernoulli-Gaussian Message Passing
Venue: arXiv cs.IT 2017
Year: 2017

Low-cost message passing (MP) algorithm has been recognized as a promising technique for sparse vector recovery. However, the existing MP algorithms either focus on mean square error (MSE) of the value recovery while ignoring the sparsity requirement, or support error rate (SER) of the sparse support (non-zero position) recovery while ignoring its value. A novel low-complexity Bernoulli-Gaussian MP (BGMP) is proposed to perform the value recovery as well as the support recovery. Particularly, in the proposed BGMP, support-related Bernoulli messages and value-related Gaussian messages are jointly processed and assist each other. In addition, a strict lower bound is developed for the MSE of BGMP via the genie-aided minimum mean-square-error (GA-MMSE) method. The GA-MMSE lower bound is shown to be tight in high signal-to-noise ratio. Numerical results are provided to verify the advantage of BGMP in terms of final MSE, SER and convergence speed.
Learning to Match
Venue: arXiv cs.LG 2017
Year: 2017

Outsourcing tasks to previously unknown parties is becoming more common. One specific such problem involves matching a set of workers to a set of tasks. Even if the latter have precise requirements, the quality of individual workers is usually unknown. The problem is thus a version of matching under uncertainty. We believe that this type of problem is going to be increasingly important. When the problem involves only a single skill or type of job, it is essentially a type of bandit problem, and can be solved with standard algorithms. However, we develop an algorithm that can perform matching for workers with multiple skills hired for multiple jobs with multiple requirements. We perform an experimental evaluation in both single-task and multi-task problems, comparing with the bounded $ε$-first algorithm, as well as an oracle that knows the true skills of workers. One of the algorithms we developed gives results approaching 85\% of oracle's performance. We invite the community to take a closer look at this problem and develop real-world benchmarks.
Bitwise Retransmission Schemes for Resources Constrained Uplink Sensor Networks
Venue: arXiv cs.IT 2017
Year: 2017

Novel bitwise retransmission schemes are devised which retransmit only the bits received with small reliability. The retransmissions are used to accumulate the reliabilities of individual bits. Unlike the conventional automatic repeat request (ARQ) schemes, the proposed scheme does not require a checksum for the error detection. The bits to be retransmitted are reported as a combination number, or two synchronized random number generators (RNGs) at the transmitter and receiver are used to greatly compress the feedback message. The bitwise retransmission decisions and/or combining can be performed after the demodulation or after the channel decoding at the receiver. The bit-error rate (BER) expressions are derived for the case of one and two retransmissions, and verified by computer simulations. Assuming three specific retransmission strategies, the scheme parameters are optimized to minimize the overall BER. For the same number of retransmissions and packet length, the proposed schemes always outperform the frequently used stop-and-wait ARQ. The impact of feedback errors is also considered. Finally, practical designs of the bitwise retransmissions for data fusion from sensor nodes in Zigbee, Wifi and Bluetooth networks are presented.
Adaptive Second-order Sliding Mode Control of UAVs for Civil Applications
Venue: arXiv cs.SY 2017
Year: 2017

Quadcopters, as unmanned aerial vehicles (UAVs), have great potential in civil applications such as surveying, building monitoring, and infrastructure condition assessment. Quadcopters, however, are relatively sensitive to noises and disturbances so that their performance may be quickly downgraded in the case of inadequate control, system uncertainties and/or external disturbances. In this study, we deal with the quadrotor low-level control by proposing a robust scheme named the adaptive second-order quasi-continuous sliding mode control (adaptive 2-QCSM). The ultimate objective is for robust attitude control of the UAV in monitoring and inspection of built infrastructure. First, the mathematical model of the quadcopter is derived considering nonlinearity, strong coupling, uncertain dynamics and external disturbances. The control design includes the selection of the sliding manifold and the development of quasi-continuous second-order sliding mode controller with an adaptive gain. Stability of the overall control system is analysed by using a global Lyapunov function for convergence of both the sliding dynamics and adaptation scheme. Extensive simulations have been carried out for evaluation. Results show that the proposed controller can achieve robustness against disturbances or parameter variations and has better tracking performance in comparison with experimental responses of a UAV in a real-time monitoring task.
Energy-Efficient Resource Allocation for Ultra-reliable and Low-latency Communications
Venue: arXiv cs.IT 2017
Year: 2017

Ultra-reliable and low-latency communications (URLLC) is expected to be supported without compromising the resource usage efficiency. In this paper, we study how to maximize energy efficiency (EE) for URLLC under the stringent quality of service (QoS) requirement imposed on the end-to-end (E2E) delay and overall packet loss, where the E2E delay includes queueing delay and transmission delay, and the overall packet loss consists of queueing delay violation, transmission error with finite blocklength channel codes, and proactive packet dropping in deep fading. Transmit power, bandwidth and number of active antennas are jointly optimized to maximize the system EE under the QoS constraints. Since the achievable rate with finite blocklength channel codes is not convex in radio resources, it is challenging to optimize resource allocation. By analyzing the properties of the optimization problem, the global optimal solution is obtained. Simulation and numerical results validate the analysis and show that the proposed policy can improve EE significantly compared with existing policy.
Evaluating Music Recommender Systems for Groups
Venue: arXiv cs.AI 2017
Year: 2017

Recommendation to groups of users is a challenging and currently only passingly studied task. Especially the evaluation aspect often appears ad-hoc and instead of truly evaluating on groups of users, synthesizes groups by merging individual preferences. In this paper, we present a user study, recording the individual and shared preferences of actual groups of participants, resulting in a robust, standardized evaluation benchmark. Using this benchmarking dataset, that we share with the research community, we compare the respective performance of a wide range of music group recommendation techniques proposed in the