Resistance fluctuations, phase randomness and noise in one-dimensional conductors with a long-range correlated potential

When the size (L) of a one-dimensional metallic conductor is less than the correlation length λ-1 of the Gaussian random potential, one expects transport properties to show ballistic behaviour. Using an invariant imbedding method, we study the exact distribution of the resistance, of the phase θ of the reflection amplitude of an incident electron of wave number k0, and of dθ/dk0, for λL ll 1. The resistance is non-self-averaging and the n-th resistance moment varies periodically as (1 - cos 2k0L)n. The charge fluctuation noise, determined by the distribution of dθ/dk0, is constant at low frequencies.

Algorithms for Colouring Random k-colourable Graphs

The k-colouring problem is to colour a given k-colourable graph with k colours. This problem is known to be NP-hard even for fixed k greater than or equal to 3. The best known polynomial time approximation algorithms require n(delta) (for a positive constant delta depending on k) colours to colour an arbitrary k-colourable n-vertex graph. The situation is entirely different if we look at the average performance of an algorithm rather than its worst-case performance. It is well known that a k-colourable graph drawn from certain classes of distributions can be ii-coloured almost surely in polynomial time. In this paper, we present further results in this direction. We consider k-colourable graphs drawn from the random model in which each allowed edge is chosen independently with probability p(n) after initially partitioning the vertex set into ii colour classes. We present polynomial time algorithms of two different types. The first type of algorithm always runs in polynomial time and succeeds almost surely. Algorithms of this type have been proposed before, but our algorithms have provably exponentially small failure probabilities. The second type of algorithm always succeeds and has polynomial running time on average. Such algorithms are more useful and more difficult to obtain than the first type of algorithms. Our algorithms work as long as p(n) greater than or equal to n(-1+is an element of) where is an element of is a constant greater than 1/4.

Design of speaker identification schemes for large number of speakers (A)

Design of speaker identification schemes for a small number of speakers (around 10) with a high degree of accuracy in controlled environment is a practical proposition today. When the number of speakers is large (say 50–100), many of these schemes cannot be directly extended, as both recognition error and computation time increase monotonically with population size. The feature selection problem is also complex for such schemes. Though there were earlier attempts to rank order features based on statistical distance measures, it has been observed only recently that the best two independent measurements are not the same as the combination in two's for pattern classification. We propose here a systematic approach to the problem using the decision tree or hierarchical classifier with the following objectives: (1) Design of optimal policy at each node of the tree given the tree structure i.e., the tree skeleton and the features to be used at each node. (2) Determination of the optimal feature measurement and decision policy given only the tree skeleton. Applicability of optimization procedures such as dynamic programming in the design of such trees is studied. The experimental results deal with the design of a 50 speaker identification scheme based on this approach.

Direct stability evaluation of power systems with detailed generator models using structure-preserving energy functions

Energy-based direct methods for transient stability analysis are potentially useful both as offline tools for planning purposes as well as for online security assessment. In this paper, a novel structure-preserving energy function (SPEF) is developed using the philosophy of structure-preserving model for the system and detailed generator model including flux decay, transient saliency, automatic voltage regulator (AVR), exciter and damper winding. A simpler and yet general expression for the SPEF is also derived which can simplify the computation of the energy function. The system equations and the energy function are derived using the centre-of-inertia (COI) formulation and the system loads are modelled as arbitrary functions of the respective bus voltages. Application of the proposed SPEF to transient stability evaluation of power systems is illustrated with numerical examples.

Integration of miRNA and mRNA expression with DNA copy number of Ewing sarcoma cell lines

Ewing sarcoma is an aggressive and poorly differentiated malignancy of bone and soft tissue. It primarily affects children, adolescents, and young adults, with a slight male predominance. It is characterized by a translocation between chromosomes 11 and 22 resulting in the EWSR1-FLI1fusion transcription factor. The aim of this study is to identify putative Ewing sarcoma target genes through an integrative analysis of three microarray data sets. Array comparative genomic hybridization is used to measure changes in DNA copy number, and analyzed to detect common chromosomal aberrations. mRNA and miRNA microarrays are used to measure expression of protein-coding and miRNA genes, and these results integrated with the copy number data. Chromosomal aberrations typically contain also bystanders in addition to the driving tumor suppressor and oncogenes, and integration with expression helps to identify the true targets. Correlation between expression of miRNAs and their predicted target mRNAs is also evaluated to assess the results of post-transcriptional miRNA regulation on mRNA levels. The highest frequencies of copy number gains were identified in chromosome 8, 1q, and X. Losses were most frequent in 9p21.3, which also showed an enrichment of copy number breakpoints relative to the rest of the genome. Copy number losses in 9p21.3 were found have a statistically significant effect on the expression of MTAP, but not on CDKN2A, which is a known tumor-suppressor in the same locus. MTAP was also down-regulated in the Ewing sarcoma cell lines compared to mesenchymal stem cells. Genes exhibiting elevated expression in association with copy number gains and up-regulation compared to the reference samples included DCAF7, ENO2, MTCP1, andSTK40. Differentially expressed miRNAs were detected by comparing Ewing sarcoma cell lines against mesenchymal stem cells. 21 up-regulated and 32 down-regulated miRNAs were identified, includingmiR-145, which has been previously linked to Ewing sarcoma. The EWSR1-FLI1 fusion gene represses miR-145, which in turn targets FLI1 forming a mutually repressive feedback loop. In addition higher expression linked to copy number gains and compared to mesenchymal stem cells, STK40 was also found to be a target of four different miRNAs that were all down-regulated in Ewing sarcoma cell lines compared to the reference samples. SLCO5A1 was identified as the only up-regulated gene within a frequently gained region in chromosome 8. This region was gained in over 90 % of the cell lines, and also with a higher frequency than the neighboring regions. In addition, SLCO5A1 was found to be a target of three miRNAs that were down-regulated compared to the mesenchymal stem cells.

Probability Distribution of the Eigenvalues of the Random String Equation

The probability distribution of the eigenvalues of a second-order stochastic boundary value problem is considered. The solution is characterized in terms of the zeros of an associated initial value problem. It is further shown that the probability distribution is related to the solution of a first-order nonlinear stochastic differential equation. Solutions of this equation based on the theory of Markov processes and also on the closure approximation are presented. A string with stochastic mass distribution is considered as an example for numerical work. The theoretical probability distribution functions are compared with digital simulation results. The comparison is found to be reasonably good.

Search on a hypercubic lattice using a quantum random walk. I. d > 2

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighboring locations. We construct a quantum random walk algorithm, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice. The restriction on movement hardly matters for d > 2, and scaling behavior close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimize the proportionality constants of the scaling behavior, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean-field theory or the d -> infinity limit). In particular, the scaling behavior for d = 3 is only about 25% higher than the optimal d -> infinity value.

Search on a hypercubic lattice using a quantum random walk. II. d = 2

We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretized according to the staggered lattice fermion formalism. d = 2 is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behavior. As a result, the construction used in our accompanying article A. Patel and M. A. Rahaman, Phys. Rev. A 82, 032330 (2010)] provides an O(root N ln N) algorithm, which is not optimal. The scaling behavior can be improved to O(root N ln N) by cleverly controlling the massless Dirac evolution operator by an ancilla qubit, as proposed by Tulsi Phys. Rev. A 78, 012310 (2008)]. We reinterpret the ancilla control as introduction of an effective mass at the marked vertex, and optimize the proportionality constants of the scaling behavior of the algorithm by numerically tuning the parameters.

Spectral Invariance of SG Pseudo-Differential Operators on L-P(R-n)

We prove the spectral invariance of SG pseudo-differential operators on L-P(R-n), 1 < p < infinity, by using the equivalence of ellipticity and Fredholmness of SG pseudo-differential operators on L-p(R-n), 1 < p < infinity. A key ingredient in the proof is the spectral invariance of SC pseudo-differential operators on L-2(R-n).

Patterns in permuted binary matrices

Reorganizing a dataset so that its hidden structure can be observed is useful in any data analysis task. For example, detecting a regularity in a dataset helps us to interpret the data, compress the data, and explain the processes behind the data. We study datasets that come in the form of binary matrices (tables with 0s and 1s). Our goal is to develop automatic methods that bring out certain patterns by permuting the rows and columns. We concentrate on the following patterns in binary matrices: consecutive-ones (C1P), simultaneous consecutive-ones (SC1P), nestedness, k-nestedness, and bandedness. These patterns reflect specific types of interplay and variation between the rows and columns, such as continuity and hierarchies. Furthermore, their combinatorial properties are interlinked, which helps us to develop the theory of binary matrices and efficient algorithms. Indeed, we can detect all these patterns in a binary matrix efficiently, that is, in polynomial time in the size of the matrix. Since real-world datasets often contain noise and errors, we rarely witness perfect patterns. Therefore we also need to assess how far an input matrix is from a pattern: we count the number of flips (from 0s to 1s or vice versa) needed to bring out the perfect pattern in the matrix. Unfortunately, for most patterns it is an NP-complete problem to find the minimum distance to a matrix that has the perfect pattern, which means that the existence of a polynomial-time algorithm is unlikely. To find patterns in datasets with noise, we need methods that are noise-tolerant and work in practical time with large datasets. The theory of binary matrices gives rise to robust heuristics that have good performance with synthetic data and discover easily interpretable structures in real-world datasets: dialectical variation in the spoken Finnish language, division of European locations by the hierarchies found in mammal occurrences, and co-occuring groups in network data. In addition to determining the distance from a dataset to a pattern, we need to determine whether the pattern is significant or a mere occurrence of a random chance. To this end, we use significance testing: we deem a dataset significant if it appears exceptional when compared to datasets generated from a certain null hypothesis. After detecting a significant pattern in a dataset, it is up to domain experts to interpret the results in the terms of the application.

Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs

Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.

Genetic and epigenetic mechanisms of tumor predisposition in hereditary non-polyposis colorectal carcinoma and sporadic cancers

Individuals with inherited deficiency in DNA mismatch repair(MMR) (Lynch syndrome) LS are predisposed to different cancers in a non-random fashion. Endometrial cancer (EC) is the most common extracolonic malignancy in LS. LS represents the best characterized form of hereditary nonpolyposis colorectal carcinoma (HNPCC). Other forms of familial non-polyposis colon cancer exist, including familial colorectal cancer type X (FCCX). This syndrome resembles LS, but MMR gene defects are excluded and the predisposition genes are unknown so far. To address why different organs are differently susceptible to cancer development, we examined molecular similarities and differences in selected cancers whose frequency varies in LS individuals. Tumors that are common (colorectal, endometrial, gastric) and less common (brain, urological) in LS were characterized for MMR protein expression, microsatellite instability (MSI), and by altered DNA methylation. We also studied samples of histologically normal endometrium, endometrial hyperplasia,and cancer for molecular alterations to identify potential markers that could predict malignant transformation in LS and sporadic cases. Our results suggest that brain and kidney tumors follow a different pathway for cancer development than the most common LS related cancers.Our results suggest also that MMR defects are detectable in endometrial tissues from a proportion of LS mutation carriers prior to endometrial cancer development. Traditionally (complex) atypical hyperplasia has been considered critical for progression to malignancy. Our results suggest that complex hyperplasia without atypia is equally important as a precursor lesion of malignancy. Tumor profiles from Egypt were compared with colorectal tumors from Finland to evaluate if there are differences specific to the ethnic origin (East vs.West). Results showed for the first time a distinct genetic and epigenetic signature in the Egyptian CRC marked by high methylation of microsatellite stable tumors associated with advanced stage, and low frequency of Wnt signaling activation, suggesting a novel pathway. DNA samples from FCCX families were studied with genome wide linkage analysis using microsatellite markers. Selected genes from the linked areas were tested for possible mutations that could explain predisposition to a large number of colon adenomas and carcinomas seen in these families. Based on the results from the linkage analysis, a number of areas with tentative linkage were identified in family 20. We narrowed down these areas by additional microsatellite markers to found a mutation in the BMPR1A gene. Sequencing of an additional 17 FCCX families resulted in a BMPR1A mutation frequency of 2/18 families (11%). Clarification of the mechanisms of the differential tumor susceptibility in LS increases the understanding of gene and organ specific targets of MMR deficiency. While it is generally accepted that widespread MMR deficiency and consequent microsatellite instability (MSI) drives tumorigenesis in LS, the timing of molecular alterations is controversial. In particular, it is important to know that alterations may occur several years before cancer formation, at stages that are still histologically regarded as normal. Identification of molecular markers that could predict the risk of malignant transformation may be used to improve surveillance and cancer prevention in genetically predisposed individuals. Significant fractions of families with colorectal and/or endometrial cancer presently lack molecular definition altogether. Our findings expand the phenotypic spectrum of BMPR1A mutations and, for the first time, link FCCX families to the germline mutation of a specific gene. In particular, our observations encourage screening of additional families with FCCX for BMPR1A mutation, which is necessary in obtaining a reliable estimate of the share of BMPR1A-associated cases among all FCCX families worldwide. Clinically, the identification of predisposing mutations enables targeted cancer prevention in proven mutation carriers and thereby reduces cancer morbidity and mortality in the respective families.

Narrowband random excitation of a limit cycle system

The response of the Van der Pol oscillator to stationary narrowband Gaussian excitation is considered. The central frequency of excitation is taken to be in the neighborhood of the system limit cycle frequency. The solution is obtained using a non-Gaussian closure approximation on the probability density function of the response. The validity of the solution is examined with the help of a stochastic stability analysis. Solution based on Stratonovich''s quasistatic averaging technique is also obtained. The comparison of the theoretical solutions with the digital simulations shows that the theoretical estimates are reasonably good.