atlexamp

说明：  vb调用MATLAB的程序说明,非常好用(vb call the MATLAB program that is very easy to use)

文字转换，可用于繁体字和简体字之间的转换()

C＋＋与MATLAB接口的实例 对于学习C++和MATLAB 很有帮助 请珍惜(C and MATLAB interface examples for learning C++ And MATLAB helpful please Value)

Simple application that illustrates how the Control Panel functions

说明：  演化算法的使用分析，从效率上，从收敛速度上都做了仔细的分析(The use of evolutionary algorithms analysis of efficiency, from the convergence rate has done a careful analysis of)

EMD算法，经验模态分解，信号处理与分析方面用到，算法很简单，中文(EMD algorithm, the empirical mode decomposition, signal processing and analysis used, the algorithm is very simple, Chinese)

针对信号自适应chirplet分解未知参数多、实现起来比较困难的特点，文献[1]提出了一种新的chirplet分解快速算法。该算法利用计算信号的二次相位函数，得到其能量分布集中于于信号的调频率曲线上的结论，此时通过谱峰检测可同时获得chirplet调频率、时间中心和幅度的估计；然后通过解线性调频技术获得其初始频率和宽度的估计，仿真结果验证了本文算法的有效性。 (For the signal adaptive the chirplet decomposition of unknown parameters to achieve difficult to literature [1] proposed a new fast algorithm for chirplet decomposition. The algorithm makes use of the secondary phase of the calculated signal function, the conclusion focused on energy distribution curve to tune the frequency of the signal by the peak detection chirplet tune frequency, time center and amplitude estimates then by solving chirp technology to obtain the initial frequency and width is estimated that the simulation results demonstrate the effectiveness of the proposed algorithm.)

这是我从一本书上看着例子编的源程序，很好的对学习很有帮助(This is what I look at an example of a book compiled on the source, very good very helpful for learning)

二进制转换十六进制的小程序，在控制台程序下编译成功，开发环境Visual studio 2013(Sixteen hexadecimal conversion binary)

⑴.设计游乐平面图，所含景点不少于10个。以图中顶点表示游乐园各景点，存放景点名称、代号、等信息；以边表示路径，存放路径长度等相关信息。 ⑵．为游人提供图中任意景点的问路查询，及查询任意两个景点之间的一条最短的简单路径。 (⑴. Designed to play plan, contained less than 10 scenic spots. To graph vertices, said the amusement park attractions, attractions store names, codes, and other information to edges, said path, the path length of storage of information. ⑵. To provide the figure for the visitors ask for directions any spots, queries, and query any two attractions of a shortest simple path.)