arbitrary matching
Recently Published Documents


TOTAL DOCUMENTS

17
(FIVE YEARS 1)

H-INDEX

8
(FIVE YEARS 0)

2020 ◽  
Vol 65 (2) ◽  
Author(s):  
Maria Samuleeva ◽  
Anna Smirnova

The ability to form equivalent relations between sign and referent—symbolization—is one of the important cognitive components of language. Equivalent relations have the properties of symmetry (if A→B then B→A), reflexivity (A→A, B→B), and transitivity (if A→B and B→C, then A→C). The current study evaluates whether reflexivity can be spontaneously revealed in hooded crows (Corvus cornix) without training after the formation of the symmetry relation. These birds were previously taught an arbitrary matching-to-sample task with the letters “S” and “V” as samples, and sets of images (same-sized and different-sized figures) as comparisons. Positive results in the transfer tests showed that the crows associated letters with the concepts of sameness/difference. After that, they successfully passed the symmetry test, in which samples and comparisons were switched around. In the present experiment we found out that the crows passed the reflexivity test (A→A, B→B) without identity training. We hypothesize that if the subject associates the sample not with certain stimuli but rather with concepts, it facilitates the formation of equivalence relations between them.


Games ◽  
2020 ◽  
Vol 11 (1) ◽  
pp. 11
Author(s):  
Joseph E. Duggan

The Stable Fixtures problem (Irving and Scott (2007)) is a generalized matching model that nests the well-known Stable Roommates, Stable Marriage, and College Admissions problems as special cases. This paper extends a result of the Stable Roommates problem to demonstrate that a class of homophilic preferences with an appealing psychological interpretation is sufficient to ensure that starting from an arbitrary matching, a decentralized process of allowing the sequential matching of randomly chosen blocking pairs will converge to a pairwise-stable matching with probability one. Strategic implications of this class of preferences are examined and further possible generalizations and directions for future research are discussed.


2018 ◽  
Vol 109 (3) ◽  
pp. 600-623 ◽  
Author(s):  
Carl T. Sundberg ◽  
Mark L. Sundberg ◽  
Jack Michael

2016 ◽  
Vol 9 (2) ◽  
pp. 30-39 ◽  
Author(s):  
Paulo S. D. Soares Filho ◽  
Álvaro J. M. Silva ◽  
Saulo M Velasco ◽  
Romariz S Barros ◽  
Gerson Yukio Tomanari

The present study presents a procedure to assess the property of symmetry by comparing the acquisition of conditional relations that are consistent and inconsistent with this property in a capuchin monkey (Sapajus spp.). One young male monkey underwent arbitrary matching-to-sample training. The experiment had four phases: Phase 1.1 (establishing A1B1 and A2B2 relations), Phase 1.2 (reinforcing B1A1 and B2A2 relations, consistent with the property of symmetry), Phase 2.1 (establishing A3B3 and A4B4 relations), and Phase 2.2 (reinforcing B3A4 and B4A3 relations, inconsistent with the property of symmetry). A comparison between Phase 1.2 (consistent) and Phase 2.2 (inconsistent) showed faster acquisition of consistent relations (B1A1 and B2A2) than inconsistent relations (B3A4 and B4A3). The results suggest that the established conditional discriminations may have the property of symmetry and confirm the potential of comparative analysis between the acquisition of conditional discriminations as a promising procedure to evaluate equivalence class formation in nonhuman subjects.


2014 ◽  
Vol 64 (4) ◽  
pp. 827-839 ◽  
Author(s):  
Hanna Steinunn Steingrimsdottir ◽  
Erik Arntzen

2012 ◽  
Vol 433-440 ◽  
pp. 5420-5424 ◽  
Author(s):  
Li Jing Cao ◽  
Ming Lv

This paper concerns the problem of image mosaic. An image matching method based on SIFT features and an image blending method of improved Hat function are proposed in the paper. SIFT feature is local feature and keeps invariant to scale zoom, rotation and illumination. It is also insensitive to noise, view point changing and so on. Because of this our method is insensitive to orientation, scale and illumination of input images, so it’s possible to accomplish image mosaic between arbitrary matching images and the Hat function blending algorithm with global intensity revise makes the mosaic image accepted by human eyes.


2009 ◽  
Vol 104 (3) ◽  
pp. 861-873 ◽  
Author(s):  
Harrie Boelens ◽  
Jacqueline Schenk

Identity and oddity matching tasks were designed for different groups of 5-yr.-old children. The presentation of tasks continued until all children had shown evidence of appropriate generalization to new stimuli (i.e., generalized identity matching or generalized oddity from sample). All children then received training on an arbitrary matching-to-sample task. Finally, tests of reflexivity and symmetry in responding were carried out in three consecutive sessions. The children in the Identity group showed reflexivity and symmetry in responses on all three tests; the children in the Oddity group showed oddity in responses on all tests, and a gradual increase in symmetry of responses across tests. These results provide evidence against special versions of multiple-exemplar and reinforcement contingency accounts of stimulus equivalence. Versions of the accounts to explain the findings are discussed.


2001 ◽  
Vol 11 (5) ◽  
pp. 637-688 ◽  
Author(s):  
ANNEGRET HABEL ◽  
JÜRGEN MÜLLER ◽  
DETLEF PLUMP

In this paper we investigate and compare four variants of the double-pushout approach to graph transformation. As well as the traditional approach with arbitrary matching and injective right-hand morphisms, we consider three variations by employing injective matching and/or arbitrary right-hand morphisms in rules. We show that injective matching provides additional expressiveness in two respects: for generating graph languages by grammars without non-terminals and for computing graph functions by convergent graph transformation systems. Then we clarify for each of the three variations whether the well-known commutativity, parallelism and concurrency theorems are still valid and – where this is not the case – give modified results. In particular, for the most general approach with injective matching and arbitrary right-hand morphisms, we establish sequential and parallel commutativity by appropriately strengthening sequential and parallel independence.


Sign in / Sign up

Export Citation Format

Share Document