Answering conjunctive queries (CQs) over a set of facts extended with existential rules is a prominent problem in knowledge representation and databases. This problem can be solved using the chase algorithm, which extends the given set of facts with fresh facts in order to satisfy the rules. If the chase terminates, then CQs can be evaluated directly in the resulting set of facts. The chase, ho...

Primary cultures of estrogen-induced chick parenchymal liver cells have been used to study the assembly of the apolipoprotein and glycerolipid constituents of hepatic very low density lipoprotein (VLDL). Liver cell monolayers in serum-free medium were pulse-labeled for 2.5 min with either [3H]leucine or [3H]glycerol and were then chased for 4 h. The kinetics of secretion of VLDL 3H-apolipoprote...

There is increasing interest in the use of administrative data in health services and clinical research. Administrative data are routinely collected during clinic, hospital, laboratory, or pharmacy visits for administrative purposes.1 Administrative databases provide easy and cheap access to large numbers of patients over expansive geographic regions. Although these databases were initially des...

Ever since Hershey and Chase used phages to establish DNA as the carrier of genetic information in 1952, the precise mechanisms of phage DNA translocation have been a mystery. Although bulk measurements have set a timescale for in vivo DNA translocation during bacteriophage infection, measurements of DNA ejection by single bacteriophages have only been made in vitro. Here, we present direct vis...

Tupleand equality-generating dependencies have a wide range of applications in knowledge representation and databases, including ontological reasoning, data exchange, and data cleaning. In such settings, the chase is a central tool for many reasoning tasks. Since the chase evaluation might not terminate and it is undecidable whether it terminates, several termination criteria have been proposed...

Caches only exploit spatial and temporal locality in a set of address referenced in a program. Due to dynamic construction of linked data-structures, they are difficult to cache as the spatial locality between the nodes is highly dependent on the data layout. Prefetching can play an important role in improving the performance of linked data-structures. In this project, a pointer chase mechanism...

Authors Eric Witt, Emergency Department, Chase Farm Hospital, Enfield Claire Goodman, Centre for Research in Primary and Community Care, University of Hertfordshire, Hertfordshire, UK Ashis Banerjee, Emergency Department, Chase Farm Hospital, Enfield Tricia Scott, Centre for Research in Primary and Community Care, University of Hertfordshire, Hertfordshire, UK Sarah Amador, Centre for Research ...