Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
14,831
result(s) for
"Cube."
Sort by:
The Soma puzzle book : a new approach to the classic pieces
\"A new twist on a popular puzzle cube! Invented by Piet Hein, the Soma cube is one of the most famous mechanical puzzles in the world. The traditional challenge and outcome is to build a cube or other structures from all seven pieces. Change the rules, change the outcome! The puzzles in this unique Soma-inspired collection are no longer predicated upon using all seven pieces at one time! By varying the number of pieces, there are many new and versatile puzzle challenges, from all types of recreational mathematics fields\"-- Provided by publisher.
Book
Erno Rubik and his magic cube
\"This first picture book biography of Erno Rubik, creator of the Rubik's Cube, reveals the obsession, imagination, and engineering process behind the creation of a bestselling puzzle that will celebrate its 50th anniversary in 2024\"-- Provided by publisher.
CHILDBOOK
On the Construction of Pandiagonal Magic Cubes
This paper investigates the construction method of pandiagonal magic cube. First, we define a pandiagonal Latin cube. According to this definition, the cube can be constructed by simple methods. After designing a set of orthogonal pandiagonal Latin cubes, the corresponding order pandiagonal magic cube can be constructed. In addition, we give the algebraic conditions of the universal diagonal Latin cube orthogonality and the strict theoretical proof. Based on the proposed method, it can be shown that at least 6(n!)3 pandiagonal magic cubes of order n is formed through a pandiagonal Latin cube. Moreover, our method is easy to implement by computer program.
Journal Article
Achieving the Full Vision of Earth Observation Data Cubes
Earth observation imagery have traditionally been expensive, difficult to find and access, and required specialized skills and software to transform imagery into actionable information. This has limited adoption by the broader science community. Changes in cost of imagery and changes in computing technology over the last decade have enabled a new approach for how to organize, analyze, and share Earth observation imagery, broadly referred to as a data cube. The vision and promise of image data cubes is to lower these hurdles and expand the user community by making analysis ready data readily accessible and providing modern approaches to more easily analyze and visualize the data, empowering a larger community of users to improve their knowledge of place and make better informed decisions. Image data cubes are large collections of temporal, multivariate datasets typically consisting of analysis ready multispectral Earth observation data. Several flavors and variations of data cubes have emerged. To simplify access for end users we developed a flexible approach supporting multiple data cube styles, referencing images in their existing structure and storage location, enabling fast access, visualization, and analysis from a wide variety of web and desktop applications. We provide here an overview of that approach and three case studies.
Journal Article
Horadam–Lucas Cubes
In this paper, we introduce a novel class of graphs referred to as the Horadam–Lucas cubes. This class extends the concept of Lucas cubes and retains numerous desirable properties associated with them. Horadam–Lucas cubes can also be viewed as a companion graph family of the Horadam cubes, in a similar way the Lucas cubes relate to Fibonacci cubes or the Lucas-run graphs relate to Fibonacci-run graphs. As special cases, they also give rise to new graph families, such as Pell–Lucas cubes and Jacobsthal–Lucas cubes. We derive the several metric and enumerative properties of these cubes, including their diameter, periphery, radius, fundamental decomposition, number of edges, cube polynomials, and generating function of the cube polynomials.
Journal Article
On the Cube Polynomials of Padovan and Lucas–Padovan Cubes
The hypercube is one of the best models for the network topology of a distributed system. Recently, Padovan cubes and Lucas–Padovan cubes have been introduced as new interconnection topologies. Despite their asymmetric and relatively sparse interconnections, the Padovan and Lucas–Padovan cubes are shown to possess attractive recurrent structures. In this paper, we determine the cube polynomial of Padovan cubes and Lucas–Padovan 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 Padovan numbers and Lucas–Padovan numbers. In particular, the coefficients of the cube polynomials represent the number of hypercubes, a symmetry inherent in Padovan and Lucas–Padovan cubes. Therefore, cube polynomials are very important for characterizing these cubes.
Journal Article
A Secure Peer-to-Peer Image Sharing Using Rubik’s Cube Algorithm and Key Distribution Centre
In this work, we build upon an implementation of a peer-to-peer image encryption algorithm: “Rubik’s cube algorithm”. The algorithm utilizes pixel-level scrambling and XOR-based diffusion, facilitated through the symmetric key. Empirical analysis has proven this algorithm to have the advantage of large key space, high-level security, high obscurity level, and high speed, aiding in secure image transmission over insecure channels. However, the base approach has drawbacks of key generation being handled client-side (at nodes) and the process is time-consuming due to dynamically generating keys. Our work solves these issues by introducing a Key Distribution Center (KDC) to distribute symmetric keys for transmission, increasing confidentiality, and reducing key-generation overhead on nodes. Three approaches utilizing the KDC are presented, communicating the dimensions with KDC to generate keys, standardizing any image to fixed dimensions to standardize key-generation, and lastly, using a single session key which is cyclically iterated over, emulating different dimensions.
Journal Article
Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication
If a set of spanning trees of a graph do not share any edge with each other, they are called edge-disjoint spanning trees (for short EDSTs), which have widespread practical applications, such as fault-tolerant broadcasting, the distributed algorithms against Man-in-the-Middle attacks, the efficient collective communication algorithms, and so on. Crossed cubes, folded cubes, and folded crossed cubes, as three important variations of hypercubes, are optimized in terms of communication efficiency and fault tolerance of networks. In this paper, we propose a recursive algorithm to construct the maximum number of EDSTs in the three kinds of cube-based networks. Additionally, relying on the resulting EDSTs, the performance of one-to-one communication and one-to-all communication with edge failures are evaluated by simulation results in folded crossed cubes.
Journal Article
Design of the CUBES beamline @ Elettra 2.0
The new CUBES (Charles University Beamline for Electron Spectroscopy) beamline will be installed at Elettra 2.0 and will substitute the existing Material Science beamline. The energy range spans from 20 to 1500 eV (with a possible extension to 1800-2000 eV). The FWHM bandwidth is 100 meV in the range 20 eV - 200 eV. From 200 eV to 1500 eV the FWHM bandwidth gradually increases to 500 meV. Depending on the selected energy, the spot size on the sample varies from 0.2 mm to <1 mm. The optical design of CUBES is described in this paper.
Journal Article