28156050
An Introduction to Hyperarithmetical Functions
40861592
Definability and Decision Problems in Arithmetic
In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems. In Section 1, we show that addition of positive integers can be defined arithmetically in terms of multiplication and the unary operation of successor S (where Sa = a + 1). Also, it is shown that both addition and multiplication can be defined arithmetically in terms of successor and the relation of divisibility | (where x|y means x divides y ).
2266734
Procedures for Integrating Knowledge in a Speech Understanding System
T h i s paper d e s c r i b e s t h e p r o c e d u r e s f o r i n t e g r a t i n g knowledge f rom d i f f e r e n t s o u r c e s i n t h e SRI speech u n d e r s t a n d i n g s y s t e m . A language d e f i n i t i o n sys tem c o o r d i n a t e s — a t t h e ph rase l e v e l — i n f o r m a t i o n f rom s y n t a x , s e m a n t i c s and d i s c o u r s e i n t h e cou rse o f t h e i n t e r p r e t a t i o n o f a n u t t e r a n c e . The sys tem e x e c u t i v e uses t h e s e c o n t e x t u a l c o n s t r a i n t s i n a s s i g n i n g p r i o r i t i e s t o a l t e r n a t i v e i n t e r p r e t a t i o n s , c o m b i n i n g t o p d o w n , b o t t o m u p , and b i d i r e c t i o n a l s t r a t e g i e s a s r e q u i r e d E x p e r i m e n t a l r e s u l t s t h a t d e m o n s t r a t e t h e e f f e c t i v e n e s s o f c o n t e x t c h e c k i n g a r e d i s c u s s e d .
10379830
Extended Query Answering Using Integrity Rules
The conventional use of databases is commonly restricted to the retrieval of factual data in the form of tuples or records. However most databases also contain metadata in the form of integrity rules which can provide a rich source of additional information not normally available to the user. Integrity rules define what data values and relationships may exist within the database and so their interrogation can provide answers as to whether a certain database state is possible. Our paper describes how this may be achieved and specifies a formal approach to implementing such an enquiry system.
6721869
A Performance Study of Deployment Factors in Wireless Mesh Networks
We present a measurement-parameterized performance study of deployment factors in wireless mesh networks using three performance metrics: client coverage area, backhaul tier connectivity, and fair mesh capacity. For each metric, we identify and study topology factors and architectural features which strongly influence mesh performance via an extensive set of Monte Carlo simulations capturing realistic physical layer behavior. Our findings include: (i) A random topology is unsuitable for a large-scale mesh deployment due to doubled node density requirements, yet a moderate level of perturbations from ideal grid placement has a minor impact on performance. (ii) Multiple backhaul radios per mesh node is a cost-effective deployment strategy as it leads to mesh deployments costing 50% less than with a single-radio architecture, (iii) Dividing access and backhaul connections onto two separate radios does not use the second radio efficiently as it only improves fair mesh capacity 40% to 80% for most users. This is in contrast to using the second radio to move half the user population to a new network operated on the second radio. This work adds to the understanding of mesh deployment factors and their general impact on performance, providing further insight into practical mesh deployments.
15093463
Arithmetic for Parallel Linear Recursive Query Evaluation in Deductive Databases
An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential for parallel processing. It has advantages over other approaches using state-of-the-art parallel processing technology to improve processing speed. In the arithmetic approach, we identify two kind of parallelism, namely bridge node parallelism and formula parallelism. In this paper, the arithmetic foundations and algorithm to exploit formula parallelism were given. The algorithm is fully parallel.
52849083
Data extraction from Web data sources
An explanation is given of the basic data structures used in a new page analysis technique to create wrappers (data extractors) for the result pages produced by Web sites in response to user qeries via Web page forms. The key structure called a tpGrid is a representation of the web page, which is easier to analyse than the raw HTML code. The analysis looks for repetition patterns of sets of tagSets, which are defined in the paper.