Xarxes tolerants a endarreriments i interrupcions: desenvolupament d'un scheduler d'agents mòbils

En aquest projecte es proposa i s’implementa una nova forma de crear xarxes DTN (Delay-Tolerant Networks) mitjançant agents mòbils. Aquestes xarxes tenen la peculiaritat de ser tolerants a endarreriments i interrupcions, podent ser utilitzades en entorns on les xarxes actuals no es poden aplicar. Hem dissenyat mecanismes que permeten prendre decisions d’encaminament a nivell d’aplicació i mecanismes de priorització d’agents mitjançant informació d’alt nivell. Aquests mecanismes milloren les DTN fent-les més flexibles i efectives.

Information Mobility: Information Dissemination in Mobile Networks

En el nostre projecte, considerem un escenari urbà o interurbà on persones amb dispositius mòbils (smartphones) o vehicles equipats amb interfícies de comunicació, estan interessats en compartir fitxers entre ells o descarregar-los al creuar Punts d’Accés (APs) propers a la carretera. Estudiem la possibilitat d’utilizar la cooperació en les trobades casuals entre nodes per augmentar la velocitat de descàrrega global. Amb aquest objectiu, plantejem algoritmes per a la selecció de quins paquets, per a quins destins i quins transportistes s’escullen en cada moment. Mitjançant extenses simulacions, mostrem com les cooperacions carry&forward dels nodes augmenten significativament la velocitat de descàrrega dels usuaris, i com aquest resultat es manté per a diversos patrons de mobilitat, col•locacions d'AP i càrregues de la xarxa. Per altra banda, aparells com els smartphones, on la targeta de WiFi està encesa contínuament, consumeixen l'energia de la bateria en poques hores. En molts escenaris, una targeta WiFi sempre activa és poc útil, perque sovint no hi ha necessitat de transmissió o recepció. Aquest fet es veu agreujat en les Delay Tolerant Networks (DTN), on els nodes intercanvien dades quan es creuen i en tenen l’oportunitat. Les tècniques de gestió de l’estalvi d’energia permeten extendre la duració de les bateries. El nostre projecte analitza els avantatges i inconvenients que apareixen quan els nodes apaguen períodicament la seva targeta wireless per a estalviar energia en escenaris DTN. Els nostres resultats mostren les condicions en que un node pot desconnectar la bateria sense afectar la probabilitat de contacte amb altres nodes, i les condicions en que aquesta disminueix. Per exemple, es demostra que la vida del node pot ser duplicada mantenint la probabilitat de contacte a 1. I que aquesta disminueix ràpidament en intentar augmentar més la vida útil.

Distortion control for delay-sensitive sources

We investigate the problem of finding minimum-distortion policies for streaming delay-sensitive but distortion-tolerant data. We consider cross-layer approaches which exploit the coupling between presentation and transport layers. We make the natural assumption that the distortion function is convex and decreasing. We focus on a single source-destination pair and analytically find the optimum transmission policy when the transmission is done over an error-free channel. This optimum policy turns out to be independent of the exact form of the convex and decreasing distortion function. Then, for a packet-erasure channel, we analytically find the optimum open-loop transmission policy, which is also independent of the form of the convex distortion function. We then find computationally efficient closed-loop heuristic policies and show, through numerical evaluation, that they outperform the open-loop policy and have near optimal performance.

Hopf bifurcation of a delay differential equation with two delays

We consider a delay differential equation with two delays. The Hopf bifurcation of this equation is investigated together with the stability of the bifurcated periodic solution, its period and the bifurcation direction. Finally, three applications are given.

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.

New delay-dependent stability criteria for uncertain neutral systems with mixed time-varying delays and nonlinear perturbations

The problem of stability analysis for a class of neutral systems with mixed time-varying neutral, discrete and distributed delays and nonlinear parameter perturbations is addressed. By introducing a novel Lyapunov-Krasovskii functional and combining the descriptor model transformation, the Leibniz-Newton formula, some free-weighting matrices, and a suitable change of variables, new sufficient conditions are established for the stability of the considered system, which are neutral-delay-dependent, discrete-delay-range dependent, and distributeddelay-dependent. The conditions are presented in terms of linear matrix inequalities (LMIs) and can be efficiently solved using convex programming techniques. Two numerical examples are given to illustrate the efficiency of the proposed method

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.

Comprehensive evaluation of the IEEE 802.15.4 MAC layer performance with retransmissions

Supported by IEEE 802.15.4 standardization activities, embedded networks have been gaining popularity in recent years. The focus of this paper is to quantify the behavior of key networking metrics of IEEE 802.15.4 beacon-enabled nodes under typical operating conditions, with the inclusion of packet retransmissions. We corrected and extended previous analyses by scrutinizing the assumptions on which the prevalent Markovian modeling is generally based. By means of a comparative study, we singled out which of the assumptions impact each of the performance metrics (throughput, delay, power consumption, collision probability, and packet-discard probability). In particular, we showed that - unlike what is usually assumed - the probability that a node senses the channel busy is not constant for all the stages of the backoff procedure and that these differences have a noticeable impact on backoff delay, packet-discard probability, and power consumption. Similarly, we showed that - again contrary to common assumption - the probability of obtaining transmission access to the channel depends on the number of nodes that is simultaneously sensing it. We evidenced that ignoring this dependence has a significant impact on the calculated values of throughput and collision probability. Circumventing these and other assumptions, we rigorously characterize, through a semianalytical approach, the key metrics in a beacon-enabled IEEE 802.15.4 system with retransmissions.

A zero-delay sequential scheme for lossy coding of individual sequences

We consider adaptive sequential lossy coding of bounded individual sequences when the performance is measured by the sequentially accumulated mean squared distortion. Theencoder and the decoder are connected via a noiseless channel of capacity $R$ and both are assumed to have zero delay. No probabilistic assumptions are made on how the sequence to be encoded is generated. For any bounded sequence of length $n$, the distortion redundancy is defined as the normalized cumulative distortion of the sequential scheme minus the normalized cumulative distortion of the best scalarquantizer of rate $R$ which is matched to this particular sequence. We demonstrate the existence of a zero-delay sequential scheme which uses common randomization in the encoder and the decoder such that the normalized maximum distortion redundancy converges to zero at a rate $n^{-1/5}\log n$ as the length of the encoded sequence $n$ increases without bound.

Stochastic delay equations with non-negativity constraints driven by fractional Brownian motion

In this note we prove an existence and uniqueness result for the solution of multidimensional stochastic delay differential equations with normal reflection. The equations are driven by a fractional Brownian motion with Hurst parameter H > 1/2. The stochastic integral with respect to the fractional Brownian motion is a pathwise Riemann¿Stieltjes integral.

Stochastic delay differential equations driven by fractional Brownian motion with Hurst parameter H 1/2

We consider the Cauchy problem for a stochastic delay differential equation driven by a fractional Brownian motion with Hurst parameter H>¿. We prove an existence and uniqueness result for this problem, when the coefficients are sufficiently regular. Furthermore, if the diffusion coefficient is bounded away from zero and the coefficients are smooth functions with bounded derivatives of all orders, we prove that the law of the solution admits a smooth density with respect to Lebesgue measure on R.

Networking of differentially expressed genes in human cancer cells resistant to methotrexate

BACKGROUND: The need for an integrated view of data obtained from high-throughput technologies gave rise to network analyses. These are especially useful to rationalize how external perturbations propagate through the expression of genes. To address this issue in the case of drug resistance, we constructed biological association networks of genes differentially expressed in cell lines resistant to methotrexate (MTX). METHODS: Seven cell lines representative of different types of cancer, including colon cancer (HT29 and Caco2), breast cancer (MCF-7 and MDA-MB-468), pancreatic cancer (MIA PaCa-2), erythroblastic leukemia (K562) and osteosarcoma (Saos-2), were used. The differential expression pattern between sensitive and MTX-resistant cells was determined by whole human genome microarrays and analyzed with the GeneSpring GX software package. Genes deregulated in common between the different cancer cell lines served to generate biological association networks using the Pathway Architect software. RESULTS: Dikkopf homolog-1 (DKK1) is a highly interconnected node in the network generated with genes in common between the two colon cancer cell lines, and functional validations of this target using small interfering RNAs (siRNAs) showed a chemosensitization toward MTX. Members of the UDP-glucuronosyltransferase 1A (UGT1A) family formed a network of genes differentially expressed in the two breast cancer cell lines. siRNA treatment against UGT1A also showed an increase in MTX sensitivity. Eukaryotic translation elongation factor 1 alpha 1 (EEF1A1) was overexpressed among the pancreatic cancer, leukemia and osteosarcoma cell lines, and siRNA treatment against EEF1A1 produced a chemosensitization toward MTX. CONCLUSIONS: Biological association networks identified DKK1, UGT1As and EEF1A1 as important gene nodes in MTX-resistance. Treatments using siRNA technology against these three genes showed chemosensitization toward MTX.

Science 2.0 : The use of social networking in research.

REBIUN study on Science 2.0 and social web applications for research. There are three categories: share research, share resources and share results. Describes the applications and selected resources of interest: scientific social networks, scientific databases, research platforms, surveys, concept maps, file sharing, bibliographic management, social bookmarking, citation indexes, blogs and wikis, science news, open access. The services are evaluated and the report describes his interest to libraries.

Extending Learning Objects by Means of Social Networking

Learning objects have been the promise of providing people with high quality learning resources. Initiatives such as MIT Open-CourseWare, MERLOT and others have shown the real possibilities of creating and sharing knowledge through Internet. Thousands of educational resources are available through learning object repositories. We indeed live in an age of content abundance, and content can be considered as infrastructure for building adaptive and personalized learning paths, promoting both formal and informal learning. Nevertheless, although most educational institutions are adopting a more open approach, publishing huge amounts of educational resources, the reality is that these resources are barely used in other educational contexts. This paradox can be partly explained by the dificulties in adapting such resources with respect to language, e-learning standards and specifications and, finally, granularity. Furthermore, if we want our learners to use and take advantage of learning object repositories, we need to provide them with additional services than just browsing and searching for resources. Social networks can be a first step towards creating an open social community of learning around a topic or a subject. In this paper we discuss and analyze the process of using a learning object repository and building a social network on the top of it, with respect to the information architecture needed to capture and store the interaction between learners and resources in form of learning object metadata.

Reconstruction of the join time-delay Doppler-scale reflectivity density in the wide-band regime. A frame theory based approach

The inverse scattering problem concerning the determination of the joint time-delayDoppler-scale reflectivity density characterizing continuous target environments is addressed by recourse to the generalized frame theory. A reconstruction formula,involving the echoes of a frame of outgoing signals and its corresponding reciprocalframe, is developed. A ‘‘realistic’’ situation with respect to the transmission ofa finite number of signals is further considered. In such a case, our reconstruction formula is shown to yield the orthogonal projection of the reflectivity density onto a subspace generated by the transmitted signals.