Purpose This study is an integrated efficacy analysis of the five clinical trials of tositumomab and iodine-131 tositumomab in patients with relapsed or refractory low-grade, follicular, or transformed low-grade non-Hodgkin’s lymphoma (NHL) that resulted in the regulatory approval of the iodine-131 tositumomab by the US Food and Drug Administration. Patients and Methods This integrated analysis included 250 patients. Patients received a single course of iodine-131 tositumomab. Responses were assessed by an independent panel of radiologists and oncologists. Results Response rates in the five trials ranged from 47% to 68%; complete response rates ranged from 20% to 38%. With a median follow-up of 5.3 years, the 5-year progression-free survival was 17%. Eighty-one (32%) of 250 patients had a time to progression of ≥ 1 year (termed durable response population). For the durable response population, 44% had not progressed at ≥ 2.5 to ≥ 9.5 years and had a median duration of response of 45.8 months. The median duration of complete response was not reached. The durable response population had many poor prognostic characteristics, including bone marrow involvement (41%), bulky disease ≥ 5 cm (49%), and transformed histology (23%). Forty-three percent of the patients had been treated with more than four prior therapies and 36% had not responded to their most recent therapy. Conclusion The tositumomab and iodine-131 tositumomab therapeutic regimen produces high response rates in patients with relapsed or refractory low-grade, follicular, and transformed low-grade NHL, with a sizable subgroup of patients achieving long-term durable responses.
12 August 2017 in ACM Transactions on Database Systems
Answering aggregate queries is a key requirement of emerging applications of Semantic Technologies, such as data warehousing, business intelligence, and sensor networks. To fulfil the requirements of such applications, the standardization of SPARQL 1.1 led to the introduction of a wide range of constructs that enable value computation, aggregation, and query nesting. In this article, we provide an in-depth formal analysis of the semantics and expressive power of these new constructs as defined in the SPARQL 1.1 specification, and hence lay the necessary foundations for the development of robust, scalable, and extensible query engines supporting complex numerical and analytics tasks.
11 November 2015 in Journal of Artificial Intelligence Research
Answering conjunctive queries over ontology-enriched datasets is a core reasoning task for many applications. Query answering is, however, computationally very expensive, which has led to the development of query answering procedures that sacrifice either expressive power of the ontology language, or the completeness of query answers in order to improve scalability. In this paper, we describe a hybrid approach to query answering over OWL 2 ontologies that combines a datalog reasoner with a fully-fledged OWL 2 reasoner in order to provide scalable `pay-as-you-go' performance. The key feature of our approach is that it delegates the bulk of the computation to the datalog reasoner and resorts to expensive OWL 2 reasoning only as necessary to fully answer the query. Furthermore, although our main goal is to efficiently answer queries over OWL 2 ontologies and data, our technical results are very general and our approach is applicable to first-order knowledge representation languages that can be captured by rules allowing for existential quantification and disjunction in the head; our only assumption is the availability of a datalog reasoner and a fully-fledged reasoner for the language of interest, both of which are used as `black boxes'. We have implemented our techniques in the PAGOdA system, which combines the datalog reasoner RDFox and the OWL 2 reasoner HermiT. Our extensive evaluation shows that PAGOdA succeeds in providing scalable pay-as-you-go query answering for a wide range of OWL 2 ontologies, datasets and queries.
We study stream reasoning in datalogMTL—an extension of Datalog with metric temporal operators. We propose a sound and complete stream reasoning algorithm that is applicable to a fragment datalogMTLFP of datalogMTL, in which propagation of derived information towards past time points is precluded. Memory consumption in our algorithm depends both on the properties of the rule set and the input data stream; in particular, it depends on the distances between timestamps occurring in data. This is undesirable since these distances can be very small, in which case the algorithm may require large amounts of memory. To address this issue, we propose a second algorithm, where the size of the required memory becomes independent on the timestamps in the data at the expense of disallowing punctual intervals in the rule set. Finally, we provide tight bounds to the data complexity of standard query answering in datalogMTLFP without punctual intervals in rules, which yield a new PSPACE lower bound to the data complexity of the full datalogMTL.