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
Easy to use SMS/MMS Messaging Gateway to develop Content Delivery Platforms by GSM Operators,Content Providers and even non-telecom guys. Uses file system for data flow.Written for .NET 2.0 in C#
標簽： Content Messaging Platforms Operators
上傳時間： 2014-01-01
上傳用戶：1109003457
關于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
Coriander is a GUI for controlling a Digital Camera (in the sense of the IIDC specs issued by the 1394 Trade Association [1]). Due to the properties of the IEEE1394 protocol, Coriander can control an IEEE1394 camera without interferring with the image flow from that camera. It can thus be used to setup a camera with Coriander while the video flow is used by another application
標簽： the controlling Coriander Digital
上傳時間： 2015-08-07
上傳用戶：TF2015
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
PSTN to PSTN Dialing via SIP Network.This is a representation, as a slide show, of the SIP examples detailed in RFC 3666 - RFC3666 SIP PSTN Call Flow.
標簽： PSTN representation SIP examples
上傳時間： 2015-08-30
上傳用戶：weixiao99
