The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
Xiaolan Zhang, Larry Koved, Marco Pistoia, Sam Web...
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
Sensors in ubiquitous computing provide a new opportunity to extend existing RFID capabilities to situation-awareness. This paper proposes several alternatives of the Situation-Aw...
Traditionally, the development of computing systems has been focused on performance improvements driven by the demand of applications from consumer, scientific, and business domai...
Anton Beloglazov, Rajkumar Buyya, Young Choon Lee,...