window graph

给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？递归分治,刚才上传的ex1.rar有错,以这个为准.-Given a width W of the rectangular plate, rectangular plate of height restrictions. Is the need to cut out from the board, respectively, n-height hi, a width of the rectangular parts wi. Parts of the rules of cutting height direction and the direction of rectangular plates with a high degree of consistency. Asked how to make the use of cutting rectangular plate of height h the smallest? Recursive sub-rule, has just uploaded ex1.rar wrong, this shall prevail.

我在学习移动设备开发时，自己写的一个简单的基于移动设备的数据库程序，开发工具VS2005，C#，数据库SQL CE2.0-I study at the development of mobile devices, they wrote based on a simple database program for mobile devices, development tools, VS2005, C#, database SQL CE2.0

编号为1，2，…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数），一开始人选一个正整数作为报数上限m,从第一个人开始按顺时针方向从自1开始顺序报数，报道m时停止报数。报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止，设计一个程序求出出列顺序。采用单向循环链表模拟此过程，按照出列的顺序印出各人的编号测试数据：m的初值为20；n=7,7个人的密码依次为：3，1，7，2，4，8，4，首先m的值为6（正确的出列顺序应为6,1,4,7,2,3,5）-No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, each holding a password (positive integers), a candidate started as a positive integers m ceiling on the number of reported from the first individuals to embark on the clockwise direction from the start sequence from a few newspaper reports m reportedly stopped a few. M reported out of the list of his password as a new value m, from the clockwise direction on the next re-started from a few reported so on, until all out all out, the design of a procedure sought out the order out. Listless one-cycle simulation process and follow the sequence shown in the numbers printed each test data : m for the initial 20; N = 7,7 personal passwords were : 3,1,7,2,4,8

滑动条的显示状态-sliding strip"s state

基于sift的特征点检测和匹配，配合Panoramastitch可以实现全景图的拼接，代码为命令行参数程序，有需要可自行修改。

FFH中最佳门限的比较，有传统和最佳比较两种-FFH best threshold comparison, there are traditional and the best comparison between the two

一个人工智能的八数码难题,也叫九宫图难题,算法仅供参考.-an eight digital artificial intelligence problems, it has also called JiuGongTu problem, the algorithm is for reference only.

This the implementation of structural SVM for training complex alignment models for protein sequence alignment, especially for homology modeling. The structural SVM algorithm can incorporate many relevant features like secondary structure, relative exposed surface area, profiles and their various interaction into the alignment model. It was developed under Linux and compiles under gcc, built upon the svm^light software by Thorsten Joachims.

windows mobile Demo_StepByStep,很不错的入门资料-windows mobile Demo_StepByStep very good introductory information on

一维二维码自动生成windows源码库,支持80多种一维码二维码生成，vs2015环境win64位系统测试通过