Explicit and Unique Construction of Tetrablock Unitary Dilation in a Certain Case

Consider the domain E in defined by This is called the tetrablock. This paper constructs explicit boundary normal dilation for a triple (A, B, P) of commuting bounded operators which has as a spectral set. We show that the dilation is minimal and unique under a certain natural condition. As is well-known, uniqueness of minimal dilation usually does not hold good in several variables, e.g., Ando's dilation is known to be not unique, see Li and Timotin (J Funct Anal 154:1-16, 1998). However, in the case of the tetrablock, the third component of the dilation can be chosen in such a way as to ensure uniqueness.

Experimental and Theoretical Charge Density Analysis of Polymorphic Structures: The Case of Coumarin 314 Dye

Experimental charge density distributions in two known conformational polymorphs (orange and yellow) of coumarin 314 dye are analyzed based on multipole modeling of X-ray diffraction data collected at 100 K. The experimental results are compared with the charge densities derived from multipole modeling of theoretical structure factors obtained from periodic quantum calculation with density functional theory (DFT) method and B3LYP/6-31G(d,p) level of theory. The presence of disorder at the carbonyl oxygen atom of ethoxycarbonyl group in the yellow form, which was not identified earlier, is addressed here. The investigationof intermolecular interactions, based on Hirshfeld surface analysis and topological properties via quantum theory of atoms in molecule and total electrostatic interaction energies, revealed significant differences between the polymorphs. The differences of electrostatic nature in these two polymorphic forms were unveiled via construction of three-dimensional deformation electrostatic potential maps plotted over the molecular surfaces. The lattice energies evaluated from ab initio calculations on the two polymorphic forms indicate that the yellow form is likely to be the most favorable thermodynamically. The dipole moments derived from experimental and theoretical charge densities and also from Lorentz tensor approach are compared with the single-molecule dipole moments. In each case, the differences of dipole moments between the polymorphs are identified.

A unified construction of space-time codes with optimal rate-diversity tradeoff

The problem of constructing space-time (ST) block codes over a fixed, desired signal constellation is considered. In this situation, there is a tradeoff between the transmission rate as measured in constellation symbols per channel use and the transmit diversity gain achieved by the code. The transmit diversity is a measure of the rate of polynomial decay of pairwise error probability of the code with increase in the signal-to-noise ratio (SNR). In the setting of a quasi-static channel model, let n(t) denote the number of transmit antennas and T the block interval. For any n(t) <= T, a unified construction of (n(t) x T) ST codes is provided here, for a class of signal constellations that includes the familiar pulse-amplitude (PAM), quadrature-amplitude (QAM), and 2(K)-ary phase-shift-keying (PSK) modulations as special cases. The construction is optimal as measured by the rate-diversity tradeoff and can achieve any given integer point on the rate-diversity tradeoff curve. An estimate of the coding gain realized is given. Other results presented here include i) an extension of the optimal unified construction to the multiple fading block case, ii) a version of the optimal unified construction in which the underlying binary block codes are replaced by trellis codes, iii) the providing of a linear dispersion form for the underlying binary block codes, iv) a Gray-mapped version of the unified construction, and v) a generalization of construction of the S-ary case corresponding to constellations of size S-K. Items ii) and iii) are aimed at simplifying the decoding of this class of ST codes.

A Novel Construction of Complex Orthogonal Designs with Maximal Rate and Low-PAPR

Space-time block codes based on orthogonal designs are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity and have low decoding complexity. However, the rate of the square real/complex orthogonal designs tends to zero with increase in number of antennas, while it is possible to have a rate-1 real orthogonal design (ROD) for any number of antennas.In case of complex orthogonal designs (CODs), rate-1 codes exist only for 1 and 2 antennas. In general, For a transmit antennas, the maximal rate of a COD is 1/2 + l/n or 1/2 + 1/n+1 for n even or odd respectively. In this paper, we present a simple construction for maximal-rate CODs for any number of antennas from square CODs which resembles the construction of rate-1 RODs from square RODs. These designs are shown to be amenable for construction of a class of generalized CODs (called Coordinate-Interleaved Scaled CODs) with low peak-to-average power ratio (PAPR) having the same parameters as the maximal-rate codes. Simulation results indicate that these codes perform better than the existing maximal rate codes under peak power constraint while performing the same under average power constraint.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that a failed node be repaired by connecting to any d nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case n = d + 1. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of [n, k, d] and (b) Minimum Storage Regenerating (MSR) codes for all [n, k, d >= 2k - 2], using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with [n = d + 1, k, d >= 2k - 1].

Design and construction of geocell foundation to support the embankment on settled red mud

This paper presents the case history of the construction of a 3 m high embankment on the geocell foundation over the soft settled red mud. Red mud is a waste product from the Bayer process of Aluminum industry. Geotechnical problems of the site, the design of the geocell foundation based on experimental investigation and the construction sequences of the geocell foundations in the field are discussed in the paper. Based on the experimental studies, an analytical model was also developed to estimate the load carrying capacity of the soft clay bed reinforced with geocell and combination of geocell and geogrid. The results of the experimental and analytical studies revealed that the use of combination of geocell and the geogrid is always beneficial than using the geocell alone. Hence, the combination of geocell and geogrid was recommended to stabilize the embankment base. The reported embankment is located in Lanjigharh (Orissa) in India. Construction of the embankment on the geocell foundation has already been completed. The constructed embankmenthas already sustained two monsoon rains without any cracks and seepage. (C) 2013 Elsevier Ltd. All rights reserved.

Low embodied energy cement stabilised rammed earth building-A case study

Rammed earth is a monolithic construction and the construction process involves compaction of processed soil in progressive layers in a rigid formwork. Durable and thinner load bearing walls can be built using stabilised rammed earth. Use of inorganic additives such as cement for rammed earth walls has been in practice since the last 5-6 decades and cement stabilised rammed earth (CSRE) buildings can be seen across the world. The paper deals with the construction aspects, structural design and embodied energy analysis of a three storey load bearing school building complex. The CSRE school complex consists of 15 classrooms, an open air theatre and a service block. The complex has a built-up area of 1691.3 m(2) and was constructed employing manual construction techniques. This case study shows low embodied energy of 1.15 GJ/m(2) for the CSRE building as against 3-4 GJ/m(2) for conventional burnt clay brick load bearing masonry buildings. (C) 2013 Elsevier B.V. All rights reserved.