gabor_Sample

高级语言程序设计 I 课程实验报告.doc 实验题目:建立简单的应用程序 (Advanced Language Program Design I course experiment on the experiment title: building a simple application)

是关于通信系统中直接序列扩频技术的matlab程序实现(Communication systems on the direct sequence spread spectrum technology matlab program)

C++ 与 MATLAB 混合编程的pdf英文课件 实现图像的Median filter(a step by step guide on how to realize image median filtering with integrated C++ and MATLAB ,tutorial only,no sample code available)

在二维空间里有两个点A=(X1，Y1)和B=(X2，Y2)，如果X1>X2并且Y1>Y2 ，我们认为A优于B，A是这个集合的最大极值点，在给定的二维空间里的N个点的集合S中，找出最大极值点。(In two-dimensional space, there are two points = A = (X1, Y1) and B (X2, Y2), if the X1 and Y1 > X2 > Y2, we think that A is superior to B, A is the biggest extreme value point of the set, in A given set of N points in the two-dimensional space S, find out the most extreme value point.)

说明：  Randon data from program

直接序列扩频的matlab程程序源码，希望有用 (Direct Sequence Spread Spectrum Matlab process program source code, I hope useful)

关于恶意代码检测和LTE网络，4G的LTE-A网络的外语文章(Foreign-language article about malicious code detection and lte network, lte-a network of 4g)

说明：  用C写的很好用的EQ均衡器，可以输出个音频端的值(eq)

说明：  协同过滤算法matlab代码,算法本身挺简单的，建议你自己试着编一下(Collaborative filtering algorithm matlab code )

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )