The fifth solvatomorph of gallic acid with a supramolecular channel structure: Structural complexity and phase transitions

A new solvatomorph of gallic acid was generated using chiral additive technique and characterized by single crystal and powder X-ray diffraction, C-13 NMR, IR spectroscopic techniques and thermal analysis. The supramolecular channels formed by hexameric motifs of gallic acid and solvent molecules contain highly disordered solvent molecules with fractional occupancies. © 2012 Elsevier B.V.

Mesh Simplification Based on Edge Collapsing Could Improve Computational Efficiency in Near Infrared Optical Tomographic Imaging

The diffusion equation-based modeling of near infrared light propagation in tissue is achieved by using finite-element mesh for imaging real-tissue types, such as breast and brain. The finite-element mesh size (number of nodes) dictates the parameter space in the optical tomographic imaging. Most commonly used finite-element meshing algorithms do not provide the flexibility of distinct nodal spacing in different regions of imaging domain to take the sensitivity of the problem into consideration. This study aims to present a computationally efficient mesh simplification method that can be used as a preprocessing step to iterative image reconstruction, where the finite-element mesh is simplified by using an edge collapsing algorithm to reduce the parameter space at regions where the sensitivity of the problem is relatively low. It is shown, using simulations and experimental phantom data for simple meshes/domains, that a significant reduction in parameter space could be achieved without compromising on the reconstructed image quality. The maximum errors observed by using the simplified meshes were less than 0.27% in the forward problem and 5% for inverse problem.

Computational algorithms inspired by biological processes and evolution

In recent times computational algorithms inspired by biological processes and evolution are gaining much popularity for solving science and engineering problems. These algorithms are broadly classified into evolutionary computation and swarm intelligence algorithms, which are derived based on the analogy of natural evolution and biological activities. These include genetic algorithms, genetic programming, differential evolution, particle swarm optimization, ant colony optimization, artificial neural networks, etc. The algorithms being random-search techniques, use some heuristics to guide the search towards optimal solution and speed-up the convergence to obtain the global optimal solutions. The bio-inspired methods have several attractive features and advantages compared to conventional optimization solvers. They also facilitate the advantage of simulation and optimization environment simultaneously to solve hard-to-define (in simple expressions), real-world problems. These biologically inspired methods have provided novel ways of problem-solving for practical problems in traffic routing, networking, games, industry, robotics, economics, mechanical, chemical, electrical, civil, water resources and others fields. This article discusses the key features and development of bio-inspired computational algorithms, and their scope for application in science and engineering fields.

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.

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.

DMT-optimal, Low ML-Complexity STBC-Schemes for Asymmetric MIMO Systems

For an n(t) transmit, nr receive antenna (n(t) x n(r)) MIMO system with quasi- static Rayleigh fading, it was shown by Elia et al. that space-time block code-schemes (STBC-schemes) which have the non-vanishing determinant (NVD) property and are based on minimal-delay STBCs (STBC block length equals n(t)) with a symbol rate of n(t) complex symbols per channel use (rate-n(t) STBC) are diversity-multiplexing gain tradeoff (DMT)-optimal for arbitrary values of n(r). Further, explicit linear STBC-schemes (LSTBC-schemes) with the NVD property were also constructed. However, for asymmetric MIMO systems (where n(r) < n(t)), with the exception of the Alamouti code-scheme for the 2 x 1 system and rate-1, diagonal STBC-schemes with NVD for an nt x 1 system, no known minimal-delay, rate-n(r) LSTBC-scheme has been shown to be DMT-optimal. In this paper, we first obtain an enhanced sufficient criterion for an STBC-scheme to be DMT optimal and using this result, we show that for certain asymmetric MIMO systems, many well-known LSTBC-schemes which have low ML-decoding complexity are DMT-optimal, a fact that was unknown hitherto.

Single nucleotide polymorphisms in genes that are common targets of luteotropin and luteolysin in primate corpus luteum: Computational exploration

Luteal insufficiency affects fertility and hence study of mechanisms that regulate corpus luteum (CL) function is of prime importance to overcome infertility problems. Exploration of human genome sequence has helped to study the frequency of single nucleotide polymorphisms (SNPs). Clinical benefits of screening SNPs in infertility are being recognized well in recent times. Examining SNPs in genes associated with maintenance and regression of CL may help to understand unexplained luteal insufficiency and related infertility. Publicly available microarray gene expression databases reveal the global gene expression patterns in primate CL during the different functional state. We intend to explore computationally the deleterious SNPs of human genes reported to be common targets of luteolysin and luteotropin in primate CL Different computational algorithms were used to dissect out the functional significance of SNPs in the luteinizing hormone sensitive genes. The results raise the possibility that screening for SNPs might be integrated to evaluate luteal insufficiency associated with human female infertility for future studies. (C) 2012 Elsevier B.V. All rights reserved,

Computational tools for mechanistic discrimination in the reductive and metathesis coupling reactions mediated by titanium(IV) isopropoxide

A theoretical study has been carried out at the B3LYP/LANL2DZ level to compare the reactivity of phenyl isocyanate and phenyl isothiocyanate towards titanium(IV) alkoxides. Isocyanates are shown to favour both mono insertion and double insertion reactions. Double insertion in a head-to-tail fashion is shown to be more exothermic than double insertion in a head-to-head fashion. The head-to-head double insertion leads to the metathesis product, a carbodiimide, after the extrusion of carbon dioxide. In the case of phenyl isothiocyanate, calculations favour the formation of only mono insertion products. Formation of a double insertion product is highly unfavourable. Further, these studies indicate that the reverse reaction involving the metathesis of N,N-'-diphenyl carbodiimide with carbon dioxide is likely to proceed more efficiently than the metathesis reaction with carbon disulphide. This is in excellent agreement with experimental results as metathesis with carbon disulphide fails to occur. In a second study, multilayer MM/QM calculations are carried out on intermediates generated from reduction of titanium(IV) alkoxides to investigate the effect of alkoxy bridging on the reactivity of multinuclear Ti species. Bimolecular coupling of imines initiated by Ti(III) species leads to a mixture of diastereomers and not diastereoselective coupling of the imine. However if the reaction is carried out by a trimeric biradical species, diastereoselective coupling of the imine is predicted. The presence of alkoxy bridges greatly favours the formation of the d,l (+/-) isomer, whereas the intermediate without alkoxy bridges favours the more stable meso isomer. As a bridged trimeric species, stabilized by bridging alkoxy groups, correctly explains the diastereoselective reaction, it is the most likely intermediate in the reaction.

Air oxygenation chemistry of 4-TBC catalyzed by chloro bridged dinuclear copper(II) complexes of pyrazole based tridentate ligands: synthesis, structure, magnetic and computational studies

Four dinuclear bis(mu-Cl) bridged copper(II) complexes, Cu-2(mu-Cl)(2)(L-X)(2)](ClO4)(2) (L-X = N,N-bis(3,5-dimethylpyrazole-1-yl)-methyl]benzylamine with X = H(1), OMe(2), Me(3) and Cl(4)), have been synthesized and characterized by the single crystal X-ray diffraction method. In these complexes, each copper(II) center is penta-coordinated with square-pyramidal geometry. In addition to the tridentate L-X ligand, a chloride ion occupies the last position of the square plane. This chloride ion is also bonded to the neighboring Cu(II) site in its axial position forming an SP-I dinuclear Cu(II) unit that exhibits small intramolecular ferromagnetic interactions and supported by DFT calculations. The complexes 1-3 exhibit methylmonooxygenase (pMMO) behaviour and oxidise 4-tert-butylcatechol (4-TBCH2) with molecular oxygen in MeOH or MeCN to 4-tert-butyl-benzoquinone (4-TBQ), 5-methoxy-4-tert-butyl-benzoquinone (5-MeO-4-TBQ) as the major products along with 6,6'-Bu-t-biphenyl-3,4,3',4'-tetraol and others as minor products. These are further confirmed by ESI- and FAB-mass analyses. A tentative catalytic cycle has been framed based on the mass spectral analysis of the products and DFT calculations on individual intermediates that are energetically feasible.

An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs

A low complexity, essentially-ML decoding technique for the Golden code and the three antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs)-the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity, and we give a set of sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the three and four antenna Perfect codes, the three antenna Threaded Algebraic Space-Time code and the four antenna rate 2 code of Srinath and Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm have the least decoding complexity and best error performance among all known codes for transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding implementation.

Perspectives on Titanium Science and Technology

The basic framework and - conceptual understanding of the metallurgy of Ti alloys is strong and this has enabled the use of titanium and its alloys in safety-critical structures such as those in aircraft and aircraft engines. Nevertheless, a focus on cost-effectiveness and the compression of product development time by effectively integrating design with manufacturing in these applications, as well as those emerging in bioengineering, has driven research in recent decades towards a greater predictive capability through the use of computational materials engineering tools. Therefore this paper focuses on the complexity and variety of fundamental phenomena in this material system with a focus on phase transformations and mechanical behaviour in order to delineate the challenges that lie ahead in achieving these goals. (C) 2012 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Low complexity adaptation for channel shortening equalizers

Since the days of Digital Subscriber Links(DSL), Time Domain Equalizers(TEQ's) have been used to combat time dispersive channels in Multicarrier Systems. In this paper, we propose computationally inexpensive techniques to recompute TEQ weights in the presence of changes in the channel, especially over fast fading channels. The techniques use no extra information except the perturbation itself, and provide excellent approximations to the new TEQ weights. The proposed adaptation techniques are shown to perform admirably well for small changes in channels for OFDM systems.

Minimizing the complexity of fast sphere decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Computational studies on histidine kinase protein BaeS to target multidrug-resistant Salmonella

Multidrug-resistant Salmonella serovars have been a recent concern in curing infectious diseases like typhoid. Salmonella BaeS and BaeR are the two-component system (TCS) that signal transduction proteins found to play an important role in its multidrug resistance. A canonical TCS comprises a histidine kinase (HK) and its cognate partner response regulator (RR). The general approaches for therapeutic targeting are either the catalytic ATP-binding domain or the dimerization domain HisKA (DHp) of the HK, and in some cases, the receiver or the regulatory domain of the RR proteins. Earlier efforts of identifying novel drugs targeting the signal transduction protein have not been quite successful, as it shares similar ATP-binding domain with the key house keeping gene products of the mammalian GHL family. However, targeting the dimerization domain of HisKA through which the signals are received from the RR can be a better approach. In this article, we show stepwise procedure to specifically identify the key interacting residues involved in the dimerization with the RR along with effective targeting by ligands screened from the public database. We have found a few inhibitors which target effectively the important residues for the dimerization activity. Our results suggest a plausible de novo design of better DHp domain inhibitors.

Computational interrogation of cis-regulatory elements of genes that are common targets of luteotropin and luteolysin in the primate corpus luteum

The rapid recent increase in microarray-based gene expression studies in the corpus luteum (CL) utilizing macaque models gathered increasing volume of data in publically accessible microarray expression databases. Examining gene pathways in different functional states of CL may help to understand the factors that control luteal function and hence human fertility. Co-regulation of genes in microarray experiments may imply common transcriptional regulation by sequence-specific DNA-binding transcriptional factors. We have computationally analyzed the transcription factor binding sites (TFBS) in a previously reported macaque luteal microarray gene set (n = 15) that are common targets of luteotropin (luteinizing hormone (LH) and human chorionic gonadotropin (hCG)) and luteolysin (prostaglandin (PG) F-2 alpha). This in silico approach can reveal transcriptional networks that control these important genes which are representative of the interplay between luteotropic and luteolytic factors in the control of luteal function. Our computational analyses revealed 6 matrix families whose binding sites are significantly over-represented in promoters of these genes. The roles of these factors are discussed, which might help to understand the transcriptional regulatory network in the control of luteal function. These factors might be promising experimental targets for investigation of human luteal insufficiency. (C) 2012 Elsevier B.V. All rights reserved.