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

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

RED-HEAD

  • This is a simulator written in Tcl to simulate a network node carrying GSM and GPRS traffics with Qo

    This is a simulator written in Tcl to simulate a network node carrying GSM and GPRS traffics with QoS mechanisms. The payload type including circuit-switched voice, VoIP and web traffic, and the performance including packet drop, delay can be analyzed. The implemented QoS mechanism is DiffServ, with 4 RED queues for different services with different priorities.

    標簽: simulator carrying simulate traffics

    上傳時間: 2014-01-01

    上傳用戶:1583060504

  • 本書是Linux初學者入門優秀教程

    本書是Linux初學者入門優秀教程,介紹了Red Hat Linux 7.1從安裝到使用的詳細過程。

    標簽: Linux 初學者 教程

    上傳時間: 2017-08-15

    上傳用戶:ghostparker

  • A java based programming environment - processing - free from processing.org. here it uses a free l

    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

  • Datastructure: Linked Lists Stack and Queue Multi-lists Linked Structures Trees Binary Tree S

    Datastructure: Linked Lists Stack and Queue Multi-lists Linked Structures Trees Binary Tree Searching and Sorting AVL Tree Red-Black Tree

    標簽: Linked Datastructure Multi-lists Structures

    上傳時間: 2014-05-31

    上傳用戶:xmsmh

  • 這是一篇對armlinux內核啟動的分析

    這是一篇對armlinux內核啟動的分析,主要是arch/arm/kernel/head-armv.S文件, head-armv.S文件是整個內核的入口

    標簽: armlinux 內核

    上傳時間: 2017-08-25

    上傳用戶:chenbhdt

  • The many variants of the Unix operating system require use of a mode of thought that s significantly

    The many variants of the Unix operating system require use of a mode of thought that s significantly different from the one that s required by simpler operating systems. Think Unix introduces readers to important fundamental and intermediate Unix commands and, in the process, inculcates them in the Unix way of thinking. It s a worthy goal in a world with more Linux users than ever, and author Jon Lasser accomplishes it. He s both a capable writer and a knowledgeable user of Unix shell commands. Lasser uses bash under Red Hat Linux in most examples--which usually apply equally well to other Unix variants--and makes asides about other shells and environments, as needed.

    標簽: significantly operating variants of

    上傳時間: 2017-09-04

    上傳用戶:qq521

  • lucene.net盤古分詞實例

    這些資源可以利用,幫你構建全文搜索引擎,主要是通過ChineseAnalyzer來建立索引和進行搜索,效果還不錯

    標簽: 這些資源可以利用 幫你構建全文搜索引擎 主要是通過ChineseAnalyzer來建立索引和進行搜索 效果還不錯

    上傳時間: 2015-04-10

    上傳用戶:kkljlfjdk

  • 兩個鏈表的交集

    兩個鏈表的交集 #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

  • 俄羅斯方塊代碼

    RGB,三原色光模式(英語:RGB color model),又稱RGB顏色模型或紅綠藍顏色模型,是一種加色模型,將紅(Red)、綠(Green)、藍(Blue)三原色的色光以不同的比例相加,以產生多種多樣的色光。RGB顏色模型的主要目的是在電子系統中檢測。

    標簽:

    上傳時間: 2015-06-14

    上傳用戶:lxy123

  • 俄羅斯方塊

    RGB,三原色光模式(英語:RGB color model),又稱RGB顏色模型或紅綠藍顏色模型,是一種加色模型,將紅(Red)、綠(Green)、藍(Blue)三原色的色光以不同的比例相加,以產生多種多樣的色光。RGB顏色模型的主要目的是在電子系統中檢測

    標簽:

    上傳時間: 2015-06-14

    上傳用戶:lxy123

主站蜘蛛池模板: 上蔡县| 枣强县| 安国市| 莒南县| 昭觉县| 泸溪县| 盐池县| 永新县| 青浦区| 长垣县| 阿鲁科尔沁旗| 阿克苏市| 永川市| 玉田县| 化德县| 乳山市| 车致| 金山区| 太康县| 昌平区| 高平市| 清丰县| 长治市| 务川| 新闻| 桂阳县| 舒兰市| 新巴尔虎左旗| 桐乡市| 武穴市| 攀枝花市| 静海县| 凤凰县| 金华市| 长垣县| 科技| 乐昌市| 龙里县| 玉田县| 明水县| 宁海县|