OpenRaiser/Intern-Atlas huggingface dataset:
On Mobile Bluetooth Tags
Venue: arXiv cs.NI 2015
Year: 2015

This paper presents a new approach for hyper-local data sharing and delivery on the base of discoverable Bluetooth nodes. Our approach allows customers to associate user-defined data with network nodes and use a special mobile application (context-aware browser) for presenting this information to mobile users in proximity. Alternatively, mobile services can request and share local data in M2M applications rely on network proximity. Bluetooth nodes in cars are among the best candidates for the role of the bearing nodes.
Performance Evaluation of netfilter: A Study on the Performance Loss When Using netfilter as a Firewall
Venue: arXiv cs.NI 2015
Year: 2015

Since GNU/Linux became a popular operating system on computer network routers, its packet routing mechanisms attracted more interest. This does not only concern 'big' Linux servers acting as a router but more and more small and medium network access devices, such as DSL or cable access devices. Although there are a lot of documents dealing with high performance routing with GNU/Linux, only a few offer experimental results to prove the given advices. This study evaluates the throughput performance of Linux' routing subsystem netfilter under various conditions like different data transport protocols in combination with different IP address families and transmission strategies. Those conditions were evaluated with two different types of netfilter rules for a high number in the rule tables. In addition to this, our experiments allowed us to evaluate two prominent client connection handling techniques (threads and the epoll() facility). The evaluation of the 1.260 different combinations of our test parameters shows a nearly linear but small throughput loss with the number of rules which is independant from the transport protocol and framesize. However, this evaluation identifies another issue concerning the throughput loss when it comes to the address family, i.e. IPv4 and IPv6.
Outage Capacity of Rayleigh Product Channels: a Free Probability Approach
Venue: arXiv cs.IT 2015
Year: 2015

The Rayleigh product channel model is useful in capturing the performance degradation due to rank deficiency of MIMO channels. In this paper, such a performance degradation is investigated via the channel outage probability assuming slowly varying channel with delay-constrained decoding. Using techniques of free probability theory, the asymptotic variance of channel capacity is derived when the dimensions of the channel matrices approach infinity. In this asymptotic regime, the channel capacity is rigorously proven to be Gaussian distributed. Using the obtained results, a fundamental tradeoff between multiplexing gain and diversity gain of Rayleigh product channels can be characterized by closed-form expression at any finite signal-to-noise ratio. Numerical results are provided to compare the relative outage performance between Rayleigh product channels and conventional Rayleigh MIMO channels.
Prioritized Metric Structures and Embedding
Venue: arXiv cs.DS 2015
Year: 2015

Metric data structures (distance oracles, distance labeling schemes, routing schemes) and low-distortion embeddings provide a powerful algorithmic methodology, which has been successfully applied for approximation algorithms \cite{llr}, online algorithms \cite{BBMN11}, distributed algorithms \cite{KKMPT12} and for computing sparsifiers \cite{ST04}. However, this methodology appears to have a limitation: the worst-case performance inherently depends on the cardinality of the metric, and one could not specify in advance which vertices/points should enjoy a better service (i.e., stretch/distortion, label size/dimension) than that given by the worst-case guarantee. In this paper we alleviate this limitation by devising a suit of {\em prioritized} metric data structures and embeddings. We show that given a priority ranking $(x_1,x_2,\ldots,x_n)$ of the graph vertices (respectively, metric points) one can devise a metric data structure (respectively, embedding) in which the stretch (resp., distortion) incurred by any pair containing a vertex $x_j$ will depend on the rank $j$ of the vertex. We also show that other important parameters, such as the label size and (in some sense) the dimension, may depend only on $j$. In some of our metric data structures (resp., embeddings) we achieve both prioritized stretch (resp., distortion) and label size (resp., dimension) {\em simultaneously}. The worst-case performance of our metric data structures and embeddings is typically asymptotically no worse than of their non-prioritized counterparts.
Computing Real Numbers using DNA Self-Assembly
Venue: arXiv cs.ET 2015
Year: 2015

DNA Self-Assembly has emerged as an interdisciplinary field with many intriguing applications such DNA bio-sensor, DNA circuits, DNA storage, drug delivery etc. Tile assembly model of DNA has been studied for various computational primitives such as addition, subtraction, multiplication, and division. Xuncai et. al. gave computational DNA tiles to perform division of a number but the output had integer quotient. In this work, we simply modify their method of division to improve its compatibility with further computation and this modification has found its application in computing rational numbers, both recurring and terminating, with computational tile complexity of $\mathcal{O} (1)$ and $\mathcal{O} (h)$ respectively. Additionally, we also propose a method to compute square-root of a number with computational tile complexity of $\mathcal{O} (n)$ for an n bit number. Finally, after combining tiles of division and square-root, we propose a simple way to compute the ubiquitously used irrational number, $π$, using its infinite series.
It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition
Venue: arXiv cs.CG 2015
Year: 2015

We present a strict separation between the class of "mismatch free" self-assembly systems and general aTAM systems. Mismatch free systems are those systems in which concurrently grown parts must always agree with each other. Tile self-assembly is a model of the formation of crystal growth, in which a large number of particles concurrently and selectively stick to each other, forming complex shapes and structures. It is useful in nanotechnologies, and more generally in the understanding of these processes, ubiquitous in natural systems. The other property of the local assembly process known to change the power of the model is cooperation between two tiles to attach another. We show that disagreement (mismatches) and cooperation are incomparable: neither can be used to simulate the other one. The fact that mismatches are a hard property is especially surprising, since no known, explicit construction of a computational device in tile assembly uses mismatches, except for the recent construction of an intrinsically universal tileset, i.e. a tileset capable of simulating any other tileset up to rescaling. This work shows how to use intrinsic universality in a systematic way to highlight the essence of different features of tile assembly. Moreover, even the most recent experimental realizations do not use competition, which, in view of our results, suggests that a large part of the natural phenomena behind DNA self-assembly remains to be understood experimentally.
Designing Applications with Distributed Databases in a Hybrid Cloud
Venue: arXiv cs.DC 2015
Year: 2015

Designing applications for use in a hybrid cloud has many features. These include dynamic virtualization management and an unknown route switching customers. This makes it impossible to evaluate the query and hence the optimal distribution of data. In this paper, we formulate the main challenges of designing and simulation offer installation for processing.
A Multiple-Valued Logic Approach to the Design and Verification of Hardware Circuits
Venue: arXiv cs.LO 2015
Year: 2015

We present a novel approach, which is based on multiple-valued logic (MVL), to the verification and analysis of digital hardware designs, which extends the common ternary or quaternary approaches for simulations. The simulations which are performed in the more informative MVL setting reveal details which are either invisible or harder to detect through binary or ternary simulations. In equivalence verification, detecting different behavior under MVL simulations may lead to the discovery of a genuine binary nonequivalence or to a qualitative gap between two designs. The value of a variable in a simulation may hold information about its degree of truth and its "place of birth" and "date of birth." Applications include equivalence verification, initialization, assertions generation and verification, partial control on the flow of data by prioritizing and block-oriented simulations. Much of the paper is devoted to theoretical aspects behind the MVL approach, including the reason for choosing a specific algebra for computations, and the introduction of the verification complexity of a Boolean expression. Two basic algorithms are presented.
Pairwise Constraint Propagation: A Survey
Venue: arXiv cs.CV 2015
Year: 2015

As one of the most important types of (weaker) supervised information in machine learning and pattern recognition, pairwise constraint, which specifies whether a pair of data points occur together, has recently received significant attention, especially the problem of pairwise constraint propagation. At least two reasons account for this trend: the first is that compared to the data label, pairwise constraints are more general and easily to collect, and the second is that since the available pairwise constraints are usually limited, the constraint propagation problem is thus important. This paper provides an up-to-date critical survey of pairwise constraint propagation research. There are two underlying motivations for us to write this survey paper: the first is to provide an up-to-date review of the existing literature, and the second is to offer some insights into the studies of pairwise constraint propagation. To provide a comprehensive survey, we not only categorize existing propagation techniques but also present detailed descriptions of representative methods within each category.
Low-Cost Learning via Active Data Procurement
Venue: arXiv cs.GT 2015
Year: 2015

We design mechanisms for online procurement of data held by strategic agents for machine learning tasks. The challenge is to use past data to actively price future data and give learning guarantees even when an agent's cost for revealing her data may depend arbitrarily on the data itself. We achieve this goal by showing how to convert a large class of no-regret algorithms into online posted-price and learning mechanisms. Our results in a sense parallel classic sample complexity guarantees, but with the key resource being money rather than quantity of data: With a budget constraint $B$, we give robust risk (predictive error) bounds on the order of $1/\sqrt{B}$. Because we use an active approach, we can often guarantee to do significantly better by leveraging correlations between costs and data. Our algorithms and analysis go through a model of no-regret learning with $T$ arriving pairs (cost, data) and a budget constraint of $B$. Our regret bounds for this model are on the order of $T/\sqrt{B}$ and we give lower bounds on the same order.
Noise-shaping Quantization Methods for Frame-based and Compressive Sampling Systems
Venue: arXiv cs.IT 2015
Year: 2015

Noise shaping refers to an analog-to-digital conversion methodology in which quantization error is arranged to lie mostly outside the signal spectrum by means of oversampling and feedback. Recently it has been successfully applied to more general redundant linear sampling and reconstruction systems associated with frames as well as non-linear systems associated with compressive sampling. This chapter reviews some of the recent progress in this subject.
A Hybrid Model to Extend Vehicular Intercommunication V2V through D2D Architecture
Venue: arXiv cs.NI 2015
Year: 2015

In the recent years, many solutions for Vehicle to Vehicle (V2V) communication were proposed to overcome failure problems (also known as dead ends). This paper proposes a novel framework for V2V failure recovery using Device-to-Device (D2D) communications. Based on the unified Intelligent Transportation Systems (ITS) architecture, LTE-based D2D mechanisms can improve V2V dead ends failure recovery delays. This new paradigm of hybrid V2V-D2D communications overcomes the limitations of traditional V2V routing techniques. According to NS2 simulation results, the proposed hybrid model decreases the end to end delay (E2E) of messages delivery. A complete comparison of different D2D use cases (best & worst scenarios) is presented to show the enhancements brought by our solution compared to traditional V2V techniques.
Pseudo Fuzzy Set
Venue: arXiv cs.AI 2015
Year: 2015

Here a novel idea to handle imprecise or vague set viz. Pseudo fuzzy set has been proposed. Pseudo fuzzy set is a triplet of element and its two membership functions. Both the membership functions may or may not be dependent. The hypothesis is that every positive sense has some negative sense. So, one membership function has been considered as positive and another as negative. Considering this concept, here the development of Pseudo fuzzy set and its property along with Pseudo fuzzy numbers has been discussed.
Orthogonal Multilevel Spreading Sequence Design
Venue: arXiv cs.IT 2015
Year: 2015

Finite field transforms are offered as a new tool of spreading sequence design. This approach exploits orthogonality properties of synchronous non-binary sequences defined over a complex finite field. It is promising for channels supporting a high signal-to-noise ratio. New digital multiplex schemes based on such sequences have also been introduced, which are multilevel Code Division Multiplex. These schemes termed Galois-field Division Multiplex (GDM) are based on transforms for which there exists fast algorithms. They are also convenient from the hardware viewpoint since they can be implemented by a Digital Signal Processor. A new Efficient-bandwidth code-division-multiple-access (CDMA) is introduced, which is based on multilevel spread spectrum sequences over a Galois field. The primary advantage of such schemes regarding classical multiple access digital schemes is their better spectral efficiency. Galois-Fourier transforms contain some redundancy and only cyclotomic coefficients are needed to be transmitted yielding compact spectrum requirements.
A Data Mining framework to model Consumer Indebtedness with Psychological Factors
Venue: arXiv cs.LG 2015
Year: 2015

Modelling Consumer Indebtedness has proven to be a problem of complex nature. In this work we utilise Data Mining techniques and methods to explore the multifaceted aspect of Consumer Indebtedness by examining the contribution of Psychological Factors, like Impulsivity to the analysis of Consumer Debt. Our results confirm the beneficial impact of Psychological Factors in modelling Consumer Indebtedness and suggest a new approach in analysing Consumer Debt, that would take into consideration more Psychological characteristics of consumers and adopt techniques and practices from Data Mining.
Achieving Autonomous Compressive Spectrum Sensing for Cognitive Radios
Venue: arXiv cs.IT 2015
Year: 2015

Compressive sensing (CS) technologies present many advantages over other existing approaches for implementing wideband spectrum sensing in cognitive radios (CRs), such as reduced sampling rate and computational complexity. However, there are two significant challenges: 1) choosing an appropriate number of sub-Nyquist measurements, and 2) deciding when to terminate the greedy recovery algorithm that reconstructs wideband spectrum. In this paper, an autonomous compressive spectrum sensing (ACSS) framework is presented that enables a CR to automatically choose the number of measurements while guaranteeing the wideband spectrum recovery with a small predictable recovery error. This is realized by the proposed measurement infrastructure and the validation technique. The proposed ACSS can find a good spectral estimate with high confidence by using only a small testing subset in both noiseless and noisy environments. Furthermore, a sparsity-aware spectral recovery algorithm is proposed to recover the wideband spectrum without requiring knowledge of the instantaneous spectral sparsity level. Such an algorithm bridges the gap between CS theory and practical spectrum sensing. Simulation results show that ACSS can not only recover the spectrum using an appropriate number of measurements, but can also considerably improve the spectral recovery performance compared with existing CS approaches. The proposed recovery algorithm can autonomously adopt a proper number of iterations, therefore solving the problems of under-fitting or over-fitting which commonly exist in most greedy recovery algorithms.
Evaluating QoS Parameters for IPTV Distribution in Heterogeneous Networks
Venue: arXiv cs.MM 2015
Year: 2015

The present work presents an architecture developed to evaluate the QoS parameters for the IPTV heterogeneous network. At its very basic level lie two software technologies: Video LAN and Windows Media Services with two operating systems: Windows and Linux. Three types of streams are analyzed, which will be transmitted to a Linux VLC client through means of the aggregation and access servers. The first stream is generated in real time by a capture camera, processed by the encapsulated VC-1 encoder and sent to the Media Server, while the second one is of VoD(Video on Demand) type and the third one will be handled by DVBViewer through the MPEG TS form. The first stream is transcoded in H.264-AAC such that the Linux stations will recognize its format. Through the simultaneous transmission of the three streams, we are analyzing their performance from a QoS parameters point of view by means of an application implemented in C programming language. The stream transporting the DVB-S television content was proven to ensure the best performance regarding loss of packets, delays and jitter.
A Privacy-Preserving QoS Prediction Framework for Web Service Recommendation
Venue: arXiv cs.CR 2015
Year: 2015

QoS-based Web service recommendation has recently gained much attention for providing a promising way to help users find high-quality services. To facilitate such recommendations, existing studies suggest the use of collaborative filtering techniques for personalized QoS prediction. These approaches, by leveraging partially observed QoS values from users, can achieve high accuracy of QoS predictions on the unobserved ones. However, the requirement to collect users' QoS data likely puts user privacy at risk, thus making them unwilling to contribute their usage data to a Web service recommender system. As a result, privacy becomes a critical challenge in developing practical Web service recommender systems. In this paper, we make the first attempt to cope with the privacy concerns for Web service recommendation. Specifically, we propose a simple yet effective privacy-preserving framework by applying data obfuscation techniques, and further develop two representative privacy-preserving QoS prediction approaches under this framework. Evaluation results from a publicly-available QoS dataset of real-world Web services demonstrate the feasibility and effectiveness of our privacy-preserving QoS prediction approaches. We believe our work can serve as a good starting point to inspire more research efforts on privacy-preserving Web service recommendation.
Bialgebraic Semantics for Logic Programming
Venue: arXiv cs.LO 2015
Year: 2015

Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques developed in that setting. First we use saturation to model the operational semantics of logic programs as coalgebrae on presheaves. Then, we make explicit the underlying algebraic structure by using bialgebrae on presheaves. The resulting semantics turns out to be compositional with respect to conjunction and term substitution. Also, it encodes a parallel model of computation, whose soundness is guaranteed by a built-in notion of synchronisation between different threads.
A Multi-phase Approach for Improving Information Diffusion in Social Networks
Venue: arXiv cs.SI 2015
Year: 2015

For maximizing influence spread in a social network, given a certain budget on the number of seed nodes, we investigate the effects of selecting and activating the seed nodes in multiple phases. In particular, we formulate an appropriate objective function for two-phase influence maximization under the independent cascade model, investigate its properties, and propose algorithms for determining the seed nodes in the two phases. We also study the problem of determining an optimal budget-split and delay between the two phases.
Efficient Algorithms for the Data Exchange Problem
Venue: arXiv cs.IT 2015
Year: 2015

In this paper we study the data exchange problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-information considered is in the form of linear combinations of the file packets. Given that the collective information of all the users is sufficient to allow recovery of the entire file, the goal is for each user to gain access to the file while minimizing some communication cost. We assume that users can communicate over a noiseless broadcast channel, and that the communication cost is a sum of each user's cost function over the number of bits it transmits. For instance, the communication cost could simply be the total number of bits that needs to be transmitted. In the most general case studied in this paper, each user can have any arbitrary convex cost function. We provide deterministic, polynomial-time algorithms (in the number of users and packets) which find an optimal communication scheme that minimizes the communication cost. To further lower the complexity, we also propose a simple randomized algorithm inspired by our deterministic algorithm which is based on a random linear network coding scheme.
An empirical performance study of Intra-vehicular Wireless Sensor Networks under WiFi and Bluetooth interference
Venue: arXiv cs.NI 2015
Year: 2015

Intra-Vehicular Wireless Sensor Network (IVWSN) is a new automotive architecture that applies wireless technologies to the communications between Electrical Control Units (ECUs) and sensors. It can potentially help achieve better fuel economy, reduce wiring complexity, and support additional new applications. In the existing works, most of the popular wireless technologies applied on IVWSNs occupy the same 2.4 GHz ISM frequency bands as WiFi and Bluetooth do. It is therefore essential to evaluate the performance of IVWSNs under interference from WiFi and Bluetooth devices, especially when these devices are inside the vehicle. In this paper, we report the results of a comprehensive experimental study of IVWSNs based on ZigBee and Bluetooth Low Energy under WiFi and Bluetooth interference. The impact of the interference from Bluetooth and WiFi devices can be clearly observed from the experiments. The results of the experiments conducted suggest that Bluetooth Low Energy technology outperforms ZigBee technology in the context of IVWSNs when WiFi interference exists in the car.