Thrust estimator design based on least squares support vector regression machine

In order to realize direct thrust control instead of traditional sensor-based control for aero-engines,it is indispensable to design a thrust estimator with high accuracy,so a scheme for thrust estimator design based on the least square support vector regression machine is proposed to solve this problem. Furthermore,numerical simulations confirm the effectiveness of our presented scheme. During the process of estimator design,a wrapper criterion that can not only reduce the computational complexity but also enhance the generalization performance is proposed to select variables as input variables for estimator.     

一个面向服务的EAI框架

介绍了面向服务的框架（SOA），基于企业应用系统原有底层架构，结合Web Service和传统企业应用集成（EAI）解决方案，讨论了面向服务的EAI框架，并给出．net平台下对已有应用的Web Service封装实现。     

卷取机助卷辊咬钢控制的研究

本文介绍了宝钢2050热轧厂第二代卷取机基础自动化系统的构成。对卷取机控制的关键技术全液压助卷辊系统在带钢咬入状态的控制从控制设想，材料跟踪，位置控制，压力控制及实际应用方式等各方面进行了详细的分析并通过实际记录波形图说明了其在不同生产情况和控制模式下的控制效果。     

一种面向服务的数据集成平台

提出一种松散耦合的数据集成解决方案,将异构数据源作为服务提供者从集成系统中分离出来,采用目前较为流行的基于中介器／包装器的数据集成方法,自底向上地将数据源集成为统一的数据视图——集成处理包,并初步实现了一个原型系统。重点介绍了该系统的体系构架,以及数据集成处理包的结构设计和创建过程,最后,通过实例验证了此方案的灵活性和有效性。     

基于查询接口文本的Deep Web数据源分类

根据Deep Web数量的爆炸性增长特点,提出一种基于查询接口文本的Deep Web数据源分类算法,对于分类的查询接口,采用 2种方法：基于向量空间的TF-IDF方法和基于知网的语义相似度方法。综合2种方法获得接口之间的相似度。借鉴K-NN算法,提出WDB分类算法,从而实现Deep Web数据源的分类。实验结果表明,该算法在熵和F-measure 2种评价标准上均能获得较高质量,具有一定实用价值。     

混合式的K-匿名特征选择算法

K-匿名算法通过对数据的泛化、隐藏等手段使得数据达到K-匿名条件,在隐藏特征的同时考虑数据的隐私性与分类性能,可以视为一种特殊的特征选择方法,即K-匿名特征选择。K-匿名特征选择方法结合K-匿名与特征选择的特点使用多个评价准则选出K-匿名特征子集。过滤式K-匿名特征选择方法难以搜索到所有满足K-匿名条件的候选特征子集,不能保证得到的特征子集的分类性能最优,而封装式特征选择方法计算成本很大,因此,结合过滤式特征排序与封装式特征选择的特点,改进已有方法中的前向搜索策略,设计了一种混合式K-匿名特征选择算法,使用分类性能作为评价准则选出分类性能最好的K-匿名特征子集。在多个公开数据集上进行实验,结果表明,所提算法在分类性能上可以超过现有算法并且信息损失更小。     

基于BIST的编译码器IP核测试

介绍了用于IP核测试的内建自测试方法（BIST）和面向测试的IP核设计方法,指出基于IP核的系统芯片（SOC）的测试、验证以及相关性测试具有较大难度,传统的测试和验证方法均难以满足。以编译码器IP核为例,说明了基于BIST的编译码器IP核测试的基本实现原理和具体实现过程,通过加入测试外壳实现了对IP核的访问、隔离和控制,提高了IP核的可测性。     

Stress analysis model of strip winding system with a sleeve for a coil of thin stainless steel

In a strip winding process, the sleeve is a hollow cylinder that is mounted between a strip coil and a man-drel to maintain uniform coil shape when the strip coil is very thin, but its deformation behavior has not been investigated before.Thus, a finite element (FE) model was presented to calculate the stress distribu-tion in a sleeve and strip coil when 1-3 mm-thick stainless steel was wound around the sleeve.The FE model was developed by extending a previous model by adding a sleeve between the mandrel and strip, and by modifying the boundary and interaction conditions.The strip winding process was divided into an initial process and a steady-state process.During the initial process, the minimum and maximum pressure re-quired on the belt wrapper to maintain coil shape by self-friction of the strip was calculated by the FE model when the belt wrapper is ejected at the end of the initial process.After the initial process, an ana-lytical model of the steady-state process was established to calculate the stress distribution and was com-pared with the FE model to validate it.The suggested analytical model took 1 1 s to give the same stress distribution that the FE model took 30 d to produce.     

基于G.709建议的子速率透明复用器的设计

文章首先介绍了ITU-T G．709建议的数字包封的复用映射结构,然后详细描述了基于该建议的子速率透明复用器的设计框图,并详细论述了其设计优点,最后给出了其在系统传输时的误码率与光信噪比的关系曲线,验证了其前向纠错功能。     

A Novel Reconfigurable Wrapper for Testing of Embedded Core-Based SOCs and its Associated Scheduling Algorithm

In this paper a mathematical formulation and an efficient solution, of the embedded core-based system-on-chip (SOC) test scheduling problem (ECTSP) is presented. The ECTSP can be stated as follows; given a chip with N _C cores each having a test T _i; where T _i takes time to execute on a test access mechanism (TAM) of width w _j, and a constraint W on the number of top-level test pins; calculate the TAM assignment vector and the schedule for each test T _i, such that the completion time of the full chip test is minimized. All existing approaches have solved the ECTSP by solving the TAM partition and scheduling problem sequentially. In this paper we present an unified approach to solve the ECTSP. We present the first report of a design of reconfigurable core wrapper which allows for a dynamic change in the width of the test access mechanism (TAM) executing a core test. An automatic procedure for the creation of DfT hardware required for reconfiguration using a graph theoretic representation of core wrappers is also presented. For the case of reconfigurable wrappers, efficient algorithms to compute the schedule are presented based upon some recent results in the field of malleable task scheduling. Cases in which the degree of reconfigurability are constrained are considered; the case when only a single core can have reconfigurable wrapper, a schedule with zero TAM idle time can be found in time O(N _C(N _C + W)lgW), and the case when only 2 different wrapper configurations are allowed can be solved in time O(N _C ³). Comparison with existing results on benchmark SOCs show that our algorithms outperform state-of-art ILP formulations not only in schedule makespan, but also significantly reduce computation time.