Rich Interfaces for Dependability: Compositional Methods for Dynamic Fault Trees and Arcade models

This paper discusses two behavioural interfaces for reliability analysis: dynamic fault trees, which model the system reliability in terms of the reliability of its components and Arcade, which models the system reliability at an architectural level. For both formalisms, the reliability is analyzed by transforming the DFT or Arcade model to a set of input-output Markov Chains. By using compositional aggregation techniques based on weak bisimilarity, significant reductions in the state space can be obtained

Spectra: Robust Estimation of Distribution Functions in Networks

Distributed aggregation allows the derivation of a given global aggregate property from many individual local values in nodes of an interconnected network system. Simple aggregates such as minima/maxima, counts, sums and averages have been thoroughly studied in the past and are important tools for distributed algorithms and network coordination. Nonetheless, this kind of aggregates may not be comprehensive enough to characterize biased data distributions or when in presence of outliers, making the case for richer estimates of the values on the network. This work presents Spectra, a distributed algorithm for the estimation of distribution functions over large scale networks. The estimate is available at all nodes and the technique depicts important properties, namely: robust when exposed to high levels of message loss, fast convergence speed and fine precision in the estimate. It can also dynamically cope with changes of the sampled local property, not requiring algorithm restarts, and is highly resilient to node churn. The proposed approach is experimentally evaluated and contrasted to a competing state of the art distribution aggregation technique.Comment: Full version of the paper published at 12th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS), Stockholm (Sweden), June 201

Towards a Queueing-Based Framework for In-Network Function Computation

We seek to develop network algorithms for function computation in sensor networks. Specifically, we want dynamic joint aggregation, routing, and scheduling algorithms that have analytically provable performance benefits due to in-network computation as compared to simple data forwarding. To this end, we define a class of functions, the Fully-Multiplexible functions, which includes several functions such as parity, MAX, and k th -order statistics. For such functions we exactly characterize the maximum achievable refresh rate of the network in terms of an underlying graph primitive, the min-mincut. In acyclic wireline networks, we show that the maximum refresh rate is achievable by a simple algorithm that is dynamic, distributed, and only dependent on local information. In the case of wireless networks, we provide a MaxWeight-like algorithm with dynamic flow splitting, which is shown to be throughput-optimal

Modelling crystal aggregation and deposition\ud in the catheterised lower urinary tract

Urethral catheters often become encrusted with crystals of magnesium struvite and calcium phosphate. The encrustation can block the catheter, which can cause urine retention in the bladder and reflux into the kidneys. We develop a mathematical model to investigate crystal deposition on the catheter surface, modelling the bladder as a reservoir of fluid and the urethral catheter as a rigid channel. At a constant rate, fluid containing crystal particles of unit size enters the reservoir, and flows from the reservoir through the channel and out of the system. The crystal particles aggregate, which we model using Becker–Döring coagulation theory, and are advected through the channel, where they continue to aggregate and are deposited on the channel’s walls. Inhibitor particles also enter the reservoir, and can bind to the crystals, preventing further aggregation and deposition. The crystal concentrations are spatially homogeneous in the reservoir, whereas the channel concentrations vary spatially as a result of advection, diffusion and deposition. We investigate the effect of inhibitor particles on the amount of deposition. For all parameter values, we find that crystals deposit along the full length of the channel, with maximum deposition close to the channel’s entrance

Effects of Permafrost and Seasonally Frozen Ground on the Seismic Response of Transportation Infrastructure Sites

INE/AUTC 11.0