This paper introduces and analyzes an algorithm to compile a series of exclusive-or operations. The compiled series is quite efficient, almost always beating the so-called “Four Russians” approach, and uses no temporary storage beyond its outputs. The algorithm is reasonably fast and surprisingly simple.

In this paper, we present improved related-key attacks on the original DESX, and DESX+, a variant of the DESX with its preand post-whitening XOR operations replaced with addition modulo 2. Compared to previous results, our attack on DESX has reduced text complexity, while our best attack on DESX+ eliminates the memory requirements at the same processing complexity.

in a large scale cyclic storage system ,as the number of rule parameters and/or number of operating period increase, general purpose gradient-based nlp solvers and/or genetic algorithms may loose their merits in finding optimally feasible solution to the problem. in these cases hybrid ga which decomposes the main problem into two manageable sub-problems with an iterative scheme between ga and l...

this paper examines the historical development of operations research (or) and represents different or methods (methodologies) developed during its lifetime. then, considering thomas kuhn’s paradigm model of scientific development as a basis for our work, the former and current status of or are analyzed and the future trend is discussed.

We describe the WordsEye Linguistics tool (WELT), a novel tool for the documentation and preservation of endangered languages. WELT is based on WordsEye (Coyne and Sproat, 2001), a text-toscene tool that automatically generates 3D scenes from written input. WELT has two modes of operation. In the first mode, English input automatically generates a picture which can be used to elicit a descripti...