Group decisions I. In arbitrary spaces of fuzzy binary relations

This article solves the problem of finding a set of group decisions that satisfy the classical Pareto unanimity principle for the case of initial data represented as fuzzy relations of individual preference. The solution proceeds from results obtained in studying the structure of convex (in the sense defined here) sets and their convex hulls. In the first part that study is carried out for spaces of arbitrary fuzzy binary relations.     

The convex hull of two core capacitated network design problems

The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs at a specified arc dependent cost. The problem is to determine the number of facilities to be loaded on the arcs that will satisfy the given demand at minimum cost.This paper studies two core subproblems of the NLP. The first problem, motivated by a Lagrangian relaxation approach for solving the problem, considers a multiple commodity, single arc capacitated network design problem. The second problem is a three node network; this specialized network arises in larger networks if we aggregate nodes. In both cases, we develop families of facets and completely characterize the convex hull of feasible solutions to the integer programming formulation of the problems. These results in turn strengthen the formulation of the NLP.Research of this author was supported in part by a Faculty Grant from the Katz Graduate School of Business, University of Pittsburgh.     

Cartographic line simplification and polygon CSG formulæ in O(n log n) time

A constructive solid geometry (CSG) conversion for a polygon takes a list of vertices and produces a formula representing the polygon as an intersection and union of primitive halfspaces. The cartographers' favorite line simplification algorithm recursively selects from a list of data points those to be used to represent a linear feature, such as a coastline, on a map. By using a data structure that maintains convex hulls of polygonal lines under splits, both were known to have O(n log n) time solutions in the worst-case. This paper shows that both are easier than sorting by presenting an O(n log^* n) algorithm for maintaining convex hulls under splits at extreme points. It opens the question of whether there are practical, linear-time solutions to these problems.     

Designing and scaling up an innovation in abstract algebra

In this paper, we describe the process of designing and scaling up the TAAFU group theory curriculum. This work unfolded in three overlapping stages of research and design. The initial designs emerged along with local instructional theories as the result of small-scale design experiments conducted with pairs of students. A second stage of the research and design process focused on generalizing from the initial laboratory design context to an authentic classroom setting. The third (ongoing) stage involves generalizing to instructors (mathematicians) who were not involved in the design process. We describe each of these stages, and our efforts to investigate the efficacy of the resulting curriculum, in order to provide an illustrative example of the process of scaling up an innovation.     

Categorical Properties of Probabilistic Convergence Spaces

The purpose of this paper is to discuss some categorical properties of probabilistic convergence spaces. Its main theses are: (1) the construct P-PrTop of probabilistic pretopological spaces is the extensional topological hull of the construct FTPcs of FT-diagonal probabilistic convergence spaces for every triangular norm T; (2) the construct P-PsTop of probabilistic pseudotopological spaces is the topological universe hull of FTPcs for every triangular norm T.     

An interdependency index for the outputs of uncertain systems

The study of mechanical systems with uncertain parameters is gaining increasing interest in the field of system analysis to provide an expedient model for the prediction of the system behavior. Making use of the Transformation Method, the uncertain parameters of the system are modeled by fuzzy numbers in contrast to random numbers used in stochastic approaches. As a result of this analysis, a quantification of the overall uncertainty of the system outputs, including a worst-case scenario, is obtained. The inputs of the resulting fuzzy-valued model are a priori uncorrelated but after the uncertainties are propagated through the model, interdependency (or interaction) between the outputs may arise. If such interdependency is neglected, a misinterpretation of the results may occur. For example, in the case of applying uncertainty analysis in the early design phase of a product to determine the relevant design-parameter space, the interdependency between the design variables may reduce significantly the available part of the design space. This paper proposes a measure of interdependency between the uncertain system outputs. The interdependency index can be derived by a postprocessing of the data gained by the analysis with the Transformation Method. Such information can be obtained by a negligible amount of extra computation time.     

生产可能集为凸包时的相对有效性评价模型

给出了一个评价决策单元相对有效性的新的DEA模型,它所对应的生产可能集被称为凸包形生产可能集,同时讨论了该模型解的存在性,定义了决策单元技术DEA有效和"上投影"的概念,断定一个决策单元的"上投影"相对于原来的决策单元是技术DEA有效的。最后给出一个应用新模型进行设施农业效率评价的例子。     

Improve-and-Branch Algorithm for the Global Optimization of Nonconvex NLP Problems

A new algorithm to solve nonconvex NLP problems is presented. It is based on the solution of two problems. The reformulated problem RP is a suitable reformulation of the original problem and involves convex terms and concave univariate terms. The main problem MP is a nonconvex NLP that outer-approximates the feasible region and underestimate the objective function. MP involves convex terms and terms which are the products of concave univariate functions and new variables. Fixing the variables in the concave terms, a convex NLP that overestimates the feasible region and underestimates the objective function is obtained from the MP. Like most of the deterministic global optimization algorithms, bounds on all the variables in the nonconvex terms must be provided. MP forces the objective value to improve and minimizes the difference of upper and lower bound of all the variables either to zero or to a positive value. In the first case, a feasible solution of the original problem is reached and the objective function is improved. In general terms, the second case corresponds to an infeasible solution of the original problem due to the existence of gaps in some variables. A branching procedure is performed in order to either prove that there is no better solution or reduce the domain, eliminating the local solution of MP that was found. The MP solution indicates a key point to do the branching. A bound reduction technique is implemented to accelerate the convergence speed. Computational results demonstrate that the algorithm compares very favorably to other approaches when applied to test problems and process design problems. It is typically faster and it produces very accurate results.     

Relative hyperbolicity and similar properties of one-generator one-relator relative presentations with powered unimodular relator

A group obtained from a nontrivial group by adding one generator and one relator which is a proper power of a word in which the exponent sum of the additional generator is one contains the free square of the initial group and almost always (with one obvious exception) contains a non-abelian free subgroup. If the initial group is involution-free or the relator is at least third power, then the obtained group is SQ-universal and relatively hyperbolic with respect to the initial group.     

关于Brandt半群共轭包的结构

在本文中，我们给出了Ｂｒａｎｄｔ半群Ｓ的共轭包Ψ（Ｓ）的刻划，同时也给出Ψ（Ｓ）的全逆子半群Ｔ（Ｓ）的刻划，利用这些结果，我们证明Ｔ（Ｓ）在Ψ（Ｓ）中是自共轭的．     

Method of orienting curves for determining the convex hull of a finite set of points in the plane

In this article, we present an efficient algorithm to determine the convex hull of a finite planar set using the idea of the Method of Orienting Curves (introduced by Phu in Zur Lösung einer regulären Aufgabenklasse der optimalen Steuerung in Großen mittels Orientierungskurven, Optimization, 18 (1987), pp. 65–81, for solving optimal control problems with state constraints). The convex hull is determined by parts of orienting lines and a final line. Two advantages of this algorithm over some variations of Graham's convex hull algorithm are presented.     

某类多叶解析函数的性质

设A(p)(p是指数，p≥1）表示在单位圆盘E内形如f(z)=z^p ap 1z^p 1…的解析函数族。本文引进了新的函数子类Hσ（p,α），找出了Hσ（p,α）闭凸包的极值点并给出精确的系数估计，还讨论了Hσ（p,α）其它一些有趣的性质。     

Some results on the convex hull of finitely many convex sets

A better than quadratic estimate is given for the volume of the convex hull of points on Hadamard manifolds with pinched curvature. It was known previously that the volume is bounded by some polynomial in . The estimate comes from the study of the convex hull of finitely many convex sets on Hadamard manifolds.

     

Some properties of convex hulls generated by homogeneous Poisson point processes in an unbounded convex domain

LetC(A) be the convex hull generated by a Poisson point process in an unbounded convex setA. A representation ofAC(A) as the union of curvilinear triangles with independent areas is established. In the case whenA is a cone the properties of the representation are examined more completely. It is also indicated how to simulateC(A) directly without first simulating the process itself.     

Weyl Groups are Finite — and Other Finiteness Properties of Cartan Subalgebras

For each pair (??,??) consisting of a real Lie algebra ?? and a subalgebra a of some Cartan subalgebra ?? of ?? such that [??, ??]∪ [??, ??] we define a Weyl group W(??, ??) and show that it is finite. In particular, W(??, ??,) is finite for any Cartan subalgebra h. The proof involves the embedding of 0 into the Lie algebra of a complex algebraic linear Lie group to which the structure theory of Lie algebras and algebraic groups is applied. If G is a real connected Lie group with Lie algebra ??, the normalizer N(??, G) acts on the finite set Λ of roots of the complexification ??c with respect to hc, giving a representation π : N(??, G)→ S(Λ) into the symmetric group on the set Λ. We call the kernel of this map the Cartan subgroup C(??) of G with respect to h; the image is isomorphic to W(??, ??), and C(??)= {g G : Ad(g)(h)— h ε [h,h] for all h ε h }. All concepts introduced and discussed reduce in special situations to the familiar ones. The information on the finiteness of the Weyl groups is applied to show that under very general circumstance, for b ∪ ?? the set ??? ?(b) remains finite as ? ranges through the full group of inner automorphisms of ??.     

Geometry and asymptotics of wavefronts

Methods of convex analysis and differential geometry are applied to the study of properties of nonconvex sets in the plane. Constructions of the theory of α-sets are used as a tool for investigation of problems of the control theory and the theory of differential games. The notions of the bisector and of a pseudovertex of a set introduced in the paper, which allow ones to study the geometry of sets and compute their measure of nonconvexity, are of independent interest. These notions are also useful in studies of evolution of sets of attainability of controllable systems and in constructing of wavefronts. In this paper, we develop a numerically-analytical approach to finding pseudovertices of a curve, computation of the measure of nonconvexity of a plane set, and constructing front sets on the basis these data.In the paper, we give the results of numerical constructing of bisectors and wavefronts for plane sets. We demonstrate the relation between nonsmoothness of wavefronts and singularity of the geometry of the initial set. We also single out a class of sets whose bisectors have an asymptote.     

Concave functions,blaschke products,and polygonal mappings

We consider the class Co(p) of all conformal maps of the unit disk onto the exterior of a bounded convex set. We prove that the triangle mappings, i.e., the functions that map the unit disk onto the exterior of a triangle, are among the extreme points of the closed convex hull of Co(p). Moreover, we prove a conjecture on the closed convex hull of Co(p) for all p ∈ (0, 1) which had partially been proved by the authors for some values of p ∈ (0, 1).     

高维空间的一个Heilbronn型问题

本文研究了以下Heilbronn型问题:设S是欧氏空间按R~k 中由有限个点A_1,A_2,…,A_n组成的集合,令d(S)=min{A_iA_j|1≤i相似文献