藍牙協議（GAVDP）This profile defines the requirements for Bluetooth™ devices necessary to set up streaming channels used for support of audio/video distribution. The requirements are expressed in terms of services provided to applications, and by defining the features and procedures that are required for interoperability between Bluetooth devices in the Audio/Video Distribution usage model.
標簽： requirements Bluetooth necessary profile
上傳時間： 2014-01-04
上傳用戶：bcjtao
web應用控件,主要是實現的web開發中文件的加密和解密.該控件b/s架構的應用系統 中有比較好的用途
上傳時間： 2015-08-13
上傳用戶：zuozuo1215
This set of simulation files performs a computational complexity performance comparison of the two methods mentioned in the paper. The source is ANSI-C compliant, hence any C-compiler can be used to compile the source code. It has been tested using Visual Studio.net C++ and TI code composer studio C compiler for the TMS320C6701. Note that the performance comparison may be different for different platforms.
標簽： computational performance complexity comparison
上傳時間： 2014-12-22
上傳用戶：aig85
MODE_Switch1Processing multi-interrupt request needs to set the priority of these interrupt requests. The IRQ flags of the 7 interrupt are controlled by the interrupt event occurring. But the IRQ flag set doesn t mean the system to execute the interrupt vector. The IRQ flags can be triggered by the events without interrupt enable. Just only any the event occurs and the IRQ will be logic "1".
標簽： multi-interrupt MODE_Switch Processing interrupt
上傳時間： 2013-12-04
上傳用戶：zhichenglu
The Intel® JPEG Library provides a set of highly optimized C functions that implement JPEG compression and decompression on Intel architecture processors
標簽： JPEG functions implement optimized
上傳時間： 2015-08-17
上傳用戶：chenjjer
主要介紹了B樣條曲線的數學定義和性質,以及在工程時間中的應用,以及B樣條曲線的改進
上傳時間： 2014-07-01
上傳用戶：zhaiyanzhong
一般文獻對A—B效應的分析不夠明了，作者就此問題進行了探究，力求尋求一種既省時又省力簡單明了的方法，試著用費曼的的路徑積分理論定量地分析由矢勢A和標∞勢所致的A_B效應及超導量子干涉效應、介觀體系中的A_B效應等這些前沿領域的課題。
上傳時間： 2014-01-27
上傳用戶：372825274
b+tree樹的java實現。 是一個框架， 可以往里加新的東西， 實現復雜的功能
上傳時間： 2015-08-20
上傳用戶：84425894
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
標簽： APPROXIMATE ALGORITHM THE SOLUTION
上傳時間： 2015-08-20
上傳用戶：zhangliming420
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標簽： introduction the contains intended
上傳時間： 2013-12-23
上傳用戶：liansi
