Dry-eye

队列的顺序定义，队列的调用算法等，队列的模板类及其实现(Defined in the order queue, queue calls algorithm, queue template class and its implementation)

Gives the user s desired number of Fibonacci Sequence

用冲激响应不变法和双线性变换法设计IIR的MATLAB程序(Design of MATLAB Program for IIR by Impulse response Invariant method and Bilinear Transformation method)

this is the library to compress and decompress any file. I found it on Net

使用哈弗曼编码技术进行数据压缩和解压缩，缺点在于只能用于文本(Havermann coding techniques using data compression and decompression, disadvantage is that the text can only be used)

this is CLIPS code for eye disease

操作系统中的 内存管理 FIFO算法模拟(OS FIFO memory management algorithm simulation)

说明：  这是基于systemview平台的cdma下行链路仿真源码, 能满足cdma开发过程中的仿真需要,(This is the cdma downlink simulation source code based on systemview platform, which can meet the simulation needs in the cdma development process.)

对于给定的两个线段，程序输出这两个线段之间的距离(For a given two line segments, the program output that the distance between two line segments)

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)