Results 1  10
of
222,707
More Monotonicity Theorems for Partitions
, 1994
"... this paper we consider k = 1. We seek a stronger conclusion, namely that a n+1 a n for all ..."
Abstract
 Add to MetaCart
this paper we consider k = 1. We seek a stronger conclusion, namely that a n+1 a n for all
A Monotonicity Theorem for Tandem Queues
, 1992
"... Tandem queues are often used for performance modeling in production lines, computer systems and communication networks. Consider a series of tandem firstcomefirstserved queues with single servers. The buffers may be finite or infinite. When a finite buffer is full, the upstream server may suffer ..."
Abstract
 Add to MetaCart
Tandem queues are often used for performance modeling in production lines, computer systems and communication networks. Consider a series of tandem firstcomefirstserved queues with single servers. The buffers may be finite or infinite. When a finite buffer is full, the upstream server may suffer from transfer blocking or service blocking. A job's service requirements at various servers may be correlated. A transient analysis shows that, if the network is open, then response time decreases if a server is speeded up, or a finite buffer increases in size, or service blocking is changed to transfer blocking at some server; if the network is closed, then such changes increase the throughput. The analytic technique is elementary, and the equations can be used to simulate a network. 1 Introduction Queueing networks with finite buffers have been used to model manufacturing systems, computer systems and communication systems [A, AS, BI, BS, DY, KR, P, R, SD]. These networks are difficult to...
MONOTONICITY THEOREMS FOR LAPLACE BELTRAMI OPERATOR ON RIEMANNIAN MANIFOLDS
, 812
"... Abstract. For free boundary problems on Euclidean spaces, the monotonicity formulas of AltCaffarelliFriedman and CaffarelliJerisonKenig are cornerstones for the regularity theory as well as the existence theory. In this article we establish the analogs of these results for the LaplaceBeltrami o ..."
Abstract
 Add to MetaCart
Beltrami operator on Riemannian manifolds. As an application we show that our monotonicity theorems can be employed to prove the Lipschitz continuity for the solutions of a general class of twophase free boundary problems on Riemannian manifolds. 1.
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2837 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
A NOTE ON MILNOR AND THURSTON’S MONOTONICITY THEOREM
"... The aim of this note is to give a simplified proof of the socalled Milnor and Thurston’s monotonicity theorem. We begin with stating the theorem. Let us consider a family of maps $Q_{a}(x)=ax^{2} $ from $\mathbb{R} $ to itself. The kneading sequence for $Q_{a} $ is an infinite sequence $K(a)=(e_{1 ..."
Abstract
 Add to MetaCart
The aim of this note is to give a simplified proof of the socalled Milnor and Thurston’s monotonicity theorem. We begin with stating the theorem. Let us consider a family of maps $Q_{a}(x)=ax^{2} $ from $\mathbb{R} $ to itself. The kneading sequence for $Q_{a} $ is an infinite sequence $K
A Monotonicity Theorem for Extended Logic Programs
 Proc. of 10th International Conference on Logic Programming
, 1993
"... Because general and extended logic programs behave nonmonotonically, it is in general difficult to predict how even minor changes to such programs will affect their meanings. This paper shows that for a restricted class of extended logic programs  those with signings  it is possible to state a ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
a fairly general theorem comparing the entailments of programs. To this end, we generalize (to the class of extended logic programs) the definition of a signing, first formulated by Kunen for general programs, and establish a theorem characterizing a restricted monotonicity property for signed
Good News and Bad News: Representation Theorems and Applications
 Bell Journal of Economics
"... prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtai ..."
Abstract

Cited by 684 (3 self)
 Add to MetaCart
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a monotone XLCP, and an error bound result for a nondegenerate XLCP. We also present a finite, sequential linear programming algorithm for solving the nonmonotone XLCP.
Results 1  10
of
222,707