MATLAB-MingLingDaQuan

这是我自己用MATLAB编的一个扫雷小游戏,程序比较经典,希望和大家一起分享.(This is for my own use MATLAB series of the game a small mine, the procedure is classic, want to share with everyone.)

本实例为VS2005编写的ARX事务管理实例，特别是AcTransaction::getObject()和close()的使用方法，作了正确演示。(ARX transaction management example this example is written in VS2005, especially in AcTransaction:: getObject () and close () method of use, make the correct demonstration.)

一个计算机下国际象棋的功能,拥有完全的代码,由matlab编成的很多人工智能的函数,有详细的文档,直接运行chess.m文件(chess source)

移动最小二乘法求曲面谷脊线，并立体呈现 参考文献：Sparse Low-degree Implicit Surfaces with Applications to High Quality Rendering, Feature Extraction, and Smoothing(To obtain the valley ridge moving least square method, and three-dimensional rendering)

根据csdn版主VC和matlab混编的文章，写成的VC调用matlab生成的动态函数库显示图片。(vc function calls matlab s function )

设关系A是从集合X={1，2，….，n}到集合Y={1，2，…..，m}的二元关系，而关系B是从集合Y到集合Z={1，2，….，p}的二元关系，求A与B的合成关系C。(A relationship is established from the set X = (1,2, ...., N) to the collection Y = (1,2, ... .., m) of binary relations, the relationship B is from a collection of Y to the set Z = ( 1,2, ...., p) of the binary relation, find the relationship between A and B, synthesis of C.)

说明：  蒙特卡罗马尔科夫链学习相关知识，了解马尔科夫和蒙特卡罗常用方法。(Markov chain Monte Carlo to learn relevant knowledge, understanding common Markov and Monte Carlo methods.)

说明：  c自理阿婆；了解了解顾客了 快乐 噶爱国 (c self grandmother learn about customer happiness Karma patriotic)

梯度下降法是最早最简单，也是最为常用的最优化方法。梯度下降法实现简单，当目标函数是凸函数时，梯度下降法的解是全局解。一般情况下，其解不保证是全局最优解，梯度下降法的速度也未必是最快的。梯度下降法的优化思想是用当前位置负梯度方向作为搜索方向，因为该方向为当前位置的最快下降方向，所以也被称为是”最速下降法“。最速下降法越接近目标值，步长越小，前进越慢。(The gradient descent method is the earliest and most simple and most commonly used optimization method. The gradient descent method is simple to realize. When the objective function is a convex function, the solution of the gradient descent method is a global solution. In general, the solution is not guaranteed to be the global optimal solution, and the gradient descent method is not necessarily the fastest. The optimization idea of gradient descent method is to use the current position negative gradient direction as the search direction, because the direction is the fastest descending direction of the current position, so it is also called the steepest descent method. The faster the slowest descent approach is closer to the target, the smaller the step, the slower the progress.)

CPN网络，即对向传播网络，是将Kohonen特征映射网络与Grossberg基本竞争网络相结合，发挥各自特长的一种新型特征映射网络。(CPN network, the right to communication networks, Kohonen feature is the mapping of network and basic Grossberg competing networks combined play to their strong points of a new feature mapping network.)