二维码生成程序

它是关于一个命名集分区的源代码，是集分区问题中的一个acm

聚类分析的源码集，希望大家喜欢-cluster analysis of source Set hope you like

经典关联分析算法apriori java版。可解决关联分析问题，比如分析超市购物关联关系，产品交叉销售可能性，客户价值提升等

求函数极小值，适用于不带约束的、函数可以为非线性的无约束规划问题的求解-Demand function is minimum applicable to non-binding, the function can be non-binding for the non-linear programming problem solving

一个用delphi编写的关于大数计算的程序，可用于计算任何大小的数字乘积，非常小巧方便，也很适用-a prepared with the majority of the calculation procedures can be used to calculate the size of any digital product, very small convenient, and very applicable

POJ1010迷宫问题的的源码，采用了搜索+剪枝 思想：由于本题中规定只有在固定时刻到达目的点才能逃脱， 不能提早，更不能延迟，故不能用bfs。可以用dfs找出所有情况， 若有可行解，直接返回即可。本题比较郁闷的是，在tzc上将方向 数组int dir[4][2]稍微变动两下，就会超时。

用C开发的莱文森算法-the c levinson algorithm

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that lters the best out of the existing ones. Two types of transforms are considered: First the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in H.M. Ozaktas, M.A. Kutay, and G. Bozdagi. Digital computation of the fractional Fourier transform. IEEE Trans. Signal Process., 44:2141{2150, 1996. There are two implementations: one is written by A.M. Kutay the other is part of package written by J. O Neill. Secondly the discrete fractional Fourier transform algorithm described in the master thesis C . Candan. The discrete fractional Fourier transform, Bilkent Univ., 1998 and an algorithm described by S.C. Pei, M.H. Yeh, and C.C Tseng: Digital fractional Fourier transform base

项目提供makefile，利用 查表法将RGB转化为yuv420数据，可生成RGB转yuv的静态库，可直接集成到项目里面。 生成的yuv数据是以文件的形式保存，如果需要进一步的转化可直接读取该yuv文件。 接口设计简单明了，只需输入帧数据的长宽，和数据的来源接口。代码测试没问题。

psd 文件解析，有学习价值。解析psd 文件的内容，图层等相关信息，从解析的内容中可以清晰的看到psd内容的相关信息，充分理解psd的具体结构。