A new method for the evaluation of thermal conductivity and thermal diffusivity from transient hot strip measurements

The standard straight-line fit to data of a transient hot strip (THS) experiment to determine the thermal conductivity and thermal diffusivitya suffers from two major drawbacks: First, due to the statistical nature of the estimation procedure, there is no relation between the uncertainty of the measured value on one hand and the transport properties obtained on the other. Second, in order to account for he heat capacity of the strip and outer boundary conditions, two intervals of the plot must he rejected before analyzing it. So far, these intervals are selected arbitrarily. We now treat the THS working equation as a function of the four parameters concerned. a.U ₀ (initial voltage), andt ₀ (time delay). Chi-square fittings. following the Levenberg-Marquardt algorithm. are performed separately for several overlapping time intervals of the entire plot to find and a with minimal standard deviation. In the course of subsequent iterations an individual weighting factor is applied to each point to account for systematic errors. This procedure yields the "best" values of anda along with their individual errors. comprising the systematic and the statistical errors. Experimental results on Pyrex glass 7740 were taken to verify the new procedure.Paper presented at the Twelfth Symposium on Thermophysical Properties, June 19–24, 1994, Boulder. Colorado, U.S.A.     

Test Case Prioritization in Unit and Integration Testing: A Shuffled-Frog-Leaping Approach

Both unit and integration testing are incredibly crucial for almost any software application because each of them operates a distinct process to examine the product. Due to resource constraints, when software is subjected to modifications, the drastic increase in the count of test cases forces the testers to opt for a test optimization strategy. One such strategy is test case prioritization (TCP). Existing works have propounded various methodologies that re-order the system-level test cases intending to boost either the fault detection capabilities or the coverage efficacy at the earliest. Nonetheless, singularity in objective functions and the lack of dissimilitude among the re-ordered test sequences have degraded the cogency of their approaches. Considering such gaps and scenarios when the meteoric and continuous updations in the software make the intensive unit and integration testing process more fragile, this study has introduced a memetics-inspired methodology for TCP. The proposed structure is first embedded with diverse parameters, and then traditional steps of the shuffled-frog-leaping approach (SFLA) are followed to prioritize the test cases at unit and integration levels. On 5 standard test functions, a comparative analysis is conducted between the established algorithms and the proposed approach, where the latter enhances the coverage rate and fault detection of re-ordered test sets. Investigation results related to the mean average percentage of fault detection (APFD) confirmed that the proposed approach exceeds the memetic, basic multi-walk, PSO, and optimized multi-walk by 21.7%, 13.99%, 12.24%, and 11.51%, respectively.     

Speech intelligibility measured with shortened versions of Callsign Acquisition Test (CAT)

The Callsign Acquisition Test (CAT) is a new speech intelligibility test developed by the Human Research and Engineering Directorate of the U.S. Army Research Laboratory (ARL-HRED). CAT uses the phonetic alphabet and digit stimuli combined together to form 126 test items.

Objective

The purpose of this study was to assess the reliability of data collected with shorter versions of CAT.

Design

A total of 5 shorter versions of the original list (CAT-120, CAT-60, CAT-40, CAT-30, and CAT-24) were formed and evaluated using 19 participants. Each of the subsets of CAT was presented in pink noise at signal-to-noise ratios (SNRs) of −6 dB and −9 dB.

Results

Results showed that shortened CAT lists have the capability of providing the same predictive power as the full CAT with good test-retest reliability.

Conclusions

Under the experimental conditions of this study, any of the shorter versions of the CAT can be utilized in place of the full version to reduce testing times with no effect on predictive power.     

一类非张量积区域快速傅立叶变换算法在匡产并行机上的可扩展性测试

本文给出了一类基于六边形非张量积区域上的广义离散快速傅立叶变换算法（HFFT）以及它在国产百万亿次超级计算机（曙光5000A）上的测试运行情况．文章介绍了该算法在曙光5000A上的大规模集群测试加速比和可扩展性特性,并通过分析,说明HFFT在国产超级计算机的大规模并行环境下拥有良好的可扩展性．在使用8192个处理器核的情况下,HFFT加速比达到了277倍．我们同样对FFTw软件包进行了测试．本文的分析为解决其他科学计算程序在国产百万亿次规模集群上的可扩展性问题,提供了一些先行的参考和建议．     

基于树形解压缩器的低测试数据量方法

提出一种由异或门按照完全二叉树形状排列而成的树形向量解压缩器。该解压缩器的少数输出端需要由大部分的输入端来确定,而且该结构对其输出值的确定关系类似于扫描链中确定位的分布概率,可有效降低测试数据量。实验结果表明,对于ISCAS’89基准电路,该结构最高将测试数据量压缩了77倍。     

MF-TDMA信道分配研究

MF-TDMA因其灵活的分配策略和信道利用率在通信系统中广泛使用。由于信道资源有限性以及用户需求的多变性,使得如何将有限的信道最大的利用以便为更多的用户服务成为MF-TDMA的关键问题。针对这一问题,文章首先对MF-TDMA信道结构进行处理,将MF-TDMA的信道分配问题转为二维装箱问题。然后,针对该问题的常规算法FFA进行改进,提出了基于最小资源浪费率的FFA贪心算法（IFFA）。最后,对给出的结果进行了简单的验证。     

基于层次分析法的测试用例可复用性度量研究

对测试用例的可复用性度量进行研究,构建测试用例可复用性评估模型,通过分析转化得到易于度量的层次分析模型。通过层次分析模型构建权重比较矩阵,再进行相关属性的度量,并可进一步开展自动的测试用例可复用性度量。     

基于模型的自动化测试探索

分析测试设计的问题和挑战,结合测试设计和自动化测试的发展,提出基于模型的自动化测试基本思路和解决方案。以TD-RNC的一个特性为例,给出基于该方案的具体实现过程。     

A new test scheduling algorithm based on Networks-on-Chip as Test Access Mechanisms

Networks-on-Chip (NoCs) can be used for test data transportation during manufacturing tests. On one hand, NoC can avoid dedicated Test Access Mechanisms (TAMs), reducing long global wires, and potentially simplifying the layout. On the other hand, (a) it is not known how much wiring is saved by reusing NoCs as TAMs, (b) the impact of reuse-based approaches on test time is not clear, and (c) a computer aided test tool must be able to support different types of NoC designs. This paper presents a test environment where the designer can quickly evaluate wiring and test time for different test architectures. Moreover, this paper presents a new test scheduling algorithm for NoC TAMs which does not require any NoC timing detail and it can easily model NoCs of different topologies. The experimental results evaluate the proposed algorithm for NoC TAMs with an exiting algorithm for dedicated TAMs. The results demonstrate that, on average, 24% (up to 58%) of the total global wires can be eliminated if dedicated TAMs are not used. Considering the reduced amount of dedicated test resources with NoC TAM, the test time of NoC TAM is only, on average, 3.88% longer compared to dedicated TAMs.