-
C_code_examples
C Code example with EII
- 2015-03-07 17:46:15下载
- 积分:1
-
matirx-muliplication
矩阵相乘,基于CUDA用并行算法实现矩阵的乘法(matrix muliplication with parallel algorithm implication matrix muliplication base on CUDA )
- 2011-04-29 10:19:32下载
- 积分:1
-
Development_of_location-aware_applications
位置感知应用程序市场
位置估算技术
其它S60 平台运行时中的位置API
使您的应用程序感知位置时需要考虑的因素
协助测试的开发工具。(Location-aware applications market position estimation techniques other S60 platform run-time the position of the API to your application-aware location factors to be considered to help test the development tools.)
- 2010-08-31 13:57:39下载
- 积分:1
-
triangle
效率极高的基于delaunay三角网格剖分程序,只是没有图形输出,可以只将生成文件直接导入matlab中。(Based on highly efficient delaunay triangular mesh generation process, but there is no graphics output, you can only generate documents in directly into matlab.)
- 2007-11-14 21:31:19下载
- 积分:1
-
Asn1Dll_Open
提供了通用的asn1编解码动态库,实现BER和PER方式的asn1编解码。并提供使用实例和说明。(provides a common asn1 DLL codecs achieve BER and PER approach asn1 codecs. And to provide the use of examples and illustrations.)
- 2007-05-28 16:39:51下载
- 积分:1
-
DLL_Src
to make dll using matlab
- 2009-10-06 18:59:15下载
- 积分:1
-
MLS-diedai
自己编写的迭代小程序,小程序,没问题额的啊(I have written a small program iteration, a small program, the amount of, ah no problem)
- 2011-09-27 08:32:47下载
- 积分:1
-
renjihudong
两个设备形成对射,当有人通过时,一台设备发出指令,控制别的设备。(Two devices formed on the radio, when someone passed a device to issue commands to control other devices.)
- 2013-12-17 14:31:32下载
- 积分:1
-
FSK
根据2FSK调制器与解调器的组成原理,设计出整个2FSK传输系统的实现方案与电路(Based on composition theory 2FSK modulator and demodulator, the entire design implementation and circuit transmission system 2FSK)
- 2014-01-06 18:49:53下载
- 积分:1
-
Recursive_integer_division
递归法求解整数划分。
整数划分,是指把一个正整数n写成如下形式:
n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分:1