iφt +∆φ+ φl ′ (|φ|2)∆l(|φ|2) + f(|φ|2)φ = 0 in (0,∞)× R , φ(0, x) = a0(x) in R N , where l and f are given functions. Here i is the imaginary unit, N ≥ 1, φ : R → C is a complex valued function. For example, the particular case l(s) = √ 1 + s models the self-channeling of a high-power ultra short laser in matter (see [6, 13, 36]) whereas if l(s) = √ s, equation (1.1) appears in dissipative quan...

Three experiments studied timing in rats on 2-valued mixed-fixed-interval schedules, with equally probable components, Fixed-Interval S and Fixed-Interval L (FI S and FI L, respectively). When the L:S ratio was greater than 4, 2 distinct response peaks appeared close to FI S and FI L, and data could be well fitted by the sum of 2 Gaussian curves. When the L:S ratio was less than 4, only 1 respo...

This chapter presents DISCIPLE, a multi-strategy integrated learning s y s t e m illustrating a theory and a methodology for learning expert knowledge in the con tex t of an imperfect domain theory. DISCIPLE integrates a learning system and an e m p t y expert system, both using the same knowledge base. It is initially provided with a n imperfect (nonhomogeneous) domain theory and learns proble...

We study a natural generalization of the notion cores for l-partitions attached with multi-charge s ? Z^l : (e, s)-cores. rely them both to combinatorics and weight defined by Fayers. Next we applications in context block theory Ariki-Koike algebras.

In th i s paper we f i r s t t r y to character ize one meaning of automatic programming. We consider it to be one part of the Programming environment re la ted to A r t i f i c i a l I n te l l i gence techniques. We then i l l u s t r a t e an automatic programning process, on a simple example, using an Abstract Data Type theory to which we add the not ion of schemes which are p a r t i c u l...

This paper describes a theory formation system which can discover a p a r t i a l axiomization of a data base represented as extensional ly defined binary r e l a t i o n s . The system f i r s t discovers a l l possible in tens ional d e f i n i t i o n s of each binary re la t i on in terms of the others. It then determines a minimal set of these re la t ions from which the others can be def ...

We develop a theory of stratified $LM$-filters which generalizes the theory of stratified $L$-filters. Our stratification condition explicitly depends on a suitable mapping between the lattices $L$ and $M$. If $L$ and $M$ are identical and the mapping is the identity mapping, then we obtain the theory of stratified $L$-filters. Based on the stratified $LM$-filters, a general theory of lattice-v...