A locally semicomplete digraph is a digraph D=(V,A) satisfying the following condi-tion for every vertex x∈V the D[O(x)] and D[I(x)] are semicomplete digraphs.
We show that the maximum number of intersections between two plane rectangular paths with lengths m and n: 2 ≤ m ≤ n, is 4n+2, if m=4 and n≡1(mod 3); and it
Empirical Bayes estimation of the parameter vector θ=(β^1,σ^2)' in a multiple linear regression model Y=Xβ+ε is considered, where β is the vector of r