二分

A definition of modularity which is suitable for weighted bipartite graph was proposed, and a corresponding community detection algorithm was designed and implemented.

提出了适用于边带权重的二分图模块度定义，并设计了相应的二分图社团检测算法。

Based on the comparison of current fault propagation models, bipartite graph model is adopted as fault propagation model, of which the formal definition is given.

对现有的网络故障传播模型进行比较分析，采用二分图作为故障定位的故障传播模型，提出了二分图故障传播模型的形式化定义。

Take a deep insight into community detection algorithms that are applied to unipartite graph and bipartite graph. We especially analyzed a greedy community detection algorithm designed by Blondel and the definition of modularity proposed by Barber.

对单元图和二分图中的社团检测算法进行研究，并着重剖析了 Blondel 等人提出的一种针对网络模块度的贪婪优化算法以及 Barber 等人提出的适用于二分图的模块度定义。

Local codimension two bifurcation of maps,associated with Hopf-pitchfork case,is analyzed using the center manifold theorem and normal form method of maps.

应用映射的中心流形和范式方法，研究了映射在Hopf-pitchfork余维二分岔点附近的参数开折，揭示了含间隙振动系统在余维二分岔点附近的动力学行为。

The loca l bifurcation characteristic near by codimension two bifurcation point is discus sed,which testifies that the local dynamical behavior of map fmay be known under the condition of cod.

通过分析范式在余维二分岔点附近的局部分岔行为，可以了解映射f在余维二分岔条件下的局部动力学行

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

Presents an algorithm for generating the sum of disjoint products by using binary decision diagram as well as certain ordering role of paths and Boolean algebra formulas.

利用二分决策图，同时采用道路排序技巧及布尔代数运算给出了求不交和的方法，它比单纯采用二分决策图的算法更简单，不交和的项数更少，从而得到一个求网络可靠度的有效算法。

Under some conditions, we prove that random nonuniformly exponential dichotomy actually imply random uniformly exponential dichotomy. And, using the normal Lyapunov exponents, we also obtain a sufficient condition under which a random compact and invariant subset is a random forward attractor. This is a generalization of the results of Ashwin\'s.

在一定条件下，我们证明了随机非一致指数二分性蕴含着随机一致指数二分性，同时，利用法向Lyapunov指数，我们还给出了一个紧致的随机不(来源：A5cBc765C论文网www.abclunwen.com)变集能成为随机吸引子的一个充分性条件，推广并改进了Ashwin的一些结果。

Riffle division method: a riffle is a kind of non-mechanical sample divider, which is usually fed manually. The sample is divided into 2 equal parts by riffle, with one retained and one rejected.

二分器缩分法：二分器系非机械式样品缩分器，通常用手工给料，样品通过二分器被分成二等份，一份保留，另一份弃去。

Most of community detection algorithms are used in dealing with unipartite networks, and there are few algorithms designed for detecting communities in bipartite networks, and these algorithms have some weaknesses respectively. For example, the community detection algorithm proposed by Guimera can not utilize weight information of a bipartite network; the algorithm proposed by Barber can not deal with the complex mapping situation of communities in bipartite network.

目前社团检测算法大多用于处理单元网络，而专门用于处理二分网络的社团检测算法不多，而且这些算法都存在着各自的不足之处，如 Guimera 所提的二分图社团检测算法无法处理边含权重信息的二分网络； Barber 所提的社团检测算法无法处理二分网络中具有复杂社团对应关系的情况。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。