zhaoqichang

human tracking 检测人像移动(Detection of human tracking Portrait mobile)

用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)

利用平面波展开法来计算完整光子晶体能带图的两个程序，比较好用(Using the plane wave expansion method to calculate the complete photonic bandgap diagram of the two programs, seem to work better)

光子晶体的能带图计算，其实质就是电磁本征值（复矢量场）的问题。利用平面波展开磁场，引入f(r)=1/eps(r)，再利用倒格矢G将f(r)展开，将两者代入光子晶体的支配方程，最后得到一个平面波展开的方法的线性方程组，最终转化为求解其特征值向量的问题。(Energy band diagram of the photonic crystal, its essence is the electromagnetic eigenvalues ​ ​ (complex vector field).The linear plane wave expansion magnetic field, the introduction of f (r) = 1/eps (r), re-use reciprocal lattice vector G will expand f (r), the two substituted into the governing equations of the photonic crystal, and finally get a plane wave expansionequations, and ultimately into solving the problem of its eigenvalues​ ​ .)

CJ-干扰对齐多用户以及单用户的代码学习(CJ- interference alignment multi-user and single user code learning)

主要功能是turbo码的viterbi译码的matlab仿真(Main function is to viterbi decoding turbo codes matlab simulation)

算术编码的matlab实现 ，便于无损压缩 (Arithmetic coding matlab implementation, ease of lossless compression)

naive bayesian classifier in matlab

说明：  特征法数值求解传输线响应的Matlab实现程序(Numerical Solution of the characteristics of transmission line in response to the realization of Matlab procedures)

先定义允许状态S={(x,y)|x=0或3,y=0,1,2,3 x=y=1,2}, 允许决策D={(u,v)|u+v=1,2},求dk<-D(k=0,1,2,…,n),使 状态Sk<-S按照状态转移律S(k+1)=S(k)+(-1)^k*dk,由初始状态 S1=[3,3]经有限步到达状态S(n+1)=[0,0].此为求解多步决策问题( First define to allow the state S = ((x, y) | x = 0 or 3, y = 0,1,2,3 x = y = 1,2), to allow the decision-making D = ((u, v) | u+ v = 1,2), seek dk < -D (k = 0,1,2, ..., n), so that state Sk < -S state transition in accordance with law S (k+1) = S (k )+ (-1) ^ k* dk, from the initial state S1 = [3,3] by the finite-step to reach the status S (n+1) = [0,0]. This is a multi-step decision-making problem solving)