资源列表
canny.m
- detect edes by canny edge detection based method
113
- these are some of my sgu codes
lambert
- 求解Lambert问题。 输入：轨道上两个点的位矢R1、R2，以及从R1到R2所用的时间t(缺点是脉冲太大)。 输出：质点在R1端点的速度V1，质点在R2端点的速度V2. 此函数用于：在给定轨道上两个点的位矢R1、R2，以及从R1到R2所用的时间t。求解V1、V2。再调用前面的函数就可以确定轨道根数，及任意时刻质点的状态。-To solve the Lambert problem. Input: track two-point position vector R1, R
Genetic-optimization-of-C-clustering
- 运用遗传优化算法优化模糊C均值聚类，通过全局自适应寻优，寻找出更为精确的模糊聚类中心-Using genetic optimization algorithm to optimize the fuzzy C-means clustering, global adaptive optimization to find a more precise fuzzy clustering center
radar
- 实现雷达信号线性调频的相关处理，对雷达信号的细微特增进行分析-Chirp radar signal processing, radar signal subtle increase in special analysis
Keyboard-Monitor-VB-source-code
- 键盘监视器VB源码-Keyboard Monitor VB source code!!!!!!!!!!!!!!!!!!!!!!!!!!
2
- 输入中缀表达式，#为结束符将其转换成后缀表达式，然后计算-Enter infix expression,# to end the character to convert it into a postfix expression, and then calculate
source
- 广为流传的蜂窝小区最小距离的一种C++算法实现。-A C++ algorithm widely circulated cell minimum distance of implementation.
kMeansCluster
- k-Means 算法接受输入量 k ；然后将 n 个数据对象划分为 k 个聚类以便使得所获得的聚类满足：同一聚类中的对象相似度较高；而不同聚类中的对象相似度较小。聚类相似度是利用各聚类中对象的均值所获得一个 “ 中心对象 ” （引力中心）来进行计算的。-K-Means algorithm accepts input amount of K then the object n data is divided into k cluster so that the obtained clusteri
cohesive_umat
- 进行弹塑性分析，自动判断流动方向有利于塑性力学学习者借鉴- elastic-plastic analysi
Voice-communication
- 用java写的语音聊天程序的源代码，能实现点对点的语音通信。-Using java to write the voice chat program source code, can achieve point-to-point voice communication
face-identification
- 通过VS+OPENCV实现人脸检测，可将程序复制到工程中，即可使用-By VS+OPENCV implement face detection, you can copy the program to the project, you can use