AES软件实现

资源描述 实现银行家算法,C++实现，主要内容是模拟实现动态资源分配。同时编写和调试一个系统动态资源的简单模拟程序，观察死锁产生的条件，并使用适当的算法，有效的防止和避免死锁的发生。

采用了基本的蚁群算法来求解0-1背包问题，该算法不仅可以对0-1背包问题进行求解，还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimensional knapsack problem can be solved.

矩阵的各种算法-matrix algorithms

资源描述世界上最著名的多旋翼姿态滤波算法，包含源代码和PDF原理说明、使用说明

Visual C++数字图像模式识别典型案例详解,这是里面的全部代码，内容丰富，含有模式识别领域的各种算法

Displays a rotatable and scaleable wire frame of any 3D mathematical function. This can be made up from the normal VB maths plus inverse and hyperbolic functions. Functions can be created and saved as wanted. Image vertices can also be saved for use elsewhere. The MS ScriptControl Eval function simplifies calculations enormously and its use is demonstrated. Also shown are MoveToEx, LineTo which are much faster than the VB equivalents and very easy to use. Included are a set of string handling subroutines such as count characters, squeeze out spaces, replace sub-strings etc. Commented throughout including the 3D maths and perspective methods. All the files are visible and the program is written for an 800x600 screen.

应用背景《Visual C++实用图像处理专业教程》源代码给相关领域研究人员提供了很大的便利，将图像处理的常用基本算法全部通过C++编写出来，使得广大研究人员不必在浪费多余的时间与精力，实现更高效的开发研究工作。希望能对大家有所帮助。关键技术《Visual C++实用图像处理专业教程》源代码涵盖了图像处理的各个基础方面，每个基础算法都详细列出，亲测无误。这套源码本身就可以作为图像处理与机器视觉方面软件开发的良好基础，当然也可以选其中部分代码用于自己的研究与学习。

/*

应用背景心电图一个简单的心电移动软件对安卓平台特征用户管理健康数据管理实时心电数据可视化如何使用在您的设备上启用蓝牙功能b）发现心电图数据源和连接它按一次点击开始实时心电数据的可视化作者faywong & lt；philip584521 @ Gmail。COM & gt；版权所有关键技术心电图机的原型为远程新生儿监测和干预项目。依赖Python 2.7Arduino >；= 1.5.6-r2（Arduino由于）流图（来源包括，但streamplot依赖的需要得到满足）-https://github.com/s-gv/stream-plotMATLAB／倍频程如果你想运行模拟TI SmartRF Flash程序员IAR 8051 & gt；= 8.30（如果你想重新编译源代码的CC2540）钛ccdebugger（编程CC2540）如何使用

约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.