关于不定方程x3＋8=27y2

利用同余式，递归序列的有关性质和结论证明了不定方程x3＋8=27y2仅有整数解（x，y）=（-2，0）．     

关于不定方程x^3＋1=Dy^2

对不定方程ｘ＾３＋１＝Ｄｙ＾２，当０〈Ｄ〈１００，不含平方因子，且被６ｋ＋１形的素数整除时，本文得到仅当Ｄ＝７，１４，３５，３８，５７，６５，８６时有非平凡整数解，并证明了Ｄ＝９１时方程无非平凡解。     

关于Diophantine方程x~3+1=3py~2

设p是奇素数,证明了当p=108 s2+1,其中s是正整数时,方程x 3+1=3py2无正整数解(x,y).     

基于时间约束的多源多品种配送系统模型及一种启发式算法

配送系统设计时,除了使系统的总费用最小外,还要满足各需求点对配送时间的要求。在说明了建模的假设条件后,建立了考虑时间约束的多源多品种配送系统模型,并根据模型的特殊结构开发了相应的启发式算法,最后用实际调研的数据作为算例对模型进行了数值演算。     

点阵式液晶显示模块中T6963C的应用与分析

为了方便地实现点阵式液晶显示,使用了内置T6963C控制芯片的液晶显示模块.采用8155对单片机的并行I/O口扩展和通过对电路的硬件、软件合理设计达到对T6963C显示模块的控制.此外,给出了T6963C正常工作的基本条件以及相关控制程序、程序流程图,并介绍了一种绘画直线的算法,从而更方便地实现了人机对话.     

A Binary Integer Program to Maximize the Agreement Between Partitions

This research note focuses on a problem where the cluster sizes for two partitions of the same object set are assumed known; however, the actual assignments of objects to clusters are unknown for one or both partitions. The objective is to find a contingency table that produces maximum possible agreement between the two partitions, subject to constraints that the row and column marginal frequencies for the table correspond exactly to the cluster sizes for the partitions. This problem was described by H. Messatfa (Journal of Classification, 1992, pp. 5–15), who provided a heuristic procedure based on the linear transportation problem. We present an exact solution procedure using binary integer programming. We demonstrate that our proposed method efficiently obtains optimal solutions for problems of practical size. We would like to thank the Editor, Willem Heiser, and an anonymous reviewer for helpful comments that resulted in improvements of this article.     

无k次因子数的分布问题

本文在黎曼假设下,讨论了无k次因子数分布中的余项△_k(x)估计问题,得到:当k≥29时,△_k(x)=O(X~((1/(k+5/2))+E)).     

最大公因数与最小公倍数的矩阵求法

本文通过讨论，给出一个求两个整数的最大公因数和最小公倍数的矩阵求法。经过整数矩阵的初等变换，可在一个整数矩阵上同时求得（m,n）与[m,n]。这个方法有助于求解整数的标准分解式。     

An Approximate Algorithm for a Class of Nonlinear Bilevel Integer Programming

The algorithm for a class of nonlinear bilevel integer programming is discussed in this paper. It is based on the theory and algorithm for nonlinear integer programming. The continuity methods for integer programming are studied in this paper. After simulated annealing algorithm is applied to the upper-level programming problem and the thought of filled function method for continuous global optimization is applied to the corresponding lower-level programming, an approximate algorithm is established. The satisfactory algorithm is elaborated in the following example.     

关于Diophantine方程（ax^m-1）/（ax-1）=y^n＋1

设a,m是适合m＞2的正整数.证明了当a＞1时,方程仅有有限多组正整数解(x,y,n)适合min(x,y,n)＞1,而且这些解都满足yn＜2xm-1≤2am2-3m+2.