Search results for "Data type"
showing 10 items of 1183 documents
Testing equality of reliability and stability with simple linear constraints in multi-wave, multi-variable models
1998
Data from a longitudinal study on school achievement were used to develop new methods for analysing reliability of measurements and stability of behaviour over a long time interval. The proposed method of analysis makes it possible to test hypotheses about equality constraints on reliability and stability. It is known that the use of negative variances for imaginary latent variables with equality constraints between structural parameters produces standardized variances for endogenous latent variables and quality constraints for coefficients of stability. Reparameterization of random errors in measurement models allows equality constraints to be set for coefficients of cross-sectional and of…
A more efficient second order blind identification method for separation of uncorrelated stationary time series
2016
The classical second order source separation methods use approximate joint diagonalization of autocovariance matrices with several lags to estimate the unmixing matrix. Based on recent asymptotic results, we propose a novel unmixing matrix estimator which selects the best lag set from a finite set of candidate sets specified by the user. The theory is illustrated by a simulation study.
Assessment of the probabilities for evolutionary structural changes in protein folds.
2007
Abstract Motivation: The evolution of protein sequences can be described by a stepwise process, where each step involves changes of a few amino acids. In a similar manner, the evolution of protein folds can be at least partially described by an analogous process, where each step involves comparatively simple changes affecting few secondary structure elements. A number of such evolution steps, justified by biologically confirmed examples, have previously been proposed by other researchers. However, unlike the situation with sequences, as far as we know there have been no attempts to estimate the comparative probabilities for different kinds of such structural changes. Results: We have tried …
On a set of data for the membrane potential in a neuron
2006
We consider a set of data where the membrane potential in a pyramidal neuron is measured almost continuously in time, under varying experimental conditions. We use nonparametric estimates for the diffusion coefficient and the drift in view to contribute to the discussion which type of diffusion process is suitable to model the membrane potential in a neuron (more exactly: in a particular type of neuron under particular experimental conditions).
Gabor-like systems in ${cal L}^2({bf R}^d)$ and extensions to wavelets
2008
In this paper we show how to construct a certain class of orthonormal bases in starting from one or more Gabor orthonormal bases in . Each such basis can be obtained acting on a single function with a set of unitary operators which operate as translation and modulation operators in suitable variables. The same procedure is also extended to frames and wavelets. Many examples are discussed.
Analysis of the renal transplant waiting list in the País Valencià (Spain).
2005
In this paper we analyse the renal transplant waiting list of the Pais Valencia in Spain, using Queueing theory. The customers of this queue are patients with end-stage renal failure waiting for a kidney transplant. We set up a simplified model to represent the flow of the customers through the system, and perform Bayesian inference to estimate parameters in the model. Finally, we consider several scenarios by tuning the estimations achieved and computationally simulate the behaviour of the queue under each one. The results indicate that the system could reach equilibrium at some point in the future and the model forecasts a slow decrease in the size of the waiting list in the short and mid…
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…
Multiple sequence editing by spreadsheet.
1990
Spreadsheets have several functions and facilities that make them good candidates to be used as multiple sequence editors. They can be easily programmed (even by non-programmers) with macros that allow them to fit the needs of the user, free of the restrictions that programs written by other people have. Here I present a sheet containing a set of macros written for Lotus 1-2-3
The Power of Word-Frequency Based Alignment-Free Functions: a Comprehensive Large-Scale Experimental Analysis
2021
Abstract Motivation Alignment-free (AF) distance/similarity functions are a key tool for sequence analysis. Experimental studies on real datasets abound and, to some extent, there are also studies regarding their control of false positive rate (Type I error). However, assessment of their power, i.e. their ability to identify true similarity, has been limited to some members of the D2 family. The corresponding experimental studies have concentrated on short sequences, a scenario no longer adequate for current applications, where sequence lengths may vary considerably. Such a State of the Art is methodologically problematic, since information regarding a key feature such as power is either mi…
Stochastic labelling of biological images
1998
Many hypotheses made by experimental researchers can be formulated as a stochastic labelling of a given image. Some stochastic labelling methods for random closed sets are proposed in this paper. Molchanov (I. Molchanov, 1984, Theor. Probability and Math. Statist.29, 113–119) provided the probabilistic background for this problem. However, there is a lack of specific labelling models. Ayala and Simo (G. Ayala and A. Simo, 1995, Advances in Applied Probability27, 293–305) proposed a method in which, given the whole set of connected components, every component is classified in a certain phase or category in a completely random way. Alternative methods are necessary in case the random labellin…