Enterprise-Cloud-Computing_-Technology--Architect

一种基于多路径和小波变换的快速矢量量化图像收索算法(Fast Search Algorithms for Vector Quantization of Images Using Multiple Triangle Inequalities and Wavelet Transform)

parzen窗函数估计，matlab代码(parzen window function estimation, matlab codes)

说明：  结合PCA的尺度不变特征变换(SIFT)算法源代码，可用于图像目标检测和识别(Combined with PCA scale invariant feature transform (SIFT) algorithm source code, can be used for image target detection and recognition)

介绍了如何运用matlab实现mdpsk和mpsk在的仿真。(Describes how to use matlab to achieve mdpsk and mpsk in the simulation.)

用matlab编写的人工势场法路径规划算法演示程序，可以手动绘制障碍物，实现避障和对目标的跟踪，保证可以运行(Matlab prepared by the artificial potential field method of path planning algorithm demo application, you can manually draw obstacles, to realize the obstacle avoidance and target tracking, ensure that you can run)

PCNN量化，利用人眼视觉特性对图像进行量化，保持细节信息。(PCNN quantified using the human visual system to quantify the image, keeping details.)

利用高斯过程回归建立软测量模型，主程序名为OnlineStage.m,包含数据，可以直接运行，亲测可用。(Gaussian process regression soft sensor model, the main program named OnlineStage.m, contains data that can be run directly, pro-test available.)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

Library for Implementation of MNP Error Checking Protocol (Library for Implementation of MNP Error Ch ecking Protocol)

元胞自动机模拟交通状况，可以进行超车，可模拟堵车(Cellular automata simulation traffic conditions, overtaking can be simulated traffic jam)