H-2

人机交互小功能，画曲线，改变颜色，生成矩阵，随机与固定的，退出，改变线型(Human-Computer Interaction small features, drawing curves, changing the color, generating matrix, random and fixed, from the change of linear)

基于MATLAB实现数字通信系统中的各种调制方式(MATLAB-based digital communication systems of the various modulation)

一个很小手势识别工具. 这是我读Master的时候一个小作业. 我是用block FFT 来写的.70 -80 识别率.(A gesture recognition tool.It was a modle assigment, when I was doing my Master degree. I used block FFT. The recognition rate is round 70-80 )

本课程是航空航天类院校本科飞行器设计与工程专业教学计划中的一门技术基础课。为飞行器设计与工程专业学生的必修课。本课程的目的和任务是使学生掌握流体力学基本知识和空气动力学的基本概念、基本理论，以及解决空气动力学问题的基本方法和分析手段。本课程的内容可分为两大部分：低速空气动力学和可压缩空气动力学，包括了空气动力学的基本概念、低速流动和可压缩无粘流动的基本原理、绕翼型和机翼的不可压缩流动的薄翼理论和有限翼理论、激波理论、翼型亚音速和超音速线化理论及应用等。(This course is a class of undergraduate aerospace vehicle design and engineering teaching program in a technical basic course.)

tankmodel 水箱模型，概念性水文模型模拟(tankmodel 水箱模型，概念性水文模型模拟，四层计算模拟，拟定参数)

本书主要研究波束形成，波达方向估计，阵列多参数估计及其应用等。(This book studies beamforming, direction of arrival estimation, parameter estimation and multi-array applications.)

数据库的完整性控制熟悉利用企业管理器为列创建DEFAULT约束、为列创建CHECK约束、为列创建UNIQUE约束、为列创建不允许为空约束、创建PRIMARY KEY约束、创建FOREIGN KEY约束(Integrity control of the database use Enterprise Manager to create the familiar column DEFAULT constraint, create a CHECK constraint for a column, create a UNIQUE constraint for a column, create a column does not allow null constraint, create a PRIMARY KEY constraint, create FOREIGN KEY constraint)

matlab for c programeers

  最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)

This is uniform quantization coded in matlab