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.

Conflict-Free Coloring for Rectangle Ranges Using O(n.382) Colors

Given a set of points P ⊆ R2, a conflict-free coloring of P w.r.t. rectangle ranges is an assignment of colors to points of P, such that each nonempty axisparallel rectangle T in the plane contains a point whose color is distinct from all other points in P ∩ T . This notion has been the subject of recent interest and is motivated by frequency assignment in wireless cellular networks: one naturally would like to minimize the number of frequencies (colors) assigned to base stations (points) such that within any range (for instance, rectangle), there is no interference. We show that any set of n points in R2 can be conflict-free colored with O(nβ∗+o(1)) colors in expected polynomial time, where β∗ = 3−√5 2 < 0.382.

Non-monotonic, distance-dependent relaxation of water in reverse micelles: Propagation of surface induced frustration along hydrogen bond networks

Layer-wise, distance-dependent orientational relaxation of water confined in reverse micelles (RM) is studied using theoretical and computational tools. We use both a newly constructed ``spins on a ring'' (SOR) Ising-type model (with Shore-Zwanzig rotational dynamics) and atomistic simulations with explicit water. Our study explores the effect of reverse micelle size and role of intermolecular correlations, compromised by the presence of a highly polar surface, on the distance (from the interface) dependence of water relaxation. The ``spins on a ring'' model can capture some aspects of distance dependence of relaxation, such as acceleration of orientational relaxation at intermediate layers. In atomistic simulations, layer-wise decomposition of hydrogen bond formation pattern clearly reveals that hydrogen bond arrangement of water at a certain distance away from the surface can remain frustrated due to the interaction with the polar surface head groups. This layer-wise analysis also reveals the presence of a non-monotonic slow relaxation component which can be attributed to this frustration effect and which is accentuated in small to intermediate size RMs. For large size RMs, the long time component decreases monotonically from the interface to the interior of the RMs with slowest relaxation observed at the interface. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4732095]

Extracting Three Dimensional Surface Model of Human Kidney from the Visible Human Data Set using Free Software

Three dimensional digital model of a representative human kidney is needed for a surgical simulator that is capable of simulating a laparoscopic surgery involving kidney. Buying a three dimensional computer model of a representative human kidney, or reconstructing a human kidney from an image sequence using commercial software, both involve (sometimes significant amount of) money. In this paper, author has shown that one can obtain a three dimensional surface model of human kidney by making use of images from the Visible Human Data Set and a few free software packages (ImageJ, ITK-SNAP, and MeshLab in particular). Images from the Visible Human Data Set, and the software packages used here, both do not cost anything. Hence, the practice of extracting the geometry of a representative human kidney for free, as illustrated in the present work, could be a free alternative to the use of expensive commercial software or to the purchase of a digital model.

Characterization of structural and free energy properties of promoters associated with Primary and Operon TSS in Helicobacter pylori genome and their orthologs

Promoter regions in the genomes of all domains of life show similar trends in several structural properties such as stability, bendability, curvature, etc. In current study we analysed the stability and bendability of various classes of promoter regions (based on the recent identification of different classes of transcription start sites) of Helicobacter pylori 26695 strain. It is found that primary TSS and operon-associated TSS promoters show significantly strong features in their promoter regions. DNA free-energy-based promoter prediction tool PromPredict was used to annotate promoters of different classes, and very high recall values (similar to 80%) are obtained for primary TSS. Orthologous genes from other strains of H. pylori show conservation of structural properties in promoter regions as well as coding regions. PromPredict annotates promoters of orthologous genes with very high recall and precision.

Microstructure and Texture Evolution in Interstitial-free (IF) Steel processed by Multi-Axial Forging

In this study, severe plastic deformation (SPD) of Ti-bearing interstitial-free steel was carried out by multi-axial forging (MAF) technique. The grain refinement achieved was comparable to that by other SPD techniques. A considerable heterogeneity was observed in the microstructure and texture. Texture of multi-axially forged steels has been evaluated and reported for the first time. The material exhibited a six-fold increase in the yield strength after four cycles of MAF.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.

Optimal Hop Distance and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organize into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention-based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first motivate that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc wireless network (described above) as a single cell, we study the hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (t) (1/eta), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterization of the optimal operating point. Simulation results are provided comparing the performance of the optimal strategy derived here with some simple strategies for operating the network.

Anomalous Stress Profile in a Sheared Granular Column

We present measurements of the stress as a function of vertical position in a column of granular material sheared in a cylindrical Couette device. All three components of the stress tensor on the outer cylinder were measured as a function of distance from the free surface at shear rates low enough that the material was in the dense, slow flow regime. We find that the stress profile differs fundamentally from that of fluids, from the predictions of plasticity theories, and from intuitive expectation. We argue that the anomalous stress profile is due to an anisotropic fabric caused by the combined action of gravity and shear.

Bromenium-Catalysed Tandem Ring Opening/Cyclisation of Vinylcyclopropanes and Vinylcyclobutanes: A Metal-Free 3+2+1]/4+2+1] Cascade for the Synthesis of Chiral Amidines and Computational Investigation

We present a detailed study of a 3+2+1] cascade cyclisation of vinylcyclopropanes (VCP) catalysed by a bromenium species (Brd+?Xd-) generated in situ, which results in the synthesis of chiral bicyclic amidines in a tandem one-pot operation. The formation of amidines involves the ring-opening of VCPs with Br?X, followed by a Ritter-type reaction with chloramine-T and a tandem cyclisation. The reaction has been further extended to vinylcyclobutane systems and involves a 4+2+1] cascade cyclisation with the same reagents. The versatility of the methodology has been demonstrated by careful choice of VCPs and VCBs to yield bicyclo4.3.0]-, -4.3.1]- and -4.4.0]amidines in enantiomerically pure form. On the basis of the experimental observations and DFT calculations, a reasonable mechanism has been put forth to account for the formation of the products and the observed stereoselectivity. We propose the existence of a p-stabilised homoallylic carbocation at the cyclopropane carbon as the reason for high stereoselectivity. DFT studies at B3LYP/6-311+G** and M06-2X/6-31+G* levels of theory in gas-phase calculations suggest the ring-opening of VCP is initiated at the p-complex stage (between the double bond and Br?X). This can be clearly perceived from the solution-phase (acetonitrile) calculations using the polarisable continuum model (PCM) solvation model, from which the extent of the ring opening of VCP was found to be noticeably high. Studies also show that the formation of zero-bridge bicyclic amidines is favoured over other bridged bicyclic amidines. The energetics of competing reaction pathways is compared to explain the product selectivity.

Size-dependent free flexural vibration behavior of functionally graded nanoplates

In this paper, size dependent linear free flexural vibration behavior of functionally graded (FG) nanoplates are investigated using the iso-geometric based finite element method. The field variables are approximated by non-uniform rational B-splines. The nonlocal constitutive relation is based on Eringen's differential form of nonlocal elasticity theory. The material properties are assumed to vary only in the thickness direction and the effective properties for the FG plate are computed using Mori-Tanaka homogenization scheme. The accuracy of the present formulation is demonstrated considering the problems for which solutions are available. A detailed numerical study is carried out to examine the effect of material gradient index, the characteristic internal length, the plate thickness, the plate aspect ratio and the boundary conditions on the global response of the FG nanoplate. From the detailed numerical study it is seen that the fundamental frequency decreases with increasing gradient index and characteristic internal length. (c) 2012 Elsevier B.V. All rights reserved.

Acyclic Edge Coloring of Triangle-Free Planar Graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G) ? ? + 2, where ? = ?(G) denotes the maximum degree of the graph. If every induced subgraph H of G satisfies the condition |E(H)| ? 2|V(H)|-1, we say that the graph G satisfies Property A. In this article, we prove that if G satisfies Property A, then a'(G) ? ? + 3. Triangle-free planar graphs satisfy Property A. We infer that a'(G) ? ? + 3, if G is a triangle-free planar graph. Another class of graph which satisfies Property A is 2-fold graphs (union of two forests). (C) 2011 Wiley Periodicals, Inc. J Graph Theory

Microwave-assisted, surfactant-free synthesis of air-stable copper nanostructures and their SERS study

A simple, rapid, and surfactant-free synthesis of crystalline copper nanostructures has been carried out through microwave irradiation of a solution of copper acetylacetonate in benzyl alcohol. The structures are found to be stable against oxidation in ambient air for several months. High-resolution electron microscopy (SEM and TEM) reveals that the copper samples comprise nanospheres measuring about 150 nm in diameter, each made of copper nanocrystals similar to 7 nm in extension. The nanocrystals are densely packed into spherical aggregates, the driving force being minimization of surface area and surface energy, and are thus immune to oxidation in ambient air. Such aggregates can also be adherently supported on SiO2 and Al2O3 when these substrates are immersed in the irradiated solution. The air-stable copper nanostructures exhibit surface enhanced Raman scattering, as evidenced by the detection of 4-mercaptobenzoic acid at 10(-6) M concentrations.

Synthesis of free standing nanocrystalline Cu by ball milling at cryogenic temperature

This paper reports for the first time synthesis of free standing nano-crystalline copper crystals of a similar to 30-40 nm by ball milling of copper powder at 150 K under Argon atmosphere in a specially designed cryomill. The detailed characterization of these particles using multiple techniques that includes transmission electron microscopy confirms our conclusion. Careful analysis of the chemistry of these particles indicates that these particles are essentially contamination free. Through the analysis of existing models of grain size refinements during ball milling and low temperature deformation, we argue that the suppression of thermal processes and low temperature leads to formation of free nanoparticles as the process of fracture dominates over possible cold welding at low temperatures. (C) 2012 Elsevier B.V. All rights reserved.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.