查询词典 weak completeness

In parent-children relationship, there are obvious difference resulted from varied completeness, environment, negative influence, involver, inspector of homework completeness.

五、 国小高年级学童完成家庭作业的完成度、环境、负面影响、参与者、检查者层面对於亲子互动关系有显著的差异。

It is shown by the analysis of its time complexity and completeness as well as the numerical experiment that the proposed algorithm can achieve the goal of completeness and rapid convergence.

对算法进行的时间复杂度和完备性分析以及数值实验表明，基于遗传算法的粗糙集属性约简算法具有完备、快速收敛等特点。

First, in the aspect of influence of knowledge transaction cost factors on the choice of knowledge transfer mechanisms,"task uncertainty","information completeness","information asymmetry", and "knowledge tacitness" had direct influence on knowledge buyers when they chose knowledge transfer mechanisms. While "trust","task uncertainty","information completeness","knowledge tacitness","knowledge asset specificity" had indirect influence on the choice of knowledge transfer mechanisms.

在知识交易成本因子对知识移转机制选择之影响方面，「任务不确定性」、「资讯完备性」、「资讯不对称性」与「知识内隐性」对组织内知识需求者知识移转机制选择有直接影响，而「信任」、「任务不确定性」、「资讯完备性」、「知识内隐性」与「知识资产特殊性」则是对知识移转机制选择有间接影响；2。

Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.

课程项目包含：有限状态机与正规语言，情境无关语言，Turing机，部分递回函数，Church理论，不可判定性，可简化性与完整性，时间复杂度与NP-完整性，或然率计算，与交互验证系统。译注：Turing machine 一般译作"图灵机"或"图林机"，本课程依据专有名词保留原则，一律译为Turing机。

Huang and Lin proposed the weak solution concept for Backward Stochastic Differential Equation This paper based on the predecessor's work , gives the weak solution concept for Backward Stochastic Differential Equation with continuous martingale,uses the Girsanov transformation, obtains its weak solution of the existence of a necessary and sufficient conditions, and on this basis obtains its weak solution of the existence of sufficient conditions,these sufficient conditions weakened the drifting coefficient which requested in the existence uniqueness of strong solution to satisfy the Lipschitz condition the request.

本文在前人研究的基础上，给出由连续鞅驱动的倒向随机微分方程弱解的概念，利用Girsanov变换，得到其弱解存在的存在的一个充分必要条件，并在此基础上得到了其弱解存在的一些充分条件，这些充分条件减弱了在强解的存在唯一性中要求的漂移系数满足Lipschitz条件的要求。

Attention to high titer cold agglutinin in infants with blood grouping and cross-matching the impact of high titer cold agglutinin with blood of the same type of sub-Suozhi mostly weak agglutination, agglutination disappeared after by the water bath to prove consistency of cross-matching of blood, it should be added do direct antiglobulin test or polybrene with micro-column method with blood or blood serum can be excluded may contain other irregular antibodies; subtypes with the same type of blood (including the weak antigens and antibodies with a weak blood) when irregularities for weak agglutination, but the 37℃ water bath does not disappear after the condensation to prove that cross-matching of blood mismatched for the blood transfusion taboo.

重视高效价冷凝集素对婴幼儿血型鉴定和交叉配血的影响，高效价冷凝集素所至同型配血不合多为弱凝集，经水浴后凝集消失，证明交叉配血相合，但应加做直接抗人球蛋白试验或凝聚胺配血或微柱法配血，可以排除血清中可能含有其他不规则抗体；亚型同型配血(包括弱抗原与弱抗体配血)不合时也为弱凝集，但37℃水浴后凝集不消失，证明交叉配血不相合，为输血禁忌。

On the basis of the conclusion above, the nonlinear weak controllable vectors can be obtained, which compose the second class of weak controllable matrix, by means of matrix transfermations of the first class of weak controllable matrix. Furthmore the second criterion of weak controllability, accessibility and strong accessibility, which is more standard, more succinct and more practical, is obtained. On the basis of the first criterion and the second criterion, several important problems about nonlinear controllability are discussed, which include 1 local controllability; 2 three classes of local controllable decomposition, separately by means of local coordinate changes in the neighborhood of a nonsingular point, a point on a singular surface or a designated point x〓 with a designated input u〓; 3 the character of controllability of the ith state variable x〓 in different controllable areas and their boundaries.

在第一判别定理和第二判别定理的基础上，我们分析了非线性系统受控性质中的几个重要问题，所得到的结论包括i得到了非线性系统在可平衡点附近的能控性判别定理；ii分别给出了非线性系统在非奇异点、s阶奇面以及在状态空间内给定的一点x〓和输入u〓上的三种状态分解形式以及相应的求解方法；利用系统的Ⅰ型弱能控矩阵与Ⅱ型弱能控矩阵秩相等的条件，得到了只用系统的前n个弱能控向量来判断系统的弱能控性的判别定理；iii通过引入系统状态分量的三类受控区域边界的定义及相应的求解方法，初步探讨了非线性系统各个状态分量在不同的受控区域及其边界上的受控性质。

After discussion of the relation of MR〓 and ALT, an algorithm proposed by Zhongping Qin and Huanguo Zhang, two conclusions are obtained: if a weak key can be successfully attacked by the method of reduced echelon matrix, it can also be successfully attacked by a linear R〓R〓 transformation; meanwhile, there exists such a weak key that can be successfully attacked by the algorithm MR〓 or linear R〓R〓 transformation, but this key can not be successfully attacked by the algorithm ALT. For a NFA, according to the number of solutions for the image equation of its R〓R〓 transformation, there exist two sufficient criteria about its weak invertibility and weak inverse.

通过比较MR〓与覃中平和张焕国提出的攻击FAPKC加密情形的算法ALT，证明了如下结果：凡用约化梯阵方法能攻击成功，用线性R〓R〓变换也能攻击成功；同时，存在着用算法MR〓或线性R〓R〓变换攻击成功的弱密钥，用算法ALT攻击失败。

In this scheme weak voltage area are determined by the network sensitivity index method; Considering the relation between low voltage level and voltage collapse, it is put forward that the voltage magnitude variation rate is taken as the observed information for the grouping of weak voltage buses and weak voltage grouping are given; Taking geographic factors into consideration, a fuzzy maximal tree is established to group the weak voltage buses. The method to measure the incomplete observability of buses and the flow chart of PMU configuration are given.

应用网损灵敏度法来判断电压崩溃临界点和电压薄弱区域；考虑低电压水平与电压崩溃的关系，提出将电压幅值变化率作为电压薄弱母线分群所观察的信息，并且给出了电压薄弱分群指标，兼顾地域因素，采用模糊最大树聚类法将电压薄弱母线分群；给出了母线非完全可观测程度的度量方法以及 PMU 的配置流程。

Finally, the condition examining and schema decomposition algorithm are given.Fourthly, The definitions of elementary merge dependency set and minimum elementary merge dependency set are put forward. The weak leftside conflict and weak rightside conflict in the minimum elementary merge dependency set are defined. The conclusion that when the minimum elementary merge dependency set has weak left side conflicts or weak right side conflict is reached, The decomposition meeting PEK isα-cyclic is given. The algorithms of calculating the minimum elementary merge dependency set and examining the conflicts are given.

给出了条件的判定算法和数据库模式的分解算法。4、提出初等归并依赖集和初等最小归并依赖集的概念，定义初等最小规并依赖集的弱左部冲突和弱右部冲突，讨论了初等最小归并依赖集下的冲突问题，给出了在FD集F其初等最小归并依赖集D中存在弱左，右部冲突时模式分解为满足PEK为有α环的结论，并给出了初等最小归并依赖集的求解方法，冲突的判定算法。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。