AM_DSB_Modulation

Ansi To Ascii and Ascii to Ansi converter

本光盘为《详解MATLAB快速入门与应用》一书的配套光盘，包括以下内容： 1.“sample”文件夹：提供了本书各章范例的源程序。(The CD is " Getting Started with MATLAB Detailed application," a book supporting the CD, including the following:. 1 " sample" folder: each chapter provides examples of the book source.)

matlab的FDC工具箱，对飞控系统很有帮助。(matlab the FDC toolbox of helpful flight control system.)

说明：  An automatic variational level set segmentation framework for computer aided dental X-rays analysis in clinical environments

说明：  该代码为灰度投影算法进行两帧图像的匹配及配准的代码(The code for the gray projection algorithm and the two images match registration code)

matlab数字图像处理 彩色图像处理部分 含代码和结果显示(matlab image processing color image processing section Containing the code and the results show)

该文件基于Matlab的GUI界面设计了6自由度串联机器人的运动学、动力学和轨迹规划的算法，用户可以计算PUMA560型的机器人的正逆运动学，正逆动力学和指定的轨迹规划，同时可以动画显示机器人点对点的运动路线。该程序可进行二次开发，用户可根据机器人模型的不同修改参数，针对自身模型进行运动学、动力学和轨迹规划的计算与仿真。(Based on the GUI interface of matlab, this paper designs an algorithm for kinematics, dynamics and trajectory planning of 6-DOF serial robot. Users can calculate the forward and inverse kinematics, forward and inverse dynamics and specified trajectory planning of PUMA560 robot. At the same time, they can animate the point-to-point motion path of the robot. The program can be redeveloped. Users can modify parameters according to different robot models, and calculate and simulate kinematics, dynamics and trajectory planning of their own models.)

多目标遗传算法求最佳值，通过加权的方式将多目标转为单目标(Multi objective genetic algorithm for optimal value)

開回路是的基礎型升壓型變換器，可以改變DUTY值來改變輸出電壓。(Open loop is the basis of type boost converter, you can change the value to change the output voltage DUTY.)

霍夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率，读出时由该符号开始一直走到最后的“1”， 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好，就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)