登录
首页 » PDF » 2011-05-algorithm-brains-electrical

2011-05-algorithm-brains-electrical

于 2013-11-11 发布 文件大小:21KB
0 167
下载积分: 1 下载次数: 2

代码说明:

  New algorithm improves the way computers interpret readings of the brain’s electrical signals

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

发表评论

0 个回复

  • algorithm_k
    It is a small part of code that used for clustering approach
    2015-03-18 15:48:22下载
    积分:1
  • DGGEsimilaritymatrix
    计算DGGE图谱各泳道间的相似性指数组成相似矩阵,输入参数x为图谱的泳道的亮度(灰度)或者比移值矩阵(DGGE profiles calculated similarity between each lane index composed of similar matrix, the input parameter x for the map of the lanes of the brightness (gray) or Rf value matrix)
    2010-07-06 22:06:01下载
    积分:1
  • SSRHE
    这是SSR算法与直方图均衡化相结合的matlab代码,可以增强模糊且较暗的图像。 (this is SSR algorithm and HE。。。)
    2011-09-22 23:21:20下载
    积分:1
  • Time-frequency-analysis
    时频分析原理及应用由很多时频分析小例子构成,很实用。(Time-frequency analysis principle and application of frequency analysis in many small examples, and very practical.)
    2012-12-01 16:59:33下载
    积分:1
  • image-energy
    matlab脚本,附带例子图片。能够批量对图像进行简单处理,并计算能耗(Matlab script that comes with example pictures. Able quantities of simple processing, the image and calculate the energy consumption)
    2012-04-04 18:20:36下载
    积分:1
  • KALMAN
    This file includes kalman filter and induction motor model
    2013-07-21 00:30:02下载
    积分:1
  • zishiying
    The simulation is a wideband signal is white noise with variance 0.05, single frequency to the frequency of the signal for a single frequency signal 2 to 2 times the adaptive filtering simulation
    2013-05-08 15:27:40下载
    积分:1
  • twoto22
    ldpc在系统矩阵twoto下的系统仿真,在参数双可变情况下对系统输出的影响,matlab7.0编译通过()
    2007-10-05 12:53:45下载
    积分:1
  • controller
    说明:  alu control 控制 部件 alu control 控制 部件(alu control)
    2010-04-30 10:55:26下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • 696516资源总数
  • 106913会员总数
  • 8今日下载