We present modular reduction algorithms over finite fields of large characteristic that allow the use of redundant modular arithmetic. This technique provides constant time reduction algorithms. Moreover, it can also be used to strengthen the differential side-channel resistance of asymmetric cryptosystems. We propose modifications to the classic Montgomery and Barrett reduction algorithms in o...

This paper describes the design of the 56-bit signifcand adder for the Advanced Micro Devices Am290.501 microprocessor. This is a 1 pm design rule CMOS realization of a high performance RISC microprocessor that implements IEEE Standard 754 floating point arithmetic. To achieve an add time of under 4 ns for the 56-bit significand and to avoid multistage pipelines which signijlcantly impair compi...

We discuss models that can account for today’s dark energy. The underlying cosmological constant may be Planck scale but starts as a redundant coupling which can be eliminated by a field redefinition. The observed vacuum energy arises when the redundancy is explicitly broken, say by a non-minimal coupling to curvature. We give a recipe for constructing models, including R + 1/R type models, tha...

being solved to determine the corresponding required joint values, 8(t;). A kinematically redundant manipulator can, in general, satisfy an end-effector positioning constraint, x(t;), with an infinite family of joint values satisfying (2). The underlying premise for advocating the use of redundant manipulators for critical applications is that if a joint should fail, then the redundancy of the ...

Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-based answer set solvers. On the other hand, they can be used by conventional answer set solvers for finding unfounded sets of atoms. Unfortunately, the number of loops is exponential in the worst case. We demonstrate tha...

When stimuli differed on two dimensions (size and brightness), either of which could furnish sufficient information for a correct response, reaction times were faster than when stimuli differed on only one dimension. This result holds true even when individual differences in dimension preferences are taken into account. A model of parallel processing of the different dimensions is proposed and ...

This paper is concerned with the problem of removing, from a given logic program, redundant arguments. These are arguments which can be removed without affecting correctness. Most program specialisation techniques, even through they perform argument filtering and redundant clause removal, fail to remove a substantial number of redundant arguments, yielding in some cases rather inefficient resid...

. . . a. O...O~...*..I.~..rrlr.r.,..........~.~~~~~~b~...~.~~~*.~*.~~*~~~*.~.~~~~~~.~~8~b#~~*M~906~*~ “Hyper-redundant” manipulators have a very large number of actuatable degrees of freedom. The benefits of hyper-redundant robots include the ability to avaoid obstacles, increased robustness with respect to mechanical failure, and the ability to perform new forms of robot locomotion and graspin...

In multiprocessor systems with weakly consistent shared memory, memory fence (also know as barrier) instructions are necessary to establish memory consistency at synchronization points in a parallel program. Programs that follow an acquire-release synchronization protocol (e.g., Java) make frequent use of such fence instructions and hence the thrifty use and efficient implementation of such ins...