任务加入Coursera大数据数据

日本ATR（Advanced Telecommunication Research InstituteInternational）的专门用于表情识别研究的基本表情数据库JAFFE，该数据库中包含了213幅（每幅图像的分辨率：256像素×256像素）日本女性的脸相，每幅图像都有原始的表情定义。表情库中共有10个人，每个人有7种表情（中性脸、高兴、悲伤、惊奇、愤怒、厌恶、恐惧）。 JAFFE数据库均为正面脸相，且把原始图像进行重新调整和修剪，使得眼睛在数据库图像中的位置大致相同，脸部尺寸基本一致，光照均为正面光源，但光照强度有差异。由于此表情数据库完全开放，且表情标定很标准，所以现在大多数研究表情识别的文章中都使用它来训练与测试。-Japan ATR (Advanced Telecommunication Research InstituteInternational), devoted to the basic expression of facial expression recognition research database JAFFE, the database contains 213 (each image resolution: 256 pixels × 256 pixels) Japanese women face relative to each piece of expression of both the original definition of the image. Expression library, a total of 10 individuals, each person has seven kinds of expressions (neutral face, happy, sad, surprise, anger, disgust, fear). JAFFE face database are positive phase, and the original image is re-adjust and trim, making the eye the location of the image in the database similar to the face basically the same size, ligh

打开数据库中的记录，并且实现浏览数据库的功能-open the records in the database and view the database

TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check its leaves i n terms of algorithm as preorder. midorder or postorder.

归并排序：将数组划分为小数组,通过局部的有序合并,解决问题 算法平均时间复杂度: O(nlogn) -Merging Sort: The array is divided into a small array, in an orderly manner through the partial merger, the average time algorithm to solve the problem complexity: O (nlogn)

以链表的形式实现货物的管理,包括链表的创建,插入,删除,查询,更新等.-to List in the form of cargo management, including Chain create, insert, delete, query, update, etc..

可用代码生L成SQL Server用户表的表结构定义，包含字段/类型，可选择是否打印索引/约束/注释等

MyDB 是一个小型、 快速、查询方便的桌面数据库。 适用于Visual C++、Visual Basic、Delphi等开发者。 只有一个DLL（188KB），所有数据以自己的格式存 在一个普通文件中，无需Dao、Ado、BDE等支持。 也无须任何安装和设置。特别适合开发那些数据量 不是很大，无需复杂查询，又不想安装Dao等一大堆 DLL，OCX的绿色软件。而且数据安全性好， 无法轻易打开！-MyDB is a small, fast and convenient desktop database query. Applies to Visual C++, Visual Basic, Delphi and other developers. There is only one DLL (188KB), all data in their own format, there is a general document, without Dao, Ado, BDE and other support. Also without any installation and settings. Particularly suitable for the development of those who is not a big amount of data without the complexity of inquiries, but also do not want to install a lot of Dao, such as DLL, OCX green software. And data security, and can not be easily opened!

编写一个算法，利用栈的基本运算返回指定栈中栈底元素

单比特树查找算法，是用于路由查找的，内含有路由查找相关资料-Monobit tree-search algorithm is used to identify the routing, which contain routing information Search

链表类，提供了全套的链表处理函数-objectlist, provides a full suite of Chain Functions