复杂

At the end,the problems in DVC key techniques are summarized. video coding ; Wyner-Ziv theorem ; distributed source coding ; key frame ; side information

然而一些视频应用场合恰恰相反，它们需要低复杂度的编码器，在解码端可以具有较高复杂度的解码器，比如计算能力

The wavelet coefficient energy group of time-frequency surface has distinct difference for different swept extent.

储层的孔隙度和电阻率曲线间微差形态波形的复杂程度隐含着储层含油气性的信息，油层水淹程度不同，其时频平面上小波系数能量团存在着显著差异，随水淹程度加重，其能量团分布由复杂逐渐趋于简单单调。

At the basis of analysis of influencing factors of settlement and collapsibility of loessal foundation, it was subjected that the deformation should be thought of as a system that many factors worked and influenced together, specially a grey system.

本文通过讨论影响黄土压缩变形的因素、影响黄土湿陷性变形的因素，认为把地基变形看作是一个多因素作用的复杂系统来研究更为合理，并且可以把变形系统看成是一个灰色系统，把沉降变形系统看成是多因素的、关联的、整体的、复杂的灰色系统，从而用灰色关联分析法对变形系统进行因素分析。

This article presented a new fast algorithm of Moore-Penrose inverse for an m×n symmetric Loewner-type matrix with full column rank by forming a special block matrix and studied its inverse. Its computation complexity was O+O(n^2), but it was O(mn^2)+O(n^3) by using L(superscript +)=L(superscript TL^(-1)L.

论文通过构造特殊分块矩阵并研究其逆矩阵，给出了秩为n的m×n对称Loewner矩阵Moore-Penrose逆的快速算法，该算法的计算复杂度为O+O(n^2)，而通过L=L(上标 TL^(-1)L计算的复杂度为O(mn^2)+O(n^3)。

Then,a new fast algorithm of the minimal norm least squares solution for linear system whose coefficients is an m×n symmetric Loewner matrix with full column rank is given by forming a special block matrix and researching the triangular factorization of its inverse.

对于工程计算中常常遇到的一类线性方程组的求解，通过构造特殊分块矩阵并研究其逆矩阵的三角分解，给出了求秩为n的m×n阶对称Loewner矩阵为系数阵的线性方程组，及极小范数最小二乘解的快速算法，该算法的计算复杂度为O+O(n2)，而一般方法的计算复杂度为O(mn2)+O(n3)。

In this paper, for m× n Loewner-type matrix or symmetric Loewner-type matrix with full column rank, we form special block matrix firstly and research their triangular factorization or of its inverse, and then get the fast algorithm of the minimal norm least squaresolution .

本文对于秩为n的m×n阶Loewner型或对称Loewner型矩阵L，通过构造特殊分块矩阵并研究其逆的三角分解或自身三角分解，进而得到了线性方程组Lx=b的极小范数最小二乘解快速算法，计算复杂度为O+O(n~2)，而一般方法的计算复杂度为O(mn~2)+O(n~3)。

A new fast algorithm of the minimal norm least squares solution for the linear system whose coefficient matrix is an m×n Loewner-type matrix with full column rank is given by forming a special block matrix and researching its triangular factorization.

通过构造特殊分块矩阵及其三角分解给出了求秩为n的m×n阶Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法，该算法的计算复杂度为O+O(n2)，而一般方法的计算复杂度为O(mn2)+O(n3)。

We hold that different extents of complicated work are the general forms of labor, the commensuration coefficient between complicated labors should consider its status in reproduction and should be converted approximately according to its output in the next production cycle.

我们认为不同程度的复杂劳动是劳动的一般形态，复杂劳动之间的通约系数应该考虑它在再生产中的地位，按照它在下一生产周期生产的产量来进行近似折算。

Furthermore, the complexity between the relationships of synchronizability and network structural parameters are discussed via two simple graphs, and the effects of complementary graph, edge-addition and graph operation on the synchronization of complex networks are elaborated.

其次以两个简单图指出同步能力与网络结构参数的关系复杂，并给出补图与加边对同步研究的意义，然后给出图运算在复杂网络同步中的作用。

One is that we perform Delaunay triangulation instead of using a complete graph in the first step.

第一步骤不作完整图，因为其时间复杂度为O(n2)。本篇论文利用Delaunay triangulation当作一开始的连接图，其时间复杂度为O。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。