Confinement and viscoelastic effects on chain closure dynamics

Chemical reactions inside cells are typically subject to the effects both of the cell's confining surfaces and of the viscoelastic behavior of its contents. In this paper, we show how the outcome of one particular reaction of relevance to cellular biochemistry - the diffusion-limited cyclization of long chain polymers - is influenced by such confinement and crowding effects. More specifically, starting from the Rouse model of polymer dynamics, and invoking the Wilemski-Fixman approximation, we determine the scaling relationship between the mean closure time t(c) of a flexible chain (no excluded volume or hydrodynamic interactions) and the length N of its contour under the following separate conditions: (a) confinement of the chain to a sphere of radius d and (b) modulation of its dynamics by colored Gaussian noise. Among other results, we find that in case (a) when d is much smaller than the size of the chain, t(c) similar to Nd-2, and that in case (b), t(c) similar to N-2/(2 (2H)), H being a number between 1/2 and 1 that characterizes the decay of the noise correlations. H is not known a priori, but values of about 0.7 have been used in the successful characterization of protein conformational dynamics. At this value of H (selected for purposes of illustration), t(c) similar to N-3.4, the high scaling exponent reflecting the slow relaxation of the chain in a viscoelastic medium. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4729041]

Current transport in nonpolar a-plane InN/GaN eterostructures Schottky junction

The temperature dependent current transport properties of nonpolar a-plane (11 2 0) InN/GaN heterostructure Schottky junction were investigated. The barrier height ( b) and ideally factor (η) estimated from the thermionic emission (TE) model were found to be temperature dependent in nature. The conventional Richardson plot of the ln(I s/T 2) versus 1/kT has two regions: the first region (150-300 K) and the second region (350-500 K). The values of Richardson constant (A +) obtained from this plot are found to be lower than the theoretical value of n-type GaN. The variation in the barrier heights was explained by a double Gaussian distribution with mean barrier height values ( b ) of 1.17 and 0.69 eV with standard deviation (� s) of 0.17 and 0.098 V, respectively. The modified Richardson plot in the temperature range 350-500 K gives the Richardson constant which is close to the theoretical value of n-type GaN. Hence, the current mechanism is explained by TE by assuming the Gaussian distribution of barrier height. At low temperature 150-300 K, the absence of temperature dependent tunneling parameters indicates the tunneling assisted current transport mechanism. © 2012 American Institute of Physics.

Analysis of the temperature-dependent current-voltage characteristics and the barrier-height inhomogeneities of Au/GaN Schottky diodes

In this report, the currentvoltage (IV) characteristics of Au/GaN Schottky diodes have been carried out in the temperature range of 300510?K. The estimated values of the Schottky-barrier height (SBH) and the ideality factor of the diodes based on the thermionic emission (TE) mechanism were found to be temperature dependent. The barrier height was found to increase and the ideality factor to decrease with increasing temperature. The conventional Richardson plot of ln(Is/T2) versus 1/kT gives the SBH of 0.51?eV and Richardson constant value of 3.23?X?10-5?A?cm-2?K-2 which is much lower than the known value of 26.4?A?cm-2?K-2 for GaN. Such discrepancies of the SBH and Richardson constant value were attributed to the existence of barrier-height inhomogeneities at the Au/GaN interface. The modified Richardson plot of ln(Is/T2)q2 sigma 2/2k2T2 versus q/kT, by assuming a Gaussian distribution of barrier heights at the Au/GaN interface, provided the SBH of 1.47?eV and Richardson constant value of 38.8?A?cm-2?K-2. The temperature dependence of the barrier height is interpreted on the basis of existence of the Gaussian distribution of the barrier heights due to the barrier-height inhomogeneities at the Au/GaN interface.

Markov chain modeling of evolution of strains in reinforced concrete flexural beams

From the analysis of experimentally observed variations in surface strains with loading in reinforced concrete beams, it is noted that there is a need to consider the evolution of strains (with loading) as a stochastic process. Use of Markov Chains for modeling stochastic evolution of strains with loading in reinforced concrete flexural beams is studied in this paper. A simple, yet practically useful, bi-level homogeneous Gaussian Markov Chain (BLHGMC) model is proposed for determining the state of strain in reinforced concrete beams. The BLHGMC model will be useful for predicting behavior/response of reinforced concrete beams leading to more rational design.

Factor graph based joint detection/decoding for LDPC coded large-MIMO systems

In this paper, we employ message passing algorithms over graphical models to jointly detect and decode symbols transmitted over large multiple-input multiple-output (MIMO) channels with low density parity check (LDPC) coded bits. We adopt a factor graph based technique to integrate the detection and decoding operations. A Gaussian approximation of spatial interference is used for detection. This serves as a low complexity joint detection/decoding approach for large dimensional MIMO systems coded with LDPC codes of large block lengths. This joint processing achieves significantly better performance than the individual detection and decoding scheme.

A mixture model approach for formant tracking and the robustness of student's-t distribution

We address the problem of robust formant tracking in continuous speech in the presence of additive noise. We propose a new approach based on mixture modeling of the formant contours. Our approach consists of two main steps: (i) Computation of a pyknogram based on multiband amplitude-modulation/frequency-modulation (AM/FM) decomposition of the input speech; and (ii) Statistical modeling of the pyknogram using mixture models. We experiment with both Gaussian mixture model (GMM) and Student's-t mixture model (tMM) and show that the latter is robust with respect to handling outliers in the pyknogram data, parameter selection, accuracy, and smoothness of the estimated formant contours. Experimental results on simulated data as well as noisy speech data show that the proposed tMM-based approach is also robust to additive noise. We present performance comparisons with a recently developed adaptive filterbank technique proposed in the literature and the classical Burg's spectral estimator technique, which show that the proposed technique is more robust to noise.

Origin of grand minima in Sunspot cycles

One of the most striking aspects of the 11-year sunspot cycle is that there have been times in the past when some cycles went missing, a most well-known example of this being the Maunder minimum during 1645-1715. Analyses of cosmogenic isotopes (C-14 and Be-10) indicated that there were about 27 grand minima in the last 11 000 yrs, implying that about 2.7% of the solar cycles had conditions appropriate for forcing the Sun into grand minima. We address the question of how grand minima are produced and specifically calculate the frequency of occurrence of grand minima from a theoretical dynamo model. We assume that fluctuations in the poloidal field generation mechanism and in the meridional circulation produce irregularities of sunspot cycles. Taking these fluctuations to be Gaussian and estimating the values of important parameters from the data of the last 28 solar cycles, we show from our flux transport dynamo model that about 1-4% of the sunspot cycles may have conditions suitable for inducing grand minima.

Subdiffusion in hair bundle dynamics: The role of protein conformational fluctuations

The detection of sound signals in vertebrates involves a complex network of different mechano-sensory elements in the inner ear. An especially important element in this network is the hair bundle, an antenna-like array of stereocilia containing gated ion channels that operate under the control of one or more adaptation motors. Deflections of the hair bundle by sound vibrations or thermal fluctuations transiently open the ion channels, allowing the flow of ions through them, and producing an electrical signal in the process, eventually causing the sensation of hearing. Recent high frequency (0.1-10 kHz) measurements by Kozlov et al. Proc. Natl. Acad. Sci. U. S. A. 109, 2896 (2012)] of the power spectrum and the mean square displacement of the thermal fluctuations of the hair bundle suggest that in this regime the dynamics of the hair bundle are subdiffusive. This finding has been explained in terms of the simple Brownian motion of a filament connecting neighboring stereocilia (the tip link), which is modeled as a viscoelastic spring. In the present paper, the diffusive anomalies of the hair bundle are ascribed to tip link fluctuations that evolve by fractional Brownian motion, which originates in fractional Gaussian noise and is characterized by a power law memory. The predictions of this model for the power spectrum of the hair bundle and its mean square displacement are consistent with the experimental data and the known properties of the tip link. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4768902]

Secure Computation in a Bidirectional Relay

Bidirectional relaying, where a relay helps two user nodes to exchange equal length binary messages, has been an active area of recent research. A popular strategy involves a modified Gaussian MAC, where the relay decodes the XOR of the two messages using the naturally-occurring sum of symbols simultaneously transmitted by user nodes. In this work, we consider the Gaussian MAC in bidirectional relaying with an additional secrecy constraint for protection against a honest but curious relay. The constraint is that, while the relay should decode the XOR, it should be fully ignorant of the individual messages of the users. We exploit the symbol addition that occurs in a Gaussian MAC to design explicit strategies that achieve perfect independence between the received symbols and individual transmitted messages. Our results actually hold for a more general scenario where the messages at the two user nodes come from a finite Abelian group G, and the relay must decode the sum within G of the two messages. We provide a lattice coding strategy and study optimal rate versus average power trade-offs for asymptotically large dimensions.

Updating reliability models of statically loaded instrumented structures

The study extends the first order reliability method (FORM) and inverse FORM to update reliability models for existing, statically loaded structures based on measured responses. Solutions based on Bayes' theorem, Markov chain Monte Carlo simulations, and inverse reliability analysis are developed. The case of linear systems with Gaussian uncertainties and linear performance functions is shown to be exactly solvable. FORM and inverse reliability based methods are subsequently developed to deal with more general problems. The proposed procedures are implemented by combining Matlab based reliability modules with finite element models residing on the Abaqus software. Numerical illustrations on linear and nonlinear frames are presented. (c) 2012 Elsevier Ltd. All rights reserved.

SURE-FAST BILATERAL FILTERS

Edge-preserving smoothing is widely used in image processing and bilateral filtering is one way to achieve it. Bilateral filter is a nonlinear combination of domain and range filters. Implementing the classical bilateral filter is computationally intensive, owing to the nonlinearity of the range filter. In the standard form, the domain and range filters are Gaussian functions and the performance depends on the choice of the filter parameters. Recently, a constant time implementation of the bilateral filter has been proposed based on raisedcosine approximation to the Gaussian to facilitate fast implementation of the bilateral filter. We address the problem of determining the optimal parameters for raised-cosine-based constant time implementation of the bilateral filter. To determine the optimal parameters, we propose the use of Stein's unbiased risk estimator (SURE). The fast bilateral filter accelerates the search for optimal parameters by faster optimization of the SURE cost. Experimental results show that the SURE-optimal raised-cosine-based bilateral filter has nearly the same performance as the SURE-optimal standard Gaussian bilateral filter and the Oracle mean squared error (MSE)-based optimal bilateral filter.

Fast Likelihood Computation in Speech Recognition using Matrices

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for Large Vocabulary Continuous Speech Recognition (LVCSR) systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication. In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on 1,138 work vocabulary RM1 task and 6,224 word vocabulary TIMIT task using Sphinx 3.7 system show that, for a typical case the matrix multiplication based approach leads to overall speedup of 46 % on RM1 task and 115 % for TIMIT task. Our low-rank approximation methods provide a way for trading off recognition accuracy for a further increase in computational performance extending overall speedups up to 61 % for RM1 and 119 % for TIMIT for an increase of word error rate (WER) from 3.2 to 3.5 % for RM1 and for no increase in WER for TIMIT. We also express pairwise Euclidean distance computation phase in Dynamic Time Warping (DTW) in terms of matrix multiplication leading to saving of approximately of computational operations. In our experiments using efficient implementation of matrix multiplication, this leads to a speedup of 5.6 in computing the pairwise Euclidean distances and overall speedup up to 3.25 for DTW.

Diversity-Rate Trade-off for Fading Channels with Power Control

We consider a complex, additive, white Gaussian noise channel with flat fading. We study its diversity order vs transmission rate for some known power allocation schemes. The capacity region is divided into three regions. For one power allocation scheme, the diversity order is exponential throughout the capacity region. For selective channel inversion (SCI) scheme, the diversity order is exponential in low and high rate region but polynomial in mid rate region. For fast fading case we also provide a new upper bound on block error probability and a power allocation scheme that minimizes it. The diversity order behaviour of this scheme is same as for SCI but provides lower BER than the other policies.

Nodal length fluctuations for arithmetic random waves

Using the spectral multiplicities of the standard torus, we endow the Laplace eigenspaces with Gaussian probability measures. This induces a notion of random Gaussian Laplace eigenfunctions on the torus (''arithmetic random waves''). We study the distribution of the nodal length of random eigenfunctions for large eigenvalues, and our primary result is that the asymptotics for the variance is nonuniversal. Our result is intimately related to the arithmetic of lattice points lying on a circle with radius corresponding to the energy.

Semi-supervised SVMs for classification with unknown class proportions and a small labeled dataset

In the design of practical web page classification systems one often encounters a situation in which the labeled training set is created by choosing some examples from each class; but, the class proportions in this set are not the same as those in the test distribution to which the classifier will be actually applied. The problem is made worse when the amount of training data is also small. In this paper we explore and adapt binary SVM methods that make use of unlabeled data from the test distribution, viz., Transductive SVMs (TSVMs) and expectation regularization/constraint (ER/EC) methods to deal with this situation. We empirically show that when the labeled training data is small, TSVM designed using the class ratio tuned by minimizing the loss on the labeled set yields the best performance; its performance is good even when the deviation between the class ratios of the labeled training set and the test set is quite large. When the labeled training data is sufficiently large, an unsupervised Gaussian mixture model can be used to get a very good estimate of the class ratio in the test set; also, when this estimate is used, both TSVM and EC/ER give their best possible performance, with TSVM coming out superior. The ideas in the paper can be easily extended to multi-class SVMs and MaxEnt models.