Development of Novel Post-Tensioned Glulam Timber Composites

Improvements in the structural performance of glulam timber beams by the inclusion of reinforcing materials can increase both the service performance and ultimate capacity. In recent years research focusing on the addition of fibre reinforced polymers (FRP) to strengthen members has yielded positive results. However, the FRP material is still relatively expensive and its full potential in combination with structural timber has not been realised. This paper describes a series of four-point bending tests that were conducted, under service loads and to failure, on unreinforced, reinforced and post-tensioned glulam timber beams, where the reinforcing tendon used was 12mm diameter basalt fibre reinforced polymer (BFRP). The research was designed to evaluate the benefits offered by including an active reinforcement in contrast to the passive reinforcement typically used within timber strengthening works, in addition to establishing the affect that bonding the reinforcing tendon has on the material’s performance. Further experimental tests have been developed to investigate the long-term implications of this research, with emphasis placed upon creep and loss of post-tensioning.
The laboratory investigations established that the flexural strength and stiffness increased for both the unbonded and bonded post-tensioned timbers compared to the unreinforced beams. Timber that was post-tensioned with an unbonded BFRP tendon showed a flexural strength increase of 2.8% and an increase in stiffness of 8.7%. Post-tensioned beams with a bonded BFRP tendon showed increases in flexural strength and stiffness of 16.6% and 11.5% respectively.

Global Sensitivity Analysis for MAP Inference in Graphical Models

We study the sensitivity of a MAP configuration of a discrete probabilistic graphical model with respect to perturbations of its parameters. These perturbations are global, in the sense that simultaneous perturbations of all the parameters (or any chosen subset of them) are allowed. Our main contribution is an exact algorithm that can check whether the MAP configuration is robust with respect to given perturbations. Its complexity is essentially the same as that of obtaining the MAP configuration itself, so it can be promptly used with minimal effort. We use our algorithm to identify the largest global perturbation that does not induce a change in the MAP configuration, and we successfully apply this robustness measure in two practical scenarios: the prediction of facial action units with posed images and the classification of multiple real public data sets. A strong correlation between the proposed robustness measure and accuracy is verified in both scenarios.

Advances in Learning Bayesian Networks of Bounded Treewidth

This work presents novel algorithms for learning Bayesian networks of bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed integer linear programming formulations for structure learning and treewidth computation. The approximate method consists in sampling k-trees (maximal graphs of treewidth k), and subsequently selecting, exactly or approximately, the best structure whose moral graph is a subgraph of that k-tree. The approaches are empirically compared to each other and to state-of-the-art methods on a collection of public data sets with up to 100 variables.

Can(Plan)+: Extending the Operational Semantics of the BDI Architecture to deal with Uncertain Information

The BDI architecture, where agents are modelled based on their beliefs, desires and intentions, provides a practical approach to develop large scale systems. However, it is not well suited to model complex Supervisory Control And Data Acquisition (SCADA) systems pervaded by uncertainty. In this paper we address this issue by extending the operational semantics of Can(Plan) into Can(Plan)+. We start by modelling the beliefs of an agent as a set of epistemic states where each state, possibly using a different representation, models part of the agent's beliefs. These epistemic states are stratified to make them commensurable and to reason about the uncertain beliefs of the agent. The syntax and semantics of a BDI agent are extended accordingly and we identify fragments with computationally efficient semantics. Finally, we examine how primitive actions are affected by uncertainty and we define an appropriate form of lookahead planning.