多指标区间决策的理想点贴近法

研究了指标的权重不能完全确定但知道其所在区域的条件下的多指标决策问题 ,给出了方案与理想解的贴近度及其算法 ,按贴近度的大小可以对方案进行排序 .它同传统的决策方法相比较 ,具有需要信息量少 ,简单可靠等特点 .最后用该决策方法分析了一个实际问题 .     

A new method for the reduction of nitronyl nitroxides

Reduction of nitronyl nitroxides using hexamethylenetetramine is a very convenient method for preparing the corresponding imino nitroxides and 2-imidazoline N-oxides.     

基于多Agent的宏观经济智能预测决策支持系统研究

在分析智能决策支持系统的发展基础上，将人工智能思想，特别是Agent应用于构建智能宏观经济预测决策支持系统。提出面向任务的Agent设计思想，以任务为核心设计多种类型Agent共同完成预测决策任务，给出基于多Agent的系统组成结构，并给出系统中不同类型Agent的具体实现结构，同时探讨了整个系统的运行机制以及系统中多Agent之间的合作。整个系统的构建过程也是面向Agent的程序设计的过程。     

一种基于不同风险偏好投资多目标决策模型及解法

建立了风险投资的多目标决策模型，分别采用线性加权法、TOPSIS法和密切值法，对不同风险偏好下备选方案进行排序，再用平均值法对上述排序进行综合排序，从而避免单一方法的片面性，较为全面科学地得出最优方案。最后，用一个算例说明了方法的可行性和有效性。     

Sum-fuzzy implementation of a choice function using artificial learning procedure with fixed fraction

In one if his paper Luo transformed the problem of sum-fuzzy rationality into artificial learning procedure and gave an algorithm which used the learning rule of perception. This paper extends the Luo method for finding a sum-fuzzy implementation of a choice function and offers an algorithm based on the artificial learning procedure with fixed fraction. We also present a concrete example which uses this algorithm.     

群体决策的偏好协调性检验

对于一类群体决策问题，本文引进群体的偏好协调性指标，并且给出了偏好协调性指标的统计检验．在此基础上，还提出一个求该类群体决策问题的方法，以及讨论了群体的偏好快调性指标和群体决策结果间的关系．     

Learning and transfer in dynamic decision environments

An important aspect of learning is the ability to transfer knowledge to new contexts. However, in dynamic decision tasks, such as bargaining, firefighting, and process control, where decision makers must make repeated decisions under time pressure and outcome feedback may relate to any of a number of decisions, such transfer has proven elusive. This paper proposes a two-stage connectionist model which hypothesizes that decision makers learn to identify categories of evidence requiring similar decisions as they perform in dynamic environments. The model suggests conditions under which decision makers will be able to use this ability to help them in novel situations. These predictions are compared against those of a one-stage decision model that does not learn evidence categories, as is common in many current theories of repeated decision making. Both models' predictions are then tested against the performance of decision makers in an Internet bargaining task. Both models correctly predict aspects of decision makers' learning under different interventions. The two-stage model provides closer fits to decision maker performance in a new, related bargaining task and accounts for important features of higher-performing decision makers' learning. Although frequently omitted in recent accounts of repeated decision making, the processes of evidence category formation described by the two-stage model appear critical in understanding the extent to which decision makers learn from feedback in dynamic tasks. Faison (Bud) Gibson is an Assistant Professor at College of Business, Eastern Michigan University. He has extensive experience developing and empirically testing models of decision behavior in dynamic decision environments.     

置换环上的稳定矩阵

本文证明了置换环上的正则稳定矩阵是幂等矩阵和可逆矩阵的积,进一步证明了置换环上的正则稳定矩阵可以对角化。     

Reservoir operations optimization via fuzzy criterion decision processes

In this paper, we propose the treatment of complex reservoir operation problems via our newly developed tool of fuzzy criterion decision processes. This novel approach has been shown to be a more flexible and useful analysis tool especially when it is desirable to incorporate an expert’s knowledge into the decision models. Additionally, it has been demonstrated that this form of decision models will usually result in an optimal solution, which guarantees the highest satisfactory degree. We provide a practical exemplification procedure for the models presented as well as an application example.     

Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming

In this paper, we first refine a recently proposed metaheuristic called “Marriage in Honey-Bees Optimization” (MBO) for solving combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value. We then adapt MBO into an algorithm called “Honey-Bees Policy Iteration” (HBPI) for solving infinite horizon-discounted cost stochastic dynamic programming problems and show that HBPI also converges to the optimal value.