Results 251 to 260 of about 16,575,742 (281)

The number sense does not represent numbers, but cardinality comparisons

Behavioral and Brain Sciences, 2021
Abstract Against Clarke and Beck's proposal that the approximate number system (ANS) represents natural and rational numbers, I suggest that the experimental evidence is better accommodated by the (much weaker) thesis that the ANS represents cardinality comparisons.
openaire   +2 more sources

Sequential effects in number comparison.

Journal of Experimental Psychology: Human Perception and Performance, 2000
The modular framework of number processing (e.g., S. Dehaene & R. Akhavein, 1995) was applied to study sequential trial-to-trial effects in a number comparison task. In Experiment 1, numbers were always presented as digits. Responses were faster when the same number was repeated, but this effect was additive with the numerical distance effect.
Schwarz, W., Ischebeck, A.K.
openaire   +3 more sources

Effects of pitch on auditory number comparisons

Psychological Research, 2014
Three experiments investigated interactions between auditory pitch and the numerical quantities represented by spoken English number words. In Experiment 1, participants heard a pair of sequential auditory numbers in the range zero to ten. They pressed a left-side or right-side key to indicate if the second number was lower or higher in numerical value.
Jamie I D, Campbell, Florence, Scheepers
openaire   +2 more sources

Algorithms for comparison in residue number systems

2016 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2016
Residue Number Systems (RNSs) has been widely used in digital signal processing (DSP) systems and cases of fast computing, parallelism and fault tolerant because of its carry-free property. However, the comparison operation in an RNS is quite difficult and the computation cost is high, which are a significant limitation to apply it for division ...
Hanshen Xiao, Yu Ye 0001, Guoqiang Xiao 0001, Qin Kang   +3 more
openaire   +1 more source

On the Number of Replications of a Paired Comparison

Biometrika, 1971
SUMMARY When the better of two objects is to be selected, the choice is frequently the first of the objects to win k comparisons between them. If the better of two objects is defined as the one with the larger probability of winning a single comparison between them, the final choice depends to some extent on chance; the competition could result in a ...
openaire   +2 more sources

Comparison of clusters from fuzzy numbers

Fuzzy Sets and Systems, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vania Peneva, Ivan P. Popchev
openaire   +1 more source

Comparison of sum choice number with chromatic sum

Discrete Mathematics, 2021
For a simple graph \(G = (V(G),E(G))\), with both \(V(G)\) and \(E(G)\) finite sets, a proper coloring of \(G\) is here a map \(\phi : V(G) \rightarrow \{1,2,3,\ldots\} = \mathbb{N}\) such that every pair of adjacent vertices receive distinct colors. The chromatic sum \(\Sigma(G)\) of \(G\) is the minimum of the sum of colors of the vertices \(\sum_{u ...
Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza, Margit Voigt   +3 more
openaire   +3 more sources

On the Issue of Comparison of Fuzzy Numbers

2019
In the class of decision-making problems with fuzzy information concerning criterion values, the problem of comparing fuzzy numbers is relevant. There are various approaches to solving it. They are determined by the specific character of the problem under consideration. This paper proposes one approach to comparing fuzzy numbers.
Viktor I. Ukhobotov, Irina Stabulit, Konstantin N. Kudryavtsev   +2 more
openaire   +1 more source

Multiple Comparisons for a Large Number of Parameters

Biometrical Journal, 2001
Summary: When there are many parameters of interest (finitely large or infinite), standard multiple comparison procedures for a finite number of parameters (called discrete-domain approaches) may lead to a simultaneous confidence region (SCR) too conservative to be useful.
openaire   +2 more sources

On the Number of Comparisons to Find the Intersection of Two Relations

SIAM Journal on Computing, 1979
Given two finite sets of k-tuples whose component elements are drawn from an infinite totally ordered set, the problem of identifying the k-tuples which belong to both sets is considered. Attention is restricted to algorithms that perform pairwise comparisons on the component elements of the k-tuples. If the two sets have cardinalities m and n with $m \
Larry J. Stockmeyer, C. K. Wong
openaire   +1 more source