资源列表
dataanalysis
- 数值分析matlab源码，并带有详细设计说明，执行效率较高
Line_code_english
- Simulation of digital baseband modulation,it is very good for the users to deepen their understanding
RLEencoding
- A simple (de)compression program using Run Length Encoding. Compression is done that easy: compressedData = rle(originalData) Decompression: originalData = rle(compressedData)
mandelbrotdemo
- mandelbrot 分型图的仿真与绘制。mandelbrot.m, mandelbrotdemo1.m, mandelbrotdemograph.fig
WaterFillingAlgorithm
- 一种WaterFillingAlgorithm，资料全面，解析透彻，对学习的人很有帮助！
EncodedDataSimulator
- This is a collection of m-files I created to complete a research project into the DC components of various encoding techniques. Eight of the files create random bit sequences that conform to their coding requirements. The others were files I found us
HybridElectricVehicleWebinar
- This submission includes the presentation and model files that were used in delivering a webinar on 12-15-05 that covered the topic of modeling Hybrid Electric Vehicles. Hybrid electric vehicles (HEVs) have proven they can substantially improve fue
VehicleClimateControlSystem.ZIP
- The model consists of two systems, a climate control system and an electrical system. This allows for examination of the loading effects of the climate control system on the car s electrical system.
OptimizationTipsandTricks
- New users and old of optimization in MATLAB will find useful tips and tricks in this document, as well as examples one can use as templates for their own problems. Use this tool by editing the file optimtips.m, then execute blocks of code in cel
IterativeClosestPointMethod
- ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points. Ordinary usage: [R, T] = icp(model,data) INPUT: model - matrix with model points,
TravelingSalesmanProblemGeneticAlgorithm
- Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
SolvingSymmetricalandDisSymmetricalTSPbaseonAntCol
- Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助