这更多的是文档的事实等价问题而非语义等价问题。
This is more an issue about actual equality between the documents, rather than semantic equality.
其它问题包括金标准的划分和对两个诊断试验等价的不适当的分析。
Other problems included dichotomization of the gold standard scale and inappropriate analysis of the equivalence of two diagnostic tests.
问题就在于此：数字签名依赖于字节级的等价测试，但是可能有两个逻辑上相同但包含不同字节序列的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.
在软件领域，一个难以对付的问题通常可以被一个等价的较易解决的问题代替。
In software, an intractable problem can usually be replaced by an equivalent one that's easy to solve.
在本文中，我研究了这个问题，并向您展示了处理这类比较的一些技术，以及大致地告诉您关于XML等价性问题。
In this article, I delve into the problem, show you some techniques for handling comparisons, and generally inform you about XML equivalency.
具有相同工作流的两个用例当然是等价的，但我还不知道我的问题是否属于这种情况。
Two use cases that turn out to have the same workflow are certainly equivalent, but I don't yet know whether that will be the case.
问题是交易麦迪看起来并不能带来等价的回报。
The problem with trading McGrady is the unlikelihood of getting equal value in return.
在什么条件下两个分歧问题关于某一等价群而言是等价的，这在分歧理论研究中是很有意义的。
An interesting problem in the study of bifurcation theory is to determine when two bifurcation problems are equivalent with respect to some group of equivalences.
确定两个集是否为双李卜希兹等价是一个复杂的问题。
The problem of determining whether two sets are bi Lipschitz equivalence is complicated.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
提出了基于路径无关语言的等价模式演化方案来解决这个问题。
This paper addresses the problem by providing equivalent schema evolution (ESE) mechanism based on path independence (PI) program.
该模型以极限状态设计方法为基础，采用机遇约束规划方法变换为一个等价确定性非线性规划问题。
This model is based on the limit state design philosophy. This paper adopts the chance constraint programming method and changes the model into an equal deterministic nonlinear design problem.
解决所有点对之间最快路问题的关键是产生有效解的等价集合。
The key idea to solve all-pairs quickest path problem is to generate an equivalent set of efficient solutions.
利用其等价的抛物拟变分不等式，得到了该问题古典解的存在唯一性。
We obtain the existence and uniqueness of the classical solution by its equivalent parabolic quasi variational inequality.
本文介绍隐变量上的箭头指向问题、模型的等价及检验的功效。
We introduce the direction of arrows on the latent variable, equivalent model and power of test.
在第二章中，引入了积分抽象时滞方程的概念，并且得到积分抽象时滞方程的适定性与相应的积分柯西问题适定性等价。
In the second chapter, the concept of an integrated abstract delay equation is introduced, and the equivalence of the well - posedness of an integrated delay eq.
实验结果表明，该算法与DBSCAN是等价的，能更有效地解决批量数据更新时的增量聚类问题。
Experimental results show this algorithm is equal to DBSCAN, and can solve the increment clustering problem when the batch data is updated effectively.
而第二种方法更精湛和实用，是把复数在数学上等价于物理问题的一种方法。
The second method is much more elegant and powerful, a way of making the complex Numbers mathematically equivalent to the physical problem.
该文论述了拓扑空间(组)的同伦等价变换在有序介质状态和缺陷的拓扑分类中的应用问题。
In this paper the application of homotopy equivalence transformation of topological space sets to the topological classification of states and defects in ordered media is discussed.
我们的方法是将简称生成问题转化为等价的序列标注问题，并利用一阶条件随机场建立自动生成模型。
In our method, we transformed the problem into an equivalent sequence tagging problem, and built up the automatic generation model through the first order conditional random field.
讨论了基于二叉判决图（BDD）的组合电路等价性检验方法，并分析了等价性检验过程中的误判问题及其消除方法；
The combinational equivalence checking methods based on binary decision diagram(BDD)are dis-cussed, the false negative problem during equivalence checking and its eliminating methods are analyzed.
围绕着产品质量展开的保质设计，首先要解决质量需求在各阶段的无误传递，即质量等价转换问题。
The principal problem is that quality needs are transferred correctly, i. e. quality conversion equally in design for quality.
采用线性矩阵不等式和多凸性处理方法，证明了该问题等价于线性矩阵不等式的可解性问题。
In terms of multiconvexity and linear matrix inequality, this problem is proved to be equivalent to an LMI feasible problem.
本文运用旋转变换法，经有限次变换后，将普通线性规划（LP）问题，化为一个等价的易于求解的连续背包问题。
A rotation transformation method is to be used in changing an ordinary linear programming (LP)problem into an equivalent easily-solved continuous knapsack one after a finite iteration.
首次将二次稳定性问题等价地转化为约束非线性规划问题。
The problem is firstly transformed into an equivalent constraint nonlinear programming problem.
针对非线性互补问题，提出了与其等价的非光滑方程的一个下降算法，并在一定条件下证明了该算法的全局收敛性。
This paper presents a new descend algorithm for nonlinear complementarity problems. The global convergence of the algorithm is proved under milder conditions.
基于对问题的分析，证明了这一问题等价于单机调度中极小化类似的延迟量函数。
Through the analysis of the problem, it is proved that the problem is equivalent to a single-machine scheduling for minimizing an analogous function of delay.
基于对问题的分析，证明了这一问题等价于单机调度中极小化类似的延迟量函数。
Through the analysis of the problem, it is proved that the problem is equivalent to a single-machine scheduling for minimizing an analogous function of delay.
应用推荐