Correlation between density of states distributions and the fermi level position in interfacial regions of amorphous silicon thin film transistors

This paper investigates the variation of the integrated density of states with conduction activation energy in hydrogenated amorphous silicon thin film transistors. Results are given for two different gate insulator layers, PECVD silicon oxide and thermally grown silicon dioxide. The different gate insulators produce transistors with very different initial transfer characteristics, but the variation of integrated density of states with conduction activation energy is shown to be similar.

Competitive training in hidden Markov models

The use of hidden Markov models is placed in a connectionist framework, and an alternative approach to improving their ability to discriminate between classes is described. Using a network style of training, a measure of discrimination based on the a posteriori probability of state occupation is proposed, and the theory for its optimization using error back-propagation and gradient ascent is presented. The method is shown to be numerically well behaved, and results are presented which demonstrate that when using a simple threshold test on the probability of state occupation, the proposed optimization scheme leads to improved recognition performance.

The western Indian Ocean tuna fishery from 1980 to 1985: a summary of data collected by coastal states

Longliner and purse-seiner catch/effort statistics for tuna fisheries in the western Indian Ocean collected by Mozambique, Seychelles and Somalia are summarized. Although the data are not considered sufficient to indicate trends for the western Indian Ocean as a whole, an examination of data from the Seychelles EEZ shows that catch rates for yellowfin tuna declined consistently from 1982 to 1985, to about half their former levels. The data were processed by the FAO/Indo Pacific Tuna Development and Management Programme, Colombo, Sri Lanka.

APPROXIMATE GAUSS-MARKOV REALISATION OF MULTIVARIATE STOCHASTIC PROCESSES.

Given a spectral density matrix or, equivalently, a real autocovariance sequence, the author seeks to determine a finite-dimensional linear time-invariant system which, when driven by white noise, will produce an output whose spectral density is approximately PHI ( omega ), and an approximate spectral factor of PHI ( omega ). The author employs the Anderson-Faurre theory in his analysis.

Simple model of electronic density of states of graphite and its application to the investigation of superlattices

A model of graphite which is easy to comprehend and simple to implement for the simulation of scanning tunneling microscopy (STM) images is described. This model simulates the atomic density of graphite layers, which in turn correlates with the local density of states. The mechanism and construction of such a model is explained with all the necessary details which have not been explicitly reported before. This model is applied to the investigation of rippling fringes which have been experimentally observed on a superlattice, and it is found that the rippling fringes are not related to the superlattice itself. A superlattice with abnormal topmost layers interaction is simulated, and the result affirms the validity of the moiré rotation pattern assumption. The "odd-even" transition along the atomic rows of a superlattice is simulated, and the simulation result shows that when there is more than one rotated layer at the top, the "odd-even" transition will not be manifest. ©2005 The Japan Society of Applied Physics.

Blind equalization and sequence estimation using Markov chain Monte Carlo methods

This paper discusses the problem of restoring a digital input signal that has been degraded by an unknown FIR filter in noise, using the Gibbs sampler. A method for drawing a random sample of a sequence of bits is presented; this is shown to have faster convergence than a scheme by Chen and Li, which draws bits independently. ©1998 IEEE.

On the relationship between hidden Markov Models and convex functional transforms for simulating scanning probe Microscopy

Models for simulating Scanning Probe Microscopy (SPM) may serve as a reference point for validating experimental data and practice. Generally, simulations use a microscopic model of the sample-probe interaction based on a first-principles approach, or a geometric model of macroscopic distortions due to the probe geometry. Examples of the latter include use of neural networks, the Legendre Transform, and dilation/erosion transforms from mathematical morphology. Dilation and the Legendre Transform fall within a general family of functional transforms, which distort a function by imposing a convex solution.In earlier work, the authors proposed a generalized approach to modeling SPM using a hidden Markov model, wherein both the sample-probe interaction and probe geometry may be taken into account. We present a discussion of the hidden Markov model and its relationship to these convex functional transforms for simulating and restoring SPM images.©2009 SPIE.

A markov chain Monte Carlo method for estimating population mixing using Y-chromosome markers: Mixing of the Han people in China

We present a new approach for estimating mixing between populations based on non-recombining markers, specifically Y-chromosome microsatellites. A Markov chain Monte Carlo (MCMC) Bayesian statistical approach is used to calculate the posterior probability

Cumulative inbreeding rate in hatchery-reared indian major carps of Karnataka and Maharashtra states

The state fisheries department hatcheries are the major suppliers of seed to the farmers in Karnataka and Maharashtra. The brood stocks of these hatcheries are genetically closed units. In the present study, effective population size and cumulative inbreeding rates were estimated. The cumulative inbreeding rates ranged from 2.69 to 13.75, 8.63 to 15.21 and 3.02 to 5.88 per cent for catla, mrigal and rohu, respectively, in Karnataka state hatcheries. In Maharashtra, the cumulative inbreeding rates for catla ranged from 7.81 to 39.34 per cent and it was 5.84 to 14.09 and 2.46 to 10.20 per cent for mrigal and rohu, respectively. To estimate the inbreeding rates in future generations, predictive models were developed using linear regression, and polynomial and power equations separately for each hatchery. Their multiple correlation and standard errors suggested that simple linear regression can predict the future inbreeding rate efficiently.

Effective handling of dialogue state in the hidden information state POMDP-based dialogue manager

Effective dialogue management is critically dependent on the information that is encoded in the dialogue state. In order to deploy reinforcement learning for policy optimization, dialogue must be modeled as a Markov Decision Process. This requires that the dialogue statemust encode all relevent information obtained during the dialogue prior to that state. This can be achieved by combining the user goal, the dialogue history, and the last user action to form the dialogue state. In addition, to gain robustness to input errors, dialogue must be modeled as a Partially Observable Markov Decision Process (POMDP) and hence, a distribution over all possible states must be maintained at every dialogue turn. This poses a potential computational limitation since there can be a very large number of dialogue states. The Hidden Information State model provides a principled way of ensuring tractability in a POMDP-based dialogue model. The key feature of this model is the grouping of user goals into partitions that are dynamically built during the dialogue. In this article, we extend this model further to incorporate the notion of complements. This allows for a more complex user goal to be represented, and it enables an effective pruning technique to be implemented that preserves the overall system performance within a limited computational resource more effectively than existing approaches. © 2011 ACM.

The infinite HMM for unsupervised PoS tagging

We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing the number of hidden states in unsupervised Markov models for PoS tagging. We experiment with two non-parametric priors, the Dirichlet and Pitman-Yor processes, on the Wall Street Journal dataset using a parallelized implementation of an iHMM inference algorithm. We evaluate the results with a variety of clustering evaluation metrics and achieve equivalent or better performances than previously reported. Building on this promising result we evaluate the output of the unsupervised PoS tagger as a direct replacement for the output of a fully supervised PoS tagger for the task of shallow parsing and compare the two evaluations. © 2009 ACL and AFNLP.