盹儿

以太网络的拓扑发现Topology discovery of Ethernet networks PDF

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

PDF

610.53KB

2020-11-28 12:50

以太网络的拓扑发现Topology discovery of Ethernet networks

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

RAR

87.69KB

2020-06-08 18:00

patternmatcher

Thisisapatternmatcherincommonlips.Weimplementthefunctionmatchwithtwoparameters:apatternandafact.Itreturnsalistofvariable-valuebindingsifthefactsmatchthepatternswhileitgivesnilifthematchfails.ThesyntaxforfactscanbeanyvalidstructureinLisp.Also,patternscaninclude,notpredicates,

RAR

3.48KB

2019-05-07 04:52

shortestcommonsequence

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.

RAR

4.79KB

2019-01-10 12:26

快速傅里叶变换fast fourier transform

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

RAR

7.72KB

2018-12-11 05:43