Disjoint paths are useful in mobile networks for fault tolerance, increasing bandwidth, and achieving better load balance. Communication over multiple disjoint paths is a less expensive alternative to flooding the network. We present a distributed algorithm for finding k disjoint paths, for any given k, between a source S and a destination T in mobile networks where the links have uniform weigh...

The number of doctoral training programs in informatics increases every year, however not every doctoral candidate wishes to pursue a traditional career in academia. In addition, the knowledge and skills acquired through scientific training at the doctoral level can be valuable, even critical, for a number of career paths outside of academic research and teaching. This panel will present a dive...

Influence of growth temperature on the capacity of the mitochondrial alternative pathway of electron transport was investigated using etiolated corn (Zea mays L.) seedlings. These seedlings were grown to comparable size in either a warm (30 degrees C) or a cold (13 degrees C) temperature regime, and then their respiration rates were measured as O(2) uptake at 25 degrees C. The capacity of the a...

It is known (see e.g. [2], [4], [5], [6]) that continuous variations in the entries of a complex square matrix induce its eigenvalues. If such variation arises from one real parameter α∈[0,1], then eigenvalues follow paths plane as α shifts 0 to 1. The intent here study nature these eigenpaths, including their behavior under small perturbations variations, well resulting eigenpairings matrices ...

This paper introduces Simultaneous Speculation Scheduling, a new compiler technique that enables speculative execution of alternative program paths. In our approach concurrently executed threads are generated that represent alternative program paths. Each thread is the result of a speculation on the outcome of one or more branches. All threads are simultaneously executed although only one of th...

Many frequent itemset discovery algorithms have been proposed in the area of data mining research. The algorithms exhibit significant computational complexity, resulting in long processing times. Their performance is also dependent on source data characteristics. We argue that users should not be responsible for choosing the most efficient algorithm to solve a particular data mining problem. In...

This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...