序列對齊 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.
標(biāo)簽： 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.
標(biāo)簽： speed programme is control
上傳時間： 2014-11-22
上傳用戶：jyycc
實現(xiàn)8比特字節(jié)的RS糾錯編碼，可以指定極性校驗字節(jié)數(shù)目，能產(chǎn)生的最大校驗序列長度為255字節(jié)（含極性校驗字節(jié)）.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.
標(biāo)簽： 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
標(biāo)簽： identification considered features separati
上傳時間： 2016-09-20
上傳用戶：FreeSky
void InitGoertzel(void) 作用：初始化算法參數(shù) 用法：采用算法進行檢測前執(zhí)行一次，如果需要改變參數(shù)，調(diào)用SetParameter() float CGoertzel::GetMagnitude(unsigned char * sampleData, int length) //算法主接口 作用：對采集下來的音頻數(shù)據(jù)用算法處理，返回一個結(jié)果 參數(shù)：sampleData－音頻數(shù)據(jù)緩沖地址指針； length-緩沖區(qū)尺寸(音頻數(shù)據(jù)數(shù)量),字節(jié)數(shù)； 返回值：返回算法結(jié)果。 void SetParameter(DWORD set_SampleRate, DWORD set_TargetFreq, DWORD set_BlockSize) 作用：設(shè)置算法參數(shù)； 參數(shù)：set_SampleRate-音頻數(shù)據(jù)抽樣速率； set_TargetFreq-目標(biāo)信號頻率； set_BlockSize－算法數(shù)據(jù)塊尺寸(采樣點)； 用法：調(diào)用本函數(shù)后，需要調(diào)用一次InitGoertzel(void)才會生效
標(biāo)簽： 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.
標(biāo)簽： 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).
標(biāo)簽： 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.
標(biāo)簽： rate and encoders decoders
上傳時間： 2013-12-18
上傳用戶：彭玖華
//順序表的建立、查找、插入與刪除 #include <stdio.h> #include <malloc.h> #include <stdlib.h> #define ListSize 100 //表最大長度 //結(jié)構(gòu)定義 typedef struct SeqList { int node[ListSize] //存放表結(jié)點 int length //當(dāng)前表長度 } SeqList //插入元素 insertList(SeqList *list, int e) { int i=list->length-1 //先將i指定為最后一項 if(i>=ListSize-1) //表已經(jīng)達到最大長度ListSize { printf("表已滿，不能增加新的項!\n")
標(biāo)簽： include gt lt malloc
上傳時間： 2014-01-17
上傳用戶：dongqiangqiang
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
