关于矩阵的运算算法

二、问题       现只有面额为 11元、5元、1元的三种人民币。       给定一个 数目为 money 的人民币，如何用这三种面额的人民币 找开它，且用的人民币张数最少       如：给定 10元，我们可以有以下找法：             2张  5元面额             1张  5元面额  + 5 张  1元面额             10张 1元面额       我们 选择第一种找法。只用两张人民币。 三、分析  利用动态规划法可以找到最优解。         利用贪心算法可以找到最优解（问题满足贪心选择性质时。该找钱问题在 11、5、1三种面额的情况下不满足该性质）               或者找到近似 最优解（在本题设定的三种面额的情况下 便是如此）         如果现在要找开 15元钱，则      

openCV中关于通过码本检测前景的应用代码，下载openCV后，配置好环境变量，设置好项目属性（这些网上都有教程），然后运行这个cpp文件，就可以实现码本模型了。

用最小二乘法求矩形区域上的N*M个数据点的拟合曲面。-Least square method for rectangular area on the N* M data points of the fitting surface.

应用背景对stm32串口不了解的同学可以看看，串口可以用来传输数据，用来调试程序也是最好的选择。关键技术stm32串口中断发送接收，使用PC端超级终端或任何串口软件发送数据stm32自动接收返回原数据，实现串口双向通讯。

在3DIC設計中會使用的方法  Floorplanning is an important and dispensable stage in the traditional integrated circuit design process. With the raised module numbers and increased wire length, the computation complexity is raised dramatically. Obviously, the traditional algorithms need to be updated. We developed an orthogonal table, in which each factor represents a module and the level of a specified factor denotes the orientation of that module. With this orthogonal table, the solution space is significantly decreased.  We use sequence pair to represent a floorplan and the fast longest common subsequence is used accordingly to calculate the area of

设计一个O(n*n)时间的算法，找出由n个数组成的序列的最长单调递增子序列--design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.

给某个玩家100元的资本，让他不停押注直到输光，计算需要赌博多少次？ 如果把次数放在数组ruinLength[]中，进行1000次实验后，看看破产的最大次数、 最小次数和平均次数分别是多少？-100 to a player" s capital, so that he kept until the bet输光to calculate how many times the need for gambling? If the number on the array ruinLength [] in experiments carried out after 1000 to see the largest number of bankruptcy, the minimum number and the average number of how many were?

SPHysics is a platform of Smoothed Particle Hydrodynamics (SPH) codes inspired by the formulation of Monaghan (1992) developed jointly by researchers at the Johns Hopkins University (U.S.A.), the University of Vigo (Spain), the University of Manchester (U.K.) and the University of Rome La Sapienza (Italy). Developed over a number of years primarily to study free-surface flow phenomena where Eulerian methods can be difficult to apply, such as waves, impact of dam-breaks on off-shore structures.

一个RNG(相关邻近图)的生成算法,输入一些原始数据信息,得到RNG图信息.-an RNG (related neighboring) algorithm for the generation, the importation of some raw data information, to receive information RNG map.

ACM Geometry Collection-ACM Geometry Collection ACM Geometry Collection