Effect of Rapid Responding on Establishment of Conditional Discriminations and Formation of Equivalence Classes

2019 ◽  
Vol 69 (3) ◽  
pp. 367-378
Author(s):  
Erik Arntzen ◽  
Kim Henrik Liland
Keyword(s):  
Equivalence Classes ◽  
Conditional Discriminations

Transfer of Social Attributions in Stimulus Equivalence Classes by Preschool Children

1997 ◽  
Vol 80 (1) ◽  
pp. 3-21 ◽  
Author(s):  
Mark Egli ◽  
Beth Joseph ◽  
Travis Thompson
Keyword(s):  
Preschool Children ◽  
Antisocial Behavior ◽  
Equivalence Class ◽  
Stimulus Equivalence ◽  
Computer Game ◽  
Equivalence Classes ◽  
Antisocial Behaviors ◽  
Conditional Discriminations ◽  
Response Options ◽  
Social Attributions

The transfer of social attributions within stimulus-equivalence classes comprised of photographs of children was examined. Five children (mean age: 4 yr., 2 mo.) were taught conditional discriminations sufficient for the emergence of two 3-member equivalence classes (A1-B1-C1 and A2-B2-C2). Social attributions were established by using two photographs to identify fictional children who could facilitate (B1) or prevent (B2) the participant's reinforcement on a computer game. Transfer of attribution was assessed by asking the participants questions regarding predicted social behaviors by children in all six photographs. One set of questions pertained explicitly to the response-options of the computer game; a second set referred to other prosocial and antisocial behaviors. Three children chose photographs in response to questions consistent with their experience with members B1 and B2 of the shared equivalence class when the questions pertained to the computer game. One subject also selected photographs in response to questions about predicted prosocial and antisocial behavior which reflected her experience with the B1 and B2 photographs.

scholarly journals Naming of Stimuli in Equivalence Class Formation in Children

2021 ◽  
Author(s):  
Guro Granerud ◽  
Erik Arntzen
Keyword(s):  
Conditional Discrimination ◽  
Stimulus Equivalence ◽  
Equivalence Classes ◽  
Preliminary Training ◽  
Typically Developing ◽  
Conditional Discriminations ◽  
Conditional Discrimination Training ◽  
Emergent Relations ◽  
Equivalence Class Formation ◽  
Reversed Order

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.

scholarly journals MET: a Java package for fast molecule equivalence testing

2020 ◽  
Vol 12 (1) ◽  
Author(s):  
Jördis-Ann Schüler ◽  
Steffen Rechner ◽  
Matthias Müller-Hannemann
Keyword(s):  
Chemical Properties ◽  
Graph Isomorphism ◽  
Isomorphism Problem ◽  
Equivalence Classes ◽  
Equivalence Testing ◽  
Equivalence Test ◽  
Graph Isomorphism Problem ◽  
2D Structure ◽  
Node Labels ◽  
Labelled Graphs

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.

Parallel and Distributed Processability of Objects

1989 ◽  
Vol 12 (3) ◽  
pp. 317-356
Author(s):  
David C. Rine
Keyword(s):  
Software Engineering ◽  
Software Design ◽  
Equivalence Classes ◽  
Minimum Amount ◽  
Software Components ◽  
Limited Extent ◽  
Design Environment ◽  
Distributed Software

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.

scholarly journals A dichotomy for bounded displacement equivalence of Delone sets

2021 ◽  
pp. 1-18
Author(s):  
YOTAM SMILANSKY ◽  
YAAR SOLOMON
Keyword(s):  
Compact Space ◽  
Equivalence Classes ◽  
Natural Topology ◽  
Fell Topology ◽  
Local Complexity ◽  
Substitution Tilings ◽  
Local Topology ◽  
Delone Sets

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.

scholarly journals A Note on Equivalence Classes of Directed Acyclic Independence Graphs

1993 ◽  
Vol 7 (3) ◽  
pp. 409-412 ◽  
Author(s):  
David Madigan
Keyword(s):  
Model Selection ◽  
Expert Systems ◽  
Equivalence Classes ◽  
Influence Diagrams ◽  
Single Class ◽  
Selection Procedures ◽  
Probabilistic Expert Systems ◽  
Recent Developments ◽  
Independence Graphs ◽  
Markov Properties

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.

A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA

2008 ◽  
Vol 17 (05) ◽  
pp. 579-599 ◽  
Author(s):  
MARIA RITA CASALI ◽  
PAOLA CRISTOFORI
Keyword(s):  
Automatic Generation ◽  
Computational Approach ◽  
Equivalence Classes ◽  
Colored Graphs ◽  
One To One ◽  
Genus Two ◽  
Jsj Decompositions

The present paper follows the computational approach to 3-manifold classification via edge-colored graphs, already performed in [1] (with respect to orientable 3-manifolds up to 28 colored tetrahedra), in [2] (with respect to non-orientable 3-manifolds up to 26 colored tetrahedra), in [3] and [4] (with respect to genus two 3-manifolds up to 34 colored tetrahedra): in fact, by automatic generation and analysis of suitable edge-colored graphs, called crystallizations, we obtain a catalogue of all orientable 3-manifolds admitting colored triangulations with 30 tetrahedra. These manifolds are unambiguously identified via JSJ decompositions and fibering structures. It is worth noting that, in the present work, a suitable use of elementary combinatorial moves yields an automatic partition of the elements of the generated crystallization catalogue into equivalence classes, which turn out to be in one-to-one correspondence with the homeomorphism classes of the represented manifolds.

Sign in / Sign up

Export Citation Format

Share Document