pb萬能查詢：可以對(duì)任一數(shù)據(jù)窗口實(shí)現(xiàn)：模糊查詢、精確查詢；查詢條件輸入時(shí)：在數(shù)據(jù)窗口中自動(dòng)建立兩個(gè)空行，上下行采用Between and 查詢，帶％_為模糊查詢；其他為精確查詢，也可以附加其他條件；測(cè)試時(shí)：可以看剪輯板，發(fā)布時(shí)，最好屏蔽clipboard(new_sql) 該代碼已在多個(gè)大型項(xiàng)目中使用，效果良好；具體細(xì)節(jié)聯(lián)系：長(zhǎng)沙先導(dǎo)信息科技發(fā)展有限公司：qq：251200166；代碼可以任意使用，但請(qǐng)注明出處。
標(biāo)簽： 查詢 數(shù)據(jù) 窗口 模糊查詢
上傳時(shí)間： 2014-12-20
上傳用戶：彭玖華
ECE345, Visual-to-Audio Electronic Travel Aid Code for TM320C54x (v2a.asm) download This project involves the design and implementation of a audio synthesis device that converts moving images into audio signals. The system is built on a TM320C54x DSP with interface to an IMAQ camera module via the serial port on a PC. Brief description: A LabVIEW VI acquires an image from the IMAQ camera module. It quantizes the image into a 5x5, 3-bit image, and sends the data to the TM320C54x DSP via a serial port. The TM320C54x DSP constructs a 64-tap FIR by combining a series of 64-tap head related transfer functions (HRTF) according to the incoming data, and then filters an input audio signal with this FIR filter, in effect creating a correspondence Between the filtered signal and the original image.
標(biāo)簽： Visual-to-Audio Electronic download project
上傳時(shí)間： 2017-02-01
上傳用戶：笨小孩
MPI stands for the Message Passing Interface. Written by the MPI Forum (a large committee comprising of a cross-section Between industry and research representatives), MPI is a standardized API typically used for parallel and/or distributed computing. The MPI standard is comprised of 2 documents: MPI-1 (published in 1994) and MPI-2 (published in 1996). MPI-2 is, for the most part, additions and extensions to the original MPI-1 specification. The MPI-1 and MPI-2 documents can be downloaded from the official MPI Forum web site: http://www.mpi-forum.org/. Open MPI is an open source, freely available implementation of both the MPI-1 and MPI-2 documents. The Open MPI software achieves high performance the Open MPI project is quite receptive to community input.
標(biāo)簽： comprising MPI Interface committee
上傳時(shí)間： 2013-12-22
上傳用戶：爺?shù)臍赓|(zhì)
This is GPS Matlab findPreambles finds the first preamble occurrence in the bit stream of each channel. The preamble is verified by check of the spacing Between preambles [6sec] and parity checking of the first two words in a subframe. At the same time function returns list of channels, that are in tracking state and with valid preambles in the nav data stream.
標(biāo)簽： findPreambles occurrence the preamble
上傳時(shí)間： 2013-12-23
上傳用戶：秦莞爾w
RFID, the wireless technology that has helped millions of people around the world to protect their property and make their workplaces safer is now in danger of being viewed as a security risk. Ray Stanton examines the love-hate relationship Between people and Radio Frequency Identification [RFID] tags and highlights the need for informed debate about the privacy issues the technology raises.
標(biāo)簽： technology the millions wireless
上傳時(shí)間： 2017-03-19
上傳用戶：cmc_68289287
The SWF [pronounced 鈥渟wiff 鈥? file format delivers vector graphics, text, video, and sound over the Internet and is supported by Adobe廬 Flash廬 Player software. The SWF file format is designed to be an efficient delivery format, not a format for exchanging graphics Between graphics editors.
標(biāo)簽： pronounced delivers graphics format
上傳時(shí)間： 2017-03-20
上傳用戶：waizhang
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. The term image registration is most commonly used to denote the process of alignment of images , that is of transforming them to the common coordinate system. This is done by optimizing a similarity measure Between the two images. A widely used measure is Mutual Information (MI). This method requires estimating joint histogram of the two images. Experiments are presented that demonstrate the approach. The technique is intensity-based rather than feature-based. As a comparative assessment the performance based on normalized mutual information and cross correlation as metric have also been presented.
標(biāo)簽： present modalities existence different
上傳時(shí)間： 2017-04-03
上傳用戶：qunquan
Although some FX1-based devices may use the FX1鈥檚 CPU to process USB data directly (Port I/O Mode), most applica- tions use the FX1 simply as a conduit Between the USB and external data-processing logic (e.g., an ASIC or DSP, or the IDE controller on a hard disk drive).
標(biāo)簽： Although directly devices process
上傳時(shí)間： 2014-01-08
上傳用戶：2467478207
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
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.
標(biāo)簽： Multiplicative undirected Shortest measured
上傳時(shí)間： 2017-04-08
上傳用戶：邶刖
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
