This paper presents a semidefinite relaxation technique for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain truss. We assume that both member stiffnesses and external forces are uncertain but bounded. By using a combination of the quadratic embedding technique of the uncertainty and the Sprocedure, we formulate a semidefinite programming (SDP) pr...

Communication networks supporting real-time tasks need to guarantee timely delivery of critical data and commands. Worst-case delay performance of these networks can be analyzed using deterministic network calculus. In this report, we identify the discrepancy between existing bit-oriented delay bounding methods and packet-oriented behaviors of network devices. An optimization-based bit-oriented...

the present paper is devoted to a new critical state based plasticity model able to predict drained and undrained behaviour of granular material. it incorporates a bounding surface plasticity model describing in multilaminate framework to capitalize on advantages of this mathematical framework. most of the models developed using stress/strain invariants are not capable of identifying the parame...

Bounding volumes are used to optimize many graphic algorithms. They permit to decide quickly if a more exact test is likely to succeed or not. The exact test is only applied if the bounding volume test succeeds, which saves time in most cases. Two of the most prominent applications are ray tracing and collision detection. This paper presents a new method to calculate tight bounding volumes for ...

In this paper, it is shown that nearly completely decomposable (NCD) Markov chains are quasi{lumpable. The state space partition is the natural one, and the technique may be used to compute lower and upper bounds on the stationary probability of each NCD block. In doing so, a lower bounding nonnegative coupling matrix is employed. The nature of the stationary probability bounds is closely relat...