fNIRS complexity analysis for the assessment of motor imagery and mental arithmetic tasks

Conventional methods for analyzing functional near-infrared spectroscopy (fNIRS) signals primarily focus on characterizing linear dynamics of the underlying metabolic processes. Nevertheless, linear analysis may underrepresent the true physiological processes that fully characterizes the complex and nonlinear metabolic activity sustaining brain function. Although there have been recent attempts to characterize nonlinearities in fNIRS signals in various experimental protocols, to our knowledge there has yet to be a study that evaluates the utility of complex characterizations of fNIRS in comparison to standard methods, such as the mean value of hemoglobin. Thus, the aim of this study was to investigate the entropy of hemoglobin concentration time series obtained from fNIRS signals and perform a comparitive analysis with standard mean hemoglobin analysis of functional activation. Publicly available data from 29 subjects performing motor imagery and mental arithmetics tasks were exploited for the purpose of this study. The experimental results show that entropy analysis on fNIRS signals may potentially uncover meaningful activation areas that enrich and complement the set identified through a traditional linear analysis

Mental Workload Detection Based on EEG Analysis

The study of mental workload becomes essential for human work efficiency, health conditions and to avoid accidents, since workload compromises both performance and awareness. Although workload has been widely studied using several physiological measures, minimising the sensor network as much as possible remains both a challenge and a requirement. Electroencephalogram (EEG) signals have shown a high correlation to specific cognitive and mental states like workload. However, there is not enough evidence in the literature to validate how well models generalize in case of new subjects performing tasks of a workload similar to the ones included during model's training. In this paper we propose a binary neural network to classify EEG features across different mental workloads. Two workloads, low and medium, are induced using two variants of the N-Back Test. The proposed model was validated in a dataset collected from 16 subjects and shown a high level of generalization capability: model reported an average recall of 81.81% in a leave-one-out subject evaluation

Chaotic Compilation for Encrypted Computing: Obfuscation but Not in Name

An `obfuscation' for encrypted computing is quantified exactly here, leading to an argument that security against polynomial-time attacks has been achieved for user data via the deliberately `chaotic' compilation required for security properties in that environment. Encrypted computing is the emerging science and technology of processors that take encrypted inputs to encrypted outputs via encrypted intermediate values (at nearly conventional speeds). The aim is to make user data in general-purpose computing secure against the operator and operating system as potential adversaries. A stumbling block has always been that memory addresses are data and good encryption means the encrypted value varies randomly, and that makes hitting any target in memory problematic without address decryption, yet decryption anywhere on the memory path would open up many easily exploitable vulnerabilities. This paper `solves (chaotic) compilation' for processors without address decryption, covering all of ANSI C while satisfying the required security properties and opening up the field for the standard software tool-chain and infrastructure. That produces the argument referred to above, which may also hold without encryption.Comment: 31 pages. Version update adds "Chaotic" in title and throughout paper, and recasts abstract and Intro and other sections of the text for better access by cryptologists. To the same end it introduces the polynomial time defense argument explicitly in the final section, having now set that denouement out in the abstract and intr

A morphospace of functional configuration to assess configural breadth based on brain functional networks

The best approach to quantify human brain functional reconfigurations in response to varying cognitive demands remains an unresolved topic in network neuroscience. We propose that such functional reconfigurations may be categorized into three different types: i) Network Configural Breadth, ii) Task-to-Task transitional reconfiguration, and iii) Within-Task reconfiguration. In order to quantify these reconfigurations, we propose a mesoscopic framework focused on functional networks (FNs) or communities. To do so, we introduce a 2D network morphospace that relies on two novel mesoscopic metrics, Trapping Efficiency (TE) and Exit Entropy (EE), which capture topology and integration of information within and between a reference set of FNs. In this study, we use this framework to quantify the Network Configural Breadth across different tasks. We show that the metrics defining this morphospace can differentiate FNs, cognitive tasks and subjects. We also show that network configural breadth significantly predicts behavioral measures, such as episodic memory, verbal episodic memory, fluid intelligence and general intelligence. In essence, we put forth a framework to explore the cognitive space in a comprehensive manner, for each individual separately, and at different levels of granularity. This tool that can also quantify the FN reconfigurations that result from the brain switching between mental states.Comment: main article: 24 pages, 8 figures, 2 tables. supporting information: 11 pages, 5 figure

An EEG-based attention recognition method: fusion of time domain, frequency domain, and non-linear dynamics features

IntroductionAttention is a complex cognitive function of human brain that plays a vital role in our daily lives. Electroencephalogram (EEG) is used to measure and analyze attention due to its high temporal resolution. Although several attention recognition brain-computer interfaces (BCIs) have been proposed, there is a scarcity of studies with a sufficient number of subjects, valid paradigms, and reliable recognition analysis across subjects.MethodsIn this study, we proposed a novel attention paradigm and feature fusion method to extract features, which fused time domain features, frequency domain features and nonlinear dynamics features. We then constructed an attention recognition framework for 85 subjects.Results and discussionWe achieved an intra-subject average classification accuracy of 85.05% ± 6.87% and an inter-subject average classification accuracy of 81.60% ± 9.93%, respectively. We further explored the neural patterns in attention recognition, where attention states showed less activation than non-attention states in the prefrontal and occipital areas in α, β and θ bands. The research explores, for the first time, the fusion of time domain features, frequency domain features and nonlinear dynamics features for attention recognition, providing a new understanding of attention recognition