Utilizing experiences from the implementations on shared memory multiprocessors (SMM) and distributed memory multicomputers (DMM), general ring-oriented routines are developed for the LU, Cholesky, and QR factorizations. Since, all machine dependencies are comprised to a small set of communication routines, the same factorization routines can be used on both the SMM and DMM architectures. The a...

Diierent dynamic subgrid scale models, viz. the dynamic model of Germano et al. are evaluated by means of a priori tests. Direct numerical simulation data for fully-developed turbulent and transitional incompressible ows are used. Low correlation is obtained between exact and modeled subgrid scale stresses with the DSM. Conversely, good agreement is found for both the DMM and the DTM, since tho...

In this paper we present a unified approach for compiling programs for Distributed-Memory Multiprocessors (DMM). Parallelization of sequential programs for DMM is much more difficult to achieve than for shared memory systems due to the exclusive local memory of each Virtual Processor (VP). The approach presented distributes computations among VPs of the system and maps data onto their private m...

Handling uncertain events that could happen anytime and anywhere and dealing with many complex systems interconnected physically and socially makes Disaster Management (DM) a multidisciplinary endeavor and a very difficult domain to model. In this paper we present a development and validation of a Disaster Management Metamodel (DMM), a language that we develop specific for describing DM domain....

In packet networks, a reliable scheme to handle packet loss during speech transmission is of great importance. As a common representation of the linear predictive coding (LPC) model, the line spectral frequency (LSF) parameters are widely used in speech quantization and transmission. In this paper, we propose a novel scheme to estimate the missing values occurring during LPC model transmission....

Problem statement for distributed and dynamic mobility management draft-chan-distributed-mobility-ps-04 Abstract The traditional hierarchical structure of cellular networks has led to deployment models which are heavily centralized. Mobility management with centralized mobility anchoring in existing hierarchical mobile networks is quite prone to suboptimal routing and issues related to scalabil...

This draft proposes a distributed architecture of mobility management in terms of abstracted logical functions. Mobility management functions are abstracted into different logical functions: (1) allocation of home network prefixes or home addresses to mobile nodes; (2) location management which includes managing the IP addresses and locations of the mobile nodes; and (3) mobility routing which ...

We survey shared memory simulations on distributed memory machines (DMMs), that use universal hashing to distribute the shared memory cells over the memory modules of the DMM. We measure their quality in terms of delay, time-processor eeciency, memory contention (how many requests have to be satissed by one memory module per simulated step) and simplicity. Further we take into consideration dii...

Mitochondrial malic enzyme 2 (ME2) catalyzes the oxidative decarboxylation of malate to yield CO2 and pyruvate, with concomitant reduction of dinucleotide cofactor NAD(+) or NADP(+). We find that ME2 is highly expressed in many solid tumors. In the A549 non-small cell lung cancer (NSCLC) cell line, ME2 depletion inhibits cell proliferation and induces cell death and differentiation, accompanied...

A new approach for landmark recognition based on the perception, reasoning, action, and expectation (PREACTE) paradigm is presented for the navigation of autonomous mobile robots. PREACTE uses expectations to predict the appearance and disappearance of objects, thereby reducing computational complexity and locational uncertainty. It uses an innovative concept called dynamic model matching (DMM)...