On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

Long time, no see? (DIY walking)

Building on the launch of an early prototype at Balance Unbalance 2013, we now offer a fully realised experience of the ‘Long Time, No See?’ site specific walking/visualisation project for conference users to engage with on a do it yourself basis, either before, during or after the event. ‘Long Time, No See?’ is a new form of participatory, environmental futures project, designed for individuals and groups. It uses a smartphone APP to guide processes of individual or group walking at any chosen location—encouraging walkers to think in radical new ways about how to best prepare for ‘stormy’ environmental futures ahead. As part of their personal journeys participants’ contribute site-specific micro narratives in the form of texts, images and sounds, captured via the APP during the loosely ‘guided’ walk. These responses are then uploaded and synthesised into an ever-building audiovisual and generative artwork/‘map’ of future-thinking affinities, viewable both online at long-time-no-see.org (in Chrome) (and at the same time on a large screen visualisations at QUT’s Cube Centre in Brisbane Australia). The artwork therefore spans both participants’ mobile devices and laptops. If desired outcomes can also be presented publicly in large screen format at the conference. ‘Long Time, No See?’ has been developed over the past two years by a team of leading Australian artists, designers, urban/environmental planners and programmers.

Electromagnetic signatures of lightning near the HF frequency band

The dissertation deals with remote narrowband measurements of the electromagnetic radiation emitted by lightning flashes. A lightning flash consists of a number of sub-processes. The return stroke, which transfers electrical charge from the thundercloud to to the ground, is electromagnetically an impulsive wideband process; that is, it emits radiation at most frequencies in the electromagnetic spectrum, but its duration is only some tens of microseconds. Before and after the return stroke, multiple sub-processes redistribute electrical charges within the thundercloud. These sub-processes can last for tens to hundreds of milliseconds, many orders of magnitude longer than the return stroke. Each sub-process causes radiation with specific time-domain characteristics, having maxima at different frequencies. Thus, if the radiation is measured at a single narrow frequency band, it is difficult to identify the sub-processes, and some sub-processes can be missed altogether. However, narrowband detectors are simple to design and miniaturize. In particular, near the High Frequency band (High Frequency, 3 MHz to 30 MHz), ordinary shortwave radios can, in principle, be used as detectors. This dissertation utilizes a prototype detector which is essentially a handheld AM radio receiver. Measurements were made in Scandinavia, and several independent data sources were used to identify lightning sub-processes, as well as the distance to each individual flash. It is shown that multiple sub-processes radiate strongly near the HF band. The return stroke usually radiates intensely, but it cannot be reliably identified from the time-domain signal alone. This means that a narrowband measurement is best used to characterize the energy of the radiation integrated over the whole flash, without attempting to identify individual processes. The dissertation analyzes the conditions under which this integrated energy can be used to estimate the distance to the flash. It is shown that flash-by-flash variations are large, but the integrated energy is very sensitive to changes in the distance, dropping as approximately the inverse cube root of the distance. Flashes can, in principle, be detected at distances of more than 100 km, but since the ground conductivity can vary, ranging accuracy drops dramatically at distances larger than 20 km. These limitations mean that individual flashes cannot be ranged accurately using a single narrowband detector, and the useful range is limited to 30 kilometers at the most. Nevertheless, simple statistical corrections are developed, which enable an accurate estimate of the distance to the closest edge of an active storm cell, as well as the approach speed. The results of the dissertation could therefore have practical applications in real-time short-range lightning detection and warning systems.

Cubic and ultimate groups of complete symmetry

It is shown that the systems of definite actions described by polar and axial tensors of the second rank and their combinations during the superposition of their elements of complete symmetry with the elements of complete symmetry of the "grey" cube, result in 11 cubic crystallographical groups of complete symmetry. There are 35 ultimate groups (i.e., the groups having the axes of symmetry of infinite order) in complete symmetry of finite figures. 14 out of these groups are ultimate groups of symmetry of polar and axial tensors of the second rank and 24 are new groups. All these 24 ultimate groups are conventional groups since they cannot be presented by certain finite figures possessing the axes of symmetry {Mathematical expression}. Geometrical interpretation for some of the groups of complete symmetry is given. The connection between complete symmetry and physical properties of the crystals (electrical, magnetic and optical) is shown.

Epitaxial growth of Co3O4 films by low temperature, low pressure chemical vapour deposition

The growth of strongly oriented or epitaxial thin films of metal oxides generally requires relatively high growth temperatures or infusion of energy to the growth surface through means such as ion bombardment. We have grown high quality epitaxial thin films of Co3O4 on different substrates at a temperature as low as 400 degreesC by low-pressure metalorganic chemical vapour deposition (MOCVD) using cobalt(II) acetylacetonate as the precursor. With oxygen as the reactant gas, polycrystalline Co3O4 films are formed on glass and Si (100) in the temperature range 400-550 degreesC. Under similar conditions of growth. highly oriented films of Co3O4 are formed on SrTiO3 (100) and LaAlO3 (100). The activation energy for the growth of polycrystalline films on glass is significantly higher than that for epitaxial growth on SrTiO3 (100). The film on LaAlO3 (100) grown at 450 degreesC shows a rocking curve FWHM of 1.61 degrees, which reduces to 1.32 degrees when it is annealed in oxygen at 725 degreesC. The film on SrTiO3 (100) has a FWHM of 0.33 degrees (as deposited) and 0.29 (after annealing at 725 degreesC). The phi -scan analysis shows cube-on-cube epitaxy on both these substrates. The quality of epitaxy on SrTiO3 (100) is comparable to the best of the perovskite-based oxide thin films grown at significantly higher temperatures. A plausible mechanism is proposed for the observed low temperature epitaxy. (C) 2001 Published by Elsevier Science B.V.

Quantum Error Correction via Codes over GF(2)

It is well known that n-length stabilizer quantum error correcting codes (QECCs) can be obtained via n-length classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 371 length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Comparative Study of Predictions of Flexural Strength of Steel Fiber Concrete

Several methods are available for predicting flexural strength of steel fiber concrete composites. In these methods, direct tensile strength, split cylinder strength, and cube strength are the basic engineering parameters that must be determined to predict the flexural strength of such composites. Various simplified forms of stress distribution are used in each method to formulate the prediction equations for flexural strength. In this paper, existing methods are reviewed and compared, and a modified empirical approach is developed to predict the flexural strength of fiber concrete composites. The direct tensile strength of the composite is used as the basic parameter in this approach. Stress distribution is established from the findings of flexural tests conducted as part of this investigation on fiber concrete prisms. A comparative study of the test values of an earlier investigation on fiber concrete slabs and the computed values from existing methods, including the one proposed, is presented.

Models for spin-state transitions in solids

The model for spin-state transitions described by Bari and Sivardiere (1972) is static and can be solved exactly even when the dynamics of the lattice are included; the dynamic model does not, however, show any phase transition. A coupling between the octahedra, on the other hand, leads to a phase transition in the dynamical two-sublattice displacement model. A coupling of the spin states to the cube of the sublattice displacement leads to a first-order phase transition. The most reasonable model appears to be a two-phonon model in which an ion-cage mode mixes the spin states, while a breathing mode couples to the spin states without mixing. This model explains the non-zero population of high-spin states at low temperatures, temperature-dependent variations in the inverse susceptibility and the spin-state population ratio, as well as the structural phase transitions accompanying spin-state transitions found in some systems.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

Analytical and simulation studies of a multiprocessor system for high-speed numerical computations

This paper describes the architecture of a multiprocessor system which we call the Broadcast Cube System (BCS) for solving important computation intensive problems such as systems of linear algebraic equations and Partial Differential Equations (PDEs), and highlights its features. Further, this paper presents an analytical performance study of the BCS, and it describes the main details of the design and implementation of the simulator for the BCS.

Time-Dependent Dynamics of a Planar Galaxy Model

Time-dependent models of collisionless stellar systems with harmonic potentials allowing for an essentially exact analytic description have recently been described. These include oscillating spheres and spheroids. This paper extends the analysis to time-dependent elliptic discs. Although restricted to two space dimensions, the systems are richer in that their parameters form a 10-dimensional phase space (in contrast to six for the earlier models). Apart from total energy and angular momentum, two additional conserved quantities emerge naturally. These can be chosen as the areas of extremal sections of the ellipsoidal region of phase space occupied by the system (their product gives the conserved volume). The present paper describes the construction of these models. An application to a tidal encounter is given which allows one to go beyond the impulse approximation and demonstrates the effects of rotation of the perturbed system on energy and angular-momentum transfer. The angular-momentum transfer is shown to scale inversely as the cube of the encounter velocity for an initial configuration of the perturbed galaxy with zero quadrupole moment.

Some experiments on human memory and a new neural model

An associative memory with parallel architecture is presented. The neurons are modelled by perceptrons having only binary, rather than continuous valued input. To store m elements each having n features, m neurons each with n connections are needed. The n features are coded as an n-bit binary vector. The weights of the n connections that store the n features of an element has only two values -1 and 1 corresponding to the absence or presence of a feature. This makes the learning very simple and straightforward. For an input corrupted by binary noise, the associative memory indicates the element that is closest (in terms of Hamming distance) to the noisy input. In the case where the noisy input is equidistant from two or more stored vectors, the associative memory indicates two or more elements simultaneously. From some simple experiments performed on the human memory and also on the associative memory, it can be concluded that the associative memory presented in this paper is in some respect more akin to a human memory than a Hopfield model.

Formation of a single, rotated-Brass (1 1 0)< 5 5 6 > texture by hot cross-rolling of an Al-Zn-Mg-Cu-Zr alloy

The present work describes the evolution of a strong, single-component rotated-Brass ((1 1 0) < 5 5 6 >) texture in an Al-Zn-Mg-Cu-Zr alloy by an uneven hot cross-rolling with frequent interpass annealing. This texture development is unique because hot rolling of aluminum alloys results in orientation distribution along the ``beta-fibre''. It has been demonstrated that the deformation by cross-rolling of a partially recrystallized grain structure having rotated-Cube and Goss orientations, and the recrystallization resistance of near-Brass-oriented elongated grains play a critical role in development of this texture. (C) 2010 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.