RADIC II: a fault tolerant architecture with flexible dynamic redundancy

The demand for computational power has been leading the improvement of the High Performance Computing (HPC) area, generally represented by the use of distributed systems like clusters of computers running parallel applications. In this area, fault tolerance plays an important role in order to provide high availability isolating the application from the faults effects. Performance and availability form an undissociable binomial for some kind of applications. Therefore, the fault tolerant solutions must take into consideration these two constraints when it has been designed. In this dissertation, we present a few side-effects that some fault tolerant solutions may presents when recovering a failed process. These effects may causes degradation of the system, affecting mainly the overall performance and availability. We introduce RADIC-II, a fault tolerant architecture for message passing based on RADIC (Redundant Array of Distributed Independent Fault Tolerance Controllers) architecture. RADIC-II keeps as maximum as possible the RADIC features of transparency, decentralization, flexibility and scalability, incorporating a flexible dynamic redundancy feature, allowing to mitigate or to avoid some recovery side-effects.

System analysis of a Peer-to-Peer Video-on-Demand architecture: Kangaroo

Architectural design and deployment of Peer-to-Peer Video-on-Demand (P2PVoD) systems which support VCR functionalities is attracting the interest of an increasing number of research groups within the scientific community; especially due to the intrinsic characteristics of such systems and the benefits that peers could provide at reducing the server load. This work focuses on the performance analysis of a P2P-VoD system considering user behaviors obtained from real traces together with other synthetic user patterns. The experiments performed show that it is feasible to achieve a performance close to the best possible. Future work will consider monitoring the physical characteristics of the network in order to improve the design of different aspects of a VoD system.

New evidence of the real interest rate parity for OECD countries using panel unit root tests with breaks

This paper tests for real interest parity (RIRP) among the nineteen major OECD countries over the period 1978:Q2-1998:Q4. The econometric methods applied consist of combining the use of several unit root or stationarity tests designed for panels valid under cross-section dependence and presence of multiple structural breaks. Our results strongly support the fulfillment of the weak version of the RIRP for the studied period once dependence and structural breaks are accounted for.

Positive solutions of nonlinear problems involving the square root of the Laplacian

We consider nonlinear elliptic problems involving a nonlocal operator: the square root of the Laplacian in a bounded domain with zero Dirichlet boundary conditions. For positive solutions to problems with power nonlinearities, we establish existence and regularity results, as well as a priori estimates of Gidas-Spruck type. In addition, among other results, we prove a symmetry theorem of Gidas-Ni-Nirenberg type.

The Brezis-Nirenberg type problem involving the square root of the Laplacian

We establish existence and non-existence results to the Brezis-Nirenberg type problem involving the square root of the Laplacian in a bounded domain with zero Dirichlet boundary condition.

Is real GDP stationary? Evidence from a panel unit root test with cross-sectional dependence and historical data

We use historical data that cover more than one century on real GDP for industrial countries and employ the Pesaran panel unit root test that allows for cross-sectional dependence to test for a unit root on real GDP. We find strong evidence against the unit root null. Our results are robust to the chosen group of countries and the sample period. Key words: real GDP stationarity, cross-sectional dependence, CIPS test. JEL Classification: C23, E32

VLSI architecture for an Underwater Robot Vision System

It is well known that image processing requires a huge amount of computation, mainly at low level processing where the algorithms are dealing with a great number of data-pixel. One of the solutions to estimate motions involves detection of the correspondences between two images. For normalised correlation criteria, previous experiments shown that the result is not altered in presence of nonuniform illumination. Usually, hardware for motion estimation has been limited to simple correlation criteria. The main goal of this paper is to propose a VLSI architecture for motion estimation using a matching criteria more complex than Sum of Absolute Differences (SAD) criteria. Today hardware devices provide many facilities for the integration of more and more complex designs as well as the possibility to easily communicate with general purpose processors

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

On AUV control architecture

This paper surveys control architectures proposed in the literature and describes a control architecture that is being developed for a semi-autonomous underwater vehicle for intervention missions (SAUVIM) at the University of Hawaii. Conceived as hybrid, this architecture has been organized in three layers: planning, control and execution. The mission is planned with a sequence of subgoals. Each subgoal has a related task supervisor responsible for arranging a set of pre-programmed task modules in order to achieve the subgoal. Task modules are the key concept of the architecture. They are the main building blocks and can be dynamically re-arranged by the task supervisor. In our architecture, deliberation takes place at the planning layer while reaction is dealt through the parallel execution of the task modules. Hence, the system presents both a hierarchical and an heterarchical decomposition, being able to show a predictable response while keeping rapid reactivity to the dynamic environment

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

Dos cuestiones pendientes de la sintaxis de los pronombres átonos: enclisis como fenómeno asociado a las oraciones matrices y doble clítico en las construcciones perifrásticas = The Remainders of the Syntax of Clitics: Enclisis as a Root Phenomenon, and Clitic Doubling in Periphrastic Constructions

Conferència centrada en dos aspectes concrets de la sintaxi dels pronoms àtons: l' enclisis que es dona en algunes oracions subordinades de les variants iberromàniques modernes de l'oest peninsular i les configuracions de doble cíclic en les construccions perifràstiques

Seasonal changes of whole root system conductance by a drought-tolerant grape root system

The role of root systems in drought tolerance is a subject of very limited information compared with above-ground responses. Adjustments to the ability of roots to supply water relative to shoot transpiration demand is proposed as a major means for woody perennial plants to tolerate drought, and is often expressed as changes in the ratios of leaf to root area (AL:AR). Seasonal root proliferation in a directed manner could increase the water supply function of roots independent of total root area (AR) and represents a mechanism whereby water supply to demand could be increased. To address this issue, seasonal root proliferation, stomatal conductance (gs) and whole root system hydraulic conductance (kr) were investigated for a drought-tolerant grape root system (Vitis berlandieri×V. rupestris cv. 1103P) and a non-drought-tolerant root system (Vitis riparia×V. rupestris cv. 101-14Mgt), upon which had been grafted the same drought-sensitive clone of Vitis vinifera cv. Merlot. Leaf water potentials (ψL) for Merlot grafted onto the 1103P root system (–0.91±0.02 MPa) were +0.15 MPa higher than Merlot on 101-14Mgt (–1.06±0.03 MPa) during spring, but dropped by approximately –0.4 MPa from spring to autumn, and were significantly lower by –0.15 MPa (–1.43±0.02 MPa) than for Merlot on 101-14Mgt (at –1.28±0.02 MPa). Surprisingly, gs of Merlot on the drought-tolerant root system (1103P) was less down-regulated and canopies maintained evaporative fluxes ranging from 35–20 mmol vine−1 s−1 during the diurnal peak from spring to autumn, respectively, three times greater than those measured for Merlot on the drought-sensitive rootstock 101-14Mgt. The drought-tolerant root system grew more roots at depth during the warm summer dry period, and the whole root system conductance (kr) increased from 0.004 to 0.009 kg MPa−1 s−1 during that same time period. The changes in kr could not be explained by xylem anatomy or conductivity changes of individual root segments. Thus, the manner in which drought tolerance was conveyed to the drought-sensitive clone appeared to arise from deep root proliferation during the hottest and driest part of the season, rather than through changes in xylem structure, xylem density or stomatal regulation. This information can be useful to growers on a site-specific basis in selecting rootstocks for grape clonal material (scions) grafted to them.

On iterative performance of LDPC and Root-LDPC codes over block-fading channels

This paper presents our investigation on iterativedecoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes.Also, we show analytically that, in the case of 2 fading blocks,the iterative threshold root of Root-LDPC codes is proportional to (α1 α2)1, where α1 and α2 are corresponding fading gains.From this result, the full diversity property of Root-LDPC codes immediately follows.

Towards a user-friendly webservice architecture for statistical machine translation in the PANACEA project

This paper presents a webservice architecture for Statistical Machine Translation aimed at non-technical users. A workfloweditor allows a user to combine different webservices using a graphical user interface. In the current state of this project,the webservices have been implemented for a range of sentential and sub-sententialaligners. The advantage of a common interface and a common data format allows the user to build workflows exchanging different aligners.