We study a family of graphs related to the n-cube. The middle cube graph of parameter k is the subgraph of Q2k−1 induced by the set of vertices whose binary representation has either k − 1 or k number of ones. The middle cube graphs can be obtained from the wellknown odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theor...

Formal concept analysis (FCA) with measures can be seen as a framework for Business Intelligence technologies. In this paper we introduce new ideas about an OLAP cube. We take a focus on a highdimensional OLAP cube reduction and on a hierarchy of attributes in an OLAP cube.

In KN 95b], the Barendregt Cube was extended with-conversion. The resulting system had only a Weak form of Subject Reduction. In this paper, the Cube is extended with explicit deenitions. We show that the Cube extended with either explicit deenitions alone or with both explicit deenitions and-conversion satisses all its original properties including Subject Reduction.

We prove an inequality for functions on the discrete cube {0, 1} extending the edgeisoperimetric inequality for sets. This inequality turns out to be equivalent to the following claim about random walks on the cube: Subcubes maximize ’mean first exit time’ among all subsets of the cube of the same cardinality.

hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.

Visualization of disaster dispersion prediction enables decision makers and civilian to prepare disaster and to reduce the damage by showing the realistic simulation results. With advances of GIS technology and the theory of volcanic disaster prediction algorithm, the predicted disaster dispersions are displayed in spatial information. However, most of volcanic ash dispersion predictions are di...

Introduction Musculoskeletal MRI is commonly done with two-dimensional fast-spin-echo (2D-FSE) and multiple acquisition planes. This results in anisotropic voxels, partial volume artifact and slice gaps. Three-dimensional fast-spin-echo (3D-FSE-Cube), allows for isotropic voxel acquisition with FSE contrast, diminishing the drawbacks of 2D-FSE while reducing exam time and allowing for image ref...

Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Fast and correct analysis of such information is important in for instance geospatial and social visualization applications. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemp...

The Rubik’s Cube is perhaps the world’s most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik’s Cube also has a rich underlying algorithmic structure. Specifically, we show that the n×n×n Rubik’s Cube, as well as the n×n×1 variant, has a “God’s Number” (diameter of the configuration space) of Θ(n/ logn). ...