人脸识别V2

这一项目是关于光学 ofdm 系统与 optisystem ；项目描述中长途交流光学 ofdm 系统

进行矩阵求逆，包含行列式的值的计算，代数余子式的计算等

一个用C语言编写的求混沌序列的源程序,挺好的!-a C language for the chaotic sequence of the source, very good!

资源描述世界上最著名的多旋翼姿态滤波算法，包含源代码和PDF原理说明、使用说明

资源描述编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速编码电机PID调速

没有界面，用C写的小程序 问题如下：一家软件公司招聘了数十位程序员，分成若干部门。 进行一次考试，对各个部门的所有程序员进行考核。考试结束后评出了每个人的分数。现在需要知道，在每个部门内，成绩最好的程序员和成绩最差的程序员分别是谁。输入有N+1行，每一个有若干正整数。第一行只有一个正整数，代表公司的部门数目。剩余的N行，每一行代表了该部门所有程序员的得分。其中每行第一个数字k代表了该部门的程序员个数，该行剩下的有k对数据，每对数据包括一个程序员的姓名（一个字符串）和其得分（一个正整数）。【输出形式】输出有N行，每行有两个串。第一个串该部门得分最高的程序员的姓名，第二个数字是得分最低的程序员的姓名。-no interface, written in C minor procedural issues are as follows : a software company recruited dozens of programmers, divided into several departments. An examination of the various departments for testing all programmers. Examinations in 1886 after the end of each grade. Now need to know, in every sector, but the best programmers and the worst programmers who were. N input is a line, each one a number of positive integers. There is only a first positive integer representing the number of departments. The remaining N firms, each firm on behalf of all the sector"s programmers to the basket. Each Bank figures k a representative of the number of programmers, the bank left the k right d

lower frequency inverter

人工蜂群是用麦芽应用程序中优化目的优化技术。欢迎大家下载、试用。谢谢大家的支持！

用Visual C++实现的绘制函数图像的程序。给定任意函数表达式，可直观显示该函数图像。-Visual C achievable image mapping function procedures. Given arbitrary function expression, visual images showed that the function.

A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.