OpenRaiser/Intern-Atlas huggingface dataset:
Unequal Error Protection by Partial Superposition Transmission Using LDPC Codes
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, we consider designing low-density parity-check (LDPC) coded modulation systems to achieve unequal error protection (UEP). We propose a new UEP approach by partial superposition transmission called UEP-by-PST. In the UEP-by-PST system, the information sequence is distinguished as two parts, the more important data (MID) and the less important data (LID), both of which are coded with LDPC codes. The codeword that corresponds to the MID is superimposed on the codeword that corresponds to the LID. The system performance can be analyzed by using discretized density evolution. Also proposed in this paper is a criterion from a practical point of view to compare the efficiencies of different UEP approaches. Numerical results show that, over both additive white Gaussian noise (AWGN) channels and uncorrelated Rayleigh fading channels, 1) UEP-by-PST provides higher coding gain for the MID compared with the traditional equal error protection (EEP) approach, but with negligible performance loss for the LID; 2) UEP-by-PST is more efficient with the proposed practical criterion than the UEP approach in the digital video broadcasting (DVB) system.
User-Relatedness and Community Structure in Social Interaction Networks
Venue: arXiv cs.SI 2013
Year: 2013

With social media and the according social and ubiquitous applications finding their way into everyday life, there is a rapidly growing amount of user generated content yielding explicit and implicit network structures. We consider social activities and phenomena as proxies for user relatedness. Such activities are represented in so-called social interaction networks or evidence networks, with different degrees of explicitness. We focus on evidence networks containing relations on users, which are represented by connections between individual nodes. Explicit interaction networks are then created by specific user actions, for example, when building a friend network. On the other hand, more implicit networks capture user traces or evidences of user actions as observed in Web portals, blogs, resource sharing systems, and many other social services. These implicit networks can be applied for a broad range of analysis methods instead of using expensive gold-standard information. In this paper, we analyze different properties of a set of networks in social media. We show that there are dependencies and correlations between the networks. These allow for drawing reciprocal conclusions concerning pairs of networks, based on the assessment of structural correlations and ranking interchangeability. Additionally, we show how these inter-network correlations can be used for assessing the results of structural analysis techniques, e.g., community mining methods.
Environmental Bisimulations for Delimited-Control Operators
Venue: arXiv cs.PL 2013
Year: 2013

We present a theory of environmental bisimilarity for the delimited-control operators {\it shift} and {\it reset}. We consider two different notions of contextual equivalence: one that does not require the presence of a top-level control delimiter when executing tested terms, and another one, fully compatible with the original CPS semantics of shift and reset, that does. For each of them, we develop sound and complete environmental bisimilarities, and we discuss up-to techniques.
A Neural Network based Approach for Predicting Customer Churn in Cellular Network Services
Venue: arXiv cs.NE 2013
Year: 2013

Marketing literature states that it is more costly to engage a new customer than to retain an existing loyal customer. Churn prediction models are developed by academics and practitioners to effectively manage and control customer churn in order to retain existing customers. As churn management is an important activity for companies to retain loyal customers, the ability to correctly predict customer churn is necessary. As the cellular network services market becoming more competitive, customer churn management has become a crucial task for mobile communication operators. This paper proposes a neural network based approach to predict customer churn in subscription of cellular wireless services. The results of experiments indicate that neural network based approach can predict customer churn.
Performance Investigation of Feature Selection Methods
Venue: arXiv cs.IR 2013
Year: 2013

Sentiment analysis or opinion mining has become an open research domain after proliferation of Internet and Web 2.0 social media. People express their attitudes and opinions on social media including blogs, discussion forums, tweets, etc. and, sentiment analysis concerns about detecting and extracting sentiment or opinion from online text. Sentiment based text classification is different from topical text classification since it involves discrimination based on expressed opinion on a topic. Feature selection is significant for sentiment analysis as the opinionated text may have high dimensions, which can adversely affect the performance of sentiment analysis classifier. This paper explores applicability of feature selection methods for sentiment analysis and investigates their performance for classification in term of recall, precision and accuracy. Five feature selection methods (Document Frequency, Information Gain, Gain Ratio, Chi Squared, and Relief-F) and three popular sentiment feature lexicons (HM, GI and Opinion Lexicon) are investigated on movie reviews corpus with a size of 2000 documents. The experimental results show that Information Gain gave consistent results and Gain Ratio performs overall best for sentimental feature selection while sentiment lexicons gave poor performance. Furthermore, we found that performance of the classifier depends on appropriate number of representative feature selected from text.
A Review of Privacy Essentials for Confidential Mobile Data Transactions
Venue: arXiv cs.CR 2013
Year: 2013

The increasingly rapid use of mobile devices for data transaction around the world has consequently led to a new problem, and that is, how to engage in mobile data transactions while maintaining an acceptable level of data privacy and security. While most mobile devices engage in data transactions through a data cloud or a set of data servers, it is still possible to apply data confidentiality across data servers, and, as such, preserving privacy in any mobile data transaction. Yet still, it is essential that a review of data privacy, data utility, the techniques, and methodologies employed in the data privacy process, is done, as the underlying data privacy principles remain the same. In this paper, as a contribution, we present a review of data privacy essentials that are fundamental in delivering any appropriate analysis and specific methodology implementation for various data privacy needs in mobile data transactions and computation.
Bounded Confidence Opinion Dynamics in a Social Network of Bayesian Decision Makers
Venue: arXiv cs.SI 2013
Year: 2013

Bounded confidence opinion dynamics model the propagation of information in social networks. However in the existing literature, opinions are only viewed as abstract quantities without semantics rather than as part of a decision-making system. In this work, opinion dynamics are examined when agents are Bayesian decision makers that perform hypothesis testing or signal detection, and the dynamics are applied to prior probabilities of hypotheses. Bounded confidence is defined on prior probabilities through Bayes risk error divergence, the appropriate measure between priors in hypothesis testing. This definition contrasts with the measure used between opinions in standard models: absolute error. It is shown that the rapid convergence of prior probabilities to a small number of limiting values is similar to that seen in the standard Krause-Hegselmann model. The most interesting finding in this work is that the number of these limiting values and the time to convergence changes with the signal-to-noise ratio in the detection task. The number of final values or clusters is maximal at intermediate signal-to-noise ratios, suggesting that the most contentious issues lead to the largest number of factions. It is at these same intermediate signal-to-noise ratios at which the degradation in detection performance of the aggregate vote of the decision makers is greatest in comparison to the Bayes optimal detection performance.
Improving Bandwidth Efficiency in E-band Communication Systems
Venue: arXiv cs.NI 2013
Year: 2013

The allocation of a large amount of bandwidth by regulating bodies in the 70/80 GHz band, i.e., the E-band, has opened up new potentials and challenges for providing affordable and reliable Gigabit per second wireless point-to-point links. This article first reviews the available bandwidth and licensing regulations in the E-band. Subsequently, different propagation models, e.g., the ITU-R and Cane models, are compared against measurement results and it is concluded that to meet specific availability requirements, E-band wireless systems may need to be designed with larger fade margins compared to microwave systems. A similar comparison is carried out between measurements and models for oscillator phase noise. It is confirmed that phase noise characteristics, that are neglected by the models used for narrowband systems, need to be taken into account for the wideband systems deployed in the E-band. Next, a new multi-input multi-output (MIMO) transceiver design, termed continuous aperture phased (CAP)-MIMO, is presented. Simulations show that CAP-MIMO enables E-band systems to achieve fiber-optic like throughputs. Finally, it is argued that full-duplex relaying can be used to greatly enhance the coverage of E-band systems without sacrificing throughput, thus, facilitating their application in establishing the backhaul of heterogeneous networks.
Access Patterns for Robots and Humans in Web Archives
Venue: arXiv cs.DL 2013
Year: 2013

Although user access patterns on the live web are well-understood, there has been no corresponding study of how users, both humans and robots, access web archives. Based on samples from the Internet Archive's public Wayback Machine, we propose a set of basic usage patterns: Dip (a single access), Slide (the same page at different archive times), Dive (different pages at approximately the same archive time), and Skim (lists of what pages are archived, i.e., TimeMaps). Robots are limited almost exclusively to Dips and Skims, but human accesses are more varied between all four types. Robots outnumber humans 10:1 in terms of sessions, 5:4 in terms of raw HTTP accesses, and 4:1 in terms of megabytes transferred. Robots almost always access TimeMaps (95% of accesses), but humans predominately access the archived web pages themselves (82% of accesses). In terms of unique archived web pages, there is no overall preference for a particular time, but the recent past (within the last year) shows significant repeat accesses.
Who and What Links to the Internet Archive
Venue: arXiv cs.DL 2013
Year: 2013

The Internet Archive's (IA) Wayback Machine is the largest and oldest public web archive and has become a significant repository of our recent history and cultural heritage. Despite its importance, there has been little research about how it is discovered and used. Based on web access logs, we analyze what users are looking for, why they come to IA, where they come from, and how pages link to IA. We find that users request English pages the most, followed by the European languages. Most human users come to web archives because they do not find the requested pages on the live web. About 65% of the requested archived pages no longer exist on the live web. We find that more than 82% of human sessions connect to the Wayback Machine via referrals from other web sites, while only 15% of robots have referrers. Most of the links (86%) from websites are to individual archived pages at specific points in time, and of those 83% no longer exist on the live web.
Domain and Function: A Dual-Space Model of Semantic Relations and Compositions
Venue: arXiv cs.CL 2013
Year: 2013

Given appropriate representations of the semantic relations between carpenter and wood and between mason and stone (for example, vectors in a vector space model), a suitable algorithm should be able to recognize that these relations are highly similar (carpenter is to wood as mason is to stone; the relations are analogous). Likewise, with representations of dog, house, and kennel, an algorithm should be able to recognize that the semantic composition of dog and house, dog house, is highly similar to kennel (dog house and kennel are synonymous). It seems that these two tasks, recognizing relations and compositions, are closely connected. However, up to now, the best models for relations are significantly different from the best models for compositions. In this paper, we introduce a dual-space model that unifies these two tasks. This model matches the performance of the best previous models for relations and compositions. The dual-space model consists of a space for measuring domain similarity and a space for measuring function similarity. Carpenter and wood share the same domain, the domain of carpentry. Mason and stone share the same domain, the domain of masonry. Carpenter and mason share the same function, the function of artisans. Wood and stone share the same function, the function of materials. In the composition dog house, kennel has some domain overlap with both dog and house (the domains of pets and buildings). The function of kennel is similar to the function of house (the function of shelters). By combining domain and function similarities in various ways, we can model relations, compositions, and other aspects of semantics.
On the security of the Kirchhoff-law-Johnson-noise (KLJN) communicator
Venue: arXiv cs.CR 2013
Year: 2013

A simple and general proof is given for the information theoretic (unconditional) security of the Kirchhoff-law-Johnson-noise (KLJN) key exchange system under practical conditions. The unconditional security for ideal circumstances, which is based on the Second Law of Thermodynamics, is found to prevail even under slightly non-ideal conditions. This security level is guaranteed by the continuity of functions describing classical physical linear, as well as stable non-linear, systems. Even without privacy amplification, Eve's probability for successful bit-guessing is found to converge towards 0.5 - i.e., the perfect security level - when ideal conditions are approached.
Dynamic vs Oblivious Routing in Network Design
Venue: arXiv cs.CC 2013
Year: 2013

Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impact of different routing models in this robust setting: in particular, we compare \emph{oblivious} routing, where the routing between each terminal pair must be fixed in advance, to \emph{dynamic} routing, where routings may depend arbitrarily on the current demand. Our main result is a construction that shows that the optimal cost of such a network based on oblivious routing (fractional or integral) may be a factor of $\BigOmega(\log{n})$ more than the cost required when using dynamic routing. This is true even in the important special case of the asymmetric hose model. This answers a question in \cite{chekurisurvey07}, and is tight up to constant factors. Our proof technique builds on a connection between expander graphs and robust design for single-sink traffic patterns \cite{ChekuriHardness07}.
Energy optimization and Performance Analysis of Cluster Based Routing Protocols Extended from LEACH for WSNs
Venue: arXiv cs.NI 2013
Year: 2013

An energy efficient routing protocol is the major attentiveness for researcher in field of Wireless Sensor Networks (WSNs). In this paper, we present some energy efficient hierarchal routing protocols, prosper from conventional Low Energy Adaptive Clustering Hierarchy (LEACH) routing protocol. Fundamental objective of our consideration is to analyze, how these ex- tended routing protocols work in order to optimize lifetime of network nodes and how quality of routing protocols is improved for WSNs. Furthermore, this paper also emphasizes on some issues experienced by LEACH and also explains how these issues are tackled by other enhanced routing protocols from classi- cal LEACH. We analytically compare the features and performance issues of each hierarchal routing protocol. We also simulate selected clustering routing protocols for our study in order to elaborate the enhancement achieved by ameliorate routing protocols.
Approximating the MaxCover Problem with Bounded Frequencies in FPT Time
Venue: arXiv cs.DS 2013
Year: 2013

We study approximation algorithms for several variants of the MaxCover problem, with the focus on algorithms that run in FPT time. In the MaxCover problem we are given a set N of elements, a family S of subsets of N, and an integer K. The goal is to find up to K sets from S that jointly cover (i.e., include) as many elements as possible. This problem is well-known to be NP-hard and, under standard complexity-theoretic assumptions, the best possible polynomial-time approximation algorithm has approximation ratio (1 - 1/e). We first consider a variant of MaxCover with bounded element frequencies, i.e., a variant where there is a constant p such that each element belongs to at most p sets in S. For this case we show that there is an FPT approximation scheme (i.e., for each B there is a B-approximation algorithm running in FPT time) for the problem of maximizing the number of covered elements, and a randomized FPT approximation scheme for the problem of minimizing the number of elements left uncovered (we take K to be the parameter). Then, for the case where there is a constant p such that each element belongs to at least p sets from S, we show that the standard greedy approximation algorithm achieves approximation ratio exactly (1-e^{-max(pK/|S|, 1)}). We conclude by considering an unrestricted variant of MaxCover, and show approximation algorithms that run in exponential time and combine an exact algorithm with a greedy approximation. Some of our results improve currently known results for MaxVertexCover.
Comsol Simulations of Cracking in Point Loaded Masonry with Randomly Distributed Material Properties
Venue: arXiv cs.CE 2013
Year: 2013

This paper describes COMSOL simulations of the stress and crack development in the area where a masonry wall supports a floor. In these simulations one of the main material properties of calcium silicate, its E-value, was assigned randomly to the finite elements of the modeled specimen. Calcium silicate is a frequently used building material with a relatively brittle fracture characteristic. Its initial E-value varies, as well as tensile strength and post peak behavior. Therefore, in the simulation, initial E-values were randomly assigned to the elements of the model and a step function used for describing the descending branch. The method also allows for variation in strength to be taken into account in future research. The performed non-linear simulation results are compared with experimental findings. They show the stress distribution and cracking behavior in point loaded masonry when varying material properties are used.
Automatic energy saving (AES) modelto boost ubiquitous wireless sensor networks (WSNs)
Venue: arXiv cs.NI 2013
Year: 2013

We deploy BT node (sensor) that offers passive and active sensing capability to save energy. BT node works in passive mode for outdoor communication and active for indoor communication. The BT node is supported with novel automatic energy saving (AES) mathematical model to decide either modes. It provides robust and faster communication with less energy consumption. To validate this approach, network simulator-2 (ns2) simulation is used to simulate the behavior of network with the supporting mathematical model. The main objective of this research is to remotely access different types of servers, laptops, desktops and other static and moving objects. This prototype is initially deployed to control MSCS [13] & [14] from remote place through mobile devices. The prototype can further be enhanced to handle several objects simultaneously consuming less energy and resources.
Introduction of 6th Generation Smart Phone combining the features of both Apple and Android smart phone
Venue: arXiv cs.HC 2013
Year: 2013

In this paper, we present our novel contribution methodology based on the results of case study that has been implemented in our research environment to test with new technique the usability of both intelligent Android and Apple phones. This analysis of the case study stands for features similar to applications, operating system, hardware and software structure, battery life, and online based websites. Multiple interrogations were applied to collect user answers ongoing features. Users directly react by responding based on their daily used product experience. Consequently, the estimation is based on the data that has been unregistered from the user. The most recent results will end up by introducing a combination of ideal features on both products to build a wonderful extended product in the future.
Detection of pose orientation across single and multiple axes in case of 3D face images
Venue: arXiv cs.CV 2013
Year: 2013

In this paper, we propose a new approach that takes as input a 3D face image across X, Y and Z axes as well as both Y and X axes and gives output as its pose i.e. it tells whether the face is oriented with respect the X, Y or Z axes or is it oriented across multiple axes with angles of rotation up to 42 degree. All the experiments have been performed on the FRAV3D, GAVADB and Bosphorus database which has two figures of each individual across multiple axes. After applying the proposed algorithm to the 3D facial surface from FRAV3D on 848 3D faces, 566 3D faces were correctly recognized for pose thus giving 67% of correct identification rate. We had experimented on 420 images from the GAVADB database, and only 336 images were detected for correct pose identification rate i.e. 80% and from Bosphorus database on 560 images only 448 images were detected for correct pose identification i.e. 80%.abstract goes here.
Overhead-Optimized Gamma Network Codes
Venue: arXiv cs.IT 2013
Year: 2013

We design a network coding scheme with minimum reception overhead and linear encoding/decoding complexity.
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
Venue: arXiv cs.DS 2013
Year: 2013

We show that every $n$-vertex planar graph admits a simultaneous embedding with no mapping and with fixed edges with any $(n/2)$-vertex planar graph. In order to achieve this result, we prove that every $n$-vertex plane graph has an induced outerplane subgraph containing at least $n/2$ vertices. Also, we show that every $n$-vertex planar graph and every $n$-vertex planar partial 3-tree admit a simultaneous embedding with no mapping and with fixed edges.
A Simple Solution To The Uncertain Delay Problem in USRP Based SDR-Radar Systems
Venue: arXiv cs.OH 2013
Year: 2013

We propose a simple solution to the uncertain delay problem in USRP (Universal Software Radio Peripheral)-based SDR (Software-Defined Radio)-radar systems. Instead of time-synchronization as employed in (pseudo-) passive radar configurations, which require at least two synchronized receivers, we use direct reception signal in a single receiver system as a reference to the exact location of the target echoes. After finding the reference position, reordering of the echoes is conducted by circular shift so that the reference moved to the origin. We demonstrate the effectiveness of the proposed method by simulating the problem on Matlab and implementing a 128 length random code radar on a USRP. The random code is constructed from zero padded Barker sequence product. Experiments on measuring multiple echoes of the targets at precise range bins confirm the applicability of the proposed method.