id car in China ,so you can be familiar with the car where it comes from

回溯算法与八皇后问题 算法设计的经典问题，是学习算法的朋友一定会遇到的问题-Backtracking algorithm and eight Queen

用图形界面的程序装载控制台程序并接收控制台程序的输出。-use graphical interface loading procedures and receiving procedures console console program output.

机动目标的跟踪问题一直是人们研究的重点，实现机动目标精确跟踪，首要解决的问题就是使所建立的目标运动模型与实际的目标运动模型匹配。目前常用的有多模型(MM)，交互式多模型(IMM)，切换模型等。多模型方法就是对一组具有不同机动模型分别进行Kalman滤波，最终的参数估计是各滤波器估计值的加权和；在多模型基础上，Shalom提出了交互式多模型方法，这一方法对无序目标的机动检测，显示了更好的鲁棒性和跟踪的稳定性；切换模型则是分别建立机动和非机动运动模型，利用机动检测实现在这两个模型之间的切换。一般来说，交互式多模型的跟踪性能较好。-mobile target tracking problem has been a focus of research and achieve precise maneuvering target tracking, the most pressing issue is to enable the establishment of the target model and the actual movement of the target model matching. At present, more commonly used model (MM), interactive multi-model (IMM), switching model. Multi-model approach is a group of different mobile models were Kalman filtering, The final parameter is the estimated value of the filter is estimated weighted; in the multi-model basis, Shalom made the interactive multi-model approach that the objectives of the motor disorder detection, better show the robustness and stability of the track; switching model is set up motorized and non-motorized sports

Symbian OS Socket任务管理器服务器源代码 可以学习一下-Symbian OS Socket Task Manager server source code can learn about

最大的高斯混合模型似然估计的期望最大化算法-Maximum likelihood estimation of Gaussian mixture model by expectation maximization algorithm

C++数据库系统-C database system

实时数据以web图形方式显示，ISAPI实现，包括系统图和历史曲线，这是多年前自己在电厂DCS数据采集实施项目开发的，绝对个人作品。-distribute control system data collection， show data in web style，ISAPI and C++ Builder。

无线射频，手机电路，电视家电，信号处理，电源电路等电路图应有尽有-dos

数根 数也有根吗？有！数根就是把一个数的各个数位上的值相加，直到得到一个一位数为止。请你编写一个程序来计算任意数N（0≤N≤1000000000000）的根。 输入： 输入有多个案例。每一个案例为一行，每行只有一个整数N。当输入的N是-1时，输入结束。 输出： 每一个案例输出一行。每行只有一个数字，就是N对应的数根。 Sample input 39 -1 Sample output 3-Number of root number also has roots do? There is! The number of roots is to a number of different values on the digital sum until they have been a number of up to one. Please write a program to calculate an arbitrary number N (0 ≤ N ≤ 1000000000000) roots. Input: Enter a number of cases. Each case for the line, each line is only an integer N. When the input of N is-1, the input end. Output: the output line of each case. There is only one number per line, that is, N corresponds to the number of roots. Sample input 39-1 Sample output 3

这是个通信录源代码-This is a recorded communications source code