证明是

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不能用多项式时间真值表归约归约为有界可近似集'。

It is proved that, when the value of critical threshold less than 1, the disease free equilibrium point is globally asymptotically stable. Further more, Bursaphelenchtis Xylophilus is used to construct the Lyapunov function, and the stability theory of Lyapunov function is used to prove that the equilibrium point is Global asymptotic stable. It explains that the Bursaphelenchus Xylophilus wiil eventually disappear.

证明了当临界阈值小于1时，无病平衡点是局部渐近稳定的，进一步利用巴尔巴欣公式构造Lyapunov函数，运用Lyapunov稳定性理论证明了该平衡点的全局渐近稳定性，说明松材线虫病会最终消失；当临界阈值大于1时，病虫害平衡点是局部渐近稳定的。

In this paper, firstly, the embeddability of near-triangular graphs on the orientable surface is studied. By using Petersen's Theorem about 1-factor, we first prove that for a near-triangulation on the orientable surface, its geometry dual graph has a 1-factor; then after a procedure of operation leaded by the 1-factor, we show that if a graph G triangulates some orientable surface S_g, then G has a near-triangular embedding in S_h for h = g,g + 1,...,β(G/2」, where β is the Betti number of G. Hence we obtain a conclusion: A near-triangulation of the orientable surface is upper-embeddable. As a generalization, a class of near-quadrangulation is studied, and similar results are obtained.

本文首先研究了近三角剖分图的可定向曲面嵌入性质，通过运用Petersen关于1-因子的定理，首先证明了对于可定向曲面上的三角剖分图，其几何对偶图具有1-因子；然后在1-因子的导向下，通过做一系列增加亏格的手术，证明了如果一个图G三角剖分可定向曲面S_g，那么G可以近三角剖分可定向曲面S_h，这里h=g，g+1，…，「β(G／2」，β是指图G的Betti数，从而得出推论：可定向曲面上的三角剖分图是上可嵌入的，作为推广，又研究了一类近四角剖分图的可定向曲面嵌入性质，并得到类似的结论。

Ball and Rose Routine: A white rose is plucked from it抯 stem and turns into a white billiard ball, which vanishes and is reproduced as a silk scarf is waved in front of it. There are several more vanishes and reappearances, then the ball changes color. The new red ball now becomes white then red and continues to change several more times.

如果你还没有遇到过有人能控制你的心灵时候，你将会觉得这是不可思议的，现在Derren Brown将会现你证明这个超能力，控制你的想法，这里，他将会在第四频道的一个小节目中证明如何让你压抑住的兴趣表现出来，你放心，这不纯在手法上的问题，因为那是很难在那么多的观中注视中不出现麻烦的。

For the Riemann boundary value problems for the first order elliptic systems , we translates them to equivalent singular integral equations and proves the existence of the solution to the discussed problems under some assumptions by means of generalized analytic function theory , singular integral equation theory , contract principle or generaliezed contract principle ; For the Riemann-Hilbert boundary value problems for the first order elliptic systems , we proves the problems solvable under some assumptions by means of generalized analytic function theory , Cauchy integral formula , function theoretic approaches and fixed point theorem ; the boundary element method for the Riemann-Hilbert boundary value problems for the generalized analytic function , we obtains the boundary integral equations by means of the generalized Cauchy integral formula of the generalized analytic function , introducing Cauchy principal value integration , dispersing the boundary of the area , and we obtains the solution to the problems using the boundary conditions .

对于一阶椭圆型方程组的Riemann边值问题，是通过把它们转化为与原问题等价的奇异积分方程，利用广义解析函数理论、奇异积分方程理论、压缩原理或广义压缩原理，证明在某些假设条件下所讨论问题的解的存在性；对于一阶椭圆型方程组的Riemann-Hilbert边值问题，利用广义解析函数理论、Cauchy积分公式、函数论方法和不动点原理，证明在某些假设条件下所讨论问题的可解性；广义解析函数的Riemann-Hilbert边值问题的边界元方法是利用广义解析函数的广义Cauchy积分公式，引入Cauchy主值积分，通过对区域边界的离散化，得到边界积分方程，再利用边界条件得到问题的解。

It proves that others are sb that you take some things out, it proves that oneself is not sb to come too

你拿出点东西来证明别人是sb，同样来证明自己不是sb。

At the same time, some properties of rough Set in quotient ring are given and proved. The fifth chapter is Rough Primary Ideals and Rough Fuzzy Primary Ideals in Semigroups, the concept of rough primary ideals and fuzzy rough primary ideals in semigroups are introduced. Under the condition of the complete congruence relation, a rough set of a primary ideal in semigroups is proved to be its primary ideal.

同时，在商环中讨论了粗糙集的一些性质，并给出这些结论的严格证明；第五章是半群中的粗准素理想和粗模糊准素理想，首次提出了半群中的粗准素理想与粗模糊准素理想的概念，证明了在完备同余关系下，半群中准素理想的粗糙集是准素理想。

In this case, legitimation is the process by which a'legislator'dealing with scientific discourse is authorized to prescribe the stated conditions （in general, conditions of internal consistency and experimental verification）determining whether a statement is to be included in that discourse for consideration by the scientific community.

换这之，内部一致性和经验实证是一个科学述句必备的两种性质，这也是"（in general， conditions of internal consistency and experimental verification）"的原义，但罗译译之「这些条件必须内在协调一致，并经实验证明」，（p.171），即将意思扭曲为：「述句必须符合才能成为科学述句的条件，必须有内在一致性和经实验证明。

In chapter 5,we persue the ctiticality and complexity of thecritical sets.We describe carefully the Whitney's example in 1935.Meantime,we introduce some rsults about the critical sets and thecritical value sets,in particular,on W-sets and C-sets.And usingthe Lebesgue density theorem and the Vitali covering lemma weprove a rank zero theorem with Hausdorff measures.Finally wegive some examples to prove our results are sharp in the sense thatthe numbers k,m,n,s,〓,etc.,in the hypothesescan not be improved.

第五章研究临界点集的临界性和复杂性，并详细地描绘了Whit-ney在1935年的例子，同时也介绍了关于临界点集和临界值集的一些结果，尤其是W-集和C-集的一些结果，并利用Lebesgue密度定理和Vitali覆盖引理证明了一个与Hausdorff测度相关的秩零定理，最后举例证明我们的结果在定理的假设中的那些数字如k，m，n，s，a，r+/等不能被改进的情况下是最佳的。

In section one, we introduce some background of the topic, in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic- the algebraic structure of the plus cupping Turing degrees, in section three, we outline the basic principles of the priority tree argument, one of the main frameworks and tools of theorem proving in computability theory, and in section four, we prove a new result concerning the algebraic structure of the plus cupping Turing degrees that there exist two computably enumerable degrees a, b such that a, b ? PC, and the join a V b of a and b is high.

度结合为0′。本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题—加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a，b，满足a，b∈PC，而且a和b的并a∨b是一个高度。

Since historical times,England ,where the early inhabitants were Celts, has been conquered three times .

从有历史以来，英国，在此地早期居住的是凯尔特人，已经被征服了三次。

Bluetooth OBEX File Transfer Enables the sending and receiving of files on your phone via Bluetooth.

蓝牙OBEX文件移动允许经过蓝牙传送和接受文件。。。。