Classification Approach for Attention Assessment via Singular Spectrum Analysis Based on Single-Channel Electroencephalograms.

Attention refers to the human psychological ability to focus on doing an activity. The attention assessment plays an important role in diagnosing attention deficit hyperactivity disorder (ADHD). In this paper, the attention assessment is performed via a classification approach. First, the single-channel electroencephalograms (EEGs) are acquired from various participants when they perform various activities. Then, fast Fourier transform (FFT) is applied to the acquired EEGs, and the high-frequency components are discarded for performing denoising. Next, empirical mode decomposition (EMD) is applied to remove the underlying trend of the signals. In order to extract more features, singular spectrum analysis (SSA) is employed to increase the total number of the components. Finally, some typical models such as the random forest-based classifier, the support vector machine (SVM)-based classifier, and the back-propagation (BP) neural network-based classifier are used for performing the classifications. Here, the percentages of the classification accuracies are employed as the attention scores. The computer numerical simulation results show that our proposed method yields a higher classification performance compared to the traditional methods without performing the EMD and SSA.

Nonconvex integer optimal robust impulsive control strategy for first-order piecewise finite precision nonlinear random early detection algorithm.

There are two main contributions of this paper. First, this paper proposes a first-order piecewise finite precision nonlinear dynamical model for characterizing the average queue size of the random early detection (RED) algorithm. Second, this paper proposes a nonconvex integer optimal robust impulsive control strategy for stabilizing the average queue size. The objective of the control strategy is to determine the average queue size so that the average power of the impulsive control force is minimized subject to a constraint on the absolute difference between the actual average queue size and the theoretical average queue size at the equilibrium point. Computer numerical simulation results show that the proposed control strategy is effective and efficient for stabilizing the average queue size.

Invariant set of weight of perceptron trained by perceptron training algorithm.

In this paper, an invariant set of the weight of the perceptron trained by the perceptron training algorithm is defined and characterized. The dynamic range of the steady-state values of the weight of the perceptron can be evaluated by finding the dynamic range of the weight of the perceptron inside the largest invariant set. In addition, the necessary and sufficient condition for the forward dynamics of the weight of the perceptron to be injective, as well as the condition for the invariant set of the weight of the perceptron to be attractive, is derived.

Global convergence and limit cycle behavior of weights of perceptron.

In this paper, it is found that the weights of a perceptron are bounded for all initial weights if there exists a nonempty set of initial weights that the weights of the perceptron are bounded. Hence, the boundedness condition of the weights of the perceptron is independent of the initial weights. Also, a necessary and sufficient condition for the weights of the perceptron exhibiting a limit cycle behavior is derived. The range of the number of updates for the weights of the perceptron required to reach the limit cycle is estimated. Finally, it is suggested that the perceptron exhibiting the limit cycle behavior can be employed for solving a recognition problem when downsampled sets of bounded training feature vectors are linearly separable. Numerical computer simulation results show that the perceptron exhibiting the limit cycle behavior can achieve a better recognition performance compared to a multilayer perceptron.