电加热炉模糊变结构温度控制系统

本文针对炉体温度对象建模较难，常规算法难以发挥良好的作用，阐述了将模糊控制与变结构控制结合控制的原理及方法，并成功的将该设计方法应用于成都砂轮厂树脂硬化炉的温度控制中，取得良好效果。     

The Kissing Triangles: The Aesthetics of Mathematical Discovery

Papert's (1978) appeal to reconsider the power and possibilities of the aesthetic in mathematics learning is often ignored in mathematics education research. This paper begins with the premise, put forth by Dewey (1934), that the aesthetic structures many dimensions of inquiry and experience. In the same way that using particular paintings, musical compositions, or even everyday experiences has been instrumental to attempts by philosophers to understand the aesthetic dimensions of meaning and experience in artistic domains, I propose that analysing a particular encounter with mathematics may help reveal the nature and role of the often nebulous responses of elegance, beauty, and `fit' to which mathematicians lay claim in their mathematical activity. To achieve this, I draw on and adapt the defining features of the aesthetic character of experience set forth by the aesthetician Beardsley (1982). This, in turn, sheds light on the role thataesthetics can play in mathematical inquiry and experience, and provides initial categories and conjectures that can be used to investigate the potential roles of aesthetics in mathematics learning contexts.This revised version was published online in September 2005 with corrections to the Cover Date.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

具有模糊数的模糊多目标群体决策优选模型与方法

多目标群体决策问题是运筹学的一个重要研究领域，目前已经提出了一些有效的决策方法。但对目标值和权重均为模糊数的模糊多目标群体决策问题却研究不多，本对此类模糊多目标群体决策问题进行了探讨，利用相对正理想方案与相对负理想方案概念定义了相对差异距离，进而建立了模糊多目标群体决策优选模型与方法，并通过战役决心方案的评价说明了该方法是可行、有效的，可作为军事决策与决策支持系统的备选方法。     

动态激光衍射法测量细丝直径

基于夫琅禾费衍射理论和巴比涅互补原理,提出了利用激光衍射对细丝直径进行动态测量的方法.该方法具有测量精度高、速度快、非接触、使用方便且易于微机联接实现自动化测量等优点.     

波纹纤维混凝土的动力耗散研究

根据曲线纤维的几何特点和受力性能 ,推导了波纹纤维混凝土的本构关系 ,在本构理论的基础上进行动力耗散研究     

A Genetic Search for Exploiting a Fuzzy Preference Model of Portfolio Problems with Public Projects

When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution.     

Toward Fuzzy Optimization without Mathematical Ambiguity

Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed.     

ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES

ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.