OpenRaiser/Intern-Atlas huggingface dataset:
Spectrum Leasing via Cooperation for Enhanced Physical-Layer Secrecy
Venue: arXiv cs.IT 2012
Year: 2012

Spectrum leasing via cooperation refers to the possibility of primary users leasing a portion of the spectral resources to secondary users in exchange for cooperation. In the presence of an eavesdropper, this correspondence proposes a novel application of this concept in which the secondary cooperation aims at improving secrecy of the primary network by creating more interference to the eavesdropper than to the primary receiver. To generate the interference in a positive way, this work studies an optimal design of a beamformer at the secondary transmitter with multiple antennas that maximizes a secrecy rate of the primary network while satisfying a required rate for the secondary network. Moreover, we investigate two scenarios depending upon the operation of the eavesdropper: i) the eavesdropper treats the interference by the secondary transmission as an additive noise (single-user decoding) and ii) the eavesdropper tries to decode and remove the secondary signal (joint decoding). Numerical results confirm that, for a wide range of required secondary rate constraints, the proposed spectrum-leasing strategy increases the secrecy rate of the primary network compared to the case of no spectrum leasing.
It was not known about simple cycles
Venue: arXiv cs.DM 2012
Year: 2012

A proper edge $t$-coloring of a graph is a coloring of its edges with colors $1,2,...,t$ such that all colors are used, and no two adjacent edges receive the same color. For any integer $n\geq 3$, all possible values of $t$ are found, for which there exists such a proper edge $t$-coloring of the simple cycle C(n), which uses for each pair of adjacent edges either consecutive colors or the first and the last ones.
A Secret Sharing Scheme Based on Group Presentations and the Word Problem
Venue: arXiv cs.CR 2012
Year: 2012

A (t,n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t-1 participants can. In this paper, we propose two secret sharing schemes using non-abelian groups. One scheme is the special case where all the participants must get together to recover the secret. The other one is a (t,n)-threshold scheme that is a combination of Shamir's scheme and the group-theoretic scheme proposed in this paper.
New developments in parsing Mizar
Venue: arXiv cs.PL 2012
Year: 2012

The Mizar language aims to capture mathematical vernacular by providing a rich language for mathematics. From the perspective of a user, the richness of the language is welcome because it makes writing texts more "natural". But for the developer, the richness leads to syntactic complexity, such as dealing with overloading. Recently the Mizar team has been making a fresh approach to the problem of parsing the Mizar language. One aim is to make the language accessible to users and other developers. In this paper we describe these new parsing efforts and some applications thereof, such as large-scale text refactorings, pretty-printing, HTTP parsing services, and normalizations of Mizar texts.
An Entropic Proof of Chang's Inequality
Venue: arXiv cs.CC 2012
Year: 2012

Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the variables are highly biased.
Analysis of Boolean Functions
Venue: arXiv cs.CC 2012
Year: 2012

Scribe notes from the 2012 Barbados Workshop on Computational Complexity. A series of lectures on Analysis of Boolean Functions by Ryan O'Donnell, with a guest lecture by Per Austrin.
Session Initiation Protocol Attacks and Challenges
Venue: arXiv cs.NI 2012
Year: 2012

In recent years, Session Initiation Protocol (SIP) has become widely used in current internet protocols. It is a text-based protocol much like Hyper Text Transport Protocol (HTTP) and Simple Mail Transport Protocol (SMTP). SIP is a strong enough signaling protocol on the internet for establishing, maintaining, and terminating session. In this paper the areas of security and attacks in SIP are discussed. We consider attacks from diverse related perspectives. The authentication schemes are compared, the representative existing solutions are highlighted, and several remaining research challenges are identified. Finally, the taxonomy of SIP threat will be presented.
Citation impact of papers published from six prolific countries: A national comparison based on InCites data
Venue: arXiv cs.DL 2012
Year: 2012

Using the InCites tool of Thomson Reuters, this study compares normalized citation impact values calculated for China, Japan, France, Germany, United States, and the UK throughout the time period from 1981 to 2010. The citation impact values are normalized to four subject areas: natural sciences; engineering and technology; medical and health sciences; and agricultural sciences. The results show an increasing trend in citation impact values for France, the UK and especially for Germany across the last thirty years in all subject areas. The citation impact of papers from China is still at a relatively low level (mostly below the world average), but the country follows an increasing trend line. The USA exhibits a relatively stable pattern of high citation impact values across the years. With small impact differences between the publication years, the US trend is increasing in engineering and technology but decreasing in medical and health sciences as well as in agricultural sciences. Similar to the USA, Japan follows increasing as well as decreasing trends in different subject areas, but the variability across the years is small. In most of the years, papers from Japan perform below or approximately at the world average in each subject area.
Reed's Conjecture on hole expansions
Venue: arXiv cs.DM 2012
Year: 2012

In 1998, Reed conjectured that for any graph $G$, $χ(G) \leq \lceil \frac{ω(G) + Δ(G)+1}{2}\rceil$, where $χ(G)$, $ω(G)$, and $Δ(G)$ respectively denote the chromatic number, the clique number and the maximum degree of $G$. In this paper, we study this conjecture for some expansions of graphs, that is graphs obtained with the well known operation composition of graphs. We prove that Reed's Conjecture holds for expansions of bipartite graphs, for expansions of odd holes where the minimum chromatic number of the components is even, when some component of the expansion has chromatic number 1 or when a component induces a bipartite graph. Moreover, Reed's Conjecture holds if all components have the same chromatic number, if the components have chromatic number at most 4 and when the odd hole has length 5. Finally, when $G$ is an odd hole expansion, we prove $χ(G)\leq\lceil\frac{ω(G)+Δ(G)+1}{2}\rceil+1$.
Discretization of a matrix in the problem of quadratic functional binary minimization
Venue: arXiv cs.NE 2012
Year: 2012

The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that optimal procedure of replacement matrix elements by the integer quantities with the limited number of gradations exist, and the efficient of minimization does not reduce. Parameter depends on matrix properties, which allows estimate the capability of using described procedure for given type of matrix, is found. Computational complexities of algorithm and RAM requirements are reduced by 16 times, correct using of integer elements allows increase minimization algorithm speed by the orders.
Exact Wavelets on the Ball
Venue: arXiv cs.IT 2012
Year: 2012

We develop an exact wavelet transform on the three-dimensional ball (i.e. on the solid sphere), which we name the flaglet transform. For this purpose we first construct an exact transform on the radial half-line using damped Laguerre polynomials and develop a corresponding quadrature rule. Combined with the spherical harmonic transform, this approach leads to a sampling theorem on the ball and a novel three-dimensional decomposition which we call the Fourier-Laguerre transform. We relate this new transform to the well-known Fourier-Bessel decomposition and show that band-limitedness in the Fourier-Laguerre basis is a sufficient condition to compute the Fourier-Bessel decomposition exactly. We then construct the flaglet transform on the ball through a harmonic tiling, which is exact thanks to the exactness of the Fourier-Laguerre transform (from which the name flaglets is coined). The corresponding wavelet kernels are well localised in real and Fourier-Laguerre spaces and their angular aperture is invariant under radial translation. We introduce a multiresolution algorithm to perform the flaglet transform rapidly, while capturing all information at each wavelet scale in the minimal number of samples on the ball. Our implementation of these new tools achieves floating-point precision and is made publicly available. We perform numerical experiments demonstrating the speed and accuracy of these libraries and illustrate their capabilities on a simple denoising example.
VIQI: A New Approach for Visual Interpretation of Deep Web Query Interfaces
Venue: arXiv cs.IR 2012
Year: 2012

Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of prices, quality of service, and facilities. As the number of services is growing rapidly, users have difficulty to ask many web services in the same time. In this paper, we imagine a system where users have the possibility to formulate one query using one query interface and then the system translates query to the rest of query interfaces. However, interfaces are created by designers in order to be interpreted visually by users, machines can not interpret query from a given interface. We propose a new approach which emulates capacity of interpretation of users and extracts query from deep web query interfaces. Our approach has proved good performances on two standard datasets.
Source Unfoldings of Convex Polyhedra via Certain Closed Curves
Venue: arXiv cs.CG 2012
Year: 2012

We extend the notion of a source unfolding of a convex polyhedron P to be based on a closed polygonal curve Q in a particular class rather than based on a point. The class requires that Q "lives on a cone" to both sides; it includes simple, closed quasigeodesics. Cutting a particular subset of the cut locus of Q (in P) leads to a non-overlapping unfolding of the polyhedron. This gives a new general method to unfold the surface of any convex polyhedron to a simple, planar polygon.
Reliable Generation of High-Performance Matrix Algebra
Venue: arXiv cs.MS 2012
Year: 2012

Scientific programmers often turn to vendor-tuned Basic Linear Algebra Subprograms (BLAS) to obtain portable high performance. However, many numerical algorithms require several BLAS calls in sequence, and those successive calls result in suboptimal performance. The entire sequence needs to be optimized in concert. Instead of vendor-tuned BLAS, a programmer could start with source code in Fortran or C (e.g., based on the Netlib BLAS) and use a state-of-the-art optimizing compiler. However, our experiments show that optimizing compilers often attain only one-quarter the performance of hand-optimized code. In this paper we present a domain-specific compiler for matrix algebra, the Build to Order BLAS (BTO), that reliably achieves high performance using a scalable search algorithm for choosing the best combination of loop fusion, array contraction, and multithreading for data parallelism. The BTO compiler generates code that is between 16% slower and 39% faster than hand-optimized code.
Application Of Data Mining In Bioinformatics
Venue: arXiv cs.CE 2012
Year: 2012

This article highlights some of the basic concepts of bioinformatics and data mining. The major research areas of bioinformatics are highlighted. The application of data mining in the domain of bioinformatics is explained. It also highlights some of the current challenges and opportunities of data mining in bioinformatics.
Hierarchical Range Sectoring and Bidirectional Link Quality Estimation for On-demand Collections in WSNs
Venue: arXiv cs.NI 2012
Year: 2012

The paper presents two mechanisms for designing an on-demand, reliable and efficient collection protocol for Wireless Sensor Networks. The former is the Bidirectional Link Quality Estimation, which allows nodes to easily and quickly compute the quality of a link between a pair of nodes. The latter, Hierarchical Range Sectoring, organizes sensors in different sectors based on their location within the network. Based on this organization, nodes from each sector are coordinated to transmit in specific periods of time to reduce the hidden terminal problem. To evaluate these two mechanisms, a protocol called HBCP (Hierarchical-Based Collection Protocol), that implements both mechanisms, has been implemented in TinyOS 2.1, and evaluated in a testbed using TelosB motes. The results show that the HBCP protocol is able to achieve a very high reliability, especially in large networks and in scenarios with bottlenecks.
Dynamic Multi-Relational Chinese Restaurant Process for Analyzing Influences on Users in Social Media
Venue: arXiv cs.SI 2012
Year: 2012

We study the problem of analyzing influence of various factors affecting individual messages posted in social media. The problem is challenging because of various types of influences propagating through the social media network that act simultaneously on any user. Additionally, the topic composition of the influencing factors and the susceptibility of users to these influences evolve over time. This problem has not studied before, and off-the-shelf models are unsuitable for this purpose. To capture the complex interplay of these various factors, we propose a new non-parametric model called the Dynamic Multi-Relational Chinese Restaurant Process. This accounts for the user network for data generation and also allows the parameters to evolve over time. Designing inference algorithms for this model suited for large scale social-media data is another challenge. To this end, we propose a scalable and multi-threaded inference algorithm based on online Gibbs Sampling. Extensive evaluations on large-scale Twitter and Facebook data show that the extracted topics when applied to authorship and commenting prediction outperform state-of-the-art baselines. More importantly, our model produces valuable insights on topic trends and user personality trends, beyond the capability of existing approaches.
Efficient and reliable network tomography in heterogeneous networks using BitTorrent broadcasts and clustering algorithms
Venue: arXiv cs.DC 2012
Year: 2012

In the area of network performance and discovery, network tomography focuses on reconstructing network properties using only end-to-end measurements at the application layer. One challenging problem in network tomography is reconstructing available bandwidth along all links during multiple source/multiple destination transmissions. The traditional measurement procedures used for bandwidth tomography are extremely time consuming. We propose a novel solution to this problem. Our method counts the fragments exchanged during a BitTorrent broadcast. While this measurement has a high level of randomness, it can be obtained very efficiently, and aggregated into a reliable metric. This data is then analyzed with state-of-the-art algorithms, which reliably reconstruct logical clusters of nodes inter-connected by high bandwidth, as well as bottlenecks between these logical clusters. Our experiments demonstrate that the proposed two-phase approach efficiently solves the presented problem for a number of settings on a complex grid infrastructure.
Minimizing Expected Termination Time in One-Counter Markov Decision Processes
Venue: arXiv cs.FL 2012
Year: 2012

We consider the problem of computing the value and an optimal strategy for minimizing the expected termination time in one-counter Markov decision processes. Since the value may be irrational and an optimal strategy may be rather complicated, we concentrate on the problems of approximating the value up to a given error epsilon > 0 and computing a finite representation of an epsilon-optimal strategy. We show that these problems are solvable in exponential time for a given configuration, and we also show that they are computationally hard in the sense that a polynomial-time approximation algorithm cannot exist unless P=NP.
An optimal consensus tracking control algorithm for autonomous underwater vehicles with disturbances
Venue: arXiv cs.RO 2012
Year: 2012

The optimal disturbance rejection control problem is considered for consensus tracking systems affected by external persistent disturbances and noise. Optimal estimated values of system states are obtained by recursive filtering for the multiple autonomous underwater vehicles modeled to multi-agent systems with Kalman filter. Then the feedforward-feedback optimal control law is deduced by solving the Riccati equations and matrix equations. The existence and uniqueness condition of feedforward-feedback optimal control law is proposed and the optimal control law algorithm is carried out. Lastly, simulations show the result is effectiveness with respect to external persistent disturbances and noise.
Publishing and linking transport data on the Web
Venue: arXiv cs.AI 2012
Year: 2012

Without Linked Data, transport data is limited to applications exclusively around transport. In this paper, we present a workflow for publishing and linking transport data on the Web. So we will be able to develop transport applications and to add other features which will be created from other datasets. This will be possible because transport data will be linked to these datasets. We apply this workflow to two datasets: NEPTUNE, a French standard describing a transport line, and Passim, a directory containing relevant information on transport services, in every French city.
A novel statistical fusion rule for image fusion and its comparison in non subsampled contourlet transform domain and wavelet domain
Venue: arXiv cs.CV 2012
Year: 2012

Image fusion produces a single fused image from a set of input images. A new method for image fusion is proposed based on Weighted Average Merging Method (WAMM) in the NonSubsampled Contourlet Transform (NSCT) domain. A performance analysis on various statistical fusion rules are also analysed both in NSCT and Wavelet domain. Analysis has been made on medical images, remote sensing images and multi focus images. Experimental results shows that the proposed method, WAMM obtained better results in NSCT domain than the wavelet domain as it preserves more edges and keeps the visual quality intact in the fused image.
Age Based User Interface in Mobile Operating System
Venue: arXiv cs.OS 2012
Year: 2012

This paper proposes the creation of different interfaces in the mobile operating system for different age groups. The different age groups identified are kids, elderly people and all others. The motive behind creating different interfaces is to make the smartphones of today's world usable to all age groups.
Reconstruction of Arbitrary Biochemical Reaction Networks: A Compressive Sensing Approach
Venue: arXiv cs.SY 2012
Year: 2012

Reconstruction of biochemical reaction networks is a central topic in systems biology which raises crucial theoretical challenges in system identification. Nonlinear Ordinary Differential Equations (ODEs) that involve polynomial and rational functions are typically used to model biochemical reaction networks. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data quite difficult. In this paper, we present a network reconstruction algorithm that can deal with model descriptions under the form of polynomial and rational functions. Rather than identifying the parameters of linear or nonlinear ODEs characterised by pre-defined equation structures, our methodology allows us to determine the nonlinear ODEs structure together with their associated reaction constants. To solve the network reconstruction problem, we cast it as a Compressive Sensing (CS) problem and use Bayesian Sparse Learning (BSL) algorithms as an efficient way to obtain its solution.
Stable Throughput in a Cognitive Wireless Network
Venue: arXiv cs.IT 2012
Year: 2012

We study, from a network layer perspective, the effect of an Ad-Hoc secondary network with N nodes randomly accessing the spectrum licensed to a primary node during the idle slots of the primary user. If the sensing is perfect, then the secondary nodes do not interfere with the primary node and hence do not affect its stable throughput. In case of imperfect sensing, it is shown that if the primary user's arrival rate is less than some calculated finite value, cognitive nodes can employ any transmission power or probabilities without affecting the primary user's stability; otherwise, the secondary nodes should control their transmission parameters to reduce the interference on the primary. It is also shown that in contrast with the primary's maximum stable throughput which strictly decreases with increased sensing errors, the throughput of the secondary nodes might increase with sensing errors as more transmission opportunities become available to them. Finally, we explore the use of the secondary nodes as relays of the primary node's traffic to compensate for the interference they might cause. We introduce a relaying protocol based on distributed space-time coding that forces all the secondary nodes that are able to decode a primary's unsuccessful packet to relay that packet whenever the primary is idle. In this case, for appropriate modulation scheme and under perfect sensing, it is shown that the more secondary nodes in the system, the better for the primary user in terms of his stable throughput. Meanwhile, the secondary nodes might benefit from relaying by having access to a larger number of idle slots due to the increase of the service rate of the primary. For the case of a single secondary node, the proposed relaying protocol guarantees that either both the primary and the secondary benefit from relaying or none of them does.
A simple 1-byte 1-clock RC4 design and its efficient implementation in FPGA coprocessor for secured ethernet communication
Venue: arXiv cs.AR 2012
Year: 2012

In the field of cryptography till date the 1-byte in 1-clock is the best known RC4 hardware design [1], while the 1-byte in 3clocks is the best known implementation [2,3]. The design algorithm in [1] considers two consecutive bytes together and processes them in 2 clocks. The design of 1-byte in 3-clocks is too much modular and clock hungry. In this paper considering the RC4 algorithm, as it is, a simpler RC4 hardware design providing higher throughput is proposed in which 1-byte is processed in 1-clock. In the design two sequential tasks are executed as two independent events during rising and falling edges of the same clock and the swapping is directly executed using a MUX-DEMUX combination. The power consumed in behavioral and structural designs of RC4 are estimated and a power optimization technique is proposed. The NIST statistical test suite is run on RC4 key streams in order to know its randomness property. The encryption and decryption designs are respectively embedded on two FPGA boards with RC4 in a custom coprocessor followed by Ethernet communication.