A Kinematic Theory for Planar Hoberman and Other Novel Foldable Mechanisms

In this paper, we present a kinematic theory for Hoberman and other similar foldable linkages. By recognizing that the building blocks of such linkages can be modeled as planar linkages, different classes of possible solutions are systematically obtained including some novel arrangements. Criteria for foldability are arrived by analyzing the algebraic locus of the coupler curve of a PRRP linkage. They help explain generalized Hoberman and other mechanisms reported in the literature. New properties of such mechanisms including the extent of foldability, shape-preservation of the inner and outer profiles, multi-segmented assemblies and heterogeneous circumferential arrangements are derived. The design equations derived here make the conception of even complex planar radially foldable mechanisms systematic and easy. Representative examples are presented to illustrate the usage of the design equations and the kinematic theory.

A simple numerical method for three-dimensional analysis of simple expansion chamber mufflers of rectangular as well as circular cross-section with a stationary medium

Three-dimensional effects are a primary source of discrepancy between the measured values of automotive muffler performance and those predicted by the plane wave theory at higher frequencies. The basically exact method of (truncated) eigenfunction expansions for simple expansion chambers involves very complicated algebra, and the numerical finite element method requires large computation time and core storage. A simple numerical method is presented in this paper. It makes use of compatibility conditions for acoustic pressure and particle velocity at a number of equally spaced points in the planes of the junctions (or area discontinuities) to generate the required number of algebraic equations for evaluation of the relative amplitudes of the various modes (eigenfunctions), the total number of which is proportional to the area ratio. The method is demonstrated for evaluation of the four-pole parameters of rigid-walled, simple expansion chambers of rectangular as well as circular cross-section for the case of a stationary medium. Computed values of transmission loss are compared with those computed by means of the plane wave theory, in order to highlight the onset (cutting-on) of various higher order modes and the effect thereof on transmission loss of the muffler. These are also compared with predictions of the finite element methods (FEM) and the exact methods involving eigenfunction expansions, in order to demonstrate the accuracy of the simple method presented here.

Modulation Diversity in Fading Channels with a Quantized Receiver

In this paper, we address the design of codes which achieve modulation diversity in block fading single-input single-output (SISO) channels with signal quantization at the receiver. With an unquantized receiver, coding based on algebraic rotations is known to achieve maximum modulation coding diversity. On the other hand, with a quantized receiver, algebraic rotations may not guarantee gains in diversity. Through analysis, we propose specific rotations which result in the codewords having equidistant component-wise projections. We show that the proposed coding scheme achieves maximum modulation diversity with a low-complexity minimum distance decoder and perfect channel knowledge. Relaxing the perfect channel knowledge assumption we propose a novel channel training/estimation technique to estimate the channel. We show that our coding/training/estimation scheme and minimum distance decoding achieves an error probability performance similar to that achieved with perfect channel knowledge.

Transport through an electrostatically defined quantum dot lattice in a two-dimensional electron gas

Quantum dot lattices (QDLs) have the potential to allow for the tailoring of optical, magnetic, and electronic properties of a user-defined artificial solid. We use a dual gated device structure to controllably tune the potential landscape in a GaAs/AlGaAs two-dimensional electron gas, thereby enabling the formation of a periodic QDL. The current-voltage characteristics, I (V), follow a power law, as expected for a QDL. In addition, a systematic study of the scaling behavior of I (V) allows us to probe the effects of background disorder on transport through the QDL. Our results are particularly important for semiconductor-based QDL architectures which aim to probe collective phenomena.

Construction of equivalent circuit of a transformer winding from driving-point impedance function - analytical approach

Analytical solution is presented to convert a given driving-point impedance function (in s-domain) into a physically realisable ladder network with inductive coupling between any two sections and losses considered. The number of sections in the ladder network can vary, but its topology is assumed fixed. A study of the coefficients of the numerator and denominator polynomials of the driving-point impedance function of the ladder network, for increasing number of sections, led to the identification of certain coefficients, which exhibit very special properties. Generalised expressions for these specific coefficients have also been derived. Exploiting their properties, it is demonstrated that the synthesis method essentially turns out to be an exercise of solving a set of linear, simultaneous, algebraic equations, whose solution directly yields the ladder network elements. The proposed solution is novel, simple and guarantees a unique network. Presently, the formulation can synthesise a unique ladder network up to six sections.

The inhomogeneous extended Bose-Hubbard model: A mean-field theory

We develop an inhomogeneous mean-field theory for the extended Bose-Hubbard model with a quadratic, confining potential. In the absence of this potential, our mean-field theory yields the phase diagram of the homogeneous extended Bose-Hubbard model. This phase diagram shows a superfluid (SF) phase and lobes of Mott-insulator (MI), density-wave (DW), and supersolid (SS) phases in the plane of the chemical potential mu and on-site repulsion U; we present phase diagrams for representative values of V, the repulsive energy for bosons on nearest-neighbor sites. We demonstrate that, when the confining potential is present, superfluid and density-wave order parameters are nonuniform; in particular, we obtain, for a few representative values of parameters, spherical shells of SF, MI, DW, and SS phases. We explore the implications of our study for experiments on cold-atom dipolar condensates in optical lattices in a confining potential.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

The Treewidth of MDS and Reed-Muller Codes

The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parameterization of the maximum-likelihood decoding complexity for linear codes. In this paper, we show the surprising fact that for maximum distance separable codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code, is defined to be the least constraint complexity (or branch complexity) of any of its trellis realizations. From this, we obtain exact expressions for the treewidth of these codes, which constitute the only known explicit expressions for the treewidth of algebraic codes.

Bose-Hubbard models in confining potentials: Inhomogeneous mean-field theory

We present an extensive study of Mott insulator (MI) and superfluid (SF) shells in Bose-Hubbard (BH) models for bosons in optical lattices with harmonic traps. For this we apply the inhomogeneous mean-field theory developed by Sheshadri et al. Phys. Rev. Lett. 75, 4075 (1995)]. Our results for the BH model with one type of spinless bosons agree quantitatively with quantum Monte Carlo simulations. Our approach is numerically less intensive than such simulations, so we are able to perform calculations on experimentally realistic, large three-dimensional systems, explore a wide range of parameter values, and make direct contact with a variety of experimental measurements. We also extend our inhomogeneous mean-field theory to study BH models with harmonic traps and (a) two species of bosons or (b) spin-1 bosons. With two species of bosons, we obtain rich phase diagrams with a variety of SF and MI phases and associated shells when we include a quadratic confining potential. For the spin-1 BH model, we show, in a representative case, that the system can display alternating shells of polar SF and MI phases, and we make interesting predictions for experiments in such systems.

On maximum entropy and minimum KL-divergence optimization by Grobner basis methods

In this paper we study constrained maximum entropy and minimum divergence optimization problems, in the cases where integer valued sufficient statistics exists, using tools from computational commutative algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. We give an implicit description of maximum entropy models by embedding them in algebraic varieties for which we give a Grobner basis method to compute it. In the cases of minimum KL-divergence models we show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner basis method to embed minimum KL-divergence models in algebraic varieties. (C) 2012 Elsevier Inc. All rights reserved.

ENTANGLEMENT IN A 3-SPIN HEISENBERG-XY CHAIN WITH NEAREST-NEIGHBOR INTERACTIONS, SIMULATED IN AN NMR QUANTUM SIMULATOR

The evolution of entanglement in a 3-spin chain with nearest-neighbor Heisenberg-XY interactions for different initial states is investigated here. In an NMR experimental implementation, we generate multipartite entangled states starting from initial separable pseudo-pure states by simulating nearest-neighbor XY interactions in a 3-spin linear chain of nuclear spin qubits. For simulating XY interactions, we follow algebraic method of Zhang et al. Phys. Rev. A 72 (2005) 012331]. Bell state between end qubits has been generated by using only the unitary evolution of the XY Hamiltonian. For generating W-state and GHZ-state a single qubit rotation is applied on second and all the three qubits, respectively after the unitary evolution of the XY Hamiltonian.

Automatic energy-momentum conserving time integrators for hyperelastic waves

An energy-momentum conserving time integrator coupled with an automatic finite element algorithm is developed to study longitudinal wave propagation in hyperelastic layers. The Murnaghan strain energy function is used to model material nonlinearity and full geometric nonlinearity is considered. An automatic assembly algorithm using algorithmic differentiation is developed within a discrete Hamiltonian framework to directly formulate the finite element matrices without recourse to an explicit derivation of their algebraic form or the governing equations. The algorithm is illustrated with applications to longitudinal wave propagation in a thin hyperelastic layer modeled with a two-mode kinematic model. Solution obtained using a standard nonlinear finite element model with Newmark time stepping is provided for comparison. (C) 2012 Elsevier B.V. All rights reserved.

An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs

A low complexity, essentially-ML decoding technique for the Golden code and the three antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs)-the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity, and we give a set of sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the three and four antenna Perfect codes, the three antenna Threaded Algebraic Space-Time code and the four antenna rate 2 code of Srinath and Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm have the least decoding complexity and best error performance among all known codes for transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding implementation.

Border basis detection is NP-complete

Border basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to some order ideal. The motivation for this problem comes from a similar problem related to Grobner bases termed as Grobner basis detection (GBD) which was proposed by Gritzmann and Sturmfels (1993). GBD was shown to be NP-hard by Sturmfels and Wiegelmann (1996). In this paper, we investigate the computational complexity of BBD and show that it is NP-complete.

Loop transformations: convexity, pruning, and optimization

High-level loop transformations are a key instrument in mapping computational kernels to effectively exploit the resources in modern processor architectures. Nevertheless, selecting required compositions of loop transformations to achieve this remains a significantly challenging task; current compilers may be off by orders of magnitude in performance compared to hand-optimized programs. To address this fundamental challenge, we first present a convex characterization of all distinct, semantics-preserving, multidimensional affine transformations. We then bring together algebraic, algorithmic, and performance analysis results to design a tractable optimization algorithm over this highly expressive space. Our framework has been implemented and validated experimentally on a representative set of benchmarks running on state-of-the-art multi-core platforms.