-
Lssvmmatlab
最小支持向量机matlab实现过程，还有详细教程(Minimum support vector machine (SVM) matlab implementation process, there are detailed tutorial)
- 2014-07-15 17:33:55下载
- 积分：1
-
bp神经网络分类
1. 采用BP神经网络设计男女生分类器。采用的特征包括身高、体重、是否喜欢数学、是否喜欢文学、是否喜欢运动共五个特征，BP神经网络包含一个隐层，隐层结点数为5。要求：自行编写代码完成后向传播算法，采用交叉验证的方式实现对于性能指标的评判（包含SE,SP,ACC和AUC，AUC的计算可以基于平台的软件包）。(. using BP neural network to design the classifier for male and female students. The features include height, weight, whether they like mathematics, whether they like literature, and whether they like sports. The BP neural network contains a hidden layer, and the number of hidden nodes is five (5). Requirements: self compiled code, post propagation algorithm, cross validation method to achieve performance evaluation (including SE, SP, ACC and AUC, AUC calculation can be based on platform software package).)
- 2017-10-21 20:58:22下载
- 积分：1
-
信号处理程序
说明： 可以通过程序提取导波波包能量，求解互相关系数(The guide wave packet energy can be extracted by the program, and the correlation number can be solved)
- 2020-09-07 20:38:04下载
- 积分：1
-
Space_Truss_System
空间桁架的静力分析,很好用的，任意三维空间桁架都可以用(analysis for space truss system)
- 2009-12-01 02:31:36下载
- 积分：1
-
Labview-baseddesignofthecurvefitting
用Labview对信号进行曲线拟合，这样使得得出的结果更加的清晰、易懂。(Signal using Labview for curve fitting, which makes the results more clear and easy to understand.)
- 2009-06-17 10:31:42下载
- 积分：1
-
字模软件,LCD取摸程序,LED显示必备软件
字模软件,LCD取摸程序,LED显示必备软件-Matrix software, LCD touch access procedures, LED display the necessary software
- 2023-04-06 02:50:03下载
- 积分：1
-
graphene
计算石墨烯介电常数的方法，在泰勒赫兹波段的(Method of calculating the dielectric constant of graphene in the Taylor Hertz band)
- 2020-11-24 17:49:32下载
- 积分：1
-
butterworth_filter
说明： Butterworth Filter (digital image processing)
- 2020-06-20 16:40:02下载
- 积分：1
-
遗传算法求解多旅行商问题
旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
- 2020-06-17 11:00:02下载
- 积分：1
-
ATS2805B Datasheet_V1.0
说明： ats 2805 bluetooth datasheet
- 2020-06-19 22:40:01下载
- 积分：1
