整数的

After analyze few existing compression algorithm for high-resolution remote sensing, we provides a new compression algorithm based on Integer to integer wavelet transform, and introductive the design scheme for it.

本文在分析了几种现有的对于高分辨率遥感影像的压缩算法后，提出了一种新的基于整数小波变换的压缩算法，并相应的介绍了设计实现方案。

Then a filled function method for the integer programming problem is proposed,which tries to find a better discrete local minimal solution of the problem by minimizing a filled function.

该方法通过寻找填充函数的离散局部极小解以期找到整数规划问题的比当前离散局部极小解好的解。该文的算法是直接法，数值试验表明算法是有效的。

At present, our main result in this direction is that we have proved the topological charge of instantons in degenerate noncommutative spacetime to be an integer, i.e., to be exactly its instanton number, using ADHM construction; by the way, we have discussed the realization of conformal symmetry of the ordinaty instanton solutions on the instanton moduli space and obtained some primary result, again using ADHM construction.

目前该方面所取得的主要成果是利用ADHM构造证明了退化的非对易时空中瞬子的拓扑荷为整数，即严格等于其瞬子数；另外，顺带用ADHM构造对通常规范场论中瞬子解的共形对称性在参数空间上的实现进行了研究并取得了初步的成果。

In 1997, Lenhard Ng Michelle Schultz[1] gave the definition of k -ordered Hamilton graphs,namely, let G be a Hamiltonian graph of order n,and for a positive integer k with k ≤n, we say that G is k -ordered if for every sequence S : v1 , v2,Λ,vk of k distinct vertices, there exists a hamiltonian cycle C of G such that the vertices of S are encountered on C in the specified order.

年， Lenhard Ng Michelle Schultz[1]给出k-可序( k ？ordered)哈密尔顿图的定义，即设G是n阶哈密尔顿图，对于正整数k，称G 是k -可序图，如果对于任意给定的k 个互不相同的顶点的有序子集S =( v1 ，v2，Λvk)( 2≤k ≤n)，存在G中的哈密尔顿圈C 包含S 且不改变其中元素的顺序。2000 年，R.J。

By constructing a job-schedule network that can present job-time relationship,the FJSP is transformed to a network flow problem,and a 0-1 integer programming mathematical model is developed.

针对一般形式的固定工件排序问题(即可用机器数是有限的，存在机器与工件间匹配约束，以机器分配成本最小为优化目标)，作者通过建立描述工件间时序关系的工件时序网络，将固定工件的排序问题转化为沿工件时序网络的网络流问题，并建立了0-1整数规划数学模型。

Secondly, the power system fault diagnosis analytic model which use both protect andswitch action information is proposed in this paper, it can be described as 0-1 integerprogramming with nonrestraint, reshut break is introused in the analytic model and introducethe contribution factor to the protect, this model solve the fault diagnosis problem in which theprotect information is lack in a certain extent, and present the experienced formular which isused to decide all kinds of protect contribution factor.

然后，提出同时利用保护和断路器动作信息的电力系统故障诊断的解析模型，其可以描述为一个无约束 0-1 整数规划问题，将重合闸引入故障诊断的解析模型并且对保护引入贡献因子，给出确定各种保护贡献因子的经验公式。这种模型在一定程度上解决了数据信息不完整时的电力系统故障诊断问题。

It is pos ible to solve some particular types of integral linear programming problems by virtue of LCS-orientated algorithm or microprocessor.

本文用字编码函数的方法，得到求解LCS的数值模型，证明可用求解Tomograph问题的算法和硬件求解LCS问题，以及可以用LCS的算法和硬件求解某种类型的整数规划问题。

Characterizing plant phototropism, the algorithm looks the feasible region of integer programming as plant growth environment, and determines the growth probability on different growth points according to the changes of the object function.

该算法从植物的向光性特点出发，将整数规划的可行域作为植物的生长环境，根据各可行解目标函数的变化情况确定植物的生长信息，进而模拟出向光源迅速生长的植物生长动力学模型。

The division with surplus, the comprehensive division and Eisenstein Test applications on polynomial that can not be divided are mainly discussed; the sufficient condition of that polynomial with coefficient being integer has no integer root, that cubic polynomial with coefficient being integer is irreducible in rational domain and that polynomial with coefficient being integer has not two completely same roots are summed up.

主要论述了带余除法、综合除法及不可约多项式艾森斯坦判别法的应用；总结出了整系数多项式的无整数根的充分性，三次整系数多项式在有理数域上不可约的充分性，整系数多项式无重根的充分性。

In chapter 1, one type of maximal subgroups in symplectic groups overpolynomial rings are obtained. Let F be a field, R = F be a ring of polynomial in one variable over F, m be a positive integer, f eF and S be the ideal of R generated by -f, We define:, then G is a maximalsubgroups of Sp(2m,R).

在第一章中，得到了多项式环上辛群的一类极大子群：设F是一个域，R=F是域F上关于λ的一元多项式环，m是一个正整数，f∈F，S是R的由λ-f生成的理想，则是Sp(2m，R)的一个极大子群。

Plunder melds and run with this jewel!

掠夺melds和运行与此宝石！

My dream is to be a crazy growing tree and extend at the edge between the city and the forest.

此刻，也许正是在通往天国的路上，我体验着这白色的晕旋。