模糊度量空间的强嵌入北大核心CSCD

本文定义了George和Veeramani意义下的模糊度量空间的强嵌入,证明了可强嵌入的模糊度量空间能够粗嵌入到Hilbert空间.另外还证明了强嵌入在模糊度量空间的粗范畴下是不变的,并给出了模糊度量空间强嵌入的一些等价刻画.     

S1上一类自映射的迭代根

本文给出了圆周上dege(f)=0的分段严格单调的连续映射f存在任意阶迭代根的充分必要条件,得出了f存在任意阶迭代根等价于可以嵌入一个拟半流的结论.     

S~1上一类自映射的迭代根(英文)

本文给出了圆周上dege(f)=0的分段严格单调的连续映射f存在任意阶迭代根的充分必要条件,得出了f存在任意阶迭代根等价于可以嵌入一个拟半流的结论.     

关于图的定向4—边形嵌入

本文中考虑的图均是连通的．没有重边和环的图称为简单的．若Ｘ为一个图Ｇ的边子集,记号 Ｇ＼表示 Ｇ中去掉 Ｘ中的所有边后所得到的图．有关图的基本术语和记号均同［１］．Ｐｉｓａｎｋｉ在［２］中研究正则偶图的定向４－边形嵌入．所谓一个图Ｇ的定向４－边形嵌入是指Ｇ到某定向曲面Ｓ的一个２－胞腔嵌入使得Ｇ在Ｓ上的每个面的边界是Ｇ中一个长为４的圈（这里,Ｇ中的圈是Ｇ的一条点不交的闭迹）．若Ｇ为简单偶图,因Ｇ中不含长为１,２和３的圈,由Ｅｕｌｅｒ公式确定Ｇ有定向４－边形嵌入等价确定了Ｇ的最小亏格嵌入．关于这类问题…     

区域的对数导数单叶性内径

在万有Teichmller空间的对数导数嵌入模型T1(△)中,我们证明了存在无穷多个点[h]∈LT1(△),h(△)相互不Mbius等价,它们到边界的距离均为1,而在万有Teichmller空间的Schwarz导数嵌入模型T(△)中,只有一个点Sid具有类似性质.论文还得到了万有Teichmller空间两类嵌入模型的测地线的一些新的性质.     

Соболев空间中函数的有限元逼近以及在近似求解微分方程中的应用

用插值节点的均匀性,在空间中函数具有嵌入性质的条件下,导出了最佳逼近的误差估计,本文仍利用插值节点均匀性假设,对空间中的一般函数,也导出了逼近的误差估计,不再要求函数的嵌入性质; Ciarlet在仿射等价和空间函数具有嵌入性质的条件下,对一个二阶椭圆边值问题论证数值积分并不影响有限元子空间近似解逼近变分问题真解的速度。本文借助於空间中的一般函数的有限元逼近理论,对这一特殊的二阶椭圆边值问题,在基函数满足均匀性条件下,不要嵌入性质同样得到上面结果。     

CTH算法,嵌入马氏链和RG-分解

本文是一篇关于GTH算法的综述.GTH算法是一种稳定的数值算法,常被用于计算马氏链的平稳概率.GTH算法是高斯消元法的一种重排,因此它们在数学上具有等价的意义.GTH算法的所有步骤都可以用嵌入的概念来进行概率解释,并且算法的每一次消元都会产生一个嵌入马氏链.在这种情况下,RG-分解与高斯消元法中的LU-分解相对应.此外,在处理一个由无限多个线性方程组成的系统时,嵌入马氏链能被视为GTH算法的一种扩展,同时,它在被用于近似估算原始马氏链时,会产生在l1范数意义下的最小误差.     

空竭服务多级适应性休假GeomX/G(Geom/G)/1可修排队系统分析

本文先将空竭服务多级适应性休假Geom^x／G(Geom／G)／1可修排队系统转化为一个等价的Geom^x／G／1排队系统，再利用嵌入马尔可夫链方法，得到了稳态状态下顾客离去时刻系统队长的母函数。此外，对系统的一个忙循环进行分析，使用Wald定理和离散时间更新报酬定理得到系统的稳态可用度。     

乘法半群为左正规纯正群的半环

研究了加法半群为半格,乘法半群为左正规纯正群的半环．证明了此类半环（S,＋,．）可以嵌入到半格（S,＋）的自同态半环中．构造S的一个特定的偏序关系,得到了（S,·）上的自然偏序与所构造偏序相等的等价条件．     

一类半马氏过程的常返性与正常返性

对于逗留时为正整数值的半马氏过程程｛ξ（ｔ）｝,本文研究了｛ξ（ｔ）｝、相应过程｛ξ（ｎ）｝、嵌入链｛ξ_ｎ｝的常返性和正常返性之间的关系．定理 ２．１证明了三过程的状态常返性是等价的．定理 ２．２证明了ξ（ｔ）、ξ（ｎ）的状态正常返性是等价的,ξ（ｔ）的状态正常返是嵌入链状态正常返的充分条件．定理２．３给出了ξ（ｎ）的状态正常返的充分条件．该条件在状态空间有限时也是必要条件．     

输入存贮线性有限自动机的弱可逆性

应用输入存贮线性有限自动机的结构矩阵讨论了输入存贮线性有限自动机的弱可逆性,得出输入存贮线性有限自动机延迟0步弱可逆的充要条件、延迟τ步弱可逆和严格延迟τ步弱可逆的充分条件,由此条件得出延迟τ步弱可逆和严格延迟τ步弱可逆的输入存贮线性有限自动机的构造方法并且求出延迟0步弱可逆输入存贮线性有限自动机的一个弱逆.     

输入存贮线性有限自动机的极小化

由输入存贮线性有限自动机的线性系数组成的矩阵得出输入存贮线性有限自动机极小的等价定理,由此定理得出输入存贮线性有限自动机的极小化方法.     

Self-injective rings and linear (weak) inverses of linear finite automata over rings

LetR be a finite commutative ring with identity and τ be a nonnegative integer. In studying linear finite automata, one of the basic problems is how to characterize the class of rings which have the property that every (weakly) invertible linear finite automaton ℳ with delay τ over R has a linear finite automaton ℳ′ over R which is a (weak) inverse with delay τ of ℳ. The rings and linear finite automata are studied by means of modules and it is proved that *-rings are equivalent to self-injective rings, and the unsolved problem (for τ=0) is solved. Moreover, a further problem of how to characterize the class of rings which have the property that every invertible with delay τ linear finite automaton ℳ overR has a linear finite automaton ℳ′ over R which is an inverse with delay τ′ for some τ′⩾τ is studied and solved. Project supported by the National Natural Science Foundation of China(Grant No. 69773015).     

Fuzzy正则表达式与Fuzzy有限态自动机的关系

首先给出了Fuzzy正则表达式的定义,接着通过研究Fuzzy正则表达式与Fuzzy有限态自动机的关系,得到了两个重要性质,即：每一个Fuzzy正则表达式,都有一个非确定性的Fuzzy有限态自动机接受其代表的语言;每一个被确定性的Fuzzy有限态自动机接受的语言,都能被一个Fuzzy正则表达式表示．     

Impact of memory size on graph exploration capability

A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) influence its exploration capability? In particular, does every increase of the memory size enable an agent to explore more graphs? We give a partial answer to this problem by showing that a strict gain of the exploration power can be obtained by a polynomial increase of the number of states. We also show that, for automata with few states, the increase of memory by even one state results in the capability of exploring more graphs.     

Advances in the study of elementary cellular automata regular language complexity

Cellular automata (CA) are discrete dynamical systems that, out of the fully local action of its state transition rule, are capable of generating a multitude of global patterns, from the trivial to the arbitrarily complex ones. The set of global configurations that can be obtained by iterating a one‐dimensional cellular automaton for a finite number of times can always be described by a regular language. The size of the minimum finite automaton corresponding to such a language at a given time step provides a complexity measure of the underlying rule. Here, we study the time evolution of elementary CA, in terms of such a regular language complexity. We review and expand the original results on the topic, describe an alternative method for generating the subsequent finite automata in time, and provide a method to analyze and detect patterns in the complexity growth of the rules. © 2015 Wiley Periodicals, Inc. Complexity 21: 267–279, 2016     

The graph structure of a deterministic automaton chosen at random

An n‐state deterministic finite automaton over a k‐letter alphabet can be seen as a digraph with n vertices which all have k labeled out‐arcs. Grusho (Publ Math Inst Hungarian Acad Sci 5 (1960), 17–61). proved that whp in a random k‐out digraph there is a strongly connected component of linear size, i.e., a giant, and derived a central limit theorem. We show that whp the part outside the giant contains at most a few short cycles and mostly consists of tree‐like structures, and present a new proof of Grusho's theorem. Among other things, we pinpoint the phase transition for strong connectivity. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 428–458, 2017     

Markov跳变系统滚动时域有限记忆控制

针对离散时间Markov跳变系统,提出滚动时域有限记忆控制的方法.在一段有限滤波时域上,利用系统输入与输出变量的线性组合构造一段有限控制时域上的输出反馈控制器.首先,不考虑跳变系统均方可镇定,基于最优控制的方法,获得以迭代计算形式给出的控制器,并使其在无偏条件下能优化二次型性能指标.其次,进一步考虑在成本衰减条件下确定终端加权矩阵,并以它作为边界条件计算得到最优控制律,调节系统均方稳定.为便于求解,成本衰减条件以线性矩阵不等式的形式给出.仿真实例验证了所提方法的可行性和有效性.     

Amenability and Linear Cellular Automata Over Semisimple Modules of Finite Length

Let M be a semisimple left module of finite length over a ring R and let G be an amenable group. We show that an R-linear cellular automaton τ:M^G → M^G is surjective if and only if it is pre-injective.     

A Finite Field Framework for Modeling,Analysis and Control of Finite State Automata

In this paper, we address the modeling, analysis and control of finite state automata, which represent a standard class of discrete event systems. As opposed to graph theoretical methods, we consider an algebraic framework that resides on the finite field <formula form="inline">${\Op F}_2$</formula> which is defined on a set of two elements with the operations addition and multiplication, both carried out modulo 2. The key characteristic of the model is its functional completeness in the sense that it is capable of describing most of the finite state automata in use, including non-deterministic and partially defined automata. Starting from a graphical representation of an automaton and applying techniques from Boolean algebra, we derive the transition relation of our finite field model. For cases in which the transition relation is linear, we develop means for treating the main issues in the analysis of the cyclic behavior of automata. This involves the computation of the elementary divisor polynomials of the system dynamics, and the periods of these polynomials, which are shown to completely determine the cyclic structure of the state space of the underlying linear system. Dealing with non-autonomous linear systems with inputs, we use the notion of feedback in order to specify a desired cyclic behavior of the automaton in the closed loop. The computation of an appropriate state feedback is achieved by introducing an image domain and adopting the well-established polynomial matrix method to linear discrete systems over the finite field <formula form="inline">${\Op F}_2$</formula>. Examples illustrate the main steps of our method.