基于确定性测试图形的BIST构建方法

为降低内建自测试(Build-in Self Test,BIST)的测试功耗,提出了一种基于确定性测试图形的内建自测试构建方法:首先采用D算法生成测试所需的测试图形,然后使用粒子群算法对其进行优化,使内建自测试的功耗大幅度降低;文中最后以ISCAS'85Benchmark中的部分电路作为实验对象,并给出了测试图形优化前后的功耗数;实验结果证明该方法能够有效降低内建自测试的测试功耗,并且具有方法简单、无需额外硬件开销的特点.     

基于集对分析的保障能力薄弱环节改进模型研究

确定保障能力薄弱环节对提高部队保障能力至关重要,目前保障能力薄弱环节确定有指标评估得分法和权重法两种方法,两种方法均存在一定的片面性。针对存在的问题,提出一种基于指标裕度空间和权重的求指标薄弱度的方法查找、确定保障能力薄弱环节,并且将集对分析的思想应用到指标优化和指标裕度空间的分析求取上,使指标薄弱度更加精确。最后结合某基层一级保障单位进行实例,运用Matlab软件仿真模型,进行保障能力指标薄弱度分析,并与目前存在的两种方法对比分析,实践证明所提出的方法更适用于保障能力薄弱环节的确定。     

一种基于GTD模型和状态空间处理的运动目标超宽带散射中心提取方法

超宽带条件下散射中心的不同运动将对参数提取造成影响.基于GTD模型和状态空间处理,本文提出了一种针对运动目标的超宽带散射中心提取方法.该方法首先将超宽带条件下的目标GTD散射模型转化为状态空间方程,通过奇异值分解提取散射中心的径向距离和径向速度信息;然后由标准正交向量基降维表示散射中心在整个带宽上的类型参数信息,采用遍历方法和最小二范数准则求解出散射中心的类型参数信息;最后基于最小二乘法求解出散射中心的散射强度.文中同时给出了各参数估计的CR界.仿真结果验证了文中方法的有效性,该方法可同时提取散射中心径向距离、径向速度、散射强度和类型参数信息,从而有利于各散射中心的跟踪和整体目标的有效识别.     

基于聚类的教学资源管理系统

随着信息技术和现代教育技术的发展,教学资源管理系统在各种不同层次的院校被广泛应用,本文基于聚类算法设计并实现一套教学资源管理系统,通过聚类算法能有效提高教学资源的检索效率从而提高教学资源管理系统的总体性能。     

Enhancing encoding capacity of combinational test stimulus decompressors

While scan-based compression is widely utilized in order to alleviate the test time and data volume problems,the overall compression level is dictated not only by the chain to channel ratio but also the ratio of encodable patterns.Aggressively increasing the number of scan chains in an effort to raise the compression levels may reduce the ratio of encodable patterns,degrading the overall compression level.In this paper,we present various methods to improve the ratio of encodable patterns.These methods are b...     

Some improved results on communication between information systems

To study the communication between information systems, Wang et al. [C. Wang, C. Wu, D. Chen, Q. Hu, C. Wu, Communicating between information systems, Information Sciences 178 (2008) 3228-3239] proposed two concepts of type-1 and type-2 consistent functions. Some properties of such functions and induced relation mappings have been investigated there. In this paper, we provide an improvement of the aforementioned work by disclosing the symmetric relationship between type-1 and type-2 consistent functions. We present more properties of consistent functions and induced relation mappings and improve upon several deficient assertions in the original work. In particular, we unify and extend type-1 and type-2 consistent functions into the so-called neighborhood-consistent functions. This provides a convenient means for studying the communication between information systems based on various neighborhoods.     

An improved method for voice pathology detection by means of a HMM-based feature space transformation

This paper presents new a feature transformation technique applied to improve the screening accuracy for the automatic detection of pathological voices. The statistical transformation is based on Hidden Markov Models, obtaining a transformation and classification stage simultaneously and adjusting the parameters of the model with a criterion that minimizes the classification error. The original feature vectors are built up using classic short-term noise parameters and mel-frequency cepstral coefficients. With respect to conventional approaches found in the literature of automatic detection of pathological voices, the proposed feature space transformation technique demonstrates a significant improvement of the performance with no addition of new features to the original input space. In view of the results, it is expected that this technique could provide good results in other areas such as speaker verification and/or identification.     

营造和谐空间——浅析环境景观中公共设施的无障碍设计

环境景观中公共设施无障碍设计的目的是为了充分满足老年人、儿童以及残疾人群体在使用环境景观中公共设施的需求。在环境景观中合理设置无障碍的公共设施,是现代城市兼顾实用功能与审美功能的人性化体现。文章从环境景观中公共设施无障碍设计的现状来分析公共设施无障碍设计的思考方向。     

Summary queries for frequent itemsets mining

There are many advanced techniques that can efficiently mine frequent itemsets using a minimum-support. However, the question that remains unanswered is whether the minimum-support can really help decision makers to make decisions. In this paper, we study four summary queries for frequent itemsets mining, namely, (1) finding a support-average of itemsets, (2) finding a support-quantile of itemsets, (3) finding the number of itemsets that greater/less than the support-average, i.e., an approximated distribution of itemsets, and (4) finding the relative frequency of an itemset (compared its frequency with that of other itemsets in the same dataset). With these queries, a decision maker will know whether an itemset in question is greater/less than the support-quantile; the distribution of itemsets; and the frequentness of an itemset. Processing these summary queries is challenging, because the minimum-support constraint cannot be used to prune infrequent itemsets. In this paper, we propose several simple yet effective approximation solutions. We conduct extensive experiments for evaluating our strategy, and illustrate that the proposed approaches can well model and capture the statistical parameters (summary queries) of itemsets in a database.