Search results for "Associative property"
showing 10 items of 58 documents
Generalized Logical Operations among Conditional Events
2018
We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular we examine the Frechet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction $\mathcal…
EHeBby: An evocative humorist chat-bot
2008
A conversational agent, capable to have a "sense of humor" is presented. The agent can both generate humorous sentences and recognize humoristic expressions introduced by the user during the dialogue. EHeBby is an entertainment oriented conversational agent implemented using the ALICE framework embedded into an Yahoo! Messenger client. It is characterized by two areas: a rational, rule-based area and an evocative area. The first one is based on well founded techniques of computational humor and a standard AIML KB. The second one is based on a conceptual space, automatically induced by a corpus of funny documents, where KB items and user sentences are mapped. This area emulates an associativ…
Towards Psychologically based Personalised Modelling of Emotions Using Associative Classifiers
2016
Learning environments, among other user-centred applications, are excellent candidates to trial Computational Emotions and their algorithms to enhance user experience and to expand the system usability. However, this was not feasible because of the paucity in affordable consumer technologies that support the requirements of systems with advanced cognitive capabilities. Microsoft Kinect provides an accessible and affordable technology that can enable cognitive features such as facial expressions extraction and emotions detection. However, it comes with its own additional challenges, such as the limited number of extracted Animation Units (AUs). This paper presents a new approach that attempt…
Minimal star-varieties of polynomial growth and bounded colength
2018
Abstract Let V be a variety of associative algebras with involution ⁎ over a field F of characteristic zero. Giambruno and Mishchenko proved in [6] that the ⁎-codimension sequence of V is polynomially bounded if and only if V does not contain the commutative algebra D = F ⊕ F , endowed with the exchange involution, and M , a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices , endowed with the reflection involution. As a consequence the algebras D and M generate the only varieties of almost polynomial growth. In [20] the authors completely classify all subvarieties and all minimal subvarieties of the varieties var ⁎ ( D ) and var ⁎ ( M ) . In this paper we e…
Polynomial growth and star-varieties
2016
Abstract Let V be a variety of associative algebras with involution over a field F of characteristic zero and let c n ⁎ ( V ) , n = 1 , 2 , … , be its ⁎-codimension sequence. Such a sequence is polynomially bounded if and only if V does not contain the commutative algebra F ⊕ F , endowed with the exchange involution, and M, a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices. Such algebras generate the only varieties of ⁎-algebras of almost polynomial growth, i.e., varieties of exponential growth such that any proper subvariety is polynomially bounded. In this paper we completely classify all subvarieties of the ⁎-varieties of almost polynomial growth by gi…
Peiffer product and peiffer commutator for internal pre-crossed modules
2017
In this work we introduce the notions of Peiffer product and Peiffer commutator of internal pre-crossed modules over a fixed object B, extending the corresponding classical notions to any semi-abelian category C. We prove that, under mild additional assumptions on C, crossed modules are characterized as those pre-crossed modules X whose Peiffer commutator 〈X, X〉 is trivial. Furthermore we provide suitable conditions on C (fulfilled by a large class of algebraic varieties, including among others groups, associative algebras, Lie and Leibniz algebras) under which the Peiffer product realizes the coproduct in the category of crossed modules over B.
Free Word Associations Correspond to Contiguities Between Words in Texts*
2005
A free associative response is the first word a person comes up with after perceiving another word, the so-called associative stimulus. People commonly associate hot to cold, church to priest, and hard to work. According to traditional association theory this behaviour is the result of learning by contiguity: “Objects once experienced together tend to become associated in the imagination, so that when any one of them is thought of, the others are likely to be thought of also, in the same order of sequence or coexistence as before” (James, 1890). This explanation has been rejected by cognitive psychologists who explain the production of associations as the result of symbolic processes which …
Centre-embedded structures are a by-product of associative learning and working memory constraints: Evidence from baboons (Papio Papio)
2012
International audience; Influential theories have claimed that the ability for recursion forms the computational core of human language faculty distinguishing our communication system from that of other animals (Hauser, Chomsky, & Fitch, 2002). In the present study, we consider an alternative view on recursion by studying the contribution of associative and working memory processes. After an intensive paired-associate training with visual shapes, we observed that baboons spontaneously ordered their responses in keeping with a recursive, centre-embedded structure. This result suggests that the human ability for recursion might partly if not entirely originate from fundamental processing cons…
Associative and implicit memory performance as a function of cognitive reserve in elderly adults with and without mild cognitive impairment
2016
AbstractThis study aims to analyze implicit and explicit memory performance as a function of cognitive reserve (CR) in a healthy control group (N = 39) and a mild cognitive impairment (MCI) group (N = 37). Both groups were subdivided into high and low cognitive reserve, and were asked to complete an explicit and implicit associative recognition tasks. The results showed that the control group was able to learn both tasks (η2 = .19, p < .0001), and the high CR group fared better (η2 = .06, p < .05). The MCI sample, conversely, was unable to learn the implicit relationship, and showed very little learning on the explicit association task. Participants diagnosed with MCI showed little pl…
Associative and reflective connections between the limit of the difference quotient and limiting process
2006
Abstract This paper reports a study of how students may connect the limiting process inherent in the derivative to the limit of the difference quotient (LDQ) when solving problems. The data was collected mainly through task-based interviews with five eleventh grade students. It was found that the students used various kinds of limiting processes and connected them in different ways to LDQ. Some of them changed between these two representations, and some students explained one with the other. The two kinds of connections were, respectively, named as associative and reflective connections. One of the students, who made the associative connection, used LDQ skillfully. On the contrary, a studen…