整数的

There are not primitive roots,for mod n,by computing the order of "product number", for "product module",this artical has made a number(call generalized primitive root ),parametrically,which order is also the common multiple of the all orders.

对于没有原根的模n，通过乘积数对乘积模的次数的计算，该文构造性地得到一种整数，其次数也是所有次数的公倍数，并得到这个公倍数次数的一种计算公式。

With complex analytical analysis for B, the fixed points of B at real axis and C-plane are found. It is proved that zero is the only attract fixed point and the iteration of B on the complex plane is symmetrical. And the domains of the constringency and the divergence of B are given.

通过对B的复解析分析，得出了B在实轴和复平面上不动点的性质与求解方法，证明了0点为唯一的吸引不动点；说明了B在复平面上迭代的对称性，求出了函数迭代在整数点处的敛散区域。

On global optimal algorithms, a heuristic 0-1 Integer Liner Programming algorithm is achieved, which combines heuristic enumeration method and revised simplex method. Simulation experiments show that the degree and optimization efficiency in our algorithm is obviously improved compared with the MATLAB 7 bintprog function that is a 0-1 integer programming algorithm. Moreover our algorithm isn\'t relevant to the scale changes of Web services composition and candidate service sets, thus it is applicable for the scenes that the scales of Web services composition changed dynamically. But for Web services composition with service alliance, the algorithm is unable because the non-linear global optimal model of the fitness function and QoS constraints can\'t be expressed in linear mode.

在全局优化算法研究上，基于启发式0-1整线性规划算法结合了修正单纯形法和启发式枚举法，仿真实验表明该算法与MATLAB 7的0-1整数规划方法比较，在优化程度及优化效率上得到了显著改进，并且对服务组合和候选服务集合的规模变化没有明显的相关性，因而该算法可用于服务组合规模动态变化的场景，但该算法不能应用于存在服务联盟的非线性全局优化模型。

However, a byte considered as an integer between 0 and 255 does have a most- and least- significant bit, and since we write numbers with the most- significant digit on the left, we also write bytes with the most- significant bit on the left.

但是，当一个字节被看作是一个0到255之间的整数时，就会有一些最重要的或是最不重要的位。通常我们会将一个字节中最重要的位写在左边，将几个字节中，最重要的字节写在左边。

In 2004 Zhang Zhongfu presented the concept ofadjacent vertex distinguishing total coloring whose content is: Let G be a connectedsimple graph with order at least 2, k be a positive integer and f be a mappling fromV∪E to {1,2,...,k}. Let C={f}∪{f|uv∈E,v∈V}for all u∈V. If (1) for any uv, vw∈E,u≠w, we have f≠f;(2) for any uv∈E, we have f≠f, f≠f, f≠f,then f is called a k-proper total coloring of graph G.

第三章和第四章主要研究了两种联图的邻点可区别全染色，邻点可区别全染色的定义是张忠辅在2004年提出来的，其内容为：设G是阶至少为2的简单连通图，k是正整数，f是V∪E到{1，2，…，k}的映射，对任意u∈V，记C={f}∪{f|uv∈E，v∈V}。

Based on the analysis of finished auto's loading/unloading process of AnJi-TNT Logistics, propose the maximum transportation capacity optimization of every Car-carrier loading with different goods-cars. Construct the scheme database of optimization for Car-carriers'loading in SQL-server 2000 database software. The optimization toward loading orders in customization is resolved with maximum transportation's capacity algorithm and matching scale method with Visual Basic background.

本文结合安吉天地汽车物流有限公司整车物流调度系统的配载流程进行分析，通过整数规划计算出每辆轿运车针对不同商品车的最大运能配载方案，在SQL-Server数据库平台下，对这些最大运能配载方案按一定规则保存并进行数据库的管理，最后利用事例推理在Visual Basic开发环境下提供面向客户混装订单的轿运车配载方案优化的解决方案，并进行了实例验证。

This research which extends the new product supply chain model of Bulter et al. considers issues on global logistics from a more integrated view. First of all, it solves the global logistic settings problem in new product development by means of mixed-integer linear programming. Secondly, it uses the scenario-based robust optimization to lower the risk in the supply chain design. Then it adds the reliability calculation to make up for the gap between the plan and the real operation. At last it calculates and analyzes the quantitative model on the basis of the case data.

本研究延伸Butler等人之新产品供应链模式，考量更完整之全球运筹相关议题，透过混合整数线性规划描述新产品发展时全球运筹配置问题，并利用情境为基础的稳健最佳化以取得低风险的供应链配置，此外加入可靠度的影响，以弥补供应链规划与实际操作的差距，并加入缺货之惩罚成本，最后以范例资料进行计算与分析此数量模式，经由模式计算结果发现本研究规划之结果，相较於原Butler等人之模式有较低的缺货的发生可能性，且所求得之配置整体可靠度皆有所提升。

The determination of parameters σ and p is converted into the definition of an inequal upper boundary from solving integer programming problem, which decreases the calculation of solving parameters so that the application of CF-PCG algorithm in pactice is more convenient.

分析了CF－PCG算法的效率随其参数的变化性质，将参数σ，p的确定，由求解整数规划子问题转化为确定一个不等的上界，从而减少求解参数的计算量，使CF－PCG算法的实现更加方便。

Jon Edvardsson et al pointed out that the technique developedby Neelam Gupta et al is neither complete nor terminational for W on which all of thepredicate functions with respect to the input variables are linear, and suggested usinglinear programming and linear integer programming methods instead.

Jon Edvardsson等人指出，对于谓词函数均为输入变量的线性函数的程序路径， Neelam Gupta等人提出的求解方法是不完备的和非终止的，并建议采用线性规划、线性整数规划方法。

It can effectively describe the memory and transmissibility of many kinds of material,and plays an increasingly important role in physics,mathematics, mechanical engineering,biology,electrical engineering,control theory,finance and other fields.

分数阶微分方程的特点是含有非整数阶导数，能非常有效的描述各种各样的物质的记忆和遗传性质，在物理，数学，机械工程，生物，电子工程，控制理论和金融等领域发挥越来越重要的作用。

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.

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