Compositional encoding for bounded model checking

Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional process algebras is, however, a highly non-trivial task. One challenge is that the number of system states for process algebra models is not statically known, whereas exploring the full state space is computationally expensive. This paper presents a compositional encoding of hierarchical processes as SAT problems and then applies state-of-the-art SAT solvers for bounded model checking. The encoding avoids exploring the full state space for complex systems so as to deal with state space explosion. We developed an automated analyzer which combines complementing model checking techniques (i.e., bounded model checking and explicit onthe-fly model checking) to validate system models against event-based temporal properties. The experiment results show the analyzer handles large systems.     

LSS: an S-Plus/R program for the accelerated failure time model to right censored data based on least-squares principle

Due to lack of proper inference procedure and software, the ordinary linear regression model is seldom used in practice for the analysis of right censored data. This paper presents an S-Plus/R program that implements a recently developed inference procedure [Z. Jin, D.Y. Lin, Z. Ying, On least-squares regression with censored data, Biometrika 93 (2006) 147-161] for the accelerated failure time model based on the least-squares principle. The program is user-friendly and yields outputs similar to S-Plus/R function 1m.     

基于Internet/Intranet的命令通道机制人人交互与协作系统模型

本文提出了一个降低网络信息传输量、提高交互与协作质量的模型.文中详细描述了模型的组成,并以三个用户节点为例说明了系统的交互与协作过程.最后给出了系统的软件结构图,并说明了各个模块所完成的功能.     

基于三层网络架构及DOM的XML系统模型

本文阐述如何在三层网络架构上运用XML以构造XML文档支持系统,提出了基于三层网络架构及DOM的XML系统的模型,该系统与传统的客户／服务器应用或是应用一般的数据传输方式如HTML等系统相比具有减少了网络流量、更有利于检索、可从多种不同的数据源集成数据、开放性、可扩充性、可重用性等一系列特点。     

基于Softbase的Web Server分析与设计

分析了Web Server的一般结构及功能特点,设计了一种基于Softbase安全数据库系统的Web Server。     

VB程序设计考核自动评阅系统中若干问题的研究

在大规模的计算机应用能力考核中,必须要实现自动阅卷,对于Visual Basic基础程序设计考核,提出了一种自动评阅的方法,详细描述了该软件的设计思想、设计目的,并对阅卷过程中影响系统健壮性的因素作了深入分析。     

∑~2全文数据库模型算法和应用

在简单介绍∑~２矩阵模型的基础上,以一个应用实例为对象,对∑２矩阵模型的建立、查询等方面进行了较为详细的讨论,提出一些可能遇到的问题和困难,并同时给出了一些解决方法和策略．     

Surface tension calculation of the Sn–Ga–In ternary alloy

Surface tensions of the Sn–Ga–In ternary alloy are calculated from the surface tensions of the Sn–Ga, Ga–In and In–Sn sub-binary systems by using geometric models (the Kohler model and the Toop model), and a general solution model (the Chou model). The calculated results are in excellent agreement with the experimental data (except for the Kohler model), assuming an experimental accuracy of ±2.5%. At the same time, the surface tensions of the Sn–Ga–In ternary alloy at 773 K and their sub-binary systems are predicted on the basis of Butler’s equation, in combination with thermodynamic data, and different model parameters β$\beta$ equal to the ratio of the coordination number in the surface phase to that in the bulk phase. Different values of β$\beta$ have almost no influence on the surface tensions. The predicted results agree with the experimental data. Therefore, the resulting iso-surface tension curves for the Sn–Ga–In ternary alloy at 773 K, especially those calculated by using the Toop model, are reasonable.     

An Algorithm for Timing Verification of Systems Constrained by Min–max Inequalities

To determine the maximum separation between events for nonrepetitive systems with max and linear constraints, there are the “iterative tightening from above” (ITA) approach and the “iterative tightening from below” (ITB) approach. Since such systems can be formulated as systems constrained by min–max inequalities, this paper gives an algorithm named MMIMaxSep for solving min–max inequalities. The algorithm is a generalization and a mathematically elegant reformulation of Yen et al.’s MaxSeparation algorithm which uses the ITB approach. Our numerical experiments indicate that MMIMaxSep is very efficient. Moreover, MMIMaxSep has a unique advantage of being able to directly handle tree-represented min–max functions, and its complexity is closely related to the complexity of computing cycle time of min–max functions.

一种基于失效检测器的快速异步系统共识算法*

异步系统下的共识问题是容错方向中的关键问题。首先分析了几种基于失效检测器的共识算法,然后考虑减少响应时间,对现有算法提出改进。改进后的算法满足异步系统下共识问题的两阶段最低限度,并且在特定条件下可以在第一阶段快速作出响应。经实验证明,改进后的算法具有更快的响应时间和较少的通信量。