We study the neutral current flavour changing rare decay mode B → Kγγ within the framework of Standard Model, including the long distance contributions. It is found that these long distance contributions can be of the same order as the short distance contribution.

In this paper an adjustment process for an exchange economy with linear production technologies is given. The process reaches an equilibrium by simultaneous adaptations of prices and activity levels. Till thusfar no such process exists. An important feature of the process is that it keeps track of the location of the starting price vector throughout its operation. Furthermore, the choice of the...

In the past, there has been significant research on tracking objects based on features that characterize objects. However, once the features to detect the object are not available from the position of a tracker, it is not clear how to track the object. Our goal in this paper is to track an object even though the object leaves the field-of-view. In this paper, we firstly describe the problems re...

In this paper, we study a distance defined over the partitions of a finite set. Given two partitions P and Q, this distance is defined as the minimum number of transfers of an element from one class to another, required to transform P into Q. We recall the algorithm to evaluate this distance and we give some formulae for the maximum distance value between two partitions having exactly or at mos...

We study the neutral current flavour changing rare decay mode B → Kγγ within the framework of Standard Model, including the long distance contributions. It is found that these long distance contributions can be of the same order as the short distance contribution.

In this paper, we propose a family of approval voting-schemes for electing committees based on the preferences of voters. In our schemes, we calculate the vector of distances of the possible committees from each of the ballots and, for a given p-norm, choose the one that minimizes the magnitude of the distance vector under that norm. The minisum and minimax methods suggested by previous authors...

Routing in wireless sensor networks is a demanding task. This demand has led to a number of routing protocols which efficiently utilize the limited resources available at the sensor nodes. All these protocols typically find the minimum energy path. In this paper we take a view that, always using the minimum energy path deprives the nodes energy quickly and the time taken to determine an alterna...

Most of the routing algorithms for ad hoc networks assume that all wireless links are bidirectional. In reality, some links may be unidirectional. In this paper we show that the presence of such links can jeopardize the performance of the existing distance vector routing algorithms. We also present modi cations to distance vector based routing algorithms to make them work in ad hoc networks wit...

The Euclidean distance matrix (EDM) completion problem and the positive semidefinite (PSD) matrix completion problem are considered in this paper. Approaches to determine the location of a point in a linear manifold are studied, which are based on a referential coordinate set and a distance vector whose components indicate the distances from the point to other points in the set. For a given ref...

in this paper, we propose a scheme to improve existing ad-hoc on-demanddistance vector (aodv) routing protocol by discovering and maintaining multiplenon-overlapped routes. our routing protocol is a multipath version of aodvrouting protocol that considers only the disjoint path. due to non-overlappingamong paths, when a link breaks in the network, only one of paths is expired. thepresented rout...