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.

Stiff string approximations in Rayleigh-Ritz method for rotating beams

The governing differential equation of the rotating beam reduces to that of a stiff string when the centrifugal force is assumed as constant. The solution of the static homogeneous part of this equation is enhanced with a polynomial term and used in the Rayleighs method. Numerical experiments show better agreement with converged finite element solutions compared to polynomials. Using this as an estimate for the first mode shape, higher mode shape approximations are obtained using Gram-Schmidt orthogonalization. Estimates for the first five natural frequencies of uniform and tapered beams are obtained accurately using a very low order Rayleigh-Ritz approximation.

On Uniform Approximate Solutions in Bending of Symmetric Laminated Plates

A layer-wise theory with the analysis of face ply independent of lamination is used in the bending of symmetric laminates with anisotropic plies. More realistic and practical edge conditions as in Kirchhoff's theory are considered. An iterative procedure based on point-wise equilibrium equations is adapted. The necessity of a solution of an auxiliary problem in the interior plies is explained and used in the generation of proper sequence of two dimensional problems. Displacements are expanded in terms of polynomials in thickness coordinate such that continuity of transverse stresses across interfaces is assured. Solution of a fourth order system of a supplementary problem in the face ply is necessary to ensure the continuity of in-plane displacements across interfaces and to rectify inadequacies of these polynomial expansions in the interior distribution of approximate solutions. Vertical deflection does not play any role in obtaining all six stress components and two in-plane displacements. In overcoming lacuna in Kirchhoff's theory, widely used first order shear deformation theory and other sixth and higher order theories based on energy principles at laminate level in smeared laminate theories and at ply level in layer-wise theories are not useful in the generation of a proper sequence of 2-D problems converging to 3-D problems. Relevance of present analysis is demonstrated through solutions in a simple text book problem of simply supported square plate under doubly sinusoidal load.

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.

On existence of periodic solutions for stable interval plants with odd, sector type nonlinearities

In several systems, the physical parameters of the system vary over time or operating points. A popular way of representing such plants with structured or parametric uncertainties is by means of interval polynomials. However, ensuring the stability of such systems is a robust control problem. Fortunately, Kharitonov's theorem enables the analysis of such interval plants and also provides tools for design of robust controllers in such cases. The present paper considers one such case, where the interval plant is connected with a timeinvariant, static, odd, sector type nonlinearity in its feedback path. This paper provides necessary conditions for the existence of self sustaining periodic oscillations in such interval plants, and indicates a possible design algorithm to avoid such periodic solutions or limit cycles. The describing function technique is used to approximate the nonlinearity and subsequently arrive at the results. Furthermore, the value set approach, along with Mikhailov conditions, are resorted to in providing graphical techniques for the derivation of the conditions and subsequent design algorithm of the controller.

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.

Analytical test functions for free vibration analysis of rotating non-homogeneous Timoshenko beams

In this paper, the governing equations for free vibration of a non-homogeneous rotating Timoshenko beam, having uniform cross-section, is studied using an inverse problem approach, for both cantilever and pinned-free boundary conditions. The bending displacement and the rotation due to bending are assumed to be simple polynomials which satisfy all four boundary conditions. It is found that for certain polynomial variations of the material mass density, elastic modulus and shear modulus, along the length of the beam, the assumed polynomials serve as simple closed form solutions to the coupled second order governing differential equations with variable coefficients. It is found that there are an infinite number of analytical polynomial functions possible for material mass density, shear modulus and elastic modulus distributions, which share the same frequency and mode shape for a particular mode. The derived results are intended to serve as benchmark solutions for testing approximate or numerical methods used for the vibration analysis of rotating non-homogeneous Timoshenko beams.

Frequency Domain Based Solution for Certain Class of Wave Equations: An exhaustive study of Numerical Solutions

The paper discusses the frequency domain based solution for a certain class of wave equations such as: a second order partial differential equation in one variable with constant and varying coefficients (Cantilever beam) and a coupled second order partial differential equation in two variables with constant and varying coefficients (Timoshenko beam). The exact solution of the Cantilever beam with uniform and varying cross-section and the Timoshenko beam with uniform cross-section is available. However, the exact solution for Timoshenko beam with varying cross-section is not available. Laplace spectral methods are used to solve these problems exactly in frequency domain. The numerical solution in frequency domain is done by discretisation in space by approximating the unknown function using spectral functions like Chebyshev polynomials, Legendre polynomials and also Normal polynomials. Different numerical methods such as Galerkin Method, Petrov- Galerkin method, Method of moments and Collocation method or the Pseudo-spectral method in frequency domain are studied and compared with the available exact solution. An approximate solution is also obtained for the Timoshenko beam with varying cross-section using Laplace Spectral Element Method (LSEM). The group speeds are computed exactly for the Cantilever beam and Timoshenko beam with uniform cross-section and is compared with the group speeds obtained numerically. The shear mode and the bending modes of the Timoshenko beam with uniform cross-section are separated numerically by applying a modulated pulse as the shear force and the corresponding group speeds for varying taper parameter in are obtained numerically by varying the frequency of the input pulse. An approximate expression for calculating group speeds corresponding to the shear mode and the bending mode, and also the cut-off frequency is obtained. Finally, we show that the cut-off frequency disappears for large in, for epsilon > 0 and increases for large in, for epsilon < 0.

Maximal Contractive Tuples

Maximality of a contractive tuple of operators is considered. A characterization for a contractive tuple to be maximal is obtained. The notion of maximality for a submodule of the Drury-Arveson module on the -dimensional unit ball is defined. For , it is shown that every submodule of the Hardy module over the unit disc is maximal. But for we prove that any homogeneous submodule or submodule generated by polynomials is not maximal. A characterization of maximal submodules is obtained.

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.

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.

Polynomial Decompositions in Polynomial Time

Fix a prime p. Given a positive integer k, a vector of positive integers Delta = (Delta(1), Delta(2), ... , Delta(k)) and a function Gamma : F-p(k) -> F-p, we say that a function P : F-p(n) -> F-p is (k, Delta, Gamma)-structured if there exist polynomials P-1, P-2, ..., P-k : F-p(n) -> F-p with each deg(P-i) <= Delta(i) such that for all x is an element of F-p(n), P(x) = Gamma(P-1(x), P-2(x), ..., P-k(x)). For instance, an n-variate polynomial over the field Fp of total degree d factors nontrivially exactly when it is (2, (d - 1, d - 1), prod)- structured where prod(a, b) = a . b. We show that if p > d, then for any fixed k, Delta, Gamma, we can decide whether a given polynomial P(x(1), x(2), ..., x(n)) of degree d is (k, Delta, Gamma)-structured and if so, find a witnessing decomposition. The algorithm takes poly(n) time. Our approach is based on higher-order Fourier analysis.

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.