资源列表
demb
- 差分进化算法，用于优化计算，根据自己的情况进行编辑(Differential evolution algorithm)
myrbm2batch1epoch
- 通过解读RBM算法，利用代码理解RBM算法。(Through the interpretation of RBM algorithm, using code to understand RBM algorithm.)
FaceRecognition
- 基于主成分分析的人脸识别，应用K-L变换作特征处理(Face recognition based PCA)
QueuingTheory
- 通过修改单位时间到达量\lambda，服务窗口数r，服务效率\mu等排队论经典参数，观察在不同参数下的等待时间与窗口使用效率(By modifying the classical parameters of queuing theory, such as modifying the arrival time of unit time \lambda, the number of service windows r, and the service efficiency \mu, we obser
test2
- 利用堆栈的形式对Huffman编码算法进行编程，编码过程还是比较高效的(Huffman encoding algorithm using the form of the stack programming, the encoding process is more efficient)
VoiceProcess
- 通过激励信号与合成滤波器，获得重建信号，生成语音变速滤波器与语音变调滤波器，得到变速变调音频。(Through the excitation signal and the synthetic filter, the reconstruction signal is obtained, the voice transmission filter and the voice modulation filter are generated, and the variable tone audio is
道路仿真
- Through simulation, we can take the real city traffic road as the basic, combine the three-dimensional virtual simulation effect of the traffic facilities such as streets, greening, vehicles and so on, so that users can immerse in the virtual city tr
LMS-Simulation
- 通过LMS算法建立自适应滤波器，实现语音信号降噪处理(An adaptive filter is established by LMS algorithm to reduce the noise of speech signal)
SpectrumEstimation.m
- 通过经典周期图法，平均周期图法，MUSIC法等三种方法，进行信号能量谱估计(Three methods, such as the classical periodic graph method, the average periodic graph method and the MUSIC method, are used to estimate the energy spectrum of the signal.)
3115005002-蔡梓烽
- A*算法路径搜索，一字棋盘的模拟，决策树分类算法(Path search of A* algorithm)
源代码及数据
- 随着高校不断扩招，数字化校园的不断推进，应用信息化高效的分配和管理宿舍是非常有意义的。本作品创新性地引入了“种子选手”，并基于贪心算法设计出宿舍分配方案。用Python的GUI设计可视化界面，最终形成了宿舍分配系统。(With the continuous expansion of colleges and universities and the continuous promotion of digital campus, it is very meaningful to distribut
Latitude and longitude calculation distance
- 已知经纬度计算两点之间的距离 并筛选出所有距离中的最短距离(use the longitude and latitude to calculate the distance between two points and find the shortest distance from all distances.)