OpenRaiser/Intern-Atlas huggingface dataset:
Translingual Obfuscation
Venue: arXiv cs.CR 2016
Year: 2016

Program obfuscation is an important software protection technique that prevents attackers from revealing the programming logic and design of the software. We introduce translingual obfuscation, a new software obfuscation scheme which makes programs obscure by "misusing" the unique features of certain programming languages. Translingual obfuscation translates part of a program from its original language to another language which has a different programming paradigm and execution model, thus increasing program complexity and impeding reverse engineering. In this paper, we investigate the feasibility and effectiveness of translingual obfuscation with Prolog, a logic programming language. We implement translingual obfuscation in a tool called BABEL, which can selectively translate C functions into Prolog predicates. By leveraging two important features of the Prolog language, i.e., unification and backtracking, BABEL obfuscates both the data layout and control flow of C programs, making them much more difficult to reverse engineer. Our experiments show that BABEL provides effective and stealthy software obfuscation, while the cost is only modest compared to one of the most popular commercial obfuscators on the market. With BABEL, we verified the feasibility of translingual obfuscation, which we consider to be a promising new direction for software obfuscation.
Cross validation in LASSO and its acceleration
Venue: arXiv cs.IT 2016
Year: 2016

We investigate leave-one-out cross validation (CV) as a determinator of the weight of the penalty term in the least absolute shrinkage and selection operator (LASSO). First, on the basis of the message passing algorithm and a perturbative discussion assuming that the number of observations is sufficiently large, we provide simple formulas for approximately assessing two types of CV errors, which enable us to significantly reduce the necessary cost of computation. These formulas also provide a simple connection of the CV errors to the residual sums of squares between the reconstructed and the given measurements. Second, on the basis of this finding, we analytically evaluate the CV errors when the design matrix is given as a simple random matrix in the large size limit by using the replica method. Finally, these results are compared with those of numerical simulations on finite-size systems and are confirmed to be correct. We also apply the simple formulas of the first type of CV error to an actual dataset of the supernovae.
Crater Detection via Convolutional Neural Networks
Venue: arXiv cs.CV 2016
Year: 2016

Craters are among the most studied geomorphic features in the Solar System because they yield important information about the past and present geological processes and provide information about the relative ages of observed geologic formations. We present a method for automatic crater detection using advanced machine learning to deal with the large amount of satellite imagery collected. The challenge of automatically detecting craters comes from their is complex surface because their shape erodes over time to blend into the surface. Bandeira provided a seminal dataset that embodied this challenge that is still an unsolved pattern recognition problem to this day. There has been work to solve this challenge based on extracting shape and contrast features and then applying classification models on those features. The limiting factor in this existing work is the use of hand crafted filters on the image such as Gabor or Sobel filters or Haar features. These hand crafted methods rely on domain knowledge to construct. We would like to learn the optimal filters and features based on training examples. In order to dynamically learn filters and features we look to Convolutional Neural Networks (CNNs) which have shown their dominance in computer vision. The power of CNNs is that they can learn image filters which generate features for high accuracy classification.
Sparse approximation problem: how rapid simulated annealing succeeds and fails
Venue: arXiv cs.IT 2016
Year: 2016

Information processing techniques based on sparseness have been actively studied in several disciplines. Among them, a mathematical framework to approximately express a given dataset by a combination of a small number of basis vectors of an overcomplete basis is termed the {\em sparse approximation}. In this paper, we apply simulated annealing, a metaheuristic algorithm for general optimization problems, to sparse approximation in the situation where the given data have a planted sparse representation and noise is present. The result in the noiseless case shows that our simulated annealing works well in a reasonable parameter region: the planted solution is found fairly rapidly. This is true even in the case where a common relaxation of the sparse approximation problem, the $\ell_1$-relaxation, is ineffective. On the other hand, when the dimensionality of the data is close to the number of non-zero components, another metastable state emerges, and our algorithm fails to find the planted solution. This phenomenon is associated with a first-order phase transition. In the case of very strong noise, it is no longer meaningful to search for the planted solution. In this situation, our algorithm determines a solution with close-to-minimum distortion fairly quickly.
A Survey on Social Media Anomaly Detection
Venue: arXiv cs.LG 2016
Year: 2016

Social media anomaly detection is of critical importance to prevent malicious activities such as bullying, terrorist attack planning, and fraud information dissemination. With the recent popularity of social media, new types of anomalous behaviors arise, causing concerns from various parties. While a large amount of work have been dedicated to traditional anomaly detection problems, we observe a surge of research interests in the new realm of social media anomaly detection. In this paper, we present a survey on existing approaches to address this problem. We focus on the new type of anomalous phenomena in the social media and review the recent developed techniques to detect those special types of anomalies. We provide a general overview of the problem domain, common formulations, existing methodologies and potential directions. With this work, we hope to call out the attention from the research community on this challenging problem and open up new directions that we can contribute in the future.
Rate Performance of Adaptive Link Selection in Buffer-Aided Cognitive Relay Networks
Venue: arXiv cs.IT 2016
Year: 2016

We investigate the performance of a two-hop cognitive relay network with a buffered decode and forward (DF) relay. We derive expressions for the rate performance of an adaptive link selection-based buffered relay (ALSBR) scheme with peak power and peak interference constraints on the secondary nodes, and compare its performance with that of conventional unbuffered relay (CUBR) and conventional buffered relay (CBR) schemes. Use of buffered relays with adaptive link selection is shown to be particularly advantageous in underlay cognitive radio networks. The insights developed are of significance to system designers since cognitive radio frameworks are being explored for use in 5G systems. Computer simulation results are presented to demonstrate accuracy of the derived expressions.
Publication boost in Web of Science journals and its effect on citation distributions
Venue: arXiv cs.DL 2016
Year: 2016

In this paper we show that the dramatic increase in the number of research articles indexed in the Web of Science database impacts the commonly observed distributions of citations within these articles. First, we document that the growing number of physics articles in recent years is due to existing journals publishing more and more papers rather than more new journals coming into being as it happens in computer science. And second, even though the references from the more recent papers generally cover a longer time span, the newer papers are cited more frequently than the older ones if the uneven paper growth is not corrected for. Nevertheless, despite this change in the distribution of citations, the citation behavior of scientists does not seem to have changed.
Hierarchical stability of nonlinear hybrid systems
Venue: arXiv cs.SY 2016
Year: 2016

In this short note we prove a hierarchical stability result that applies to hybrid dynamical systems satisfying the hybrid basic conditions of (Goebel et al., 2012). In particular, we establish sufficient conditions for uniform asymptotic stability of a compact set based on some hierarchical stability assumptions involving two nested closed sets containing such a compact set. Moreover, mimicking the well known result for cascaded systems, we prove that the basin of attraction of such compact set coincides with the largest set from which all solutions are bounded. The result appears to be useful when applied to several recent works involving hierarchical control architectures.
Encoding and Decoding Algorithms for Arbitrary Dimensional Hilbert Order
Venue: arXiv cs.SC 2016
Year: 2016

Hilbert order is widely applied in many areas. However, most of the algorithms are confined to low dimensional cases. In this paper, algorithms for encoding and decoding arbitrary dimensional Hilbert order are presented. Eight algorithms are proposed. Four algorithms are based on arithmetic operations and the other four algorithms are based on bit operations. For the algorithms complexities, four of them are linear and the other four are constant for given inputs. In the end of the paper, algorithms for two dimensional Hilbert order are presented to demonstrate the usage of the algorithms introduced.
Quality Adaptive Low-Rank Based JPEG Decoding with Applications
Venue: arXiv cs.CV 2016
Year: 2016

Small compression noises, despite being transparent to human eyes, can adversely affect the results of many image restoration processes, if left unaccounted for. Especially, compression noises are highly detrimental to inverse operators of high-boosting (sharpening) nature, such as deblurring and superresolution against a convolution kernel. By incorporating the non-linear DCT quantization mechanism into the formulation for image restoration, we propose a new sparsity-based convex programming approach for joint compression noise removal and image restoration. Experimental results demonstrate significant performance gains of the new approach over existing image restoration methods.
Joint Learning of the Embedding of Words and Entities for Named Entity Disambiguation
Venue: arXiv cs.CL 2016
Year: 2016

Named Entity Disambiguation (NED) refers to the task of resolving multiple named entity mentions in a document to their correct references in a knowledge base (KB) (e.g., Wikipedia). In this paper, we propose a novel embedding method specifically designed for NED. The proposed method jointly maps words and entities into the same continuous vector space. We extend the skip-gram model by using two models. The KB graph model learns the relatedness of entities using the link structure of the KB, whereas the anchor context model aims to align vectors such that similar words and entities occur close to one another in the vector space by leveraging KB anchors and their context words. By combining contexts based on the proposed embedding with standard NED features, we achieved state-of-the-art accuracy of 93.1% on the standard CoNLL dataset and 85.2% on the TAC 2010 dataset.
An Online Delay Efficient Packet Scheduler for M2M Traffic in Industrial Automation
Venue: arXiv cs.NI 2016
Year: 2016

Some Machine-to-Machine (M2M) communication links particularly those in a industrial automation plant have stringent latency requirements. In this paper, we study the delay-performance for the M2M uplink from the sensors to a Programmable Logic Controller (PLC) in a industrial automation scenario. The uplink traffic can be broadly classified as either Periodic Update (PU) and Event Driven (ED). The PU arrivals from different sensors are periodic, synchronized by the PLC and need to be processed by a prespecified firm latency deadline. On the other hand, the ED arrivals are random, have low-arrival rate, but may need to be processed quickly depending upon the criticality of the application. To accommodate these contrasting Quality-of-Service (QoS) requirements, we model the utility of PU and ED packets using step function and sigmoidal functions of latency respectively. Our goal is to maximize the overall system utility while being proportionally fair to both PU and ED data. To this end, we propose a novel online QoS-aware packet scheduler that gives priority to ED data as long as that results the latency deadline is met for PU data. However as the size of networks increases, we drop the PU packets that fail to meet latency deadline which reduces congestion and improves overall system utility. Using extensive simulations, we compare the performance of our scheme with various scheduling policies such as First-Come-First-Serve (FCFS), Earliest-Due-Date (EDD) and (preemptive) priority. We show that our scheme outperforms the existing schemes for various simulation scenarios.
User-Centric Interference Nulling in Downlink Multi-Antenna Heterogeneous Networks
Venue: arXiv cs.IT 2016
Year: 2016

In heterogeneous networks (HetNets), strong interference due to spectrum reuse affects each user's signal-to-interference ratio (SIR), and hence is one limiting factor of network performance. In this paper, we propose a user-centric interference nulling (IN) scheme in a downlink large-scale HetNet to improve coverage/outage probability by improving each user's SIR. This IN scheme utilizes at most maximum IN degree of freedom (DoF) at each macro-BS to avoid interference to uniformly selected macro (pico) users with signal-to-individual-interference ratio (SIIR) below a macro (pico) IN threshold, where the maximum IN DoF and the two IN thresholds are three design parameters. Using tools from stochastic geometry, we first obtain a tractable expression of the coverage (equivalently outage) probability. Then, we analyze the asymptotic coverage/outage probability in the low and high SIR threshold regimes. The analytical results indicate that the maximum IN DoF can affect the order gain of the outage probability in the low SIR threshold regime, but cannot affect the order gain of the coverage probability in the high SIR threshold regime. Moreover, we characterize the optimal maximum IN DoF which optimizes the asymptotic coverage/outage probability. The optimization results reveal that the IN scheme can linearly improve the outage probability in the low SIR threshold regime, but cannot improve the coverage probability in the high SIR threshold regime. Finally, numerical results show that the proposed scheme can achieve good gains in coverage/outage probability over a maximum ratio beamforming scheme and a user-centric almost blank subframes (ABS) scheme.
Learning Kernels for Structured Prediction using Polynomial Kernel Transformations
Venue: arXiv cs.LG 2016
Year: 2016

Learning the kernel functions used in kernel methods has been a vastly explored area in machine learning. It is now widely accepted that to obtain 'good' performance, learning a kernel function is the key challenge. In this work we focus on learning kernel representations for structured regression. We propose use of polynomials expansion of kernels, referred to as Schoenberg transforms and Gegenbaur transforms, which arise from the seminal result of Schoenberg (1938). These kernels can be thought of as polynomial combination of input features in a high dimensional reproducing kernel Hilbert space (RKHS). We learn kernels over input and output for structured data, such that, dependency between kernel features is maximized. We use Hilbert-Schmidt Independence Criterion (HSIC) to measure this. We also give an efficient, matrix decomposition-based algorithm to learn these kernel transformations, and demonstrate state-of-the-art results on several real-world datasets.
Absolute Trust: Algorithm for Aggregation of Trust in Peer-to- Peer Networks
Venue: arXiv cs.NI 2016
Year: 2016

To mitigate the attacks by malicious peers and to motivate the peers to share the resources in peer-to-peer networks, several reputation systems have been proposed in the past. In most of them, the peers evaluate other peers based on their past interactions and then aggregate this information in the whole network. However such an aggregation process requires approximations in order to converge at some global consensus. It may not be the true reflection of past behavior of the peers. Moreover such type of aggregation gives only the relative ranking of peers without any absolute evaluation of their past. This is more significant when all the peers responding to a query, are malicious. In such a situation, we can only know that who is better among them without knowing their rank in the whole network. In this paper, we are proposing a new algorithm which accounts for the past behavior of the peers and will estimate the absolute value of the trust of peers. Consequently, we can suitably identify them as a good peers or malicious peers. Our algorithm converges at some global consensus much faster by choosing suitable parameters. Because of its absolute nature it will equally load all the peers in network. It will also reduce the inauthentic download in the network which was not possible in existing algorithms.
Security and Privacy of Sensitive Data in Cloud Computing: A Survey of Recent Developments
Venue: arXiv cs.CR 2016
Year: 2016

Cloud computing is revolutionizing many ecosystems by providing organizations with computing resources featuring easy deployment, connectivity, configuration, automation and scalability. This paradigm shift raises a broad range of security and privacy issues that must be taken into consideration. Multi-tenancy, loss of control, and trust are key challenges in cloud computing environments. This paper reviews the existing technologies and a wide array of both earlier and state-of-the-art projects on cloud security and privacy. We categorize the existing research according to the cloud reference architecture orchestration, resource control, physical resource, and cloud service management layers, in addition to reviewing the existing developments in privacy-preserving sensitive data approaches in cloud computing such as privacy threat modeling and privacy enhancing protocols and solutions.
Advanced Cloud Privacy Threat Modeling
Venue: arXiv cs.SE 2016
Year: 2016

Privacy-preservation for sensitive data has become a challenging issue in cloud computing. Threat modeling as a part of requirements engineering in secure software development provides a structured approach for identifying attacks and proposing countermeasures against the exploitation of vulnerabilities in a system . This paper describes an extension of Cloud Privacy Threat Modeling (CPTM) methodology for privacy threat modeling in relation to processing sensitive data in cloud computing environments. It describes the modeling methodology that involved applying Method Engineering to specify characteristics of a cloud privacy threat modeling methodology, different steps in the proposed methodology and corresponding products. We believe that the extended methodology facilitates the application of a privacy-preserving cloud software development approach from requirements engineering to design.
Towards a Semantic Administrative Shell for Industry 4.0 Components
Venue: arXiv cs.SE 2016
Year: 2016

In the engineering and manufacturing domain, there is currently an atmosphere of departure to a new era of digitized production. In different regions, initiatives in these directions are known under different names, such as industrie du futur in France, industrial internet in the US or Industrie 4.0 in Germany. While the vision of digitizing production and manufacturing gained much traction lately, it is still relatively unclear how this vision can actually be implemented with concrete standards and technologies. Within the German Industry 4.0 initiative, the concept of an Administrative Shell was devised to respond to these requirements. The Administrative Shell is planned to provide a digital representation of all information being available about and from an object which can be a hardware system or a software platform. In this paper, we present an approach to developing such a digital representation based on semantic knowledge representation formalisms such as RDF, RDF Schema and OWL. We present our concept of a Semantic I4.0 Component which addresses the communication and comprehension challenges in Industry 4.0 scenarios using semantic technologies. Our approach is illustrated with a concrete example showing its benefits in a real-world use case.
Gender Identification using MFCC for Telephone Applications - A Comparative Study
Venue: arXiv cs.SD 2016
Year: 2016

Gender recognition is an essential component of automatic speech recognition and interactive voice response systems. Determining gender of the speaker reduces the computational burden of such systems for any further processing. Typical methods for gender recognition from speech largely depend on features extraction and classification processes. The purpose of this study is to evaluate the performance of various state-of-the-art classification methods along with tuning their parameters for helping selection of the optimal classification methods for gender recognition tasks. Five classification schemes including k-nearest neighbor, naïve Bayes, multilayer perceptron, random forest, and support vector machine are comprehensively evaluated for determination of gender from telephonic speech using the Mel-frequency cepstral coefficients. Different experiments were performed to determine the effects of training data sizes, length of the speech streams, and parameter tuning on classification performance. Results suggest that SVM is the best classifier among all the five schemes for gender recognition.
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems
Venue: arXiv cs.FL 2016
Year: 2016

A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(<,+1,~) over data trees. Here +1 refers to the child and the next sibling relations while < refers to the descendant and following sibling relations. Moreover, ~ is a binary predicate testing data equality. We exhibit an automata model, denoted DAD# that is more expressive than FO2(<,+1,~) but such that emptiness of DAD# and satisfiability of FO2(<,+1,~) are inter-reducible. This is proved via a model of counter tree automata, denoted EBVASS, that extends Branching Vector Addition Systems with States (BVASS) with extra features for merging counters. We show that, as decision problems, reachability for EBVASS, satisfiability of FO2(<,+1,~) and emptiness of DAD# are equivalent.
An HCI View of Configuration Problems
Venue: arXiv cs.HC 2016
Year: 2016

In recent years, configuration problems have drawn tremendous attention because of their increasing prevalence and their big impact on system availability. We believe that many of these problems are attributable to today's configuration interfaces that have not evolved to accommodate the enormous shift of the system administrator group. Plain text files, as the de facto configuration interfaces, assume administrators' understanding of the system under configuration. They ask administrators to directly edit the corresponding entries with little guidance or assistance. However, this assumption no longer holds for todays administrator group which has expanded greatly to include non- and semi-professional administrators. In this paper, we provide an HCI view of today's configuration problems, and articulate system configuration as a new HCI problem. Moreover, we present the top obstacles to correctly and efficiently configuring software systems, and most importantly their implications on the design and implementation of new-generation configuration interfaces.