Anomalous reaction-diffusion as a model of nonexponential DNA escape kinetics

We show that data from recent experiments carried out on the kinetics of DNA escape from alpha-hemolysin nanopores [M. Wiggin, C. Tropini, C. T. Cossa, N. N. Jetha, and A. Marziali, Biophys. J. 95, 5317 (2008)] may be rationalized by a model of chain dynamics based on the anomalous diffusion of a particle moving in a harmonic well in the presence of a delta function sink. The experiments of Wiggin found, among other things, that the occasional occurrence of unusually long escape times in the distribution of chain trapping events led to nonexponential decays in the survival probability, S(t), of the DNA molecules within the nanopore. Wiggin ascribed this nonexponentiality to the existence of a distribution of trapping potentials, which they suggested was theresult of stochastic interactions between the bases of the DNA and the amino acids located on the surface of the nanopore. Based on this idea, they showed that the experimentally determined S(t) could be well fit in both the short and long time regimes by a function of the form (1+t/tau)(-alpha) (the so called Becquerel function). In our model, S(t) is found to be given by a Mittag-Leffler function at short times and by a generalized Mittag-Leffler function at long times. By suitable choice of certain parameter values, these functions are found to fit the experimental S(t) even better than the Becquerel function. Anomalous diffusion of DNA within the trap prior to escape over a barrier of fixed height may therefore provide a second, plausible explanation of the data, and may offer fresh perspectives on similar trapping and escape problems.

Generalized self-assembly of scalable two-dimensional transition metal oxide nanosheets

Two-dimensional (2D) transition metal oxide systems present exotic electronic properties and high specific surface areas, and also demonstrate promising applications ranging from electronics to energy storage. Yet, in contrast to other types of nanostructures, the question as to whether we could assemble 2D nanomaterials with an atomic thickness from molecules in a general way, which may give them some interesting properties such as those of graphene, still remains unresolved. Herein, we report a generalized and fundamental approach to molecular self-assembly synthesis of ultrathin 2D nanosheets of transition metal oxides by rationally employing lamellar reverse micelles. It is worth emphasizing that the synthesized crystallized ultrathin transition metal oxide nanosheets possess confined thickness, high specific surface area and chemically reactive facets, so that they could have promising applications in nanostructured electronics, photonics, sensors, and energy conversion and storage devices.

Conservation law with the flux function discontinuous in the space variable- II - Convex-concave type fluxes and generalized entropy solutions

We deal with a single conservation law with discontinuous convex-concave type fluxes which arise while considering sign changing flux coefficients. The main difficulty is that a weak solution may not exist as the Rankine-Hugoniot condition at the interface may not be satisfied for certain choice of the initial data. We develop the concept of generalized entropy solutions for such equations by replacing the Rankine-Hugoniot condition by a generalized Rankine-Hugoniot condition. The uniqueness of solutions is shown by proving that the generalized entropy solutions form a contractive semi-group in L-1. Existence follows by showing that a Godunov type finite difference scheme converges to the generalized entropy solution. The scheme is based on solutions of the associated Riemann problem and is neither consistent nor conservative. The analysis developed here enables to treat the cases of fluxes having at most one extrema in the domain of definition completely. Numerical results reporting the performance of the scheme are presented. (C) 2006 Elsevier B.V. All rights reserved.

Design of multiunit electronic exchanges through decomposition

In this paper, we exploit the idea of decomposition to match buyers and sellers in an electronic exchange for trading large volumes of homogeneous goods, where the buyers and sellers specify marginal-decreasing piecewise constant price curves to capture volume discounts. Such exchanges are relevant for automated trading in many e-business applications. The problem of determining winners and Vickrey prices in such exchanges is known to have a worst-case complexity equal to that of as many as (1 + m + n) NP-hard problems, where m is the number of buyers and n is the number of sellers. Our method proposes the overall exchange problem to be solved as two separate and simpler problems: 1) forward auction and 2) reverse auction, which turns out to be generalized knapsack problems. In the proposed approach, we first determine the quantity of units to be traded between the sellers and the buyers using fast heuristics developed by us. Next, we solve a forward auction and a reverse auction using fully polynomial time approximation schemes available in the literature. The proposed approach has worst-case polynomial time complexity. and our experimentation shows that the approach produces good quality solutions to the problem. Note to Practitioners- In recent times, electronic marketplaces have provided an efficient way for businesses and consumers to trade goods and services. The use of innovative mechanisms and algorithms has made it possible to improve the efficiency of electronic marketplaces by enabling optimization of revenues for the marketplace and of utilities for the buyers and sellers. In this paper, we look at single-item, multiunit electronic exchanges. These are electronic marketplaces where buyers submit bids and sellers ask for multiple units of a single item. We allow buyers and sellers to specify volume discounts using suitable functions. Such exchanges are relevant for high-volume business-to-business trading of standard products, such as silicon wafers, very large-scale integrated chips, desktops, telecommunications equipment, commoditized goods, etc. The problem of determining winners and prices in such exchanges is known to involve solving many NP-hard problems. Our paper exploits the familiar idea of decomposition, uses certain algorithms from the literature, and develops two fast heuristics to solve the problem in a near optimal way in worst-case polynomial time.

Characterization of LRRTM and NGR gene families: Expression and functions

Some leucine-rich repeat (LRR) -containing membrane proteins are known regulators of neuronal growth and synapse formation. In this work I characterize two gene families encoding neuronal LRR membrane proteins, namely the LRRTM (leucine-rich repeat, transmembrane neuronal) and NGR (Nogo-66 receptor) families. I studied LRRTM and NGR family member's mRNA tissue distribution by RT-PCR and by in situ hybridization. Subcellular localization of LRRTM1 protein was studied in neurons and in non-neuronal cells. I discovered that LRRTM and NGR family mRNAs are predominantly expressed in the nervous system, and that each gene possesses a specific expression pattern. I also established that LRRTM and NGR family mRNAs are expressed by neurons, and not by glial cells. Within neurons, LRRTM1 protein is not transported to the plasma membrane; rather it localizes to endoplasmic reticulum. Nogo-A (RTN4), MAG, and OMgp are myelin-associated proteins that bind to NgR1 to limit axonal regeneration after central nervous system injury. To better understand the functions of NgR2 and NgR3, and to explore the possible redundancy in the signaling of myelin inhibitors of neurite growth, I mapped the interactions between NgR family and the known and candidate NgR1 ligands. I identified high-affinity interactions between RTN2-66, RTN3-66 and NgR1. I also demonstrate that Rtn3 mRNA is expressed in the same glial cell population of mouse spinal cord white matter as Nogo-A mRNA, and thus it could have a role in myelin inhibition of axonal growth. To understand how NgR1 interacts with multiple structurally divergent ligands, I aimed first to map in more detail the nature of Nogo-A:NgR1 interactions, and then to systematically map the binding sites of multiple myelin ligands in NgR1 by using a library of NgR1 expression constructs encoding proteins with one or multiple surface residues mutated to alanine. My analysis of the Nogo-A:NgR1 -interactions revealed a novel interaction site between the proteins, suggesting a trivalent Nogo-A:NgR1-interaction. Our analysis also defined a central binding region on the concave side of NgR1's LRR domain that is required for the binding of all known ligands, and a surrounding region critical for binding MAG and OMgp. To better understand the biological role of LRRTMs, I generated Lrrtm1 and Lrrtm3 knock out mice. I show here that reporter genes expressed from the targeted loci can be used for maping the neuronal connections of Lrrtm1 and Lrrtm3 expressing neurons in finer detail. With regard to LRRTM1's role in humans, we found a strong association between a 70 kb-spanning haplotype in the proposed promoter region of LRRTM1 gene and two possibly related phenotypes: left-handedness and schizophrenia. Interestingly, the responsible haplotype was linked to phenotypic variability only when paternally inherited. In summary, I identified two families of neuronal receptor-like proteins, and mapped their expression and certain protein-protein interactions. The identification of a central binding region in NgR1 shared by multiple ligands may facilitate the design and development of small molecule therapeutics blocking binding of all NgR1 ligands. Additionally, the genetic association data suggests that allelic variation upstream of LRRTM1 may play a role in the development of left-right brain asymmetry in humans. Lrrtm1 and Lrrtm3 knock out mice developed as a part of this study will likely be useful for schizophrenia and Alzheimer s disease research.

Exploring the post-genomic world: Differing explanatory and manipulatory functions of post-genomic sciences

Richard Lewontin proposed that the ability of a scientific field to create a narrative for public understanding garners it social relevance. This article applies Lewontin's conceptual framework of the functions of science (manipulatory and explanatory) to compare and explain the current differences in perceived societal relevance of genetics/genomics and proteomics. We provide three examples to illustrate the social relevance and strong cultural narrative of genetics/genomics for which no counterpart exists for proteomics. We argue that the major difference between genetics/genomics and proteomics is that genomics has a strong explanatory function, due to the strong cultural narrative of heredity. Based on qualitative interviews and observations of proteomics conferences, we suggest that the nature of proteins, lack of public understanding, and theoretical complexity exacerbates this difference for proteomics. Lewontin's framework suggests that social scientists may find that omics sciences affect social relations in different ways than past analyses of genetics.

Generalized survival in step fluctuations

The properties of the generalized survival probability, that is, the probability of not crossing an arbitrary location R during relaxation, have been investigated experimentally (via scanning tunneling microscope observations) and numerically. The results confirm that the generalized survival probability decays exponentially with a time constant tau(s)(R). The distance dependence of the time constant is shown to be tau(s)(R)=tau(s0)exp[-R/w(T)], where w(2)(T) is the material-dependent mean-squared width of the step fluctuations. The result reveals the dependence on the physical parameters of the system inherent in the prior prediction of the time constant scaling with R/L-alpha, with L the system size and alpha the roughness exponent. The survival behavior is also analyzed using a contrasting concept, the generalized inside survival S-in(t,R), which involves fluctuations to an arbitrary location R further from the average. Numerical simulations of the inside survival probability also show an exponential time dependence, and the extracted time constant empirically shows (R/w)(lambda) behavior, with lambda varying over 0.6 to 0.8 as the sampling conditions are changed. The experimental data show similar behavior, and can be well fit with lambda=1.0 for T=300 K, and 0.5

Guessing based on length functions

Close relationships between guessing functions and length functions are established. Good length functions lead to good guessing functions. In particular, guessing in the increasing order of Lempel-Ziv lengths has certain universality properties for finite-state sources. As an application, these results show that hiding the parameters of the key-stream generating source in a private key crypto-system may not enhance the privacy of the system, the privacy level being measured by the difficulty in brute-force guessing of the key stream.

New rational interpolation functions for finite element analysis of rotating beams

A rotating beam finite element in which the interpolating shape functions are obtained by satisfying the governing static homogenous differential equation of Euler–Bernoulli rotating beams is developed in this work. The shape functions turn out to be rational functions which also depend on rotation speed and element position along the beam and account for the centrifugal stiffening effect. These rational functions yield the Hermite cubic when rotation speed becomes zero. The new element is applied for static and dynamic analysis of rotating beams. In the static case, a cantilever beam having a tip load is considered, with a radially varying axial force. It is found that this new element gives a very good approximation of the tip deflection to the analytical series solution value, as compared to the classical finite element given by the Hermite cubic shape functions. In the dynamic analysis, the new element is applied for uniform, and tapered rotating beams with cantilever and hinged boundary conditions to determine the natural frequencies, and the results compare very well with the published results given in the literature.

Novel window functions for digital filters

Window technique is one of the simplest methods to design Finite Impulse Response (FIR) filters. It uses special functions to truncate an infinite sequence to a finite one. In this paper, we propose window techniques based on integer sequences. The striking feature of the proposed work is that it overcomes all the problems posed by floating point numbers and inaccuracy, as the sequences are made of only integers. Some of these integer window sequences, yield sharp transition, while some of them result in zero ripple in passband and stopband.

Stiff-String Basis Functions for Vibration Analysis of High Speed Rotating Beams

A new rotating beam finite element is developed in which the basis functions are obtained by the exact solution of the governing static homogenous differential equation of a stiff string, which results from an approximation in the rotating beam equation. These shape functions depend on rotation speed and element position along the beam and account for the centrifugal stiffening effect. Using this new element and the Hermite cubic finite element, a convergence study of natural frequencies is performed, and it is found that the new element converges much more rapidly than the conventional Hermite cubic element for the first two modes at higher rotation speeds. The new element is also applied for uniform and tapered rotating beams to determine the natural frequencies, and the results compare very well with the published results given in the literature.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

The generalized anomeric effect in the 1,3-thiazolidines: Evidence forboth sulphur and nitrogen as electron donors. Crystal structures of various N-acylthiazolidines including mercury(II) complexes. Possible relevance to penicillin action

Evidence for the generalized anomeric effect (GAE) in the N-acyl-1,3-thiazolidines, an important structural motif in the penicillins, was sought in the crystal structures of N-(4-nitrobenzoyl)-1,3-thiazolidine and its (2:1) complex with mercuric chloride, N-acetyl-2-phenyl-1,3-thiazolidine, and the (2:1) complex of N-benzoyl-1,3-thiazolidine with mercuric bromide. An inverse relationship was generally observed between the. C-2-N and C-2-S bond lengths of the thiazolidine ring, supporting the existence of the GAE. (Maximal bond length changes were similar to 0.04 angstrom for C-2-N-3, S-1-C-2, and similar to 0.08 angstrom for N-3-C-6.) Comparison with N-acylpyrrolidines and tetrahydrothiophenes indicates that both the nitrogen-to-sulphur and sulphur-to-nitrogen GAE's operate simultaneously in the 1,3-thiazolidines, the former being dominant. (This is analogous to the normal and exo-anomeric effects in pyranoses, and also leads to an interesting application of Baldwin's rules.) The nitrogen-to-sulphur GAE is generally enhanced in the mercury(II) complexes (presumably via coordination at the sulphur); a 'competition' between the GAE and the amide resonance of the N-acyl moiety is apparent. There is evidence for a 'push-pull' charge transfer between the thiazolidine moieties in the mercury(II) complexes, and for a 'back-donation' of charge from the bromine atoms to the thiazolidine moieties in the HgBr2 complex. (The sulphur atom appears to be sp(2) hybridised in the mercury(II) complexes, possibly for stereoelectronic reasons.) These results are apparently relevant to the mode of action of the penicillins. (c) 2006 Elsevier B.V. All rights reserved.