A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that nitary frame matroids are the bias matroids of biased graphs, we characterize modular coatoms in frames of nite rank and we describe explicitly the frames that are...

The nonrandom use of synonymous codons (codon bias) is a well-established phenomenon in Drosophila. Recent reports suggest that levels of codon bias differ among genes that are differentially expressed between the sexes, with male-expressed genes showing less codon bias than female-expressed genes. To examine the relationship between sex-biased gene expression and level of codon bias on a genom...

Data can arise as a length-biased sample rather than as a random sample; e.g. a sample of patients in hospitals or of network cable lines (experimental units with longer stays or longer lines have greater likelihoods of being sampled). The distribution arising from a single length-biased sampling (LBS) time has been derived (e.g. (The Statistical Analysis of Discrete Time Events. Oxford Press: ...

A misclassified size-biased Borel Distribution (MSBBD), where some of the observations corresponding to x = c + 1 are wrongly reported as x = c with probability α, is defined. Various estimation methods like the method of maximum likelihood (ML), method of moments, and the Bayes estimation for the parameters of the MSBB distribution are used. The performance of the estimators are studied using ...

ROC analysis makes it possible to evaluate how well classiiers will perform given certain misclas-siication costs and class distributions. Given a set of classiiers, it also provides a method for constructing a hybrid classiier that optimally uses the available classiiers. Now in some cases it is possible to derive multiple classiiers from a single one, in a cheap way, and such that these class...

Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph G, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of G that contain at least two cycles, and are minimal with respect to this property. The main result of this paper is a characterization of when two graphs give rise to the same bicircular lift matroid, which ...