-
cpuinfo
这个函数读取各个比特的信息处理器和操作
系统，包括：
*中央处理器的名字
*时钟速度
*处理器缓存的大小（二级）
*号的物理处理器核心
*操作系统名称和版本
这是由程序/处理器（系统），sysctl（苹果）或命令行工具（窗口）。
需要在r2010a或以上。(This function reads various bits of information about the CPU and operating
system, including:
* CPU name
* CPU clock speed
* CPU Cache size (L2)
* Number of physical CPU cores
* Operating system name & version
These are provided by /proc/cpu (Unix), sysctl (Mac) or WMIC (Windows).
Requires MATLAB R2010a or above.)
- 2012-05-02 20:20:36下载
- 积分：1
-
ondera
Custom tools for MATLAB supporting analysis and design of nonlinear control
systems are introduced in this paper. The paper demonstrates their use to solve
sample nonlinear control problems and presents some of the MATLAB algorithms
involved
- 2013-07-28 18:05:17下载
- 积分：1
-
CVPR14-ImageAnnotation.pdf
CVPR 2014 paper on Image Annotation
- 2015-02-14 17:10:37下载
- 积分：1
-
Gray-prediction
灰色预测的matlab程序，用于评价问题(Gray prediction matlab program for Evaluation)
- 2013-05-18 22:44:35下载
- 积分：1
-
matlab
matlab实用程序百例，关于图像处理的源码(matlab )
- 2009-04-30 22:00:16下载
- 积分：1
-
cp6
matlab图形凸显该处理教程第六章的内容(tutorial matlab handle graphics highlight the contents of Chapter VI)
- 2011-06-13 18:12:41下载
- 积分：1
-
AO
说明： 关于短路计算的一些源程序同时是有关多目标优化的源程序(Some source of short-circuit calculations is also the source for multi-objective optimization)
- 2011-11-28 10:48:27下载
- 积分：1
-
gene-recognition
区分基因序列的外显子和内含子并找出区分外显子和内含子的阈值(Distinguish gene sequence exons and introns and exons and identify distinguishing threshold intron)
- 2013-12-01 10:31:36下载
- 积分：1
-
decimate
MATLAB 数字信号处理工具箱中decimate函数c语言实现(MATLAB Digital Signal Processing Toolbox decimate function c language)
- 2013-11-05 14:13:08下载
- 积分：1
-
TSP
旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)
- 2015-01-18 21:43:12下载
- 积分：1
