虫虫首页|资源下载|资源专辑|精品软件
登录|注册

Fp-growth

  • 现代通信系统要求通信距离远、通信容量大、传输质量好。作为其关键技术之一的调制解调技术一直是人们研究的一 个重要方向。讨论和仿真实现了基于FPGA的数字化DPSK调制解调系统。用Altera公司的FP

    现代通信系统要求通信距离远、通信容量大、传输质量好。作为其关键技术之一的调制解调技术一直是人们研究的一 个重要方向。讨论和仿真实现了基于FPGA的数字化DPSK调制解调系统。用Altera公司的FPGA开发平台Quartus II 3.0实现了一 个对基带信号的DPSK调制解调系统模型的仿真。

    标签: Altera FPGA DPSK 现代通信

    上传时间: 2016-06-14

    上传用户:shawvi

  • 序列对齐 Compare a protein sequence to a protein sequence database or a DNA sequence to a DNA sequenc

    序列对齐 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-07-31

    上传用户:wangchong

  • 模式识别

    模式识别,计算文件夹下fp文件内矩阵中的最近最远距离

    标签: 模式识别

    上传时间: 2014-08-27

    上传用户:15736969615

  • Origin 拟合曲线教程 Contents 1. ORIGIN BASIC FUNCTIONS 2. CHROMATOGRAPHY FUNCTIONS 3. EXPONENTIAL FU

    Origin 拟合曲线教程 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

    标签: FUNCTIONS CHROMATOGRAPHY EXPONENTIAL Contents

    上传时间: 2016-12-14

    上传用户: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.

    标签: unsuspecting spare-time Initially the

    上传时间: 2013-12-12

    上传用户:dianxin61

  • 椭圆滤波器

    椭圆滤波器,fp=2400hz,fs=5000hz,rp=3dB,rs=25dB,求其3dB时的各项参数!

    标签: 椭圆 滤波器

    上传时间: 2017-07-01

    上传用户:h886166

  • 自己做的: (一)用双线性变换法设计并用实验系统实现一个三阶的契比雪夫Ⅰ型低通数字滤波器

    自己做的: (一)用双线性变换法设计并用实验系统实现一个三阶的契比雪夫Ⅰ型低通数字滤波器,其采样频率Fs =8KHz,1DB通带边界频率为fp=2KHz。 (二)用双线性变换法设计并用实验系统实现一个三阶的契比雪夫Ⅱ型高通数字滤波器,其采样频率Fs =16KHz,阻带边界频率为fst =4KHz,As=20dB。

    标签: 双线性变换 低通 实验系统 数字滤波器

    上传时间: 2013-12-25

    上传用户: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.

    标签: the implementation computer Version

    上传时间: 2017-09-24

    上传用户:wqxstar

  • MATLAB

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

    标签: MATLAB FPGA

    上传时间: 2015-11-04

    上传用户:SIGUA

  • 运动会源代码

    #include <malloc.h>       #include <stdio.h>       #include <stdlib.h>       #include <string.h>       #define NULL 0      #define MaxSize 30          typedef struct athletestruct /*运动员*/     {         char name[20];          int score; /*分数*/         int range; /**/         int item; /*项目*/     }ATH;     typedef struct schoolstruct /*学校*/     {         int count; /*编号*/         int serial; /**/          int menscore; /*男选手分数*/         int womenscore; /*女选手分数*/         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输入运动项目序号 (x<=%d):",ntsp);         scanf("%d",pafirst);         overgame = *pafirst;         if ( pafirst != phead )         {             for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ )             {                 if ( overgame == *pasecond )                 {                     printf("\n这个项目已经存在请选择其他的数字\n");                     goto Is_Game_DoMain;                 }             }         }         pafirst = pafirst + 1;         if ( overgame > ntsp )         {             printf("\n项目不存在");             printf("\n请重新输入");             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输入序号 of the NO.%d (0<x<=%d): ",i,nsc);                 scanf("%d",&serial);         if ( serial > nsc )          {             printf("\n超过学校数目,请重新输入");             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继续输入运动项目(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号学校的结果成绩:",pfirst->serial);             printf("\n\n项目的数目\t学校的名字\t分数");             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按任意建 进入下一页");             getchar();             pfirst = pfirst->next;         }     //  clrscr();          printf("\n运动会结果:\n\n学校编号\t男运动员成绩\t女运动员成绩\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按任意建结束");         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("文件已经成功保存\n");     }         void main()     {         system("cls");         printf("\n\t\t\t 运动会分数统计\n");         printf("输入学校数目 (x>= 5):");         scanf("%d",&nsc);          printf("输入男选手的项目(x<=20):");         scanf("%d",&msp);          printf("输入女选手项目(<=20):");         scanf("%d",&wsp);          ntsp = msp + wsp;                  phead = (int *)calloc(ntsp,sizeof(int));         pafirst = phead;         pasecond = phead;         input();         calculate();          output();         Save();     }             

    标签: 源代码

    上传时间: 2016-12-28

    上传用户:150501