/*
* EULER S ALGORITHM 5.1
*
* TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
* Y = F(T,Y), A<=T<=B, Y(A) = ALPHA,
* AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B].
*
* INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N.
*
* OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T.
*/
A complete set of bit banged, software driven I2C routines I created for any PIC device - and they work!! These functions are single master only functions, and are ideal for communicating with things like EEPROMs, LCD Drivers, ADC Converters etc
performs one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A *x + beta*y, where alpha and beta are scalars, x and y are vectors and A is an
m by n matrix
his packet is a IS-95 baseband simulation for 1 data channel of 9.6 KBps rate.
The simulation is written for static channel and AWGN noise. The packet include:
1) Packet Builder (Viterbi Encoding, Interleaver, PN generation)
2) Modulator (RRC filter)
3) Demodulator (Matched Filter, RAKE receiver)
4) Receiver (HD or SD) (Deinterleaver, Viterbi Decoder).
You should run "Simulation.m" function that include all modules.
使用到的參數(shù)跟談到彈性網(wǎng)絡(luò)的那一章里頭所講的是一樣的， ke 則是終止條件。如果 step 被打勾，則程式在每一步之間會(huì)暫停 100毫秒（或其他使用者輸入的數(shù)值）。如果 Random 被打勾，則程式會(huì)以系統(tǒng)時(shí)間作為亂數(shù)產(chǎn)生器的種子數(shù)，否則，就以使用者輸入的數(shù)（ Random 右邊那一格）為種子數(shù)。
你可以利用 load 來載入推銷員問題檔與其最佳解，如此便可比較彈性網(wǎng)絡(luò)所找出來的解與最佳解差了多少。
Central, Radius, and Error 這三個(gè)參數(shù)的前兩個(gè)，只影響彈性網(wǎng)絡(luò)的起使位置和大小，對(duì)求解沒有影響。第三個(gè)參數(shù)代表城市與網(wǎng)絡(luò)點(diǎn)之間的容忍距離，也就是說，如果某城市與某網(wǎng)絡(luò)點(diǎn)之間的距離，小于容忍距離，那就把這個(gè)城市當(dāng)成是被該網(wǎng)絡(luò)點(diǎn)所拜訪。
按下小 w按鈕會(huì)將目前的結(jié)果與參數(shù)值寫到“en.out”這個(gè)檔案。使得我們可以很方便地來比較不同參數(shù)的效果。
