AM26C31CLow Power, I CC = 100 ƒ ⊂ A Typ Operate From a Single 5-V Supply High Speed, t PLH = t PHL = 7 ns Typ Low Pulse Distortion, t sk(p) = 0.5 ns Typ High OUTPUT Impedance in Power-Off Conditions Improved Replacement for AM26LS31
標(biāo)簽： Operate Single Supply Power
上傳時(shí)間： 2014-01-20
上傳用戶：gtzj
These codes require an ASCII input file called input.dat of the following form: Lower Limit on x Upper Limit on x Final Time Pressure for x<0 when t=0 Density for x<0 when t=0 Speed for x<0 when t=0 Pressure for x>0 when t=0 Density for x>0 when t=0 Speed for x>0 when t=0 These codes produce 8 ASCII OUTPUT files: density.out. Density vs. x entropy.out. Entropy vs. x mach.out. Mach number vs. x massflux.out. Mass flux vs. x pressure.out. Pressure vs. x sound.out. Speed-of-sound vs. x velocity.out. Velocity vs. x waves.out. A description of the solution in terms of the three waves defined in the book (+,-,0).
標(biāo)簽： input following require called
上傳時(shí)間： 2017-09-21
上傳用戶：希醬大魔王
svd 算法代碼 This directory contains instrumented SVDPACKC Version 1.0 (ANSI-C) programs for compiling within the "svdrun" script. The "svdsum" script can be run after all OUTPUT files of the form <dataset>.outN, where N=1,2,... have been produced by svdrun. more details please read the file readme!
標(biāo)簽： instrumented directory compiling SVDPACKC
上傳時(shí)間： 2017-09-24
上傳用戶：manking0408
A design about 8051 (running at 12MHz) based system with 3 7-Seg displays and two buttons to implement the following functions. 1. When press the + button, the display C = A+B. 2. When press the button, the display C = A - B. “A” and “B” are 8-bit inputs when “C” is 9-bit OUTPUT.
上傳時(shí)間： 2015-05-05
上傳用戶：guoxiy
Boost C++ Libraries Free peer-reviewed portable C++ source libraries Boost C++ Libraries 基本上是一個(gè)免費(fèi)的 C++ 的跨平臺(tái)函式庫(kù)集合，基本上應(yīng)該可以把它視為 C++ STL 的功能再延伸；他最大的特色在於他是一個(gè)經(jīng)過(guò)「同行評(píng)審」（peer review，可參考維基百科）、開(kāi)放原始碼的函式庫(kù)，而且有許多 Boost 的函式庫(kù)是由 C++ 標(biāo)準(zhǔn)委員會(huì)的人開(kāi)發(fā)的，同時(shí)部分函式庫(kù)的功能也已經(jīng)成為 C++ TR1 (Technical Report 1，參考維基百科)、TR2、或是 C++ 0x 的標(biāo)準(zhǔn)了。 它的官方網(wǎng)站是：http://www.boost.org/，包含了 104 個(gè)不同的 library；由於他提供的函式庫(kù)非常地多，的內(nèi)容也非常地多元，根據(jù)官方的分類(lèi)，大致上可以分為下面這二十類(lèi)： 字串和文字處理（String and text processing） 容器（Containers） Iterators 演算法（Algorithms） Function objects and higher-order programming 泛型（Generic Programming） Template Metaprogramming Preprocessor Metaprogramming Concurrent Programming 數(shù)學(xué)與數(shù)字（Math and numerics） 正確性與測(cè)試（Correctness and testing） 資料結(jié)構(gòu)（Data structures） 影像處理（Image processing） 輸入、輸出（Input/OUTPUT） Inter-language support 記憶體（Memory） 語(yǔ)法分析（Parsing） 程式介面（Programming Interfaces） 其他雜項(xiàng) Broken compiler workarounds 其中每一個(gè)分類(lèi)，又都包含了一個(gè)或多個(gè)函式庫(kù)，可以說(shuō)是功能相當(dāng)豐富。
標(biāo)簽： Boost C++ Libraries
上傳時(shí)間： 2015-05-15
上傳用戶：fangfeng
題目描述 蛇行矩陣 Problem 蛇形矩陣是由1開(kāi)始的自然數(shù)依次排列成的一個(gè)矩陣上三角形。 輸入 Input 本題有多組數(shù)據(jù)，每組數(shù)據(jù)由一個(gè)正整數(shù)N組成。（N不大于100） 輸出 OUTPUT 對(duì)于每一組數(shù)據(jù)，輸出一個(gè)N行的蛇形矩陣。兩組輸出之間不要額外的空行。 矩陣三角中同一行的數(shù)字用一個(gè)空格分開(kāi)。行尾不要多余的空格。 樣例輸入 5 樣例輸出 1 3 6 10 15 2 5 9 14 4 8 13 7 12 11
標(biāo)簽： 數(shù)字規(guī)律 數(shù)組 三角形
上傳時(shí)間： 2016-02-29
上傳用戶：lwol2007
Computes all eigenvalues and eigenvectors of a real symmetric matrix a, ! which is of size n by n, stored in a physical np by np array. ! On OUTPUT, elements of a above the diagonal are destroyed. ! d returns the eigenvalues of a in its first n elements. ! v is a matrix with the same logical and physical dimensions as a, ! whose columns contain, on OUTPUT, the normalized eigenvectors of a. ! nrot returns the number of Jacobi rotations that were required. ! Please notice that the eigenvalues are not ordered on OUTPUT. ! If the sorting is desired, the addintioal routine "eigsrt" ! can be invoked to reorder the OUTPUT of jacobi.
上傳時(shí)間： 2016-06-04
上傳用戶：1512313
#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
上傳用戶：150501
12bit 低功耗DAC 數(shù)模轉(zhuǎn)換器 The MAX5302 combines a low-power, voltage-OUTPUT, 12-bit digital-to-analog converter (DAC) and a precision OUTPUT amplifier in an 8-pin μMAX package. It operates from a single +5V supply, drawing less than 280μA of supply current.
上傳時(shí)間： 2017-02-21
上傳用戶：ckbihu
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
標(biāo)簽： 2406 AP 技術(shù)手冊(cè)
上傳時(shí)間： 2017-02-23
上傳用戶：w124141
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
