When designing a preemptive online algorithm for the maximum matching problem, we wish to maintain a valid matching M while edges of the underlying graph are presented one after the other. When presented with an edge e, the algorithm should decide whether to augment the matching M by adding e (in which case e may be removed later on) or to keep M in its current form without adding e (in which c...

The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP. Firstly, we introduce an Upper Bound Propagation procedure to pre-compute an upper bound involving each vertex. Then we extend an existing branch-and-bound algorit...

This paper presents a systematic theoretical approach for the analysis of bounds on power consumption in digital multipliers. This is because in many applications the maximum value of power consumption and not just the average power may be of importance to the designer. The maximum values can be used to predict the maximum battery life in portable applications and also determine the nature of h...

We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees in the d-dimensional Banach spaces ldp independent of d. This is in contrast to Minimal Spanning Trees, where the maximum degree of vertices grows exponentially in d (Robins and Salowe, 1995). Our upper bounds follow from characterizations of singularities of SMT’s due to Lawlor and Morgan (1994), which...

a r t i c l e i n f o a b s t r a c t Given a real number sequence A = (a 1 , a 2 ,. .. ,a n), an average lower bound L, and an average upper bound U , the Average-Constrained Maximum-Sum Segment problem is to locate a segment A(i, j) = (a i , a i+1 ,. .. ,a j) that maximizes ik j a k subject to L (ik j a k)/(j − i + 1) U. In this paper, we give an O (n)-time algorithm for the case where the av...

The problem studied in this paper is that of nding the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. The main results are a lower bound and an upper bound, both given by closedform formulas, for the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. c © 2000 Elsevier Science B.V. All rights reserved.

In supersymmetric models the lightest Higgs boson may decay with a sizable branching ratio into a pair of light neutralinos. We analyze such decays within the context of the minimal supersymmetric standard model with R-parity violation, where the neutralino itself is unstable and decays into Standard Model fermions. We show that the R-parity violating couplings induce novel Higgs decay signals ...

In this paper we describe an efficient approach to upper bound limit analysis of cohesivefrictional continua, using a finite element discretization in conjunction with second-order cone programming (SOCP). We also introduce the use of linear strain elements, focusing here on 6-node triangles in plane strain, though a directly analogous extension to 10-node tetrahedra in 3D is straightforward. I...

3.1 Maximum likelihood estimates — in exponential families. Let (X, B) be a measurable space and {P θ , θ ∈ Θ} a measurable family of laws on (X, B), dominated by a σ-finite measure v. Let f (θ, x) be a jointly measurable version of the density (dP θ /dv)(x) by Theorem 1.3.3. For each x ∈ X, a maximum likelihood estimate (MLE) of θ is any θ ˆ = θ ˆ (x) such that f (ˆ θ, x) = sup{f (φ, x) : φ ∈ ...

We derive here improved upper bounds on the error probability of block codes which are transmitted over fully interleaved Rician fading channels, coherently detected and maximum likelihood decoded. We assume that the fading coefficients during each symbol are statistically independent (due to a perfect channel interleaver), and that perfect estimates of these fading coefficients are provided to...