in this paper, we proposed a data-hiding scheme based on run length matrix. in a previously proposed method, a technique based on texture classification was introduced where four statically features extracted from run length matrix; then best cover images are selected based on these features. using appropriate features for comparing images from undetectability viewpoint, guarantees, less detect...

conclusions some results of the correlation coefficients are not the same with visualization. the reason may be due to the small number of data. materials and methods in the foundation-application study, we constructed two-way gene networks using nonparametric methods, such as spearman’s rank correlation coefficient and blomqvist’s measure, and compared them with pearson’s correlation coefficie...

For any given number of factors, Minimum Rank Factor Analysis yields optimal communalities for an observed covariance matrix in the sense that the unexplained common variance with that number of factors is minimized, subject to the constraint that both the diagonal matrix of unique variances and the observed covariance matrix minus that diagonal matrix are positive semidefinite. As a result, it...

a set of 29 persimmon genotypes were characterized using morphological characters and rapd markers. some fruit traits of: fresh weight, fruit length and diameter, firmness, fruit juice ph, ta, tss, flavor index, fruit skin and flesh color, seededness, leaf length and width were evaluated. analysis of variance for the investigated characters showed that genotypes were significantly different. re...

The infinitesimal generator matrix underlying a multidimensional Markov chain can be represented compactly by using sums of Kronecker products of small rectangular matrices. For such compact representations, analysis methods based on vector-Kronecker product multiplication need to be employed. When the factors in the Kronecker product terms are relatively dense, vectorKronecker product multipli...

Image synthesis techniques requiringMonteCarlo integration frequentlyneed to generate uniformly distributed samples within the unit hypercube. The ideal sample generation method will maximize the variance reduction as the numberof samples increases. Strati cationvia jittering is one simple, tractable, R. L. Cook. Stochastic sampling in computer graphics. ACM Transactions on Graphics, 5(1):51–72...

Wave scattering in chaotic systems with a uniform energy loss (absorption) is considered. Within the random matrix approach we calculate exactly the energy correlation functions of different matrix elements of impedance or scattering matrices for systems with preserved or broken time-reversal symmetry. The obtained results are valid at any number of arbitrary open scattering channels and arbitr...

In the present paper, we propose an exact test on the structure of the covariance matrix. In its development the properties of the Wishart distribution are used. Unlike the classical likelihood-ratio type tests and the tests based on the empirical distance, whose statistics depend on the total variance and the generalized variance only, the proposed approach provides more information about the ...