OpenRaiser/Intern-Atlas huggingface dataset:
Achievable and Crystallized Rate Regions of the Interference Channel with Interference as Noise
Venue: arXiv cs.IT 2011
Year: 2011

The interference channel achievable rate region is presented when the interference is treated as noise. The formulation starts with the 2-user channel, and then extends the results to the n-user case. The rate region is found to be the convex hull of the union of n power control rate regions, where each power control rate region is upperbounded by a (n-1)-dimensional hyper-surface characterized by having one of the transmitters transmitting at full power. The convex hull operation lends itself to a time-sharing operation depending on the convexity behavior of those hyper-surfaces. In order to know when to use time-sharing rather than power control, the paper studies the hyper-surfaces convexity behavior in details for the 2-user channel with specific results pertaining to the symmetric channel. It is observed that most of the achievable rate region can be covered by using simple On/Off binary power control in conjunction with time-sharing. The binary power control creates several corner points in the n-dimensional space. The crystallized rate region, named after its resulting crystal shape, is hence presented as the time-sharing convex hull imposed onto those corner points; thereby offering a viable new perspective of looking at the achievable rate region of the interference channel.
Design and Simulation of an 8-bit Dedicated Processor for calculating the Sine and Cosine of an Angle using the CORDIC Algorithm
Venue: arXiv cs.AR 2011
Year: 2011

This paper describes the design and simulation of an 8-bit dedicated processor for calculating the Sine and Cosine of an Angle using CORDIC Algorithm (COordinate Rotation DIgital Computer), a simple and efficient algorithm to calculate hyperbolic and trigonometric functions. We have proposed a dedicated processor system, modeled by writing appropriate programs in VHDL, for calculating the Sine and Cosine of an angle. System simulation was carried out using ModelSim 6.3f and Xilinx ISE Design Suite 12.3. A maximum frequency of 81.353 MHz was reached with a minimum period of 12.292 ns. 126 (3%) slices were used. This paper attempts to survey the existing CORDIC algorithm with an eye towards implementation in Field Programmable Gate Arrays (FPGAs). A brief description of the theory behind the algorithm and the derivation of the Sine and Cosine of an angle using the CORDIC algorithm has been presented. The system can be implemented using Spartan3 XC3S400 with Xilinx ISE 12.3 and VHDL.
Using a Telepresence System to Investigate Route Choice Behavior
Venue: arXiv cs.HC 2011
Year: 2011

A combination of a telepresence system and a microscopic traffic simulator is introduced. It is evaluated using a hotel evacuation scenario. Four different kinds of supporting information are compared, standard exit signs, floor plans with indicated exit routes, guiding lines on the floor and simulated agents leading the way. The results indicate that guiding lines are the most efficient way to support an evacuation but the natural behavior of following others comes very close. On another level the results are consistent with previously performed real and virtual experiments and validate the use of a telepresence system in evacuation studies. It is shown that using a microscopic traffic simulator extends the possibilities for evaluation, e.g. by adding simulated humans to the environment.
More Voices Than Ever? Quantifying Media Bias in Networks
Venue: arXiv cs.SI 2011
Year: 2011

Social media, such as blogs, are often seen as democratic entities that allow more voices to be heard than the conventional mass or elite media. Some also feel that social media exhibits a balancing force against the arguably slanted elite media. A systematic comparison between social and mainstream media is necessary but challenging due to the scale and dynamic nature of modern communication. Here we propose empirical measures to quantify the extent and dynamics of social (blog) and mainstream (news) media bias. We focus on a particular form of bias---coverage quantity---as applied to stories about the 111th US Congress. We compare observed coverage of Members of Congress against a null model of unbiased coverage, testing for biases with respect to political party, popular front runners, regions of the country, and more. Our measures suggest distinct characteristics in news and blog media. A simple generative model, in agreement with data, reveals differences in the process of coverage selection between the two media.
Using Transcoding for Hidden Communication in IP Telephony
Venue: arXiv cs.CR 2011
Year: 2011

The paper presents a new steganographic method for IP telephony called TranSteg (Transcoding Steganography). Typically, in steganographic communication it is advised for covert data to be compressed in order to limit its size. In TranSteg it is the overt data that is compressed to make space for the steganogram. The main innovation of TranSteg is to, for a chosen voice stream, find a codec that will result in a similar voice quality but smaller voice payload size than the originally selected. Then, the voice stream is transcoded. At this step the original voice payload size is intentionally unaltered and the change of the codec is not indicated. Instead, after placing the transcoded voice payload, the remaining free space is filled with hidden data. TranSteg proof of concept implementation was designed and developed. The obtained experimental results are enclosed in this paper. They prove that the proposed method is feasible and offers a high steganographic bandwidth. TranSteg detection is difficult to perform when performing inspection in a single network localisation.
An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem
Venue: arXiv cs.NE 2011
Year: 2011

The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. One of the most powerful and commonly used heuristics to obtain approximations to the optimal solution of the QAP is simulated annealing (SA). We present an efficient implementation of the SA heuristic which performs more than 100 times faster then existing implementations for large problem sizes and a large number of SA iterations.
Algebras over a field and semantics for context based reasoning
Venue: arXiv cs.CL 2011
Year: 2011

This paper introduces context algebras and demonstrates their application to combining logical and vector-based representations of meaning. Other approaches to this problem attempt to reproduce aspects of logical semantics within new frameworks. The approach we present here is different: We show how logical semantics can be embedded within a vector space framework, and use this to combine distributional semantics, in which the meanings of words are represented as vectors, with logical semantics, in which the meaning of a sentence is represented as a logical form.
New Method for 3D Shape Retrieval
Venue: arXiv cs.CV 2011
Year: 2011

The recent technological progress in acquisition, modeling and processing of 3D data leads to the proliferation of a large number of 3D objects databases. Consequently, the techniques used for content based 3D retrieval has become necessary. In this paper, we introduce a new method for 3D objects recognition and retrieval by using a set of binary images CLI (Characteristic level images). We propose a 3D indexing and search approach based on the similarity between characteristic level images using Hu moments for it indexing. To measure the similarity between 3D objects we compute the Hausdorff distance between a vectors descriptor. The performance of this new approach is evaluated at set of 3D object of well known database, is NTU (National Taiwan University) database.
Information Security Synthesis in Online Universities
Venue: arXiv cs.CR 2011
Year: 2011

Information assurance is at the core of every initiative that an organization executes. For online universities, a common and complex initiative is maintaining user lifecycle and providing seamless access using one identity in a large virtual infrastructure. To achieve information assurance the management of user privileges affected by events in the user's identity lifecycle needs to be the determining factor for access control. While the implementation of identity and access management systems makes this initiative feasible, it is the construction and maintenance of the infrastructure that makes it complex and challenging. The objective of this paper1 is to describe the complexities, propose a practical approach to building a foundation for consistent user experience and realizing security synthesis in online universities.
Discriminative Local Sparse Representations for Robust Face Recognition
Venue: arXiv cs.CV 2011
Year: 2011

A key recent advance in face recognition models a test face image as a sparse linear combination of a set of training face images. The resulting sparse representations have been shown to possess robustness against a variety of distortions like random pixel corruption, occlusion and disguise. This approach however makes the restrictive (in many scenarios) assumption that test faces must be perfectly aligned (or registered) to the training data prior to classification. In this paper, we propose a simple yet robust local block-based sparsity model, using adaptively-constructed dictionaries from local features in the training data, to overcome this misalignment problem. Our approach is inspired by human perception: we analyze a series of local discriminative features and combine them to arrive at the final classification decision. We propose a probabilistic graphical model framework to explicitly mine the conditional dependencies between these distinct sparse local features. In particular, we learn discriminative graphs on sparse representations obtained from distinct local slices of a face. Conditional correlations between these sparse features are first discovered (in the training phase), and subsequently exploited to bring about significant improvements in recognition rates. Experimental results obtained on benchmark face databases demonstrate the effectiveness of the proposed algorithms in the presence of multiple registration errors (such as translation, rotation, and scaling) as well as under variations of pose and illumination.
Projection-Based and Look Ahead Strategies for Atom Selection
Venue: arXiv cs.SY 2011
Year: 2011

In this paper, we improve iterative greedy search algorithms in which atoms are selected serially over iterations, i.e., one-by-one over iterations. For serial atom selection, we devise two new schemes to select an atom from a set of potential atoms in each iteration. The two new schemes lead to two new algorithms. For both the algorithms, in each iteration, the set of potential atoms is found using a standard matched filter. In case of the first scheme, we propose an orthogonal projection strategy that selects an atom from the set of potential atoms. Then, for the second scheme, we propose a look ahead strategy such that the selection of an atom in the current iteration has an effect on the future iterations. The use of look ahead strategy requires a higher computational resource. To achieve a trade-off between performance and complexity, we use the two new schemes in cascade and develop a third new algorithm. Through experimental evaluations, we compare the proposed algorithms with existing greedy search and convex relaxation algorithms.
Towards a theory of modelling with Boolean automata networks - I. Theorisation and observations
Venue: arXiv cs.DM 2011
Year: 2011

Although models are built on the basis of some observations of reality, the concepts that derive theoretically from their definitions as well as from their characteristics and properties are not necessarily direct consequences of these initial observations. Indeed, many of them rather follow from chains of theoretical inferences that are only based on the precise model definitions and rely strongly, in addition, on some consequential working hypotheses. Thus, it is important to address the question of which features of a model effectively carry some modelling meaning and which only result from the task of formalising observations of reality into a mathematical language. In this article, we address this question with a theoretical point view that sets our discussion strictly between the two stages of the modelling process that require knowledge of real systems, that is, between the initial stage that chooses a global theoretical framework to build the model and the final stage that exploits its formal predictions by comparing them to the reality that the model was designed to simulate. Taking Boolean automata networks as instances of models of systems observed in reality, we analyse in this setting the remaining stages of the modelling process and we show how the meaning of theoretical concepts can subtly rely on formal choices such as definitions and hypotheses.
On the Optimal Transmission Scheme to Maximize Local Capacity in Wireless Networks
Venue: arXiv cs.NI 2011
Year: 2011

We study the optimal transmission scheme that maximizes the local capacity in two-dimensional (2D) wireless networks. Local capacity is defined as the average information rate received by a node randomly located in the network. Using analysis based on analytical and numerical methods, we show that maximum local capacity can be obtained if simultaneous emitters are positioned in a grid pattern based on equilateral triangles. We also compare this maximum local capacity with the local capacity of slotted ALOHA scheme and our results show that slotted ALOHA can achieve at least half of the maximum local capacity in wireless networks.
A Novel Approach to Texture classification using statistical feature
Venue: arXiv cs.CV 2011
Year: 2011

Texture is an important spatial feature which plays a vital role in content based image retrieval. The enormous growth of the internet and the wide use of digital data have increased the need for both efficient image database creation and retrieval procedure. This paper describes a new approach for texture classification by combining statistical texture features of Local Binary Pattern and Texture spectrum. Since most significant information of a texture often appears in the high frequency channels, the features are extracted by the computation of LBP and Texture Spectrum and Legendre Moments. Euclidean distance is used for similarity measurement. The experimental result shows that 97.77% classification accuracy is obtained by the proposed method.
Darwin inside the machines: Malware evolution and the consequences for computer security
Venue: arXiv cs.CR 2011
Year: 2011

Recent advances in anti-malware technologies have steered the security industry away from maintaining vast signature databases and into newer defence technologies such as behaviour blocking, application whitelisting and others. Most would agree that the reasoning behind this is to keep up with the arms race established between malware writers and the security community almost three decades ago. Still, malware writers have not as yet created new paradigms. Indeed, malicious code development is still largely limited to code pattern changes utilizing polymorphic and metamorphic engines, as well as executable packer and wrapper technologies. Each new malware instance retains the exact same core functionality as its ancestor and only alters the way it looks. What if, instead, malware were able to change its function or behaviour autonomously? What if, in the absence of human intervention, computer viruses resembled biological viruses in their ability to adapt to new defence technologies as soon as they came into effect? In this paper, we will provide the theoretical proof behind malware implementation that closely models Darwinian evolution.
Model-Based Trace-Checking
Venue: arXiv cs.LO 2011
Year: 2011

Trace analysis can be a useful way to discover problems in a program under test. Rather than writing a special purpose trace analysis tool, this paper proposes that traces can usefully be analysed by checking them against a formal model using a standard model-checker or else an animator for executable specifications. These techniques are illustrated using a Travel Agent case study implemented in J2EE. We added trace beans to this code that write trace information to a database. The traces are then extracted and converted into a form suitable for analysis by Spin, a popular model-checker, and Pro-B, a model-checker and animator for the B notation. This illustrates the technique, and also the fact that such a system can have a variety of models, in different notations, that capture different features. These experiments have demonstrated that model-based trace-checking is feasible. Future work is focussed on scaling up the approach to larger systems by increasing the level of automation.
vFlow: A GUI-Based Tool for Building Batch Applications for Cloud Computing
Venue: arXiv cs.SE 2011
Year: 2011

In this paper we introduce vFlow - A framework for rapid designing of batch processing applications for Cloud Computing environment. vFlow batch processing system extracts tasks from the vPlans diagrams, systematically captures the dynamics in batch application management tasks, and translates them to Cloud environment API, named vDocuments, that can be used to execute batch processing applications. vDocuments do not only enable the complete execution of low-level configuration management tasks, but also allow the construction of more sophisticated tasks, while imposing additional reasoning logic to realize batch application management objectives in Cloud environments. We present the design of the vFlow framework and illustrate its utility by presenting the implementation of several sophisticated operational tasks.
A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking
Venue: arXiv cs.LO 2011
Year: 2011

Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively. In PCTL and CSL, the possibility of executions satisfying some temporal properties can be quantitatively represented by the probabilistic extension of the path quantifiers in their basic Computation Tree Logic (CTL), however, path formulae of them are expressed via the same operators in CTL. For this reason, both of them cannot represent formulae with quantitative temporal properties, such as those of the form "some properties hold to more than 80% of time points (in a certain bounded interval) on the path." In this paper, we introduce a new temporal operator which expressed the notion of frequency of events, and define probabilistic frequency temporal logic (PFTL) based on CTL\star. As a result, we can easily represent the temporal properties of behavior in probabilistic systems. However, it is difficult to develop a model checker for the full PFTL, due to rich expressiveness. Accordingly, we develop a model-checking algorithm for the CTL-like fragment of PFTL against finite-state Markov chains, and an approximate model-checking algorithm for the bounded Linear Temporal Logic (LTL) -like fragment of PFTL against countable-state Markov chains.
ESLO: from transcription to speakers' personal information annotation
Venue: arXiv cs.CL 2011
Year: 2011

This paper presents the preliminary works to put online a French oral corpus and its transcription. This corpus is the Socio-Linguistic Survey in Orleans, realized in 1968. First, we numerized the corpus, then we handwritten transcribed it with the Transcriber software adding different tags about speakers, time, noise, etc. Each document (audio file and XML file of the transcription) was described by a set of metadata stored in an XML format to allow an easy consultation. Second, we added different levels of annotations, recognition of named entities and annotation of personal information about speakers. This two annotation tasks used the CasSys system of transducer cascades. We used and modified a first cascade to recognize named entities. Then we built a second cascade to annote the designating entities, i.e. information about the speaker. These second cascade parsed the named entity annotated corpus. The objective is to locate information about the speaker and, also, what kind of information can designate him/her. These two cascades was evaluated with precision and recall measures.
On the Concatenation of Non-Binary Random Linear Fountain Codes with Maximum Distance Separable Codes
Venue: arXiv cs.IT 2011
Year: 2011

A novel fountain coding scheme has been introduced. The scheme consists of a parallel concatenation of a MDS block code with a LRFC code, both constructed over the same field, $F_q$. The performance of the concatenated fountain coding scheme has been analyzed through derivation of tight bounds on the probability of decoding failure as a function of the overhead. It has been shown how the concatenated scheme performs as well as LRFC codes in channels characterized by high erasure probabilities, whereas they provide failure probabilities lower by several orders of magnitude at moderate/low erasure probabilities.
Fingerprinting with Equiangular Tight Frames
Venue: arXiv cs.IT 2011
Year: 2011

Digital fingerprinting is a framework for marking media files, such as images, music, or movies, with user-specific signatures to deter illegal distribution. Multiple users can collude to produce a forgery that can potentially overcome a fingerprinting system. This paper proposes an equiangular tight frame fingerprint design which is robust to such collusion attacks. We motivate this design by considering digital fingerprinting in terms of compressed sensing. The attack is modeled as linear averaging of multiple marked copies before adding a Gaussian noise vector. The content owner can then determine guilt by exploiting correlation between each user's fingerprint and the forged copy. The worst-case error probability of this detection scheme is analyzed and bounded. Simulation results demonstrate the average-case performance is similar to the performance of orthogonal and simplex fingerprint designs, while accommodating several times as many users.
Fully dynamic recognition of proper circular-arc graphs
Venue: arXiv cs.DS 2011
Year: 2011

We present a fully dynamic algorithm for the recognition of proper circular-arc (PCA) graphs. The allowed operations on the graph involve the insertion and removal of vertices (together with its incident edges) or edges. Edge operations cost O(log n) time, where n is the number of vertices of the graph, while vertex operations cost O(log n + d) time, where d is the degree of the modified vertex. We also show incremental and decremental algorithms that work in O(1) time per inserted or removed edge. As part of our algorithm, fully dynamic connectivity and co-connectivity algorithms that work in O(log n) time per operation are obtained. Also, an O(Δ) time algorithm for determining if a PCA representation corresponds to a co-bipartite graph is provided, where Δ is the maximum among the degrees of the vertices. When the graph is co-bipartite, a co-bipartition of each of its co-components is obtained within the same amount of time.
On the Rabin signature
Venue: arXiv cs.CR 2011
Year: 2011

Some Rabin signature schemes may be exposed to forgery; several variants are here described to counter this vulnerability. Blind Rabin signatures are also discussed.
The debts' clearing problem: a new approach
Venue: arXiv cs.DS 2011
Year: 2011

The debts' clearing problem is about clearing all the debts in a group of $n$ entities (e.g. persons, companies) using a minimal number of money transaction operations. In our previous works we studied the problem, gave a dynamic programming solution solving it and proved that it is NP-hard. In this paper we adapt the problem to dynamic graphs and give a data structure to solve it. Based on this data structure we develop a new algorithm, that improves our previous one for the static version of the problem.