WinFinder控件测试例子

iCarnegie课程上的SSD1的一个练习，要求做完Catfish的源代码的exercise。需要的可以看看。写的不好，别见怪。-iCarnegie courses SSD1 a practice to require the source code Catfish finish the exercise. Need to look at. Write well,别见怪.

这是一个六轴舵机机器人控制程序，该程序可以分别控制机器人的六个轴，是在arduino平台上开发的，采用的是USB串口通信

SHIP is a computer game which is played by the single player at a time.

for： Root of a Polynomial --- --- --- --- -- Time Limit: 1 Second Memory Limit: 32768 KB -------------------------------------------------------------------------------- A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) where int n is the degree of the polynomial double c[] is an array of n +1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0. -for: Root of a Polynomial---------------------- Time Limit: 1 Second Memory Limit: 32768 KB-------------------------------------------------------------------------------- A polynomi

通过对象的集合可以动态的进行vb控件的设置.-Through a collection of objects can dynamically control the conduct of vb settings.

本程序利用WMI技术获取系统的详细信息，如硬盘，CPU，操作系统，显卡，内存，等，其中WMI包含很多类的信息。可以自己找资料，都是通用的。

Get focus control on other thread.

简单的数字进制转化程序，相对WINDOWS自带计算器的优势是可以自动转换整数与小数部分的数值。-Simple transformation of the number of M-ary procedures, the relative advantages WINDOWS own calculator can be automatically converted to an integer and decimal part of the value.

一、系统开发环境为myEclipse，应用服务器为Tomcat，数据库环境为同时兼容MySql5.0、 Sqlserver2000、Sqlserver2005和Oracle，方便您选择和移植。二、系统采用B/S架构，开发同时通过IE、FireFox和Chrome等主流浏览器测试，使系统UI具备较强的兼容性。Web前台使用到的技术包括HTML、CSS等。三、系统采用struts+servlet+jsp架构进行开发，沿用MVC思想，使得项目层次更加清晰，提高了系统的安全性和可扩展性，方便功能扩展与二次开发。

图像压缩问题要求确定象素序列{p1,p2,…,pn}的最优分段，使得依此分段所需的存储空间最少。每个分段的长度不超过256位。数字化图像是m×m的像素阵列。假定每个像素有一个0 ~ 2 5 5的灰度值。因此存储一个像素至多需8位。若每个像素存储都用最大位8位，则总的存储空间为8m^2 位。为了减少存储空间，我们将采用变长模式（ variable bit scheme），即不同像素用不同位数来存储。像素值为0和1时只需1位存储空间； 值2、3各需2位；值4，5，6和7各需3位；以此类推。-image compression defined pixel sequence (p1, p2, ..., pn) sub-optimal, sub accordingly makes the storage space required at least. The length of each section is not more than 256. The digital image is m m pixel arrays. Assume that each pixel is a 0-2 5 5 of the gray values. Therefore storage of up to a pixel 8. If each pixel with the largest storage capacity of 8-bit, the total storage space for 8m ^ 2. In order to reduce storage space, and we will use variable-length model (variable bit scheme), that is different with different pixel median storage. Pixel values of 0 and 1 and only a storage space; The value of 2,3 required two; Value 4,5,6 and 7 of the required three; Analogy.