计算两个100位大数的除法，结果保留100位小数

bpNN的Matlab实现，一个数学建模书上很好的示例，自己敲的

实数编码遗传算法求函数极大值实数编码遗传算法求函数极大值实数编码遗传算法求函数极大值实数编码遗传算法求函数极大值实数编码遗传算法求函数极大值实数编码遗传算法求函数极大值实数编码遗传算法求函数极大值实数编码遗传算法求函数极大值

应用背景This is an application-based VC prepared to read camera Face to Face Recognition and face detection software. cited in the MATLAB system function, is a very good face recognition software. The system in my school examination papers reply obtained outstanding achievements. We hope to useful关键技术这是一个应用VC++编写的基于摄像头读取人脸的人脸识别和人脸检测软件，其中引用了MATLAB的系统函数，是一个非常不错的人脸识别软件，这个系统在我校论文答辩审核中获得了优秀的成绩。希望对大家有用

LU分解法求解线性方程组的VB.NET源码.里面有详细的使用说明.-LU decomposition method for solving linear equations of VB.NET source. There are detailed instructions.

快速傅里叶变换， 频谱的泄露，混叠误差实例的matla程序。-Fast Fourier Transform: In order to reduce the number of DFT calculations of a fast algorithm.

通过图形界面上数据的输入，将进程的所需的最大资源数、已分配资源数、完成进程所需的剩余资源数数据存入数组中，再根据银行家算法要求，进行进程间的运行分配，而后显示在左侧的面板上。

对数据结构（李春葆版本）比较详细的讲解，里面还有ppt对理论比较详细的讲解，对于像对数据结构深入了解的人大有裨益。

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-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

Newton method for solution of non-linear equations in C

本程序通过两种算法对二维非稳态导热进行计算，第一种为逐点迭代求解，第二种为逐行迭代TDMA求解。大家可以根据自己的需求在No1 No2处进行切换。新人第一次发程序，求各路大神能多多指点！谢谢！