问题就在于此：数字签名依赖于字节级的等价测试，但是可能有两个逻辑上相同但包含不同字节序列的XML文档。
Herein lies the problem: Digital signatures rely on byte-level equivalence, whereas it is possible to have two XML documents that are logically the same, but contain different byte sequences.
FD集中根据左部等价形成划分，划分的各子集根据左部的依赖关系形成一个有向图，有向图中每一个节点的FD可能是一个符合BCNF的子模式的FD，其关键字就是各子集的等价左部。
Digraph will be constructed by using the dependence of the left of subset's FD. Some nodes will help to decompose a subschema of BCNF. The key of the subschema is the left or left's equivalence.
本文以两个自变量的拟线性双曲型方程的古尔沙问题为例，应用反函数和积分不等式证明了等价积分方程组解的存在唯一性，同时给出了解的存在区域和已知参量的依赖关系。
In this paper, we show the domain of the existence of the solution on Goursat problem for quasi—linear hyperbolic equation and obtain the Theorem of the existence and uniqueness in above domain.
以二阶张量为损伤变量，推导了依赖于损伤变量的弹性模量表达式，利用一个等价状态，建立损伤岩体的本构关系。
Then the expression of damage-dependent elasticity tensor is deduced and the constitutive equations of damaged rock are built by using an equivalent state.
RSA的安全性依赖于大数的因子分解，但并没有从理论上证明破译rsa的难度与大数分解难度等价。
RSA 's security relies on the factorization of large Numbers, but not theoretically prove the difficulty of deciphering the RSA and the difficulty of large integer equivalent.
RSA的安全性依赖于大数的因子分解，但并没有从理论上证明破译rsa的难度与大数分解难度等价。
RSA 's security relies on the factorization of large Numbers, but not theoretically prove the difficulty of deciphering the RSA and the difficulty of large integer equivalent.
应用推荐