Equivariant fixed-point indices of iterated maps

We describe an equivariant version (for actions of a finite group G) of Dold’s index theory, [10], for iterated maps. Equivariant Dold indices are defined, in general, for a G-map U → X defined on an open G-subset of a G-ANR X (and satisfying a suitable compactness condition). A local index for isolated fixed-points is introduced, and the theorem of Shub and Sullivan on the vanishing of all but finitely many Dold indices for a continuously differentiable map is extended to the equivariant case. Homotopy Dold indices, arising from the equivariant Reidemeister trace, are also considered.      

关于非光滑不变凸多目标规划的Wolfe型对偶

本文讨论定义在Banach空间上的,既具有等式约束又具有不等式约束的,非光滑(F,P)不变凸多目标规划的Wolfe对偶性,Mond-Weir型对偶性可类似讨论之。     

Echo planar imaging of perfluorocarbons

Emulsions of perfluorotributylamine (FTBA) and perflubron were evaluated for their utility in ¹⁹F echo planar imaging. Fluorine images of the emulsions were obtained in a phantom and two mice that had been predosed. Both agents, but particularly perflubron, show potential for fluorine echo planar studies because of the long spin-spin relaxation times of the CF₃ resonances. High resolution thin slice images obtained in as little as 26.6 ms are presented.     

Riccati-based preconditioner for computing invariant subspaces of large matrices

Summary. This paper introduces and analyzes the convergence properties of a method that computes an approximation to the invariant subspace associated with a group of eigenvalues of a large not necessarily diagonalizable matrix. The method belongs to the family of projection type methods. At each step, it refines the approximate invariant subspace using a linearized Riccati's equation which turns out to be the block analogue of the correction used in the Jacobi-Davidson method. The analysis conducted in this paper shows that the method converges at a rate quasi-quadratic provided that the approximate invariant subspace is close to the exact one. The implementation of the method based on multigrid techniques is also discussed and numerical experiments are reported. Received June 15, 2000 / Revised version received January 22, 2001 / Published online October 17, 2001     

Minimizing the number of transitions with respect to observation equivalence

Labeled transition systems (lts) provide an operational semantics for many specification languages. In order to abstract unrelevant details of lts's, manybehavioural equivalences have been defined; here observation equivalence is considered. We are interested in the following problem:Given a finite lts, which is the minimal observation equivalent lts corresponding to it? It is well known that the number of states of an lts can be minimized by applying arelational coarsest partition algorithm. However, the obtained lts is not unique (up to the renaming of the states): for an lts there may exist several observation equivalent lts's which have the minimal number of states but varying number of transitions. In this paper we show how the number of transitions can be minimized, obtaining a unique lts.     

U-statistics in danach spaces

U-statistics in Banach spaces are considered and thoroughly investigated. The martingale structure, estimates of moments, the law of large numbers, the central limit theorem, the invariance principle, estimates of the rate of convergence, and large deviations are established     

REML estimation for binary data in GLMMs

The restricted maximum likelihood (REML) procedure is useful for inferences about variance components in mixed linear models. However, its extension to hierarchical generalized linear models (HGLMs) is often hampered by analytically intractable integrals. Numerical integration such as Gauss-Hermite quadrature (GHQ) is generally not recommended when the dimensionality of the integral is high. With binary data various extensions of the REML method have been suggested, but they have had unsatisfactory biases in estimation. In this paper we propose a statistically and computationally efficient REML procedure for the analysis of binary data, which is applicable over a wide class of models and design structures. We propose a bias-correction method for models such as binary matched pairs and discuss how the REML estimating equations for mixed linear models can be modified to implement more general models.