OpenRaiser/Intern-Atlas huggingface dataset:
Improving rewards in overloaded real-time systems
Venue: arXiv cs.PF 2018
Year: 2018

Competitive analysis of online algorithms has commonly been applied to understand the behaviour of real-time systems during overload conditions. While competitive analysis provides insight into the behaviour of certain algorithms, it is hard to make inferences about the performance of those algorithms in practice. Other approaches to dealing with overload resort to heuristics that seem to perform well but are hard to prove as being good. Further, most work on handling overload in real-time systems does not consider using information regarding the distribution of arrival rates of jobs and execution times to make scheduling decisions. We present an scheduling policy (obtained through stochastic approximation, and using information about the workload) to handle overload in real-time systems and improve the revenue earned when each successful job completion results in revenue accrual. We prove that the policy we outline does lead to increased revenue when compared to a class of scheduling policies that make static resource allocations to different service classes. We also use empirical evidence to underscore the fact that this policy performs better than a variety of other scheduling policies. The ideas presented can be applied to several soft real-time systems, specifically systems with multiple service classes.
An Explainable Adversarial Robustness Metric for Deep Learning Neural Networks
Venue: arXiv cs.CR 2018
Year: 2018

Deep Neural Networks(DNN) have excessively advanced the field of computer vision by achieving state of the art performance in various vision tasks. These results are not limited to the field of vision but can also be seen in speech recognition and machine translation tasks. Recently, DNNs are found to poorly fail when tested with samples that are crafted by making imperceptible changes to the original input images. This causes a gap between the validation and adversarial performance of a DNN. An effective and generalizable robustness metric for evaluating the performance of DNN on these adversarial inputs is still missing from the literature. In this paper, we propose Noise Sensitivity Score (NSS), a metric that quantifies the performance of a DNN on a specific input under different forms of fix-directional attacks. An insightful mathematical explanation is provided for deeply understanding the proposed metric. By leveraging the NSS, we also proposed a skewness based dataset robustness metric for evaluating a DNN's adversarial performance on a given dataset. Extensive experiments using widely used state of the art architectures along with popular classification datasets, such as MNIST, CIFAR-10, CIFAR-100, and ImageNet, are used to validate the effectiveness and generalization of our proposed metrics. Instead of simply measuring a DNN's adversarial robustness in the input domain, as previous works, the proposed NSS is built on top of insightful mathematical understanding of the adversarial attack and gives a more explicit explanation of the robustness.
SoPhie: An Attentive GAN for Predicting Paths Compliant to Social and Physical Constraints
Venue: arXiv cs.CV 2018
Year: 2018

This paper addresses the problem of path prediction for multiple interacting agents in a scene, which is a crucial step for many autonomous platforms such as self-driving cars and social robots. We present \textit{SoPhie}; an interpretable framework based on Generative Adversarial Network (GAN), which leverages two sources of information, the path history of all the agents in a scene, and the scene context information, using images of the scene. To predict a future path for an agent, both physical and social information must be leveraged. Previous work has not been successful to jointly model physical and social interactions. Our approach blends a social attention mechanism with a physical attention that helps the model to learn where to look in a large scene and extract the most salient parts of the image relevant to the path. Whereas, the social attention component aggregates information across the different agent interactions and extracts the most important trajectory information from the surrounding neighbors. SoPhie also takes advantage of GAN to generates more realistic samples and to capture the uncertain nature of the future paths by modeling its distribution. All these mechanisms enable our approach to predict socially and physically plausible paths for the agents and to achieve state-of-the-art performance on several different trajectory forecasting benchmarks.
Semi-Supervised Clustering with Neural Networks
Venue: arXiv cs.LG 2018
Year: 2018

Clustering using neural networks has recently demonstrated promising performance in machine learning and computer vision applications. However, the performance of current approaches is limited either by unsupervised learning or their dependence on large set of labeled data samples. In this paper, we propose ClusterNet that uses pairwise semantic constraints from very few labeled data samples (<5% of total data) and exploits the abundant unlabeled data to drive the clustering approach. We define a new loss function that uses pairwise semantic similarity between objects combined with constrained k-means clustering to efficiently utilize both labeled and unlabeled data in the same framework. The proposed network uses convolution autoencoder to learn a latent representation that groups data into k specified clusters, while also learning the cluster centers simultaneously. We evaluate and compare the performance of ClusterNet on several datasets and state of the art deep clustering approaches.
Predicting the temporal activity patterns of new venues
Venue: arXiv cs.SI 2018
Year: 2018

Estimating revenue and business demand of a newly opened venue is paramount as these early stages often involve critical decisions such as first rounds of staffing and resource allocation. Traditionally, this estimation has been performed through coarse-grained measures such as observing numbers in local venues or venues at similar places (e.g., coffee shops around another station in the same city). The advent of crowdsourced data from devices and services carried by individuals on a daily basis has opened up the possibility of performing better predictions of temporal visitation patterns for locations and venues. In this paper, using mobility data from Foursquare, a location-centric platform, we treat venue categories as proxies for urban activities and analyze how they become popular over time. The main contribution of this work is a prediction framework able to use characteristic temporal signatures of places together with k-nearest neighbor metrics capturing similarities among urban regions, to forecast weekly popularity dynamics of a new venue establishment in a city neighborhood. We further show how we are able to forecast the popularity of the new venue after one month following its opening by using locality and temporal similarity as features. For the evaluation of our approach we focus on London. We show that temporally similar areas of the city can be successfully used as inputs of predictions of the visit patterns of new venues, with an improvement of 41% compared to a random selection of wards as a training set for the prediction task. We apply these concepts of temporally similar areas and locality to the real-time predictions related to new venues and show that these features can effectively be used to predict the future trends of a venue. Our findings have the potential to impact the design of location-based technologies and decisions made by new business owners.
Explaining Away Syntactic Structure in Semantic Document Representations
Venue: arXiv cs.CL 2018
Year: 2018

Most generative document models act on bag-of-words input in an attempt to focus on the semantic content and thereby partially forego syntactic information. We argue that it is preferable to keep the original word order intact and explicitly account for the syntactic structure instead. We propose an extension to the Neural Variational Document Model (Miao et al., 2016) that does exactly that to separate local (syntactic) context from the global (semantic) representation of the document. Our model builds on the variational autoencoder framework to define a generative document model based on next-word prediction. We name our approach Sequence-Aware Variational Autoencoder since in contrast to its predecessor, it operates on the true input sequence. In a series of experiments we observe stronger topicality of the learned representations as well as increased robustness to syntactic noise in our training data.
Adaptive twisting sliding mode control for quadrotor unmanned aerial vehicles
Venue: arXiv cs.SY 2018
Year: 2018

This work addresses the problem of robust attitude control of quadcopters. First, the mathematical model of the quadcopter is derived considering factors such as nonlinearity, external disturbances, uncertain dynamics and strong coupling. An adaptive twisting sliding mode control algorithm is then developed with the objective of controlling the quadcopter to track desired attitudes under various conditions. For this, the twisting sliding mode control law is modified with a proposed gain adaptation scheme to improve the control transient and tracking performance. Extensive simulation studies and comparisons with experimental data have been carried out for a Solo quadcopter. The results show that the proposed control scheme can achieve strong robustness against disturbances while is adaptable to parametric variations.
RG Smoothing Algorithm Which Makes Data Compression
Venue: arXiv cs.NA 2018
Year: 2018

I describe a new method for smoothing a one-dimensional curve in Euclidian space with an arbitrary number of dimensions. The basic idea is borrowed from renormalization group theory which previously was applied to biological macromolecules. There are two crucial differences from other smoothing methods which make the algorithm unique: data compression and recursive implementation. One of the simplest forms of the method that is described in this article has only one free parameter - the number of iterative steps. This means that hardware implementation should be relatively easy because each loop is simple and strictly defined. The method could be beneficially applied to pattern recognition and data compression in future studies.
Graph Saliency Maps through Spectral Convolutional Networks: Application to Sex Classification with Brain Connectivity
Venue: arXiv cs.CV 2018
Year: 2018

Graph convolutional networks (GCNs) allow to apply traditional convolution operations in non-Euclidean domains, where data are commonly modelled as irregular graphs. Medical imaging and, in particular, neuroscience studies often rely on such graph representations, with brain connectivity networks being a characteristic example, while ultimately seeking the locus of phenotypic or disease-related differences in the brain. These regions of interest (ROIs) are, then, considered to be closely associated with function and/or behaviour. Driven by this, we explore GCNs for the task of ROI identification and propose a visual attribution method based on class activation mapping. By undertaking a sex classification task as proof of concept, we show that this method can be used to identify salient nodes (brain regions) without prior node labels. Based on experiments conducted on neuroimaging data of more than 5000 participants from UK Biobank, we demonstrate the robustness of the proposed method in highlighting reproducible regions across individuals. We further evaluate the neurobiological relevance of the identified regions based on evidence from large-scale UK Biobank studies.
LSTM Benchmarks for Deep Learning Frameworks
Venue: arXiv cs.LG 2018
Year: 2018

This study provides benchmarks for different implementations of LSTM units between the deep learning frameworks PyTorch, TensorFlow, Lasagne and Keras. The comparison includes cuDNN LSTMs, fused LSTM variants and less optimized, but more flexible LSTM implementations. The benchmarks reflect two typical scenarios for automatic speech recognition, notably continuous speech recognition and isolated digit recognition. These scenarios cover input sequences of fixed and variable length as well as the loss functions CTC and cross entropy. Additionally, a comparison between four different PyTorch versions is included. The code is available online https://github.com/stefbraun/rnn_benchmarks.
Achieving Data Dissemination with Security using FIWARE and Intel Software Guard Extensions (SGX)
Venue: arXiv cs.CR 2018
Year: 2018

The Internet of Things (IoT) field has gained much attention from industry and academia, being the main subject for numerous research and development projects. Frequently, the dense amount of generated data from IoT applications is sent to a cloud service, that is responsible for processing and storage. Many of these applications demand security and privacy for their data because of their sensitive nature. This is specially true when such data must be processed in entities hosted in public clouds, where the environment in which applications run may not be trusted. Some concerns are then raised since it is not trivial to provide the needed protection for these sensitive data. We present a solution that considers the security components of FIWARE and the Intel SGX capabilities. FIWARE is a platform created to support the development of Smart Applications, including IoT systems, and SGX is the Intel solution for Trusted Execution Environment (TEE). We propose a new component for key management that, together with other FIWARE components, can be used to provide privacy, confidentiality, and integrity guarantees for IoT data. A case study illustrates how this proposed solution can be employed in a realistic scenario, which allows the dissemination of sensitive data through public clouds without risking privacy issues. The results of the experiments provide evidence that our approach does not harm scalability or availability of the system. In addition, it presents acceptable memory costs when considering the benefit of the privacy guarantees achieved.
Y-Net: A deep Convolutional Neural Network for Polyp Detection
Venue: arXiv cs.CV 2018
Year: 2018

Colorectal polyps are important precursors to colon cancer, the third most common cause of cancer mortality for both men and women. It is a disease where early detection is of crucial importance. Colonoscopy is commonly used for early detection of cancer and precancerous pathology. It is a demanding procedure requiring significant amount of time from specialized physicians and nurses, in addition to a significant miss-rates of polyps by specialists. Automated polyp detection in colonoscopy videos has been demonstrated to be a promising way to handle this problem. {However, polyps detection is a challenging problem due to the availability of limited amount of training data and large appearance variations of polyps. To handle this problem, we propose a novel deep learning method Y-Net that consists of two encoder networks with a decoder network. Our proposed Y-Net method} relies on efficient use of pre-trained and un-trained models with novel sum-skip-concatenation operations. Each of the encoders are trained with encoder specific learning rate along the decoder. Compared with the previous methods employing hand-crafted features or 2-D/3-D convolutional neural network, our approach outperforms state-of-the-art methods for polyp detection with 7.3% F1-score and 13% recall improvement.
Reduced-Order Modeling through Machine Learning Approaches for Brittle Fracture Applications
Venue: arXiv cs.CE 2018
Year: 2018

In this paper, five different approaches for reduced-order modeling of brittle fracture in geomaterials, specifically concrete, are presented and compared. Four of the five methods rely on machine learning (ML) algorithms to approximate important aspects of the brittle fracture problem. In addition to the ML algorithms, each method incorporates different physics-based assumptions in order to reduce the computational complexity while maintaining the physics as much as possible. This work specifically focuses on using the ML approaches to model a 2D concrete sample under low strain rate pure tensile loading conditions with 20 preexisting cracks present. A high-fidelity finite element-discrete element model is used to both produce a training dataset of 150 simulations and an additional 35 simulations for validation. Results from the ML approaches are directly compared against the results from the high-fidelity model. Strengths and weaknesses of each approach are discussed and the most important conclusion is that a combination of physics-informed and data-driven features are necessary for emulating the physics of crack propagation, interaction and coalescence. All of the models presented here have runtimes that are orders of magnitude faster than the original high-fidelity model and pave the path for developing accurate reduced order models that could be used to inform larger length-scale models with important sub-scale physics that often cannot be accounted for due to computational cost.
Truth in Web Mining: Measuring the Profitability and Cost of Cryptominers as a Web Monetization Model
Venue: arXiv cs.CR 2018
Year: 2018

The recent advances of web-based cryptomining libraries along with the whopping market value of cryptocoins have convinced an increasing number of publishers to switch to web mining as a source of monetization for their websites. The conditions could not be better nowadays: the inevitable arms race between adblockers and advertisers is at its peak with publishers caught in the crossfire. But, can cryptomining be the next primary monetization model in the post advertising era of free Internet? In this paper, we respond to this exact question. In particular, we compare the profitability of cryptomining and advertising to assess the most advantageous option for a content provider. In addition, we measure the costs imposed to the user in each case with regards to power consumption, resources utilization, network traffic, device temperature and user experience. Our results show that cryptomining can surpass the profitability of advertising under specific circumstances, however users need to sustain a significant cost on their devices.
Joint Estimation of Age and Gender from Unconstrained Face Images using Lightweight Multi-task CNN for Mobile Applications
Venue: arXiv cs.CV 2018
Year: 2018

Automatic age and gender classification based on unconstrained images has become essential techniques on mobile devices. With limited computing power, how to develop a robust system becomes a challenging task. In this paper, we present an efficient convolutional neural network (CNN) called lightweight multi-task CNN for simultaneous age and gender classification. Lightweight multi-task CNN uses depthwise separable convolution to reduce the model size and save the inference time. On the public challenging Adience dataset, the accuracy of age and gender classification is better than baseline multi-task CNN methods.
Energy-Constrained UAV Trajectory Design for Ground Node Localization
Venue: arXiv cs.NI 2018
Year: 2018

The use of aerial anchors for localizing terrestrial nodes has recently been recognized as a cost-effective, swift and flexible solution for better localization accuracy, providing localization services when the GPS is jammed or satellite reception is not possible. In this paper, the localization of terrestrial nodes when using mobile unmanned aerial vehicles (UAVs) as aerial anchors is presented. We propose a novel framework to derive localization error in urban areas. In contrast to the existing works, our framework includes height-dependent UAV to ground channel characteristics and a highly detailed UAV energy consumption model. This enables us to explore different tradeoffs and optimize UAV trajectory for minimum localization error. In particular, we investigate the impact of UAV altitude, hovering time, number of waypoints and path length through formulating an energy-constrained optimization problem. Our results show that increasing the hovering time decreases the localization error considerably at the cost of a higher energy consumption. To keep the localization error below 100m, shorter hovering is only possible when the path altitude and radius are optimized. For a constant hovering time of 5 seconds, tuning both parameters to their optimal values brings the localization error from 150m down to 65m with a power saving around 25%
Analysis and Optimization for Weighted Sum Rate in Energy Harvesting Cooperative NOMA Systems
Venue: arXiv cs.IT 2018
Year: 2018

We consider a cooperative non-orthogonal multiple access system with radio frequency energy harvesting, in which a user with good channel harvests energy from its received signal and serves as a decode-and-forward relay for enhancing the performance of a user with poor channel. We here aim at maximizing the weighted sum rate of the system by optimizing the power allocation coefficient used at the source and the power splitting coefficient used at the user with good channel. By exploiting the specific structure of the considered problem, we propose a low-complexity one-dimensional search algorithm which can provide optimal solution to the problem. As a benchmark comparison, we derive analytic expressions and simple high signal-to-noise ratio (SNR) approximations of the ergodic rates achieved at two users and their weighted sum with fixed values of the power allocation and the power splitting coefficients, from which the scaling of the weighted sum in the high SNR region is revealed. Finally, we provided numerical results to demonstrate the validity of the optimized scheme. Index Terms-Cooperative NOMA, RF-energy harvesting, weighted sum rate analysis and optimization.
Instance Segmentation and Tracking with Cosine Embeddings and Recurrent Hourglass Networks
Venue: arXiv cs.CV 2018
Year: 2018

Different to semantic segmentation, instance segmentation assigns unique labels to each individual instance of the same class. In this work, we propose a novel recurrent fully convolutional network architecture for tracking such instance segmentations over time. The network architecture incorporates convolutional gated recurrent units (ConvGRU) into a stacked hourglass network to utilize temporal video information. Furthermore, we train the network with a novel embedding loss based on cosine similarities, such that the network predicts unique embeddings for every instance throughout videos. Afterwards, these embeddings are clustered among subsequent video frames to create the final tracked instance segmentations. We evaluate the recurrent hourglass network by segmenting left ventricles in MR videos of the heart, where it outperforms a network that does not incorporate video information. Furthermore, we show applicability of the cosine embedding loss for segmenting leaf instances on still images of plants. Finally, we evaluate the framework for instance segmentation and tracking on six datasets of the ISBI celltracking challenge, where it shows state-of-the-art performance.