The luminosity upgrade of the large hadron collider (SLHC) at CERN will require the innermost layers of the vertex detectors to achieve excellent performances up to fluences of about 10 hadrons cm . New solid state detectors are currently being developed by the CERN RD50 collaboration. In this paper recent results on magnetic Czochralski, epitaxial, and oxygen-enriched silicon will be presented...

The dependency pair approach [2, 12, 13] is one of the most powerful techniques for termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequality constraints that have to be satisfied by weakly monotonic well-founded orders. We improve the dependency pair approach by considerably reducing the number of constraints produced for (innermost) term...

Spatially resolving the innermost region of the putative torus-like structure in an active galactic nucleus (AGN) is one of the main goals of its high-spatial-resolution studies. This could be done in the near-IR observations of Type 1 AGNs where we see directly the hottest dust grains in the torus. We discuss two critical issues in such studies. One is the possible contribution from the centra...

Though being one of the representative works in the second phase of Pinter’s writing in the 1970s, No Man's Land is more an extension of than a departure from his early comedies of menace. To a certain degree, the central motif of the play is still a variation on the theme of territory fight explored in such plays as The Caretaker. What makes his play unique is that the major conflict is no lon...

While there are many approaches for automatically proving termination of term rewrite systems, up to now there exist only few techniques to disprove their termination automatically. Almost all of these techniques try to find loops, where the existence of a loop implies non-termination of the rewrite system. However, most programming languages use specific evaluation strategies, whereas loop det...

Given a constructor term rewriting system that defines injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a conditional term rewriting system that defines the inverse relations of the injective functions, and then the compiler unravels the conditional system into an unconditional term rewriting system. In general, the resulting unconditional system is no...

This article treats register constraints in high performance embedded VLIW computing, aiming to decouple register constraints from instruction scheduling. It extends the register saturation (RS) concept to periodic instruction schedules, i.e., software pipelining (SWP). We formally study an approach which consists in computing the exact upper-bound of the register need for all the valid SWP sch...

While there are many approaches for automatically proving termination of term rewrite systems, up to now there exist only few techniques to disprove their termination automatically. Almost all of these techniques try to find loops, where the existence of a loop implies non-termination of the rewrite system. However, most programming languages use specific evaluation strategies, whereas loop det...