Existence of the uniformly minimum risk equivariant estimators of parameters in a class of normal linear models

In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)^α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively. Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there exist UMRE estimators of parameters in the variance components model are obtained for the first time.     

Optic Fiber Interferometer for Absolute Distance Measurement

1.IntroductionAbsolutedistancemeasurementisfarfromanewtopic.However,itisstillafieldstimulatinggreatinterestsnowadaysduetoitSimportantroleinmanufacturingandassembly['J.SincethegreatsuccessachievedbyMichelsonandBenoitwhentheyfirstdevelopedaninterferometertodeterminethestandardmeterintermsofthemonochromaticredcadmiumline,theopticinterferometerhasbeenprovedtobeoneofthemostpreciseandefficientwayindisplacementmeasurementbecauseofitshighdiscriminationandsimplestructure.However,thetraditionalinterfe…     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

Q过程的不变分布(Ⅱ)

设E为一个可数集,Q=（qi,j;i,j∈E）为E×E上的矩阵,满足m为E上的概率分布满足何时存在Q过程,使得m是它的不变分布? 这个问题由Williams（1979）作为一个开问题提出.文[15]对全稳定情形,解决了这个问题;本文对单瞬时情形,完整地解决了该问题.     

A method for calculating invariant subspaces of symmetric hyperbolic equations

An algorithm is constructed for calculating invariant subspaces of symmetric hyperbolic systems arising in electromagnetic, acoustic, and elasticity problems. Discrete approximations are calculated for subspaces that correspond to minimal eigenvalues and smooth eigenfunctions. Difficulties related to the presence of an infinite-dimensional kernel in the differential operator are successfully handled. The efficiency of the algorithm is demonstrated using acoustics equations.     

Quantization of Underdamped, Critically Damped, and Overdamped Electric Circuits with a Power Source

We have investigated the quantum mechanical effect of the underdamped, critically damped, and overdamped electric circuits with a power source. The charge of the underdamped circuit oscillates while those of the critically damped and overdamped ones don't. The wave function of the system of overdamped circuit represented parabolic cylinder function while underdamped circuit was represented by well-known Hermite polynomial. The eigenvalues of underdamped circuit is discrete while those of the critically damped and overdamped ones are given as continuously.     

Banach空间上有界可逆线性变换逆变换的结构

Fillmore在[1]中得到一个定理:设A,T是Banach空间X上的线性变换,A有界,若Lat(A) Lat(T)且AT=TA,则T是A的多项式.在本文里,以此作为引理,讨论了Banach空间上可逆线性变换A在什么情况下,A-1可表示为A的多项式.本文最主要的结论是定理3.4:设X是Banach空间,A是X上的有界线性变换,且可逆,则A-1是A的多项式当且仅当A-1是A的局部多项式.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.