This the third edition of the Writing Device Drivers articles. The first article helped to simply get you acquainted with device drivers and a simple framework for developing a device driver for NT. The second tutorial attempted to show to use IOCTLs and display what the memory layout of Windows NT is. In this edition, we will go into the idea of contexts and pools. The driver we write today will also be a little more interesting as it will allow two user mode applications to communicate with each other in a simple manner. We will call this the “poor man’s pipes” implementation.
標簽： the articles Drivers edition
上傳時間： 2014-01-16
上傳用戶：ommshaggar
Solving Engineering Problems Using MATLAB C++ Math Library Introduction In the previous article, we studied how can use MATLAB C API to solve engineering problems. In this article I will show you how can use MATLAB C++ math library. The MATLAB® C++ Math Library serves two separate constituencies: MATLAB programmers seeking more speed or complete independence from interpreted MATLAB, and C++ programmers who need a fast, easy-to-use matrix math library. To each, it offers distinct advantages.
標簽： Introduction Engineering Problems previous
上傳時間： 2014-12-02
上傳用戶：13160677563
Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square is marked with the number ‘1’. All free, valid squares north, south, east and west around the number ‘1‘ are marked with a number ‘2’. In the next step, all free, valid squares around the two are marked with a ‘3’ and the process is repeated iteratively until : The exit is found (a free square other than the starting position is reached on the very edge of the maze), or, No more free squares are available, and hence no exit is possible.
標簽： method ink-blotting Blotting escaping
上傳時間： 2014-12-03
上傳用戶：123啊
This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board.
標簽： implements algorithm fibonacci the
上傳時間： 2013-12-23
上傳用戶：ynzfm
This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative performance of these two implementations under the assumption that the only permissible operations are insert and delete-min.
標簽： implements and min binomial
上傳時間： 2014-11-27
上傳用戶：2467478207
Easy-to-Use, Ultra-Tiny, Differential, 16-Bit Delta Sigma ADC With I2C Interface The LTC2453 is an ultra-tiny, fully differential, 16-bit, analog-to-digital converter. The LTC2453 uses a single 2.7V to 5.5V supply and communicates through an I2C interface. The ADC is available in an 8-pin, 3mm x 2mm DFN package. It includes an integrated oscillator that does not require any external components. It uses a delta-sigma modulator as a converter core and has no latency for multiplexed applications. The LTC2453 includes a proprietary input sampling scheme that reduces the average input sampling current several orders of magnitude lower than conventional delta-sigma converters. Additionally, due to its architecture, there is negligible current leakage between the input pins.
標簽： Differential Easy-to-Use Ultra-Tiny Interface
上傳時間： 2014-01-08
上傳用戶：鳳臨西北
簡單C編譯器生成的目標代碼是8086的匯編代碼（16位），可以在一般的PC上被像MASM之類的匯編編譯程序編譯，生成可執行文件后，在DOS或Windows控制臺下運行。 實現的語言定義如下: 語言類似于tiny語言，不支持過程調用，也就是只有一個main函數，無其他函數和全局變量 基本語句：注釋語句（/*…*/），輸入語句(int input(void) )，輸出語句（void output(int) )，賦值語句。這里的輸入輸出語句實際上類似于函數調用，可以看作是本語言內部的函數 算術運算符：+、—、*、/ 數據類型：整數.
上傳時間： 2016-02-06
上傳用戶：bakdesec
Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The required precision is =0.00001, and the maximum iteration number N=25. Compare the number of iterations and the convergence of these two methods
標簽： Gauss-Seidel iterative following methods
上傳時間： 2016-02-06
上傳用戶：zmy123
Synthesizable FIFO Model This example describes a synthesizable implementation of a FIFO. The FIFO depth and FIFO width in bits can be modified by simply changing the value of two parameters, `FWIDTH and `FDEPTH. For this example, the FIFO depth is 4 and the FIFO width is 32 bits.
標簽： FIFO implementation Synthesizable synthesizable
上傳時間： 2016-02-12
上傳用戶：源弋弋
this procedure is a game of basketball or subsystems time, the competition will record the entire time, and can amend the Competition time suspended contest time, the two can be set at any time during the competition process of the match, the two teams exchanged scores midfielder position, Competition can end report issued directives
標簽： competition basketball subsystems procedure
上傳時間： 2016-02-14
上傳用戶：cuibaigao
