搜索资源列表
KMP
- KMP算法,这是我在课后编的,能查找到所有的子串,并标记其位置,使用DEVCPP,也可以载入VC6.0工程中。先输入要查找的子串,再输入任意串,将从任意串中找到所有子串,包括重叠部分,并一一标号-KMP algorithm, which is a series of after school can find all the substring, and mark its location, use DEVCPP can also load the VC6.0 project. To enter
SAC
- 抽取百度的搜索结果并使用基于最长公共子串的方法进行在线聚类。-Extraction and use Baidu' s search results based on the longest common substring approach to online clustering.
3Drotate
- 对串口所获得的输入体感信息(x,y,z以及物体移动的角速度)进行捕获,并针对该信息进行3D画图,使得用户晃动传感器时,电脑的matlab界面出现相应的动态画面。-Somatosensory information (x, y, z and the angular velocity of moving objects) the obtained input to the serial port to capture and 3D drawing, and for the information,
line
- 从文件读取长串数据(序号栏,数据栏等),读取过程包括识别标题,内容,利用循环和条件语句进行大量数据连续操作。并针对读取的数据根据上下行序号和数据的差进行线性补间,结果写入新的文件里-Long strings of data read from the file (serial number field, data bars, etc.), the reading process, including identification title, content, continuous operat
Count-the--Substring
- 在一个顺序串中寻找子串,并记录子串在其中的个数。-In a sequence string to find substring, and recorded substring in which the number.
matlaserial
- 读取串口调试助手保存的TXT文档,将连续两个8位合并为一个16位数据,然后进行图形化显示,分析了幅频特性,然后对其进行了低通滤波并画图-Read the serial debugging assistant TXT files saved in the continuous two 8 into a 16-bit data, and then graphically analyzed amplitude-frequency characteristics, and its low-pass fi
matrix_lu3
- LU_seial,c是针对c语言开发的串行LU分解,并进行了cache优化。 LU_parallel.c是用多线程的方法实现LU分解的并行化,加速比在1.3左右。-LU_seial, c is for c language development serial LU decomposition, and conducted cache optimization. LU_parallel.c is multi-threaded approach to achieve parallel LU d
inser_sort
- 该代码实现插入排序,插入排序的源代码,对一串数字进行排序,并按升序排序
Huffman
- 基于Huffman算法的简单c++文件编码和解码,适合初学者学习,对于输入的一串字符简单的压缩并解压-Simple c++ document encoding and decoding based on Huffman algorithm, suitable for beginners to learn, to
ISI
- 理解无码间串扰的条件;利用matlab仿真,验证无码间串扰的条件,画出相关波形及眼图,并画出有噪声时的误码率特性曲线;对仿真结果进行性能分析 -Understand the inter-symbol interference-free conditions using matlab simulation, verification without inter-symbol interference conditions, draw relevant waveforms and eye di
glp_matlab
- 下位机采集数据波形,通过串口发到上位机,并通过MATLAB做功率谱分析。界面使用MATLAB编写。-Lower machine data collection wave, sent to the host computer via the serial port, and power spectral analysis done by MATLAB. Interface written using MATLAB.
verification-Uncensored-crosstalk
- 利用matlab仿真,验证无码间串扰的条件,画出相关波形及眼图,并画出有噪声时的误码率特性曲线-Using matlab simulation, verification Uncensored crosstalk between conditions related to draw waveforms and eye diagram and draw there BER noise characteristic curve
string
- 本程序是中国科学技术大学数据结构及其算法的上机作业,主要实现串的模式匹配,本程序为本人亲自编写并在VC++6.0中调试通过。-This program is the University of Science and Technology of China data structures and algorithms on machine operation, the main achievement of the string pattern matching, the program wri
SA
- 模拟退火算法的MATLAB实现,通过赋予搜索过程一种时变且最终趋于零的概率突跳性,从而可有效避免陷入局部极小并最终趋于全局最优的串行结构的优化算法。-MATLAB implementation of simulated annealing algorithm, a search process by giving time-varying and ultimately tends to zero the probability of jumps, which can effectively av
UQS
- 独特码生成程序,能够产生给定长度的独特码,并实现了码元分布、码元对分布、游程分布、重复串分布和线性复杂度等特性的分析。 -For generating the smallest probability of randomly generated unique signal.
myhuff
- 数据结构之霍夫曼树,采用霍夫曼树 (1)根据输入的字符和相应的权值建立哈夫曼树,并输出已建的相应内容作为检查; (2)用哈夫曼树实现前缀编码,并输出各字符的编码串; (3)输入一组二进制报文,进行译码,并输出译文。 -Huffman tree data structures, using Huffman tree (1) according to the input character and the corresponding weights build the Huffm
main
- 求字符串中的最大回文子串(忽略大小写),并输出找到的回文串-find the maximum Palindrome in a string
GUOCHENKONGZHI-Simulink
- 本书以仿真应用为中心,系统、详细地讲述了过程控制系统的仿真,并结合MATLAB/Simulink仿真工具的应用,通过大量经典的仿真实例,全面讲述过程控制系统的结构、原理、设计和参数整定等知识。包括过程控制及仿真概述、Simulink仿真基础、Simulink高级仿真技术,以及过程控制系统建模;实战篇包括PID控制、串级控制、比值控制、前馈控制、纯滞后和解耦控制系统;综合篇包括典型过程控制系统及仿真。-Book on the simulation application, system, tell
serial_communication
- 基于matlab的串口助手,能够实现单片机与电脑的串口通讯,并将数据实时显示在坐标上。-Based on matlab serial assistant, to achieve SCM and computer serial communications, and real-time data is displayed on the coordinates.
hust20151
- 输入一串字符,并验证其是否为正确的电话号码。长度必须为11位第一位必须为1,第二位为3、5、6、8中得一个,其余位必须为0-9中的一个数-nter a string of characters, and verify that the correct phone number. Length must be 11, the first must be 1, the second was a bit of 3,5,6,8 in the rest position must be a number