selects the mux channel and configures the MAX197 for second write pulse, written with ACQMOD = 0, termi- either unipolar or bipolar input range. A write pulse (WR nates acquisition and starts conversion on WR°Os risin is restarted. The ACQMOD bit in the input control byte offer+ CS) can either start an acquisition interval or initiate a edge (Figure 6). However, if the second control byte combined acquisition plus conversion. The sampling contains ACQMOD = 1, an indefinite acquisition interval interval occurs at the end of the acquisition interval.
標(biāo)簽： configures the selects channel
上傳時(shí)間： 2016-12-24
上傳用戶：yzhl1988
97 law to enhance the classic procedure Ridge wavelet extraction Modulus maximum for the wavelet edge detection Small spectral analysis method mallat classic procedure
標(biāo)簽： wavelet extraction the procedure
上傳時(shí)間： 2014-01-09
上傳用戶：xg262122
WALLACE是JPEG的定義者，描述了JPEG壓縮方式的定義。包括了BASELINE PROGRESSIVE等。
上傳時(shí)間： 2017-01-09
上傳用戶：JIUSHICHEN
Linux was first released into an unsuspecting world in the summer of 1991. Initially the spare-time hobby of a Finnish computer scientist by the name of Linus Torvalds, Linux was at first accessible only in software source code form to those with enough expertise to build and install it. Early enthusiasts (most also developers themselves by necessity) exploited the growth of the Internet in the early 1990s as a means to build online communities and drive development forward. These communities helped to build the first Linux software distributions, containing all the software components needed to install and use a Linux system without requiring users to be technical experts.
標(biāo)簽： unsuspecting spare-time Initially the
上傳時(shí)間： 2013-12-12
上傳用戶：dianxin61
1.an fpga implementation of the image space reconstruction algorithm for hyperspectral imaging analysis 2. fpga implemention of a median filter 3. fpga implementation of digital filters 4.hardware acceleration of edge detection algorithm on fpgas 5.implementation and evaluation of image processing algorithms on reconfigurable architecture using C-based hardware descriptive languages 6. implementing 2D median filter in fpgas 7.視頻圖像處理與分析的網(wǎng)絡(luò)資源
標(biāo)簽： implementation reconstruction hyperspectral algorithm
上傳時(shí)間： 2014-01-10
上傳用戶：894898248
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.
標(biāo)簽： fault-tolerant algorithms redundant underlyin
上傳時(shí)間： 2013-12-18
上傳用戶：jkhjkh1982
對(duì)于遙感圖像上的地物進(jìn)行提取，運(yùn)用Matlab中的Edge函數(shù)實(shí)現(xiàn)
標(biāo)簽： 遙感圖像
上傳時(shí)間： 2014-01-06
上傳用戶：362279997
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
13、堆 MinHeap.h test.cpp 14、哈夫曼樹(shù) BinTreeNode.h BinaryTree.h MinHeap.h Huffman.h Test.cpp 15、樹(shù) 164 QueueNode.h LinkQueue.h TreeNode.h Tree.h 170 test.cpp 16、B+樹(shù) BTreeNode.h BTree.h 192 test.cpp 17、圖 217 MinHeap.h Edge.h 222 Vertex.h Graph.h 224 test.cpp 18、排序 Data.h 249 QueueNode.h LinkQueue.h Sort.h 263 test.cpp
標(biāo)簽： MinHeap BinTreeNode BinaryTree Huffman
上傳時(shí)間： 2017-08-14
上傳用戶：AbuGe
The goal of this thesis is the development of traffic engineering rules for cellular packet radio networks based on GPRS and EDGE. They are based on traffic models for typical mobile applications. Load generators, representing these traffic models, are developed and integrated into a simulation environment with the prototypical implementation of the EGPRS protocols and models for the radio channel, which were also developed in the framework of this thesis. With this simulation tool a comprehensive performance evaluation is carried out that leads to the traffic engineering rules.
標(biāo)簽： development engineering cellular traffic
上傳時(shí)間： 2014-01-11
上傳用戶：Miyuki
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
