This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification base...
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Recently, a number of main memory algorithms for detecting the changes to XML data have been proposed. These approaches are not suitable for detecting changes to large XML documen...
— In this article, the authors examine the problem of designing nominal manipulator Jacobians that are optimally fault tolerant to one or more joint failures. In this work, optim...
Rodney G. Roberts, Hyun Geun Yu, Anthony A. Maciej...
Currently statistical and artificial neural network methods dominate in financial data mining. Alternative relational (symbolic) data mining methods have shown their effectiveness...