OpenRaiser/Intern-Atlas huggingface dataset:
A Flexible and Secure Deployment Framework for Distributed Applications
Venue: arXiv cs.DC 2010
Year: 2010

This paper describes an implemented system which is designed to support the deployment of applications offering distributed services, comprising a number of distributed components. This is achieved by creating high level placement and topology descriptions which drive tools that deploy applications consisting of components running on multiple hosts. The system addresses issues of heterogeneity by providing abstractions over host-specific attributes yielding a homogeneous run-time environment into which components may be deployed. The run-time environments provide secure binding mechanisms that permit deployed components to bind to stored data and services on the hosts on which they are running.
Stronger Enforcement of Security Using AOP and Spring AOP
Venue: arXiv cs.CR 2010
Year: 2010

An application security has two primary goals: first, it is intended to prevent unauthorised personnel from accessing information at higher classification than their authorisation. Second, it is intended to prevent personnel from declassifying information. Using an object oriented approach to implementing application security results not only with the problem of code scattering and code tangling, but also results in weaker enforcement of security. This weaker enforcement of security could be due to the inherent design of the system or due to a programming error. Aspect Oriented Programming (AOP) complements Object-Oriented Programming (OOP) by providing another way of thinking about program structure. The key unit of modularity in OOP is the class, whereas in AOP the unit of modularity is the aspect. The goal of the paper is to present that Aspect Oriented Programming AspectJ integrated with Spring AOP provides very powerful mechanisms for stronger enforcement of security.Aspect-oriented programming (AOP) allows weaving a security aspect into an application providing additional security functionality or introducing completely new security mechanisms.Implementation of security with AOP is a flexible method to develop separated, extensible and reusable pieces of code called aspects.In this comparative study paper, we argue that Spring AOP provides stronger enforcement of security than AspectJ.We have shown both Spring AOP and AspectJ strive to provide a comprehensive AOP solutions and complements each other.
Evolution of Biped Walking Using Neural Oscillators Controller and Harmony Search Algorithm Optimizer
Venue: arXiv cs.RO 2010
Year: 2010

In this paper, a simple Neural controller has been used to achieve stable walking in a NAO biped robot, with 22 degrees of freedom that implemented in a virtual physics-based simulation environment of Robocup soccer simulation environment. The algorithm uses a Matsuoka base neural oscillator to generate control signal for the biped robot. To find the best angular trajectory and optimize network parameters, a new population-based search algorithm, called the Harmony Search (HS) algorithm, has been used. The algorithm conceptualized a group of musicians together trying to search for better state of harmony. Simulation results demonstrate that the modification of the step period and the walking motion due to the sensory feedback signals improves the stability of the walking motion.
A New Energy Efficient Routing Algorithm Based on a New Cost Function in Wireless Ad hoc Networks
Venue: arXiv cs.NI 2010
Year: 2010

Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. In order to maximize the lifetime of ad hoc networks, traffic should be sent via a route that can be avoid nodes with low energy. In addition, considering that the nodes of ad hoc networks are mobile, it is possible that a created path is broken because of nodes mobility and establishment of a new path would be done again. This is because of sending additional control packets, accordingly, energy consumption increases. Also, it should avoid nodes which have more buffered packets. Maybe, because of long queue, some of these packets are dropped and transmitted again. This is the reason for wasting of energy. In this paper we propose a new energy efficient algorithm, that uses a new cost function and avoid nodes with characteristics which mentioned above. We show that this algorithm improves the network energy consumption by using this new cost function.
Compressive Direction Finding Based on Amplitude Comparison
Venue: arXiv cs.IT 2010
Year: 2010

This paper exploits recent developments in compressive sensing (CS) to efficiently perform the direction finding via amplitude comprarison. The new method is proposed based on unimodal characteristic of antenna pattern and sparse property of received data. Unlike the conventional methods based peak-searching and symmetric constraint, the sparse reconstruction algorithm requires less pulse and takes advantage of CS. Simulation results validate the performance of the proposed method is better than the conventional methods.
Architectural Support for Global Smart Spaces
Venue: arXiv cs.DC 2010
Year: 2010

A GLObal Smart Space (GLOSS) provides support for interaction amongst people, artefacts and places while taking account of both context and movement on a global scale. Crucial to the definition of a GLOSS is the provision of a set of location-aware services that detect, convey, store and exploit location information. We use one of these services, hearsay, to illustrate the implementation dimensions of a GLOSS. The focus of the paper is on both local and global software architecture to support the implementation of such services. The local architecture is based on XML pipe-lines and is used to construct location-aware components. The global architecture is based on a hybrid peer-to-peer routing scheme and provides the local architectures with the means to communicate in the global context.
Constructing Active Architectures in the ArchWare ADL
Venue: arXiv cs.SE 2010
Year: 2010

Software that cannot change is condemned to atrophy: it cannot accommodate the constant revision and re-negotiation of its business goals nor intercept the potential of new technology. To accommodate change in such systems we have defined an active software architecture to be: dynamic in that the structure and cardinality of the components and interactions are not statically known; updatable in that components can be replaced dynamically; and evolvable in that it permits its executing specification to be changed. Here we describe the facilities of the ArchWare architecture description language (ADL) for specifying active architectures. The contribution of the work is the unique combination of concepts including: a π-calculus based communication and expression language for specifying executable architectures; hyper-code as an underlying representation of system execution; a decomposition operator to break up and introspect on executing systems; and structural reflection for creating new components and binding them into running systems.
Optimal Degree Distributions for Uniform Small World Rings
Venue: arXiv cs.DC 2010
Year: 2010

Motivated by Kleinberg's (2000) and subsequent work, we consider the performance of greedy routing on a directed ring of $n$ nodes augmented with long-range contacts. In this model, each node $u$ is given an additional $D_u$ edges, a degree chosen from a specified probability distribution. Each such edge from $u$ is linked to a random node at distance $r$ ahead in the ring with probability proportional to $1/r$, a "harmonic" distance distribution of contacts. Aspnes et al. (2002) have shown an $O(\log^2 n / \ell)$ bound on the expected length of greedy routes in the case when each node is assigned exactly $\ell$ contacts and, as a consequence of recent work by Dietzfelbinger and Woelfel (2009), this bound is known to be tight. In this paper, we generalize Aspnes' upper bound to show that any degree distribution with mean $\ell$ and maximum value $O(\log n)$ has greedy routes of expected length $O(\log^2n / \ell)$, implying that any harmonic ring in this family is asymptotically optimal. Furthermore, for a more general family of rings, we show that a fixed degree distribution is optimal. More precisely, if each random contact is chosen at distance $r$ with a probability that decreases with $r$, then among degree distributions with mean $\ell$, greedy routing time is smallest when every node is assigned $\floor{\ell}$ or $\ceiling{\ell}$ contacts.
Simulating information creation in social Semantic Web applications
Venue: arXiv cs.CE 2010
Year: 2010

Appropriate ranking algorithms and incentive mechanisms are essential to the creation of high-quality information by users of a social network. However, evaluating such mechanisms in a quantifiable way is a difficult problem. Studies of live social networks of limited utility, due to the subjective nature of ranking and the lack of experimental control. Simulation provides a valuable alternative: insofar as the simulation resembles the live social network, fielding a new algorithm within a simulated network can predict the effect it will have on the live network. In this paper, we propose a simulation model based on the actor-conceptinstance model of semantic social networks, then we evaluate the model against a number of common ranking algorithms.We observe their effects on information creation in such a network, and we extend our results to the evaluation of generic ranking algorithms and incentive mechanisms.
Automatic Music Composition using Answer Set Programming
Venue: arXiv cs.LO 2010
Year: 2010

Music composition used to be a pen and paper activity. These these days music is often composed with the aid of computer software, even to the point where the computer compose parts of the score autonomously. The composition of most styles of music is governed by rules. We show that by approaching the automation, analysis and verification of composition as a knowledge representation task and formalising these rules in a suitable logical language, powerful and expressive intelligent composition tools can be easily built. This application paper describes the use of answer set programming to construct an automated system, named ANTON, that can compose melodic, harmonic and rhythmic music, diagnose errors in human compositions and serve as a computer-aided composition tool. The combination of harmonic, rhythmic and melodic composition in a single framework makes ANTON unique in the growing area of algorithmic composition. With near real-time composition, ANTON reaches the point where it can not only be used as a component in an interactive composition tool but also has the potential for live performances and concerts or automatically generated background music in a variety of applications. With the use of a fully declarative language and an "off-the-shelf" reasoning engine, ANTON provides the human composer a tool which is significantly simpler, more compact and more versatile than other existing systems. This paper has been accepted for publication in Theory and Practice of Logic Programming (TPLP).
A Game Theoretical Analysis of Localization Security in Wireless Sensor Networks with Adversaries
Venue: arXiv cs.GT 2010
Year: 2010

Wireless Sensor Networks (WSN) support data collection and distributed data processing by means of very small sensing devices that are easy to tamper and cloning: therefore classical security solutions based on access control and strong authentication are difficult to deploy. In this paper we look at the problem of assessing security of node localization. In particular, we analyze the scenario in which Verifiable Multilateration (VM) is used to localize nodes and a malicious node (i.e., the adversary) try to masquerade as non-malicious. We resort to non-cooperative game theory and we model this scenario as a two-player game. We analyze the optimal players' strategy and we show that the VM is indeed a proper mechanism to reduce fake positions.
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
Venue: arXiv cs.PF 2010
Year: 2010

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order to take advantage of the strengths of each technique for analyzing various components. But the time to analyze a state-based component modeled by TA may be prohibitively high, due to the state space explosion problem. In this paper, we propose a framework of granularity-based interfacing to speed up the analysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granularities and then based on RTC theory, we derive lower and upper bounds on arrival patterns of the fine output streams using the causality closure algorithm. Our framework can help to achieve tradeoffs between precision and analysis time.
Quantitative Fairness Games
Venue: arXiv cs.GT 2010
Year: 2010

We consider two-player games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequency-related properties: (i) all colors occur with the same asymptotic frequency, (ii) there is a constant that bounds the difference between the occurrences of any two colors for all prefixes of the path, or (iii) all colors occur with a fixed asymptotic frequency. These properties can be viewed as quantitative refinements of the classical notion of fair path in a concurrent system, whose simplest form checks whether all colors occur infinitely often. In particular, the first two properties enforce equal treatment of all the jobs involved in the system, while the third one represents a way to assign a given priority to each job. For all the above goals, we show that the problem of checking whether there exists a winning strategy is CoNP-complete.
Injecting Abstract Interpretations into Linear Cost Models
Venue: arXiv cs.LO 2010
Year: 2010

We present a semantics based framework for analysing the quantitative behaviour of programs with regard to resource usage. We start from an operational semantics equipped with costs. The dioid structure of the set of costs allows for defining the quantitative semantics as a linear operator. We then present an abstraction technique inspired from abstract interpretation in order to effectively compute global cost information from the program. Abstraction has to take two distinct notions of order into account: the order on costs and the order on states. We show that our abstraction technique provides a correct approximation of the concrete cost computations.
Data Partitioning for Parallel Entity Matching
Venue: arXiv cs.DC 2010
Year: 2010

Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matching in parallel on a distributed infrastructure. We propose different strategies to partition the input data and generate multiple match tasks that can be independently executed. One of our strategies supports both, blocking to reduce the search space for matching and parallel matching to improve efficiency. Special attention is given to the number and size of data partitions as they impact the overall communication overhead and memory requirements of individual match tasks. We have developed a service-based distributed infrastructure for the parallel execution of match workflows. We evaluate our approach in detail for different match strategies for matching real-world product data of different web shops. We also consider caching of in-put entities and affinity-based scheduling of match tasks.
Merging Two Arima Models for Energy Optimization in WSN
Venue: arXiv cs.NI 2010
Year: 2010

Use of ARIMA model in Sensor network The basic idea of our energy efficient information collection scheme is to suppress data transmission if the data sampled by sensor nodes are predictable by the sink node. This is done in two phases 1) Preliminary Data Collection- During this phase sink node collects enough data so that it can build up ARIMA model for each node. Then sink node selects a model for the particular node and sends back the corresponding model parameters to the node and also keeps them with it. Selecting the model for a node there is a tradeoff between energy consumption and accuracy of prediction. So we choose the model according to C = α xMAE + (1 - α) x rtran 0=< α =<1 where the model should minimize C. Here MAE is Mean Absolute Error which is normalized by some predefined error tolerance and rtran is the ratio of number of samples transmitted over total number of samples. 2) Adaptive Data Collection- After the sensor node has received the model parameters it checks each actual data value with the data value calculated from the parameters received. If there is deviation beyond some predefined error tolerance then only it sends the original data value to the sink node.
Working Document on Gloss Ontology
Venue: arXiv cs.DC 2010
Year: 2010

This document describes the Gloss Ontology. The ontology and associated class model are organised into several packages. Section 2 describes each package in detail, while Section 3 contains a summary of the whole ontology.
Construction and Applications of CRT Sequences
Venue: arXiv cs.IT 2010
Year: 2010

Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the protocol sequence. In order to minimize fluctuation of throughput due to delay offsets, we want to construct protocol sequences whose pairwise Hamming cross-correlation is as close to a constant as possible. In this paper, we present a construction of protocol sequences which is based on the bijective mapping between one-dimensional sequence and two-dimensional array by the Chinese Remainder Theorem (CRT). In the application to the collision channel without feedback, a worst-case lower bound on system throughput is derived.
RoboCast: Asynchronous Communication in Robot Networks
Venue: arXiv cs.DC 2010
Year: 2010

This paper introduces the \emph{RoboCast} communication abstraction. The RoboCast allows a swarm of non oblivious, anonymous robots that are only endowed with visibility sensors and do not share a common coordinate system, to asynchronously exchange information. We propose a generic framework that covers a large class of asynchronous communication algorithms and show how our framework can be used to implement fundamental building blocks in robot networks such as gathering or stigmergy. In more details, we propose a RoboCast algorithm that allows robots to broadcast their local coordinate systems to each others. Our algorithm is further refined with a local collision avoidance scheme. Then, using the RoboCast primitive, we propose algorithms for deterministic asynchronous gathering and binary information exchange.
Testing SDRT's Right Frontier
Venue: arXiv cs.CL 2010
Year: 2010

The Right Frontier Constraint (RFC), as a constraint on the attachment of new constituents to an existing discourse structure, has important implications for the interpretation of anaphoric elements in discourse and for Machine Learning (ML) approaches to learning discourse structures. In this paper we provide strong empirical support for SDRT's version of RFC. The analysis of about 100 doubly annotated documents by five different naive annotators shows that SDRT's RFC is respected about 95% of the time. The qualitative analysis of presumed violations that we have performed shows that they are either click-errors or structural misconceptions.
A possible intrinsic weakness of AES and other cryptosystems
Venue: arXiv cs.IT 2010
Year: 2010

It has been suggested that the algebraic structure of AES (and other similar block ciphers) could lead to a weakness exploitable in new attacks. In this paper, we use the algebraic structure of AES-like ciphers to construct a cipher embedding where the ciphers may lose their non-linearity. We show some examples and we discuss the limitations of our approach.
A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems
Venue: arXiv cs.FL 2010
Year: 2010

We present an extension of an algorithm for computing directly the denotation of a mu-calculus formula X over the configuration graph of a pushdown system to allow backwards modalities. Our method gives the first extension of the saturation technique to the full mu-calculus with backwards modalities.
An Information Flow Architecture for Global Smart Spaces
Venue: arXiv cs.DC 2010
Year: 2010

In this paper we describe an architecture which: Permits the deployment and execution of components in appropriate geographical locations. Provides security mechanisms that prevent misuse of the architecture. Supports a programming model that is familiar to application programmers. Permits installed components to share data. Permits the deployed components to communicate via communication channels. Provides evolution mechanisms permitting the dynamic rearrangement of inter-connection topologies the components that they connect. Supports the specification and deployment of distributed component deployments.
Second Set of Spaces
Venue: arXiv cs.DC 2010
Year: 2010

This document describes the Gloss infrastructure supporting implementation of location-aware services. The document is in two parts. The first part describes software architecture for the smart space. As described in D8, a local architecture provides a framework for constructing Gloss applications, termed assemblies, that run on individual physical nodes, whereas a global architecture defines an overlay network for linking individual assemblies. The second part outlines the hardware installation for local sensing. This describes the first phase of the installation in Strathclyde University.
FPGA Based Assembling of Facial Components for Human Face Construction
Venue: arXiv cs.CV 2010
Year: 2010

This paper aims at VLSI realization for generation of a new face from textual description. The FASY (FAce SYnthesis) System is a Face Database Retrieval and new Face generation System that is under development. One of its main features is the generation of the requested face when it is not found in the existing database. The new face generation system works in three steps - searching phase, assembling phase and tuning phase. In this paper the tuning phase using hardware description language and its implementation in a Field Programmable Gate Array (FPGA) device is presented.
Cloud Scheduler: a resource manager for distributed compute clouds
Venue: arXiv cs.DC 2010
Year: 2010

The availability of Infrastructure-as-a-Service (IaaS) computing clouds gives researchers access to a large set of new resources for running complex scientific applications. However, exploiting cloud resources for large numbers of jobs requires significant effort and expertise. In order to make it simple and transparent for researchers to deploy their applications, we have developed a virtual machine resource manager (Cloud Scheduler) for distributed compute clouds. Cloud Scheduler boots and manages the user-customized virtual machines in response to a user's job submission. We describe the motivation and design of the Cloud Scheduler and present results on its use on both science and commercial clouds.