首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 640 毫秒
1.
Summary A. Beck has given an uniform strong law of large numbers for families of mutually symmetric and uniformly essentially bounded sequences of centered random variables, with values in (k, )—B-convex spaces. We show that, without any limitation on the Banach spaces, the technique used by A. Beck allows to replace, in strong law of large numbers making use of conditions bearing on essential bounds, the hypothesis of independence by an hypothesis called conditional-independence-and-centering, which is weaker than both hypothesis of independence and of mutual symmetry; moreover, in several cases, one gets uniform strong laws of large numbers (for families of conditionally-independent-and-centered sequences). The results we get are compared with recent results of G. Pisier, obtained with type p spaces techniques.  相似文献   

2.
3.
— [0,1] ,E — - e=1 [0,1]. I — E =1, E=L 2 x e =xL 2 x E.

This work was prepared when the second author was a visiting professor of the CNR at the University of Firenze. He was supported by the Soros International Fund.  相似文献   

4.
, c k b k . . . .

This work is supported by N.B.H.M. grant No. 48/1/94-R&D-II.  相似文献   

5.
In Knowledge Discovery in Databases (KDD)/Data Mining literature, interestingness measures are used to rank rules according to the interest a particular rule is expected to evoke. In this paper, we introduce an aspect of subjective interestingness called item-relatedness. Relatedness is a consequence of relationships that exist between items in a domain. Association rules containing unrelated or weakly related items are interesting since the co-occurrence of such items is unexpected. Item-Relatedness helps in ranking association rules on the basis of one kind of subjective unexpectedness. We identify three types of item-relatedness – captured in the structure of a fuzzy taxonomy (an extension of the classical concept hierarchy tree). An item-relatedness measure for describing relatedness between two items is developed by combining these three types. Efficacy of this measure is illustrated with the help of a sample taxonomy. We discuss three mechanisms for extending this measure from a two-item set to an association rule consisting of a set of more than two items. These mechanisms utilize the relatedness of item-pairs and other aspects of an association rule, namely its structure, distribution of items and item-pairs. We compare our approach with another method from recent literature.  相似文献   

6.
We present an explicit solution of the problem of optimal linear filtering: the recovery of the useful signal(s) at the instantt+, (>0,<0, or=0) from known values of the received signal(s)=(s)+(s) in the past, i.e., at the instantts, s0. In doing so we assume the random processes(s) and /gr(s) are stationary and jointly stationary, while the stationary process of noise (s) with zero mean is assumed to be mutually correlated and jointly stationary with the process(s) under the assumption that there exists a common spectral densityf() for these processes.Translated fromTeoriya Sluchaínykh Protsessov, Vol. 14, pp. 83–91, 1986.  相似文献   

7.
Let M be the complete module of a purely real algebraic field of degree n 3, let be a lattice in this module, and let F(X) be its form. We use to denote any lattice for which we have = , where is a nondiagonal matrix for which – I . With each lattice we can associate a factorizable formF (X) in a natural manner. We denote the complete set of forms corresponding to the set {} by {F (X)}. It is proved that for any > 0 there exists an > 0 such that for eachF (X) {F } we have |F (X0)| for some integer vector X0 0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 185, pp. 5–12, 1990.In conclusion, the author would like to express his deep gratitude to B. F. Skubenko for stating the problem and for his constant attention.  相似文献   

8.
Summary In his paper [1]P. Turán discovers the interesting behaviour of Hermite-Fejér interpolation (based on the ebyev roots) not describing the derivative values at exceptional nodes {n} n=1 . Answering to his question we construct such exceptional node-sequence for which the mentioned process is bounded for bounded functions whenever –1<x<1 but does not converge for a suitable continuous function at any point of the whole interval [–1, 1].  相似文献   

9.
Summary Let f: X &rarr; Y be a mapping. f is called a sequence-covering mapping if in case S is a convergent sequence containing its limit point in Y then there is a compact subset K of X such that f(K) = S. It is shown that each quotient and compact mapping of a metric space is sequence-covering.  相似文献   

10.
—.

Dedicated to Professor L. Leindler on his 50th birthday  相似文献   

11.
Two algebras of global pseudo-differential operators over n are investigated, with corresponding classes of symbols A0=CB (all (x, )-derivatives bounded over 2n), and A1 (all finite applications of xj, j, and pq=pqpxp on the symbol are in A0). The class A1 consists of classical symbols, i.e., x a= 0((1+||)–||) for x Kc ;n, K, compact. It is shown that a bounded operator A of 210C=L2(Rn) is a pseudo-differential operator with symbol aAj if and only if the map AG–1AG, G gj is infinitely differentiable, from a certain Lie-group gj c GL(210C) to (210C) with operator norm. g0 is the Weyl (or Heisenberg) group. Extensions to operators of arbitrary order are discussed. Applications to follow in a subsequent paper.Dedicated to Hans Lewy and Charles B. Morrey, Jr.  相似文献   

12.
13.
1<q<2 L:= n=1 1/q n=1/q–1. [0,1] n()=1, A n:= i=1 n–1 i(x)/qi+1/n x n(x)=0, n>. , = n=1 n(x)/qn. F: [0,L]R , F(x)= n=1 n(x)an, n=1 ¦a n¦<. [0,L]. q(1,2), . , q(1, 2), . .  相似文献   

14.
15.
16.
An invariant based on orderedK-theory with coefficients in n>1 /n and an infinite number of natural transformations has proved to be necessary and sufficient to classify a large class of nonsimple C* -algebras. In this paper, we expose and explain the relations between the order structure and the ideals of the C* -algebras in question.As an application, we give a new complete invariant for a large class of approximately subhomogeneous C*-algebras. The invariant is based on ordered K-theory with coefficients in /. This invariant is more compact (hence, easier to compute) than the invariant mentioned above, and its use requires computation of only four natural transformations.  相似文献   

17.
Blair [5] has introduced special directions on a contact metric 3-manifolds with negative sectional curvature for plane sections containing the characteristic vector field and, when is Anosov, compared such directions with the Anosov directions. In this paper we introduce the notion of Anosov-like special directions on a contact metric 3-manifold. Such directions exist, on contact metric manifolds with negative -Ricci curvature, if and only if the torsion is -parallel, namely (1.1) is satisfied. If a contact metric 3-manifold M admits Anosov-like special directions, and is -parallel, where is the Berger-Ebin operator, then is Anosov and the universal covering of M is the Lie group (2,R). We note that the notion of Anosov-like special directions is related to that of conformally Anosow flow introduced in [9] and [14] (see [6]).Supported by funds of the M.U.R.S.T. and of the University of Lecce. 1991.  相似文献   

18.
19.
One investigates the minimality of derivative chains, constructed from the root vectors of polynomial pencils of operators, acting in a Hilbert space. One investigates in detail the quadratic pencil of operators. In particular, for L()=L0+L1+2L2 with bounded operators L00, L20 and Re L10, one shows the minimality in the space173-02 of the system {xk, kekxk}, where xk are eigenvectors of L(), corresponding to the characteristic numbers kin the deleted neighborhoods of which one has the representation L–1()=(–k)–1RK+WK() with one-dimensional operators Rk and operator-valued functions WK(), k=1, 2, ..., analytic for =k.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 2, pp. 195–205, February, 1990.  相似文献   

20.
An algorithm is described for the approximate calculation of a collection of sums of the form k= j–1 n cj/(j+k), 1kn, where 0<j. The working time of the algorithm is 0(n(t+ log n)(t+log n)) if k calculated to within 2–t; here the function (l) denotes the time of multiplication of twoZ-bit numbers.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 137, pp. 3–6, 1984.In conclusion, the author expresses thanks to A. O. Slisenko and Yu. A. Kuznetsov, who drew the attention of the author to the problem considered.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号