Ordinal Comparison via the Nested Partitions Method

We analyze a new approach for simulation-based optimization of discrete event systems that draws on two recent stochastic optimization methods: an adaptive sampling approach called the nested partitions method and ordinal optimization. The ordinal optimization perspectives provides new insights into the convergence of the nested partitions method and guidelines for its implementation. We also use this approach to show that global convergence requires relatively simulation runs and propose new effective variants of the algorithm. Simulation results are presented to demonstrate the key results.     

Large-Dimensional Mathematical Programming Problems: A Solution Approach

An algorithm is designed for numerically solving large-dimensional mathematical programming problems, in which only the variables in linear constraints play a dominant role.     

嵌套分割算法在随机需求车辆路径问题中的应用研究

对需求量满足二项分布的随机需求车辆路径问题进行了研究,在服务失败时采取允许部分服务的策略,并将嵌套分割算法与扫描算法相结合,给出了一种新的求解随机需求车辆路径问题的两阶段算法,数值试验验证了该算法的有效性。同时,该算法也拓展了车辆路径问题的算法空间。     

混合SPMD模拟退火算法及其应用

模拟退火算法由于有很好的数学特性－以概率1收敛于全局最优值,再加上其算法本身与特定的问题无关,因此被广泛地用于各种组合优化问题。但是,模拟退火算法又具有收敛速度慢,执行时间长,算法性能与初始值有关及参数敏感等特点,使得它在不少应用中成为一种低效甚至是不可行的算法。文中提出一种混合SPMD模拟退火算法,在克服经典模拟退火算法内在串行性的同时,进一步和下山法结合起来,并综合多种优化方法,在一定的处理机规模内取得了可扩展和并行效果,显著提高了算法的收敛速度,克服了算法性能对初始值和参数选择的过分依赖,在提高算法性能的同时,方便了算法的使用。该算法已在一个机群系统THNPSC－1上得以实现,并在材料科学的一个定量电子晶体学研究问题中得到应用,降低了该问题的求解时间,提高了求解质量。     

一种新型混合遗传算法及其应用

针对遗传算法应用的局限性,引入新的种群择优交叉运算、变异运算、遗传边界算子和相互学习过程的思想,提出一种新型混合遗传算法,提高了算法的收敛速度和稳定性,数值算例验证了该算法的有效性和实用性。     

遗传编程在符号回归中的应用

遗传编程是一种新型的搜索优化技术,文章介绍了遗传编程的基本原理,以及遗传编程的算法设计及其实现的几个关键问题,并研究了基于遗传编程方法的符号回归。与传统回归方法相比,该方法得到的拟合函数更精确,具有更广泛的适用性。文中通过对一个函数进行符号回归验证,说明此方法合理可行。     

MFC中的消息映射机制及其在程序设计中的应用

Windows是一个基于消息驱动的操作系统,消息作为联系操作系统和应用程序的纽带,它的产生与处理是Windows应用程序设计的核心;MFC是一个封装了大部分WindowsAPI函数的Windows应用程序可视化开发工具,它用一种巧妙的映射机制将消息管理及消息操作封装起来,理解MFC的消息映射机制是利用MFC进行应用程序设计的关键;最后通过自定义消息的处理实例说明了消息映射机制在程序设计中的应用。     

MFC中的消息映射机制及其在程序设计中的应用

Windows是一个基于消息驱动的操作系统，消息作为联系操作系统和应用程序的纽带．它的产生与处理是Windows应用程序设计的核心；MFC是一个封装了大部分Windows API函数的Windows应用程序可视化开发工具．它用一种巧妙的映射机制将消息管理及消息操作封装起来，理解MFC的消息映射机制是利用MFC进行应用程序设计的关键：最后通过自定义消息的处理实例说明了消息映射机制在程序设计中的应用。     

面向对象的程序设计的演化特征及应用

本文以数据类型的抽象与重构为线索，分析与评介了程序设计语言与方法的演化过程及其必然性，探讨面向对象程序设计与实现需解决的若干问题，在此基础上介绍了面向对象程序设计在数据库与人工智能两大分支中的应用途径、现状与前景。     

A Hybrid Analysis of an Optimization Approach for Cluster Applications

Cluster/distributed computing has become a popular, cost-effective alternative to high-performance parallel computers. Many parallel programming languages and related programming models have become widely accepted on clusters. However, the high communication overhead is a major shortcoming of running parallel applications on cluster/distributed computing environments. To reduce the communication overhead and thus the completion time of a parallel application, this paper introduces and evaluates an efficient Key Message (KM) approach to support parallel computing on cluster computing environments. In this paper, we briefly present the model and algorithm, and then analytical and simulation methods are adopted to evaluate the performance of the algorithm. It demonstrates that when network background load increases or the computation to communication ratio decreases, the analysis results show better improvement on communication of a parallel application over the system which does not use the KM approach.     

带混合模拟退火算法的神经网络及其应用

对非线性系统辨识问题,以多层前向网络为模型框架,用本文提出的带自适应冷却进度表的模拟退火算法与Powell算法构成新型混合算法,来训练网络的权值。冷却进度表中主要参数是模拟退火算法的控制参数T的初值T0和T的衰减函数。把整个迭代过程划分为若干阶段。在每个阶段结束时,依据网络模型误差自适应地修正下阶段的T0（回火温度）、T的衰减函数中的参数和迭代步长初值,上述混合算法具有很强的全局和局部搜索能力,显著提高了网络的辨识精度。应用表明了本文方案的有效性。     

基于可重用框架的软件开发模式及其应用

框架是可重用的特定领域应用软件的半成品,开发者通过定制可以建立具体的应用系统,一个好的框架可大大降低应用系统的开发成本。讨论了基于框架的应用系统开发模式,提出了一个基于多层结构的可重用的交易服务器框架,并给出了该框架的设计方法与实现技术。     

Mathematical Programming in Data Mining

Mathematical programming approaches to three fundamental problems will be described: feature selection, clustering and robust representation. The feature selection problem considered is that of discriminating between two sets while recognizing irrelevant and redundant features and suppressing them. This creates a lean model that often generalizes better to new unseen data. Computational results on real data confirm improved generalization of leaner models. Clustering is exemplified by the unsupervised learning of patterns and clusters that may exist in a given database and is a useful tool for knowledge discovery in databases (KDD). A mathematical programming formulation of this problem is proposed that is theoretically justifiable and computationally implementable in a finite number of steps. A resulting k-Median Algorithm is utilized to discover very useful survival curves for breast cancer patients from a medical database. Robust representation is concerned with minimizing trained model degradation when applied to new problems. A novel approach is proposed that purposely tolerates a small error in the training process in order to avoid overfitting data that may contain errors. Examples of applications of these concepts are given.     

混合编程集群研究及实现

介绍了采用双核处理器的共享存储多处理机（SMP）作为计算节点时,高性能并行计算集群的结构。研究了此类系统的并行计算粒度和优化方法,描述了该集群MPI＋OpenMP的混合编程平台构建方法。利用此平台,实现了求解现行方程组的Mann迭代算法,通过数值测试,表明此类集群具有良好的计算性能。此系统已用于实际工作中,取得了良好的效果。     

Mathematical Programming Embeddings of Logic

Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative, and this approach has yielded rich dividends from the dual perspective of better understanding of the mathematical structure of deduction and in improving the efficiency of algorithms for deductive reasoning. Most of these results have been for the case of propositional and probabilistic logics. In the case of predicate logic, there have been successes in adapting mathematical programming schemes to realize new algorithms for theorem proving using partial instantiation techniques. A structural understanding of mathematical programming embeddings of predicate logic would require tools from topology because of the need to deal with infinite-dimensional embeddings. This paper describes the first steps in this direction. General compactness theorems are proved for the embeddings, and some specialized results are obtained in the case of Horn logic.     

Graph Applications in Programming

Graph theory, which used to be a purely academic discipline, is now increasingly becoming a prerequisite to effective application of computers in numerous applied fields. In the paper, current works are surveyed on creation of support tools for application of graphs in programming conducted by the Laboratory for Program Construction and Optimization of the Ershov Institute of Information Systems, Siberian Division, Russian Academy of Sciences. These works are supported by the Russian Foundation for Basic Research and the Ministry of Education. We start by considering the works on creation of an encyclopedia of graph algorithms for programmers. Techniques and tools for visual processing of graphs and graph models are described. An explanatory dictionary on graph theory in computer science and programming and its electronic version are discussed.     

Stabilization of the Networked Hybrid Systems with Communication Constraints and Its Applications

International Journal of Control, Automation and Systems - In this paper, a stabilization problem is investigated for a class of networked control systems with some communication constraints. A...     

一种求解job shop问题的混合多目标遗传算法

提出一种基于操作编码、采用递进策略与非劣解局部搜索相结合的混合多目标遗传算法。通过将递进进化模式和非劣解局部搜索策略引入到算法结构,改善了算法对解空间的遍历性与算法的收敛性。采用改进算法对典型的jobshop算例进行三目标优化,所得结果验证了算法的有效性。