An Additive Problem with Primes in Arithmetic Progressions

In this paper, we extend a classical result of Hua to arithmetic progressions with large moduli. The result implies the Linnik Theorem on the least prime in an arithmetic progression.     

广义C-R组的性质及两个边值问题

本文考虑广义C-R组^[1](H)的解f=u iv jw∈C^2的一些性质，提出与之相关的两个边值问题，用积分方程方法和调和函数性质证明了边值问题解的存在唯一性，并写出解的积分表达式．     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

A remark on the Riemann‐Hilbert problem with a vanishing coefficient

This paper concerns the existence of nontrivial solutions of the Riemann‐Hilbert problem with a continuous coefficient whose values belong to two rays in the complex plane. Our results extend those recently obtained by E. Shargorodsky and J. F. Toland [6]. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A branch and bound algorithm for the robust shortest path problem with interval data

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

Sufficient conditions of non‐uniqueness for the Coulomb friction problem

We consider the Signorini problem with Coulomb friction in elasticity. Sufficient conditions of non‐uniqueness are obtained for the continuous model. These conditions are linked to the existence of real eigenvalues of an operator in a Hilbert space. We prove that, under appropriate conditions, real eigenvalues exist for a non‐local Coulomb friction model. Finite element approximation of the eigenvalue problem is considered and numerical experiments are performed. Copyright © 2003 John Wiley & Sons, Ltd.     

Two-Frequency Autowave Processes in the Complex Ginzburg–Landau Equation

We study the complex Ginzburg–Landau equation with zero Neumann boundary conditions on a finite interval and establish that this boundary problem (with suitably chosen parameters) has countably many stable two-dimensional self-similar tori. The case of periodic boundary conditions is also investigated.     

匹配问题实例空间和解空间结构

本文通过研究匹配问题的实例空间，匈牙利算法和解空间三者之间的关系，指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。     

反对称正交对称矩阵反问题

本文讨论一类反对称正交对称矩阵反问题及其最佳逼近．研究了这类矩阵的一些性质，利用这些性质给出了反问题解存在的一些条件和解的一般表达式，不仅证明了最佳逼近解的存在唯一性，而且给出了此解的具体表达式．