Processing information in working memory requires selective access to a subset of working-memory contents by a focus of attention. Complex cognition often requires joint access to 2 items in working memory. How does the focus select 2 items? Two experiments with an arithmetic task and 1 with a spatial task investigate time demands for successive operations that involve 2 digits or 2 spatial pos...

As computers increase in speed, the proportion of time spent on communication between cache and hard drive or between multiple processors continues to rise. For single processors, data must be moved between the processor’s fast-access cache and main memory, an operation that often takes many orders of magnitude longer than any arithmetic operation. When multiple levels of cache are present, a c...

This paper first improves Chen and Hsieh’s definition of generalized fuzzy numbers, which makes it the generalization of definition of fuzzy numbers. Secondly, in terms of the generalized fuzzy numbers set, we introduce two different kinds of orders and arithmetic operations and metrics based on the λ-cutting sets or generalized λ-cutting sets, so that the generalized fuzzy numbers are integrat...

Mix-nets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving combinatorial problems where constraints depend on secrets of different participants. A main contribution of this paper is to show how participants in the mix-net can provide Zero-Knowledge proofs to convince each other that they do not tamper with the shuffled secrets, and t...

We consider computation trees (CTs) with operations $S \subset {+,-, *, DIV, DIV_c}$, where $DIV$ denotes integer division and $DIV_c$ integer division by constants. We characterize the families of languages $L \subset N$ that can be recognized over ${+,-, DIV_c}$ and ${+,-, *, DIV}$, resp. and show that they are identical. Furthermore, we prove lower bounds for CT's with operations ${+,-, DIV_...

During the development of floating-point signal processing systems, an efficient error analysis method is needed to guarantee the output quality. We present a novel approach to floating-point error bound analysis based on affine arithmetic. The proposed method not only provides a tighter bound than the conventional approach, but also is applicable to any arithmetic operation. The error estimati...

Randomized algorithms have an additional primitive operation that deterministic algorithms do not have. We can select a number from a range [1 . . .x] uniformly at random, at a cost assumed to be linearly dependent on the size of x in binary representation. The algorithm then makes a decision based on the outcome of this random selection. We first look at some defining characteristics of random...

Following the deregulation of electric power utilities around the globe, it has been widely acknowledged that quantifying the power transfer capability is of increasing importance in the operation and planning of interconnected power systems. This paper reports on the application of probabilistic distribution based interval arithmetic method to estimate the Available Transfer Capability (ATC) i...

the concept of geometric-arithmetic indices (ga) was put forward in chemical graph theoryvery recently. in spite of this, several works have already appeared dealing with these indices.in this paper we present lower and upper bounds on the second geometric-arithmetic index(ga2) and characterize the extremal graphs. moreover, we establish nordhaus-gaddum-typeresults for ga2.