OpenRaiser/Intern-Atlas huggingface dataset:
Virtual Private Overlays: Secure Group Commounication in NAT-Constrained Environments
Venue: arXiv cs.NI 2010
Year: 2010

Structured P2P overlays provide a framework for building distributed applications that are self-configuring, scalable, and resilient to node failures. Such systems have been successfully adopted in large-scale Internet services such as content delivery networks and file sharing; however, widespread adoption in small/medium scales has been limited due in part to security concerns and difficulty bootstrapping in NAT-constrained environments. Nonetheless, P2P systems can be designed to provide guaranteed lookup times, NAT traversal, point-to-point overlay security, and distributed data stores. In this paper we propose a novel way of creating overlays that are both secure and private and a method to bootstrap them using a public overlay. Private overlay nodes use the public overlay's distributed data store to discover each other, and the public overlay's connections to assist with NAT hole punching and as relays providing STUN and TURN NAT traversal techniques. The security framework utilizes groups, which are created and managed by users through a web based user interface. Each group acts as a Public Key Infrastructure (PKI) relying on the use of a centrally-managed web site providing an automated Certificate Authority (CA). We present a reference implementation which has been used in a P2P VPN (Virtual Private Network). To evaluate our contributions, we apply our techniques to an overlay network modeler, event-driven simulations using simulated time delays, and deployment in the PlanetLab wide-area testbed.
A Polynomial Diophantine Generator Function for Integer Residuals
Venue: arXiv cs.DM 2010
Year: 2010

Two Diophantine equation generator function for integer residuals produced by integer division over closed intervals are presented. One each for the closed intervals [1,Floor(n^0.5)] and [Ceiling(n^0.5),n], respectively.
On the scaling of Polar codes: I. The behavior of polarized channels
Venue: arXiv cs.IT 2010
Year: 2010

We consider the asymptotic behavior of the polarization process for polar codes when the blocklength tends to infinity. In particular, we study the problem of asymptotic analysis of the cumulative distribution $\mathbb{P}(Z_n \leq z)$, where $Z_n=Z(W_n)$ is the Bhattacharyya process, and its dependence to the rate of transmission R. We show that for a BMS channel $W$, for $R < I(W)$ we have $\lim_{n \to \infty} \mathbb{P} (Z_n \leq 2^{-2^{\frac{n}{2}+\sqrt{n} \frac{Q^{-1}(\frac{R}{I(W)})}{2} +o(\sqrt{n})}}) = R$ and for $R<1- I(W)$ we have $\lim_{n \to \infty} \mathbb{P} (Z_n \geq 1-2^{-2^{\frac{n}{2}+ \sqrt{n} \frac{Q^{-1}(\frac{R}{1-I(W)})}{2} +o(\sqrt{n})}}) = R$, where $Q(x)$ is the probability that a standard normal random variable will obtain a value larger than $x$. As a result, if we denote by $\mathbb{P}_e ^{\text{SC}}(n,R)$ the probability of error using polar codes of block-length $N=2^n$ and rate $R<I(W)$ under successive cancellation decoding, then $\log(-\log(\mathbb{P}_e ^{\text{SC}}(n,R)))$ scales as $\frac{n}{2}+\sqrt{n}\frac{Q^{-1}(\frac{R}{I(W)})}{2}+ o(\sqrt{n})$. We also prove that the same result holds for the block error probability using the MAP decoder, i.e., for $\log(-\log(\mathbb{P}_e ^{\text{MAP}}(n,R)))$.
Modeling Web Evolution
Venue: arXiv cs.NI 2010
Year: 2010

The Web is the largest human information construct in history transforming our society. How can we understand, measure and model the Web evolution in order to design effective policies and optimize its social benefit? Early measurements of the Internet traffic and the Web graph indicated the scale-free structure of the Web and other Complex Networks. Going a step further Kouroupas, Koutsoupias, Papadimitriou and Sideri (KKPS) presented an economic-inspired model which explains the scale-free behavior as the interaction of Documents, Users and Search engines. The purpose of this paper is to clarify the open issues arising within the KKPS model through analysis and simulations and to highlight future research developments in Web modeling, which is the backbone of Web Science.
Termination Detection of Local Computations
Venue: arXiv cs.DC 2010
Year: 2010

Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the problem of the detection of the termination of local computations. We define four types of termination detection: no detection, detection of the local termination, detection by a distributed observer, detection of the global termination. We give a complete characterisation (except in the local termination detection case where a partial one is given) for each of this termination detection and show that they define a strict hierarchy. These results emphasise the difference between computability of a distributed task and termination detection. Furthermore, these characterisations encompass all standard criteria that are usually formulated : topological restriction (tree, rings, or triangu- lated networks ...), topological knowledge (size, diameter ...), and local knowledge to distinguish nodes (identities, sense of direction). These results are now presented as corollaries of generalising theorems. As a very special and important case, the techniques are also applied to the election problem. Though given in the model of local computations, these results can give qualitative insight for similar results in other standard models. The necessary conditions involve graphs covering and quasi-covering; the sufficient conditions (constructive local computations) are based upon an enumeration algorithm of Mazurkiewicz and a stable properties detection algorithm of Szymanski, Shi and Prywes.
Evaluation Study for Delay and Link Utilization with the New-Additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm
Venue: arXiv cs.NI 2010
Year: 2010

As the Internet becomes increasingly heterogeneous, the issue of congestion avoidance and control becomes ever more important. And the queue length, end-to-end delays and link utilization is some of the important things in term of congestion avoidance and control mechanisms. In this work we continue to study the performances of the New-AIMD (Additive Increase Multiplicative Decrease) mechanism as one of the core protocols for TCP congestion avoidance and control algorithm, we want to evaluate the effect of using the AIMD algorithm after developing it to find a new approach, as we called it the New-AIMD algorithm to measure the Queue length, delay and bottleneck link utilization, and use the NCTUns simulator to get the results after make the modification for the mechanism. And we will use the Droptail mechanism as the active queue management mechanism (AQM) in the bottleneck router. After implementation of our new approach with different number of flows, we expect the delay will less when we measure the delay dependent on the throughput for all the system, and also we expect to get end-to-end delay less. And we will measure the second type of delay a (queuing delay), as we shown in the figure 1 bellow. Also we will measure the bottleneck link utilization, and we expect to get high utilization for bottleneck link with using this mechanism, and avoid the collisions in the link.
Transmit Signal and Bandwidth Optimization in Multiple-Antenna Relay Channels
Venue: arXiv cs.IT 2010
Year: 2010

Transmit signal and bandwidth optimization is considered in multiple-antenna relay channels. Assuming all terminals have channel state information, the cut-set capacity upper bound and decode-and-forward rate under full-duplex relaying are evaluated by formulating them as convex optimization problems. For half-duplex relays, bandwidth allocation and transmit signals are optimized jointly. Moreover, achievable rates based on the compress-and-forward transmission strategy are presented using rate-distortion and Wyner-Ziv compression schemes. It is observed that when the relay is close to the source, decode-and-forward is almost optimal, whereas compress-and-forward achieves good performance when the relay is close to the destination.
Shaping Bits
Venue: arXiv cs.IT 2010
Year: 2010

The performance of bit-interleaved coded modulation (BICM) with bit shaping (i.e., non-equiprobable bit probabilities in the underlying binary code) is studied. For the Gaussian channel, the rates achievable with BICM and bit shaping are practically identical to those of coded modulation or multilevel coding. This identity holds for the whole range of values of signal-to-noise ratio. Moreover, the random coding error exponent of BICM significantly exceeds that of multilevel coding and is very close to that of coded modulation.
Dynamic sharing of a multiple access channel
Venue: arXiv cs.DS 2010
Year: 2010

In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing. In the classic version of this problem, n processes perform a concurrent program which occasionally triggers some of them to use shared resources, such as memory, communication channel, device, etc. The goal is to design a distributed algorithm to control entries and exits to/from the shared resource in such a way that in any time there is at most one process accessing it. We consider both the classic and a slightly weaker version of mutual exclusion, called ep-mutual-exclusion, where for each period of a process staying in the critical section the probability that there is some other process in the critical section is at most ep. We show that there are channel settings, where the classic mutual exclusion is not feasible even for randomized algorithms, while ep-mutual-exclusion is. In more relaxed channel settings, we prove an exponential gap between the makespan complexity of the classic mutual exclusion problem and its weaker ep-exclusion version. We also show how to guarantee fairness of mutual exclusion algorithms, i.e., that each process that wants to enter the critical section will eventually succeed.
Sidelobe Control in Collaborative Beamforming via Node Selection
Venue: arXiv cs.IT 2010
Year: 2010

Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network by radiating the power from a cluster of sensor nodes in the directions of the intended base station(s) or access point(s) (BSs/APs). The CB average beampattern expresses a deterministic behavior and can be used for characterizing/controling the transmission at intended direction(s), since the mainlobe of the CB beampattern is independent on the particular random node locations. However, the CB for a cluster formed by a limited number of collaborative nodes results in a sample beampattern with sidelobes that severely depend on the particular node locations. High level sidelobes can cause unacceptable interference when they occur at directions of unintended BSs/APs. Therefore, sidelobe control in CB has a potential to increase the network capacity and wireless channel availability by decreasing the interference. Traditional sidelobe control techniques are proposed for centralized antenna arrays and, therefore, are not suitable for WSNs. In this paper, we show that distributed, scalable, and low-complexity sidelobe control techniques suitable for CB in WSNs can be developed based on node selection technique which make use of the randomness of the node locations. A node selection algorithm with low-rate feedback is developed to search over different node combinations. The performance of the proposed algorithm is analyzed in terms of the average number of trials required to select the collaborative nodes and the resulting interference. Our simulation results approve the theoretical analysis and show that the interference is significantly reduced when node selection is used with CB.
Local Popularity Based Collaborative Filters
Venue: arXiv cs.IT 2010
Year: 2010

Motivated by applications such as recommendation systems, we consider the estimation of a binary random field X obtained by row and column permutations of a block constant random matrix. The estimation of X is based on observations Y, which are obtained by passing entries of X through a binary symmetric channel (BSC) and an erasure channel. We focus on the analysis of a specific algorithm based on local popularity when the erasure rate approaches unity at a specified rate. We study the bit error rate (BER) in the limit as the matrix size approaches infinity. Our main result states that if the cluster size (that is, the size of the constancy blocks in the original matrix) is above a certain threshold, then the BER approaches zero, but below the threshold, the BER is lower bounded away from zero. The lower bound depends on the noise level in the observations and the size of the clusters in relation to the threshold. The threshold depends on the rate at which the erasure probability approaches unity.
Extending INET Framework for Directional and Asymmetrical Wireless Communications
Venue: arXiv cs.NI 2010
Year: 2010

This paper reports our work on extending the Omnet INET Framework with a directional radio model, putting a special emphasis on the implementation of asymmetrical communications. We first analyze the original INET radio model, focusing on its design and components. Then we discuss the modifications that have been done to support directional communications. Our preliminary results show that the new model is flexible enough to allow the user to provide any antenna pattern shape, with only an additional reasonable computational cost.
Research Agenda in Cloud Technologies
Venue: arXiv cs.DC 2010
Year: 2010

Cloud computing is the latest effort in delivering computing resources as a service. It represents a shift away from computing as a product that is purchased, to computing as a service that is delivered to consumers over the internet from large-scale data centres - or "clouds". Whilst cloud computing is gaining growing popularity in the IT industry, academia appeared to be lagging behind the rapid developments in this field. This paper is the first systematic review of peer-reviewed academic research published in this field, and aims to provide an overview of the swiftly developing advances in the technical foundations of cloud computing and their research efforts. Structured along the technical aspects on the cloud agenda, we discuss lessons from related technologies; advances in the introduction of protocols, interfaces, and standards; techniques for modelling and building clouds; and new use-cases arising through cloud computing.
Asymptotic Scheduling Gains in Point-to-Multipoint Cognitive Networks
Venue: arXiv cs.IT 2010
Year: 2010

We consider collocated primary and secondary networks that have simultaneous access to the same frequency bands. Particularly, we examine three different levels at which primary and secondary networks may coexist: pure interference, asymmetric co-existence, and symmetric co-existence. At the asymmetric co-existence level, the secondary network selectively deactivates its users based on knowledge of the interference and channel gains, whereas at the symmetric level, the primary network also schedules its users in the same way. Our aim is to derive optimal sum-rates (i.e., throughputs)of both networks at each co-existence level as the number of users grows asymptotically and evaluate how the sum-rates scale with network size. In order to find the asymptotic throughput results, we derive a key lemma on extreme order statistics and a proposition on the sum of lower order statistics. As a baseline comparison, we calculate the sum-rates for channel sharing via time-division (TD). We compare the asymptotic secondary sum-rate in TD with that under simultaneous transmission, while ensuring the primary network maintains the same throughput in both cases. The results indicate that simultaneous transmission at both asymmetric and symmetric co-existence levels can outperform TD. Furthermore, this enhancement is achievable when uplink activation or deactivation of users is based only on the interference gains to the opposite network and not on a network's own channel gains.
Role of Interestingness Measures in CAR Rule Ordering for Associative Classifier: An Empirical Approach
Venue: arXiv cs.LG 2010
Year: 2010

Associative Classifier is a novel technique which is the integration of Association Rule Mining and Classification. The difficult task in building Associative Classifier model is the selection of relevant rules from a large number of class association rules (CARs). A very popular method of ordering rules for selection is based on confidence, support and antecedent size (CSA). Other methods are based on hybrid orderings in which CSA method is combined with other measures. In the present work, we study the effect of using different interestingness measures of Association rules in CAR rule ordering and selection for associative classifier.
A Model for Mining Multilevel Fuzzy Association Rule in Database
Venue: arXiv cs.DB 2010
Year: 2010

The problem of developing models and algorithms for multilevel association mining pose for new challenges for mathematics and computer science. These problems become more challenging, when some form of uncertainty like fuzziness is present in data or relationships in data. This paper proposes a multilevel fuzzy association rule mining models for extracting knowledge implicit in transactions database with different support at each level. The proposed algorithm adopts a top-down progressively deepening approach to derive large itemsets. This approach incorporates fuzzy boundaries instead of sharp boundary intervals. An example is also given to demonstrate that the proposed mining algorithm can derive the multiple-level association rules under different supports in a simple and effective manner.
Spatial Domain Watermarking Scheme for Colored Images Based on Log-average Luminance
Venue: arXiv cs.GR 2010
Year: 2010

In this paper a new watermarking scheme is presented based on log-average luminance. A colored-image is divided into blocks after converting the RGB colored image to YCbCr color space. A monochrome image of 1024 bytes is used as the watermark. To embed the watermark, 16 blocks of size 8X8 are selected and used to embed the watermark image into the original image. The selected blocks are chosen spirally (beginning form the center of the image) among the blocks that have log-average luminance higher than or equal the log-average luminance of the entire image. Each byte of the monochrome watermark is added by updating a luminance value of a pixel of the image. If the byte of the watermark image represented white color (255) a value <alpha> is added to the image pixel luminance value, if it is black (0) the <alpha> is subtracted from the luminance value. To extract the watermark, the selected blocks are chosen as the above, if the difference between the luminance value of the watermarked image pixel and the original image pixel is greater than 0, the watermark pixel is supposed to be white, otherwise it supposed to be black. Experimental results show that the proposed scheme is efficient against changing the watermarked image to grayscale, image cropping, and JPEG compression.
A Noise Addition Scheme in Decision Tree for Privacy Preserving Data Mining
Venue: arXiv cs.CR 2010
Year: 2010

Data mining deals with automatic extraction of previously unknown patterns from large amounts of data. Organizations all over the world handle large amounts of data and are dependent on mining gigantic data sets for expansion of their enterprises. These data sets typically contain sensitive individual information, which consequently get exposed to the other parties. Though we cannot deny the benefits of knowledge discovery that comes through data mining, we should also ensure that data privacy is maintained in the event of data mining. Privacy preserving data mining is a specialized activity in which the data privacy is ensured during data mining. Data privacy is as important as the extracted knowledge and efforts that guarantee data privacy during data mining are encouraged. In this paper we propose a strategy that protects the data privacy during decision tree analysis of data mining process. We propose to add specific noise to the numeric attributes after exploring the decision tree of the original data. The obfuscated data then is presented to the second party for decision tree analysis. The decision tree obtained on the original data and the obfuscated data are similar but by using our method the data proper is not revealed to the second party during the mining process and hence the privacy will be preserved.
Collaboration in an Open Data eScience: A Case Study of Sloan Digital Sky Survey
Venue: arXiv cs.DL 2010
Year: 2010

Current science and technology has produced more and more publically accessible scientific data. However, little is known about how the open data trend impacts a scientific community, specifically in terms of its collaboration behaviors. This paper aims to enhance our understanding of the dynamics of scientific collaboration in the open data eScience environment via a case study of co-author networks of an active and highly cited open data project, called Sloan Digital Sky Survey. We visualized the co-authoring networks and measured their properties over time at three levels: author, institution, and country levels. We compared these measurements to a random network model and also compared results across the three levels. The study found that 1) the collaboration networks of the SDSS community transformed from random networks to small-world networks; 2) the number of author-level collaboration instances has not changed much over time, while the number of collaboration instances at the other two levels has increased over time; 3) pairwise institutional collaboration become common in recent years. The open data trend may have both positive and negative impacts on scientific collaboration.
Capacity Bounds and Lattice Coding for the Star Relay Network
Venue: arXiv cs.IT 2010
Year: 2010

A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The receivers decode their desired messages by using side information and the signals received from the relay. We derive an outer bound on the capacity region of any two phase protocol as well as 3 achievable regions by employing different relaying strategies. In particular, we combine physical and network layer coding to take advantage of the interference at the relay, using, for example, lattice-based codes. We then specialize our results to the exchange rate. It is shown that for any snr, we can achieve within 0.5 bit of the upper bound by lattice coding and within 0.34 bit, if we take the best of the 3 strategies. Also, for high snr, lattice coding is within log(3)/4 ~ 0.4 bit of the upper bound.
Software Components for Web Services
Venue: arXiv cs.SE 2010
Year: 2010

Service-oriented computing has emerged as the new area to address software as a service. This paper proposes a model for component based development for service-oriented systems and have created best practice guidelines on software component design.