mp3设计程序资料,采用c语言编写。 README file for yampp-3 source code 2001-05-27 This is the current state of the yampp-3 source code, 2001-05-27. This code is intended to run on Rev. B of the yampp-3 PCB, but can ofcourse be used on compatible systems as well. It still uses the "old" song selection system as the yampp-2. However, the disk handling routines has improved a lot and the obviosly, the new VS1001 handling has been put in. The codesize is almost at it s maximum at 1F40 bytes. A .ROM file is included if you don t have the compiler set up. For now, the documentation is in the code
上传时间: 2015-04-13
上传用户:小码农lz
Draak is a multi-language, macro compiler, meaning all syntax and code generation is defined in a single file. Draak is a single binary that is able to compile any context free language (like C, Pascal, Java) for any platform with only 1 file. Draak Compiler是一个多语言,宏编译器,可以在一个单独的文件中定义所有的语法和代码生成。Draak 是一个单独的二进制文件,可以在任意平台上只使用一个文件来编译任何上下文无关的语言(类似 C, Pascal, Java)。
标签: multi-language generation compiler defined
上传时间: 2013-12-30
上传用户:a673761058
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签: Implemented following compile command
上传时间: 2014-01-01
上传用户:lhc9102
A general technique for the recovery of signicant image features is presented. The technique is based on the mean shift algorithm, a simple nonparametric pro- cedure for estimating density gradients. Drawbacks of the current methods (including robust clustering) are avoided. Feature space of any nature can be processed, and as an example, color image segmentation is dis- cussed. The segmentation is completely autonomous, only its class is chosen by the user. Thus, the same program can produce a high quality edge image, or pro- vide, by extracting all the signicant colors, a prepro- cessor for content-based query systems. A 512 512 color image is analyzed in less than 10 seconds on a standard workstation. Gray level images are handled as color images having only the lightness coordinate
标签: technique presented features recovery
上传时间: 2015-10-14
上传用户:410805624
It can also accept a number of ftp connection (multithreaded), and with most of the commercial ftp server functions. Server supports all basic ftp orders and to provide a simple user interface management, virtual directory support. This article comes from shrimp o
标签: multithreaded connection commercial ftp
上传时间: 2013-12-17
上传用户:拔丝土豆
Universal Serial Bus (USB) is a communications architecture that gives a personal computer (PC) the ability to interconnect a variety of devices using a simple four- wire cable. The USB is actually a two-wire serial communication link that runs at either 1.5 or 12 megabits per second (mbs). USB protocols can configure devices at startup or when they are plugged in at run time. These devices are broken into various device classes. Each device class defines the common behavior and protocols for devices that serve similar functions. Some examples of USB device classes are shown in the following table
标签: communications architecture Universal computer
上传时间: 2015-12-08
上传用户:stvnash
This a small hack I wrote to bypass the "No previous installation!" error of Microchip s C18 Upgrade. Simply run C18Fake and select your C18 installation directory (create if necessary) and click Save button. A "fake" file will now be created into that directory, and this will fool the Upgrade into thinking you already have a former legit installation. After that you run the C18 Upgrade setup and select the same directory you created/selected before. Your installation will now begin installing the full C18 package.
标签: installation Microchip previous Upgrade
上传时间: 2014-01-21
上传用户:zhuyibin
TRAFFIC LIGHT CONTROLLER using C51 and RTX-51 tiny,This program is a simple Traffic Light Controller. Between start time and end time the system controls a traffic light with pedestrian self-service. Outside of this time range the yellow caution lamp is blinking.
标签: CONTROLLER TRAFFIC LIGHT using
上传时间: 2013-12-27
上传用户:123456wh
FIST可堆叠文件系统,linux文件系统修改相关的开源软件,使得对linux文件系统功能的改进很简单了 The FiST (File System Translator) system combines two methods to solve the above problems in a novel way: a set of stackable file system templates for each operating system, and a high-level language that can describe stackable file systems in a cross-platform portable fashion. Using FiST, stackable file systems need only be described once. FiST s code generation tool, fistgen, compiles a single file system description into loadable kernel modules for several operating systems (currently Solaris, Linux, and FreeBSD). The project demonstrates that with FiST, code size and development time are reduced significantly, while imposing a small performance overhead of only 1-2%. These benefits are achieved, as well as portability, without changing existing operating systems or file system.
上传时间: 2014-01-10
上传用户:xsnjzljj
Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
标签: interesting Traveling classical Salesman
上传时间: 2016-02-06
上传用户:rocwangdp