Reducing Cognitive Effort in Scoring Negotiation Space Using the Fuzzy Clustering Model

Negotiation scoring systems are fundamental tools used in negotiation support to facilitate parties searching for negotiation agreement and analyzing its efficiency and fairness. Such a scoring system is obtained in prenegotiation by implementing selected multiple criteria decision-aiding methods to elicit the negotiator’s preferences precisely and ensure that the support is reliable. However, the methods classically used in the preference elicitation require much cognitive effort from the negotiators, and hence, do not prevent them from using heuristics and making simple errors that result in inaccurate scoring systems. This paper aims to develop an alternative tool that allows scoring the negotiation offers by implementing a sorting approach and the reference set of limiting profiles defined individually by the negotiators in the form of complete packages. These limiting profiles are evaluated holistically and verbally by the negotiator. Then the fuzzy decision model is built that uses the notion of increasing the preference granularity by introducing a series of limiting sub-profiles for corresponding sub-categories of offers. This process is performed automatically by the support algorithm and does not require any additional preferential information from the negotiator. A new method of generating reference fuzzy scores to allow a detailed assignment of any negotiation offer from feasible negotiation space to clusters and sub-clusters is proposed. Finally, the efficient frontier and Nash’s fair division are used to identify the recommended packages for negotiation in the bargaining phase. This new approach allows negotiators to obtain economically efficient, fair, balanced, and reciprocated agreements while minimizing information needs and effort.     

Connectedness of efficient solution sets for set-valued maps in normed spaces

In vector optimization, the topological properties of the set of efficient solutions are of interest. Several authors have studied this topic for point-valued functions. In this paper, we study the connectedness of the efficient solution sets in convex vector optimization for set-valued maps in normed spaces.The author would like to thank Professor W. T. Fu for helpful discussions concerning Theorem 3.1 and other valuable comments. Moreover, the author is grateful to Professor H. P. Benson and three referees for valuable remarks and suggestions concerning a previous draft of this paper.     

On the existence of efficient points in locally convex spaces

We study the existence of efficient points in a locally convex space ordered by a convex cone. New conditions are imposed on the ordering cone such that for a set which is closed and bounded in the usual sense or with respect to the cone, the set of efficient points is nonempty and the domination property holds.     

类凸向量均衡问题解的最优性条件

在实的局部凸的Hausdorff拓扑线性空间中,考虑带约束的向量均衡问题,利用凸集分离定理,给出了带约束的类凸向量均衡问题的弱有效解,Henig有效解,全局有效解和超有效解的充分必要条件,并通过举例说明了锥类凸映射是比锥凸映射更弱的映射。     

一些高振荡积分、高振荡积分方程的高性能计算

电磁、声波散射问题的研究涉及一类数学物理问题, 此类问题具有深刻的理论价值和重要的应用背景, 亟待解决. 高振荡微分、积分方程是刻画这些问题的重要的数学模型, 其数值计算存在许多挑战性研究课题. 本文从积分方程解法角度出发, 综述了求解这类高振荡问题的一些最新进展, 特别是针对广义Fourier 变换、Bessel 变换的高效算法、高振荡核Volterra 积分方程的数值解法作了详细介绍. 这些数值方法共有特点是振荡频率越高算法精度愈高, 且可望为电磁计算的研究提供一些新的高效算法.     

Proper efficiency and duality for a class of constrained multiobjective fractional optimal control problems containing arbitrary norms

We establish necessary and sufficient conditions for properly efficient solutions of a class of nonsmooth nonconvex optimal control problems with multiple fractional objective functions, linear dynamics, and nonlinear inequality constraints on both the state and control variables. Subsequently, we utilize these proper efficiency criteria to construct two multiobjective dual problems and prove appropriate duality theorems. Also, we specialize and discuss these results for a particular case of our principal problem which contains square roots of positivesemidefinite quadratic forms. As special cases of the main proper efficiency and duality results, this paper also contains similar results for control problems with multiple, fractional, and ordinary objective functions.     

对密立根油滴实验的测量方法改进

利用对密立根油滴实验的改进解出了实验操作过程中的各种问题,提高学生的实验兴趣和理论联系实际的能力.     

新型含氧亚甲基和亚胺桥键液晶化合物分子结构与光谱的密度泛函理论研究

采用密度泛函理论方法在B3LYP/6-31G*水平上对6个新型含氧亚甲基和亚胺桥键液晶化合物分子的几何结构进行优化计算,讨论了取代基H,CH3,CH3O,C2H5O,NO2,Cl对分子电荷、前线轨道能量和电子吸收光谱等性质的影响.在此基础上使用含时密度泛函理论方法计算了分子第一激发态的电子垂直跃迁能,得到最大吸收波长λmax.计算表明,取代基的引入导致最大吸收波长红移.     

Approximation and Reconstruction of the Electrostatic Field in Wire–Plate Precipitators by a Low-Order Model

The numerical computation of the ionic space charge and electric field produced by corona discharge in a wire–plate electrostatic precipitator (ESP) is considered. The electrostatic problem is defined by a reduced set of the Maxwell equations. Since self-consistent conditions at the wire and at the plate cannot be specified a priori, a time-consuming iterative numerical procedure is required. The efficiency of all numerical solvers of the reduced Maxwell equations depends in particular on the accuracy of the initial guess solution. The objectives of this work are two: first, we propose a semianalytical technique based on the Karhunen–Loève (KL) decomposition of the current density field J, which can significantly improve the performance of a numerical solver; second, we devise a procedure to reconstruct the complete electric field from a given J. The approximate solution of the current density field is based on the derivation of an analytical approximation , which, added to a linear combination of few KL basis functions, constitutes an accurate approximation of J. In the first place, this result is useful for optimization procedures of the current density field, which involve the computation of many different configurations. Second, we show that from the current density field we can obtain an accurate estimate for the complete electrostatic field which can be used to speed up the convergence of the iterative procedure of standard numerical solvers.