智能化网络考试系统的分析与设计

论述了一个计算机基础系列课程无纸化考试系统的设计方法。无纸化考试是利用网络技术、计算机处理技术实现的电子试卷考试系统。是未来各类考试发展的必然趋势。本文对无纸化考试系统设计与实现中若干关键技术进行了探索,分析了考试系统的体系结构,并按系统功能实现的流程,给出了部分重要功能实现的算法。     

学校信息技术考试系统的设计与实现

基于Web的考试系统是考试的发展方向,是远程教育的一个重要组成部分。它采用B/S模型。本文分析了基于WEB系统的考试模型及功能,研究了考试系统实现的关键技术,并在具体系统中做了实现。     

学校信息技术考试系统的设计与实现

基于Web的考试系统是考试的发展方向,是远程教育的一个重要组成部分.它采用B/S模型.本文分析了基于WEB系统的考试模型及功能,研究了考试系统实现的关键技术,并在具体系统中做了实现.     

基于asp.net的网络考试系统的实现

本文在明确网络考试系统重要性的基础上,首先介绍了系统的实现环境,其次分析了网络考试系统的需求,并进一步研究了系统关键功能的实现.     

网络环境下的考试系统应用设计与实现

论文主要讲述了网络环境下的考试系统中的应用实现,分析了网络考试系统需要解决的问题,给出了系统功能实现的总体设计,结合实际存在问题,对考试系统中教师端、学生端以及专家决策群间实现分别加以论述,通过对实现结论的分析和测试,证实文中介绍的描述方法可行,并显示出了很好的应用前景。     

多学科通用考试系统的设计与实现

针对传统的网络考试系统不能有效防止作弊,不能多学科共用,研究开发了一套能适应多学科网络考试需求的能有效防止作弊的多学科通用考试系统,提出了划分成考试管理端、考试监控端和在线考试端三个子系统的系统方案,从题库管理、考场设置、试卷生成、考场监控、在线考试、阅卷和试卷分析等模块进行阐述。经多次考试实践验证,实现考试系统的组卷、阅卷和成绩分析的自动化;实现多科目同时考试;有效防止考生作弊。     

计算机应用基础考试系统的设计

随着学校教育信息化的发展,无纸化考试逐渐成为了学校主要的考试方式。计算机应用技术考试系统的应用,可以有效地对学生进行计算机应用能力测试,计算机应用基础考试系统的设计与实现取代了传统的笔试的考试模式。对计算机应用基础考试系统的整体需求进行了分析,通过模块化的设计方法,采用VB语言,并结合SQL Server 2003数据库管理系统进行设计,为考试系统的实现提供了解决方案。     

应用数据库技术开发课程考试质量分析系统

针对课程考试质量分析的需要,提出应用Access数据库技术开发一个考试质量分析系统。分析了考察指标的设置及系统的主要功能,论述了系统构建及其功能的实现方法。     

计算机等级考试系统若干技术的探讨

分析了当前计算机等级考试系统中存在的一些问题,提出了解决思路。如采用双C/S系统的系统架构,实现考试数据和考试管理系统的分离;基于网络化技术,实现实时考生信息统计;建立网络成绩查询系统,解决考生自助信息查询问题;采用多种形式的试题表现方法,满足不同需求。这些方法对于其他考试系统的开发和考试系统的管理都具有一定的参考价值。     

网络考试系统的设计与实现

网络考试系统是传统考试的延伸,它充分利用了数据库技术,大大简化了传统考试的过程,提高了教学活动的灵活性,是电子化教学不可缺少的一个重要环节。本文介绍和分析基于B/S模式的网络考试系统的开发与设计,实现了一个基本的网络考试系统。     

iSCSI协议一致性测试研究与实现

不同iSCSI协议实现之间能否互联互通取决于协议实现是否与iSCSI协议规范相一致。针对这个问题,研究了iSCSI协议一致性测试的测试原理和测试流程,设计了适合于iSCSI协议一致性测试的测试系统以及基于XML描述的iSCSI协议一致性测试套,给出了较为完整的iSCSI协议一致性测试例。使用该测试例对某产品的iSCSI协议实现进行一致性测试,发现了被测实现存在与协议规范不一致的地方。     

简单实用网络考试系统的快速实现

本文分析了目前主流的考试系统的模式，提出了一种简单实用的，便于各级各类学校自行快速开发实现的网络考试系统的方式，并在技术实现上进行了详细的分析。     

Test suite completeness and black box testing

Model‐based testing has been widely studied and successfully applied to generate and verify completeness of test suites. Roughly, test suite completeness guarantees that, in a deterministic setting, any nonequivalent implementation under test will always be identified. Several approaches discuss sufficient, and sometimes also necessary, conditions on specification models and test suites to be able to guarantee test suite completeness. In these studies, usually, test cases are required to be nonblocking—that is, they are required to run to completion—on both the specification and the implementation models. However, often, it is desirable to have blocking test cases, and in some situations the presence of blocking test cases cannot be circumvented. In the present work test cases are allowed to block, both in the specification and in the implementation models, and a natural variant of completeness is then studied, here called perfectness. Perfectness guarantees that noncompliance between a specification and an implementation will always be detected, even in the presence of blocking test cases. This work characterizes perfectness in isomorphisms and establishes a relationship between the classical notions of completeness and perfectness. Also, a sharp upper bound is given on the number of states in implementations, beyond which no test suite can be completed.     

Testing the completeness of specifications

A system is described that tests for the completeness of axiomatic specifications of abstract data types. For testing, the system generates a set of test cases and an implementation of the data type from the specifications. The generated implementation is such that if the specifications are not complete, the implementation is not complete, and the behavior of all of the sequences of valid operations on the data type is not defined. This implementation is tested with the generated test cases to detect the incompleteness of specifications. The system is implemented on a VAX system running Unix     

Formalization of a test experiment-II

The paper develops the approach to testing considered in [1]. A formal model of test interaction of the most general type and reduction-type conformance are proposed for which there is hardly any dependence between errors. It is shown that many known types of conformance in various interaction semantics are particular cases of this general model. The paper is devoted to the problem of dependence between errors defined by specification and to the related problem of optimization of tests. There is dependence between errors if there exists a strict subset of errors such that any nonconformal implementation (i.e., implementation that contains some error) contains an error from this subset. Accordingly, it is sufficient that the tests detect errors only from this subset. In the general model proposed, the dependence between errors may arise when one chooses, as a class of implementations under test, some strict subset of the class of all implementations. Partial interaction semantics and/or various implementation hypotheses (in particular, a safety hypothesis) precisely suggest that an implementation under test is not arbitrary but belongs to some subclass of (safe) implementations.     

面向对象软件的测试方法研究

面向对象软件测试是保证面向对象软件开发项目质量的重要手段,而测试用例设计是实施面向对象软件测试的重要方面。从软件测试的技术出发,讨论了软件测试的技术特点,如何选择合适的测试方法,如何进行测试用例设计与工具选择,结合项目说明了测试实施和阶段划分。该领域的测试理论和技术还待完善,最终目的是克服软件测试的局限性,提高软件质量。     

基于XML的OSPFv3一致性测试研究

协议测试是检测协议实现与协议说明相一致的有效手段。本文针对开放最短路径协议OSPFv3进行了一致性测试研究，分析了OSPFv2和OSPFv3的不同，给出了用XML来描述OSPFv3测试套的测试模板，并对OSPFv3协议在Linux下的实现进行了一致性测试，列举了部分测试结果，对测试结果进行了分析，发现了被测实现存在与协议说明不一致的地方。     

Implementation relations and test generation for systems with distributed interfaces

Some systems interact with their environment at physically distributed interfaces called ports and we separately observe sequences of inputs and outputs at each port. As a result we cannot reconstruct the global sequence that occurred and this reduces our ability to distinguish different systems in testing or in use. In this paper we explore notions of conformance for an input output transition system that has multiple ports, adapting the widely used ioco implementation relation to this situation. We consider two different scenarios. In the first scenario the agents at the different ports are entirely independent. Alternatively, it may be feasible for some external agent to receive information from more than one of the agents at the ports of the system, these local behaviours potentially being brought together and here we require a stronger implementation relation. We define implementation relations for these scenarios and prove that in the case of a single-port system the new implementation relations are equivalent to ioco. In addition, we define what it means for a test case to be controllable and give an algorithm that decides whether this condition holds. We give a test generation algorithm to produce sound and complete test suites. Finally, we study two implementation relations to deal with partially specified systems.