The number of applications requiring high speed symbolic computation and the performance reqmrements of these projects are both rapidly increasing. However, the computer science commumty's ability to produce high performance urnprocessor hardware is being outstripped by these needs. Therefore, we propose a unique multiprocessing solution to the high speed, symbolic computation problem. Our approach is to develop a llansparent runtime mechanism for executing standard, sequential Lisp code on a multiprocessor computer. ParaTran, as we call our system, is based on the concept of atomic transactions as developed for use in distributed database systems, programming languages, and operating systems. It u 'ttlizes an optimistic scheduling algorithm for processing transactions in order to maximize the available parallelism. In this way, we believe that we can create a system which is both easy to use and yields exceptional performance.

especially in the nested NEMO. In order to solve these problems, we propose a simple route optimization scheme for NEMO and nested NEMO. In the proposed scheme, a correspondent node (CN) maintains network prefix binding information of intermediate MRs to obtain optimal path to the mobile network node (MNN

Abstract. In this paper, we present a connectionist approach for de-tecting and precisely localizing transparent logos in TV programs. Our system automatically synthesizes simple problem-specific feature extrac-tors from a training set of logo images, without making any assumptions or using any

Abstract—This paper presents a transparent multi-level routing scheme, named MORHE, that improves the scalability of the OLSR protocol by exploiting the heterogeneous nature of nodes in the network. While ad hoc networks have been an active research topic over the past few years, the majority

this paper, we propose a transparent object group reference management scheme despite dynamic membership changes. An object group reference, called a group IOR, in the proposed scheme includes a group name, a host name and primary's object key. This allows a client's ORB to make a request

is tested with March C, time complexity of the transparent word-oriented test transformed by the proposed scheme is only about 56 % or 19 % time complexity of the transparent word-oriented test converted by the scheme reported in [12] or [13], respectively.

. Delegation of rights is a common practice in the real world. Proxy signature schemes have been invented to delegate signing capability efficiently and transparently. In this paper, we present a new nonrepudiable proxy signature scheme. Nonrepudiation means the signature signers, both original

Software components are modular and can enable post-deployment update, but their high overhead in runtime and memory is prohibitive for many embedded systems. This paper proposes to minimize such overhead by exploiting behavioral transparency in models of computation. In such a model (e

We propose a scheme for quantum nondemolition measurement of photon holes based on electromagnetically induced transparency, which allows direct nondestructive detection of the photon holes. We analyze a scheme based on interaction of a photon hole signal and a coherent probe field with a three

of the proposed placement schemes is evaluated with a set of carefully designed simulation experiments over a wide range of system parameters. The results give us several helpful intuitions in deploying transparent replication proxies in a practical system.