SBSdouble

MatLab Solutions: Introduction to Digital Signal Processing: A Computer Laboratory Textbook .

计算CN，即共同邻居的代码，用于链路预测，属于根据网络的局部特征进行预测(Calculating CN, i.e. common neighbors code for link prediction, according to the local characteristics of the network belonging to predict)

自适应有限元子程序，用来求解不同边界条件（第一类和第二类）的拉普拉斯方程(Adaptive finite element subroutine, used to solve different boundary conditions (first and second class) the Laplace equation)

matlab script for ofdm system

弹出式tooltips，codeproject上面一个国外人写的(Pop-up tooltips)

矩量法是求解电磁场边界值问题中一种行之有效的数值方法.它所做的工作是将积分方程化为差分方程,或将积分方程中积分化为有限求和,从而建立代数方程组,故它的主要工作量是用计算机求解代数方程组.所以,在矩量法求解代数方程组过程中,矩阵规模的大小涉及到占用内存的多少,在很大程度上影响了计算的速度.如何尽可能的减少矩阵存储量,成为加速矩量法计算的关键.此处介绍了方法(MoM is the solution of electromagnetic field boundary value problem in an effective numerical method. It is the work done by integral equations into differential equations, or integral equations into a finite sum of points, so as to establish algebraic equations Therefore, it is the main workload of the computer to solve algebraic equations. Therefore, in the moment method for solving algebraic equations, the matrix size relates to the amount of memory, to a large extent affected the speed of calculation. how to maximize the reduction of matrix storage has become accelerated MoM calculation of the key. introduce the method here)

说明：  matlab 源程序 说明见程序本身，请用写字板打开先(Matlab source described the process itself, please use the tablet to open first)

说明：  本文介绍了控制系统中的经典问题— — —倒立摆及其基本原理, 简要介绍了 Ma tlab中倒立摆控制的实现方法。由于倒立摆的研究具 有重要的工程背景,本文结合了二级倒立摆的 ma tlab仿真,实现二自 由度机器人 PD控制的 ma tlab仿真 ,取得了较好的效果。(This article describes the classic problem of the control system--- inverted pendulum and its basic principles, a brief introduction Ma tlab the inverted pendulum control method. The inverted pendulum has important engineering background, this paper combines the ma tlab double inverted pendulum simulation, to achieve two degrees of freedom robot ma tlab PD control simulation, and achieved good results.)

A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors.

生成一个好的Turbo码，并且用MAP方法进行解码( Generate a turbo code, and decode the code iteratively using MAP detectors)