非参数回归函数之改良基于分割的估计的强相合性（英）

设(X,Y),(X1,Y1),…,(XnYn)为取值于 Rd× R的 i．i．d．随机变量,E(|Y|) ＜∞．设mn(x)为回归函数m(x)=E(|Y|X=x)基于分割的估计,本文在对mn(x)进行改良的条件下得到改良的基于分割的强相合估计．     

Vector-Orthogonality and Lanczos-Type Methods

A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open.     

On a recursive method for the estimation of unknown parameters of partially observed chaotic systems

We investigate a recently proposed method for on-line parameter estimation and synchronization in chaotic systems. This novel technique has been shown effective to estimate a single unknown parameter of a primary chaotic system with known functional form that is only partially observed through a scalar time series. It works by periodically updating the parameter of interest in a secondary system, with the same functional form as the primary one but no explicit coupling between their dynamic variables, in order to minimize a suitably defined cost function. In this paper, we review the basics of the method, and investigate its robustness and new extensions. In particular, we study the performance of the novel technique in the presence of noise (either observational, i.e., an additive contamination of the observed time series, or dynamical, i.e., a random perturbation of the system dynamics) and when there is a mismatch between the primary and secondary systems. Numerical results, including comparisons with other techniques, are presented. Finally, we investigate the extension of the original method to perform the estimation of two unknown parameters and illustrate its effectiveness by means of computer simulations.     

固化疏浚泥作为填方材料的试验研究

港口、航道的建设和维护工程产生了大量的疏浚泥，如何处理这些疏浚泥已是国内外十分关注的问题．从资源的再生利用出发，提出利用固化材料固化疏浚泥作为填方材料的设想，并通过强度试验、溶出试验等一系列试验证实，固化疏浚泥作为填方材料在技术经济指标上完全可行．     

PRACTICAL STABILITY IN TERMS OF TWO MEASURES FOR DISCRETE SYSTEMS

Practical stability in terms of two measures for difference equations is discussed by using the Lyapunov function and a new comparison theorem.     

Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations

In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

Distributive lattices of numberings

We study into a semilattice of numberings generated by a given fixed numbering via operations of completion and taking least upper bounds. It is proved that, except for the trivial cases, this semilattice is an infinite distributive lattice every principal ideal in which is finite. The least upper and the greatest lower bounds in the semilattice are invariant under extensions in the semilattice of all numberings. Isomorphism types for the semilattices in question are in one-to-one correspondence with pairs of cardinals the first component of which is equal to the cardinality of a set of non-special elements, and the second — to the cardinality of a set of special elements, of the initial numbering. Supported by INTAS grant No. 00-429. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 83–102, January–February, 2007.     

Resolvent estimates in W−1,p related to strongly coupled‐linear parabolic systems with coupled nonsmooth capacities

We investigate linear parabolic systems with coupled nonsmooth capacities and mixed boundary conditions. We prove generalized resolvent estimates in W^{?1, p} spaces. The method is an appropriate modification of a technique introduced by Agmon to obtain L^p estimates for resolvents of elliptic differential operators in the case of smooth boundary conditions. Moreover, we establish an existence and uniqueness result. Copyright © 2007 John Wiley & Sons, Ltd.