1.0 INTRODUCTION The main goa l o f t h i s r e s e a r c h , f rom an AI v i e w p o i n t is the development o f a framework f o r Mo t ion Unders tand ing by Computer. Th is f rame­ work i s expected t o p r o v i d e : (a) A r e p r e s e n t a t i o n of knowledge f o r mot ion concep ts , based on frames [Minsky75] and semant ic networks [Brachman79] . (b) The d e s c r i p t i o n of bas...

T h e p r i n c i p l e s u n d e r l y i n g a c o m p u t e r b a s e d t r e a t m e n t m e t h o d f o r l a n g u a g e a c q u i s i t i o n i n n o n s p e a k i n g a u t i s t i c ch i I dren are descr i bed. T h e m a i n p r i n c i p l e i n v o l v e s e n c o u r a g e m e n t o f e x p l o r a t o r y l e a r n i n g w i t h m i n i m u m a d u l t i n t e r f e r e n c e . T h ...

In this paper, we study vector-valued elliptic operators of the form $${\mathcal {L}}f:=\mathrm {div}(Q\nabla f)-F\cdot \nabla f+\mathrm {div}(Cf)-Vf$$ acting on functions $$f:\mathbb {R}^d\rightarrow \mathbb {R}^m$$ and involving coupling at zero first order terms. We prove that {L}}$$ admits realizations in $$L^p(\mathbb {R}^d,\mathbb {R}^m)$$ , for $$1<p<\infty $$ generate analytic strongly ...

In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...

I n t h i s p a p e r , w e d e s c r i b e a n e f f i c i e n t p a r s e r f o r F r e n c h based o n a n a d a p t a t i o n o f Chomsky 's G o v e r n m e n t B i n d i n g (GB) t h e o r y . R e f l e c t i n g t h e modu la r c o n c e p t i o n o f a GB grammar, t h e p a r s e r c o n s i s t s o f s e v e r a l d i s t i n c t p r o c e d u r e s c o r r e s p o n d i n g t o t h e s...

For every real p > 0 and simple graph G, set f (p,G) = ∑ u∈V (G) d (u) , and let φ (r, p, n) be the maximum of f (p,G) taken over all Kr+1-free graphs G of order n. We prove that, if 0 < p < r, then φ (r, p, n) = f (p, Tr (n)) , where Tr (n) is the r-partite Turan graph of order n. For every p ≥ r + ⌈√ 2r ⌉ and n large, we show that φ (p, n, r) > (1 + ε) f (p, Tr (n)) for some ε = ε (r) > 0. Ou...