<table id="2uksk"></table>
This example program is the source code for the FT232BM Test Application from our Utilities page. It can be used to test the handshaking lines on FT232BM based RS232/RS485/RS422 designs. This program can also be used for programming the external EEPROM over USB in a manufacturing environment. The test features require the test cable shown on ST_232_245.pdf to be connected. Our D2XX direct drivers should be installed for this application. The code can be modified to fit your requirements. To download the application source code , click here. To download the test cable specification, click here.
標(biāo)簽： Application Utilities the example
上傳時(shí)間： 2013-12-09
上傳用戶：aa17807091
給出一百分制成績(jī)，要求輸出等級(jí)A,B,C,D,E。90 分以上為A，80～89 為B，70～79 為C，60～69 為D，60 分以下為E。
標(biāo)簽： 分
上傳時(shí)間： 2017-06-18
上傳用戶：ukuk
This program is to find the floating point representation of real number. The user will be asked for the number of mantissa, exponential, and the real number to be calculated (R=10). The program will find the FPR for Hexadecimal (R=16), Octal (R=8), and Binary (R=2).
標(biāo)簽： representation floating program number
上傳時(shí)間： 2017-07-14
上傳用戶：ANRAN
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network. Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).
標(biāo)簽： networks blocking switched Because
上傳時(shí)間： 2017-07-28
上傳用戶：zhangzhenyu
Functions are mappings from one Manifold to another. Discrete Functions are functions which can be represented using a finite number of values. Given the finite extent of computer memory, algorithms which compute a function that satisfies some special properties are computing a discrete function which approximates a continuous function. Computing the function involves writing a set of equations that may be solved for the values representing the function.
標(biāo)簽： Functions are functions Discrete
上傳時(shí)間： 2017-08-05
上傳用戶：671145514
To write data to the FIFO, present the data to be written and assert the write enable. At the next rising edge of the clock, the data will be written. For every rising edge of the clock that the write enable is asserted, a piece of data is written into the FIFO. If the FIFO has data in it, the value at the head of the FIFO is present on the FIFO data output. To read data from the FIFO, assert the read enable. At the next rising edge of the clock, capture the data output the FIFO will subsequently advance to the next piece of data stored in the FIFO.
標(biāo)簽： the write data present
上傳時(shí)間： 2014-08-16
上傳用戶：wab1981
數(shù)學(xué)公式庫(kù)--非常不錯(cuò) The GNU Scientific Library (GSL) is a collection of routines for numerical computing. The routines have been written from scratch in C, and present a modern Applications Programming Interface (API) for C programmers, allowing wrappers to be written for very high level
標(biāo)簽： Scientific collection computing numerical
上傳時(shí)間： 2013-12-17
上傳用戶：yuanyuan123
kalman filter matlab tool help full for understanding the coding for the kalmanfilter, which can either be used for any purposes which could be help for digital signal processing, wirless mobile communication , OFDM .
標(biāo)簽： understanding kalmanfilter for the
上傳時(shí)間： 2013-12-20
上傳用戶：maizezhen
網(wǎng)際協(xié)議IP實(shí)驗(yàn)報(bào)告 1、IP在計(jì)算校驗(yàn)和時(shí)包括哪些內(nèi)容？ 2、第1步中主機(jī)A所編輯的報(bào)文，經(jīng)過主機(jī)B到達(dá)主機(jī)E后，報(bào)文數(shù)據(jù)是否發(fā)生變化？記錄有變化字段值的變化情況。并簡(jiǎn)述發(fā)生變化的原因。 3、主機(jī)B、E是否能捕獲到主機(jī)A所發(fā)送的報(bào)文？簡(jiǎn)述產(chǎn)生這種現(xiàn)象的原因。
標(biāo)簽： 計(jì)算機(jī)網(wǎng)絡(luò) 實(shí)驗(yàn)
上傳時(shí)間： 2016-05-27
上傳用戶：g娃娃163
實(shí)驗(yàn)源代碼 //Warshall.cpp #include<stdio.h> void warshall(int k,int n) { int i , j, t; int temp[20][20]; for(int a=0;a<k;a++) { printf("請(qǐng)輸入矩陣第%d 行元素:",a); for(int b=0;b<n;b++) { scanf ("%d",&temp[a][b]); } } for(i=0;i<k;i++){ for( j=0;j<k;j++){ if(temp[ j][i]==1) { for(t=0;t<n;t++) { temp[ j][t]=temp[i][t]||temp[ j][t]; } } } } printf("可傳遞閉包關(guān)系矩陣是:\n"); for(i=0;i<k;i++) { for( j=0;j<n;j++) { printf("%d", temp[i][ j]); } printf("\n"); } } void main() { printf("利用 Warshall 算法求二元關(guān)系的可傳遞閉包\n"); void warshall(int,int); int k , n; printf("請(qǐng)輸入矩陣的行數(shù) i: "); scanf("%d",&k); 四川大學(xué)實(shí)驗(yàn)報(bào)告 printf("請(qǐng)輸入矩陣的列數(shù) j: "); scanf("%d",&n); warshall(k,n); }
標(biāo)簽： warshall 離散 實(shí)驗(yàn)
上傳時(shí)間： 2016-06-27
上傳用戶：梁雪文以
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
