QPSK调制解调算法FPGA实现代码

如何求K类均值，从给出的多维矩阵中可以求得K类动态均值，-How to order K-type mean, from the given multi-dimensional matrix can be obtained in the K-means type of dynamic,

Numerical Anaysis 8th Edition, by Burden and Faires (Pascal Source)

像素化重力 花式 Delphi 应用程序竞赛条目由 Gerben Wijnja #14 从普拉 Gajic前, About.com 指南 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

流形学习，一种数值变换的前沿技术，广泛用于数据压缩，降维等-Manifold learning, a numerical transform the forefront of technology, widely used in data compression, dimensionality reduction, etc.

MFC下实现加密算法MD5,可以对字符串跟文件进行加密.值得一看  Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All rights reserved. License to copy and use this software is granted provided that it is identified as the "RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing this software or this function. License is also granted to make and use derivative works provided that such works are identified as "derived from the RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing the derived work. RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided "as is" without express or implied warranty of any kind. These notices must be retained in any copies of any

砼非线性有限元源程序，用FORTRAN写的比较有参考价值-Concrete non-linear finite element source code, using FORTRAN to write a comparison reference value

应用背景算法有三个阶段组成，在第一个阶段生成一个最大生命周期的独立集，在第二个阶段，通过Steiner树连通生成的极大独立集，并保证选择Steiner节点来连通控制集，仍要保证尽可能的满足最大生命周期，第三个阶段，通过删除冗余的控制节点来减少cds规模。关键技术减小cds的规模，在这个阶段，我们通过将一些冗余控制节点变为被控制节点来减小cds的规模。一个控制节点v是冗余的，如果我们删除节点v之后，产生的cds仍可以控制图中所有的飞cds节点，且仍是连通的。此时，节点v可以被cds中的其他节点所控制。删除冗余节点遵循某些规则，算法中有体现！

vc下实现的最优化程序代码-vc achieve the optimal code

操作系统中的同步于互斥问题一直是一个难题，相对与独木桥问题而言，中间可以过两个人而两边只可以一次过一个人的问题，要更为复杂，如何让同步程度更大去实现该算法也更为不易。

stm32驱动OV7670显示TFTili9325的程序。有详细的硬件连接说明。经测试可以完美运行，适合初学，适合修改、