Quantum and non-Markovian effects in the electron transfer reaction dynamics in the Marcus inverted region

Electron transfer reactions in large molecules may often be coupled to both the polar solvent modes and the intramolecular vibrational modes of the molecule. This can give rise to a complex dynamics which may in some systems, like betaine, be controlled more by vibrational rather than by solvent effects. Additionally, a significant contribution from an ultrafast relaxation component in the solvation dynamics may enhance the complexity. To explain the wide range of behavior that has been observed experimentally, Barbara et al. recently proposed that a model of an electron transfer reaction should minimally consist of a low-frequency classical solvent mode (X), a low-frequency vibrational mode (Q), and a high-frequency quantum mode (q) (J. Phys. Chem. 1991, 96, 3728). In the present work, a theoretical study of this model is described. This study generalizes earlier work by including the biphasic solvent response and the dynamics of the low-frequency vibrational mode in the presence of a delocalized, extended reaction zone. A novel Green's function technique has been developed which allowed us to study the non-Markovian dynamics on a multidimensional surface. The contributions from the high-frequency vibrational mode and the ultrafast component in the non-Markovian solvent dynamics are found to be primarily responsible for the dramatic increase in charge transfer rate over the prediction of the classical theories that neglect both these factors. These, along with a large coupling between the reactant and the product states, may combine to render the electron transfer rate both very large and constant over a wide range of solvent relaxation rates. A study on the free energy gap dependence of the electron transfer rate reveals that the rates are sensitive to changes in the quantum frequency particularly when the free energy gap is very large.

The concentration dependent cooperative friction coefficient of dilute polymer solutions at the theta point

We combine multiple scattering and renormalization group methods to calculate the leading order dimensionless virial coefficient k(s) for the friction coefficient of dilute polymer solutions under conditions where the osmotic second virial coefficient vanishes (i.e., at the theta point T-theta). Our calculations are formulated in terms of coupled kinetic equations for the polymer and solvent, in which the polymers are modeled as continuous chains whose configurations evolve under the action of random forces in, the velocity field of the solvent. To lowest order in epsilon=4-d, we find that k(s) = 1.06. This result compares satisfactorily with existing experimental estimates of k(s), which are in the range 0.7-0.8. It is also in good agreement with other theoretical results on chains and suspensions at T-theta. Our calculated k(s) is also found to be identical to the leading order virial coefficient of the tracer friction coefficient at the theta point. We discuss possible reasons for the difficulties encountered when attempting to evaluate k(s) by extrapolating prior renormalization group calculations from semidilute concentrations to the infinitely dilute limit. (C) 1996 American Institute of Physics.

Assessing design creativity

Creativity is crucial for designing products and enabling innovation. Assessing creativity can help identify innovative designers and products, and support improvement of both. The literature variously defines creativity as a function of degree of novelty, usefulness, or both. Most methods for assessing creativity, however, focus only on assessing novelty of products. This research proposes a new method for assessing the creativity of products as a function of their novelty and usefulness. We develop individual methods for assessing novelty and usefulness of products. and then combine these into a method for assessing creativity of products. The proposed methods have been evaluated by benchmarking them, and other methods available from literature, against the collective, intuitive assessment of product creativity of experienced designers. (C) 2011 Elsevier Ltd. All rights reserved.

Helical structures: The geometry of protein helices and nanotubes

In nature, helical structures arise when identical structural subunits combine sequentially, the orientational and translational relation between each unit and its predecessor remaining constant. A helical structure is thus generated by the repeated action of a screw transformation acting on a subunit. A plane hexagonal lattice wrapped round a cylinder provides a useful starting point for describing the helical conformations of protein molecules, for investigating the geometrical properties of carbon nanotubes, and for certain types of dense packings of equal spheres.

Static Balancing of Spring-loaded Planar Revolute-joint Linkages without Auxiliary Links

We present a method to statically balance a general treestructured,planar revolute-joint linkage loaded with linear springs or constant forces without using auxiliary links. The balancing methods currently documented in the literature use extra links; some do not apply when there are spring loads and some are restricted to only two-link serial chains. In our method, we suitably combine any non-zero-free-length load spring with another spring to result in an effective zero-free-length spring load. If a link has a single joint (with the parent link), we give a procedure to attach extra zero-free-length springs to it so that forces and moments are balanced for the link. Another consequence of this attachment is that the constraint force of the joint on the parent link becomes equivalent to a zero-free-length spring load. Hence, conceptually,for the parent link, the joint with its child is removed and replaced with the zero-free-length spring. This feature allows recursive application of this procedure from the end-branches of the tree down to the root, satisfying force and moment balance of all the links in the process. Furthermore, this method can easily be extended to the closed-loop revolute-joint linkages, which is also illustrated in the paper.

Executable Analysis using Abstract Interpretation with Circular Linear Progressions

We propose a new abstract domain for static analysis of executable code. Concrete states are abstracted using circular linear progressions (CLPs). CLPs model computations using a finite word length as is seen in any real life processor. The finite abstraction allows handling overflow scenarios in a natural and straight-forward manner. Abstract transfer functions have been defined for a wide range of operations which makes this domain easily applicable for analyzing code for a wide range of ISAs. CLPs combine the scalability of interval domains with the discreteness of linear congruence domains. We also present a novel, lightweight method to track linear equality relations between static objects that is used by the analysis to improve precision. The analysis is efficient, the total space and time overhead being quadratic in the number of static objects being tracked.

Hybrid approaches for clustering

Applications in various domains often lead to very large and frequently high-dimensional data. Successful algorithms must avoid the curse of dimensionality but at the same time should be computationally efficient. Finding useful patterns in large datasets has attracted considerable interest recently. The primary goal of the paper is to implement an efficient Hybrid Tree based clustering method based on CF-Tree and KD-Tree, and combine the clustering methods with KNN-Classification. The implementation of the algorithm involves many issues like good accuracy, less space and less time. We will evaluate the time and space efficiency, data input order sensitivity, and clustering quality through several experiments.

Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs

For a family/sequence of Space-Time Block Codes (STBCs) C1, C2,⋯, with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use (cspcu), i = 1,2,⋯, the asymptotic normalized rate is defined as limi→∞ Ri/Ni. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas, and the family of STBCs is said to be asymptotically-optimal if the asymptotic normalized rate is 1, which is the maximum possible value. In this paper, we construct a new class of full-diversity STBCs that have the least maximum-likelihood (ML) decoding complexity among all known codes for any number of transmit antennas N>;1 and rates R>;1 cspcu. For a large set of (R,N) pairs, the new codes have lower ML decoding complexity than the codes already available in the literature. Among the new codes, the class of full-rate codes (R=N) are asymptotically-optimal and fast-decodable, and for N>;5 have lower ML decoding complexity than all other families of asymptotically-optimal, fast-decodable, full-diversity STBCs available in the literature. The construction of the new STBCs is facilitated by the following further contributions of this paper: (i) Construction of a new class of asymptotically-good, full-diversity multigroup ML decodable codes, that not only includes STBCs for a larger set of antennas, but also either matches in rate or contains as a proper subset all other high-rate or asymptotically-good, delay-optimal, multigroup ML decodable codes available in the literature. (ii) Construction of a new class of fast-group-decodable codes (codes that combine the low ML decoding complexity properties of multigroup ML decodable codes and fast-decodable codes) for all even number of transmit antennas and rates 1 <; R ≤ 5/4.- - (iii) Given a design with full-rank linear dispersion matrices, we show that a full-diversity STBC can be constructed from this design by encoding the real symbols independently using only regular PAM constellations.

Federated Search Service for OAI-compliant, Open-Access Repositories in India

Many of the research institutions and universities across the world are facilitating open-access (OA) to their intellectual outputs through their respective OA institutional repositories (IRs) or through the centralized subject-based repositories. The registry of open access repositories (ROAR) lists more than 2850 such repositories across the world. The awareness about the benefits of OA to scholarly literature and OA publishing is picking up in India, too. As per the ROAR statistics, to date, there are more than 90 OA repositories in the country. India is doing particularly well in publishing open-access journals (OAJ). As per the directory of open-access journals (DOAJ), to date, India with 390 OAJs, is ranked 5th in the world in terms of numbers of OAJs being published. Much of the research done in India is reported in the journals published from India. These journals have limited readership and many of them are not being indexed by Web of Science, Scopus or other leading international abstracting and indexing databases. Consequently, research done in the country gets hidden not only from the fellow countrymen, but also from the international community. This situation can be easily overcome if all the researchers facilitate OA to their publications. One of the easiest ways to facilitate OA to scientific literature is through the institutional repositories. If every research institution and university in India set up an open-access IR and ensure that copies of the final accepted versions of all the research publications are uploaded in the IRs, then the research done in India will get far better visibility. The federation of metadata from all the distributed, interoperable OA repositories in the country will serve as a window to the research done across the country. Federation of metadata from the distributed OAI-compliant repositories can be easily achieved by setting up harvesting software like the PKP Harvester. In this paper, we share our experience in setting up a prototype metadata harvesting service using the PKP harvesting software for the OAI-compliant repositories in India.

Unzipping and binding of small interfering RNA with single walled carbon nanotube: A platform for small interfering RNA delivery

In an effort to design efficient platform for siRNA delivery, we combine all atom classical and quantum simulations to study the binding of small interfering RNA (siRNA) by pristine single wall carbon nanotube (SWCNT). Our results show that siRNA strongly binds to SWCNT surface via unzipping its base-pairs and the propensity of unzipping increases with the increase in the diameter of the SWCNTs. The unzipping and subsequent wrapping events are initiated and driven by van der Waals interactions between the aromatic rings of siRNA nucleobases and the SWCNT surface. However, molecular dynamics (MD) simulations of double strand DNA (dsDNA) of the same sequence show that the dsDNA undergoes much less unzipping and wrapping on the SWCNT in the simulation time scale of 70 ns. This interesting difference is due to smaller interaction energy of thymidine of dsDNA with the SWCNT compared to that of uridine of siRNA, as calculated by dispersion corrected density functional theory (DFT) methods. After the optimal binding of siRNA to SWCNT, the complex is very stable which serves as one of the major mechanisms of siRNA delivery for biomedical applications. Since siRNA has to undergo unwinding process with the effect of RNA-induced silencing complex, our proposed delivery mechanism by SWCNT possesses potential advantages in achieving RNA interference. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.3682780]

Structure and deformation correlation of closed-cell aluminium foam subject to uniaxial compression

We report the results of an experimental and numerical study conducted on a closed-cell aluminium foam that was subjected to uniaxial compression with lateral constraint. X-ray computed tomography was utilized to gain access into the three-dimensional (3-D) structure of the foam and some aspects of the deformation mechanisms. A series of advanced 3-D image analyses are conducted on the 3-D images aimed at characterizing the strain localization regions. We identify the morphological/geometrical features that are responsible for the collapse of the cells and the strain localization. A novel mathematical approach based on a Minkowski tensor analysis along with the mean intercept length technique were utilized to search for signatures of anisotropy across the foam sample and its evolution as a function of loading. Our results show that regions with higher degrees of anisotropy in the undeformed foam have a tendency to initiate the onset of cell collapse. Furthermore, we show that strain hardening occurs predominantly in regions with large cells and high anisotropy. We combine the finite element method with the tomographic images to simulate the mechanical response of the foam. We predict further deformation in regions where the foam is already deformed. Crown Copyright (C) 2012 Published by Elsevier Ltd. on behalf of Acta Materialia Inc. All rights reserved.

Crowd Sourcing a New Paradigm for Interactome Driven Drug Target Identification in Mycobacterium tuberculosis

A decade since the availability of Mycobacterium tuberculosis (Mtb) genome sequence, no promising drug has seen the light of the day. This not only indicates the challenges in discovering new drugs but also suggests a gap in our current understanding of Mtb biology. We attempt to bridge this gap by carrying out extensive re-annotation and constructing a systems level protein interaction map of Mtb with an objective of finding novel drug target candidates. Towards this, we synergized crowd sourcing and social networking methods through an initiative `Connect to Decode' (C2D) to generate the first and largest manually curated interactome of Mtb termed `3interactome pathway' (IPW), encompassing a total of 1434 proteins connected through 2575 functional relationships. Interactions leading to gene regulation, signal transduction, metabolism, structural complex formation have been catalogued. In the process, we have functionally annotated 87% of the Mtb genome in context of gene products. We further combine IPW with STRING based network to report central proteins, which may be assessed as potential drug targets for development of drugs with least possible side effects. The fact that five of the 17 predicted drug targets are already experimentally validated either genetically or biochemically lends credence to our unique approach.

Covalently Linked, Water-Dispersible, Cyciodextrin: Reduced-Graphene Oxide Sheets

Reduced-graphene oxide (rGO) sheets have been functionalized by covalently linking beta-cyclodextrin (beta CD) cavities to the sheets via an amide linkage. The functionalized beta-CD:rGO sheets, in contrast to rGO, are dispersible over a wide range of pH values (2-13). Zeta potential measurements indicate that there is more than one factor responsible for the dispersibility. We show here that planar aromatic molecules adsorbed on the rGO sheet as well as nonplanar molecules included in the tethered beta-CD cavities have their fluorescence effectively quenched by the beta-CD:rGO sheets. The beta-CD:rGO sheets combine the hydrophobicity associated with rGO along with the hydrophobicity of the cyclodextrin cavities in a single water-dispersible material.

Implications of program phase behavior on timing analysis

Knowledge about program worst case execution time (WCET) is essential in validating real-time systems and helps in effective scheduling. One popular approach used in industry is to measure execution time of program components on the target architecture and combine them using static analysis of the program. Measurements need to be taken in the least intrusive way in order to avoid affecting accuracy of estimated WCET. Several programs exhibit phase behavior, wherein program dynamic execution is observed to be composed of phases. Each phase being distinct from the other, exhibits homogeneous behavior with respect to cycles per instruction (CPI), data cache misses etc. In this paper, we show that phase behavior has important implications on timing analysis. We make use of the homogeneity of a phase to reduce instrumentation overhead at the same time ensuring that accuracy of WCET is not largely affected. We propose a model for estimating WCET using static worst case instruction counts of individual phases and a function of measured average CPI. We describe a WCET analyzer built on this model which targets two different architectures. The WCET analyzer is observed to give safe estimates for most benchmarks considered in this paper. The tightness of the WCET estimates are observed to be improved for most benchmarks compared to Chronos, a well known static WCET analyzer.

Exploiting coherence for the simultaneous discovery of latent facets and associated sentiments

Facet-based sentiment analysis involves discovering the latent facets, sentiments and their associations. Traditional facet-based sentiment analysis algorithms typically perform the various tasks in sequence, and fail to take advantage of the mutual reinforcement of the tasks. Additionally,inferring sentiment levels typically requires domain knowledge or human intervention. In this paper, we propose aseries of probabilistic models that jointly discover latent facets and sentiment topics, and also order the sentiment topics with respect to a multi-point scale, in a language and domain independent manner. This is achieved by simultaneously capturing both short-range syntactic structure and long range semantic dependencies between the sentiment and facet words. The models further incorporate coherence in reviews, where reviewers dwell on one facet or sentiment level before moving on, for more accurate facet and sentiment discovery. For reviews which are supplemented with ratings, our models automatically order the latent sentiment topics, without requiring seed-words or domain-knowledge. To the best of our knowledge, our work is the first attempt to combine the notions of syntactic and semantic dependencies in the domain of review mining. Further, the concept of facet and sentiment coherence has not been explored earlier either. Extensive experimental results on real world review data show that the proposed models outperform various state of the art baselines for facet-based sentiment analysis.