Obtaining Synthon Modularity in Ternary Cocrystals with Hydrogen Bonds and Halogen Bonds

Design of ternary cocrystals based on synthon modularity is described. The strategy is based on the idea of extending synthon modularity in binary cocrystals of 4-hydroxybenzamide:dicarboxylic acids and 4-bromobenzamide:dicarboxylic acids. If a system contains an amide group along with other functional groups, one of which is a carboxylic acid group, the amide associates preferentially with the carboxylic acid group to form an acidamide heterosynthon. If the amide and the acid groups are in different molecules, a higher multicomponent molecular crystal is obtained. This is a stable pattern that can be used to increase the number of components from two to three in a multicomponent system. Accordingly, noncovalent interactions are controlled in the design of ternary cocrystals in a more predictable manner. If a single component crystal with the amideamide dimer is considered, modularity is retained even after formation of a binary cocrystal with acidamide dimers. Similarly, when third component halogen atom containing molecules are introduced into these binary cocrystals, modularity is still retained. Here, we use acidamide and Br/I center dot center dot center dot O2N supramolecular synthons to obtain modularity in nine ternary cocrystals. The acidamide heterosynthon is robust to all the nine cocrystals. Heterosynthons may assist ternary cocrystal formation when there is a high solubility difference between the coformers. For a successful crystal engineering strategy for ternary cocrystals, one must consider the synthon itself and factors like shape and size of the component molecules, as well as the solubilities of the compounds.

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.

Synthesis and crystal structure of copper (II) uracil ternary polymeric complex with 1,10-phenanthroline along with the Hirshfeld surface analysis of the metal binding sites for the uracil ligand

The study of models for ``metal-enzyme-substrate'' interaction has been a proactive area of research owing to its biological and pharmacological importance. In this regard the ternary copper uracil complex with 1,10-phenanthroline represents metal-enzyme-substrate system for DNA binding enzymes. The synthesis of the complex, followed by slow evaporation of the reaction mixture forms two concomitant solvatomorph crystals viz., {Cu(phen)(mu-ura)(H2O)](n)center dot H2O (1a)} and {Cu(phen)(mu-ura)(H2O)](n)center dot CH3OH (1b)}. Both complexes are structurally characterized, while elemental analysis, IR and EPR spectra were recorded for 1b (major product). In both complexes, uracil coordinates uniquely via N1 and N3 nitrogen atom acting as a bidentate bridging ligand forming a 1-D polymer. The two solvatomorphs were quantitatively analyzed for the differences with the aid of Hirshfeld surface analysis. (C) 2014 Elsevier B.V. All rights reserved.

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.

Narrow band gap conjugated polymer for improving the photovoltaic performance of P3HT:PCBM ternary blend bulk heterojunction solar cells

A new D-A structured conjugated polymer (PBDO-T-TDP) based on electron-rich benzo 1,2-b:4,5-b'] difuran (BDO) containing conjugated alkylthiophene side chains with an electron-deficient diketopyrrolopyrrole (DPP) derivative is designed and synthesized. The polymer shows a narrow band gap with broad UV-Visible absorption spectra, which is in contrast to that of the P3HT:PCBM binary blend. Furthermore, its energy levels can meet the energetic requirement of the cascaded energy levels of P3HT and PCBM. Therefore, PBDO-T-TDP is used as a sensitizer in P3HT: PCBM based BHJ solar cells and its effect on their photovoltaic properties was investigated by blending them together at various weight ratios. It is observed that the resulting ternary blend system exhibited a significant improvement in the device performance (similar to 3.10%) as compared with their binary ones (similar to 2.15%). Such an enhancement in the ternary blend system is ascribed to their balanced hole and electron mobility along with uniform distribution of PBDO-T-TDP in the blend system, as revealed by organic field effect transistors and AFM studies.

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.

Modelling ternary effects on antiphase boundary energy of Ni3Al

The shearing of ordered gamma' precipitates by matrix dislocations results in the formation of antiphase boundaries (APB) in Ni-base superalloys. The APB energy is an important source of order-strengthening in disk and blade alloys where Ti and Ta substitute for Al in gamma'. While the importance of APB energy is well-acknowledged, the effect of alloying on APB energy is not fully understood. In the present study, the effect of Ti and Ta additions on the {111} and {010} APB energies was probed via electronic structure calculations. Results suggest that at low levels of Ti/Ta, APB energies on either plane increases with alloying. However, at higher Ti/Ta levels, the APB energies decrease with alloying. These trends understood by accounting for nearest neighbour violations about the APB and additionally, invoking the effect of precipitate composition on the energy penalty of the violations. We propose an Environment Dependent Nearest Neighbour Bond (EDNNB) model that predicts APB energies that are in close agreement to calculated values.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

Interdiffusion and solid solution strengthening in Ni-Co-Pt and Ni-Co-Fe ternary systems

Diffusion couple experiments are conducted in Co-Ni-Pt system at 1200 degrees C and in Co-Ni-Fe system at 1150 degrees C, by coupling binary alloys with the third element. Uphill diffusion is observed for both Co and Ni in Pt rich corner of the Co-Ni-Pt system, whereas in the Co-Ni-Fe system, it is observed for Co. Main and cross interdiffusion coefficients are calculated at the composition of intersection of two independent diffusion profiles. In both the systems, the main interdiffusion coefficients are positive over the whole composition range and the cross interdiffusion coefficients show both positive and negative values at different regions. Hardness measured by performing the nanoindentations on diffusion couples of both the systems shows the higher values at intermediate compositions.

On the Bounds of Certain Maximal Linear Codes in a Projective Space

The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) + dim(Y)-2dim(X boolean AND Y) defined on P-q(n) turns it into a natural coding space for error correction in random network coding. A subset of P-q(n) is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of P-q(n). Braun et al. conjectured that the largest cardinality of a linear code, that contains F-q(n), is 2(n). In this paper, we prove this conjecture and characterize the maximal linear codes that contain F-q(n).

Combinatorial selection of molecular conformations and supramolecular synthons in quercetin cocrystal landscapes: a route to ternary solids

The crystallization of 28 binary and ternary cocrystals of quercetin with dibasic coformers is analyzed in terms of a combinatorial selection from a solution of preferred molecular conformations and supramolecular synthons. The crystal structures are characterized by distinctive O-H center dot center dot center dot N and O-H center dot center dot center dot O based synthons and are classified as nonporous, porous and helical. Variability in molecular conformation and synthon structure led to an increase in the energetic and structural space around the crystallization event. This space is the crystal structure landscape of the compound and is explored by fine-tuning the experimental conditions of crystallization. In the landscape context, we develop a strategy for the isolation of ternary cocrystals with the use of auxiliary template molecules to reduce the molecular and supramolecular `confusion' that is inherent in a molecule like quercetin. The absence of concomitant polymorphism in this study highlights the selectivity in conformation and synthon choice from the virtual combinatorial library in solution.

Combinatorial crystal synthesis of ternary solids based on 2-methylresorcinol

Cocrystallization experiments of 2-methylresorcinol with several N-bases were performed to identify selective and preferred crystallization routes in relevant structural landscapes. These preferred supramolecular synthon-based crystallization routes were further enhanced by using carefully chosen coformer combinations to synthesize stoichiometric ternary solids. The exercise consists of modular selection and amplification of supramolecular synthons from single through two-to three-component molecular solids, and is equivalent to solid state combinatorial synthesis.

Photocytotoxic ternary copper(II) complexes of histamine Schiff base and pyridyl ligands

Ternary copper(Il) complexes of salicylaldehyde-histamine Schiff base (HL) and pyridyl ligands, viz. Cu(bpy)(L)](ClO4) (1) and Cu(dppz)(L)](C104) (2), where bpy is 2,2'-bipyridine (in 1) and dppz is dipyrido3,2-a:2',3'-c]phenazine (in 2), were synthesized, characterized and their DNA binding, photo-activated DNA cleavage activity and photocytotoxicity studied. The 1:1 electrolytic one-electron paramagnetic complexes showed a d-d band near 670 nm in aqueous DMF (1:1 v/v). The crystal structure of complex 1 showed the metal in CuN4O distorted square-pyramidal geometry. Complex 2 intercalatively binds to calf-thymus (ct) DNA with a binding constant (K-b) of similar to 10(5) M-1. It exhibited moderate chemical nuclease activity but excellent DNA photocleavage activity in red light of 647 nm forming (OH)-O-center dot radicals. It showed remarkable photocytotoxicity in human cervical cancer cells (HeLa) giving IC50 of 1.6 mu M in visible light (400-700 nm) with low dark toxicity. The photo-induced cell death is via generation of oxidative stress by reactive oxygen species.