This folder has some scritps that you may find usefull. All of it comes from questions that I ve received in my email. If you have a new request/question, feel free to send it to marceloperlin@gmail.com. But please, don t ask me to do your homework. Passing_your_param0 This folder contains instructions (and m files) for passing you own initial parameters to the fitting function. I also included a simple simulation script that will create random initial coefficients (under the proper bounds) and fit the model to the data.
标签： that questions scritps usefull
上传时间： 2013-12-28
上传用户：netwolf
this is a good software,I give you,hope you will love it ,thank you
上传时间： 2016-05-08
上传用户：xcy122677
Now,I use the ARM7 and SDT2.51 to show how to DIY,the ADS1.2 is as same as the SDT2.51.
上传时间： 2016-05-10
上传用户：liuchee
实现最优二叉树的构造；在此基础上完成哈夫曼编码器与译码器。 假设报文中只会出现如下表所示的字符： 字符 A B C D E F G H I J K L M N 频度 186 64 13 22 32 103 21 15 47 57 1 5 32 20 57 字符 O P Q R S T U V W X Y Z ， ． 频度 63 15 1 48 51 80 23 8 18 1 16 1 6 2 要求完成的系统应具备如下的功能： 1．初始化。从终端（文件）读入字符集的数据信息，。建立哈夫曼树。 2．编码：利用已建好的哈夫曼树对明文文件进行编码，并存入目标文件（哈夫曼码文件）。 3．译码：利用已建好的哈夫曼树对目标文件（哈夫曼码文件）进行编码，并存入指定的明文文件。 4．输出哈夫曼编码文件：输出每一个字符的哈夫曼编码。
上传时间： 2014-11-23
上传用户：shanml
VB6 + LibUsb Intigration It s Not my original work, but i guess i can share it
标签： Intigration original LibUsb guess
上传时间： 2016-05-12
上传用户：wcl168881111111
1.利用I/O口产生一定频率的方波，驱动蜂鸣器，发出不同的音调，从而演奏乐曲（最少三首乐曲，每首不少于30秒） 2．采用LCD显示信息 3．开机时有英文欢迎提示字符，播放时显示歌曲序号（或名称） 4．可通过功能键选择乐曲，暂停，播放。 5．选作内容：显示乐曲播放时间或剩余时间
上传时间： 2013-12-30
上传用户：lxm
THXS3EI-I实验教材实验平台简介以及示例
上传时间： 2016-05-15
上传用户：gengxiaochao
GPIO通用I/O口DSP程序编制
上传时间： 2016-05-15
上传用户：PresidentHuang
I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed.
标签： decompress algorithm compress Huffman
上传时间： 2016-05-16
上传用户：aysyzxzm
I WANT TO SAY THIS IS DIFICULTY
上传时间： 2014-12-05
上传用户：onewq
