shineboy2007的博客

This is a pattern matcher in common lips. We implement the function match with two parameters: a pattern and a fact. It returns a list of variable-value bindings if the facts match the patterns while it gives nil if the match fails. The syntax for facts can be any valid structure in Lisp. Also, patterns can include, not predicates, less-than predicates, and greater-than predicates staring with =! <, >, respectively. Except for the variables and predicates, the atoms for the facts and the patterns should be the same. In addition, the facts should satisfy the conditions prescribed by variables and predicates. If the predicates appear in a pattern before the corresponding variables are bound, the match will fail. Finally, the same fact can match multiple patterns using & operators. However, we don’t allow nested &. In the test.txt file we can see more examples.

加深对以太网逻辑拓扑、物理拓扑、交换机、路由器工作原理和SNMP协议的理解.本项目分为两个阶段，第一阶段为网络逻辑拓扑的发现，第二阶段为网络物理拓扑的发现。 说明文档:PDF

This shortest common supersequence problem is closely related to the longest common subsequence problem. Given two sequences X = < x1,...,xm > and Y = < y1,...,yn >, a sequence U = < u1,...,uk > is a common supersequence of X and Y if U is a supersequence of both X and Y.

FFT is a fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. This algorithm is implemented in Java

加深对以太网逻辑拓扑、物理拓扑、交换机、路由器工作原理和SNMP协议的理解.本项目分为两个阶段，第一阶段为网络逻辑拓扑的发现，第二阶段为网络物理拓扑的发现。