21 resultados para gap, minproblem, algoritmi, esatti, lower, bound, posta


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Stone masonry spires are vulnerable to seismic loading. Computational methods are often used to predict the dynamic linear elastic response of masonry towers and spires, but this approach is only applicable until the first masonry joint begins to open, limiting the ability to predict collapse. In this paper, analytical modeling is used to investigate the uplift, rocking and collapse of stone spires. General equations for static equilibrium of the spire under lateral acceleration are first presented, and provide a reasonable lower bound for predicting collapse. The dynamic response is then considered through elastic modal analysis and rigid body rocking. Together, these methods are used to provide uplift curves and single impulse overturning collapse curves for a complete range of possible spire geometries. Results are used to evaluate the historic collapse of two specific stone spires. © 2012 Elsevier Ltd.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Inference for latent feature models is inherently difficult as the inference space grows exponentially with the size of the input data and number of latent features. In this work, we use Kurihara & Welling (2008)'s maximization-expectation framework to perform approximate MAP inference for linear-Gaussian latent feature models with an Indian Buffet Process (IBP) prior. This formulation yields a submodular function of the features that corresponds to a lower bound on the model evidence. By adding a constant to this function, we obtain a nonnegative submodular function that can be maximized via a greedy algorithm that obtains at least a one-third approximation to the optimal solution. Our inference method scales linearly with the size of the input data, and we show the efficacy of our method on the largest datasets currently analyzed using an IBP model.