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

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

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

信任机制最近已建议作为一个无线传感器网络(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.     

Complexity of synthesis of composite service with correctness guarantee

How to compose existing web services automatically and to guarantee the correctness of the design (e.g. temporal constraints specified by temporal logic LTL, CTL or CTL*) is an important and challenging problem in web services. Most existing approaches use the process in conventional software development of design, verification, analysis and correction to guarantee the correctness of composite services, which makes the composition process both complex and time-consuming. In this paper, we focus on the synthesis problem of composite service; that is, for a given set of services and correctness constraint specified by CTL or CTL* formula, a composite service is automatically constructed which guarantees that the correctness is ensured. We prove that the synthesis problem for CTL and CTL* are complete for EXPTIME and 2EXPTIME, respectively. Moreover, for the case of synthesis failure, we discuss the problem of how to disable outputs of environment (i.e. users or services) reasonably to make synthesis successful, which are also proved complete for EXPTIME and 2EXPTIME for CTL and CTL*, respectively.     

贝加莱ACOPOSmulti在奇瑞6关节机器人控制系统中的应用

本文关于贝加莱ACOPOSmulti伺服系统和机器人软件库在奇瑞6关节机器人研发中的应用。介绍了机器人机械系统的组成和性能参数,重点描述了以APC820工控机和ACOPOSmuhi伺服驱动器为核心。基于EthernetPOWERLINK工业实时以太网和AutomationStudio集成软件开发平台的机器人控制系统,并讨论了通过MATLAB／Simulink的代码自动生成技术、ACOPOSmuhi驱动系统的负载惯量前馈技术等关键技术环节。     

立铣加工过程中的微元铣削力建模分析

针对单纯通过高速切削技术制造某些大型飞机零件过程中,存在难以控制的加工变形和较强表面残余拉应力分布等突出问题,以直齿和螺旋齿立铣加工过程为研究对象,基于微元切削机理,通过对刀齿铣削过程的分析,建立动态铣削加工仿真模型,导出铣削面积、铣削力、主轴扭矩、铣削功率与切削用量的关系.数值模拟结果与试验值较吻合,表明该模型可以实现动态铣削力预测,优化切削用量.     

一种相容决策表的属性值与属性约简方法

针对相容决策表,另辟一种数据约简思路,与传统数据约简方法不同的是,本文方法考虑属性值约简与属性约简之间的关联,该方法首先进行属性值约简,然后再进行属性约简,本文并给予了充分的证明,而普通的方法并没有考虑它们之间的联系,并有许多冗余的比较操作。