應用螞蟻最佳化演算法(ACO)求解作戰防禦性武器分配問題，此問題是一重要NP-hard問題-The ant-optimization algorithm (ACO) is used to solve the problem of defensive weapon allocation. It s an important NP-hard problem

Python notebook file. compressed sensing utilizing gaussian sensing. where, Both both A and 5 keys are presssed and # sampling rate Fs = 40e3 duration = 1./8 N_samps = int(np.floor(duration*Fs)) # Number of compressed basis function

python notebook file compressed sensing using FFT and DCT. where, Both both A and 5 keys are presssed and # sampling rate Fs = 40e3 duration = 1./8 N_samps = int(np.floor(duration*Fs)) # Number of compressed basis functions # i.e.