What is the weakest topology in which feedback stability is robust?

Mathematical theorems in control theory are only of interest in so far as their assumptions relate to practical situations. The space of systems with transfer functions in ℋ∞, for example, has many advantages mathematically, but includes large classes of non-physical systems, and one must be careful in drawing inferences from results in that setting. Similarly, the graph topology has long been known to be the weakest, or coarsest, topology in which (1) feedback stability is a robust property (i.e. preserved in small neighbourhoods) and (2) the map from open-to-closed-loop transfer functions is continuous. However, it is not known whether continuity is a necessary part of this statement, or only required for the existing proofs. It is entirely possible that the answer depends on the underlying classes of systems used. The class of systems we concern ourselves with here is the set of systems that can be approximated, in the graph topology, by real rational transfer function matrices. That is, lumped parameter models, or those distributed systems for which it makes sense to use finite element methods. This is precisely the set of systems that have continuous frequency responses in the extended complex plane. For this class, we show that there is indeed a weaker topology; in which feedback stability is robust but for which the maps from open-to-closed-loop transfer functions are not necessarily continuous. © 2013 Copyright Taylor and Francis Group, LLC.

The Random Forest Kernel and other kernels for big data from random partitions

We present Random Partition Kernels, a new class of kernels derived by demonstrating a natural connection between random partitions of objects and kernels between those objects. We show how the construction can be used to create kernels from methods that would not normally be viewed as random partitions, such as Random Forest. To demonstrate the potential of this method, we propose two new kernels, the Random Forest Kernel and the Fast Cluster Kernel, and show that these kernels consistently outperform standard kernels on problems involving real-world datasets. Finally, we show how the form of these kernels lend themselves to a natural approximation that is appropriate for certain big data problems, allowing $O(N)$ inference in methods such as Gaussian Processes, Support Vector Machines and Kernel PCA.

A reversible infinite HMM using normalised random measures

Copyright 2014 by the author(s). We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Markov chain. The resulting prior over infinite transition matrices is closely related to the hierarchical Dirichlet process but enforces reversibility. A reinforcement scheme has recently been proposed with similar properties, but the de Finetti measure is not well characterised. We take the alternative approach of explicitly constructing the mixing measure, which allows more straightforward and efficient inference at the cost of no longer having a closed form predictive distribution. We use our process to construct a reversible infinite HMM which we apply to two real datasets, one from epigenomics and one ion channel recording.

A derivation of the asymptotic random-coding prefactor

This paper studies the subexponential prefactor to the random-coding bound for a given rate. Using a refinement of Gallager's bounding techniques, an alternative proof of a recent result by Altuǧ and Wagner is given, and the result is extended to the setting of mismatched decoding. © 2013 IEEE.

DNA polymorphism of the plankton community and its relationships to species composition in the Three Gorges Reservoir Region of the Yangtze River

We examined DNA polymorphism of the plankton community in the Three Gorges Reservoir Region of Yangtze River and studied its relationships to species composition. Samples of the plankton community were collected from nine sampling sites and analyzed by random amplified polymorphic DNA (RAPD). Nine of 60 screened primers generated a total of 88 observable 180 to 1400 by bands, all of which were polymorphic. Cluster analysis of the resulting binary format from DNA banding patterns grouped the target communities into three clusters. The topology of the constructed diagram from species composition data was generally similar to that based on RAPD markers.

A fully three-dimensional atomistic quantum mechanical study on random dopant-induced effects in 25-nm MOSFETs

A fully 3-D atomistic quantum mechanical simulation is presented to study the random dopant-induced effects in nanometer metal-oxide-semiconductor field-effect transistors. The empirical pseudopotential is used to represent the single particle Hamiltonian, and the linear combination of bulk band method is used to solve the million atom Schrodinger equation. The gate threshold fluctuation and lowering due to the discrete dopant configurations are studied. It is found that quantum mechanical effects increase the threshold fluctuation while decreasing the threshold lowering. The increase of threshold fluctuation is in agreement with the researchers' early study based on an approximated density gradient approach. However, the decrease in threshold lowering is in contrast with the density gradient calculations.

An ultra-low power CMOS random number generator

This paper proposes an ultra-low power CMOS random number generator (RING), which is based on an oscillator-sampling architecture. The noisy oscillator consists of a dual-drain MOS transistor, a noise generator and a voltage control oscillator. The dual-drain MOS transistor can bring extra-noise to the drain current or the output voltage so that the jitter of the oscillator is much larger than the normal oscillator. The frequency division ratio of the high-frequency sampling oscillator and the noisy oscillator is small. The RNG has been fabricated in a 0.35 mu m CMOS process. It can produce good quality bit streams without any post-processing. The bit rate of this RNG could be as high as 100 kbps. It has a typical ultra-low power dissipation of 0.91 mu W. This novel circuit is a promising unit for low power system and communication applications. (c) 2007 Elsevier Ltd. All rights reserved.

Random telegraph noise in the photoluminescence of individual GaxIn1-xAs quantum dots in GaAs

We have investigated random telegraph noise in the photoluminescence from InGaAs quantum dots in GaAs. Dots switching among two and three levels have been measured. The experiments show that the switching InGaAs dots behave very similarly to switching InP dots in GaInP. but differently from the more commonly investigated colloidal dots. The switching is attributed to defects, and we show that the switching can be used as a monitor of the defect.

Fully lithography independent fabrication of nanogap electrodes for lateral phase-change random access memory application

Submitted by 阎军 (yanj@red.semi.ac.cn) on 2010-06-07T01:33:41Z No. of bitstreams: 1 ApplPhysLett_96_213505.pdf: 1153920 bytes, checksum: 69931d8deb797813dd478b5dd0e292c0 (MD5)

Efficient Simulation of Freak Waves in Random Oceanic Sea States

Numerical simulations of freak wave generation are studied in random oceanic sea states described by JONSWAP spectrum. The evolution of initial random wave trains is numerically carried out within the framework of the modified four-order nonlinear Schroedinger equation (mNLSE), and some involved influence factors are also discussed. Results show that if the sideband instability is satisfied, a random wave train may evolve into a freak wave train, and simultaneously the setting of the Phillips parameter and enhancement coefficient of JONSWAP spectrum and initial random phases is very important for the formation of freak waves. The way to increase the generation efficiency of freak waves though changing the involved parameters is also presented.