電話計費器程序/*信號定義： clk： 時鐘信號，本例中其頻率值為1Hz； decide： 電話局反饋回來的信號，代表話務種類，“01”表示市話，“10”表示 長話，“11”表示特話； dispmoney： 用來顯示卡內余額，其單位為角，這里假定能顯示的最大數額為50 元 （500 角）； disptime： 顯示本次通話的時長； write,read： 當write 信號下降沿到來時寫卡，當話卡插入，read 信號變高時讀卡； warn： 余額過少時的告警信號。本例中，當打市話時，余額少于3 角，打長 話時，余額少于6 角，即會產生告警信號； cut： 當告警時間過長時自動切斷通話信號。 */
上傳時間： 2014-01-15
上傳用戶：hewenzhi
Welcome to PMOS. PMOS is a set of modules, mostly written in Modula-2, to support multitasking. PMOS was designed primarily with real-time applications in mind. It is not an operating system in the conventional sense rather, it is a collection of modules which you can import into your own programs, and which in particular allow you to write multi-threaded programs.
標簽： PMOS multitasking Welcome modules
上傳時間： 2015-07-10
上傳用戶：windwolf2000
Readers can pick up this book and become familiar with C++ in a short time. Stan has taken a very broad and complicated topic and reduced it to the essentials that budding C++ programmers need to know to write real programs. His case study is effective and provides a familiar thread throughout the book.
標簽： familiar Readers become short
上傳時間： 2015-07-20
上傳用戶：thinode
關于FPGA流水線設計的論文 This work investigates the use of very deep pipelines for implementing circuits in FPGAs, where each pipeline stage is limited to a single FPGA logic element (LE). The architecture and VHDL design of a parameterized integer array multiplier is presented and also an IEEE 754 compliant 32-bit floating-point multiplier. We show how to write VHDL cells that implement such approach, and how the array multiplier architecture was adapted. Synthesis and simulation were performed for Altera Apex20KE devices, although the VHDL code should be portable to other devices. For this family, a 16 bit integer multiplier achieves a frequency of 266MHz, while the floating point unit reaches 235MHz, performing 235 MFLOPS in an FPGA. Additional cells are inserted to synchronize data, what imposes significant area penalties. This and other considerations to apply the technique in real designs are also addressed.
標簽： investigates implementing pipelines circuits
上傳時間： 2015-07-26
上傳用戶：CHINA526
Structure the sources so that the compression and decompression code form a library usable by any program, and write both gzip and zip on top of this library. This would ideally be a reentrant (thread safe) library, but this would degrade performance. In the meantime, you can look at the sample program zread.c.
標簽： decompression compression Structure the
上傳時間： 2015-08-06
上傳用戶：jackgao
1、 了解系統調用pipe()的功能和實際原理 2、 編寫一段程序，使用管道實現父子進程之間的通信 a) 使用系統調用fork()創建一個子進程 b) 子進程調用函數write()向父進程發送自己的進程ID和字符串” s sending a message to parent.\n”。 c) 父進程調用函數read()通過管道讀出子進程發來的消息，將消息輸出屏幕，然后終止
上傳時間： 2013-12-16
上傳用戶：古谷仁美
ACM試題An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".
標簽： Description computers Problem binary
上傳時間： 2013-12-11
上傳用戶：libenshu01
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
為Linux系統設計一個簡單的二級文件系統。要求做到以下幾點： 1．可以實現下列幾條命令： login 用戶登錄 dir 列目錄 create 創建文件 delete 刪除文件 open 打開文件 close 關閉文件 read 讀文件 write 寫文件 2．列目錄時要列出文件名，物理地址，保護碼和文件長度。 3．源文件可以進行讀寫保護。
上傳時間： 2015-08-30
上傳用戶：獨孤求源
帶進度條的文件上傳(java+ajax源碼) 在寫代碼的時候，還要用到關于servlet的包servlet-api.jar。 寫完后調試的過程中，老報錯：java.lang.NoClassDefFoundError: org/apache/commons/io/output/DeferredFileOutputStream，后來一查才知道少了commons-io-1.2.jar，加上后，就ok了。 關于獲取及顯示進度部分，用了我原來自己寫的一個ajax的應用架構，從中抽取了部分代碼出來，注意，js文件只適用于UTF-8編碼的頁面，因為現在我只寫UTF-8編碼的頁面了，國際化方便。 progressUpload.jar中，包含了commons-fileupload-1.1.1.jar，servlet-api.jar，commons-io-1.2.jar，在progressUpload.jar中，還包含一個屬性文件，里面是一些默認配置，可根據自己的需要修改。 由于有源碼，怎么用可以自己看源碼，此外，那個例子中也寫了，在此不再贅述。例子中只取到了FileItem，再將item保存一下就ok了，示例代碼： File upFile = new File(remoteFilePath) try \{ item.write(upFile) fileInfo.put("infotip", "上傳成功.") } catch (java.lang.Exception e) \{ fileInfo.put("infotip", "上傳失敗.") }
上傳時間： 2015-09-01
上傳用戶：ccclll
