Safer construction : the development of a guide to best practice

In Australia, an average 49 building and construction workers have been killed at work each year since 1997-98. Building/construction workers are more than twice as likely to be killed at work, than the average worker in all Australian industries. The ‘Safer Construction’ project, funded by the CRC-Construction Innovation and led by a task force comprising representatives of construction clients, designers and constructors, developed a Guide to Best Practice for Safer Construction. The Guide, which was informed by research undertaken at RMIT University, Queensland University of Technology and Curtin University, establishes broad principles for the improvement of safety in the industry and provides a ‘roadmap’ for improvement based upon lifecycle stages of a building/construction project. Within each project stage, best practices for the management of safety are identified. Each best practice is defined in terms of the recommended action, its key benefits, desirable outcomes, performance measures and leadership. ‘Safer Construction’ practices are identified from the planning to commissioning stages of a project. The ‘Safer Construction’ project represents the first time that key stakeholder groups in the Australian building/construction industry have worked together to articulate best practice and establish an appropriate basis for allocating (and sharing) responsibility for project safety performance.

Algebraic Analysis of LEX

LEX is a stream cipher that progressed to Phase 3 of the eSTREAM stream cipher project. In this paper, we show that the security of LEX against algebraic attacks relies on a small equation system not being solvable faster than exhaustive search. We use the byte leakage in LEX to construct a system of 21 equa- tions in 17 variables. This is very close to the require- ment for an efficient attack, i.e. a system containing 16 variables. The system requires only 36 bytes of keystream, which is very low.

Drivers constraints and the future of off-site manufacture in Australia.

Much has been written on Off-site Manufacture (OSM) in construction, particularly regarding the perceived benefits and barriers to implementation. However, very little understanding of the state of OSM in the Australian construction industry exists. A ‘scoping study' has recently been undertaken to determine the ‘state-of-the-art’ of OSM in Australia. This involved several industry workshops, interviews and case studies across four major states of Australia. The study surveyed a range of suppliers across the construction supply-chain, incorporating the civil, commercial and housing segments of the market. This revealed that skills shortages and lack of adequate OSM knowledge are generally the greatest issues facing OSM in Australia. The drivers and constraints that emerged from the research were, in large measure, consistent with those found in the US and UK, although some Australian anomalies are evident, such as the geographical disparity of markets. A comparative analysis with similar studies in the UK and US is reported, illustrating both the drivers and constraints confronting the industry in Australia. OSM uptake into the future is however dependent on many factors, not least of which is a better understanding of the construction process and its associated costs.

Improved cryptanalysis of the Common Scrambling Algorithm Stream Cipher

This paper provides a fresh analysis of the widely-used Common Scrambling Algorithm Stream Cipher (CSA-SC). Firstly, a new representation of CSA-SC with a state size of only 89 bits is given, a significant reduction from the 103 bit state of a previous CSA-SC representation. Analysis of this 89-bit representation demonstrates that the basis of a previous guess-and-determine attack is flawed. Correcting this flaw increases the complexity of that attack so that it is worse than exhaustive key search. Although that attack is not feasible, the reduced state size of our representation makes it obvious that CSA-SC is vulnerable to several generic attacks, for which feasible parameters are given.

Barriers to effective knowledge transfer in project-based organisations

Effective knowledge transfer can prevent the reinvention of systems and ideas as well as the repetition of errors. Doing so will save substantial time, as well as contribute to better performance of projects and project-based organisations (PBOs). Despite the importance of knowledge, PBOs face serious barriers to the effective transfer of knowledge, while their characteristics, such as unique and innovative approaches taken during every project, mean they have much to gain from knowledge transfer. As each new project starts, there is the strong potential to reinvent the process, rather than utilise learning from previous projects. In fact, rework is one of the primary factors contributing to construction industry's poor performance and productivity. Current literature has identified several barriers to knowledge transfer in organisational settings in general, and not specifically PBOs. However, PBOs significantly differ from other types of organisations. PBOs operate mainly on temporary projects, where time is a crucial factor and people are more mobile than in other organisational settings. The aim of this research is to identify the key barriers that prevent effective knowledge transfer for PBOs, exclusively. Interviews with project managers and senior managers of PBOs complement the analysis of the literature and provide professional expertise. This research is crucial to gaining a better understanding of obstacles that hinder knowledge transfer in projects. The main contribution of this research is exclusive for PBO, list of key barriers that organisation and project managers need to consider to ensure effective knowledge transfer and better project management.

Knowledge discovery for adaptive negotiation agents in e-marketplaces

Intelligent software agents are promising in improving the effectiveness of e-marketplaces for e-commerce. Although a large amount of research has been conducted to develop negotiation protocols and mechanisms for e-marketplaces, existing negotiation mechanisms are weak in dealing with complex and dynamic negotiation spaces often found in e-commerce. This paper illustrates a novel knowledge discovery method and a probabilistic negotiation decision making mechanism to improve the performance of negotiation agents. Our preliminary experiments show that the probabilistic negotiation agents empowered by knowledge discovery mechanisms are more effective and efficient than the Pareto optimal negotiation agents in simulated e-marketplaces.

Krylov subspace methods for approximating functions of symmetric positive definite matrices with applications to applied statistics and anomalous diffusion

Matrix function approximation is a current focus of worldwide interest and finds application in a variety of areas of applied mathematics and statistics. In this thesis we focus on the approximation of A^(-α/2)b, where A ∈ ℝ^(n×n) is a large, sparse symmetric positive definite matrix and b ∈ ℝ^n is a vector. In particular, we will focus on matrix function techniques for sampling from Gaussian Markov random fields in applied statistics and the solution of fractional-in-space partial differential equations. Gaussian Markov random fields (GMRFs) are multivariate normal random variables characterised by a sparse precision (inverse covariance) matrix. GMRFs are popular models in computational spatial statistics as the sparse structure can be exploited, typically through the use of the sparse Cholesky decomposition, to construct fast sampling methods. It is well known, however, that for sufficiently large problems, iterative methods for solving linear systems outperform direct methods. Fractional-in-space partial differential equations arise in models of processes undergoing anomalous diffusion. Unfortunately, as the fractional Laplacian is a non-local operator, numerical methods based on the direct discretisation of these equations typically requires the solution of dense linear systems, which is impractical for fine discretisations. In this thesis, novel applications of Krylov subspace approximations to matrix functions for both of these problems are investigated. Matrix functions arise when sampling from a GMRF by noting that the Cholesky decomposition A = LL^T is, essentially, a `square root' of the precision matrix A. Therefore, we can replace the usual sampling method, which forms x = L^(-T)z, with x = A^(-1/2)z, where z is a vector of independent and identically distributed standard normal random variables. Similarly, the matrix transfer technique can be used to build solutions to the fractional Poisson equation of the form ϕn = A^(-α/2)b, where A is the finite difference approximation to the Laplacian. Hence both applications require the approximation of f(A)b, where f(t) = t^(-α/2) and A is sparse. In this thesis we will compare the Lanczos approximation, the shift-and-invert Lanczos approximation, the extended Krylov subspace method, rational approximations and the restarted Lanczos approximation for approximating matrix functions of this form. A number of new and novel results are presented in this thesis. Firstly, we prove the convergence of the matrix transfer technique for the solution of the fractional Poisson equation and we give conditions by which the finite difference discretisation can be replaced by other methods for discretising the Laplacian. We then investigate a number of methods for approximating matrix functions of the form A^(-α/2)b and investigate stopping criteria for these methods. In particular, we derive a new method for restarting the Lanczos approximation to f(A)b. We then apply these techniques to the problem of sampling from a GMRF and construct a full suite of methods for sampling conditioned on linear constraints and approximating the likelihood. Finally, we consider the problem of sampling from a generalised Matern random field, which combines our techniques for solving fractional-in-space partial differential equations with our method for sampling from GMRFs.

Analysis of authenticated encryption stream ciphers

Authenticated Encryption (AE) is the cryptographic process of providing simultaneous confidentiality and integrity protection to messages. AE is potentially more efficient than applying a two-step process of providing confidentiality for a message by encrypting the message and in a separate pass, providing integrity protection by generating a Message Authentication Code (MAC) tag. This paper presents results on the analysis of three AE stream ciphers submitted to the recently completed eSTREAM competition. We classify the ciphers based on the methods the ciphers use to provide authenticated encryption and discuss possible methods for mounting attacks on these ciphers.