Fast-Group-Decodable STBCs via Codes over GF(4): Further Results

Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.

Low ML Decoding Complexity STBCs via Codes Over the Klein Group

In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs.

Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

Pristine, adherent ultrathin gold nanowires on substrates and between pre-defined contacts via a wet chemical route

We demonstrate a simple strategy of obtaining clean, ultrathin single crystal Au nanowires on substrates and interconnecting pre-defined contacts with an insight into the growth mechanism. The pristine nature enables electron transport measurement through such ultrathin wires and opens up possibilities of exploring its properties for a wide range of applications.

Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis

Null dereferences are a bane of programming in languages such as Java. In this paper we propose a sound, demand-driven, inter-procedurally context-sensitive dataflow analysis technique to verify a given dereference as safe or potentially unsafe. Our analysis uses an abstract lattice of formulas to find a pre-condition at the entry of the program such that a null-dereference can occur only if the initial state of the program satisfies this pre-condition. We use a simplified domain of formulas, abstracting out integer arithmetic, as well as unbounded access paths due to recursive data structures. For the sake of precision we model aliasing relationships explicitly in our abstract lattice, enable strong updates, and use a limited notion of path sensitivity. For the sake of scalability we prune formulas continually as they get propagated, reducing to true conjuncts that are less likely to be useful in validating or invalidating the formula. We have implemented our approach, and present an evaluation of it on a set of ten real Java programs. Our results show that the set of design features we have incorporated enable the analysis to (a) explore long, inter-procedural paths to verify each dereference, with (b) reasonable accuracy, and (c) very quick response time per dereference, making it suitable for use in desktop development environments.

Pillar height dependent formation of unprecedented Pd-8 molecular swing and Pd-6 molecular boat via multicomponent self-assembly

Three-component self-assembly of a cis-blocked 90 degrees Pd(II) acceptor with a mixture of a tetraimidazole and a linear dipyridyl donor self-discriminated into unusual Pd-8 molecular swing (1) and Pd-6 molecular boat (2), which are characterized by single-crystal X-ray diffraction analysis; their ability to bind C-60 in solution is established by fluorescence titration.

Unzipping and binding of small interfering RNA with single walled carbon nanotube: A platform for small interfering RNA delivery

In an effort to design efficient platform for siRNA delivery, we combine all atom classical and quantum simulations to study the binding of small interfering RNA (siRNA) by pristine single wall carbon nanotube (SWCNT). Our results show that siRNA strongly binds to SWCNT surface via unzipping its base-pairs and the propensity of unzipping increases with the increase in the diameter of the SWCNTs. The unzipping and subsequent wrapping events are initiated and driven by van der Waals interactions between the aromatic rings of siRNA nucleobases and the SWCNT surface. However, molecular dynamics (MD) simulations of double strand DNA (dsDNA) of the same sequence show that the dsDNA undergoes much less unzipping and wrapping on the SWCNT in the simulation time scale of 70 ns. This interesting difference is due to smaller interaction energy of thymidine of dsDNA with the SWCNT compared to that of uridine of siRNA, as calculated by dispersion corrected density functional theory (DFT) methods. After the optimal binding of siRNA to SWCNT, the complex is very stable which serves as one of the major mechanisms of siRNA delivery for biomedical applications. Since siRNA has to undergo unwinding process with the effect of RNA-induced silencing complex, our proposed delivery mechanism by SWCNT possesses potential advantages in achieving RNA interference. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.3682780]

A numerical study of variable coefficient elliptic Cauchy problem via projection method

In this paper, we investigate a numerical method for the solution of an inverse problem of recovering lacking data on some part of the boundary of a domain from the Cauchy data on other part for a variable coefficient elliptic Cauchy problem. In the process, the Cauchy problem is transformed into the problem of solving a compact linear operator equation. As a remedy to the ill-posedness of the problem, we use a projection method which allows regularization solely by discretization. The discretization level plays the role of regularization parameter in the case of projection method. The balancing principle is used for the choice of an appropriate discretization level. Several numerical examples show that the method produces a stable good approximate solution.

Defect-Free Hyperbranched Polydithioacetal via Melt Polymerization

Degree of branching (DB) describes the level of structural perfection of a hyperbranched polymer when compared to its defect-free analogue, namely the dendrimer. The strategy most commonly used to achieve high DB values, specifically while using AB(2) type self-condensations, is to design an AB2 monomer wherein the reaction of the first B-group leads to an enhancement of the reactivity of the second one. In the present study, we show that an AB2 monomer carrying a dimethylacetal unit and a thiol group undergoes a rapid self-condensation in the melt under acid-catalysis to yield a hyperbranched polydithioacetal with no linear defects. NMR studies using model systems reveal that the intermediate monothioacetal is relatively unstable under the polymerization conditions and transforms rapidly to the dithioacetal; because this second step occurs irreversibly during polymer formation, it leads to a defect-free hyperbranched polydithioacetal. TGA studies of the polymerization process provided some valuable insights into the kinetics of polymerization. An additional virtue of this approach is that the numerous terminal dimethylacetal groups are very labile and can be quantitatively transformed by treatment with a variety of functional thiols; the terminal dimethylacetals were, thus, reacted with various thiols, such as dodecanethiol, benzyl mercaptan, ethylmercaptopropionate, and so on, to demonstrate the versatility of these systems as sulfur-rich hyperscaffolds to anchor different kinds of functionality on their periphery.

Wrinkled and slack membranes: nonlinear 3D elasticity solutions via smooth DMS-FEM and experiment

The smooth DMS-FEM, recently proposed by the authors, is extended and applied to the geometrically nonlinear and ill-posed problem of a deformed and wrinkled/slack membrane. A key feature of this work is that three-dimensional nonlinear elasticity equations corresponding to linear momentum balance, without any dimensional reduction and the associated approximations, directly serve as the membrane governing equations. Domain discretization is performed with triangular prism elements and the higher order (C1 or more) interelement continuity of the shape functions ensures that the errors arising from possible jumps in the first derivatives of the conventional C0 shape functions do not propagate because the ill-conditioned tangent stiffness matrices are iteratively inverted. The present scheme employs no regularization and exhibits little sensitivity to h-refinement. Although the numerically computed deformed membrane profiles do show some sensitivity to initial imperfections (nonplanarity) in the membrane profile needed to initiate transverse deformations, the overall patterns of the wrinkles and the deformed shapes appear to be less so. Finally, the deformed profiles, computed through the DMS FEM-based weak formulation, are compared with those obtained through an experiment on an ultrathin Kapton membrane, wherein wrinkles form because of the applied boundary displacement conditions. Comparisons with a reported experiment on a rectangular membrane are also provided. These exercises lend credence to the feasibility of the DMS FEM-based numerical route to computing post-wrinkled membrane shapes. Copyright (c) 2012 John Wiley & Sons, Ltd.

Reducing convergence times of self-propelled swarms via modified nearest neighbor rules

Vicsek et al. proposed a biologically inspired model of self-propelled particles, which is now commonly referred to as the Vicsek model. Recently, attention has been directed at modifying the Vicsek model so as to improve convergence properties. In this paper, we propose two modification of the Vicsek model which leads to significant improvements in convergence times. The modifications involve an additional term in the heading update rule which depends only on the current or the past states of the particle's neighbors. The variation in convergence properties as the parameters of these modified versions are changed are closely investigated. It is found that in both cases, there exists an optimal value of the parameter which reduces convergence times significantly and the system undergoes a phase transition as the value of the parameter is increased beyond this optimal value. (C) 2012 Elsevier B.V. All rights reserved.