两种基于分离／匹配机制的普适计算编程模型比较与研究  

Comparison and Research of Programming Model Based on Separating/Matching Mechanism for Pervasive Computing

作　　者：李明[1,2] 齐勇[1] 侯迪[1] 郗旻[1] 

机构地区：[1]西安交通大学电子与信息工程学院,西安710049 [2]西安理工大学信息管理系,西安710054

出　　处：《计算机科学》2008年第11期248-250,266,共4页Computer Science

基　　金：国家863计划基金资助项目(2006AA01Z101);西安理工大学校科学研究计划资助项目(107-210509)

摘　　要：普适计算的环境是高度动态的,资源种类丰富,设备交互复杂,而基于封闭环境的传统的编程模型已不能适应这种变化。因此,基于普适计算环境的编程模型已成为软件工程领域重要的研究内容之一。就目前两种基于分离/匹配机制的普适计算编程模型---基于本体及操作符的编程模型(Olympus)及基于XML及动态代码嵌入的编程模型(COP(Context-Oriented Programming))进行比较与研究,分析了两者的共性及各自的特点、优势及局限性,并对今后的研究进行展望。The environments in pervasive computing are highly dynamic. The resources in these environments are rich and interoperability of equipments is very complicated. Traditional programming models based on closed environments cannot adapt to these changes. Therefore, programming model for pervasive computing has become essential in software engineering. Compared the two programming models based on separating/matching mechanism for pervasive compu- ting Olympus which is based on ontology and operators and COP （Context-Oriented Programming） which is based on XML and embedding dynamic codes. Analyzed the advantages and limitations of the two programming models and proposed the future works of this field.

关 键 词：普适计算 编程模型 分离/匹配 OLYMPUS COP 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论] TP301[自动化与计算机技术—计算机科学与技术]