搜索资源列表
Color-menu
- 在图形窗口上创建一个(color)菜单项及其下拉菜单,下拉菜单包括Red,自定义,缺省三菜单项.-the graphics window creation of a (color) and the drop-down menu item menu, the drop-down menu includes Red, since the definition of default three menu items.
0.背包问题C语言算法
- 给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 ,
plotfit
- 多项式提取一个数组或是曲线的趋势项 得到一个多项式表达式 以及拟合的新数组-Extract an array of polynomial curve or a polynomial trend item to get a new array of expressions and fitting
ADC
- 项目中所做的ADC的matlab源代码，相信会有用-original matlab source code for ADC from the item i was doing，hoping to be helpful
backpack
- 已知N种物品和一个容纳重量为M的背包，每种物品均有自己的重量和效益值，假设这N种物品的重量和有可能大于M，这种情况下，选择哪种物品装入背包能获得最大效益值-Are known to have n kinds of goods and a weight capacity of M, backpacks, each item has its own weight and efficiency values, assume that n kinds of goods may be greater th
BPnet
- //1、动态改变学习速率 //2、加入动量项 //3、运用了Matcom4.5的矩阵运算库（可免费下载,头文件matlib.h)， // 方便矩阵运算,当然，也可自己写矩阵类 //4、可暂停运算 //5、可将网络以文件的形式保存、恢复-//1, dynamically changing learning rate// 2, adding momentum item// 3, the use of matrix operations Matcom4.5 library (ava
User-Interface-Design
- 通过编写触发对象后产生的动作执行程序完成下列任务： ①表面图、网格图或等高线图的图形显示； ②命令按钮响应绘制各类图形； ③添加菜单项实现图形窗口颜色的更改。 -Trigger objects by writing the action resulting from the implementation of the program complete the following tasks: ① surface map, contour map grid map or gra
Removal-trend-item
- 对加速度测试信号做预处理，去除趋势项后可以实现积分-Credits can be achieved after the the acceleration test signal preprocessing, removing the trend term
fuzzmu
- 模糊变换与模糊综合评价中，需要进行归一化处理，即各项之和除以每一项。以下为算子的matlab函数-Fuzzy transform and fuzzy comprehensive evaluation, the need for the normalization process, and that all of dividing the sum of each item. The following is the operator matlab function
tttapriori
- ＡＰＲＩＯＲＩ算法的详细源代码，包括了频繁项集的生成以及强关联规则生成-The APRIORI algorithm source code, including the generation of frequent item sets and strong association rules generation
E3
- A great collection to practice and deep into more in MatLab. 10 different exercises, where you can measure your skills. Each one has each time a little bit level. Enjoy this item and I hope it helps you.
integral
- 一个matlab的程序用于，消除趋势项，平滑处理，和时域与频域积分的处理.-A matlab program is used to eliminate the tendency item, smoothing, and deal with the time domain and frequency domain integral.
Fourier-series
- 可以用来演示傅里叶级数 逐项累加 逼近矩形波的效果-Can be used to demonstrate Fourier series, item by item, accumulative approximation of the rectangular wave effect
single-PMA
- 单根气动肌肉建模，包括理想项、迟滞项、弹性项，能够运行，结果正确-single pneumatic muscle model,include ideal item, hysteresis,elastic item
FullBNT-1.0.4
- 创建你的第一个贝叶斯网络 手工创建一个模型 从一个文件加载一个模型 使用 GUI 创建一个模型 推断 处理边缘分布 处理联合分布 虚拟证据 最或然率解释 条件概率分布 列表（多项式）节点 Noisy-or 节点 其它（噪音）确定性节点 Softmax（多项式 分对数）节点 神经网络节点 根节点 高斯节点 广义线性模型节点 分类 / 回归树节点 其它连续分布 CPD 类型摘要 模型举例 高斯混合模型 PCA、ICA等 专家系统的混合 专家系统的分等级混合 QMR 条件高斯模型 其它混合模型 参数学
Ch6_SingleMachine_Rank
- n项作业在同一台机器上按照一定的优先级规则进行加工的排序问题。输入序列后即可使用(he sort problem of the n item working on the same machine according to a certain priority rule. After entering the sequence, you can use it)
Ch7_Johnson
- N项作业的双机排序问题，已经有非常成熟的理论求解方法，即Johnson算法，可以找到最优解。(There is a very mature method of solving the double machine scheduling problem in N item, that is, Johnson algorithm, and the optimal solution can be found.)
Ch7_KeyWorkpiece
- N项作业的流水车间作业排序问题，使用关键工序法取得近优解。(In the flow shop scheduling problem of N item, near optimal solution is obtained by using the key procedure method.)
ajss-3-2-3
- Apriori[1] is an algorithm for frequent item set mining and association rule learning over transactional databases. It proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as long as
IRJET-V4I5669
- The Apriori algorithm was proposed by Agrawal and Srikant in 1994. Apriori is designed to operate on databases containing transactions (for example, collections of items bought by customers, or details of a website frequentation). Other algorithms ar