OpenRaiser/Intern-Atlas huggingface dataset:
Securing data transfer in the cloud through introducing identification packet and UDT-authentication option field: a characterization
Venue: arXiv cs.NI 2010
Year: 2010

The emergence of various technologies has since pushed researchers to develop new protocols that support high density data transmissions in Wide Area Networks. Many of these protocols are TCP protocol variants, which have demonstrated better performance in simulation and several limited network experiments but have limited practical applications because of implementation and installation difficulties. On the other hand, users who need to transfer bulk data (e.g., in grid/cloud computing) usually turn to application level solutions where these variants do not fair well. Among protocols considered in the application level solutions are UDP-based protocols, such as UDT (UDP-based Data Transport Protocol) for cloud /grid computing. Despite the promising development of protocols like UDT, what remains to be a major challenge that current and future network designers face is to achieve survivability and security of data and networks. Our previous research surveyed various security methodologies which led to the development of a framework for UDT. In this paper we present lowerlevel security by introducing an Identity Packet (IP) and Authentication Option (AO) for UDT.
Implicit and explicit communication in decentralized control
Venue: arXiv cs.IT 2010
Year: 2010

There has been substantial progress recently in understanding toy problems of purely implicit signaling. These are problems where the source and the channel are implicit -- the message is generated endogenously by the system, and the plant itself is used as a channel. In this paper, we explore how implicit and explicit communication can be used synergistically to reduce control costs. The setting is an extension of Witsenhausen's counterexample where a rate-limited external channel connects the two controllers. Using a semi-deterministic version of the problem, we arrive at a binning-based strategy that can outperform the best known strategies by an arbitrarily large factor. We also show that our binning-based strategy attains within a constant factor of the optimal cost for an asymptotically infinite-length version of the problem uniformly over all problem parameters and all rates on the external channel. For the scalar case, although our results yield approximate optimality for each fixed rate, we are unable to prove approximately-optimality uniformly over all rates.
Suggested Rules for Designing Secure Communication Systems Utilizing Chaotic Lasers: A Survey
Venue: arXiv cs.CR 2010
Year: 2010

Chaotic communications based on semiconductor lasers have aroused great research interest since 1990s. Physical-layer encryption using chaotic lasers is an alternative to transmit message rapidly and confidentially. There are some practical devices and setups for optical chaotic communications, which are intuitively considered to be secure. However, there is lack of a set of security evaluation rules for these communication setups. According to the recent literature, we summarize several criteria for optical chaotic communications to evaluate the security and point out some methods to enhance the security. These criteria and suggested rules are very helpful in designing secure communication systems using chaotic lasers. Finally we propose some possible hot topics on security analysis of optical chaotic communications in future.
Property Testing via Set-Theoretic Operations
Venue: arXiv cs.DS 2010
Year: 2010

Given two testable properties $\mathcal{P}_{1}$ and $\mathcal{P}_{2}$, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study of these basic set-theoretic operations in the context of property testing. As an application, we give a conceptually different proof that linearity is testable, albeit with much worse query complexity. Furthermore, for the problem of testing disjunction of linear functions, which was previously known to be one-sided testable with a super-polynomial query complexity, we give an improved analysis and show it has query complexity $O(1/\eps^2)$, where $\eps$ is the distance parameter.
Multi-dimensional sets recognizable in all abstract numeration systems
Venue: arXiv cs.FL 2010
Year: 2010

We prove that the subsets of N^d that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.
Port Protocols for Deadlock-Freedom of Component Systems
Venue: arXiv cs.LO 2010
Year: 2010

In component-based development, approaches for property verification exist that avoid building the global system behavior of the component model. Typically, these approaches rely on the analysis of the local behavior of fixed sized subsystems of components. In our approach, we want to avoid not only the analysis of the global behavior but also of the local behaviors of the components. Instead, we consider very small parts of the local behaviors called port protocols that suffice to verify properties.
History-sensitive versus future-sensitive approaches to security in distributed systems
Venue: arXiv cs.CR 2010
Year: 2010

We consider the use of aspect-oriented techniques as a flexible way to deal with security policies in distributed systems. Recent work suggests to use aspects for analysing the future behaviour of programs and to make access control decisions based on this; this gives the flavour of dealing with information flow rather than mere access control. We show in this paper that it is beneficial to augment this approach with history-based components as is the traditional approach in reference monitor-based approaches to mandatory access control. Our developments are performed in an aspect-oriented coordination language aiming to describe the Bell-LaPadula policy as elegantly as possible. Furthermore, the resulting language has the capability of combining both history- and future-sensitive policies, providing even more flexibility and power.
Primitives for Contract-based Synchronization
Venue: arXiv cs.PL 2010
Year: 2010

We investigate how contracts can be used to regulate the interaction between processes. To do that, we study a variant of the concurrent constraints calculus presented in [1], featuring primitives for multi-party synchronization via contracts. We proceed in two directions. First, we exploit our primitives to model some contract-based interactions. Then, we discuss how several models for concurrency can be expressed through our primitives. In particular, we encode the pi-calculus and graph rewriting.
Mechanized semantics
Venue: arXiv cs.PL 2010
Year: 2010

The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and over generic program transformations, as typically found in compilers. The topics covered include: operational semantics (small-step, big-step, definitional interpreters); a simple form of denotational semantics; axiomatic semantics and Hoare logic; generation of verification conditions, with application to program proof; compilation to virtual machine code and its proof of correctness; an example of an optimizing program transformation (dead code elimination) and its proof of correctness.
A derivational rephrasing experiment for question answering
Venue: arXiv cs.IR 2010
Year: 2010

In Knowledge Management, variations in information expressions have proven a real challenge. In particular, classical semantic relations (e.g. synonymy) do not connect words with different parts-of-speech. The method proposed tries to address this issue. It consists in building a derivational resource from a morphological derivation tool together with derivational guidelines from a dictionary in order to store only correct derivatives. This resource, combined with a syntactic parser, a semantic disambiguator and some derivational patterns, helps to reformulate an original sentence while keeping the initial meaning in a convincing manner This approach has been evaluated in three different ways: the precision of the derivatives produced from a lemma; its ability to provide well-formed reformulations from an original sentence, preserving the initial meaning; its impact on the results coping with a real issue, ie a question answering task . The evaluation of this approach through a question answering system shows the pros and cons of this system, while foreshadowing some interesting future developments.
Events! (Reactivity in urbiscript)
Venue: arXiv cs.PL 2010
Year: 2010

Urbi SDK is a software platform for the development of portable robotic applications. It features the Urbi UObject C++ middleware, to manage hardware drivers and/or possibly remote software components, and urbiscript, a domain specific programming language to orchestrate them. Reactivity is a key feature of Urbi SDK, embodied in events in urbiscript. This paper presents the support for events in urbiscript.
PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems
Venue: arXiv cs.DS 2010
Year: 2010

We analyze the so-called ppz algorithm for (d,k)-CSP problems for general values of d (number of values a variable can take) and k (number of literals per constraint). To analyze its success probability, we prove a correlation inequality for submodular functions.
Inner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results
Venue: arXiv cs.IT 2010
Year: 2010

The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter regimes but remains unknown in general. In this paper we provide a comparative overview of this channel model as we proceed through our contributions: we present a new outer bound based on the idea of a broadcast channel with degraded message sets, and another series of outer bounds obtained by transforming the cognitive channel into channels with known capacity. We specialize the largest known inner bound derived for the discrete memoryless channel to the Gaussian noise channel and present several simplified schemes evaluated for Gaussian inputs in closed form which we use to prove a number of results. These include a new set of capacity results for the a) "primary decodes cognitive" regime, a subset of the "strong interference" regime that is not included in the "very strong interference" regime for which capacity was known, and for the b) "S-channel" in which the primary transmitter does not interfere with the cognitive receiver. Next, for a general Gaussian cognitive interference channel, we determine the capacity to within one bit/s/Hz and to within a factor two regardless of channel parameters, thus establishing rate performance guarantees at high and low SNR, respectively. We also show how different simplified transmission schemes achieve a constant gap between inner and outer bound for specific channels. Finally, we numerically evaluate and compare the various simplified achievable rate regions and outer bounds in parameter regimes where capacity is unknown, leading to further insight on the capacity region of the Gaussian cognitive interference channel.
GraphDuplex: visualisation simultanée de N réseaux couplés 2 par 2
Venue: arXiv cs.IR 2010
Year: 2010

While social network analysis often focuses on graph structure of social actors, an increasing number of communication networks now provide textual content within social activity (email, instant messaging, blogging, collaboration networks). We present an open source visualization software, GraphDuplex, which brings together social structure and textual content, adding a semantic dimension to social analysis. GraphDuplex eventually connects any number of social or semantic graphs together, and through dynamic queries enables user interaction and exploration across multiple graphs of different nature.
Approximating Subdense Instances of Covering Problems
Venue: arXiv cs.DS 2010
Year: 2010

We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new approximation algorithms as well as new polynomial time approximation schemes (PTASs) for those problems and establish first approximation hardness results for them. Interestingly, in some cases we were able to prove optimality of the underlying approximation ratios, under usual complexity-theoretic assumptions. Our results for the Vertex Cover problem depend on an improved recursive sampling method which could be of independent interest.
Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory
Venue: arXiv cs.AI 2010
Year: 2010

In this paper it is considered rule reduct generation problem, based on Rough Set Theory. Rule Reduct Generation (RG) and Modified Rule Generation (MRG) algorithms are well-known. Alternative to these algorithms Pruning Algorithm of Generation A Minimal Set of Rule Reducts, or briefly Pruning Rule Generation (PRG) algorithm is developed. PRG algorithm uses tree structured data type. PRG algorithm is compared with RG and MRG algorithms
IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata
Venue: arXiv cs.FL 2010
Year: 2010

We present here Imitator II, a new version of Imitator, a tool implementing the "inverse method" for parametric timed automata: given a reference valuation of the parameters, it synthesizes a constraint such that, for any valuation satisfying this constraint, the system behaves the same as under the reference valuation in terms of traces, i.e., alternating sequences of locations and actions. Imitator II also implements the "behavioral cartography algorithm", allowing us to solve the following good parameters problem: find a set of valuations within a given bounded parametric domain for which the system behaves well. We present new features and optimizations of the tool, and give results of applications to various examples of asynchronous circuits and communication protocols.
Mobile Based Secure Digital Wallet for Peer to Peer Payment System
Venue: arXiv cs.CE 2010
Year: 2010

E-commerce in today's conditions has the highest dependence on network infrastructure of banking. However, when the possibility of communicating with the Banking network is not provided, business activities will suffer. This paper proposes a new approach of digital wallet based on mobile devices without the need to exchange physical money or communicate with banking network. A digital wallet is a software component that allows a user to make an electronic payment in cash (such as a credit card or a digital coin), and hides the low-level details of executing the payment protocol that is used to make the payment. The main features of proposed architecture are secure awareness, fault tolerance, and infrastructure-less protocol.
Developing courses with HoloRena, a framework for scenario- and game based e-learning environments
Venue: arXiv cs.LG 2010
Year: 2010

However utilizing rich, interactive solutions can make learning more effective and attractive, scenario- and game-based educational resources on the web are not widely used. Creating these applications is a complex, expensive and challenging process. Development frameworks and authoring tools hardly support reusable components, teamwork and learning management system-independent courseware architecture. In this article we initiate the concept of a low-level, thick-client solution addressing these problems. With some example applications we try to demonstrate, how a framework, based on this concept can be useful for developing scenario- and game-based e-learning environments.
Variations on the Sensitivity Conjecture
Venue: arXiv cs.CC 2010
Year: 2010

We present a selection of known as well as new variants of the Sensitivity Conjecture and point out some weaker versions that are also open.
Multiscale Bone Remodelling with Spatial P Systems
Venue: arXiv cs.CE 2010
Year: 2010

Many biological phenomena are inherently multiscale, i.e. they are characterized by interactions involving different spatial and temporal scales simultaneously. Though several approaches have been proposed to provide "multilayer" models, only Complex Automata, derived from Cellular Automata, naturally embed spatial information and realize multiscaling with well-established inter-scale integration schemas. Spatial P systems, a variant of P systems in which a more geometric concept of space has been added, have several characteristics in common with Cellular Automata. We propose such a formalism as a basis to rephrase the Complex Automata multiscaling approach and, in this perspective, provide a 2-scale Spatial P system describing bone remodelling. The proposed model not only results to be highly faithful and expressive in a multiscale scenario, but also highlights the need of a deep and formal expressiveness study involving Complex Automata, Spatial P systems and other promising multiscale approaches, such as our shape-based one already resulted to be highly faithful.
Stability number and f-factors in graphs
Venue: arXiv cs.DM 2010
Year: 2010

We present a new sufficient condition on stability number and toughness of the graph to have an f-factor.
E-Net Models of a Software System for Web Pages Security SECURITY
Venue: arXiv cs.CR 2010
Year: 2010

This paper presents solutions for cryptography protection for web pages. The solutions comprise the authors' experience in development and implementation of systems for information security in the Automated Information Systems of Bulgarian Armed Forces. The architecture, the models and the methods are being explained.
Group Anonymity
Venue: arXiv cs.CR 2010
Year: 2010

In recent years the amount of digital data in the world has risen immensely. But, the more information exists, the greater is the possibility of its unwanted disclosure. Thus, the data privacy protection has become a pressing problem of the present time. The task of individual privacy-preserving is being thoroughly studied nowadays. At the same time, the problem of statistical disclosure control for collective (or group) data is still open. In this paper we propose an effective and relatively simple (wavelet-based) way to provide group anonymity in collective data. We also provide a real-life example to illustrate the method.
Hardness and Approximation of The Asynchronous Border Minimization Problem
Venue: arXiv cs.DS 2010
Year: 2010

We study a combinatorial problem arising from microarrays synthesis. The synthesis is done by a light-directed chemical process. The objective is to minimize unintended illumination that may contaminate the quality of experiments. Unintended illumination is measured by a notion called border length and the problem is called Border Minimization Problem (BMP). The objective of the BMP is to place a set of probe sequences in the array and find an embedding (deposition of nucleotides/residues to the array cells) such that the sum of border length is minimized. A variant of the problem, called P-BMP, is that the placement is given and the concern is simply to find the embedding. Approximation algorithms have been previously proposed for the problem but it is unknown whether the problem is NP-hard or not. In this paper, we give a thorough study of different variations of BMP by giving NP-hardness proofs and improved approximation algorithms. We show that P-BMP, 1D-BMP, and BMP are all NP-hard. Contrast with the previous result that 1D-P-BMP is polynomial time solvable, the interesting implications include (i) the array dimension (1D or 2D) differentiates the complexity of P-BMP; (ii) for 1D array, whether placement is given differentiates the complexity of BMP; (iii) BMP is NP-hard regardless of the dimension of the array. Another contribution of the paper is improving the approximation for BMP from $O(n^{1/2} \log^2 n)$ to $O(n^{1/4} \log^2 n)$, where $n$ is the total number of sequences.
Multivariate Analyis of Swap Bribery
Venue: arXiv cs.CC 2010
Year: 2010

We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swapping the positions of two consecutive candidates in his preference ranking. The question is whether it is possible, without exceeding a given budget, to bribe the voters in a way that the preferred candidate wins in the election. We initiate a parameterized and multivariate complexity analysis of Swap Bribery, focusing on the case of k-approval. We investigate how different cost functions affect the computational complexity of the problem. We identify a special case of k-approval for which the problem can be solved in polynomial time, whereas we prove NP-hardness for a slightly more general scenario. We obtain fixed-parameter tractability as well as W[1]-hardness results for certain natural parameters.
Average Sum-Rate of Distributed Alamouti Space--Time Scheme in Two-Way Amplify-and-Forward Relay Networks
Venue: arXiv cs.IT 2010
Year: 2010

In this paper, we propose a distributed Alamouti space-time code (DASTC) for two-way relay networks employing a single amplify-and-forward (AF) relay. We first derive closed-form expressions for the approximated average sum-rate of the proposed DASTC scheme. Our analysis is validated by a comparison against the results of Monte-Carlo simulations. Numerical results verify the effectiveness of our proposed scheme over the conventional DASTC with one-way communication.
Fuzzy Controller for Matrix Converter System to Improve its Quality of Output
Venue: arXiv cs.SY 2010
Year: 2010

In this paper, Fuzzy Logic controller is developed for ac/ac Matrix Converter. Furthermore, Total Harmonic Distortion is reduced significantly. Space Vector Algorithm is a method to improve power quality of the converter output. But its quality is limited to 86.7%.We are introduced a Cross coupled DQ axis controller to improve power quality. The Matrix Converter is an attractive topology for High voltage transformation ratio. A Matlab / Simulink simulation analysis of the Matrix Converter system is provided. The design and implementation of fuzzy controlled Matrix Converter is described. This AC-AC system is proposed as an effective replacement for the conventional AC-DC-AC system which employs a two-step power conversion.
An Introduction to Software Engineering and Fault Tolerance
Venue: arXiv cs.SE 2010
Year: 2010

This book consists of the chapters describing novel approaches to integrating fault tolerance into software development process. They cover a wide range of topics focusing on fault tolerance during the different phases of the software development, software engineering techniques for verification and validation of fault tolerance means, and languages for supporting fault tolerance specification and implementation. Accordingly, the book is structured into the following three parts: Part A: Fault tolerance engineering: from requirements to code; Part B: Verification and validation of fault tolerant systems; Part C: Languages and Tools for engineering fault tolerant systems.