gs

This the free version of my Basis of AI Backprop designed to accompany my not yet published textbook, _The Basis of AI_. This program contains enough features for students in an ordinary AI or Neural Networking course. It includes the quickprop and delta-bar-delta algorithms for faster training and a fast integer version for machines without floating point hardware. This particular package includes C source for DOS and UNIX, examples, an ASCII manual and a number of DOS binaries. The binaries are for systems with floating point hardware (bp.exe), one for systems without floating point hardware (bp486sx.exe) and an integer version binary (ibp486sx.exe) for systems without floating point hardware.

简要概述了最具代表性的分形结构--扩散限制凝聚(Diffusion-Limited-Aggregation,DLA)模型的生长规则、主要性质,给出了模型模拟分形生长的算法,在MATLAB6.5平台上进行了程序设计,在Windows98/2000/XP下实现了DLA模型模拟生长的动态过程.(Briefly summarizes the most representative of the fractal structure- diffusion-limited condensed (Diffusion- Limited- Aggregation, DLA) model of growth rules, the main properties, gives the model simulation processes-fractal growth algorithm, by MATLAB6.5 platform for software design, in Windows 98/2000/XP realize DLA model to simulate the growth of dynamic process.)

建立Linked List，实现插入，删除，查找等功能(Linked List )

Elementary graphics editing.Sources MFC application that was created in VIsual C ++. Run the program and draw the strip.

就是一件小小的源码，关于matlab的 (something)

关于LDPC的。是Mackcy网站上的LDPC编译码程序。(On the LDPC. Mackcy site is LDPC coding and decoding procedures.)

windows图像编程处理类库，用于实现各种图像处理功能(programming windows image processing library, used to achieve a variety of image processing functions)

介绍有关H.248的内容 相当有用 价值比较高(H。248)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

加对地支路、非标准变比、稀疏矩阵的潮流计算(Power flow calculation)