磁盘调度模拟的算法实验课程设计的良药啊

TLD(Tracking-Learning-Detection)是英国萨里大学的一个捷克籍博士生在其攻读博士学位期间提出的一种新的单目标长时间（long term tracking）跟踪算法。该算法与传统跟踪算法的显著区别在于将传统的跟踪算法和传统的检测算法相结合来解决被跟踪目标在被跟踪过程中发生的形变、部分遮挡等问题。同时，通过一种改进的在线学习机制不断更新跟踪模块的“显著特征点”和检测模块的目标模型及相关参数，从而使得跟踪效果更加稳定、鲁棒、可靠

java3d，一个贴皮的程序，在圆筒上贴一个图片-java3d, a paste percutaneous procedure, a picture posted in the cylinder

flash介绍用vb编写的很好的功能实例程序有兴趣的朋友可以下-vb flash presentation prepared by the good examples of functional procedures are interested friends under

约瑟夫环（Joseph）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从它在顺时针方向的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序-Joseph Central (Joseph) a description of the problem is: numbered 1,2, ..., n of n individuals according to a clockwise direction around a circle, each holding a password (positive integer). The beginning of a positive integer as a candidate at a number of upper limit of m, from the first individual to embark on the clockwise direction since the beginning of the order of 1 is reported the number of stops required to report back at a few m. Those who reported m out of his password as the new value of m, in a clockwise direction from the next person to start off again from the 1, and so on, until all that out until all. Try to design a procedure to derive the column order

a simple mfc program to create simple common controls

很不错的网页广告教程-very good Advertising Directory

动态链接库程序的编写。静态库与动态库的区别，以及调用程序在链接静态库和动态库时的区别-Dynamic link library preparation process. Static library and dynamic library distinction, and call procedures in the static library and dynamic link library when the difference between

读了老罗的“仅通过崩溃地址找出源代码的出错行”(下称"罗文")一文后，感觉该文还是可以学到不少东西的。不过文中尚存在有些说法不妥，以及有些操作太繁琐的地方 。为此，本人在学习了此文后，在多次实验实践基础上，把该文中的一些内容进行补充与改进，希望对大家调试程序，尤其是release版本的程序有帮助 。欢迎各位朋友批评指正-old Romanian read the "only by the collapse of addresses to identify the source code error" (hereinafter referred to as "Luo"), a text, the feeling of the text can still learn a lot of things. But the text of the surviving some of the comments inappropriate, and too cumbersome to operate in some areas. Therefore, I studied in the article, the practice of several experiments, based on the text of some elements to complement and improve, we hope to debug procedures, particularly release versions of the program would be helpful. Welcome ladies and correct criticism

该程序实现对一维数据轴上的最临近点的求解问题 采用方法：计算每对顶点间的距离，比较之 效率为O(n2)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : for each pair of vertices the distance, a comparison of the efficiency of O (n2)

实现一般面向对象的编程功能-realization of object-oriented programming