装备故障样本优化方法研究

测试性验证装备的故障样本往往相互关联,全部注入费用较高、代价较大.为了降低验证试验费用,采用适当方法对故障样本进行优化分析.为提高故障检测率,提出了一种等价样本的故障样本优化方法.方法在分析故障-测试关联矩阵及其扩展、故障模式功能等价集合和故障模式测试等价集合的基础上,构建了故障样本等价集合,并进行重要度特征分析和最大熵求解,确定了最小的故障样本集合.通过对某型试验台故障样本优化实例分析,并与传统的方法进行了试验结果对比分析,使得故障样本数量、试验费用大为减少,提高了测试性验证的经济性.     

ASP．NET网站登录中的安全性问题研究

本文介绍了网络用户身份认证技术,并在此基础之上对Forms身份认证进行了改进,并用Asp．Net技术加以实现。     

钢铁企业全厂仪表维修设施设计初探

以我国某大型钢铁企业全厂仪表维修设施的设计方案为例,简要说明了仪修设施的设计原则、全厂仪表维修的一般解决方案,较详细地介绍了仪修设施专业划分、实验室及维修车间的设置和主要设备构成,为该类项目的设计和工程建设提供一定参考。     

Toward a programming theory for rational agents

An important problem in agent verification is a lack of proper understanding of the relation between agent programs on the one hand and agent logics on the other. Understanding this relation would help to establish that an agent programming language is both conceptually well-founded and well-behaved, as well as yield a way to reason about agent programs by means of agent logics. As a step toward bridging this gap, we study several issues that need to be resolved in order to establish a precise mathematical relation between a modal agent logic and an agent programming language specified by means of an operational semantics. In this paper, we present an agent programming theory that provides both an agent programming language as well as a corresponding agent verification logic to verify agent programs. The theory is developed in stages to show, first, how a modal semantics can be grounded in a state-based semantics, and, second, how denotational semantics can be used to define the mathematical relation connecting the logic and agent programming language. Additionally, it is shown how to integrate declarative goals and add precompiled plans to the programming theory. In particular, we discuss the use of the concept of higher-order goals in our theory. Other issues such as a complete axiomatization and the complexity of decision procedures for the verification logic are not the focus of this paper and remain for future investigation. Part of this research was carried out while the first author was affiliated with the Nijmegen Institute for Cognition and Information, Radboud University Nijmegen.     

基于签名鉴别的网络身份认证模型

计算机网络安全问题已经越来越受到人们的重视,而整个网络安全体系又是以有效的身份认证为基础。分析了传统的身份认证技术的缺点,对签名鉴别进行了概述,详细阐述了基于签名鉴别的身份认证技术的基本原理和基本流程,并根据签名鉴别的基本原理,把签名鉴别技术应用到网络身份认证领域,并详细介绍了基于签名鉴别的网络身份认证系统的体系结构和认证原理。     

基于虚拟仪器的数据采集板卡校准技术研究

针对功能的多样性、精度与集成度的提高以及校准软件的缺乏等造成板卡校准工作不能正确展开的问题,以4款板卡的校准为例,探讨了板卡校准的步骤和校准的软硬件需求.在分析仪器控制技术、校准流程和校准任务的基础上,提出了“校准引擎+校准数据库+校准插件”的新校准软件开发架构,并介绍了其组成和实现中采用的关键技术.此校准软件已成功应用到工程中,为板卡校准工作提供了有效的技术手段.     

Enzymatic competition: Modeling and verification with timed hybrid petri nets

The formalism of hybrid functional petri nets (HFPN) has proved its convenience for simulating biological systems. The drawback of the noticeable expressiveness of HFPN is the difficulty to perform formal verifications of dynamical properties. In this article, we propose a model-checking procedure for timed hybrid petri nets (THPN), a sub-class of HFPN. This procedure is based on the translation of the THPN model and of the studied property into real-time automata. It is applied to model enzymatic competitions existing in amphibian metamorphosis.     

Mechanising a formal model of flash memory

We present second steps in the construction of formal models of NAND flash memory, based on a recently emerged open standard for such devices. The model is intended as a key part of a pilot project to develop a verified file store system based on flash memory. The project was proposed by Joshi and Holzmann as a contribution to the Grand Challenge in Verified Software, and involves constructing a highly assured flash file store for use in space-flight missions. The model is at a level of abstraction that captures the internal architecture of NAND flash devices. In this paper, we focus on mechanising the state model and its initialisation operation, where most of the conceptual complexity resides.