一种基于整数小波变换的脆弱水印技术

该文提出了一种用于图像鉴定的脆弱水印方法。该方法利用小波变换提取图像的特征信息，采用Hash函数加密生成数字摘要作为脆弱水印，给出了整数小波域基于平移窗的多比特水印的非线性嵌入方案，并实现了脱离原图的高概率水印检测方法。实验结果表明这是一种行之有效的图像鉴定方法。     

关于推广的Markoff方程sum from i=1 to n(x_i~2)=n(multiply from i=1 to n)x_i

本文给出了n=4时的全部正整数解,并讨论了n=4时的唯一性问题.     

关于算术图的一个猜想

一个(p,q)—图G被称为是(k,d)—算术的,如果它所有顶点可以被分配到不同的非负整数,使得它的边值可以排列成算术级数k,k+d,k+2d,…,k+(q-1)d,其中一条边的值是分配到它的两个端点的数的和。一个图G被称为是算术的,如果存在两个正整数k和d使得它是(k,d)—算术的。本文证明了Acharya和Hegde提出的下述猜想:对任意正整数n≥5,K不是算术图。     

关于方程sum from k=0 to n[x+2(10l+9)k]~r=[x+2(10l+9)(n+1)]~r

证明了:当奇数r>3,n,x为正整数,l为非负整数,(x,2(10l+9))=1时,方程sum from h=0 to n[x+2(10l+9)k]~r=[x+2(10l+9)(n+1)]~r无正整数解。     

Hypergeometric Polynomials and Integer Programming

We examine connections between A-hypergeometric differential equations and the theory of integer programming. In the first part, we develop a hypergeometric sensitivity analysis for small variations of constraint constants with creation operators and b-functions. In the second part, we study the indicial polynomial (b-function) along the hyperplane xi=0 via a correspondence between the optimal value of an integer programming problem and the roots of the indicial polynomial. Gröbner bases are used to prove theorems and give counter examples.     

钢筋混凝土受弯构件的优化设计—一类离散型非线性规划

研究钢筋混凝土受弯构件的优化设计问题，建立了新的数学模型—一类离散型非线性规划，给出了计算步骤与若干算例．提出的算法容易在微机上实现，所有可行解都是整数解，而且所得最优值在一定条件下是总体最优值．     

关于不定方程组9x~2－7y~2＝2，32y~2－9z~2＝23

利用不定方程ｘ２－Ｄｙ２＝Ｃ（Ｄ∈Ｎ，Ｃ∈Ｚ－｛０｝）的整数解的结构，给出了不定方程组９ｘ２－７ｙ２＝２，３２ｙ２－９ｚ２＝２３的所有正整数解的一个表达式．由这个表达式，经过初等计算，可得到该不定方程组的正整数解     

关于Duphantus方程(a~lx~m+c)/(abx+d)=by~2的一类解

通过对Ｄｕｐｈａｎｔｕｓ方程的研究，得到了当及时各种情况的全部正整数解。     

A dynamic production planning and scheduling algorithm for two products processed on one line

This paper presents a dynamic production planning and scheduling algorithm for two products processed on one line over a fixed time horizon. Production rates are assumed fixed, and restrictions are placed or inventory levels and production run lengths. The resulting problem is a nonlinear binary program, which is solved using an implicit enumeration strategy. The algorithm focuses on the run changeover period while developing tighter bounds on the length of the upcoming run to improve computational efficiency. About 99% pf 297 randomly generated problems with varying demand patterns are solved in less than 15 seconds of CPU time on a CDC Cyber 172 Computer. A mixed integer programming formulation of the generalized multi-product case under no-backlogging of demand is also given.     

Operations that preserve total dual integrality

There are many useful operations, such as adding slack variables, taking scalar multiples of inequalities, and applying Fourier-Motzkin elimination, that can be performed on a linear system such that if the system defines an integer polyhedron then so does the derived system. The topic dealt with here is whether or not these operations also preserve total dual integrality of linear systems.