基于演化博弈的武器装备研制合同定价模型研究

针对合同的动态性，提出利用基于演化博弈建立定价模型。考虑到决策群体中个体的认识误差，对所建立的定价模型进行修正，建立带偏离的定价模型并分析了偏离对均衡解的影响。最后将以上模型应用实例进行比较分析。     

液态铅的电阻率

采用精确的结构因数实验数据和Ｂｅｈａｖｉ模型赝势，用Ｚｉｍａｎ理论计算了液态铅的电阻率．计算结果和实验数据符合很好．讨论了Ｚｉｍａｎ理论对液态铅的适用性以及适合于液态铅的赝势的特征．     

在三通道α-螺旋蛋白质中传递生物能量的孤子的特性

用庞小峰先生提出的生物能量传递的新理论和 Runge-Kutta数值模拟方法,研究了三通道α-螺旋蛋白质中激发的孤子的动力学特性,求出在0K和300K温度下该孤子稳定地沿蛋白质链传递.由此可见,它能担任在蛋白质分子中传递生物能量的功能.从而再次证实了新理论的可利用性.     

GDDP: Generalized Dual Dynamic Programming Theory

This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7].     

Arithmetic Hodge Structure and Nonvanishing of the Cycle Class of 0-Cycles

We construct 0-cycles on a self-product of a curve whose cycle classes are linearly independent in the extension group of arithmetic Hodge structure. This is an extended version of Theorem 4.5 of Asakura's contribution to CMR Lecture Notes Ser. 24 ((2000), pp. 133–154).     

在相干理论的基础上分析光栅成像

本文在相干理论的基础上,推导了光栅成像中的光强分布和物像位置关系,并给出一组具有不同参数的实验照片及一组借助计算机绘制的强度分布图。     

A rigid graph for every set

A graph G is called rigid if the identical mapping V(G)→V(G) is the only homomorphism G→G. In this note we give a simple construction of a rigid oriented graph on every set. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 108–110, 2002     

负电子亲和势GaAs光电阴极中的三光子激发和发射的理论研究

将三阶微扰理论应用于单晶GaAs半导体,结合与实际相接近的能带结构,得到了GaAs中三光子吸收系数的解析式表达式,在考虑了激发电子的逃逸过程的情况下,进而推导了负电子亲和势GaAs光电阴极中三光子光电发射的发射系数的解析表达式.两表达式得到的理论数值分别与用ns量级脉宽、2.06μm波长的激光测得的GaAs中三光子吸收系数和GaAs(Cs,O)光电阴极中三光子发射系数的实验值相比较,吻合较好.     

Some Recent Progress and Applications in Graph Minor Theory

In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed. Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number 16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists Supported in part by the Research Grant P1–0297 and by the CRC program On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia