Belief Networks in the Bayesian approach provide a wellestablished methodology to fuse prior knowledge and statistical observations for an enriched decision support. In this paper we investigate one of the advantages of the Bayesian approach the provided additional uncertainty information for predictions in a medical classification problem. We perform a Bayesian analysis using Belief Network mo...

How do individuals’ networks of personal relationships affect their social in? and exclusion? Researchers have shown that micro?level, informal can be highly consequential for inclusion, but in complex, contradictory ways: Personal reflect the degree relational exclusion protect against (other forms of) exclusion, they also erode conditions reproduce exclusion. While network researchers widely ...

background global health partnerships have grown rapidly in number and scope, yet there has been less emphasis on their evaluation. gavi, the vaccine alliance, is one such public-private partnership; in gavi-eligible countries partnerships are dynamic networks of immunization actors who work together to support all stages and aspects of gavi support. this paper describes a conceptual framework ...

Empirical support for the assumption that cliques are major determinants of reputational influence derives largely from the frequent finding that organizations which claimed that their cliques’ connections are influential had an increased likelihood of becoming influential themselves. It is suggested that the strong and consistent connection in cliques is at least partially responsible for the ...

A mobile ad hoc network can be defined as a network that is spontaneously deployed and is independent of any static network. The network consists of mobiles nodes with wireless interfaces and has arbitrary dynamic topology. The network suffers from frequent link formation and disruption due to the mobility of the nodes. A clustering method is used for obtaining a hierarchical organization for t...

In this paper a distributed algorithm is proposed that realises mutual exclusion among n nodes in a computer network. There is no common or global memory shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The proposed algorithm is based on queue migration and achieves a message complexity of O(√n) per mutual ...