虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

in-<b>memory</b>

  • mp3设计程序资料

    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

    标签: mp3 设计程序

    上传时间: 2015-04-13

    上传用户:小码农lz

  • 十部经典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE C

    十部经典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE CHAPTER 1: INTRODUCTION CHAPTER 2: ARRAYS CHAPTER 3: STACKS AND QUEUES CHAPTER 4: LINKED LISTS CHAPTER 5: TREES CHAPTER 6: GRAPHS CHAPTER 7: INTERNAL SORTING CHAPTER 8: EXTERNAL SORTING CHAPTER 9: SYMBOL TABLES CHAPTER 10: FILES APPENDIX A: SPARKS APPENDIX B: ETHICAL CODE IN INFORMATION PROCESSING APPENDIX C: ALGORITHM INDEX BY CHAPTER

    标签: Fundamentals Structures Horowitz PREFACE

    上传时间: 2015-05-19

    上传用户:维子哥哥

  • Features • Compatible with MCS-51® Products • 8K Bytes of In-System Programmable (ISP

    Features • Compatible with MCS-51® Products • 8K Bytes of In-System Programmable (ISP) Flash Memory – Endurance: 1000 Write/Erase Cycles • 4.0V to 5.5V Operating Range • Fully Static Operation: 0 Hz to 33 MHz • Three-level Program Memory Lock • 256 x 8-bit Internal RAM • 32 Programmable I/O Lines • Three 16-bit Timer/Counters • Eight Interrupt Sources • Full Duplex UART Serial Channel • Low-power Idle and Power-down Modes • Interrupt Recovery from Power-down Mode • Watchdog Timer • Dual Data Pointer • Power-off Flag

    标签: 8226 Programmable Compatible In-System

    上传时间: 2015-06-27

    上传用户:dianxin61

  • Wavelets have widely been used in many signal and image processing applications. In this paper, a ne

    Wavelets have widely been used in many signal and image processing applications. In this paper, a new serial-parallel architecture for wavelet-based image compression is introduced. It is based on a 4-tap wavelet transform, which is realised using some FIFO memory modules implementing a pixel-level pipeline architecture to compress and decompress images. The real filter calculation over 4 · 4 window blocks is done using a tree of carry save adders to ensure the high speed processing required for many applications. The details of implementing both compressor and decompressor sub-systems are given. The primarily analysis reveals that the proposed architecture, implemented using current VLSI technologies, can process a video stream in real time.

    标签: applications processing Wavelets widely

    上传时间: 2014-01-22

    上传用户:hongmo

  • 加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an

    加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds]

    标签: Cryptographic Primitives generate Library

    上传时间: 2015-07-16

    上传用户:wqxstar

  • The book "The Finite Difference Time Domain for Electromagnetics" by Karl Kunz and Raymond Luebbers,

    The book "The Finite Difference Time Domain for Electromagnetics" by Karl Kunz and Raymond Luebbers, CRC Press, 1993, contains an FDTD code and output files in Appendix B. The same code and output files are contained in this directory.

    标签: Electromagnetics Difference The Luebbers

    上传时间: 2013-12-29

    上传用户:chongcongying

  • C-Talk is interpreted scripting language with C-like syntax and dynamic type checking. Variables in

    C-Talk is interpreted scripting language with C-like syntax and dynamic type checking. Variables in C-Talk have no type. So there is no compile time type checking in C-Talk, all checking is performed at runtime. To preserve reference integrity, explicit memory deallocation is prohibited in C-Talk, unused objects are automatically deallocated by garbage collector.

    标签: interpreted Variables scripting checking

    上传时间: 2015-08-18

    上传用户:王者A

  • /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F

    /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */

    标签: APPROXIMATE ALGORITHM THE SOLUTION

    上传时间: 2015-08-20

    上传用户:zhangliming420

  • This section contains a brief introduction to the C language. It is intended as a tutorial on the la

    This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr

    标签: introduction the contains intended

    上传时间: 2013-12-23

    上传用户:liansi

  • Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

    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