有界链

Following the definition of graph topology and network routing, a bounded neighbor discovery algorithm is proposed, and the upper bound on trips of any loop crossing one specified links is proved. A path generation algorithm based on the neighbor/path matrix is also presented and validated by some examples.

文中首先给出网络和路由的定义和表示；再提出基于有界扩散的邻接发现算法，并证明某一回路穿越特定链路次数的上界；然后提出基于邻接矩阵的路径生成算法，并给出实例分析以验证上述算法的正确性。

With a suitable performance function and an initial control that made the closed system bounded, a serial of controls that made the performances better could be obtained by policy iteration, and ergodic Markov chains were constructed by the state serial with the corresponding feedback control.

在合适的性能指标并能找到一个使系统性能有界的控制的前提下，通过策略迭代可以求出逐步改善系统性能的控制序列，同时得到状态序列在相应反馈控制作用下构成遍历的马尔可夫链。

Concerning this problem, we put forward a kind of Stochastic Colored Petri Net, analyzed the limitary and reachable, and proved that SCPN is same as a continuous time Markov chain.

分析了它的有界性和可达性，证明了它同构于一个一维连续时间的马尔可夫链；同时，也分析了随机着色Petri网用于建模和系统性能定量分析的方法。

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。