Misclassification minimization

The problem of minimizing the number of misclassified points by a plane, attempting to separate two point sets with intersecting convex hulls inn-dimensional real space, is formulated as a linear program with equilibrium constraints (LPEC). This general LPEC can be converted to an exact penalty problem with a quadratic objective and linear constraints. A Frank-Wolfe-type algorithm is proposed for the penalty problem that terminates at a stationary point or a global solution. Novel aspects of the approach include: (i) A linear complementarity formulation of the step function that counts misclassifications, (ii) Exact penalty formulation without boundedness, nondegeneracy or constraint qualification assumptions, (iii) An exact solution extraction from the sequence of minimizers of the penalty function for a finite value of the penalty parameter for the general LPEC and an explicitly exact solution for the LPEC with uncoupled constraints, and (iv) A parametric quadratic programming formulation of the LPEC associated with the misclassification minimization problem.This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grants CCR-9101801 and CDA-9024618.     

可编程控制器PLC及分布式控制系统简介

结合太钢１＃转炉生产操作实践,简要介绍了可编程控制器ＰＬＣ与分布式控制系统在电气自动化系统及防止误操作的软件编制逻辑图的应用     

基于改进混合模型的一类固定床反应器推断控制

对一类非绝热式固定床反应器提出了一种基于改进混合模型的非线性自适应推断控制策略：给出一种基于结合先验知识和人工神经网络的改进混合模型的推断估计器设计方法;提出一种改进程序变增益ＰＩＤ算法设计控制器;设计了该固定床反应器基于改进混合模型的推断控制系统。仿真结果表明：该推断估计器具有良好的静态和动态特性,较高的估计精度和较好的实时性,所需训练样本少,易于理解和研究及外推性能良好等特点,该推断控制系统还具有良好的跟踪和抗干扰性能。     

城市水资源水环境系统多阶段灰色动态仿真模型

本文依据城市人口,经济,水资源和水环境之间的相互影响,相互制约关系,建立了城市水资源水环境系统阶段灰色动态仿真模型,以预测不同仿真方案下城市水资源与水环境系统的变化。     

多元统计方法在作物生态区归类上的应用

本文讨论了两种多元统计方法在作物生态区归类上的应用,给出了计算方法及计算机程序设计的步骤,并根据实例,进行了具体的分析研究。     

一个实用的地图着色算法

给出一种计算机实现地图四色着色的算法,并以Ｐａｓｃａｌ语言编制了程序．该程序稍作改动,即可成为分块图形实现四色着色的通用程序．     

用户中继热线自动接续系统

提出以单片机为核心构成自动接续装置,检测程控交换机中继线路的直流状态和交流信号音,实现“热线电话”中继线路的自动接续．     

利用虚盘技术改进 NCP 生成过程

ＮＣＰ（ＮｅｔｗｏｒｋＣｏｎｔｒｏｌＰｒｏｇｒａｍ）是通讯控制器上运行的网络管理软件,当网络资源发生变化或网络参数修改时,ＮＣＰ都要重新生成,其生成时间直接影响到网络使用效率．本文陈述了ＮＣＰ的生成过程并通过引入虚盘技术,改进了ＮＣＰ生成过程,有效地缩短了其生成时间．     

二、三、四、五阶常系数线性微分方程解法公式与计算机求解

推导出二、三、四、五阶常系数线性微分方程的解（即函数关系）的一般表达式,并分别用Ｂａｓｉｃ语言和Ｐａｓｃａｌ语言编制出使用计算机求解的应用软件。该软件实际运行的结果证明,这种求解方法比任何一本《高等数学》教材介绍的通常的求解方法要简单得多、运算速度要快得多,因而具有很大的现实意义。     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.