提出一种新的基于符号化表示的时间序列频繁子序列的挖掘算法。
This paper proposes a new algorithm for mining frequent subsequence in time series based on symbolic representation.
在此基础上，对具体域中表达的空间拓扑关系进行符号化表示，用描述逻辑的形式表达空间关系。
On this basis, the thesis put forward the symbolic expressing of the topological relationships which are in the concrete domain and use description logic to express the spatial relationships.
变量代表了一段可操作的内存，也可以认为变量是内存的符号化表示。
Variable represents a period of operational memory, the memory can also be that the variable is a symbol of that.
应用推荐