d-cube decompositions of K-n/K-m

Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m.

La prévisibilité à long terme des rendements des actifs financiers: leur dépendance significative du carré et du cube du ratio dividende-prix.

Rapport de recherche

eHandbook cube logo source files

The source files and full sized renders of the main eHandbook 'cube' (both Photoshop and .png format). Created by David Davies and Dr Matt Jones.

Proyecto cube : una introducción a la geometría tridimensional.

Se presenta el proyecto CUBE, propuesta de trabajo donde se desarrolla una serie de actividades de introducción a la geometría analítica. El proyecto se divide en 2 partes; una relativa al guión de la película y otra derivada dirigida al desarrollo del currículo de cuarto de ESO en Geometría.

Minimum neighborhood in a generalized cube

Generalized cubes are a subclass of hypercube-like networks, which include some hypercube variants as special cases. Let theta(G)(k) denote the minimum number of nodes adjacent to a set of k vertices of a graph G. In this paper, we prove theta(G)(k) >= -1/2k(2) + (2n - 3/2)k - (n(2) - 2) for each n-dimensional generalized cube and each integer k satisfying n + 2 <= k <= 2n. Our result is an extension of a result presented by Fan and Lin [J. Fan, X. Lin, The t/k-diagnosability of the BC graphs, IEEE Trans. Comput. 54 (2) (2005) 176-184]. (c) 2005 Elsevier B.V. All rights reserved.

A comparison-based diagnosis algorithm tailored for crossed cube multiprocessor systems

Comparison-based diagnosis is an effective approach to system-level fault diagnosis. Under the Maeng-Malek comparison model (NM* model), Sengupta and Dahbura proposed an O(N-5) diagnosis algorithm for general diagnosable systems with N nodes. Thanks to lower diameter and better graph embedding capability as compared with a hypercube of the same size, the crossed cube has been a promising candidate for interconnection networks. In this paper, we propose a fault diagnosis algorithm tailored for crossed cube connected multicomputer systems under the MM* model. By introducing appropriate data structures, this algorithm runs in O(Nlog(2)(2) N) time, which is linear in the size of the input. As a result, this algorithm is significantly superior to the Sengupta-Dahbura's algorithm when applied to crossed cube systems. (C) 2004 Elsevier B.V. All rights reserved.

Diamond mining, rice farming, and a ‘Maggi cube’: a viable survivial strategy in rural Liberia?

Since the conclusion of its 14-year civil war in 2003, Liberia has struggled economically. Jobs are in short supply and operational infrastructural services, such as electricity and running water, are virtually nonexistent. The situation has proved especially challenging for the scores of people who fled the country in the 1990s to escape the violence and who have since returned to re-enter their lives. With few economic prospects on hand, many have elected to enter the artisanal diamond mining sector, which has earned notoriety for perpetuating the country's civil war. This article critically reflects on the fate of these Liberians, many of whom, because of a lack of government support, finances, manpower and technological resources, have forged deals with hired labourers to work artisanal diamond fields. Specifically, in exchange for meals containing locally grown rice and a Maggi (soup) cube, hired hands mine diamondiferous territories, splitting the revenues accrued from the sales of recovered stones amongst themselves and the individual ‘claimholder’ who hired them. Although this cycle—referred to here as ‘diamond mining, rice farming and a Maggi cube’—helps to buffer against poverty, few of the parties involved will ever progress beyond a subsistence level

Structural refinement and photoluminescence properties of irregular cube-like (Ca-1_Cu-x(x))TiO3 microcrystals synthesized by the microwave-hydrothermal method

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Structural refinement and photoluminescence properties of cube-like (Ca 1-xCu x)TiO 3 crystals synthesized by the microwave-hydrothermal method

In this work, (Ca 1-xCu x)TiO 3 crystals with (x = 0, 0.01 and 0.02), labeled as CTO, CCTO1 and CCTO2, were synthesized by the microwave-hydrothermal method at 140°C for 32 min. XRD patterns (Fig. 1), Rietveld refinement and FT-Raman spectroscopy indicated that these crystals present orthorhombic structure Pbnm. Micro-Raman and XANES spectra suggested that the substitution of Ca by Cu in A-site promoted a displacement of the [TiO6]-[TiO6] clusters adjacent from its symmetric center, which leads distortions on the [CaO 12] clusters neighboring and consequently cause the strains into the CaTiO3 lattice. FE-SEM images showed that these crystals have an irregular shape as cube like probably indicating an Ostwald-ripening and self-assemble as dominant mechanisms to crystals growth. The powders presented an intense PL blue-emission.

Long-range and short-range structures of cube-like shape SrTiO3 powders: microwave-assisted hydrothermal synthesis and photocatalytic activity

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)