lecture 3-11.py

说明：  在获取和差通道的基础上，实现极化敏感阵列的和差测角。(The code can realize the angle estimation for polarization sensitive array based on sum and difference data.)

很有参考价值的Windows CE嵌入式开发文档资料！英文原版！-of great reference value to the Windows CE Embedded Development Documentation! English original!

说明：  图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。 数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)

Delphi写的带树控菜单的软件界面源码，一个没有实质功能的软件界面，左侧是树形菜单，右侧是功能区，很适合编写一些Delphi信息系统时作为主界面使用，本源码在Delphi7下完美编译成功，界面如截图所示。

说明：  主成分分析(PCA)是多元统计分析中用来分析数据的一种方法,它是用一种较少数量的特征对样本进行描述以达到降低特征空间维数的方法,(Principal Component Analysis (PCA) is a method used to analyze data in multivariate statistical analysis. It uses a small number of features to describe samples in order to reduce the dimension of feature space.)

说明：  最简单泊位调度问题，泊位为离散型泊位,7条船，2个泊位，无需等待(The simplest berth scheduling problem is that the berths are discrete berths, with 7 ships and 2 berths, without waiting.)

thesis on antenna design and different design are presented here

说明：  在有限元相关软件中，施加平面的周期性边界条件，二次开发(Applying Periodic Boundary Conditions to Planes)

说明：  压缩感知相关的，1bit量化相关的代码和说明(Codes and instructions for compressed sensing-related 1bit quantization)

TTP229 TOUCH CAPACITIVE