查询词典 graph

The study includes the fuzzy independent set, fuzzy bases, fuzzy circuits, fuzzy rank, fuzzy hyperplanes, fuzzy closure operator, fuzzy submatroid, quasi-fuzzy graph matroids, fuzzy graphic matroids, fuzzy dual matroid and so on.

研究的内容包括模糊拟阵的独立集，模糊基，模糊圈，模糊秩函数，模糊超平面，模糊闭包算子，模糊子拟阵，准模糊图拟阵，模糊图拟阵，模糊拟阵的对偶和模糊拟阵的运算等等。

The study includes fuzzy bases, fuzzy circuits, fuzzy rank function, fuzzy hyperplanes, fuzzy closure operator, fuzzy submatrods, quasi-fuzzy graph matroid, fuzzy graphic matroids, fuzzy dual matroid and so on.

研究的内容包括模糊拟阵的模糊基，模糊圈，模糊秩函数，模糊超平面，模糊闭包算子，模糊子拟阵，准模糊图拟阵，模糊图拟阵，模糊拟阵的对偶等等。

According to the system view ofdegradation and decomposition put forward above,the paper proposes a newSplit Reasoning Simulation for qualitative model algorithm called SRSQM,which implements the decomposing,reasoning and solving of qualitative models.In another word,it combines variable cluster and causality graph to decompose acomplex qualitative model into many componentsand constraintsamong those components.Through the qualitative reasoning of the componentsand globally propagating the results,the overall solutions can be achieved.

根据复杂系统的递阶分解的系统观点，本文提出一种新的定性模型分解推理仿真算法，称作SRSQM，实现对定性模型的分解推理求解，即对于一个复杂的定性决策模型，应用变量聚类和因果图相结合的方法，将复杂的定性模型分解成若干个单元及其单元之间的约束，通过对各个单元的定性推理以及将单元推理的结果进行全局传播和过滤，得到整个系统的全局解。

In 1981, Cockayne proved that the calculation of the domination number on arbitrary graph was a NP-hard problem.

图的支配问题是近年来图论中一个比较活跃的研究领域，有很多实际的应用。1981年Cockayne等人证明计算任意图的支配数是一个NP困难问题。

One of the most common ways to describe a wood's tonal properties is in terms of its frequency range,which is often broken down into low-end frequencies,mid-range and high-end frequencies.picture it as a visual spectrum,as we've done in the chart to the right,with the lower frequencies on the left and the higher frequen-cies on the right.the graph line for each wood visually depicts its general tonal range.rosewood and ovang kol,for example,tend to resonate with more low-end frequencies,whereas koa,cocobolo and maple tend to sound brighter from having more top-end frequencies.note also rosewood's"scooped"midrange and ovang-kol's fuller midrange.the doted lines for walnut and koa denote the expansion of low-end frequency range as the guitar opens up after a period of playing it.

最常见的方式描述了木材的声音特性是在其频率范围内，这往往是细分为低端频率，中端和高端frequencies.picture它作为一个视觉频谱，因为我们'维生素E这样做的图表，以权，以较低的频率在左边和更高的频率，种上right.the图线的每一个木材视觉描绘的一般音调range.rosewood和ovang科尔举例来说，往往会产生共鸣更多的低端频率，而兴亚， cocobolo和枫树往往从健全光明有更多的高端frequencies.note也花梨木的"收购"的中端和ovang -科尔的充分midrange.the doted线的核桃和兴亚指扩大低端频率范围内的吉他开辟了一段时间后，打它。

The just codeword and performance of the decision threshold is proposed through the changing trend by contrasting the theoretical value to the true value in the graph, and it is helpful to the practical engineering.

本文还在理论研究的基础上对仿真数据结果进行了必要的分析，通过图表对比理论值和实际值的整体变化趋势，得出了具体码字在具体判决门限性能，能够给实际工程带来帮助。

Some basic properties of σ- LFSR over F4 are studied, such as nonlinearity, cycle structure distribution of state graph, the largest period and counting problem related. The conclusions are as follows:The coefficient ring of σ-LFSR is isomorphic to the matrix ring over F,. The cycle structure of σ- LFSR is consistent with that of the determinant of the corresponding polynomial matrix if and only if the feedback polynomial of - LFSR does not contain nontrivial factor over F2,. The counting formula of the number of σ- LFSR with inconsistent cycle structure is also showed in that part. The period of σ-LFSR with degree n is maximum if and only if the determinant of the corresponding polynomial matrix is the primitive polynomial with order 2n over F2,.

本文研究了有限域F_4上的σ-LFSR的一些基本性质，如非奇异性、状态图的圈结构的分布、最大圈的充要条件及相关的计数问题等，得到以下结论：σ-LFSR的系数环同构于F_2上的矩阵环；σ-LFSR的状态图的圈结构与对应的多项式矩阵的行列式的圈结构一致的充要条件为σ-LFSR的反馈多项式不含有非平凡的F_2上的因式，给出了圈结构不一致的σ-LFSR的计数公式； n次σ-LFSR周期达到最大，当且仅当对应多项式矩阵的行列式为F_2上的2n次本原多项式。

In particular, Neumaier asserted that the collinearity graph of a unique 3/2-design if it meets some constraints over its parameters.

Neumaier在1976年的论文提到，若强正则重边图的参数满足某些条件，这个强正则重边图就会是唯一的3/2-设计的共线性图。

Time comes to Zhou Yi in an instant (on June 30), I send color scheme to give opposite party with respect to online preparation early in the morning, result when much at 10 o'clock ability sees the line on the other side (I urge if it were not for he still does not know he is in be absent, the working hours that their government says was at 9 o'clock 17: 30), I send a graph to give opposite party, waited as a result very long, because he says to want to be touched with the technology, half hour went, I wait not as good as occupied still, do I say to still do not have a result, I should go out immediately, quickly reply.

时间转眼来到了周一(6月30日)，我一早就上网预备发风格图给对方，结果等到了10点多才见对方上线(要不是我催他还不知道他在不在呢，他们官方说的工作时间是9点17：30)，我发图给对方，结果等了好长时间，因为他说要跟技术碰一下，半个小时过去了，我等不及了还有事，我说还没有结果吗，我马上要出去了，快点回话啊。

A graph is said to be equitably -colorable if the vertices of is colored with colors such that there are no two adjacent vertices of the same color and the size of the color classes differ by at most one.

如果图上的点可以用个颜色来著色使得相邻的点著不同的颜色且颜色类的大小差最多是1，我们就说这个图是可均匀著色。

She gently rebuff ed him, but agreed that they could be friends

她婉言拒绝了，但同意作为朋友相处。

If in the penal farm, you were sure to be criticized.

要是在劳改农场，你等着挨绳子吧！