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 configuration for ATMEGA8-16AU TQFP32 // #30 RXD <--- RXD (SP3232) // #31 TXD ---> TXD (SP3232) // #32 PD2/INT0 <--- INTR (TRH031M) // # 1 PD3/INT1 ---> RST (TRH031M) // # 2 PD4 ---> D4 (TRH031M) // # 9 PD5 ---> D5 (TRH031M) // #10 PD6 ---> D6 (TRH031M) // #11 PD7 ---> D7 (TRH031M) // #12 PB0 ---> D0 (TRH031M) // #13 PB1 ---> D1 (TRH031M) // #14 PB2 ---> D2 (TRH031M) // #15 PB3 ---> D3 (TRH031M) // #16 PB4 ---> CSB (TRH031M) // #17 PB5 ---> LED // #23 PC0 ---> A0 (TRH031M) // #24 PC1 ---> A1 (TRH031M) // #25 PC2 ---> A2 (TRH031M) // #26 PC3 ---> ALE (TRH031M) // #27 PC4 ---> /RD (TRH031M) // #28 PC5 ---> /WR (TRH031M)
標簽： 13.560 ATMEGA 3Alogi source
上傳時間： 2017-03-31
上傳用戶：s363994250
-The existence of numerous imaging modalities makes it possible to present different data present in different modalities together thus forming multimodal images. Component images forming multimodal images should be aligned, or registered so that all the data, coming from the different modalities, are displayed in proper locations. Mutual Information is the similarity measure used in this case for optimizing the two images. This method requires estimating joint histogram of the two images. The fusion of images is the process of combining two or more images into a single image retaining important features from each. The Discrete Wavelet Transform (DWT) has become an attractive tool for fusing multimodal images. In this work it has been used to segment the features of the input images to produce a region map. Features of each region are calculated and a region based approach is used to fuse the images in the wavelet domain.
標簽： present modalities existence different
上傳時間： 2014-03-04
上傳用戶：15736969615
在網(wǎng)絡(luò)安全中經(jīng)常會遇到rootkit，NSA安全和入侵檢測術(shù)語字典( NSA Glossary of Terms Used in Security and Intrusion Detection)對rootkit的定義如下：A hacker security tool that captures passwords and message traffic to and from a computer. A collection of tools that allows a hacker to provide a backdoor into a system, collect information on other systems on the network,mask the fact that the system is compromised, and much more. Rootkit is a classic example of Trojan Horse software. Rootkit is available for a wide range of operating systems.
上傳時間： 2017-04-04
上傳用戶：xaijhqx
使用FPGA/CPLD設(shè)置語音AD、DA轉(zhuǎn)換芯片AIC23，F(xiàn)PGA/CPLD系統(tǒng)時鐘為24.576MHz 1、AIC系統(tǒng)時鐘為12.288MHz，SPI時鐘為6.144MHz 2、AIC處于主控模式 3、input bit length 16bit output bit length 16bit MSB first 4、幀同步在96KHz
上傳時間： 2013-12-20
上傳用戶：二驅(qū)蚊器
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
Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency list.
標簽： graph directed program decide
上傳時間： 2013-12-23
上傳用戶：cursor
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 shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
標簽： Multiplicative undirected Shortest measured
上傳時間： 2017-04-08
上傳用戶：邶刖
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 the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
標簽： optimizing different the shortest
上傳時間： 2014-10-25
上傳用戶：1159797854
Java Media APIs: Cross-Platform Imaging, Media, and Visualization presents integrated Java media solutions that demonstrate the best practices for using this diverse collection. According to Sun MicroSystems, "This set of APIs supports the integration of audio and video clips, animated presentations, 2D fonts, graphics, and images, as well as speech input/output and 3D models." By presenting each API in the context of its appropriate use within an integrated media application, the authors both illustrate the potential of the APIs and offer the architectural guidance necessary to build compelling programs.
標簽： Media Java Cross-Platform Visualization
上傳時間： 2013-12-04
上傳用戶：hanli8870
This code implements the arithmetic coding algorithm used for text compression. At present it takes an input of fixed length but that can be modified in the code as required.
標簽： compression arithmetic implements algorithm
上傳時間： 2017-04-18
上傳用戶：wangzhen1990
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
