OpenRaiser/Intern-Atlas huggingface dataset:
Optimal Channel Sensing Strategy for Cognitive Radio Networks with Heavy-Tailed Idle Times
Venue: arXiv cs.NI 2016
Year: 2016

In Cognitive Radio Network (CRN), the secondary user (SU) opportunistically access the wireless channels whenever they are free from the licensed / Primary User (PU). Even after occupying the channel, the SU has to sense the channel intermittently to detect reappearance of PU, so that it can stop its transmission and avoid interference to PU. Frequent channel sensing results in the degradation of SU's throughput whereas sparse sensing increases the interference experienced by the PU. Thus, optimal sensing interval policy plays a vital role in CRN. In the literature, optimal channel sensing strategy has been analysed for the case when the ON-OFF time distributions of PU are exponential. However, the analysis of recent spectrum measurement traces reveals that PU exhibits heavy-tailed idle times which can be approximated well with Hyper-exponential distribution (HED). In our work, we deduce the structure of optimal sensing interval policy for channels with HED OFF times through Markov Decision Process (MDP). We then use dynamic programming framework to derive sub-optimal sensing interval policies. A new Multishot sensing interval policy is proposed and it is compared with existing policies for its performance in terms of number of channel sensing and interference to PU.
Towards Predictable Real-Time Performance on Multi-Core Platforms
Venue: arXiv cs.DC 2016
Year: 2016

Cyber-physical systems (CPS) integrate sensing, computing, communication and actuation capabilities to monitor and control operations in the physical environment. A key requirement of such systems is the need to provide predictable real-time performance: the timing correctness of the system should be analyzable at design time with a quantitative metric and guaranteed at runtime with high assurance. This requirement of predictability is particularly important for safety-critical domains such as automobiles, aerospace, defense, manufacturing and medical devices. The work in this dissertation focuses on the challenges arising from the use of modern multi-core platforms in CPS. Even as of today, multi-core platforms are rarely used in safety-critical applications primarily due to the temporal interference caused by contention on various resources shared among processor cores, such as caches, memory buses, and I/O devices. Such interference is hard to predict and can significantly increase task execution time, e.g., up to 12x on commodity quad-core platforms. To address the problem of ensuring timing predictability on multi-core platforms, we develop novel analytical and systems techniques in this dissertation. Our proposed techniques theoretically bound temporal interference that tasks may suffer from when accessing shared resources. Our techniques also involve software primitives and algorithms for real-time operating systems and hypervisors, which significantly reduce the degree of the temporal interference. Specifically, we tackle the issues of cache and memory contention, locking and synchronization, interrupt handling, and access control for computational accelerators such as GPGPUs, all of which are crucial to achieving predictable real-time performance on a modern multi-core platform.
MIST: Missing Person Intelligence Synthesis Toolkit
Venue: arXiv cs.AI 2016
Year: 2016

Each day, approximately 500 missing persons cases occur that go unsolved/unresolved in the United States. The non-profit organization known as the Find Me Group (FMG), led by former law enforcement professionals, is dedicated to solving or resolving these cases. This paper introduces the Missing Person Intelligence Synthesis Toolkit (MIST) which leverages a data-driven variant of geospatial abductive inference. This system takes search locations provided by a group of experts and rank-orders them based on the probability assigned to areas based on the prior performance of the experts taken as a group. We evaluate our approach compared to the current practices employed by the Find Me Group and found it significantly reduces the search area - leading to a reduction of 31 square miles over 24 cases we examined in our experiments. Currently, we are using MIST to aid the Find Me Group in an active missing person case.
Modeling selectional restrictions in a relational type system
Venue: arXiv cs.CL 2016
Year: 2016

Selectional restrictions are semantic constraints on forming certain complex types in natural language. The paper gives an overview of modeling selectional restrictions in a relational type system with morphological and syntactic types. We discuss some foundations of the system and ways of formalizing selectional restrictions. Keywords: type theory, selectional restrictions, syntax, morphology
A Convex Model of Momentum Dynamics for Multi-Contact Motion Generation
Venue: arXiv cs.RO 2016
Year: 2016

Linear models for control and motion generation of humanoid robots have received significant attention in the past years, not only due to their well known theoretical guarantees, but also because of practical computational advantages. However, to tackle more challenging tasks and scenarios such as locomotion on uneven terrain, a more expressive model is required. In this paper, we are interested in contact interaction-centered motion optimization based on the momentum dynamics model. This model is non-linear and non-convex; however, we find a relaxation of the problem that allows us to formulate it as a single convex quadratically-constrained quadratic program (QCQP) that can be very efficiently optimized. Furthermore, experimental results suggest that this relaxation is tight and therefore useful for multi-contact planning. This convex model is then coupled to the optimization of end-effector contacts location using a mixed integer program, which can be solved in realtime. This becomes relevant e.g. to recover from external pushes, where a predefined stepping plan is likely to fail and an online adaptation of the contact location is needed. The performance of our algorithm is demonstrated in several multi-contact scenarios for humanoid robot.
A Non-Parametric Learning Approach to Identify Online Human Trafficking
Venue: arXiv cs.LG 2016
Year: 2016

Human trafficking is among the most challenging law enforcement problems which demands persistent fight against from all over the globe. In this study, we leverage readily available data from the website "Backpage"-- used for classified advertisement-- to discern potential patterns of human trafficking activities which manifest online and identify most likely trafficking related advertisements. Due to the lack of ground truth, we rely on two human analysts --one human trafficking victim survivor and one from law enforcement, for hand-labeling the small portion of the crawled data. We then present a semi-supervised learning approach that is trained on the available labeled and unlabeled data and evaluated on unseen data with further verification of experts.
A Novel Bilingual Word Embedding Method for Lexical Translation Using Bilingual Sense Clique
Venue: arXiv cs.CL 2016
Year: 2016

Most of the existing methods for bilingual word embedding only consider shallow context or simple co-occurrence information. In this paper, we propose a latent bilingual sense unit (Bilingual Sense Clique, BSC), which is derived from a maximum complete sub-graph of pointwise mutual information based graph over bilingual corpus. In this way, we treat source and target words equally and a separated bilingual projection processing that have to be used in most existing works is not necessary any more. Several dimension reduction methods are evaluated to summarize the BSC-word relationship. The proposed method is evaluated on bilingual lexicon translation tasks and empirical results show that bilingual sense embedding methods outperform existing bilingual word embedding methods.
Adapting polytopes dimension for managing degrees of freedom in tolerancing analysis
Venue: arXiv cs.CG 2016
Year: 2016

In tolerancing analysis, geometrical or contact specifications can be represented by polytopes. Due to the degrees of invariance of surfaces and that of freedom of joints, these operand polytopes are originally unbounded in most of the cases (i.e. polyhedra). Homri et al. proposed the introduction of virtual boundaries (called cap half-spaces) over the unbounded displacements of each polyhedron to turn them into 6-polytopes. This decision was motivated by the complexity that operating on polyhedra in R6 supposes. However, that strategy has to face the multiplication of the number of cap half-spaces during the computation of Minkowski sums. In general, the time for computing cap facets is greater than for computing facets representing real limits of bounded displacements. In order to deal with that, this paper proposes the use of the theory of screws to determine the set of displacements that defines the positioning of one surface in relation to another. This set of displacements defines the subspace of R6 in which the polytopes of the respective surfaces have to be projected and operated to avoid calculating facets and vertices along the directions of unbounded displacements. With this new strategy it is possible to decrease the complexity of the Minkowski sums by reducing the dimension of the operands and consequently reducing the computation time. An example illustrates the method and shows the time reduction during the computations.
Authorship Verification - An Approach based on Random Forest
Venue: arXiv cs.CL 2016
Year: 2016

Authorship attribution, being an important problem in many areas in-cluding information retrieval, computational linguistics, law and journalism etc., has been identified as a subject of increasingly research interest in the re-cent years. In case of Author Identification task in PAN at CLEF 2015, the main focus was given on cross-genre and cross-topic author verification tasks. We have used several word-based and style-based features to identify the dif-ferences between the known and unknown problems of one given set and label the unknown ones accordingly using a Random Forest based classifier.
Sparse vs. Non-sparse: Which One Is Better for Practical Visual Tracking?
Venue: arXiv cs.CV 2016
Year: 2016

Recently, sparse representation based visual tracking methods have attracted increasing attention in the computer vision community. Although achieve superior performance to traditional tracking methods, however, a basic problem has not been answered yet --- that whether the sparsity constrain is really needed for visual tracking? To answer this question, in this paper, we first propose a robust non-sparse representation based tracker and then conduct extensive experiments to compare it against several state-of-the-art sparse representation based trackers. Our experiment results and analysis indicate that the proposed non-sparse tracker achieved competitive tracking accuracy with sparse trackers while having faster running speed, which support our non-sparse tracker to be used in practical applications.
A Data-driven Approach for Human Pose Tracking Based on Spatio-temporal Pictorial Structure
Venue: arXiv cs.CV 2016
Year: 2016

In this paper, we present a data-driven approach for human pose tracking in video data. We formulate the human pose tracking problem as a discrete optimization problem based on spatio-temporal pictorial structure model and solve this problem in a greedy framework very efficiently. We propose the model to track the human pose by combining the human pose estimation from single image and traditional object tracking in a video. Our pose tracking objective function consists of the following terms: likeliness of appearance of a part within a frame, temporal displacement of the part from previous frame to the current frame, and the spatial dependency of a part with its parent in the graph structure. Experimental evaluation on benchmark datasets (VideoPose2, Poses in the Wild and Outdoor Pose) as well as on our newly build ICDPose dataset shows the usefulness of our proposed method.
Hyperparameter Transfer Learning through Surrogate Alignment for Efficient Deep Neural Network Training
Venue: arXiv cs.LG 2016
Year: 2016

Recently, several optimization methods have been successfully applied to the hyperparameter optimization of deep neural networks (DNNs). The methods work by modeling the joint distribution of hyperparameter values and corresponding error. Those methods become less practical when applied to modern DNNs whose training may take a few days and thus one cannot collect sufficient observations to accurately model the distribution. To address this challenging issue, we propose a method that learns to transfer optimal hyperparameter values for a small source dataset to hyperparameter values with comparable performance on a dataset of interest. As opposed to existing transfer learning methods, our proposed method does not use hand-designed features. Instead, it uses surrogates to model the hyperparameter-error distributions of the two datasets and trains a neural network to learn the transfer function. Extensive experiments on three CV benchmark datasets clearly demonstrate the efficiency of our method.
New wavelet-based superresolution algorithm for speckle reduction in SAR images
Venue: arXiv cs.CV 2016
Year: 2016

This paper describes a novel projection algorithm, the Projection Onto Span Algorithm (POSA) for wavelet-based superresolution and removing speckle (in wavelet domain) of unknown variance from Synthetic Aperture Radar (SAR) images. Although the POSA is good as a new superresolution algorithm for image enhancement, image metrology and biometric identification, here one will use it like a tool of despeckling, being the first time that an algorithm of super-resolution is used for despeckling of SAR images. Specifically, the speckled SAR image is decomposed into wavelet subbands, POSA is applied to the high subbands, and reconstruct a SAR image from the modified detail coefficients. Experimental results demonstrate that the new method compares favorably to several other despeckling methods on test SAR images.
Anomaly detection in online social networks
Venue: arXiv cs.SI 2016
Year: 2016

Anomalies in online social networks can signify irregular, and often illegal behaviour. Anomalies in online social networks can signify irregular, and often illegal behaviour. Detection of such anomalies has been used to identify malicious individuals, including spammers, sexual predators, and online fraudsters. In this paper we survey existing computational techniques for detecting anomalies in online social networks. We characterise anomalies as being either static or dynamic, and as being labelled or unlabelled, and survey methods for detecting these different types of anomalies. We suggest that the detection of anomalies in online social networks is composed of two sub-processes; the selection and calculation of network features, and the classification of observations from this feature space. In addition, this paper provides an overview of the types of problems that anomaly detection can address and identifies key areas of future research.
Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs: Theory and Empirical Results
Venue: arXiv cs.AI 2016
Year: 2016

In existing literature, while approximate approaches based on Monte-Carlo simulation technique have been proposed to compute the semantics of probabilistic argumentation, how to improve the efficiency of computation without using simulation technique is still an open problem. In this paper, we address this problem from the following two perspectives. First, conceptually, we define specific properties to characterize the subgraphs of a PrAG with respect to a given extension, such that the probability of a set of arguments E being an extension can be defined in terms of these properties, without (or with less) construction of subgraphs. Second, computationally, we take preferred semantics as an example, and develop algorithms to evaluate the efficiency of our approach. The results show that our approach not only dramatically decreases the time for computing p(E^σ), but also has an attractive property, which is contrary to that of existing approaches: the denser the edges of a PrAG are or the bigger the size of a given extension E is, the more efficient our approach computes p(E^σ). Meanwhile, it is shown that under complete and preferred semantics, the problems of determining p(E^σ) are fixed-parameter tractable.
Iterative Visual Recognition for Learning Based Randomized Bin-Picking
Venue: arXiv cs.RO 2016
Year: 2016

This paper proposes a iterative visual recognition system for learning based randomized bin-picking. Since the configuration on randomly stacked objects while executing the current picking trial is just partially different from the configuration while executing the previous picking trial, we consider detecting the poses of objects just by using a part of visual image taken at the current picking trial where it is different from the visual image taken at the previous picking trial. By using this method, we do not need to try to detect the poses of all objects included in the pile at every picking trial. Assuming the 3D vision sensor attached at the wrist of a manipulator, we first explain a method to determine the pose of a 3D vision sensor maximizing the visibility of randomly stacked objects. Then, we explain a method for detecting the poses of randomly stacked objects. Effectiveness of our proposed approach is confirmed by experiments using a dual-arm manipulator where a 3D vision sensor and the two-fingered hand attached at the right and the left wrists, respectively.
Frequency of Arrival-based Interference Localization Using a Single Satellite
Venue: arXiv cs.IT 2016
Year: 2016

Intentional and unintentional interferences are an increasing threat for the satellite communications industry. In this paper, we aim to localize an interference with unknown location using frequency of arrival (FoA) technique by only relying on the measurements obtained through a single satellite. In each time instance, the satellite samples the interference and forwards it to the gateway to estimate its frequency. Since the satellite moves, each estimated frequency includes a Doppler shift, which is related to the location of the unknown interferer. The satellite's position, velocity, oscillator frequency, and the interference frequency are used at the gateway to build a location-related equation between the estimated frequency and the location of the unknown interference. Simultaneously with the interference signal, the satellite samples a reference signal to calibrate the estimated frequency and compensate for the mismatches between the available and real values of the satellite's position, velocity, and oscillator frequency. Multiple location-related equations obtained based on the FoA measurements, (at least two), along with the equation of the earth surface are used to localize the unknown interference. Simulations show that increasing the number of these equations, and the satellite velocity can improve the localization accuracy by 80% and 95%, respectively.
Cloud Benchmarking For Maximising Performance of Scientific Applications
Venue: arXiv cs.DC 2016
Year: 2016

How can applications be deployed on the cloud to achieve maximum performance? This question is challenging to address with the availability of a wide variety of cloud Virtual Machines (VMs) with different performance capabilities. The research reported in this paper addresses the above question by proposing a six step benchmarking methodology in which a user provides a set of weights that indicate how important memory, local communication, computation and storage related operations are to an application. The user can either provide a set of four abstract weights or eight fine grain weights based on the knowledge of the application. The weights along with benchmarking data collected from the cloud are used to generate a set of two rankings - one based only on the performance of the VMs and the other takes both performance and costs into account. The rankings are validated on three case study applications using two validation techniques. The case studies on a set of experimental VMs highlight that maximum performance can be achieved by the three top ranked VMs and maximum performance in a cost-effective manner is achieved by at least one of the top three ranked VMs produced by the methodology.
Example Data Sets and Collections for BeSpaceD Explained
Venue: arXiv cs.OH 2016
Year: 2016

In this report, we present example data sets and collections for the BeSpaceD platform. BeSpaceD is a spatio-temporal modelling and reasoning software framework. We describe the content of a number of the data sets and how the data was obtained. We also present the programming API in BeSpaceD used to store and access these data sets so that future BeSpaceD users can utilise the data collections in their own experiments with minimal effort and expand the library of data collections for BeSpaceD.
Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces
Venue: arXiv cs.CG 2016
Year: 2016

We show how to design a universal shape replicator in a self-assembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of constant-size objects that, when added to any unknown hole-free polyomino shape, produces an unbounded number of copies of that shape (plus constant-size garbage objects). The constant-size objects can be easily constructed from a constant number of individual tile types using a constant number of preprocessing self-assembly steps. Our construction uses the well-studied 2-Handed Assembly Model (2HAM) of tile self-assembly, in the simple model where glues interact only with identical glues, allowing glue strengths that are either positive (attractive) or negative (repulsive), and constant temperature (required glue strength for parts to hold together). We also require that the given shape has specified glue types on its surface, and that the feature size (smallest distance between nonincident edges) is bounded below by a constant. Shape replication necessarily requires a self-assembly model where parts can both attach and detach, and this construction is the first to do so using the natural model of negative/repulsive glues (also studied before for other problems such as fuel-efficient computation); previous replication constructions require more powerful global operations such as an "enzyme" that destroys a subset of the tile types.
Exploiting Temporal Information for DCNN-based Fine-Grained Object Classification
Venue: arXiv cs.CV 2016
Year: 2016

Fine-grained classification is a relatively new field that has concentrated on using information from a single image, while ignoring the enormous potential of using video data to improve classification. In this work we present the novel task of video-based fine-grained object classification, propose a corresponding new video dataset, and perform a systematic study of several recent deep convolutional neural network (DCNN) based approaches, which we specifically adapt to the task. We evaluate three-dimensional DCNNs, two-stream DCNNs, and bilinear DCNNs. Two forms of the two-stream approach are used, where spatial and temporal data from two independent DCNNs are fused either via early fusion (combination of the fully-connected layers) and late fusion (concatenation of the softmax outputs of the DCNNs). For bilinear DCNNs, information from the convolutional layers of the spatial and temporal DCNNs is combined via local co-occurrences. We then fuse the bilinear DCNN and early fusion of the two-stream approach to combine the spatial and temporal information at the local and global level (Spatio-Temporal Co-occurrence). Using the new and challenging video dataset of birds, classification performance is improved from 23.1% (using single images) to 41.1% when using the Spatio-Temporal Co-occurrence system. Incorporating automatically detected bounding box location further improves the classification accuracy to 53.6%.