自由拼音输入程序

本次设计要求我使用最不经常使用页面淘汰算法。该算法在需要太太某一页是，首先淘汰到当前时间为止，被访问次数最少的那一页。这只要在页表中给每一页增设一个访问计数器即可实现。每当该页被访问时，访问计数器加1，而发生一次缺页中断时，则淘汰计数值最小的那一页，并将所有的计数器清零。-Abstraction: This design require me use a most unusual swap algorithm. When swap operation is demanded, this algorithm first swap the least accessed page up to present. To implement this algorithm, only need add a counter variable to eash page of the page table. When one page is accessed, the counter increase one. When page invalid interrupt occur, wash out the page with least count, then reset all the counters to zero.

c program

判断点是否在多变形内： 先画一个多边形 然后判断，如果在多边形内，显示“N” 如果在多边形外，显示“W”-in judgment over whether a deformation : the first draw a polygon then judge if the polygon, show "N" If the polygon, shows that the "W"

For certain source coding problems, it is well known that the Kraft inequality provides a simple sufficient condition for the existence of codes with given codeword lengths. Motivated by this fact, a sufficient condition based on the Kraft inequality can also be sought for the problem of zero-error instantaneous coding with decoder side information

报表演示示例源码-statements demonstration examples FOSS

从 DataSection 中读取数据，创建 DialogBoxIndirectParam_ 非常非常简单的例子。

gecko-sdk-i586-pc-msvc是mozilla必须的插件开发工具，包含了大量的插件开发API函数

有条件的读取VSAM文件（ksds） 使用KEY-Conditional read VSAM files (ksds) the use of KEY

DelphiX 编程控件-DelphiX Control Programming

my little small funny TicTacToe game -my little small funny TicTacToe game