广义凸集的切锥

本文讨论作者在〔16〕中提出的广义凸集的各种切锥之间的关系,切锥与正则锥的关系以及切锥的一些代数性质和拓朴性质。     

统计递归集的Hausdorff测度的上、下界

给出了由随机压缩算子生成的统计递归集的Ｈａｕｓｄｏｒｆ测度上、下界的估计．也就是说,在一些条件下,找出了Ｋ（ω）∩∞ｎ＝１∪ｉ∈Ｎｎ（ω）ｆ（ω）ｎ,ｉ（Ｅ）的α－维Ｈａｕｓｄｏｒｆ测度的上、下界,其中｛ｆｎ,ｉ,１≤ｉ,ｎ＜∞｝是一族随机压缩算子,｛Ｎｎ（ω）,ｎ≥１｝是一族可数的随机指标集．     

Euler characteristic and related measures for random geometric sets

By an elementary calculation we obtain the exact mean values of Minkowksi functionals for a standard model of percolating sets. In particular, a recurrence theorem for the mean Euler characteristic recently put forward is shown to be incorrect. Related previous mathematical work is mentioned. We also conjecture bounds for the threshold density of continuum percolation, which are associated with the Euler characteristic.     

Discriminant versus rough sets approach to vague data analysis

This paper presents a comparative study of the use of two different methods of data analysis on a common set of data. The first is a method based on rough sets theory and the second is the location model method from the field of discriminant analysis. To investigate the comparative performance of these methods, a set of real medical data has been used. The data considered are of both discrete and continuous character. During the comparison, particular attention is paid to data reduction and to the derivation of decision rules and classification functions from the reduced set.     

Fuzzy集的基数

关于Fuzzy集的基数，[1]中曾对有限支集的Fuzzy集以及极苛刻条件下的无限Fuzzy集给出过一种定义。但是，正如本文将要指出的那样，该定义是不合理的。本文将从研究Fuzzy映射入手，给出Fuzzy集基数的一般性定义。基于这一定义，不但得到有关基数的大部分结论，而且有其自身的特殊性。     

On non-measurability of in its second dual

We show that with the weak topology is not an intersection of Borel sets in its Cech-Stone extension (and hence in any compactification). Assuming (CH), this implies that has no continuous injection onto a Borel set in a compact space, or onto a Lindelöf space. Under (CH), this answers a question of Arhangel'ski.

     

Connecting orbits among Denjoy minimal sets for monotone twist map

In a Birkhoff region of instability for an exact area-preserving twist map, we construct some orbits connecting distinct Denjoy minimal sets. These sets correspond to the local, instead of global minimum of the Lagrangian action. In the earlier work, Mather constructed connecting orbits among Aubry-Mather sets and the global minimizer of the Lagrangian action.     

Minimal rambling sets with codimension one dominated splittings

In this paper,we study the dynamics of minimal rambling sets with codimension one dominatedsplittings     

A level set approach for computing discontinuous solutions of Hamilton-Jacobi equations

We introduce two types of finite difference methods to compute the L-solution and the proper viscosity solution recently proposed by the second author for semi-discontinuous solutions to a class of Hamilton-Jacobi equations. By regarding the graph of the solution as the zero level curve of a continuous function in one dimension higher, we can treat the corresponding level set equation using the viscosity theory introduced by Crandall and Lions. However, we need to pay special attention both analytically and numerically to prevent the zero level curve from overturning so that it can be interpreted as the graph of a function. We demonstrate our Lax-Friedrichs type numerical methods for computing the L-solution using its original level set formulation. In addition, we couple our numerical methods with a singular diffusive term which is essential to computing solutions to a more general class of HJ equations that includes conservation laws. With this singular viscosity, our numerical methods do not require the divergence structure of equations and do apply to more general equations developing shocks other than conservation laws. These numerical methods are generalized to higher order accuracy using weighted ENO local Lax-Friedrichs methods as developed recently by Jiang and Peng. We verify that our numerical solutions approximate the proper viscosity solutions obtained by the second author in a recent Hokkaido University preprint. Finally, since the solution of scalar conservation law equations can be constructed using existing numerical techniques, we use it to verify that our numerical solution approximates the entropy solution.