类似spy++中查找窗口功能的程序

这个项目利用JAVA实现了坦克大战的简易版，这个项目充分利用了JAVASE中的基础知识，包括多线程，JAVA的图形界面，JAVA容器，面向对象，继承和封装等知识，可以作为JAVASE的大作业，也可以给学习JAVASE的同学作为项目的参考。

严正指正的小程序,是理解指正极力的放发达 -solemn small correction procedure is correct understanding developed strongly release

a book on c language for engineering students.. engineering students can find this book very useful

学习电信无线优化的好材料，在里面实习过，觉得很有用就发上来 分享下-Telecom wireless optimization study materials well in practice over there that is useful to share on the hair under the table

Description: 对整型有序关键码序列进行折半查找，待排序序列以数组存储。如果找到待查记录，返回找到的位置下标，并删除该关键码记录；如果没找到待查记录，返回0，并将待查记录插入到适当位置，即该查找属于动态查找。输出查找过程中每一轮的low，mid，high 值，以及与给定值相比较的关键码值，并输出最后找到的位置，及变化后的数组。 注意：该数组为整型，数组中关键码存储位置为r[1]~r[n]，r[0]留作它用，且关键码个数大于4. Input Format: 第一行输入数组中记录个数n 第二行输入n个有序的整型关键码，以空格隔开 接下来输入三个待查关键码，每个关键码占一行 Output format: 对于每个关键码，分别输出： 找到给定值之前的每一轮的low，mid，high及相比较的待查找序列中的关键码，以空格隔开 接下来一行输出查找到的位置 接下来一行输出变化后的待查找序列 -Description: The key codes for integers ordered sequence of binary search until the sorting sequence to an array of storage. If you find a complete set of records, returns to find the location of the next standard, and delete the key code is recorded if not find a complete set of records, returns 0, and a complete set of records inserted into the appropriate location, that is, the search was part of search. Find out the process for each one of the low, mid, high value, as well as compared to the value given the key code value and output of the last to find the locat

implementation of Weine filter in matlab

这是一个模拟时钟的原代码-This is a simulation of the original code Clock

简易文本编辑器、复合查询、查询、滚动字幕、简单数据绑定等示例.-simple text editor, composite inquiries, and rolling subtitles, simple data bundled with other examples.

1,获取图像点的灰度值  2,获取图像的灰度直方图  3,对灰度图像进行线性变换、平滑、锐化等 1, to obtain images of the gray value  2, to obtain the image histogram  3, gray image linear transformation, smoothing, sharpening, etc.

征途真彩客户端源代码，内测1.0版本，需要最早的内侧客户端-Journey of true color client source code, closed beta version 1.0, the first inside the client needs