In this paper, we focus on automated addition of fault-tolerance to an existing fault-intolerant realtime program. We consider three levels of fault-tolerance, failsafe, nonmasking, and masking, based on the properties satisfied in the presence of faults. Furthermore, for failsafe and masking fault-tolerance, we introduce two cases, soft and hard, based on satisfaction of timing constraints in ...

Objective: To compare the advantages and disadvantages of collagenase chemonucleolysis and percutaneous endoscopic discectomy (PED) in the management of extraforaminal lumbar disc herniation. Methods: In this non-randomized controlled clinical trial, a total of 49 patients who were diagnosed with extraforaminal lumbar disc herniation were assigned to undergo either PED (n=22) or collagenase che...

— the undecidability of provability in propositional linear logic (LL), thanks to a reduction from the halting problem in Minsky machines proved by Lincoln, Mitchell, Scedrov, and Shankar [1992], who initiated much of this line of work, — the decidability of the !-Horn fragment of multiplicative exponential linear logic, proved by Kanovich [1995] by reduction to reachability in vector addition ...

This study investigates the effect of sub-phonemic variation in bilabial stop and sibilant fricative consonants on word identification. Recent research suggests that sub-phonemic variation in stop voicing contrasts influences lexical processing. The present study seeks further support for this view by examining listeners’ responses to synthetic speech varying along VOT and fricative place conti...

This note summarizes recent results from computational geometry which determine complexity of computing Minkowski sum of k convex polytopes in R, which are represented either in terms of facets or in terms of vertices. In particular, it is pointed out for which cases there exists an algorithm which runs in polynomial time. The note is based on papers of Gritzmann and Sturmfels [6] and Komei Fuk...

Within this paper we study the Minkowski sum of prisms (" Cephoids ") in a finite dimensional vector space. For a vector a ∈ R n with positive components we write ¯ a = (1 ¯ a 1 1 ¯ an) and denote by = ¯ a = {x ∈ R n || ¯ a, x 1 , x 0} the associated prism. We provide a representation of a finite sum of prisms in terms of inequalities.

Let SH denote the homothety class generated by a convex set S ⊂ R: SH = {a + λS | a ∈ R, λ > 0}. We determine conditions for the Minkowski sum BH + CH or the Minkowski difference BH ∼ CH of homothety classes BH and CH generated by closed convex sets B,C ⊂ R to lie in a homothety class generated by a closed convex set (more generally, in the union of countably many homothety classes generated by...