Wrinkling of Atomic Planes in Ultrathin Au Nanowires

A detailed understanding of structure and stability of nanowires is critical for applications. Atomic resolution imaging of ultrathin single crystalline Au nanowires using aberration-corrected microscopy reveals an intriguing relaxation whereby the atoms in the close-packed atomic planes normal to the growth direction are displaced in the axial direction leading to wrinkling of the (111) atomic plane normal to the wire axis. First-principles calculations of the structure of such nanowires confirm this wrinkling phenomenon, whereby the close-packed planes relax to form saddle-like surfaces. Molecular dynamics studies of wires with varying diameters and different bounding surfaces point to the key role of surface stress on the relaxation process. Using continuum mechanics arguments, we show that the wrinkling arises due to anisotropy in the surface stresses and in the elastic response, along with the divergence of surface-induced bulk stress near the edges of a faceted structure. The observations provide new understanding on the equilibrium structure of nanoscale systems and could have important implications for applications in sensing and actuation.

Inferring biochemical routes from biochemical networks

Metabolism is a defining feature of life, and its study is important to understand how a cell works, alterations that lead to disease and for applications in drug discovery. From a systems perspective, metabolism can be represented as a network that captures all the metabolites as nodes and the inter-conversions among pairs of them as edges. Such an abstraction enables the networks to be studied by applying graph theory, particularly, to infer the flow of chemical information in the networks by identifying relevant metabolic pathways. In this study, different weighting schemes are used to illustrate that appropriately weighted networks can capture the quantitative cellular dynamics quite accurately. Thus, the networks now combine the elegance and simplicity of representation of the system and ease of analysing metabolic graphs. Metabolic routes or paths determined by this therefore are likely to be more biologically meaningful. The usefulness of the approach is demonstrated with two examples, first for understanding bacterial stress response and second for studying metabolic alterations that occurs in cancer cells.

beta gamma-fused turn structures in sugar amino acid (SAA) containing cyclic tetrapeptides with alpha 3 delta architecture

The current manuscript describes conformational analysis of 15-membered cyclic tetrapeptides (CTPs), with alpha 3 delta architecture, containing sugar amino acids (SAA) having variation in the stereocenter at C5 carbon. Conformational analyses of both the series, in protected and deprotected forms, were carried out in DMSO-d(6) using various NMR techniques, supported by restrained MD calculations. It was intriguing to notice that the alpha 3 delta macrocycles got stabilized by both 10-membered beta-turn as well as a seven-membered gamma-turn, fused within the same macrocycle. The presence of fused sub-structures within a 15-membered macrocycle is rare to see. Also, the stereocenter variation at C5 did not affect the fused turn structures and exhibited similar conformations in both the series. The design becomes highly advantageous as fused reverse turn structures are occurring in the cyclic structure with minimalistic size macrocycle and this can be applied to develop suitable pharmacophores in the drug development process. (C) 2014 Elsevier Ltd. All rights reserved.

Re-analysis of cryoEM data on HCV IRES bound to 40S subunit of human ribosome integrated with recent structural information suggests new contact regions between ribosomal proteins and HCV RNA

In this study, we combine available high resolution structural information on eukaryotic ribosomes with low resolution cryo-EM data on the Hepatitis C Viral RNA (IRES) human ribosome complex. Aided further by the prediction of RNA-protein interactions and restrained docking studies, we gain insights on their interaction at the residue level. We identified the components involved at the major and minor contact regions, and propose that there are energetically favorable local interactions between 40S ribosomal proteins and IRES domains. Domain II of the IRES interacts with ribosomal proteins S5 and S25 while the pseudoknot and the downstream domain IV region bind to ribosomal proteins S26, S28 and S5. We also provide support using UV cross-linking studies to validate our proposition of interaction between the S5 and IRES domains II and IV. We found that domain IIIe makes contact with the ribosomal protein S3a (S1e). Our model also suggests that the ribosomal protein S27 interacts with domain IIIc while S7 has a weak contact with a single base RNA bulge between junction IIIabc and IIId. The interacting residues are highly conserved among mammalian homologs while IRES RNA bases involved in contact do not show strict conservation. IRES RNA binding sites for S25 and S3a show the best conservation among related viral IRESs. The new contacts identified between ribosomal proteins and RNA are consistent with previous independent studies on RNA-binding properties of ribosomal proteins reported in literature, though information at the residue level is not available in previous studies.

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q >= 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Fixed-orientation equilateral triangle matching of point sets

Given a point set P and a class C of geometric objects, G(C)(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C is an element of C containing both p and q but no other points from P. We study G(del)(P) graphs where del is the class of downward equilateral triangles (i.e., equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to be equivalent to half-Theta(6) graphs and TD-Delaunay graphs. The main result in our paper is that for point sets P in general position, G(del)(P) always contains a matching of size at least vertical bar P vertical bar-1/3] and this bound is tight. We also give some structural properties of G(star)(P) graphs, where is the class which contains both upward and downward equilateral triangles. We show that for point sets in general position, the block cut point graph of G(star)(P) is simply a path. Through the equivalence of G(star)(P) graphs with Theta(6) graphs, we also derive that any Theta(6) graph can have at most 5n-11 edges, for point sets in general position. (C) 2013 Elsevier B.V. All rights reserved.

2-Connecting outerplanar graphs without blowing up the pathwidth

Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl 1], in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two-dimensional grid. In conjunction with the result of this paper, the constant factor approximation algorithm for this problem obtained by Biedl 1] for 2-vertex-connected outerplanar graphs will work for all outer planar graphs. (C) 2014 Elsevier B.V. All rights reserved.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

Synergetic effect of size and morphology of cobalt ferrite nanoparticles on proton relaxivity

Cobalt ferrite nanoparticles with average sizes of 14, 9 and 6 nm were synthesised by the chemical co-precipitation technique. Average particle sizes were varied by changing the chitosan surfactant to precursor molar ratio in the reaction mixture. Transmission electron microscopy images revealed a faceted and irregular morphology for the as-synthesised nanoparticles. Magnetic measurements revealed a ferromagnetic nature for the 14 and 9 nm particles and a superparamagnetic nature for the 6 nm particles. An increase in saturation magnetisation with increasing particle size was noted. Relaxivity measurements were carried out to determine T-2 value as a function of particle size using nuclear magnetic resonance measurements. The relaxivity coefficient increased with decrease in particle size and decrease in the saturation magnetisation value. The observed trend in the change of relaxivity value with particle size was attributed to the faceted nature of as-synthesised nanoparticles. Faceted morphology results in the creation of high gradient of magnetic field in the regions adjacent to the facet edges increasing the relaxivity value. The effect of edges in increasing the relaxivity value increases with decrease in the particle size because of an increase in the total number of edges per particle dispersion.

Effect of epitaxial strain on phase separation in thin films

In epitaxially grown alloy thin films, spinodal decomposition may be promoted or suppressed depending on the sign of the epitaxial strain. We study this asymmetry by extending Cahn's linear theory of spinodal decomposition to systems with a composition dependent lattice parameter and modulus (represented by Vegard's law coefficients, GRAPHICS] and y, respectively), and an imposed (epitaxial) strain (e). We show analytically (and confirm using simulations) that the asymmetric effect of epitaxial strains arises only in elastically inhomogeneous systems. Specifically, we find good agreement between analytical and simulation results for the wave number GRAPHICS] of the fastest growing composition fluctuation. The asymmetric effect due to epitaxial strain also extends to microstructure formation: our simulations show islands of elastically softer (harder) phase with (without) a favourable imposed strain. We discuss the implications of these results to GeSi thin films on Si and Ge substrates, as well as InGaAs films on GaAs substrates.

Two techniques to improve the precision of a demand-driven null-dereference verification approach

The problem addressed in this paper is sound, scalable, demand-driven null-dereference verification for Java programs. Our approach consists conceptually of a base analysis, plus two major extensions for enhanced precision. The base analysis is a dataflow analysis wherein we propagate formulas in the backward direction from a given dereference, and compute a necessary condition at the entry of the program for the dereference to be potentially unsafe. The extensions are motivated by the presence of certain ``difficult'' constructs in real programs, e.g., virtual calls with too many candidate targets, and library method calls, which happen to need excessive analysis time to be analyzed fully. The base analysis is hence configured to skip such a difficult construct when it is encountered by dropping all information that has been tracked so far that could potentially be affected by the construct. Our extensions are essentially more precise ways to account for the effect of these constructs on information that is being tracked, without requiring full analysis of these constructs. The first extension is a novel scheme to transmit formulas along certain kinds of def-use edges, while the second extension is based on using manually constructed backward-direction summary functions of library methods. We have implemented our approach, and applied it on a set of real-life benchmarks. The base analysis is on average able to declare about 84% of dereferences in each benchmark as safe, while the two extensions push this number up to 91%. (C) 2014 Elsevier B.V. All rights reserved.

LOWER BOUNDS FOR BOXICITY

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a closed interval of the form a(i),b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which are listed below: 1. The boxicity of a graph on n vertices with no universal vertices and minimum degree delta is at least n/2(n-delta-1). 2. Consider the g(n,p) model of random graphs. Let p <= 1 - 40logn/n(2.) Then with high `` probability, box(G) = Omega(np(1 - p)). On setting p = 1/2 we immediately infer that almost all graphs have boxicity Omega(n). Another consequence of this result is as follows: For any positive constant c < 1, almost all graphs on n vertices and m <= c((n)(2)) edges have boxicity Omega(m/n). 3. Let G be a connected k-regular graph on n vertices. Let lambda be the second largest eigenvalue in absolute value of the adjacency matrix of G. Then, the boxicity of G is a least (kappa(2)/lambda(2)/log(1+kappa(2)/lambda(2))) (n-kappa-1/2n). 4. For any positive constant c 1, almost all balanced bipartite graphs on 2n vertices and m <= cn(2) edges have boxicity Omega(m/n).

Electronic Structure of CH3NH3PbX3 Perovskites: Dependence on the Halide Moiety

A combination of measurements using photoelectron spectroscopy and calculations using density functional theory (DFT) was applied to compare the detailed electronic structure of the organolead halide perovskites CH3NH3PbI3 and CH3NH3PbBr3. These perovskite materials are used to absorb light in mesoscopic and planar heterojunction solar cells. The Pb 4f core level is investigated to get insight into the chemistry of the two materials. Valence level measurments are also included showing a shift of the valence band edges where there is a higher binding energy of the edge for the CH3NH3PbBr3 perovskite. These changes are supported by the theoretical calculations which indicate that the differences in electronic structure are mainly caused by the nature of the halide ion rather than structural differences. The combination of photoelectron spectroscopy measurements and electronic structure calculations is essential to disentangle how the valence band edge in organolead halide perovskites is governed by the intrinsic difference in energy levels of the halide ions from the influence of chemical bonding.