matlab

This example application shows you how to use Real-Time Workshop Embedded Coder to target a dual core Blackfin microprocessor. The complete build is managed by a template makefile and control over the memory regions is provided by custom storage classes. The example imposes a top level architecture on the model to define the split of model code between the two cores. This document describes a complete run-through of the model from Simulink simulation to code simulation using VisualDSP. I think it will take about 1 hour to go through the example once you have VisualDSP installed.

说明：  LEACH协议的改进算法,注重簇头的产生部分,有相关的文献支持,对于理解LEACH协议有帮助(LEACH protocol to improve the algorithm, focus on the selection of cluster head of the relevant literature to support, for understanding the LEACH protocol help)

B-Spline Surface (with redundant points) Least-Squares Fitting of both Positions and Normals.

本压缩包含有Tennessee Eastman Process的matlab仿真，利用TEP可对过程控制技术的算法进行性能评估。(The compressed Tennessee Eastman Process matlab simulation, algorithm performance assessment TEP process control technology.)

matlab数字图像处理常用语句，方便查询和学习。分享给大家。(matlab digital image processing commonly used sentences, easy access and learning. For everyone to share.)

Beta Gamma Nakagami Normal Rayleigh Rician Weibull

说明：  粒子滤波 MATLAB 程序 很简短 比较适合初学者(Particle Filter)

数字信号matlab程序,是科学出版社编的书的上机作业(IT is matlab homework,it is ok,)

电力系统潮流计算程序，适用于电力系统常规潮流分布计算(power system power flow caculation...)

流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码，属于GreenSim团队原创作品，博客上发布的是不完全的源码，本人将其补充完成已成功运行，转载请注明GreenSim团队原创作品。(Pipelined job-shop scheduling problem can be described as follows: n tasks on the assembly line m processing stages, each stage has at least one machine and at least one stage there are multiple machines, and the same processing performance of each machine on the same stage , at every stage to complete each task are a process, each process of each task can be processed on any machine on the corresponding stage of the processing time of each process known tasks, all tasks required to determine the sort and every Distribution of the machine on a stage, making scheduling index (typically seek Makespan) Min. The following code is a Genetic Algorithm for Job Shop Scheduling Problem pipelined general MATLAB source code, original works belong GreenSim team, the blog post is incomplete source code, I will supplement has been successfully completed its operation, please indicate the original team GreenSim works.)