Redundancy quantification in the safety assessment of existing concrete beam-and-slab bridges

In current practice the strength evaluation of a bridge system is typically based on firstly using elastic analysis to determine the distribution of load effects in the elements and then checking the ultimate section capacity of those elements. Ductility of the components in most bridge structures permits local yield and subsequent redistribution of the applied loads from the most heavily loaded elements. As a result a bridge can continue to carry additional loading even after one member has yielded, which has conventionally been adopted as the "failure criterion" in bridge strength evaluation. This means that a bridge with inherent redundancy has additional reserves of strength such that the failure of one element does not result in the failure of the complete system. For these bridges warning signs will show up and measures can be undertaken before the ultimate collapse is happening. This paper proposes a rational methodology for calculating the ultimate system strength and including in bridge evaluation the warning level due to redundancy. © 2004 Taylor & Francis Group, London.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Methods of monitoring of metro lining in Prague

There are several reasons for monitoring of underground structures and they have already been discussed many times, e.g. from the view of ageing or state after accidental event like flooding of Prague metro in 2002. Monitoring of Prague metro is realized in the framework of international research project sponsored by ESF-S3T. The monitoring methods used in Prague are either classical one or new or developing one. The reason for different monitoring methods is the different precision of each method and also for cross-checking between them and their evaluation. Namely we use convergence, tiltmetres, crackmetres, geophysical methods, laser scanning, computer vision and finally installation of MEMS monitoring devices. In the paper more details of each method and obtained results will be presented. The monitoring methods are complemented by wireless data collection and transfer for real-time monitoring. © 2012 Taylor & Francis Group.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

Guidewire retention following central venous catheterisation: a human factors and safe design investigation.

BACKGROUND: Central Venous Catheterisation (CVC) has occasionally been associated with cases of retained guidewires in patients after surgery. In theory, this is a completely avoidable complication; however, as with any human procedure, operator error leading to guidewires being occasionally retained cannot be fully eliminated. OBJECTIVE: The work described here investigated the issue in an attempt to better understand it both from an operator and a systems perspective, and to ultimately recommend appropriate safe design solutions that reduce guidewire retention errors. METHODS: Nine distinct methods were used: observations of the procedure, a literature review, interviewing CVC end-users, task analysis construction, CVC procedural audits, two human reliability assessments, usability heuristics and a comprehensive solution survey with CVC end-users. RESULTS: The three solutions that operators rated most highly, in terms of both practicality and effectiveness, were: making trainees better aware of the potential guidewire complications and strongly emphasising guidewire removal in CVC training, actively checking that the guidewire is present in the waste tray for disposal, and standardising purchase of central line sets so that differences that may affect chances of guidewire loss is minimised. CONCLUSIONS: Further work to eliminate/engineer out the possibility of guidewires being retained is proposed.