very simple nonvisual Delphi component useful for shareware program developing. It uses crypted license files containing information about exe file (size and crc), expired date and any additional information. As TArtLicense uses RSA asymmetric algorithm and TArtLicense knows only decryption key, nobody can change information inside license file.
標簽： developing nonvisual component shareware
上傳時間： 2017-04-08
上傳用戶：561596
The main MIPS processor of SMP8630 comes with a JTAG interface, allowing: access to caches and data bus (DRAM) with a bandwidth of about 200kbit/s examining the processor state whatever the execution mode (monice) connecting to monice using mdi-server and using a gdb client on the processor to step and break accurately whatever the execution mode running semi-hosted applications fl ash write tool memory testing (MT command) real-time traces: has not been built in CPU (Config3_TL=0) and only supported by MajicPLUS probes (maybe built into emulator?)
標簽： interface processor allowing access
上傳時間： 2013-12-19
上傳用戶：youke111
The purpose of this project is to explore the issues and implementation of a multiple instruction stream, single data stream processor. We are running two instruction streams on two CPUs which share an address space. The processors share a second level cache, and maintain coherence at the L1 cache with a write-invalidate policy. The L2 cache is two-way set associative, with a block size of 8 words, and a total capacity of 512 words.
標簽： implementation instruction multiple purpose
上傳時間： 2017-04-18
上傳用戶：731140412
how to add arrays * Use of const (constant) values. * Creation of vectors. * Passing vectors as function arguments. * Reading from files of unknown size (monitoring istream status). * Repetitive structures (while and for loops). * The increment operators (++). * Selection structures (if-else statements). * Use of the .size, .empty, .begin, .insert, .erase, .resize, .clear and .swap vector class member functions.
標簽： Creation constant Passing vectors
上傳時間： 2017-04-25
上傳用戶：1079836864
The following Matlab code converts a Matrix into it a diagonal and off-diagonal component and performs up to 100 iterations of the Jacobi method or until 蔚step < 1e-5
標簽： off-diagonal following and component
上傳時間： 2013-12-23
上傳用戶：風之驕子
2007年全國大學生電子設計大賽，A題音頻信號分析儀的全部源程序。 單片機為c8051f120，系統時鐘倍頻至96MHZ。 main.c是一個包含五級菜單的主函數。 FFT.C是進行fft變換，將時域信號變換成頻域信號。 flash.c是讀寫片外flash存儲器的程序,可以將分析結果保存,以備調用. z7290.c是周立功7290鍵盤芯片的驅動程序. FFT_xgjis.c是對變換后的頻譜進行分析和運算. FFT_CodeTable.c是一個正弦表,在FFT的時候調用. LCD320240.c是320*240的液晶驅動程序,液晶的控制器是SED1335. 所有的.h文件提供了子函數的定義. 本程序用KEIL3 802版本編譯通過，將所有的.C文件添加到工程中，并編譯main.c 注意兩點:1.器件選擇c8051f120. 2.在target中將時鐘設為96M.同時必須將Memory Model 改成large--XDATA.默認的是small. 因為本設計占用的資源是非常大的. Program Size: data=81.3 xdata=6811 code=43056
上傳時間： 2014-01-05
上傳用戶：manlian
This book introduces embedded systems to C and C++ programmers. Topics include testing memory devices, writing and erasing Flash memory, verifying nonvolatile memory contents, controlling on-chip peripherals, device driver design and implementation, optimizing embedded code for size and speed, and making the most of C++ without a performance penalty.
標簽： programmers introduces embedded include
上傳時間： 2013-12-21
上傳用戶：daoxiang126
matlab程序，演示了如何畫出系統時域和頻域的step相應
上傳時間： 2013-12-17
上傳用戶：66666
Login Manager V3.0(LM3.0) is an authentication system which can integrate with any existing website that meets the requirements. LM3.0 provides a gatekeeper where user must be authorized before entering the membership secured areas. Features: 1. Flexibility LM3.0 allows administrator to integrate it with the current unprotected website. This is especially useful if major changes are going to be painful. With LM3.0, you re just one step towards getting the security you needed most. 2. Speed LM3.0 uses PHP and MySQL which enables fast data transactions.
標簽： authentication 3.0 integrate existing
上傳時間： 2017-06-06
上傳用戶：hullow
迷宮算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */
上傳時間： 2013-12-27
上傳用戶：Divine
<center id="8c08g"></center>
