新干县蓄水工程灌溉水费征收探讨

对江西省新干县蓄水工程灌溉水费征收问题进行探讨，并提出了一些建议和对策。     

港172断块储层特征研究

港172断块是大港油田港西北斜坡上的一个含油断块，主要目的层为沙三段Ⅱ油组（Es3Ⅱ）的重力流水道砂岩。运用储层地质学理论，利用钻井、岩心分析、测井解释资料，对港172断块E53Ⅱ油组储层展布和储层物性的空间变化规律进行分析、描述，达到充分认识港172断块E53Ⅱ油组储层特征的目的。同时，结合构造研究和试油、试采流体分析数据，确定了港172断块Es3Ⅱ油组的油藏类型。该研究成果为储层地质建模和区块开发调整提供了地质依据。     

十圩港大桥反吊支架设计与施工

结合工程实例，对反吊支架体系的设计进行了介绍，从支架体系的安装、堆载预压、过程监控、支架体系的调整及拆除等环节阐述了支架体系的施工方法，并对其体系进行了验算，为类似桥梁提供了施工经验。     

Convergence of self-tuning Riccati equation with correlated noises

For the linear discrete time-invariant stochastic system with correlated noises,and with unknown model parameters and noise statistics,substituting the online consistent estimators of the model paramet...     

家居室内环境的“低碳”设计思考

目前家居装饰装修市场繁荣,人们伴随着经济实力的提升而追求居住环境的舒适性、豪华性、美观性的愿望得已实现,但设计师和客户都应理性的对待居住空间的过分装饰和纯粹的美观性,应注重营造实用、绿色低碳的家居空间环境,顺应社会发展的要求。本文通过对家居空间"低碳"设计的分析,倡导家居空间环境应健康节能、选择低碳的装饰装修设计。     

基于能量预测的传感器网络信任机制研究

信任机制最近已建议作为一个无线传感器网络(WSNs)有效的安全机制.文中提出了一种信任机制(EPTM),该机制不仅可以防止被入侵的节点或者恶意节点选举为簇头,而且还设计出一种新型副簇头节点来监察簇头以防止他们的恶意行为.特别介绍了一种基于能量预测的方法来检测拒绝服务攻击(DoS)的节点,选出值得信赖的簇.最后通过仿真验证了机制的可行性,结果表明:EPTM可以有效防御拒绝服务(DoS)攻击.     

RFID数据流过滤算法研究

RFID在实时识别、定位、跟踪以及物理对象监控等方面有着广泛的应用前景.为了实现上述应用的目标,RFID数据必须经过采集、过滤等处理过程.采集的原始RFID数据包括噪音数据和冗余数据,只有将这些噪音数据和冗余数据过滤后,才能应用;另外,保证正确的RFID标签数据采集顺序,对于一些应用也非常关键.针对这些问题,提出了基本噪音过滤算法和基于hashtable的有序噪音过滤算法,以及基本冗余过滤算法和基于hashtable的冗余过滤算法,并通过仿真实验验证了该方法的有效性.     

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.