We present PERT, a power-efficient scheme to deliver real-time data packets in sensor networks. Time-sensitive sensor data is common in applications such as hazard monitoring systems, traffic control systems and battlefield command systems. Such data are associated with end-to-end deadlines, within which they must reach the base station. We make two contributions in this work. First, we propose...

Exocrine pancreatic insufficiency (EPI), an important cause of maldigestion and malabsorption, results from primary pancreatic diseases or secondarily impaired exocrine pancreatic function. Besides cystic fibrosis and chronic pancreatitis, the most common etiologies of EPI, other causes of EPI include unresectable pancreatic cancer, metabolic diseases (diabetes); impaired hormonal stimulation o...

Executive Summary The importance of proper management of projects has not gone unrecognized in industry and academia. Consequently, tools like the Critical Path Method (CPM) and the Program Evaluation Review Technique (PERT) for project planning have been the focus of attention of both practitioners and researchers. Determination of the T ime to C omplete the J ob (TCJ) in PERT networks is impo...

Pancreatic exocrine insufficiency (PEI) frequently occurs secondary to exocrine pancreatic disease (e.g. chronic pancreatitis, cystic fibrosis, cancer) or pancreatic/gastrointestinal surgery, resulting in the maldigestion of nutrients and consequently malnutrition. Pancreatic enzyme replacement therapy (PERT) is the cornerstone of PEI management. Despite its clinical relevance, the diagnosis of...

The problem of computing performability probabilities in stochastic PERT and ow networks is studied when the network is \minimally designed" to withstand any two component failures. Polynomial-time algorithms to compute performability when the network is planar| the nonplanar versions being NP-hard | solve related \two-path subset" problems. Given an acyclic graph with weights on the arcs, the ...

Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. This paper gives an O(n2"5) algorithm for minimizing node reductions, based on vertex cover in a transitive auxiliary graph. App...