The method of conditioning permits probabilistic inference in multiply connected belief networks using an algorithm by Pearl. This method uses a select set of nodes, the loop cutset, to render the multiply connected network singly connected. We discuss the function of the nodes of the loop cutset and a condition that must be met by the nodes of the loop cutset. We show that the problem of findi...

We developed a computational model for automatically voicing chords based on a Bayesian network. Automatic chord voicing is difficult because it is necessary to choose extended notes and inversions by taking into account musical simultaneity and sequentiality. We overcome this difficulty by inferring the most likely chord voicing using a Bayesian network model where musical simultaneity and seq...

The reliability of distributed systems in which the communication links are considered reliable while the computing nodes may fail with certain probabilities have been modeled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), of probabilistic networks with unreliable nodes is very useful, but is an NP-hard problem. To derive the ex...

Abstract Influence maximization is the problem of trying to maximize number influenced nodes by selecting optimal seed nodes, given that influencing these costly. Due probabilistic nature problem, existing approaches deal with concept expected nodes. In current research, a scenario-based robust optimization approach taken finding most influential The proposed model maximizes infected in last st...

In-network data aggregation allows energy-efficient communication within a sensor network. However, such data aggregation introduces new security challenges. As sensor nodes are prone to node-compromise, a fraction of nodes might act maliciously and forge aggregated data. For arbitrary aggregation functions, the verification of authenticity of aggregated data, i.e., its correctness, integrity, ...

In mobile ad hoc networks (MANETs)[1], a mobile station (MS) can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcasts route request packets that are forwarded to all other nodes. A simple flooding scheme is employed in AODV [2], where every node rebroadcasts these route reque...

The main objective of this paper is to reduce the number of sensor nodes by estimating a trade off between data accuracy and energy consumption for selecting nodes in probabilistic approach in a distributed network. Design Procedure/Approach: Observed data are highly correlated among sensor nodes in the spatial domain due to deployment of high density of sensor nodes. These sensor nodes form no...

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covere...

In this paper we describe a way of modelling communicating processes that display both nondeterministic and probabilistic behaviour. We represent processes by nondeterministic, probabilistic, action (NPA) graphs with three sorts of nodes: action nodes, from which the process may evolve by performing visible actions; probabilistic nodes, from which the process may evolve probabilistically; and n...