证明性的

We use Hodges-Lehmann statistic to do significance test for those factors. The multiplication model is applied in the quantitative analysis and weighted least squares method is introduced to solve the multiplication model. Although the matrix of coefficients is not of full rank and the solutions of the multiplication model are not unique, we prove that all those solutions are equivalent in some sense.

本文用Hodges-Lehmann统计量对风险因子作显著性检验，将乘法模型用于数据修匀和风险因子的定量分析中，并提出了用加权最小二乘法求解风险因子的风险度量，在系数矩阵不满秩、解不唯一的情况下证明了所有解在某种意义下的等价性。

We apply this general result to Vamos matroid and obtain a family of non-representable multipartite matroids.

我们将这一结论应用于Vamos拟阵，于是得到了一族不可表示的多部拟阵，同时我们利用向量的线性相关和线性无关性对Vamos拟阵的不可表示性给出了新的证明。

In this paper, the imprecise proofs existing in some literatures are firstly pointed out. Then, the local convergence is proved in a new way and the condition of convergence to the local maximum point is offered. Finally, the geometrical counterexamples are provided for explanation about convergence of Mean Shift and the conclusion is further discussed.

首先指出了Comaniciu和李乡儒的证明过程存在错误；然后，从数学上重新证明了Mean Shift算法的局部收敛性，并指出其收敛到局部极大值的条件；最后，从几何上举反例分析了Mean Shift的收敛性，并进行了深入比较和讨论。

If two parties want to sign a contract C over a communication network, they must "simultaneously" exchange their commitments to C Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchange partial commitments in a piece by piece manner The party of secondly sending commitments may have a slight advantage; a "fair" protocol must keep this advantage within acceptable limits The protocol for signing a contract is improved based on the research result of secure multiparty computation In this protocol, the parties obliviously transfer the signed bit and the committed bit; the other parties can prove the validity of this bit based on the confirming sub protocol, but he can't gain more information about the whole signature by accumulating the signed bit or the committed bit After the parties exchange the whole signed information, they declare the commitment about the signature respectively, and gain the whole signature of the other party At this moment, the party doesn't care about the advance quit of the other party, because he has gained the whole signed information Finally, it is proved that this protocol is quit fairness

作者中文名：曲亚东；侯紫峰；韦卫摘要：在网络环境中解决合同签订问题需要保证信息交换的同时性，以前提出的协议都会给第2个发送者部分计算特权，利用不经意传输协议则可以解决这个问题。在协议执行过程中，参与者将合同的签名位以及他对签名位的承诺不经意传输给对方，对方可以利用验证子协议证明该位的有效性，但是他却不能通过位交换次数的增加获取更多的完整签名的信息；在完成签名位的交换之后，参与者分别宣布承诺，并得到对方对合同的完整签名；在宣布承诺时，协议参与者已经获得全部的签名内容，要么是签名位，要么是对方对该位的承诺，因此参与者并不需要担心对方提前终止协议。在文章的最后利用多方安全计算的结论证明了该协议满足终止公平性。

Global and local superlinear/quadratic convergence results were obtained under mild conditions, and the finite termination property was also shown for the linear BVIs.

基于此给出了求解箱约束变分不等式的一种阻尼牛顿算法，在较弱的条件下，证明了算法的全局收敛性和局部超线性收敛率，以及对线性箱约束变分不等式的有限步收敛性。

We estab-lish,under some mild assumptions,a locally quadratic convergence theoremfor Method I and prove a semi-local convergence theorem for Method II.Applications of the two methods to complementarity,variational inequalityand optimization problems are investigated as well.

在某些适当的假设下，我们证明了方法I的局部二次收敛性和方法II的半局部收敛性；还研究了两个方法在求解互补问题，变分不等式问题及约束优化问题中的应用。

A damped Newton type method was presented based on it.Global and local superlinear/quadratic convergence results were obtained under mild conditions, and the finite termination property was also shown for the linear BVIs.

基于此给出了求解箱约束变分不等式的一种阻尼牛顿算法，在较弱的条件下，证明了算法的全局收敛性和局部超线性收敛率，以及对线性箱约束变分不等式的有限步收敛性。

In the first part, we will first deal with the strong Bonnesen-style inequality (2.1.3) for closed convex curves in the plane (the numbers of formulae and references are those of them in the context below). Bonnesen had first proved the weaker inequality (2.1.2) in [12] and several years later, he outlined in his monograph [13] various Bonnesen-style inequalities including (2.1.3), he considered, however,(2.1.3) as a direct consequence of Kritikos theorem for convex bodies in higher dimensional Euclidean spaces,. Here, we will give an independent proof of the existence for inequality (2.1.3), and by the way, give an estimate on the width of the bi-enclosing annulus of closed convex curves in the plane.

具体地讲，在第一部分中，首先讨论平面上闭凸曲线的强Bonnesen型不等式(2.1.3)(公式的编号和参考文献的编号引自后面的正文)，Bonnesen在文[12]中先证明了较弱的不等式(2.1.2)，几年以后，在他的著作[13]中，讨论了多种Bonnesen型不等式，其中包括不等式(2.1.3)，不过，他把(2.1.3)作为高维欧氏空间中凸体的Kritikos定理的直接推论，我们这里对不等式(2.1.3)给出独立的存在性证明，并且还对平面闭凸曲线的bi-enclosing环的宽度给出了一个估计。

In the first part, we will first deal with the strong Bonnesen-style inequality (2.1.3) for closed convex curves in the plane (the numbers of formulae and references are those of them in the context below). Bonnesen had first proved the weaker inequality (2.1.2) in [12] and several years later, he outlined in his monograph [13] various Bonnesen-style inequalities including (2.1.3), he considered, however,(2.1.3) as a direct consequence of Kritikos\' theorem for convex bodies in higher dimensional Euclidean spaces,.

具体地讲，在第一部分中，首先讨论平面上闭凸曲线的强Bonnesen型不等式(2.1.3)(公式的编号和参考文献的编号引自后面的正文)，Bonnesen在文[12]中先证明了较弱的不等式(2.1.2)，几年以后，在他的著作[13]中，讨论了多种Bonnesen型不等式，其中包括不等式(2.1.3)，不过，他把(2.1.3)作为高维欧氏空间中凸体的Kritikos定理的直接推论，我们这里对不等式(2.1.3)给出独立的存在性证明，并且还对平面闭凸曲线的bi-enclosing环的宽度给出了一个估计。

Moreover, we give some dual properties of these problems, and on this basis, we present a dual algorithm for solving the nonconvex conic model trust-region subproblem.

论文分析了这些问题的对偶性质，在此基础上，通过对偶提出了求解锥模型信赖域子问题的算法，同时证明了算法的全局收敛性以及局部Q-超线性收敛性，并给出了一些数值算例以说明算法的有效性。

For a big chunk of credit-card losses; the number of filings (and thus charge-off rates) would be rising again, whether

年美国个人破产法的一个改动使得破产登记急速下降，而后引起了信用卡大规模的亏损。

Eph. 4:23 And that you be renewed in the spirit of your mind

弗四23 而在你们心思的灵里得以更新