OpenRaiser/Intern-Atlas huggingface dataset:
SSA-CNN: Semantic Self-Attention CNN for Pedestrian Detection
Venue: arXiv cs.CV 2019
Year: 2019

Pedestrian detection plays an important role in many applications such as autonomous driving. We propose a method that explores semantic segmentation results as self-attention cues to significantly improve the pedestrian detection performance. Specifically, a multi-task network is designed to jointly learn semantic segmentation and pedestrian detection from image datasets with weak box-wise annotations. The semantic segmentation feature maps are concatenated with corresponding convolution features maps to provide more discriminative features for pedestrian detection and pedestrian classification. By jointly learning segmentation and detection, our proposed pedestrian self-attention mechanism can effectively identify pedestrian regions and suppress backgrounds. In addition, we propose to incorporate semantic attention information from multi-scale layers into deep convolution neural network to boost pedestrian detection. Experiment results show that the proposed method achieves the best detection performance with MR of 6.27% on Caltech dataset and obtain competitive performance on CityPersons dataset while maintaining high computational efficiency.
Leveraging Knowledge Bases in LSTMs for Improving Machine Reading
Venue: arXiv cs.CL 2019
Year: 2019

This paper focuses on how to take advantage of external knowledge bases (KBs) to improve recurrent neural networks for machine reading. Traditional methods that exploit knowledge from KBs encode knowledge as discrete indicator features. Not only do these features generalize poorly, but they require task-specific feature engineering to achieve good performance. We propose KBLSTM, a novel neural model that leverages continuous representations of KBs to enhance the learning of recurrent neural networks for machine reading. To effectively integrate background knowledge with information from the currently processed text, our model employs an attention mechanism with a sentinel to adaptively decide whether to attend to background knowledge and which information from KBs is useful. Experimental results show that our model achieves accuracies that surpass the previous state-of-the-art results for both entity extraction and event extraction on the widely used ACE2005 dataset.
An Intrusion Using Malware and DDNS
Venue: arXiv cs.CR 2019
Year: 2019

This whitepaper captures the details of the technical alert numbered TA18-149A dated 29th May 2018 issued by the United States Computer Emergency Readiness Team.
Heterogeneity and Instability in the Stable Marriage Problem
Venue: arXiv cs.SI 2019
Year: 2019

The Stable Marriage Problem (SMP) has been extremely discussed in the literature and it is useful to a number of real-world applications. We propose a generalized version of the SMP in which numbers of the matching groups are different as in [9]. However, we go further to make a percentage of each group behave as active message senders. As such, the special case in which all Males are active messengers (beta = 1) and all Females are not active (alpha = 0) replicates the results in [9]. Moreover, we use numerical simulation to present three cases (and their extremes) in which we vary the percentage of active messengers in each group. Whereas we are able to replicate previous work, our numerical simulations also suggest that socially optimal comes only when the groups are homogeneous. More real-world like results are presented when members from both groups are active message senders.
Modularity as a Means for Complexity Management in Neural Networks Learning
Venue: arXiv cs.LG 2019
Year: 2019

Training a Neural Network (NN) with lots of parameters or intricate architectures creates undesired phenomena that complicate the optimization process. To address this issue we propose a first modular approach to NN design, wherein the NN is decomposed into a control module and several functional modules, implementing primitive operations. We illustrate the modular concept by comparing performances between a monolithic and a modular NN on a list sorting problem and show the benefits in terms of training speed, training stability and maintainability. We also discuss some questions that arise in modular NNs.
A Review on Automatic License Plate Recognition System
Venue: arXiv cs.CV 2019
Year: 2019

Automatic License Plate Recognition (ALPR) is a challenging problem to the research community due to its potential applicability in the diverse geographical condition over the globe with varying license plate parameters. Any ALPR system includes three main modules, viz. localization of the license plate, segmentation of the characters therein and recognition of the segmented characters. In real life applications where the images are captured over days and nights in an outdoor environment with varying lighting and weather conditions, varying pollution level and wind turbulences, localization, segmentation and recognition become challenging tasks. The tasks become more complex if the license plate is not in conformity with the standards laid by corresponding Motor Vehicles Department in terms of various features, e.g. area and aspect ratio of the license plate, background color, foreground color, shape, number of lines, font face/ size of characters, spacing between characters etc. Besides, license plates are often dirty or broken or having scratches or bent or tilted at its position. All these add to the challenges in developing an effective ALPR system.
Exploring a New Model for Mobile Positioning Based on CDR Data of The Cellular Networks
Venue: arXiv cs.NI 2019
Year: 2019

The emerging technologies related to mobile data especially CDR data has great potential for mobility and transportation applications. However, it presents some challenges due to its spatio-temporal characteristics and sparseness. Therefore, in this article, we introduced a new model to refine the positioning accuracy of mobile devices using only CDR data and coverage areas locations. The adopted method has three steps: first, we discovered which model of movement (Move, Stay) is associated with the coverage areas where the mobile device was connected using a Kalman filter. Then, simultaneously we estimated the location or the position of the device. Finally, we applied map-matching to bring the positioning to the right road segment. The results are very encouraging; nevertheless, there is some enhancement that can be done at the level of movement models and map matching. For example by introducing more sophisticated movement model based on data-driven modeling and a map matching that uses the movement model type detected by matching "Stay" location to buildings and "Move" model to roads.
Exploiting Moving Intelligence: Delay-Optimized Computation Offloading in Vehicular Fog Networks
Venue: arXiv cs.NI 2019
Year: 2019

Future vehicles will have rich computing resources to support autonomous driving and be connected by wireless technologies. Vehicular fog networks (VeFN) have thus emerged to enable computing resource sharing via computation task offloading, providing wide range of fog applications. However, the high mobility of vehicles makes it hard to guarantee the delay that accounts for both communication and computation throughout the whole task offloading procedure. In this article, we first review the state-of-the-art of task offloading in VeFN, and argue that mobility is not only an obstacle for timely computing in VeFN, but can also benefit the delay performance. We then identify machine learning and coded computing as key enabling technologies to address and exploit mobility in VeFN. Case studies are provided to illustrate how to adapt learning algorithms to fit for the dynamic environment in VeFN, and how to exploit the mobility with opportunistic computation offloading and task replication.
On Approximate Opacity of Cyber-Physical Systems
Venue: arXiv cs.SY 2019
Year: 2019

Opacity is an important information-flow security property in the analysis of cyber-physical systems. It captures the plausible deniability of the system's secret behavior in the presence of an intruder that may access the information flow. Existing works on opacity only consider non-metric systems by assuming that the intruder can always distinguish two different outputs precisely. In this paper, we extend the concept of opacity to systems whose output sets are equipped with metrics. Such systems are widely used in the modeling of many real-world systems whose measurements are physical signals. A new concept called approximate opacity is proposed in order to quantitatively evaluate the security guarantee level with respect to the measurement precision of the intruder. Then we propose a new simulation-type relation, called approximate opacity preserving simulation relation, which characterizes how close two systems are in terms of the satisfaction of approximate opacity. This allows us to verify approximate opacity for large-scale, or even infinite systems, using their abstractions. We also discuss how to construct approximate opacity preserving symbolic models for a class of discrete-time control systems. Our results extend the definitions and analysis techniques for opacity from non-metric systems to metric systems.
Adaptive Estimation for Approximate k-Nearest-Neighbor Computations
Venue: arXiv cs.DS 2019
Year: 2019

Algorithms often carry out equally many computations for "easy" and "hard" problem instances. In particular, algorithms for finding nearest neighbors typically have the same running time regardless of the particular problem instance. In this paper, we consider the approximate k-nearest-neighbor problem, which is the problem of finding a subset of O(k) points in a given set of points that contains the set of k nearest neighbors of a given query point. We propose an algorithm based on adaptively estimating the distances, and show that it is essentially optimal out of algorithms that are only allowed to adaptively estimate distances. We then demonstrate both theoretically and experimentally that the algorithm can achieve significant speedups relative to the naive method.
Duality between density function and value function with applications in constrained optimal control and Markov Decision Process
Venue: arXiv cs.SY 2019
Year: 2019

Density function describes the density of states in the state space of a dynamic system or a Markov Decision Process (MDP). Its evolution follows the Liouville equation. We show that the density function is the dual of the value function in the optimal control problems. By utilizing the duality, constraints that are hard to enforce in the primal value function optimization such as safety constraints in robot navigation, traffic capacity constraints in traffic flow control can be posed on the density function, and the constrained optimal control problem can be solved with a primal-dual algorithm that alternates between the primal and dual optimization. The primal optimization follows the standard optimal control algorithm with a perturbation term generated by the density constraint, and the dual problem solves the Liouville equation to get the density function under a fixed control strategy and updates the perturbation term. Moreover, the proposed method can be extended to the case with exogenous disturbance, and guarantee robust safety under the worst-case disturbance. We apply the proposed method to three examples, a robot navigation problem and a traffic control problem in sim, and a segway control problem with experiment.
Beyond Frequency: Utility Mining with Varied Item-Specific Minimum Utility
Venue: arXiv cs.DB 2019
Year: 2019

Utility-oriented mining which integrates utility theory and data mining is a useful tool for understanding economic consumer behavior. Traditional algorithms for mining high-utility patterns (HUPs) applies a single/uniform minimum high-utility threshold (minutil) to obtain the set of HUPs, but in some real-life circumstances, some specific products may bring lower utilities compared with others, but their profit may offer some vital information. However, if minutil is set high, the patterns with low minutil are missed; if minutil is set low, the number of patterns becomes unmanageable. In this paper, an efficient one-phase utility-oriented pattern mining algorithm, called HIMU, is proposed for mining HUPs with varied item-specific minimum utility. A novel tree structure called a multiple item utility set-enumeration tree (MIU-tree), the global sorted and the conditional downward closure properties are introduced in HIMU. In addition, we extended the compact utility-list structure to keep the necessary information, and thus this one-phase HIMU model greatly reduces the computational costs and memory requirements. Moreover, two pruning strategies are then extended to enhance the performance. We conducted extensive experiments in several synthetic and real-world datasets; the results indicates that the designed one-phase HIMU algorithm can address the "rare item problem" and has better performance than the state-of-the-art algorithms in terms of runtime, memory usage, and scalability. Furthermore, the enhanced algorithms outperform the non-optimized HIMU approach.
Utility-driven Data Analytics on Uncertain Data
Venue: arXiv cs.DB 2019
Year: 2019

Modern Internet of Things (IoT) applications generate massive amounts of data, much of it in the form of objects/items of readings, events, and log entries. Specifically, most of the objects in these IoT data contain rich embedded information (e.g., frequency and uncertainty) and different level of importance (e.g., unit utility of items, interestingness, cost, risk, or weight). Many existing approaches in data mining and analytics have limitations such as only the binary attribute is considered within a transaction, as well as all the objects/items having equal weights or importance. To solve these drawbacks, a novel utility-driven data analytics algorithm named HUPNU is presented, to extract High-Utility patterns by considering both Positive and Negative unit utilities from Uncertain data. The qualified high-utility patterns can be effectively discovered for risk prediction, manufacturing management, decision-making, among others. By using the developed vertical Probability-Utility list with the Positive-and-Negative utilities structure, as well as several effective pruning strategies. Experiments showed that the developed HUPNU approach performed great in mining the qualified patterns efficiently and effectively.
A game-theoretic analysis of DoS attacks on driverless vehicles
Venue: arXiv cs.GT 2019
Year: 2019

Driverless vehicles are expected to form the foundation of future connected transport infrastructure. A key weakness of connected vehicles is their vulnerability to physical-proximity attacks such as sensor saturation attacks. It is natural to study whether such attacks can be used to disrupt swarms of autonomous vehicles used as part of a large fleet providing taxi and courier delivery services. In this paper, we start to examine the strategic options available to attackers and defenders (autonomous-fleet operators) in such conflicts. We find that attackers have the upper hand in most cases and are able to carry out crippling denial-of-service attacks on fleets, by leveraging the inherent deficiencies of road networks identified by techniques from graph analysis. Experimental results on ten cities using real-world courier traces shows that most cities will require upgraded infrastructure to defend driverless vehicles against denial-of-service attacks. We found several hidden costs that impact equipment designers and operators of driverless vehicles - not least, that road-networks need to be redesigned for robustness against attacks thus raising some fundamental questions about the benefits.
Stochastic Modelling of the Flow-Front Evolution in a Vacuum Assisted Resin Transfer Moulding Process with Missing Data
Venue: arXiv cs.SY 2019
Year: 2019

The real-time fault monitoring and control of the Vacuum Assisted Resin Transfer Moulding (VARTM) production process requires a knowledge of the position of the epoxy flow-front inside the mould. Therefore, a fast and accurate flow-front tracking system capable of combining the underlying physics of the flow-front dynamics with the measured data is highly prized. Stochastic differential equations (SDEs) based grey-box models deliver a good trade-off between high fidelity models and data-driven black-box models for designing such a flow-front position tracking system. In this paper, we propose a simple yet novel coupled SDE based spatiotemporal grey-box model of the flow-front dynamics in case of missing sensor information. The proposed method uses the finite difference approximation of the spatial domain of the flow-front for estimating spatial flow pattern of the epoxy. Furthermore, to accommodate for the missing sensor data, we utilise a modified version of the continuous-discrete extended Kalman filter (CD-EKF) based estimation framework for SDEs that takes into consideration the effective dimension of the measurement space during the identification process. The performance of the method is evaluated for various common sensor faults scenarios at different levels of measurement noise and sampling rates.
Short-term Road Traffic Prediction based on Deep Cluster at Large-scale Networks
Venue: arXiv cs.LG 2019
Year: 2019

Short-term road traffic prediction (STTP) is one of the most important modules in Intelligent Transportation Systems (ITS). However, network-level STTP still remains challenging due to the difficulties both in modeling the diverse traffic patterns and tacking high-dimensional time series with low latency. Therefore, a framework combining with a deep clustering (DeepCluster) module is developed for STTP at largescale networks in this paper. The DeepCluster module is proposed to supervise the representation learning in a visualized way from the large unlabeled dataset. More specifically, to fully exploit the traffic periodicity, the raw series is first split into a number of sub-series for triplets generation. The convolutional neural networks (CNNs) with triplet loss are utilized to extract the features of shape by transferring the series into visual images. The shape-based representations are then used for road segments clustering. Thereafter, motivated by the fact that the road segments in a group have similar patterns, a model sharing strategy is further proposed to build recurrent NNs (RNNs)-based predictions through a group-based model (GM), instead of individual-based model (IM) in which one model are built for one road exclusively. Our framework can not only significantly reduce the number of models and cost, but also increase the number of training data and the diversity of samples. In the end, we evaluate the proposed framework over the network of Liuli Bridge in Beijing. Experimental results show that the DeepCluster can effectively cluster the road segments and GM can achieve comparable performance against the IM with less number of models.
A Data-driven Adaptive Controller Reconfiguration for Fault Mitigation: A Passivity Approach
Venue: arXiv cs.SY 2019
Year: 2019

This paper presents a new data-driven fault identification and controller reconfiguration algorithm. The presented algorithm relies only on the system's input and output data, and it does not require a detailed system description. The proposed algorithm detects changes in the input-output behavior of the system, whether due to faults or malicious attacks and then reacts by reconfiguring the existing controller. This method does not identify the internal structure of the system nor the extent and nature of the attack; hence it can quickly react to faults and attacks. The proposed method can be readily applied to various applications without significant modifications or tuning, as demonstrated by the examples in the paper.
Self-Selective Correlation Ship Tracking Method for Smart Ocean System
Venue: arXiv cs.CV 2019
Year: 2019

In recent years, with the development of the marine industry, navigation environment becomes more complicated. Some artificial intelligence technologies, such as computer vision, can recognize, track and count the sailing ships to ensure the maritime security and facilitates the management for Smart Ocean System. Aiming at the scaling problem and boundary effect problem of traditional correlation filtering methods, we propose a self-selective correlation filtering method based on box regression (BRCF). The proposed method mainly include: 1) A self-selective model with negative samples mining method which effectively reduces the boundary effect in strengthening the classification ability of classifier at the same time; 2) A bounding box regression method combined with a key points matching method for the scale prediction, leading to a fast and efficient calculation. The experimental results show that the proposed method can effectively deal with the problem of ship size changes and background interference. The success rates and precisions were higher than Discriminative Scale Space Tracking (DSST) by over 8 percentage points on the marine traffic dataset of our laboratory. In terms of processing speed, the proposed method is higher than DSST by nearly 22 Frames Per Second (FPS).
Optimal and Fast Real-time Resources Slicing with Deep Dueling Neural Networks
Venue: arXiv cs.NI 2019
Year: 2019

Effective network slicing requires an infrastructure/network provider to deal with the uncertain demand and real-time dynamics of network resource requests. Another challenge is the combinatorial optimization of numerous resources, e.g., radio, computing, and storage. This article develops an optimal and fast real-time resource slicing framework that maximizes the long-term return of the network provider while taking into account the uncertainty of resource demand from tenants. Specifically, we first propose a novel system model which enables the network provider to effectively slice various types of resources to different classes of users under separate virtual slices. We then capture the real-time arrival of slice requests by a semi-Markov decision process. To obtain the optimal resource allocation policy under the dynamics of slicing requests, e.g., uncertain service time and resource demands, a Q-learning algorithm is often adopted in the literature. However, such an algorithm is notorious for its slow convergence, especially for problems with large state/action spaces. This makes Q-learning practically inapplicable to our case in which multiple resources are simultaneously optimized. To tackle it, we propose a novel network slicing approach with an advanced deep learning architecture, called deep dueling that attains the optimal average reward much faster than the conventional Q-learning algorithm. This property is especially desirable to cope with real-time resource requests and the dynamic demands of users. Extensive simulations show that the proposed framework yields up to 40% higher long-term average return while being few thousand times faster, compared with state of the art network slicing approaches.
Analyzing the Use of Camera Glasses in the Wild
Venue: arXiv cs.HC 2019
Year: 2019

Camera glasses enable people to capture point-of-view videos using a common accessory, hands-free. In this paper, we investigate how, when, and why people used one such product: Spectacles. We conducted 39 semi-structured interviews and surveys with 191 owners of Spectacles. We found that the form factor elicits sustained usage behaviors, and opens opportunities for new use-cases and types of content captured. We provide a usage typology, and highlight societal and individual factors that influence the classification of behaviors.