We interpret the problem of updating beliefs as a choice problem (selecting a posterior from a set of admissible posteriors) with a reference point (prior). We use AGM belief revision to define the support of admissible posteriors after observing zero probability events and investigate two classes of updating rules for probabilities : 1) ”minimum distance” updating rules which select the poster...

the main objective of this paper is to introduce a new intelligent optimization technique that uses a predictioncorrectionstrategy supported by a recurrent neural network for finding a near optimal solution of a givenobjective function. recently there have been attempts for using artificial neural networks (anns) in optimizationproblems and some types of anns such as hopfield network and boltzm...

The problem of reasoning in Bayesian networks with knowledge updating is considered. The reasons of this updating are the following: not precise data evaluation, changes in the surrounding world, testing data introduction and adaptive systems. This knowledge updating forces the repetition of the reasoning process. The idea of updating process in message-passing architectures is presented. The c...

Survey of several forms of updating, with a practical illustrative example. We study several updating (conditioning) schemes that emerge naturally from a common scenario to provide some insights into their meaning. Updating is a subtle operation and there is no single method, no single 'good' rule. The choice of the appropriate rule must always be given due consideration. Planchet (1989) presen...

As examples such as the Monty Hall puzzle show, applying conditioning to update a proba­ bility distribution on a "naive space", which does not take into account the protocol used, can often lead to counterintuitive results. Here we exam­ ine why. A criterion known as CAR ("coarsening at random") in the statistical literature character­ izes when "naive" conditioning in a naive space works. We ...

The authors show that the updating of working memory (WM) representations is carried out by the cooperative act of 2 dissociable reaction time (RT) components: a global updating process that provides stability by shielding WM contents against interference and a local process that provides flexibility. Participants kept track of 1-3 items (digits or Gibson figures). In each trial, the items eith...

Dynamic software updating provides many benefits, e.g. in runtime monitoring, runtime adaptation to fix bugs in long running applications, etc. Although it has several advantages, no quantitative analysis of its costs and revenue are available to show its benefits or limitations especially in comparison with other software updating schemes. To address this limitation in evaluating software upda...

In this paper, we extend the well known QR-updating scheme to a similar but more versatile and generally applicable scheme for updating the singular value decomposition (SVD). This is done by supplementing the QR-updating with a Jacobi-type SVD procedure, where apparently only a few SVD steps after each QR-update su ce in order to restore an acceptable approximation for the SVD. This then resul...

Users often do not install security-related software updates, leaving their devices open to exploitation by attackers. We are beginning to understand what factors affect this software updating behavior but the question of how to improve current software updating interfaces however remains unanswered. In this paper, we begin tackling this question by studying software updating behaviors, designi...