Search results for "Map"
showing 10 items of 3484 documents
On the convenience of heteroscedasticity in highly multivariate disease mapping
2019
Highly multivariate disease mapping has recently been proposed as an enhancement of traditional multivariate studies, making it possible to perform the joint analysis of a large number of diseases. This line of research has an important potential since it integrates the information of many diseases into a single model yielding richer and more accurate risk maps. In this paper we show how some of the proposals already put forward in this area display some particular problems when applied to small regions of study. Specifically, the homoscedasticity of these proposals may produce evident misfits and distorted risk maps. In this paper we propose two new models to deal with the variance-adaptiv…
Affine Invariant Multivariate Sign and Rank Tests and Corresponding Estimates: a Review
1999
The paper reviews recent contributions to the statistical inference methods, tests and estimates, based on the generalized median of Oja. Multivariate analogues of sign and rank concepts, affine invariant one-sample and two-sample sign tests and rank tests, affine equivariant median and Hodges–Lehmann-type estimates are reviewed and discussed. Some comparisons are made to other generalizations. The theory is illustrated by two examples.
Influence functions and efficiencies of the canonical correlation and vector estimates based on scatter and shape matrices
2006
In this paper, the influence functions and limiting distributions of the canonical correlations and coefficients based on affine equivariant scatter matrices are developed for elliptically symmetric distributions. General formulas for limiting variances and covariances of the canonical correlations and canonical vectors based on scatter matrices are obtained. Also the use of the so-called shape matrices in canonical analysis is investigated. The scatter and shape matrices based on the affine equivariant Sign Covariance Matrix as well as the Tyler's shape matrix serve as examples. Their finite sample and limiting efficiencies are compared to those of the Minimum Covariance Determinant estima…
A non-linear optimization procedure to estimate distances and instantaneous substitution rate matrices under the GTR model.
2006
Abstract Motivation: The general-time-reversible (GTR) model is one of the most popular models of nucleotide substitution because it constitutes a good trade-off between mathematical tractability and biological reality. However, when it is applied for inferring evolutionary distances and/or instantaneous rate matrices, the GTR model seems more prone to inapplicability than more restrictive time-reversible models. Although it has been previously noted that the causes for intractability are caused by the impossibility of computing the logarithm of a matrix characterised by negative eigenvalues, the issue has not been investigated further. Results: Here, we formally characterize the mathematic…
Bifurcations in the Lozi map
2011
We study the presence in the Lozi map of a type of abrupt order-to-order and order-to-chaos transitions which are mediated by an attractor made of a continuum of neutrally stable limit cycles, all with the same period.
Varying-time random effects models for longitudinal data: unmixing and temporal interpolation of remote-sensing data
2008
Remote sensing is a helpful tool for crop monitoring or vegetation-growth estimation at a country or regional scale. However, satellite images generally have to cope with a compromise between the time frequency of observations and their resolution (i.e. pixel size). When concerned with high temporal resolution, we have to work with information on the basis of kilometric pixels, named mixed pixels, that represent aggregated responses of multiple land cover. Disaggreggation or unmixing is then necessary to downscale from the square kilometer to the local dynamic of each theme (crop, wood, meadows, etc.). Assuming the land use is known, that is to say the proportion of each theme within each m…
Explicit near-symplectic mappings of Hamiltonian systems with Lie-generating functions
2008
The construction of explicit near-symplectic mappings for generic Hamiltonian systems with the utilization of Lie transforms is presented. The method is mathematically rigorous and systematically extended to high order with respect to a perturbation parameter. The explicit mappings are compared to their implicit counterparts, which use mixed-variable generating functions, in terms of conservation of invariant quantities, calculation speed and accurate construction of Poincare surfaces of sections. The comparative study considers a wide range of parameters and initial conditions for which different time scales are involved due to large differences between internal and external frequencies of…
Iterative Cluster Analysis of Protein Interaction Data
2004
Abstract Motivation: Generation of fast tools of hierarchical clustering to be applied when distances among elements of a set are constrained, causing frequent distance ties, as happens in protein interaction data. Results: We present in this work the program UVCLUSTER, that iteratively explores distance datasets using hierarchical clustering. Once the user selects a group of proteins, UVCLUSTER converts the set of primary distances among them (i.e. the minimum number of steps, or interactions, required to connect two proteins) into secondary distances that measure the strength of the connection between each pair of proteins when the interactions for all the proteins in the group are consid…
Long read alignment based on maximal exact match seeds
2012
Abstract Motivation: The explosive growth of next-generation sequencing datasets poses a challenge to the mapping of reads to reference genomes in terms of alignment quality and execution speed. With the continuing progress of high-throughput sequencing technologies, read length is constantly increasing and many existing aligners are becoming inefficient as generated reads grow larger. Results: We present CUSHAW2, a parallelized, accurate, and memory-efficient long read aligner. Our aligner is based on the seed-and-extend approach and uses maximal exact matches as seeds to find gapped alignments. We have evaluated and compared CUSHAW2 to the three other long read aligners BWA-SW, Bowtie2 an…
Basic networks: Definition and applications
2009
7 pages, 4 figures, 1 table.-- PMID: 19490867 [PubMed]