Demonstration of Improved Passive UHF RFID Coverage using Optically-Fed Distributed Multi-Antenna System

Optically-fed distributed antenna system (DAS) technology is combined with passive ultra high frequency (UHF) radio frequency identification (RFID). It is shown that RFID signals can be carried on directly modulated radio over fiber links without impacting their performance. It is also shown that a multi-antenna DAS can greatly reduce the number of nulls experienced by RFID in a complex radio environment, increasing the likelihood of successful tag detection. Consequently, optimization of the DAS reduces nulls further. We demonstrate RFID tag reading using a three antenna DAS system over a 20mx6m area, limited by building constraints, where 100% of the test points can be successfully read. The detected signal strength from the tag is also observed to increase by an average of approximately 10dB compared with a conventional switched multi-antenna RFID system. This improvement is achieved at +31dBm equivalent isotropically radiated power (EIRP) from all three antenna units (AUs).

To Queue or Not to Queue: When Queueing is Better Than Timesharing in a Distributed System

We examine the question of whether to employ the first-come-first-served (FCFS) discipline or the processor-sharing (PS) discipline at the hosts in a distributed server system. We are interested in the case in which service times are drawn from a heavy-tailed distribution, and so have very high variability. Traditional wisdom when task sizes are highly variable would prefer the PS discipline, because it allows small tasks to avoid being delayed behind large tasks in a queue. However, we show that system performance can actually be significantly better under FCFS queueing, if each task is assigned to a host based on the task's size. By task assignment, we mean an algorithm that inspects incoming tasks and assigns them to hosts for service. The particular task assignment policy we propose is called SITA-E: Size Interval Task Assignment with Equal Load. Surprisingly, under SITA-E, FCFS queueing typically outperforms the PS discipline by a factor of about two, as measured by mean waiting time and mean slowdown (waiting time of task divided by its service time). We compare the FCFS/SITA-E policy to the processor-sharing case analytically; in addition we compare it to a number of other policies in simulation. We show that the benefits of SITA-E are present even in small-scale distributed systems (four or more hosts). Furthermore, SITA-E is a static policy that does not incorporate feedback knowledge of the state of the hosts, which allows for a simple and scalable implementation.

An online data access prediction and optimization approach for distributed systems

Current scientific applications have been producing large amounts of data. The processing, handling and analysis of such data require large-scale computing infrastructures such as clusters and grids. In this area, studies aim at improving the performance of data-intensive applications by optimizing data accesses. In order to achieve this goal, distributed storage systems have been considering techniques of data replication, migration, distribution, and access parallelism. However, the main drawback of those studies is that they do not take into account application behavior to perform data access optimization. This limitation motivated this paper which applies strategies to support the online prediction of application behavior in order to optimize data access operations on distributed systems, without requiring any information on past executions. In order to accomplish such a goal, this approach organizes application behaviors as time series and, then, analyzes and classifies those series according to their properties. By knowing properties, the approach selects modeling techniques to represent series and perform predictions, which are, later on, used to optimize data access operations. This new approach was implemented and evaluated using the OptorSim simulator, sponsored by the LHC-CERN project and widely employed by the scientific community. Experiments confirm this new approach reduces application execution time in about 50 percent, specially when handling large amounts of data.

Implementing distributed concurrent constraint execution in the CIAO system

This paper describes the current prototype of the distributed CIAO system. It introduces the concepts of "teams" and "active modules" (or active objects), which conveniently encapsulate different types of functionalities desirable from a distributed system, from parallelism for achieving speedup to client-server applications. The user primitives available are presented and their implementation described. This implementation uses attributed variables and, as an example of a communication abstraction, a blackboard that follows the Linda model. Finally, the CIAO WWW interface is also briefly described. The unctionalities of the system are illustrated through examples, using the implemented primitives.

Distributed concurrent constraint execution in the CIAO system

This paper describes the current prototype of the distributed CIAO system. It introduces the concepts of "teams" and "active modules" (or active objects), which conveniently encapsulate different types of functionalities desirable from a distributed system, from parallelism for achieving speedup to client-server applications. It presents the user primitives available and describes their implementation. This implementation uses attributed variables and, as an example of a communication abstraction, a blackboard that follows the Linda model. The functionalities of the system are illustrated through examples, using the implemented primitives. The implementation of most of the primitives is also described in detail.

A distributed systems approach to secure Internet mail

One of the obstacles to improved security of the Internet is ad hoc development of technologies with different design goals and different security goals. This paper proposes reconceptualizing the Internet as a secure distributed system, focusing specifically on the application layer. The notion is to redesign specific functionality, based on principles discovered in research on distributed systems in the decades since the initial development of the Internet. Because of the problems in retrofitting new technology across millions of clients and servers, any options with prospects of success must support backward compatibility. This paper outlines a possible new architecture for internet-based mail which would replace existing protocols by a more secure framework. To maintain backward compatibility, initial implementation could offer a web browser-based front end but the longer-term approach would be to implement the system using appropriate models of replication. (C) 2005 Elsevier Ltd. All rights reserved.

The Distributed System of Databases on Properties of Inorganic Substances and Materials

The principles of organization of the distributed system of databases on properties of inorganic substances and materials based on the use of a special reference database are considered. The last includes not only information on a site of the data about the certain substance in other databases but also brief information on the most widespread properties of inorganic substances. The proposed principles were successfully realized at the creation of the distributed system of databases on properties of inorganic compounds developed by A.A.Baikov Institute of Metallurgy and Materials Science of the Russian Academy of Sciences.

A visual system for distributed mosaics using an auvs fleet

The use of teams of Autonomous Underwater Vehicles for visual inspection tasks is a promising robotic field. The images captured by different robots can be also to aid in the localization/navigation of the fleet. In a previous work, a distributed localization system was presented based on the use of Augmented States Kalman Filter through the visual maps obtained by the fleet. In this context, this paper details a system for on-line construction of visual maps and its use to aid the localization and navigation of the robots. Different aspects related to the capture, treatment and construction of mosaics by fleets of robots are presented. The developed system can be executed on-line on different robotic platforms. The paper is concluded with a series of tests and analyses aiming at to system validation.

Distributed control of gait for a humanoid robot

This paper describes a walking gait for a humanoid robot with a distributed control system. The motion for the robot is calculated in real time on a central controller, and sent over CAN bus to the distributed control system. The distributed control system loosely follows the motion patterns from the central controller, while also acting to maintain stability and balance. There is no global feedback control system; the system maintains its balance by the interaction between central gait and soft control of the actuators. The paper illustrates a straight line walking gait and shows the interaction between gait generation and the control system. The analysis of the data shows that successful walking can be achieved without maintaining strict local joint control, and without explicit global balance coordination.

Development of distributed fuzzy systems with a runtime-adaptable mobile components framework

A distributed fuzzy system is a real-time fuzzy system in which the input, output and computation may be located on different networked computing nodes. The ability for a distributed software application, such as a distributed fuzzy system, to adapt to changes in the computing network at runtime can provide real-time performance improvement and fault-tolerance. This paper introduces an Adaptable Mobile Component Framework (AMCF) that provides a distributed dataflow-based platform with a fine-grained level of runtime reconfigurability. The execution location of small fragments (possibly as little as few machine-code instructions) of an AMCF application can be moved between different computing nodes at runtime. A case study is included that demonstrates the applicability of the AMCF to a distributed fuzzy system scenario involving multiple physical agents (such as autonomous robots). Using the AMCF, fuzzy systems can now be developed such that they can be distributed automatically across multiple computing nodes and are adaptable to runtime changes in the networked computing environment. This provides the opportunity to improve the performance of fuzzy systems deployed in scenarios where the computing environment is resource-constrained and volatile, such as multiple autonomous robots, smart environments and sensor networks.

A series-connected photovoltaic distributed generator capable of enhancing power quality

Design of a series-connected photovoltaic generator (SPVG) capable of enhancing power quality is investigated. Analysis of the SPVG operations under disturbance conditions shows explicitly how achievable network voltage quality is affected by the SPVG injected power and its apparent power rating, and that voltage quality can be significantly improved even with a modest level of energy storage capacity incorporated in the SPVG. A control system for the SPVG is also proposed. Both simulation and laboratory tests confirm the efficacy of the distributed generator system.

Cellular Membranes as a Playground for Semliki Forest Virus Replication Complex

All positive-strand RNA viruses utilize cellular membranes for the assembly of their replication complexes, which results in extensive membrane modification in infected host cells. These alterations act as structural and functional scaffolds for RNA replication, providing protection for the viral double-stranded RNA against host defences. It is known that different positive-strand RNA viruses alter different cellular membranes. However, the origin of the targeted membranes, the mechanisms that direct replication proteins to specific membranes and the steps in the formation of the membrane bound replication complex are not completely understood. Alphaviruses (including Semliki Forest virus, SFV), members of family Togaviridae, replicate their RNA in association with membranes derived from the endosomal and lysosomal compartment, inducing membrane invaginations called spherules. Spherule structures have been shown to be the specific sites for RNA synthesis. Four replication proteins, nsP1-nsP4, are translated as a polyprotein (P1234) which is processed autocatalytically and gives rise to a membrane-bound replication complex. Membrane binding is mediated via nsP1 which possesses an amphipathic α-helix (binding peptide) in the central region of the protein. The aim of this thesis was to characterize the association of the SFV replication complex with cellular membranes and the modification of the membranes during virus infection. Therefore, it was necessary to set up the system for determining which viral components are needed for inducing the spherules. In addition, the targeting of the replication complex, the formation site of the spherules and their intracellular trafficking were studied in detail. The results of current work demonstrate that mutations in the binding peptide region of nsP1 are lethal for virus replication and change the localization of the polyprotein precursor P123. The replication complex is first targeted to the plasma membrane where membrane invaginations, spherules, are induced. Using a specific regulated endocytosis event the spherules are internalized from the plasma membrane in neutral carrier vesicles and transported via an actin-and microtubule-dependent manner to the pericentriolar area. Homotypic fusions and fusions with pre-existing acidic organelles lead to the maturation of previously described cytopathic vacuoles with hundreds of spherules on their limiting membranes. This work provides new insights into the membrane binding mechanism of SFV replication complex and its role in the virus life cycle. Development of plasmid-driven system for studying the formation of the replication complex described in this thesis allows various applications to address different steps in SFV life cycle and virus-host interactions in the future. This trans-replication system could be applied for many different viruses. In addition, the current work brings up new aspects of membranes and cellular components involved in SFV replication leading to further understanding in the formation and dynamics of the membrane-associated replication complex.

Specification-driven approach for protocol design of distributed computing systems

An important issue in the design of a distributed computing system (DCS) is the development of a suitable protocol. This paper presents an effort to systematize the protocol design procedure for a DCS. Protocol design and development can be divided into six phases: specification of the DCS, specification of protocol requirements, protocol design, specification and validation of the designed protocol, performance evaluation, and hardware/software implementation. This paper describes techniques for the second and third phases, while the first phase has been considered by the authors in their earlier work. Matrix and set theoretic based approaches are used for specification of a DCS and for specification of the protocol requirements. These two formal specification techniques form the basis of the development of a simple and straightforward procedure for the design of the protocol. The applicability of the above design procedure has been illustrated by considering an example of a computing system encountered on board a spacecraft. A Petri-net based approach has been adopted to model the protocol. The methodology developed in this paper can be used in other DCS applications.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

A tool for assessing reconfigurability of distributed manufacturing systems

In recent years, a large number of approaches to developing distributed manufacturing systems has been proposed. One of the principles reasons for these development has been to enhance the reconfigurability of a manufacturing operation; allowing it to readily adapt to changes over time. However, to date, there has only been a limited assessment of the resulting reconfigurability properties and hence it remains inconclusive as to whether a distributed manufacturing system design approach does in fact improve reconfigurability. This paper represents part of a study which investigates this issue. It proposes an assessment tool - the so called "Design Structure Matrix" as a means of assessing the modularity of elements in a manufacturing system. (Modularity has been shown to be a key characteristic of a reconfigurable manufacturing system.) The use of the Design Structure Matrix is illustrated in assessing a robot assembly cell designed on distributed manufacturing system principles. Copyright © 2006 IFAC.