The plastic collapse and energy absorption capacity of egg-box panels

The plastic collapse response of aluminium egg-box panels subjected to out-of-plane compression has been measured and modelled. It is observed that the collapse strength and energy absorption are sensitive to the level of in-plane constraint, with collapse dictated either by plastic buckling or by a travelling plastic knuckle mechanism. Drop weight tests have been performed at speeds of up to 6 m s-1, and an elevation in strength with impact velocity is noted. A 3D finite element shell model is needed in order to reproduce the observed behaviours. Additional calculations using an axisymmetric finite element model give the correct collapse modes but are less accurate than the more sophisticated 3D model. The finite element simulations suggest that the observed velocity dependence of strength is primarily due to strain-rate sensitivity of the aluminium sheet, with material inertia playing a negligible role. Finally, it is shown that the energy absorption capacity of the egg-box material is comparable to that of metallic foams. © 2003 Elsevier Ltd. All rights reserved.

The unidirectional emptying box

A theoretical description of the turbulent mixing within and the draining of a dense fluid layer from a box connected to a uniform density, quiescent environment through openings in the top and the base of the box is presented in this paper. This is an extension of the draining model developed by Linden et al. (Annu. Rev. Fluid Mech. vol. 31, 1990, pp. 201-238) and includes terms that describe localized mixing within the emptying box at the density interface. Mixing is induced by a turbulent flow of replacement fluid into the box and as a consequence we predict, and observe in complementary experiments, the development of a three-layer stratification. Based on the data collated from previous researchers, three distinct formulations for entrainment fluxes across density interfaces are used to account for this localized mixing. The model was then solved numerically for the three mixing formulations. Analytical solutions were developed for one formulation directly and for a second on assuming that localized mixing is relatively weak though still significant in redistributing buoyancy on the timescale of the draining process. Comparisons between our theoretical predictions and the experimental data, which we have collected on the developing layer depths and their densities show good agreement. The differences in predictions between the three mixing formulations suggest that the normalized flux turbulently entrained across a density interface tends to a constant value for large values of a Froude number FrT, based on conditions of the inflow through the top of the box, and scales as the cube of FrT for small values of FrT. The upper limit on the rate of entrainment into the mixed layer results in a minimum time (tD) to remove the original dense layer. Using our analytical solutions, we bound this time and show that 0.2tE ≈tD tE, i.e. the original dense layer may be depleted up to five times more rapidly than when there is no internal mixing and the box empties in a time tE. © 2010 Cambridge University Press.

Classification using log Gaussian Cox processes

McCullagh and Yang (2006) suggest a family of classification algorithms based on Cox processes. We further investigate the log Gaussian variant which has a number of appealing properties. Conditioned on the covariates, the distribution over labels is given by a type of conditional Markov random field. In the supervised case, computation of the predictive probability of a single test point scales linearly with the number of training points and the multiclass generalization is straightforward. We show new links between the supervised method and classical nonparametric methods. We give a detailed analysis of the pairwise graph representable Markov random field, which we use to extend the model to semi-supervised learning problems, and propose an inference method based on graph min-cuts. We give the first experimental analysis on supervised and semi-supervised datasets and show good empirical performance.

Predictive entropy search for efficient global optimization of black-box functions

We propose a novel information-theoretic approach for Bayesian optimization called Predictive Entropy Search (PES). At each iteration, PES selects the next evaluation point that maximizes the expected information gained with respect to the global maximum. PES codifies this intractable acquisition function in terms of the expected reduction in the differential entropy of the predictive distribution. This reformulation allows PES to obtain approximations that are both more accurate and efficient than other alternatives such as Entropy Search (ES). Furthermore, PES can easily perform a fully Bayesian treatment of the model hyperparameters while ES cannot. We evaluate PES in both synthetic and real-world applications, including optimization problems in machine learning, finance, biotechnology, and robotics. We show that the increased accuracy of PES leads to significant gains in optimization performance.