OpenRaiser/Intern-Atlas huggingface dataset:
A Novel Technique for Secret Message / Image Transmission through (2, 2)Visual Cryptographic Protocol (SMITVCP)
Venue: arXiv cs.CR 2012
Year: 2012

In this paper a secret message/image transmission technique has been proposed through (2, 2) visual cryptographic share which is non-interpretable in general. A binary image is taken as cover image and authenticating message/image has been fabricated into it through a hash function where two bits in each pixel within four bits from LSB of the pixel is embedded and as a result it converts the binary image to gray scale one. (2,2) visual cryptographic shares are generated from this converted gray scale image. During decoding shares are combined to regenerate the authenticated image from where the secret message/image is obtained through the same hash function along with reduction of noise. Noise reduction is also done on regenerated authenticated image to regenerate original cover image at destination.
Towards Design and Implementation of Space Efficient and Secured Transmission scheme on EGovernance data
Venue: arXiv cs.CR 2012
Year: 2012

We know that large amount of data and information should be transmitted through internet during transactions in E-Governance. Smart E-Governance system should deliver speedy, space efficient, cost effective and secure services among other governments and its citizens utilizing benefits of Information and Communication Technologies (ICT). This paper proposes to develop a space efficient and secured data transmission scheme using Modified Huffman algorithm for compression, which will also yield better bandwidth utilization and inner encryption technique with one way hash function SHA (Secured Hash Algorithm) to ensure Message integrity.
Self-Stabilizing Balancing Algorithm for Containment-Based Trees
Venue: arXiv cs.DC 2012
Year: 2012

Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subscribe systems both in centralized and distributed contexts. In addition to their versatility, their balanced shape ensures an overall satisfactory performance. Re- cently, it has been shown that their distributed implementations can be fault-resilient. However, this robustness is achieved at the cost of un-balancing the structure. While the structure remains correct in terms of searchability, its performance can be significantly decreased. In this paper, we propose a distributed self-stabilizing algorithm to balance containment-based trees.
Organic Memristor Devices for Logic Elements with Memory
Venue: arXiv cs.ET 2012
Year: 2012

Memristors are promising next-generation memory candidates that are nonvolatile, possess low power requirements and are capable of nanoscale fabrication. In this article we physically realise and describe the use of organic memristors in designing statefull boolean logic gates for the AND OR and NOT operations. The output of these gates is analog and dependent on the length of time that suitable charge is applied to the inputs, displaying a learning property. Results may be also interpreted in a traditional binary manner through use of a suitable thresholding function at the output. The memristive property of the gate allows the for the production of analog outputs that vary based on the charge-dependent nonvolatile state of the memristor. We provide experimental results of physical fabrication of three types of logic gate. A simulation of a one-bit full adder comprised of memristive logic gates is also included, displaying varying response to two distinct input patterns.
Adaptive Scheduling in Real-Time Systems Through Period Adjustment
Venue: arXiv cs.OS 2012
Year: 2012

Real time system technology traditionally developed for safety critical systems, has now been extended to support multimedia systems and virtual reality. A large number of real-time application, related to multimedia and adaptive control system, require more flexibility than classical real-time theory usually permits. This paper proposes an efficient adaptive scheduling framework in real-time systems based on period adjustment. Under this model periodic task can change their execution rates based on their importance value to keep the system underloaded. We propose Period_Adjust algorithm, which consider the tasks whose periods are bounded as well as the tasks whose periods are not bounded.
The network structure of mathematical knowledge according to the Wikipedia, MathWorld, and DLMF online libraries
Venue: arXiv cs.SI 2012
Year: 2012

We study the network structure of Wikipedia (restricted to its mathematical portion), MathWorld, and DLMF. We approach these three online mathematical libraries from the perspective of several global and local network-theoretic features, providing for each one the appropriate value or distribution, along with comparisons that, if possible, also include the whole of the Wikipedia or the Web. We identify some distinguishing characteristics of all three libraries, most of them supposedly traceable to the libraries' shared nature of relating to a very specialized domain. Among these characteristics are the presence of a very large strongly connected component in each of the corresponding directed graphs, the complete absence of any clear power laws describing the distribution of local features, and the rise to prominence of some local features (e.g., stress centrality) that can be used to effectively search for keywords in the libraries.
Brain Connectivity Analysis Methods for Better Understanding of Coupling
Venue: arXiv cs.OH 2012
Year: 2012

Action, cognition, emotion and perception can be mapped in the brain by using set of techniques. Translating unimodal concepts from one modality to another is an important step towards understanding the neural mechanisms. This paper provides a comprehensive survey of multimodal analysis of brain signals such as fMRI, EEG, MEG, NIRS and motivations, assumptions and pitfalls associated with it. All these non-invasive brain modalities complement and restrain each other and hence improve our understating of functional and neuronal organization. By combining the various modalities together, we can exploit the strengths and flaws of individual brain imaging methods. Integrated anatomical analysis and functional measurements of human brain offer a powerful paradigm for the brain mapping. Here we provide the brief review on non invasive brain modalities, describe the future of co-analysis of these brain signals.
Towards Approximate Model Checking DC and PDC Specifications
Venue: arXiv cs.LO 2012
Year: 2012

DC has proved to be a promising tool for the specification and verification of functional requirements on the design of hard real-time systems. Many works were devoted to develop effective techniques for checking the models of hard real-time systems against DC specifications. DC model checking theory is still evolving and yet there is no available tools supporting practical verifications due to the high undecidability of calculus and the great complexity of model checking. Present situation of PDC model checking is much worse than the one of DC model checking. In view of the results so far achieved, it is desirable to develop approximate model checking techniques for DC and PDC specifications. This work was motivated to develop approximate techniques checking automata models of hard real-time systems for DC and PDC specifications. Unlike previous works which only deal with decidable formulas, we want to develop approximate techniques covering whole DC and PDC formulas. The first results of our work, namely, approximate techniques checking real-time automata models of systems for LDI and PLDI specifications, are described in this paper.
Belief Propagation for Continuous State Spaces: Stochastic Message-Passing with Quantitative Guarantees
Venue: arXiv cs.IT 2012
Year: 2012

The sum-product or belief propagation (BP) algorithm is a widely used message-passing technique for computing approximate marginals in graphical models. We introduce a new technique, called stochastic orthogonal series message-passing (SOSMP), for computing the BP fixed point in models with continuous random variables. It is based on a deterministic approximation of the messages via orthogonal series expansion, and a stochastic approximation via Monte Carlo estimates of the integral updates of the basis coefficients. We prove that the SOSMP iterates converge to a δ-neighborhood of the unique BP fixed point for any tree-structured graph, and for any graphs with cycles in which the BP updates satisfy a contractivity condition. In addition, we demonstrate how to choose the number of basis coefficients as a function of the desired approximation accuracy δand smoothness of the compatibility functions. We illustrate our theory with both simulated examples and in application to optical flow estimation.
Towards a Theory of Glue
Venue: arXiv cs.LO 2012
Year: 2012

We propose and study the notions of behaviour type and composition operator making a first step towards the definition of a formal framework for studying behaviour composition in a setting sufficiently general to provide insight into how the component-based systems should be modelled and compared. We illustrate the proposed notions on classical examples (Traces, Labelled Transition Systems and Coalgebras). Finally, the definition of memoryless glue operators, takes us one step closer to a formal understanding of the separation of concerns principle stipulating that computational aspects of a system should be localised within its atomic components, whereas coordination layer responsible for managing concurrency should be realised by memoryless glue operators.
Interacting via the Heap in the Presence of Recursion
Venue: arXiv cs.PL 2012
Year: 2012

Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call stack using local variables, or, anonymously, on the heap using reference fields. As such a static analysis is, in general, undecidable. In this paper we study the verification of recursive programs with unbounded allocation of objects, in a simple imperative language for heap manipulation. We present an improved semantics for this language, using an abstraction that is precise. For any program with a bounded visible heap, meaning that the number of objects reachable from variables at any point of execution is bounded, this abstraction is a finitary representation of its behaviour, even though an unbounded number of objects can appear in the state. As a consequence, for such programs model checking is decidable. Finally we introduce a specification language for temporal properties of the heap, and discuss model checking these properties against heap-manipulating programs.
Full-Rate, Full-Diversity, Finite Feedback Space-Time Schemes with Minimum Feedback and Transmission Duration
Venue: arXiv cs.IT 2012
Year: 2012

In this paper a MIMO quasi static block fading channel with finite N-ary delay-free, noise-free feedback is considered. The transmitter uses a set of N Space-Time Block Codes (STBCs), one corresponding to each of the N possible feedback values, to encode and transmit information. The feedback function used at the receiver and the N component STBCs used at the transmitter together constitute a Finite Feedback Scheme (FFS). Although a number of FFSs are available in the literature that provably achieve full-diversity, there is no known universal criterion to determine whether a given arbitrary FFS achieves full-diversity or not. Further, all known full-diversity FFSs for T<N_t where N_t is the number of transmit antennas, have rate at the most 1. In this paper a universal necessary condition for any FFS to achieve full-diversity is given, using which the notion of Feedback-Transmission duration optimal (FT-Optimal) FFSs - schemes that use minimum amount of feedback N given the transmission duration T, and minimum transmission duration given the amount of feedback to achieve full-diversity - is introduced. When there is no feedback (N=1) an FT-optimal scheme consists of a single STBC with T=N_t, and the universal necessary condition reduces to the well known necessary and sufficient condition for an STBC to achieve full-diversity: every non-zero codeword difference matrix of the STBC must be of rank N_t. Also, a sufficient condition for full-diversity is given for the FFSs in which the component STBC with the largest minimum Euclidean distance is chosen. Using this sufficient condition full-rate (rate N_t) full-diversity FT-Optimal schemes are constructed for all (N_t,T,N) with NT=N_t. These are the first full-rate full-diversity FFSs reported in the literature for T<N_t. Simulation results show that the new schemes have the best error performance among all known FFSs.
Increasing Air Traffic: What is the Problem?
Venue: arXiv cs.AI 2012
Year: 2012

Nowadays, huge efforts are made to modernize the air traffic management systems to cope with uncertainty, complexity and sub-optimality. An answer is to enhance the information sharing between the stakeholders. This paper introduces a framework that bridges the gap between air traffic management and air traffic control on the one hand, and bridges the gap between the ground, the approach and the en-route centers on the other hand. An original system is presented, that has three essential components: the trajectory models, the optimization process, and the monitoring process. The uncertainty of the trajectory is modeled with a Bayesian Network, where the nodes are associated to two types of random variables: the time of overflight on metering points of the airspace, and the traveling time of the routes linking these points. The resulting Bayesian Network covers the complete airspace, and Monte- Carlo simulations are done to estimate the probabilities of sector congestion and delays. On top of this trajectory model, an optimization process minimizes these probabilities by tuning the parameters of the Bayesian trajectory model related to overflight times on metering points. The last component is the monitoring process, that continuously updates the situation of the airspace, modifying the trajectories uncertainties according to actual positions of aircraft. After each update, a new optimal set of overflight times is computed, and can be communicated to the controllers as clearances for the aircraft pilots. The paper presents a formal specification of this global optimization problem, whose underlying rationale was derived with the help of air traffic controllers at Thales Air Systems.
TSEP: Threshold-sensitive Stable Election Protocol for WSNs
Venue: arXiv cs.NI 2012
Year: 2012

Wireless Sensor Networks (WSNs) are expected to find wide applicability and increasing deployment in near future. In this paper, we propose a new protocol, Threshold Sensitive Stable Election Protocol (TSEP), which is reactive protocol using three levels of heterogeneity. Reactive networks, as opposed to proactive networks, respond immediately to changes in relevant parameters of interest. We evaluate performance of our protocol for a simple temperature sensing application and compare results of protocol with some other protocols LEACH, DEEC, SEP, ESEP and TEEN. And from simulation results it is observed that protocol outperforms concerning life time of sensing nodes used.
Energy Efficient Sleep Awake Aware (EESAA) Intelligent Sensor Network Routing Protocol
Venue: arXiv cs.NI 2012
Year: 2012

Wireless Sensor Networks (WSNs), with growing applications in the environment which are not within human reach have been addressed tremendously in the recent past. For optimized working of network many routing algorithms have been proposed, mainly focusing energy efficiency, network lifetime, clustering processes. Considering homogeneity of network, we proposed Energy Efficient Sleep Awake Aware (EESAA) intelligent routing protocol for WSNs. In our proposed technique we evaluate and enhance certain issues like network stability, network lifetime and cluster head selection process. Utilizing the concept of characteristical pairing among sensor nodes energy utilization is optimized. Simulation results show that our proposed protocolnificantly improved the
A Dynamic-Epistemic Logic for Mobile Structured Agents
Venue: arXiv cs.LO 2012
Year: 2012

Multi-agent systems have been studied in various contexts of both application and theory. We take Dynamic Epistemic Logic (DEL), one of the formalisms designed to reason about such systems, as the foundation of the language we will build. BioAmbient calculus is an extension of π-calculus, developed largely for applications to biomolecular systems. It deals with ambients and their ability to communicate and to execute concurrent processes while moving. In this paper we combine the formalism of Dynamic Epistemic Logic together with the formalism of BioAmbient Calculus in order to reason about knowledge maintained and gained upon process transitions. The motivation lies in developing a language that captures locally available information through assignment of knowledge, with potential application to biological systems as well as social, virtual, and others. We replace the ambients of BioAmbient Calculus with agents, to which we attribute knowledge, and explore the parallels of this treatment. The resulting logic describes the information flow governing mobile structured agents, organized hierarchically, whose architecture (and local information) may change due to actions such as communication, merging (of two agents), entering (of an agent into the inner structure of another agent) and exiting (of an agent from the structure of another). We show how the main axioms of DEL must be altered to accommodate the informational effects of the agents' dynamic architecture.
RF Propagation Analysis of MICAz Motes Antenna with Ground Effect
Venue: arXiv cs.NI 2012
Year: 2012

In this paper we analyzed the Radio Frequency (RF) propagation characteristics of monopole antenna in MICAz mote. During the experimental analysis, two scenarios are considered. In Scenario-I, a pair of MICAz nodes (one transmitting and one receiving node) are placed on the ground and the RSSI is measured in presence of the ground effect. In Scenario-II, only the transmitting node is placed above the ground; however, the receiving node is placed on the ground. The RSSI is measured by changing the antenna orientation at different angles and distances between them. The results show that the ground effect, antenna orientation and distance between the sensor nodes drastically affect the RSSI.
Opportunistic Relaying in Wireless Body Area Networks: Coexistence Performance
Venue: arXiv cs.NI 2012
Year: 2012

In this paper, a cooperative two-hop communication scheme, together with opportunistic relaying (OR), is applied within a mobile wireless body area network (WBAN). Its effectiveness in interference mitigation is investigated in a scenario where there are multiple closely-located networks. Due to a typical WBAN's nature, no coordination is used among different WBANs. A suitable time-division-multiple-access (TDMA) is adopted as both an intra-network and also an inter-network access scheme. Extensive on-body and off-body channel gain measurements are employed to gauge performance, which are overlaid to simulate a realistic WBAN working environment. It is found that opportunistic relaying is able to improve the signal-to-interference-and-noise ratio (SINR) threshold value at outage probability of 10% by an average of 5 dB, and it is also shown that it can reduce level crossing rate (LCR) significantly at a low SINR threshold value. Furthermore, this scheme is more efficient when on-body channels fade less slowly.
Perceptually Motivated Shape Context Which Uses Shape Interiors
Venue: arXiv cs.CV 2012
Year: 2012

In this paper, we identify some of the limitations of current-day shape matching techniques. We provide examples of how contour-based shape matching techniques cannot provide a good match for certain visually similar shapes. To overcome this limitation, we propose a perceptually motivated variant of the well-known shape context descriptor. We identify that the interior properties of the shape play an important role in object recognition and develop a descriptor that captures these interior properties. We show that our method can easily be augmented with any other shape matching algorithm. We also show from our experiments that the use of our descriptor can significantly improve the retrieval rates.
Exponential error bounds on parameter modulation-estimation for discrete memoryless channels
Venue: arXiv cs.IT 2012
Year: 2012

We consider the problem of modulation and estimation of a random parameter $U$ to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the estimation error, $\bE|\hat{U}-U|^ρ$, $ρ\ge 0$, when both the modulator and the estimator are subjected to optimization. These exponential error bounds turn out to be intimately related to error exponents of channel coding and to channel capacity. While in general, there is some gap between the upper and the lower bound, they asymptotically coincide both for very small and for very large values of the moment power $ρ$. This means that our achievability scheme, which is based on simple quantization of $U$ followed by channel coding, is nearly optimum in both limits. Some additional properties of the bounds are discussed and demonstrated, and finally, an extension to the case of a multidimensional parameter vector is outlined, with the principal conclusion that our upper and lower bound asymptotically coincide also for a high dimensionality.
Resource management on a VM based computer cluster for scientific computing
Venue: arXiv cs.DC 2012
Year: 2012

In the last ten years host virtualization has brought a revolution in the way almost every activity related to information technology is thought of and performed. The use of virtualization for HPC and HTC computing, while eagerly desired, has probably been one of the last steps of this revolution, the performance loss due to the hardware abstraction layer being the cause that slowed down a process that has been much faster in other fields. Nowadays the widespread diffusion of virtualization and of new virtualization techniques seem to have helped breaking this last barrier and virtual host computing infrastructures for HPC and HTC are found in many data centers. In this document the approach adopted at the INFN "Laboratori Nazionali del Gran Sasso" for providing computational resources via a virtual host based computing facility is described. Particular evidence is given to the storage layout, to the middleware architecture and to resource allocation strategies, as these are issues for which a personalized solution was adopted. Other aspects may be covered in the future within other documents.
Simple Search Engine Model: Adaptive Properties for Doubleton
Venue: arXiv cs.IR 2012
Year: 2012

In this paper we study the relationship between query and search engine by exploring the adaptive properties for doubleton as a space of event based on a simple search engine. We employ set theory for defining doubleton and generate some properties.