This paper presents a new in-place pseudo linear radix sorting algorithm. The proposed algorithm, called MSL (Map Shuffle Loop) is an improvement over ARL (Maus, 2002). The ARL algorithm uses an in-place permutation loop of linear complexity in terms of input size. MSL uses a faster permutation loop searching for the next element to permute group by group, instead of element by element. The alg...

This study analyzes walking interaction to enhance the immersion and minimize virtual reality (VR) sickness of users by conducting experiments. In this study, the walking interaction is composed of three steps using input devices with a simple structure that can be easily used by anyone. The first step consists of a gamepad control method, which is the most popular but has low presence. The sec...

In-place associative integer sorting technique was proposed for integer lists which requires only constant amount of additional memory replacing bucket sort, distribution counting sort and address calculation sort family of algorithms. The technique was explained by the analogy with the three main stages in the formation and retrieval of memory in cognitive neuroscience which are (i) practicing...

This paper introduces a SIMD vectorization for FFTW—the “fastest Fourier transform in the west” by Matteo Frigo and Steven Johnson. The new method leads to an architecture independent short vector SIMD FFT vectorization that utilizes the architecture adaptivity of FFTW. It is based on special FFT kernels (up to size 64 and more) that are utilized by FFTW to compute the whole transform. This vec...

Individual robots are not effective at exploring large unmapped areas. An alternate approach is to use a swarm of simple robots that work together, rather than a single highly capable robot. The central-place foraging algorithm (CPFA) is effective for coordinating robot swarm search and collection tasks. Robots start at a centrally placed location (nest), explore potential targets in the area w...

When assessing student essays, educators look for the students’ ability to present and pursue well-reasoned and strong arguments. Such scholarly argumentation is often articulated by rhetorical metadiscourse. Educators will be necessarily examining metadiscourse in students’ writing as signals of the intellectual moves that make their reasoning visible. Therefore students and educators could be...

A novel integer sorting technique was proposed replacing bucket sort, distribution counting sort and address calculation sort family of algorithms which requires only constant amount of additional memory. The technique was inspired from one of the ordinal theories of “serial order in behavior” and explained by the analogy with the three main stages in the formation and retrieval of memory in co...

The theoretical study of the relational model of data is ongoing and highly developed. Yet the vast majority of real databases include incomplete data, and the incomplete data is widely modelled using special values called nulls. As noted many times by Date and others, the inclusion of special values is not compatible with the relational model and invalidates many of the theoretical results. In...

This paper deals with a declarative interface for VHDL in general and the use of such an interface for OBDD based verification of VHDL gate level designs in particular. It presents a solution that enables OBDD verification without external manipulation of the netlist which is well integrated into the standard VHDL environment. The information required for OBDD based VHDL verification, existing ...

We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant of Balaban’s algorithm and, in the worst case, runs in O(n log2 n+ k) time using O(1) extra words of memory in addition to the space used for the input to the algorithm. © 2006 Elsevier B.V. All rights reserved.