Scheduling data transfers in a network and the set scheduling problem

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.     

The asymptotic behaviors of a stage-structured autonomous predator-prey system with time delay

In this paper, we consider an autonomous predator-prey Lotka-Volterra system in which individuals in the population may belong to one of two classes: the immatures and the matures, the age to maturity is represented by a time delay. By using eigenvalue analysis, principal term analyze method, reduction to absurdity, and iterative method, we obtain some simple conditions for global asymptotic stability of the unique positive equilibrium point. Moreover, a condition that the prey population in the system get extinction and the predator population in the system get permanence will be obtained. Meanwhile the theorems extend the corresponding conclusions in which there have no two stage structures.     

Cu~+、Ag~+、Au~+与乙硫醇的气相化学反应

利用激光溅射 分子束的技术 ,结合反射飞行时间质谱计 ,研究了Cu+、Ag+、Au+与乙硫醇的气相化学反应。结果显示这三种金属离子与 (CH3 CH2 SH) n 反应形成一系列团簇离子M+(CH3 CH2 SH) n,且团簇离子尺寸不一样。Ag+、Au+与乙硫醇的反应还生成了 (CH3 CH2 SH) +n ,由此推测Cu+、Ag+、Au+与乙硫醇团簇的反应存在两种通道 ,一种通道是生成M+(CH3 CH2 SH) n,另一种是生成 (CH3 CH2 SH) +n 。Cu+、Au+与乙硫醇的反应还生成了M+(H2 S) (M =Cu、Au) ,但是实验中没有观察到Ag+(H2 S) ,理论计算表明Ag+(H2 S)很不稳定。另外 ,分析产物离子M+(CH3 CH2 SH) n 的强度发现 ,n =1～ 2之间存在明显的强度突变现象     

资源有限的加权总完工时间单机排序问题

本讨论资源有限的加权总工时间单机排序问题，对现在仍为OPEN问题1｜pj=bj-ajuj，∑uj≤U｜∑wjCj给出了一个有关最优解中最优资源分配的重要性质，并利用该性质分别给出了三种情况bj=b,wj=w,aj=a；bj=b,wj=w,uj=u；aj=a,wj=w,uj=u的最优算法。     

农户信用评估系统的设计与运用研究

农户信用评估的研究对推动农村消费信用的发展，促进农村经济良好运行十分重要。本在构造农户信用评估的指标体系的基础上，提出了农户信用评估神经网络模型的算法，利用实际搜集到的农户资料进一步建立了农户信用评估模型，继而构造了农户信用评估系统，并举例说明了该系统的实际运用，以期能为农村经济发展中的农户信用评价及相关研究提供一丝基础性启发。     

多重休假的带启动--关闭期的Geom/G/1排队

本研究多重休假的带启动——关闭期的Geom／G／1离散时间排队，给出稳态队长，等待时间分布的母函数及其随机分解结果，推导出忙期的全假期的母函数，给出该模型的几个特例。     

Survivability in IP-over-WDM Networks: WDM Lightpath Protection versus IP LSP Protection

This article compares the performance of WDM lightpath protection and IP LSP protection schemes for IP-over-WDM networks. A mathematical formulation of the maximum throughput problem is presented and analytical expressions for recovery time are derived for both schemes. The throughputs and recovery times are analyzed and compared. Results show that the IP LSP protection scheme presents higher throughputs then WDM lightpath protection. The IP LSP protection scheme, providing individual IP LSP protection has, however, scalability problems. This scheme presents high recovery times when a failure affects many lightpaths and many hops are allowed for the primary routes of IP LSPs.     

Gauss-Manin connections for arrangements, III Formal connections

We study the Gauss-Manin connection for the moduli space of an arrangement of complex hyperplanes in the cohomology of a complex rank one local system. We define formal Gauss-Manin connection matrices in the Aomoto complex and prove that, for all arrangements and all local systems, these formal connection matrices specialize to Gauss-Manin connection matrices.

     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.     

BEPCII直线加速器相控系统设计研究

为了补偿由于各种因素引起的微波相位漂移,BEPCII直线加速器需要建立微波相位反馈控制系统.能量最大法将用来确定每台功率源的最佳相位.沿直线加速器速调管长廊铺设相位稳定同轴线提供相位参考.现在已经完成了关键部件,如PAD单元、IfA 单元的开发.搭建了相控最小系统对系统进行了验证.