拓扑空间范畴,拓扑FUZZ范畴与拓扑分子格范略畴间的反射与余反射

从整体角度出发，证明拓扑空间范畴Ｔｏｐ分别是拓扑Ｆｕｚｚ范畴ＴｏｐＦｕｚｚ与拓扑分子格范畴ＴＭＬ的反射与余反射满子范畴，ＴｏｐＦｕｚｚｙ是ＴＭＬ的反射与余反射（非满）子范畴。     

拓扑分子格中的半正则半开元和正则半开元

本文引入并研究了拓扑分子格中的半正则半开（半正则半闭）元和正则半开（正则半闭）元的概念。在此基础上，引入了几乎不定（几乎不定开、几乎不定闭）、几乎半连续（几乎半开、几乎半闭）和几乎半不定（几乎半不定开、几乎半不定闭）序同态的概念，同时给出了它们的若干特征性质，以及它们同其它序同态之间的关系。     

半连续格上的半Scott拓扑与半Lawson拓扑

在完备格上引入了半Scott拓扑与半Lawson拓扑,讨论了半连续格和强连续格上半Scott拓扑与半Lawson拓扑的一些基本性质。     

半粘合拓扑空间与商半拓扑空间

作者在文［１］中给出了半粘合拓扑空间以及半粘合映射的定义，并得到了它们的基本性质。中文进一步研究了与半枯合拓扑空间和半粘合映射有关的问题。另外也讨论了商空间成为Ｓ_２－拓扑空间的条件．最后给出了一个半同胚定理。     

点式拟一致分子格中的拓扑

分子格Ｌ上的一个点式拟一致结构可以诱导出Ｌ上的一个拓扑和一个余拓扑（）。本文证明了下面结论：（１）在拓扑分子格（Ｌ，＊（））中，每个分子皆有一个由（）一开元组成的远域基；（２）在拓扑空间（Ｌ，（））（这里Ｌ是Ｆｕｚｚｙ格）中，每个分子皆有一个由（）一开元组成的＊远域基；（３）若（Ｌ，）是点式一致Ｆｕｚｚｙ格，则（）＝（）。     

模糊半开集和半分离性公理

本文改进了文[3]的模糊半开集定义，在本文定义的模糊半开集定义，不仅可以完全保留文[3]的结论，而且还能建立分明拓扑空间及其诱导拓扑空间关于半开集、半闭集等对应关系。此外，本文借助重域概念重新定义了半－R0，半－R1和半－T2空间，与[4]相比，本文定义的半分离性公理体系可以更自然地推广分明拓扑空间中的有关定理。     

LF拓扑空间之间投影映射是开映射的一个充要条件

王国俊先生曾提出这样一个问题：设｛（Ｌ＾Ｘ，δｔ）｝ｔ∈Ｔ是一族ＬＦ拓扑空间，（Ｌ＾Ｘ，δ）是其乘积空间，Ｐｔ：Ｌ＾Ｘ→Ｌ＾Ｘｔ（ｔ∈Ｔ）是投影映射，问Ｐｔ是开映射的充要条件是什么？本文在较广范围－形如（Ｌ＾Ｘ，η）的拓扑分子格－内讨论类似问题，给出了上述问题的一个解答。     

Double-Pullback Transitions and Coalgebraic Loose Semantics for Graph Transformation Systems

The classical algebraic approach to graph transformation is a mathematical theory based on categorical techniques with several interesting applications in computer science. In this paper, a new semantics of graph transformation systems (in the algebraic, double-pushout (DPO) approach) is proposed in order to make them suitable for the specification of concurrent and reactive systems. Classically, a graph transformation system comes with a fixed behavioral interpretation. Firstly, all transformation steps are intended to be completely specified by the rules of the system, that is, there is an implicit frame condition: it is assumed that there is a complete control about the evolution of the system. Hence, the interaction between the system and its (possibly unknown) environment, which is essential in a reactive system, cannot be modeled explicitly. Secondly, each sequence of transformation steps represents a legal computation of the system, and this makes it difficult to model systems with control. The first issue is addressed by providing graph transformation rules with a loose semantics, allowing for unspecified effects which are interpreted as activities of the environment. This is formalized by the notion of double-pullback transitions, which replace (and generalize) the well-known double-pushout diagrams by allowing for spontaneous changes in the context of a rule application. Two characterizations of double-pullback transitions are provided: the first one describes them in terms of extended direct DPO derivations, and the second one as incomplete views of parallel or amalgamated derivations. The issue of constraining the behavior of a system to transformation sequences satisfying certain properties is addressed instead by introducing a general notion of logic of behavioral constraints, which includes instances like start graphs, application and consistency conditions, and temporal logic constraints. The loose semantics of a system with restricted behavior is defined as a category of coalgebras over a suitable functor. Such category has a final object which includes all finite and infinite transition sequences satisfying the constraints.     

Density and Approximation Properties of Markov Systems

Borwein, Bojanov, Erdélyi, and others, have studieddensity and approximation properties of those Markov systems of differentiablefunctions on a closed interval [a,b], having the property thatthe system of derivatives is a Markov system on the open interval (a,b).In this paper we show that several of these results are valid for anyMarkov system of continuous functions on a closed interval.     

Rewriting Systems and Geometric Three-Manifolds

The fundamental groups of most (conjecturally, all) closed three-manifolds with uniform geometries have finite complete rewriting systems. The fundamental groups of a large class of amalgams of circle bundles also have finite complete rewriting systems. The general case remains open.     

Uniform Stability for Time-Varying Infinite-Dimensional Discrete Linear Systems

Stability for time-varying discrete linear systems in a Banachspace is investigated. On the one hand is established a fairlycomplete collection of necessary and sufficient conditions foruniform asymptotic equistability for input-free systems. Thisincludes uniform and strong power equistability, and uniformand strong l_p-equistability, among other technical conditionswhich also play an essential role in stability theory. On theother hand, it is shown that uniform asymptotic equistabilityfor input-free systems is equivalent to each of the followingconcepts of uniform stability for forced systems: l_p-input l_p-state,e_o-input e_o-state, bounded-input bounded-state, l_p-input bounded-state(with p>1), e_o-input bounded-state, and convergent-inputbounded-state; these are also equivalent to their nonuniformcounterparts. For time-varying convergent systems, the aboveis also equivalent to convergent-input convergent-state stability.The proofs presented here are all ‘lementary’ inthe sense that they are based essentially only on the Banach–Steinhaustheorem.     

Il'yashenko Theorem for Quadratic Systems

本文就二次系统,采用叶彦谦的分类,对下述（原由Ｉｌ＇ｙａｓｈｅｎｋｏ用复域方法给出证明的）定理,提供了一个初等证明：任一仅含双曲奇点的多边环不得结集无限个极限环．实际上我们是证明了Ｉｌ＇ｙａｓｈｅｎｋｏ的另一个所谓二边形定理,即解析系统任一二边环,不得结集无限个极限环．     

Some Properties of Aut$_∗(X)$ and the Subgroup Aut$_Σ(X)$

Let Aut$_∗(X)$ denote the group of homotopy classes of self-homotopy equivalences of $X$, which induce identity automorphisms of homology group. We describe a decomposition of Aut$_∗(X_1∨· · ·∨X_n)$ as a product of its simpler subgroups. We consider the subgroup Aut$_Σ(X)$ of all self homotopy classes α of $X$ such that $Σα = 1_{ΣX} : ΣX → ΣX$, and also give some properties of Aut$_Σ(X)$.     

EQUIVARIANT SELF EQUIVALENCES OF PRINCIPAL FIBRE BUNDLES

Let E be a compact Lie group, G a closed subgroup of E, and H a closed normal sub-group of G. For principal fibre bundle (E,p, E,/G;G) tmd (E/H,p‘,E/G;G/H), the relation between auta(E) (resp. autce (E)) and autG/H(E/H) (resp. autGe/H(E/H)) is investigated by using bundle map theory and transformation group theory. It will enable us to compute the group JG(E) (resp. SG(E)) while the group J G/u(E/H) is known.     

广义系统的特征结构配置

通过使用输出反馈配置闭环系统的特征值与特征向量,本文讨论了广义控制系统。