多目标模糊系数规划

在单目标模糊系数规划的理论基础上，对多目标模糊系数规划进行讨论，在以目标间的协调程度尽可能大为最优性条件的要求下提出多目标模糊系数规划最优解的定义，并给出一种可行的求解方法。     

A traffic shaping model for optimizing network operations

The management of technology in multi-service computer networks, such as university networks, has become a challenge with the explosive growth of entertainment oriented peer-to-peer (P2P) traffic. Traffic shaping is one of the tools used to manage bandwidth to improve system performance by allocating bandwidth between P2P and non-peer-to-peer (NP2P) traffic. We present a model for traffic shaping and bandwidth management that considers the trade-offs from allocating different amounts of bandwidths for different application categories and use data from a university network. The current policy allocates varying bandwidths over the day to P2P and NP2P traffic to reflect the importance of not letting entertainment based traffic choke the network during the day time at the expense of the more important traffic, such as Web traffic. We highlight the difficulties in obtaining data in the form required for analysis, and the need to estimate demand for allocations not covered by current policy. We present a goal programming model for this estimation task. We also model the traffic shaping problem as a Markov decision process and develop an algorithm for determining the optimal bandwidth allocation to maximize the utility of all users. Finally we use a numerical example to illustrate our approach.     

并行FORTRAN程序设计技术探索

简要叙述了并行程序设计语言ＣＭＦｏｒｔｒａｎ的计算模式、并行数据结构及其主要特征．并对Ｆｏｒｔｒａｎ７７和Ｆｏｒｔｒａｎ９０上的扩展部分作了概要描述．     

Binary fuzzy goal programming

Goal programming is an important technique for solving many decision/management problems. Fuzzy goal programming involves applying the fuzzy set theory to goal programming, thus allowing the model to take into account the vague aspirations of a decision-maker. Using preference-based membership functions, we can define the fuzzy problem through natural language terms or vague phenomena. In fact, decision-making involves the achievement of fuzzy goals, some of them are met and some not because these goals are subject to the function of environment/resource constraints. Thus, binary fuzzy goal programming is employed where the problem cannot be solved by conventional goal programming approaches. This paper proposes a new idea of how to program the binary fuzzy goal programming model. The binary fuzzy goal programming model can then be solved using the integer programming method. Finally, an illustrative example is included to demonstrate the correctness and usefulness of the proposed model.     

进化规划动态寻优机理分析

为了从整体上揭示进化规划 ( EP)算法的内在运行机制 ,探寻算法的动态寻优机理 ,本文从种群角度出发 ,建立了一种种群动态寻优微分方程模型 ,并对该模型进行了理论分析 .数值模拟结果说明了所建模型的正确性 ,并得出了一些有意义的结论     

A new approach for data editing and imputation

The editing-and-imputation problem concerns the question of finding errors in a record which does not satisfy a set of consistency rules. Once some potential errors have been localizated, it is also necessary to impute new values to the associated fields. The output dataset should consist of valid records and preserve similar statistical properties as the input dataset. Most of this work is usually done manually by statistical agencies, thus consuming a great deal of human resources. This paper presents a mathematical programming model to optimally solve the problem on surveys with categorical values and particular edits. We also describe a heuristic approach to deal with the more complex surveys. The heuristic procedure follows a combination of the widely-accepted hot-deck donor scheme and the multivariate regression analysis. It has been implemented in a graphical user interface running on standard personal computers, and has been tested on real-world surveys. This paper demonstrates the satisfactory performance of our automatic procedure.     

极限分析的无搜索数学规划算法

本文研究理想刚塑性介质极限载荷因子的计算方法。根据极限分权理论的上限定理,建立了计算极限载荷因子的一般数学规划有限元格式。针对这种格式的特点,提出了一个求解极限载荷因子的无搜索迭代算法。这个算法中采用逐步识别刚性、塑性分区,不断修正目标函数的方案,克服了目标函数非光滑所导致的困难。本文提出的算法建立于位移模式有限元基础上,有较广的适用范围,且具有计算效率高,稳定性好,格式简单易于程序实现等优点。     

DEA based dimensionality reduction for classification problems satisfying strict non-satiety assumption

This study shows how data envelopment analysis (DEA) can be used to reduce vertical dimensionality of certain data mining databases. The study illustrates basic concepts using a real-world graduate admissions decision task. It is well known that cost sensitive mixed integer programming (MIP) problems are NP-complete. This study shows that heuristic solutions for cost sensitive classification problems can be obtained by solving a simple goal programming problem by that reduces the vertical dimension of the original learning dataset. Using simulated datasets and a misclassification cost performance metric, the performance of proposed goal programming heuristic is compared with the extended DEA-discriminant analysis MIP approach. The holdout sample results of our experiments shows that the proposed heuristic approach outperforms the extended DEA-discriminant analysis MIP approach.     

Thermomechanical behavior of thermoset shape memory polymer programmed by cold-compression: Testing and constitutive modeling

Programming is a key process for thermally activated stress or strain recovery of shape memory polymers (SMPs). Typically, programming requires an initial heating above the glass transition temperature (T_g), subsequent cooling below T_g and removal of the applied load, in order to fix a temporary shape. This work adopted a new approach to program thermoset SMPs directly at temperatures well below T_g, which effectively simplified the shape fixing process. 1-D compression programming below T_g and free shape recovery of a thermoset SMP were experimentally investigated. Functional stability of the shape fixity under various environmental attacks was also experimentally evaluated. A mechanism-based thermoviscoelastic-thermoviscoplastic constitutive model incorporating structural and stress relaxation was then developed to predict the nonlinear shape memory behavior of the SMP trained below T_g. Comparison between the prediction and the experiment showed good agreement. The structure dependence of the thermomechanical behavior of the SMP was further discussed through a parametric study per the validated constitutive model. This study validates that programming by cold-compression is a viable alternative for thermally responsive thermoset SMPs.