On the treewidth of MDS and Reed-Muller codes

The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.

Correlation between enhanced lattice polarizability and high piezoelectric response in BiScO3-PbTiO3

Piezoelectric and ex situ electric-field induced structural studies were carried out on closely spaced compositions in the morphotropic phase boundary region of (1 - x) PbTiO3-(x)BiScO3. While the common approach of zero field structural analysis failed to provide a unique relationship between the anomalous piezoresponse of x = 0.3725 and structural factor(s), ex situ study of electric-field induced structural changes revealed that the composition exhibiting the highest piezoelectric response is the one which also exhibits significantly enhanced polarizability of the lattices of both coexisting (monoclinic and tetragonal) phases. The enhanced lattice polarizability manifests as a significant fraction of the monoclinic phase transforming irreversibly to the tetragonal phase after electric poling. DOI: 10.1103/PhysRevB.87.064106

A transform approach to linear network coding for acyclic networks with delay

The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a Fq-linear combination of the input symbols across different generations, where Fq denotes the field over which the network operates. We use finite-field discrete Fourier transform (DFT) to convert the output symbols at the sink nodes at any given time instant into a Fq-linear combination of the input symbols generated during the same generation. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach. Furthermore, assuming time invariant local encoding kernels, we show that the transform method can be employed to achieve half the rate corresponding to the individual source-destination mincut (which are assumed to be equal to 1) for some classes of three-source three-destination multiple unicast network with delays using alignment strategies when the zero-interference condition is not satisfied.

Fast-Decodable MIDO Codes With Large Coding Gain

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of two complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input double output (MIDO) systems. Using this method, rate-2 STBCs for 4 x 2, 6 x 2, 8 x 2, and 12 x 2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains, and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the Srinath-Rajan code for the 4 x 2 system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the 4x2 MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the 4 x 2 system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the Srinath-Rajan code has the NVD property and hence is DMT-optimal for the 4 x 2 system.

Periodically Clickable Polyesters: Study of Intrachain Self-Segregation Induced Folding, Crystallization, and Mesophase Formation

A series of polyesters based on 2-propargyl-1,3-propanediol or 2,2-dipropargyl-1,3-propanediol or 2-allyl-2-propargyl-1,3-propanediol and 1,20-eicosanedioic acid were prepared by solution polycondensation using the corresponding diacid chloride; these polyesters were quantitatively ``clicked'' with a fluoroalkyl, azide, namely CF3(CF2)(7)CH2CH2N3, to yield polyesters carrying long-chain alkylene segments in the backbone and either one or two perfluoroalkyl segments located at periodic intervals along the polymer chain. The immiscibility of the alkylene and fluoroalkyl segments causes the polymer chains to fold in a zigzag fashion to facilitate the segregation of these segments; the folded chains further organize in the solid state to form a lamellar structure with alternating domains of alkyl (HC) and fluoroalkyl (FC) segments. Evidence for the self-segregation is provided by DSC, SAXS, WAXS, and TEM studies; in two of the samples, the DSC thermograms showed two distinct endotherms associated with the melting of the individual domains, while the WAXS patterns confirm the existence of two separate peaks corresponding to the interchain distances within the crystalline lattices of the HC and FC domains. SAXS data, on the other hand, reveal the formation of an extended lamellar morphology with an interlamellar spacing that matches reasonably well with those estimated from TEM studies. Interestingly, a smectic-type liquid crystalline phase is observed at temperatures between the two melting transitions. These systems present a unique opportunity to develop interesting nanostructured polymeric materials with precise control over both the domain size and morphology; importantly, the domain sizes are far smaller than those typically observed in traditional block copolymers.

Simulation of inhomogeneous distributions of ultracold atoms in an optical lattice via a massively parallel implementation of nonequilibrium strong-coupling perturbation theory

We present a nonequilibrium strong-coupling approach to inhomogeneous systems of ultracold atoms in optical lattices. We demonstrate its application to the Mott-insulating phase of a two-dimensional Fermi-Hubbard model in the presence of a trap potential. Since the theory is formulated self-consistently, the numerical implementation relies on a massively parallel evaluation of the self-energy and the Green's function at each lattice site, employing thousands of CPUs. While the computation of the self-energy is straightforward to parallelize, the evaluation of the Green's function requires the inversion of a large sparse 10(d) x 10(d) matrix, with d > 6. As a crucial ingredient, our solution heavily relies on the smallness of the hopping as compared to the interaction strength and yields a widely scalable realization of a rapidly converging iterative algorithm which evaluates all elements of the Green's function. Results are validated by comparing with the homogeneous case via the local-density approximation. These calculations also show that the local-density approximation is valid in nonequilibrium setups without mass transport.

Dense shallow granular flows

Simplified equations are derived for a granular flow in the `dense' limit where the volume fraction is close to that for dynamical arrest, and the `shallow' limit where the stream-wise length for flow development (L) is large compared with the cross-stream height (h). The mass and diameter of the particles are set equal to 1 in the analysis without loss of generality. In the dense limit, the equations are simplified by taking advantage of the power-law divergence of the pair distribution function chi proportional to (phi(ad) - phi)(-alpha), and a faster divergence of the derivativ rho(d chi/d rho) similar to (d chi/d phi), where rho and phi are the density and volume fraction, and phi(ad) is the volume fraction for arrested dynamics. When the height h is much larger than the conduction length, the energy equation reduces to an algebraic balance between the rates of production and dissipation of energy, and the stress is proportional to the square of the strain rate (Bagnold law). In the shallow limit, the stress reduces to a simplified Bagnold stress, where all components of the stress are proportional to (partial derivative u(x)/partial derivative y)(2), which is the cross-stream (y) derivative of the stream-wise (x) velocity. In the simplified equations for dense shallow flows, the inertial terms are neglected in the y momentum equation in the shallow limit because the are O(h/L) smaller than the divergence of the stress. The resulting model contains two equations, a mass conservation equations which reduces to a solenoidal condition on the velocity in the incompressible limit, and a stream-wise momentum equation which contains just one parameter B which is a combination of the Bagnold coefficients and their derivatives with respect to volume fraction. The leading-order dense shallow flow equations, as well as the first correction due to density variations, are analysed for two representative flows. The first is the development from a plug flow to a fully developed Bagnold profile for the flow down an inclined plane. The analysis shows that the flow development length is ((rho) over barh(3)/B) , where (rho) over bar is the mean density, and this length is numerically estimated from previous simulation results. The second example is the development of the boundary layer at the base of the flow when a plug flow (with a slip condition at the base) encounters a rough base, in the limit where the momentum boundary layer thickness is small compared with the flow height. Analytical solutions can be found only when the stream-wise velocity far from the surface varies as x(F), where x is the stream-wise distance from the start of the rough base and F is an exponent. The boundary layer thickness increases as (l(2)x)(1/3) for all values of F, where the length scale l = root 2B/(rho) over bar. The analysis reveals important differences between granular flows and the flows of Newtonian fluids. The Reynolds number (ratio of inertial and viscous terms) turns out to depend only on the layer height and Bagnold coefficients, and is independent of the flow velocity, because both the inertial terms in the conservation equations and the divergence of the stress depend on the square of the velocity/velocity gradients. The compressibility number (ratio of the variation in volume fraction and mean volume fraction) is independent of the flow velocity and layer height, and depends only on the volume fraction and Bagnold coefficients.

Laterally structured ripple and square phases with one and two dimensional thickness modulations in a model bilayer system

Molecular dynamics simulations of bilayers in a surfactant/co-surfactant/water system with explicit solvent molecules show formation of topologically distinct gel phases depending upon the bilayer composition. At low temperatures, the bilayers transform from the tilted gel phase, L beta', to the one dimensional (1D) rippled, P beta' phase as the surfactant concentration is increased. More interestingly, we observe a two dimensional (2D) square phase at higher surfactant concentration which, upon heating, transforms to the gel L beta' phase. The thickness modulations in the 1D rippled and square phases are asymmetric in two surfactant leaflets and the bilayer thickness varies by a factor of similar to 2 between maximum and minimum. The 1D ripple consists of a thinner interdigitated region of smaller extent alternating with a thicker non-interdigitated region. The 2D ripple phase is made up of two superimposed square lattices of maximum and minimum thicknesses with molecules of high tilt forming a square lattice translated from the lattice formed with the thickness minima. Using Voronoi diagrams we analyze the intricate interplay between the area-per-head-group, height modulations and chain tilt for the different ripple symmetries. Our simulations indicate that composition plays an important role in controlling the formation of low temperature gel phase symmetries and rippling accommodates the increased area-per-head-group of the surfactant molecules.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

Riemann shock tube: 1D normal shocks in air, simulations and experiments

This paper presents numerical simulation of the evolution of one-dimensional normal shocks, their propagation, reflection and interaction in air using a single diaphragm Riemann shock tube and validate them using experimental results. Mathematical model is derived for one-dimensional compressible flow of viscous and conducting medium. Dimensionless form of the mathematical model is used to construct space-time finite element processes based on minimization of the space-time residual functional. The space-time local approximation functions for space-time p-version hierarchical finite elements are considered in higher order GRAPHICS] spaces that permit desired order of global differentiability of local approximations in space and time. The resulting algebraic systems from this approach yield unconditionally positive-definite coefficient matrices, hence ensure unique numerical solution. The evolution is computed for a space-time strip corresponding to a time increment Delta t and then time march to obtain the evolution up to any desired value of time. Numerical studies are designed using recently invented hand-driven shock tube (Reddy tube) parameters, high/low side density and pressure values, high- and low-pressure side shock tube lengths, so that numerically computed results can be compared with actual experimental measurements.

Hardware Accelerator for 3D Method of Moments based Parasitic Extraction

A Field Programmable Gate Array (FPGA) based hardware accelerator for multi-conductor parasitic capacitance extraction, using Method of Moments (MoM), is presented in this paper. Due to the prohibitive cost of solving a dense algebraic system formed by MoM, linear complexity fast solver algorithms have been developed in the past to expedite the matrix-vector product computation in a Krylov sub-space based iterative solver framework. However, as the number of conductors in a system increases leading to a corresponding increase in the number of right-hand-side (RHS) vectors, the computational cost for multiple matrix-vector products present a time bottleneck, especially for ill-conditioned system matrices. In this work, an FPGA based hardware implementation is proposed to parallelize the iterative matrix solution for multiple RHS vectors in a low-rank compression based fast solver scheme. The method is applied to accelerate electrostatic parasitic capacitance extraction of multiple conductors in a Ball Grid Array (BGA) package. Speed-ups up to 13x over equivalent software implementation on an Intel Core i5 processor for dense matrix-vector products and 12x for QR compressed matrix-vector products is achieved using a Virtex-6 XC6VLX240T FPGA on Xilinx's ML605 board.

A nodal domain theorem for integrable billiards in two dimensions

Eigenfunctions of integrable planar billiards are studied - in particular, the number of nodal domains, nu of the eigenfunctions with Dirichlet boundary conditions are considered. The billiards for which the time-independent Schrodinger equation (Helmholtz equation) is separable admit trivial expressions for the number of domains. Here, we discover that for all separable and nonseparable integrable billiards, nu satisfies certain difference equations. This has been possible because the eigenfunctions can be classified in families labelled by the same value of m mod kn, given a particular k, for a set of quantum numbers, m, n. Further, we observe that the patterns in a family are similar and the algebraic representation of the geometrical nodal patterns is found. Instances of this representation are explained in detail to understand the beauty of the patterns. This paper therefore presents a mathematical connection between integrable systems and difference equations. (C) 2014 Elsevier Inc. All rights reserved.

Effects of refractive index mismatch in optical CT imaging of polymer gel dosimeters

Purpose: Proposing an image reconstruction technique, algebraic reconstruction technique-refraction correction (ART-rc). The proposed method takes care of refractive index mismatches present in gel dosimeter scanner at the boundary, and also corrects for the interior ray refraction. Polymer gel dosimeters with high dose regions have higher refractive index and optical density compared to the background medium, these changes in refractive index at high dose results in interior ray bending. Methods: The inclusion of the effects of refraction is an important step in reconstruction of optical density in gel dosimeters. The proposed ray tracing algorithm models the interior multiple refraction at the inhomogeneities. Jacob's ray tracing algorithm has been modified to calculate the pathlengths of the ray that traverses through the higher dose regions. The algorithm computes the length of the ray in each pixel along its path and is used as the weight matrix. Algebraic reconstruction technique and pixel based reconstruction algorithms are used for solving the reconstruction problem. The proposed method is tested with numerical phantoms for various noise levels. The experimental dosimetric results are also presented. Results: The results show that the proposed scheme ART-rc is able to reconstruct optical density inside the dosimeter better than the results obtained using filtered backprojection and conventional algebraic reconstruction approaches. The quantitative improvement using ART-rc is evaluated using gamma-index. The refraction errors due to regions of different refractive indices are discussed. The effects of modeling of interior refraction in the dose region are presented. Conclusions: The errors propagated due to multiple refraction effects have been modeled and the improvements in reconstruction using proposed model is presented. The refractive index of the dosimeter has a mismatch with the surrounding medium (for dry air or water scanning). The algorithm reconstructs the dose profiles by estimating refractive indices of multiple inhomogeneities having different refractive indices and optical densities embedded in the dosimeter. This is achieved by tracking the path of the ray that traverses through the dosimeter. Extensive simulation studies have been carried out and results are found to be matching that of experimental results. (C) 2015 American Association of Physicists in Medicine.

On the curvature ODE associated to the Ricci flow

In the vector space of algebraic curvature operators we study the reaction ODE which is associated to the evolution equation of the Riemann curvature operator along the Ricci flow. More precisely, we give a partial classification of the zeros of this ODE up to suitable normalization and analyze the stability of a special class of zeros of the same. In particular, we show that the ODE is unstable near the curvature operators of the Riemannian product spaces where is an Einstein (locally) symmetric space of compact type and not a spherical space form when .

LDPC Code Designs Based on root I Matrices

LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding.