基于串空间模型的认证测试方法

串空间模型认证测试方法是定理证明安全协议分析法中最具有代表性的一类.利用串空间模型理论对Needham-Schroeder(N-S)公钥协议中中间人攻击问题进行形式化分析与设计,并对其进行证明.与原有技术相比,该方法更为形式化,协议分析人员可以很方便地进行手动分析,并且更有利于协议分析自动化工具的实现.     

CORBA~( ):一个具有自卫智能体的扩展CORBA

将自卫机制加入OOP成为AOP以提高CORBA中软件的强健性和防卫能力,在CORBA这个异构环境中,一个对象申请服务之后就需等待,如果应答迟迟不到则有可能永远等待下去,为避免这种现象的产生和蔓延,在客户和服务方的行为中加入超时机制(timeout mecha-nism)并采用利己或利他策略,使得对象可独立地根据当前环境和时间决定下一步骤,将这种在协作者失败的情况下仍能生存的对象称为自卫智能体,加入白卫智能体的CORBA称为CORBA~( ),由于智能体可在任何条件下生存,CORBA~( )可为用户提供可靠的服务,也就能实现CORBA~( )中软件构成的强健性。     

“编译技术”试题库及试卷自动生成系统的研究

本文阐述了高等工科院校计算机专业“编译技术”课程试题库建立的必要性、试题库设计的理论基础及其软件实现原理．对比了本系统与一般试题库的不同与特点     

基于虚拟仪器的异步串行通信协议的检测方法

在分析基于RS－232C标准的串行异步通信原理的基础上，讨论了利用RVO2100虚拟数字示波器检测串行异步通信协议的方法，并与传统检测方法进行了比较。     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

TCP拥塞控制分析模型

介绍了研究传输控制协议 (TCP)拥塞控制问题的各种分析模型 ,指出了研究TCP拥塞控制的主要目标 .对当前国内外的研究动态给予了讨论 ,并对当前现有模型根据其流量范围和使用的分析工具进行了分类概括 .最后概要地阐述了在端到端和在网络中进行拥塞控制的相互关系     

On the properties of solutions to the Goursat-Darboux problem with boundary and distributed controls

We consider a control system described by the Goursat-Darboux equation. The system is controlled by distributed and boundary controls. The controls are subject to the constraints given as multivalued mappings with closed, possibly nonconvex, values depending on the phase variable. Alongside the initial constraints, we consider the convexified constraints and the constraints whose values are the extreme points of the convexified constraints. We study the questions of existence of solutions and establish connections between the solutions under various constraints.     

Asymptotics in the Baum—Katz formula for random fields

In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained.     

年龄相关的非线性时变种群扩散系统最优分布控制的存在性

讨论了一类非线性时变种群扩散系统的最优分布控制问题,利用LionsJL的偏微控制理论和先验估计,证明了系统最优分布控制的存在性.所得结果可为非线性种群扩散系统中的最优控制问题的实际研究提供必要的理论基础.     

Asymptotic analysis of the effect of arrival model uncertainties in some optimal routing problems

We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.This work was supported by the National Science Foundation under Grants ECS-88-01912 and EID-92-12122 and by NASA under Contract NAG 2-595.The authors wish to thank an anonymous referee for pointing out Ref. 20, thus avoiding the need for an explicit proof of convexity of the cost function considered in the paper.