panorama

说明：  Automatic Proxy Leecher!!!!!

对于c++的课程设计，自己做的，希望对大家有所帮助(For c++ Of curriculum design, own, and I hope all of you to help)

将所提供的28条地震动的加速度幅值调整为0.2g，计算并绘制相应的平均加速度反应谱（阻尼比为5%），并以该反应谱为基础，采用振型分解反应谱法计算各楼层的地震力。(The seismic force of each floor is calculated by the mode decomposition response spectrum method.)

锅炉温度dmc控制用simulink实现，给出dmc在simulink中的block(The boiler temperature DMC control is realized by Simulink, and the block of DMC in Simulink is given.)

包含各种VISUAL C++中的查找方法和系统 功能较齐全 -VISUAL C++ includes a variety of search methods and a more complete system functionality

算符优先分析器C语言版-operator priority Analyzer C language version

说明：  MATLAB通信系统仿真历程，基于参考书《详解MATLAB/Simulink通信系统建模仿真》。都是里面的例子(matlab Communication system simulation)

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

三维b样条插值matlab代码，拟合效果较好(3-D B-spline interpolation matlab code)

Daily Information Manager