Is the locus of the problem-size effect in mental arithmetic different across cultures? In a novel approach to this question, the ex-Gaussian distributional model was applied to response times for large (e.g., 8 x 9) and small (e.g., 2 x 3) problems obtained from Chinese and Canadian graduate students in a multiplication production task (LeFevre & Liu, 1997). The problem-size effect for the Chinese group occurred in mu (the mean of the normal component), whereas the problem-size effect for the Canadian group occurred in both mu and tau (the mean of the exponential component). The results support the position that the problem-size effect for the Chinese group is purely a memory-retrieval effect, whereas for the Canadian group, it is an effect of both retrieval and the use of nonretrieval solution procedures.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.3758/bf03194333 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Metagenome comparison (MC): A new framework for detecting unique/enriched OMUs (operational metagenomic units) derived from whole-genome sequencing reads.
Comput Biol Med
September 2024
Faculty of Arts and Sciences Harvard University Cambridge, MA, 02138, USA; Microbiome Medicine and Advanced AI Lab, Cambridge, MA, 02138, USA; Computational Biology and Medical Ecology Lab Kunming Institute of Zoology Chinese Academy of Sciences, China. Electronic address:
Background: Current methods for comparing metagenomes, derived from whole-genome sequencing reads, include top-down metrics or parametric models such as metagenome-diversity, and bottom-up, non-parametric, model-free machine learning approaches like Naïve Bayes for k-mer-profiling. However, both types are limited in their ability to effectively and comprehensively identify and catalogue unique or enriched metagenomic genes, a critical task in comparative metagenomics. This challenge is significant and complex due to its NP-hard nature, which means computational time grows exponentially, or even faster, with the problem size, rendering it impractical for even the fastest supercomputers without heuristic approximation algorithms.
View Article and Find Full Text PDFService network design for freight railway transportation: The Chinese case.
PLoS One
December 2022
School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China.
Service network design is a typical tactical planning problem faced in freight railway transportation. In this paper, we propose an integer linear programming model for the rail freight service network design problem in the context of the China railway system. The model aims to minimize the overall costs (including train costs and car costs) while satisfying a set of practical restrictions and operational requirements.
View Article and Find Full Text PDFToward practical quantum embedding simulation of realistic chemical systems on near-term quantum computers.
Chem Sci
August 2022
ByteDance Inc Zhonghang Plaza, No. 43, North 3rd Ring West Road, Haidian District Beijing China
Quantum computing has recently exhibited great potential in predicting chemical properties for various applications in drug discovery, material design, and catalyst optimization. Progress has been made in simulating small molecules, such as LiH and hydrogen chains of up to 12 qubits, by using quantum algorithms such as variational quantum eigensolver (VQE). Yet, originating from the limitations of the size and the fidelity of near-term quantum hardware, the accurate simulation of large realistic molecules remains a challenge.
View Article and Find Full Text PDFThe neural bases of the multiplication problem-size effect across countries.
Front Hum Neurosci
May 2013
Department of Communication Sciences and Disorders, Northwestern University Evanston, IL, USA ; Laboratoire Langage, Cerveau et Cognition (L2C2), Centre National de la Recherche Scientifique (CNRS) Bron, France.
Multiplication problems involving large numbers (e.g., 9 × 8) are more difficult to solve than problems involving small numbers (e.
View Article and Find Full Text PDFAnalog and digital FPGA implementation of BRIN for optimization problems.
IEEE Trans Neural Netw
October 2012
Dept. of Syst. Eng. and Eng. Manage., Chinese Univ. of Hong Kong, Shatin, China.
The binary relation inference network (BRIN) shows promise in obtaining the global optimal solution for optimization problem, which is time independent of the problem size. However, the realization of this method is dependent on the implementation platforms. We studied analog and digital FPGA implementation platforms.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!