SharpPcap c#抓包实现时时获取网卡信息 SharpPcap tutorial: a step by step guide to using SharpPcap The text of this tutorial is taken directly from WinPcap's official tutorial but is modified to show the C# use of the SharpPcap library. All examples can be downloaded together with SharpPcap source code from SharpPcap 's homepage. The WinPcap library must be installed before attempting to run any of these examples, so please download and install the latest version from WinPcap's download page. SharpPcap was written and tested using .NET v1.1 and Windows 2000/XP. I have no idea about other .NET and Windows versions. If you do try it, please report your results. The following topics are covered in this tutorial: Obtaining the device list Obtaining advanced information about installed devices Opening an adapter and capturing packets Capturing packets without the event handler Filtering the traffic Interpreting the packets Handling offline dump files Sending Packets Gathering Statistics on the network traffic 1. Obtaining the device list
上传时间： 2015-07-06
上传用户：muzongda
===================================== GoAhead WebServer 2.1.8 Release Notes ===================================== .. NOTES: .. This document is maintained using the reStructuredText markup system. .. You may download this from <http://docutils.sf.net>. Also note that running .. the docutils code requires that a version of Python version 2.1 or later .. be installed on the machine. Since the GoAhead release procedure itself .. runs in Python, this should not be a problem. .. .. To add new entries to the release notes, follow the markup shown below .. (releases should be underlined with a row of '=' characters, each item .. noted within a release should be underlined with '-' characters.
上传时间： 2016-01-29
上传用户：zrxkn
===================================== GoAhead WebServer 2.1.8 Release Notes ===================================== .. NOTES: .. This document is maintained using the reStructuredText markup system. .. You may download this from <http://docutils.sf.net>. Also note that running .. the docutils code requires that a version of Python version 2.1 or later .. be installed on the machine. Since the GoAhead release procedure itself .. runs in Python, this should not be a problem. .. .. To add new entries to the release notes, follow the markup shown below .. (releases should be underlined with a row of '=' characters, each item .. noted within a release should be underlined with '-' characters.
标签： web html embed server arm small http
上传时间： 2016-01-29
上传用户：zrxkn
DLMS 编辑 本词条缺少名片图，补充相关内容使词条更完整，还能快速升级，赶紧来编辑吧！ 配电线报文规范(Distribution Line Message Specification) [IEC 62056-53]是应用层规范，独立于应用层以下的各个低层，因而也就与通信信道无关，设计用于在计算机集成环境中支持与（能量）分配设备间的消息交换，是由IEC TC57建立并以IEC 61334-4-41发布的国际标准。 中文名 配电线报文规范 外文名 Distribution Line Message Specification) 建立者 IEC TC57 应用领域 于抄表、远程控制以及增值服务等 这个概念被进一步发展成为设备语言报文规范，其目的在于为结构化建模和仪表数据交换提供一个互操作环境，支持任何能量类型如电、水、气或热的计量，应用于远程抄表、远程控制以及增值服务
上传时间： 2016-04-07
上传用户：auqaiss
《模拟城市》(SimCity)是美国艺电出品的一个城市建造(City-building game)的电子游戏，首部作品发售于1989年，是Maxis的第一个产品。最初发行的平台为DOS，之后又陆续推出了麦金塔、Windows与超级任天堂等平台上的版本。当前该系列的版权所有者以及发行商为美国艺电(EA)。 2008年1月10日，EA以GPL协议开放原始版本，更名为Micropolis，特别针对OLPC。 在2013年EA/Maxis发布了全新的《模拟城市》系列游戏，将游戏名称定为与1989年相同的名称《模拟城市》，并且通过Origin平台才可以进行游戏。在Maxis被问道这款游戏是否叫做“模拟城市5”的时候，Maxis说，这款游戏不是《模拟城市4》的迭代，而是一款全新的游戏，我们叫他《模拟城市》。国内外的《模拟城市》粉丝们将它叫做《模拟城市(2013)》或者“SC(2013)”。 为了相互区别Maxis的第一部和第五部作品，本词条用游戏发布时间分别命名为《模拟城市(1989)》和《模拟城市(2013)》。EA/Maxis官方目前分别称之为：Micropolis和SimCity(港台译名：模拟城市)。
上传时间： 2016-10-22
上传用户：86kl
电子电路设计手册
上传时间： 2016-11-06
上传用户：moon1992
#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
《北京折叠》是科幻作家郝景芳创作的中短篇小说。该小说创造了一个更极端的类似情景，书里的北京不知年月，空间分为三层，不同的人占据了不同的空间，也按照不同的比例，分配着每个 48 小时周期。
标签： 折叠
上传时间： 2017-03-11
上传用户：qqqly92
选择文件 X 纯手工生成的PE可执行文件
标签： 可执行文件
上传时间： 2017-03-12
上传用户：cookidog
选择文件 X 无刷直流电动机Matlab仿真建模及模型中S函数
标签： Matlab 无刷直流电动机 仿真建模 S函数 模型 编写
上传时间： 2017-03-13
上传用户：Lincy
