这个设计是使用Virtex-4实现DDR的控制器的，设计分为三个主要模块：Front-End FIFOs,DDR SDRAM Controller和Datapath Module。其中主要是DDR SDRAM Controller,当然还有测试模块。
上传时间： 2017-05-20
上传用户：llandlu
Emdros is a text database middleware-layer aimed at storage and retrieval of "text plus information about that text." This information could be linguistic analyses or other annotations. Emdros provides an abstraction of text that makes it well suited to storing /syntactic analyses/ of text, but other linguistic information is supported as well. Emdros comes with a query-language, MQL, that enables powerful queries. Emdros acts as a middleware-layer between a client (not provided) and a database back-end. Currently, PostgreSQL, MySQL, and SQLite (2 and 3) are supported, but other back-ends can easily be added.
标签： text middleware-layer information retrieval
上传时间： 2014-01-02
上传用户：wfeel
Wireless range extenders or wireless repeaters can extend the range of an existing wireless network. Range extenders can be strategically placed to elongate a signal area or allow for the signal area to reach around barriers such as those created in L-shaped corridors. Wireless devices connected through repeaters will suffer from an increased latency for each hop. Additionally, a wireless device connected to any of the repeaters in the chain will have a throughput that is limited by the weakest link between the two nodes in the chain from which the connection originates to where the connection ends
标签： wireless range extenders repeaters
上传时间： 2014-01-02
上传用户：zhangyigenius
AVR single-chip developed by a very low threshold, as long as the computer will be able to study the development of AVR microcontroller. Only a single-chip ISP download beginners line, the editing, debugging of software programs through a direct line into the AVR microcontroller, which can develop AVR Series Single-chip package of a variety of devices. AVR single-chip microcomputer in the industry known as "front-line struggle to seize state power."
标签： single-chip developed threshold the
上传时间： 2017-09-12
上传用户：shinesyh
AVR single-chip developed by a very low threshold, as long as the computer will be able to study the development of AVR microcontroller. Only a single-chip ISP download beginners line, the editing, debugging of software programs through a direct line into the AVR microcontroller, which can develop AVR Series Single-chip package of a variety of devices. AVR single-chip microcomputer in the industry known as "front-line struggle to seize state power."
标签： single-chip developed threshold the
上传时间： 2013-12-09
上传用户：invtnewer
DATAS SEGMENT w dw 0 keybuf db 255 db 0 db 255 dup(0) ;定义键盘输入需要的缓冲区 DATAS ENDS STACKS SEGMENT db 200 dup(?) STACKS ENDS CODES SEGMENT ASSUME CS:CODES,DS:DATAS,SS:STACKS START: MOV AX,DATAS MOV DS,AX mov dx,offset keybuf ;用0a号功能，输入一个字符串 mov ah,0ah ;用回车结束 int 21h mov dl,0ah ;再进行换行，以便在下一行显示转换后的字符串 mov ah,2 int 21h ; push ax ; push dx ; mov dl,cl ; mov ah,02 ; int 21h ; pop dx ; pop ax mov bx,offset keybuf+1 ;取出字符串的字符个数，作为循环的次数 mov cl,[bx] mov ch,0 mov ax,0 again: inc bx mov ax,[w] push bx mov bx,16 mul bx pop bx ;是小写字母，则转换为大写字母 mov [w],ax mov dl,[bx] ;取出一个字符， cmp dl,'9' jbe lab1 cmp dl,'F' jbe lab2 sub dl,32 lab2: sub dl ,07h lab1: sub dl,30h add [w],dx loop again mov ax,[w] mov bx,-1 push bx mov bx,10 lab3 :mov dx,0 div bx push dx cmp ax,0 jnz lab3 lab5: pop dx cmp dx,-1 jz lab4 add dl,30h mov ah,02 int 21h jmp lab5 ;循环，处理完整个字符串 lab4: MOV AH,4CH INT 21H CODES ENDS END START
标签： 汇编
上传时间： 2015-04-02
上传用户：wcc0310
UNTER EQU 35H;显示计数 REMVOL EQU 36H;音量连续控制 DISPBUFF1 EQU 37H; DISPBUFF2 EQU 38H; DISPBUFF3 EQU 39H; DISPBUFF EQU 3AH; SDA BIT P3.4 SCL BIT P3.2 MTD EQU 30H;PT2258数据首址 NUMBYT EQU 3BH;PT2258数据位数 CS_X1 EQU 3CH;遥控 CS0_X1 EQU 3DH U0_X1 EQU 3EH;遥控数据暂存区 NO_M EQU 40H;数据码 FRONT EQU 41H
标签： PT2258
上传时间： 2015-04-26
上传用户：solomon33
判断奇偶数的汇编程序CODE SEGMENT ASSUME CS: CODE START: MOV AH, 01H ; 调用 DOS中断的1号子功能(键入一个字符)， INT 21H ; AL←键入一位数字 CMP AL, 30H ; 若输入比‘0’小的字符则重新输入 JB START CMP AL, 39H ; 若输入比‘9’大的字符则重新输入 JA START CLC ; CF标志清0 SHR AL, 1 ; AL最低位移入CF JNC EVN ; 根据CF的状态，判断输入数字的奇偶性 MOV BL, 31H ; 奇数，BL←1的ASCII码 JMP DISP EVN: MOV BL, 30H ; 偶数，BL←0的ASCII码 DISP: MOV AH, 02H ; 调用DOS中断的2号子功能，输出字符 MOV DL, 0AH ; 输出换行 INT 21H MOV DL, 0DH ; 输出回车 INT 21H MOV DL, BL ; 输出标志字符 INT 21H mov ah, 1 int 21h MOV AH, 4CH ; 返回DOS INT 21H CODE ENDS END START
上传时间： 2015-06-10
上传用户：zhuangxj618
gif捕捉制作工具： Demo ends:1034044285 名字:kukuasir 注册码:这里输入新注册码 录制区域:0,0 1024x738 帧的延时:500 帧间透明:是 记录时间信息:是 循环:是 屏幕仿真:是 覆盖边缘:是 覆盖指针:是 Explorer 2.0 兼容:否 录制尺寸:100
标签： gif捕捉制作
上传时间： 2015-10-19
上传用户：dumpsoft
#include <iostream> #include <stdio.head> #include <stdlib.head> #include <string.head> #define ElemType int #define max 100 using namespace std; typedef struct node1 { ElemType data; struct node1 *next; }Node1,*LinkList;//链栈 typedef struct { ElemType *base; int top; }SqStack;//顺序栈 typedef struct node2 { ElemType data; struct node2 *next; }Node2,*LinkQueue; typedef struct node22 { LinkQueue front; LinkQueue rear; }*LinkList;//链队列 typedef struct { ElemType *base; int front,rear; }SqQueue;//顺序队列 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 //1．采用链式存储实现栈的初始化、入栈、出栈操作。 LinkList CreateStack()//创建栈 { LinkList top; top=NULL; return top; } bool StackEmpty(LinkList s)//判断栈是否为空，0代表空 { if(s==NULL) return 0; else return 1; } LinkList Pushead(LinkList s,int x)//入栈 { LinkList q,top=s; q=(LinkList)malloc(sizeof(Node1)); q->data=x; q->next=top; top=q; return top; } LinkList Pop(LinkList s,int &e)//出栈 { if(!StackEmpty(s)) { printf("栈为空。"); } else { e=s->data; LinkList p=s; s=s->next; free(p); } return s; } void DisplayStack(LinkList s)//遍历输出栈中元素 { if(!StackEmpty(s)) printf("栈为空。"); else { wheadile(s!=NULL) { cout<<s->data<<" "; s=s->next; } cout<<endl; } } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 //2．采用顺序存储实现栈的初始化、入栈、出栈操作。 int StackEmpty(int t)//判断栈S是否为空 { SqStack.top=t; if (SqStack.top==0) return 0; else return 1; } int InitStack() { SqStack.top=0; return SqStack.top; } int pushead(int t,int e) { SqStack.top=t; SqStack.base[++SqStack.top]=e; return SqStack.top; } int pop(int t,int *e)//出栈 { SqStack.top=t; if(!StackEmpty(SqStack.top)) { printf("栈为空."); return SqStack.top; } *e=SqStack.base[s.top]; SqStack.top--; return SqStack.top; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 //3．采用链式存储实现队列的初始化、入队、出队操作。 LinkList InitQueue()//创建 { LinkList head; head->rear=(LinkQueue)malloc(sizeof(Node)); head->front=head->rear; head->front->next=NULL; return head; } void deleteEle(LinkList head,int &e)//出队 { LinkQueue p; p=head->front->next; e=p->data; head->front->next=p->next; if(head->rear==p) head->rear=head->front; free(p); } void EnQueue(LinkList head,int e)//入队 { LinkQueue p=(LinkQueue)malloc(sizeof(Node)); p->data=e; p->next=NULL; head->rear->next=p; head->rear=p; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 //4．采用顺序存储实现循环队列的初始化、入队、出队操作。 bool InitQueue(SqQueue &head)//创建队列 { head.data=(int *)malloc(sizeof(int)); head.front=head.rear=0; return 1; } bool EnQueue(SqQueue &head,int e)//入队 { if((head.rear+1)%MAXQSIZE==head.front) { printf("队列已满\n"); return 0; } head.data[head.rear]=e; head.rear=(head.rear+1)%MAXQSIZE; return 1; } int QueueLengthead(SqQueue &head)//返回队列长度 { return (head.rear-head.front+MAXQSIZE)%MAXQSIZE; } bool deleteEle(SqQueue &head,int &e)//出队 { if(head.front==head.rear) { cout<<"队列为空！"<<endl; return 0; } e=head.data[head.front]; head.front=(head.front+1)%MAXQSIZE; return 1; } int gethead(SqQueue head)//得到队列头元素 { return head.data[head.front]; } int QueueEmpty(SqQueue head)//判断队列是否为空 { if (head.front==head.rear) return 1; else return 0; } void travelQueue(SqQueue head)//遍历输出 { wheadile(head.front!=head.rear) { printf("%d ",head.data[head.front]); head.front=(head.front+1)%MAXQSIZE; } cout<<endl; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 //5．在主函数中设计一个简单的菜单，分别测试上述算法。 int main() { LinkList top=CreateStack(); int x; wheadile(scanf("%d",&x)!=-1) { top=Pushead(top,x); } int e; wheadile(StackEmpty(top)) { top=Pop(top,e); printf("%d ",e); }//以上是链栈的测试 int top=InitStack(); int x; wheadile(cin>>x) top=pushead(top,x); int e; wheadile(StackEmpty(top)) { top=pop(top,&e); printf("%d ",e); }//以上是顺序栈的测试 LinkList Q; Q=InitQueue(); int x; wheadile(scanf("%d",&x)!=-1) { EnQueue(Q,x); } int e; wheadile(Q) { deleteEle(Q,e); printf("%d ",e); }//以上是链队列的测试 SqQueue Q1; InitQueue(Q1); int x; wheadile(scanf("%d",&x)!=-1) { EnQueue(Q1,x); } int e; wheadile(QueueEmpty(Q1)) { deleteEle(Q1,e); printf("%d ",e); } return 0; }
上传时间： 2018-05-09
上传用户：123456..
