Background: The eating behavior of children is important to maintain a healthy weight. This current study explored the differences in children’s eating behaviors and their relation to weight status and maternal education level, using the child eating behavior questionnaire (CEBQ). Methods: The study recruited 169 participants aged between six and ten years. Multinomial logistic regression was conducted to examine the association between the CEBQ factors and children’s body weight status. The association between the CEBQ scores and maternal educational levels was examined using a one-way analysis of variance (ANOVA). Results: The multinomial logistic regression findings indicate that children in the obese group exhibited a significant increase in food responsiveness, enjoyment of food, emotional overeating, and a decrease in satiety responsiveness compared to normal weight children. The one-way ANOVA showed a significant difference in subscales under the food approach (food responsiveness, desire to drink, emotional overeating) and food avoidance (satiety responsiveness) based upon the child’s weight status. The three subscales under the food approach category were significantly dependent upon the maternal education but did not have a significant association with food avoidance. Conclusions: The results suggest that the increase in food responsiveness and emotional overeating in obese children is influenced by maternal education.

Computer science (CS) is a rapidly evolving field of knowledge with a significant volume and significance of scientific papers. Consequently, meticulous management and categorization of CS papers are crucial to ensure efficient access and retrieval of relevant information. This study aims to evaluate the effectiveness of eight traditional machine learning models, as well as Recurrent Neural Network (RNN) models, such as LSTM and BiLSTM, and state-of-the-art pre-trained self-attention-based natural language processing (NLP) models, including BERT, XLNet, RoBERTa, and DistilBERT, for the task of multi-label classification of arXiv CS paper classification. The results demonstrate that pre-trained self-attention-based models consistently outperform the other models regarding classification performance. Moreover, self-attention-based models exhibited superior performance and achieved a new state-of-the-art result. To the best of our knowledge, our paper represents the first endeavor to evaluate machine learning models, specifically on computer science-related documents, as part of a multi-label classification task.

Modern Hopfield networks are energy-based associative memory models whose performance critically depends on the structure and optimization of their energy functions. While recent formulations substantially improve storage capacity, the resulting non-convex energy landscapes are often optimized using heuristic update rules that can be sensitive to initialization and may not provide monotonic energy descent or rigorous convergence guarantees. In this work, we propose a new energy formulation for modern Hopfield networks together with a principled iterative optimization scheme. The proposed energy admits a natural decomposition that allows optimization via the concave–convex procedure (CCCP), yielding well-defined network dynamics with guaranteed energy descent beyond classical Hopfield updates. We establish fundamental theoretical properties of the proposed framework, including non-negativity, boundedness, and monotonic decrease in the energy along iterations. In particular, we prove that the induced dynamics converge to a stationary point of the energy function, providing explicit convergence guarantees for the resulting Hopfield-type model. We further evaluate the proposed approach on synthetic classification tasks and compare its optimization behavior with that of the original Hopfield network and several standard machine learning baselines. Experimental results demonstrate improved stability, convergence behavior, and competitive classification performance. We also validate the approach on real-world benchmark datasets to demonstrate utility beyond controlled experiments. Overall, this work provides a theoretically grounded energy-based optimization framework for modern Hopfield networks, clarifying the role of principled optimization in achieving stable and convergent associative memory dynamics.

Explainable intrusion detection systems often provide feature attributions without indicating whether a security action should be released, downgraded, or deferred. This paper investigates whether action-governed explanations can provide bounded triage evidence under traffic feature feasibility constraints. We present TRACE, a framework that maps calibrated detector outputs to a finite action ladder, constructs conformal action sets, selects actions via a utility-minimax rule, and releases high-severity actions only when compact support contracts remain stable under feasible perturbations, where feasibility is a property of the processed benchmark features and not of packet-level realizability. Ablations isolate the conformal set and release gate as the primary drivers of system behavior. Across 11 gated dataset–model pairs, TRACE produces non-degenerate action sets with zero full-set collapse and defer/block rates from 0.603 to 1.000. Under held-out sample split tuning, it achieves higher average proxy utility than unconditional release and release rate-matched random release on all 11 pairs. Against the strongest simple selective gate, however, it matches on 6 of 11 pairs and trails on the remaining 5. Robustness sweeps confirm positive all-row utility on all pairs, though pass-only utility becomes fragile in ultra-low-release regimes. Unlike display-only attribution summaries, the TRACE contract records the plausible action set, feasibility checks, stability summaries, and an explicit release rationale. The results support TRACE as a bounded evidentiary framework for action-governed XAI in IDS, rather than claiming superiority over all IDS/XAI methods or general deployment readiness.