4,715 research outputs found

    Riding in silence: a little snowboarding, a lot of small RNAs

    Get PDF
    The recent symposium, RNA silencing: Mechanism, Biology and Applications, organized by Phillip D. Zamore (University of Massachusetts Medical School) and Beverly Davidson (University of Iowa), and held in Keystone, Colorado, brought together scientists working on diverse aspects of RNA silencing, a field that comprises a multitude of gene regulatory pathways guided by microRNAs, small interfering RNAs and PIWI-interacting RNAs

    A novel Border Identification algorithm based on an “Anti-Bayesian” paradigm

    Get PDF
    Border Identification (BI) algorithms, a subset of Prototype Reduction Schemes (PRS) aim to reduce the number of training vectors so that the reduced set (the border set) contains only those patterns which lie near the border of the classes, and have sufficient information to perform a meaningful classification. However, one can see that the true border patterns (“near” border) are not able to perform the task independently as they are not able to always distinguish the testing samples. Thus, researchers have worked on this issue so as to find a way to strengthen the “border” set. A recent development in this field tries to add more border patterns, i.e., the “far” borders, to the border set, and this process continues until it reaches a stage at which the classification accuracy no longer increases. In this case, the cardinality of the border set is relatively high. In this paper, we aim to design a novel BI algorithm based on a new definition for the term “border”. We opt to select the patterns which lie at the border of the alternate class as the border patterns. Thus, those patterns which are neither on the true discriminant nor too close to the central position of the distributions, are added to the “border” set. The border patterns, which are very small in number (for example, five from both classes), selected in this manner, have the potential to perform a classification which is comparable to that obtained by well-known traditional classifiers like the SVM, and very close to the optimal Bayes’ bound

    Clustering data by inhomogeneous chaotic map lattices

    Full text link
    A new approach to clustering, based on the physical properties of inhomogeneous coupled chaotic maps, is presented. A chaotic map is assigned to each data-point and short range couplings are introduced. The stationary regime of the system corresponds to a macroscopic attractor independent of the initial conditions. The mutual information between couples of maps serves to partition the data set in clusters, without prior assumptions about the structure of the underlying distribution of the data. Experiments on simulated and real data sets show the effectiveness of the proposed algorithm.Comment: 8 pages, 6 figures. Revised version accepted for publication on Physical Review Letter

    Non-Fermi liquid behavior and scaling of low frequency suppression in optical conductivity spectra of CaRuO3_3

    Full text link
    Optical conductivity spectra σ1(ω)\sigma_1(\omega) of paramagnetic CaRuO3_3 are investigated at various temperatures. At T=10 K, it shows a non-Fermi liquid behavior of σ1(ω)1/ω12\sigma_1(\omega)\sim 1/{\omega}^{\frac 12}, similar to the case of a ferromagnet SrRuO3_3. As the temperature (TT) is increased, on the other hand, σ1(ω)\sigma_1(\omega) in the low frequency region is progressively suppressed, deviating from the 1/{\omega}^{\frac 12%}-dependence. Interestingly, the suppression of σ1(ω)\sigma_1(\omega) is found to scale with ω/T\omega /T at all temperatures. The origin of the % \omega /T scaling behavior coupled with the non-Fermi liquid behavior is discussed.Comment: 4 pages, 3 figure

    Large Deviations of the Maximum Eigenvalue in Wishart Random Matrices

    Full text link
    We compute analytically the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W=X^T X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value =N/c decreases for large N as exp[β2N2Φ(2c+1;c)]\sim \exp[-\frac{\beta}{2}N^2 \Phi_{-}(\frac{2}{\sqrt{c}}+1;c)], where \beta=1,2 correspond respectively to real and complex Wishart matrices, c=N/M < 1 and \Phi_{-}(x;c) is a large deviation function that we compute explicitly. The result for the Anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of constrained Wishart matrices whose eigenvalues are forced to be smaller than a fixed barrier. The numerical simulations are in excellent agreement with the analytical predictions.Comment: Published version. References and appendix adde
    corecore