matrixM

精彩FLASH源文件<动感火焰>.供大家学习参考.我们一起努力吧.(wonderful source)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

Microsoft.Visual.SourceSafe.2005简单VSS源代码管理器VSS 的全称为 Visual Source Safe 。作为 Microsoft Visual Studio 的一名成员，它主要任务就是负责项目文件的管理，几乎可以适用任何软件项目。(Microsoft.Visual.SourceSafe.2005 the simple VSS source manager VSS is called Visual Source Safe. As a member of the Microsoft Visual Studio, its primary task is to manage project files and can be applied to almost any software project.)

说明：  利用cvx解半定规划问题，得到波束成形矩阵。(The semidefinite programming problem is solved by CVX)

基于51单片机的多点测量系统完整工程，C语言编写，Keil开发环境。(A multi-Measure system base on STC89C51)

在matlab上实现基于逐点比较法的直线及圆弧插补(Point-to-Point Comparison Method of Linear and circle Interpolation)

将labview转换成为exe的的说明可供labview8用户进行参考 [UDP.rar] 的UDP通讯编程实例，可以在两台计算机之间传递数据(It is verry good)

说明：  内置麻雀搜索算法优化支持向量机的程序，还有麻雀搜索算法提出的原论文(Built in sparrow search algorithm to optimize the support vector machine program, as well as sparrow search algorithm proposed in the original paper)

此程序描述了应用CoSAMP方法的压缩传感重构程序( This procedure describes the application of compressed sensing reconstruction methods use CoSAMP program)

一个关于十六进制数组动态创建的方法，对使用者在编写通信帧的时候很有用(An array of dynamically created on hexadecimal method, the users in the preparation of the communication frame is useful when)