JavaPrj_17

泊松方程的解法，这是一个一维泊松方程，利用快速傅里叶变换方法解(The solution of Poisson equation, which is a one-dimensional Poisson equation, is solved by the fast Fourier transform method)

说明：  里面记载了雷达微多普勒效应的源代码，其中还包括飞机等目标。(It records the source code of radar micro-Doppler effect)

用于dsp2407a的普通i/o口的测试 -dsp2407a for ordinary i/o test I

帧间差分法是一种通过对视频图像序列中相邻两帧作差分运算来获得运动目标轮廓的方法，它可以很好地适用于存在多个运动目标和摄像机移动的情况。当监控场景中出现异常物体运动时，帧与帧之间会出现较为明显的差别，两帧相减，得到两帧图像亮度差的绝对值，判断它是否大于阈值来分析视频或图像序列的运动特性，确定图像序列中有无物体运动。图像序列逐帧的差分，相当于对图像序列进行了时域下的高通滤波。实例中有对应avi文件(Inter-frame difference method is a method that obtains the contour of moving object by differential operation of two adjacent frames in video image sequence. It can be well applied to the situation where there are multiple moving objects and camera moving. When abnormal object motion occurs in the monitoring scene, there will be obvious difference between the frame and the frame. By subtracting the two frames, the absolute value of the brightness difference between the two frames can be obtained. The motion characteristics of video or image sequence can be analyzed by judging whether it is larger than the threshold value, and whether there is object motion in the image sequence can be determined. The frame-by-frame difference of image sequence is equivalent to high-pass filtering of image sequence in time domain. There are corresponding avi files in the instance)

关于c++做的系统管理，还包含有详细文档说明-With regard to c++ to do system management, but also includes a detailed documentation

内含感染全盘，以及复活等超强悍功能，可做商用！完整源码，编译可过！(It contains all powerful functions such as infection and resurrection, so it can be commercially available. Complete source code, compile can pass!)

异步电动机扩展卡尔曼滤波无速度传感器MATLAB仿真模型(Speed sensorless MATLAB simulation model of asynchronous motor extended Calman filter)

Solving NP-hard discrete optimization problems to optimality is often an immense job requiring very ecient algorithms, and the B&B paradigm is one of the main tools in construction of these. A B&B algorithm searches the complete space of solutions for a given problem for the best solution. However, explicit enumeration is normally impossible due to the exponentially increasing number of potential solutions. The use of bounds for the function to be optimized combined with the value of the current best solution enables the algorithm to search parts of the solution space only implicitly.

WT，c++写的，还不是我写的，就是一个教学资料，开通账户用的(WT, written by c++, not written by me, is a teaching material for opening an account)

复件 Photoshop CS2图形图像处理教程.rar-Copies Photoshop CS2 image-processing graphics tutorials. Rar