OpenRaiser/Intern-Atlas huggingface dataset:
A Survey of TCP Reno, New Reno and Sack Over Mobile Ad-Hoc Network
Venue: arXiv cs.NI 2012
Year: 2012

Transmission Control Protocol (TCP) is often preferred to be implemented at the transport layer of a Mobile Ad-hoc Network (MANET) because of its wide range of applications, which enjoys the advantage of reliable data transmission in the Internet. However, because of some unique characteristics of MANET, TCP cannot offer reliable services while using e-mail, internet search and file transmission in such a network. The research investigates how well the different versions of TCP respond to various performance differentials when subjected to different network stresses and topology changes, aside from identifying the most efficient and robust TCP version(s) for different MANET scenarios. Among several TCP variants, three types are considered important for the analysis, namely TCP Reno, TCP New Reno and TCP Selective Acknowledgment (SACK). In most cases, the TCP performance is found in our study to decrease when the node size and mobility rate is increased in the network. There is, however, exception to this. As our simulation results demonstrate, the increases in the node velocity sometimes help the TCP to attain a better performance. The study also reveals that out of the three variants, TCP SACK can adapt relatively well to the changing network sizes while TCP Reno performs most robustly in the presence of different mobility rates within MANET.
A Model-Driven Probabilistic Parser Generator
Venue: arXiv cs.CL 2012
Year: 2012

Existing probabilistic scanners and parsers impose hard constraints on the way lexical and syntactic ambiguities can be resolved. Furthermore, traditional grammar-based parsing tools are limited in the mechanisms they allow for taking context into account. In this paper, we propose a model-driven tool that allows for statistical language models with arbitrary probability estimators. Our work on model-driven probabilistic parsing is built on top of ModelCC, a model-based parser generator, and enables the probabilistic interpretation and resolution of anaphoric, cataphoric, and recursive references in the disambiguation of abstract syntax graphs. In order to prove the expression power of ModelCC, we describe the design of a general-purpose natural language parser.
Cumulative Revision Map
Venue: arXiv cs.HC 2012
Year: 2012

Unlike static documents, version-controlled documents are edited by one or more authors over a certain period of time. Examples include large scale computer code, papers authored by a team of scientists, and online discussion boards. Such collaborative revision process makes traditional document modeling and visualization techniques inappropriate. In this paper we propose a new visualization technique for version-controlled documents that reveals interesting authoring patterns in papers, computer code and Wikipedia articles. The revealed authoring patterns are useful for the readers, participants in the authoring process, and supervisors.
Survey on Distributed Data Mining in P2P Networks
Venue: arXiv cs.DB 2012
Year: 2012

The exponential increase of availability of digital data and the necessity to process it in business and scientific fields has literally forced upon us the need to analyze and mine useful knowledge from it. Traditionally data mining has used a data warehousing model of gathering all data into a central site, and then running an algorithm upon that data. Such a centralized approach is fundamentally inappropriate due to many reasons like huge amount of data, infeasibility to centralize data stored at multiple sites, bandwidth limitation and privacy concerns. To solve these problems, Distributed Data Mining (DDM) has emerged as a hot research area. Careful attention in the usage of distributed resources of data, computing, communication, and human factors in a near optimal fashion are paid by distributed data mining. DDM is gaining attention in peer-to-peer (P2P) systems which are emerging as a choice of solution for applications such as file sharing, collaborative movie and song scoring, electronic commerce, and surveillance using sensor networks. The main intension of this draft paper is to provide an overview of DDM and P2P Data Mining. The paper discusses the need for DDM, taxonomy of DDM architectures, various DDM approaches, DDM related works in P2P systems and issues and challenges in P2P data mining.
Tripod of Requirements in Horizontal Heterogeneous Mobile Cloud Computing
Venue: arXiv cs.DC 2012
Year: 2012

Recent trend of mobile computing is emerging toward executing resource-intensive applications in mobile devices regardless of underlying resource restrictions (e.g. limited processor and energy) that necessitate imminent technologies. Prosperity of cloud computing in stationary computers breeds Mobile Cloud Computing (MCC) technology that aims to augment computing and storage capabilities of mobile devices besides conserving energy. However, MCC is more heterogeneous and unreliable (due to wireless connectivity) compare to cloud computing. Problems like variations in OS, data fragmentation, and security and privacy discourage and decelerate implementation and pervasiveness of MCC. In this paper, we describe MCC as a horizontal heterogeneous ecosystem and identify thirteen critical metrics and approaches that influence on mobile-cloud solutions and success of MCC. We divide them into three major classes, namely ubiquity, trust, and energy efficiency and devise a tripod of requirements in MCC. Our proposed tripod shows that success of MCC is achievable by reducing mobility challenges (e.g. seamless connectivity, fragmentation), increasing trust, and enhancing energy efficiency.
Two-way Wireless Video Communication using Randomized Cooperation, Network Coding and Packet Level FEC
Venue: arXiv cs.IT 2012
Year: 2012

Two-way real-time video communication in wireless networks requires high bandwidth, low delay and error resiliency. This paper addresses these demands by proposing a system with the integration of Network Coding (NC), user cooperation using Randomized Distributed Space-time Coding (R-DSTC) and packet level Forward Error Correction (FEC) under a one-way delay constraint. Simulation results show that the proposed scheme significantly outperforms both conventional direct transmission as well as R-DSTC based two-way cooperative transmission, and is most effective when the distance between the users is large.
Cross-Layer Optimization of Two-Way Relaying for Statistical QoS Guarantees
Venue: arXiv cs.IT 2012
Year: 2012

Two-way relaying promises considerable improvements on spectral efficiency in wireless relay networks. While most existing works focus on physical layer approaches to exploit its capacity gain, the benefits of two-way relaying on upper layers are much less investigated. In this paper, we study the cross-layer design and optimization for delay quality-of-service (QoS) provisioning in two-way relay systems. Our goal is to find the optimal transmission policy to maximize the weighted sum throughput of the two users in the physical layer while guaranteeing the individual statistical delay-QoS requirement for each user in the datalink layer. This statistical delay-QoS requirement is characterized by the QoS exponent. By integrating the concept of effective capacity, the cross-layer optimization problem is equivalent to a weighted sum effective capacity maximization problem. We derive the jointly optimal power and rate adaptation policies for both three-phase and two-phase two-way relay protocols. Numerical results show that the proposed adaptive transmission policies can efficiently provide QoS guarantees and improve the performance. In addition, the throughput gain obtained by the considered three-phase and two-phase protocols over direct transmission is significant when the delay-QoS requirements are loose, but the gain diminishes at tight delay requirements. It is also found that, in the two-phase protocol, the relay node should be placed closer to the source with more stringent delay requirement.
On Linear Coherent Estimation with Spatial Collaboration
Venue: arXiv cs.IT 2012
Year: 2012

We consider a power-constrained sensor network, consisting of multiple sensor nodes and a fusion center (FC), that is deployed for the purpose of estimating a common random parameter of interest. In contrast to the distributed framework, the sensor nodes are allowed to update their individual observations by (linearly) combining observations from neighboring nodes. The updated observations are communicated to the FC using an analog amplify-and-forward modulation scheme and through a coherent multiple access channel. The optimal collaborative strategy is obtained by minimizing the cumulative transmission power subject to a maximum distortion constraint. For the distributed scenario (i.e., with no observation sharing), the solution reduces to the power-allocation problem considered by [Xiao, TSP08]. Collaboration among neighbors significantly improves power efficiency of the network in the low local-SNR regime, as demonstrated through an insightful example and numerical simulations.
Cooperation Enforcement for Packet Forwarding Optimization in Multi-hop Ad-hoc Networks
Venue: arXiv cs.NI 2012
Year: 2012

Ad-hoc networks are independent of any infrastructure. The nodes are autonomous and make their own decisions. They also have limited energy resources. Thus, a node tends to behave selfishly when it is asked to forward the packets of other nodes. Indeed, it would rather choose to reject a forwarding request in order to save its energy. To overcome this problem, the nodes need to be motivated to cooperate. To this end, we propose a self-learning repeated game framework to enforce cooperation between the nodes of a network. This framework is inspired by the concept of "The Weakest Link" TV game. Each node has a utility function whose value depends on its cooperation in forwarding packets on a route as well as the cooperation of all the nodes that form this same route. The more these nodes cooperate the higher is their utility value. This would establish a cooperative spirit within the nodes of the networks. All the nodes will then more or less equally participate to the forwarding tasks which would then eventually guarantee a more efficient packets forwarding from sources to respective destinations. Simulations are run and the results show that the proposed framework efficiently enforces nodes to cooperate and outperforms two other self-learning repeated game frameworks which we are interested in.
A Full Performance Analysis of Channel Estimation Methods for Time Varying OFDM Systems
Venue: arXiv cs.OH 2012
Year: 2012

In this paper, we have evaluated various methods of time-frequency-selective fading channels estimation in OFDM system and some of them improved under time varying conditions. So, these different techniques will be studied through different algorithms and for different schemes of modulations (16 QAM, BPSK, QPSK, ...). Channel estimation gathers different schemes and algorithms, some of them are dedicated for slowly time varying (such as block type arrangement insertion, Bayesian Cramer-Rao Bound, Kalman estimator, Subspace estimator, ...) whereas the others concern highly time varying channels (comb type insertion, ...). There are others methods that are just suitable for stationary channels like blind or semi blind estimators. For this aim, diverse algorithms were used for these schemes such as Least Squares estimator LS, Least Minimum Squares LMS, Minimum Mean-Square-Error MMSE, Linear Minimum Mean-Square-Error LMMSE, Maximum Likelihood ML, ... to refine estimators shown previously.
DNF Sparsification and a Faster Deterministic Counting Algorithm
Venue: arXiv cs.CC 2012
Year: 2012

Given a DNF formula on n variables, the two natural size measures are the number of terms or size s(f), and the maximum width of a term w(f). It is folklore that short DNF formulas can be made narrow. We prove a converse, showing that narrow formulas can be sparsified. More precisely, any width w DNF irrespective of its size can be $ε$-approximated by a width $w$ DNF with at most $(w\log(1/ε))^{O(w)}$ terms. We combine our sparsification result with the work of Luby and Velikovic to give a faster deterministic algorithm for approximately counting the number of satisfying solutions to a DNF. Given a formula on n variables with poly(n) terms, we give a deterministic $n^{\tilde{O}(\log \log(n))}$ time algorithm that computes an additive $ε$ approximation to the fraction of satisfying assignments of f for $ε= 1/\poly(\log n)$. The previous best result due to Luby and Velickovic from nearly two decades ago had a run-time of $n^{\exp(O(\sqrt{\log \log n}))}$.
Normalized Maximum Likelihood Coding for Exponential Family with Its Applications to Optimal Clustering
Venue: arXiv cs.LG 2012
Year: 2012

We are concerned with the issue of how to calculate the normalized maximum likelihood (NML) code-length. There is a problem that the normalization term of the NML code-length may diverge when it is continuous and unbounded and a straightforward computation of it is highly expensive when the data domain is finite . In previous works it has been investigated how to calculate the NML code-length for specific types of distributions. We first propose a general method for computing the NML code-length for the exponential family. Then we specifically focus on Gaussian mixture model (GMM), and propose a new efficient method for computing the NML to them. We develop it by generalizing Rissanen's re-normalizing technique. Then we apply this method to the clustering issue, in which a clustering structure is modeled using a GMM, and the main task is to estimate the optimal number of clusters on the basis of the NML code-length. We demonstrate using artificial data sets the superiority of the NML-based clustering over other criteria such as AIC, BIC in terms of the data size required for high accuracy rate to be achieved.
A QoS-Aware Routing Protocol for Real-time Applications in Wireless Sensor Networks
Venue: arXiv cs.NI 2012
Year: 2012

The paper presents a quality of service aware routing protocol which provides low latency for high priority packets. Packets are differentiated based on their priority by applying queuing theory. Low priority packets are transferred through less energy paths. The sensor nodes interact with the pivot nodes which in turn communicate with the sink node. This protocol can be applied in monitoring context aware physical environments for critical applications.
The Correct Classic Generalized Least-Squares Estimator of an Unknown Constant Mean of Randon Field
Venue: arXiv cs.NA 2012
Year: 2012

The aim of the paper is to derive for the negative correlation function with a time parameter an asymptotic disjunction of the numerical generalized least-squares estimator of an unknown constant mean of random field in fact the correct classic generalized least-squares estimator of an unknown constant mean of the field.
On Min-Power Steiner Tree
Venue: arXiv cs.DS 2012
Year: 2012

In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power version of the problem, which is better suited for wireless applications. Here, the goal is to minimize the total power consumption of nodes, where the power of a node v is the maximum cost of any edge of S incident to v. Intuitively, nodes are antennas (part of which are terminals that we need to connect) and edge costs define the power to connect their endpoints via bidirectional links (so as to support protocols with ack messages). Differently from its min-cost counterpart, min-power Steiner tree is NP-hard even in the spanning tree case, i.e. when all nodes are terminals. Since the power of any tree is within once and twice its cost, computing a rho \leq ln(4)+eps [Byrka et al.'10] approximate min-cost Steiner tree provides a 2rho<2.78 approximation for the problem. For min-power spanning tree the same approach provides a 2 approximation, which was improved to 5/3+eps with a non-trivial approach in [Althaus et al.'06]. Here we present an improved approximation algorithm for min-power Steiner tree. Our result is based on two main ingredients. We prove the first decomposition theorem for min-power Steiner tree, in the spirit of analogous structural results for min-cost Steiner tree and min-power spanning tree. Based on this theorem, we define a proper LP relaxation, that we exploit within the iterative randomized rounding framework in [Byrka et al.'10]. A careful analysis provides a 3ln 4-9/4+eps<1.91 approximation factor. The same approach gives an improved 1.5+eps approximation for min-power spanning tree as well, matching the approximation factor in [Nutov and Yaroshevitch'09] for the special case of min-power spanning tree with edge weights in {0,1}.
Revisiting Homomorphic Wavelet Estimation and Phase Unwrapping
Venue: arXiv cs.IT 2012
Year: 2012

Surface-consistent deconvolution is a standard processing technique in land data to uniformize the wavelet across all sources and receivers. The required wavelet estimation step is generally done in the homomorphic domain since this is a convenient way to separate the phase and the amplitude spectrum in a linear fashion. Unfortunately all surface-consistent deconvolutions make a minimum-phase assumption which is likely to be sub-optimal. Recent developments in statistical wavelet estimation demonstrate that nonminimum wavelets can be estimated directly from seismic data, thus offering promise to create a nonminimum phase surface-consistent deconvolution approach. Unfortunately the major impediment turns out to be phase unwrapping. In this paper we review several existing phase unwrapping techniques and discuss their advantages and inconveniences.
Toward Sustainable Networking: Storage Area Networks with Network Coding
Venue: arXiv cs.DC 2012
Year: 2012

This manuscript provides a model to characterize the energy savings of network coded storage (NCS) in storage area networks (SANs). We consider blocking probability of drives as our measure of performance. A mapping technique to analyze SANs as independent M/G/K/K queues is presented, and blocking probabilities for uncoded storage schemes and NCS are derived and compared. We show that coding operates differently than the amalgamation of file chunks and energy savings are shown to scale well with striping number. We illustrate that for enterprise-level SANs energy savings of 20-50% can be realized.
Distributed Time-Frequency Division Multiple Access Protocol For Wireless Sensor Networks
Venue: arXiv cs.NI 2012
Year: 2012

It is well known that biology-inspired self-maintaining algorithms in wireless sensor nodes achieve near optimum time division multiple access (TDMA) characteristics in a decentralized manner and with very low complexity. We extend such distributed TDMA approaches to multiple channels (frequencies). This is achieved by extending the concept of collaborative reactive listening in order to balance the number of nodes in all available channels. We prove the stability of the new protocol and estimate the delay until the balanced system state is reached. Our approach is benchmarked against single-channel distributed TDMA and channel hopping approaches using TinyOS imote2 wireless sensors.
Fragmentation Considered Poisonous
Venue: arXiv cs.CR 2012
Year: 2012

We present practical poisoning and name-server block- ing attacks on standard DNS resolvers, by off-path, spoofing adversaries. Our attacks exploit large DNS responses that cause IP fragmentation; such long re- sponses are increasingly common, mainly due to the use of DNSSEC. In common scenarios, where DNSSEC is partially or incorrectly deployed, our poisoning attacks allow 'com- plete' domain hijacking. When DNSSEC is fully de- ployed, attacker can force use of fake name server; we show exploits of this allowing off-path traffic analy- sis and covert channel. When using NSEC3 opt-out, attacker can also create fake subdomains, circumvent- ing same origin restrictions. Our attacks circumvent resolver-side defenses, e.g., port randomisation, IP ran- domisation and query randomisation. The (new) name server (NS) blocking attacks force re- solver to use specific name server. This attack allows Degradation of Service, traffic-analysis and covert chan- nel, and also facilitates DNS poisoning. We validated the attacks using standard resolver soft- ware and standard DNS name servers and zones, e.g., org.
Multi-scale Dynamics in a Massive Online Social Network
Venue: arXiv cs.SI 2012
Year: 2012

Data confidentiality policies at major social network providers have severely limited researchers' access to large-scale datasets. The biggest impact has been on the study of network dynamics, where researchers have studied citation graphs and content-sharing networks, but few have analyzed detailed dynamics in the massive social networks that dominate the web today. In this paper, we present results of analyzing detailed dynamics in the Renren social network, covering a period of 2 years when the network grew from 1 user to 19 million users and 199 million edges. Rather than validate a single model of network dynamics, we analyze dynamics at different granularities (user-, community- and network- wide) to determine how much, if any, users are influenced by dynamics processes at different scales. We observe in- dependent predictable processes at each level, and find that while the growth of communities has moderate and sustained impact on users, significant events such as network merge events have a strong but short-lived impact that is quickly dominated by the continuous arrival of new users.
A New Ensemble of Rate-Compatible LDPC Codes
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, we presented three approaches to improve the design of Kite codes (newly proposed rateless codes), resulting in an ensemble of rate-compatible LDPC codes with code rates varying "continuously" from 0.1 to 0.9 for additive white Gaussian noise (AWGN) channels. The new ensemble rate-compatible LDPC codes can be constructed conveniently with an empirical formula. Simulation results show that, when applied to incremental redundancy hybrid automatic repeat request (IR-HARQ) system, the constructed codes (with higher order modulation) perform well in a wide range of signal-to-noise-ratios (SNRs).