原子分子物理与材料科学的交叉及应用

本文主要论述了从原子分子的微观层次上认识材料的结构及性质 ,介绍了今后新型材料的研究发展方向 ,对新型材料的开发和使用具有一定的指导作用 .     

An elementary algorithm for reporting intersections of red/blue curve segments

Let E_r and E_b be two sets of x-monotone and non-intersecting curve segments, E=E_rE_b and |E|=n. We give a new sweep-line algorithm that reports the k intersecting pairs of segments of E. Our algorithm uses only three simple predicates that allow to decide if two segments intersect, if a point is left or right to another point, and if a point is above, below or on a segment. These three predicates seem to be the simplest predicates that lead to subquadratic algorithms. Our algorithm is almost optimal in this restricted model of computation. Its time complexity is O(nlogn+kloglogn) and it requires O(n) space.     

Expansions of ordered fields without definable gaps

In this paper we are concerned with definably, with or without parameters, (Dedekind) complete expansions of ordered fields, i. e. those with no definable gaps. We present several axiomatizations, like being definably connected, in each of the two cases. As a corollary, when parameters are allowed, expansions of ordered fields are o‐minimal if and only if all their definable subsets are finite disjoint unions of definably connected (definable) subsets. We pay attention to how simply (in terms of the quantifier complexity and/or usage of parameters) a definable gap in an expansion is so. Next we prove that over parametrically definably complete expansions of ordered fields, all one‐to‐one definable (with parameters) continuous functions are monotone and open. Moreover, in both parameter and parameter‐free cases again, definably complete expansions of ordered fields satisfy definable versions of the Heine‐Borel and Extreme Value theorems and also Bounded Intersection Property for definable families of closed bounded subsets.     

拓扑交性质与极大极小定理

本文得到一个一般的拓扑型有限交性质,并将所得结果应用于研究拓扑型极大极小定理     

关于多个子空间的交空间

关于多个子空间的交空间 ,到目前为止还没有一个行之有效的直接求法 .本文首先证明了关于分块矩阵的两个重要结果 ,由此得到了一个求多个子空间的交空间的直接方法——初等变换法 .     

Constructive complements of unions of two closed sets

It is well known that in Bishop‐style constructive mathematics, the closure of the union of two subsets of ? is ‘not’ the union of their closures. The dual situation, involving the complement of the closure of the union, is investigated constructively, using completeness of the ambient space in order to avoid any application of Markov's Principle. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

基于脏脸博弈模型的人车路口穿越行为研究

行人与车辆在穿越无信号路口时的行为冲突尤其具有危险性, 行人和机动车不仅具有运动特征, 更具有行为特征, 因此需要从社会学层面对人车路口穿越问题进行建模. 通过对无信号路口处人车干扰机理的深入剖析, 提出基于脏脸博弈模型研究人车“理性人”的行为特征以及交互行为背后的微观机理, 分析了人车穿越路口时共同知识的形成过程、人车双方优势策略的产生机理和人车脏脸博弈的动力学过程. 理论推导了人、车收益的数学期望和发生人车冲突的概率. 分析结果表明: 行人穿越的理论时间和机动车穿越的理论时间越接近, 人车越容易发生冲突. 同时, 进一步分析了不同车型、不同行人等待时间和个体认知能力异质性对人车冲突概率的影响.     

On the structure of 1-designs with at most two block intersection numbers

We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of blocks into other 1-designs. We discover an infinite family of 1-designs with at most two block intersection numbers that each have a unique unrefinable decomposition, and we give a polynomial-time algorithm to compute an unrefinable decomposition for each such design from the family. Combinatorial designs from this family include: finite projective planes of order n; SOMAs, and more generally, partial linear spaces of order (s, t) on (s + 1)² points; as well as affine designs, and more generally, strongly resolvable designs with no repeated blocks.