Analysts often explore data cubes to identify anomalous regions that may represent problem areas or new opportunities. Discovery-driven exploration (proposed by S.Sarawagi et al. [5]) automatically detects and marks the exceptions for the user and reduces the reliance on manual discovery. However, when the data is large, it is hard to materialize the whole cube due to the limitation of both spa...

We present the generalized space-time cube, a descriptive model for visualizations of temporal data. Visualizations are described as operations on the cube, which transform the cube’s 3D shape into readable 2D visualizations. Operations include: extracting subparts of the cube, flattening it across space or time, or transforming the cube’s geometry and content. We introduce a taxonomy of elemen...

In this study some algebraic transformations on hypercube system are proposed. The presented transformations of forbidden subcubes provide defining set of all maximal and nonfaulty subcubes, and subset of minimal and nonfaulty subcubes included certain given vertices. It provides formal and simple findingsof all the current sources and targets of information, and also the pathways between them....

This article aims to present dynamic cube attack on Grain-v1. Dynamic cube attack finds the secret key by using distinguishers gained from structural weakness. The main idea of dynamic cube attack lies in simplifying the output function. After making it simpler, dynamic cube attack will be able to exploit distinguishing attack for recovering the secret key. In this paper, we investigate Grain-v...

Text retrieval, Analysis, Mining and Knowledge management have gained a lot of importance in a time when we drown in information but are starved for knowledge. In this paper, we propose a novel Index that uses a Text Cube model to store the text information similar to a data cube in Data Mining. This model creates a direct index, next word index and inverted index in a single Cube Index which i...

In this paper we have classified the nodes of OTIS-cube based on their eccentricities. OTIS (optical transpose interconnection system) is a large scale optoelectronic computer architecture, proposed in [1], that benefit from both optical and electronic technologies. We show that radius and diameter of OTIS-Qn is n + 1 and 2n + 1 respectively. We also show that average eccentricity of OTIS-cube ...

The logarithmic Sobolev inequality [9] for the Hamming cube {0, 1} states that for any real-valued function f on the cube holds

We present a new full cube computation technique and a cube storage representation approach, called the multidimensional cyclic graph (MCG) approach. The data cube relational operator has exponential complexity and therefore its materialization involves both a huge amount of memory and a substantial amount of time. Reducing the size of data cubes, without a loss of generality, thus becomes a fu...

A Lucas cube 3^ can be defined as the graph whose vertices are the binary strings of length n without either two consecutive l's or a 1 in the first and in the last position, and in which the vertices are adjacent when their Hamming distance is exactly 1. A Lucas cube 5E„ is very similar to the Fibonacci cube Tn which is the graph defined as 2J, except for the fact that the vertices are binary ...

When can a polyomino piece of paper be folded into unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for one or several to fold cube, and under which cube folding is impossible. In particular, we show that all five special “basic” guarantee foldability.