再论变化电磁场中带电超微粒子的精确量子论

利用创新的SU(1 ,1 )Lie代数理论及SO(3)Lie代数理论 ,得到变化电磁场中带电超微粒子的精确量子论 ,由此进一步明确微观领域中的时空概念     

蒸发式冷凝器管束中强制对流空气CFD模拟

运用FLUENT软件对圆管、椭圆管及交变曲面波纹管管束中强制对流空气热力过程进行了模拟,模拟数据经过Tecplot.10处理后直观地表征了3种管型管束中空气的速度场、压力场及温度场。结果表明,交变曲面波纹管在提高流体湍动程度及强化传热温差方面优于其它两种管型。     

巴基斯坦高摩赞水利枢纽工程项目危机处理及合同谈判

高摩赞工程项目是水电集团公司在巴基斯坦承建的第一个综合性的水利水电枢纽工程,也是第一个EPC合同形式的项目。本文主要介绍了项目危机处理及合同谈判的过程和措施,通过长达一年的艰苦谈判,化解了项目危机,增进了中巴传统友谊,实现了良好的经济效益和社会效益,为中国水电集团公司国际化战略发展提供了可借鉴的成功案例。     

杭州市七堡水闸工程与周围环境景观的协调性设计

随着水利工程的发展,景观水利功能日益突出,工程与周围环境景观的协调性不断加强。在七堡水闸工程中,通过工程布置采用闸桥结合方案、采用集成式启闭机、启闭机控制室合理设置以及工程区域范围绿化设计等4个方面,很好地处理了水闸工程与周围环境景观的协调性。     

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.     

Multi-channel SAR imaging based on distributed compressive sensing

The rapid development of compressive sensing(CS)shows that it is possible to recover a sparse signal from very limited measurements.Synthetic aperture radar(SAR)imaging based on CS can reconstruct the target scene with a reduced number of collected samples by solving an optimization problem.For multi-channel SAR imaging based on CS,each channel requires sufficient samples for separate imaging and the total number of samples could still be large.We propose an imaging algorithm based on distributed compressive sensing(DCS)that reconstructs scenes jointly under multiple channels.Multi-channel SAR imaging based on DCS not only exploits the sparsity of the target scene,but also exploits the correlation among channels.It requires significantly fewer samples than multi-channel SAR imaging based on CS.If multiple channels offer different sampling rates,DCS joint processing can reconstruct target scenes with a much more flexible allocation of the number of measurements offered by each channel than that used in separate CS processing.     

基于游程编码思想的条码定位与识别方法

在复杂背景中的定位条码是图像式条码识别系统中的一个关键步骤,如何在复杂的背景中快速、白动地检测出条形码是该文的主要研究内容。首先介绍了条型码的编码结构,然后提出了一种基于游程编码思想的条码定位与识别方法,最后通过给出相关实验结果,验证了该算法的可行性和实用性。