Fourfold Helical Structures for Polypeptides

Fourfold helical structures for polypeptides and their association in regular lattices with interchain hydrogen bonds were investigated by model building studies. These studies revealed that stereochemically satisfactory fourfold helical sturctures are possible for polyglycine, polyproline, and copolymers of glycine and proline with two and four units in the monomer. In these structures the unit height h for the backbone has been found to be restricted from 2.7 to 3.1 k, with four peptide units per turn of the helix. Energetically both fourfold and threefold helical structures are equally favorable.

Cooling of an infinite slab in a two-fluid medium

A mixed boundary-valued problem associated with the diffusion equation, that involves the physical problem of cooling of an infinite slab in a two-fluid medium, is solved completely by using the Wiener-Hopf technique. An analytical solution is derived for the temperature distribution at the quench fronts being created by two different layers of cold fluids having different cooling abilities moving on the upper surface of the slab at constant speed. Simple expressions are derived for the values of the sputtering temperatures of the slab at the points of contact with the respective layers, assuming one layer of the fluid to be of finite extent and the other of infinite extent. The main problem is solved through a three-part Wiener - Hopf problem of a special type, and the numerical results under certain special circumstances are obtained and presented in the form of a table.

Folding of a Donor-Containing Ionene by Intercalation with an Acceptor

Cationic ionenes that bear electron-rich 1,5-dialkoxynaphthalene (DAN) units within the alkylene segment were allowed to interact with different types of electron-deficient, acceptor-containing molecules in an effort to realize intercalation-induced folding of the ionenes; the collapse of the chains was expected to occur in such a way that the donor and acceptor units become arranged in an alternating fashion. Several acceptor-bearing molecules were prepared by the derivatization of pyromellitic dianhydride and naphthalene tetracarboxylic dianhydride with two different oligoethylene glycol monomethyl ether monoamines. This yielded acceptor molecules with different water solubility and allowed the examination of solvophobic effects in the folding process. UV/Vis spectroscopic studies were carried out by using a 1:1 mixture of the DAN-ionenes and different acceptor molecules in water/DMSO solvent mixtures. The intensity of the charge-transfer (CT) band was seen to increase with the water content in the solvent mixture, thereby suggesting that the intercalation is indeed aided by solvophobic effects. The naphthalene diimide (NDI) bearing acceptor molecules consistently formed significantly stronger CT complexes when compared to the pyromellitic diimide (PDI) bearing acceptor molecules, which is a reflection of the stronger pi-stacking tendency of the former. AFM studies of drop-cast films of different ionene-acceptor combinations revealed that compact folded structures are formed most effectively under conditions in which the strongest CT complex is formed.

Learning the global maximum with parameterized learning automata

A feedforward network composed of units of teams of parameterized learning automata is considered as a model of a reinforcement teaming system. The internal state vector of each learning automaton is updated using an algorithm consisting of a gradient following term and a random perturbation term. It is shown that the algorithm weakly converges to a solution of the Langevin equation implying that the algorithm globally maximizes an appropriate function. The algorithm is decentralized, and the units do not have any information exchange during updating. Simulation results on common payoff games and pattern recognition problems show that reasonable rates of convergence can be obtained.

Compiler-assisted energy optimization for clustered VLIW processors

Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Although clustering helps by improving the clock speed, reducing the energy consumption of the logic, and making the design simpler, it introduces extra overheads by way of inter-cluster communication. This communication happens over long global wires having high load capacitance which leads to delay in execution and significantly high energy consumption. Inter-cluster communication also introduces many short idle cycles, thereby significantly increasing the overall leakage energy consumption in the functional units. The trend towards miniaturization of devices (and associated reduction in threshold voltage) makes energy consumption in interconnects and functional units even worse, and limits the usability of clustered architectures in smaller technologies. However, technological advancements now permit the design of interconnects and functional units with varying performance and power modes. In this paper, we propose scheduling algorithms that aggregate the scheduling slack of instructions and communication slack of data values to exploit the low-power modes of functional units and interconnects. Finally, we present a synergistic combination of these algorithms that simultaneously saves energy in functional units and interconnects to improves the usability of clustered architectures by achieving better overall energy-performance trade-offs. Even with conservative estimates of the contribution of the functional units and interconnects to the overall processor energy consumption, the proposed combined scheme obtains on average 8% and 10% improvement in overall energy-delay product with 3.5% and 2% performance degradation for a 2-clustered and a 4-clustered machine, respectively. We present a detailed experimental evaluation of the proposed schemes. Our test bed uses the Trimaran compiler infrastructure. (C) 2012 Elsevier Inc. All rights reserved.

Coalescent Method in Conjunction with Niche Modeling Reveals Cryptic Diversity among Centipedes in the Western Ghats of South India

Background: There has been growing interest in integrative taxonomy that uses data from multiple disciplines for species delimitation. Typically, in such studies, monophyly is taken as a proxy for taxonomic distinctiveness and these units are treated as potential species. However, monophyly could arise due to stochastic processes. Thus here, we have employed a recently developed tool based on coalescent approach to ascertain the taxonomic distinctiveness of various monophyletic units. Subsequently, the species status of these taxonomic units was further tested using corroborative evidence from morphology and ecology. This inter-disciplinary approach was implemented on endemic centipedes of the genus Digitipes (Attems 1930) from the Western Ghats (WG) biodiversity hotspot of India. The species of the genus Digitipes are morphologically conserved, despite their ancient late Cretaceous origin. Principal Findings: Our coalescent analysis based on mitochondrial dataset indicated the presence of nine putative species. The integrative approach, which includes nuclear, morphology, and climate datasets supported distinctiveness of eight putative species, of which three represent described species and five were new species. Among the five new species, three were morphologically cryptic species, emphasizing the effectiveness of this approach in discovering cryptic diversity in less explored areas of the tropics like the WG. In addition, species pairs showed variable divergence along the molecular, morphological and climate axes. Conclusions: A multidisciplinary approach illustrated here is successful in discovering cryptic diversity with an indication that the current estimates of invertebrate species richness for the WG might have been underestimated. Additionally, the importance of measuring multiple secondary properties of species while defining species boundaries was highlighted given variable divergence of each species pair across the disciplines.

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. The current work attempts to establish a connection between matroid theory and network-error correcting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of network-error correcting codes to arrive at the definition of a matroidal error correcting network. An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error correcting network code if and only if it is a matroidal error correcting network associated with a representable matroid. Therefore, constructing such network-error correcting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa.

Solution processable diketopyrrolopyrrole (DPP) cored small molecules with BODIPY end groups as novel donors for organic solar cells

Two novel triads based on a diketopyrrolopyrrole (DPP) central core and two 4,4-difluoro-4-bora-3a,4a-diaza-s-indacene (BODIPY) units attached by thiophene rings have been synthesised having high molar extinction coefficients. These triads were characterised and used as donor materials in small molecule, solution processable organic solar cells. Both triads were blended with PC71BM as an acceptor in different ratios by wt% and their photovoltaic properties were studied. For both the triads a modest photovoltaic performance was observed, having an efficiency of 0.65%. Moreover, in order to understand the ground and excited state properties and vertical absorption profile of DPP and BODIPY units within the triads, theoretical DFT and TDDFT calculations were performed.

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.

NANOLOCALIZED SINGLE CELL MEMBRANE NANOELECTROPORATION

Today single cell research is a great interest to analyze cell to cell or cell to environment behavior with their intracellular compounds, where bulk measurement can provide average value. To deliver biomolecules precise and localized way into single living cell with high transfection rate and high cell viability is a challenging and promisible task for biological and therapeutic research. In this report, we present a nano-localized single cell nano-electroporation technique, where electroporation take place in a very precise and localized area on a single cell membrane to achieve high efficient delivery with high cell viability. We fabricated 60nm gap with 40 nm triangular Indium Tin Oxide (ITO) based nano-eletcrode tip, which can intense electric field in a nano-localized area of a single cell to permeabilize cell membrane and deliver exogenous biomolecules from outside to inside of the cell. This device successfully deliver dyes, proteins into single cell with high cell viability (98%). The process not only control precise delivery mechanism into single cell with membrane reversibility, but also it can provide special, temporal and qualitative dosage control, which might be beneficial for therapeutic and biological cell studies.