二维多介质欧拉自适应网格方法研究

要对聚能和流场的剧烈变化进行模拟，欧拉方法具有明显的优势。而在这些方面的研究中，所涉及的流场十分复杂，为达到所需的计算精度，必须采用很密的网格才能以较好的分辨率去模拟流场的剧烈变化部分和介质的界面，特别是大空间尺度流场局部细节的数值模拟，有些问题如果用统一网格计算，即使最快的计算机也不能提供足够的分辨率。所以目前计算机的内存和速度限制了整个计算区域的网格细分程度，对计算区域作局部的网格自适应细分、用大的动态空间分辨率划分流场是必要的和迫切的。     

全光网中基于FBG的OADM设计研究

提出一种全新的OADM(Optical Add—Drop Multiplexers)结构设计，此结构仅采用一个多端口环行器，大大减少了环行器的数量，节约了成本。若要上／下路一个波长．则只需要一个FBG(Fiber Bragg Grating)；若要同时上／下路多个波长，则需要2m个FBG。计算机仿真实验证明此结构比H．Yuan提出的结构具有更低的损耗．对全光网络的实现具有重大的意义。     

基于Web的ICF物理实验数据查询系统

随着“神光”-Ⅱ的运行和“神光”-Ⅲ原型的即将建成，物理实验数据、实验参数以及各探测器的实验记录也将越来越多。为了方便物理实验人员对实验数据进行后续处理，必须建立有效的数据管理和查询系统。系统建立的ICF物理实验数据查询系统，实现了对实验参数和数据有效的管理和利用，该系统应用计算机网络技术及数据库技术，并用Web网页浏览的方式．以方便相关物理实验人员对实验参数和实验数据的查询和调用，即时全面了解实验状况，从而有利于对实验数据进行分析，指导下一步的具体实验。     

弹塑性流体力学拉氏自适应网格和网格重分守恒重映数值模拟方法

拉氏自适应重分弹塑性流体力学有限元程序实现了网格完全自适应，具有良好、灵活的非结构自适应网格数据结构，实现了滑移界面两边(接触间断)网格动态调整，网格的细分和合并处理灵活，网格重分和网格自适应模块兼容、守恒重映，网格重分中采用多种方法控制新网格的质量，爆轰计算可采用Lee-Tarver的化学反应率模式。初步数值计算结果表明，弹塑性流体力学拉氏自适应重分数值模拟方法合理，计算结果正确，基本反映了流场的物理结构。     

资源有限网络计划的PRWI启发式优化方法

本文在综合考虑了有资源约束的网络计划结构特征、资源强度、时间约束等方面因素的基础上，提出了一种新的资源优化的启发式优化方法—ＰＲＷＩ方法，并通过分析证明了该方法处理问题的效果较现有的其它方法好。     

IPv4/IPv6翻译网关的研究

In this paper, a model of translation gateway is proposed. The communications between IPv4 network and IPv6 network are realized by using the Microsoft intermediate driver technology in environment of Windows 2000.     

Evolution of Weighted Networks by Duplication-Divergence Mechanism

The duplication and divergence process is ubiquitous in nature and man-made networks. Motivated by the duplication-divergence mechanism which depicts the growth of protein networks, we propose a weighted network model in which topological evolution is coupled with weight dynamics. Large scale numerical results indicate that our model can naturally generate networks with power-law-like distributions of degree, strength and weight. The degree-strength correlation is illustrated as well. These properties are in agreement well with empirical data observed in real-world systems. Furthermore, by altering the retention probability δ, weighted, structured exponential networks are realized.     

Synchronizing Complex Networks by an Adaptive Adjustment Mechanism

We propose an adaptive adjustment mechanism for synchronizing complex networks, in particular for sociological or/and biological systems. We do not take it for granted that a dynamical system is put on isolated nodes and they are coupled with each other by one （or more） variable（s）, as employed in most previous models. As a replacement, we suppose that each node may have any finite number of possible states, and their evolutions with time are determined by their nearest-neighbouring （or even second-nearest-neighbouring, etc） nodes in an adaptive adjustment mechanism. It is found that synchronization can be achieved for almost all connected networks and that the scale-free property can evidently improve the synchronizing speed.     

高负荷情形开网络的强逼近

本文用强逼近理论,对一般排队网络在高负荷情形下,得到了队长,虚等待时间和顾客在网中逗留时间的强逼近定理.同时还得到了队长嵌入过程的强逼近定理.