Stoch power hedger

IDL语言编写的，利用线性插值发进行网格值插值运算，等价于从新定义数组大小。-IDL language, using linear interpolation for the value interpolation grid operator, equivalent to the new definition of array size.

HTML5射击游戏，用鼠标点击下落的物体，可射击爆炸物体，生成的游戏画质精细，动画流畅，测试时请使用火狐或Chrome浏览器，IE8以下版本不能运行本游戏。虽然游戏功能并不强大，但却用到了HTML5中基础的技巧，对你熟悉HTML5网页游戏编程有一定的帮助。

密歇根大学Ajay Raghavan博士的博士论文《基于Guided-wave的结构健康监测》(Doctoral Dissertation of Ajay Raghavan, University of Michigan, "structural health monitoring based on Guided-wave")

[输入] 图的顶点个数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

万门大学Latex课程资料，包含源码及模板。(Wanmen University Latex course materials, including source code and templates.)

DSP28335芯片TI官方提供EXINT例程(case codes about EXINT of DSP28335)

说明：  基于MountainTop数据的STAP算法仿真，该MountainTop数据可以在网上下载(Simulation of STAP algorithm based on MountainTop data, which can be downloaded online)

说明：  压缩感知算法一种，正则化正交匹配追踪(ROMP)(A kind of compressed sensing algorithm, regularized orthogonal matching pursuit (ROMP))

物质点3维显示程序，含有材料模型，能求解碰撞(3D material point method)

说明：  硬件SPI从机设计 STM32F0平台(SPI SLAVE (hardware))