Several multi-criteria programming methods for classification

In this paper, we propose a general optimization-based model for classification. Then we show that some well-known optimization-based methods for classification, which were developed by Shi et al. [Data mining in credit card portfolio management: a multiple criteria decision making approac. In: Koksalan M, Zionts S, editors. Multiple criteria decision making in the new millennium. Berlin: Springer; 2001. p. 427–36] and Freed and Glover [A linear programming approach to the discriminant problem. Decision Sciences 1981; 12: 68–79; Simple but powerful goal programming models for discriminant problems. European Journal of Operational Research 1981; 7: 44–60], are special cases of our model. Moreover, three new models, MCQP (multi-criteria indefinite quadratic programming), MCCQP (multi-criteria concave quadratic programming) and MCVQP (multi-criteria convex programming), are developed based on the general model. We also propose algorithms for MCQP and MCCQP, respectively. Then we apply these models to three real-life problems: credit card accounts, VIP mail-box and social endowment insurance classification. Extensive experiments are done to compare the efficiency of these methods.     

基于混合聚类的城市道路多时段控制研究*

多方案控制具有简单实用、可靠性好,稳定性高,性价比高等的优点,在城市交通控制中得到了广泛应用。本研究在利用指数平滑异同移动平均法对缺失交通数据进行修补的基础上,运用快速聚类与系统聚类相结合的混合聚类方法对交通数据进行分析,并以经典的Silhouttte评价指标作为聚类终止条件,同时兼顾/考虑了交通数据时序性,消除聚类结果中的三类“奇异点”,最后利用交通信号配时软件SYNCHRO制定了相应时段的控制方案。相关的案例分析显示,优化后的多时段控制方案可以更好地适应交通流的波动,车均延误减少9.79%,其中时序性考虑可以有效改善控制方案频繁切换对交通流的扰动,避免其负效应对混合聚类改善效果的影响。     

使用Qt/C++编程操作Microsoft Office软件的应用

Microsoft office系列软件在日常工作中应用广泛。我单位在工程项目中大量使用Office软件进行数据处理及交换,对这些原始数据采取适当的方法分析挖掘,可以极大地缩短设计与试验周期、降低成本。由于项目产生的临时数据常以不同格式存放在各种办公软件中,且数量巨大,所以需要一个可以控制Office系列办公软件的程序来完成原始信息的收集及输出。给出了通过使用基于C++的Qt框架并结合COM、ODBC技术获取、处理数据,并输出至数据库或XML文档的实现方法。     

基于积件思想的高职计算机课程项目式教学探索——以C语言程序设计为例

基于积件思想,对五年制高职计算机课程项目式教学进行探索,以C语言程序设计为例研究分析,并组建C语言程序设计课程知识点积件库,编写高职C语言程序设计课程项目式校本教材,分析C语言程序设计课程教学项目“阶梯电价计费”.并借助开源平台Moodle实现了教学项目的应用.     

Application of fuzzy sets to manufacturing/distribution planning decisions in supply chains

In the real-world manufacturing/distribution planning decision (MDPD) integration problems in supply chains, the environmental coefficients and parameters are normally imprecise due to incomplete and/or unavailable information. This work presents a fuzzy linear programming approach based on the possibility theory. It applies this approach to solve multi-product and multi-time period MDPD problems with imprecise goals and forecast demand by considering the time value of money of related operating cost categories. The proposed approach attempts to minimize the total manufacturing and distribution costs by considering the levels of inventory, subcontracting and backordering, the available machine capacity and labor levels at each source, forecast demand and available warehouse space at each destination. This study utilizes an industrial case study to demonstrate the feasibility of applying the proposed approach to practical MDPD problems. The primary contribution of this paper is a fuzzy mathematical programming methodology for solving the MDPD integration problems in uncertain environments.     

MDA建模的AOP扩展策略及其比较

对于MDA横切于核心业务逻辑的关注点对封装的破坏的问题,本文给出把AOP引入到MDA的扩展策略和主要方法,并对不同的扩展策略进行了比较。     

传感器输出特性的线性化回归程序设计

介绍了用面向对象程序设计方法编制的线性回归数据处理程序 ,该程序用于传感器实验数据的回归处理和特性曲线的绘制     

蒙古文整词计算机生成理论研究

采用面向对象方法,模拟传统蒙古文整词各种形式构成机理,提出了几种蒙古语整词计算机生成数据模型。文章主要依据整词计算机生成三种模型,探讨了传统蒙古文整词计算机最优化生成理论所涉及的精确度、时间复杂度、空间复杂度三项基本要素以及最优化生成必须考虑的整词复杂特征载荷与一体化合一计算知识表示方法和计算结构,证明了“B - J - T= W”数据模型是传统蒙古文整词计算与生成最优化对象模型。     

Guaranteed Dynamic-System State Estimation by the Method of Bidirectional Dynamic Programming

The problem of guaranteed estimation (smoothing, filtration, prediction) of a dynamic process observed on a finite discrete time interval is solved, based on generalization of the dynamic programming procedure for the case with sequential optmization in direct and inverse time.     

Evolving Teams of Predictors with Linear Genetic Programming

This paper applies the evolution of GP teams to different classification and regression problems and compares different methods for combining the outputs of the team programs. These include hybrid approaches where (1) a neural network is used to optimize the weights of programs in a team for a common decision and (2) a realnumbered vector (the representation of evolution strategies) of weights is evolved with each term in parallel. The cooperative team approach results in an improved training and generalization performance compared to the standard GP method. The higher computational overhead of team evolution is counteracted by using a fast variant of linear GP.