In mobile ad hoc networks (MANETs), broadcasting is widely used in route discovery and other network services. The most widely used broadcasting algorithm is simple flooding, which aggravates a high number of redundant packet retransmissions, causing contention and collisions. Proper use of dynamic probabilistic algorithm significantly reduces the number of retransmissions, which reduces the ch...

VIa We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks does not preclude their effective use. We give algorithms for approximate probabilistic inference that exploit averaging phenomena occurring at nodes with large numbers of parents . We show that these algorithms comp...

we report a case of a 68-year-old female who was a known case of diabetes mellitus and chronic liver disease and presented with complaints of dry cough and other constitutional symptoms since one month. during initial investigations, the patient was found to have peripheral blood eosinophilia. upon investigating further,the patient was found to have mediastinal lymphadenopathy and fine-needle a...

Predicting potential links between unconnected nodes in a network, as collaboration networks, is a problem of great practical interest. Link prediction is mostly based on graph-based features and recently, on approaches that consider semantics of the domain. However, there is uncertainty in these predictions and considering it, can improve the prediction results. In this paper, we propose an al...

This paper proposes a probabilistic hill-climbing algorithm, called PH, for the single-source transportation problem (STP). PH is tree search algorithm in which each node contains an assignment (AP) transformed from STP being solved. The transformation converts source’s product units into lots; lot equals multiple units. AP aims to find optimal of lots destinations minimize total cost. uses Hun...

Minor-embedding heuristics have become an indispensable tool for compiling problems in quadratically unconstrained binary optimization (QUBO) into the hardware graphs of quantum and CMOS annealing processors. While recent embedding been developed annealers moderate size (about 2000 nodes), latest processor (with 102,400 nodes) poses entirely new demands on heuristic. This raises question, if ca...

In this paper, we introduce the  probabilistic normed groups. Among other results, we investigate the continuityof inner automorphisms of a group and the continuity of left and right shifts in probabilistic group-norm. We also study midconvex functions defined  on probabilistic normed groups and  give  some results about locally boundedness of such  functions.

Today’s ever smaller computing systems are increasingly spreading in our ubiquitous environment. Being available ubiquitously in the devices and appliances that we use everyday and everywhere, these embedded computing systems are accessible to mobile users via hand-held devices connected over wireless networks. A mobile ad hoc network (MANET) is one of the important wireless networks. In a MANE...

Multi-Entity Bayesian Network (MEBN) is an expressive first-order probabilistic logic that represents the domain using parameterized fragments of Bayesian networks. Probabilistic-OWL (PR-OWL) uses MEBN to add uncertainty support to OWL, the main language of the Semantic Web. The reasoning in MEBN is made by the construction of a Situation-Specific Bayesian Network (SSBN), a minimal Bayesian net...

The rapid deployment of millions of smart phones has resulted in a demand for proximity-based social networking applications. However, the usefulness of these applications is limited by the lack of effective and energy efficient neighbor discovery protocols. While probabilistic approaches perform well for the average case, they exhibit long tails resulting in high upper bounds on neighbor disco...