智能化红外焊缝检测仪的实时信号自相关分析

详细介绍了在改进红外焊缝检测仪的过程中实时信号的一种抗干扰方法－－自相关方法。重点离自相关方法的数学模型，软件框图及设计思想，并给出了实验结果。     

Rapid calculation of the periodic steady state for electronicallyswitched, time varying power system loads

The periodic steady state of power distribution system loads is studied for electronically switched, time varying cases. Many loads of this type appear on contemporary power systems as energy saving and controllable demands. Several alternative methods of calculating the periodic steady state are discussed and a new method is proposed based on the frequency modulation property of the discrete Fourier transform. The new method is termed the gain-shift formula (GSF) because the format of the technique entails adding frequency shifted terms which represent the parameter to be calculated. An example of a triac-switched load on the distribution system is given. The main advantages of the GSF are: rapid calculation of the periodic steady state; and efficient calculation of the frequency spectrum of voltages and currents in the periodic steady state     

Steady-state weights solution to affine projection algorithm

A new expression of the weights update equation for the affine projection algorithm (APA) is proposed that improves the convergence rate of an adaptive filter,particularly for highly colored input sign...     

Stability analysis and antiwindup design of uncertain discrete-time switched linear systems subject to actuator saturation

This paper investigates the stability analysis and antiwindup design problem for a class of discrete-time switched linear systems with time-varying norm-bounded uncertainties and saturating actuators by using the switched Lyapunov function approach.Supposing that a set of linear dynamic output controllers have been designed to stabilize the switched system without considering its input saturation,we design antiwindup compensation gains in order to enlarge the domain of attraction of the closed-loop system in the presence of saturation.Then,in terms of a sector condition,the antiwindup compensation gains which aim to maximize the estimation of domain of attraction of the closed-loop system are presented by solving a convex optimization problem with linear matrix inequality(LMI)constraints.A numerical example is given to demonstrate the effectiveness of the proposed design method.     

基于嵌入式移动浏览器的QtWebkit 2.1内核研究与开发

通过对多种支持HTML5技术内核的分析,选取了Webkit内核Qtwebkit2.1。在对其进行深入分析的基础上,着重研究了它对HTML5的支持。最后选取并裁剪了基于Qtwebkit2.1内核的浏览器QtWeb,实现对MeeGo平台的移植。经实验表明,该嵌入式移动浏览器能部分支持HTML5技术规范,为以后的进一步研究奠定了良好的基础。     

SVPWM三相电压型逆变器的仿真研究

以三相电压型逆变器为基础,根据空间矢量脉宽调制（SVPWM）基本原理详细分析研究了电压矢量作用时间和扇区分配问题,以α-β坐标为基础,建立了互差π/3的x-y-z时间坐标系,提出了不同扇区矢量作用时间长短根据期望极值判断的原则。介绍了MATLAB中M文件编程的仿真方法,建立了MATLAB程序嵌入式主要功能模块,逆变器采用数字PID控制,利用Simulink对系统进行了综合仿真分析及试验,给出了仿真及实验波形,为实现SVPWM逆变器的数字控制提供参考。     

A new algorithm for fast mining frequent itemsets using N-lists

Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining tasks.In this paper,we propose a novel vertical data representation called N-list,which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent itemsets.Based on the N-list data structure,we develop an efficient mining algorithm,PrePost,for mining all frequent itemsets.Efficiency of PrePost is achieved by the following three reasons.First,N-list is compact since transactions with common prefixes share the same nodes of the PPC-tree.Second,the counting of itemsets’ supports is transformed into the intersection of N-lists and the complexity of intersecting two N-lists can be reduced to O(m + n) by an efficient strategy,where m and n are the cardinalities of the two N-lists respectively.Third,PrePost can directly find frequent itemsets without generating candidate itemsets in some cases by making use of the single path property of N-list.We have experimentally evaluated PrePost against four state-of-the-art algorithms for mining frequent itemsets on a variety of real and synthetic datasets.The experimental results show that the PrePost algorithm is the fastest in most cases.Even though the algorithm consumes more memory when the datasets are sparse,it is still the fastest one.