This paper explores the effects that collusion can have in newspaper markets where firms compete for advertising as well as for readership. We compare three modes of competition: i) competition in the advertising and the reader market, ii) semi-collusion over advertising (with competition in the reader market), and iii) (full) collusion in both the advertising and the reader market. We find tha...

The algorithm proposed in [Mitsos Optimization 2011] for the global optimization of semi-infinite programs is extended to the global optimization of generalized semi-infinite programs (GSIP). No convexity or concavity assumptions are made. The algorithm employs convergent lower and upper bounds which are based on regular (in general nonconvex) nonlinear programs (NLP) solved by a (black-box) de...

A semi-synchronous circuit is a circuit in which every register is ticked by a clock periodically, but not necessarily simultaneously. A feature of semi-synchronous circuits is that the minimum delay between registers may be critical with respect to the clock period of the circuit. In this paper, we discuss a delay insertion method which makes such a semi-synchronous circuit faster. The maximum...

We present a low-cost shaped beam synthesis method for semi-smart base station antennas. Compared with the conventional array synthesis for smart antenna applications, the proposed circular/conformal array shaped beam synthesis for semi-smart antenna has much lower system complexity and instrumentation implementation cost. This is because only few elements are involved and the circular array fa...

Preventing aspiration in mechanically ventilated patients continues to be a key component in the battle toward reducing the incidence of ventilator-associated pneumonia (VAP). These aspiration events (especially micro-aspirations) are a major VAP risk factor and thus have become a target of the quality-improvement movement.1 VAP bundles have been introduced into intensive care units worldwide, ...

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum‡ow based lower bound for the P=rj=Lmax which dominates the well-known preemptive lower bound. We show that, in some cases the proposed bound strictly dominates the preemptive one while having the same complexity.

In this article, we establish sufficient conditions for the solution sets of parametric generalized quasi-variational relation problems with the stability properties such as the upper semicontinuity, lower semi-continuity, the Hausdorff lower semicontinuity, continuity, Hausdorff continuity, and closedness. Our results improve recent existing ones in the literature. Mathematics Subject Classifi...

Reliable semi-supervised learning, where a small amount of labelled data is complemented by a large body of unlabelled data, has been a long-standing goal of the machine learning community. However, while it seems intuitively obvious that unlabelled data can aid the learning process, in practise its performance has often been disappointing. We investigate this by examining generative maximum li...

In this paper, we study the problem of energyminimization whenmapping streaming applications with throughput constraints to homogeneous multiprocessor systems in which voltage and frequency scaling is supported with a discrete set of operating voltage/frequency modes. We propose a soft real-time semi-partitioned scheduling algorithm which allows an even distribution of the utilization of tasks ...