A java based programming environment - processing - free from processing.org. here it uses a free library - OpenCV - to detect blobs in a live video capture - some parts like - hands or HeAD or the entire human are evidenced through some visual effects.
标签： processing free environment programming
上传时间： 2013-12-26
上传用户：erkuizhang
这是一篇对armlinux内核启动的分析，主要是arch/arm/kernel/HeAD-armv.S文件， HeAD-armv.S文件是整个内核的入口
上传时间： 2017-08-25
上传用户：chenbhdt
两个链表的交集 #include<stdio.h> #include<stdlib.h> typedef struct Node{ int data; struct Node *next; }Node; void initpointer(struct Node *p){ p=NULL; } int printlist(struct Node* HeAD){ int flag=1; HeAD=HeAD->next; /* 因为标记1的地方你用了头结点，所以第一个数据域无效，应该从下一个头元结点开始 */ if(HeAD==NULL) printf("NULL\n"); else { while(HeAD!=NULL) { if(flag==1) { printf("%d",HeAD->data); flag=0; } else { printf(" %d",HeAD->data); } HeAD=HeAD->next; } printf("\n"); } return 0; } struct Node *creatlist(struct Node *HeAD) { int n; struct Node *p1=(struct Node *)malloc(sizeof(struct Node)); p1->next=NULL; while(scanf("%d",&n),n!=-1) { struct Node *pnode=(struct Node *)malloc(sizeof(struct Node)); pnode->next=NULL; pnode->data=n; if(HeAD==NULL) HeAD=pnode; p1->next=pnode; p1=pnode; } return HeAD; } struct Node *Intersect(struct Node *HeAD1, struct Node *HeAD2) { struct Node *p1=HeAD1,*p2=HeAD2;/*我这里没有用头指针和头结点，这里是首元结点HeAD1里面就是第一个数据，一定要理解什么事头指针， 头结点，和首元结点 具体你一定要看这个博客：http://blog.sina.com.cn/s/blog_71e7e6fb0101lipz.html*/ struct Node *HeAD,*p,*q; HeAD = (struct Node *)malloc(sizeof(struct Node)); HeAD->next = NULL; p = HeAD; while( (p1!=NULL)&&(p2!=NULL) ) { if (p1->data == p2->data) { q = (struct Node *)malloc(sizeof(struct Node)); q->data = p1->data; q->next = NULL; p->next = q;//我可以认为你这里用了头结点，也就是说第一个数据域无效 **标记1** p = q; p1 = p1->next; p2 = p2->next; } else if (p1->data < p2->data) { p1 = p1->next; } else { p2 = p2->next; } } return HeAD; } int main() { struct Node *HeAD=NULL,*HeADt=NULL,*t; //initpointer(HeAD);//这里的函数相当于HeAD=NULL; // initpointer(HeADt);//上面已经写了HeADt=NULL那么这里可以不用调用这个函数 HeAD=creatlist(HeAD); HeADt=creatlist(HeADt); t=Intersect(HeAD,HeADt); printlist(t); }
标签： c语言编程
上传时间： 2015-04-27
上传用户：coco2017co
#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
This change clarifies guidance for the HeAD strike zone, to standardize application of the HeAD strike zone when showing compliance with Title 14, Code of Federal Regulations
标签： AC_25-17A_CHG-1
上传时间： 2017-02-15
上传用户：freemind
CCS样式选择符，初学者，设计，DW，网页制作，大一作业 部分预览： <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <HeAD> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>CSS样式选择符</title> <style type="text/css"> body { background-image:url(images/%E8%83%8C%E6%99%AF%E5%9B%BE%E7%89%87.jpg); background-repeat:repeat; } .class1 { text-align:center; font-weight:bolder; } .class2 { font-family:"仿宋"; text-indent:8em; } .class3 { font-size:18px; font-family:"宋体"; text-indent:4em; } #id1 { font-family:Zombie, Verdana, "Comic Sans MS"; font-style:oblique; font-size:64px; } #id2 { font-family:"黑体"; font-size:36px; } #id3 { color:#F69; font-weight:bolder; text-shadow:#FCC; } </style> </HeAD> <body> <table width="780" height="1555" border="0" cellspacing="0" align="center" bgcolor="#FFFFFF"> <tr height="30"> <td align="center"><img src="images/顶部图片.jpg" /></td> </tr>
上传时间： 2017-12-07
上传用户：圈圈Ace
#include <stdio.h> #include <stdlib.h> ///链式栈 typedef struct node { int data; struct node *next; }Node,*Linklist; Linklist Createlist() { Linklist p; Linklist h; int data1; scanf("%d",&data1); if(data1 != 0) { h = (Node *)malloc(sizeof(Node)); h->data = data1; h->next = NULL; } else if(data1 == 0) return NULL; scanf("%d",&data1); while(data1 != 0) { p = (Node *)malloc(sizeof(Node)); p -> data = data1; p -> next = h; h = p; scanf("%d",&data1); } return h; } void Outputlist(Node *HeAD) { Linklist p; p = HeAD; while(p != NULL ) { printf("%d ",p->data); p = p->next; } printf("\n"); } void Freelist(Node *HeAD) { Node *p; Node *q = NULL; p = HeAD; while(p != NULL) { q = p; p = p->next; free(q); } } int main() { Node *HeAD; HeAD = Createlist(); Outputlist(HeAD); Freelist(HeAD); return 0; } 2.顺序栈 [cpp] view plain copy #include <iostream> #include <stdio.h> #include <stdlib.h> ///顺序栈 #define MaxSize 100 using namespace std; typedef
上传时间： 2018-05-09
上传用户：123456..
#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..
css美化有序列表，贴出部分css代码 <ol > <li>先涂粉底再涂防晒</li> <li>先涂防晒再涂粉底</li> </ol> <!doctype html> <html> <HeAD> <title>CSS3 ordered list styles - demo</title> <style> body{ margin: 40px auto; width: 500px; } /* -------------------------------------- */ ol{ counter-reset: li; list-style: none; *list-style: decimal; font: 15px 'trebuchet MS', 'lucida sans'; padding: 0; margin-bottom: 4em; text-shadow: 0 1px 0 rgba(255,255,255,.5); } ol ol{ margin: 0 0 0 2em; } /* -------------------------------------- */
上传时间： 2018-08-22
上传用户：53660542
This book gives a comprehensive overview of the technologies for the advances of mobile radio access networks. The topics covered include linear transmitters, superconducting filters and cryogenic radio frequency (RF) front HeAD, radio over fiber, software radio base stations, mobile terminal positioning, high speed downlink packet access (HSDPA), multiple antenna systems such as smart antennas and multiple input and multiple output (MIMO) systems, orthogonal frequency division multiplexing (OFDM) systems, IP-based radio access networks (RAN), autonomic networks, and ubiquitous networks.
标签： Advances Networks Access Mobile Radio in
上传时间： 2020-05-26
上传用户：shancjb
