Basic function to locate and measure the positive peaks in a noisy data sets. Detects peaks by looking for downward zero-crossings in the smoothed third derivative that exceed SlopeThreshold and peak amplitudes that exceed AmpThreshold. Determines, position, height, and approximate width of each peak by least-squares curve-fitting the log of top part of the peak with a parabola.
标签： peaks function positive Detects
上传时间： 2017-04-26
上传用户：彭玖华
生成一个好的Turbo码，并且用MAP方法进行解码
标签： Turbo
上传时间： 2013-12-21
上传用户：cuibaigao
最小生成树 MST的四种算法实现。 包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。 复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)
上传时间： 2013-12-10
上传用户：stewart·
Hadoop是一个用于运行应用程序在大型集群的廉价硬件设备上的框架。Hadoop为应用程序透明的提供了一组稳定/可靠的接口和数据运动。在 Hadoop中实现了Google的MapReduce算法，它能够把应用程序分割成许多很小的工作单元，每个单元可以在任何集群节点上执行或重复执行。此外，Hadoop还提供一个分布式文件系统用来在各个计算节点上存储数据，并提供了对数据读写的高吞吐率。由于应用了map/reduce和分布式文件系统使得Hadoop框架具有高容错性，它会自动处理失败节点。已经在具有600个节点的集群测试过Hadoop框架。
标签： Hadoop MapReduce Google 应用程序
上传时间： 2017-05-08
上传用户：wpwpwlxwlx
Learn how to: * Tokenize a null-terminated string * Create a search and replace function for strings * Implement subtraction for string objects * Use the vector, deque, and list sequence containers * Use the container adaptors stack, queue, and priority_queue * Use the map, multimap, set, and multiset associative containers * Reverse, rotate, and shuffle a sequence * Create a function object * Use binders, negators, and iterator adapters * Read and write files * Use stream iterators to handle file I/O * Use exceptions to handle I/O errors * Create custom inserters and extractors * Format date, time, and numeric data * Use facets and the localization library * Overload the [ ], ( ), and -> operators * Create an explicit constructor * And much, much more
标签： null-terminated Tokenize Create string
上传时间： 2014-01-18
上传用户：yph853211
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
标签： followingconditions tree completely satisfying
上传时间： 2017-05-25
上传用户：2467478207
这是一个演示分布式系统并行计算的GUI程序，通过在log定制事件，即可查看
上传时间： 2013-12-25
上传用户：ardager
You can download a packet sniffer which grabs packets from local interface and analyses headers. It also writes headers into the log file.
标签： interface analyses download headers
上传时间： 2014-01-16
上传用户：sk5201314
生成Trick文件工具 1.Open command line 2.input tricktest Usage: TrickTest -f -o -i -f source mpeg2 file to trick -o trick output directory -i output file id -m max coding error, default 0 -b max bitrate for trick generate, default 0 mean no limit -s trick buffer block size, must be n*188 -l log file, default c:\tricktest.log example: tricktest -f 黑鹰行动.mpg -o c:\temp -i A -m 1000 -b 3750000 soure file: 黑鹰行动.mpg output directory: c:\temp filename: 000000A,000000A.ff,000000A.fr,000000A.vvx max coding error: 1000 trick generation speed: 3750000 bps a
标签： TrickTest tricktest command source
上传时间： 2014-01-23
上传用户：水口鸿胜电器
从ML-EM 重建算法入手，分析了贝叶斯模型的一些关键点，针对采用传统方法求解MAP问题的局限性，提出一种用于正电子成像的贝叶斯神经网络重建算法，为了保留边缘信息，引入了二进制的保边缘变量，并应用共轭神经网络求解，模拟的重建结果表明，应用这种算法可以得到比ML-EM 算法更好的重建图像@
上传时间： 2013-12-03
上传用户：ztj182002
