交换算法

The structures and stabilities of the ground-states for Cu13-nAgn clusters have been studied by Gupta model potential based on tight binding second moment approximation in combination with a genetic algorithm. It is found that the lowest energy structures of the pure clusters (n=0,13) are perfect icosahedron, and the structures for the bimetallic clusters (n=1～10) have stable structure which are slightly deformed with respect to the perfect icosahedron, The Cu atom prefers to occupy the center of the clusters with higher coordination numbers.

在混合团簇基态结构优化的遗传算法方案中增加了交换算子，结合Gupta紧束缚模型势研究了Cu13-nAgn团簇的最低能量结构，选择合适的交换和杂交概率，可有效地提高优化效率，优化结果表明，Cu13和Ag13是全对称的二十面体，n=1～10的混合团簇能形成稳定结构，其构型是在二十面体基础上发生畸变，Cu原子趋于处在团簇中心，随着Ag原子数目的增加，原子间的平均距离单调增加，团簇的结合能单调减小，Cu2Ag12和CuAg12只存在亚稳结构。

In order to protect the integrality of the message, the method of digital signature is adopted.

本论文方案中设计实现的基于JPEG图片的伪装和加密的秘密信息交换方法，具有很好的伪装和防止篡改的能力，嵌入的算法具有较强的不可感知性和鲁棒性。

The contents of the course include: what operating system are, what they do, how they are designed, and where they came from; a general history and explanations of computer system, and some discussion on hardware and the relation between operating system and other software; concept of process, process states and process control block, process queue, management of processes; concepts of sequent programming and parallel programming, process synchronization and its application, process communication; scheduling level and job state transition, job scheduling, process scheduling, and methods for scheduling; deadlock and its necessary conditions, deadlock prevention, control and recovery of deadlock; fixed partition, multiple partition and replacement partition memory management, swapping and overlays; page, segmentation and segmentation with paging storage management, basic concept of virtual memory management, and page, segmentation and segmentation with paging memory management.

课程的内容包括：计算机系统概述、操作系统的形成、发展、功能、特性、类型和发展趋势；操作系统的硬件环境、操作系统与其它系统软件的关系；进程的概念、进程的状态和进程控制块、进程队列、进程的管理；顺序程序设计和并行程序设计概念、进程间的同步与互斥、同步机构应用、进程间通信；调度的层次和作业状态转换，作业的调度、进程调度、调度算法；死锁问题的提出、死锁的必要条件、死锁的预防、避免、控制和恢复；固定分区、可复分区、多重分区内存管理技术以及覆盖技术和交换技术；分页域、分段域、段页域存储管理技术、虚拟存储管理的基本概念、分页域、分段域、段页域虚拟存储管理。

An algorithm which computes integrated priority for the packet in the input memory switch is proposed.

针对输入缓存的交换结构，提出了一种将时延与丢失率相结合计算分组优先级的算法CPC。

So the priority that combines packet delay and dynamic queue length is obtained. A packet scheduling algorithm based on this priority scheme is proposed for the input memory switch.

在此优先级的基础上，提出了输入缓存交换结构中能够兼顾分组时延与分组队长的分组调度算法。

A"bit-mismatch"squarer and a"digit-serial"polynomial multiplier have been designed for finite field arithmetic and the modular inverse in GF (2〓) can be calculated under the combination of the squarer and the multiplier. Based on the Montgomery method for the elliptic curve scalar multiplication, a new improved process has been put forward in the thesis.

论文改进了标量乘法Montgomery算法流程，利用寄存器间的数据交换，将0和1两种情况下的中间结果"点加一倍点"操作统一起来，简化了控制流程，使关键路径延时下降，而且减少了运算单元输入输出的连线逻辑。

A new scheduling algorithm in Parallel Packet Switch is proposed in this paper .

摘要该文提出了一种新的并行分组交换网络调度算法。

The analysis of the optical signal transmission characteristics and the physical parameters provides the theoretical foundation for optimizing the design and improving the performance of AWG; and the optimizing design numerical value calculation method solves the complex problem of the optimizing design of the AWG, it can also provide a way for AWG computer aided design system; the AWG optical signal processing analysis provide a way for optical signal Fourier transform, serial and parallel transmission, circle shift, matrix transform and differential processing; the optical signal processing characteristics of AWG develop AWG to use for new field, and the optical signal processing will play an important role on all-optical networks in the future; by the definition of the wavelength transform matrix of the AWG, the signal output positions that come from these input signals of the different wavelength or the same wavelength but the different input ports and carrying different signals can be accurately determined, and the wavelength transmission matrix plays an important role for analyzing the routing of the complex optical network, or designing the network nodes such as the optical path add/drop multiplexer and optical cross connect device; the wavelength transmission matrix also provides a method for monitoring and managing the wavelength transmission of the optical network nodes; e analysis of the AWG' OXC node structure and wavelength routing provides a way for realizing the OXC, especially for multi-path/multi-wavelength OXC and the intelligence node of the optical networks; by the studying of the control plain characteristics, router, traffic engineering, program and the improved arithmetic of the wavelength routing, the method for realizing the GMPLS' OXC optical transport network is provided, and it play an important role for the study of the automatic switched optical network; the time-frequency analysis can provide more information about the dispersion and energy changes of .the pulsed light transmission in the singlemode fiber, it also provides more useful parameters for analyzing the dispersive accumulating and dispersive compensating.

AWG光信号传输特性与相关参数的分析，为进一步优化设计AWG及提高其性能提供了理论依据，而优化设计计算数值方法解决了AWG优化设计计算的复杂问题，为进一步建立AWG的计算机设计系统提供了基础；AWG光信号处理的特性分析，提出了AWG应用的新领域，为光信号的傅立叶变换、串并传输、循环移位、矩阵变换、微分处理等提供了一条途径；波长传输矩阵变换关系的建立，不仅得到了确定多路AWG每路信号从输入端口到输出端口的准确输出位置的方法，而且在分析应用AWG实现复杂的光通信网络路由的连接、特别在设计分插复用器和交叉连接器等网络节点时有重要的作用，能有效而准确地确定波长的路由关系，为实现节点波长传输路由的监控和管理提供有效手段；基于AWG的OXC结构和波长路由的确定为实现OXC技术、特别是多路多波长的OXC和光网络的智能节点技术提供了有效的方法；控制平面的特征、路由器、流量工程、程序及改进的波长路由算法的研究实现了基于GMPLS的OXC光传送网络的控制平面，为建立自动交换光网路提供了一定的基础；时频分析可以更直观和更清晰地描述脉冲信号在单模光纤中传输色散和能量的变化，为色散积累和色散补偿提供有效的分析参数。

Considering the communication characteristics of switched industrial Ethernet, genetic algorithms are used to find near-optimal solution for its network partition problem.

针对交换式工业以太网的数据通信特点，采用遗传算法来寻找其网络划分问题的次优解。

In the solution process the initialization two populations, separately will select the different overlapping variation probability, after each time will iterate the sufficiency high individual carries on the first populations in sufficiency low individual with the second population in the exchange, and will preserve each center group the optimal solution to the outstanding person population, by will solve the tradition genetic algorithms to be easy to appear precociously, will be easy to fall into the partial optimal solution question.

即在求解过程中将初始化两个种群，分别选取不同的交叉变异概率，在每一次迭代完后将第一个种群之中的适应度较低的个体与第二个种群中适应度较高的个体进行交换，并且保存每个种群的最优解到精英种群，以解决传统遗传算法容易出现早熟，容易陷入局部最优解的问题。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。