===================================== 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.
標(biāo)簽： web server embedded arm
上傳時(shí)間： 2016-01-30
上傳用戶(hù)：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.
標(biāo)簽： web html embed server arm small http
上傳時(shí)間： 2016-01-30
上傳用戶(hù)：zrxkn
#include <malloc.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define NULL 0 #define MaxSize 30 typedef struct athletestruct /*運(yùn)動(dòng)員*/ { char name[20]; int score; /*分?jǐn)?shù)*/ int range; /**/ int item; /*項(xiàng)目*/ }ATH; typedef struct schoolstruct /*學(xué)校*/ { int count; /*編號(hào)*/ int serial; /**/ int menscore; /*男選手分?jǐn)?shù)*/ int womenscore; /*女選手分?jǐn)?shù)*/ 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輸入運(yùn)動(dòng)項(xiàng)目序號(hào) (x<=%d):",ntsp); scanf("%d",pafirst); overgame = *pafirst; if ( pafirst != phead ) { for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ ) { if ( overgame == *pasecond ) { printf("\n這個(gè)項(xiàng)目已經(jīng)存在請(qǐng)選擇其他的數(shù)字\n"); goto Is_Game_DoMain; } } } pafirst = pafirst + 1; if ( overgame > ntsp ) { printf("\n項(xiàng)目不存在"); printf("\n請(qǐng)重新輸入"); 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輸入序號(hào) of the NO.%d (0<x<=%d): ",i,nsc); scanf("%d",&serial); if ( serial > nsc ) { printf("\n超過(guò)學(xué)校數(shù)目,請(qǐng)重新輸入"); 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繼續(xù)輸入運(yùn)動(dòng)項(xiàng)目(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號(hào)學(xué)校的結(jié)果成績(jī):",pfirst->serial); printf("\n\n項(xiàng)目的數(shù)目\t學(xué)校的名字\t分?jǐn)?shù)"); 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按任意建 進(jìn)入下一頁(yè)"); getchar(); pfirst = pfirst->next; } // clrscr(); printf("\n運(yùn)動(dòng)會(huì)結(jié)果:\n\n學(xué)校編號(hào)\t男運(yùn)動(dòng)員成績(jī)\t女運(yùn)動(dòng)員成績(jī)\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按任意建結(jié)束"); 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("文件已經(jīng)成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 運(yùn)動(dòng)會(huì)分?jǐn)?shù)統(tǒng)計(jì)\n"); printf("輸入學(xué)校數(shù)目 (x>= 5):"); scanf("%d",&nsc); printf("輸入男選手的項(xiàng)目(x<=20):"); scanf("%d",&msp); printf("輸入女選手項(xiàng)目(<=20):"); scanf("%d",&wsp); ntsp = msp + wsp; phead = (int *)calloc(ntsp,sizeof(int)); pafirst = phead; pasecond = phead; input(); calculate(); output(); Save(); }
標(biāo)簽： 源代碼
上傳時(shí)間： 2016-12-28
上傳用戶(hù)：150501
LTE-Advanced becomes a truly global standard for 4G cellular communications. Relay, as one of the key technologies of LTE-Advanced, can significantly extend the coverage, and improve the system throughput. LTE-A standards and tech- nologies were described in several recent books where the limited pages for relay feature prevent the detailed explanations of the technology. In this book, we tried to provide an in-depth description of LTE-A relay development. More specifically, significant portions are spent on relay channel modeling and potential technologies during the study item phase of the development, although some of those tech- nologies, such as Type 2 cooperative relay, multi-hop relay, relay with backhaul of carrier aggregation, were not standardized in Release 10 LTE.
標(biāo)簽： LTE-Advanced Technology Relay
上傳時(shí)間： 2020-05-27
上傳用戶(hù)：shancjb
With the continued growth in the world's population, there is a need to ensure availability of enough food to feed everyone. Advances in science and technology have helped not only to increase food production, but also to reduce food wastage. However, the latter has the potential to be improved to a significant extent through appropriate matching of supply and demand, and with proper handling during storage and transit. Given the amount of food wastage that occurs after a food item leaves the “farm” on its way to the “fork,” and the availability of means to reduce such wastage, there really is no excuse for feigned ignorance.
標(biāo)簽： Automation Industry Network Sensor RFID Food and the in
上傳時(shí)間： 2020-06-08
上傳用戶(hù)：shancjb
Fun. We (your authors) wanted a word to describe our ultimate goal for this book, as well as a word we hope you (our reader) will use to describe it, and that’s the one we chose. There are others goals, of course, but in the end, when you’ve finished the book, we’re hoping you’ll have enjoyed the activities described in these pages. Many books use the Introduction to explain exactly what the book is about, what the reader will learn, what the reader needs (a skill or maybe an item or piece of software), and what the reader will be left with when that last page is completed. And this Introduction will do those things, but … hopefully it’ll make you excited to get started.
標(biāo)簽： Adventures Arduino Station Escape Gemini from
上傳時(shí)間： 2020-06-09
上傳用戶(hù)：shancjb
此文檔包括USB協(xié)議的全部協(xié)議說(shuō)明，包括USBhost主站和Device從站的協(xié)議格式，從識(shí)別USB設(shè)備類(lèi)型，到識(shí)別USB設(shè)備描述符，對(duì)設(shè)備描述符進(jìn)行拆分和加密都有描述，根據(jù)設(shè)備描述符可以將數(shù)據(jù)部分進(jìn)行拆解，對(duì)每個(gè)item都有詳細(xì)的解釋?zhuān)沂侵皩?duì)USB完全不了解，遇到問(wèn)題什么都解決不了，連什么是主站什么是從站都分不清，調(diào)試期間一直連不上USB設(shè)備，期間還弄得兩個(gè)Device設(shè)備相互連接，花了很多時(shí)間都沒(méi)有搞定，最終還是通過(guò)看這個(gè)手冊(cè)才學(xué)到一些，最讓我開(kāi)心的是這個(gè)文檔是中文的，對(duì)于英語(yǔ)水平不是很好的朋友是個(gè)不錯(cuò)的選擇，我通過(guò)這本書(shū)做成了一個(gè)自定義的從站，還做了一個(gè)可以識(shí)別三種設(shè)備類(lèi)的主站，包括HID，U盤(pán)存儲(chǔ)類(lèi)等等，而且主站能夠識(shí)別市場(chǎng)上現(xiàn)有的鍵盤(pán)，我試了兩種型號(hào)的，鼠標(biāo)試了三種，包括聯(lián)想電腦，戴爾電腦，清華同方的，全部都能正常識(shí)別，能夠拆分鼠標(biāo)和鍵盤(pán)傳遞的信息，感覺(jué)非常有用，請(qǐng)小伙伴們放心下載，有什么問(wèn)題不懂得，可以私信我
標(biāo)簽： usb
上傳時(shí)間： 2021-12-09
上傳用戶(hù)：qdxqdxqdxqdx
恒凱電子數(shù)據(jù)采集卡USBV1.2實(shí)驗(yàn)平臺(tái)Labview源程序，采集卡可以在淘寶官方網(wǎng)店進(jìn)行購(gòu)買(mǎi)，具體連接如下：https://item.taobao.com/item.htm?id=524320311827&_u=al01rc3f269 有具體的技術(shù)指導(dǎo)，方便各位開(kāi)發(fā)自己的數(shù)據(jù)采集平臺(tái)。
標(biāo)簽： 電子 數(shù)據(jù)采集 usbv1 實(shí)驗(yàn) 平臺(tái) labview 源程序
上傳時(shí)間： 2022-06-16
上傳用戶(hù)：shjgzh
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
