Rational choice based on vague preferences

This paper studies vague preferences. In contrast to the concept of fuzzy preferences, the more general notion of vague preferences does not entail the assumption that the different degrees of preference are completely ordered. It is shown that the more general concept of a vague preference order arises very naturally in the context of aggregating a set of (exact) weak orders. Furthermore, necessary and sufficient conditions for the rationalizability of an exact choice function by means of a vague preference order are given. It turns out that in the general case these conditions are weaker than in the case where the degrees of preference are completely ordered. Consequently, there exist choice functions which are rationalizable by a general vague preference order but which are not rationalizable by a fuzzy preference order, or more generally by any vague preference order which induces a complete ranking of the degrees of preference. Examples of such choice functions are provided.This is a revised version of a discussion paper which was written at the University of Karlsruhe. I am grateful to Georg Bol and an anonymous referee for valuable comments. The research has been made possible by a fellowship of the DFG (Deutsche Forschungsgemeinschaft) which is also gratefully acknowledged.     

Cord-slope form of Taylor's expansion in univariate global optimization

Interval arithmetic and Taylor's formula can be used to bound the slope of the cord of a univariate function at a given point. This leads in turn to bounding the values of the function itself. Computing such bounds for the function, its first and second derviatives, allows the determination of intervals in which this function cannot have a global minimum. Exploiting this information together with a simple branching rule yields an efficient algorithm for global minimization of univariate functions. Computational experience is reported.The first and second authors have been supported by FCAR (Fonds pour la Formation de Chercheurs et l'Aide à la Recherche) Grant 92EQ1048 and AFOSR Grant 90-0008 to Rutgers University. The first author has also been supported by NSERC (Natural Sciences and Engineering Research Council of Canada) Grant to HEC and NSERC Grant GP0105574. The second author has been supported by NSERC Grant GP0036426, FCAR Grant 90NC0305, and a NSF Visiting Professorship for Women in Science at Princeton University. Work of the third author was done in part while he was a graduate student at the Department of Mathematics, Rutgers University, New Brunswick, New Jersey, USA and during a visit to GERAD, June–August 1991.     

Design and optimal tuning of nonlinear PI compensators

In this paper, linear time-invariant single-input single-output (SISO) systems that are stabilizable by linear proportional and integral (PI) compensators are considered. For such systems, a five-parameter nonlinear PI compensator is proposed. The parameters of the proposed compensator are tuned by solving an optimization problem. The optimization problem always has a solution.Additionally, a general nonlinear PI compensator is proposed and is approximated by easy-to-compute compensators, for instance, a six-parameter nonlinear PI compensator. The parameters of the approximate compensators are tuned to satisfy an optimality condition. The superiority of the proposed nonlinear PI compensators over linear PI compensators is discussed and is demonstrated for two feedback systems.     

On the complete solution of ∈y″=y 3

In Ref. 1, the author claimed that the problem y=y ³ is soluble only for a certain range of the parameter . An analytic approach, as adopted in the following contribution, reveals that a unique solution exists for any positive value of . The solution is given in closed form by means of Jacobian elliptic functions, which can be numerically computed very efficiently. In the limit 0+, the solutions exhibit boundary-layer behavior at both endpoints. An easily interpretable approximate solution for small is obtained using a three-variable approach.     

Differential subordinations concerning starlike functions

Denote byS ^* (⌕), (0≤⌕<1), the family consisting of functionsf(z)=z+a ₂z²+...+a_nzⁿ+... that are analytic and starlike of order ⌕, in the unit disc ⋎z⋎<1. In the present article among other things, with very simple conditions on μ, ⌕ andh(z) we prove the f’(z) (f(z)/z)^μ−1<h(z) implies f∈S^*(⌕). Our results in this direction then admit new applications in the study of univalent functions. In many cases these results considerably extend the earlier works of Miller and Mocanu [6] and others.     

Weierstrass型函数图象的分形维数

考虑函数f(x)=sum from i=1 to ∞(?)~(-1)φ((?) θ_n)和w(x)=sum from n=1 to ∞(?)φ_(?)((?)x θ_(?)),式中0<α<(?)是任意实数,在一定条件下,估计了函数f图象的Hausdorff维数的下界,并求得了w函数图象的Box维数和Packing维数。     

Hypersurface with Constant Main Curvature Symmetric Functions

ＨｙｐｅｒｓｕｒｆａｃｅｗｉｔｈＣｏｎｓｔａｎｔＭａｉｎＣｕｒｖａｔｕｒｅＳｙｍｍｅｔｒｉｃＦｕｎｃｔｉｏｎｓ￥ＷｕＢａｏｑｉａｎｇ；ＳｏｎｇＨｏｎｇｚａｏ（ＸｕｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｌｅｇｅ，２２１００９）（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，...     

Bergman空间A~p（ψ）中函数之零点

设Ｄ是Ｃ中的单位圆盘及为［０，１）上的正规函数。对于０＜Ｐ＜∞，这样的函数用于定义一个带权为￣ｐ（｜ｚ｜）／（１－｜ｚ｜￣２）的Ｂｅｒｇｍａｎ空间Ａ￣ｐ．本文刻画了Ａ￣ｐ中函数之零点集的结构．作为应用，又给出了Ａ￣ｐ中函数序列插值的条件。     

模糊集单调型分解定理

模糊集的分解集定理有两种形式，第一种形式与模糊集的λ—截集有关：Ａ＝其中Ａ＿λ是的λ—截集￣［１］．第二种形式与集合套有关：其中Ｈ（λ）为集合套￣［２］或者Ａ＝其中Ｈ（λ）为集合套，Ｑ为（０，１）的可列稠密子集＿［３］，．其实，这两种形式在本文提出的基本模糊集的概念下，可以统一起来成为任何模糊集可以分解为一些（可数或不可数）基本模糊集的和。不仅如此，本文还提出简单模糊集的概念，并证明了任何模糊集都可以表示成为可数个单调上升的简单模糊集的和，或等价地，可以表示成可数个单调上升的简单模糊集的极限，所用的证明方法是构造性的，所以对模糊集的结构也得出了一个清晰的认识．     

A PICARD TYPE THEOREM AND BLOCH LAW

Ａ ＰＩＣＡＲＤ ＴＹＰＥ ＴＨＥＯＲＥＭ ＡＮＤ ＢＬＯＣＨ ＬＡＷ ￥ＹＥＹＡＳＨＥＮＧＡｂｓｔｒａｃｔ：Ａｐｉｃａｒｄｔｙｐｅｔｈｅｏｒｅｍｉｓｐｒｏｖｅｄ，ａｎｄａｃｏｕｎｔｅｒｅｘａｍｐｌｅｉｓｇｉｖｅｎｔｏｓｈｏｗｔｈａｔｔｈｅＢｏｌｃｈ...