Closely correlating lower and upper bound plastic analysis of real slabs

An engineer assessing the load-carrying capacity of an existing reinforced concrete slab is likely to use elastic analysis to check the load at which the structure might be expected to fail in flexure or in shear. In practice, many reinforced concrete slabs are highly ductile in flexure, so an elastic analysis greatly underestimates the loads at which they fail in this mode. The use of conservative elastic analysis has led engineers to incorrectly condemn many slabs and therefore to specify unnecessary and wasteful flexural strengthening or replacement. The lower bound theorem is based on the same principles as the upper bound theorem used in yield line analysis, but any solution that rigorously satisfies the lower bound theorem is guaranteed to be a safe underestimate of the collapse load. Jackson presented a rigorous lower bound method that obtains very accurate results for complex real slabs.

Numerical analysis of shallow foundations under combined horizontal and torsional loading

Foundations of subsea infrastructure in deep water subjected to asymmetric environmental loads have underscored the importance of combined torsional and horizontal loading effects on the bearing capacity of rectangular shallow foundations. The purpose of this study is to investigate the undrained sliding and torsional bearing capacity of rectangular and square shallow foundations together with the interaction response under combined loading using three-dimensional finite element (3D-FE) analysis. Upper bound plastic limit analysis is employed to establish a reference value for horizontal and torsional bearing capacity, and an interaction relationship for the combined loading condition. Satisfactory agreement of plastic limit analysis (PLA) and 3D-FE results for ultimate capacity and interaction curves ensures that simple PLA solution could be used to evaluate the bearing capacity problem of foundation under combined sliding and torsion.

Closing the gap: Improved bounds on optimal POMDP solutions

POMDP algorithms have made significant progress in recent years by allowing practitioners to find good solutions to increasingly large problems. Most approaches (including point-based and policy iteration techniques) operate by refining a lower bound of the optimal value function. Several approaches (e.g., HSVI2, SARSOP, grid-based approaches and online forward search) also refine an upper bound. However, approximating the optimal value function by an upper bound is computationally expensive and therefore tightness is often sacrificed to improve efficiency (e.g., sawtooth approximation). In this paper, we describe a new approach to efficiently compute tighter bounds by i) conducting a prioritized breadth first search over the reachable beliefs, ii) propagating upper bound improvements with an augmented POMDP and iii) using exact linear programming (instead of the sawtooth approximation) for upper bound interpolation. As a result, we can represent the bounds more compactly and significantly reduce the gap between upper and lower bounds on several benchmark problems. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.

Plastic collapse of sandwich beams with a metallic foam core

Plastic collapse modes of sandwich beams have been investigated experimentally and theoretically for the case of an aluminum alloy foam with cold-worked aluminum face sheets. Plastic collapse is by three competing mechanisms: face yield, indentation and core shear, with the active mechanism depending upon the choice of geometry and material properties. The collapse loads, as predicted by simple upper bound solutions for a rigid, ideally plastic beam, and by more refined finite element calculations are generally in good agreement with the measured strengths. However, a thickness effect of the foam core on the collapse strength is observed for collapse by core shear: the shear strength of the core increases with diminishing core thickness in relation to the cell size. Limit load solutions are used to construct collapse maps, with the beam geometrical parameters as axes. Upon displaying the collapse load for each collapse mechanism, the regimes of dominance of each mechanism and the associate mass of the beam are determined. The map is then used in optimal design by minimizing the beam weight for a given structural load index.

Polymers with aligned carbon nanotubes: Active composite materials

We review the current state of the polymer-carbon nanotube composites field. The article first covers key points in dispersion and stabilization of nanotubes in a polymer matrix, with particular attention paid to ultrasonic cavitation and shear mixing. We then focus on the emerging trends in nanocomposite actuators, in particular, photo-stimulated mechanical response. The magnitude and even the direction of this actuation critically depend on the degree of tube alignment in the matrix; in this context, we discuss the affine model predicting the upper bound of orientational order of nanotubes, induced by an imposed strain. We review how photo-actuation in nanocomposites depend on nanotube concentration, alignment and entanglement, and examine possible mechanisms that could lead to this effect. Finally, we discuss properties of pure carbon nanotube networks, in form of mats or fibers. These systems have no polymer matrix, yet demonstrate pronounced viscoelasticity and also the same photomechanical actuation as seen in polymer-based composites. © 2008 Elsevier Ltd. All rights reserved.

Fault-tolerant model predictive control of a wind turbine benchmark

This paper aims to solve the fault tolerant control problem of a wind turbine benchmark. A hierarchical controller with model predictive pre-compensators, a global model predictive controller and a supervisory controller is proposed. In the model predictive pre-compensator, an extended Kalman Filter is designed to estimate the system states and various fault parameters. Based on the estimation, a group of model predictive controllers are designed to compensate the fault effects for each component of the wind turbine. The global MPC is used to schedule the operation of the components and exploit potential system-level redundancies. Extensive simulations of various fault conditions show that the proposed controller has small transients when faults occur and uses smoother and smaller generator torque and pitch angle inputs than the default controller. This paper shows that MPC can be a good candidate for fault tolerant controllers, especially the one with an adaptive internal model combined with a parameter estimation and update mechanism, such as an extended Kalman Filter. © 2012 IFAC.

Achieving Csiszár's source-channel coding exponent with product distributions

We derive a random-coding upper bound on the average probability of error of joint source-channel coding that recovers Csiszár's error exponent when used with product distributions over the channel inputs. Our proof technique for the error probability analysis employs a code construction for which source messages are assigned to subsets and codewords are generated with a distribution that depends on the subset. © 2012 IEEE.

Low-rank optimization on the cone of positive semidefinite matrices

We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.