Euclid’s method for finding the greatest common divisor (GCD) of two integers was first described around the year 300 B.C. This simple iterative method is often regarded as the grandfather of all algorithms in Number Theory today. Many advances have been made since then—for example, Berlekamp’s algorithm for multiplicative inverse and Montgomery’s technique for modular multiplication. These bin...

This paper describes the design and implementation of the PEVM, a new scalable, high-performance implementation of orthogonal persistence for the JavaTM platform (OPJ). The PEVM is based on the Sun Microsystems Laboratories Virtual Machine for Research (ResearchVM), which features an optimizing Just-In-Time compiler, exact generational garbage collection, and fast thread synchronization. It als...

a r t i c l e i n f o Trademarks protecting the brand name and associations are crucial in a brand's strategy, but little is known about the factors that determine a trademark's prolongation. To explain the prolongation of trademarks, the research estimated a multilevel hazard model accounting for trademark characteristics, firm's characteristics, and firm's country of origin national culture. ...

The Java 2 Platform, Enterprise Edition (J2EE) is established as the standard platform for hosting enterprise applications written in the Java programming language. Similar to an operating system, a J2EE server can host multiple applications, but this is rarely seen in practice due to limitations on scalability, weak inter-application isolation and inadequate resource management facilities in t...

This paper describes how a network can continue to function in the presence of Byzantine failures. A Byzantine failure is one in which a node, instead of halting (as it would in a fail-stop failure), continues to operate, but incorrectly. It might lie about routing information, perform the routing algorithm itself flawlessly, but then fail to forward some class of packets correctly, or flood th...

We implemented orthogonal persistence for the Java platform by adding persistent object caching to a high-performance virtual machine that uses exact garbage collection, the Sun Microsystems Laboratories Virtual Machine for Research (‘‘ResearchVM’’).1 This paper gives an overview of our design for the read and write barriers needed to support persistence. The key design decision we made was the...

A new deformed trademark retrieval method based on two-dimensional pseudo-hidden Markov model (2D PHMM) is proposed in this paper. Most trademark retrieval systems focus on color features, shape silhouettes, or the combination of color and shape. However, these approaches adopted individual silhouettes as shape features, leading to the following two crucial problems. First, most trademarks have...

www.xilinx.com 1 1-800-255-7778 © 2003 Xilinx, Inc. All rights reserved. All Xilinx trademarks, registered trademarks, patents, and further disclaimers are as listed at http://www.xilinx.com/legal.htm. All other trademarks and registered trademarks are the property of their respective owners. All specifications are subject to change without notice. NOTICE OF DISCLAIMER: Xilinx is providing this...

or utilised in any form or by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying and recording, or in any information storage or retrieval system, without permission in writing from the publishers. Trademark notice : Product or corporate names may be trademarks or registered trademarks, and are used only for identifi cation and explanation withou...