A complete data cube is a data cube in which every aggregate value in the multidimensional space is stored or can be computed. An incomplete data cube is a data cube in which points in the multidimensional space are missing and cannot be computed. This paper describes an incomplete data cube design. An incomplete data cube is modeled as a federation of cubettes. A cubette is a complete sub-cube...

Abstract. Visualization and spatial relations (mental rotation) are two important factors of thinking. refers to complex visual-spatial transformations, whereas refer simple mental rotation visualized objects. Conventional tests, however, have been found be highly correlated with visualization tests because solving items through might involve ability due the complexity visual materials these te...

This note analyzes the security of Kravatte against the cube attack. We provide an analysis result which recovers the master key of the current version of full Kravatte with data and time complexities 2136.01, and negligible memory. The same could be applied to the first version of Kravatte with complexities of 238.04, which could be carried out in practice. These results are possible thanks to...

The main purpose of this paper is to popularize Danzer’s power complex construction and establish some new results about covering maps between two power complexes. Power complexes are cube-like combinatorial structures that share many structural properties with higher-dimensional cubes and cubical tessellations on manifolds. Power complexes that are also abstract polytopes have repeatedly appea...

Since Keccak was selected as SHA-3 hash function by NIST, it has attracted considerable attention from cryptographic researchers. Keccak sponge function [1] has also been used to design message authentication codes (MAC) and authenticated encryption (AE) scheme Keyak. Till now, the most efficient key recovery attacks on Keccak-MAC and Keyak are cube attacks and cube-attack-like cryptanalysis pr...

A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous values for each dimension. One of the approaches to process such queries is to precompute a prefix cube (PC), which is a cube of the same dimensionality and size as the original data cube, but with some pre-computed resul...

The dual-cube is a newly proposed topology for interconnection networks, which uses low dimensional hypercubes as building blocks. The primary advantages of the dual-cube over the hypercube are that, with the same node degree n, the dual-cube contains 2 1 times more nodes than the hypercube and, with the same amount of nodes, the dual-cube has approximately 50% less links than the hypercube. Th...