Alzheimer's disease (AD) is a frequently observed, irreversible brain function disorder among elderly individuals. Resting-state functional magnetic resonance imaging (rs-fMRI) has been introduced as an alternative approach to assessing brain functional abnormalities in AD patients. However, alterations in the brain rs-fMRI signal complexities in mild cognitive impairment (MCI) and AD patients remain unclear. Here, we described the novel application of permutation entropy (PE) to investigate the abnormal complexity of rs-fMRI signals in MCI and AD patients. The rs-fMRI signals of 30 normal controls (NCs), 33 early MCI (EMCI), 32 late MCI (LMCI), and 29 AD patients were obtained from the Alzheimer's disease Neuroimaging Initiative (ADNI) database. After preprocessing, whole-brain entropy maps of the four groups were extracted and subjected to Gaussian smoothing. We performed a one-way analysis of variance (ANOVA) on the brain entropy maps of the four groups. The results after adjusting for age and sex differences together revealed that the patients with AD exhibited lower complexity than did the MCI and NC controls. We found five clusters that exhibited significant differences and were distributed primarily in the occipital, frontal, and temporal lobes. The average PE of the five clusters exhibited a decreasing trend from MCI to AD. The AD group exhibited the least complexity. Additionally, the average PE of the five clusters was significantly positively correlated with the Mini-Mental State Examination (MMSE) scores and significantly negatively correlated with Functional Assessment Questionnaire (FAQ) scores and global Clinical Dementia Rating (CDR) scores in the patient groups. Significant correlations were also found between the PE and regional homogeneity (ReHo) in the patient groups. These results indicated that declines in PE might be related to changes in regional functional homogeneity in AD. These findings suggested that complexity analyses using PE in rs-fMRI signals can provide important information about the fMRI characteristics of cognitive impairments in MCI and AD.

No abstract

This paper is concerned with a new data-driven zero-sum neuro-optimal control problem for continuous-time unknown nonlinear systems with disturbance. According to the input-output data of the nonlinear system, an effective recurrent neural network is introduced to reconstruct the dynamics of the nonlinear system. Considering the system disturbance as a control input, a two-player zero-sum optimal control problem is established. Adaptive dynamic programming (ADP) is developed to obtain the optimal control under the worst case of the disturbance. Three single-layer neural networks, including one critic and two action networks, are employed to approximate the performance index function, the optimal control law, and the disturbance, respectively, for facilitating the implementation of the ADP method. Convergence properties of the ADP method are developed to show that the system state will converge to a finite neighborhood of the equilibrium. The weight matrices of the critic and the two action networks are also convergent to finite neighborhoods of their optimal ones. Finally, the simulation results will show the effectiveness of the developed data-driven ADP methods.

In this paper, a novel discrete-time deterministic Q -learning algorithm is developed. In each iteration of the developed Q -learning algorithm, the iterative Q function is updated for all the state and control spaces, instead of updating for a single state and a single control in traditional Q -learning algorithm. A new convergence criterion is established to guarantee that the iterative Q function converges to the optimum, where the convergence criterion of the learning rates for traditional Q -learning algorithms is simplified. During the convergence analysis, the upper and lower bounds of the iterative Q function are analyzed to obtain the convergence criterion, instead of analyzing the iterative Q function itself. For convenience of analysis, the convergence properties for undiscounted case of the deterministic Q -learning algorithm are first developed. Then, considering the discounted factor, the convergence criterion for the discounted case is established. Neural networks are used to approximate the iterative Q function and compute the iterative control law, respectively, for facilitating the implementation of the deterministic Q -learning algorithm. Finally, simulation results and comparisons are given to illustrate the performance of the developed algorithm.