Objective: Stress is a significant risk factor for various diseases such as hypertension, heart attack, stroke, and even sudden death. Stress can also lead to psychological and behavioral disorders. Heart rate variability (HRV) can reflect changes in stress levels while other physiological factors, like blood pressure, are within acceptable ranges. Electroencephalogram (EEG) is a vital technique for studying brain activities and provides useful data regarding changes in mental status. This study incorporates EEG and a detailed HRV analysis to have a better understanding and analysis of stress. Investigating the correlation between EEG and HRV under stress conditions is valuable since they provide complementary information regarding stress. Methods: Simultaneous electrocardiogram (ECG) and EEG recordings were obtained from fifteen subjects. HRV /EEG features were analyzed and compared in rest, stress, and meditation conditions. A one-way ANOVA and correlation coefficient were used for statistical analysis to explore the correlation between HRV features and features extracted from EEG. Results: The HRV features LF (low frequency), HF (high frequency), LF/HF, and rMSSD (root mean square of the successive differences) correlated with EEG features, including alpha power band in the left hemisphere and alpha band power asymmetry. Conclusion: This study demonstrated five significant relationships between EEG and HRV features associated with stress. The ability to use stress-related EEG features in combination with correlated HRV features could help improve detecting stress and monitoring the progress of stress treatments/therapies. The outcomes of this study could enhance the efficiency of stress management technologies such as meditation studies and bio-feedback training.

Abstract. Discrete moment problems with given finite supports and unimodal distributions with known mode, are formulated and used to obtain sharp lower and upper bounds for expectations of higher order convex functions of discrete random variables as well as probabilities of the union of events. The bounds are based on the knowledge of some of the power moments of the random variables involved, or the binomial moments of the number of events which occur. The bounding problems are formulated as LP's and dual feasible basis structure theorems as well as the application of the dual method of linear programming provide us with the results. Applications in PERT and reliability are presented.Mathematics subject classification (2000): 60E15, 90B15, 90B25, 90C05.

The African American Study of Kidney Disease and Hypertension (AASK), a randomized double-blinded treatment trial, was motivated by the high rate of hypertension-related renal disease in the African-American population and the scarcity of effective therapies. This study describes a pattern-based classification approach to predict the rate of decline of kidney function using surface-enhanced laser desorption ionization/time of flight proteomic data from rapid and slow progressors classified by rate of change in glomerular filtration rate. An accurate classification model consisting of 7 out of 5,751 serum proteomic features is constructed by applying the logical analysis of data (LAD) methodology. On cross-validation by 10-folding, the model was shown to have an accuracy of 80.6 ± 0.11%, sensitivity of 78.4 ± 0.17%, and specificity of 78.5 ± 0.16%. The LAD discriminant is used to identify the patients in different risk groups. The LAD risk scores assigned to 116 AASK patients generated a receiver operating curves curve with AUC 0.899 (CI 0.845–0.953) and outperforms the risk scores assigned by proteinuria, one of the best predictors of chronic kidney disease progression.

This paper concerns classification by Boolean functions. We investigate the classification accuracy obtained by standard classification techniques on unseen points (elements of the domain, {0, 1}n, for some n) that are similar, in particular senses, to the points that have been observed as training observations. Explicitly, we use a new measure of how similar a point x ∈ {0, 1}n is to a set of such points to restrict the domain of points on which we offer a classification. For points sufficiently dissimilar, no classification is given. We report on experimental results which indicate that the classification accuracies obtained on the resulting restricted domains are better than those obtained without restriction. These experiments involve a number of standard data-sets and classification techniques. We also compare the classification accuracies with those obtained by restricting the domain on which classification is given by using the Hamming distance.