Beyond belief : Strategic taboos and organizational identity in strategic agenda setting

A comprehensive strategic agenda matters for fundamental strategic change. Our study seeks to explore and theorize how organizational identity beliefs influence the judgment of strategic actors when setting an organization's strategic agenda. We offer the notion of "strategic taboo" as those strategic options initially disqualified and deemed inconsistent with the organizational identity beliefs of strategic actors. Our study is concerned with how strategic actors confront strategic taboos in the process of setting an organization's strategic agenda. Based on a revelatory inductive case study, we find that strategic actors engage in assessing the concordance of the strategic taboos with organizational identity beliefs and, more specifically, that they focus on key identity elements (philosophy; priorities; practices) when doing so. We develop a typology of three reinterpretation practices that are each concerned with a key identity element. While contextualizing assesses the potential concordance of a strategic taboo with an organization's overall philosophy and purpose, instrumentalizing assesses such concordance with respect to what actors deem an organization's priorities to be. Finally, normalizing explores concordance with respect to compatibility and fit with the organization's practices. We suggest that assessing concordance of a strategic taboo with identity elements consists in reinterpreting collective identity beliefs in ways that make them consistent with what organizational actors deem the right course of action. This article discusses the implications for theory and research on strategic agenda setting, strategic change, a practice-based perspective on strategy, and on organizational identity.

FACTORS INFLUENCING CHOICE OF CONTRACEPTIVE METHOD AMONG MARRIED FECUND WOMEN WHO INTEND NO ADDITIONAL BIRTHS: HEALTH BELIEF MODEL AND ECONOMIC PERSPECTIVES

This research examined to what extent Health Belief Model (HBM) and socioeconomic variables were useful in explaining the choice whether or not more effective contraceptive methods were used among married fecund women intending no additional births. The source of the data was the 1976 National Survey of Family Growth conducted under the auspices of the National Center for Health Statistics. Using the HBM as a framework for multivariate analyses limited support was found (using available measures) that the HBM components of motivation and perceived efficacy influence the likelihood of more effective contraceptive method use. Support was also found that modifying variables suggested by the HBM can influence the effects of HBM components on the likelihood of more effective method use. Socioeconomic variables were found, using all cases and some subgroups, to have a significant additional influence on the likelihood of use of more effective methods. Limited support was found for the concept that the greater the opportunity costs of an unwanted birth the greater the likelihood of use of more effective contraceptive methods. This research supports the use of HBM and socioeconomic variables to explain the likelihood of a protective health behavior, use of more effective contraception if no additional births are intended.^

Optimized edge appearance probability for cooperative localization based on tree-reweighted nonparametric belief propagation

Nonparametric belief propagation (NBP) is a well-known particle-based method for distributed inference in wireless networks. NBP has a large number of applications, including cooperative localization. However, in loopy networks NBP suffers from similar problems as standard BP, such as over-confident beliefs and possible nonconvergence. Tree-reweighted NBP (TRW-NBP) can mitigate these problems, but does not easily lead to a distributed implementation due to the non-local nature of the required so-called edge appearance probabilities. In this paper, we propose a variation of TRWNBP, suitable for cooperative localization in wireless networks. Our algorithm uses a fixed edge appearance probability for every edge, and can outperform standard NBP in dense wireless networks.

Uniformly reweighted belief propagation for distributed Bayesian hypothesis testing

Belief propagation (BP) is a technique for distributed inference in wireless networks and is often used even when the underlying graphical model contains cycles. In this paper, we propose a uniformly reweighted BP scheme that reduces the impact of cycles by weighting messages by a constant ?edge appearance probability? rho ? 1. We apply this algorithm to distributed binary hypothesis testing problems (e.g., distributed detection) in wireless networks with Markov random field models. We demonstrate that in the considered setting the proposed method outperforms standard BP, while maintaining similar complexity. We then show that the optimal ? can be approximated as a simple function of the average node degree, and can hence be computed in a distributed fashion through a consensus algorithm.

Uniformly Reweighted Belief Propagation: A Factor Graph Approach

Tree-reweighted belief propagation is a message passing method that has certain advantages compared to traditional belief propagation (BP). However, it fails to outperform BP in a consistent manner, does not lend itself well to distributed implementation, and has not been applied to distributions with higher-order interactions. We propose a method called uniformly-reweighted belief propagation that mitigates these drawbacks. After having shown in previous works that this method can substantially outperform BP in distributed inference with pairwise interaction models, in this paper we extend it to higher-order interactions and apply it to LDPC decoding, leading performance gains over BP.

Reducing communication overhead for cooperative localization using nonparametric belief propagation

A number of methods for cooperative localization has been proposed, but most of them provide only location estimate, without associated uncertainty. On the other hand, nonparametric belief propagation (NBP), which provides approximated posterior distributions of the location estimates, is expensive mostly because of the transmission of the particles. In this paper, we propose a novel approach to reduce communication overhead for cooperative positioning using NBP. It is based on: i) communication of the beliefs (instead of the messages), ii) approximation of the belief with Gaussian mixture of very few components, and iii) censoring. According to our simulations results, these modifications reduce significantly communication overhead while providing the estimates almost as accurate as the transmission of the particles.

Distributed target tracking based on belief propagation consensus

Distributed target tracking in wireless sensor networks (WSN) is an important problem, in which agreement on the target state can be achieved using conventional consensus methods, which take long to converge. We propose distributed particle filtering based on belief propagation (DPF-BP) consensus, a fast method for target tracking. According to our simulations, DPF-BP provides better performance than DPF based on standard belief consensus (DPF-SBC) in terms of disagreement in the network. However, in terms of root-mean square error, it can outperform DPF-SBC only for a specific number of consensus iterations.

B2DI a bayesian BDI agent model with causal belief updating based on MSBN

In this paper, we introduce B2DI model that extends BDI model to perform Bayesian inference under uncertainty. For scalability and flexibility purposes, Multiply Sectioned Bayesian Network (MSBN) technology has been selected and adapted to BDI agent reasoning. A belief update mechanism has been defined for agents, whose belief models are connected by public shared beliefs, and the certainty of these beliefs is updated based on MSBN. The classical BDI agent architecture has been extended in order to manage uncertainty using Bayesian reasoning. The resulting extended model, so-called B2DI, proposes a new control loop. The proposed B2DI model has been evaluated in a network fault diagnosis scenario. The evaluation has compared this model with two previously developed agent models. The evaluation has been carried out with a real testbed diagnosis scenario using JADEX. As a result, the proposed model exhibits significant improvements in the cost and time required to carry out a reliable diagnosis.

Cooperative localization in mobile networks using nonparametric variants of belief propagation

Of the many state-of-the-art methods for cooperative localization in wireless sensor networks (WSN), only very few adapt well to mobile networks. The main problems of the well-known algorithms, based on nonparametric belief propagation (NBP), are the high communication cost and inefficient sampling techniques. Moreover, they either do not use smoothing or just apply it o ine. Therefore, in this article, we propose more flexible and effcient variants of NBP for cooperative localization in mobile networks. In particular, we provide: i) an optional 1-lag smoothing done almost in real-time, ii) a novel low-cost communication protocol based on package approximation and censoring, iii) higher robustness of the standard mixture importance sampling (MIS) technique, and iv) a higher amount of information in the importance densities by using the population Monte Carlo (PMC) approach, or an auxiliary variable. Through extensive simulations, we confirmed that all the proposed techniques outperform the standard NBP method.

Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networks

Non-parametric belief propagation (NBP) is a well-known message passing method for cooperative localization in wireless networks. However, due to the over-counting problem in the networks with loops, NBP’s convergence is not guaranteed, and its estimates are typically less accurate. One solution for this problem is non-parametric generalized belief propagation based on junction tree. However, this method is intractable in large-scale networks due to the high-complexity of the junction tree formation, and the high-dimensionality of the particles. Therefore, in this article, we propose the non-parametric generalized belief propagation based on pseudo-junction tree (NGBP-PJT). The main difference comparing with the standard method is the formation of pseudo-junction tree, which represents the approximated junction tree based on thin graph. In addition, in order to decrease the number of high-dimensional particles, we use more informative importance density function, and reduce the dimensionality of the messages. As by-product, we also propose NBP based on thin graph (NBP-TG), a cheaper variant of NBP, which runs on the same graph as NGBP-PJT. According to our simulation and experimental results, NGBP-PJT method outperforms NBP and NBP-TG in terms of accuracy, computational, and communication cost in reasonably sized networks.

On the belief that arthritis pain is related to the weather.

There is a widespread and strongly held belief that arthritis pain is influenced by the weather; however, scientific studies have found no consistent association. We hypothesize that this belief results, in part at least, from people's tendency to perceive patterns where none exist. We studied patients (n = 18) for more than I year and found no statistically significant associations between their arthritis pain and the weather conditions implicated by each individual. We also found that college students (n = 97) tend to perceive correlations between uncorrelated random sequences. This departure of people's intuitive notion of association from the statistical concept of association, we suggest, contributes to the belief that arthritis pain is influenced by the weather.

Pseudo-contractions in belief revision

Belief Revision addresses the problem of how to change epistemic states, usually represented in the literature by sets of logical sentences. Solid theoretical results were consolidated with the AGM paradigm, which deals with theories (logically closed sets of sentences). After that, the theory was extended to belief bases, that is, arbitrary sets of sentences. Besides all this theoretical framework, AI researchers face serious difficulties when trying to implement belief revision systems. One of the major complications is the closure required by AGM theory, which cannot be easily computed. Even belief bases, which do not require closure, seem to be improper for practical purposes, since their changes are usually very rigid (syntax dependent). Some operations, known as pseudo-contractions, are in the middle ground between belief set change and belief base change. In the present work we have proposed a new pseudo-contraction operation, studied its properties and characterized it. We have also found connections between this operator and some other pseudo-contractions.