CCRm

matlab code for heart demo

to solve the ordinary differential equation given as x^2 u - 2x u - 4u = x^2, 10 < x < 20 u(10) = 0 and u(20) = 100 using 10 linear elements

Billing system for telephone station 2N,LG

Applications au démarrage de Windows.xls

matlab code for Perturb and Observe (P&O) Algorithm for PV MPPT

基于扰动观察法的mppt算法，用m函数编写，光伏板接boost电路(The mppt algorithm based on the disturbance observation method is written by the m function, and the photovoltaic board is connected to the boost circuit.)

说明：  整数线性规划中intprog的代码定义，用于matlab中(integer linear programming)

用MATLAB实现的离散系统灰色PID位置跟中系统(MATLAB implementation of the discrete-time systems with PID position with the system of gray)

fisher分类器matlab代码，只具有二分类特性，可运行(fisher classifier matlab code, has only two classification features, you can run)

说明：  物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes (logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.)