摘要
探讨了用可拓学的关联函数解决网络攻击识别的方法.根据问题域的需要以及侧距的定义,给出基于侧距的位值公式的具体形式;并在此基础上建立了有公共端点的基于侧距的关联函数;分析了最优点发生在左公共端点处的关联函数的性质;以蠕虫病毒识别为例给出了其应用,验证了结论的正确性.
Recognition of network attacks by means of dependent function of extenics is discussed.The formula of the location value is presented in view of the need of problem domain and the definition of lateral distance.The expression of dependent function based on lateral distance with common terminal endpoints is constructed.Meanwhile,the properties of the dependent function in which the optimal point occurs at the left common endpoint are analyzed.As an application of the dependent function,recognition of worm is taken to justify the function.
出处
《南通大学学报（自然科学版）》
CAS
2010年第2期9-13,共5页
Journal of Nantong University(Natural Science Edition)
基金
南通市应用研究计划项目(K2008038
K2009055)
南通大学自然科学基金项目(08Z034)
关键词
可拓学
侧距
关联函数
蠕虫识别
extenics
lateral distance
dependent function
worm recognition
