We prove that any partition of an n-dimensional discrete box into nontrivial sub-boxes must consist of at least 2 sub-boxes, and consider some extensions of this theorem.

Extra items added to a list cause memory for the other items to decrease (the list-length effect). In one of the present studies we show that strengthening (or weakening) some items on a list harms (helps) free recall of the remaining list items. This is termed the list-strength effect. However, in seven recognition studies the list-strength effect was either absent or negative. This held wheth...

We discuss an efficient hardware implementation of the Rijndael S-box.

In this paper, we present several new constructions of differentially 4-uniform permutations over F22m by modifying the values of the inverse function on some subsets of F22m . The resulted differentially 4-uniform permutations have high nonlinearities and algebraic degrees, which provide more choices for the design of crytographic substitution boxes.

We show that every R–diagonal operator x has a continuous family of invariant subspaces relative to the von Neumann algebra generated by x. This allows us to find the Brown measure of x and to find a new conceptual proof that Voiculescu’s S–transform is multiplicative. Our considerations base on a new concept of R–diagonality with amalgamation, for which we give several equivalent characterizat...

This paper investigates the S -transform on the space of tempered Boehmians. Inversion and properties are also discussed.

Strength independence refers to the assumption that in a retrieval-induced forgetting paradigm, the increase in performance for the practiced items (RP+) is independent of the decrease for the related and supposedly inhibited items (RP-). One way in which this assumption has been tested is by examining the correlation over subjects between these two measures. The finding that there is no such c...