On the subspaces of JF and JT with non-separable dual

It is proved that every subspace of James Tree space (JT) with non-separable dual contains an isomorph of James Tree complemented in JT. This yields that every complemented subspace of JT with non-separable dual is isomorphic to JT. A new JT like space denoted as TF is defined. It is shown that every subspace of James Function space (JF) with non-separable dual contains an isomorph of TF. The later yields that every subspace of JF with non-separable dual contains isomorphs of c₀ and ?p for 2?p<∞. The analogues of the above results for bounded linear operators are also proved.     

一类函数增量的局部渐近性质

文章研究了一类函数增量的局部渐近性质,发现这类函数增量的局部渐近性对于一元实函数,二元及多元实函数,向量值函数和复函数在一定条件下都会保持不变,进而提出了两个相关的猜想:此类函数增量的渐近性是关于函数变换的拓扑不变量。     

Weighted Commutator and Weighted BMO Martingales

ＷｅｉｇｈｔｅｄＣｏｍｍｕｔａｔｏｒａｎｄＷｅｉｇｈｔｅｄＢＭＯＭａｒｔｉｎｇａｌｅｓＹｕＨｏｎｇｑｉ（于红旗）ａｎｄＷａｎｇＪｉａｎ（王健）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＸｉａｎｇｔａｎＵｎｉｖｅｒｓｉｔｙ，Ｘｉａｎｇｔａｎ，Ｈ...     

泛函梯度数值计算的一种新方法—正交试验法

本文研究并揭示了L_(2~a)(2~(2~a-1))型正交表行(列)间的递推规律,提出了一种泛函梯度数值计算的新方法——正交试验法,该方法在计算速度和精度上优于直接梯度法;在通用性及节省内存方面优于伴随算子法。     

Asymptotic behavior of continuous stochastic games

Summary The aim of this paper is to analyze the asymptotic behavior of the value functions of a continuous stochastic game as the number of stages grows to infinity or the discount factor approaches 1. After the setup of the problem we prove that, in both cases, the extrema of the value functions converge to the same limits. The convergence of the value functions is then obtained from the unicity of the solution of a functional problem and it is thus possible to design hypotheses that assure the convergence to a constant. This allows to assign a value to an undiscounted infinite-stage stochastic game in several senses and to show that optimal strategies are available for both players. Furthermore the boundedness of the remainders of the value function after removing the principal terms is analyzed, with appropriate hypotheses, and related to the existence of solutions of a Howard's type functional equation. This allows to show that for an infinite-stage undiscounted stochastic game optimal stationary strategies exist at least if this functional equation has some solution.     

On the moments of Kloosterman sums and fibre products of Kloosterman curves

Let q=p^r with p=3 and r2. We give a recursion formula for the moments of a Kloosterman sum over the finite field , which utilizes known weight formulae for the ternary Melas code M of length q−1. The method is illustrated by giving explicit formulae for the moments up to the tenth moment. As an application for the formulae, and for their analogues obtained earlier in case p=2, we get the exact number of rational points on fibre products of certain Kloosterman curves. As a corollary we obtain identities between Ramanujan's tau-function, Kronecker class numbers, and Dickson polynomials.     

凸集的广义Reuleaux三角形

常宽凸集的面积最小者为Reulaux三角形，而非常宽凸集的面积最小者为何呢？它就是本文将给出的广义Reuleaux三角形△R。     

On a Function Related to Multinomial Coefficients (I)

Let F _p,t (n) denote the number of the coefficients of (x ₁+1x ₂+...+x _t ) ^j , 0 ≤j≤n− 1, which are not divisible by the prime p. Define G _p,t (n) = F _p,t /n ^θ and β(p,t) = lim infF _p,t )(n)/n ^θ, where θ = (log)/(log p). In this paper, we mainly prove that G _p,t can be extended to a continuous function on ℝ⁺, and the function G _p,t is nowhere monotonic. Both the set of differential points of the function G _p,t and the set of non-differential points of the function G _p,t are dense in ℝ⁺. Received February 18, 2000, Accepted December 7, 2000     

Some robust objectives of FCM for data analyzing

There are many data clustering techniques available to extract meaningful information from real world data, but the obtained clustering results of the available techniques, running time for the performance of clustering techniques in clustering real world data are highly important. This work is strongly felt that fuzzy clustering technique is suitable one to find meaningful information and appropriate groups into real world datasets. In fuzzy clustering the objective function controls the groups or clusters and computation parts of clustering. Hence researchers in fuzzy clustering algorithm aim is to minimize the objective function that usually has number of computation parts, like calculation of cluster prototypes, degree of membership for objects, computation part for updating and stopping algorithms. This paper introduces some new effective fuzzy objective functions with effective fuzzy parameters that can help to minimize the running time and to obtain strong meaningful information or clusters into the real world datasets. Further this paper tries to introduce new way for predicting membership, centres by minimizing the proposed new fuzzy objective functions. And experimental results of proposed algorithms are given to illustrate the effectiveness of proposed methods.