亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲(chóng)蟲(chóng)首頁(yè)| 資源下載| 資源專(zhuān)輯| 精品軟件
登錄| 注冊(cè)

Fp-growth

  • 現(xiàn)代通信系統(tǒng)要求通信距離遠(yuǎn)、通信容量大、傳輸質(zhì)量好。作為其關(guān)鍵技術(shù)之一的調(diào)制解調(diào)技術(shù)一直是人們研究的一 個(gè)重要方向。討論和仿真實(shí)現(xiàn)了基于FPGA的數(shù)字化DPSK調(diào)制解調(diào)系統(tǒng)。用Altera公司的FP

    現(xiàn)代通信系統(tǒng)要求通信距離遠(yuǎn)、通信容量大、傳輸質(zhì)量好。作為其關(guān)鍵技術(shù)之一的調(diào)制解調(diào)技術(shù)一直是人們研究的一 個(gè)重要方向。討論和仿真實(shí)現(xiàn)了基于FPGA的數(shù)字化DPSK調(diào)制解調(diào)系統(tǒng)。用Altera公司的FPGA開(kāi)發(fā)平臺(tái)Quartus II 3.0實(shí)現(xiàn)了一 個(gè)對(duì)基帶信號(hào)的DPSK調(diào)制解調(diào)系統(tǒng)模型的仿真。

    標(biāo)簽: Altera FPGA DPSK 現(xiàn)代通信

    上傳時(shí)間: 2016-06-15

    上傳用戶(hù):shawvi

  • 序列對(duì)齊 Compare a protein sequence to a protein sequence database or a DNA sequence to a DNA sequenc

    序列對(duì)齊 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

    上傳時(shí)間: 2016-08-01

    上傳用戶(hù):wangchong

  • 模式識(shí)別

    模式識(shí)別,計(jì)算文件夾下fp文件內(nèi)矩陣中的最近最遠(yuǎn)距離

    標(biāo)簽: 模式識(shí)別

    上傳時(shí)間: 2014-08-27

    上傳用戶(hù):15736969615

  • Origin 擬合曲線(xiàn)教程 Contents 1. ORIGIN BASIC FUNCTIONS 2. CHROMATOGRAPHY FUNCTIONS 3. EXPONENTIAL FU

    Origin 擬合曲線(xiàn)教程 Contents 1. ORIGIN BASIC FUNCTIONS 2. CHROMATOGRAPHY FUNCTIONS 3. EXPONENTIAL FUNCTIONS 4. GROWTH/SIGMOIDAL 5. HYPERBOLA FUNCTIONS 6. LOGARITHM FUNCTIONS 7. PEAK FUNCTIONS93 8. PHARMACOLOGY FUNCTIONS 9. POWER FUNCTIONS 10. RATIONAL FUNCTIONS140 11. SPECTROSCOPY FUNCTIONS155 12. WAVEFORM FUNCTIONS....................................................................................................................... 163

    標(biāo)簽: FUNCTIONS CHROMATOGRAPHY EXPONENTIAL Contents

    上傳時(shí)間: 2016-12-15

    上傳用戶(hù):qazxsw

  • Linux was first released into an unsuspecting world in the summer of 1991. Initially the spare-time

    Linux was first released into an unsuspecting world in the summer of 1991. Initially the spare-time hobby of a Finnish computer scientist by the name of Linus Torvalds, Linux was at first accessible only in software source code form to those with enough expertise to build and install it. Early enthusiasts (most also developers themselves by necessity) exploited the growth of the Internet in the early 1990s as a means to build online communities and drive development forward. These communities helped to build the first Linux software distributions, containing all the software components needed to install and use a Linux system without requiring users to be technical experts.

    標(biāo)簽: unsuspecting spare-time Initially the

    上傳時(shí)間: 2013-12-12

    上傳用戶(hù):dianxin61

  • 橢圓濾波器

    橢圓濾波器,fp=2400hz,fs=5000hz,rp=3dB,rs=25dB,求其3dB時(shí)的各項(xiàng)參數(shù)!

    標(biāo)簽: 橢圓 濾波器

    上傳時(shí)間: 2017-07-01

    上傳用戶(hù):h886166

  • 自己做的: (一)用雙線(xiàn)性變換法設(shè)計(jì)并用實(shí)驗(yàn)系統(tǒng)實(shí)現(xiàn)一個(gè)三階的契比雪夫Ⅰ型低通數(shù)字濾波器

    自己做的: (一)用雙線(xiàn)性變換法設(shè)計(jì)并用實(shí)驗(yàn)系統(tǒng)實(shí)現(xiàn)一個(gè)三階的契比雪夫Ⅰ型低通數(shù)字濾波器,其采樣頻率Fs =8KHz,1DB通帶邊界頻率為fp=2KHz。 (二)用雙線(xiàn)性變換法設(shè)計(jì)并用實(shí)驗(yàn)系統(tǒng)實(shí)現(xiàn)一個(gè)三階的契比雪夫Ⅱ型高通數(shù)字濾波器,其采樣頻率Fs =16KHz,阻帶邊界頻率為fst =4KHz,As=20dB。

    標(biāo)簽: 雙線(xiàn)性變換 低通 實(shí)驗(yàn)系統(tǒng) 數(shù)字濾波器

    上傳時(shí)間: 2013-12-25

    上傳用戶(hù):D&L37

  • VHDL source codes of the FPGA64, a fpga implementation of the C64 computer. Version for the c-one fp

    VHDL source codes of the FPGA64, a fpga implementation of the C64 computer. Version for the c-one fpga board.

    標(biāo)簽: the implementation computer Version

    上傳時(shí)間: 2017-09-24

    上傳用戶(hù):wqxstar

  • MATLAB

    基于MATLAB的FPGA基于MATLAB的FP基于MAT基于MATLAB的FPGALAB的FPGAGA

    標(biāo)簽: MATLAB FPGA

    上傳時(shí)間: 2015-11-04

    上傳用戶(hù):SIGUA

  • 運(yùn)動(dòng)會(huì)源代碼

    #include <malloc.h>       #include <stdio.h>       #include <stdlib.h>       #include <string.h>       #define NULL 0      #define MaxSize 30          typedef struct athletestruct /*運(yùn)動(dòng)員*/     {         char name[20];          int score; /*分?jǐn)?shù)*/         int range; /**/         int item; /*項(xiàng)目*/     }ATH;     typedef struct schoolstruct /*學(xué)校*/     {         int count; /*編號(hào)*/         int serial; /**/          int menscore; /*男選手分?jǐn)?shù)*/         int womenscore; /*女選手分?jǐn)?shù)*/         int totalscore; /*總分*/         ATH athlete[MaxSize]; /**/         struct schoolstruct *next;      }SCH;         int nsc,msp,wsp;      int ntsp;      int i,j;      int overgame;      int serial,range;      int n;      SCH *head,*pfirst,*psecond;      int *phead=NULL,*pafirst=NULL,*pasecond=NULL;     void create();         void input ()     {         char answer;          head = (SCH *)malloc(sizeof(SCH)); /**/         head->next = NULL;         pfirst = head;          answer = 'y';         while ( answer == 'y' )         {         Is_Game_DoMain:         printf("\nGET Top 5 when odd\nGET Top 3 when even");         printf("\n輸入運(yùn)動(dòng)項(xiàng)目序號(hào) (x<=%d):",ntsp);         scanf("%d",pafirst);         overgame = *pafirst;         if ( pafirst != phead )         {             for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ )             {                 if ( overgame == *pasecond )                 {                     printf("\n這個(gè)項(xiàng)目已經(jīng)存在請(qǐng)選擇其他的數(shù)字\n");                     goto Is_Game_DoMain;                 }             }         }         pafirst = pafirst + 1;         if ( overgame > ntsp )         {             printf("\n項(xiàng)目不存在");             printf("\n請(qǐng)重新輸入");             goto Is_Game_DoMain;         }         switch ( overgame%2 )         {         case 0: n = 3;break;         case 1: n = 5;break;         }         for ( i = 1 ; i <= n ; i++ )         {         Is_Serial_DoMain:         printf("\n輸入序號(hào) of the NO.%d (0<x<=%d): ",i,nsc);                 scanf("%d",&serial);         if ( serial > nsc )          {             printf("\n超過(guò)學(xué)校數(shù)目,請(qǐng)重新輸入");             goto Is_Serial_DoMain;         }         if ( head->next == NULL )          {             create();         }         psecond = head->next ;          while ( psecond != NULL )          {             if ( psecond->serial == serial )             {                 pfirst = psecond;                 pfirst->count = pfirst->count + 1;                 goto Store_Data;             }             else             {                 psecond = psecond->next;             }         }         create();         Store_Data:                 pfirst->athlete[pfirst->count].item = overgame;         pfirst->athlete[pfirst->count].range = i;         pfirst->serial = serial;         printf("Input name:) : ");                 scanf("%s",pfirst->athlete[pfirst->count].name);         }         printf("\n繼續(xù)輸入運(yùn)動(dòng)項(xiàng)目(y&n)?");         answer = getchar();         printf("\n");         }     }         void calculate() /**/     {         pfirst = head->next;         while ( pfirst->next != NULL )         {             for (i=1;i<=pfirst->count;i++)             {                 if ( pfirst->athlete[i].item % 2 == 0 )                  {                     switch (pfirst->athlete[i].range)                     {                     case 1:pfirst->athlete[i].score = 5;break;                     case 2:pfirst->athlete[i].score = 3;break;                     case 3:pfirst->athlete[i].score = 2;break;                     }                 }                 else                  {                     switch (pfirst->athlete[i].range)                     {                     case 1:pfirst->athlete[i].score = 7;break;                     case 2:pfirst->athlete[i].score = 5;break;                     case 3:pfirst->athlete[i].score = 3;break;                     case 4:pfirst->athlete[i].score = 2;break;                     case 5:pfirst->athlete[i].score = 1;break;                     }                 }                 if ( pfirst->athlete[i].item <=msp )                  {                     pfirst->menscore = pfirst->menscore + pfirst->athlete[i].score;                 }                 else                  {                     pfirst->womenscore = pfirst->womenscore + pfirst->athlete[i].score;                 }             }             pfirst->totalscore = pfirst->menscore + pfirst->womenscore;             pfirst = pfirst->next;         }     }         void output()     {         pfirst = head->next;         psecond = head->next;         while ( pfirst->next != NULL )          {             // clrscr();              printf("\n第%d號(hào)學(xué)校的結(jié)果成績(jī):",pfirst->serial);             printf("\n\n項(xiàng)目的數(shù)目\t學(xué)校的名字\t分?jǐn)?shù)");             for (i=1;i<=ntsp;i++)              {                 for (j=1;j<=pfirst->count;j++)                  {                     if ( pfirst->athlete[j].item == i )                     {                                                                         printf("\n %d\t\t\t\t\t\t%s\n %d",i,pfirst->athlete[j].name,pfirst->athlete[j].score);break;                                             }                 }             }             printf("\n\n\n\t\t\t\t\t\t按任意建 進(jìn)入下一頁(yè)");             getchar();             pfirst = pfirst->next;         }     //  clrscr();          printf("\n運(yùn)動(dòng)會(huì)結(jié)果:\n\n學(xué)校編號(hào)\t男運(yùn)動(dòng)員成績(jī)\t女運(yùn)動(dòng)員成績(jī)\t總分");         pfirst = head->next;         while ( pfirst->next != NULL )         {             printf("\n %d\t\t %d\t\t %d\t\t %d",pfirst->serial,pfirst->menscore,pfirst->womenscore,pfirst->totalscore);             pfirst = pfirst->next;         }         printf("\n\n\n\t\t\t\t\t\t\t按任意建結(jié)束");         getchar();     }         void create()     {                 pfirst = (struct schoolstruct *)malloc(sizeof(struct schoolstruct));         pfirst->next = head->next ;         head->next = pfirst ;                 pfirst->count = 1;         pfirst->menscore = 0;         pfirst->womenscore = 0;         pfirst->totalscore = 0;     }     void Save()     {FILE *fp;     if((fp = fopen("school.dat","wb"))==NULL)     {printf("can't open school.dat\n");     fclose(fp);     return;     }     fwrite(pfirst,sizeof(SCH),10,fp);     fclose(fp);     printf("文件已經(jīng)成功保存\n");     }         void main()     {         system("cls");         printf("\n\t\t\t 運(yùn)動(dòng)會(huì)分?jǐn)?shù)統(tǒng)計(jì)\n");         printf("輸入學(xué)校數(shù)目 (x>= 5):");         scanf("%d",&nsc);          printf("輸入男選手的項(xiàng)目(x<=20):");         scanf("%d",&msp);          printf("輸入女選手項(xiàng)目(<=20):");         scanf("%d",&wsp);          ntsp = msp + wsp;                  phead = (int *)calloc(ntsp,sizeof(int));         pafirst = phead;         pasecond = phead;         input();         calculate();          output();         Save();     }             

    標(biāo)簽: 源代碼

    上傳時(shí)間: 2016-12-28

    上傳用戶(hù):150501

主站蜘蛛池模板: 五大连池市| 盐池县| 遵化市| 杂多县| 凤台县| 阳朔县| 澄江县| 诸暨市| 樟树市| 宽甸| 含山县| 昂仁县| 永清县| 濮阳县| 循化| 九台市| 安仁县| 富宁县| 阿克陶县| 巩义市| 县级市| 客服| 房产| 南部县| 海丰县| 平度市| 江陵县| 南陵县| 抚顺市| 宝坻区| 资中县| 鹤岗市| 建瓯市| 米泉市| 建瓯市| 循化| 镇江市| 招远市| 庆云县| 江阴市| 宁陕县|