Three methods for computing the upper bound when linear cuts are performed on the uncertainty set are described. One of them is based on the computation of spherical , one involves the construction of an implicit system to implement the linear constraints, and the other reformulates the problem into a higher dimensional one such that the standard upper bound computation can be used. The quality...

This paper studies the performance of latency insensitive systems with limited queue size, in contrast with previous studies that assumed unlimited queue size. We obtain a tight theoretical performance upper bound of such systems. This paper also proposes an efficient implementation of latency insensitive systems. Experimental results show that our implementation can always reach the theoretica...

The goal of this thesis is to upper bound the expected value of the second largest eigenvalue in magnitude of random regular graphs with a given minimum girth. Having a small upper bound implies such random graphs are likely to be expanders and thus have several combinatorial properties useful in various fields of computer science. The best possible upper bound asymptotically on the second eige...

In this paper we rederive an old upper bound on the number of halving edges present in the halving graph of an arbitrary set of n points in 2-dimensions which are placed in general position. We provide a different analysis of an identity discovered by Andrejak et al, to rederive this upper bound of O(n). In the original paper of Andrejak et al. the proof is based on a naive analysis whereas in ...

We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...

• Some bounding techniques are investigated in this section in order to serve as a tool for the analysis that follows. We first state the union upper bound that is widely used in the literature. • Then, some better bounds which are applicable to AWGN channels are also discussed here; they are Gallager bound and sphere upper bound.

To reduce complexity while computing an upper bound on the worst-case execution time, static WCET analysis performs over-approximations. This feeds the general feeling that static WCET estimations can be far above the real WCET. This feeling is strengthened when these estimations are compared to measured execution times: generally, it is very unlikely to capture the worstcase from observations,...