fast sequences
Recently Published Documents


TOTAL DOCUMENTS

15
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

Author(s):  
Aleksandar Aksentijevic ◽  
Finbar Duffy ◽  
Anja Mihailovic ◽  
Dragutin T. Mihailovic

Abstract Aksentijevic–Gibson complexity is an original complexity measure based on the amount of change in a string or 2D array that has been successfully implemented on data from psychology to physics. The key ingredient to computing the measure is a change symmetry (CS)—a novel form of structure (also known as generalised palindrome) which represents a central or mirror symmetry based on the redundant arrangement not of symbols but of changes. This results in patterns that although globally symmetrical do not appear as such when inspected locally. We used this property to (a) affect the registration of a target, (b) prime the symmetry judgment of 2D arrays and (c) faces using 1D patterns possessing change symmetry. In Experiment 2, we applied the lock and key principle to complete the prime without showing its structure at once. In Experiments 3 and 4, we presented subjects with fast sequences of CSs such that the configuration of an individual pattern was masked by the subsequent pattern leaving only the structural “essence” of the prime symmetry. The results strongly support the contention that higher-level hidden structure of change symmetry successfully primes the symmetry perception of 2D arrays as well as facial attractiveness.



Neuron ◽  
2016 ◽  
Vol 91 (1) ◽  
pp. 194-204 ◽  
Author(s):  
Zeb Kurth-Nelson ◽  
Marcos Economides ◽  
Raymond J. Dolan ◽  
Peter Dayan
Keyword(s):  


SpringerPlus ◽  
2015 ◽  
Vol 4 (1) ◽  
Author(s):  
Aristidis H Zibis ◽  
Sokratis E Varitimidis ◽  
Zoe H Dailiana ◽  
Apostolos H Karantanas ◽  
Dimitrios L Arvanitis ◽  
...  


2013 ◽  
Vol 9 (7) ◽  
pp. 1039-1050 ◽  
Author(s):  
Babak Bazrafshan ◽  
Frank Hübner ◽  
Parviz Farshid ◽  
Jijo Paul ◽  
Renate Hammerstingl ◽  
...  


2010 ◽  
Vol 26 (4) ◽  
pp. 192-201 ◽  
Author(s):  
A. Kickhefel ◽  
Jörg Roland ◽  
Clifford Weiss ◽  
Fritz Schick


2005 ◽  
Vol 70 (2) ◽  
pp. 410-418 ◽  
Author(s):  
Harvey Friedman ◽  
Chris Miller

AbstractLet ℝ be an o-minimal expansion of (ℝ, <, +) and (ϕk)kЄℕ be a sequence of positive real numbers such that limtk →+∞ f (ϕk)/ϕk+1 = 0 for every f: ℝ → ℝ definable in ℜ (Such sequences always exist under some reasonable extra assumptions on ℜ, in particular, if ℜ is exponentially bounded or if the language is countable.) Then (ℜ, (S)) is d-minimal. where S ranges over all subsets of cartesian powers of the range of ϕ.



2003 ◽  
Vol 13 (3) ◽  
pp. 507-514 ◽  
Author(s):  
Jean-Paul Vallée ◽  
Marko Ivancevic ◽  
François Lazeyras ◽  
Larry Kasuboski ◽  
Pascal Chatelain ◽  
...  


Sign in / Sign up

Export Citation Format

Share Document