avr adc control source and adc key input source
上傳時間： 2013-12-11
上傳用戶：cx111111
ASK function, this is a block that has three input and one output. the input are the two carrier that have different amplitute, and the digital signal representing the information or data to be modulated.
標簽： input the function carrier
上傳時間： 2014-12-20
上傳用戶：Shaikh
DESCRIPTION The DCP0105 family is a series of high efficiency, 5V input isolated DC/DC converters. In addition to 1W nominal galvanically isolated output power capability, the range of DC/DCs are also fully synchronizable. The devices feature thermal shutdown, and overload protection is implemented via watchdog circuitry. Advanced power-on reset techniques give superior reset performance and the devices will start into any capacitive load up to full power output. The DCP0105 family is implemented in standard- molded IC packaging, giving outlines suitable for high volume assembly.
標簽： DESCRIPTION efficiency converters isolated
上傳時間： 2013-11-28
上傳用戶：CHENKAI
Multiple Coherehence simulate using matlab
標簽： Coherehence Multiple simulate matlab
上傳時間： 2014-12-07
上傳用戶：66666
send an input on a linux socket.
上傳時間： 2017-04-06
上傳用戶：569342831
send an input on a linux socket.
上傳時間： 2014-01-18
上傳用戶：wpt
Udptalk is the first version to test multiple clients against one server...
標簽： multiple Udptalk clients against
上傳時間： 2017-04-07
上傳用戶：franktu
java csharp program that ask users a input(process arrival time, burst time and priority)
標簽： time priority arrival program
上傳時間： 2014-10-25
上傳用戶：rishian
Finding blob in the input image using seed filling algorithm.
標簽： algorithm Finding filling image
上傳時間： 2014-01-09
上傳用戶：sammi
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. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標簽： fault-tolerant algorithms redundant underlyin
上傳時間： 2013-12-18
上傳用戶：jkhjkh1982
