Reorganization of equivalence classes: effects of preliminary training and meaningful stimuli

2018 ◽  
Vol 109 (3) ◽  
pp. 564-586 ◽  
Author(s):  
Erik Arntzen ◽  
Richard K. Nartey ◽  
Lanny Fields
Author(s):  
Ramon Marin ◽  
Vanessa Ayres‐Pereira ◽  
Deisy de Souza

Author(s):  
Felix Högnason ◽  
Erik Arntzen

AbstractIn an attempt to limit the opportunity to engage in mediating behavior, two groups of adult participants received preliminary training in identity matching with limited hold levels (LH) for responding of 0.7 s for the sample and 1.2 s for the comparisons. The two groups were subsequently trained to form three 5-member classes, using the same LH levels, where the A, B, D, and E stimuli were abstract stimuli, and the C stimuli were meaningful pictures. In two tests for emergent relations, the LH for Group Short was unchanged, whereas 5 s were added to the LH for the comparisons for Group Long. None of the participants in Group Short responded in accordance with stimulus equivalence in either of the two tests. In Group Long, one participant responded in accordance with stimulus equivalence in the first test, and an additional eight participants formed equivalence classes in the second test.


2018 ◽  
Vol 1 (1) ◽  
pp. 55-76 ◽  
Author(s):  
Carol Pilgrim ◽  
Rebecca Click ◽  
Mark Galizio

Developmental differences in children’s conditional discrimination learning, equivalenceclass formation, and equivalence-class disruption were investigated in two experiments. In Experiment 1, children between 2 and 9 years of age demonstrated age-related differences across a series of preliminary training steps, such that time to acquisition was more variable for younger than for older children on an initial identity matching and category matching task. However, uponcompletion of the preliminary training, there were no age-related differences in time to acquisition of the two arbitrary conditional discriminations that would serve as the basis for equivalence-class formation, nor were there differences in time to demonstrate stable equivalence classes (Experiment 2). Also in Experiment 2, children between 2 and 14 years of age were exposed to a potential challenge to the demonstrated equivalence classes; the reinforcement contingency for theAC conditional discrimination was reversed (i.e., given A1, A2 or A3, reinforcers were produced by selecting C2, C3, or C1 respectively). While there was little change in performance on reflexivity or BA symmetry tests following the challenge, age-related differences were obtained for CA symmetry and combined tests for equivalence. The older children were more likely to demonstrate an orderly change in equivalence-class membership consistent with the reversal training, while the younger children showed either little change or substantial disruption in their equivalence patterns. These data are considered in relation to more traditional investigations of children’s category formation, as well as their implications for the study of equivalence-class formation and flexibility.


Author(s):  
Guro Granerud ◽  
Erik Arntzen

AbstractIn the present study, two typically developing 4-year-old children, Pete and Joe, were trained six conditional discriminations and tested for the formation of three 3-member equivalence classes. Pete and Joe did not establish the AC relation within 600 trials and were given two conditions of preliminary training, including naming of stimuli with two different stimulus sets. Pete started with preliminary training with common naming of stimuli, followed by conditional-discrimination training and testing for emergent relations, and continued with preliminary training on individual naming of stimuli, followed by the same training and testing as described previously. Joe experienced the same conditions but in reversed order. Pete responded in accordance with equivalence in the second round in the condition with common naming. In the first round of testing in the condition with individual naming, he responded in accordance with equivalence. In the condition with individual naming, Joe did not respond in accordance with stimulus equivalence but established all of the directly trained relations during training. In the condition with common naming, he responded in accordance with equivalence in the first round of testing. The results from the experiment support earlier findings that both common and individual naming could facilitate the emergence of equivalence classes.


Author(s):  
Е.Ю. Соколов ◽  
А.И. Адаев ◽  
А.А. Фомин ◽  
Л.Г. Магурдумова

In article the importance of use of psychotherapeutic actions of self-control by employees of a dangerous profession is stated during the work in emergency situations. The state of health of fighters who before the direction in business trip were trained previously in self-control methods at different stages of performance of a fighting task, with a condition of group of the military personnel who didn’t pass preliminary training in energy saving methods is compared.


2020 ◽  
Vol 12 (1) ◽  
Author(s):  
Jördis-Ann Schüler ◽  
Steffen Rechner ◽  
Matthias Müller-Hannemann

AbstractAn important task in cheminformatics is to test whether two molecules are equivalent with respect to their 2D structure. Mathematically, this amounts to solving the graph isomorphism problem for labelled graphs. In this paper, we present an approach which exploits chemical properties and the local neighbourhood of atoms to define highly distinctive node labels. These characteristic labels are the key for clever partitioning molecules into molecule equivalence classes and an effective equivalence test. Based on extensive computational experiments, we show that our algorithm is significantly faster than existing implementations within , and . We provide our Java implementation as an easy-to-use, open-source package (via GitHub) which is compatible with . It fully supports the distinction of different isotopes and molecules with radicals.


1989 ◽  
Vol 12 (3) ◽  
pp. 317-356
Author(s):  
David C. Rine

Partitioning and allocating of software components are two important parts of software design in distributed software engineering. This paper presents two general algorithms that can, to a limited extent, be used as tools to assist in partitioning software components represented as objects in a distributed software design environment. One algorithm produces a partition (equivalence classes) of the objects, and a second algorithm allows a minimum amount of redundancy. Only binary relationships of actions (use or non-use) are considered in this paper.


2021 ◽  
pp. 1-18
Author(s):  
YOTAM SMILANSKY ◽  
YAAR SOLOMON

Abstract We prove that in every compact space of Delone sets in ${\mathbb {R}}^d$ , which is minimal with respect to the action by translations, either all Delone sets are uniformly spread or continuously many distinct bounded displacement equivalence classes are represented, none of which contains a lattice. The implied limits are taken with respect to the Chabauty–Fell topology, which is the natural topology on the space of closed subsets of ${\mathbb {R}}^d$ . This topology coincides with the standard local topology in the finite local complexity setting, and it follows that the dichotomy holds for all minimal spaces of Delone sets associated with well-studied constructions such as cut-and-project sets and substitution tilings, whether or not finite local complexity is assumed.


1993 ◽  
Vol 7 (3) ◽  
pp. 409-412 ◽  
Author(s):  
David Madigan

Directed acyclic independence graphs (DAIGs) play an important role in recent developments in probabilistic expert systems and influence diagrams (Chyu [1]). The purpose of this note is to show that DAIGs can usefully be grouped into equivalence classes where the members of a single class share identical Markov properties. These equivalence classes can be identified via a simple graphical criterion. This result is particularly relevant to model selection procedures for DAIGs (see, e.g., Cooper and Herskovits [2] and Madigan and Raftery [4]) because it reduces the problem of searching among possible orientations of a given graph to that of searching among the equivalence classes.


Sign in / Sign up

Export Citation Format

Share Document