序列对齐 Compare a protein sequence to a protein sequence database or a DNA sequence to a DNA sequence database using the Smith-Waterman algorithm.[.wat815.] \fCssearch3\fP is about 10-times slower than FASTA3, but is more sensitive for full-length protein sequence comparison.
标签： sequence protein DNA database
上传时间： 2016-08-01
上传用户：wangchong
This programme is to control DC motor in a certain speed using PWM. The target speed is "r", it is the speed in 1s. The sample rate is 0.1s, so the actual speed target is "rc"=r/10. The "r" and "rc" are integer, and the range of "r" is from 50 to 100. Keep rc=r/10!!! The array "speed1" and "speed2" are the control result, in 0.1s and 1s. The length of "speed1" is 2400, and "speed2" is 240. The "pw" and "nw" are the parameters of PWM. The test will last 4 min.
标签： speed programme is control
上传时间： 2014-11-22
上传用户：jyycc
实现8比特字节的RS纠错编码，可以指定极性校验字节数目，能产生的最大校验序列长度为255字节（含极性校验字节）.This is an implementation of a Reed-Solomon code with 8 bit bytes, and a configurable number of parity bytes. The maximum sequence length (codeword) that can be generated is 255 bytes, including parity bytes.
上传时间： 2016-08-24
上传用户：思琦琦
he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.
标签： equivalent likelihood algorithm Sejnowski
上传时间： 2016-09-17
上传用户：Altman
The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is defined as the minimum of the l2-norm between the given time series and a time series that is consistent with the approximate model. The misfit is equal to zero if and only if the model is exact and the smaller the misfit is (by definition) the more accurate the model is. The considered model class consists of all linear time-invariant systems of bounded complexity and the complexity is specified by the number of inputs and the smallest number of lags in a difference equation representation. We present a Matlab function for approximate identification based on misfit minimization. Although the problem formulation is representation independent, we use input/state/output representations of the system in order
标签： identification considered features separati
上传时间： 2016-09-20
上传用户：FreeSky
void InitGoertzel(void) 作用：初始化算法参数 用法：采用算法进行检测前执行一次，如果需要改变参数，调用SetParameter() float CGoertzel::GetMagnitude(unsigned char * sampleData, int length) //算法主接口 作用：对采集下来的音频数据用算法处理，返回一个结果 参数：sampleData－音频数据缓冲地址指针； length-缓冲区尺寸(音频数据数量),字节数； 返回值：返回算法结果。 void SetParameter(DWORD set_SampleRate, DWORD set_TargetFreq, DWORD set_BlockSize) 作用：设置算法参数； 参数：set_SampleRate-音频数据抽样速率； set_TargetFreq-目标信号频率； set_BlockSize－算法数据块尺寸(采样点)； 用法：调用本函数后，需要调用一次InitGoertzel(void)才会生效
标签： void InitGoertzel 算法 初始化
上传时间： 2016-09-20
上传用户：sssl
Write a multithreaded Java, Pthreads, or WIN32 program that outputs prime numbers. This program should work as follows: The user will run the program and will enter a number on the command line. The program will then create a separate thread that outputs all the prime numbers less than or equal to the number entered by the user.
标签： program multithreaded Pthreads numbers
上传时间： 2013-12-21
上传用户：zhyiroy
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
标签： Subsequence sequence Problem Longest
上传时间： 2016-12-08
上传用户：busterman
This package provides encoders and fast Viterbi decoders for the NASA standard rate 1/2 and rate 1/3 constraint length 7 convolutional codes.
标签： rate and encoders decoders
上传时间： 2013-12-18
上传用户：彭玖华
//顺序表的建立、查找、插入与删除 #include <stdio.h> #include <malloc.h> #include <stdlib.h> #define ListSize 100 //表最大长度 //结构定义 typedef struct SeqList { int node[ListSize] //存放表结点 int length //当前表长度 } SeqList //插入元素 insertList(SeqList *list, int e) { int i=list->length-1 //先将i指定为最后一项 if(i>=ListSize-1) //表已经达到最大长度ListSize { printf("表已满，不能增加新的项!\n")
上传时间： 2014-01-17
上传用户：dongqiangqiang
