在电压过零点触发或截至可控硅的导通或闭合；有效通断电压；应用稳定可靠；...

类是将一个未知样本分到几个预先已知类的过程。 在众多的分类模型中，应用最为广泛的两种分类模型是决策树模型(Decision Tree Model)和朴素贝叶斯模型（Naive Bayesian Model，NBC）。

复合形法的不等式约束优化。其中的主程序是通用的，只要修改自己的目标函数和约束条件即可。-Complex method of inequality constrained optimization. One of the main program is commonly used, as long as the amendments to its own objective function and constraint conditions.

随机化算法-Randomized Algorithms

数字图像获取、处理和实践——很多图像处理有用的源代码，图像增强（均值滤波3*3,5*5，中值滤波），边缘检测（sobel算子，拉普拉斯算子，reborts算子），图像分割（固定阈值分割，最大类间方差阈值分割）等

一个矩阵类的实现，有加减乘除、求逆、转置等功能，应该是一个不错的实用程序。-a matrix of type, and it is the arithmetic, inversion, transpose function, it should be a good utility.

很有用的算法哦。这是我好不容易-useful algorithm oh. This is not easy, I

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。 编程任务：对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。-Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores. Programming tasks: for a given n stack stone, into a pile of programming the calculation of the minimum scores and maximum scores.

! 平面杆系结构静力分析程序 ! 先处理法源程序 ! ! 主要功能和特点： ! 可调数组 ! 输入单元结点编号和结点位移编码； ! 先处理法形成总体刚度阵和结构综合结点荷载 ! 存储总刚上三角元素； ! GAUSS消元法解线性代数方程组； ! 计算结点位移和单元杆端力-! Plane truss structure static analysis program! First treatment source!! Main functions and characteristics:! Adjustable array! Input module node number and node displacement coding ! First approach to form and structure of the overall stiffness matrix Consolidated Statement point load! storage total just on the triangular element ! GAUSS elimination method solving linear algebraic equations ! computing node displacement and force unit rod end

该程序用于计算任务分配问题，任务分配问题也是运筹学中一个较难的问题。-procedures used in the calculation of the distribution of tasks, task allocation problem is tacticians had a more difficult problem.

我们想要使用此算法以解决集装箱装载问题查找最佳对象的最佳选择采取他们在容器中