Approaches toward (eta(2)-HX) (X = H, SiR (R = Me-3 or Me2Ph), CH3) sigma-complexes of ruthenium

Two new Ru(II)-complexes RuH(Tpms)(PPh3)(2)] 1 (Tpms - (C3H3N2)(3)CSO3, tris-(pyrazolyl) methane sulfonate) and Ru(OTf)(Tpms)(PPh3)(2)] 2 (OTf = CF3SO3) have been synthesized and characterized wherein Ru-H and Ru-OTf are the key reactive centers. Reaction of 1 with HOTf results in the Ru(eta(2)-H-2)(Tpms)(PPh3)(2)]OTf] complex 3, whereas reaction of 1 with Me3SiOTf affords the dihydrogen complex 3 and complex 1 through an unobserved sigma-silane intermediate. In addition, an attempt to characterize the sigma methane complex via reaction of complex 1 with CH3OTf yields complex 2 and free methane. On the other hand, reaction of Ru(OTf)(Tpms)(PPh3)(2)] 2 with H-2 and PhMe2SiH at low temperature resulted in sigma-H-2, 3 and a probable sigma-silane complexes, respectively. However, no sigma-methane complex was observed for the reaction of complex 2 with methane even at low temperature. (C) 2014 Elsevier B. V. All rights reserved.

C. N. R. Rao and the Growth of Solid State and Materials Chemistry as a Central Domain of Research

In celebrating Professor C. N. R. Rao's 80th birthday, this article recalls his singular contributions to solid state and materials chemistry for about sixty years. In so doing, the article also traces the growth of the field as a central domain of research in chemical sciences from its early origins in Europe. Although Rao's major work lies in solid state and materials chemistry - a field which he started and nurtured in India while its importance was being recognized internationally - his contributions to other areas of chemistry (and physics), viz., molecular spectroscopy, phase transitions, fullerenes, graphene, nanomaterials and multiferroics are equally significant. Illustrative examples of his work devoted to rare earth and transition metal oxides, defects and nonstoichiometry, metal-insulator transitions, investigation of crystal and electronic structures of a variety of solids by means of electron microscopies and photoelectron spectroscopy, superconducting cuprates, magnetoresistive manganites, multiferroic metal oxides of various structures and, last but not the least, development of new strategies for chemical synthesis of a wide variety of solids including nanomaterials and framework solids in different dimensionalities, are highlighted. The article also captures his exemplary role as a science teacher, science educationist and institution builder in post-Independence India.

Rethinking production of Taxol (R) (paclitaxel) using endophyte biotechnology

Taxol (R) (generic name paclitaxel) represents one of the most clinically valuable natural products known to mankind in the recent past. More than two decades have elapsed since the notable discovery of the first Taxol (R) producing endophytic fungus, which was followed by a plethora of reports on other endophytes possessing similar biosynthetic potential. However, industrial-scale Taxol (R) production using fungal endophytes, although seemingly promising, has not seen the light of the day. In this opinion article, we embark on the current state of knowledge on Taxol (R) biosynthesis focusing on the chemical ecology of its producers, and ask whether it is actually possible to produce Taxol (R) using endophyte biotechnology. The key problems that have prevented the exploitation of potent endophytic fungi by industrial bioprocesses for sustained production of Taxol (R) are discussed.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Upper Bounds on the Size of Grain-Correcting Codes

In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on hypergraph fractional coverings. The exception is a bound derived via an information-theoretic argument. Our bounds significantly improve upon existing bounds from the prior literature.

Digestive ripening and green synthesis of ultra-small (r < 2 nm) stable ZnO quantum dots

Given the recent reports pertaining to novel optical properties of ultra-small quantum dots (QDs) (r <2 nm), this nanomaterial is of relevance to both technology and science. However it is well known that in these size regimes most chalocogenide QD dispersions are unstable. Since applications often require use of QD dispersions (e.g. for deployment on a substrate), stabilizing these ultra-small particles is of practical relevance. In this work we demonstrate a facile, green, solution approach for synthesis of stable, ultra-small ZnO QDs having radius less than 2 nm. The particle size is calculated using Brits' equation and confirmed by transmission electron micrographs. ZnO QDs reported remain stable for > 120 days in ethanol (at similar to 298-303 K). We report digestive ripening (DR) in TEA capped ZnO QDs; this occurs rapidly over a short duration of 5 min. To explain this observation we propose a suitable mechanism based on the Lee's theory, which correlates the tendency of DR with the observed zeta potentials of the dispersed medium. To the best of our knowledge this is the (i) first report on DR in oxide QDs, as well as the first direct experimental verification of Lee's theory, and (ii) most rapid DR reported so far. The facile nature of the method presented here makes ultra-small ZnO readily accessible for fundamental exploration and technologically relevant applications. (C) 2014 Elsevier Ltd and Techna Group S.r.l. All rights reserved.

Temperature-Induced Reversible First-Order Single Crystal to Single Crystal Phase Transition in Boc-gamma(4)(R)Val-Val-OH: Interplay of Enthalpy and Entropy

Crystals of Boc-gamma y(4)(R)Val-Val-OH undergo a reversible first-order single crystal to single crystal phase transition at T-c approximate to 205 K from the orthorhombic space group P22(1)2(1) (Z' = 1) to the monoclinic space group P2(1) (Z' = 2) with a hysteresis of similar to 2.1 K. The low-temperature monoclinic form is best described as a nonmerohedral twin with similar to 50% contributions from its two components. The thermal behavior of the dipeptide crystals was characterized by differential scanning calorimetry experiments. Visual changes in birefringence of the sample during heating and cooling cycles on a hot-stage microscope with polarized light supported the phase transition. Variable-temperature unit cell check measurements from 300 to 100 K showed discontinuity in the volume and cell parameters near the transition temperature, supporting the first-order behavior. A detailed comparison of the room-temperature orthorhombic form with the low-temperature (100 K) monoclinic form revealed that the strong hydrogen-bonding motif is retained in both crystal systems, whereas the non-covalent interactions involving side chains of the dipeptide differ significantly, leading to a small change in molecular conformation in the monoclinic form as well as a small reorientation of the molecules along the ac plane. A rigid-body thermal motion analysis (translation, libration, screw; correlation of translation and libration) was performed to study the crystal entropy. The reversible nature of the phase transition is probably the result of an interplay between enthalpy and entropy: the low-temperature monoclinic form is enthalpically favored, whereas the room-temperature orthorhombic form is entropically favored.

OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(2) <= d - k +1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

Graded IR Filters: Distinguishing Between Single and Multipoint NO2 center dot center dot center dot I Halogen Bonded Supramolecular Synthons (P, Q, and R Synthons)

The NO2 center dot center dot center dot I supramolecular synthon is a halogen bonded recognition pattern that is present in the crystal structures of many compounds that contain these functional groups. These synthons have been previously distinguished as P, Q, and R types using topological and geometrical criteria. A five step IR spectroscopic sequence is proposed here to distinguish between these synthon types in solid samples. Sets of known compounds that contain the P, Q, and R synthons are first taken to develop IR spectroscopic identifiers for them. The identifiers are then used to create graded IR filters that sieve the synthons. These filters contain signatures of the individual NO2 center dot center dot center dot I synthons and may be applied to distinguish between P, Q, and R synthon varieties. They are also useful to identify synthons that are of a borderline character, synthons in disordered structures wherein the crystal structure in itself is not sufficient to distinguish synthon types, and in the identification of the NO2 center dot center dot center dot I synthons in compounds with unknown crystal structures. This study establishes clear differences for the three different geometries P, Q, and Rand in the chemical differences in the intermolecular interactions contained in the synthons. Our IR method can be conveniently employed when single crystals are not readily available also in high throughput analysis. It is possible that such identification may also be adopted as an input for crystal structure prediction analysis of compounds with unknown crystal structures.

A Matroidal Framework for Network-Error Correcting Codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. A particularly interesting feature of this development is the ability to construct (scalar and vector) linearly solvable networks using certain classes of matroids. Furthermore, it was shown through the connection between network coding and matroid theory that linear network coding is not always sufficient for general network coding scenarios. The current work attempts to establish a connection between matroid theory and network-error correcting and detecting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of linear network-error detecting codes to arrive at the definition of a matroidal error detecting network (and similarly, a matroidal error correcting network abstracting from network-error correcting codes). An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error detecting (correcting) network code if and only if it is a matroidal error detecting (correcting) network associated with a representable matroid. Therefore, constructing such network-error correcting and detecting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa. We then present algorithms that enable the construction of matroidal error detecting and correcting networks with a specified capability of network-error correction. Using these construction algorithms, a large class of hitherto unknown scalar linearly solvable networks with multisource, multicast, and multiple-unicast network-error correcting codes is made available for theoretical use and practical implementation, with parameters, such as number of information symbols, number of sinks, number of coding nodes, error correcting capability, and so on, being arbitrary but for computing power (for the execution of the algorithms). The complexity of the construction of these networks is shown to be comparable with the complexity of existing algorithms that design multicast scalar linear network-error correcting codes. Finally, we also show that linear network coding is not sufficient for the general network-error correction (detection) problem with arbitrary demands. In particular, for the same number of network errors, we show a network for which there is a nonlinear network-error detecting code satisfying the demands at the sinks, whereas there are no linear network-error detecting codes that do the same.

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated with small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan et al, in which recovery from a single erasure is considered. By studying the generalized Hamming weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Turan graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from 2 erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

While the tradeoff between the amount of data stored and the repair bandwidth of an (n, k, d) regenerating code has been characterized under functional repair (FR), the case of exact repair (ER) remains unresolved. It is known that there do not exist ER codes which lie on the FR tradeoff at most of the points. The question as to whether one can asymptotically approach the FR tradeoff was settled recently by Tian who showed that in the (4, 3, 3) case, the ER region is bounded away from the FR region. The FR tradeoff serves as a trivial outer bound on the ER tradeoff. In this paper, we extend Tian's results by establishing an improved outer bound on the ER tradeoff which shows that the ER region is bounded away from the FR region, for any (n; k; d). Our approach is analytical and builds upon the framework introduced earlier by Shah et. al. Interestingly, a recently-constructed, layered regenerating code is shown to achieve a point on this outer bound for the (5, 4, 4) case. This represents the first-known instance of an optimal ER code that does not correspond to a point on the FR tradeoff.

Sparse coding based VLAD for efficient image retrieval

Representing images and videos in the form of compact codes has emerged as an important research interest in the vision community, in the context of web scale image/video search. Recently proposed Vector of Locally Aggregated Descriptors (VLAD), has been shown to outperform the existing retrieval techniques, while giving a desired compact representation. VLAD aggregates the local features of an image in the feature space. In this paper, we propose to represent the local features extracted from an image, as sparse codes over an over-complete dictionary, which is obtained by K-SVD based dictionary training algorithm. The proposed VLAD aggregates the residuals in the space of these sparse codes, to obtain a compact representation for the image. Experiments are performed over the `Holidays' database using SIFT features. The performance of the proposed method is compared with the original VLAD. The 4% increment in the mean average precision (mAP) indicates the better retrieval performance of the proposed sparse coding based VLAD.

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the help-by-transfer property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a nontrivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.