Design Compiler Ref Manual

c#程序设计案例教程-Case Design Guide

C_language book

在实时平台上,高斯混合模型(GMM)具有计算有效性和易于实现的优点。最大似然规则中,模型参数不 断更新,但由于爬山特征,任意的原始模型参数估计通常将导致局部最优 遗传算法(GA)适于求解复杂组合优化问 题及非线性函数优化。提出了基于说话人识别的可以解决GMM局部最优问题的GMM/GA新算法,实验结果表明, 提出的GMM/GA新算法比纯粹的GMM算法能获得更优的效果。 - In real-time platform, the Gaussian mixture model (GMM) with the calculation of the effectiveness and easy to realize benefits. Maximum likelihood rule, the model parameters are not Broken updates, but due to climbing features, any of the original model parameter estimation will usually result in local optimum genetic algorithm (GA) is suitable for solving complex combinatorial optimization question Title and non-linear function optimization. Proposed speaker recognition based on GMM can solve the problem of local optimal GMM/GA new algorithm, experimental results show that the Proposed GMM/GA new algorithm than purely GMM algorithm can get better results.

包含对现代优化算法如遗传算法，粒子群算法，蚁群算法的简介，适合初学者-Contains the modern optimization algorithm such as genetic algorithms, particle swarm optimization, ant colony algorithm profile, suitable for beginners

这是一本关于VISUAL BASIC来开发串口RS_232电子书,非常不错-This is the one on the VISUAL BASIC to develop serial RS_232 e-books, very good

一般的延时子程序，用C语言描述，请各位大哥多多指教-General delay subroutine, using C language description, please brother exhibitions

：根据航空图像压缩系统的特点和要求，选择提升小波+SPIHT算法作为系统的实现方案。 为了提高算法的执行效率，对提升小波中的边界处理问题进行了合理简化，同时对SPIHT算法的实现 进行了改进。根据系统的实时性要求，选择TI公司的TMS320C6416 DSP芯片作为系统的实现内核，并 采用优化设计对关键代码进行优化，最后给出了系统的硬件实现框图。s-: According to the Aviation image compression system characteristics and requirements, choose the lifting wavelet+ SPIHT algorithm as a system implementations. In order to improve the implementation of the algorithm efficiency, improve the boundary treatment wavelet conducted a reasonable and simplified, while SPIHT Algorithm Has been improved. According to the system s real-time requirements, choose the TI s TMS320C6416 DSP chip as a system implementation of the kernel, and Using optimal design of key code optimization Finally, the system block diagram of hardware implementation.

Game Development with ActionScript is the concise book of choice for learning how to program your own games in Flash from scratch!

c语言大全及例程源码-and routine source

图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]