This paper presents an optimization-based method for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain braced frame. We assume that the parameters both of brace stiffnesses and external forces are uncertain but bounded, which is a non-stochastic model of uncertainty. A brace member represents the sum of the stiffness of the actual brace and the con...

in this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by jannati and falahati (so-called jf). we prove that an adversary can recover key bits of jf protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. in addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...

Bounding chains are a technique that offers three benefits to Markov chain practitioners: a theoretical bound on the mixing time of the chain under restricted conditions, experimental bounds on the mixing time of the chain that are provably accurate and construction of perfect sampling algorithms when used in conjunction with protocols such as coupling from the past. Perfect sampling algorithms...

This paper presents an optimization-based method for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain braced frame. Based on a non-stochastic modeling of uncertainty, we assume that the parameters both of brace stiffnesses and external forces are uncertain but bounded. A brace member represents the sum of the stiffness of the actual brace and the ...