In 1974, the Hungarian architect Ernö Rubik invented the familiar 3× 3× 3 Rubik’s Cube while teaching at the School for Commercial Artists in Budapest. The cube quickly became a world phenomenon, and many different methods to restore a scrambled cube to its initial, pristine state of 6 solidcolor faces were discovered. This paper will not detail such a method; it will, however, describe the gro...

Families of non-lattice tilings of R by unit cubes are constructed. These tilings are specializations of certain families of nonlinear codes over GF( 2 ). These cube-tilings provide building blocks for the construction of cube-tilings such that no two cubes have a high-dimensional face in common. We construct cube-tilings of R such that no two cubes have a common face of dimension exceeding n −...

CUBE is a generic presentation component suitable for displaying a wide variety of performance metrics for parallel programs including MPI and OpenMP applications. Program performance space is represented in a multi-dimensional space and displayed in a single integrated view. The tool allows for exploring the performance space in a scalable fashion and browsing the different kinds of performanc...

The cube polynomial of a graph is the counting polynomial for the number of induced k-dimensional hypercubes (k ≥ 0). We determine the cube polynomial of Fibonacci cubes and Lucas cubes, as well as the generating functions for the sequences of these cubes. Several explicit formulas for the coefficients of these polynomials are obtained, in particular they can be expressed with convolved Fibonac...

Web Cube is a server side programming model for building interactive web applications. Compared to typical server side approaches used nowadays, Web Cube offers better abstraction mechanism and built-in safety. It imposes a more logical organization of its components. As a direct result of this applications become inherently secure and development is less error prone. Web Cube is based on Seuss...

Let f be a binary string and d C 1. Then the generalized Lucas cube Qd(JÐf ) is introduced as the graph obtained from the d-cube Qd by removing all vertices that have a circulation containing f as a substring. The question for which f and d, the generalized Lucas cube Qd(JÐf ) is an isometric subgraph of the d-cube Qd is solved for all binary strings of length at most five. Several isometricall...

AIM To evaluate the efficacy and efficiency of three-dimensional (3D) fast spin-echo (FSE) with variable flip angle ("CUBE") magnetic resonance imaging (MRI) in knee imaging as compared with conventional MRI. MATERIALS AND METHODS Twenty-nine patients (single knee) with joint injuries of varying degrees were enrolled in this study between January, 2011 and December, 2011. All patients underwe...

Datacubes are especially useful for answering efficiently queries on data warehouses. Nevertheless the amount of generated aggregated data is huge with respect to the initial data which is itself very large. Recent research work has addressed the issue of summarizing Datacubes in order to reduce their size. In this chapter, we present three different approaches. They propose structures which ma...

This project is a continuation of the PTAM (Parallel Tracking and Mapping for Small AR Workspaces) like approach solution [1]. Basically, it turned to be not an appropriate solution for recognizing full cube under not ideal illumination. Since the process might fail during the processing of any face out of six, it has to start from scratch, thus it will not be finished at all. On the contrary, ...

If f is a binary word and d a positive integer, then the generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all the vertices that contain f as a factor, while the generalized Lucas cube Qd( ↽Ð f ) is the graph obtained from Qd by removing all the vertices that have a circulation containing f as a factor. The Fibonacci cube Γd and the Lucas cube Λd are the grap...