For FRF based model updating procedures, the selection of updating frequencies and the choice of a damping approach are important factors to obtain reliable updating resuns. This paper discusses the selection of the updating frequencies and shows that damping approaches like proportional, structural or modal damping are not satisfactory for model updating purposes.

Jeffrey updating is a natural extension of Bayesian updating to cases where the evidence is uncertain. But, the resulting degrees of belief appear to be sensitive to the order in which the uncertain evidence is acquired, a rather un-Bayesian looking effect. This order dependence results from the way in which basic Jeffrey updating is usually extended to sequences of updates. The usual extension...

10 years ago, a group of us put on an international meeting at the NIH entitled “The Energetic and Dynamic Basis of Health and Aging” [3]. The centerpiece of our conference was the reification of the term homeodynamics [4]. This word was proposed and elaborated by Dr. Gene Yates of UCLA who was a leader of our conference. Homeodynamics extends homeostasis into a more inclusive term. It is evide...

marine industry requires continued development of new technologies in order to produce oil. an essential requirement in design is to be able to compare experimental data from prototype structures with predicted information from a corresponding analytical finite element model. in this study, structural model updating may be defined as the fit of an existing analytical model in the light of measu...

The Method of Maximum (relative) Entropy (ME) has been designed for updating from a prior distribution to a posterior distribution when the information being processed is in the form of a constraint on the family of allowed posteriors. This is in contrast with the usual MaxEnt which was designed as a method to assign, and not to update, probabilities. The objective of this paper is to strengthe...

We address the problem of very efficient reasoning and update in ≤, <-chains, where a ≤, <-chain is a directed acyclic graph such that there is a directed path between every pair of vertices, and edges are consistently labelled by ≤ or <. It is easy to show that, subsequent to an O(n) labelling scheme, queries concerning implied ≤ and < relations can be answered in O(1) time. However this schem...