局域网中动态二次选举算法

提出了一种局域网中如何快速有效地选举出性能最佳的节点替代出现故障的专用设备的方法：二次选举法，结合了集中式算法与分布式算法的优点，避免了二者的缺陷，成功地解决了局域网中集中式管理的不稳定性，提高了系统的健壮性．     

用广义上界算法解大型供应链问题

信息技术和生产率的发展以及全球经济一体化的发展趋势，使供应链成为全世界管理科学的热点.本文在阐述供应链基本数学模型的基础上，系统论述了用改进的广义上界(GUB)算法求解大型供应链问题的计算方法．     

A Gradient-Simulated Annealing Algorithm of Pre-location-Based Best Fitting of Blank to Complex Surfaces Machining

The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections of two objects on a plane perpendicular to the normal vector. The second step is optimizing an objective function by means of gradient-simulated annealing algorithm to get the best matching of a set of distributed points on the blank and destination surfaces. An example for machining…     

Common subgraph isomorphism detection by backtracking search

Graph theory offers a convenient and highly attractive approach to various tasks of pattern recognition. Provided there is a graph representation of the object in question (e.g. a chemical structure or protein fold), the recognition procedure is reduced to the problem of common subgraph isomorphism (CSI). Complexity of this problem shows combinatorial dependence on the size of input graphs, which in many practical cases makes the approach computationally intractable. Among the optimal algorithms for CSI, the leading place in practice belongs to algorithms based on maximal clique detection in the association graph. Backtracking algorithms for CSI, first developed two decades ago, are rarely used. We propose an improved backtracking algorithm for CSI, which differs from its predecessors by better search strategy and is therefore more efficient. We found that the new algorithm outperforms the traditional maximal clique approach by orders of magnitude in computational time. Copyright © 2004 John Wiley & Sons, Ltd.     

考虑风电接入和气电转换的综合能源系统日前区间优化

针对气电综合能源系统优化调度中未充分挖掘可调度因素、未充分考虑风电预测误差不确定性的现状,研究含风电的气电综合能源系统日前区间优化调度方法。首先,基于区间数学对风电出力的不确定性进行区间描述,综合考虑抽水蓄能、气电双向转换以及需求响应等资源和技术,并用区间数学表示优化目标和优化约束,构建含高比例风电的气电综合能源系统日前优化模型,综合优化系统的经济性、环保性。然后,基于区间序关系和可能度的方法将区间优化模型转化为确定性优化模型,继而采用Jaya算法进行求解,保证求解的高效性和解空间的可行性。最后,进行算例分析,仿真结果验证了综合利用抽水蓄能、气电双向转换以及需求响应等要素对系统进行区间优化,能取得优化效果上的优势,并能为系统调度人员提供风电不确定度对系统优化影响的信息。     

基于遗传算法的0/1背包问题求解

利用遗传算法提出了解决０／１背包问题的３种算法,这３种算法分别是基于罚函数修正方法和译码方法的算法,理论分析表明,修正方法可以获得问题的最优解,在不同测试数据集上对这３处算法的性能进行了比较,结果与理论分析一致。     

误差反向传播算法的数学推导及实现步骤

提供了人工神经网络的一种算法-误差反向传播算法的数学推导方法及上机实现步骤.     

一个新的线性规划预校正算法

提出了一种新的线性规划预校正算法,预步是取的Ｅｕｌｅｒ方向,算法复杂度为Ｏ（n~(1/2)Ｌ）