负载共享系统的设计与实现

文章介绍在 Ｌｉｎｕｘ操作系统网络环境下,负载共享系统的基本设计原理和实现方法。重点描述客户一服务器通信模式以及程序模块的算法框架。     

一个针对洗牌交换网的最优路由算法

洗牌交换网是最流行的互连网之一,然而,它的缺点之一便是最短路由算法,最短路由算法,通常也称为最优路由算法,能保证报文在任意一对结点之间沿着最短路径传送。针对包含2^n个结点的洗牌交换网,文中给出了一个O（n^2)时间复杂度的最短路由算法。该算法还可以很容易地适用于立方体连接圈（CCC）,且所得到的算法比已有的CCC路由算法要简单得多。     

进程迁移在Linux操作系统环境中的实现

本文为在Ｌｉｎｕｘ操作系统网络环境中实现进程迁移,簌 Ｌｉｎｕｘ中增加功能的方法,内在管理模式以及实现进程迁移的机制。     

内容分布网络缓存资源并行分配的博弈粒子场方法

文章研究博弈粒子场方法对内容分布网络(CDN)缓存分配问题求解,通过建立相应的数学模型,将两阶段Web服务器一代理服务器缓存资源分配问题,映射为两个对偶力场中粒子的运动,力场中所有粒子按数学模型中定义的规则运动直至达到稳定状态,再由粒子的稳定状态反映射为Web服务器一代理服务器缓存资源分配问题的解.提出的适用于CDN的博弈广义粒子场模型(game particle-field(G-PF))置换方法,克服了现有常用的MFU、LFU、LRU等置换算法缓存间不能合作的缺点,发展成为合作的博弈置换算法.并用博弈理论简单地证明了所得到的解为全局Pareto最优解.这样,使G-PF置换算法能逼近理论上的Optimal置换算法,较Korupolu等提出合作的置换算法有更好的性能.     

综合推理与智能书法创作

In this paper, we address the demanding task of developing intelligent systems equipped with machine creativity that can perform design tasks automatically. The main challenge is how to model human beings' creativity mathematically and mimic such creativity computationally. We propose a ``synthesis reasoning model" as the underlying mechanism to simulate human beings' creative thinking when they are handling design tasks. We present the theory of the synthesis reasoning model, and the detailed procedure of designing an intelligent system based on the model. We offer a case study of an intelligent Chinese calligraphy generation system which we have developed. Based on implementation experiences of the calligraphy generation system as well as a few other systems for solving real-world problems, we suggest a generic methodology for constructing intelligent systems using the synthesis reasoning model.