KTV 点歌系统

本程序主要描述了几种彩色图像的特征提取的方法，包含颜色、纹理、的特征提取，还有图像的分割、sift特征点的提取与匹配

说明：  应用于MT4交易的EA系统，挂在M15 EURUSD(EA system for MT4, hanging on M15 EURUSD))

C++ code for Datalogic Teriminal

基于BWT的DNA短序列分析程序. BWT是一种压缩算法，主要利用BWT压缩的思想建立索引进行搜索。 BWA（Burrows–Wheeler Alignment）用BWT提供的索引进行快速搜索。(Based on the BWT of short DNA sequence analysis program. BWT is a compression algorithm, BWT compressed thought indexing search. BWA (Burrows-Wheeler Alignment) BWT index quick search.)

道格拉斯-普克算法 (Douglas– Peucker algorithm，亦称为拉默-道格拉斯-普克算法、迭代适应点算法、分裂与合并算法)是将曲线近似表示为一系列点，并减少点的数量的一种算法。它的优点是具有平移和旋转不变性，给定曲线与阈值后，抽样结果一定。(The Douglas - puke algorithm (Douglas - Peucker algorithm, also called the lamer - Douglas - puke algorithm, iterative adaptive point algorithm, split and merge algorithm) is an algorithm that approximatively represents a curve as a series of points and reduces the number of points. It has the advantages of translation and rotation invariance. After a given curve and threshold, the sampling result is certain.)

使用微软的语音驱动和语音识别引擎，实现语音命令识别和语音输出。C#程序源代码。语音命令在ACCESS中配置。

ddds dad s sd sddsf f sdf sdcds ddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcdsddds dad s sd sddsf f sdf sdcds

此程序主要是对振动速度和位移信号的在线采集和处理，功能较为齐全。(This program is mainly for vibration velocity and displacement signal acquisition and processing online, function more complete.)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

分解各种劲舞团的ACV分解器比较好用的一款！h很赞哦！！！！！！！(Decomposition of audition ACV resolver is listed with a! H good oh!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!)