Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

Reply to Nathan: How to reconstruct the causal argument

Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that, on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination, that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that, properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a modified mechanism for hallucinations is implausibly ad hoc.     

Estimation of kinetics parameters for the adsorption of human serum albumin onto hydroxyapatite-modified silver electrodes by piezoelectric quartz crystal impedance analysis.

The adsorption of human serum albumin onto hydroxyapatite-modified silver electrodes has been in situ investigated by utilizing the piezoelectric quartz crystal impedance technique. The changes of equivalent circuit parameters were used to interpret the adsorption process. A kinetic model of two consecutive steps was derived to describe the process and compared with a first-order kinetic model by using residual analysis. The experimental data of frequency shift fitted to the model and kinetics parameters, k1, k2, psi1, psi2 and qr, were obtained. All fitted results were in reasonable agreement with the corresponding experimental results. Two adsorption constants (7.19 kJ mol(-1) and 22.89 kJ mol(-1)) were calculated according to the Arrhenius formula.     

Codiameters of 3‐connected 3‐domination critical graphs

A graph G is 3‐domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let G be a 3‐connected 3‐domination critical graph of order n. In this paper, we show that there is a path of length at least n?2 between any two distinct vertices in G and the lower bound is sharp. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 76–85, 2002