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
