基于游程统计的含噪图像分割效果评价方法

含噪图像的分割效果与其干扰噪声强度有着紧密的联系。为了对含噪图像的分割效果进行量化计算和分析,首先定义了一个评价含噪图像分割结果的差异函数,该函数值反映了含噪图像的分割结果和原始图像的分割结果之间的差异程度。同时,根据序列随机性检验方法中的游程测试方法,给出了一种针对含噪图像分割效果评价的方法,该方法基于分割图像的二值化灰度矩阵游程统计量,定义了评价图像分割效果的游程函数,在对含噪图像的分割效果进行评价时,可以计算分割图像的游程函数来进行量化比较。对含噪灰度图像的分割结果与相应的差异函数和游程函数之间的关系进行了实验分析,结果表明,差异函数和游程函数不仅表达简单、计算便捷,而且能够准确反映出含噪图像的干扰噪声强度和分割的结果图像之间的变化关系。     

改进的LCS方法在测试脚本序列比对中的应用

在自动化测试中,需要对录制和回放过程中的请求序列进行解析和比对,帮助用户进行脚本的修正和完善。为了实现请求序列的比对,采用最长公共子序列(LCS)算法对录制和回放的序列进行比较,其核心思想是把序列对比转化成图论问题,通过二维矩阵寻路来找到最优的匹配方式。文中对算法的原理和实现做了详细描述,并对算法的性能进行测试和分析,最后将算法应用到软件脚本修改器中,验证算法在自动化测试实际应用中的效果。结果表明,LCS算法可以高效地对序列进行解析和比对,提高了自动化测试的效率。     

High level synthesis for loop-based BIST

Area and test time are two major overheads encountered during data path high level synthesis for BIST.This paper presents an approach to behavioral synthesis for loop-based BIST.y taking into account the requirements of the BIST scheme during behavioral synthesis processes,an area optimal BIST solution can be obtained.This approach is based on the use of test resources reusability that results in a fewer number of registers being modified to be test registers.This is achieved by incorporating self-testability constraints during register assignment operations.Experimental results on benchmarks are presented to demonstrate the effectiveness of the approach.     

一种动态多目标决策模型及其应用

针对一类动态多指标决策问题。提出一种多目标多阶段动态决策模型。根据所提出的效用函数,将决策矩阵归一化到相应的效用矩阵。该效用函数以指标的平均值为参数考点,突出了“奖优罚劣”原则,提高了分辨精度。最后提出一种动态决策目标函数,并通过对５城市３年综合经济效益的评估实例,表明此方法是合理可行的。     

并行计算通信库测试方法研究及实践

并行计算通信库的测试在并行计算系统中起着重要的作用.对通信库的测试一般都是通过设计一些测试程序对库的各个或几个部分分别进行单独隔离测试.但是有许多库中的错误用这种隔离测试方法测不出来,只有当库的多个部分以某种复杂的、有机的方式组合运行时才会暴露出来.而这种复杂的、有机的组合方式,从设计库的测试角度看很难形成.提出两种新的测试方法,根据通信库结构的分层特性,利用可移植的上层库的测试程序来测试下层库.上层库的测试程序也可看做是下层库的应用程序,但与一般的下层库应用程序不同,它几乎覆盖了下层库的各个部分,且有机地将它们组合起来,运行时形成某种复杂的形态,而仅用下层库的测试程序往往达不到这种形态.这样,逃过下层库测试程序的错误就可能暴露出来.     

军用自动测试设备的发展现状

测试是保证现代装备系统实际性能指标的重要手段。军用自动测试设备是军用电子武器、现代化指挥系统安全运行和准确操作所必需的重要设备。本文介绍了军用自动测试设备的发展现状及在性能测试中广泛使用的ＶＸＩ总线技术。     

Necessary and sufficient conditions for global optimality of eigenvalue optimization problems

The necessary and sufficient conditions for global optimality are derived for an eigenvalue optimization problem. We consider the generalized eigenvalue problem where real symmetric matrices on both sides are linear functions of design variables. In this case, a minimization problem with eigenvalue constraints can be formulated as Semi-Definite Programming (SDP). From the Karush-Kuhn-Tucker conditions of SDP, the necessary and sufficient conditions are derived for arbitrary multiplicity of the lowest eigenvalues for the case where important lower bound constraints are considered for the design variables. Received May 18, 2000     

Timing-sequence testing of parallel programs

Testing of parallel programs involves two parts-testing of control flow within the processes and testing of timing-sequence.This paper focuses on the latter,particularly on the timing-sequence of message-passing paradigms.Firstly the coarse-grained SYN-sequence model is built up to describe the execution of distributed programs.All of the topics discussed in this paper are based on it .The most direct way to test a program is to run it.A fault-free parallel program should be of both correct computing results and propoer SYN-sequence.In order to analyze the validity of observed SYN-sequence,this paper presents the formal specification (Backus Normal Form) of the valid SYN-sequence.Till now there is little work about the testing coverage for distributed programs.Calculating the number of the valid SYN-sequences is the key to coverage problem,while the number of the valid SYN-sequences is terribly large and it is very hard to obtain the combination law among SYN-events.In order to resolve this problem,this paper proposes an efficient testing strategy-atomic SYN-event testing,which is to linearize the SYN-sequence (making it only consist of serial atomic SYN-events)first and then test each atomic SYN-event independently.This paper particularly provides the calculating formula about the number of the valid SYN-sequences for tree-topology atomic SYN-event(broadcast and combine),Furthermore,the number of valid SYN-sequences also,to some degree,mirrors the testability of parallel programs.Taking tree-topology atomic SYN-event as an example,this paper demonstrates the testability and communication speed of the tree-topology atomic SYN-event under different numbers of branches in order to achieve a more satisfactory tradeoff between testability and communication efficiency.     

Windows无纸化考试系统中题库组织的一种方法

基于实践,介绍一种基于Windows平台,无纸化考试系统中有效组织题库进行计算机基础知识及操作测试的方法,它是计算机辅助测试中的一项重要技术。     

基于Web的考试系统的开发

以工程制图课程为例,对以图形为主的考试系统的开发进行了探讨,并实现了基于Web的具有交互功能的小型网络考试系统。