vwap

This is a matlab code for scalart algorithm implementation (noise straction)

使用MATLAB对十六进制字符串进行转换，转换成分贝数的比特流，用于多媒体音频处理（仅供大家参考）(using matlab to convert hexadecimal string to a stream of bytes in decibel numbers，for multimedia audio processing)

The aim of this paper is to describe a novel and completely automated technique for carotid artery (CA) recognition, far (distal) wall segmentation, and intima–media thickness (IMT) measurement, which is a strong clinical tool for risk assessment for cardiovascular diseases. The architecture of completely automated multiresolution edge snapper (CAMES) consists of the following two stages: 1) automated CA recognition based on a combination of scale–space and statistical classification in a multiresolution framework and 2) automated segmentation of lumen–intima

Language Implementation Patterns - Terence Parr. How to design your own programming language.

有m台不同的机器，n个不同的工件。每个工件有多道工序，每道工序由指定的机器在固定的时间内完成。一道工序一旦开始处理，就不能中断。每台机器一次只能处理一道工序。一个调度就是决定每台机器上工序的处理顺序，使得机器完成所有工件的时间最短。具体的，该问题就是要求在满足（1）、（2）两个约束条件的前提下，确定每台机器上工序的顺序，使加工的时间跨度（从开始加工到全部工件都加工完所需要的时间）达到最小。其中，（1）表示工件约束条件：对每个工件而言，机器对它的加工路线是事先确定的；（2）表示机器约束条件：对每台机器而言，一次只能对一道工序进行加工。()

Ant Colony Optimization Book

对心电信号的基线消除，包含ECG信号和源代码，并在matlab中仿真，包含中值滤波，高通滤波，整系数滤波，和小波变换！都是一些简单的经典的方法(Elimination of baseline ECG, ECG signals and includes source code and simulation in matlab, including median filtering, high-pass filter, the filter with integer coefficients, and wavelet transform! Are some simple classical methods)

蜂窝小区的程序，是多小区的,讲的比较细致，可以看看(multi-cell easy )

I am simply extracting three types of features from the wavelet transform coefficients, these include: energy, variance and waveform length. You can modify and extract any types of features as you need. ** You need the wavelet toolbox to run this code.

采用栅格对机器人的工作空间进行划分，再利用优化算法对机器人路径优化，是采用智能算法求最优路径的一个经典问题。目前，采用蚁群算法在栅格地图上进行路径优化取得比较好的效果，而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。 利用遗传算法处理栅格地图的机器人路径规划的难点主要包括：1保证路径不间断，2保证路径不穿过障碍。 用遗传算法解决优化问题时的步骤是固定的，就是种群初始化，选择，交叉，变异，适应度计算这样，那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve. The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles. The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)