MLKNN

最基本的快捷键操作 (Basic Operation)

关于图像隐藏的几个例程。属于matlab图像处理的内容，图像隐藏和提取。(hidden images on several routines. Matlab is the content of image processing, image and extract hidden.)

mobility and that can readily coexist with HSPA and earlier networks. OFDM/OFDMA technology is introduced for the LTE downlink, supporting very high data rates of up to 300Mbps while Single-Carrier FDMA (SC-FDMA) is used in the uplink with data rates of 80Mbps possible. Additionally, LTE supports operation both in paired and unpaired spectrum (FDD and TDD) using channel bandwidths of approximately 1.4MHz up to 20MHz. The frequency domain scheduling can be done in OFDMA. One of the main challenges in OFDMA is the high peak-to-average radio of the transmitted signal, which requires linearity in the transmitter. The linear amplifiers have low efficiency therefore, OFDMA is not an optimized solution for a mobile uplink where the

说明：  RS粗糙集利用，用于特征属性的约减，用matlab实现的。(RS rough set utilized for feature attributes about subtraction, using matlab to achieve.)

4种不同信道的模型，包括快衰落、慢衰落、平坦衰落和频率选择衰落信道(4 different channel models, including the fast fading, slow fading, flat fading and frequency selective fading channel)

说明：  采用粒子群算法对GARVER-6节点配电网络进行直流潮流计算(DC power flow calculation of GARVER-6 node distribution network using particle swarm optimization)

讲述浅海水声信道下的多途时延估计方法，供声学方向的学生学习参考(About the shallow water acoustic channel under the multi-path delay estimation method for the acoustic direction of student learning reference)

说明：  遗传算法函数优化源程序，运用的是权重系数法(Source of genetic algorithm function optimization, using the weight coefficient)

等半径泊车方法仿真代码，实现等半径泊车算法的仿真，车辆参数如车长、车宽、转弯半径以及车位参数如长度、宽度均可调。(Simulation code radius ranging from parking way a radius ranging from parking the simulation algorithm, vehicle parameters such as vehicle length, vehicle width, turning radius and parking parameters such as length, width can be adjusted.)

蚁群算法的源代码，蚁群算法又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。(Ant colony algorithm source code, algorithm, also known as ant colony algorithm is a method used to find the optimal path in the graph the probability-based algorithm.)