Please wait a minute...
J4  2010, Vol. 44 Issue (2): 220-224    DOI: 10.3785/j.issn.1008-973X.2010.02.002
计算机技术﹑电信技术     
面向波动复杂性的上下文预测
丁春, 冯志勇
(天津大学 计算机科学与技术学院,天津 300072)
Approach for fluctuation complexity oriented context prediction
DING Chun,FENG Zhi-yong
(School of Computer Science and Technology,Tianjin University,Tianjin 300072,China)
 全文: PDF  HTML
摘要:

针对普适计算环境中上下文变化存在的复杂情况,提出面向波动复杂性的上下文预测方法,在分析上下文波动变化的影响因素的基础上,提出相似上下文序列的概念,给出了上下文序列相对距离和相似上下文序列的定义,以及相关的上下文预测推理算法和架构.通过计算上下文序列之间的相对距离,确定相似的上下文序列,根据相似的上下文序列进行上下文预测.该预测方法不仅提供了一种度量上下文序列的新方法,而且解决了传统精确匹配预测方法的局限性问题,有效地提高了普适计算中上下文预测的能力,使其具有更强的适应性和实用性.

Abstract:

A new context prediction approach was proposed to forecast fluctuation complexity oriented context aiming at complex condition of context change processes in the pervasive computing environment. Based on the analysis of the factors influencing the fluctuation complex variation of context, the context sequence relative distance and the similarity context sequence were defined, and related context prediction reasoning algorithm and framework were presented. The similarity context sequence was obtained according to the calculated relative distance between context sequences. Then the future context was predicted based on the similarity context sequence. The prediction approach provided anew measurement method for context sequences and overcomed the limitations of traditional precise matching prediction method. The context prediction capacity in the pervasive computing was effectively improved with more adaptability and practicality.

出版日期: 2010-03-09
:  TP 301  
基金资助:

国家”863”高技术研究发展计划资助项目(2007AA01Z130).

通讯作者: 冯志勇,男,教授.     E-mail: zyfeng@tju.edu.cn
作者简介: 丁春(1968—),男,北京人,博士生,从事普适计算、语义网、人工智能研究.
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章  

引用本文:

丁春, 冯志勇. 面向波动复杂性的上下文预测[J]. J4, 2010, 44(2): 220-224.

DING Chun, FENG Zhi-Yong. Approach for fluctuation complexity oriented context prediction. J4, 2010, 44(2): 220-224.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2010.02.002        http://www.zjujournals.com/eng/CN/Y2010/V44/I2/220

[1] DEY A K, ABOWD G D, SALBER D. A context-based infrastructure for smart environments[C]// Proceedings of the 1st International Workshop on Managing Interactions in Smart

Environments (MANSE). Dublin, Ireland: Springer, 1999:114-128.
[2] WEISER M. The computer for the 21st century [J]. Scientific American, 1991, 265(3):94-101.
[3] 石为人,周彬,许磊.普适计算:人本计算[J].计算机应用,2005,25(7):1479-1484.
SHI Wei-ren,ZHOU Bin,XU Lei. Pervasive computing: human-centered computing[J]. Computer Applications, 2005, 25(7):1479-1484.
[4] GELLERSEN H W, SCHMIDT A, BEIGL M. Multi-sensor context-awareness in mobile devices and smart artifacts [J]. Mobile Networks and Applications, 2002, 7(5): 341-351.
[5] PETZOLD J, BAGCI F, TRUMLER W, et al. Context prediction based on branch prediction methods[R]. Germany:Institute of Computer Science, University of Augsburg, 2003.
[6]MULVENNA M, NUGENT C, GU X, et al. Using context prediction for self-management in ubiquitous computing environments [C]//Proceedings of IEEE Consumer Communications and

Networking Conference(CCNC′06). Las Vegas, USA: [s. n.], 2006: 186-201.
[7] MAYRHOFER R, RADI H, FERSCHA A. Recognizing and predicting context by learning from user behaviour[J]. Journal of Communication Engineering,2004, 1(1):30-42.
[8] 吴健,吴朝晖,李莹,等.基于本体论和词汇语义相似度的Web服务发现[J].计算机学报.2005,28(4):595-602.
WU Jian,WU Zhao-hui,LI Ying,et al. Web service discovery based on ontology and similarity of words[J]. Chinese Journal of Computers,2005,28(4): 595-602.
[9] GANESAN P. Exploiting hierarchical domain structure to compute similarity[J]. ACM Transactions on Information System,2003,21(1): 64-93.
[10] HAN J, KAMBER M.数据挖掘概念与技术[M].北京:机械工业出版社,2007: 251-261.

[1] 徐克林, 朱伟, 李艳冰. 配装-运输集成决策模型及其遗传算法[J]. J4, 2011, 45(9): 1630-1635.
[2] 陈婧, 张树有. 基于关联调度模型的模糊环境下车间动态调度[J]. J4, 2011, 45(2): 240-246.
[3] 董利达, 程曦浩, 郑寒. 基于工作流的安全库所替换网特性研究[J]. J4, 2010, 44(9): 1711-1718.
[4] 董利达, 郑寒, 程曦浩. 一类含T-图环结构受控网显式控制器设计[J]. J4, 2010, 44(6): 1057-1066.
[5] 孟捷 ,刘华锋 ,岳茂雄 ,胡红杰. 生物力学模型导引的心肌运动与材料参数对偶估计[J]. J4, 2012, 46(5): 912-917.