On a question of Gross

Using the notion of weighted sharing of sets we prove two uniqueness theorems which improve the results proved by Fang and Qiu [H. Qiu, M. Fang, A unicity theorem for meromorphic functions, Bull. Malaysian Math. Sci. Soc. 25 (2002) 31-38], Lahiri and Banerjee [I. Lahiri, A. Banerjee, Uniqueness of meromorphic functions with deficient poles, Kyungpook Math. J. 44 (2004) 575-584] and Yi and Lin [H.X. Yi, W.C. Lin, Uniqueness theorems concerning a question of Gross, Proc. Japan Acad. Ser. A 80 (2004) 136-140] and thus provide an answer to the question of Gross [F. Gross, Factorization of meromorphic functions and some open problems, in: Proc. Conf. Univ. Kentucky, Lexington, KY, 1976, in: Lecture Notes in Math., vol. 599, Springer, Berlin, 1977, pp. 51-69], under a weaker hypothesis.     

A Nonlinear Drift - Diffusion System with Electric Convection Arising in Electrophoretic and Semiconductor Modeling

A multi-dimensional transient drift-diffusion model for (at most) three charged particles, consisting of the continuity equations for the concentrations of the species and the Poisson equation for the electric potential, is considered. The diffusion terms depend on the concentrations. Such a system arises in electrophoretic modeling of three species (neutrally, positively and negatively charged) and in semiconductor theory for two species (positively charged holes and negatively charged electrons). Diffusion terms of degenerate type are also possible in semiconductor modeling. For the initial boundary value problem with mixed Dirichlet - Neumann boundary conditions and general reaction rates, a global existence result is proved. Uniqueness of solutions follows in the Dirichlet boundary case if the diffusion terms are uniformly parabolic or if the initial and boundary densities are strictly positive. Finally, we prove that solutions exist which are positive uniformly in time and globally bounded if the reaction rates satisfy appropriate growth conditions.     

Protein Conformation of a Lattice Model Using Tabu Search

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.     

一个非协调膜元的高精度分析

本文讨论一个四自由度三角形非协调膜元的整体超收敛性，外推和亏量校正。     

Ginzburg－Landau－Newell模型的动力学行为

木文对Ｇｉｎｚｂｕｒｇ－Ｌａｎｄａｕ－Ｎｅｗｅｄ模型的动力学行为进行了讨论，得到了该模型的整体吸引子的存在性，同时得到了此吸引子维数的下界估计和该吸引子的Ｈａｕｓｄｏｒｆｆ维数和Ｗａｃｔａｌ（分形）维数的上界估计．     

Molecular Orbital Calculations on 2, 4, 6-Trinitrotoluene

Three ab initio calculations (HF/6-3IG, HF/6-3IG*, and HF/6-3IG**) on 2,4,6-trinitrotoluene were made, The results compare well with xray data, except dihedral angles of NO₂ relative to the plane of the benzene ring. The deviations are attributed to packing forces and steric effects in the crystal. The most stable structure was a torsional angle 10° of the methyl top with the benzene ring, unlike toluene. The rotational barriers of the methyl top and the 4-nitro group are small. Hydrogen bonding, dipole moments and total atomic charges arc calculated.     

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance.     

A rigid graph for every set

A graph G is called rigid if the identical mapping V(G)→V(G) is the only homomorphism G→G. In this note we give a simple construction of a rigid oriented graph on every set. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 108–110, 2002     

带耗散的一阶非线性偏微分方程组的Cauchy问题

本文采用整体迭代法证明了带小初值的一阶非线性耗散偏微分方程组的Cauchy问题的整体经典解的存在性及指数衰减性质。     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.