Arya Teymourlouei
Arya Teymourlouei has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- James A. Reggia
College of Computer, Mathematical and Natural Sciences, University of Maryland, College Park, MD, 20742, USA
2 shared publications - Rodolphe J. Gentili
Department of Kinesiology, School of Public Health, University of Maryland, College Park, MD, United States of America
2 shared publications - Anna L Packy
College Park
1 shared publication - Garrett E. Katz
Syracuse University
1 shared publication - Hyuk Oh
Department of Kinesiology, School of Public Health, University of Maryland, College Park, MD, United States of America
1 shared publication - James Purtilo
College Park
1 shared publication
Latest Publications
- Open Access
- 8 September 2026
- Published by IOP Publishing in Journal of Neural Engineering
- Vol. 23 (5) , 056011
Examination of neurocognitive processes during execution of sequential problem-solving tasks under varying demand
Objective . There exists a limited body of work that has jointly assessed behavioral performance and mental workload during the execution of sequential tasks. However, none of this work has jointly assessed performance and neurocognitive dynamics during the execution of problem-solving tasks having multiple solutions similar to real-world settings across different levels of cognitive demand. Additionally, only limited efforts have quantified an individual’s performance using measures which constitute distinct aspects of cognitive-motor performance. Approach . Therefore, we extend a prior effort to assess performance through a computational approach to obtain the optimality stratified similarity degree metric (OSSD) through two different measures of performance (i.e. optimality and similarity). These performance measures along with brain dynamics captured through electroencephalography spectral power measures were combinedly assessed to determine their impact on neural efficiency. The recorded measures allowed the stratification of performance into distinct optimality tiers within which unique differences between sequences structured by individuals were captured by the similarity metric. In addition to a traditional population-based analysis, this approach led to the clustering of the best and worst performers, thus allowing one to evaluate cortical dynamics between groups of individuals. Main results . The main findings of the study were that enhanced levels of task demand caused a degraded performance (i.e. decreased optimality, similarity and OSSD) along with a greater recruitment of neurocognitive processes (i.e. whole scalp increase of theta and low/high-alpha power; frontal, central, and temporal low/high-beta and gamma power increase), ultimately leading to an attenuation of neural efficiency. The cluster-based analysis between the best versus worst performers revealed that temporal low/high beta and gamma power as well as central gamma power was greater for the former relative to the latter. Significance . This work has the potential to inform the neurocognitive processes underlying the performance of complex sequential problem-solving tasks in various industrial, occupational, military, and healthcare applications.
- 8 September 2026
- Published by IOP Publishing in Journal of Neural Engineering
- Vol. 23 (5) , 056011
Open AccessExamination of neurocognitive processes during execution of sequential problem-solving tasks under varying demand
Objective . There exists a limited body of work that has jointly assessed behavioral performance and mental workload during the execution of sequential tasks. However, none of this work has jointly assessed performance and neurocognitive dynamics during the execution of problem-solving tasks having multiple solutions similar to real-world settings across different levels of cognitive demand. Additionally, only limited efforts have quantified an individual’s performance using measures which constitute distinct aspects of cognitive-motor performance. Approach . Therefore, we extend a prior effort to assess performance through a computational approach to obtain the optimality stratified similarity degree metric (OSSD) through two different measures of performance (i.e. optimality and similarity). These performance measures along with brain dynamics captured through electroencephalography spectral power measures were combinedly assessed to determine their impact on neural efficiency. The recorded measures allowed the stratification of performance into distinct optimality tiers within which unique differences between sequences structured by individuals were captured by the similarity metric. In addition to a traditional population-based analysis, this approach led to the clustering of the best and worst performers, thus allowing one to evaluate cortical dynamics between groups of individuals. Main results . The main findings of the study were that enhanced levels of task demand caused a degraded performance (i.e. decreased optimality, similarity and OSSD) along with a greater recruitment of neurocognitive processes (i.e. whole scalp increase of theta and low/high-alpha power; frontal, central, and temporal low/high-beta and gamma power increase), ultimately leading to an attenuation of neural efficiency. The cluster-based analysis between the best versus worst performers revealed that temporal low/high beta and gamma power as well as central gamma power was greater for the former relative to the latter. Significance . This work has the potential to inform the neurocognitive processes underlying the performance of complex sequential problem-solving tasks in various industrial, occupational, military, and healthcare applications.
- Open Access
- 1 June 2025
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 6 (2) , 025012
Assessing the interactions between time series signals using weighted horizontal visibility graphs
The visibility graph algorithm is used to map recorded time series signals to complex networks. Individual timepoints are treated as nodes, and edges are formed by some criterion of visibility between data points. Comparing two visibility graphs can facilitate assessment of the strength of interactions between the associated signals. Two existing methods for this purpose include (1) the average share of overlapping edges (average layer entanglement) between the visibility graphs and (2) the normalized mutual information (MI) between the degree distributions of the two visibility graphs. However, these methods do not always capture the full extent of interactions in some networks. Here we introduce a new approach, the community similarity score, which assesses the similarity between the structure of the communities in the visibility graphs. A community is a subset of the network where nodes are strongly connected to each other, but weakly connected to other communities. The results suggested that the community similarity score generally provided an improvement over normalized MI and average layer entanglement, achieving results that compare well to established time- and frequency-domain methods. When applied to an electroencephalography dataset, the community similarity score produced results consistent with prior literature and was robust to noise. These results suggest that our approach may provide new insights into the dynamics of complex systems and potentially serve as features in machine learning pipelines.
- 1 June 2025
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 6 (2) , 025012
Open AccessAssessing the interactions between time series signals using weighted horizontal visibility graphs
The visibility graph algorithm is used to map recorded time series signals to complex networks. Individual timepoints are treated as nodes, and edges are formed by some criterion of visibility between data points. Comparing two visibility graphs can facilitate assessment of the strength of interactions between the associated signals. Two existing methods for this purpose include (1) the average share of overlapping edges (average layer entanglement) between the visibility graphs and (2) the normalized mutual information (MI) between the degree distributions of the two visibility graphs. However, these methods do not always capture the full extent of interactions in some networks. Here we introduce a new approach, the community similarity score, which assesses the similarity between the structure of the communities in the visibility graphs. A community is a subset of the network where nodes are strongly connected to each other, but weakly connected to other communities. The results suggested that the community similarity score generally provided an improvement over normalized MI and average layer entanglement, achieving results that compare well to established time- and frequency-domain methods. When applied to an electroencephalography dataset, the community similarity score produced results consistent with prior literature and was robust to noise. These results suggest that our approach may provide new insights into the dynamics of complex systems and potentially serve as features in machine learning pipelines.