叶轮机械多级叶轮网格生成程序介绍 侯 乐 毅 非定常流课题组 本文开发的叶轮机械多级叶轮网格生成程序，采用的网格类型为H型，并在叶片前面/后面延伸区域设置平直网格数ID1和IDN。主程序MESH_BLADE_STAGES，分成三个部分，原始叶型及控制参数从输入程序INPUT输入，求解程序为GRID(ZERO)，输出程序为OUTPUT。
上传时间： 2013-12-03
上传用户：bjgaofei
TouchPanel driver which encapsulate real driver. This driver helps to hook by user application touchscreen(TouchPanel) events before windows process this events.
标签： driver application encapsulate TouchPanel
上传时间： 2013-12-23
上传用户：xuanchangri
The ATK library provides a set of interfaces for accessibility.By supporting the ATK interfaces, an application or toolkit canbe used such as tools such as screen readers, magnifiers, and alternative input devices.
标签： interfaces accessibility supporting ATK
上传时间： 2014-11-06
上传用户：wpwpwlxwlx
This Program Cotains Eeprom Read-write functions, 4 Bit LCD interface routines, Keyboard Interface with normal Key Input to the 89C52 atmel Microcontroller.
标签： Read-write Interface functions interface
上传时间： 2014-01-03
上传用户：jqy_china
3rd Generation Partnership Project Technical Specification Group Radio Access Network Spatial channel model for Multiple Input Multiple Output [MIMO] simulations
标签： Specification Partnership Generation Technical
上传时间： 2014-01-11
上传用户：nanfeicui
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
使用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
上传时间： 2013-12-20
上传用户：二驱蚊器
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
