A/转换程序，用在8051或8031，此外还有两个小的显示的程序
上传时间： 2015-03-20
上传用户：黄华强
4. If a modified source code is distributed, the original unmodified -- source code must also be included (or a link to the Free IP web -- site). In the modified source code there must be clear -- identification of the modified version.
标签： source code distributed unmodified
上传时间： 2013-12-14
上传用户：qq1604324866
R 树， 存取方式的当中最普遍的的用长方形， 是根据区域的启发式优化围绕的长方形在各个内在结点通过运行在一张规范化的试验平台下高度变化的数据， 询问和操作众多的实验， 我们能设计合并联合的优化的R* 树区域， 各个附寄的长方形边际和交叠在目录使用我们规范化的试验床在详尽表现比较，它结果R* 树清楚地胜过现有的R 树变形Guttman’s线性和二次方R 树和R 树的格林变形，R* 树的这优势举行为不同的型询问和操作， 譬如地图覆盖物。 为两个长方形和多维点在所有实验从一个实用观点R* 树是非常有吸引力的由于以下二个原因1 它高效率地支持点和空间数据同时和2 它实施费用比那少许高级其它R 树。
标签： 树
上传时间： 2014-12-05
上传用户：cmc_68289287
Locally weighted polynomial regression LWPR is a popular instance based al gorithm for learning continuous non linear mappings For more than two or three in puts and for more than a few thousand dat apoints the computational expense of pre dictions is daunting We discuss drawbacks with previous approaches to dealing with this problem
标签： polynomial regression weighted instance
上传时间： 2013-11-28
上传用户：sunjet
A simple C program to strobe the LEDsvia Port D. The strobe rate is to be set by adjusting the voltage drop over a potentiometer that is sampled by an ADC.
上传时间： 2014-01-09
上传用户：lifangyuan12
本程序通过对研祥EVOC_PCL813高速A/D数据采集卡的驱动，采集40路模拟通道的数据，并以数据文件的形式存储在硬盘上，生成文本文件
上传时间： 2014-01-03
上传用户：guanliya
This is a program that will let you calculate roots with the Quadratic formula (including complex roots), Factorial of a number, Fibonacci series (and Pascals Triangle still under construction).
标签： Quadratic calculate including formula
上传时间： 2014-01-25
上传用户：zhuoying119
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
标签： initiated described modified slightly
上传时间： 2014-01-09
上传用户：sk5201314
In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
标签： algorithm character position either
上传时间： 2014-01-27
上传用户：wang0123456789
A
标签：
上传时间： 2013-12-22
上传用户：JIUSHICHEN
