Using recent measurements of angular size of high-z milliarcsecond compact radio sources compiled by Gurvits, Kellermann & Frey (1999) and X-ray gas mass fraction of galaxy clusters published by Allen et al. (2002,2003), we explore their bounds on the equation of state, ωx ≡ px/ρx, of the dark energy, whose existence has been congruously suggested by various cosmological observations. We relaxe...

It is already known that a trellis code , which is constructed by using the encoder of a convolutional code with short constraint length followed by a delay processor and a signal mapper, is equivalent to a trellis code with large constraint length. In this paper, we derive a new lower bound on the free distance of , which, in some cases, is better than the previously derived bound. Moreover, i...

A constraint satisfaction problem may not admit a complete solution; in this case a good partial solution may be acceptable. This paper presents new techniques for organizing search with branch and bound algorithms so that maximal partial solutions (those having the maximum possible number of satisfied constraints) can be obtained in reasonable time for moderately sized problems. The key featur...

In this paper, I present a recursive algorithm that calculates the number of rankings that are consistent with a set of data (i.e. optimal candidates) in the framework of Optimality Theory. The ability to compute this quantity, which I call the r-volume, makes possible a simple and effective Bayesian heuristic in learning – all else equal, choose the candidate preferred by the highest number of...

We establish constraints on the mass and abundance of black holes in the Galactic halo by determining their impact on globular clusters which are conventionally considered to be little evolved. Using detailed Monte Carlo simulations, and simple evolutionary models, we argue that black holes with masses Mbh ∼ > (1 − 3)× 10 M⊙ can comprise no more than a fraction fbh ≈ 0.17 of the total halo dens...

Using a nonlinear structural VAR approach, we estimate the effects of exogenous monetary impulses in the presence of a zero lower bound constraint on nominal interest rates and examine the impact of such a constraint on the effectiveness of counter-cyclical monetary policies. We find that a binding zero bound on nominal interest rates can eliminate more than 50% of the effect of an exogenous mo...

This paper designs a model predictive control (MPC) law for constrained linear systems with stochastic additive disturbances and noisy measurements, minimising discounted cost subject to expectation constraint. It is assumed that sensor data lost known probability. Taking into account the losses modelled by Bernoulli process, we parameterise predicted policy as an affine function of future obse...

We present an upper bound on the probability of error of a signaling scheme that achieves the capacity of the multipath fading channel under an average power constraint in the limit of infinite bandwidth. The bound is derived under the assumption of Rayleigh block fading. We are therefore able to determine the performance of the scheme when a given finite bandwidth is available. We evaluate the...

In this paper we study the two-machine owshop scheduling problem with an availability constraint on the rst machine. We rst show that the worst-case error bound 2 of the heuristic provided by Lee [4] is tight. We then develop an improved heuristic with a worst-case error bound of 3 . c © 2000 Elsevier Science B.V. All rights reserved.

We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling instances. The proposed algorithm combines elements of classical branch and bound schemes from global optimization with a recently published procedure to bound the ...