搜索结果

找到约 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 ...
https://www.eeworm.com/dl/687/421573.html
下载: 196
查看: 1114

Linux/Unix编程 send an input on a linux socket.

send an input on a linux socket.
https://www.eeworm.com/dl/619/424090.html
下载: 67
查看: 1023

Linux/Unix编程 send an input on a linux socket.

send an input on a linux socket.
https://www.eeworm.com/dl/619/424091.html
下载: 164
查看: 1013

*行业应用 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)
https://www.eeworm.com/dl/631/424729.html
下载: 96
查看: 1290

嵌入式/单片机编程 使用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
https://www.eeworm.com/dl/647/424873.html
下载: 22
查看: 1055

数学计算 Finding blob in the input image using seed filling algorithm.

Finding blob in the input image using seed filling algorithm.
https://www.eeworm.com/dl/641/424921.html
下载: 63
查看: 1047

编译器/解释器 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 ...
https://www.eeworm.com/dl/628/425099.html
下载: 77
查看: 1078

其他 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 ...
https://www.eeworm.com/dl/534/425105.html
下载: 154
查看: 1036

其他 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 ...
https://www.eeworm.com/dl/534/425106.html
下载: 121
查看: 1061

书籍源码 </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 ...
https://www.eeworm.com/dl/532/426084.html
下载: 51
查看: 1039