证明

There is plenty of anecdotal evidence for this, just as there is for similar claims about mobile phones.

大量的轶事证明了这一点，就像对手机的类似说法提供的证明。

Experiments using the down-scaled vehicle prove that the static direct yaw moment control significantly reduces the side slip angle at the center of the gravity Also the experiment results indirectly show that the 2 degree of freedom vehicle model is rather accurate.

仿真实验表明集成控制系统可以使汽车在各种运行情况下质心处侧偏角很小的同时，有效跟踪理想横摆角速度响应。模型小车实验也证明静态横摆力矩控制可有效减小质心处的侧偏角，并间接证明二自由度汽车模型准确性。

We need your Certificate of Income to show your income per annum.

我们需要你的收入证明来证明你每年的收入。

Then, a self-certified anonymous proxy signature scheme based on the view of self-certified public key policy and the scheme of anonymous proxy signature are proposed. The proposed scheme not only lightens the burden of verifier, but also has characteristics such as anonymousness and trackability.

然后，结合自证明公钥体制和匿名代理签名，设计出一种自证明匿名代理签名方案，此方案不仅能减轻验证者的负担，还具有匿名性和可跟踪性的特点。

Another approach is to prove connections with alternate formal semantics independently developed, such as the axiomatic semantics that underline tools for deductive verification of programs (see Appel and Blazy2 for an example).

另外一种方式是证明与其他独立开发的、诸如程序证明推导工具所基于的公理语义（如Appel and Blazy[2]）等形式语义的关系。

B rule, the prosecution of appellee omission cases, the burden of proof to prove that the appellant should apply for the fact that, in the second instance court, the appellant Lin-ching has admitted its failure to appellee submitted proof of qualification conditions .

二项之规定，在起诉被上诉人不作为的案件中，上诉人应举证证明其提出申请的事实，在二审庭中，上诉人林凤清亦承认其未向被上诉人提交过资质条件证明。

It is proved that if'sparse NP complete sets under polynomial-time Turing reductions exist'then 'SAT is polynomial-time non-adaptively search reducible to decision', and that if 'P is not equal to NP'then either'SAT is not polynomial-time non-adaptively search reducible to decision'or'SAT is not polynomial-time truth-table reducible to bounded approximable sets', and that if'P is not equal to NP'then'sparse complete sets for NP under polynomial-time disjunctive reductions do not exist'.

因为用现有的证明技术不可能绝对地解决这个假设，本文研究了这个假设与其他关于SAT结构性质的假设之间的关系，证明了如果'NP有多项式时间图灵归约下的稀疏完全集'则'SAT是多项式时间并行地搜索归约为判定'，以及如果假设'P不等于NP'，则要么'SAT不是多项式时间并行地搜索归约为判定'，要么'SAT不能用多项式时间真值表归约归约为有界可近似集'。

By the best approximation theory, it is first proved that the SISO (single-input single-output) linear Takagi-Sugeno fuzzy systems can approximate an arbitrary polynomial which, according to Weierstrass approximation theorem, can uniformly approximate any continuous functions on the compact domain.

借助于最优逼近理论，证明了线性SISO TS模糊系统可以逼近任意一个多项式，然后以Weierstrass逼近定理为桥梁，证明了该模糊系统可以以任意精度逼近一个任意的连续函数，从而得到了该模糊系统万能逼近性的一个新的充分条件。

The analytical properties of arithmetic coding are investigated, which include the nested intervals property of arithmetic coding, the convergence of arithmetic coding, the concepts of an arithmetic code number and of arithmetic code mapping.

这些分析性质丰富了算术编码的理论，在本文一些重要结论的证明中得到了应用，并简化了证明。

Then, followed the analysis of the asympototic properties of maximum likelihood estimation for the seasonal ARFIMA models, the consistency, efficiency and asymptotic normality of the Bayesian estimator are proved.

参照季节性ARFIMA模型的极大似然估计的渐近性质的证明思路，证明了模型参数的贝叶斯估计具有相合性、有效性和渐近正态性。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。