jbuilders

使用高阶累积量对MPSK信号进行调制识别，借鉴了主成分分析算法（PCA），完整的基于HMM的语音识别系统。( Using high-order cumulants of MPSK signal modulation recognition, It draws on principal component analysis algorithm (PCA), Complete HMM-based speech recognition system.)

该代码用于判断一个处理器是大端模式还是小端模式(The codes are used to distinguish if a CPU is a big-endian mode or little-endian mode.)

访问Palm的Address地址簿例子。需要首先安装delphi-conduits类库。此类库已上传请自行查找。(Visit the Palm address book example of the Address. First install the required library delphi-conduits. From such a database has been your own search.)

nginx视频点播,源码资源,Source resources(Nginx video on demand, source resource, Source resources)

一个兼具有excel一样的多文档功能，同时具有word的文档编辑和格式编辑功能(One and the same with excel multiple document features, but also has word document editing and formatting editing functions)

幽城幻剑录修改器，Polaris以前玩幽城幻剑录时自编的一个修改存档文件的小软件。(Hordes Magic Sword recorded modify browser, Polaris ago Hordes magic sword play was recorded when a self-modified small software archive file.)

windows计算器，有加减乘除功能，和windows自带的计算器类似(windows calculator, a subtraction multiplication and division functions, and a similar calculator that comes with windows)

说明：  使用odbc访问sql server2000数据库(Access to sql server2000 database using odbc)

说明：  一个C#开发的线性规划 单纯形算法，能够求解中小规模的线性规划问题，欢迎大家下载，自己写的哦！！(A C# development of linear programming simplex algorithm to solve the small and medium-scale linear programming problem, welcome to download their own writing Oh! !)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)