We seek here to determine the exact quantitative d e p e n d e n c e of per formance of best f i rs t search (i.e., A* a lgo r i t hm) on the amount of error in the heuristic f unc t i on ' s est imates of distance to the goal. Comparative p e r f o r m a n c e measurements for three families of heuristics for the 8 -puzz le suggest general conjectures that may also ho ld fo r more complex best...

The specification language CSP-CASL combines algebraic and process algebraic formalisms for the description of reactive systems with structured data [Rog 03]. We are using this formalism to formally specify and verify a Swiss banking system and its communication protocol. The EP2 banking system describes the actors involved in an electronic payment and the interfaces between them [EP2]. The so-...

CIITA and MHC class II expression is silenced during the differentiation of B cells to plasma cells. When B cell differentiation is carried out ex vivo, CIITA silencing occurs rapidly, but the factors contributing to this event are not known. ZBTB32, also known as repressor of GATA3, was identified as an early repressor of CIITA in an ex vivo plasma cell differentiation model. ZBTB32 activity o...

An E>pe ri ment to Dete ~m1 ne the Effect1veness of a Remedial Reading P rog~am with Students at Utah State University by Judith J. Ivarie , Master of Science Utah State University Major Professor: Sara Lyon James Department: Special Education v l 1 The purpose of this study is to determine the effectiveness of 20 hours of remedial •eading instruct1on as compared with 20 hours of vocabulary ins...

Since 1967 there has again been great interest in chess programming. This paper demonstrates that the s t r u c t u r e of today's most successful programs cannot be ex tended to play Master level chess. Certain basic requ i rements of a Master player's performance are s h o w n to be outside the performance limits to which a p rog ram of this t ype could be extended. The paper also examines a ...

We d e s c r i b e some f e a t u r e s of a p rog ram w h i c h i n t e r p r e t s c a r t o o n s w h i c h a r e t w o d i m e n s i o n a l r e p r e s e n t a t i o n s o f e v e n t s i n t h e t h r e e d i m e n s i o n a l w o r l d . The m a i n p rob lems c o n f r o n t i n g t h e r e c o g n i t i o n p r o c e d u r e s s tem f r o m t h e d i f f i c u l t i e s i n d e s c r i...

In t h i s paper we cons ide r a . spec i f i c type of l o g i c programs ca l led recursive-schema programs and show t h a t the c l ass of r ecu rs i ve -schema programs has s u f f i c i e n t e x p r e s s i v e c a p a b i l i t y , which provides an a l t e r n a t i v e simple proof fo r the resultby Tarnlund concerning the computat ional power of Horn c lause programs. F u r t h e r , ...