登录
首页 » matlab » SQL

SQL

于 2011-04-17 发布 文件大小:1KB
0 82
下载积分: 1 下载次数: 0

代码说明:

说明:  用MATLAB读取、写入和更改SQL数据库中数据(Use MATLAB to read, write and change data in SQL database )

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • ISD1420shouce
    请大家看着办啊(please size up situation and act accordingly ah?)
    2006-10-21 19:25:06下载
    积分:1
  • PID
    先进PID控制及其MATLAB仿真(刘金锟)(Advanced PID control and MATLAB simulation (Liu Kun) )
    2013-10-10 11:50:23下载
    积分:1
  • AlgorithmeGenetique
    Genetic Algorithm for WSN
    2013-11-13 15:18:35下载
    积分:1
  • axisticks
    This function is useful to make a dateaxis adjustable
    2014-02-06 17:55:34下载
    积分:1
  • bpsk15
    语音端点检测,是语音压缩时提取特征参数的一个必要的过程,这个程序主要是对这个过程的一个小的程序。希望对学语音的有帮助(Extreme point detecting is a primily process to get the eigenparameter when you compressing the speech.This program is a small one,it will help for the learner.)
    2009-05-04 23:23:02下载
    积分:1
  • Digital-Signal-Processing-(Sanjit)
    数字信号处理(Sanjit)(第四版)随处CD,matlab代码(Digital Signal Processing(Forth Edition)(Sanjit),matlab)
    2013-05-17 21:49:51下载
    积分:1
  • 随机生成多孔介质matlab序(20191112164848)
    说明:  一种新型的matlab生成随机线条的代码,用于后续处理(A new matlab code for generating random lines for subsequent processing)
    2019-11-12 16:55:58下载
    积分:1
  • Moracevasobel
    车辆特征提取 小波轮廓检测和Moracev焦点检测的功能融合(Vehicle contour detection and feature extraction of wavelet features Moracev focus detection integration)
    2011-05-19 19:59:51下载
    积分:1
  • matlab_3_opt
    提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。 bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 (Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
    2007-09-20 19:35:15下载
    积分:1
  • af-dfincooperationcommunication
    协作通信中的af-df转发源码,matlab版本 (Cooperative communications forward in af-df source, matlab version)
    2010-12-04 12:58:14下载
    积分:1
  • 696519资源总数
  • 104213会员总数
  • 20今日下载