A zero topological entropy map with recurrent points not

We show that there is a continuous map of the unit interval into itself of type which has a trajectory disjoint from the set of recurrent points of , but contained in the closure of . In particular, is not closed. A function of type , with nonclosed set of recurrent points, was found by H. Chu and J. Xiong [Proc. Amer. Math. Soc. 97 (1986), 361-366]. However, there is no trajectory contained in , since any point in is eventually mapped into . Moreover, our construction is simpler.

We use to show that there is a continuous map of the interval of type for which the set of recurrent points is not an set. This example disproves a conjecture of A. N. Sharkovsky et al., from 1989. We also provide another application of .

     

Graphs that are not complete pluripolar

Let be domains in . Under very mild conditions on we show that there exist holomorphic functions , defined on with the property that is nowhere extendible across , while the graph of over is not complete pluripolar in . This refutes a conjecture of Levenberg, Martin and Poletsky (1992).

     

A strong law of large numbers for generalized random sets from the viewpoint of empirical processes

In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.

     

Condensations of projective sets onto compacta

For a coanalytic-complete or -complete subspace of a Polish space we prove that there exists a continuous bijection of onto the Hilbert cube . This extends results of Pytkeev. As an application of our main theorem we give an answer to some questions of Arkhangelskii and Christensen.

Under the assumption of Projective Determinacy we also give some generalizations of these results to higher projective classes.

     

一类半线性反应对流扩散模型的特征差分方法和分析

1.引 言如下形式的半线性反应对流扩散方程组分别在生命科学、化学和环境科学中,有大量的应用模型[1-3].其中文献[2-6]分别讨论了方程组(1.1)的各种特殊模型的定性性质.文献[6]讨论了一类线性模型的流线扩散有限元分析.作者在文[7]中,分别利用标准有限元方法和交替方向有限元方法,对(1.1)的一些特殊情形作了数值分析.     

Speeding up the FMMR perfect sampling algorithm: A case study revisited

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

基于粗糙集理论的知识约简及应用实例

在保持分类能力不变的前提下 ,通过利用粗糙集理论中的知识约简方法 ,在保护知识库分类不变的条件下 ,删除其中不相关或不重要的知识 ,从而导出问题的决策 .利用基于决策表的粗糙集模型算法 ,实例分析如何数字化表示决策表 ,并对其进行属性约简和属性值的约简 ,从而提取决策规则 .     

带非局部源的退化半线性抛物型方程解的爆破

该文研究带Dirichlet边界条件的退化半线性抛物型方程:xqut-uxx=∫0af(u)dx,这里q>0.作者证明了局部解的存在唯一性并且得到当初值充分大时解在有限时刻爆破.进而,证明解的爆破点集是整个区间[0,a],这与具有局部源的方程解的性质不同.     

Polynomial-time approximation schemes for packing and piercing fat objects

We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem.     

用光电法测量刚体的转动惯量──对波纹法测量刚体转动惯量的改进

用Ｊ─ＬＤ２转动惯量测试仪的波纹法测试转动惯量的实验方法，测量精度差，操作不方便．利用实验室现有的仪器改进成光电法测试转动惯量的方法，简单易行，测量精度高，操作方使，实践效果良好．