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

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

semidefinite-quadratic-li

  • CNC初級教程

    頻道 勁爆,看《歡樂頌》第二季 上傳 書房 登錄 注冊 菜單 收藏到書房下載文檔 上一頁  /386 下一頁     全屏    < 返回首頁  CNC初級教程/FANUC學校講義 頂 8 踩 0 瀏覽 1,196 收藏 89 評論 1 加入豆單 舉報 手機觀看

    標簽: CNC 教程

    上傳時間: 2016-05-16

    上傳用戶:kim123

  • 32feet.NET 3.5 Bluetooth coding

    32feet.NET is a shared-source project to make personal area networking technologies such as Bluetooth, Infrared (IrDA) and more, easily accessible from .NET code. Supports desktop, mobile or embedded systems. 32feet.NET is free for commercial or non-commercial use. If you use the binaries you can just use the library as-is, if you make modifications to the source you need to include the 32feet.NET License.txt document and ensure the file headers are not modified/removed. The project currently consists of the following libraries:- Bluetooth IrDA Object Exchange Bluetooth support requires a device with either the Microsoft, Widcomm, BlueSoleil, or Stonestreet One Bluetopia Bluetooth stack. Requires .NET Compact Framework v3.5 or above and Windows CE.NET 4.2 or above, or .NET Framework v3.5 for desktop Windows XP, Vista, 7 and 8. A subset of functionality is available for Windows Phone 8 and Windows Embedded Handheld 8 in the InTheHand.Phone.Bluetooth.dll library.

    標簽: feet 3.5 NET 32

    上傳時間: 2016-07-06

    上傳用戶:magister2016

  • 晟矽微GPIO單片機MC30P081

    8 位 RISC CPU 內(nèi)核 1K*14 位程序存儲器空間(OTP),5 級深度硬件堆棧 48 字節(jié) SRAM

    標簽: MC30P081

    上傳時間: 2016-08-18

    上傳用戶:zengduo

  • 晟矽微GPIO單片機MC30P6060_

    MC30P6060采用高速低功耗CMOS工藝設(shè)計開發(fā)的8位高性能精簡指令單片機,內(nèi)部有1k*14位一次性可編程ROM(OTP-ROM),49×8位的數(shù)據(jù)存儲器(RAM),兩個雙向i/o,1個8位Timer定時器/計數(shù)器

    標簽: MC30P6060

    上傳時間: 2016-08-18

    上傳用戶:zengduo

  • 晟矽微GPIO單片機MC30P6060_

    MC30P6060采用高速低功耗CMOS工藝設(shè)計開發(fā)的8位高性能精簡指令單片機,內(nèi)部有1k*14位一次性可編程ROM(OTP-ROM),49×8位的數(shù)據(jù)存儲器(RAM),兩個雙向i/o,1個8位Timer定時器/計數(shù)器

    標簽: MC30P6060

    上傳時間: 2016-08-18

    上傳用戶:zengduo

  • 運動會源代碼

    #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; /*分數(shù)*/         int range; /**/         int item; /*項目*/     }ATH;     typedef struct schoolstruct /*學校*/     {         int count; /*編號*/         int serial; /**/          int menscore; /*男選手分數(shù)*/         int womenscore; /*女選手分數(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輸入運動項目序號 (x<=%d):",ntsp);         scanf("%d",pafirst);         overgame = *pafirst;         if ( pafirst != phead )         {             for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ )             {                 if ( overgame == *pasecond )                 {                     printf("\n這個項目已經(jīng)存在請選擇其他的數(shù)字\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超過學校數(shù)目,請重新輸入");             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)?");         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號學校的結(jié)果成績:",pfirst->serial);             printf("\n\n項目的數(shù)目\t學校的名字\t分數(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按任意建 進入下一頁");             getchar();             pfirst = pfirst->next;         }     //  clrscr();          printf("\n運動會結(jié)果:\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按任意建結(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 運動會分數(shù)統(tǒng)計\n");         printf("輸入學校數(shù)目 (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

  • AP2406技術(shù)手冊

    The AP2406 is a 1.5Mhz constant frequency, slope compensated current mode PWM step-down converter. The device integrates a main switch and a synchronous rectifier for high efficiency without an external Schottky diode. It is ideal for powering portable equipment that runs from a single cell lithium-Ion (Li+) battery. The AP2406 can supply 600mA of load current from a 2.5V to 5.5V input voltage. The output voltage can be regulated as low as 0.6V. The AP2406 can also run at 100% duty cycle for low dropout operation, extending battery life in portable system. Idle mode operation at light loads provides very low output ripple voltage for noise sensitive applications. The AP2406 is offered in a low profile (1mm) 5-pin, thin SOT package, and is available in an adjustable version and fixed output voltage of 1.2V, 1.5V and 1.8V

    標簽: 2406 AP 技術(shù)手冊

    上傳時間: 2017-02-23

    上傳用戶:w124141

  • 通過提高保證成本的狀態(tài)延遲控制和量子自適應(yīng)控制的一臺四輪直升機的控制策略

    Improved guaranteed cost control and quantum adaptive control are developed in this study for a quadrotor helicopter with state delay and actuator faults. Improved guaranteed cost control is designed to eliminate disturbance effects and guarantee the robust stability of a quadrotor helicopter with state delay. The inapplicability of guaranteed cost control to the quadrotor linear model is addressed by combining guaranteed cost control with a model reference linear quadratic regulator. In the event of actuator faults, quadrotor tracking performance is maintained through quantum adaptive control. Finally, the availability of the proposed scheme is verified through numerical simulation

    標簽: Control Helicopter Guaranteed Quadrotor Adaptive Strategy Improved Quantum Delay State

    上傳時間: 2017-07-15

    上傳用戶:bingzi_ml

  • 鋰硫電池隔膜

    Lithium–sulfur batteries are a promising energy-storage technology due to their relatively low cost and high theoretical energy density. However, one of their major technical problems is the shuttling of soluble polysulfides between electrodes, resulting in rapid capacity fading. Here, we present a metal–organic framework (MOF)-based battery separator to mitigate the shuttling problem. We show that the MOF-based separator acts as an ionic sieve in lithium–sulfur batteries, which selectively sieves Li+ ions while e ciently suppressing undesired polysulfides migrating to the anode side. When a sulfur-containing mesoporous carbon material (approximately 70 wt% sulfur content) is used as a cathode composite without elaborate synthesis or surface modification, a lithium–sulfur battery with a MOF-based separator exhibits a low capacity decay rate (0.019% per cycle over 1,500 cycles). Moreover, there is almost no capacity fading after the initial 100 cycles. Our approach demonstrates the potential for MOF-based materials as separators for energy-storage applications.

    標簽: 鋰硫電池 隔膜

    上傳時間: 2017-11-23

    上傳用戶:653357637

  • 用于鋰 - 硫電池的納米結(jié)構(gòu)金屬氧化物和硫化物(1)

    Lithium–sulfur (Li–S) batteries with high energy density and long cycle life are considered to be one of the most promising next-generation energy-storage systems beyond routine lithium-ion batteries. Various approaches have been proposed to break down technical barriers in Li–S battery systems. The use of nanostructured metal oxides and sulfides for high sulfur utilization and long life span of Li–S batteries is reviewed here. The relationships between the intrinsic properties of metal oxide/sulfide hosts and electrochemical performances of Li–S batteries are discussed. Nanostructured metal oxides/ sulfides hosts used in solid sulfur cathodes, separators/interlayers, lithium- metal-anode protection, and lithium polysulfides batteries are discussed respectively. Prospects for the future developments of Li–S batteries with nanostructured metal oxides/sulfides are also discussed.

    標簽: 電池 納米結(jié)構(gòu) 硫化物 金屬氧化物

    上傳時間: 2017-11-23

    上傳用戶:653357637

主站蜘蛛池模板: 辽宁省| 磐石市| 绥宁县| 肥乡县| 云和县| 阿克陶县| 双流县| 汉阴县| 临潭县| 巴楚县| 南丰县| 丰原市| 东方市| 佛学| 皋兰县| 濉溪县| 贵南县| 夏津县| 原平市| 澳门| 小金县| 蒙城县| 综艺| 北流市| 隆德县| 株洲县| 龙陵县| 南溪县| 辰溪县| 万源市| 浮梁县| 清徐县| 新巴尔虎右旗| 商城县| 灌南县| 福清市| 保山市| 天镇县| 沙田区| 改则县| 绵阳市|