In this paper we present an efficient data fetch circuitry to retrieve several operands from a n-way parallel memory system in a single machine cycle. The proposed address generation unit operates with an improved version of the low-order parallel memory access approach. Our design supports data structures of arbitrary lengths and different odd strides. The experimental results show that our ad...

A new evolutionary technique for evolving mathematical expressions called Mathematical Expressions Evolver (MEXE) is proposed in this paper. Each MEXE chromosome is a string of operands and operators. Each subexpressions encoded in a chromosome is considered a potential solution of the problem. The best of these expressions is chosen to represent the chromosome. In this way variable length expr...

Programming-by-demonstration (PBD) systems learn tasks by watching the user perform them. CIMA1 is an interactive learning system for modeling the data selected and modified by a user as he or she undertakes a task. Part of a PBD system, CIMA is invoked when user actions are matched to find a common description of their “operands.” Although the system’s interfaces to users and applications are ...

An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this paper. The winning strategy is computed by using the Multi Expression Programming (MEP) technique a fast and efficient variant of the Genetic Programming (GP). Each play strategy is represented by a mathematical expression that contains mathematical operators (such as +, -, *, mod, div, and , or, ...

Modular exponentiation is a cornerstone operation to several public-key cryptography systems such as the RSA. It is performed using successive modular multiplications. The latter is time consuming for large operands. Accelerating public-key cryptography software or hardware needs reducing the total number of modular multiplication needed. This paper introduces a novel idea based on genetic algo...

A new boundary evaluation method is presented. It is based on error-free Boolean operations on polyhedral solids. W e describe, in detail, an intersection algorithm that handles, in a straightforward way, all the possible geometric cases. We also describe a general data structure that allows an unified storage of solid boundaries. The intersection algorithm always runs to completion, producing ...

In typical VLSI and processor based architectures, the computational units have fixed precision which can not be modified during computation. The precision of operands implemented in such architectures is based on the worst case bounds for the precision of the input values. Some applications also need precision much higher than that available in typical hardware architectures [3]. For such long...

SequenceL is a concise, high-level language with a simple semantic that provides for the automatic derivation of many iterative and parallel control structures. The semantic repeatedly applies a “NormalizeTranspose” operation to functions and operators until base cases are discovered, which include the grounding of variables and the application of built-in operators to operands of appropriate t...

This article deals with the fixed-point computation of the sum-of-products, necessary for the implementation of several algorithms, including linear filters. Fixed-point arithmetic implies output errors to be controlled. So, a new method is proposed to perform accurate computation of the filter and minimize the word-lengths of the operations. This is done by removing bits from operands that don...

Stimuli flashed briefly around the time of saccadic eye movements are subject to complex distortions: compression of space and time; underestimate of numerosity. Here we show that saccadic distortions extend to abstract quantities, affecting the representation of symbolic numerical magnitude. Subjects consistently underestimated the results of rapidly computed mental additions and subtractions,...