The Diffie–Hellman problem and generalization of Verheul’s theorem

Bilinear pairings on elliptic curves have been of much interest in cryptography recently. Most of the protocols involving pairings rely on the hardness of the bilinear Diffie–Hellman problem. In contrast to the discrete log (or Diffie–Hellman) problem in a finite field, the difficulty of this problem has not yet been much studied. In 2001, Verheul (Advances in Cryptology—EUROCRYPT 2001, LNCS 2045, pp. 195–210, 2001) proved that on a certain class of curves, the discrete log and Diffie–Hellman problems are unlikely to be provably equivalent to the same problems in a corresponding finite field unless both Diffie–Hellman problems are easy. In this paper we generalize Verheul’s theorem and discuss the implications on the security of pairing based systems.      

Improved trial methods for a class of generalized Bernoulli problems

The aim of this article is to develop improved trial methods for the solution of a generalized exterior Bernoulli free boundary problem. At the free boundary, we prescribe the Neumann boundary condition and update the free boundary with the help of the remaining Dirichlet boundary condition. Appropriate update rules are obtained by expanding the state's Dirichlet data at the actual boundary via a Taylor expansion of first and second order. The resulting trial methods converge linearly for both cases, although the trial method based on the second order Taylor expansion is much more robust. Nevertheless, via results of shape sensitivity analysis, we are able to modify the update rules such that their convergence is improved. The feasibility of the proposed trial methods and their performance is demonstrated by numerical results.     

Scattering matrices for the quantum body problem

Let be a generalized body Schrödinger operator with very short range potentials. Using Melrose's scattering calculus, it is shown that the free channel `geometric' scattering matrix, defined via asymptotic expansions of generalized eigenfunctions of , coincides (up to normalization) with the free channel `analytic' scattering matrix defined via wave operators. Along the way, it is shown that the free channel generalized eigenfunctions of Herbst-Skibsted and Jensen-Kitada coincide with the plane waves constructed by Hassell and Vasy and if the potentials are very short range.

     

Equivalence of variational inequality problems to unconstrained minimization

In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit functions and give conditions under which the stationary points of these functions are the solutions of VI. This work was supported by the state key project “Scientific and Engineering Computing”.     

Accelerated projection-based forward-backward splitting algorithms for monotone inclusion problems

In this paper, based on inertial and Tseng''s ideas, we propose two projection-based algorithms to solve a monotone inclusion problem in infinite dimensional Hilbert spaces. Solution theorems of strong convergence are obtained under the certain conditions. Some numerical experiments are presented to illustrate that our algorithms are efficient than the existing results.     

A note on Riemann problems for single‐periodic polyanalytic functions

In this article, a new canonical function has been established to deal with Riemann boundary‐value problem of periodic analytic functions discussed in 16 . In comparison with the corresponding result in 16 , the expression of solution obtained here is much simpler. Then, we demonstrate the equivalence of solutions for the homogeneous Riemann problem. What's more, we obtain the precise rank of matrix of coefficients for the system of linear algebraic equations (4.35) in 16 . Those results can simplify the discussion of Riemann problem of single‐periodic polyanalytic functions in 16 .     

HIGH ACCURACY FINITE VOLUME ELEMENT METHOD FOR TWO-POINT BOUNDARY VALUE PROBLEM OF SECOND ORDER ORDINARY DIFFERENTIAL EQUATIONS

1　ＩｎｔｒｏｄｕｃｔｉｏｎＦｉｎｉｔｅｖｏｌｕｍｅｅｌｅｍｅｎｔｍｅｔｈｏｄｏｒＦＶＥＭｕｓｅｓａｖｏｌｕｍｅｉｎｔｅｇｒａｌｆｏｒｍｕｌａｔｉｏｎｏｆｔｈｅｄｉｆ ｆｅｒｅｎｔｉａｌｅｑｕａｔｉｏｎｗｉｔｈａｆｉｎｉｔｅｐａｒｔｉｔｉｏｎｉｎｇｓｅｔｏｆｖｏｌｕｍｅｔｏｄｉｓｃｒｅｔｉｚｅｔｈｅｅｑｕａｔｉｏｎ ,ｔｈｅｎｒｅ ｓｔｒｉｃｔｓｔｈｅａｄｍｉｓｓｉｂｌｅｆｕｎｃｔｉｏｎｓｔｏａｌｉｎｅａｒｆｉｎｉｔｅｅｌｅｍｅｎｔｓｐａｃｅｔｏｄｉｓｃｒｅｔｉｚｅｔｈｅｓｏｌｕｔｉｏｎ ([1 -4 ] ) .…     

强向量均衡问题与不动点问题的粘性逼近算法

讨论了强向量均衡问题与非扩张映射不动点问题的公共解.首先,给出了强向量均衡问题的辅助问题,并在适当的条件下,证明了其解的存在性和唯一性结果.然后,利用这些结果,提出了强向量均衡问题与非扩张映射不动点问题公共解的粘性逼近算法,并进一步证明了,在适当的条件下,由该算法产生的迭代序列强收敛于强向量均衡问题和非扩张映射不动点问题的公共解.     

Halin-图的点强全染色

图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}．χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数．对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图．本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度．     

二级线性价格控制问题的满意解的求解思路及实例

本文就文献 [1]对线性二级价格控制问题 (BLP) 2 研究的结果及文献 [2 ]提出的问题进行了进一步的讨论。用反例指出文 [1]求出的极点最优解是错的 ,以及一般的 (BL P) 2 问题求出的最优解 ,可能是下层决策者根本无法接受的。因此 ,本文提出 (BLP) 2 的求下层目标最优解的边界搜索法及在此基础上用多目标的观点来求 (BLP) 2 的满意解的思路及实例