Two important metrics for measuring the quality of routing paths are the maximum edge con-gestion C and maximum path length D. Here, we study bicriteria in routing games where eachplayer i selfishly selects a path that simultaneously minimizes its maximum edge congestion Ciand path length Di. We study the stability and price of anarchy of two bicriteria games:• Max games, where ...

Two important metrics for measuring the quality of routing paths are the maximum edge con-gestion C and maximum path length D. Here, we study bicriteria in routing games where eachplayer i selfishly selects a path that simultaneously minimizes its maximum edge congestion Ciand path length Di. We study the stability and price of anarchy of two bicriteria games:• Max games, where ...

The effects of glucagon deficiency and excess on plasma concentrations of 21 amino acids were studied in six normal human subjects for 8 h. During glucagon deficiency, produced by intravenous infusion of somatostatin (0.5 mg/h) and insulin (5 mU/kg per h), amino acid concentration (sum of 21 amino acids) rose from 2,607 +/- 76 to 2,922 +/- 133 microM after 4 h (P less than 0.025). The largest i...

Using a model for two pion photoproduction on the proton previously tested in total cross sections and invariant mass distributions, we evaluate here polarization observables on which recent experiments are providing new information. We evaluate cross sections for spin 1/2 and 3/2, which are measured at Mainz and play an important role in tests of the GHD sum rule. We also evaluate the proton p...

Let U(R, S) denote the class of all m x n matrices of O's and l's having row sum vector R and column sum vector S. The interchange graph G (R, S) is the graph where the vertices are the matrices in U (R, S) and two vertices are adjacent provided they differ by an interchange. Two tight upper-bounds of the maximum degree l:l.(G(R, S)) are given. Furthermore, those extreme graphs whose maximum de...

While tree contraction algorithms play an important role in efficient tree computation in parallel, it is difficult to develop such algorithms due to the strict conditions imposed on contracting operators. In this paper, we propose a systematic method of deriving efficient tree contraction algorithms from recursive functions on trees. We identify a general recursive form that can be parallelize...

We present a fully-polynomial scheme to approximate the number of independent sets in graphs with maximum degree four. In general, for graphs with maximum degree 4, the scheme approximates a weighted sum of independent sets. The weight of each independent set is expressed in terms of a positive parameter 1 3 , where the weight of independent set S is jSj. We also prove complementary hardness of...

When a square matrix A, is diagonalizable, (for example, when A is Hermitian or has distinct eigenvalues), then An can be written as a sum of the nth powers of its eigenvalues with matrix weights. However, if a 1 occurs in its Jordan form, then the form is more complicated: An can be written as a sum of polynomials of degree n in its eigenvalues with coefficients depending on n. In this case to...

We establish the bounds 43 6 bν 6 bξ 6 √ 2, where bν and bξ are the NordhausGaddum sum upper bound multipliers, i.e., ν(G)+ν(G) 6 bν |G| and ξ(G)+ξ(G) 6 bξ|G| for all graphs G, and ν and ξ are Colin de Verdière type graph parameters. The Nordhaus-Gaddum sum lower bound for ν and ξ is conjectured to be |G| − 2, and if these parameters are replaced by the maximum nullity M(G), this bound is calle...

Objective: To assess whether there is a difference in treatment outcomes for patients with or without intrinsic sphincter deficiency after tension-free vaginal tape insertion for stress urinary incontinence in a Chinese population. Methods: This retrospective study of Chinese women undergoing tension-free vaginal tape insertion for confirmed urodynamic stress urinary incontinence was carried ou...