Results 281 to 290 of about 52,467,368 (351)
Some of the next articles are maybe not open access.

Remarks on Parallel Analysis

Multivariate Behavioral Research, 1992
We investigate parallel analysis (PA), a selection rule for the number-of-factors problem, from the point of view of permutation assessment. The idea of applying permutation test ideas to PA leads to a quasi-inferential, non-parametric version of PA which accounts not only for finite-sample bias but sampling variability as well.
A, Buja, N, Eyuboglu
openaire   +2 more sources

Determining the number of factors using parallel analysis and its recent variants.

Psychological methods, 2019
Parallel analysis (PA) is recommended as one of the best procedures to determine the number of factors but its theoretical justification has long been questioned. The current study discussed theoretical issues on the use of eigenvalues for dimensionality
Sangdon Lim, Seungmin Jahng
semanticscholar   +1 more source

Parallel analysis with categorical variables: Impact of category probability proportions on dimensionality assessment accuracy.

Psychological methods, 2019
Parallel analysis (PA) is regarded as one of the most accurate methods to determine the number of factors underlying a set of variables. Commonly, PA is performed on the basis of the variables' product-moment correlation matrix. To improve dimensionality
Dirk Lubbe
semanticscholar   +1 more source

Parallel automatic adaptive analysis

Parallel Computing, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Shephard   +5 more
openaire   +4 more sources

Analysis of Parallel Graph Applications [PDF]

open access: possible2024 IEEE 30th International Conference on Parallel and Distributed Systems (ICPADS)
Despite the increasing computing power of shared memory systems with high core counts, parallel graph processing frameworks cannot exploit it effectively. The reason behind this is the inherent challenges in parallel graph algorithms, which are efficient management of dynamically created tasks and irregular data access patterns.
Atik, Funda   +4 more
openaire   +2 more sources

Interprocedural analysis for parallelization

1996
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates a comprehensive and integrated collection of analyses, including privatization and reduction recognition for both array and scalar variables, and symbolic analysis of array ...
Mary W. Hall   +4 more
openaire   +1 more source

Symbolic analysis for parallelizing compilers

ACM Transactions on Programming Languages and Systems, 1996
The notion of dependence captures that most important properties of a program for efficient execution on parallel computers. The dependence structure of a program defines that necessary constraints of the order of execution of the program components and provides sufficient information for the exploitation of the available parallelism.
Mohammad R. Haghighat   +1 more
openaire   +2 more sources

Pretest with Caution: Event-Study Estimates after Testing for Parallel Trends

American Economic Review: Insights, 2022
This paper discusses two important limitations of the common practice of testing for preexisting differences in trends (“ pre-trends”) when using difference-in-differences and related methods.
Jon Roth
semanticscholar   +1 more source

Analysis of parallel beam gyroscope

Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), 2003
A parallel beam structure has many significant features, as follows: (i) the tip moves in parallel at the end; (ii) this structure converts a small displacement into a large strain; and (iii) when piling up this structure, each unit doesn't interfere with the other units.
Hiroshi Sato   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy