wen

piv测速的matlab代码的说明和解释，此为流场piv测速的开源代码的具体说明(piv Speed of matlab code, instructions and explanations, this is the velocity flow field piv specification of open source code)

通过一个简单的实例，了解matlabGUI编程，内附程序，已运行成功！(Through a simple example to understand the matlabGUI programming, containing procedures, has been running successfully!)

两个统一混沌系统同步的simulink文件可以自己改变参数(two unified synchronization Simulink documents themselves can change the parameters)

DICOM to NIfTI converter by Xiangrui Li

说明：  用数值积分算法计算hankel变换,并采用连分式逼近(Hankel transform by continued fraction)

Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。 (Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given vertex-weighted graph shortest path algorithm.)

信号数据预处理程序，包括低通滤波，带通滤波(Signal data preprocessor：including a low pass filter, band-pass filter)

fdtd _ mur boundry condition - you can use this file for any structure

Synchronous Buck Converter: This switched power supply converts a 30V DC supply into a regulated 15V DC supply. The model can be used to both size the inductance L and smoothing capacitor C, as well as to design the feedback controller. By selecting between continuous, discrete and fixed-point controllers, the impact of discretization and using limited numerical precision can be explored

NW小世界网络的构成原则为：从一个环状的规则网络开始，网络含有N个结点，每个结点向与它最近邻的K个结点连出K条边，并满足N>>K>>In(N)>>1。随后进行随机化加边，以概率p在随机选取的一对节点之间加上一条边。其中，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时，NW小世界模型本质上等同于WS小世界模型。 (NW constitutive principles of small-world networks: from the rules of a ring network, network with N nodes, each node is connected to the K node with its nearest neighbor K edges, and meet N > > K > > In (N) > > 1. Followed by randomization into the plus side, with probability p with an edge between a pair of nodes in a randomly selected. Wherein between any two different nodes at most only one edge, and each node can not have a side connected with itself. P value can be changed to achieve the transition from the nearest neighbor coupling network (p = 0) coupled to the global network (p = 1). When p is small enough and large enough N, NW small-world model is essentially the same as the WS small-world model.)