关键词： 矿井通风   风网解算   风机优选   通风系统   风机能耗  

摘要： 在分析常用的矿井通风网路解算方法的基础上,提出了一种新的回路调节优化方法。该法的核心思想是以非平衡状态下的最小功耗路线通路为基准,按照最小生成树法则逐一调节风网的每一通路,此过程一直进行到不再有可调节的通路为止。该方法建立的通风网络解算优化数学模型不仅能获得理论上的最佳调节量和调节位置,从而保证矿井总功耗最小,而且确定的调节方案在矿井的实际应用中切实可行,为科学合理、安全有效地选择地面主要通风机工况、优化井下机站位置和工况、优化调节位置和调节量等提供了新的方法和手段。

关键词： 区域优化   多目标规划   离散度   数据分类法   近似最优解   算法  

摘要： 针对一些实际问题提出区域优化分割问题并建立数学模型,综合应用数据分类法、多目标非线性规划理论等数学理论和方法,获得了区域优化分割模型的近似最优解及算法。

关键词： 排队模型   系统仿真   分支限界算法  

摘要： 医院病床的合理安排是病人和医院共同关注的问题。理论上这一问题有排队论和规划论的特点。考虑到病人、病床和手术之间的流程关系,确定出使用平均等待时间、平均住院时间、平均逗留时间、平均等待队长和住院率来作为评价指标,这些指标可以充分反映医院病床安排的优劣。

关键词： Nonlinear equations   Relaxation Newton algorithm   Newton-Raphson method   Two-step relaxation Newton algorithm   Parallel computation   Global convergence  

摘要： We introduce a new algorithm, namely two-step relaxation Newton, for solving algebraic nonlinear equations f (x) = 0. This new algorithm is derived by combining two different relaxation Newton algorithms introduced byWu et al. (Appl. Math. Comput. 201: 553-560, 2008), and therefore with special choice of the so called splitting function it can be implemented simultaneously, stably with much less memory storage and CPU time compared with the Newton-Raphson method. Global convergence of this algorithm is established and numerical experiments show that this new algorithm is feasible and effective, and outperforms the original relaxation Newton algorithm and the Newton-Raphson method in the sense of iteration number and CPU time.

关键词： Branch and bound   Knapsack problem   Multiobjective   Evolutionary algorithms  

摘要： In this paper, we solve instances of the multiobjective multiconstraint (or multidimensional) knapsack problem (MOMCKP) from the literature. with three objective functions and three constraints. We use exact as well as approximate algorithms. The exact algorithm is a properly modified version of the multicriteria branch and bound (MCBB) algorithm, which is further customized by suitable heuristics. Three branching heuristics and a more general purpose composite branching and construction heuristic are devised. Comparison is made to the published results from another exact algorithm, the adaptive epsilon-constraint method [Laumanns, M., Thiele, L, Zitzler, E., 2006. An efficient, adaptive parameter variation scheme for Metaheuristics based on the epsilon-constraint method. European journal of operational Research 169, 932-942], using the same data sets. Furthermore, the same problems are solved using standard multiobjective evolutionary algorithms (MOEA), namely, the SPEA2 and the NSGAII. The results from the exact case show that the branching heuristics greatly improve the performance of the MCBB algorithm, which becomes faster than the adaptive epsilon-constraint. Regarding the performance of the MOEA algorithms in the specific problems, SPEA2 outperforms NSGAII in the degree of approximation of the Pareto front, as measured by the coverage metric (especially for the largest instance). (C) 2009 Elsevier B.V. All rights reserved.

关键词： Algorithm   Canonical algebra   Tubular algebra   Exceptional module   Weighted projective line   Coherent sheaf   Vector bundle   Exceptional sheaf  

摘要： Let A be a tubular canonical algebra of quiver type. We describe an algorithm, which for numerical data computes all regular exceptional A-modules, or more generally all indecomposable modules in exceptional tubes. The input for the algorithm is a quadruple consisting of the slope, the number of the tube, the quasi-socle and the quasi-length, the output are explicit matrices for the module with the data above. (C) 2010 Elsevier Inc. All rights reserved.

关键词： 高中数学   算法   教学  

摘要： 作为基础教育的数学新课程改革己把算法列为高中数学课程的新的双基内容之一．的确，算法学习的现实意义不容忽视，它不但能够培养学生有条理地思考与表达的能力，而且能发展学生解决实际问题的能力，并为今后学习程序设计打下基础．因此，在高中数学教学中如何优化算法教学是需要得到广泛关注和亟待解决的现实问题．

关键词： 单向贴近度   权重   多指标  

摘要： 通过分析人脑评阅主观题的思维方法,引入了贴近度和多指标综合评判的思想。基于模糊数学中单向贴近度的理论,设计并实现了一种评阅主观题的带权单向匹配算法。算例说明该算法能有效提高主观题自动评阅的精确度。

关键词： 悬挂运动控制系统   软件设计   数据采集   数据运算   控制信号   软件质量   编程思想   数学算法  

摘要： （接上期） 四、软件设计 软件设计是该设计的灵魂,所有的数据采集,数据运算,产生电机控制信号,都是由软件完成,软件质量高低直接决定系统的功能和精度。1.模型的数学算法和编程思想（1）点到点移动的设计实现从一点移动到设定的坐标点,一点坐标和其对应的S1,S2线长存在如下几何关系,如图8所示。

关键词： preconvex set   convex programming problem   necessary condition for a local minimum   convergence of an iterative algorithm  

摘要： An iterative algorithm is proposed for minimizing a convex function on a set defined as the set-theoretic difference between a convex set and the union of several convex sets. The convergence of the algorithm is proved in terms of necessary conditions for a local minimum.