fdtd2d_7005

A comprehensive OFDM turorial

Dynamic job shop scheduling problem is one form of a job shop scheduling problem with varying arrival time job or not concurrent. This problem can be represented in graph form, which is to seek the shortest path from start point to destination point. One solution that can be used is with the ant colony optimization algorithm. There are three method to input the job : xls file, matriks, and atrractive dialog.

Survival times are data that measure follow-up time from a defined starting point to the occurrence of a given event, for example the time from the beginning to the end of a remission period or the time from the diagnosis of a disease to death. Standard statistical techniques cannot usually be applied because the underlying distribution is rarely Normal and the data are often ‘censored’. A survival time is described as censored when there is a follow-up time but the event has not yet occurred or is not known to have occurred. For example, if remission time is being studied and the patient is still in remission at the end of the study, then that patient’s remission time would be censored. If a patient for some reason drops out of a study before the end of the study period, then that patient’s follow-up time would also be considered to be

计算机视觉，图像分割的matlab源程序(Computer vision, image segmentation matlab source)

永磁同步电机 三相电机矢量控制 (permang magnet motor)

EMD方法，可将非平稳信号降解为单频信号。用于分析其频谱特性。(EMD method, the non-stationary signal degradation for single-frequency signal. For the analysis of their spectral characteristics.)

图像校准的测试图片。标准的棋盘图像。摄像机标定。(Image calibration test image. Standard chessboard image. Camera calibration.)

This is a case where a array is introduced

说明：  无约束优化FR算法的MATLAB实现源代码（不精确一维搜索）(FR algorithm for unconstrained optimization MATLAB implementation source code (inexact one-dimensional search))

单目标细菌群体趋药性算法，自己编写，可运行( Specific examples of DBCC algorithm)