搜索结果
找到约 950 项符合
input-output 的查询结果
其他嵌入式/单片机内容 This is a source of 13.560MHz RFID card reader for TRH031M as ATMEGA8-16AU MPU. The title is 3Alogi
This is a source of 13.560MHz RFID card reader for TRH031M as ATMEGA8-16AU MPU.
The title is 3Alogics TRH031M 13.56MHz RFID Reader V1.0.
project : RFID Reader V2.0
Target : MEGA8-16AU
Crystal: 16.000 Mhz
Input : TRH031M RFID 13.56MHz
Output : RS232C 115200,N,8,1
Compiler : ICC-AVR V6.26C
// Pin co ...
Linux/Unix编程 send an input on a linux socket.
send an input on a linux socket.
Linux/Unix编程 send an input on a linux socket.
send an input on a linux socket.
*行业应用 java csharp program that ask users a input(process arrival time, burst time and priority)
java csharp program that ask users a input(process arrival time, burst time and priority)
嵌入式/单片机编程 使用FPGA/CPLD设置语音AD、DA转换芯片AIC23
使用FPGA/CPLD设置语音AD、DA转换芯片AIC23,FPGA/CPLD系统时钟为24.576MHz
1、AIC系统时钟为12.288MHz,SPI时钟为6.144MHz
2、AIC处于主控模式
3、input bit length 16bit output bit length 16bit MSB first
4、帧同步在96KHz
数学计算 Finding blob in the input image using seed filling algorithm.
Finding blob in the input image using seed filling algorithm.
编译器/解释器 c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlyin
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths ...
其他 Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the ...
其他 In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out ...
书籍源码 </div> <br> <input type="button" value="闪烁" onclick="highLight($( demo ))" /> &
</div>
<br>
<input type="button" value="闪烁" onclick="highLight($( demo ))" />
<input type="button" value="停止" onclick="stopTwinkle($( demo ))" />
<br>
<br>
<div id="demo2" class="box">
Box II
</div>
<br>
<input type="button" value="闪烁" onclick="highLight($( demo2 ))" />
<input type="button" va ...